Sat Aug 21 19:15:58 UTC 2021 I: starting to build acl2/bullseye/arm64 on jenkins on '2021-08-21 19:15' Sat Aug 21 19:15:58 UTC 2021 I: The jenkins build log is/was available at https://jenkins.debian.net/userContent/reproducible/debian/build_service/arm64_11/22574/console.log Sat Aug 21 19:15:58 UTC 2021 I: Downloading source for bullseye/acl2=8.3dfsg-2 --2021-08-21 19:15:58-- http://cdn-fastly.deb.debian.org/debian/pool/main/a/acl2/acl2_8.3dfsg-2.dsc Connecting to 78.137.99.97:3128... connected. Proxy request sent, awaiting response... 200 OK Length: 2275 (2.2K) Saving to: ‘acl2_8.3dfsg-2.dsc’ 0K .. 100% 171M=0s 2021-08-21 19:15:58 (171 MB/s) - ‘acl2_8.3dfsg-2.dsc’ saved [2275/2275] Sat Aug 21 19:15:58 UTC 2021 I: acl2_8.3dfsg-2.dsc -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA256 Format: 3.0 (quilt) Source: acl2 Binary: acl2, acl2-source, acl2-emacs, acl2-infix, acl2-infix-source, acl2-books, acl2-books-source, acl2-books-certs, acl2-doc Architecture: any all Version: 8.3dfsg-2 Maintainer: Camm Maguire Standards-Version: 4.5.0 Build-Depends: debhelper-compat (= 13), gcl (>= 2.6.12-92), libgmp3-dev, libreadline-dev, emacs-gtk | emacsen, debhelper (>= 5), texlive-latex-recommended, libxmu-dev, libxaw7-dev, time, tex-common, texinfo 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-emacs deb math 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 Checksums-Sha1: 7853ff0012ff1c265599756cf943691d3a05c4fb 117260902 acl2_8.3dfsg.orig.tar.gz 219e80581240312ef37d92e277c83b2ab4285154 228320 acl2_8.3dfsg-2.debian.tar.xz Checksums-Sha256: e7322a6e842f862ae25a65cda43040828fe0ded725f4c45bcb04ae07ae492aee 117260902 acl2_8.3dfsg.orig.tar.gz 7e1c8ad06e8be538da2c5d4728ddfa37d6b04b8d6da857c05111e67b4980d705 228320 acl2_8.3dfsg-2.debian.tar.xz Files: c7205f24ed678a7a20282a95e3173fb8 117260902 acl2_8.3dfsg.orig.tar.gz d393ca4df461a7bbb2b7dfa8fcb8a8c2 228320 acl2_8.3dfsg-2.debian.tar.xz -----BEGIN PGP SIGNATURE----- iQIzBAEBCAAdFiEE/iFPNjaXdzJC6BbsuEXOUQ+bcU0FAmARdwIACgkQuEXOUQ+b cU1Y2A/+P5A4ebluUOin0IP0xD3kLSR6PhF4CsrLUG1fvSRBYaNL/L2WGb96P9bQ 4SgBlxt0ciasG2OHBXtiWvq4LMzlfbsqk0D+BLx95sZo1z5zxuFeQKK8BRfKbXC6 gNJxTIJC/MHsSb1tLTN0jl+rqdVQwdMKyJBj5HaioNyernEcoLv77YVBK39vLnlw oF/m5Pem15K9yjN2mfP0o41KyMcVpkjTW4hXp/I6rKbaXjOZHpK2tYvS9KYhfOfr UxgSG0eDiBNOgmauPGyK/6PwlgU2N0y8xcL8ZBhu3lwTg9N01gHxQPtzjVEGOpuv vM4llO0s+SwEWjt2KiCQ8GbWHPbuF4uVPI3sKls8Lmb/gE2vCPGX113eXybmYn6Q hrJsCttkhWCN9Bf1uwrGGj2/ppZ8lqq4GXEn8QNUyGGj44Oew9o6sucIpB8gv5St 8GoKHH7+fgM92h3XKtUUytDvq0ON3AqY1XuJcgoHj91jmmzH2HBLcOvcrKaZr4cB eWJHBToXPKa3Zc3ryYaKNFI0Au8AU0plHuEEL/EieTx4HKHoo8gBeZgV4GE/zgBp 0mATgGKARrf3o/IgQ5xL2nUfRkRtW0kqXnapwyeUav555zP7mt5K7WRmIawzKOXX HBezc47CDFOa1J4o3cp9pCVRLbzba9GmpoO/NwMUcJnguLeZVRg= =gziy -----END PGP SIGNATURE----- Sat Aug 21 19:15:58 UTC 2021 I: Checking whether the package is not for us Sat Aug 21 19:15:58 UTC 2021 I: Starting 1st build on remote node codethink11-arm64.debian.net. Sat Aug 21 19:15:58 UTC 2021 I: Preparing to do remote build '1' on codethink11-arm64.debian.net. Sun Aug 22 13:16:14 UTC 2021 I: Deleting $TMPDIR on codethink11-arm64.debian.net. I: pbuilder: network access will be disabled during build I: Current time: Fri Sep 23 13:39:11 -12 2022 I: pbuilder-time-stamp: 1663983551 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/bullseye-reproducible-base.tgz] I: copying local configuration 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.3dfsg-2.dsc] I: copying [./acl2_8.3dfsg.orig.tar.gz] I: copying [./acl2_8.3dfsg-2.debian.tar.xz] I: Extracting source gpgv: unknown type of key resource 'trustedkeys.kbx' gpgv: keyblock resource '/tmp/dpkg-verify-sig.kp3Un01v/trustedkeys.kbx': General error gpgv: Signature made Wed Jan 27 02:21:54 2021 -12 gpgv: using RSA key FE214F363697773242E816ECB845CE510F9B714D gpgv: Can't check signature: No public key dpkg-source: warning: failed to verify signature on ./acl2_8.3dfsg-2.dsc dpkg-source: info: extracting acl2 in acl2-8.3dfsg dpkg-source: info: unpacking acl2_8.3dfsg.orig.tar.gz dpkg-source: info: unpacking acl2_8.3dfsg-2.debian.tar.xz dpkg-source: info: using patch list from debian/patches/series dpkg-source: info: applying remove-pcert-elementary-bounders-for-final-file dpkg-source: info: applying remove-pcert-local-elided-for-final-file dpkg-source: info: applying do-not-pre-allocate-contiguous-blocks1-in-acl2.lisp dpkg-source: info: applying compile_with_split_files dpkg-source: info: applying UTF-8-encoding dpkg-source: info: applying remove-w3-validation-badge I: using fakeroot in build. I: Installing the build-deps I: user script /srv/workspace/pbuilder/32729/tmp/hooks/D02_print_environment starting I: set BUILDDIR='/build' BUILDUSERGECOS='first user,first room,first work-phone,first home-phone,first other' BUILDUSERNAME='pbuilder1' BUILD_ARCH='arm64' DEBIAN_FRONTEND='noninteractive' DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all,-fixfilepath parallel=8' DISTRIBUTION='' HOME='/var/lib/jenkins' HOST_ARCH='arm64' IFS=' ' 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='32729' 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/tmp.UCMnoX0QRd/pbuilderrc_L85M --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/bullseye-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/tmp.UCMnoX0QRd/b1 --logfile b1/build.log acl2_8.3dfsg-2.dsc' SUDO_GID='117' SUDO_UID='110' SUDO_USER='jenkins' TERM='unknown' TZ='/usr/share/zoneinfo/Etc/GMT+12' USER='root' USERNAME='root' _='/usr/bin/systemd-run' http_proxy='http://192.168.101.16:3128' I: uname -a Linux codethink11-arm64 4.15.0-154-generic #161-Ubuntu SMP Fri Jul 30 13:01:15 UTC 2021 aarch64 GNU/Linux I: ls -l /bin total 5252 -rwxr-xr-x 1 root root 1282512 Aug 4 2021 bash -rwxr-xr-x 3 root root 34808 Jul 20 2020 bunzip2 -rwxr-xr-x 3 root root 34808 Jul 20 2020 bzcat lrwxrwxrwx 1 root root 6 Jul 20 2020 bzcmp -> bzdiff -rwxr-xr-x 1 root root 2225 Jul 20 2020 bzdiff lrwxrwxrwx 1 root root 6 Jul 20 2020 bzegrep -> bzgrep -rwxr-xr-x 1 root root 4877 Sep 4 2019 bzexe lrwxrwxrwx 1 root root 6 Jul 20 2020 bzfgrep -> bzgrep -rwxr-xr-x 1 root root 3775 Jul 20 2020 bzgrep -rwxr-xr-x 3 root root 34808 Jul 20 2020 bzip2 -rwxr-xr-x 1 root root 14264 Jul 20 2020 bzip2recover lrwxrwxrwx 1 root root 6 Jul 20 2020 bzless -> bzmore -rwxr-xr-x 1 root root 1297 Jul 20 2020 bzmore -rwxr-xr-x 1 root root 39832 Sep 22 2020 cat -rwxr-xr-x 1 root root 64512 Sep 22 2020 chgrp -rwxr-xr-x 1 root root 60368 Sep 22 2020 chmod -rwxr-xr-x 1 root root 64528 Sep 22 2020 chown -rwxr-xr-x 1 root root 138896 Sep 22 2020 cp -rwxr-xr-x 1 root root 129544 Dec 10 2020 dash -rwxr-xr-x 1 root root 101384 Sep 22 2020 date -rwxr-xr-x 1 root root 80984 Sep 22 2020 dd -rwxr-xr-x 1 root root 89824 Sep 22 2020 df -rwxr-xr-x 1 root root 143088 Sep 22 2020 dir -rwxr-xr-x 1 root root 76152 Jul 28 2021 dmesg lrwxrwxrwx 1 root root 8 Nov 6 2019 dnsdomainname -> hostname lrwxrwxrwx 1 root root 8 Nov 6 2019 domainname -> hostname -rwxr-xr-x 1 root root 35632 Sep 22 2020 echo -rwxr-xr-x 1 root root 28 Nov 9 2020 egrep -rwxr-xr-x 1 root root 31512 Sep 22 2020 false -rwxr-xr-x 1 root root 28 Nov 9 2020 fgrep -rwxr-xr-x 1 root root 64856 Jul 28 2021 findmnt -rwsr-xr-x 1 root root 34824 Feb 26 2021 fusermount -rwxr-xr-x 1 root root 178400 Nov 9 2020 grep -rwxr-xr-x 2 root root 2346 Mar 2 2021 gunzip -rwxr-xr-x 1 root root 6376 Mar 2 2021 gzexe -rwxr-xr-x 1 root root 93744 Mar 2 2021 gzip -rwxr-xr-x 1 root root 18440 Nov 6 2019 hostname -rwxr-xr-x 1 root root 68720 Sep 22 2020 ln -rwxr-xr-x 1 root root 52720 Feb 7 2020 login -rwxr-xr-x 1 root root 143088 Sep 22 2020 ls -rwxr-xr-x 1 root root 161960 Jul 28 2021 lsblk -rwxr-xr-x 1 root root 85200 Sep 22 2020 mkdir -rwxr-xr-x 1 root root 68744 Sep 22 2020 mknod -rwxr-xr-x 1 root root 43976 Sep 22 2020 mktemp -rwxr-xr-x 1 root root 51368 Jul 28 2021 more -rwsr-xr-x 1 root root 51360 Jul 28 2021 mount -rwxr-xr-x 1 root root 14496 Jul 28 2021 mountpoint -rwxr-xr-x 1 root root 134808 Sep 22 2020 mv lrwxrwxrwx 1 root root 8 Nov 6 2019 nisdomainname -> hostname lrwxrwxrwx 1 root root 14 Apr 18 2021 pidof -> /sbin/killall5 -rwxr-xr-x 1 root root 35720 Sep 22 2020 pwd lrwxrwxrwx 1 root root 4 Aug 4 2021 rbash -> bash -rwxr-xr-x 1 root root 43872 Sep 22 2020 readlink -rwxr-xr-x 1 root root 68592 Sep 22 2020 rm -rwxr-xr-x 1 root root 43880 Sep 22 2020 rmdir -rwxr-xr-x 1 root root 19208 Sep 27 2020 run-parts -rwxr-xr-x 1 root root 114016 Dec 22 2018 sed lrwxrwxrwx 1 root root 4 Sep 23 03:47 sh -> dash -rwxr-xr-x 1 root root 35656 Sep 22 2020 sleep -rwxr-xr-x 1 root root 72640 Sep 22 2020 stty -rwsr-xr-x 1 root root 67776 Jul 28 2021 su -rwxr-xr-x 1 root root 35672 Sep 22 2020 sync -rwxr-xr-x 1 root root 535768 Feb 16 2021 tar -rwxr-xr-x 1 root root 10568 Sep 27 2020 tempfile -rwxr-xr-x 1 root root 89120 Sep 22 2020 touch -rwxr-xr-x 1 root root 31512 Sep 22 2020 true -rwxr-xr-x 1 root root 14264 Feb 26 2021 ulockmgr_server -rwsr-xr-x 1 root root 30880 Jul 28 2021 umount -rwxr-xr-x 1 root root 35640 Sep 22 2020 uname -rwxr-xr-x 2 root root 2346 Mar 2 2021 uncompress -rwxr-xr-x 1 root root 143088 Sep 22 2020 vdir -rwxr-xr-x 1 root root 59584 Jul 28 2021 wdctl lrwxrwxrwx 1 root root 8 Nov 6 2019 ypdomainname -> hostname -rwxr-xr-x 1 root root 1984 Mar 2 2021 zcat -rwxr-xr-x 1 root root 1678 Mar 2 2021 zcmp -rwxr-xr-x 1 root root 5880 Mar 2 2021 zdiff -rwxr-xr-x 1 root root 29 Mar 2 2021 zegrep -rwxr-xr-x 1 root root 29 Mar 2 2021 zfgrep -rwxr-xr-x 1 root root 2081 Mar 2 2021 zforce -rwxr-xr-x 1 root root 7585 Mar 2 2021 zgrep -rwxr-xr-x 1 root root 2206 Mar 2 2021 zless -rwxr-xr-x 1 root root 1842 Mar 2 2021 zmore -rwxr-xr-x 1 root root 4553 Mar 2 2021 znew I: user script /srv/workspace/pbuilder/32729/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: arm64 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.12-92), libgmp3-dev, libreadline-dev, emacs-gtk | emacsen, debhelper (>= 5), texlive-latex-recommended, libxmu-dev, libxaw7-dev, time, tex-common, texinfo dpkg-deb: building package 'pbuilder-satisfydepends-dummy' in '/tmp/satisfydepends-aptitude/pbuilder-satisfydepends-dummy.deb'. Selecting previously unselected package pbuilder-satisfydepends-dummy. (Reading database ... 19646 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.12-92); however: Package gcl is not installed. pbuilder-satisfydepends-dummy depends on libgmp3-dev; however: Package libgmp3-dev is not installed. pbuilder-satisfydepends-dummy depends on libreadline-dev; however: Package libreadline-dev is not installed. pbuilder-satisfydepends-dummy depends on emacs-gtk | emacsen; however: Package emacs-gtk is not installed. Package emacsen is not installed. pbuilder-satisfydepends-dummy depends on debhelper (>= 5); 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 libxmu-dev; however: Package libxmu-dev is not installed. pbuilder-satisfydepends-dummy depends on libxaw7-dev; however: Package libxaw7-dev is not installed. pbuilder-satisfydepends-dummy depends on time; however: Package time is not installed. pbuilder-satisfydepends-dummy depends on tex-common; however: Package tex-common is not installed. pbuilder-satisfydepends-dummy depends on texinfo; however: Package texinfo 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: autoconf{a} automake{a} autopoint{a} autotools-dev{a} bsdextrautils{a} debhelper{a} dh-autoreconf{a} dh-strip-nondeterminism{a} dwz{a} emacsen-common{a} file{a} fontconfig-config{a} fonts-dejavu-core{a} fonts-lmodern{a} gcl{a} gettext{a} gettext-base{a} groff-base{a} intltool-debian{a} libarchive-zip-perl{a} libbrotli1{a} libbsd0{a} libcairo2{a} libcanna1g{a} libcompfaceg1{a} libdebhelper-perl{a} libdeflate0{a} libelf1{a} libexpat1{a} libfile-stripnondeterminism-perl{a} libfontconfig1{a} libfreetype6{a} libglib2.0-0{a} libgmp-dev{a} libgmp3-dev{a} libgmpxx4ldbl{a} libgpm2{a} libgraphite2-3{a} libharfbuzz0b{a} libice-dev{a} libice6{a} libicu67{a} libjbig0{a} libjpeg62-turbo{a} libkpathsea6{a} libldap-2.4-2{a} libmagic-mgc{a} libmagic1{a} libmd0{a} libncurses-dev{a} libncurses6{a} libpaper-utils{a} libpaper1{a} libpipeline1{a} libpixman-1-0{a} libpng16-16{a} libptexenc1{a} libpthread-stubs0-dev{a} libreadline-dev{a} libreadline8{a} libsasl2-2{a} libsasl2-modules-db{a} libsigsegv2{a} libsm-dev{a} libsm6{a} libsub-override-perl{a} libsynctex2{a} libtcl8.6{a} libteckit0{a} libtexlua53{a} libtext-unidecode-perl{a} libtiff5{a} libtk8.6{a} libtool{a} libuchardet0{a} libwebp6{a} libx11-6{a} libx11-data{a} libx11-dev{a} libxau-dev{a} libxau6{a} libxaw7{a} libxaw7-dev{a} libxcb-render0{a} libxcb-shm0{a} libxcb1{a} libxcb1-dev{a} libxdmcp-dev{a} libxdmcp6{a} libxext-dev{a} libxext6{a} libxft2{a} libxi6{a} libxml-libxml-perl{a} libxml-namespacesupport-perl{a} libxml-sax-base-perl{a} libxml-sax-perl{a} libxml2{a} libxmu-dev{a} libxmu-headers{a} libxmu6{a} libxpm-dev{a} libxpm4{a} libxrender1{a} libxss1{a} libxt-dev{a} libxt6{a} libzzip-0-13{a} m4{a} man-db{a} po-debconf{a} readline-common{a} sensible-utils{a} t1utils{a} tex-common{a} texinfo{a} texlive-base{a} texlive-binaries{a} texlive-latex-base{a} texlive-latex-recommended{a} time{a} ucf{a} x11-common{a} x11proto-core-dev{a} x11proto-dev{a} x11proto-xext-dev{a} xdg-utils{a} xemacs21-basesupport{a} xemacs21-bin{a} xemacs21-mule-canna-wnn{a} xemacs21-mulesupport{a} xemacs21-support{a} xorg-sgml-doctools{a} xtrans-dev{a} The following packages are RECOMMENDED but will NOT be installed: curl dvisvgm libarchive-cpio-perl libfile-mimeinfo-perl libglib2.0-data libldap-common libltdl-dev libmail-sendmail-perl libnet-dbus-perl libsasl2-modules libwww-perl libx11-protocol-perl libxml-sax-expat-perl lmodern lynx shared-mime-info wget x11-utils x11-xserver-utils xdg-user-dirs 0 packages upgraded, 134 newly installed, 0 to remove and 0 not upgraded. Need to get 142 MB of archives. After unpacking 583 MB will be used. Writing extended state information... Get: 1 http://deb.debian.org/debian bullseye/main arm64 bsdextrautils arm64 2.36.1-8 [142 kB] Get: 2 http://deb.debian.org/debian bullseye/main arm64 libuchardet0 arm64 0.0.7-1 [67.9 kB] Get: 3 http://deb.debian.org/debian bullseye/main arm64 groff-base arm64 1.22.4-6 [883 kB] Get: 4 http://deb.debian.org/debian bullseye/main arm64 libpipeline1 arm64 1.5.3-1 [33.0 kB] Get: 5 http://deb.debian.org/debian bullseye/main arm64 man-db arm64 2.9.4-2 [1336 kB] Get: 6 http://deb.debian.org/debian bullseye/main arm64 sensible-utils all 0.0.14 [14.8 kB] Get: 7 http://deb.debian.org/debian bullseye/main arm64 ucf all 3.0043 [74.0 kB] Get: 8 http://deb.debian.org/debian bullseye/main arm64 tex-common all 6.16 [53.7 kB] Get: 9 http://deb.debian.org/debian bullseye/main arm64 readline-common all 8.1-1 [73.7 kB] Get: 10 http://deb.debian.org/debian bullseye/main arm64 libreadline8 arm64 8.1-1 [160 kB] Get: 11 http://deb.debian.org/debian bullseye/main arm64 libmagic-mgc arm64 1:5.39-3 [273 kB] Get: 12 http://deb.debian.org/debian bullseye/main arm64 libmagic1 arm64 1:5.39-3 [121 kB] Get: 13 http://deb.debian.org/debian bullseye/main arm64 file arm64 1:5.39-3 [69.1 kB] Get: 14 http://deb.debian.org/debian bullseye/main arm64 gettext-base arm64 0.21-4 [173 kB] Get: 15 http://deb.debian.org/debian bullseye/main arm64 libsigsegv2 arm64 2.13-1 [34.7 kB] Get: 16 http://deb.debian.org/debian bullseye/main arm64 m4 arm64 1.4.18-5 [199 kB] Get: 17 http://deb.debian.org/debian bullseye/main arm64 autoconf all 2.69-14 [313 kB] Get: 18 http://deb.debian.org/debian bullseye/main arm64 autotools-dev all 20180224.1+nmu1 [77.1 kB] Get: 19 http://deb.debian.org/debian bullseye/main arm64 automake all 1:1.16.3-2 [814 kB] Get: 20 http://deb.debian.org/debian bullseye/main arm64 autopoint all 0.21-4 [510 kB] Get: 21 http://deb.debian.org/debian bullseye/main arm64 libdebhelper-perl all 13.3.4 [189 kB] Get: 22 http://deb.debian.org/debian bullseye/main arm64 libtool all 2.4.6-15 [513 kB] Get: 23 http://deb.debian.org/debian bullseye/main arm64 dh-autoreconf all 20 [17.1 kB] Get: 24 http://deb.debian.org/debian bullseye/main arm64 libarchive-zip-perl all 1.68-1 [104 kB] Get: 25 http://deb.debian.org/debian bullseye/main arm64 libsub-override-perl all 0.09-2 [10.2 kB] Get: 26 http://deb.debian.org/debian bullseye/main arm64 libfile-stripnondeterminism-perl all 1.12.0-1 [26.3 kB] Get: 27 http://deb.debian.org/debian bullseye/main arm64 dh-strip-nondeterminism all 1.12.0-1 [15.4 kB] Get: 28 http://deb.debian.org/debian bullseye/main arm64 libelf1 arm64 0.183-1 [164 kB] Get: 29 http://deb.debian.org/debian bullseye/main arm64 dwz arm64 0.13+20210201-1 [155 kB] Get: 30 http://deb.debian.org/debian bullseye/main arm64 libicu67 arm64 67.1-7 [8467 kB] Get: 31 http://deb.debian.org/debian bullseye/main arm64 libxml2 arm64 2.9.10+dfsg-6.7 [629 kB] Get: 32 http://deb.debian.org/debian bullseye/main arm64 gettext arm64 0.21-4 [1261 kB] Get: 33 http://deb.debian.org/debian bullseye/main arm64 intltool-debian all 0.35.0+20060710.5 [26.8 kB] Get: 34 http://deb.debian.org/debian bullseye/main arm64 po-debconf all 1.0.21+nmu1 [248 kB] Get: 35 http://deb.debian.org/debian bullseye/main arm64 debhelper all 13.3.4 [1049 kB] Get: 36 http://deb.debian.org/debian bullseye/main arm64 emacsen-common all 3.0.4 [19.3 kB] Get: 37 http://deb.debian.org/debian bullseye/main arm64 fonts-dejavu-core all 2.37-2 [1069 kB] Get: 38 http://deb.debian.org/debian bullseye/main arm64 fontconfig-config all 2.13.1-4.2 [281 kB] Get: 39 http://deb.debian.org/debian bullseye/main arm64 fonts-lmodern all 2.004.5-6.1 [4540 kB] Get: 40 http://deb.debian.org/debian bullseye/main arm64 libtcl8.6 arm64 8.6.11+dfsg-1 [964 kB] Get: 41 http://deb.debian.org/debian bullseye/main arm64 libexpat1 arm64 2.2.10-2 [83.1 kB] Get: 42 http://deb.debian.org/debian bullseye/main arm64 libbrotli1 arm64 1.0.9-2+b2 [267 kB] Get: 43 http://deb.debian.org/debian bullseye/main arm64 libpng16-16 arm64 1.6.37-3 [289 kB] Get: 44 http://deb.debian.org/debian bullseye/main arm64 libfreetype6 arm64 2.10.4+dfsg-1 [393 kB] Get: 45 http://deb.debian.org/debian bullseye/main arm64 libfontconfig1 arm64 2.13.1-4.2 [344 kB] Get: 46 http://deb.debian.org/debian bullseye/main arm64 libxau6 arm64 1:1.0.9-1 [19.7 kB] Get: 47 http://deb.debian.org/debian bullseye/main arm64 libmd0 arm64 1.0.3-3 [27.9 kB] Get: 48 http://deb.debian.org/debian bullseye/main arm64 libbsd0 arm64 0.11.3-1 [106 kB] Get: 49 http://deb.debian.org/debian bullseye/main arm64 libxdmcp6 arm64 1:1.1.2-3 [25.4 kB] Get: 50 http://deb.debian.org/debian bullseye/main arm64 libxcb1 arm64 1.14-3 [138 kB] Get: 51 http://deb.debian.org/debian bullseye/main arm64 libx11-data all 2:1.7.2-1 [311 kB] Get: 52 http://deb.debian.org/debian bullseye/main arm64 libx11-6 arm64 2:1.7.2-1 [748 kB] Get: 53 http://deb.debian.org/debian bullseye/main arm64 libxrender1 arm64 1:0.9.10-1 [30.4 kB] Get: 54 http://deb.debian.org/debian bullseye/main arm64 libxft2 arm64 2.3.2-2 [51.3 kB] Get: 55 http://deb.debian.org/debian bullseye/main arm64 libxext6 arm64 2:1.3.3-1.1 [51.6 kB] Get: 56 http://deb.debian.org/debian bullseye/main arm64 x11-common all 1:7.7+22 [252 kB] Get: 57 http://deb.debian.org/debian bullseye/main arm64 libxss1 arm64 1:1.2.3-1 [17.8 kB] Get: 58 http://deb.debian.org/debian bullseye/main arm64 libtk8.6 arm64 8.6.11-2 [738 kB] Get: 59 http://deb.debian.org/debian bullseye/main arm64 xemacs21-support all 21.4.24-9 [4181 kB] Get: 60 http://deb.debian.org/debian bullseye/main arm64 xemacs21-bin arm64 21.4.24-9 [389 kB] Get: 61 http://deb.debian.org/debian bullseye/main arm64 libcanna1g arm64 3.7p3-16 [336 kB] Get: 62 http://deb.debian.org/debian bullseye/main arm64 libcompfaceg1 arm64 1:1.5.2-5+b2 [12.7 kB] Get: 63 http://deb.debian.org/debian bullseye/main arm64 libgpm2 arm64 1.20.7-8 [35.9 kB] Get: 64 http://deb.debian.org/debian bullseye/main arm64 libjpeg62-turbo arm64 1:2.0.6-4 [133 kB] Get: 65 http://deb.debian.org/debian bullseye/main arm64 libsasl2-modules-db arm64 2.1.27+dfsg-2.1 [69.3 kB] Get: 66 http://deb.debian.org/debian bullseye/main arm64 libsasl2-2 arm64 2.1.27+dfsg-2.1 [105 kB] Get: 67 http://deb.debian.org/debian bullseye/main arm64 libldap-2.4-2 arm64 2.4.57+dfsg-3 [222 kB] Get: 68 http://deb.debian.org/debian bullseye/main arm64 libdeflate0 arm64 1.7-1 [47.7 kB] Get: 69 http://deb.debian.org/debian bullseye/main arm64 libjbig0 arm64 2.1-3.1+b2 [27.8 kB] Get: 70 http://deb.debian.org/debian bullseye/main arm64 libwebp6 arm64 0.6.1-2.1 [244 kB] Get: 71 http://deb.debian.org/debian bullseye/main arm64 libtiff5 arm64 4.2.0-1 [276 kB] Get: 72 http://deb.debian.org/debian bullseye/main arm64 libice6 arm64 2:1.0.10-1 [55.6 kB] Get: 73 http://deb.debian.org/debian bullseye/main arm64 libsm6 arm64 2:1.2.3-1 [34.0 kB] Get: 74 http://deb.debian.org/debian bullseye/main arm64 libxt6 arm64 1:1.2.0-1 [176 kB] Get: 75 http://deb.debian.org/debian bullseye/main arm64 libxmu6 arm64 2:1.1.2-2+b3 [57.8 kB] Get: 76 http://deb.debian.org/debian bullseye/main arm64 libxpm4 arm64 1:3.5.12-1 [43.9 kB] Get: 77 http://deb.debian.org/debian bullseye/main arm64 libxaw7 arm64 2:1.0.13-1.1 [184 kB] Get: 78 http://deb.debian.org/debian bullseye/main arm64 xemacs21-mulesupport all 2009.02.17.dfsg.2-5 [3130 kB] Get: 79 http://deb.debian.org/debian bullseye/main arm64 xemacs21-basesupport all 2009.02.17.dfsg.2-5 [15.9 MB] Get: 80 http://deb.debian.org/debian bullseye/main arm64 xemacs21-mule-canna-wnn arm64 21.4.24-9 [1688 kB] Get: 81 http://deb.debian.org/debian bullseye/main arm64 gcl arm64 2.6.12-102 [29.1 MB] Get: 82 http://deb.debian.org/debian bullseye/main arm64 libpixman-1-0 arm64 0.40.0-1 [444 kB] Get: 83 http://deb.debian.org/debian bullseye/main arm64 libxcb-render0 arm64 1.14-3 [111 kB] Get: 84 http://deb.debian.org/debian bullseye/main arm64 libxcb-shm0 arm64 1.14-3 [101 kB] Get: 85 http://deb.debian.org/debian bullseye/main arm64 libcairo2 arm64 1.16.0-5 [648 kB] Get: 86 http://deb.debian.org/debian bullseye/main arm64 libglib2.0-0 arm64 2.66.8-1 [1286 kB] Get: 87 http://deb.debian.org/debian bullseye/main arm64 libgmpxx4ldbl arm64 2:6.2.1+dfsg-1 [337 kB] Get: 88 http://deb.debian.org/debian bullseye/main arm64 libgmp-dev arm64 2:6.2.1+dfsg-1 [625 kB] Get: 89 http://deb.debian.org/debian bullseye/main arm64 libgmp3-dev arm64 2:6.2.1+dfsg-1 [330 kB] Get: 90 http://deb.debian.org/debian bullseye/main arm64 libgraphite2-3 arm64 1.3.14-1 [75.6 kB] Get: 91 http://deb.debian.org/debian bullseye/main arm64 libharfbuzz0b arm64 2.7.4-1 [1445 kB] Get: 92 http://deb.debian.org/debian bullseye/main arm64 xorg-sgml-doctools all 1:1.11-1.1 [22.1 kB] Get: 93 http://deb.debian.org/debian bullseye/main arm64 x11proto-dev all 2020.1-1 [594 kB] Get: 94 http://deb.debian.org/debian bullseye/main arm64 libice-dev arm64 2:1.0.10-1 [66.0 kB] Get: 95 http://deb.debian.org/debian bullseye/main arm64 libkpathsea6 arm64 2020.20200327.54578-7 [169 kB] Get: 96 http://deb.debian.org/debian bullseye/main arm64 libncurses6 arm64 6.2+20201114-2 [93.2 kB] Get: 97 http://deb.debian.org/debian bullseye/main arm64 libncurses-dev arm64 6.2+20201114-2 [335 kB] Get: 98 http://deb.debian.org/debian bullseye/main arm64 libpaper1 arm64 1.1.28+b1 [21.4 kB] Get: 99 http://deb.debian.org/debian bullseye/main arm64 libpaper-utils arm64 1.1.28+b1 [18.3 kB] Get: 100 http://deb.debian.org/debian bullseye/main arm64 libptexenc1 arm64 2020.20200327.54578-7 [63.5 kB] Get: 101 http://deb.debian.org/debian bullseye/main arm64 libpthread-stubs0-dev arm64 0.4-1 [5336 B] Get: 102 http://deb.debian.org/debian bullseye/main arm64 libreadline-dev arm64 8.1-1 [153 kB] Get: 103 http://deb.debian.org/debian bullseye/main arm64 x11proto-core-dev all 2020.1-1 [3404 B] Get: 104 http://deb.debian.org/debian bullseye/main arm64 libsm-dev arm64 2:1.2.3-1 [37.4 kB] Get: 105 http://deb.debian.org/debian bullseye/main arm64 libsynctex2 arm64 2020.20200327.54578-7 [80.4 kB] Get: 106 http://deb.debian.org/debian bullseye/main arm64 libteckit0 arm64 2.5.10+ds1-3 [293 kB] Get: 107 http://deb.debian.org/debian bullseye/main arm64 libtexlua53 arm64 2020.20200327.54578-7 [124 kB] Get: 108 http://deb.debian.org/debian bullseye/main arm64 libtext-unidecode-perl all 1.30-1 [103 kB] Get: 109 http://deb.debian.org/debian bullseye/main arm64 libxau-dev arm64 1:1.0.9-1 [23.2 kB] Get: 110 http://deb.debian.org/debian bullseye/main arm64 libxdmcp-dev arm64 1:1.1.2-3 [41.2 kB] Get: 111 http://deb.debian.org/debian bullseye/main arm64 xtrans-dev all 1.4.0-1 [98.7 kB] Get: 112 http://deb.debian.org/debian bullseye/main arm64 libxcb1-dev arm64 1.14-3 [177 kB] Get: 113 http://deb.debian.org/debian bullseye/main arm64 libx11-dev arm64 2:1.7.2-1 [828 kB] Get: 114 http://deb.debian.org/debian bullseye/main arm64 x11proto-xext-dev all 2020.1-1 [3404 B] Get: 115 http://deb.debian.org/debian bullseye/main arm64 libxext-dev arm64 2:1.3.3-1.1 [107 kB] Get: 116 http://deb.debian.org/debian bullseye/main arm64 libxt-dev arm64 1:1.2.0-1 [406 kB] Get: 117 http://deb.debian.org/debian bullseye/main arm64 libxmu-headers all 2:1.1.2-2 [51.9 kB] Get: 118 http://deb.debian.org/debian bullseye/main arm64 libxmu-dev arm64 2:1.1.2-2+b3 [65.5 kB] Get: 119 http://deb.debian.org/debian bullseye/main arm64 libxpm-dev arm64 1:3.5.12-1 [100 kB] Get: 120 http://deb.debian.org/debian bullseye/main arm64 libxaw7-dev arm64 2:1.0.13-1.1 [253 kB] Get: 121 http://deb.debian.org/debian bullseye/main arm64 libxi6 arm64 2:1.7.10-1 [81.7 kB] Get: 122 http://deb.debian.org/debian bullseye/main arm64 libxml-namespacesupport-perl all 1.12-1.1 [14.9 kB] Get: 123 http://deb.debian.org/debian bullseye/main arm64 libxml-sax-base-perl all 1.09-1.1 [20.7 kB] Get: 124 http://deb.debian.org/debian bullseye/main arm64 libxml-sax-perl all 1.02+dfsg-1 [59.0 kB] Get: 125 http://deb.debian.org/debian bullseye/main arm64 libxml-libxml-perl arm64 2.0134+dfsg-2+b1 [326 kB] Get: 126 http://deb.debian.org/debian bullseye/main arm64 libzzip-0-13 arm64 0.13.62-3.3 [55.2 kB] Get: 127 http://deb.debian.org/debian bullseye/main arm64 t1utils arm64 1.41-4 [59.8 kB] Get: 128 http://deb.debian.org/debian bullseye/main arm64 texinfo arm64 6.7.0.dfsg.2-6 [1753 kB] Get: 129 http://deb.debian.org/debian bullseye/main arm64 texlive-binaries arm64 2020.20200327.54578-7 [7572 kB] Get: 130 http://deb.debian.org/debian bullseye/main arm64 xdg-utils all 1.1.3-4.1 [75.5 kB] Get: 131 http://deb.debian.org/debian bullseye/main arm64 texlive-base all 2020.20210202-3 [20.8 MB] Get: 132 http://deb.debian.org/debian bullseye/main arm64 texlive-latex-base all 2020.20210202-3 [1120 kB] Get: 133 http://deb.debian.org/debian bullseye/main arm64 texlive-latex-recommended all 2020.20210202-3 [14.5 MB] Get: 134 http://deb.debian.org/debian bullseye/main arm64 time arm64 1.9-0.1 [50.6 kB] Fetched 142 MB in 8s (18.4 MB/s) debconf: delaying package configuration, since apt-utils is not installed Selecting previously unselected package bsdextrautils. (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 ... 19646 files and directories currently installed.) Preparing to unpack .../000-bsdextrautils_2.36.1-8_arm64.deb ... Unpacking bsdextrautils (2.36.1-8) ... Selecting previously unselected package libuchardet0:arm64. Preparing to unpack .../001-libuchardet0_0.0.7-1_arm64.deb ... Unpacking libuchardet0:arm64 (0.0.7-1) ... Selecting previously unselected package groff-base. Preparing to unpack .../002-groff-base_1.22.4-6_arm64.deb ... Unpacking groff-base (1.22.4-6) ... Selecting previously unselected package libpipeline1:arm64. Preparing to unpack .../003-libpipeline1_1.5.3-1_arm64.deb ... Unpacking libpipeline1:arm64 (1.5.3-1) ... Selecting previously unselected package man-db. Preparing to unpack .../004-man-db_2.9.4-2_arm64.deb ... Unpacking man-db (2.9.4-2) ... Selecting previously unselected package sensible-utils. Preparing to unpack .../005-sensible-utils_0.0.14_all.deb ... Unpacking sensible-utils (0.0.14) ... Selecting previously unselected package ucf. Preparing to unpack .../006-ucf_3.0043_all.deb ... Moving old data out of the way Unpacking ucf (3.0043) ... Selecting previously unselected package tex-common. Preparing to unpack .../007-tex-common_6.16_all.deb ... Unpacking tex-common (6.16) ... Selecting previously unselected package readline-common. Preparing to unpack .../008-readline-common_8.1-1_all.deb ... Unpacking readline-common (8.1-1) ... Selecting previously unselected package libreadline8:arm64. Preparing to unpack .../009-libreadline8_8.1-1_arm64.deb ... Unpacking libreadline8:arm64 (8.1-1) ... Selecting previously unselected package libmagic-mgc. Preparing to unpack .../010-libmagic-mgc_1%3a5.39-3_arm64.deb ... Unpacking libmagic-mgc (1:5.39-3) ... Selecting previously unselected package libmagic1:arm64. Preparing to unpack .../011-libmagic1_1%3a5.39-3_arm64.deb ... Unpacking libmagic1:arm64 (1:5.39-3) ... Selecting previously unselected package file. Preparing to unpack .../012-file_1%3a5.39-3_arm64.deb ... Unpacking file (1:5.39-3) ... Selecting previously unselected package gettext-base. Preparing to unpack .../013-gettext-base_0.21-4_arm64.deb ... Unpacking gettext-base (0.21-4) ... Selecting previously unselected package libsigsegv2:arm64. Preparing to unpack .../014-libsigsegv2_2.13-1_arm64.deb ... Unpacking libsigsegv2:arm64 (2.13-1) ... Selecting previously unselected package m4. Preparing to unpack .../015-m4_1.4.18-5_arm64.deb ... Unpacking m4 (1.4.18-5) ... Selecting previously unselected package autoconf. Preparing to unpack .../016-autoconf_2.69-14_all.deb ... Unpacking autoconf (2.69-14) ... Selecting previously unselected package autotools-dev. Preparing to unpack .../017-autotools-dev_20180224.1+nmu1_all.deb ... Unpacking autotools-dev (20180224.1+nmu1) ... Selecting previously unselected package automake. Preparing to unpack .../018-automake_1%3a1.16.3-2_all.deb ... Unpacking automake (1:1.16.3-2) ... Selecting previously unselected package autopoint. Preparing to unpack .../019-autopoint_0.21-4_all.deb ... Unpacking autopoint (0.21-4) ... Selecting previously unselected package libdebhelper-perl. Preparing to unpack .../020-libdebhelper-perl_13.3.4_all.deb ... Unpacking libdebhelper-perl (13.3.4) ... Selecting previously unselected package libtool. Preparing to unpack .../021-libtool_2.4.6-15_all.deb ... Unpacking libtool (2.4.6-15) ... Selecting previously unselected package dh-autoreconf. Preparing to unpack .../022-dh-autoreconf_20_all.deb ... Unpacking dh-autoreconf (20) ... Selecting previously unselected package libarchive-zip-perl. Preparing to unpack .../023-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 .../024-libsub-override-perl_0.09-2_all.deb ... Unpacking libsub-override-perl (0.09-2) ... Selecting previously unselected package libfile-stripnondeterminism-perl. Preparing to unpack .../025-libfile-stripnondeterminism-perl_1.12.0-1_all.deb ... Unpacking libfile-stripnondeterminism-perl (1.12.0-1) ... Selecting previously unselected package dh-strip-nondeterminism. Preparing to unpack .../026-dh-strip-nondeterminism_1.12.0-1_all.deb ... Unpacking dh-strip-nondeterminism (1.12.0-1) ... Selecting previously unselected package libelf1:arm64. Preparing to unpack .../027-libelf1_0.183-1_arm64.deb ... Unpacking libelf1:arm64 (0.183-1) ... Selecting previously unselected package dwz. Preparing to unpack .../028-dwz_0.13+20210201-1_arm64.deb ... Unpacking dwz (0.13+20210201-1) ... Selecting previously unselected package libicu67:arm64. Preparing to unpack .../029-libicu67_67.1-7_arm64.deb ... Unpacking libicu67:arm64 (67.1-7) ... Selecting previously unselected package libxml2:arm64. Preparing to unpack .../030-libxml2_2.9.10+dfsg-6.7_arm64.deb ... Unpacking libxml2:arm64 (2.9.10+dfsg-6.7) ... Selecting previously unselected package gettext. Preparing to unpack .../031-gettext_0.21-4_arm64.deb ... Unpacking gettext (0.21-4) ... Selecting previously unselected package intltool-debian. Preparing to unpack .../032-intltool-debian_0.35.0+20060710.5_all.deb ... Unpacking intltool-debian (0.35.0+20060710.5) ... Selecting previously unselected package po-debconf. Preparing to unpack .../033-po-debconf_1.0.21+nmu1_all.deb ... Unpacking po-debconf (1.0.21+nmu1) ... Selecting previously unselected package debhelper. Preparing to unpack .../034-debhelper_13.3.4_all.deb ... Unpacking debhelper (13.3.4) ... Selecting previously unselected package emacsen-common. Preparing to unpack .../035-emacsen-common_3.0.4_all.deb ... Unpacking emacsen-common (3.0.4) ... Selecting previously unselected package fonts-dejavu-core. Preparing to unpack .../036-fonts-dejavu-core_2.37-2_all.deb ... Unpacking fonts-dejavu-core (2.37-2) ... Selecting previously unselected package fontconfig-config. Preparing to unpack .../037-fontconfig-config_2.13.1-4.2_all.deb ... Unpacking fontconfig-config (2.13.1-4.2) ... Selecting previously unselected package fonts-lmodern. Preparing to unpack .../038-fonts-lmodern_2.004.5-6.1_all.deb ... Unpacking fonts-lmodern (2.004.5-6.1) ... Selecting previously unselected package libtcl8.6:arm64. Preparing to unpack .../039-libtcl8.6_8.6.11+dfsg-1_arm64.deb ... Unpacking libtcl8.6:arm64 (8.6.11+dfsg-1) ... Selecting previously unselected package libexpat1:arm64. Preparing to unpack .../040-libexpat1_2.2.10-2_arm64.deb ... Unpacking libexpat1:arm64 (2.2.10-2) ... Selecting previously unselected package libbrotli1:arm64. Preparing to unpack .../041-libbrotli1_1.0.9-2+b2_arm64.deb ... Unpacking libbrotli1:arm64 (1.0.9-2+b2) ... Selecting previously unselected package libpng16-16:arm64. Preparing to unpack .../042-libpng16-16_1.6.37-3_arm64.deb ... Unpacking libpng16-16:arm64 (1.6.37-3) ... Selecting previously unselected package libfreetype6:arm64. Preparing to unpack .../043-libfreetype6_2.10.4+dfsg-1_arm64.deb ... Unpacking libfreetype6:arm64 (2.10.4+dfsg-1) ... Selecting previously unselected package libfontconfig1:arm64. Preparing to unpack .../044-libfontconfig1_2.13.1-4.2_arm64.deb ... Unpacking libfontconfig1:arm64 (2.13.1-4.2) ... Selecting previously unselected package libxau6:arm64. Preparing to unpack .../045-libxau6_1%3a1.0.9-1_arm64.deb ... Unpacking libxau6:arm64 (1:1.0.9-1) ... Selecting previously unselected package libmd0:arm64. Preparing to unpack .../046-libmd0_1.0.3-3_arm64.deb ... Unpacking libmd0:arm64 (1.0.3-3) ... Selecting previously unselected package libbsd0:arm64. Preparing to unpack .../047-libbsd0_0.11.3-1_arm64.deb ... Unpacking libbsd0:arm64 (0.11.3-1) ... Selecting previously unselected package libxdmcp6:arm64. Preparing to unpack .../048-libxdmcp6_1%3a1.1.2-3_arm64.deb ... Unpacking libxdmcp6:arm64 (1:1.1.2-3) ... Selecting previously unselected package libxcb1:arm64. Preparing to unpack .../049-libxcb1_1.14-3_arm64.deb ... Unpacking libxcb1:arm64 (1.14-3) ... Selecting previously unselected package libx11-data. Preparing to unpack .../050-libx11-data_2%3a1.7.2-1_all.deb ... Unpacking libx11-data (2:1.7.2-1) ... Selecting previously unselected package libx11-6:arm64. Preparing to unpack .../051-libx11-6_2%3a1.7.2-1_arm64.deb ... Unpacking libx11-6:arm64 (2:1.7.2-1) ... Selecting previously unselected package libxrender1:arm64. Preparing to unpack .../052-libxrender1_1%3a0.9.10-1_arm64.deb ... Unpacking libxrender1:arm64 (1:0.9.10-1) ... Selecting previously unselected package libxft2:arm64. Preparing to unpack .../053-libxft2_2.3.2-2_arm64.deb ... Unpacking libxft2:arm64 (2.3.2-2) ... Selecting previously unselected package libxext6:arm64. Preparing to unpack .../054-libxext6_2%3a1.3.3-1.1_arm64.deb ... Unpacking libxext6:arm64 (2:1.3.3-1.1) ... Selecting previously unselected package x11-common. Preparing to unpack .../055-x11-common_1%3a7.7+22_all.deb ... Unpacking x11-common (1:7.7+22) ... Selecting previously unselected package libxss1:arm64. Preparing to unpack .../056-libxss1_1%3a1.2.3-1_arm64.deb ... Unpacking libxss1:arm64 (1:1.2.3-1) ... Selecting previously unselected package libtk8.6:arm64. Preparing to unpack .../057-libtk8.6_8.6.11-2_arm64.deb ... Unpacking libtk8.6:arm64 (8.6.11-2) ... Selecting previously unselected package xemacs21-support. Preparing to unpack .../058-xemacs21-support_21.4.24-9_all.deb ... Unpacking xemacs21-support (21.4.24-9) ... Selecting previously unselected package xemacs21-bin. Preparing to unpack .../059-xemacs21-bin_21.4.24-9_arm64.deb ... Unpacking xemacs21-bin (21.4.24-9) ... Selecting previously unselected package libcanna1g. Preparing to unpack .../060-libcanna1g_3.7p3-16_arm64.deb ... Unpacking libcanna1g (3.7p3-16) ... Selecting previously unselected package libcompfaceg1. Preparing to unpack .../061-libcompfaceg1_1%3a1.5.2-5+b2_arm64.deb ... Unpacking libcompfaceg1 (1:1.5.2-5+b2) ... Selecting previously unselected package libgpm2:arm64. Preparing to unpack .../062-libgpm2_1.20.7-8_arm64.deb ... Unpacking libgpm2:arm64 (1.20.7-8) ... Selecting previously unselected package libjpeg62-turbo:arm64. Preparing to unpack .../063-libjpeg62-turbo_1%3a2.0.6-4_arm64.deb ... Unpacking libjpeg62-turbo:arm64 (1:2.0.6-4) ... Selecting previously unselected package libsasl2-modules-db:arm64. Preparing to unpack .../064-libsasl2-modules-db_2.1.27+dfsg-2.1_arm64.deb ... Unpacking libsasl2-modules-db:arm64 (2.1.27+dfsg-2.1) ... Selecting previously unselected package libsasl2-2:arm64. Preparing to unpack .../065-libsasl2-2_2.1.27+dfsg-2.1_arm64.deb ... Unpacking libsasl2-2:arm64 (2.1.27+dfsg-2.1) ... Selecting previously unselected package libldap-2.4-2:arm64. Preparing to unpack .../066-libldap-2.4-2_2.4.57+dfsg-3_arm64.deb ... Unpacking libldap-2.4-2:arm64 (2.4.57+dfsg-3) ... Selecting previously unselected package libdeflate0:arm64. Preparing to unpack .../067-libdeflate0_1.7-1_arm64.deb ... Unpacking libdeflate0:arm64 (1.7-1) ... Selecting previously unselected package libjbig0:arm64. Preparing to unpack .../068-libjbig0_2.1-3.1+b2_arm64.deb ... Unpacking libjbig0:arm64 (2.1-3.1+b2) ... Selecting previously unselected package libwebp6:arm64. Preparing to unpack .../069-libwebp6_0.6.1-2.1_arm64.deb ... Unpacking libwebp6:arm64 (0.6.1-2.1) ... Selecting previously unselected package libtiff5:arm64. Preparing to unpack .../070-libtiff5_4.2.0-1_arm64.deb ... Unpacking libtiff5:arm64 (4.2.0-1) ... Selecting previously unselected package libice6:arm64. Preparing to unpack .../071-libice6_2%3a1.0.10-1_arm64.deb ... Unpacking libice6:arm64 (2:1.0.10-1) ... Selecting previously unselected package libsm6:arm64. Preparing to unpack .../072-libsm6_2%3a1.2.3-1_arm64.deb ... Unpacking libsm6:arm64 (2:1.2.3-1) ... Selecting previously unselected package libxt6:arm64. Preparing to unpack .../073-libxt6_1%3a1.2.0-1_arm64.deb ... Unpacking libxt6:arm64 (1:1.2.0-1) ... Selecting previously unselected package libxmu6:arm64. Preparing to unpack .../074-libxmu6_2%3a1.1.2-2+b3_arm64.deb ... Unpacking libxmu6:arm64 (2:1.1.2-2+b3) ... Selecting previously unselected package libxpm4:arm64. Preparing to unpack .../075-libxpm4_1%3a3.5.12-1_arm64.deb ... Unpacking libxpm4:arm64 (1:3.5.12-1) ... Selecting previously unselected package libxaw7:arm64. Preparing to unpack .../076-libxaw7_2%3a1.0.13-1.1_arm64.deb ... Unpacking libxaw7:arm64 (2:1.0.13-1.1) ... Selecting previously unselected package xemacs21-mulesupport. Preparing to unpack .../077-xemacs21-mulesupport_2009.02.17.dfsg.2-5_all.deb ... Unpacking xemacs21-mulesupport (2009.02.17.dfsg.2-5) ... Selecting previously unselected package xemacs21-basesupport. Preparing to unpack .../078-xemacs21-basesupport_2009.02.17.dfsg.2-5_all.deb ... Unpacking xemacs21-basesupport (2009.02.17.dfsg.2-5) ... Selecting previously unselected package xemacs21-mule-canna-wnn. Preparing to unpack .../079-xemacs21-mule-canna-wnn_21.4.24-9_arm64.deb ... Unpacking xemacs21-mule-canna-wnn (21.4.24-9) ... Selecting previously unselected package gcl. Preparing to unpack .../080-gcl_2.6.12-102_arm64.deb ... Unpacking gcl (2.6.12-102) ... Selecting previously unselected package libpixman-1-0:arm64. Preparing to unpack .../081-libpixman-1-0_0.40.0-1_arm64.deb ... Unpacking libpixman-1-0:arm64 (0.40.0-1) ... Selecting previously unselected package libxcb-render0:arm64. Preparing to unpack .../082-libxcb-render0_1.14-3_arm64.deb ... Unpacking libxcb-render0:arm64 (1.14-3) ... Selecting previously unselected package libxcb-shm0:arm64. Preparing to unpack .../083-libxcb-shm0_1.14-3_arm64.deb ... Unpacking libxcb-shm0:arm64 (1.14-3) ... Selecting previously unselected package libcairo2:arm64. Preparing to unpack .../084-libcairo2_1.16.0-5_arm64.deb ... Unpacking libcairo2:arm64 (1.16.0-5) ... Selecting previously unselected package libglib2.0-0:arm64. Preparing to unpack .../085-libglib2.0-0_2.66.8-1_arm64.deb ... Unpacking libglib2.0-0:arm64 (2.66.8-1) ... Selecting previously unselected package libgmpxx4ldbl:arm64. Preparing to unpack .../086-libgmpxx4ldbl_2%3a6.2.1+dfsg-1_arm64.deb ... Unpacking libgmpxx4ldbl:arm64 (2:6.2.1+dfsg-1) ... Selecting previously unselected package libgmp-dev:arm64. Preparing to unpack .../087-libgmp-dev_2%3a6.2.1+dfsg-1_arm64.deb ... Unpacking libgmp-dev:arm64 (2:6.2.1+dfsg-1) ... Selecting previously unselected package libgmp3-dev:arm64. Preparing to unpack .../088-libgmp3-dev_2%3a6.2.1+dfsg-1_arm64.deb ... Unpacking libgmp3-dev:arm64 (2:6.2.1+dfsg-1) ... Selecting previously unselected package libgraphite2-3:arm64. Preparing to unpack .../089-libgraphite2-3_1.3.14-1_arm64.deb ... Unpacking libgraphite2-3:arm64 (1.3.14-1) ... Selecting previously unselected package libharfbuzz0b:arm64. Preparing to unpack .../090-libharfbuzz0b_2.7.4-1_arm64.deb ... Unpacking libharfbuzz0b:arm64 (2.7.4-1) ... Selecting previously unselected package xorg-sgml-doctools. Preparing to unpack .../091-xorg-sgml-doctools_1%3a1.11-1.1_all.deb ... Unpacking xorg-sgml-doctools (1:1.11-1.1) ... Selecting previously unselected package x11proto-dev. Preparing to unpack .../092-x11proto-dev_2020.1-1_all.deb ... Unpacking x11proto-dev (2020.1-1) ... Selecting previously unselected package libice-dev:arm64. Preparing to unpack .../093-libice-dev_2%3a1.0.10-1_arm64.deb ... Unpacking libice-dev:arm64 (2:1.0.10-1) ... Selecting previously unselected package libkpathsea6:arm64. Preparing to unpack .../094-libkpathsea6_2020.20200327.54578-7_arm64.deb ... Unpacking libkpathsea6:arm64 (2020.20200327.54578-7) ... Selecting previously unselected package libncurses6:arm64. Preparing to unpack .../095-libncurses6_6.2+20201114-2_arm64.deb ... Unpacking libncurses6:arm64 (6.2+20201114-2) ... Selecting previously unselected package libncurses-dev:arm64. Preparing to unpack .../096-libncurses-dev_6.2+20201114-2_arm64.deb ... Unpacking libncurses-dev:arm64 (6.2+20201114-2) ... Selecting previously unselected package libpaper1:arm64. Preparing to unpack .../097-libpaper1_1.1.28+b1_arm64.deb ... Unpacking libpaper1:arm64 (1.1.28+b1) ... Selecting previously unselected package libpaper-utils. Preparing to unpack .../098-libpaper-utils_1.1.28+b1_arm64.deb ... Unpacking libpaper-utils (1.1.28+b1) ... Selecting previously unselected package libptexenc1:arm64. Preparing to unpack .../099-libptexenc1_2020.20200327.54578-7_arm64.deb ... Unpacking libptexenc1:arm64 (2020.20200327.54578-7) ... Selecting previously unselected package libpthread-stubs0-dev:arm64. Preparing to unpack .../100-libpthread-stubs0-dev_0.4-1_arm64.deb ... Unpacking libpthread-stubs0-dev:arm64 (0.4-1) ... Selecting previously unselected package libreadline-dev:arm64. Preparing to unpack .../101-libreadline-dev_8.1-1_arm64.deb ... Unpacking libreadline-dev:arm64 (8.1-1) ... Selecting previously unselected package x11proto-core-dev. Preparing to unpack .../102-x11proto-core-dev_2020.1-1_all.deb ... Unpacking x11proto-core-dev (2020.1-1) ... Selecting previously unselected package libsm-dev:arm64. Preparing to unpack .../103-libsm-dev_2%3a1.2.3-1_arm64.deb ... Unpacking libsm-dev:arm64 (2:1.2.3-1) ... Selecting previously unselected package libsynctex2:arm64. Preparing to unpack .../104-libsynctex2_2020.20200327.54578-7_arm64.deb ... Unpacking libsynctex2:arm64 (2020.20200327.54578-7) ... Selecting previously unselected package libteckit0:arm64. Preparing to unpack .../105-libteckit0_2.5.10+ds1-3_arm64.deb ... Unpacking libteckit0:arm64 (2.5.10+ds1-3) ... Selecting previously unselected package libtexlua53:arm64. Preparing to unpack .../106-libtexlua53_2020.20200327.54578-7_arm64.deb ... Unpacking libtexlua53:arm64 (2020.20200327.54578-7) ... Selecting previously unselected package libtext-unidecode-perl. Preparing to unpack .../107-libtext-unidecode-perl_1.30-1_all.deb ... Unpacking libtext-unidecode-perl (1.30-1) ... Selecting previously unselected package libxau-dev:arm64. Preparing to unpack .../108-libxau-dev_1%3a1.0.9-1_arm64.deb ... Unpacking libxau-dev:arm64 (1:1.0.9-1) ... Selecting previously unselected package libxdmcp-dev:arm64. Preparing to unpack .../109-libxdmcp-dev_1%3a1.1.2-3_arm64.deb ... Unpacking libxdmcp-dev:arm64 (1:1.1.2-3) ... Selecting previously unselected package xtrans-dev. Preparing to unpack .../110-xtrans-dev_1.4.0-1_all.deb ... Unpacking xtrans-dev (1.4.0-1) ... Selecting previously unselected package libxcb1-dev:arm64. Preparing to unpack .../111-libxcb1-dev_1.14-3_arm64.deb ... Unpacking libxcb1-dev:arm64 (1.14-3) ... Selecting previously unselected package libx11-dev:arm64. Preparing to unpack .../112-libx11-dev_2%3a1.7.2-1_arm64.deb ... Unpacking libx11-dev:arm64 (2:1.7.2-1) ... Selecting previously unselected package x11proto-xext-dev. Preparing to unpack .../113-x11proto-xext-dev_2020.1-1_all.deb ... Unpacking x11proto-xext-dev (2020.1-1) ... Selecting previously unselected package libxext-dev:arm64. Preparing to unpack .../114-libxext-dev_2%3a1.3.3-1.1_arm64.deb ... Unpacking libxext-dev:arm64 (2:1.3.3-1.1) ... Selecting previously unselected package libxt-dev:arm64. Preparing to unpack .../115-libxt-dev_1%3a1.2.0-1_arm64.deb ... Unpacking libxt-dev:arm64 (1:1.2.0-1) ... Selecting previously unselected package libxmu-headers. Preparing to unpack .../116-libxmu-headers_2%3a1.1.2-2_all.deb ... Unpacking libxmu-headers (2:1.1.2-2) ... Selecting previously unselected package libxmu-dev:arm64. Preparing to unpack .../117-libxmu-dev_2%3a1.1.2-2+b3_arm64.deb ... Unpacking libxmu-dev:arm64 (2:1.1.2-2+b3) ... Selecting previously unselected package libxpm-dev:arm64. Preparing to unpack .../118-libxpm-dev_1%3a3.5.12-1_arm64.deb ... Unpacking libxpm-dev:arm64 (1:3.5.12-1) ... Selecting previously unselected package libxaw7-dev:arm64. Preparing to unpack .../119-libxaw7-dev_2%3a1.0.13-1.1_arm64.deb ... Unpacking libxaw7-dev:arm64 (2:1.0.13-1.1) ... Selecting previously unselected package libxi6:arm64. Preparing to unpack .../120-libxi6_2%3a1.7.10-1_arm64.deb ... Unpacking libxi6:arm64 (2:1.7.10-1) ... Selecting previously unselected package libxml-namespacesupport-perl. Preparing to unpack .../121-libxml-namespacesupport-perl_1.12-1.1_all.deb ... Unpacking libxml-namespacesupport-perl (1.12-1.1) ... Selecting previously unselected package libxml-sax-base-perl. Preparing to unpack .../122-libxml-sax-base-perl_1.09-1.1_all.deb ... Unpacking libxml-sax-base-perl (1.09-1.1) ... Selecting previously unselected package libxml-sax-perl. Preparing to unpack .../123-libxml-sax-perl_1.02+dfsg-1_all.deb ... Unpacking libxml-sax-perl (1.02+dfsg-1) ... Selecting previously unselected package libxml-libxml-perl. Preparing to unpack .../124-libxml-libxml-perl_2.0134+dfsg-2+b1_arm64.deb ... Unpacking libxml-libxml-perl (2.0134+dfsg-2+b1) ... Selecting previously unselected package libzzip-0-13:arm64. Preparing to unpack .../125-libzzip-0-13_0.13.62-3.3_arm64.deb ... Unpacking libzzip-0-13:arm64 (0.13.62-3.3) ... Selecting previously unselected package t1utils. Preparing to unpack .../126-t1utils_1.41-4_arm64.deb ... Unpacking t1utils (1.41-4) ... Selecting previously unselected package texinfo. Preparing to unpack .../127-texinfo_6.7.0.dfsg.2-6_arm64.deb ... Unpacking texinfo (6.7.0.dfsg.2-6) ... Selecting previously unselected package texlive-binaries. Preparing to unpack .../128-texlive-binaries_2020.20200327.54578-7_arm64.deb ... Unpacking texlive-binaries (2020.20200327.54578-7) ... Selecting previously unselected package xdg-utils. Preparing to unpack .../129-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 .../130-texlive-base_2020.20210202-3_all.deb ... Unpacking texlive-base (2020.20210202-3) ... Selecting previously unselected package texlive-latex-base. Preparing to unpack .../131-texlive-latex-base_2020.20210202-3_all.deb ... Unpacking texlive-latex-base (2020.20210202-3) ... Selecting previously unselected package texlive-latex-recommended. Preparing to unpack .../132-texlive-latex-recommended_2020.20210202-3_all.deb ... Unpacking texlive-latex-recommended (2020.20210202-3) ... Selecting previously unselected package time. Preparing to unpack .../133-time_1.9-0.1_arm64.deb ... Unpacking time (1.9-0.1) ... Setting up libexpat1:arm64 (2.2.10-2) ... Setting up libpipeline1:arm64 (1.5.3-1) ... Setting up xemacs21-basesupport (2009.02.17.dfsg.2-5) ... Setting up libgraphite2-3:arm64 (1.3.14-1) ... Setting up libpixman-1-0:arm64 (0.40.0-1) ... Setting up libcanna1g (3.7p3-16) ... Setting up libxau6:arm64 (1:1.0.9-1) ... Setting up time (1.9-0.1) ... Setting up libgpm2:arm64 (1.20.7-8) ... Setting up bsdextrautils (2.36.1-8) ... update-alternatives: using /usr/bin/write.ul to provide /usr/bin/write (write) in auto mode Setting up libicu67:arm64 (67.1-7) ... Setting up libmagic-mgc (1:5.39-3) ... Setting up libtexlua53:arm64 (2020.20200327.54578-7) ... Setting up libarchive-zip-perl (1.68-1) ... Setting up libglib2.0-0:arm64 (2.66.8-1) ... No schema files found: doing nothing. Setting up libdebhelper-perl (13.3.4) ... Setting up libbrotli1:arm64 (1.0.9-2+b2) ... Setting up x11-common (1:7.7+22) ... invoke-rc.d: could not determine current runlevel Setting up X socket directories... /tmp/.X11-unix /tmp/.ICE-unix. Setting up libmagic1:arm64 (1:5.39-3) ... Setting up libdeflate0:arm64 (1.7-1) ... Setting up libxml-namespacesupport-perl (1.12-1.1) ... Setting up gettext-base (0.21-4) ... Setting up libcompfaceg1 (1:1.5.2-5+b2) ... Setting up libzzip-0-13:arm64 (0.13.62-3.3) ... Setting up file (1:5.39-3) ... Setting up libpthread-stubs0-dev:arm64 (0.4-1) ... Setting up libjbig0:arm64 (2.1-3.1+b2) ... Setting up libsasl2-modules-db:arm64 (2.1.27+dfsg-2.1) ... Setting up libxml-sax-base-perl (1.09-1.1) ... Setting up xtrans-dev (1.4.0-1) ... Setting up autotools-dev (20180224.1+nmu1) ... Setting up libgmpxx4ldbl:arm64 (2:6.2.1+dfsg-1) ... Setting up libjpeg62-turbo:arm64 (1:2.0.6-4) ... Setting up emacsen-common (3.0.4) ... Setting up libx11-data (2:1.7.2-1) ... Setting up libteckit0:arm64 (2.5.10+ds1-3) ... Setting up libncurses6:arm64 (6.2+20201114-2) ... Setting up libsigsegv2:arm64 (2.13-1) ... Setting up t1utils (1.41-4) ... Setting up libpng16-16:arm64 (1.6.37-3) ... Setting up libtcl8.6:arm64 (8.6.11+dfsg-1) ... Setting up autopoint (0.21-4) ... Setting up libwebp6:arm64 (0.6.1-2.1) ... Setting up fonts-dejavu-core (2.37-2) ... Setting up libkpathsea6:arm64 (2020.20200327.54578-7) ... Setting up libsasl2-2:arm64 (2.1.27+dfsg-2.1) ... Setting up libmd0:arm64 (1.0.3-3) ... Setting up sensible-utils (0.0.14) ... Setting up libuchardet0:arm64 (0.0.7-1) ... Setting up fonts-lmodern (2.004.5-6.1) ... Setting up libsub-override-perl (0.09-2) ... Setting up xorg-sgml-doctools (1:1.11-1.1) ... Setting up libtiff5:arm64 (4.2.0-1) ... Setting up xemacs21-support (21.4.24-9) ... Setting up libtext-unidecode-perl (1.30-1) ... Setting up xemacs21-mulesupport (2009.02.17.dfsg.2-5) ... Setting up libbsd0:arm64 (0.11.3-1) ... Setting up libelf1:arm64 (0.183-1) ... Setting up readline-common (8.1-1) ... Setting up libxml2:arm64 (2.9.10+dfsg-6.7) ... 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 libsynctex2:arm64 (2020.20200327.54578-7) ... Setting up x11proto-dev (2020.1-1) ... Setting up libfile-stripnondeterminism-perl (1.12.0-1) ... Setting up libice6:arm64 (2:1.0.10-1) ... Setting up libxdmcp6:arm64 (1:1.1.2-3) ... Setting up libncurses-dev:arm64 (6.2+20201114-2) ... Setting up libxcb1:arm64 (1.14-3) ... Setting up gettext (0.21-4) ... Setting up libgmp-dev:arm64 (2:6.2.1+dfsg-1) ... Setting up libxau-dev:arm64 (1:1.0.9-1) ... Setting up libice-dev:arm64 (2:1.0.10-1) ... Setting up libtool (2.4.6-15) ... Setting up libxcb-render0:arm64 (1.14-3) ... Setting up libreadline8:arm64 (8.1-1) ... Setting up libldap-2.4-2:arm64 (2.4.57+dfsg-3) ... Setting up m4 (1.4.18-5) ... Setting up libxcb-shm0:arm64 (1.14-3) ... Setting up libreadline-dev:arm64 (8.1-1) ... Setting up intltool-debian (0.35.0+20060710.5) ... Setting up libxdmcp-dev:arm64 (1:1.1.2-3) ... Setting up libptexenc1:arm64 (2020.20200327.54578-7) ... Setting up libfreetype6:arm64 (2.10.4+dfsg-1) ... Setting up xemacs21-bin (21.4.24-9) ... update-alternatives: using /usr/lib/xemacs-21.4.24/aarch64-linux-gnu/movemail to provide /usr/bin/movemail (movemail) in auto mode update-alternatives: using /usr/lib/xemacs-21.4.24/aarch64-linux-gnu/mmencode to provide /usr/bin/mmencode (mmencode) in auto mode update-alternatives: using /usr/bin/b2m.xemacs21 to provide /usr/bin/b2m (b2m) in auto mode update-alternatives: using /usr/bin/etags.xemacs21 to provide /usr/bin/etags (etags) in auto mode update-alternatives: using /usr/bin/gnuclient.xemacs21 to provide /usr/bin/gnuclient (gnuclient) in auto mode update-alternatives: using /usr/bin/gnuattach.xemacs21 to provide /usr/bin/gnuattach (gnuattach) in auto mode update-alternatives: using /usr/bin/gnudoit.xemacs21 to provide /usr/bin/gnudoit (gnudoit) in auto mode update-alternatives: using /usr/bin/rcs-checkin.xemacs21 to provide /usr/bin/rcs-checkin (rcs-checkin) in auto mode update-alternatives: using /usr/bin/ellcc.xemacs21 to provide /usr/bin/ellcc (ellcc) in auto mode Setting up x11proto-core-dev (2020.1-1) ... Setting up ucf (3.0043) ... Setting up autoconf (2.69-14) ... Setting up dh-strip-nondeterminism (1.12.0-1) ... Setting up x11proto-xext-dev (2020.1-1) ... Setting up dwz (0.13+20210201-1) ... Setting up groff-base (1.22.4-6) ... Setting up libgmp3-dev:arm64 (2:6.2.1+dfsg-1) ... Setting up libx11-6:arm64 (2:1.7.2-1) ... Setting up libharfbuzz0b:arm64 (2.7.4-1) ... Setting up libsm6:arm64 (2:1.2.3-1) ... Setting up automake (1:1.16.3-2) ... update-alternatives: using /usr/bin/automake-1.16 to provide /usr/bin/automake (automake) in auto mode Setting up libpaper1:arm64 (1.1.28+b1) ... Creating config file /etc/papersize with new version Setting up libxcb1-dev:arm64 (1.14-3) ... Setting up libxpm4:arm64 (1:3.5.12-1) ... Setting up libxrender1:arm64 (1:0.9.10-1) ... Setting up libsm-dev:arm64 (2:1.2.3-1) ... Setting up fontconfig-config (2.13.1-4.2) ... Setting up po-debconf (1.0.21+nmu1) ... Setting up libx11-dev:arm64 (2:1.7.2-1) ... Setting up libxext6:arm64 (2:1.3.3-1.1) ... Setting up libpaper-utils (1.1.28+b1) ... Setting up man-db (2.9.4-2) ... Not building database; man-db/auto-update is not 'true'. Setting up libxml-sax-perl (1.02+dfsg-1) ... update-perl-sax-parsers: Registering Perl SAX parser XML::SAX::PurePerl with priority 10... update-perl-sax-parsers: Updating overall Perl SAX parser modules info file... Creating config file /etc/perl/XML/SAX/ParserDetails.ini with new version Setting up dh-autoreconf (20) ... Setting up tex-common (6.16) ... update-language: texlive-base not installed and configured, doing nothing! Setting up libxpm-dev:arm64 (1:3.5.12-1) ... Setting up libxt6:arm64 (1:1.2.0-1) ... Setting up libxext-dev:arm64 (2:1.3.3-1.1) ... Setting up libxml-libxml-perl (2.0134+dfsg-2+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 libxss1:arm64 (1:1.2.3-1) ... Setting up libfontconfig1:arm64 (2.13.1-4.2) ... Setting up libxft2:arm64 (2.3.2-2) ... Setting up libxmu-headers (2:1.1.2-2) ... Setting up libxmu6:arm64 (2:1.1.2-2+b3) ... Setting up libxi6:arm64 (2:1.7.10-1) ... Setting up libtk8.6:arm64 (8.6.11-2) ... Setting up debhelper (13.3.4) ... Setting up libxaw7:arm64 (2:1.0.13-1.1) ... Setting up libcairo2:arm64 (1.16.0-5) ... Setting up libxt-dev:arm64 (1:1.2.0-1) ... Setting up texinfo (6.7.0.dfsg.2-6) ... Running mktexlsr. This may take some time. ... done. Setting up texlive-binaries (2020.20200327.54578-7) ... update-alternatives: using /usr/bin/xdvi-xaw to provide /usr/bin/xdvi.bin (xdvi.bin) in auto mode update-alternatives: using /usr/bin/bibtex.original to provide /usr/bin/bibtex (bibtex) in auto mode Setting up texlive-base (2020.20210202-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 xemacs21-mule-canna-wnn (21.4.24-9) ... update-alternatives: using /usr/bin/xemacs21-mule-canna-wnn to provide /usr/bin/xemacs21 (xemacs21) in auto mode Install emacsen-common for xemacs21 emacsen-common: Handling install of emacsen flavor xemacs21 Loading /usr/share/emacsen-common/debian-startup... Loading 00debian... Compiling /usr/share/xemacs21/site-lisp/debian-startup.el... Wrote /usr/share/xemacs21/site-lisp/debian-startup.elc Done Setting up libxmu-dev:arm64 (2:1.1.2-2+b3) ... Setting up texlive-latex-base (2020.20210202-3) ... Setting up texlive-latex-recommended (2020.20210202-3) ... Setting up libxaw7-dev:arm64 (2:1.0.13-1.1) ... Setting up gcl (2.6.12-102) ... WARNING: tempfile is deprecated; consider using mktemp instead. WARNING: tempfile is deprecated; consider using mktemp instead. Creating config file /etc/default/gcl with new version Install gcl for xemacs21 install/gcl: Handling install for emacsen flavor xemacs21 Loading /usr/share/emacsen-common/debian-startup... Loading 00debian... Compiling /usr/share/xemacs21/site-lisp/gcl/add-default.el... Wrote /usr/share/xemacs21/site-lisp/gcl/add-default.elc Compiling /usr/share/xemacs21/site-lisp/gcl/ansi-doc.el... Wrote /usr/share/xemacs21/site-lisp/gcl/ansi-doc.elc Compiling /usr/share/xemacs21/site-lisp/gcl/dbl.el... Wrote /usr/share/xemacs21/site-lisp/gcl/dbl.elc Compiling /usr/share/xemacs21/site-lisp/gcl/default.el... Wrote /usr/share/xemacs21/site-lisp/gcl/default.elc Compiling /usr/share/xemacs21/site-lisp/gcl/doc-to-texi.el... Wrote /usr/share/xemacs21/site-lisp/gcl/doc-to-texi.elc Compiling /usr/share/xemacs21/site-lisp/gcl/gcl.el... Wrote /usr/share/xemacs21/site-lisp/gcl/gcl.elc Compiling /usr/share/xemacs21/site-lisp/gcl/man1-to-texi.el... Wrote /usr/share/xemacs21/site-lisp/gcl/man1-to-texi.elc Compiling /usr/share/xemacs21/site-lisp/gcl/smart-complete.el... Wrote /usr/share/xemacs21/site-lisp/gcl/smart-complete.elc Compiling /usr/share/xemacs21/site-lisp/gcl/sshell.el... Wrote /usr/share/xemacs21/site-lisp/gcl/sshell.elc Done Processing triggers for libc-bin (2.31-13) ... Processing triggers for tex-common (6.16) ... 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 Reading package lists... Building dependency tree... Reading state information... fakeroot is already the newest version (1.25.3-1.1). 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. I: Building the package I: Running cd /build/acl2-8.3dfsg/ && 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.3dfsg-2_source.changes dpkg-buildpackage: info: source package acl2 dpkg-buildpackage: info: source version 8.3dfsg-2 dpkg-buildpackage: info: source distribution unstable dpkg-buildpackage: info: source changed by Camm Maguire dpkg-source --before-build . dpkg-buildpackage: info: host architecture arm64 fakeroot debian/rules clean sed -e "s,^DIR = .*,DIR = $(pwd)/books/interface/infix,1" \ -e "s,^LISP = .*,LISP = $(pwd)/saved_acl2,1" books/interface/infix/makefile > books/interface/infix/Makefile rm -f infix-stamp cd books/interface/infix && make -f Makefile clean make[1]: Entering directory '/build/acl2-8.3dfsg/books/interface/infix' rm -f /build/acl2-8.3dfsg/books/interface/infix/*.otl /build/acl2-8.3dfsg/books/interface/infix/*.err /build/acl2-8.3dfsg/books/interface/infix/*.ps /build/acl2-8.3dfsg/books/interface/infix/*.aux rm -f /build/acl2-8.3dfsg/books/interface/infix/*.dvi /build/acl2-8.3dfsg/books/interface/infix/*.aux /build/acl2-8.3dfsg/books/interface/infix/*.log /build/acl2-8.3dfsg/books/interface/infix/*.idx /build/acl2-8.3dfsg/books/interface/infix/.log rm -f *~* *#* workxxx *.o *.tex *.nqtex TAGS *.dvi *.ps *.err *.aux *.log *.idx make[1]: Leaving directory '/build/acl2-8.3dfsg/books/interface/infix' rm -f books/interface/infix/Makefile dh_testdir dh_testroot rm -f build-stamp /usr/bin/make clean-all make[1]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 rm -f *.o *#* *.c *.h *.data gazonk.* workxxx* workyyy* *.lib \ *.fasl *.fas *.sparcf *.ufsl *.64ufasl *.ufasl *.dfsl *.dxl \ *.d64fsl *.dx64fsl *.lx64fsl \ *.lx32fsl *.x86f *.sse2f *.o *.fn \ TAGS TAGS-acl2-doc acl2-status.txt acl2r.lisp acl2-proclaims.lisp \ .acl2rc *osaved_acl2* *.log devel-check.out TMP* rm -rf saved rm -f doc/*.o doc/*#* doc/*.c doc/*.h doc/*.data doc/gazonk.* \ doc/workxxx doc/workyyy doc/*.lib \ doc/*.fasl doc/*.fas doc/*.sparcf doc/*.ufsl doc/*.64ufasl doc/*.ufasl doc/*.dfsl \ doc/*.dxl doc/*.d64fsl doc/*.dx64fsl doc/*.lx64fsl \ doc/*.lx32fsl doc/*.x86f doc/*.sse2f doc/*.o doc/*.fn \ doc/*.cert doc/*.port doc/*.out \ doc/*.log doc/TMP* rm -rf doc/TEX doc/HTML doc/EMACS rm -f *saved_acl2* doc.lisp.backup make[1]: Leaving directory '/build/acl2-8.3dfsg' /usr/bin/make clean-books make[1]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 cd books ; /usr/bin/make -k ACL2=/build/acl2-8.3dfsg/saved_acl2 moreclean make[2]: Entering directory '/build/acl2-8.3dfsg/books' ACL2_SYSTEM_BOOKS is /build/acl2-8.3dfsg/books Determining ACL2 features (for ACL2 = /build/acl2-8.3dfsg/saved_acl2) *** Failed to run ACL2! *** Determining whether Glucose is installed Determining whether an ipasir shared library is installed Determining whether ABC is installed Determining whether Z3 is installed, for use by SMTLink ACL2_HAS_HONS := ACL2_HAS_ANSI := ACL2_HAS_PARALLEL := ACL2_HAS_REALS := ACL2_COMP_EXT := ACL2_HOST_LISP := OS_HAS_ABC := OS_HAS_GLUCOSE := OS_HAS_IPASIR := OS_HAS_SMTLINK := USE_QUICKLISP := Done with features. Scanning for books... real 0m0.142s user 0m0.019s sys 0m0.122s Scanning for dependencies... real 2m6.622s user 2m4.427s sys 0m1.927s Done scanning. Reading book deps Makefile-deps created on Fri Sep 23 13:42:39 -12 2022 Excluding books that need ACL2(h) [...] Excluding books that are CCL-only: [] Excluding books that need ANSI Common Lisp [...] Excluding books that need ABC: [centaur/glmc/counter.cert centaur/glmc/glmc-test.cert ] Excluding books that need Glucose: [centaur/aig/aig-sat-tests.cert centaur/esim/tests/add.cert centaur/esim/tests/common.cert centaur/esim/tests/divide.cert centaur/esim/tests/idiv.cert centaur/esim/tests/multiply.cert centaur/esim/tests/regs.cert centaur/esim/tests/subtract.cert centaur/esim/tutorial/boothmul.cert centaur/fgl/tests.cert centaur/glmc/counter.cert centaur/glmc/glmc-test.cert centaur/sv/tutorial/alu.cert centaur/sv/tutorial/boothpipe.cert centaur/sv/tutorial/counter.cert centaur/sv/tutorial/sums.cert workshops/2017/swords/support/demos.cert ] Excluding books that need Ipasir: [centaur/fgl/tests.cert centaur/ipasir/ipasir-backend-extra.cert centaur/ipasir/ipasir-backend.cert centaur/ipasir/ipasir-tests.cert centaur/ipasir/soundness-bug-fixed.cert centaur/ipasir/soundness-bug2-fixed.cert centaur/sv/tutorial/sums.cert workshops/2020/sumners/bake-models.cert workshops/2020/sumners/bake-proofs.cert workshops/2020/sumners/gen-models.cert workshops/2020/sumners/gl-fin-set.cert workshops/2020/sumners/top.cert ] Excluding books that need SMTLINK: [projects/smtlink/doc.cert projects/smtlink/examples/examples.cert projects/smtlink/examples/ringosc.cert ] Excluding ACL2(r)-only books: [nonstd/fft/fft-trig-with-axioms.cert nonstd/fft/fft-trig.cert nonstd/integrals/continuous-function.cert nonstd/integrals/equivalence-continuous-function.cert nonstd/integrals/equivalence-ftc.cert nonstd/integrals/equivalence-integrals.cert nonstd/integrals/ftc-1.cert nonstd/integrals/ftc-2.cert nonstd/integrals/integrable-functions.cert nonstd/integrals/integral-of-polynomials.cert nonstd/integrals/integration-composition-equivalences.cert nonstd/integrals/integration-composition.cert nonstd/integrals/make-partition.cert nonstd/integrals/split-integral-by-subintervals.cert nonstd/nsa/alternating-series.cert nonstd/nsa/chain-rule.cert nonstd/nsa/complex-polar.cert nonstd/nsa/continuity-product.cert nonstd/nsa/continuity.cert nonstd/nsa/derivative-raise.cert nonstd/nsa/derivatives-composition.cert nonstd/nsa/derivatives.cert nonstd/nsa/equivalence-continuity.cert nonstd/nsa/equivalence-derivatives-composition.cert nonstd/nsa/equivalence-derivatives.cert nonstd/nsa/equivalence-limits.cert nonstd/nsa/exp-continuous.cert nonstd/nsa/exp-sum.cert nonstd/nsa/exp.cert nonstd/nsa/factorial.cert nonstd/nsa/intervals.cert nonstd/nsa/inverse-derivatives.cert nonstd/nsa/inverse-monotone.cert nonstd/nsa/inverse-square.cert nonstd/nsa/inverse-trig.cert nonstd/nsa/inverses.cert nonstd/nsa/ln.cert nonstd/nsa/next-integer.cert nonstd/nsa/norm.cert nonstd/nsa/nsa.cert nonstd/nsa/overspill-proof.cert nonstd/nsa/overspill-test.cert nonstd/nsa/overspill.cert nonstd/nsa/raise.cert nonstd/nsa/sine.cert nonstd/nsa/sqrt.cert nonstd/nsa/trig-approx.cert nonstd/nsa/trig.cert nonstd/polynomials/polynomial-calculus.cert nonstd/polynomials/polynomial-defuns.cert nonstd/polynomials/polynomial-lemmas.cert nonstd/sqrt/no-sqrt.cert nonstd/transcendentals/nested-intervals-revised.cert nonstd/transcendentals/nested-intervals.cert nonstd/transcendentals/reals-are-uncountable-1.cert nonstd/transcendentals/reals-are-uncountable-2.cert nonstd/workshops/1999/analysis/continuity.cert nonstd/workshops/1999/analysis/derivatives.cert nonstd/workshops/1999/analysis/exercise1.cert nonstd/workshops/1999/analysis/exercise2.cert nonstd/workshops/1999/analysis/exercise3.cert nonstd/workshops/1999/analysis/exercise4.cert nonstd/workshops/1999/analysis/exercise5.cert nonstd/workshops/1999/analysis/exercise6.cert nonstd/workshops/1999/analysis/exercise7.cert nonstd/workshops/1999/analysis/exercise8.cert nonstd/workshops/1999/calculus/book/between-i-close-implies-i-close.cert nonstd/workshops/1999/calculus/book/between-limited-implies-limited.cert nonstd/workshops/1999/calculus/book/defaxioms.cert nonstd/workshops/1999/calculus/book/equal-riemann-rcfn-refinement-reduction.cert nonstd/workshops/1999/calculus/book/ftoc-lemma.cert nonstd/workshops/1999/calculus/book/fundamental-theorem-of-calculus.cert nonstd/workshops/1999/calculus/book/i-close-implies-abs-difference-small.cert nonstd/workshops/1999/calculus/book/i-limited-rcfn.cert nonstd/workshops/1999/calculus/book/i-small-maxlist-abslist-difflist-maps.cert nonstd/workshops/1999/calculus/book/integral-rcfn-equal-if-i-close.cert nonstd/workshops/1999/calculus/book/integral-rcfn-lemmas.cert nonstd/workshops/1999/calculus/book/integral-rcfn-quotient-between-non-classical.cert nonstd/workshops/1999/calculus/book/integral-rcfn.cert nonstd/workshops/1999/calculus/book/make-partition.cert nonstd/workshops/1999/calculus/book/map-rcfn-close-to-map-rcfn-refinement.cert nonstd/workshops/1999/calculus/book/map-rcfn-refinement-cdr-co-member.cert nonstd/workshops/1999/calculus/book/max-and-min-attained.cert nonstd/workshops/1999/calculus/book/max-x-between.cert nonstd/workshops/1999/calculus/book/maxlist-abslist-difflist-maps-lt.cert nonstd/workshops/1999/calculus/book/min-max-x-rec-lemmas.cert nonstd/workshops/1999/calculus/book/min-x-and-max-x-lemmas.cert nonstd/workshops/1999/calculus/book/min-x-between.cert nonstd/workshops/1999/calculus/book/next-gte-close.cert nonstd/workshops/1999/calculus/book/nsa-lemmas.cert nonstd/workshops/1999/calculus/book/nsa.cert nonstd/workshops/1999/calculus/book/partitions-give-i-close-riemann-sum.cert nonstd/workshops/1999/calculus/book/proof-outline.cert nonstd/workshops/1999/calculus/book/rcfn-next-gte-close.cert nonstd/workshops/1999/calculus/book/rcfn-standard-part.cert nonstd/workshops/1999/calculus/book/refinement-makes-i-small-change-1.cert nonstd/workshops/1999/calculus/book/refinement-makes-i-small-change.cert nonstd/workshops/1999/calculus/book/riemann-bound.cert nonstd/workshops/1999/calculus/book/riemann-defuns.cert nonstd/workshops/1999/calculus/book/riemann-lemmas.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-between.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-lower-bound.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-refinement-is-riemann-rcfn.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-upper-bound.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral-1.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral-2.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral.cert nonstd/workshops/1999/calculus/book/riemann.cert nonstd/workshops/1999/calculus/book/split-integral-by-subintervals.cert nonstd/workshops/1999/calculus/book/standard-part-equal-if-i-close.cert nonstd/workshops/1999/calculus/book/standard-part-preserves-between.cert nonstd/workshops/1999/calculus/book/standard-part-riemann-rcfn-is-standard.cert nonstd/workshops/1999/calculus/book/two-times-r-is-not-less-than-standard-part.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/abs-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/chain-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/composition-elem.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/differentiator.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/exp-minimal.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/exp-properties.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-square.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-trig-derivatives.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-trig-ex.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/ln-derivative-real.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/nsa-ex.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/product-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sin-cos-minimal.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sqrt-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sum-composition.cert nonstd/workshops/2013/helms-gamboa-quantum/support/quantum.cert projects/hybrid-systems/abs.cert projects/hybrid-systems/arith-nsa4.cert projects/hybrid-systems/computed-hints.cert projects/hybrid-systems/eexp.cert projects/hybrid-systems/example.cert projects/hybrid-systems/nsa.cert projects/hybrid-systems/o-real-p.cert projects/hybrid-systems/phi-exists.cert projects/hybrid-systems/phi-properties.cert projects/hybrid-systems/phi-unique.cert projects/hybrid-systems/tm-floor.cert workshops/2015/chau-kaufmann-hunt/support/cosines-orthog.cert workshops/2015/chau-kaufmann-hunt/support/fourier-coefficients-2.cert workshops/2015/chau-kaufmann-hunt/support/fourier-coefficients.cert workshops/2015/chau-kaufmann-hunt/support/fourier-inner-product.cert workshops/2015/chau-kaufmann-hunt/support/fourier-sums.cert workshops/2015/chau-kaufmann-hunt/support/int-infinite-sum-1.cert workshops/2015/chau-kaufmann-hunt/support/int-infinite-sum-2.cert workshops/2015/chau-kaufmann-hunt/support/int-sum.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/continuity-2.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/continuous-function-2.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/ftc-1-2.cert workshops/2015/chau-kaufmann-hunt/support/sine-cosine-orthog.cert workshops/2015/chau-kaufmann-hunt/support/sines-orthog.cert workshops/2015/chau-kaufmann-hunt/support/utils.cert workshops/2018/gamboa-cowles/complex-continuity.cert workshops/2018/gamboa-cowles/complex-lemmas.cert workshops/2018/gamboa-cowles/complex-polynomials.cert workshops/2018/gamboa-cowles/de-moivre.cert workshops/2018/gamboa-cowles/norm2.cert workshops/2018/kwan-greenstreet/cauchy-schwarz.cert workshops/2018/kwan-greenstreet/continuity.cert workshops/2018/kwan-greenstreet/convex.cert workshops/2018/kwan-greenstreet/ftc-2.cert workshops/2018/kwan-greenstreet/metric.cert workshops/2018/kwan-greenstreet/nesterov-1.cert workshops/2018/kwan-greenstreet/nesterov-2.cert workshops/2018/kwan-greenstreet/nesterov-3.cert workshops/2018/kwan-greenstreet/nesterov-4.cert workshops/2018/kwan-greenstreet/nesterov-top.cert workshops/2018/kwan-greenstreet/norm.cert workshops/2018/kwan-greenstreet/top.cert workshops/2018/kwan-greenstreet/vectors.cert workshops/2020/gamboa-cowles-gamboa/floor1-non-R.cert workshops/2020/gamboa-cowles-gamboa/norm-1C.cert workshops/2020/gamboa-cowles-gamboa/number-field.cert workshops/2020/gamboa-cowles-gamboa/polylist.cert workshops/2020/gamboa-cowles-gamboa/prior/raise-to.cert workshops/2020/kwan-peng-greenstreet/abstract-cs.cert ] Excluding books that depend on Quicklisp: [acl2s/cgen/fixers-gl-backend.cert centaur/4v-sexpr/sexpr-purebool-p.cert centaur/4v-sexpr/top.cert centaur/aig/aig-sat-tests.cert centaur/aig/aig-sat.cert centaur/aig/faig-purebool-p.cert centaur/aig/top-doc.cert centaur/aig/top.cert centaur/aignet/abc-wrappers.cert centaur/aignet/abc.cert centaur/aignet/cube-sat.cert centaur/aignet/top-doc.cert centaur/aignet/top.cert centaur/aignet/transforms.cert centaur/esim/stv/stv-debug.cert centaur/esim/stv/stv2c/top.cert centaur/esim/tests/add.cert centaur/esim/tests/common.cert centaur/esim/tests/divide.cert centaur/esim/tests/idiv.cert centaur/esim/tests/multiply.cert centaur/esim/tests/regs.cert centaur/esim/tests/subtract.cert centaur/esim/top-doc.cert centaur/esim/tutorial/alu16-book.cert centaur/esim/tutorial/boothmul.cert centaur/esim/tutorial/counter.cert centaur/esim/tutorial/intro.cert centaur/esim/vcd/vcd-impl.cert centaur/esim/vcd/vcd.cert centaur/fgl/equivcheck.cert centaur/fgl/sat-default.cert centaur/fgl/satlink-sat.cert centaur/fgl/tests.cert centaur/fgl/top-bare.cert centaur/fgl/top-doc.cert centaur/fgl/top.cert centaur/gl/bfr-fraig-satlink.cert centaur/gl/bfr-satlink.cert centaur/gl/gl-ttags.cert centaur/gl/top-doc.cert centaur/glmc/bfr-mcheck-abc.cert centaur/glmc/counter.cert centaur/glmc/glmc-test.cert centaur/ipasir/ipasir-backend-extra.cert centaur/ipasir/ipasir-backend.cert centaur/ipasir/ipasir-tests.cert centaur/ipasir/soundness-bug-fixed.cert centaur/ipasir/soundness-bug2-fixed.cert centaur/misc/sharedlibtest/app.cert centaur/misc/tshell-tests.cert centaur/misc/tshell.cert centaur/quicklisp/base.cert centaur/quicklisp/bordeaux.cert centaur/quicklisp/bt-semaphore.cert centaur/quicklisp/cffi.cert centaur/quicklisp/cl-fad.cert centaur/quicklisp/fastnumio.cert centaur/quicklisp/html-template.cert centaur/quicklisp/hunchentoot.cert centaur/quicklisp/osicat.cert centaur/quicklisp/shellpool.cert centaur/quicklisp/top.cert centaur/quicklisp/uiop.cert centaur/satlink/benchmarks.cert centaur/satlink/check-config.cert centaur/satlink/top.cert centaur/sv/cosims/cosims.cert centaur/sv/tutorial/alu.cert centaur/sv/tutorial/boothpipe.cert centaur/sv/tutorial/counter.cert centaur/sv/tutorial/sums.cert centaur/vl/kit/server.cert centaur/vl/kit/top.cert centaur/vl/loader/preprocessor/tests.cert centaur/vl/server/top.cert centaur/vl/top-doc.cert centaur/vl2014/kit/gather.cert centaur/vl2014/kit/json.cert centaur/vl2014/kit/lint.cert centaur/vl2014/kit/model.cert centaur/vl2014/kit/pp.cert centaur/vl2014/kit/progutils.cert centaur/vl2014/kit/server.cert centaur/vl2014/kit/shell.cert centaur/vl2014/kit/top.cert centaur/vl2014/server/file-layout.cert centaur/vl2014/server/server.cert centaur/vl2014/top-doc.cert doc/top-slow.cert doc/top.cert kestrel/hdwallet/top.cert kestrel/hdwallet/wallet-executable.cert kestrel/hdwallet/wallet-tests.cert kestrel/java/atj/implementation.cert kestrel/java/atj/input-processing.cert kestrel/java/atj/tests/abnf-deep-guarded.cert kestrel/java/atj/tests/abnf-deep-unguarded.cert kestrel/java/atj/tests/abnf-shallow-guarded.cert kestrel/java/atj/tests/abnf-shallow-unguarded.cert kestrel/java/atj/tests/abnf.cert kestrel/java/atj/tests/acl2-times.cert kestrel/java/atj/tests/factorial-deep-guarded.cert kestrel/java/atj/tests/factorial-deep-unguarded.cert kestrel/java/atj/tests/factorial-shallow-guarded.cert kestrel/java/atj/tests/factorial-shallow-unguarded.cert kestrel/java/atj/tests/factorial.cert kestrel/java/atj/tests/fibonacci-deep-guarded.cert kestrel/java/atj/tests/fibonacci-deep-unguarded.cert kestrel/java/atj/tests/fibonacci-shallow-guarded.cert kestrel/java/atj/tests/fibonacci-shallow-unguarded.cert kestrel/java/atj/tests/fibonacci.cert kestrel/java/atj/tests/multivalue-deep-guarded.cert kestrel/java/atj/tests/multivalue-deep-unguarded.cert kestrel/java/atj/tests/multivalue-shallow-guarded.cert kestrel/java/atj/tests/multivalue-shallow-unguarded.cert kestrel/java/atj/tests/multivalue.cert kestrel/java/atj/tests/natives-deep-guarded.cert kestrel/java/atj/tests/natives-deep-unguarded.cert kestrel/java/atj/tests/natives-shallow-guarded.cert kestrel/java/atj/tests/natives-shallow-unguarded.cert kestrel/java/atj/tests/natives.cert kestrel/java/atj/tests/primarrays-shallow-guarded.cert kestrel/java/atj/tests/primarrays.cert kestrel/java/atj/tests/primitives-deep-guarded.cert kestrel/java/atj/tests/primitives-deep-unguarded.cert kestrel/java/atj/tests/primitives-shallow-guarded.cert kestrel/java/atj/tests/primitives-shallow-unguarded.cert kestrel/java/atj/tests/primitives.cert kestrel/java/atj/top.cert kestrel/java/top.cert kestrel/top-doc.cert kestrel/top.cert oslib/copy.cert oslib/dirname.cert oslib/file-types.cert oslib/ls.cert oslib/mkdir.cert oslib/rmtree.cert oslib/tests/copy.cert oslib/tests/dirname.cert oslib/tests/file-types.cert oslib/tests/ls.cert oslib/tests/mkdir.cert oslib/tests/top.cert oslib/top.cert projects/doc.cert projects/include-doc.cert projects/rp-rewriter/lib/mult/demo.cert projects/rp-rewriter/lib/mult2/demo.cert projects/sidekick/eventdata.cert projects/sidekick/explore.cert projects/sidekick/lint.cert projects/sidekick/lock.cert projects/sidekick/lookup.cert projects/sidekick/server.cert projects/sidekick/session.cert projects/sidekick/top.cert projects/sidekick/webcommand.cert projects/smtlink/config.cert projects/smtlink/doc.cert projects/smtlink/examples/examples.cert projects/smtlink/examples/inverter.cert projects/smtlink/examples/ringosc.cert projects/smtlink/examples/util.cert projects/smtlink/top.cert projects/smtlink/trusted/prove.cert projects/smtlink/trusted/run.cert projects/smtlink/trusted/trusted-cp.cert projects/smtlink/trusted/write.cert projects/smtlink/trusted/z3-py/header.cert projects/smtlink/trusted/z3-py/recover-type-hyp.cert projects/smtlink/trusted/z3-py/translate-type.cert projects/smtlink/trusted/z3-py/translator.cert projects/smtlink/verified/Smtlink.cert projects/smtlink/verified/add-hypo-cp.cert projects/smtlink/verified/computed-hints.cert projects/smtlink/verified/expand-cp.cert projects/smtlink/verified/extractor.cert projects/smtlink/verified/hint-interface.cert projects/smtlink/verified/hint-please.cert projects/smtlink/verified/type-extract-cp.cert projects/smtlink/verified/type-hyp.cert projects/smtlink/verified/uninterpreted-fn-cp.cert projects/top-doc.cert quicklisp/base.cert quicklisp/bordeaux.cert quicklisp/bt-semaphore.cert quicklisp/cffi.cert quicklisp/cl-fad.cert quicklisp/fastnumio.cert quicklisp/html-template.cert quicklisp/hunchentoot.cert quicklisp/osicat.cert quicklisp/shellpool.cert quicklisp/top.cert quicklisp/uiop.cert system/doc/acl2-manual.cert tools/oracle-timelimit-tests.cert tools/oracle-timelimit.cert workshops/2017/swords/support/demos.cert workshops/2018/sumners/exa.cert workshops/2018/sumners/exbase.cert workshops/2018/sumners/exloop.cert workshops/2018/sumners/exsim.cert workshops/2018/sumners/extra.cert workshops/2018/sumners/readme.cert workshops/2018/sumners/svcnf.cert workshops/2020/kwan-peng-greenstreet/abstract-cs.cert workshops/2020/sswords-rewriter/support.cert workshops/2020/sumners/bake-models.cert workshops/2020/sumners/bake-proofs.cert workshops/2020/sumners/gen-models.cert workshops/2020/sumners/gl-fin-set.cert workshops/2020/sumners/gl-setup.cert workshops/2020/sumners/top.cert xdoc/all.cert xdoc/save-fancy.cert xdoc/save-rendered.cert xdoc/save.cert ] Using clean.pl to remove certificates, etc. /build/acl2-8.3dfsg/books/build/clean.pl clean.pl: scanning for generated files clean.pl: found 3 targets (1 seconds) clean.pl: deleted 3 files (0 seconds) Cleaning up Quicklisp files cd quicklisp; ./clean.sh Cleaning quicklisp/bundle (only compiled files 'bundle.*', since outside git repository) Cleaning asdf-home/cache/common-lisp Cleaning quicklisp books clean.pl: scanning for generated files clean.pl: found 0 targets (0 seconds) clean.pl: deleted 0 files (0 seconds) if [ -d projects/milawa/ACL2 ] ; then \ cd projects/milawa/ACL2; /usr/bin/make clean ; \ fi make[3]: Entering directory '/build/acl2-8.3dfsg/books/projects/milawa/ACL2' Calculating cert dependencies... Calculating pcert dependencies... Done with dependencies. Cleaning ACL2 directory (certificates, ACL2 images, etc.) clean.pl: scanning for generated files clean.pl: found 1 targets (0 seconds) clean.pl: deleted 1 files (0 seconds) Cleaning ../Proofs directory. make[3]: Leaving directory '/build/acl2-8.3dfsg/books/projects/milawa/ACL2' Cleaning centaur/vl/bin directory Cleaning centaur/vl2014/bin directory Removing extra, explicitly temporary files. rm -rf /build/acl2-8.3dfsg/books/build/Makefile-comp /build/acl2-8.3dfsg/books/build/Makefile-comp-pre /build/acl2-8.3dfsg/books/build/Makefile-deps /build/acl2-8.3dfsg/books/build/Makefile-books /build/acl2-8.3dfsg/books/build/Makefile-features /build/acl2-8.3dfsg/books/build/Makefile-cache serialize/test.sao bdd/benchmarks.lisp nonstd/workshops/1999/calculus/book/tree.lisp centaur/getopt/demo2.core centaur/getopt/demo2.gcl centaur/getopt/demo2.lw centaur/getopt/demo2.lx86cl64 centaur/getopt/demo2.dx86cl64 centaur/getopt/demo2.ccl nonstd/workshops/1999/calculus/book/outline/ projects/sat/lrat/incremental/lrat-check projects/sat/lrat/incremental/lrat-check.* projects/sat/lrat/cube/cube-check projects/sat/lrat/cube/cube-check.* projects/apply-model/ex1/evaluation-apply.lisp projects/apply-model/ex1/evaluation-user-defs.lisp projects/apply-model/ex2/evaluation-apply.lisp projects/apply-model/ex2/evaluation-user-defs.lisp projects/apply-model-2/ex1/evaluation-apply.lisp projects/apply-model-2/ex1/evaluation-user-defs.lisp projects/apply-model-2/ex2/evaluation-apply.lisp projects/apply-model-2/ex2/evaluation-user-defs.lisp for dir in system/toothbrush/ clause-processors/SULFA/ projects/translators/l3-to-acl2/ workshops/1999/multiplier/ workshops/2003/greve-wilding-vanfleet/support/ workshops/2003/kaufmann/support/input/ workshops/2004/sumners-ray/support/ projects/apply-model/ projects/apply-model-2/ \ workshops/2003/kaufmann/support/rtl ; \ do \ if [ -f $dir/Makefile ] ; then \ (cd $dir ; /usr/bin/make clean) ; \ fi ; \ done make[3]: Entering directory '/build/acl2-8.3dfsg/books/system/toothbrush' Updating dependencies in /build/acl2-8.3dfsg/books/system/toothbrush Note: For toothbrush, ACL2_DIR = /build/acl2-8.3dfsg/. rm -f defined-syms.lsp rm -f success.txt cd tests ; /usr/bin/make clean make[4]: Entering directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests' make[5]: Entering directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests/test1' Updating dependencies in /build/acl2-8.3dfsg/books/system/toothbrush/tests/test1 rm -f output.lsp success.txt tb-exec* rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[5]: Leaving directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests/test1' make[5]: Entering directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests/test2' Updating dependencies in /build/acl2-8.3dfsg/books/system/toothbrush/tests/test2 rm -f output.lsp success.txt tb-exec* rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[5]: Leaving directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests/test2' make[5]: Entering directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests/test-par' Updating dependencies in /build/acl2-8.3dfsg/books/system/toothbrush/tests/test-par rm -f output.lsp success.txt tb-exec* rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[5]: Leaving directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests/test-par' make[5]: Entering directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests/dag-unification' Updating dependencies in /build/acl2-8.3dfsg/books/system/toothbrush/tests/dag-unification rm -f output.lsp success.txt tb-exec* rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[5]: Leaving directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests/dag-unification' make[4]: Leaving directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests' rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/system/toothbrush' make[3]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA' rm -f \#*\# *~ rm -f scripts/interpret_sulfa_file /usr/bin/make PERL=perl SAT_SOLVER=/build/acl2-8.3dfsg/books/clause-processors/SULFA/../../../aux/minisat2//minisat/core/minisat SAT_SOLVER_TYPE=minisat CC=gcc clean-subdirs make[4]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA' for dir in scripts c-files books; do \ /usr/bin/make PERL=perl SAT_SOLVER=/build/acl2-8.3dfsg/books/clause-processors/SULFA/../../../aux/minisat2//minisat/core/minisat SAT_SOLVER_TYPE=minisat CC=gcc clean -C $dir; \ done make[5]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/scripts' rm -f sexpr-sat-solver *~ \#*\# rm -f *acl2_with_smt* temp_command_file.lisp rm -fr sat-temp-files rm -fr sulfa_smt_temp rm -f sulfa-smt rm -f interpret_sulfa_file make[5]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/scripts' make[5]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/c-files' rm -f sat-input-formater smt-prep zchaff-output-formater minisat-output-formater *~ #*# make[5]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/c-files' make[5]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books' make[6]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books/sat' rm -f \#*\# *.cert *~ *.sexpr *.d *.sot sulfa-dir-const.lisp sat-setup.data rm -f -r sat-temp-files rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[6]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books/sat' make[6]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books/clause-processors' Updating dependencies in /build/acl2-8.3dfsg/books/clause-processors/SULFA/books/clause-processors rm -f *.cert *~ *.sexpr *.d *.sot *~ \#*\# rm -f -r sat-temp-files rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[6]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books/clause-processors' make[6]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books/sat-tests' rm -f *.cert *~ *.sexpr *.d *.sot rm -f -r sat-temp-files rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[6]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books/sat-tests' make[6]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books/bv-smt-solver' Updating dependencies in /build/acl2-8.3dfsg/books/clause-processors/SULFA/books/bv-smt-solver rm -f *.cert *~ *.sexpr *.d *.sot *~ \#*\# *.smt *.prepped rm -fr sat-temp-files rm -f *.bak rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[6]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books/bv-smt-solver' make[5]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books' make[4]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA' make[3]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA' make[3]: Entering directory '/build/acl2-8.3dfsg/books/projects/translators/l3-to-acl2' Makefile:22: ACL2_DIR is /build/acl2-8.3dfsg make[4]: Entering directory '/build/acl2-8.3dfsg/books/projects/translators/l3-to-acl2/translator' Updating dependencies in /build/acl2-8.3dfsg/books/projects/translators/l3-to-acl2/translator rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[4]: Leaving directory '/build/acl2-8.3dfsg/books/projects/translators/l3-to-acl2/translator' make[4]: Entering directory '/build/acl2-8.3dfsg/books/projects/translators/l3-to-acl2/examples/thacker' Makefile:35: L3_TO_ACL2_DIR is /build/acl2-8.3dfsg/books/projects/translators/l3-to-acl2/translator rm -f tiny.lisp tiny-logic.lisp run-check.txt rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[4]: Leaving directory '/build/acl2-8.3dfsg/books/projects/translators/l3-to-acl2/examples/thacker' rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/projects/translators/l3-to-acl2' make[3]: Entering directory '/build/acl2-8.3dfsg/books/workshops/1999/multiplier' rm -f fmul.lisp fmul-star.lisp rm -f *.tem rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/workshops/1999/multiplier' make[3]: Entering directory '/build/acl2-8.3dfsg/books/workshops/2003/greve-wilding-vanfleet/support' rm -f consistency-test.lisp make.lisp consistency-test-passed.lisp rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/workshops/2003/greve-wilding-vanfleet/support' make[3]: Entering directory '/build/acl2-8.3dfsg/books/workshops/2003/kaufmann/support/input' rm -f defs-out.lisp defs-eq.lisp lemmas-out.lisp check.txt rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/workshops/2003/kaufmann/support/input' make[3]: Entering directory '/build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support' Updating dependencies in /build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support rm -f *.rpt rm -f success.txt rm -f run.date run.log run.err rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support' make[3]: Entering directory '/build/acl2-8.3dfsg/books/projects/apply-model' cd ex1 ; /usr/bin/make clean make[4]: Entering directory '/build/acl2-8.3dfsg/books/projects/apply-model/ex1' System books directory is /build/acl2-8.3dfsg/books rm -f evaluation-apply.lisp evaluation-user-defs.lisp Makefile-deps rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[4]: Leaving directory '/build/acl2-8.3dfsg/books/projects/apply-model/ex1' cd ex2 ; /usr/bin/make clean make[4]: Entering directory '/build/acl2-8.3dfsg/books/projects/apply-model/ex2' System books directory is /build/acl2-8.3dfsg/books rm -f evaluation-apply.lisp evaluation-user-defs.lisp Makefile-deps rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[4]: Leaving directory '/build/acl2-8.3dfsg/books/projects/apply-model/ex2' rm -f Makefile-tmp rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/projects/apply-model' make[3]: Entering directory '/build/acl2-8.3dfsg/books/projects/apply-model-2' cd ex1 ; /usr/bin/make clean make[4]: Entering directory '/build/acl2-8.3dfsg/books/projects/apply-model-2/ex1' System books directory is /build/acl2-8.3dfsg/books rm -f evaluation-apply.lisp evaluation-user-defs.lisp Makefile-deps rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[4]: Leaving directory '/build/acl2-8.3dfsg/books/projects/apply-model-2/ex1' cd ex2 ; /usr/bin/make clean make[4]: Entering directory '/build/acl2-8.3dfsg/books/projects/apply-model-2/ex2' System books directory is /build/acl2-8.3dfsg/books rm -f evaluation-apply.lisp evaluation-user-defs.lisp Makefile-deps rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[4]: Leaving directory '/build/acl2-8.3dfsg/books/projects/apply-model-2/ex2' rm -f Makefile-tmp rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/projects/apply-model-2' make[3]: Entering directory '/build/acl2-8.3dfsg/books/workshops/2003/kaufmann/support/rtl' rm -f model.lisp model-defs.lisp model-eq.lisp model.lisp bvecp.lisp rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/workshops/2003/kaufmann/support/rtl' Removing even more generated files (documentation, etc). rm -rf doc/manual system/doc/manual system/doc/manual-fast doc/xdoc.sao make[2]: Leaving directory '/build/acl2-8.3dfsg/books' make[1]: Leaving directory '/build/acl2-8.3dfsg' find books -name "*.final" -exec rm {} \; rm -f saved_acl2 init_nsaved1_acl2.lsp worklispext rm -f debian/mini-proveall.out books/short-test.log debian/test.log rm -f foo.lsp nsaved_acl2 for i in data c h ; do \ for j in $(find -name "*.$i") ; do\ k=$(echo $j | sed "s,\.$i$,,1") ;\ ! [ -e $k.lisp ] || rm $j ; \ done ; \ done rm -f books/bdd/benchmarks.data acl2r.lisp tmp rm -f debian/dpatches debian/acl2.install debian/acl2-source.install debian/acl2-emacs.install debian/acl2-doc.install debian/acl2-books.install debian/acl2-books-source.install debian/acl2-books-certs.install debian/acl2-infix.install debian/acl2-infix-source.install debian/acl2.links debian/acl2-books.links debian/acl2-infix.links debian/README.Debian saved_acl2* rm -f debian/dlopen.lisp debian/acl2-emacs.emacsen-startup rm -f debian/acl2.sh pgcl books/Makefile-tmp books/coi/gensym/gensym.out sys-proclaim.lisp rm -f books/coi/gensym/Makefile-deps books/coi/gensym/workxxx.gensym books/system/doc/rendered-doc.lsp rm -rf doc/HTML-old doc/EMACS-old doc/acl2-wc.txt books/std/io/test.sao rm -f books/centaur/bitops/bitsets-opt-raw.o books/centaur/vl/util/gc-raw.o \ books/centaur/misc/tshell-raw.o books/centaur/vl/Makefile-tmp \ books/build/Makefile-sources books/build/Makefile-certs rm -f books/build/acl2-exports.certdep books/build/acl2-version.certdep \ books/build/first-order-like-terms-and-out-arities.certdep \ books/build/ground-zero-theory.certdep gcl_pool rm -f debian/acl2.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 dh_clean -XTAGS debian/rules build /usr/bin/make GCL_ANSI=t LISP=gcl make[1]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 rm -f acl2r.lisp /usr/bin/make acl2r.lisp make[2]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 make[2]: Leaving directory '/build/acl2-8.3dfsg' /usr/bin/make acl2r make[2]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 rm -f acl2r.lisp /usr/bin/make acl2r.lisp make[3]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 make[3]: Leaving directory '/build/acl2-8.3dfsg' make[2]: Leaving directory '/build/acl2-8.3dfsg' rm -f TAGS rm -f workxxx echo '(load "init.lisp")' > workxxx echo '(acl2::make-tags)' >> workxxx echo '(acl2::exit-lisp)' >> workxxx gcl < workxxx GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files: /tmp/ >;; Loading "init.lisp" ;; Loading "acl2r.lisp" ;; Finished loading "acl2r.lisp" ;; Loading "acl2-init.lisp" ;; Loading "acl2.lisp" ;; Note: Tail-recursive call of GET-TYPE-FROM-DCLS was replaced by iteration. ;; Note: Tail-recursive call of COLLECT-TYPES was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of REV1@ was replaced by iteration. ;; Note: Tail-recursive call of ACL2-READ-CHARACTER-STRING was replaced by iteration. ;; Note: Tail-recursive call of FANCY-STRING-READER-ESCAPE-CHECK was replaced by iteration. ;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration. ;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration.;; Finished loading "acl2.lisp" ;; Finished loading "acl2-init.lisp" ;; Finished loading "init.lisp" T >GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files: /tmp/ >/usr/bin/etags 0 0 >rm -f workxxx if [ -f TAGS ] ; then chmod 644 TAGS ; fi /usr/bin/make compile make[2]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 rm -f workxxx echo '(load "init.lisp")' > workxxx echo '(let (#+gcl(compiler::*split-files* 1000000))(acl2::compile-acl2 ))' >> workxxx echo '(acl2::exit-lisp)' >> workxxx gcl < workxxx GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files: /tmp/ >;; Loading "init.lisp" ;; Loading "acl2r.lisp" ;; Finished loading "acl2r.lisp" ;; Loading "acl2-init.lisp" ;; Loading "acl2.lisp" ;; Note: Tail-recursive call of GET-TYPE-FROM-DCLS was replaced by iteration. ;; Note: Tail-recursive call of COLLECT-TYPES was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of REV1@ was replaced by iteration. ;; Note: Tail-recursive call of ACL2-READ-CHARACTER-STRING was replaced by iteration. ;; Note: Tail-recursive call of FANCY-STRING-READER-ESCAPE-CHECK was replaced by iteration. ;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration. ;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration.;; Finished loading "acl2.lisp" ;; Finished loading "acl2-init.lisp" ;; Finished loading "init.lisp" T >GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files: /tmp/ >Check completed. /build/acl2-8.3dfsg/serialize-raw.c: In function 'L43': /build/acl2-8.3dfsg/serialize-raw.c:4720:11: warning: self-comparison always evaluates to true [-Wtautological-compare] 4720 | if((Cnil)==Cnil){ | ^~ /build/acl2-8.3dfsg/serialize-raw.c:4876:11: warning: self-comparison always evaluates to true [-Wtautological-compare] 4876 | if((Cnil)==Cnil){ | ^~ /build/acl2-8.3dfsg/hons-raw.c: In function 'L27': /build/acl2-8.3dfsg/hons-raw.c:2443:11: warning: self-comparison always evaluates to true [-Wtautological-compare] 2443 | if((Cnil)==Cnil){ | ^~ /build/acl2-8.3dfsg/hons-raw.c: In function 'L65': /build/acl2-8.3dfsg/hons-raw.c:5149:11: warning: self-comparison always evaluates to true [-Wtautological-compare] 5149 | if((Cnil)==Cnil){ | ^~ /build/acl2-8.3dfsg/translate.c: In function 'L397': /build/acl2-8.3dfsg/translate.c:36323:11: warning: self-comparison always evaluates to true [-Wtautological-compare] 36323 | if((Cnil)==Cnil){ | ^~ /build/acl2-8.3dfsg/translate.c:36778:11: warning: self-comparison always evaluates to false [-Wtautological-compare] 36778 | if((Cnil)!=Cnil){ | ^~ /build/acl2-8.3dfsg/translate.c:37173:11: warning: self-comparison always evaluates to false [-Wtautological-compare] 37173 | if((Cnil)!=Cnil){ | ^~ /build/acl2-8.3dfsg/translate.c:37483:11: warning: self-comparison always evaluates to true [-Wtautological-compare] 37483 | if((Cnil)==Cnil){ | ^~ NIL >make[3]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 make[3]: Leaving directory '/build/acl2-8.3dfsg' make[2]: Leaving directory '/build/acl2-8.3dfsg' rm -f acl2-proclaims.lisp /usr/bin/make acl2-proclaims.lisp make[2]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 rm -f acl2-proclaims.lisp rm -f workxxx rm -f worklispext echo '(load "init.lisp")' > workxxx echo '(in-package "ACL2")' >> workxxx echo '(generate-acl2-proclaims)' >> workxxx echo '(exit-lisp)' >> workxxx gcl < workxxx GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files: /tmp/ >;; Loading "init.lisp" ;; Loading "acl2r.lisp" ;; Finished loading "acl2r.lisp" ;; Loading "acl2-init.lisp" ;; Loading "acl2.lisp" ;; Note: Tail-recursive call of GET-TYPE-FROM-DCLS was replaced by iteration. ;; Note: Tail-recursive call of COLLECT-TYPES was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of REV1@ was replaced by iteration. ;; Note: Tail-recursive call of ACL2-READ-CHARACTER-STRING was replaced by iteration. ;; Note: Tail-recursive call of FANCY-STRING-READER-ESCAPE-CHECK was replaced by iteration. ;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration. ;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration.;; Finished loading "acl2.lisp" ;; Finished loading "acl2-init.lisp" ;; Finished loading "init.lisp" T >GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files: /tmp/ > #<"ACL2" package> ACL2> NIL ACL2>[ -f acl2-proclaims.lisp ] make[2]: Leaving directory '/build/acl2-8.3dfsg' /usr/bin/make compile USE_ACL2_PROCLAIMS=t make[2]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 rm -f workxxx echo '(load "init.lisp")' > workxxx echo '(let (#+gcl(compiler::*split-files* 1000000))(acl2::compile-acl2 t))' >> workxxx echo '(acl2::exit-lisp)' >> workxxx gcl < workxxx GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files: /tmp/ >;; Loading "init.lisp" ;; Loading "acl2r.lisp" ;; Finished loading "acl2r.lisp" ;; Loading "acl2-init.lisp" ;; Loading "acl2.lisp" ;; Note: Tail-recursive call of GET-TYPE-FROM-DCLS was replaced by iteration. ;; Note: Tail-recursive call of COLLECT-TYPES was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of REV1@ was replaced by iteration. ;; Note: Tail-recursive call of ACL2-READ-CHARACTER-STRING was replaced by iteration. ;; Note: Tail-recursive call of FANCY-STRING-READER-ESCAPE-CHECK was replaced by iteration. ;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration. ;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration.;; Finished loading "acl2.lisp" ;; Finished loading "acl2-init.lisp" ;; Finished loading "init.lisp" T >GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files: /tmp/ >/build/acl2-8.3dfsg/serialize-raw.c: In function 'LI43': /build/acl2-8.3dfsg/serialize-raw.c:4284:11: warning: self-comparison always evaluates to true [-Wtautological-compare] 4284 | if((Cnil)==Cnil){ | ^~ /build/acl2-8.3dfsg/serialize-raw.c:4414:11: warning: self-comparison always evaluates to true [-Wtautological-compare] 4414 | if((Cnil)==Cnil){ | ^~ /build/acl2-8.3dfsg/hons-raw.c: In function 'LI27': /build/acl2-8.3dfsg/hons-raw.c:2201:11: warning: self-comparison always evaluates to true [-Wtautological-compare] 2201 | if((Cnil)==Cnil){ | ^~ /build/acl2-8.3dfsg/hons-raw.c: In function 'LI65': /build/acl2-8.3dfsg/hons-raw.c:4081:11: warning: self-comparison always evaluates to true [-Wtautological-compare] 4081 | if((Cnil)==Cnil){ | ^~ /build/acl2-8.3dfsg/translate.c: In function 'L397': /build/acl2-8.3dfsg/translate.c:29321:11: warning: self-comparison always evaluates to true [-Wtautological-compare] 29321 | if((Cnil)==Cnil){ | ^~ /build/acl2-8.3dfsg/translate.c:29691:11: warning: self-comparison always evaluates to false [-Wtautological-compare] 29691 | if((Cnil)!=Cnil){ | ^~ /build/acl2-8.3dfsg/translate.c:30014:11: warning: self-comparison always evaluates to false [-Wtautological-compare] 30014 | if((Cnil)!=Cnil){ | ^~ /build/acl2-8.3dfsg/translate.c:30265:11: warning: self-comparison always evaluates to true [-Wtautological-compare] 30265 | if((Cnil)==Cnil){ | ^~ NIL >make[3]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 make[3]: Leaving directory '/build/acl2-8.3dfsg' make[2]: Leaving directory '/build/acl2-8.3dfsg' rm -f workxxx rm -f worklispext echo -n "" >> osaved_acl2 rm -f osaved_acl2 echo '(load "init.lisp")' > workxxx echo '(in-package "ACL2")' >> workxxx echo '(save-acl2 (quote (initialize-acl2 (quote include-book) acl2::*acl2-pass-2-files*)) "saved_acl2")' >> workxxx echo '(exit-lisp)' >> workxxx gcl < workxxx GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files: /tmp/ >;; Loading "init.lisp" ;; Loading "acl2r.lisp" ;; Finished loading "acl2r.lisp" ;; Loading "acl2-init.lisp" ;; Loading "acl2.lisp" ;; Note: Tail-recursive call of GET-TYPE-FROM-DCLS was replaced by iteration. ;; Note: Tail-recursive call of COLLECT-TYPES was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration. ;; Note: Tail-recursive call of REV1@ was replaced by iteration. ;; Note: Tail-recursive call of ACL2-READ-CHARACTER-STRING was replaced by iteration. ;; Note: Tail-recursive call of FANCY-STRING-READER-ESCAPE-CHECK was replaced by iteration. ;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration. ;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration.;; Finished loading "acl2.lisp" ;; Finished loading "acl2-init.lisp" ;; Finished loading "init.lisp" T >GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files: /tmp/ > #<"ACL2" package> ACL2>[GC for 528 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 0 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 211 SYMBOL pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 316 SYMBOL pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 6400 CONTIGUOUS-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 22 CFUN pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 20 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 391 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 391 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1563 RELOCATABLE-BLOCKS pages..(T=4).GC finished] [GC for 103 SFUN pages..(T=2).GC finished] [GC for 103 SFUN pages..(T=2).GC finished] [GC for 103 SFUN pages..(T=3).GC finished] [GC for 103 SFUN pages..(T=3).GC finished] [GC for 113 SFUN pages..(T=3).GC finished] [GC for 113 SFUN pages..(T=3).GC finished] [GC for 113 SFUN pages..(T=3).GC finished] [GC for 123 SFUN pages..(T=2).GC finished] [GC for 123 SFUN pages..(T=2).GC finished] [GC for 123 SFUN pages..(T=3).GC finished] [GC for 133 SFUN pages..(T=3).GC finished] [GC for 133 SFUN pages..(T=3).GC finished] [GC for 133 SFUN pages..(T=3).GC finished] [GC for 143 SFUN pages..(T=3).GC finished] [GC for 143 SFUN pages..(T=3).GC finished] [GC for 153 SFUN pages..(T=3).GC finished] [GC for 153 SFUN pages..(T=3).GC finished] [GC for 153 SFUN pages..(T=3).GC finished] [GC for 163 SFUN pages..(T=3).GC finished] [GC for 163 SFUN pages..(T=3).GC finished] [GC for 173 SFUN pages..(T=3).GC finished] [GC for 173 SFUN pages..(T=3).GC finished] [GC for 183 SFUN pages..(T=3).GC finished] [GC for 183 SFUN pages..(T=3).GC finished] [GC for 897 CONS pages..(T=3).GC finished] [GC for 193 SFUN pages..(T=3).GC finished] [GC for 897 CONS pages..(T=3).GC finished] [GC for 897 CONS pages..(T=4).GC finished] [GC for 897 CONS pages..(T=3).GC finished] [GC for 203 SFUN pages..(T=3).GC finished] [GC for 897 CONS pages..(T=3).GC finished] [GC for 897 CONS pages..(T=3).GC finished] [GC for 897 CONS pages..(T=3).GC finished] [GC for 907 CONS pages..(T=3).GC finished] [GC for 917 CONS pages..(T=3).GC finished] [GC for 927 CONS pages..(T=3).GC finished] [GC for 937 CONS pages..(T=4).GC finished] [GC for 947 CONS pages..(T=3).GC finished] [GC for 957 CONS pages..(T=3).GC finished] [GC for 967 CONS pages..(T=3).GC finished] [GC for 977 CONS pages..(T=4).GC finished] [GC for 987 CONS pages..(T=3).GC finished] [GC for 997 CONS pages..(T=3).GC finished] [GC for 1007 CONS pages..(T=3).GC finished] [GC for 1017 CONS pages..(T=4).GC finished] [GC for 1027 CONS pages..(T=3).GC finished] [GC for 1037 CONS pages..(T=3).GC finished] [GC for 1047 CONS pages..(T=3).GC finished] [GC for 1057 CONS pages..(T=3).GC finished] [GC for 1067 CONS pages..(T=3).GC finished] [GC for 1077 CONS pages..(T=4).GC finished] [GC for 1087 CONS pages..(T=3).GC finished] [GC for 1097 CONS pages..(T=3).GC finished] [GC for 1107 CONS pages..(T=4).GC finished] [GC for 1117 CONS pages..(T=3).GC finished] [GC for 1127 CONS pages..(T=4).GC finished] [GC for 1137 CONS pages..(T=3).GC finished] [GC for 1147 CONS pages..(T=3).GC finished] [GC for 1157 CONS pages..(T=4).GC finished] [GC for 1167 CONS pages..(T=3).GC finished] [GC for 1177 CONS pages..(T=4).GC finished] [GC for 1187 CONS pages..(T=3).GC finished] [GC for 1197 CONS pages..(T=4).GC finished] [GC for 1207 CONS pages..(T=3).GC finished] [GC for 1217 CONS pages..(T=4).GC finished] [GC for 1227 CONS pages..(T=3).GC finished] [GC for 1237 CONS pages..(T=4).GC finished] [GC for 1247 CONS pages..(T=3).GC finished] [GC for 1257 CONS pages..(T=4).GC finished] [GC for 1267 CONS pages..(T=3).GC finished] [GC for 1277 CONS pages..(T=4).GC finished] [GC for 1287 CONS pages..(T=3).GC finished] [GC for 1297 CONS pages..(T=4).GC finished] [GC for 1307 CONS pages..(T=3).GC finished] [GC for 1317 CONS pages..(T=4).GC finished] [GC for 1327 CONS pages..(T=4).GC finished] [GC for 1337 CONS pages..(T=3).GC finished] [GC for 1347 CONS pages..(T=4).GC finished] [GC for 1357 CONS pages..(T=3).GC finished] [GC for 1367 CONS pages..(T=4).GC finished] [GC for 1377 CONS pages..(T=4).GC finished] [GC for 1387 CONS pages..(T=3).GC finished] [GC for 1397 CONS pages..(T=4).GC finished] [GC for 1407 CONS pages..(T=4).GC finished] [GC for 1417 CONS pages..(T=3).GC finished] [GC for 1427 CONS pages..(T=4).GC finished] [GC for 1437 CONS pages..(T=4).GC finished] [GC for 1447 CONS pages..(T=3).GC finished] [GC for 1457 CONS pages..(T=4).GC finished] [GC for 1467 CONS pages..(T=4).GC finished] [GC for 1477 CONS pages..(T=3).GC finished] [GC for 1487 CONS pages..(T=4).GC finished] [GC for 1497 CONS pages..(T=4).GC finished] [GC for 1507 CONS pages..(T=4).GC finished] [GC for 1517 CONS pages..(T=4).GC finished] [GC for 213 SFUN pages..(T=4).GC finished] [GC for 1527 CONS pages..(T=4).GC finished] [GC for 8960 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 1537 CONS pages..(T=4).GC finished] [GC for 1547 CONS pages..(T=4).GC finished] [GC for 1557 CONS pages..(T=4).GC finished] [GC for 1567 CONS pages..(T=4).GC finished] [GC for 223 SFUN pages..(T=4).GC finished] [GC for 1577 CONS pages..(T=4).GC finished] [GC for 1587 CONS pages..(T=4).GC finished] [GC for 1597 CONS pages..(T=4).GC finished] [GC for 1607 CONS pages..(T=4).GC finished] [GC for 1617 CONS pages..(T=4).GC finished] [GC for 1627 CONS pages..(T=4).GC finished] [GC for 233 SFUN pages..(T=4).GC finished] [GC for 243 SFUN pages..(T=4).GC finished] [GC for 1563 RELOCATABLE-BLOCKS pages..(T=5).GC finished] [GC for 1637 CONS pages..(T=4).GC finished] [GC for 10496 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] [GC for 1647 CONS pages..(T=4).GC finished] [GC for 1657 CONS pages..(T=4).GC finished] [GC for 253 SFUN pages..(T=4).GC finished] [GC for 1667 CONS pages..(T=4).GC finished] [GC for 1677 CONS pages..(T=4).GC finished] [GC for 1687 CONS pages..(T=4).GC finished] [GC for 1697 CONS pages..(T=4).GC finished] [GC for 1707 CONS pages..(T=5).GC finished] [GC for 10752 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 263 SFUN pages..(T=4).GC finished] [GC for 1717 CONS pages..(T=4).GC finished] [GC for 1727 CONS pages..(T=5).GC finished] [GC for 1737 CONS pages..(T=4).GC finished] [GC for 1747 CONS pages..(T=4).GC finished] [GC for 273 SFUN pages..(T=4).GC finished] [GC for 11008 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] [GC for 1757 CONS pages..(T=5).GC finished] [GC for 1767 CONS pages..(T=4).GC finished] [GC for 11264 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] [GC for 1777 CONS pages..(T=5).GC finished] [GC for 283 SFUN pages..(T=5).GC finished] [GC for 1787 CONS pages..(T=4).GC finished] [GC for 1797 CONS pages..(T=5).GC finished] [GC for 1807 CONS pages..(T=5).GC finished] [GC for 1817 CONS pages..(T=5).GC finished] [GC for 32 CFUN pages..(T=4).GC finished] [GC for 293 SFUN pages..(T=5).GC finished] [GC for 11520 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] [GC for 1827 CONS pages..(T=5).GC finished] [GC for 1837 CONS pages..(T=5).GC finished] [GC for 1847 CONS pages..(T=5).GC finished] [GC for 1857 CONS pages..(T=5).GC finished] [GC for 1867 CONS pages..(T=5).GC finished] [GC for 1877 CONS pages..(T=5).GC finished] [GC for 303 SFUN pages..(T=5).GC finished] [GC for 1887 CONS pages..(T=5).GC finished] [GC for 1897 CONS pages..(T=5).GC finished] [GC for 1907 CONS pages..(T=5).GC finished] [GC for 1917 CONS pages..(T=5).GC finished] [GC for 313 SFUN pages..(T=5).GC finished] [GC for 1927 CONS pages..(T=4).GC finished] [GC for 1937 CONS pages..(T=5).GC finished] [GC for 1947 CONS pages..(T=5).GC finished] [GC for 1957 CONS pages..(T=5).GC finished] [GC for 323 SFUN pages..(T=5).GC finished] [GC for 1967 CONS pages..(T=5).GC finished] [GC for 1967 CONS pages..(T=5).GC finished] [GC for 333 SFUN pages..(T=5).GC finished] [GC for 1977 CONS pages..(T=5).GC finished] [GC for 1987 CONS pages..(T=5).GC finished] [GC for 1997 CONS pages..(T=5).GC finished] [GC for 2007 CONS pages..(T=5).GC finished] [GC for 2017 CONS pages..(T=5).GC finished] [GC for 2027 CONS pages..(T=5).GC finished] [GC for 2037 CONS pages..(T=5).GC finished] [GC for 2047 CONS pages..(T=5).GC finished] [GC for 2057 CONS pages..(T=5).GC finished] [GC for 2067 CONS pages..(T=6).GC finished] [GC for 2077 CONS pages..(T=5).GC finished] [GC for 2087 CONS pages..(T=5).GC finished] [GC for 2097 CONS pages..(T=5).GC finished] [GC for 2107 CONS pages..(T=5).GC finished] [GC for 2117 CONS pages..(T=6).GC finished] [GC for 2127 CONS pages..(T=5).GC finished] [GC for 2137 CONS pages..(T=5).GC finished] [GC for 2147 CONS pages..(T=5).GC finished] [GC for 343 SFUN pages..(T=5).GC finished] [GC for 2157 CONS pages..(T=5).GC finished] [GC for 2167 CONS pages..(T=5).GC finished] [GC for 2177 CONS pages..(T=5).GC finished] [GC for 2187 CONS pages..(T=5).GC finished] [GC for 2197 CONS pages..(T=6).GC finished] [GC for 2207 CONS pages..(T=5).GC finished] [GC for 2217 CONS pages..(T=5).GC finished] [GC for 2227 CONS pages..(T=6).GC finished] [GC for 2237 CONS pages..(T=5).GC finished] [GC for 2247 CONS pages..(T=5).GC finished] [GC for 2257 CONS pages..(T=6).GC finished] [GC for 2267 CONS pages..(T=5).GC finished] [GC for 2277 CONS pages..(T=5).GC finished] [GC for 2287 CONS pages..(T=6).GC finished] [GC for 2297 CONS pages..(T=6).GC finished] [GC for 2307 CONS pages..(T=5).GC finished] [GC for 2317 CONS pages..(T=5).GC finished] [GC for 2327 CONS pages..(T=6).GC finished] [GC for 353 SFUN pages..(T=6).GC finished] [GC for 2337 CONS pages..(T=6).GC finished] [GC for 2347 CONS pages..(T=5).GC finished] [GC for 2357 CONS pages..(T=6).GC finished] [GC for 2367 CONS pages..(T=6).GC finished] ACL2 loading '((IN-PACKAGE "ACL2") (DEFCONST *COMMON-LISP-SYMBOLS-FROM-MAIN-LISP-PACKAGE* '(&ALLOW-OTHER-KEYS *PRINT-MISER-WIDTH* &AUX *PRINT-PPRINT-DISPATCH* &BODY *PRINT-PRETTY* &ENVIRONMENT ...)) (DEFCONST *COMMON-LISP-SPECIALS-AND-CONSTANTS* '(* ** *** *BREAK-ON-SIGNALS* *COMPILE-FILE-PATHNAME* *COMPILE-FILE-TRUENAME* *COMPILE-PRINT* ...)) (DEFCONST NIL 'NIL " NIL, a symbol, represents in Common Lisp both the false truth value and the empty list.") (DEFCONST T 'T "T, a symbol, represents the true truth value in Common Lisp.") (DEFCONST *STOBJ-INLINE-DECLARE* '(DECLARE #)) (DEFMACRO MAKE-PACKAGE-ENTRY (&KEY NAME IMPORTS HIDDEN-P BOOK-PATH DEFPKG-EVENT-FORM TTERM) (CONS 'LIST* (CONS NAME #))) ...). "ACL2" *COMMON-LISP-SYMBOLS-FROM-MAIN-LISP-PACKAGE* *COMMON-LISP-SPECIALS-AND-CONSTANTS* [GC for 2377 CONS pages..(T=6).GC finished] NIL T *STOBJ-INLINE-DECLARE* MAKE-PACKAGE-ENTRY FIND-PACKAGE-ENTRY PACKAGE-ENTRY-NAME PACKAGE-ENTRY-IMPORTS PACKAGE-ENTRY-HIDDEN-P PACKAGE-ENTRY-BOOK-PATH PACKAGE-ENTRY-DEFPKG-EVENT-FORM PACKAGE-ENTRY-TTERM FIND-NON-HIDDEN-PACKAGE-ENTRY REMOVE-PACKAGE-ENTRY CHANGE-PACKAGE-ENTRY-HIDDEN-P [GC for 2387 CONS pages..(T=6).GC finished] GETPROP GETPROPC *STANDARD-CO* *STANDARD-OI* *STANDARD-CI* INSIST IFF [GC for 363 SFUN pages..(T=6).GC finished] XOR EQ BOOLEANP NIL [GC for 2397 CONS pages..(T=6).GC finished] IMPLIES NIL NIL NOT NIL HIDE [GC for 11776 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] REWRITE-EQUIV REAL/RATIONALP COMPLEX/COMPLEX-RATIONALP TRUE-LISTP LIST-MACRO LIST AND-MACRO AND [GC for 2407 CONS pages..(T=6).GC finished] OR-MACRO OR - NIL NIL INTEGER-ABS XXXJOIN + [GC for 2417 CONS pages..(T=6).GC finished] LEN LENGTH ACL2-COUNT COND-CLAUSESP [GC for 2427 CONS pages..(T=6).GC finished] [GC for 11776 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] COND-MACRO COND EQLABLEP NIL NIL EQLABLE-LISTP EQL ATOM MAKE-CHARACTER-LIST [GC for 2437 CONS pages..(T=6).GC finished] EQLABLE-ALISTP ALISTP NIL NIL ACONS ENDP CAAR CADR CDAR CDDR CAAAR CAADR CADAR CADDR CDAAR CDADR CDDAR CDDDR [GC for 2447 CONS pages..(T=6).GC finished] CAAAAR CAAADR CAADAR CAADDR CADAAR CADADR CADDAR CADDDR CDAAAR CDAADR CDADAR CDADDR CDDAAR CDDADR CDDDAR CDDDDR NULL [GC for 11776 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] SYMBOL-LISTP NIL SYMBOL-DOUBLET-LISTP REVERSE-STRIP-CARS STRIP-CARS REVERSE-STRIP-CDRS STRIP-CDRS [GC for 2457 CONS pages..(T=6).GC finished] HARD-ERROR ILLEGAL RETURN-LAST RETURN-LAST-FN MBE1 MUST-BE-EQUAL MBE MBT MBT* BINARY-APPEND APPEND NIL NIL NIL NIL NIL NIL CONCATENATE [GC for 2457 CONS pages..(T=6).GC finished] [GC for 11776 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] STRING-APPEND STRING-LISTP STRING-APPEND-LST GUARD-CHECK-FN LET-MBE-GUARD-FORM LET-MBE DEFUN-WITH-GUARD-CHECK PROG2$ [GC for 2467 CONS pages..(T=6).GC finished] MEMBER-EQ-EXEC MEMBER-EQL-EXEC MEMBER-EQUAL MEMBER-EQ NIL NIL MEMBER [GC for 2467 CONS pages..(T=6).GC finished] [GC for 11776 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] SUBSETP-EQ-EXEC SUBSETP-EQL-EXEC SUBSETP-EQUAL SUBSETP-EQ NIL NIL SUBSETP SYMBOL-ALISTP NIL [GC for 2477 CONS pages..(T=6).GC finished] CHARACTER-ALISTP NIL ASSOC-EQ-EXEC ASSOC-EQL-EXEC [GC for 11776 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] ASSOC-EQUAL ASSOC-EQ NIL NIL ASSOC ASSOC-EQ-EQUAL-ALISTP [GC for 1563 RELOCATABLE-BLOCKS pages..(T=6).GC finished] ASSOC-EQ-EQUAL <= = /= > >= INT= [GC for 2477 CONS pages..(T=6).GC finished] ZP NIL NIL NIL ZIP NIL NIL NIL NTH CHAR SLEEP PROPER-CONSP [GC for 2487 CONS pages..(T=6).GC finished] IMPROPER-CONSP * CONJUGATE ADD-SUFFIX *INLINE-SUFFIX* EC-CALL1 EC-CALL NON-EXEC / NIL NIL NIL FIX NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL [GC for 2487 CONS pages..(T=6).GC finished] [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] FORCE *FORCE-XNUME* 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-NATP-PAIR* *TAU-BITP-PAIR* *TAU-POSP-PAIR* *TAU-MINUSP-PAIR* *TAU-BOOLEANP-PAIR* NIL NIL [GC for 2497 CONS pages..(T=6).GC finished] NIL NIL NIL NIL NIL NIL NIL NIL NIL NO-DUPLICATESP-EQ-EXEC NO-DUPLICATESP-EQL-EXEC [GC for 2497 CONS pages..(T=6).GC finished] NO-DUPLICATESP-EQUAL NO-DUPLICATESP-EQ NIL NIL NO-DUPLICATESP CHK-NO-DUPLICATESP R-EQLABLE-ALISTP R-SYMBOL-ALISTP [GC for 2507 CONS pages..(T=6).GC finished] RASSOC-EQ-EXEC [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] RASSOC-EQL-EXEC RASSOC-EQUAL RASSOC-EQ NIL NIL RASSOC *STANDARD-CHARS* STANDARD-CHAR-P STANDARD-CHAR-P+ [GC for 2507 CONS pages..(T=6).GC finished] STANDARD-CHAR-LISTP CHARACTER-LISTP NIL NIL NIL NIL NIL NIL STRING ALPHA-CHAR-P [GC for 2507 CONS pages..(T=6).GC finished] UPPER-CASE-P LOWER-CASE-P CHAR-UPCASE CHAR-DOWNCASE NIL NIL NIL NIL NIL NIL NIL NIL [GC for 2507 CONS pages..(T=6).GC finished] NIL STRING-DOWNCASE1 NIL STRING-DOWNCASE [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] STRING-UPCASE1 NIL STRING-UPCASE OUR-DIGIT-CHAR-P DIGIT-CHAR-P CHAR-EQUAL ATOM-LISTP NIL NIL [GC for 2507 CONS pages..(T=6).GC finished] GOOD-ATOM-LISTP NIL NIL IFIX RFIX REALFIX NFIX 1+ 1- NATP NIL NAT-ALISTP NIL [GC for 2517 CONS pages..(T=6).GC finished] STANDARD-STRING-P1 STANDARD-STRING-P STANDARD-STRING-LISTP [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] STRING-EQUAL1 STRING-EQUAL MEMBER-STRING-EQUAL STANDARD-STRING-ALISTP NIL ASSOC-STRING-EQUAL BITP [GC for 2517 CONS pages..(T=6).GC finished] NIL NIL POSP NIL O-FINP O-INFP O-FIRST-EXPT O-FIRST-COEFF O-RST O O<= O>= O-P NIL NIL MAKE-ORD [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] LIST*-MACRO LIST* THROW-OR-ATTACH-CALL NULL-BODY-ER *MAIN-LISP-PACKAGE-NAME* *INITIAL-KNOWN-PACKAGE-ALIST* NIL NIL NIL INTERN INTERN$ KEYWORDP NIL NIL NIL *PKG-WITNESS-NAME* NIL NIL [GC for 2527 CONS pages..(T=6).GC finished] MEMBER-SYMBOL-NAME NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL CONS-WITH-HINT REMOVE-EQ-EXEC REMOVE-EQL-EXEC [GC for 2537 CONS pages..(T=7).GC finished] REMOVE-EQUAL REMOVE-EQ NIL NIL REMOVE REMOVE1-EQ-EXEC [GC for 2537 CONS pages..(T=6).GC finished] [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] REMOVE1-EQL-EXEC REMOVE1-EQUAL REMOVE1-EQ NIL NIL REMOVE1 REMOVE-DUPLICATES-EQ-EXEC [GC for 2547 CONS pages..(T=6).GC finished] REMOVE-DUPLICATES-EQL-EXEC REMOVE-DUPLICATES-EQUAL REMOVE-DUPLICATES-EQ NIL NIL REMOVE-DUPLICATES-LOGIC REMOVE-DUPLICATES NIL FIRST SECOND THIRD FOURTH FIFTH SIXTH SEVENTH EIGHTH NINTH TENTH REST IDENTITY [GC for 2547 CONS pages..(T=6).GC finished] REVAPPEND NIL NIL REVERSE PAIRLIS$-TAILREC PAIRLIS$ NIL NIL [GC for 2557 CONS pages..(T=6).GC finished] SET-DIFFERENCE-EQ-EXEC [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] SET-DIFFERENCE-EQL-EXEC SET-DIFFERENCE-EQUAL SET-DIFFERENCE-EQ NIL NIL SET-DIFFERENCE$ *WINDOW-DESCRIPTIONS* *VALID-OUTPUT-NAMES* LISTP *SUMMARY-TYPES* WITH-EVISC-TUPLE [GC for 2557 CONS pages..(T=6).GC finished] [GC for 2557 CONS pages..(T=6).GC finished] WITH-OUTPUT-FN [GC for 2567 CONS pages..(T=6).GC finished] LAST FIRST-N-AC NIL TAKE :EMPTY-ENCAPSULATE NIL BUTLAST WITH-OUTPUT! WITH-OUTPUT [GC for 2567 CONS pages..(T=6).GC finished] MUTUAL-RECURSION-GUARDP COLLECT-CADRS-WHEN-CAR-EQ VALUE VALUE-TRIPLE-FN VALUE-TRIPLE ASSERT-EVENT XD-NAME [GC for 2567 CONS pages..(T=7).GC finished] DEFUND-NAME-LIST [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] THROW-NONEXEC-ERROR DEFUN-NX-FN DEFUN-NX DEFUND-NX [GC for 1563 RELOCATABLE-BLOCKS pages..(T=6).GC finished] UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1 UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX KEYWORD-VALUE-LISTP NIL ASSOC-KEYWORD PROGRAM-DECLARED-P2 [GC for 2567 CONS pages..(T=6).GC finished] PROGRAM-DECLARED-P1 PROGRAM-DECLARED-P TRUE-LIST-LISTP NIL SOME-PROGRAM-DECLARED-P MUTUAL-RECURSION [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] (PSEUDO-TERMP PSEUDO-TERM-LISTP) NIL T PSEUDO-TERM-LIST-LISTP NIL ADD-TO-SET-EQ-EXEC [GC for 2567 CONS pages..(T=6).GC finished] ADD-TO-SET-EQL-EXEC ADD-TO-SET-EQUAL ADD-TO-SET-EQ ADD-TO-SET-EQL NIL NIL NIL ADD-TO-SET VARIABLEP NVARIABLEP FQUOTEP QUOTEP *T* *NIL* *0* *1* *-1* *2* KWOTE [GC for 2577 CONS pages..(T=6).GC finished] MAYBE-KWOTE KWOTE-LST UNQUOTE LAMBDA-OBJECT-FORMALS [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] LAMBDA-OBJECT-DCL LAMBDA-OBJECT-BODY LAMBDA-OBJECT-SHAPEP MAKE-LAMBDA-OBJECT FFN-SYMB FN-SYMB FARGS [GC for 2577 CONS pages..(T=6).GC finished] (ALL-VARS1 ALL-VARS1-LST) NIL ALL-VARS TRANSLATE-AND-TEST INTERSECTP-EQ-EXEC [GC for 2587 CONS pages..(T=6).GC finished] INTERSECTP-EQL-EXEC [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] INTERSECTP-EQUAL INTERSECTP-EQ NIL NIL INTERSECTP MAKE-FMT-BINDINGS *BASE-10-CHARS* WARNING$ MSG CHECK-VARS-NOT-FREE-TEST CHECK-VARS-NOT-FREE ER-PROGN-FN ER-PROGN [GC for 2587 CONS pages..(T=6).GC finished] LEGAL-CASE-CLAUSESP CASE-TEST CASE-LIST CASE-LIST-CHECK CASE [GC for 2587 CONS pages..(T=6).GC finished] POSITION-AC-EQ-EXEC POSITION-AC-EQL-EXEC [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] POSITION-EQUAL-AC POSITION-AC-EQUAL POSITION-EQ-AC POSITION-AC-EQ NIL NIL POSITION-AC POSITION-EQ-EXEC [GC for 2597 CONS pages..(T=7).GC finished] POSITION-EQL-EXEC POSITION-EQUAL POSITION-EQ NIL NIL POSITION NONNEGATIVE-INTEGER-QUOTIENT [GC for 2607 CONS pages..(T=6).GC finished] LEGAL-LET*-P WELL-FORMED-TYPE-DECLS-P SYMBOL-LIST-LISTP GET-TYPE-DECLS [GC for 2607 CONS pages..(T=7).GC finished] [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] LET*-MACRO COLLECT-CDRS-WHEN-CAR-EQ APPEND-LST RESTRICT-ALIST [GC for 2607 CONS pages..(T=7).GC finished] LET* PROGN [GC for 2607 CONS pages..(T=6).GC finished] [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] [GC for 2607 CONS pages..(T=6).GC finished] LOGNOT :EMPTY-ENCAPSULATE NIL NIL NIL NIL NIL [GC for 373 SFUN pages..(T=6).GC finished] [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] ASH NIL NIL NIL NIL NIL NIL NIL NIL CHAR< [GC for 373 SFUN pages..(T=7).GC finished] CHAR> CHAR<= CHAR>= STRING<-L STRING< [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] STRING> STRING<= STRING>= SYMBOL-< NIL NIL SUBSTITUTE-AC [GC for 2617 CONS pages..(T=7).GC finished] SUBSTITUTE NIL NIL SUBLIS SUBST PPROGN PROGN$ ACL2-UNWIND-PROTECT WHEN-LOGIC IN-PACKAGE DEFPKG DEFUN DEFUNS VERIFY-TERMINATION VERIFY-TERMINATION-BOOT-STRAP VERIFY-GUARDS VERIFY-GUARDS+ DEFMACRO DEFCONST DEFTHM [GC for 2627 CONS pages..(T=7).GC finished] ER DEFTHMD DEFAXIOM DEFLABEL DEFTHEORY DEFTHY DEFTHEORY-STATIC DEFSTOBJ IN-THEORY IN-ARITHMETIC-THEORY REGENERATE-TAU-DATABASE PUSH-UNTOUCHABLE REMOVE-UNTOUCHABLE SET-BODY TABLE ENCAPSULATE PARTIAL-ENCAPSULATE *LOAD-COMPILED-FILE-VALUES* INCLUDE-BOOK MAKE-EVENT RECORD-EXPANSION SKIP-PROOFS LOCAL DEFCHOOSE DEFATTACH WORLDP [GC for 2627 CONS pages..(T=7).GC finished] PLIST-WORLDP NIL PUTPROP *ACL2-PROPERTY-UNBOUND* [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] GETPROP-DEFAULT FGETPROP SGETPROP ORDERED-SYMBOL-ALISTP NIL NIL ADD-PAIR [GC for 2637 CONS pages..(T=6).GC finished] REMOVE1-ASSOC-EQ-EXEC REMOVE1-ASSOC-EQL-EXEC REMOVE1-ASSOC-EQUAL REMOVE1-ASSOC-EQ NIL NIL REMOVE1-ASSOC [GC for 2637 CONS pages..(T=6).GC finished] [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] REMOVE-ASSOC-EQ-EXEC REMOVE-ASSOC-EQL-EXEC REMOVE-ASSOC-EQUAL REMOVE-ASSOC-EQ NIL NIL REMOVE-ASSOC [GC for 373 SFUN pages..(T=6).GC finished] GETPROPS1 GETPROPS NIL NIL NIL [GC for 1563 RELOCATABLE-BLOCKS pages..(T=6).GC finished] HAS-PROPSP1 HAS-PROPSP [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] EXTEND-WORLD RETRACT-WORLD GLOBAL-VAL FUNCTION-SYMBOLP FCONS-TERM* CONJOIN2 CONJOIN [GC for 373 SFUN pages..(T=7).GC finished] CONJOIN-UNTRANSLATED-TERMS DISJOIN2 DISJOIN [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] DISJOIN-LST KWOTE? CONJOIN? <=? >? DISJOIN? [GC for 373 SFUN pages..(T=7).GC finished] TRANSLATE-DECLARATION-TO-GUARD/INTEGER-GEN TRANSLATE-DECLARATION-TO-GUARD/INTEGER WEAK-SATISFIES-TYPE-SPEC-P [GC for 2647 CONS pages..(T=6).GC finished] [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] [GC for 2657 CONS pages..(T=7).GC finished] TRANSLATE-DECLARATION-TO-GUARD1-GEN TRANSLATE-DECLARATION-TO-GUARD1 (TRANSLATE-DECLARATION-TO-GUARD-GEN TRANSLATE-DECLARATION-TO-GUARD-GEN-LST) [GC for 2657 CONS pages..(T=6).GC finished] TRANSLATE-DECLARATION-TO-GUARD TRANSLATE-DECLARATION-TO-GUARD-LST THE-CHECK THE-FN THE [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] 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 ARRAY1P NIL NIL [GC for 2657 CONS pages..(T=7).GC finished] BOUNDED-INTEGER-ALISTP2 ASSOC2 ARRAY2P NIL NIL HEADER [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] DIMENSIONS MAXIMUM-LENGTH DEFAULT AREF1 COMPRESS11 [GC for 2667 CONS pages..(T=7).GC finished] ARRAY-ORDER COMPRESS1 NIL ASET1 [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] AREF2 COMPRESS211 COMPRESS21 COMPRESS2 NIL ASET2 [GC for 2667 CONS pages..(T=7).GC finished] FLUSH-COMPRESS MAYBE-FLUSH-AND-COMPRESS1 CDRN [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] MV-NTH MAKE-MV-NTHS MV MV? MV-LET MV?-LET MV-LIST SWAP-STOBJS UPDATE-NTH UPDATE-NTH-ARRAY MAXIMUM-POSITIVE-32-BIT-INTEGER MINIMUM-NEGATIVE-32-BIT-INTEGER [GC for 2667 CONS pages..(T=7).GC finished] 32-BIT-INTEGERP NIL ACL2-NUMBER-LISTP NIL RATIONAL-LISTP NIL INTEGER-LISTP NIL [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] NAT-LISTP NIL 32-BIT-INTEGER-LISTP NIL OPEN-INPUT-CHANNELS UPDATE-OPEN-INPUT-CHANNELS OPEN-OUTPUT-CHANNELS [GC for 373 SFUN pages..(T=7).GC finished] UPDATE-OPEN-OUTPUT-CHANNELS GLOBAL-TABLE [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] UPDATE-GLOBAL-TABLE T-STACK UPDATE-T-STACK 32-BIT-INTEGER-STACK UPDATE-32-BIT-INTEGER-STACK [GC for 373 SFUN pages..(T=7).GC finished] BIG-CLOCK-ENTRY UPDATE-BIG-CLOCK-ENTRY [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] IDATES UPDATE-IDATES ACL2-ORACLE UPDATE-ACL2-ORACLE FILE-CLOCK UPDATE-FILE-CLOCK [GC for 373 SFUN pages..(T=7).GC finished] READABLE-FILES WRITTEN-FILES [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] UPDATE-WRITTEN-FILES READ-FILES UPDATE-READ-FILES WRITEABLE-FILES LIST-ALL-PACKAGE-NAMES-LST [GC for 373 SFUN pages..(T=6).GC finished] UPDATE-LIST-ALL-PACKAGE-NAMES-LST USER-STOBJ-ALIST1 [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] UPDATE-USER-STOBJ-ALIST1 *INITIAL-CHECKPOINT-PROCESSORS* *INITIAL-PROGRAM-FNS-WITH-RAW-CODE* *INITIAL-LOGIC-FNS-WITH-RAW-CODE* *INITIAL-MACROS-WITH-RAW-CODE* UNTOUCHABLE-MARKER DEFMACRO-UNTOUCHABLE WITH-LIVE-STATE INIT-IPRINT-AR *IPRINT-SOFT-BOUND-DEFAULT* *IPRINT-HARD-BOUND-DEFAULT* DEFAULT-TOTAL-PARALLELISM-WORK-LIMIT *FMT-SOFT-RIGHT-MARGIN-DEFAULT* *FMT-HARD-RIGHT-MARGIN-DEFAULT* *INITIAL-GLOBAL-TABLE* T WITH-INFIXP-NIL [GC for 2677 CONS pages..(T=6).GC finished] ALL-BOUNDP KNOWN-PACKAGE-ALISTP NIL TIMER-ALISTP NIL [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] TYPED-IO-LISTP NIL *FILE-TYPES* OPEN-CHANNEL1 NIL OPEN-CHANNEL-LISTP OPEN-CHANNELS-P NIL FILE-CLOCK-P NIL [GC for 373 SFUN pages..(T=6).GC finished] READABLE-FILE NIL [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] READABLE-FILES-LISTP NIL READABLE-FILES-P NIL WRITTEN-FILE NIL WRITTEN-FILE-LISTP NIL WRITTEN-FILES-P NIL [GC for 373 SFUN pages..(T=7).GC finished] READ-FILE-LISTP1 NIL READ-FILE-LISTP NIL [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] READ-FILES-P NIL WRITABLE-FILE-LISTP1 NIL WRITABLE-FILE-LISTP NIL WRITEABLE-FILES-P NIL [GC for 2687 CONS pages..(T=7).GC finished] STATE-P1 NIL STATE-P NIL NIL BUILD-STATE *DEFAULT-STATE* [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] BUILD-STATE1 COERCE-STATE-TO-OBJECT COERCE-OBJECT-TO-STATE NIL GLOBAL-TABLE-CARS1 [GC for 1563 RELOCATABLE-BLOCKS pages..(T=7).GC finished] GLOBAL-TABLE-CARS BOUNDP-GLOBAL1 [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] BOUNDP-GLOBAL F-BOUNDP-GLOBAL MAKUNBOUND-GLOBAL GET-GLOBAL PUT-GLOBAL F-PUT-GLOBAL *INITIAL-LD-SPECIAL-BINDINGS* [GC for 2697 CONS pages..(T=7).GC finished] ALWAYS-BOUNDP-GLOBAL STATE-GLOBAL-LET*-BINDINGS-P [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).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* [GC for 2707 CONS pages..(T=7).GC finished] INTEGER-RANGE-P NIL SIGNED-BYTE-P UNSIGNED-BYTE-P NIL NIL NIL THE-FIXNUM [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] ZPF NIL NIL NIL NIL NIL NIL NIL :EMPTY-ENCAPSULATE NIL LOGAND LOGEQV LOGIOR LOGXOR INTEGER-LENGTH BINARY-LOGAND LOGNAND [GC for 2707 CONS pages..(T=7).GC finished] BINARY-LOGIOR [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] LOGORC1 LOGORC2 LOGANDC1 LOGANDC2 BINARY-LOGEQV [GC for 373 SFUN pages..(T=7).GC finished] BINARY-LOGXOR [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] LOGNOR [GC for 42 CFUN pages..(T=7).GC finished] LOGTEST *BOOLE-1* *BOOLE-2* *BOOLE-AND* *BOOLE-ANDC1* *BOOLE-ANDC2* *BOOLE-C1* *BOOLE-C2* *BOOLE-CLR* *BOOLE-EQV* *BOOLE-IOR* *BOOLE-NAND* *BOOLE-NOR* *BOOLE-ORC1* *BOOLE-ORC2* *BOOLE-SET* *BOOLE-XOR* BOOLE$ SET-FORMS-FROM-BINDINGS [GC for 2707 CONS pages..(T=7).GC finished] *PRINT-CONTROL-DEFAULTS* ALIST-DIFFERENCE-EQ WITH-PRINT-DEFAULTS RESET-PRINT-CONTROL [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] DIGIT-TO-CHAR PRINT-BASE-P EXPLODE-NONNEGATIVE-INTEGER NIL NIL NIL NIL NIL EXPLODE-ATOM NIL [GC for 2717 CONS pages..(T=7).GC finished] EXPLODE-ATOM+ NIL NIL NIL NIL OPEN-INPUT-CHANNEL-P1 [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] OPEN-OUTPUT-CHANNEL-P1 OPEN-INPUT-CHANNEL-P OPEN-OUTPUT-CHANNEL-P OPEN-OUTPUT-CHANNEL-ANY-P1 [GC for 373 SFUN pages..(T=7).GC finished] OPEN-OUTPUT-CHANNEL-ANY-P [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] OPEN-INPUT-CHANNEL-ANY-P1 OPEN-INPUT-CHANNEL-ANY-P NON-FREE-VAR-RUNES FREE-VAR-RUNES NIL *DIRECTORY-SEPARATOR* *DIRECTORY-SEPARATOR-STRING* OS-ER [GC for 373 SFUN pages..(T=7).GC finished] OS [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] ABSOLUTE-PATHNAME-STRING-P ILLEGAL-RULER-EXTENDERS-VALUES TABLE-ALIST RULER-EXTENDERS-MSG-AUX [GC for 2727 CONS pages..(T=6).GC finished] [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] RULER-EXTENDERS-MSG STRICT-SYMBOL-<-SORTEDP CHK-RULER-EXTENDERS FIXNUM-BOUND *DEFAULT-STEP-LIMIT* INCLUDE-BOOK-DIR-ALIST-ENTRY-P INCLUDE-BOOK-DIR-ALISTP *CHECK-INVARIANT-RISK-VALUES* [GC for 373 SFUN pages..(T=6).GC finished] TTAG [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] GET-REGISTER-INVARIANT-RISK-WORLD ACL2-DEFAULTS-TABLE ACL2-DEFAULTS-TABLE PRINT-CASE ACL2-PRINT-CASE SET-PRINT-CASE SET-ACL2-PRINT-CASE PRINT-BASE ACL2-PRINT-BASE PRINT-RADIX ACL2-PRINT-RADIX [GC for 2727 CONS pages..(T=7).GC finished] CHECK-PRINT-BASE SET-PRINT-BASE SET-ACL2-PRINT-BASE [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] SET-PRINT-CIRCLE SET-PRINT-ESCAPE SET-PRINT-PRETTY SET-PRINT-RADIX [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] SET-PRINT-READABLY CHECK-NULL-OR-NATP SET-PRINT-LENGTH SET-PRINT-LEVEL SET-PRINT-LINES [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] SET-PRINT-RIGHT-MARGIN PRINC$ [GC for 2737 CONS pages..(T=6).GC finished] WRITE-BYTE$ W [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] GET-SERIALIZE-CHARACTER HONS-ENABLEDP SET-SERIALIZE-CHARACTER-FN SET-SERIALIZE-CHARACTER [GC for 373 SFUN pages..(T=7).GC finished] [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] SET-SERIALIZE-CHARACTER-SYSTEM PRINT-OBJECT$-SER NIL NIL PRINT-OBJECT$ [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] PRINT-OBJECT$-PRESERVING-CASE MAKE-INPUT-CHANNEL MAKE-OUTPUT-CHANNEL OPEN-INPUT-CHANNEL NIL NIL NIL NIL [GC for 2747 CONS pages..(T=7).GC finished] [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] CLOSE-INPUT-CHANNEL OPEN-OUTPUT-CHANNEL [GC for 2747 CONS pages..(T=7).GC finished] OPEN-OUTPUT-CHANNEL! ASSERT$ ASSERT* [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] FMT-TO-COMMENT-WINDOW FMT-TO-COMMENT-WINDOW! PAIRLIS2 CW CW! CW-PRINT-BASE-RADIX CW-PRINT-BASE-RADIX! [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] SUBSEQ-LIST SUBSEQ LOCK-SYMBOL-NAME-P ASSIGN-LOCK LOCK-TABLE WITH-LOCK DEFLOCK WITH-OUTPUT-LOCK WITH-LOCAL-STATE-LOCK [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] GET-OUTPUT-STREAM-STRING$-FN GET-OUTPUT-STREAM-STRING$ CLOSE-OUTPUT-CHANNEL MAYBE-FINISH-OUTPUT$ [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] READ-CHAR$ PEEK-CHAR$ READ-BYTE$ [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] RAW-MODE-P READ-OBJECT READ-OBJECT-WITH-CASE [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] READ-OBJECT-SUPPRESS *SUSPICIOUSLY-FIRST-NUMERIC-CHARS* *SUSPICIOUSLY-FIRST-HEX-CHARS* *HEX-CHARS* *LETTER-CHARS* *SLASHABLE-CHARS* SOME-SLASHABLE [GC for 12288 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] PRIN1-WITH-SLASHES1 PRIN1-WITH-SLASHES SUSPICIOUSLY-FIRST-NUMERIC-CHARS NUMERIC-CHARS MAY-NEED-SLASHES1 NIL [GC for 2757 CONS pages..(T=7).GC finished] [GC for 1563 RELOCATABLE-BLOCKS pages..(T=7).GC finished] MAY-NEED-SLASHES-FN MAY-NEED-SLASHES NEEDS-SLASHES T-STACK-LENGTH1 [GC for 373 SFUN pages..(T=7).GC finished] T-STACK-LENGTH MAKE-LIST-AC MAKE-LIST EXTEND-T-STACK :EMPTY-ENCAPSULATE NIL NIL NIL NIL NIL NIL NIL NIL MSWINDOWS-DRIVE1 [GC for 373 SFUN pages..(T=7).GC finished] MSWINDOWS-DRIVE SHRINK-T-STACK AREF-T-STACK ASET-T-STACK [GC for 373 SFUN pages..(T=7).GC finished] 32-BIT-INTEGER-STACK-LENGTH1 32-BIT-INTEGER-STACK-LENGTH [GC for 12544 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] EXTEND-32-BIT-INTEGER-STACK SHRINK-32-BIT-INTEGER-STACK AREF-32-BIT-INTEGER-STACK ASET-32-BIT-INTEGER-STACK F-BIG-CLOCK-NEGATIVE-P F-DECREMENT-BIG-CLOCK [GC for 373 SFUN pages..(T=7).GC finished] BIG-CLOCK-NEGATIVE-P DECREMENT-BIG-CLOCK LIST-ALL-PACKAGE-NAMES USER-STOBJ-ALIST [GC for 373 SFUN pages..(T=7).GC finished] UPDATE-USER-STOBJ-ALIST POWER-EVAL READ-IDATE READ-RUN-TIME [GC for 373 SFUN pages..(T=7).GC finished] READ-ACL2-ORACLE READ-ACL2-ORACLE@PAR GETENV$ SETENV$ [GC for 373 SFUN pages..(T=7).GC finished] [GC for 12544 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] RANDOM$ NIL NIL NIL SYS-CALL NIL SYS-CALL-STATUS :EMPTY-ENCAPSULATE NIL NIL SYS-CALL+ [GC for 373 SFUN pages..(T=7).GC finished] SYS-CALL* NIL NIL NIL NIL NIL NIL NIL NIL MAIN-TIMER PUT-ASSOC-EQ-EXEC [GC for 373 SFUN pages..(T=6).GC finished] PUT-ASSOC-EQL-EXEC PUT-ASSOC-EQUAL PUT-ASSOC-EQ PUT-ASSOC-EQL NIL NIL PUT-ASSOC NIL NIL NIL [GC for 2767 CONS pages..(T=7).GC finished] SET-TIMER GET-TIMER NIL PUSH-TIMER NIL NIL NIL NIL NIL [GC for 373 SFUN pages..(T=7).GC finished] POP-TIMER ADD-TIMERS NIL NIL NIL NIL NIL NIL NIL NIL [GC for 12544 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] INCREMENT-TIMER PRINT-RATIONAL-AS-DECIMAL PRINT-TIMER NIL [GC for 2777 CONS pages..(T=7).GC finished] SET-PRINT-BASE-RADIX KNOWN-PACKAGE-ALIST SYMBOL-IN-CURRENT-PACKAGE-P [GC for 2787 CONS pages..(T=7).GC finished] PRIN1$ NIL CURRENT-PACKAGE NIL *INITIAL-UNTOUCHABLE-FNS* *INITIAL-UNTOUCHABLE-VARS* LD-SKIP-PROOFSP ASSIGN @ [GC for 373 SFUN pages..(T=7).GC finished] MAKE-VAR-LST1 :EMPTY-ENCAPSULATE MAKE-VAR-LST [GC for 373 SFUN pages..(T=7).GC finished] UNION-EQ-EXEC UNION-EQL-EXEC [GC for 12544 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] UNION-EQUAL UNION-EQ NIL NIL PARSE-ARGS-AND-TEST UNION-EQUAL-WITH-UNION-EQ-EXEC-GUARD UNION-EQUAL-WITH-UNION-EQL-EXEC-GUARD UNION$ SUBST-FOR-NTH-ARG THE-MV THE2S [GC for 2797 CONS pages..(T=7).GC finished] INTERSECTION-EQ-EXEC INTERSECTION-EQL-EXEC [GC for 373 SFUN pages..(T=7).GC finished] INTERSECTION-EQUAL INTERSECTION-EQ NIL NIL INTERSECTION-EQUAL-WITH-INTERSECTION-EQ-EXEC-GUARD INTERSECTION-EQUAL-WITH-INTERSECTION-EQL-EXEC-GUARD INTERSECTION$ SET-ENFORCE-REDUNDANCY GET-ENFORCE-REDUNDANCY DEFAULT-VERIFY-GUARDS-EAGERNESS-FROM-TABLE DEFAULT-VERIFY-GUARDS-EAGERNESS SET-VERIFY-GUARDS-EAGERNESS [GC for 2797 CONS pages..(T=7).GC finished] DEFAULT-COMPILE-FNS SET-COMPILE-FNS SET-COMPILER-ENABLED SET-PORT-FILE-ENABLED [GC for 373 SFUN pages..(T=7).GC finished] DEFAULT-MEASURE-FUNCTION SET-MEASURE-FUNCTION DEFAULT-WELL-FOUNDED-RELATION SET-WELL-FOUNDED-RELATION DEFAULT-DEFUN-MODE-FROM-TABLE [GC for 12544 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] DEFAULT-DEFUN-MODE DEFAULT-DEFUN-MODE-FROM-STATE LOGIC PROGRAM INVISIBLE-FNS-TABLE SET-INVISIBLE-FNS-TABLE UNARY-FUNCTION-SYMBOL-LISTP [GC for 373 SFUN pages..(T=7).GC finished] INVISIBLE-FNS-ENTRYP INVISIBLE-FNS-TABLE INVISIBLE-FNS-TABLE ADD-INVISIBLE-FNS REMOVE-INVISIBLE-FNS SET-INVISIBLE-FNS-ALIST INVISIBLE-FNS-ALIST SET-BOGUS-DEFUN-HINTS-OK SET-BOGUS-MEASURE-OK SET-BOGUS-MUTUAL-RECURSION-OK SET-IRRELEVANT-FORMALS-OK SET-IGNORE-OK INHIBIT-WARNINGS-TABLE SET-INHIBIT-WARNINGS! SET-INHIBIT-WARNINGS SET-INHIBIT-OUTPUT-LST SET-INHIBITED-SUMMARY-TYPES SET-STATE-OK SET-LET*-ABSTRACTIONP SET-LET*-ABSTRACTION LET*-ABSTRACTIONP *INITIAL-BACKCHAIN-LIMIT* *INITIAL-DEFAULT-BACKCHAIN-LIMIT* [GC for 2807 CONS pages..(T=7).GC finished] SET-BACKCHAIN-LIMIT BACKCHAIN-LIMIT SET-DEFAULT-BACKCHAIN-LIMIT DEFAULT-BACKCHAIN-LIMIT [GC for 2817 CONS pages..(T=7).GC finished] STEP-LIMIT-FROM-TABLE SET-PROVER-STEP-LIMIT *DEFAULT-REWRITE-STACK-LIMIT* SET-REWRITE-STACK-LIMIT REWRITE-STACK-LIMIT [GC for 373 SFUN pages..(T=7).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 2817 CONS pages..(T=7).GC finished] MATCH-FREE-OVERRIDE ADD-MATCH-FREE-OVERRIDE ADD-INCLUDE-BOOK-DIR DELETE-INCLUDE-BOOK-DIR INCLUDE-BOOK-DIR!-TABLE [GC for 12544 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] RAW-INCLUDE-BOOK-DIR-P ADD-INCLUDE-BOOK-DIR! DELETE-INCLUDE-BOOK-DIR! *NON-LINEAR-ROUNDS-VALUE* NON-LINEARP SET-NON-LINEARP SET-NON-LINEAR TAU-AUTO-MODEP SET-TAU-AUTO-MODE [GC for 373 SFUN pages..(T=7).GC finished] GET-IN-THEORY-REDUNDANT-OKP DEFTTAG MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES ADD-MACRO-ALIAS MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE [GC for 2827 CONS pages..(T=7).GC finished] MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE DELETE-ASSOC-EQ-EXEC MACRO-ALIASES-TABLE DELETE-ASSOC-EQL-EXEC MACRO-ALIASES-TABLE DELETE-ASSOC-EQUAL MACRO-ALIASES-TABLE DELETE-ASSOC-EQ DELETE-ASSOC REMOVE-MACRO-ALIAS NTH-ALIASES-TABLE :REDUNDANT NTH-ALIASES ADD-NTH-ALIAS REMOVE-NTH-ALIAS [GC for 2837 CONS pages..(T=7).GC finished] DEFAULT-HINTS SET-DEFAULT-HINTS SET-DEFAULT-HINTS! ADD-DEFAULT-HINTS ADD-DEFAULT-HINTS! REMOVE-DEFAULT-HINTS REMOVE-DEFAULT-HINTS! SET-OVERRIDE-HINTS-MACRO ADD-OVERRIDE-HINTS! ADD-OVERRIDE-HINTS SET-OVERRIDE-HINTS! SET-OVERRIDE-HINTS REMOVE-OVERRIDE-HINTS! REMOVE-OVERRIDE-HINTS SET-RW-CACHE-STATE SET-RW-CACHE-STATE! *LEGAL-RW-CACHE-STATES* RW-CACHE-STATE-TABLE INDUCTION-DEPTH-LIMIT-TABLE *INDUCTION-DEPTH-LIMIT-DEFAULT* INDUCTION-DEPTH-LIMIT-TABLE SET-INDUCTION-DEPTH-LIMIT! SET-INDUCTION-DEPTH-LIMIT TRUE-LIST-FIX-EXEC [GC for 2847 CONS pages..(T=7).GC finished] TRUE-LIST-FIX :EMPTY-ENCAPSULATE NIL FIX-TRUE-LIST MACRO-ALIASES-TABLE NIL BOOLEAN-LISTP NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL DOUBLE-REWRITE [GC for 2857 CONS pages..(T=7).GC finished] CHK-WITH-PROVER-TIME-LIMIT-ARG WITH-PROVER-TIME-LIMIT1 WITH-PROVER-TIME-LIMIT CATCH-TIME-LIMIT5 *INTERRUPT-STRING* TIME-LIMIT5-REACHED-P CATCH-STEP-LIMIT *GUARD-CHECKING-VALUES* CHK-WITH-GUARD-CHECKING-ARG WITH-GUARD-CHECKING1 [GC for 12544 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] 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 373 SFUN pages..(T=7).GC finished] WORMHOLE1 WORMHOLE-P DUPLICATES EVENS [GC for 373 SFUN pages..(T=7).GC finished] ODDS SET-EQUALP-EQUAL |Access METAFUNCTION-CONTEXT record field UNIFY-SUBST| |Access REWRITE-CONSTANT record field CURRENT-CLAUSE| RECORD-ERROR [GC for 373 SFUN pages..(T=7).GC finished] RECORD-ACCESSOR-FUNCTION-NAME ACCESS [GC for 1563 RELOCATABLE-BLOCKS pages..(T=7).GC finished] MFC-CLAUSE MFC-RDEPTH [GC for 12544 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] TYPE-ALIST-ENTRYP TYPE-ALISTP MFC-TYPE-ALIST [GC for 373 SFUN pages..(T=7).GC finished] MFC-ANCESTORS MFC-UNIFY-SUBST MFC-WORLD NIL NIL BAD-ATOM NIL NIL NIL NIL NIL NIL [GC for 2857 CONS pages..(T=7).GC finished] ALPHORDER LEXORDER NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL MERGE-LEXORDER NIL NIL NIL [GC for 373 SFUN pages..(T=7).GC finished] MERGE-SORT-LEXORDER IF* RESIZE-LIST-EXEC [GC for 12544 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] RESIZE-LIST NIL NIL E/D-FN E/D To verify that the 30 encapsulated events correctly extend the current theory we will evaluate them. The theory thus constructed is only ephemeral. Encapsulated Events: ACL2 p!>>(LOGIC) :INVISIBLE ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ALISTP) The admission of ALISTP is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT L). We observe that the type of ALISTP is described by the theorem (OR (EQUAL (ALISTP L) T) (EQUAL (ALISTP L) NIL)). We used primitive type reasoning. Computing the guard conjecture for ALISTP.... The guard conjecture for ALISTP is trivial to prove. ALISTP is compliant with Common Lisp. Summary Form: ( DEFUN ALISTP ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08) 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. [GC for 373 SFUN pages..(T=7).GC finished] Summary Form: ( DEFUN SYMBOL-ALISTP ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.15 seconds (prove: 0.00, print: 0.00, other: 0.15) SYMBOL-ALISTP ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TRUE-LISTP) The event ( DEFUN TRUE-LISTP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN TRUE-LISTP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP LEN) The event ( DEFUN LEN ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN LEN ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP LENGTH) The event ( DEFUN LENGTH ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN LENGTH ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NTH) The admission of NTH is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT N). We could deduce no constraints on the type of NTH. Computing the guard conjecture for NTH.... The non-trivial part of the guard conjecture for NTH, given primitive type reasoning, is Goal (IMPLIES (AND (TRUE-LISTP L) (<= 0 N) (INTEGERP N) (NOT (ENDP L)) (NOT (ZP N))) (<= 0 (+ -1 N))). But we reduce the conjecture to T, by the simple :definitions ENDP and ZP and the :executable-counterpart of TAU-SYSTEM. Q.E.D. That completes the proof of the guard theorem for NTH. NTH is compliant with Common Lisp. Summary Form: ( DEFUN NTH ...) Rules: ((:DEFINITION ENDP) (:DEFINITION NOT) (:DEFINITION ZP) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.21 seconds (prove: 0.00, print: 0.00, other: 0.21) Prover steps counted: 62 NTH ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP CHAR) Since CHAR is non-recursive, its admission is trivial. We could deduce no constraints on the type of CHAR. Computing the guard conjecture for CHAR.... The guard conjecture for CHAR is trivial to prove, given primitive type reasoning and the :type-prescription rule LENGTH. CHAR is compliant with Common Lisp. [GC for 2867 CONS pages..(T=7).GC finished] Summary Form: ( DEFUN CHAR ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL) (:TYPE-PRESCRIPTION LENGTH)) Time: 0.24 seconds (prove: 0.00, print: 0.00, other: 0.24) 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.08 seconds (prove: 0.00, print: 0.00, other: 0.08) 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 2877 CONS pages..(T=7).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. Summary Form: ( DEFUN ASSOC-EQL-EXEC ...) Rules: ((:DEFINITION ALISTP) (:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION EQL) (:DEFINITION EQLABLE-ALISTP) (:DEFINITION EQLABLEP) (:DEFINITION NOT)) Time: 0.29 seconds (prove: 0.07, print: 0.01, other: 0.21) 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. [GC for 2887 CONS pages..(T=7).GC finished] Summary Form: ( DEFUN ASSOC-EQL-EXEC$GUARD-CHECK ...) Rules: NIL Time: 0.23 seconds (prove: 0.00, print: 0.00, other: 0.23) 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.19 seconds (prove: 0.01, print: 0.00, other: 0.18) Prover steps counted: 188 ASSOC-EQUAL ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBLIS) The admission of SUBLIS is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT TREE). We could deduce no constraints on the type of SUBLIS. Computing the guard conjecture for SUBLIS.... 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))))). [GC for 2887 CONS pages..(T=7).GC finished] 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)). 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)). [GC for 2897 CONS pages..(T=6).GC finished] 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))). 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))). [GC for 2897 CONS pages..(T=6).GC finished] 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)). 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)). [GC for 2897 CONS pages..(T=7).GC finished] 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)). 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)). [GC for 2897 CONS pages..(T=7).GC finished] 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. 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)). [GC for 2897 CONS pages..(T=7).GC finished] But simplification reduces this to T, using the :definition EQLABLE-ALISTP, the :executable-counterparts of ALISTP and CONSP and primitive type reasoning. That completes the proof of *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 2897 CONS pages..(T=7).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 2897 CONS pages..(T=7).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: 0.84 seconds (prove: 0.50, print: 0.09, other: 0.25) 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.09 seconds (prove: 0.00, print: 0.00, other: 0.09) 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. [GC for 12544 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] Summary Form: ( DEFUN IFIX ...) Rules: NIL Time: 0.17 seconds (prove: 0.00, print: 0.00, other: 0.17) IFIX ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP INTEGER-ABS) Since INTEGER-ABS is non-recursive, its admission is trivial. We observe that the type of INTEGER-ABS is described by the theorem (AND (INTEGERP (INTEGER-ABS X)) (<= 0 (INTEGER-ABS X))). We used primitive type reasoning. Computing the guard conjecture for INTEGER-ABS.... The guard conjecture for INTEGER-ABS is trivial to prove. INTEGER-ABS is compliant with Common Lisp. Summary Form: ( DEFUN INTEGER-ABS ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.06 seconds (prove: 0.00, print: 0.00, other: 0.06) INTEGER-ABS ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ACL2-COUNT) The admission of ACL2-COUNT is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT X). We observe that the type of ACL2-COUNT is described by the theorem (AND (INTEGERP (ACL2-COUNT X)) (<= 0 (ACL2-COUNT X))). We used primitive type reasoning and the :type-prescription rules INTEGER-ABS and LENGTH. Computing the guard conjecture for ACL2-COUNT.... The guard conjecture for ACL2-COUNT is trivial to prove, given primitive type reasoning and the :type-prescription rules ACL2-COUNT and INTEGER-ABS. ACL2-COUNT is compliant with Common Lisp. Summary Form: ( DEFUN ACL2-COUNT ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL) (:TYPE-PRESCRIPTION ACL2-COUNT) (:TYPE-PRESCRIPTION INTEGER-ABS) (:TYPE-PRESCRIPTION LENGTH)) Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10) ACL2-COUNT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NONNEGATIVE-INTEGER-QUOTIENT) For the admission of NONNEGATIVE-INTEGER-QUOTIENT we will use the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT I). The non-trivial part of the measure conjecture is Goal (IMPLIES (NOT (OR (= (NFIX J) 0) (< (IFIX I) J))) (O< (ACL2-COUNT (+ I (- J))) (ACL2-COUNT I))). By the simple :definition = we reduce the conjecture to Goal' (IMPLIES (NOT (OR (EQUAL (NFIX J) 0) (< (IFIX I) J))) (O< (ACL2-COUNT (+ I (- J))) (ACL2-COUNT I))). This simplifies, using the :definitions ACL2-COUNT (if-intro), IFIX (if-intro), INTEGER-ABS (if-intro), NFIX (if-intro), O-FINP and O< (if-intro) and primitive type reasoning, to the following two conjectures. Subgoal 2 (IMPLIES (AND (INTEGERP J) (<= 0 J) (NOT (EQUAL J 0)) (INTEGERP I) (<= J I) (< (+ I (- J)) 0)) (< (- (+ I (- J))) I)). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1 (IMPLIES (AND (INTEGERP J) (<= 0 J) (NOT (EQUAL J 0)) (INTEGERP I) (<= J I) (<= 0 (+ I (- J)))) (< (+ I (- J)) I)). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Q.E.D. That completes the proof of the measure theorem for NONNEGATIVE-INTEGER-QUOTIENT. Thus, we admit this function under the principle of definition. We observe that the type of NONNEGATIVE-INTEGER-QUOTIENT is described by the theorem (AND (INTEGERP (NONNEGATIVE-INTEGER-QUOTIENT I J)) (<= 0 (NONNEGATIVE-INTEGER-QUOTIENT I J))). We used primitive type reasoning and the :type-prescription rule NFIX. Computing the guard conjecture for NONNEGATIVE-INTEGER-QUOTIENT.... [GC for 2897 CONS pages..(T=7).GC finished] The non-trivial part of the guard conjecture for NONNEGATIVE-INTEGER-QUOTIENT, given primitive type reasoning and the :type-prescription rules IFIX, NFIX and NONNEGATIVE-INTEGER-QUOTIENT, is Goal (IMPLIES (AND (< 0 J) (INTEGERP J) (<= 0 I) (INTEGERP I) (NOT (OR (= (NFIX J) 0) (< (IFIX I) J)))) (<= 0 (+ I (- J)))). By the simple :definition = we reduce the conjecture to Goal' (IMPLIES (AND (< 0 J) (INTEGERP J) (<= 0 I) (INTEGERP I) (NOT (OR (EQUAL (NFIX J) 0) (< (IFIX I) J)))) (<= 0 (+ I (- J)))). This simplifies, using the :definitions IFIX and NFIX and primitive type reasoning, to Goal'' (IMPLIES (AND (< 0 J) (INTEGERP J) (<= 0 I) (INTEGERP I) (<= J I)) (<= 0 (+ I (- J)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Q.E.D. That completes the proof of the guard theorem for NONNEGATIVE-INTEGER-QUOTIENT. NONNEGATIVE-INTEGER-QUOTIENT is compliant with Common Lisp. Summary Form: ( DEFUN NONNEGATIVE-INTEGER-QUOTIENT ...) Rules: ((:DEFINITION =) (:DEFINITION ACL2-COUNT) (:DEFINITION IFIX) (:DEFINITION INTEGER-ABS) (:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION O-FINP) (:DEFINITION O<) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:TYPE-PRESCRIPTION IFIX) (:TYPE-PRESCRIPTION NFIX) (:TYPE-PRESCRIPTION NONNEGATIVE-INTEGER-QUOTIENT)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION ACL2-COUNT) (:DEFINITION IFIX) (:DEFINITION INTEGER-ABS) (:DEFINITION NFIX) (:DEFINITION O<)) Time: 0.30 seconds (prove: 0.00, print: 0.01, other: 0.29) Prover steps counted: 501 NONNEGATIVE-INTEGER-QUOTIENT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FLOOR) Since FLOOR is non-recursive, its admission is trivial. We observe that the type of FLOOR is described by the theorem (INTEGERP (FLOOR I J)). We used primitive type reasoning and the :type-prescription rule NONNEGATIVE-INTEGER-QUOTIENT. Computing the guard conjecture for FLOOR.... [GC for 2897 CONS pages..(T=7).GC finished] The guard conjecture for FLOOR is trivial to prove, given the :executable- counterpart of EQLABLEP, primitive type reasoning and the :type-prescription rule NONNEGATIVE-INTEGER-QUOTIENT. FLOOR is compliant with Common Lisp. Summary Form: ( DEFUN FLOOR ...) Rules: ((:EXECUTABLE-COUNTERPART EQLABLEP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:TYPE-PRESCRIPTION NONNEGATIVE-INTEGER-QUOTIENT)) Time: 0.33 seconds (prove: 0.00, print: 0.07, other: 0.26) FLOOR ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SYMBOL-LISTP) The event ( DEFUN SYMBOL-LISTP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN SYMBOL-LISTP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP BINARY-APPEND) The admission of BINARY-APPEND is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT X). We observe that the type of BINARY-APPEND is described by the theorem (OR (CONSP (APPEND X Y)) (EQUAL (APPEND X Y) Y)). We used primitive type reasoning. Computing the guard conjecture for BINARY-APPEND.... The guard conjecture for BINARY-APPEND is trivial to prove, given primitive type reasoning. BINARY-APPEND is compliant with Common Lisp. Summary Form: ( DEFUN BINARY-APPEND ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.17 seconds (prove: 0.00, print: 0.00, other: 0.17) BINARY-APPEND ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP STRING-APPEND) Since STRING-APPEND is non-recursive, its admission is trivial. We observe that the type of STRING-APPEND is described by the theorem (STRINGP (STRING-APPEND STR1 STR2)). We used primitive type reasoning. Computing the guard conjecture for STRING-APPEND.... The non-trivial part of the guard conjecture for STRING-APPEND is Goal (IMPLIES (AND (STRINGP STR2) (STRINGP STR1)) (EQUAL (COERCE (APPEND (COERCE STR1 'LIST) (COERCE STR2 'LIST)) 'STRING) (STRING-APPEND STR1 STR2))). But we reduce the conjecture to T, by the simple :definition STRING-APPEND. Q.E.D. That completes the proof of the guard theorem for STRING-APPEND. STRING-APPEND is compliant with Common Lisp. Summary Form: ( DEFUN STRING-APPEND ...) Rules: ((:DEFINITION STRING-APPEND) (:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.20 seconds (prove: 0.00, print: 0.00, other: 0.20) 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. [GC for 2907 CONS pages..(T=7).GC finished] Summary Form: ( DEFUN PLIST-WORLDP ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) PLIST-WORLDP ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FGETPROP) The admission of FGETPROP is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT WORLD-ALIST). We could deduce no constraints on the type of FGETPROP. Computing the guard conjecture for FGETPROP.... The non-trivial part of the guard conjecture for FGETPROP is Goal (AND (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP KEY) (SYMBOLP SYMB) (NOT (CONSP WORLD-ALIST))) (EQ WORLD-ALIST NIL)) (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP KEY) (SYMBOLP SYMB) (NOT (ENDP WORLD-ALIST)) (NOT (CONSP (CAR WORLD-ALIST)))) (EQUAL (CAR WORLD-ALIST) NIL)) (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP KEY) (SYMBOLP SYMB) (NOT (ENDP WORLD-ALIST)) (NOT (AND (EQ SYMB (CAR (CAR WORLD-ALIST))) (EQ KEY (CADR (CAR WORLD-ALIST)))))) (PLIST-WORLDP (CDR WORLD-ALIST))) (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP KEY) (SYMBOLP SYMB) (NOT (ENDP WORLD-ALIST)) (AND (EQ SYMB (CAR (CAR WORLD-ALIST))) (EQ KEY (CADR (CAR WORLD-ALIST)))) (NOT (CONSP (CDR (CAR WORLD-ALIST))))) (EQUAL (CDR (CAR WORLD-ALIST)) NIL)) (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP KEY) (SYMBOLP SYMB) (NOT (ENDP WORLD-ALIST)) (EQ SYMB (CAR (CAR WORLD-ALIST))) (NOT (CONSP (CDR (CAR WORLD-ALIST))))) (EQUAL (CDR (CAR WORLD-ALIST)) NIL))). By the simple :definitions ENDP and EQ we reduce the conjecture to the following five conjectures. Subgoal 5 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP KEY) (SYMBOLP SYMB) (NOT (CONSP WORLD-ALIST))) (EQUAL WORLD-ALIST NIL)). But simplification reduces this to T, using the :definition PLIST-WORLDP. Subgoal 4 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP KEY) (SYMBOLP SYMB) (CONSP WORLD-ALIST) (NOT (CONSP (CAR WORLD-ALIST)))) (EQUAL (CAR WORLD-ALIST) NIL)). But simplification reduces this to T, using the :definition PLIST-WORLDP. Subgoal 3 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP KEY) (SYMBOLP SYMB) (CONSP WORLD-ALIST) (NOT (AND (EQUAL SYMB (CAR (CAR WORLD-ALIST))) (EQUAL KEY (CADR (CAR WORLD-ALIST)))))) (PLIST-WORLDP (CDR WORLD-ALIST))). But simplification reduces this to T, using the :definition PLIST-WORLDP. 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)). [GC for 2907 CONS pages..(T=7).GC finished] 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.07, print: 0.00, other: 0.23) 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 2917 CONS pages..(T=8).GC finished] By the simple :definitions ENDP and EQ we reduce the conjecture to the following five conjectures. Subgoal 5 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP WORLD-NAME) (SYMBOLP KEY) (SYMBOLP SYMB) (NOT (CONSP WORLD-ALIST))) (EQUAL WORLD-ALIST NIL)). But simplification reduces this to T, using the :definition PLIST-WORLDP. Subgoal 4 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP WORLD-NAME) (SYMBOLP KEY) (SYMBOLP SYMB) (CONSP WORLD-ALIST) (NOT (CONSP (CAR WORLD-ALIST)))) (EQUAL (CAR WORLD-ALIST) NIL)). But simplification reduces this to T, using the :definition PLIST-WORLDP. Subgoal 3 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP WORLD-NAME) (SYMBOLP KEY) (SYMBOLP SYMB) (CONSP WORLD-ALIST) (NOT (AND (EQUAL SYMB (CAR (CAR WORLD-ALIST))) (EQUAL KEY (CADR (CAR WORLD-ALIST)))))) (PLIST-WORLDP (CDR WORLD-ALIST))). But simplification reduces this to T, using the :definition PLIST-WORLDP. Subgoal 2 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP WORLD-NAME) (SYMBOLP KEY) (SYMBOLP SYMB) (CONSP WORLD-ALIST) (EQUAL SYMB (CAR (CAR WORLD-ALIST))) (EQUAL KEY (CADR (CAR WORLD-ALIST))) (NOT (CONSP (CDR (CAR WORLD-ALIST))))) (EQUAL (CDR (CAR WORLD-ALIST)) NIL)). But simplification reduces this to T, using the :definition PLIST-WORLDP. Subgoal 1 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP WORLD-NAME) (SYMBOLP KEY) (SYMBOLP SYMB) (CONSP WORLD-ALIST) (EQUAL SYMB (CAR (CAR WORLD-ALIST))) (NOT (CONSP (CDR (CAR WORLD-ALIST))))) (EQUAL (CDR (CAR WORLD-ALIST)) NIL)). But simplification reduces this to T, using the :definition PLIST-WORLDP. Q.E.D. That completes the proof of the guard theorem for SGETPROP. SGETPROP is compliant with Common Lisp. Summary Form: ( DEFUN SGETPROP ...) Rules: ((:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT) (:DEFINITION PLIST-WORLDP)) Time: 0.30 seconds (prove: 0.00, print: 0.08, other: 0.22) Prover steps counted: 804 SGETPROP ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FUNCTION-SYMBOLP) Since FUNCTION-SYMBOLP is non-recursive, its admission is trivial. We observe that the type of FUNCTION-SYMBOLP is described by the theorem (OR (EQUAL (FUNCTION-SYMBOLP SYM WRLD) T) (EQUAL (FUNCTION-SYMBOLP SYM WRLD) NIL)). Computing the guard conjecture for FUNCTION-SYMBOLP.... The guard conjecture for FUNCTION-SYMBOLP is trivial to prove. FUNCTION-SYMBOLP is compliant with Common Lisp. Summary Form: ( DEFUN FUNCTION-SYMBOLP ...) Rules: NIL Time: 0.17 seconds (prove: 0.00, print: 0.00, other: 0.17) 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.... [GC for 2917 CONS pages..(T=7).GC finished] The non-trivial part of the guard conjecture for STRIP-CARS is Goal (AND (IMPLIES (AND (ALISTP X) (NOT (CONSP X))) (EQ X NIL)) (IMPLIES (AND (ALISTP X) (NOT (ENDP X))) (ALISTP (CDR X))) (IMPLIES (AND (ALISTP X) (NOT (ENDP X)) (NOT (CONSP (CAR X)))) (EQUAL (CAR X) NIL))). By the simple :definitions ENDP and EQ we reduce the conjecture to the following three conjectures. Subgoal 3 (IMPLIES (AND (ALISTP X) (NOT (CONSP X))) (EQUAL X NIL)). But simplification reduces this to T, using the :definition ALISTP. Subgoal 2 (IMPLIES (AND (ALISTP X) (CONSP X)) (ALISTP (CDR X))). But simplification reduces this to T, using the :definition ALISTP. Subgoal 1 (IMPLIES (AND (ALISTP X) (CONSP X) (NOT (CONSP (CAR X)))) (EQUAL (CAR X) NIL)). But simplification reduces this to T, using the :definition ALISTP. Q.E.D. That completes the proof of the guard theorem for STRIP-CARS. STRIP-CARS is compliant with Common Lisp. Summary Form: ( DEFUN STRIP-CARS ...) Rules: ((:DEFINITION ALISTP) (:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT) (:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.26 seconds (prove: 0.01, print: 0.07, other: 0.18) 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.15 seconds (prove: 0.00, print: 0.00, other: 0.15) 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))). [GC for 2917 CONS pages..(T=7).GC finished] By the simple :definitions ENDP and EQ we reduce the conjecture to the following seven conjectures. Subgoal 7 (IMPLIES (AND (ALISTP ALIST) (SYMBOLP X) (NOT (CONSP ALIST))) (EQUAL ALIST NIL)). But simplification reduces this to T, using the :definition ALISTP. Subgoal 6 (IMPLIES (AND (ALISTP ALIST) (SYMBOLP X) (CONSP ALIST) (NOT (EQUAL X (CAR (CAR ALIST))))) (ALISTP (CDR ALIST))). But simplification reduces this to T, using the :definition ALISTP. Subgoal 5 (IMPLIES (AND (ALISTP ALIST) (SYMBOLP X) (CONSP ALIST) (NOT (CONSP (CAR ALIST)))) (EQUAL (CAR ALIST) NIL)). But simplification reduces this to T, using the :definition ALISTP. Subgoal 4 (IMPLIES (AND (SYMBOL-ALISTP ALIST) (NOT (SYMBOLP X)) (CONSP ALIST)) (SYMBOLP (CAR (CAR ALIST)))). But simplification reduces this to T, using the :definition SYMBOL-ALISTP. Subgoal 3 (IMPLIES (AND (SYMBOL-ALISTP ALIST) (NOT (SYMBOLP X)) (CONSP ALIST) (NOT (CONSP (CAR ALIST)))) (EQUAL (CAR ALIST) NIL)). But simplification reduces this to T, using the :definition SYMBOL-ALISTP. Subgoal 2 (IMPLIES (AND (SYMBOL-ALISTP ALIST) (NOT (SYMBOLP X)) (CONSP ALIST) (NOT (EQUAL X (CAR (CAR ALIST))))) (SYMBOL-ALISTP (CDR ALIST))). But simplification reduces this to T, using the :definition SYMBOL-ALISTP. Subgoal 1 (IMPLIES (AND (SYMBOL-ALISTP ALIST) (NOT (SYMBOLP X)) (NOT (CONSP ALIST))) (EQUAL ALIST NIL)). But simplification reduces this to T, using the :definition SYMBOL-ALISTP. Q.E.D. That completes the proof of the guard theorem for ASSOC-EQ-EXEC. ASSOC-EQ-EXEC is compliant with Common Lisp. Summary Form: ( DEFUN ASSOC-EQ-EXEC ...) Rules: ((:DEFINITION ALISTP) (:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT) (:DEFINITION SYMBOL-ALISTP)) Time: 0.29 seconds (prove: 0.07, print: 0.01, other: 0.21) Prover steps counted: 547 ASSOC-EQ-EXEC ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TABLE-ALIST) Since TABLE-ALIST is non-recursive, its admission is trivial. We could deduce no constraints on the type of TABLE-ALIST. Computing the guard conjecture for TABLE-ALIST.... The guard conjecture for TABLE-ALIST is trivial to prove. TABLE-ALIST is compliant with Common Lisp. [GC for 12544 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] Summary Form: ( DEFUN TABLE-ALIST ...) Rules: NIL Time: 0.23 seconds (prove: 0.00, print: 0.00, other: 0.23) TABLE-ALIST End of Encapsulated Events. [GC for 2917 CONS pages..(T=7).GC finished] [GC for 2917 CONS pages..(T=7).GC finished] [GC for 12544 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] [GC for 2927 CONS pages..(T=7).GC finished] [GC for 2937 CONS pages..(T=7).GC finished] Having verified that the encapsulated events validate the signatures of the ENCAPSULATE event, we discard the ephemeral theory and extend the original theory as directed by the signatures and the non-LOCAL events. We export TABLE-ALIST, ASSOC-EQ-EXEC, ASSOC-EQ-EXEC$GUARD-CHECK, STRIP-CARS, FUNCTION-SYMBOLP, SGETPROP, FGETPROP, PLIST-WORLDP, STRING-APPEND, BINARY-APPEND, FLOOR, NONNEGATIVE-INTEGER-QUOTIENT, ACL2-COUNT, INTEGER-ABS, IFIX, NFIX, SUBLIS, ASSOC-EQUAL, ASSOC-EQL-EXEC$GUARD-CHECK, ASSOC-EQL-EXEC, EQLABLE-ALISTP, CHAR, NTH, SYMBOL-ALISTP and ALISTP. Summary Form: ( ENCAPSULATE NIL (LOGIC) ...) Rules: NIL Time: 9.92 seconds (prove: 0.73, print: 0.34, other: 8.85) Prover steps counted: 9193 T [GC for 2937 CONS pages..(T=7).GC finished] [GC for 12544 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] Summary Form: ( DEFUN MOD-EXPT ...) Rules: NIL Time: 0.31 seconds (prove: 0.00, print: 0.00, other: 0.31) MOD-EXPT Summary Form: ( DEFUN CONJOIN-CLAUSES ...) Rules: NIL Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12) 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.14 seconds (prove: 0.00, print: 0.00, other: 0.14) CLAUSES-RESULT Summary Form: ( TABLE EVISC-TABLE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) EVISC-TABLE Summary Form: ( DEFCONST *TOP-HINT-KEYWORDS* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) *TOP-HINT-KEYWORDS* Summary Form: ( DEFCONST *HINT-KEYWORDS* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) *HINT-KEYWORDS* Summary Form: ( TABLE CUSTOM-KEYWORDS-TABLE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CUSTOM-KEYWORDS-TABLE Summary Form: ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) ADD-CUSTOM-KEYWORD-HINT Summary Form: ( DEFMACRO REMOVE-CUSTOM-KEYWORD-HINT ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) REMOVE-CUSTOM-KEYWORD-HINT Summary Form: ( DEFUN SPLICE-KEYWORD-ALIST ...) Rules: NIL Time: 0.21 seconds (prove: 0.00, print: 0.00, other: 0.21) SPLICE-KEYWORD-ALIST Summary Form: ( DEFMACRO SHOW-CUSTOM-KEYWORD-HINT-EXPANSION ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) SHOW-CUSTOM-KEYWORD-HINT-EXPANSION [GC for 2947 CONS pages..(T=8).GC finished] Summary Form: ( DEFUN SEARCH-FN-GUARD ...) Rules: NIL Time: 0.42 seconds (prove: 0.00, print: 0.00, other: 0.42) SEARCH-FN-GUARD Summary Form: ( DEFUN SEARCH-FROM-START ...) Rules: NIL Time: 0.23 seconds (prove: 0.00, print: 0.00, other: 0.23) SEARCH-FROM-START Summary Form: ( DEFUN SEARCH-FROM-END ...) Rules: NIL Time: 0.23 seconds (prove: 0.00, print: 0.00, other: 0.23) SEARCH-FROM-END To verify that the 18 encapsulated events correctly extend the current theory we will evaluate them. The theory thus constructed is only ephemeral. Encapsulated Events: ACL2 p!>>(LOCAL (DEFTHM LEN-STRING-DOWNCASE1 (EQUAL (LEN (STRING-DOWNCASE1 X)) (LEN X)))) [GC for 2947 CONS pages..(T=7).GC finished] ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM STRINGP-SUBSEQ (IMPLIES (STRINGP STR) (STRINGP (SUBSEQ STR START END))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM STANDARD-CHAR-LISTP-NTHCDR (IMPLIES (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP (NTHCDR N X))) :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM STANDARD-CHAR-LISTP-REVAPPEND (IMPLIES (AND (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))) :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM STANDARD-CHAR-LISTP-OF-TAKE (IMPLIES (AND (STANDARD-CHAR-LISTP X) (<= N (LEN X))) (STANDARD-CHAR-LISTP (TAKE N X))) :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM CHARACTER-LISTP-OF-TAKE (IMPLIES (AND (CHARACTER-LISTP X) (<= N (LEN X))) (CHARACTER-LISTP (TAKE N X))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM CHARACTER-LISTP-NTHCDR (IMPLIES (CHARACTER-LISTP X) (CHARACTER-LISTP (NTHCDR N X))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM NTHCDR-NIL (EQUAL (NTHCDR N NIL) NIL))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM LEN-NTHCDR (EQUAL (LEN (NTHCDR N X)) (NFIX (- (LEN X) (NFIX N)))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP (IMPLIES (AND (STRINGP SEQ) (NATP START) (NATP END) (<= START END) (<= END (LENGTH SEQ)) (STANDARD-CHAR-LISTP (COERCE SEQ 'LIST))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ START END) 'LIST))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-REVAPPEND (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y)))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR (IMPLIES (TRUE-LISTP X) (TRUE-LISTP (NTHCDR N X))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-SUBSEQ (IMPLIES (TRUE-LISTP SEQ) (TRUE-LISTP (SUBSEQ SEQ START END))) :RULE-CLASSES (:REWRITE :TYPE-PRESCRIPTION))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM LEN-REVAPPEND (EQUAL (LEN (REVAPPEND X Y)) (+ (LEN X) (LEN Y))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM LEN-OF-TAKE (EQUAL (LEN (TAKE N LST)) (NFIX N)))) [GC for 2947 CONS pages..(T=7).GC finished] ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM LEN-SUBSEQ (IMPLIES (AND (TRUE-LISTP SEQ) (NATP START) (NATP END) (<= START END)) (EQUAL (LEN (SUBSEQ SEQ START END)) (- END START))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM LEN-SUBSEQ-STRING (IMPLIES (AND (STRINGP SEQ) (NATP START) (NATP END) (<= START END) (<= END (LEN (COERCE SEQ 'LIST)))) (EQUAL (LEN (COERCE (SUBSEQ SEQ START END) 'LIST)) (- END START))) :HINTS (("Goal" :IN-THEORY (ENABLE SUBSEQ))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(DEFUN SEARCH-FN (SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P) (DECLARE (XARGS :GUARD (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P) :GUARD-HINTS (("Goal" :IN-THEORY (DISABLE SUBSEQ))))) (LET* ((END1 (IF END1P END1 (LENGTH SEQ1))) (END2 (IF END2P END2 (LENGTH SEQ2))) (SEQ1 (SUBSEQ SEQ1 START1 END1))) (MV-LET (SEQ1 SEQ2) (COND ((EQ TEST 'CHAR-EQUAL) (MV (STRING-DOWNCASE SEQ1) (STRING-DOWNCASE SEQ2))) (T (MV SEQ1 SEQ2))) (AND (<= (- END1 START1) (- END2 START2)) (COND (FROM-END (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 NIL)) (T (SEARCH-FROM-START SEQ1 SEQ2 START2 END2))))))) Summary Form: ( DEFUN SEARCH-FN ...) Rules: NIL Time: 0.26 seconds (prove: 0.00, print: 0.00, other: 0.26) 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.64 seconds (prove: 0.00, print: 0.00, other: 0.64) 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 [GC for 2947 CONS pages..(T=8).GC finished] Summary Form: ( DEFUN COUNT-STRINGP ...) Rules: NIL Time: 0.30 seconds (prove: 0.00, print: 0.00, other: 0.30) COUNT-STRINGP Summary Form: ( DEFUN COUNT-LISTP ...) Rules: NIL Time: 0.21 seconds (prove: 0.00, print: 0.00, other: 0.21) COUNT-LISTP To verify that the two encapsulated events correctly extend the current theory we will evaluate them. The theory thus constructed is only ephemeral. Encapsulated Events: ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR (IMPLIES (TRUE-LISTP X) (TRUE-LISTP (NTHCDR N X))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(DEFUN COUNT-FN (ITEM SEQUENCE START END) (DECLARE (XARGS :GUARD (AND (IF (TRUE-LISTP SEQUENCE) T (STRINGP SEQUENCE)) (NATP START) (OR (NULL END) (AND (NATP END) (<= END (LENGTH SEQUENCE))))))) (LET ((END (OR END (LENGTH SEQUENCE)))) (COND ((<= END START) 0) ((STRINGP SEQUENCE) (COUNT-STRINGP ITEM SEQUENCE START END)) (T (COUNT-LISTP ITEM (NTHCDR START SEQUENCE) (- END START)))))) Summary Form: ( DEFUN COUNT-FN ...) Rules: NIL Time: 0.21 seconds (prove: 0.00, print: 0.00, other: 0.21) 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.42 seconds (prove: 0.00, print: 0.00, other: 0.42) T Summary Form: ( DEFMACRO COUNT ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) COUNT ACL2 Observation in TOP-LEVEL: VERIFY-TERMINATION events are skipped when the default-defun-mode is :PROGRAM. NIL ACL2 Observation in TOP-LEVEL: VERIFY-TERMINATION events are skipped when the default-defun-mode is :PROGRAM. NIL ACL2 Observation in TOP-LEVEL: VERIFY-TERMINATION events are skipped when the default-defun-mode is :PROGRAM. NIL [GC for 12544 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] Summary Form: ( DEFUN MAKE-SHARP-ATSIGN ...) Rules: NIL Time: 0.23 seconds (prove: 0.00, print: 0.00, other: 0.23) MAKE-SHARP-ATSIGN Summary Form: ( DEFUN SHARP-ATSIGN-ALIST ...) Rules: NIL Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16) SHARP-ATSIGN-ALIST Summary Form: ( DEFMACRO TIME$1 ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TIME$1 Summary Form: ( DEFMACRO TIME$ ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TIME$ To verify that the five encapsulated events correctly extend the current theory we will evaluate them. The theory thus constructed is only ephemeral. Encapsulated Events: ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-REVAPPEND (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y)))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(VERIFY-GUARDS THROW-NONEXEC-ERROR) ACL2 Observation in TOP-LEVEL: VERIFY-GUARDS events are skipped when the default-defun-mode is :PROGRAM. NIL ACL2 p!>>(VERIFY-GUARDS DEFUN-NX-FN) ACL2 Observation in TOP-LEVEL: VERIFY-GUARDS events are skipped when the default-defun-mode is :PROGRAM. NIL ACL2 p!>>(VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1) ACL2 Observation in TOP-LEVEL: VERIFY-GUARDS events are skipped when the default-defun-mode is :PROGRAM. NIL ACL2 p!>>(VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX) ACL2 Observation in TOP-LEVEL: VERIFY-GUARDS events are skipped when the default-defun-mode is :PROGRAM. NIL End of Encapsulated Events. ACL2 Observation in ( ENCAPSULATE NIL (LOCAL ...) ...): The submitted encapsulate event has created no new ACL2 events, and thus is leaving the ACL2 logical world unchanged. See :DOC encapsulate. Summary Form: ( ENCAPSULATE NIL (LOCAL ...) ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :EMPTY-ENCAPSULATE Summary Form: ( DEFUN GC$-FN ...) Rules: NIL Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08) 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.10 seconds (prove: 0.00, print: 0.00, other: 0.10) 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.11 seconds (prove: 0.00, print: 0.00, other: 0.11) GET-WORMHOLE-STATUS Summary Form: ( DEFUN FILE-WRITE-DATE$ ...) Rules: NIL [GC for 2957 CONS pages..(T=7).GC finished] Time: 0.13 seconds (prove: 0.00, print: 0.00, other: 0.13) FILE-WRITE-DATE$ Summary Form: ( DEFUN DELETE-FILE$ ...) Rules: NIL Time: 0.13 seconds (prove: 0.00, print: 0.00, other: 0.13) DELETE-FILE$ Summary Form: ( DEFUN DEBUGGER-ENABLE ...) Rules: NIL Time: 0.13 seconds (prove: 0.00, print: 0.00, other: 0.13) DEBUGGER-ENABLE Summary Form: ( DEFUN BREAK$ ...) Rules: NIL Time: 0.07 seconds (prove: 0.00, print: 0.00, other: 0.07) BREAK$ Summary Form: ( DEFUN PRINT-CALL-HISTORY ...) Rules: NIL Time: 0.07 seconds (prove: 0.00, print: 0.00, other: 0.07) 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.20 seconds (prove: 0.00, print: 0.00, other: 0.20) DEBUGGER-ENABLEDP Summary Form: ( DEFUN MAYBE-PRINT-CALL-HISTORY ...) Rules: NIL Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18) 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) [GC for 2957 CONS pages..(T=7).GC finished] SET-DEBUGGER-ENABLE [GC for 12544 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] Summary Form: ( DEFUN SET-DEBUGGER-ENABLE-FN ...) Rules: NIL Time: 0.29 seconds (prove: 0.00, print: 0.00, other: 0.29) SET-DEBUGGER-ENABLE-FN ACL2 Observation in TOP-LEVEL: IN-THEORY events are skipped when the default-defun-mode is :PROGRAM. NIL ACL2 Observation in TOP-LEVEL: IN-THEORY events are skipped when the default-defun-mode is :PROGRAM. NIL ACL2 Observation in TOP-LEVEL: IN-THEORY events are skipped when the default-defun-mode is :PROGRAM. NIL Summary Form: ( DEFUN ADD-@PAR-SUFFIX ...) Rules: NIL Time: 0.15 seconds (prove: 0.00, print: 0.00, other: 0.15) ADD-@PAR-SUFFIX Summary Form: ( DEFUN GENERATE-@PAR-MAPPINGS ...) Rules: NIL Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16) GENERATE-@PAR-MAPPINGS Summary Form: ( DEFCONST *@PAR-MAPPINGS* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) *@PAR-MAPPINGS* Summary Form: ( DEFUN MAKE-IDENTITY-FOR-@PAR-MAPPINGS ...) Rules: NIL Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16) 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)) [GC for 2957 CONS pages..(T=7).GC finished] Summary Form: ( DEFMACRO ERROR-IN-PARALLELISM-MODE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) ERROR-IN-PARALLELISM-MODE@PAR ACL2 p!>>(DEFMACRO ERROR1@PAR (&REST RST) (CONS 'ERROR1 RST)) Summary Form: ( DEFMACRO ERROR1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) ERROR1@PAR ACL2 p!>>(DEFMACRO F-PUT-GLOBAL@PAR (&REST RST) (CONS 'F-PUT-GLOBAL RST)) Summary Form: ( DEFMACRO F-PUT-GLOBAL@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) F-PUT-GLOBAL@PAR ACL2 p!>>(DEFMACRO IO?@PAR (&REST RST) (CONS 'IO? RST)) Summary Form: ( DEFMACRO IO?@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) IO?@PAR ACL2 p!>>(DEFMACRO IO?-PROVE@PAR (&REST RST) (CONS 'IO?-PROVE RST)) Summary Form: ( DEFMACRO IO?-PROVE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) IO?-PROVE@PAR ACL2 p!>>(DEFMACRO MV@PAR (&REST RST) (CONS 'MV RST)) Summary Form: ( DEFMACRO MV@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) MV@PAR ACL2 p!>>(DEFMACRO MV-LET@PAR (&REST RST) (CONS 'MV-LET RST)) Summary Form: ( DEFMACRO MV-LET@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) MV-LET@PAR ACL2 p!>>(DEFMACRO PARALLEL-ONLY@PAR (&REST RST) (CONS 'PARALLEL-ONLY RST)) Summary Form: ( DEFMACRO PARALLEL-ONLY@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) PARALLEL-ONLY@PAR ACL2 p!>>(DEFMACRO PPROGN@PAR (&REST RST) (CONS 'PPROGN RST)) Summary Form: ( DEFMACRO PPROGN@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) PPROGN@PAR ACL2 p!>>(DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR (&REST RST) (CONS 'SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM RST)) Summary Form: ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR ACL2 p!>>(DEFMACRO SERIAL-ONLY@PAR (&REST RST) (CONS 'SERIAL-ONLY RST)) Summary Form: ( DEFMACRO SERIAL-ONLY@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) SERIAL-ONLY@PAR ACL2 p!>>(DEFMACRO SL-LET@PAR (&REST RST) (CONS 'SL-LET RST)) Summary Form: ( DEFMACRO SL-LET@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) SL-LET@PAR ACL2 p!>>(DEFMACRO STATE-MAC@PAR (&REST RST) (CONS 'STATE-MAC RST)) Summary Form: ( DEFMACRO STATE-MAC@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) STATE-MAC@PAR ACL2 p!>>(DEFMACRO VALUE@PAR (&REST RST) (CONS 'VALUE RST)) Summary Form: ( DEFMACRO VALUE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) VALUE@PAR ACL2 p!>>(DEFMACRO WARNING$@PAR (&REST RST) (CONS 'WARNING$ RST)) Summary Form: ( DEFMACRO WARNING$@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) WARNING$@PAR ACL2 p!>>(DEFMACRO ADD-CUSTOM-KEYWORD-HINT@PAR (&REST RST) (CONS 'ADD-CUSTOM-KEYWORD-HINT RST)) Summary Form: ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) ADD-CUSTOM-KEYWORD-HINT@PAR ACL2 p!>>(DEFMACRO EVAL-CLAUSE-PROCESSOR@PAR (&REST RST) (CONS 'EVAL-CLAUSE-PROCESSOR RST)) Summary Form: ( DEFMACRO EVAL-CLAUSE-PROCESSOR@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) 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 [GC for 2967 CONS pages..(T=7).GC finished] Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) APPLY-OVERRIDE-HINTS@PAR ACL2 p!>>(DEFMACRO APPLY-REORDER-HINT@PAR (&REST RST) (CONS 'APPLY-REORDER-HINT RST)) Summary Form: ( DEFMACRO APPLY-REORDER-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) APPLY-REORDER-HINT@PAR ACL2 p!>>(DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR (&REST RST) (CONS 'APPLY-TOP-HINTS-CLAUSE RST)) Summary Form: ( DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) APPLY-TOP-HINTS-CLAUSE@PAR ACL2 p!>>(DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR (&REST RST) (CONS 'CHECK-TRANSLATED-OVERRIDE-HINT RST)) Summary Form: ( DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CHECK-TRANSLATED-OVERRIDE-HINT@PAR ACL2 p!>>(DEFMACRO CHK-ARGLIST@PAR (&REST RST) (CONS 'CHK-ARGLIST RST)) Summary Form: ( DEFMACRO CHK-ARGLIST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CHK-ARGLIST@PAR ACL2 p!>>(DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR (&REST RST) (CONS 'CHK-DO-NOT-EXPR-VALUE RST)) Summary Form: ( DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CHK-DO-NOT-EXPR-VALUE@PAR ACL2 p!>>(DEFMACRO CHK-EQUAL-ARITIES@PAR (&REST RST) (CONS 'CHK-EQUAL-ARITIES RST)) Summary Form: ( DEFMACRO CHK-EQUAL-ARITIES@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CHK-EQUAL-ARITIES@PAR ACL2 p!>>(DEFMACRO CHK-EQUIV-CLASSICALP@PAR (&REST RST) (CONS 'CHK-EQUIV-CLASSICALP RST)) Summary Form: ( DEFMACRO CHK-EQUIV-CLASSICALP@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CHK-EQUIV-CLASSICALP@PAR ACL2 p!>>(DEFMACRO CHK-THEORY-EXPR-VALUE@PAR (&REST RST) (CONS 'CHK-THEORY-EXPR-VALUE RST)) Summary Form: ( DEFMACRO CHK-THEORY-EXPR-VALUE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CHK-THEORY-EXPR-VALUE@PAR ACL2 p!>>(DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR (&REST RST) (CONS 'CHK-THEORY-EXPR-VALUE1 RST)) Summary Form: ( DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CHK-THEORY-EXPR-VALUE1@PAR ACL2 p!>>(DEFMACRO CHK-THEORY-INVARIANT@PAR (&REST RST) (CONS 'CHK-THEORY-INVARIANT RST)) Summary Form: ( DEFMACRO CHK-THEORY-INVARIANT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CHK-THEORY-INVARIANT@PAR ACL2 p!>>(DEFMACRO CHK-THEORY-INVARIANT1@PAR (&REST RST) (CONS 'CHK-THEORY-INVARIANT1 RST)) Summary Form: ( DEFMACRO CHK-THEORY-INVARIANT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CHK-THEORY-INVARIANT1@PAR ACL2 p!>>(DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR (&REST RST) (CONS 'CUSTOM-KEYWORD-HINT-INTERPRETER RST)) Summary Form: ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CUSTOM-KEYWORD-HINT-INTERPRETER@PAR ACL2 p!>>(DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR (&REST RST) (CONS 'CUSTOM-KEYWORD-HINT-INTERPRETER1 RST)) Summary Form: ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR ...) Rules: NIL 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 [GC for 2977 CONS pages..(T=7).GC finished] Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-BACKTRACK-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-BDD-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BDD-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-BDD-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-BDD-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-BDD-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-BDD-HINT1 RST)) Summary Form: ( DEFMACRO TRANSLATE-BDD-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-BDD-HINT1@PAR ACL2 p!>>(DEFMACRO TRANSLATE-BY-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BY-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-BY-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-BY-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-CASES-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CASES-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-CASES-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-CASES-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CLAUSE-PROCESSOR-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CUSTOM-KEYWORD-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-DO-NOT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-DO-NOT-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-DO-NOT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-DO-NOT-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-DO-NOT-INDUCT-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-DO-NOT-INDUCT-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-ERROR-HINT@PAR (&REST RST) (CONS 'TRANSLATE-ERROR-HINT RST)) 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)) [GC for 2987 CONS pages..(T=7).GC finished] Summary Form: ( DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR ...) Rules: NIL Time: 0.07 seconds (prove: 0.00, print: 0.00, other: 0.07) TRANSLATE-RW-CACHE-STATE-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR (&REST RST) (CONS 'TRANSLATE-SIMPLE-OR-ERROR-TRIPLE RST)) Summary Form: ( DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR ACL2 p!>>(DEFMACRO TRANSLATE-SUBSTITUTION@PAR (&REST RST) (CONS 'TRANSLATE-SUBSTITUTION RST)) Summary Form: ( DEFMACRO TRANSLATE-SUBSTITUTION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-SUBSTITUTION@PAR ACL2 p!>>(DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR (&REST RST) (CONS 'TRANSLATE-SUBSTITUTION-LST RST)) Summary Form: ( DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-SUBSTITUTION-LST@PAR ACL2 p!>>(DEFMACRO TRANSLATE-TERM-LST@PAR (&REST RST) (CONS 'TRANSLATE-TERM-LST RST)) Summary Form: ( DEFMACRO TRANSLATE-TERM-LST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-TERM-LST@PAR ACL2 p!>>(DEFMACRO TRANSLATE-USE-HINT@PAR (&REST RST) (CONS 'TRANSLATE-USE-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-USE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-USE-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-USE-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-USE-HINT1 RST)) Summary Form: ( DEFMACRO TRANSLATE-USE-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-USE-HINT1@PAR ACL2 p!>>(DEFMACRO TRANSLATE-X-HINT-VALUE@PAR (&REST RST) (CONS 'TRANSLATE-X-HINT-VALUE RST)) Summary Form: ( DEFMACRO TRANSLATE-X-HINT-VALUE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-X-HINT-VALUE@PAR ACL2 p!>>(DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR (&REST RST) (CONS 'WARN-ON-DUPLICATE-HINT-GOAL-SPECS RST)) Summary Form: ( DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ACL2 p!>>(DEFMACRO WATERFALL-MSG@PAR (&REST RST) (CONS 'WATERFALL-MSG RST)) Summary Form: ( DEFMACRO WATERFALL-MSG@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) WATERFALL-MSG@PAR ACL2 p!>>(DEFMACRO WATERFALL-PRINT-CLAUSE@PAR (&REST RST) (CONS 'WATERFALL-PRINT-CLAUSE RST)) 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.32 seconds (prove: 0.00, print: 0.00, other: 0.32) WATERFALL1@PAR Summary Form: ( DEFUN REPLACE-DEFUN@PAR-WITH-DEFUN ...) Rules: NIL Time: 0.19 seconds (prove: 0.00, print: 0.00, other: 0.19) 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 2987 CONS pages..(T=7).GC finished] Summary Form: ( DEFUN SYMBOL-CONSTANT-FN ...) Rules: NIL Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16) SYMBOL-CONSTANT-FN Summary Form: ( DEFUN STOBJS-IN ...) Rules: NIL Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) STOBJS-IN Summary Form: ( DEFUN ALL-NILS ...) Rules: NIL Time: 0.17 seconds (prove: 0.00, print: 0.00, other: 0.17) 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.15 seconds (prove: 0.00, print: 0.00, other: 0.15) LOGICP Summary Form: ( DEFMACRO LOGICALP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) LOGICALP Summary Form: ( DEFMACRO PROGRAMP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) PROGRAMP Summary Form: ( DEFCONST *STOBJS-OUT-INVALID* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) *STOBJS-OUT-INVALID* [GC for 2997 CONS pages..(T=7).GC finished] Summary Form: ( DEFUN STOBJS-OUT ...) Rules: NIL Time: 0.34 seconds (prove: 0.00, print: 0.00, other: 0.34) STOBJS-OUT Summary Form: ( DEFUN EV-FNCALL-W-GUARD1 ...) Rules: NIL Time: 0.38 seconds (prove: 0.00, print: 0.00, other: 0.38) EV-FNCALL-W-GUARD1 Summary Form: ( DEFUN EV-FNCALL-W-GUARD ...) Rules: NIL Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) EV-FNCALL-W-GUARD Summary Form: ( DEFUN TIME-TRACKER-FN ...) Rules: NIL Time: 0.29 seconds (prove: 0.00, print: 0.00, other: 0.29) TIME-TRACKER-FN [GC for 3007 CONS pages..(T=7).GC finished] Summary Form: ( DEFMACRO TIME-TRACKER ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TIME-TRACKER [GC for 12544 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] Summary Form: ( DEFUN SET-ABSSTOBJ-DEBUG-FN ...) Rules: NIL Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18) 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) Since BOOLEANP is non-recursive, its admission is trivial. We observe that the type of BOOLEANP is described by the theorem (OR (EQUAL (BOOLEANP X) T) (EQUAL (BOOLEANP X) NIL)). We used primitive type reasoning. Computing the guard conjecture for BOOLEANP.... [GC for 3007 CONS pages..(T=8).GC finished] The guard conjecture for BOOLEANP is trivial to prove. BOOLEANP is compliant with Common Lisp. Summary Form: ( DEFUN BOOLEANP ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.15 seconds (prove: 0.00, print: 0.00, other: 0.15) BOOLEANP ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ALL-NILS) The admission of ALL-NILS is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT LST). We observe that the type of ALL-NILS is described by the theorem (OR (EQUAL (ALL-NILS LST) T) (EQUAL (ALL-NILS LST) NIL)). Computing the guard conjecture for ALL-NILS.... The guard conjecture for ALL-NILS is trivial to prove, given primitive type reasoning. ALL-NILS is compliant with Common Lisp. Summary Form: ( DEFUN ALL-NILS ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18) ALL-NILS ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQL-EXEC) The admission of MEMBER-EQL-EXEC is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT LST). We observe that the type of MEMBER-EQL-EXEC is described by the theorem (OR (CONSP (MEMBER-EQL-EXEC X LST)) (EQUAL (MEMBER-EQL-EXEC X LST) NIL)). Computing the guard conjecture for MEMBER-EQL-EXEC.... The non-trivial part of the guard conjecture for MEMBER-EQL-EXEC, given primitive type reasoning, is Goal (AND (IMPLIES (AND (EQLABLE-LISTP LST) (NOT (EQLABLEP X)) (NOT (CONSP LST))) (EQ LST NIL)) (IMPLIES (AND (EQLABLE-LISTP LST) (NOT (EQLABLEP X)) (NOT (ENDP LST))) (EQLABLEP (CAR LST))) (IMPLIES (AND (EQLABLE-LISTP LST) (NOT (EQLABLEP X)) (NOT (ENDP LST)) (NOT (EQL X (CAR LST)))) (EQLABLE-LISTP (CDR LST)))). By the simple :definitions ENDP, EQ, EQL and EQLABLEP we reduce the conjecture to the following three conjectures. Subgoal 3 (IMPLIES (AND (EQLABLE-LISTP LST) (NOT (ACL2-NUMBERP X)) (NOT (SYMBOLP X)) (NOT (CHARACTERP X)) (NOT (CONSP LST))) (EQUAL LST NIL)). But simplification reduces this to T, using the :definition EQLABLE-LISTP. Subgoal 2 (IMPLIES (AND (EQLABLE-LISTP LST) (NOT (ACL2-NUMBERP X)) (NOT (SYMBOLP X)) (NOT (CHARACTERP X)) (CONSP LST) (NOT (ACL2-NUMBERP (CAR LST))) (NOT (SYMBOLP (CAR LST)))) (CHARACTERP (CAR LST))). But simplification reduces this to T, using the :definitions EQLABLE-LISTP and EQLABLEP. Subgoal 1 (IMPLIES (AND (EQLABLE-LISTP LST) (NOT (ACL2-NUMBERP X)) (NOT (SYMBOLP X)) (NOT (CHARACTERP X)) (CONSP LST) (NOT (EQUAL X (CAR LST)))) (EQLABLE-LISTP (CDR LST))). [GC for 3007 CONS pages..(T=7).GC finished] But simplification reduces this to T, using the :definitions EQLABLE-LISTP and EQLABLEP. Q.E.D. That completes the proof of the guard theorem for MEMBER-EQL-EXEC. MEMBER-EQL-EXEC is compliant with Common Lisp. Summary Form: ( DEFUN MEMBER-EQL-EXEC ...) Rules: ((:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION EQL) (:DEFINITION EQLABLE-LISTP) (:DEFINITION EQLABLEP) (:DEFINITION NOT) (:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.30 seconds (prove: 0.07, print: 0.01, other: 0.22) Prover steps counted: 296 MEMBER-EQL-EXEC ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQL-EXEC$GUARD-CHECK) Since MEMBER-EQL-EXEC$GUARD-CHECK is non-recursive, its admission is trivial. We observe that the type of MEMBER-EQL-EXEC$GUARD-CHECK is described by the theorem (EQUAL (MEMBER-EQL-EXEC$GUARD-CHECK X LST) T). Computing the guard conjecture for MEMBER-EQL-EXEC$GUARD-CHECK.... The guard conjecture for MEMBER-EQL-EXEC$GUARD-CHECK is trivial to prove. MEMBER-EQL-EXEC$GUARD-CHECK is compliant with Common Lisp. Summary Form: ( DEFUN MEMBER-EQL-EXEC$GUARD-CHECK ...) Rules: NIL Time: 0.15 seconds (prove: 0.00, print: 0.00, other: 0.15) MEMBER-EQL-EXEC$GUARD-CHECK ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQUAL) The admission of MEMBER-EQUAL is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT LST). We observe that the type of MEMBER-EQUAL is described by the theorem (OR (CONSP (MEMBER-EQUAL X LST)) (EQUAL (MEMBER-EQUAL X LST) NIL)). Computing the guard conjecture for MEMBER-EQUAL.... The guard conjecture for MEMBER-EQUAL is trivial to prove, given primitive type reasoning. MEMBER-EQUAL is compliant with Common Lisp. Summary Form: ( DEFUN MEMBER-EQUAL ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.17 seconds (prove: 0.00, print: 0.00, other: 0.17) MEMBER-EQUAL ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQL-EXEC) The admission of SUBSETP-EQL-EXEC is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT X). We observe that the type of SUBSETP-EQL-EXEC is described by the theorem (OR (EQUAL (SUBSETP-EQL-EXEC X Y) T) (EQUAL (SUBSETP-EQL-EXEC X Y) NIL)). Computing the guard conjecture for SUBSETP-EQL-EXEC.... [GC for 3017 CONS pages..(T=8).GC finished] The non-trivial part of the guard conjecture for SUBSETP-EQL-EXEC, given primitive type reasoning, is Goal (AND (IMPLIES (AND (TRUE-LISTP X) (EQLABLE-LISTP Y) (NOT (ENDP X))) (LET ((X (CAR X)) (L Y)) (AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L)) (OR (EQLABLEP X) (EQLABLE-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQL-EXEC X L))))) (IMPLIES (AND (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (NOT (CONSP X))) (EQ X NIL)) (IMPLIES (AND (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (NOT (ENDP X))) (LET ((X (CAR X)) (L Y)) (AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L)) (OR (EQLABLEP X) (EQLABLE-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQL-EXEC X L))))) (IMPLIES (AND (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (NOT (ENDP X)) (MEMBER-EQUAL (CAR X) Y)) (EQLABLE-LISTP (CDR X)))). By the simple :definitions ENDP and EQ we reduce the conjecture to the following four conjectures. Subgoal 4 (IMPLIES (AND (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X)) (LET ((X (CAR X)) (L Y)) (AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L)) (OR (EQLABLEP X) (EQLABLE-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQL-EXEC X L))))). This simplifies, using the :definitions EQLABLEP (if-intro) and NOT (if-intro) and the :type-prescription rule EQLABLE-LISTP, to the following four conjectures. Subgoal 4.4 (IMPLIES (AND (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). 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)). 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 3017 CONS pages..(T=7).GC finished] Name the formula above *3. Subgoal 4.1 (IMPLIES (AND (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (SYMBOLP (CAR X))) (TRUE-LISTP Y)). Name the formula above *4. Subgoal 3 (IMPLIES (AND (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (NOT (CONSP X))) (EQUAL X NIL)). But simplification reduces this to T, using the :definition EQLABLE-LISTP. Subgoal 2 (IMPLIES (AND (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (CONSP X)) (LET ((X (CAR X)) (L Y)) (AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L)) (OR (EQLABLEP X) (EQLABLE-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQL-EXEC X L))))). This simplifies, using the :definitions EQLABLEP (if-intro) and NOT (if-intro), to the following two conjectures. Subgoal 2.2 (IMPLIES (AND (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). Name the formula above *5. Subgoal 2.1 (IMPLIES (AND (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (CONSP X) (NOT (ACL2-NUMBERP (CAR X))) (NOT (SYMBOLP (CAR X)))) (CHARACTERP (CAR X))). [GC for 3017 CONS pages..(T=7).GC finished] But simplification reduces this to T, using the :definitions EQLABLE-LISTP and EQLABLEP. Subgoal 1 (IMPLIES (AND (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (CONSP X) (MEMBER-EQUAL (CAR X) Y)) (EQLABLE-LISTP (CDR X))). But simplification reduces this to T, using the :definitions EQLABLE-LISTP and EQLABLEP. So we now return to *5, which is (IMPLIES (AND (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). Perhaps we can prove *5 by induction. Five induction schemes are suggested by this conjecture. Subsumption reduces that number to four. These merge into two derived induction schemes. One of these has a score higher than the other. We will induct according to a scheme suggested by (MEMBER-EQL-EXEC (CAR X) Y). This suggestion was produced using the :induction rules EQLABLE-LISTP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP. If we let (:P X Y) denote *5 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL (CAR X) (CAR Y))) (:P X (CDR Y))) (:P X Y)) (IMPLIES (AND (NOT (ENDP Y)) (EQL (CAR X) (CAR Y))) (:P X Y)) (IMPLIES (ENDP Y) (:P X Y))). This induction is justified by the same argument used to admit MEMBER-EQL-EXEC. When applied to the goal at hand the above induction scheme produces five nontautological subgoals. Subgoal *5/5 (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL (CAR X) (CAR Y))) (EQUAL (MEMBER-EQUAL (CAR X) (CDR Y)) (MEMBER-EQL-EXEC (CAR X) (CDR Y))) (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *5/5' (IMPLIES (AND (CONSP Y) (NOT (EQUAL (CAR X) (CAR Y))) (EQUAL (MEMBER-EQUAL (CAR X) (CDR Y)) (MEMBER-EQL-EXEC (CAR X) (CDR Y))) (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). But simplification reduces this to T, using the :definitions EQLABLE-LISTP, EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive type reasoning. Subgoal *5/4 (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL (CAR X) (CAR Y))) (EQLABLE-LISTP (CDR Y)) (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *5/4' (IMPLIES (AND (CONSP Y) (NOT (EQUAL (CAR X) (CAR Y))) (EQLABLE-LISTP (CDR Y)) (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). This simplifies, using the :definitions EQLABLE-LISTP, EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP, primitive type reasoning and the :type-prescription rule EQLABLE-LISTP, to Subgoal *5/4'' (IMPLIES (AND (CONSP Y) (NOT (EQUAL (CAR X) (CAR Y))) (EQLABLE-LISTP (CDR Y)) (TRUE-LISTP (CDR Y)) (EQLABLE-LISTP X) (NOT (ACL2-NUMBERP (CAR Y))) (NOT (SYMBOLP (CAR Y))) (NOT (CHARACTERP (CAR Y))) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) (CDR Y)) (MEMBER-EQL-EXEC (CAR X) (CDR Y)))). [GC for 3027 CONS pages..(T=7).GC finished] We generalize this conjecture, replacing (CAR Y) by Y1, (CDR Y) by Y2 and (CAR X) by X1 and restricting the type of the new variable Y1 to be that of the term it replaces. This produces Subgoal *5/4''' (IMPLIES (AND (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (CONSP Y) (NOT (EQUAL X1 Y1)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (EQLABLE-LISTP X) (NOT (CHARACTERP Y1)) (CONSP X)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). By case analysis we reduce the conjecture to Subgoal *5/4'4' (IMPLIES (AND (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (CONSP Y) (NOT (EQUAL X1 Y1)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (EQLABLE-LISTP X) (CONSP X)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). We suspect that the term (CONSP Y) is irrelevant to the truth of this conjecture and throw it out. We will thus try to prove Subgoal *5/4'5' (IMPLIES (AND (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (NOT (EQUAL X1 Y1)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (EQLABLE-LISTP X) (CONSP X)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). [GC for 3027 CONS pages..(T=7).GC finished] Name the formula above *5.1. Subgoal *5/3 (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL (CAR X) (CAR Y))) (NOT (TRUE-LISTP (CDR Y))) (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). But we reduce the conjecture to T, by primitive type reasoning. Subgoal *5/2 (IMPLIES (AND (NOT (ENDP Y)) (EQL (CAR X) (CAR Y)) (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *5/2' (IMPLIES (AND (CONSP Y) (EQUAL (CAR X) (CAR Y)) (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). But simplification reduces this to T, using the :definitions EQLABLE-LISTP, EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive type reasoning. Subgoal *5/1 (IMPLIES (AND (ENDP Y) (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). By the simple :definition ENDP we reduce the conjecture to Subgoal *5/1' (IMPLIES (AND (NOT (CONSP Y)) (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). But simplification reduces this to T, using the :definition TRUE-LISTP, the :executable-counterparts of CONSP and EQLABLE-LISTP and primitive type reasoning. So we now return to *5.1, which is (IMPLIES (AND (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (NOT (EQUAL X1 Y1)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (EQLABLE-LISTP X) (CONSP X)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). Perhaps we can prove *5.1 by induction. Five induction schemes are suggested by this conjecture. Subsumption reduces that number to four. These merge into two derived induction schemes. One of these has a score higher than the other. We will induct according to a scheme suggested by (MEMBER-EQL-EXEC X1 Y2). This suggestion was produced using the :induction rules EQLABLE-LISTP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP. If we let (:P X X1 Y1 Y2) denote *5.1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP Y2)) (NOT (EQL X1 (CAR Y2))) (:P X X1 Y1 (CDR Y2))) (:P X X1 Y1 Y2)) (IMPLIES (AND (NOT (ENDP Y2)) (EQL X1 (CAR Y2))) (:P X X1 Y1 Y2)) (IMPLIES (ENDP Y2) (:P X X1 Y1 Y2))). This induction is justified by the same argument used to admit MEMBER-EQL-EXEC. When applied to the goal at hand the above induction scheme produces five nontautological subgoals. Subgoal *5.1/5 (IMPLIES (AND (NOT (ENDP Y2)) (NOT (EQL X1 (CAR Y2))) (EQUAL (MEMBER-EQUAL X1 (CDR Y2)) (MEMBER-EQL-EXEC X1 (CDR Y2))) (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (NOT (EQUAL X1 Y1)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (EQLABLE-LISTP X) (CONSP X)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *5.1/5' (IMPLIES (AND (CONSP Y2) (NOT (EQUAL X1 (CAR Y2))) (EQUAL (MEMBER-EQUAL X1 (CDR Y2)) (MEMBER-EQL-EXEC X1 (CDR Y2))) (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (NOT (EQUAL X1 Y1)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (EQLABLE-LISTP X) (CONSP X)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). [GC for 3027 CONS pages..(T=8).GC finished] But simplification reduces this to T, using the :definitions EQLABLE-LISTP, EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive type reasoning. Subgoal *5.1/4 (IMPLIES (AND (NOT (ENDP Y2)) (NOT (EQL X1 (CAR Y2))) (NOT (TRUE-LISTP (CDR Y2))) (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (NOT (EQUAL X1 Y1)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (EQLABLE-LISTP X) (CONSP X)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). But we reduce the conjecture to T, by primitive type reasoning. Subgoal *5.1/3 (IMPLIES (AND (NOT (ENDP Y2)) (NOT (EQL X1 (CAR Y2))) (NOT (EQLABLE-LISTP (CDR Y2))) (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (NOT (EQUAL X1 Y1)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (EQLABLE-LISTP X) (CONSP X)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *5.1/3' (IMPLIES (AND (CONSP Y2) (NOT (EQUAL X1 (CAR Y2))) (NOT (EQLABLE-LISTP (CDR Y2))) (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (NOT (EQUAL X1 Y1)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (EQLABLE-LISTP X) (CONSP X)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). But simplification reduces this to T, using the :definitions EQLABLE-LISTP and EQLABLEP. Subgoal *5.1/2 (IMPLIES (AND (NOT (ENDP Y2)) (EQL X1 (CAR Y2)) (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (NOT (EQUAL X1 Y1)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (EQLABLE-LISTP X) (CONSP X)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *5.1/2' (IMPLIES (AND (CONSP Y2) (EQUAL X1 (CAR Y2)) (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (NOT (EQUAL X1 Y1)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (EQLABLE-LISTP X) (CONSP X)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). [GC for 3027 CONS pages..(T=8).GC finished] But simplification reduces this to T, using the :definitions EQLABLE-LISTP, EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive type reasoning. Subgoal *5.1/1 (IMPLIES (AND (ENDP Y2) (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (NOT (EQUAL X1 Y1)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (EQLABLE-LISTP X) (CONSP X)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). By the simple :definition ENDP we reduce the conjecture to Subgoal *5.1/1' (IMPLIES (AND (NOT (CONSP Y2)) (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (NOT (EQUAL X1 Y1)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (EQLABLE-LISTP X) (CONSP X)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). But simplification reduces this to T, using the :definitions MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP, the :executable-counterparts of CONSP, EQLABLE-LISTP and EQUAL and primitive type reasoning. That completes the proofs of *5.1 and *5. We therefore turn our attention to *4, which is (IMPLIES (AND (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (SYMBOLP (CAR X))) (TRUE-LISTP Y)). Perhaps we can prove *4 by induction. Three induction schemes are suggested by this conjecture. Subsumption reduces that number to two. One of these has a score higher than the other. We will induct according to a scheme suggested by (EQLABLE-LISTP Y). This suggestion was produced using the :induction rules EQLABLE-LISTP and TRUE-LISTP. If we let (:P X Y) denote *4 above then the induction scheme we'll use is (AND (IMPLIES (NOT (CONSP Y)) (:P X Y)) (IMPLIES (AND (CONSP Y) (NOT (EQLABLEP (CAR Y)))) (:P X Y)) (IMPLIES (AND (CONSP Y) (EQLABLEP (CAR Y)) (:P X (CDR Y))) (:P X Y))). This induction is justified by the same argument used to admit EQLABLE-LISTP. When applied to the goal at hand the above induction scheme produces four nontautological subgoals. Subgoal *4/4 (IMPLIES (AND (NOT (CONSP Y)) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (SYMBOLP (CAR X))) (TRUE-LISTP Y)). But simplification reduces this to T, using the :definition EQLABLE-LISTP and primitive type reasoning. Subgoal *4/3 (IMPLIES (AND (CONSP Y) (NOT (EQLABLEP (CAR Y))) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (SYMBOLP (CAR X))) (TRUE-LISTP Y)). By the simple :definition EQLABLEP we reduce the conjecture to Subgoal *4/3' (IMPLIES (AND (CONSP Y) (NOT (ACL2-NUMBERP (CAR Y))) (NOT (SYMBOLP (CAR Y))) (NOT (CHARACTERP (CAR Y))) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (SYMBOLP (CAR X))) (TRUE-LISTP Y)). But simplification reduces this to T, using the :definitions EQLABLE-LISTP and EQLABLEP. Subgoal *4/2 (IMPLIES (AND (CONSP Y) (EQLABLEP (CAR Y)) (TRUE-LISTP (CDR Y)) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (SYMBOLP (CAR X))) (TRUE-LISTP Y)). But we reduce the conjecture to T, by primitive type reasoning. [GC for 3027 CONS pages..(T=7).GC finished] Subgoal *4/1 (IMPLIES (AND (CONSP Y) (EQLABLEP (CAR Y)) (NOT (EQLABLE-LISTP (CDR Y))) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (SYMBOLP (CAR X))) (TRUE-LISTP Y)). But simplification reduces this to T, using the :definitions EQLABLE-LISTP and EQLABLEP. That completes the proof of *4. We therefore turn our attention to *3, which is (IMPLIES (AND (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (CHARACTERP (CAR X))) (TRUE-LISTP Y)). Perhaps we can prove *3 by induction. Three induction schemes are suggested by this conjecture. Subsumption reduces that number to two. One of these has a score higher than the other. We will induct according to a scheme suggested by (EQLABLE-LISTP Y). This suggestion was produced using the :induction rules EQLABLE-LISTP and TRUE-LISTP. If we let (:P X Y) denote *3 above then the induction scheme we'll use is (AND (IMPLIES (NOT (CONSP Y)) (:P X Y)) (IMPLIES (AND (CONSP Y) (NOT (EQLABLEP (CAR Y)))) (:P X Y)) (IMPLIES (AND (CONSP Y) (EQLABLEP (CAR Y)) (:P X (CDR Y))) (:P X Y))). This induction is justified by the same argument used to admit EQLABLE-LISTP. When applied to the goal at hand the above induction scheme produces four nontautological subgoals. Subgoal *3/4 (IMPLIES (AND (NOT (CONSP Y)) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (CHARACTERP (CAR X))) (TRUE-LISTP Y)). But simplification reduces this to T, using the :definition EQLABLE-LISTP and primitive type reasoning. Subgoal *3/3 (IMPLIES (AND (CONSP Y) (NOT (EQLABLEP (CAR Y))) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (CHARACTERP (CAR X))) (TRUE-LISTP Y)). By the simple :definition EQLABLEP we reduce the conjecture to Subgoal *3/3' (IMPLIES (AND (CONSP Y) (NOT (ACL2-NUMBERP (CAR Y))) (NOT (SYMBOLP (CAR Y))) (NOT (CHARACTERP (CAR Y))) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (CHARACTERP (CAR X))) (TRUE-LISTP Y)). But simplification reduces this to T, using the :definitions EQLABLE-LISTP and EQLABLEP. Subgoal *3/2 (IMPLIES (AND (CONSP Y) (EQLABLEP (CAR Y)) (TRUE-LISTP (CDR Y)) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (CHARACTERP (CAR X))) (TRUE-LISTP Y)). But we reduce the conjecture to T, by primitive type reasoning. Subgoal *3/1 (IMPLIES (AND (CONSP Y) (EQLABLEP (CAR Y)) (NOT (EQLABLE-LISTP (CDR Y))) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (CHARACTERP (CAR X))) (TRUE-LISTP Y)). But simplification reduces this to T, using the :definitions EQLABLE-LISTP and EQLABLEP. That completes the proof of *3. We therefore turn our attention to *2, which is (IMPLIES (AND (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (ACL2-NUMBERP (CAR X))) (TRUE-LISTP Y)). Perhaps we can prove *2 by induction. Three induction schemes are suggested by this conjecture. Subsumption reduces that number to two. One of these has a score higher than the other. We will induct according to a scheme suggested by (EQLABLE-LISTP Y). This suggestion was produced using the :induction rules EQLABLE-LISTP and TRUE-LISTP. If we let (:P X Y) denote *2 above then the induction scheme we'll use is (AND (IMPLIES (NOT (CONSP Y)) (:P X Y)) (IMPLIES (AND (CONSP Y) (NOT (EQLABLEP (CAR Y)))) (:P X Y)) (IMPLIES (AND (CONSP Y) (EQLABLEP (CAR Y)) (:P X (CDR Y))) (:P X Y))). This induction is justified by the same argument used to admit EQLABLE-LISTP. When applied to the goal at hand the above induction scheme produces four nontautological subgoals. Subgoal *2/4 (IMPLIES (AND (NOT (CONSP Y)) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (ACL2-NUMBERP (CAR X))) (TRUE-LISTP Y)). But simplification reduces this to T, using the :definition EQLABLE-LISTP and primitive type reasoning. Subgoal *2/3 (IMPLIES (AND (CONSP Y) (NOT (EQLABLEP (CAR Y))) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (ACL2-NUMBERP (CAR X))) (TRUE-LISTP Y)). By the simple :definition EQLABLEP we reduce the conjecture to Subgoal *2/3' (IMPLIES (AND (CONSP Y) (NOT (ACL2-NUMBERP (CAR Y))) (NOT (SYMBOLP (CAR Y))) (NOT (CHARACTERP (CAR Y))) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (ACL2-NUMBERP (CAR X))) (TRUE-LISTP Y)). [GC for 3027 CONS pages..(T=8).GC finished] But simplification reduces this to T, using the :definitions EQLABLE-LISTP and EQLABLEP. Subgoal *2/2 (IMPLIES (AND (CONSP Y) (EQLABLEP (CAR Y)) (TRUE-LISTP (CDR Y)) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (ACL2-NUMBERP (CAR X))) (TRUE-LISTP Y)). But we reduce the conjecture to T, by primitive type reasoning. Subgoal *2/1 (IMPLIES (AND (CONSP Y) (EQLABLEP (CAR Y)) (NOT (EQLABLE-LISTP (CDR Y))) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X) (ACL2-NUMBERP (CAR X))) (TRUE-LISTP Y)). But simplification reduces this to T, using the :definitions EQLABLE-LISTP and EQLABLEP. That completes the proof of *2. We therefore turn our attention to *1, which is (IMPLIES (AND (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). Perhaps we can prove *1 by induction. Four induction schemes are suggested by this conjecture. These merge into two derived induction schemes. One of these has a score higher than the other. We will induct according to a scheme suggested by (MEMBER-EQL-EXEC (CAR X) Y). This suggestion was produced using the :induction rules EQLABLE-LISTP, MEMBER-EQL-EXEC and MEMBER-EQUAL. If we let (:P X Y) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL (CAR X) (CAR Y))) (:P X (CDR Y))) (:P X Y)) (IMPLIES (AND (NOT (ENDP Y)) (EQL (CAR X) (CAR Y))) (:P X Y)) (IMPLIES (ENDP Y) (:P X Y))). This induction is justified by the same argument used to admit MEMBER-EQL-EXEC. When applied to the goal at hand the above induction scheme produces four nontautological subgoals. Subgoal *1/4 (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL (CAR X) (CAR Y))) (EQUAL (MEMBER-EQUAL (CAR X) (CDR Y)) (MEMBER-EQL-EXEC (CAR X) (CDR Y))) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *1/4' (IMPLIES (AND (CONSP Y) (NOT (EQUAL (CAR X) (CAR Y))) (EQUAL (MEMBER-EQUAL (CAR X) (CDR Y)) (MEMBER-EQL-EXEC (CAR X) (CDR Y))) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). But simplification reduces this to T, using the :definitions EQLABLE-LISTP, EQLABLEP, MEMBER-EQL-EXEC and MEMBER-EQUAL and primitive type reasoning. Subgoal *1/3 (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL (CAR X) (CAR Y))) (NOT (EQLABLE-LISTP (CDR Y))) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *1/3' (IMPLIES (AND (CONSP Y) (NOT (EQUAL (CAR X) (CAR Y))) (NOT (EQLABLE-LISTP (CDR Y))) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). But simplification reduces this to T, using the :definitions EQLABLE-LISTP and EQLABLEP. Subgoal *1/2 (IMPLIES (AND (NOT (ENDP Y)) (EQL (CAR X) (CAR Y)) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). [GC for 3027 CONS pages..(T=7).GC finished] By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *1/2' (IMPLIES (AND (CONSP Y) (EQUAL (CAR X) (CAR Y)) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). But simplification reduces this to T, using the :definitions EQLABLE-LISTP, EQLABLEP, MEMBER-EQL-EXEC and MEMBER-EQUAL and primitive type reasoning. Subgoal *1/1 (IMPLIES (AND (ENDP Y) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/1' (IMPLIES (AND (NOT (CONSP Y)) (TRUE-LISTP X) (EQLABLE-LISTP Y) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). But simplification reduces this to T, using the :definitions EQLABLE-LISTP, MEMBER-EQL-EXEC and MEMBER-EQUAL, the :executable-counterparts of CONSP and EQUAL and primitive type reasoning. That completes the proof of *1. Q.E.D. That completes the proof of the guard theorem for SUBSETP-EQL-EXEC. SUBSETP-EQL-EXEC is compliant with Common Lisp. Summary Form: ( DEFUN SUBSETP-EQL-EXEC ...) Rules: ((:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION EQL) (:DEFINITION EQLABLE-LISTP) (:DEFINITION EQLABLEP) (:DEFINITION MEMBER-EQL-EXEC) (:DEFINITION MEMBER-EQUAL) (:DEFINITION NOT) (:DEFINITION TRUE-LISTP) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART EQLABLE-LISTP) (:EXECUTABLE-COUNTERPART EQUAL) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION EQLABLE-LISTP) (:INDUCTION MEMBER-EQL-EXEC) (:INDUCTION MEMBER-EQUAL) (:INDUCTION TRUE-LISTP) (:TYPE-PRESCRIPTION EQLABLE-LISTP)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION EQLABLEP) (:DEFINITION NOT)) Time: 1.07 seconds (prove: 0.63, print: 0.17, other: 0.27) Prover steps counted: 7034 SUBSETP-EQL-EXEC ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQL-EXEC$GUARD-CHECK) Since SUBSETP-EQL-EXEC$GUARD-CHECK is non-recursive, its admission is trivial. We observe that the type of SUBSETP-EQL-EXEC$GUARD-CHECK is described by the theorem (EQUAL (SUBSETP-EQL-EXEC$GUARD-CHECK X Y) T). Computing the guard conjecture for SUBSETP-EQL-EXEC$GUARD-CHECK.... The guard conjecture for SUBSETP-EQL-EXEC$GUARD-CHECK is trivial to prove. SUBSETP-EQL-EXEC$GUARD-CHECK is compliant with Common Lisp. [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] Summary Form: ( DEFUN SUBSETP-EQL-EXEC$GUARD-CHECK ...) Rules: NIL Time: 0.23 seconds (prove: 0.00, print: 0.00, other: 0.23) SUBSETP-EQL-EXEC$GUARD-CHECK ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQUAL) The admission of SUBSETP-EQUAL is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT X). We observe that the type of SUBSETP-EQUAL is described by the theorem (OR (EQUAL (SUBSETP-EQUAL X Y) T) (EQUAL (SUBSETP-EQUAL X Y) NIL)). Computing the guard conjecture for SUBSETP-EQUAL.... The guard conjecture for SUBSETP-EQUAL is trivial to prove, given primitive type reasoning. SUBSETP-EQUAL is compliant with Common Lisp. Summary Form: ( DEFUN SUBSETP-EQUAL ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.20 seconds (prove: 0.00, print: 0.00, other: 0.20) SUBSETP-EQUAL ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP REVAPPEND) The admission of REVAPPEND is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT X). We observe that the type of REVAPPEND is described by the theorem (OR (CONSP (REVAPPEND X Y)) (EQUAL (REVAPPEND X Y) Y)). We used primitive type reasoning. Computing the guard conjecture for REVAPPEND.... The guard conjecture for REVAPPEND is trivial to prove, given primitive type reasoning. REVAPPEND is compliant with Common Lisp. Summary Form: ( DEFUN REVAPPEND ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16) REVAPPEND ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FIRST-N-AC) The admission of FIRST-N-AC is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT I). We observe that the type of FIRST-N-AC is described by the theorem (OR (CONSP (FIRST-N-AC I L AC)) (EQUAL (FIRST-N-AC I L AC) NIL)). We used the :type-prescription rule REVAPPEND. Computing the guard conjecture for FIRST-N-AC.... The non-trivial part of the guard conjecture for FIRST-N-AC, given primitive type reasoning, is Goal (IMPLIES (AND (TRUE-LISTP AC) (TRUE-LISTP L) (<= 0 I) (INTEGERP I) (NOT (ZP I))) (<= 0 (+ -1 I))). But we reduce the conjecture to T, by the simple :definition ZP and the :executable-counterpart of TAU-SYSTEM. Q.E.D. 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.22 seconds (prove: 0.00, print: 0.00, other: 0.22) Prover steps counted: 63 FIRST-N-AC ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TAKE) [GC for 3027 CONS pages..(T=7).GC finished] The admission of TAKE is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT N). We observe that the type of TAKE is described by the theorem (TRUE-LISTP (TAKE N L)). We used primitive type reasoning. Summary Form: ( DEFUN TAKE ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.47 seconds (prove: 0.00, print: 0.00, other: 0.47) TAKE End of Encapsulated Events. [GC for 3027 CONS pages..(T=8).GC finished] [GC for 3027 CONS pages..(T=7).GC finished] Having verified that the encapsulated events validate the signatures of the ENCAPSULATE event, we discard the ephemeral theory and extend the original theory as directed by the signatures and the non-LOCAL events. We export TAKE, FIRST-N-AC, REVAPPEND, SUBSETP-EQUAL, SUBSETP-EQL-EXEC$GUARD-CHECK, SUBSETP-EQL-EXEC, MEMBER-EQUAL, MEMBER-EQL-EXEC$GUARD-CHECK, MEMBER-EQL-EXEC, ALL-NILS and BOOLEANP. Summary Form: ( ENCAPSULATE NIL (LOGIC) ...) Rules: NIL Time: 5.57 seconds (prove: 0.70, print: 0.18, other: 4.69) Prover steps counted: 7393 T Summary Form: ( DEFCONST *READ-FILE-INTO-STRING-BOUND* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) *READ-FILE-INTO-STRING-BOUND* [GC for 3037 CONS pages..(T=7).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.27 seconds (prove: 0.00, print: 0.00, other: 0.27) READ-FILE-INTO-STRING2-LOGICAL Summary Form: ( DEFUN READ-FILE-INTO-STRING2 ...) Rules: NIL Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) READ-FILE-INTO-STRING2 Summary Form: ( DEFMACRO READ-FILE-INTO-STRING ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) READ-FILE-INTO-STRING Summary Form: ( DEFMACRO WHEN-PASS-2 ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) WHEN-PASS-2 Summary Form: ( DEFUN PRINT-CL-CACHE-FN ...) Rules: NIL Time: 0.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.16 seconds (prove: 0.00, print: 0.00, other: 0.16) HONS-REMOVE-ASSOC Summary Form: ( DEFUN COUNT-KEYS ...) Rules: NIL Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16) COUNT-KEYS Finished loading '((IN-PACKAGE "ACL2") (DEFCONST *COMMON-LISP-SYMBOLS-FROM-MAIN-LISP-PACKAGE* '(&ALLOW-OTHER-KEYS *PRINT-MISER-WIDTH* &AUX *PRINT-PPRINT-DISPATCH* &BODY *PRINT-PRETTY* &ENVIRONMENT ...)) (DEFCONST *COMMON-LISP-SPECIALS-AND-CONSTANTS* '(* ** *** *BREAK-ON-SIGNALS* *COMPILE-FILE-PATHNAME* *COMPILE-FILE-TRUENAME* *COMPILE-PRINT* ...)) (DEFCONST NIL 'NIL " NIL, a symbol, represents in Common Lisp both the false truth value and the empty list.") (DEFCONST T 'T "T, a symbol, represents the true truth value in Common Lisp.") (DEFCONST *STOBJ-INLINE-DECLARE* '(DECLARE #)) (DEFMACRO MAKE-PACKAGE-ENTRY (&KEY NAME IMPORTS HIDDEN-P BOOK-PATH DEFPKG-EVENT-FORM TTERM) (CONS 'LIST* (CONS NAME #))) ...). ACL2 loading '((IN-PACKAGE "ACL2") (DEFMACRO DEFN (F A &REST R) (CONS 'DEFUN (CONS F #))) (DEFMACRO DEFND (F A &REST R) (CONS 'DEFUND (CONS F #))) (DEFN HONS-EQUAL (X Y) (DECLARE (XARGS :MODE :LOGIC)) (EQUAL X Y)) (DEFN HONS-ASSOC-EQUAL (KEY ALIST) (DECLARE (XARGS :MODE :LOGIC)) (COND (# NIL) (# #) (T #))) (DEFN HONS-GET (KEY ALIST) (DECLARE (XARGS :MODE :LOGIC)) (HONS-ASSOC-EQUAL KEY ALIST)) (DEFN HONS-ACONS (KEY VAL ALIST) (DECLARE (XARGS :MODE :LOGIC)) (CONS (CONS KEY VAL) ALIST)) ...). "ACL2" [GC for 3037 CONS pages..(T=8).GC finished] DEFN DEFND HONS-EQUAL HONS-ASSOC-EQUAL [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] HONS-GET HONS-ACONS FAST-ALIST-FREE-ON-EXIT-RAW FAST-ALIST-FREE FAST-ALIST-FREE-ON-EXIT HONS-COPY HONS-COPY-PERSISTENT HONS HONS-EQUAL-LITE HONS-CLEAR [GC for 383 SFUN pages..(T=8).GC finished] HONS-CLEAR! HONS-WASH HONS-WASH! HONS-SUMMARY HONS-RESIZE HONS-RESIZE-FN HONS SET-SLOW-ALIST-ACTION GET-SLOW-ALIST-ACTION HONS-ACONS! MAKE-FAST-ALIST [GC for 3037 CONS pages..(T=8).GC finished] FAST-ALIST-FORK FAST-ALIST-FORK! HONS-SHRINK-ALIST HONS-SHRINK-ALIST! MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE FAST-ALIST-CLEAN FAST-ALIST-CLEAN! FAST-ALIST-LEN FAST-ALIST-SUMMARY WITH-FAST-ALIST-RAW WITH-FAST-ALIST WITH-STOLEN-ALIST-RAW WITH-STOLEN-ALIST CONS-SUBTREES [GC for 383 SFUN pages..(T=7).GC finished] NUMBER-SUBTREES FLUSH-HONS-GET-HASH-TABLE-LINK NIL [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=9).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 "basis-a.lisp". "ACL2" WORMHOLE-STATUSP WORMHOLE-ENTRY-CODE WORMHOLE-DATA SET-WORMHOLE-ENTRY-CODE SET-WORMHOLE-DATA [GC for 3047 CONS pages..(T=7).GC finished] MAKE-WORMHOLE-STATUS TREE-OCCUR-EQ WORMHOLE-EVAL WITH-WORMHOLE-LOCK WORMHOLE LEGAL-CONSTANTP1 [GC for 3057 CONS pages..(T=8).GC finished] LAMBDA-KEYWORDP LEGAL-VARIABLE-OR-CONSTANT-NAMEP LEGAL-VARIABLEP ARGLISTP1 ARGLISTP [GC for 3067 CONS pages..(T=8).GC finished] FIND-FIRST-BAD-ARG PROCESS-DEFABBREV-DECLARES DEFABBREV1 DEFABBREV *EVISCERATION-MARK* *EVISCERATION-HASH-MARK* *EVISCERATION-ELLIPSIS-MARK* *EVISCERATION-WORLD-MARK* *EVISCERATION-STATE-MARK* *EVISCERATION-ERROR-TRIPLE-MARKS* *EVISCERATION-HIDING-MARK* *ANTI-EVISCERATION-MARK* EVISCERATEDP *SHARP-ATSIGN-AR* [GC for 3077 CONS pages..(T=7).GC finished] GET-SHARP-ATSIGN UPDATE-IPRINT-ALIST-FAL [GC for 3087 CONS pages..(T=8).GC finished] (EVISCERATE1 EVISCERATE1-LST) (EVISCERATE1P EVISCERATE1P-LST) EVISCERATE [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] EVISCERATE-SIMPLE ASET1-LST IPRINT-HARD-BOUND IPRINT-SOFT-BOUND IPRINT-LAST-INDEX* IPRINT-LAST-INDEX [GC for 383 SFUN pages..(T=7).GC finished] IPRINT-AR-ILLEGAL-INDEX IPRINT-ENABLEDP IPRINT-AR-AREF1 COLLECT-POSP-INDICES-TO-HEADER IPRINT-FAL-NAME IPRINT-EAGER-P [GC for 383 SFUN pages..(T=7).GC finished] INIT-IPRINT-FAL ROLLOVER-IPRINT-AR UPDATE-IPRINT-FAL-REC UPDATE-IPRINT-FAL UPDATE-IPRINT-AR-FAL [GC for 3097 CONS pages..(T=8).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 3097 CONS pages..(T=7).GC finished] KEYWORD-PARAM-VALUEP CONS-PPR1 FLSZ-INTEGER [GC for 3107 CONS pages..(T=7).GC finished] [GC for 3107 CONS pages..(T=7).GC finished] [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] FLSZ-ATOM [GC for 3117 CONS pages..(T=8).GC finished] FLSZ1 FLSZ MAX-WIDTH [GC for 3117 CONS pages..(T=8).GC finished] [GC for 1563 RELOCATABLE-BLOCKS pages..(T=8).GC finished] (PPR1 PPR1-LST) NEWLINE FMT-HARD-RIGHT-MARGIN FMT-SOFT-RIGHT-MARGIN [GC for 3117 CONS pages..(T=7).GC finished] SET-FMT-HARD-RIGHT-MARGIN SET-FMT-SOFT-RIGHT-MARGIN WRITE-FOR-READ SPACES1 [GC for 3117 CONS pages..(T=8).GC finished] MAKE-SPACES-ARRAY-REC MAKE-SPACES-ARRAY *ACL2-BUILT-IN-SPACES-ARRAY* SPACES [GC for 3127 CONS pages..(T=8).GC finished] (FLPR1 FLPR11) FLPR PPR2-FLAT [GC for 3127 CONS pages..(T=7).GC finished] (PPR2-COLUMN PPR2) *FMT-PPR-INDENTATION* [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] PPR *ILLEGAL-FMT-KEYS* ILLEGAL-FMT-STRING ILLEGAL-FMT-MSG SCAN-PAST-WHITESPACE [GC for 3137 CONS pages..(T=8).GC finished] ZERO-ONE-OR-MORE [GC for 3137 CONS pages..(T=7).GC finished] FIND-ALTERNATIVE-SKIP [GC for 3137 CONS pages..(T=8).GC finished] FIND-ALTERNATIVE-START1 [GC for 3147 CONS pages..(T=7).GC finished] FMT-CHAR FIND-ALTERNATIVE-START [GC for 3147 CONS pages..(T=8).GC finished] FIND-ALTERNATIVE-STOP PUNCTP [GC for 3147 CONS pages..(T=8).GC finished] FMT-TILDE-S1 FMT-TILDE-CAP-S1 [GC for 3147 CONS pages..(T=8).GC finished] FMT-VAR SPLAT-ATOM SPLAT-ATOM! [GC for 3147 CONS pages..(T=7).GC finished] (SPLAT SPLAT1) NUMBER-OF-DIGITS [GC for 3147 CONS pages..(T=8).GC finished] LEFT-PAD-WITH-BLANKS MAYBE-NEWLINE EVISC-TUPLE STANDARD-EVISC-TUPLEP [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] WORLD-EVISCERATION-ALIST ABBREV-EVISC-TUPLE GAG-MODE TERM-EVISC-TUPLE GAG-MODE-EVISC-TUPLE LD-EVISC-TUPLE [GC for 383 SFUN pages..(T=8).GC finished] FMT-PPR MSGP [GC for 3157 CONS pages..(T=8).GC finished] [GC for 3167 CONS pages..(T=8).GC finished] [GC for 3177 CONS pages..(T=8).GC finished] [GC for 3187 CONS pages..(T=8).GC finished] [GC for 3197 CONS pages..(T=8).GC finished] [GC for 3207 CONS pages..(T=8).GC finished] [GC for 3207 CONS pages..(T=8).GC finished] [GC for 3207 CONS pages..(T=8).GC finished] [GC for 3217 CONS pages..(T=8).GC finished] [GC for 3227 CONS pages..(T=8).GC finished] [GC for 3237 CONS pages..(T=8).GC finished] [GC for 3247 CONS pages..(T=8).GC finished] [GC for 3257 CONS pages..(T=8).GC finished] [GC for 3267 CONS pages..(T=8).GC finished] [GC for 383 SFUN pages..(T=8).GC finished] [GC for 383 SFUN pages..(T=8).GC finished] (FMT0* FMT0&V SPELL-NUMBER FMT-TILDE-S FMT-TILDE-CAP-S FMT0) TILDE-*-&V-STRINGS FMT1 [GC for 383 SFUN pages..(T=7).GC finished] FMT FMS FMT1! FMT! [GC for 383 SFUN pages..(T=8).GC finished] [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] FMS! FMX FMX-CW-MSG-1-BODY [GC for 3267 CONS pages..(T=7).GC finished] [GC for 383 SFUN pages..(T=8).GC finished] FMX-CW-MSG-1 FMX-CW-MSG FMX-CW-FN-GUARD [GC for 383 SFUN pages..(T=8).GC finished] FMX-CW-FN FMX!-CW-FN FMX-CW FMX!-CW FMT-DOC-EXAMPLE1 [GC for 383 SFUN pages..(T=8).GC finished] FMT-DOC-EXAMPLE *SEE-DOC-SET-IPRINT* FMT-ABBREV1 [GC for 1563 RELOCATABLE-BLOCKS pages..(T=8).GC finished] FMT-ABBREV *FMT-CTX-SPACERS* FMT-CTX FMT-IN-CTX [GC for 383 SFUN pages..(T=8).GC finished] ERROR-FMS-CHANNEL ERROR-FMS PUSH-WARNING-FRAME [GC for 383 SFUN pages..(T=7).GC finished] ABSORB-FRAME POP-WARNING-FRAME PUSH-WARNING RECORD-MAKER-FUNCTION-NAME [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] RECORD-CHANGER-FUNCTION-NAME MAKE CHANGE MAKE-RECORD-CAR-CDRS1 MAKE-RECORD-CAR-CDRS [GC for 383 SFUN pages..(T=8).GC finished] MAKE-RECORD-ACCESSORS SYMBOL-NAME-TREE-OCCUR SOME-SYMBOL-NAME-TREE-OCCUR MAKE-RECORD-CHANGER-CONS [GC for 383 SFUN pages..(T=8).GC finished] MAKE-RECORD-CHANGER-LET-BINDINGS MAKE-RECORD-CHANGER-LET MAKE-RECORD-CHANGER MAKE-RECORD-MAKER-CONS MAKE-RECORD-MAKER-LET [GC for 474 SYMBOL pages..(T=8).GC finished] MAKE-RECORD-MAKER MAKE-RECORD-FIELD-LST RECORD-MAKER-RECOGNIZER-NAME MAKE-RECORD-RECOGNIZER-BODY MAKE-RECORD-RECOGNIZER RECORD-MACROS DEFREC RECORD-TYPE [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] IO?-NIL-OUTPUT CHECK-EXACT-FREE-VARS FORMAL-BINDINGS WEAK-IO-RECORD-P PUSH-IO-RECORD SAVED-OUTPUT-TOKEN-P IO?-WORMHOLE-BINDINGS IO? IO?-PROVE OUTPUT-IGNORED-P [GC for 3267 CONS pages..(T=8).GC finished] ERROR1 ERROR1-SAFE *UNINHIBITED-WARNING-SUMMARIES* WARNING-OFF-P1 WARNING-OFF-P [GC for 3267 CONS pages..(T=8).GC finished] WEAK-STATE-VARS-P DEFAULT-STATE-VARS WARNING1-BODY WARNING1-FORM [GC for 3267 CONS pages..(T=8).GC finished] WARNING1 WARNING-DISABLED-P OBSERVATION1-BODY [GC for 3267 CONS pages..(T=8).GC finished] OBSERVATION1 OBSERVATION1-CW OBSERVATION OBSERVATION-CW WEAK-DEFSTOBJ-FIELD-TEMPLATE-P [GC for 3267 CONS pages..(T=8).GC finished] WEAK-DEFSTOBJ-TEMPLATE-P [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] PACKN1 PACKN-POS FIND-FIRST-NON-CL-SYMBOL PACKN PACK2 DEFSTOBJ-FNNAME-KEY2 [GC for 3267 CONS pages..(T=8).GC finished] DEFSTOBJ-FNNAME DEFINED-CONSTANT FIX-STOBJ-ARRAY-TYPE DEFSTOBJ-FIELD-TEMPLATES [GC for 3277 CONS pages..(T=8).GC finished] *DEFSTOBJ-KEYWORDS* PARTITION-REST-AND-KEYWORD-ARGS1 PARTITION-REST-AND-KEYWORD-ARGS2 PARTITION-REST-AND-KEYWORD-ARGS DEFSTOBJ-TEMPLATE [GC for 3277 CONS pages..(T=8).GC finished] SIMPLE-ARRAY-TYPE LIVE-STOBJP *EXPT2-28* ARRAY-ETYPE-IS-FIXNUM-TYPE ABSSTOBJ-NAME [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] GET-STOBJ-CREATOR THE$ GET-STOBJ-SCALAR-FIELD MAKE-STOBJ-SCALAR-FIELD (MAYBE-CONTAINED-IN-CHARACTER SOME-MAYBE-CONTAINED-IN-CHARACTER ALL-MAYBE-CONTAINED-IN-CHARACTER) SINGLE-FIELD-TYPE-P [GC for 3277 CONS pages..(T=8).GC finished] [GC for 3287 CONS pages..(T=8).GC finished] DEFSTOBJ-FIELD-FNS-RAW-DEFS DEFSTOBJ-RAW-INIT-FIELDS DEFSTOBJ-RAW-INIT-SETF-FORMS [GC for 3297 CONS pages..(T=8).GC finished] DEFSTOBJ-RAW-INIT DEFSTOBJ-COMPONENT-RECOGNIZER-CALLS STOBJP TRANSLATE-STOBJ-TYPE-TO-GUARD [GC for 3307 CONS pages..(T=9).GC finished] DEFSTOBJ-COMPONENT-RECOGNIZER-AXIOMATIC-DEFS CONGRUENT-STOBJ-REP ALL-BUT-LAST [GC for 3307 CONS pages..(T=8).GC finished] DEFSTOBJ-RAW-DEFS DEFCONST-NAME [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] DEFSTOBJ-DEFCONSTS STRIP-ACCESSOR-NAMES THE-LIVE-VAR STANDARD-CO EQUAL-X-CONSTANT [GC for 3317 CONS pages..(T=9).GC finished] MATCH-TESTS-AND-BINDINGS MATCH-CLAUSE MATCH-CLAUSE-LIST CASE-MATCH PARSE-WITH-LOCAL-STOBJ [GC for 3317 CONS pages..(T=9).GC finished] PARSE-VERSION PCD2 POWER-REP DECODE-IDATE [GC for 3317 CONS pages..(T=8).GC finished] PRINT-IDATE GOOD-BYE-FN GOOD-BYE EXIT QUIT SAVE-EXEC-FN SAVE-EXEC *SLASH-DOT-DOT* *LENGTH-SLASH-DOT-DOT* [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] FIND-DOT-DOT (CANCEL-DOT-DOTS GET-PARENT-DIRECTORY MERGE-USING-DOT-DOT) Finished loading "basis-a.lisp". [GC for 3317 CONS pages..ACL2 loading (T=8).GC finished] '((IN-PACKAGE "ACL2") (DEFN CLEAR-MEMOIZE-TABLE (FN) FN) (DEFN CLEAR-MEMOIZE-TABLES NIL NIL) (DEFN MEMOIZE-SUMMARY NIL NIL) (DEFN CLEAR-MEMOIZE-STATISTICS NIL NIL) (DEFMACRO MEMSUM NIL '(MEMOIZE-SUMMARY)) (DEFCONST *HONS-PRIMITIVE-FNS* '(HONS-COPY HONS HONS-EQUAL HONS-EQUAL-LITE HONS-CLEAR HONS-CLEAR! HONS-WASH ...)) ...). "ACL2" CLEAR-MEMOIZE-TABLE CLEAR-MEMOIZE-TABLES MEMOIZE-SUMMARY CLEAR-MEMOIZE-STATISTICS MEMSUM *HONS-PRIMITIVE-FNS* *HONS-PRIMITIVES* *MHT-DEFAULT-SIZE* [GC for 3327 CONS pages..(T=9).GC finished] [GC for 3337 CONS pages..(T=8).GC finished] MEMOIZE-FORM MEMOIZE UNMEMOIZE PROFILE MEMOIZEDP-WORLD MEMOIZEDP [GC for 3347 CONS pages..(T=8).GC finished] NEVER-MEMOIZE-FN NEVER-MEMOIZE *BAD-LISP-CONSP-MEMOIZATION* *THREAD-UNSAFE-BUILTIN-MEMOIZATIONS* SET-BAD-LISP-CONSP-MEMOIZE *SPECIAL-CLTL-CMD-ATTACHMENT-MARK-NAME* *SPECIAL-CLTL-CMD-ATTACHMENT-MARK* Finished loading '((IN-PACKAGE "ACL2") (DEFN CLEAR-MEMOIZE-TABLE (FN) FN) (DEFN CLEAR-MEMOIZE-TABLES NIL NIL) (DEFN MEMOIZE-SUMMARY NIL NIL) (DEFN CLEAR-MEMOIZE-STATISTICS NIL NIL) (DEFMACRO MEMSUM NIL '(MEMOIZE-SUMMARY)) (DEFCONST *HONS-PRIMITIVE-FNS* '(HONS-COPY HONS HONS-EQUAL HONS-EQUAL-LITE HONS-CLEAR HONS-CLEAR! HONS-WASH ...)) ...). ACL2 loading '((IN-PACKAGE "ACL2") (DEFMACRO SERIALIZE-WRITE (FILENAME OBJ &KEY VERBOSEP) (CONS 'SERIALIZE-WRITE-FN (CONS FILENAME #))) (DEFUN SERIALIZE-WRITE-FN (FILENAME OBJ VERBOSEP STATE) (DECLARE (XARGS :GUARD # :STOBJS STATE) (IGNORABLE FILENAME OBJ VERBOSEP)) (MV-LET (ERP VAL STATE) (READ-ACL2-ORACLE STATE) (DECLARE #) STATE)) (DEFMACRO SERIALIZE-READ (FILENAME &KEY (HONS-MODE #) VERBOSEP) (CONS 'SERIALIZE-READ-FN (CONS FILENAME #))) (DEFUN SERIALIZE-READ-FN (FILENAME HONS-MODE VERBOSEP STATE) (DECLARE (XARGS :GUARD # :STOBJS STATE) (IGNORABLE FILENAME HONS-MODE VERBOSEP)) (MV-LET (ERP VAL STATE) (READ-ACL2-ORACLE STATE) (DECLARE #) (MV VAL STATE))) (DEFMACRO WITH-SERIALIZE-CHARACTER (VAL FORM) (DECLARE (XARGS :GUARD #)) (CONS 'STATE-GLOBAL-LET* (CONS # #)))). "ACL2" SERIALIZE-WRITE SERIALIZE-WRITE-FN SERIALIZE-READ [GC for 1563 RELOCATABLE-BLOCKS pages..(T=8).GC finished] SERIALIZE-READ-FN WITH-SERIALIZE-CHARACTER Finished loading '((IN-PACKAGE "ACL2") (DEFMACRO SERIALIZE-WRITE (FILENAME OBJ &KEY VERBOSEP) (CONS 'SERIALIZE-WRITE-FN (CONS FILENAME #))) (DEFUN SERIALIZE-WRITE-FN (FILENAME OBJ VERBOSEP STATE) (DECLARE (XARGS :GUARD # :STOBJS STATE) (IGNORABLE FILENAME OBJ VERBOSEP)) (MV-LET (ERP VAL STATE) (READ-ACL2-ORACLE STATE) (DECLARE #) STATE)) (DEFMACRO SERIALIZE-READ (FILENAME &KEY (HONS-MODE #) VERBOSEP) (CONS 'SERIALIZE-READ-FN (CONS FILENAME #))) (DEFUN SERIALIZE-READ-FN (FILENAME HONS-MODE VERBOSEP STATE) (DECLARE (XARGS :GUARD # :STOBJS STATE) (IGNORABLE FILENAME HONS-MODE VERBOSEP)) (MV-LET (ERP VAL STATE) (READ-ACL2-ORACLE STATE) (DECLARE #) (MV VAL STATE))) (DEFMACRO WITH-SERIALIZE-CHARACTER (VAL FORM) (DECLARE (XARGS :GUARD #)) (CONS 'STATE-GLOBAL-LET* (CONS # #)))). ACL2 loading "basis-b.lisp". "ACL2" ENFORCE-REDUNDANCY-ER-ARGS ENFORCE-REDUNDANCY GLOBAL-SET [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] TILDE-@-ILLEGAL-VARIABLE-OR-CONSTANT-NAME-PHRASE LEGAL-CONSTANTP GENVAR1 GENVAR GEN-FORMALS-FROM-PRETTY-FLAGS1 [GC for 393 SFUN pages..(T=8).GC finished] GEN-FORMALS-FROM-PRETTY-FLAGS COLLECT-NON-X COLLECT-NON-* DEFSTUB-BODY-NEW DEFPROXY DEFSTUB-IGNORES [GC for 393 SFUN pages..(T=8).GC finished] DEFSTUB-BODY-OLD-AUX DEFSTUB-BODY-OLD DEFSTUB-FN DEFSTUB [GC for 3347 CONS pages..(T=9).GC finished] *PRIMITIVE-FORMALS-AND-GUARDS* *PRIMITIVE-MONADIC-BOOLEANS* CONS-TERM1-CASES *CONS-TERM1-ALIST* CONS-TERM1-BODY QUOTE-LISTP [GC for 3347 CONS pages..(T=8).GC finished] [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] CONS-TERM1 CONS-TERM CONS-TERM* MCONS-TERM MCONS-TERM* FCONS-TERM FARGN1 FARGN CDR-NEST [GC for 393 SFUN pages..(T=8).GC finished] STOBJ-PRINT-NAME EVISCERATION-STOBJ-MARK EVISCERATION-STOBJ-MARKS1 *ERROR-TRIPLE-SIG* *CMP-SIG* EVISCERATION-STOBJ-MARKS EVISCERATE-STOBJS1 EVISCERATE-STOBJS [GC for 393 SFUN pages..(T=9).GC finished] EVISCERATE-STOBJS-TOP FLAMBDA-APPLICATIONP LAMBDA-APPLICATIONP FLAMBDAP LAMBDA-FORMALS LAMBDA-BODY MAKE-LAMBDA MAKE-LET DOUBLET-LISTP ER-LET* MATCH MATCH! DEF-BASIC-TYPE-SETS1 DEF-BASIC-TYPE-SETS LIST-OF-THE-TYPE-SET TS= TS-COMPLEMENT0 TS-COMPLEMENTP [GC for 3357 CONS pages..(T=9).GC finished] [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] TS-UNION0-FN TS-UNION0 TS-INTERSECTION0 TS-DISJOINTP TS-INTERSECTP TS-BUILDER-CASE-LISTP TS-BUILDER-MACRO1 TS-BUILDER-MACRO TS-BUILDER FFN-SYMB-P STRIP-NOT EQUALITYP INEQUALITYP CONSITYP [GC for 3367 CONS pages..(T=9).GC finished] PRINT-CURRENT-IDATE SKIP-WHEN-LOGIC CHK-INHIBIT-OUTPUT-LST *LD-SPECIAL-ERROR* [GC for 3377 CONS pages..(T=8).GC finished] CHK-LD-SKIP-PROOFSP SET-LD-SKIP-PROOFSP SET-LD-SKIP-PROOFS SET-WRITE-ACL2X *CHECK-SUM-EXCLUSIVE-MAXIMUM* *CHECK-LENGTH-EXCLUSIVE-MAXIMUM* *-CHECK-SUM-EXCLUSIVE-MAXIMUM* *1-CHECK-LENGTH-EXCLUSIVE-MAXIMUM* ASCII-CODE! [GC for 484 SYMBOL pages..(T=8).GC finished] CHECK-SUM1 CHECK-SUM CHECK-SUM-INC [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] CHECK-SUM-NATURAL CHECK-SUM-STRING1 CHECK-SUM-STRING2 CHECK-SUM-STRING [GC for 3387 CONS pages..(T=8).GC finished] CHECK-SUM-OBJ1 OLD-CHECK-SUM-OBJ PLUS-MOD-M31 [GC for 3397 CONS pages..(T=8).GC finished] DOUBLE-MOD-M31 TIMES-EXPT-2-16-MOD-M31 TIMES-MOD-M31 FCHECKSUM-NATURAL-AUX [GC for 393 SFUN pages..(T=9).GC finished] FCHECKSUM-NATURAL FCHECKSUM-STRING1 [GC for 3397 CONS pages..(T=8).GC finished] [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] FCHECKSUM-STRING2 FCHECKSUM-STRING FCHECKSUM-ATOM *FCHECKSUM-OBJ-STACK-BOUND-INIT* [GC for 3407 CONS pages..(T=8).GC finished] (FCHECKSUM-OBJ2 FCHECKSUM-OBJ) CHECK-SUM-OBJ READ-FILE-ITERATE [GC for 393 SFUN pages..(T=8).GC finished] READ-FILE FORMALS PLIST-WORLDP-WITH-FORMALS ARITY [GC for 393 SFUN pages..(T=9).GC finished] SYMBOL-CLASS FDEFUN-MODE DEFUN-MODE [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] ARITIES-OKP USER-DEFINED-FUNCTIONS-TABLE WEAK-DEF-BODY-P LATEST-BODY DEF-BODY [GC for 3407 CONS pages..(T=9).GC finished] BODY GET-STOBJ-RECOGNIZER STOBJ-RECOGNIZER-TERMS MCONS-TERM-SMART [GC for 393 SFUN pages..(T=9).GC finished] (OPTIMIZE-STOBJ-RECOGNIZERS1 OPTIMIZE-STOBJ-RECOGNIZERS1-LST) OPTIMIZE-STOBJ-RECOGNIZERS GUARD [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] GUARD-LST EQUIVALENCE-RELATIONP >=-LEN ALL->=-LEN STRIP-CADRS [GC for 393 SFUN pages..(T=8).GC finished] STRIP-CDDRS GLOBAL-SET-LST CONS-TERM1-BODY-MV2 CONS-TERM1-MV2 [GC for 3417 CONS pages..(T=8).GC finished] (SUBLIS-VAR1 SUBLIS-VAR1-LST) SUBLIS-VAR SUBLIS-VAR-LST [GC for 393 SFUN pages..(T=9).GC finished] SUBCOR-VAR1 [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] (SUBCOR-VAR SUBCOR-VAR-LST) MAKE-REVERSED-AD-LIST CAR-CDR-ABBREV-NAME PRETTY-PARSE-AD-LIST [GC for 393 SFUN pages..(T=8).GC finished] UNTRANSLATE-CAR-CDR-NEST COLLECT-NON-TRIVIAL-BINDINGS UNTRANSLATE-AND UNTRANSLATE-OR [GC for 3427 CONS pages..(T=9).GC finished] CASE-LENGTH [GC for 1563 RELOCATABLE-BLOCKS pages..(T=8).GC finished] COND-LENGTH *UNTRANSLATE-BOOLEAN-PRIMITIVES* RIGHT-ASSOCIATED-ARGS [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] DUMB-NEGATE-LIT [GC for 52 CFUN pages..(T=8).GC finished] DUMB-NEGATE-LIT-LST (TERM-STOBJS-OUT-ALIST TERM-STOBJS-OUT) ACCESSOR-ROOT PROGN! [GC for 393 SFUN pages..(T=8).GC finished] LD-REDEFINITION-ACTION CHK-LD-REDEFINITION-ACTION SET-LD-REDEFINITION-ACTION REDEF REDEF! REDEF+ REDEF- CHK-CURRENT-PACKAGE [GC for 393 SFUN pages..(T=9).GC finished] SET-CURRENT-PACKAGE STANDARD-OI [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] READ-STANDARD-OI CHK-STANDARD-OI SET-STANDARD-OI CHK-STANDARD-CO [GC for 393 SFUN pages..(T=8).GC finished] SET-STANDARD-CO PROOFS-CO CHK-PROOFS-CO SET-PROOFS-CO [GC for 393 SFUN pages..(T=8).GC finished] LD-PROMPT CHK-LD-PROMPT SET-LD-PROMPT LD-KEYWORD-ALIASES [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] LD-KEYWORD-ALIASESP LD-KEYWORD-ALIASES ADD-LD-KEYWORD-ALIAS! ADD-LD-KEYWORD-ALIAS SET-LD-KEYWORD-ALIASES! SET-LD-KEYWORD-ALIASES LD-MISSING-INPUT-OK CHK-LD-MISSING-INPUT-OK [GC for 3437 CONS pages..(T=9).GC finished] SET-LD-MISSING-INPUT-OK LD-PRE-EVAL-FILTER NEW-NAMEP [GC for 393 SFUN pages..(T=8).GC finished] CHK-LD-PRE-EVAL-FILTER SET-LD-PRE-EVAL-FILTER LD-PRE-EVAL-PRINT CHK-LD-PRE-EVAL-PRINT [GC for 393 SFUN pages..(T=8).GC finished] [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] SET-LD-PRE-EVAL-PRINT LD-POST-EVAL-PRINT CHK-LD-POST-EVAL-PRINT SET-LD-POST-EVAL-PRINT [GC for 393 SFUN pages..(T=8).GC finished] LD-ERROR-TRIPLES CHK-LD-ERROR-TRIPLES SET-LD-ERROR-TRIPLES [GC for 393 SFUN pages..(T=9).GC finished] LD-ERROR-ACTION CHK-LD-ERROR-ACTION SET-LD-ERROR-ACTION [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] LD-QUERY-CONTROL-ALIST LD-QUERY-CONTROL-ALISTP CDR-ASSOC-QUERY-ID CHK-LD-QUERY-CONTROL-ALIST [GC for 393 SFUN pages..(T=8).GC finished] SET-LD-QUERY-CONTROL-ALIST LD-VERBOSE CHK-LD-VERBOSE SET-LD-VERBOSE [GC for 3447 CONS pages..(T=9).GC finished] CHK-LD-USER-STOBJS-MODIFIED-WARNING SET-LD-USER-STOBJS-MODIFIED-WARNING *NQTHM-TO-ACL2-PRIMITIVES* *NQTHM-TO-ACL2-COMMANDS* [GC for 3457 CONS pages..(T=9).GC finished] [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] NQTHM-TO-ACL2-FN NQTHM-TO-ACL2 ALLOCATE-FIXNUM-RANGE ALLEGRO-ALLOCATE-SLOWLY-FN CLEAR-PSTK *PSTK-VARS* [GC for 3467 CONS pages..(T=9).GC finished] PSTK-BINDINGS-AND-ARGS PSTK PSTACK-FN PSTACK VERBOSE-PSTACK SET-PRINT-CLAUSE-IDS SET-SAVED-OUTPUT-TOKEN-LST [GC for 3477 CONS pages..(T=9).GC finished] SET-GAG-MODE-FN SET-GAG-MODE POP-INHIBIT-OUTPUT-LST-STACK [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] PUSH-INHIBIT-OUTPUT-LST-STACK SET-GC-THRESHOLD$-FN SET-GC-THRESHOLD$ Finished loading "basis-b.lisp". ACL2 loading "parallel.lisp". "ACL2" SET-PARALLEL-EXECUTION-FN SET-PARALLEL-EXECUTION WATERFALL-PRINTING-VALUE-FOR-PARALLELISM-VALUE [GC for 3487 CONS pages..(T=9).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 CLEAR-MEMO-TABLE-EVENTS CLEAR-MEMO-TABLE SAVE-AND-CLEAR-MEMOIZATION-SETTINGS [GC for 3497 CONS pages..(T=9).GC finished] SET-MEMO-TABLE-EVENTS RESTORE-MEMOIZATION-SETTINGS SET-WATERFALL-PARALLELISM [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] SET-WATERFALL-PRINTING-FN SET-WATERFALL-PRINTING SET-WATERFALL-PARALLELISM-HACKS-ENABLED-GUARD WATERFALL-PARALLELISM-TABLE SET-WATERFALL-PARALLELISM-HACKS-ENABLED SET-WATERFALL-PARALLELISM-HACKS-ENABLED! CAAR-IS-DECLAREP DECLARE-GRANULARITY-P CHECK-AND-PARSE-FOR-GRANULARITY-FORM PARGS PLET BINARY-PAND PAND BINARY-POR POR [GC for 3497 CONS pages..(T=9).GC finished] OR-LIST AND-LIST [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] CPU-CORE-COUNT SPEC-MV-LET SET-TOTAL-PARALLELISM-WORK-LIMIT-FN SET-TOTAL-PARALLELISM-WORK-LIMIT SET-TOTAL-PARALLELISM-WORK-LIMIT-ERROR-FN SET-TOTAL-PARALLELISM-WORK-LIMIT-ERROR Finished loading "parallel.lisp". ACL2 loading "translate.lisp". "ACL2" [GC for 3507 CONS pages..(T=9).GC finished] (TERMP TERM-LISTP) TERM-LIST-LISTP COMPUTED-HINT-TUPLE-LISTP DEFAULT-HINTS-TABLE :REDUNDANT MACRO-ARGS *MACRO-EXPANSION-CTX* [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] ERROR-TRACE-SUGGESTION IGNORED-ATTACHMENT-MSG EV-FNCALL-NULL-BODY-ER-MSG EV-FNCALL-NULL-BODY-ERP EV-FNCALL-NULL-BODY-ER EV-FNCALL-CREATOR-ER-MSG UNKNOWN-PKG-ERROR-MSG ILLEGAL-MSG [GC for 403 SFUN pages..(T=8).GC finished] PROGRAM-ONLY-ER-MSG *SAFE-MODE-GUARD-ER-ADDENDUM* [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] FIND-FIRST-NON-NIL LATCH-STOBJS1 LATCH-STOBJS ACTUAL-STOBJS-OUT1 APPLY-SYMBOL-ALIST [GC for 3517 CONS pages..(T=9).GC finished] APPLY-INVERSE-SYMBOL-ALIST ACTUAL-STOBJS-OUT [GC for 3527 CONS pages..(T=9).GC finished] [GC for 3537 CONS pages..(T=9).GC finished] TRANSLATED-ACL2-UNWIND-PROTECTP4 [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] TRANSLATED-ACL2-UNWIND-PROTECTP ACL2-SYSTEM-NAMEP ACL2-SYSTEM-NAMEP-STATE [GC for 1563 RELOCATABLE-BLOCKS pages..(T=9).GC finished] T W-OF-ANY-STATE [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] UNTRANSLATE-PREPROCESS-FN UNTRANSLATE* SAVE-EV-FNCALL-GUARD-ER [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] WEAK-ATTACHMENT-P WEAK-ATTACHMENT-COMPONENT-P ATTACHMENT-RECORD-PAIRS ALL-ATTACHMENTS GC-OFF1 [GC for 494 SYMBOL pages..(T=8).GC finished] GC-OFF RETURN-LAST-LOOKUP MAKE-LET-OR-LET* UNTRANSLATE*-LST LIVE-STATE-SYMBOLP APPLY-USER-STOBJ-ALIST-OR-KWOTE SIGNATURE-FNS [GC for 3547 CONS pages..(T=9).GC finished] MAKE-EVENT-TUPLE ACCESS-EVENT-TUPLE-NUMBER ACCESS-EVENT-TUPLE-DEPTH ACCESS-EVENT-TUPLE-TYPE ACCESS-EVENT-TUPLE-SKIPPED-PROOFS-P ACCESS-EVENT-TUPLE-NAMEX [GC for 3547 CONS pages..(T=8).GC finished] ACCESS-EVENT-TUPLE-FORM ACCESS-EVENT-TUPLE-SYMBOL-CLASS WEAK-COMMAND-TUPLE-P MAKE-COMMAND-TUPLE [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] ACCESS-COMMAND-TUPLE-NUMBER ACCESS-COMMAND-TUPLE-DEFUN-MODE ACCESS-COMMAND-TUPLE-FORM SAFE-ACCESS-COMMAND-TUPLE-FORM ACCESS-COMMAND-TUPLE-LAST-MAKE-EVENT-EXPANSION ACCESS-COMMAND-TUPLE-CBD MAX-ABSOLUTE-EVENT-NUMBER [GC for 403 SFUN pages..(T=9).GC finished] NEXT-ABSOLUTE-EVENT-NUMBER MAX-ABSOLUTE-COMMAND-NUMBER NEXT-ABSOLUTE-COMMAND-NUMBER SCAN-TO-LANDMARK-NUMBER ADD-TO-ZAP-TABLE FETCH-FROM-ZAP-TABLE *EVENT-INDEX-INTERVAL* *COMMAND-INDEX-INTERVAL* [GC for 403 SFUN pages..(T=9).GC finished] LOOKUP-WORLD-INDEX1 LOOKUP-WORLD-INDEX *UNSPECIFIED-XARG-VALUE* GET-UNAMBIGUOUS-XARGS-FLG1/EDCLS1 GET-UNAMBIGUOUS-XARGS-FLG1/EDCLS GET-UNAMBIGUOUS-XARGS-FLG1 [GC for 3557 CONS pages..(T=9).GC finished] GET-UNAMBIGUOUS-XARGS-FLG GET-UNAMBIGUOUS-XARGS-FLG-LST REMOVE-STRINGS [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] REV-UNION-EQUAL TRANSLATE-DECLARATION-TO-GUARD-GEN-VAR-LST TRANSLATE-DECLARATION-TO-GUARD-VAR-LST GET-GUARDS2 [GC for 3567 CONS pages..(T=9).GC finished] GET-GUARDS1 GET-GUARDS DCLS-GUARD-RAW-FROM-DEF GET-EVENT GET-SKIPPED-PROOFS-P NEGATE-UNTRANSLATED-FORM [GC for 403 SFUN pages..(T=9).GC finished] EVENT-TUPLE-FN-NAMES CLTL-DEF-FROM-NAME2 CLTL-DEF-FROM-NAME1 CLTL-DEF-FROM-NAME UNMAKE-TRUE-LIST-CONS-NEST [GC for 3577 CONS pages..(T=9).GC finished] UNMAKE-FORMAL-PAIRLIS2 COLLECT-IGNORED-MV-VARS ALL-QUOTEPS [GC for 3587 CONS pages..(T=9).GC finished] (SUBST-VAR SUBST-VAR-LST) [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] SUBST-EACH-FOR-VAR TYPE-EXPRESSIONS-FROM-TYPE-SPEC SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTP1 FLATTEN-ANDS-IN-LIT [GC for 3587 CONS pages..(T=9).GC finished] FLATTEN-ANDS-IN-LIT-LST [GC for 3587 CONS pages..(T=9).GC finished] (SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTP SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTSP-WITHIN SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTSP-WITHIN-LST) COLLECT-PROGRAMS ALL-FNNAMES1 ALL-FNNAMES ALL-FNNAMES-LST GET-BADGE [GC for 3597 CONS pages..(T=8).GC finished] T APPLY$-BADGE-ARITY *GENERIC-TAME-BADGE-1* *GENERIC-TAME-BADGE-2* *GENERIC-TAME-BADGE-3* *APPLY$-BADGE* *EV$-BADGE* EXECUTABLE-BADGE EXECUTABLE-TAMEP-LAMBDAP [GC for 3597 CONS pages..(T=9).GC finished] (EXECUTABLE-TAMEP EXECUTABLE-TAMEP-FUNCTIONP EXECUTABLE-SUITABLY-TAMEP-LISTP) WELL-FORMED-LAMBDA-OBJECTP1 WELL-FORMED-LAMBDA-OBJECTP T :ATTACHMENTS-RECORDED [GC for 403 SFUN pages..(T=8).GC finished] [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=10).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) [GC for 403 SFUN pages..(T=9).GC finished] (EXPAND-ALL-LAMBDAS EXPAND-ALL-LAMBDAS-LST) [GC for 3597 CONS pages..(T=9).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 [GC for 403 SFUN pages..(T=8).GC finished] (CLEAN-UP-DIRTY-LAMBDA-OBJECTS CLEAN-UP-DIRTY-LAMBDA-OBJECTS-LST) POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS-LST POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS-LST-LST REMOVE-GUARD-HOLDERS [GC for 403 SFUN pages..(T=8).GC finished] REMOVE-GUARD-HOLDERS-LST [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] REMOVE-GUARD-HOLDERS-LST-LST LAMBDA-OBJECT-GUARD TAG-TRANSLATED-LAMBDA$-BODY LAMBDA$-BODYP MEMBER-LAMBDA-OBJECTP [GC for 403 SFUN pages..(T=8).GC finished] ATTACHMENT-ALIST ATTACHMENT-PAIR APPLY$-LAMBDA-GUARD APPLY$-GUARD NON-TRIVIAL-ENCAPSULATE-EE-ENTRIES [GC for 403 SFUN pages..(T=9).GC finished] ALL-FUNCTION-SYMBOLPS *UNKNOWN-CONSTRAINTS* [GC for 1563 RELOCATABLE-BLOCKS pages..(T=9).GC finished] UNKNOWN-CONSTRAINTS-TABLE-GUARD UNKNOWN-CONSTRAINTS-TABLE SET-UNKNOWN-CONSTRAINTS-SUPPORTERS T [GC for 3607 CONS pages..(T=9).GC finished] [GC for 3617 CONS pages..(T=8).GC finished] [GC for 3627 CONS pages..(T=8).GC finished] [GC for 3637 CONS pages..(T=9).GC finished] [GC for 3647 CONS pages..(T=9).GC finished] [GC for 3657 CONS pages..(T=9).GC finished] [GC for 3667 CONS pages..(T=8).GC finished] [GC for 3677 CONS pages..(T=9).GC finished] [GC for 3687 CONS pages..(T=9).GC finished] [GC for 3687 CONS pages..(T=9).GC finished] [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] [GC for 3687 CONS pages..(T=9).GC finished] [GC for 3697 CONS pages..(T=9).GC finished] [GC for 403 SFUN pages..(T=9).GC finished] [GC for 403 SFUN pages..(T=9).GC finished] [GC for 403 SFUN pages..(T=9).GC finished] [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] [GC for 403 SFUN pages..(T=9).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 [GC for 403 SFUN pages..(T=9).GC finished] EV-LST UNTRANSLATE UNTRANSLATE-LST EV-W-LST [GC for 403 SFUN pages..(T=9).GC finished] SILENT-ERROR CMP-TO-ERROR-TRIPLE CMP-TO-ERROR-DOUBLE CMP-AND-VALUE-TO-ERROR-QUADRUPLE ER-CMP-FN ER-CMP VALUE-CMP ER-PROGN-FN-CMP ER-PROGN-CMP ER-LET*-CMP [GC for 403 SFUN pages..(T=9).GC finished] 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 13056 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] LEGAL-INITP MACRO-ARGLIST-KEYSP MACRO-ARGLIST-AFTER-RESTP [GC for 403 SFUN pages..(T=9).GC finished] MACRO-ARGLIST-OPTIONALP MACRO-ARGLIST1P SUBSEQUENCEP COLLECT-LAMBDA-KEYWORDPS [GC for 403 SFUN pages..(T=10).GC finished] MACRO-ARGS-STRUCTUREP BIND-MACRO-ARGS-KEYS1 BIND-MACRO-ARGS-KEYS [GC for 403 SFUN pages..(T=9).GC finished] BIND-MACRO-ARGS-AFTER-REST BIND-MACRO-ARGS-OPTIONAL BIND-MACRO-ARGS1 [GC for 403 SFUN pages..(T=9).GC finished] BIND-MACRO-ARGS MACRO-GUARD-ER-MSG MACROEXPAND1-CMP [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] MACROEXPAND1 CHK-DECLARE COLLECT-DCLS TAG-LOOP$ *ACCEPTABLE-DCLS-ALIST* *DOCUMENTATION-STRINGS-PERMITTED* *DCL-EXPLANATION-ALIST* [GC for 403 SFUN pages..(T=9).GC finished] TILDE-*-CONJUNCTION-PHRASE1 TILDE-*-CONJUNCTION-PHRASE COLLECT-NON-LEGAL-VARIABLEPS [GC for 403 SFUN pages..(T=9).GC finished] OPTIMIZE-ALISTP CHK-DCL-LST [GC for 3707 CONS pages..(T=9).GC finished] NUMBER-OF-STRINGS GET-STRING COLLECT-DECLARATIONS-CMP [GC for 403 SFUN pages..(T=9).GC finished] COLLECT-DECLARATIONS LISTIFY TRANSLATE-DCL-LST *ONEIFY-PRIMITIVES* *EC-CALL-BAD-OPS* RETURN-LAST-CALL PROG2$-CALL [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] DCL-GUARDIAN IGNORE-VARS IGNORABLE-VARS MV-NTH-LIST TRANSLATE-BIND [GC for 403 SFUN pages..(T=9).GC finished] TRANSLATE-DEREF TRANSLATE-UNBOUND LISTLIS [GC for 403 SFUN pages..(T=9).GC finished] (FIND-FIRST-VAR FIND-FIRST-VAR-LST) (FIND-FIRST-FNSYMB FIND-FIRST-FNSYMB-LST) FIND-PKG-WITNESS TRANS-ER TRANS-ER+ TRANS-ER+? TRANS-VALUE TRANS-ER-LET* [GC for 504 SYMBOL pages..(T=9).GC finished] HIDE-IGNORED-ACTUALS AUGMENT-IGNORE-VARS COMPUTE-STOBJ-FLAGS [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] PRETTYIFY-STOBJ-FLAGS PRETTYIFY-STOBJS-OUT DEFSTOBJ-SUPPORTERP STOBJ-CREATORP (FFNNAMEP FFNNAMEP-LST) [GC for 1563 RELOCATABLE-BLOCKS pages..(T=9).GC finished] UNKNOWN-BINDING-MSG *MACROS-FOR-NONEXPANSION-IN-RAW-LISP* CHK-NO-DUPLICATE-DEFUNS-CMP CHK-NO-DUPLICATE-DEFUNS CHK-STATE-OK-MSG CHK-STATE-OK [GC for 3707 CONS pages..(T=9).GC finished] CHK-ARGLIST-MSG MSG-TO-CMP CHK-ARGLIST-CMP [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] CHK-ARGLIST LOGICAL-NAME-TYPE CHK-ALL-BUT-NEW-NAME-CMP CHK-ALL-BUT-NEW-NAME [GC for 3717 CONS pages..(T=9).GC finished] CHK-DEFUNS-TUPLES-CMP CHK-DEFUNS-TUPLES NAME-DROPPER FIRST-ASSOC-EQ CONTEXT-FOR-ENCAPSULATE-PASS-2 *BRR-GLOBALS* UNKNOWN-BINDING-MSG-ER [GC for 3727 CONS pages..(T=9).GC finished] CONGRUENT-STOBJSP STOBJS-IN-OUT1 STOBJS-IN-MATCHP STOBJS-IN-OUT [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] NON-TRIVIAL-STOBJ-BINDING FORMALIZED-VARLISTP THROW-NONEXEC-ERROR-P1 THROW-NONEXEC-ERROR-P CHK-FLET-DECLARATIONS [GC for 3727 CONS pages..(T=9).GC finished] CHK-FLET-DECLARE-FORM CHK-FLET-DECLARE-FORM-LIST STOBJ-UPDATER-GUESS-FROM-ACCESSOR PARSE-STOBJ-LET1 ILLEGAL-STOBJ-LET-MSG [GC for 3737 CONS pages..(T=9).GC finished] PARSE-STOBJ-LET PAIRLIS-X1 PAIRLIS-X2 [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] NO-DUPLICATESP-CHECKS-FOR-STOBJ-LET-ACTUALS/ALIST NO-DUPLICATESP-CHECKS-FOR-STOBJ-LET-ACTUALS STOBJ-LET-FN STOBJ-FIELD-ACCESSOR-P [GC for 3737 CONS pages..(T=9).GC finished] CHK-STOBJ-LET/BINDINGS CHK-STOBJ-LET/UPDATERS1 CHK-STOBJ-LET/UPDATERS CHK-STOBJ-LET ALL-NILS-OR-X STOBJ-FIELD-FN-OF-STOBJ-TYPE-P [GC for 3747 CONS pages..(T=9).GC finished] STOBJ-RECOGNIZER-P TRANS-OR INSIDE-DEFABSSTOBJ MISSING-KNOWN-STOBJS [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] DEREF-MACRO-NAME CORRESPONDING-INLINE-FN UNTOUCHABLE-FN-P MACROEXPAND1*-CMP FIND-STOBJ-OUT-AND-CALL *INITIAL-RETURN-LAST-TABLE* [GC for 3747 CONS pages..(T=10).GC finished] DEFINED-SYMBOLS MACROS-AND-FUNCTIONS-IN-OTHER-PACKAGES MATCH-STOBJS MAKE-LAMBDA-TERM (ALL-UNBADGED-FNNAMES ALL-UNBADGED-FNNAMES-LIST) *GRATUITOUS-LAMBDA-OBJECT-RESTRICTION-MSG* [GC for 3757 CONS pages..(T=9).GC finished] EDCLS-FROM-LAMBDA-OBJECT-DCLS EDCLS-FROM-LAMBDA-OBJECT-DCLS-SHORT-CUT [GC for 3757 CONS pages..(T=9).GC finished] *LOOP$-KEYWORD-INFO* *LOOP$-SPECIAL-FUNCTION-SYMBOLS* ASSOC-EQUAL-CADR [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] LOOP$-OPERATOR-SCIONP LOOP$-SCION-STYLE LOOP$-SCION-RESTRICTION MAKE-CARTON EXCART SYMBOL-NAME-EQUAL ASSOC-SYMBOL-NAME-EQUAL PARSE-LOOP$-ACCUM [GC for 3757 CONS pages..(T=9).GC finished] PARSE-LOOP$-WHEN PARSE-LOOP$-UNTIL [GC for 3767 CONS pages..(T=9).GC finished] PARSE-LOOP$-VSTS PARSE-LOOP$ [GC for 3777 CONS pages..(T=9).GC finished] MAKE-PLAIN-LOOP$-LAMBDA-OBJECT [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] TRANSLATE-VSTS MAKE-BINDINGS COLLECT-TVSTS-LIFTED-GUARDS MAKE-FANCY-LOOP$-TYPE-SPECS LIFT-FANCY-LOOP$-CARTON-GUARD MAKE-FANCY-LOOP$-LAMBDA-OBJECT [GC for 3777 CONS pages..(T=9).GC finished] MAKE-PLAIN-LOOP$ MAKE-FANCY-LOOP$-TARGET MAKE-FANCY-LOOP$ REMOVE-LOOP$-GUARDS [GC for 3777 CONS pages..(T=9).GC finished] TRANSLATE11-VAR-OR-QUOTE-EXIT [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] WEAK-APPLY$-BADGE-ALISTP ILKS-PLIST-WORLDP ILKS-PER-ARGUMENT-SLOT (QUOTE-NORMAL-FORM1 QUOTE-NORMAL-FORM1-LST) QUOTE-NORMAL-FORM [GC for 413 SFUN pages..(T=10).GC finished] PRIMITIVE-EVENT-MACROS *SYMS-NOT-CALLABLE-IN-CODE-FAL* [GC for 3787 CONS pages..(T=10).GC finished] [GC for 3797 CONS pages..(T=9).GC finished] [GC for 3807 CONS pages..(T=9).GC finished] [GC for 3817 CONS pages..(T=9).GC finished] [GC for 3827 CONS pages..(T=9).GC finished] [GC for 3837 CONS pages..(T=10).GC finished] [GC for 3847 CONS pages..(T=9).GC finished] [GC for 3857 CONS pages..(T=9).GC finished] [GC for 3867 CONS pages..(T=10).GC finished] [GC for 3877 CONS pages..(T=9).GC finished] [GC for 3887 CONS pages..(T=9).GC finished] [GC for 3897 CONS pages..(T=10).GC finished] [GC for 3907 CONS pages..(T=9).GC finished] [GC for 3917 CONS pages..(T=10).GC finished] [GC for 3927 CONS pages..(T=10).GC finished] [GC for 3937 CONS pages..(T=9).GC finished] [GC for 3947 CONS pages..(T=9).GC finished] [GC for 3957 CONS pages..(T=9).GC finished] [GC for 3957 CONS pages..(T=10).GC finished] [GC for 3957 CONS pages..(T=9).GC finished] [GC for 3967 CONS pages..(T=9).GC finished] [GC for 3967 CONS pages..(T=9).GC finished] [GC for 3967 CONS pages..(T=9).GC finished] [GC for 3967 CONS pages..(T=9).GC finished] [GC for 1563 RELOCATABLE-BLOCKS pages..(T=10).GC finished] [GC for 56 STRUCTURE pages..(T=10).GC finished] [GC for 237 ARRAY pages..(T=10).GC finished] [GC for 237 ARRAY pages..(T=10).GC finished] [GC for 3967 CONS pages..(T=10).GC finished] [GC for 3977 CONS pages..(T=10).GC finished] [GC for 3987 CONS pages..(T=10).GC finished] [GC for 3997 CONS pages..(T=10).GC finished] [GC for 247 ARRAY pages..(T=10).GC finished] [GC for 247 ARRAY pages..(T=10).GC finished] /tmp/gazonk_7070_0.c: In function 'L1': /tmp/gazonk_7070_0.c:1155:11: warning: self-comparison always evaluates to true [-Wtautological-compare] 1155 | if((Cnil)==Cnil){ | ^~ /tmp/gazonk_7070_0.c:1660:11: warning: self-comparison always evaluates to false [-Wtautological-compare] 1660 | if((Cnil)!=Cnil){ | ^~ /tmp/gazonk_7070_0.c:2153:11: warning: self-comparison always evaluates to false [-Wtautological-compare] 2153 | if((Cnil)!=Cnil){ | ^~ /tmp/gazonk_7070_0.c:2478:11: warning: self-comparison always evaluates to true [-Wtautological-compare] 2478 | if((Cnil)==Cnil){ | ^~ [GC for 13312 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] [GC for 413 SFUN pages..(T=9).GC finished] [GC for 413 SFUN pages..(T=9).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 413 SFUN pages..(T=9).GC finished] (LOGIC-FNSP LOGIC-FNS-LISTP) LOGIC-TERMP LOGIC-TERM-LISTP LOGIC-FNS-LIST-LISTP [GC for 413 SFUN pages..(T=9).GC finished] LOGIC-TERM-LIST-LISTP TRANSLATE-CMP TRANSLATE TRANSLATABLE-P CHK-TRANSLATABLE REPLACED-STOBJ [GC for 413 SFUN pages..(T=9).GC finished] REPLACE-STOBJS1 REPLACE-STOBJS [GC for 13312 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] NON-STOBJPS USER-STOBJSP PUT-ASSOC-EQ-ALIST COLLECT-USER-STOBJS EV-FOR-TRANS-EVAL [GC for 413 SFUN pages..(T=10).GC finished] MACROEXPAND1* TRANS-EVAL1 TRANS-EVAL0 TRANS-EVAL [GC for 413 SFUN pages..(T=10).GC finished] TRANS-EVAL-NO-WARNING TRANS-EVAL-DEFAULT-WARNING LAMBDA-OBJECT-GUARD-LST LAMBDA-OBJECT-BODY-LST FILTER-LAMBDA$-OBJECTS [GC for 413 SFUN pages..(T=10).GC finished] (COLLECT-CERTAIN-LAMBDA-OBJECTS COLLECT-CERTAIN-LAMBDA-OBJECTS-LST) TAGGED-LOOP$P [GC for 413 SFUN pages..(T=10).GC finished] (COLLECT-CERTAIN-TAGGED-LOOP$S COLLECT-CERTAIN-TAGGED-LOOP$S-LST) (ANCESTRAL-LAMBDA$S-BY-CALLER1 ANCESTRAL-LAMBDA$S-BY-CALLER1-LST) COLLECT-NON-EMPTY-PAIRS ANCESTRAL-LAMBDA$S-BY-CALLER [GC for 13312 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] (ELIMINATE-LAMBDA$ ELIMINATE-LAMBDA$-LST) TILDE-@-LAMBDA$-REPLACEMENT-PHRASE1 TILDE-*-LAMBDA$-REPLACEMENT-PHRASE2 [GC for 413 SFUN pages..(T=9).GC finished] TILDE-@-LAMBDA$-REPLACEMENT-PHRASE3 TILDE-@-LAMBDA$-REPLACEMENT-PHRASE4 TILDE-*-LAMBDA$-REPLACEMENT-PHRASE5 SIMPLE-TRANSLATE-AND-EVAL [GC for 413 SFUN pages..(T=10).GC finished] ERROR-FMS-CW SIMPLE-TRANSLATE-AND-EVAL-CMP SIMPLE-TRANSLATE-AND-EVAL-ERROR-DOUBLE [GC for 413 SFUN pages..(T=9).GC finished] TILDE-*-ALIST-PHRASE1 TILDE-*-ALIST-PHRASE SET-TEMP-TOUCHABLE-FNS SET-TEMP-TOUCHABLE-VARS [GC for 413 SFUN pages..(T=10).GC finished] CLEAR-TEMP-TOUCHABLE-FNS CLEAR-TEMP-TOUCHABLE-VARS MAPCAR$ MAPDO [GC for 413 SFUN pages..(T=10).GC finished] ALWAYS THEREIS GUARD-MSG-TABLE SET-GUARD-MSG GUARD-MSG-TABLE GUARD-MSG-TABLE GUARD-MSG-TABLE GUARD-MSG-TABLE GUARD-MSG-TABLE GUARD-MSG-TABLE GUARD-MSG-TABLE Finished loading "translate.lisp". ACL2 loading "type-set-a.lisp". "ACL2" *TS-CHARACTER* *TS-POSITIVE-INTEGER* *TS-NON-NEGATIVE-INTEGER* *TS-NON-POSITIVE-INTEGER* *TS-INTEGER* *TS-RATIONAL* *TS-ACL2-NUMBER* *TS-RATIONAL-ACL2-NUMBER* *TS-NEGATIVE-RATIONAL* *TS-POSITIVE-RATIONAL* *TS-NON-POSITIVE-RATIONAL* *TS-NON-NEGATIVE-RATIONAL* *TS-RATIO* [GC for 514 SYMBOL pages..(T=9).GC finished] *TS-BIT* *TS-CONS* *TS-BOOLEAN* *TS-TRUE-LIST* *TS-NON-NIL* *TS-SYMBOL* *TS-TRUE-LIST-OR-STRING* *TS-EMPTY* *TS-UNKNOWN* [GC for 1563 RELOCATABLE-BLOCKS pages..(T=9).GC finished] ONE-BIT-TYPE-SETP *CODE-TYPE-SET-ALIST* LOGIOR-LST LOGAND-LST [GC for 413 SFUN pages..(T=10).GC finished] (TS-COMPLEMENT-FN TS-UNION-FN TS-INTERSECTION-FN EVAL-TYPE-SET EVAL-TYPE-SET-LST) TS-COMPLEMENT TS-INTERSECTION TS-UNION TS-SUBSETP [GC for 4007 CONS pages..(T=9).GC finished] [GC for 4007 CONS pages..(T=10).GC finished] [GC for 4007 CONS pages..(T=9).GC finished] [GC for 4007 CONS pages..(T=10).GC finished] [GC for 4007 CONS pages..(T=10).GC finished] [GC for 4017 CONS pages..(T=10).GC finished] TYPE-SET-BINARY-+-ALIST-ENTRY TYPE-SET-BINARY-+-ALIST1 TYPE-SET-BINARY-+-ALIST [GC for 4027 CONS pages..(T=10).GC finished] [GC for 4027 CONS pages..(T=10).GC finished] [GC for 4027 CONS pages..(T=9).GC finished] [GC for 4027 CONS pages..(T=10).GC finished] [GC for 4027 CONS pages..(T=10).GC finished] TYPE-SET-BINARY-*-ALIST-ENTRY [GC for 13568 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] TYPE-SET-BINARY-*-ALIST1 TYPE-SET-BINARY-*-ALIST [GC for 4027 CONS pages..(T=10).GC finished] [GC for 4027 CONS pages..(T=9).GC finished] [GC for 4027 CONS pages..(T=10).GC finished] [GC for 4027 CONS pages..(T=10).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 [GC for 4027 CONS pages..(T=10).GC finished] (DUMB-OCCUR DUMB-OCCUR-LST) WEAK-HISTORY-ENTRY-P PT-OCCUR PT-INTERSECTP TAG-TREE-OCCUR REMOVE-TAG-FROM-TAG-TREE REMOVE-TAG-FROM-TAG-TREE! EXTEND-TAG-TREE [GC for 423 SFUN pages..(T=9).GC finished] 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 423 SFUN pages..(T=10).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 TO-BE-IGNOREDP [GC for 423 SFUN pages..(T=10).GC finished] WEAK-ASSUMNOTE-P WEAK-ASSUMPTION-P WEAK-FC-DERIVATION-P [GC for 13568 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] (CONTAINS-ASSUMPTIONP CONTAINS-ASSUMPTIONP-FC-DERIVATIONS) REMOVE-ASSUMPTION-ENTRIES-FROM-TYPE-ALIST FORCE-ASSUMPTION1 DUMB-OCCUR-IN-TYPE-ALIST ALL-DUMB-OCCUR-IN-TYPE-ALIST *FORCE-XRUNE* FORCE-ASSUMPTION TAG-TREE-OCCUR-ASSUMPTION-NIL-1 [GC for 423 SFUN pages..(T=9).GC finished] TAG-TREE-OCCUR-ASSUMPTION-NIL ASSUMPTION-FREE-TTREEP *IMPOSSIBLE-ASSUMPTION* FN-COUNT-EVG-MAX-VAL FN-COUNT-EVG-MAX-VAL-NEG FN-COUNT-EVG-MAX-CALLS MIN-FIXNUM [GC for 1563 RELOCATABLE-BLOCKS pages..(T=9).GC finished] FN-COUNT-EVG-REC FN-COUNT-EVG VAR-FN-COUNT-1 VAR-FN-COUNT VAR-OR-FN-COUNT-< TERM-ORDER1 ARITH-TERM-ORDER WEAK-POLY-P FIRST-VAR FIRST-COEFFICIENT [GC for 423 SFUN pages..(T=10).GC finished] GOOD-COEFFICIENT GOOD-POT-VARP GOOD-POLYP LOGICAL-< LOGICAL-<= EVALUATE-GROUND-POLY IMPOSSIBLE-POLYP [GC for 423 SFUN pages..(T=10).GC finished] TRUE-POLYP SILLY-POLYP IMPOSSIBLE-POLY BASE-POLY0 BASE-POLY POLY-ALIST-EQUAL POLY-EQUAL [GC for 13568 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] POLY-WEAKERP POLY-MEMBER NEW-AND-UGLY-LINEAR-VARSP FILTER-POLYS ADD-LINEAR-VARIABLE1 ZERO-FACTOR-P GET-COEFFICIENT ADD-LINEAR-VARIABLE [GC for 423 SFUN pages..(T=10).GC finished] DUMB-EVAL-YIELDS-QUOTEP DUMB-EVAL ADD-LINEAR-TERM ADD-LINEAR-TERMS-FN ADD-LINEAR-TERMS NORMALIZE-POLY1 NORMALIZE-POLY NORMALIZE-POLY-LST [GC for 423 SFUN pages..(T=9).GC finished] 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 BOUNDS-POLYS-WITH-VAR [GC for 423 SFUN pages..(T=10).GC finished] POLYS-WITH-VAR1 POLYS-WITH-VAR POLYS-WITH-POTS NEW-VARS-IN-POT-LST CHANGED-POT-VARS INFECT-POLYS INFECT-FIRST-N-POLYS [GC for 423 SFUN pages..(T=10).GC finished] INFECT-NEW-POLYS FCOMPLEMENTARY-MULTIPLEP1 [GC for 13568 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] FCOMPLEMENTARY-MULTIPLEP ALREADY-USED-BY-FIND-EQUATIONAL-POLYP-LST ALREADY-USED-BY-FIND-EQUATIONAL-POLYP CONS-TERM-BINARY-+-CONSTANT CONS-TERM-UNARY-- CONS-TERM-BINARY-*-CONSTANT FIND-EQUATIONAL-POLY-RHS1 [GC for 423 SFUN pages..(T=9).GC finished] FIND-EQUATIONAL-POLY-RHS FIND-EQUATIONAL-POLY3 FIND-EQUATIONAL-POLY2 FIND-EQUATIONAL-POLY1 FIND-EQUATIONAL-POLY GET-COEFF-FOR-CANCEL1 CANCEL2 [GC for 423 SFUN pages..(T=10).GC finished] CANCEL1 CANCEL CANCEL-POLY-AGAINST-ALL-POLYS ADD-POLY PRUNE-POLY-LST [GC for 4027 CONS pages..(T=9).GC finished] ADD-POLYS1 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* [GC for 423 SFUN pages..(T=10).GC finished] ASSOC-EQUAL-CDR RUNEP BASE-SYMBOL STRIP-BASE-SYMBOLS FNUME FRUNIC-MAPPING-PAIR FN-RUNE-NUME [GC for 13568 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] DEFINITION-RUNES GET-NEXT-NUME DEREF-MACRO-NAME-LST *ABBREV-RUNE-ALIST* TRANSLATE-ABBREV-RUNE RULE-NAME-DESIGNATORP THEORYP1 [GC for 524 SYMBOL pages..(T=10).GC finished] THEORYP RUNIC-THEORYP1 RUNIC-THEORYP FIND-MAPPING-PAIRS-TAIL1 FIND-MAPPING-PAIRS-TAIL AUGMENT-RUNIC-THEORY1 AUGMENT-RUNIC-THEORY *BAD-RUNIC-DESIGNATOR-STRING* [GC for 423 SFUN pages..(T=10).GC finished] CONVERT-THEORY-TO-UNORDERED-MAPPING-PAIRS1 CONVERT-THEORY-TO-UNORDERED-MAPPING-PAIRS DUPLICITOUS-CONS-CAR DUPLICITOUS-REVAPPEND-CAR DUPLICITOUS-MERGE-CAR DUPLICITOUS-SORT-CAR AUGMENT-THEORY ASSERT$-RUNIC-THEORYP [GC for 423 SFUN pages..(T=10).GC finished] RUNIC-THEORY [GC for 62 CFUN pages..(T=9).GC finished] WEAK-ENABLED-STRUCTURE-P ENABLED-STRUCTURE-P ENABLED-NUMEP ENABLED-ARITH-NUMEP ENABLED-RUNEP ACTIVE-RUNEP ACTIVE-OR-NON-RUNEP ENABLED-XFNP [GC for 4027 CONS pages..(T=10).GC finished] (SUBLIS-VAR! SUBLIS-VAR!-LST) [GC for 13568 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] THEORY-WARNING-FNS-AUX THEORY-WARNING-FNS MAYBE-WARN-ABOUT-THEORY WEAK-THEORY-INVARIANT-RECORD-P [GC for 4027 CONS pages..(T=10).GC finished] ENABLED-DISABLED-RUNEPS THEORY-INVARIANT-MSG-IMPLICATION COMBINE-ANDS THEORY-INVARIANT-MSG-ACTIVE-RUNEP-LST [GC for 4037 CONS pages..(T=10).GC finished] [GC for 1563 RELOCATABLE-BLOCKS pages..(T=10).GC finished] THEORY-INVARIANT-MSG [GC for 4047 CONS pages..(T=10).GC finished] CHK-THEORY-INVARIANT1 CHK-THEORY-INVARIANT WEAK-CLAUSE-ID-P POS-LISTP [GC for 423 SFUN pages..(T=10).GC finished] ALL-DIGITS-P D-POS-LISTP CLAUSE-ID-P *INITIAL-CLAUSE-ID* CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PERIODS CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PRIMES [GC for 423 SFUN pages..(T=10).GC finished] CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE STRING-FOR-TILDE-@-CLAUSE-ID-PHRASE UPDATE-ENABLED-STRUCTURE-ARRAY UPDATE-ENABLED-STRUCTURE LOAD-THEORY-INTO-ENABLED-STRUCTURE [GC for 4047 CONS pages..(T=10).GC finished] INITIAL-GLOBAL-ENABLED-STRUCTURE RECOMPRESS-GLOBAL-ENABLED-STRUCTURE RECOMPRESS-STOBJ-ACCESSOR-ARRAYS *FAKE-RUNE-FOR-TYPE-SET* PUFFERT [GC for 13568 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] IMMEDIATE-FORCEP NUMERIC-TYPE-SET RATIONAL-TYPE-SET [GC for 4057 CONS pages..(T=10).GC finished] TYPE-SET-BINARY-+ [GC for 4067 CONS pages..(T=10).GC finished] TYPE-SET-BINARY-* TYPE-SET-NOT [GC for 4067 CONS pages..(T=10).GC finished] TYPE-SET-<-1 [GC for 4067 CONS pages..(T=10).GC finished] [GC for 4067 CONS pages..(T=10).GC finished] TYPE-SET-< [GC for 4077 CONS pages..(T=10).GC finished] [GC for 4077 CONS pages..(T=10).GC finished] TYPE-SET-UNARY-- [GC for 4087 CONS pages..(T=10).GC finished] [GC for 4087 CONS pages..(T=10).GC finished] TYPE-SET-UNARY-/ [GC for 4097 CONS pages..(T=10).GC finished] TYPE-SET-NUMERATOR [GC for 4097 CONS pages..(T=10).GC finished] TYPE-SET-DENOMINATOR TYPE-SET-REALPART [GC for 4097 CONS pages..(T=10).GC finished] TYPE-SET-IMAGPART TYPE-SET-COMPLEX [GC for 4097 CONS pages..(T=10).GC finished] WEAK-RECOGNIZER-TUPLE-P *INITIAL-RECOGNIZER-ALIST* MOST-RECENT-ENABLED-RECOG-TUPLE1 MOST-RECENT-ENABLED-RECOG-TUPLE TYPE-SET-RECOGNIZER [GC for 4097 CONS pages..(T=10).GC finished] TYPE-SET-CAR TYPE-SET-CDR [GC for 4097 CONS pages..(T=10).GC finished] TYPE-SET-COERCE TYPE-SET-INTERN-IN-PACKAGE-OF-SYMBOL [GC for 4097 CONS pages..(T=10).GC finished] TYPE-SET-LENGTH [GC for 4097 CONS pages..(T=10).GC finished] TYPE-SET-CONS *SINGLETON-TYPE-SETS* TYPE-SET-EQUAL TYPE-SET-QUOTE [GC for 4097 CONS pages..(T=10).GC finished] TYPE-SET-CHAR-CODE [GC for 13568 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] FN-COUNT-1 FN-COUNT TERM-ORDER WEAK-TYPE-PRESCRIPTION-P FIND-RUNED-TYPE-PRESCRIPTION MV-ATF [GC for 423 SFUN pages..(T=10).GC finished] ASSUME-TRUE-FALSE-ERROR NON-CONS-CDR *ONE-WAY-UNIFY1-IMPLICIT-FNS* ONE-WAY-UNIFY1-QUOTEP-SUBPROBLEMS [GC for 4097 CONS pages..(T=10).GC finished] (ONE-WAY-UNIFY1 ONE-WAY-UNIFY1-LST ONE-WAY-UNIFY1-EQUAL1 ONE-WAY-UNIFY1-EQUAL) [GC for 423 SFUN pages..(T=10).GC finished] ONE-WAY-UNIFY CANONICAL-REPRESENTATIVE SUBST-TYPE-ALIST1-CHECK NIL-FN *NIL-FN-TS-ENTRY* SUBST-TYPE-ALIST1 [GC for 423 SFUN pages..(T=10).GC finished] SUBST-TYPE-ALIST INFECT-TYPE-ALIST-ENTRY INFECT-NEW-TYPE-ALIST-ENTRIES2 INFECT-NEW-TYPE-ALIST-ENTRIES1 INFECT-NEW-TYPE-ALIST-ENTRIES [GC for 423 SFUN pages..(T=10).GC finished] EXTEND-TYPE-ALIST-SIMPLE EXTEND-TYPE-ALIST1 [GC for 4097 CONS pages..(T=10).GC finished] EXTEND-TYPE-ALIST ZIP-VARIABLE-TYPE-ALIST [GC for 13568 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] ASSOC-EQUIV ASSOC-EQUIV+ ASSOC-TYPE-ALIST LOOK-IN-TYPE-ALIST [GC for 423 SFUN pages..(T=11).GC finished] MEMBER-CHAR-STRINGP TERMINAL-SUBSTRINGP1 TERMINAL-SUBSTRINGP [GC for 423 SFUN pages..(T=10).GC finished] EVG-OCCUR (OCCUR OCCUR-LST) [GC for 1563 RELOCATABLE-BLOCKS pages..(T=10).GC finished] (PSEUDO-VARIANTP PSEUDO-VARIANTP-LIST) DECREMENT-WORSE-THAN-CLK WITH-DECREMENT-WORSE-THAN-CLK WORSE-THAN-BUILTIN-CLOCKED-BODY [GC for 4107 CONS pages..(T=10).GC finished] [GC for 423 SFUN pages..(T=10).GC finished] (WORSE-THAN-BUILTIN-CLOCKED WORSE-THAN-OR-EQUAL-BUILTIN-CLOCKED BASIC-WORSE-THAN-LST1 BASIC-WORSE-THAN-LST2 BASIC-WORSE-THAN SOME-SUBTERM-WORSE-THAN-OR-EQUAL SOME-SUBTERM-WORSE-THAN-OR-EQUAL-LST ...) [GC for 423 SFUN pages..(T=11).GC finished] T T WORSE-THAN-CLK WORSE-THAN-BUILTIN WORSE-THAN-OR-EQUAL-BUILTIN :ATTACHMENTS-RECORDED :ATTACHMENTS-RECORDED [GC for 13568 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] WEAK-ANCESTOR-P MAKE-ANCESTOR-BINDING-HYP ANCESTOR-BINDING-HYP-P ANCESTOR-BINDING-HYP/HYP ANCESTOR-BINDING-HYP/UNIFY-SUBST PUSH-ANCESTOR ANCESTOR-LISTP [GC for 4117 CONS pages..(T=10).GC finished] EARLIER-ANCESTOR-BIGGERP EQUAL-MOD-COMMUTING [GC for 4127 CONS pages..(T=10).GC finished] ANCESTORS-CHECK1 ANCESTORS-CHECK-BUILTIN ANCESTORS-CHECK :ATTACHMENTS-RECORDED MAP-MULTIPLY-CAR [GC for 423 SFUN pages..(T=10).GC finished] NORMALIZE-ADDEND INSERT-CDR-TERM-ORDER NORMALIZE-LINEAR-SUM-2 NORMALIZE-LINEAR-SUM-1 [GC for 423 SFUN pages..(T=10).GC finished] NORMALIZE-LINEAR-SUM NORMALIZE-LINEAR-SUM-P1 NORMALIZE-LINEAR-SUM-P [GC for 4137 CONS pages..(T=10).GC finished] [GC for 4147 CONS pages..(T=10).GC finished] [GC for 4147 CONS pages..(T=10).GC finished] [GC for 4157 CONS pages..(T=10).GC finished] TYPE-SET-FINISH-1 [GC for 4167 CONS pages..(T=11).GC finished] TYPE-SET-FINISH SEARCH-TYPE-ALIST-REC [GC for 423 SFUN pages..(T=10).GC finished] (FREE-VARSP FREE-VARSP-LST) SEARCH-TYPE-ALIST-WITH-REST SEARCH-TYPE-ALIST [GC for 13568 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] 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 4167 CONS pages..(T=10).GC finished] WEAK-ACCP-ENTRY-P MERGE-ACCUMULATED-PERSISTENCE-AUX MERGE-ACCUMULATED-PERSISTENCE-REC MERGE-ACCUMULATED-PERSISTENCE [GC for 4167 CONS pages..(T=10).GC finished] ADD-ACCUMULATED-PERSISTENCE-S ADD-ACCUMULATED-PERSISTENCE-F ACCUMULATED-PERSISTENCE-MAKE-FAILURES [GC for 4177 CONS pages..(T=10).GC finished] ADD-ACCUMULATED-PERSISTENCE ACCUMULATED-PERSISTENCE ACCUMULATED-PERSISTENCE-OOPS SET-ACCUMULATED-PERSISTENCE MERGE-CAR-> MERGE-SORT-CAR-> *ACCP-MAJOR-SEPARATOR* *ACCP-MINOR-SEPARATOR* SHOW-ACCUMULATED-PERSISTENCE-PHRASE0 [GC for 4177 CONS pages..(T=10).GC finished] SHOW-ACCUMULATED-PERSISTENCE-PHRASE1 SHOW-ACCUMULATED-PERSISTENCE-REMOVE-USELESS SHOW-ACCUMULATED-PERSISTENCE-PHRASE-KEY SHOW-ACCUMULATED-PERSISTENCE-PHRASE2-MERGE SHOW-ACCUMULATED-PERSISTENCE-PHRASE2-NOT-MERGE [GC for 534 SYMBOL pages..(T=10).GC finished] SHOW-ACCUMULATED-PERSISTENCE-PHRASE2 SPLIT-XRUNE-ALIST [GC for 13568 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] SORT-XRUNE-ALIST-BY-RUNE1 SORT-XRUNE-ALIST-BY-RUNE [GC for 4187 CONS pages..(T=11).GC finished] POP-ACCP-FN POP-ACCP-FN-ITERATE SHOW-ACCUMULATED-PERSISTENCE-LIST [GC for 4197 CONS pages..(T=10).GC finished] SHOW-ACCUMULATED-PERSISTENCE-PHRASE SHOW-ACCUMULATED-PERSISTENCE PUSH-ACCP-FN PUSH-ACCP POP-ACCP WITH-ACCUMULATED-PERSISTENCE [GC for 4197 CONS pages..(T=10).GC finished] [GC for 4207 CONS pages..(T=10).GC finished] [GC for 4217 CONS pages..(T=11).GC finished] ASSUME-TRUE-FALSE-< [GC for 4227 CONS pages..(T=10).GC finished] MV-ATF-2 BINDING-HYP-P ADJUST-IGNORE-FOR-ATF BACKCHAIN-LIMIT-REACHEDP1 BACKCHAIN-LIMIT-REACHEDP NEW-BACKCHAIN-LIMIT ONCEP-TP ONCEP-TP-BUILTIN :ATTACHMENTS-RECORDED [GC for 4227 CONS pages..(T=11).GC finished] STRENGTHEN-RECOG-CALL PUSH-LEMMA? [GC for 4227 CONS pages..(T=11).GC finished] [GC for 4237 CONS pages..(T=11).GC finished] [GC for 4247 CONS pages..(T=10).GC finished] [GC for 4257 CONS pages..(T=10).GC finished] [GC for 4267 CONS pages..(T=10).GC finished] [GC for 4277 CONS pages..(T=10).GC finished] [GC for 4287 CONS pages..(T=10).GC finished] [GC for 4297 CONS pages..(T=10).GC finished] [GC for 4307 CONS pages..(T=10).GC finished] [GC for 4317 CONS pages..(T=10).GC finished] [GC for 4327 CONS pages..(T=11).GC finished] [GC for 4337 CONS pages..(T=10).GC finished] [GC for 4347 CONS pages..(T=11).GC finished] [GC for 4357 CONS pages..(T=10).GC finished] [GC for 4357 CONS pages..(T=11).GC finished] [GC for 4357 CONS pages..(T=10).GC finished] [GC for 4357 CONS pages..(T=10).GC finished] [GC for 4357 CONS pages..(T=11).GC finished] [GC for 13568 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] [GC for 1563 RELOCATABLE-BLOCKS pages..(T=11).GC finished] [GC for 4357 CONS pages..(T=11).GC finished] [GC for 4367 CONS pages..(T=11).GC finished] [GC for 4377 CONS pages..(T=11).GC finished] [GC for 4387 CONS pages..(T=11).GC finished] [GC for 13568 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] [GC for 433 SFUN pages..(T=10).GC finished] [GC for 433 SFUN pages..(T=10).GC finished] (TYPE-SET-REC TYPE-SET-LST TYPE-SET-RELIEVE-HYPS-FREE TYPE-SET-RELIEVE-HYPS1 TYPE-SET-RELIEVE-HYPS EXTEND-TYPE-ALIST-WITH-BINDINGS TYPE-SET-WITH-RULE ...) TYPE-SET TYPE-SET-BC T :ATTACHMENTS-RECORDED TOP-LEVEL-IF-REDUCE-REC [GC for 433 SFUN pages..(T=10).GC finished] TOP-LEVEL-IF-REDUCE TOP-LEVEL-IF-P TYPE-ALIST-REDUCIBLE-ENTRIES ASSUME-TRUE-FALSE-AGGRESSIVE-1 ASSUME-TRUE-FALSE-AGGRESSIVE ASSUME-TRUE-FALSE ASSUME-TRUE-FALSE-BC [GC for 433 SFUN pages..(T=10).GC finished] OK-TO-FORCE-ENS ADD-LINEAR-ASSUMPTION RETURN-TYPE-ALIST TYPE-ALIST-EQUALITY-LOOP1 CLEAN-UP-ALIST DUPLICATE-KEYSP [GC for 433 SFUN pages..(T=10).GC finished] CLEAN-TYPE-ALIST TYPE-ALIST-EQUALITY-LOOP-EXIT *TYPE-ALIST-EQUALITY-LOOP-MAX-DEPTH* TYPE-ALIST-EQUALITY-LOOP PUT-ASSOC-EQUAL-TS RECONSIDER-TYPE-ALIST [GC for 13824 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] TYPE-ALIST-CLAUSE-FINISH1 TYPE-ALIST-CLAUSE-FINISH TYPE-ALIST-CLAUSE KNOWN-WHETHER-NIL TS-BOOLEANP WEAK-CONS-OCCUR [GC for 433 SFUN pages..(T=10).GC finished] EQUAL-X-CONS-X-YP NOT-IDENT FIRST-IF ALL-VARIABLEP NORMALIZE-WITH-TYPE-SET [GC for 433 SFUN pages..(T=10).GC finished] (NORMALIZE NORMALIZE-LST NORMALIZE-OR-DISTRIBUTE-FIRST-IF DISTRIBUTE-FIRST-IF) DECODE-TYPE-SET1 DECODE-TYPE-SET [GC for 433 SFUN pages..(T=11).GC finished] DTS ENS Finished loading "type-set-b.lisp". ACL2 loading "linear-b.lisp". "ACL2" [GC for 4397 CONS pages..(T=11).GC finished] POLYS-FROM-TYPE-SET ADD-TYPE-SET-POLYS [GC for 433 SFUN pages..(T=10).GC finished] ADD-POLYNOMIAL-INEQUALITIES ADD-POLYS (EVAL-GROUND-SUBEXPRESSIONS1 EVAL-GROUND-SUBEXPRESSIONS1-LST) EVAL-GROUND-SUBEXPRESSIONS EVAL-GROUND-SUBEXPRESSIONS-LST [GC for 433 SFUN pages..(T=10).GC finished] POLY-SET [GC for 4397 CONS pages..(T=10).GC finished] [GC for 1563 RELOCATABLE-BLOCKS pages..(T=10).GC finished] [GC for 433 SFUN pages..(T=11).GC finished] LINEARIZE1 [GC for 13824 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] LINEARIZE LINEARIZE-LST1 LINEARIZE-LST Finished loading "linear-b.lisp". ACL2 loading "non-linear.lisp". "ACL2" CLEANSE-TYPE-ALIST VAR-WITH-DIVISIONP VARIFY [GC for 433 SFUN pages..(T=10).GC finished] VARIFY! VARIFY!-LST1 VARIFY!-LST INVERT-VAR PART-OF1 PART-OF [GC for 433 SFUN pages..(T=11).GC finished] PRODUCT-ALREADY-TRIEDP TOO-MANY-POLYSP EXPANDED-NEW-VARS-IN-POT-LST2 EXPANDED-NEW-VARS-IN-POT-LST1 EXPANDED-NEW-VARS-IN-POT-LST EXTRACT-BOUNDS [GC for 433 SFUN pages..(T=11).GC finished] GOOD-BOUNDS-IN-POT INVERSE-POLYS ADD-INVERSE-POLYS ADD-POLYS-FROM-TYPE-SET LENGTH-OF-SHORTEST-POLYS-WITH-VAR SHORTEST-POLYS-WITH-VAR1 [GC for 433 SFUN pages..(T=10).GC finished] SHORTEST-POLYS-WITH-VAR BINARY-*-LEAVES BINARY-*-TREE MERGE-ARITH-TERM-ORDER INSERT-ARITH-TERM-ORDER SORT-ARITH-TERM-ORDER [GC for 433 SFUN pages..(T=11).GC finished] MULTIPLY-ALIST-AND-CONST [GC for 13824 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] COLLECT-RATIONAL-POLY-P-LST Finished loading "non-linear.lisp". ACL2 loading "tau.lisp". "ACL2" ALMOST-LEXORDER-SINGLETONS MEMBER-NIL-NEG-EVGS MEMBER-NEG-EVGS1 MEMBER-NEG-EVGS INSERT-NEG-EVGS1 [GC for 433 SFUN pages..(T=10).GC finished] INSERT-NEG-EVGS MERGE-CAR-< MERGE-SORT-CAR-< MERGE-CADR-< MERGE-SORT-CADR-< STRIP-CADDRS [GC for 433 SFUN pages..(T=10).GC finished] UNPRETTYIFY/ADD-HYPS-TO-PAIRS UNPRETTYIFY REPRETTYIFY CONVERT-RETURNED-VARS-TO-TERM-LST IMPLICATE [GC for 433 SFUN pages..(T=10).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 433 SFUN pages..(T=11).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 433 SFUN pages..(T=11).GC finished] [GC for 13824 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] (ALL-RUNES-IN-ELIM-SEQUENCE-LST ALL-RUNES-IN-ELIM-SEQUENCE ALL-RUNES-IN-TTREE-FC-DERIVATION-LST ALL-RUNES-IN-TTREE-FIND-EQUATIONAL-POLY-LST ALL-RUNES-SUMMARY-DATA-LST ALL-RUNES-IN-TTREE ALL-RUNES-IN-TTREE-LST) WEAK-TAU-INTERVAL-P *TAU-EMPTY-INTERVAL* [GC for 433 SFUN pages..(T=11).GC finished] TAU-EMPTY-INTERVALP = LOWER-BOUND-> UPPER-BOUND-< TAU-SUBINTERVALP [GC for 433 SFUN pages..(T=10).GC finished] TAU-IMPLIES EMPTY-TAU-INTERVALP SINGLETON-TAU-INTERVALP MAKE-IDENTITY-INTERVAL IDENTITY-INTERVALP [GC for 544 SYMBOL pages..(T=11).GC finished] DELETE-CONSECUTIVE-INTEGERS-UPWARD DELETE-CONSECUTIVE-INTEGERS-DOWNWARD [GC for 1563 RELOCATABLE-BLOCKS pages..(T=11).GC finished] COLLECT- APPLY-REORDER-HINT ERASE-RW-CACHE-ANY-TAG-FROM-PSPV [GC for 523 SFUN pages..(T=16).GC finished] RESTORE-RW-CACHE-STATE-IN-PSPV WATERFALL1-WRAPPER [GC for 6117 CONS pages..(T=15).GC finished] [GC for 6117 CONS pages..(T=16).GC finished] [GC for 6117 CONS pages..(T=16).GC finished] (WATERFALL1 WATERFALL0-WITH-HINT-SETTINGS WATERFALL0 WATERFALL0-OR-HIT WATERFALL1-LST) WATERFALL SOME-POOL-MEMBER-SUBSUMES ADD-TO-POP-HISTORY [GC for 6117 CONS pages..(T=15).GC finished] POP-CLAUSE1 MAKE-DEFTHM-FORMS-FOR-BYES POP-CLAUSE-MSG1 [GC for 6117 CONS pages..(T=15).GC finished] POP-CLAUSE-MSG SUBSUMED-CLAUSE-IDS-FROM-POP-HISTORY INCREMENT-PROOF-TREE-POP-CLAUSE POP-CLAUSE TILDE-@-ASSUMNOTES-PHRASE-LST TILDE-*-ASSUMNOTES-COLUMN-PHRASE [GC for 6117 CONS pages..(T=15).GC finished] TILDE-@-ASSUMNOTES-PHRASE-LST-GAG-MODE TILDE-*-ASSUMNOTES-COLUMN-PHRASE-GAG-MODE PROCESS-ASSUMPTIONS-MSG1 PROCESS-ASSUMPTIONS-MSG COUNT-ASSUMPTIONS ADD-TYPE-ALIST-RUNES-TO-TTREE1 ADD-TYPE-ALIST-RUNES-TO-TTREE [GC for 523 SFUN pages..(T=15).GC finished] PROCESS-ASSUMPTIONS-TTREE PROCESS-ASSUMPTIONS [GC for 6117 CONS pages..(T=16).GC finished] DO-NOT-INDUCT-MSG PROVE-LOOP2 PROVE-LOOP1 [GC for 6117 CONS pages..(T=14).GC finished] PRINT-SUMMARY-ON-ERROR PROVE-LOOP0 PROVE-LOOP MAKE-PSPV CHK-ASSUMPTION-FREE-TTREE PUSH-CURRENT-ACL2-WORLD [GC for 6117 CONS pages..(T=15).GC finished] POP-CURRENT-ACL2-WORLD REVERT-WORLD PROVE Finished loading "prove.lisp". ACL2 loading "defuns.lisp". "ACL2" CERT-DATA-PAIR CERT-DATA-VAL [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=19).GC finished] CERT-DATA-ENTRY-PAIR CERT-DATA-ENTRY IN-ENCAPSULATEP (CONTAINS-LAMBDA-OBJECTP CONTAINS-LAMBDA-OBJECT-LISTP) [GC for 1563 RELOCATABLE-BLOCKS pages..(T=15).GC finished] STORE-CERT-DATA WEAK-TRANSLATE-CERT-DATA-RECORD-P UPDATE-TRANSLATE-CERT-DATA-FN UPDATE-TRANSLATE-CERT-DATA *MUTUAL-RECURSION-CTX-STRING* TRANSLATE-BODIES1 CHK-NON-EXECUTABLE-BODIES COLLECT-UNTOUCHABLE-FNS [GC for 6127 CONS pages..(T=15).GC finished] COLLECT-UNTOUCHABLE-VARS GET-TRANSLATE-CERT-DATA-RECORD GET-TRANSLATE-BODIES TRANSLATE-BODIES CHK-MUTUAL-RECURSION-BAD-NAMES *CHK-MUTUAL-RECURSION-STRING* CHK-MUTUAL-RECURSION1 CHK-MUTUAL-RECURSION [GC for 523 SFUN pages..(T=15).GC finished] (FFNNAMEP-MOD-MBE FFNNAMEP-MOD-MBE-LST) PUTPROP-RECURSIVEP-LST PROPER-DUMB-OCCUR-AS-OUTPUT ALWAYS-TESTED-AND-CHANGEDP GUESS-MEASURE [GC for 523 SFUN pages..(T=15).GC finished] GUESS-MEASURE-ALIST TILDE-*-MEASURE-PHRASE1 TILDE-*-MEASURE-PHRASE FIND-?-MEASURE [GC for 6137 CONS pages..(T=15).GC finished] [GC for 6147 CONS pages..(T=15).GC finished] PROVE-TERMINATION PUTPROP-JUSTIFICATION-LST UNION-EQUAL-TO-END CROSS-TESTS-AND-CALLS3 CROSS-TESTS-AND-CALLS2 CROSS-TESTS-AND-CALLS1 [GC for 523 SFUN pages..(T=16).GC finished] SUBLIS-TESTS-REV ALL-CALLS-TEST-ALIST CROSS-TESTS-AND-CALLS MARK-LOOP$-RECURSION-NUGGET MARKED-LOOP$-RECURSION-NUGGETP (INDUCTION-MACHINE-FOR-FN1 INDUCTION-MACHINE-FOR-FN1-LST) [GC for 6157 CONS pages..(T=15).GC finished] SIMPLIFY-TESTS-AND-CALLS SIMPLIFY-TESTS-AND-CALLS-LST (LOOP$-RECURSION-FFNNAMEP LOOP$-RECURSION-FFNNAMEP-LST) INDUCTION-MACHINE-FOR-FN CLEAN-UP-NOTS [GC for 523 SFUN pages..(T=15).GC finished] CLEAN-UP-NOTS-LST CLEAN-UP-CONJUNCTION1 CLEAN-UP-CONJUNCTION CLEAN-UP-LOOP$-RECURSION-INDUCTION-MACHINE INDUCTION-MACHINES PUTPROP-INDUCTION-MACHINE-LST QUICK-BLOCK-INITIAL-SETTINGS [GC for 523 SFUN pages..(T=15).GC finished] QUICK-BLOCK-INFO1 QUICK-BLOCK-INFO2 QUICK-BLOCK-SETTINGS QUICK-BLOCK-DOWN-T-MACHINE QUICK-BLOCK-INFO PUTPROP-QUICK-BLOCK-INFO-LST BIG-MUTREC GET-SIG-FNS1 [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=19).GC finished] GET-SIG-FNS SELECTED-ALL-FNNAMES-LST SUBVERSIVEP SUBVERSIVE-CLIQUEP PROVE-TERMINATION-NON-RECURSIVE [GC for 6157 CONS pages..(T=16).GC finished] PROVE-TERMINATION-RECURSIVE PUT-INDUCTION-INFO-RECURSIVE MAYBE-WARN-OR-ERROR-ON-NON-REC-MEASURE PUT-INDUCTION-INFO [GC for 6167 CONS pages..(T=15).GC finished] DESTRUCTURE-DEFINITION MEMBER-REWRITE-RULE-RUNE REPLACE-REWRITE-RULE-RUNE PREPROCESS-HYP PREPROCESS-HYPS ADD-DEFINITION-RULE-WITH-TTREE [GC for 523 SFUN pages..(T=16).GC finished] ADD-DEFINITION-RULE PUTPROP-BODY-LST TYPE-SET-IMPLIED-BY-TERM1 TYPE-SET-IMPLIED-BY-TERM PUTPROP-INITIAL-TYPE-PRESCRIPTIONS MAP-RETURNED-FORMALS-VIA-FORMALS [GC for 523 SFUN pages..(T=16).GC finished] MAP-TYPE-SETS-VIA-FORMALS VECTOR-TS-UNION MAP-CONS-TAG-TREES TYPE-SET-AND-RETURNED-FORMALS-WITH-RULE1 [GC for 6177 CONS pages..(T=16).GC finished] TYPE-SET-AND-RETURNED-FORMALS-WITH-RULE TYPE-SET-AND-RETURNED-FORMALS-WITH-RULES [GC for 6187 CONS pages..(T=16).GC finished] (TYPE-SET-AND-RETURNED-FORMALS TYPE-SET-AND-RETURNED-FORMALS-LST) TYPE-SET-AND-RETURNED-FORMALS-TOP GUESS-TYPE-PRESCRIPTION-FOR-FN-STEP *CLIQUE-STEP-INSTALL-INTERVAL* [GC for 6197 CONS pages..(T=15).GC finished] GUESS-AND-PUTPROP-TYPE-PRESCRIPTION-LST-FOR-CLIQUE-STEP (GUARDED-TERMP GUARDED-TERM-LISTP) [GC for 6197 CONS pages..(T=15).GC finished] CONJOIN-TYPE-PRESCRIPTIONS CLEANSE-TYPE-PRESCRIPTIONS [GC for 6207 CONS pages..(T=16).GC finished] GUESS-AND-PUTPROP-TYPE-PRESCRIPTION-LST-FOR-CLIQUE [GC for 1563 RELOCATABLE-BLOCKS pages..(T=16).GC finished] GET-NORMALIZED-BODIES CERT-DATA-PUTPROP-TYPE-PRESCRIPTION-LST-FOR-CLIQUE PUTPROP-TYPE-PRESCRIPTION-LST PUTPROP-LEVEL-NO-LST PRIMITIVE-RECURSIVE-ARGP [GC for 523 SFUN pages..(T=17).GC finished] PRIMITIVE-RECURSIVE-CALLP PRIMITIVE-RECURSIVE-CALLSP PRIMITIVE-RECURSIVE-MACHINEP PUTPROP-PRIMITIVE-RECURSIVE-DEFUNP-LST MAKE-CONTROLLER-POCKET MAKE-CONTROLLER-ALIST1 [GC for 523 SFUN pages..(T=16).GC finished] MAKE-CONTROLLER-ALIST MAX-NUME-EXCEEDED-ERROR PUTPROP-DEFUN-RUNIC-MAPPING-PAIRS1 PUTPROP-DEFUN-RUNIC-MAPPING-PAIRS PRINT-VERIFY-GUARDS-MSG COLLECT-IDEALS [GC for 523 SFUN pages..(T=16).GC finished] COLLECT-NON-IDEALS COLLECT-NON-COMMON-LISP-COMPLIANTS ALL-FNNAMES1-EXEC ALL-FNNAMES-EXEC COLLECT-GUARDS-AND-BODIES CHK-COMMON-LISP-COMPLIANT-SUBFUNCTIONS-CMP [GC for 523 SFUN pages..(T=16).GC finished] CHK-COMMON-LISP-COMPLIANT-SUBFUNCTIONS [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=21).GC finished] CHK-ACCEPTABLE-VERIFY-GUARDS-FORMULA-CMP CHK-ACCEPTABLE-VERIFY-GUARDS-CMP CHK-ACCEPTABLE-VERIFY-GUARDS GUARD-OBLIGATION-CLAUSES [GC for 6207 CONS pages..(T=17).GC finished] GUARD-OBLIGATION PROVE-GUARD-CLAUSES-MSG VERIFY-GUARDS-FORMULA-FN VERIFY-GUARDS-FORMULA [GC for 6217 CONS pages..(T=16).GC finished] PROVE-GUARD-CLAUSES MAYBE-REMOVE-INVARIANT-RISK [GC for 6227 CONS pages..(T=16).GC finished] VERIFY-GUARDS-FN1 VERIFY-GUARDS-FN *SUPER-DEFUN-WART-TABLE* PROJECT-OUT-COLUMNS-I-AND-J *SUPER-DEFUN-WART-BINDING-ALIST* *SUPER-DEFUN-WART-STOBJS-IN-ALIST* SUPER-DEFUN-WART-BINDINGS STORE-STOBJS-INS [GC for 6227 CONS pages..(T=16).GC finished] STORE-SUPER-DEFUN-WARTS-STOBJS-IN COLLECT-OLD-NAMEPS PUT-INVARIANT-RISK1 STOBJS-GUARD-ONLY-LST STOBJS-GUARD-ONLY [GC for 523 SFUN pages..(T=15).GC finished] REMOVE-GUARD-T PUT-INVARIANT-RISK DEFUNS-FN-SHORT-CUT PRINT-DEFUN-MSG/COLLECT-TYPE-PRESCRIPTIONS PRINT-DEFUN-MSG/TYPE-PRESCRIPTIONS1 [GC for 523 SFUN pages..(T=15).GC finished] PRINT-DEFUN-MSG/TYPE-PRESCRIPTIONS SIMPLE-SIGNATUREP ALL-SIMPLE-SIGNATURESP PRINT-DEFUN-MSG/SIGNATURES1 PRINT-DEFUN-MSG/SIGNATURES [GC for 523 SFUN pages..(T=16).GC finished] PRINT-DEFUN-MSG GET-IGNORES GET-IGNORABLES IRRELEVANT-VARS GET-IRRELEVANTS [GC for 523 SFUN pages..(T=16).GC finished] CHK-ALL-STOBJ-NAMES GET-DECLARED-STOBJ-NAMES GET-STOBJS-IN-LST CHK-STOBJS-OUT-BOUND [GC for 523 SFUN pages..(T=16).GC finished] STORE-STOBJS-OUT UNPARSE-SIGNATURE CHK-DEFUN-MODE SCAN-TO-CLTL-COMMAND *XARGS-KEYWORDS* [GC for 523 SFUN pages..(T=16).GC finished] PLAUSIBLE-DCLSP1 PLAUSIBLE-DCLSP DCL-FIELDS1 DCL-FIELDS STRIP-KEYWORD-LIST STRIP-DCLS1 [GC for 6237 CONS pages..(T=16).GC finished] STRIP-DCLS FETCH-DCL-FIELDS2 FETCH-DCL-FIELDS1 FETCH-DCL-FIELDS FETCH-DCL-FIELD SET-EQUALP-EQ [GC for 654 SYMBOL pages..(T=16).GC finished] NON-IDENTICAL-DEFP-CHK-MEASURES NON-IDENTICAL-DEFP IDENTICAL-DEFP [GC for 6247 CONS pages..(T=16).GC finished] [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=20).GC finished] REDUNDANT-OR-RECLASSIFYING-DEFUNP0 REDUNDANT-OR-RECLASSIFYING-DEFUNP REDUNDANT-OR-RECLASSIFYING-DEFUNSP10 REDUNDANT-OR-RECLASSIFYING-DEFUNSP1 RECOVER-DEFS-LST GET-CLIQUE REDUNDANT-OR-RECLASSIFYING-DEFUNSP0 STRIP-LAST-ELEMENTS [GC for 6257 CONS pages..(T=16).GC finished] REDUNDANT-OR-RECLASSIFYING-DEFUNSP COLLECT-WHEN-CADR-EQ ALL-PROGRAMP FORMAL-POSITION MAKE-POSNS (RELEVANT-POSNS-TERM RELEVANT-POSNS-TERM-LST RELEVANT-POSNS-CALL) RELEVANT-POSNS-CLIQUE1 [GC for 533 SFUN pages..(T=16).GC finished] RELEVANT-POSNS-CLIQUE-RECUR RELEVANT-POSNS-CLIQUE-INIT [GC for 1563 RELOCATABLE-BLOCKS pages..(T=16).GC finished] (RELEVANT-POSNS-LAMBDAS RELEVANT-POSNS-LAMBDAS-LST) RELEVANT-POSNS-MERGE RELEVANT-POSNS-LAMBDAS-TOP RELEVANT-POSNS-CLIQUE IRRELEVANT-NON-LAMBDA-SLOTS-CLIQUE2 IRRELEVANT-NON-LAMBDA-SLOTS-CLIQUE1 IRRELEVANT-NON-LAMBDA-SLOTS-CLIQUE TILDE-*-IRRELEVANT-FORMALS-MSG1 TILDE-*-IRRELEVANT-FORMALS-MSG [GC for 533 SFUN pages..(T=16).GC finished] MISSING-IRRELEVANT-SLOTS1 MISSING-IRRELEVANT-SLOTS FIND-SLOT BOGUS-IRRELEVANTS-ALIST2 BOGUS-IRRELEVANTS-ALIST1 BOGUS-IRRELEVANTS-ALIST TILDE-*-BOGUS-IRRELEVANTS-ALIST-MSG1 TILDE-*-BOGUS-IRRELEVANTS-ALIST-MSG CHK-IRRELEVANT-FORMALS [GC for 533 SFUN pages..(T=15).GC finished] CHK-LOGIC-SUBFUNCTIONS UNION-COLLECT-NON-X TRANSLATE-MEASURES REDUNDANT-PREDEFINED-ERROR-MSG CHK-ACCEPTABLE-DEFUNS-REDUNDANCY [GC for 6267 CONS pages..(T=16).GC finished] CHK-ACCEPTABLE-DEFUNS-VERIFY-GUARDS-ER CHK-NON-EXECUTABLEP CHK-ACCEPTABLE-DEFUNS0 GET-BOOLEAN-UNAMBIGUOUS-XARGS-FLG-LST GET-IRRELEVANTS-ALIST RAW-LAMBDA$S-TO-LAMBDAS *DEFAULT-STATE-VARS* [GC for 6277 CONS pages..(T=17).GC finished] CHK-ACCEPTABLE-LAMBDA$-TRANSLATIONS1 CHK-ACCEPTABLE-LAMBDA$-TRANSLATIONS2 CHK-ACCEPTABLE-LAMBDA$-TRANSLATIONS WEAK-LOOP$-ALIST-ENTRY-P LOOP$-ALIST-TERM *PRIMITIVE-UNTRANSLATE-ALIST* [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=20).GC finished] (LOGIC-CODE-TO-RUNNABLE-CODE LOGIC-CODE-TO-RUNNABLE-CODE-LST) AUTHENTICATE-TAGGED-LAMBDA$ MAKE-COMPILEABLE-GUARD-AND-BODY-LAMBDAS CONVERT-TAGGED-LOOP$S-TO-PAIRS CHK-ACCEPTABLE-LOOP$-TRANSLATIONS1 [GC for 6287 CONS pages..(T=16).GC finished] CHK-ACCEPTABLE-LOOP$-TRANSLATIONS2 CHK-ACCEPTABLE-LOOP$-TRANSLATIONS (STATE-GLOBALS-SET-BY STATE-GLOBALS-SET-BY-LST) [GC for 6297 CONS pages..(T=16).GC finished] (CHK-LAMBDAS-FOR-LOOP$-RECURSION1 CHK-LAMBDAS-FOR-LOOP$-RECURSION1-LST) CHK-LAMBDAS-FOR-LOOP$-RECURSION WEAK-LAMBDA-INFO-P [GC for 6307 CONS pages..(T=16).GC finished] [GC for 6317 CONS pages..(T=16).GC finished] CHK-ACCEPTABLE-DEFUNS1 [GC for 6327 CONS pages..(T=16).GC finished] CONDITIONALLY-MEMOIZED-FNS CHK-ACCEPTABLE-DEFUNS UNION-EQ1-REV COLLECT-HEREDITARILY-CONSTRAINED-FNNAMES PUTPROP-HEREDITARILY-CONSTRAINED-FNNAMES-LST [GC for 6327 CONS pages..(T=17).GC finished] DEFUNS-FN1 DEFUNS-FN0 STRIP-NON-HIDDEN-PACKAGE-NAMES [GC for 6337 CONS pages..(T=17).GC finished] IN-PACKAGE-FN DEFSTOBJ-FUNCTIONSP INDEX-OF-NON-NUMBER MAKE-UDF-INSIGS INTRO-UDF INTRO-UDF-LST1 INTRO-UDF-LST2 [GC for 533 SFUN pages..(T=17).GC finished] INTRO-UDF-LST DEFUN-CTX INSTALL-EVENT-DEFUNS DEFUNS-FN DEFUN-FN [GC for 6337 CONS pages..(T=17).GC finished] ARGS-FN ARGS MAKE-VERIFY-TERMINATION-DEF MAKE-VERIFY-TERMINATION-DEFS-LST [GC for 6337 CONS pages..(T=17).GC finished] CHK-ACCEPTABLE-VERIFY-TERMINATION1 UNIFORM-DEFUN-MODES CHK-ACCEPTABLE-VERIFY-TERMINATION VERIFY-TERMINATION1 VERIFY-TERMINATION-BOOT-STRAP-FN WHEN-LOGIC3 VERIFY-TERMINATION-FN [GC for 533 SFUN pages..(T=16).GC finished] FNS-USED-IN-AXIOMS CHECK-OUT-INSTANTIABLEP1 CHECK-OUT-INSTANTIABLEP Finished loading "defuns.lisp". ACL2 loading "proof-builder-a.lisp". "ACL2" PC-VALUE PC-ASSIGN INITIALIZE-PC-ACL2 STATE-STACK OLD-SS SS-ALIST DEFINE-GLOBAL-NAME DEFINE-GLOBAL PC-PROMPT PC-PROMPT-DEPTH-PREFIX [GC for 533 SFUN pages..(T=18).GC finished] PC-PRINT-MACROEXPANSION-FLG PC-PRINT-PROMPT-AND-INSTR-FLG [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=22).GC finished] WEAK-PC-STATE-P *PC-STATE-FIELDS-FOR-PRIMITIVES* INSTRUCTION GOALS ABBREVIATIONS LOCAL-TAG-TREE PC-ENS TAG-TREE WEAK-GOAL-P *GOAL-FIELDS* CONC HYPS CURRENT-ADDR GOAL-NAME DEPENDS-ON MAKE-OFFICIAL-PC-COMMAND INTERN-IN-KEYWORD-PACKAGE MAKE-PRETTY-PC-COMMAND MAKE-PRETTY-PC-INSTR CHANGE-PC-STATE [GC for 533 SFUN pages..(T=18).GC finished] MAKE-OFFICIAL-PC-INSTR [GC for 1563 RELOCATABLE-BLOCKS pages..(T=17).GC finished] CHECK-FORMALS-LENGTH CHECK-&OPTIONAL-AND-&REST MAKE-LET-PAIRS-FROM-FORMALS (ALL-SYMBOLS ALL-SYMBOLS-LIST) MAKE-ACCESS-BINDINGS [GC for 6337 CONS pages..(T=17).GC finished] LET-FORM-FOR-PC-STATE-VARS CHECK-FIELD-NAMES PRINT-NO-CHANGE PRINT-NO-CHANGE2 PRINT-NO-CHANGE-FN MAYBE-UPDATE-INSTRUCTION [GC for 6347 CONS pages..(T=17).GC finished] 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 [GC for 533 SFUN pages..(T=17).GC finished] INSTRUCTIONS-OF-STATE-STACK FMS0 WITH-OUTPUT-FORCED PRINT-PC-PROMPT PC-MACROEXPAND FIND-GOAL [GC for 6357 CONS pages..(T=17).GC finished] PRINT-ALL-GOALS-PROVED-MESSAGE WHEN-GOALS WHEN-GOALS-TRIP CURRENT-IMMEDIATE-DEPS GOAL-DEPENDENT-P CURRENT-ALL-DEPS MAYBE-PRINT-PROVED-GOAL-MESSAGE [GC for 533 SFUN pages..(T=17).GC finished] ACCUMULATE-TTREE-IN-PC-STATE PC-PROCESS-ASSUMPTIONS MAKE-IMPLICATION CL-SET-TO-IMPLICATIONS KNOWN-ASSUMPTIONS ADD-ASSUMPTIONS-TO-TOP-GOAL [GC for 6367 CONS pages..(T=16).GC finished] UNPROVED-GOALS MAKE-PC-ENS INITIAL-RCNST-FROM-ENS MAKE-NEW-GOALS-FIXED-HYPS [GC for 6377 CONS pages..(T=17).GC finished] [GC for 6387 CONS pages..(T=17).GC finished] [GC for 6397 CONS pages..(T=17).GC finished] PC-SINGLE-STEP-PRIMITIVE [GC for 6407 CONS pages..(T=17).GC finished] MAYBE-PRINT-MACROEXPANSION PC-SINGLE-STEP-1 UNION-LASTN-PC-TAG-TREES [GC for 6417 CONS pages..(T=17).GC finished] PC-SINGLE-STEP *PC-COMPLETE-SIGNAL* PRINT-RE-ENTERING-PROOF-BUILDER PC-MAIN-LOOP [GC for 6417 CONS pages..(T=17).GC finished] MAKE-INITIAL-GOAL INITIAL-STATE-STACK EVENT-NAME-AND-TYPES-AND-RAW-TERM INSTALL-INITIAL-STATE-STACK [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=22).GC finished] PC-MAIN1 PC-MAIN PC-TOP [GC for 533 SFUN pages..(T=17).GC finished] (ILLEGAL-FNP ILLEGAL-FNP-LIST) VERIFY-FN [GC for 6417 CONS pages..(T=17).GC finished] PRINT-UNPROVED-GOALS-MESSAGE STATE-STACK-FROM-INSTRUCTIONS STATE-FROM-INSTRUCTIONS PRINT-PC-DEFTHM PRINT-PC-GOAL PRINT-PC-STATE [GC for 6427 CONS pages..(T=18).GC finished] PROOF-BUILDER VERIFY GUARD-MSG-TABLE (SUBLIS-EXPR-NON-QUOTEPS SUBLIS-EXPR-NON-QUOTEPS-LST) INVERT-ABBREVIATIONS-ALIST [GC for 664 SYMBOL pages..(T=17).GC finished] ABBREVIATE UNTRANS0 UNTRANS0-LST-FN UNTRANS0-LST Finished loading "proof-builder-a.lisp". ACL2 loading "defthm.lisp". "ACL2" (REMOVE-LAMBDAS1 REMOVE-LAMBDAS-LST) REMOVE-LAMBDAS [GC for 533 SFUN pages..(T=18).GC finished] INTERPRET-TERM-AS-REWRITE-RULE2 INTERPRET-TERM-AS-REWRITE-RULE1 [GC for 6427 CONS pages..(T=17).GC finished] INTERPRET-TERM-AS-REWRITE-RULE (NON-RECURSIVE-FNNAMES-ALIST-REC NON-RECURSIVE-FNNAMES-ALIST-REC-LST) NON-RECURSIVE-FNNAMES-ALIST NON-RECURSIVE-FNNAMES-ALIST-LST [GC for 533 SFUN pages..(T=17).GC finished] HIDE-LAMBDAS1 HIDE-LAMBDAS VARIANTP [GC for 102 CFUN pages..(T=18).GC finished] (SURROUNDING-FNS1 SURROUNDING-FNS-LST) SURROUNDING-FNS LOOP-STOPPER1 LOOP-STOPPER [GC for 533 SFUN pages..(T=17).GC finished] REMOVE-IRRELEVANT-LOOP-STOPPER-PAIRS PUT-MATCH-FREE-VALUE FREE-VARS-IN-HYPS FREE-VARS-IN-HYPS-SIMPLE FREE-VARS-IN-FC-HYPS [GC for 533 SFUN pages..(T=17).GC finished] FREE-VARS-IN-HYPS-CONSIDERING-BIND-FREE [GC for 1563 RELOCATABLE-BLOCKS pages..(T=17).GC finished] ALL-VARS-IN-HYPS MATCH-FREE-VALUE MATCH-FREE-FC-VALUE RULE-BACKCHAIN-LIMIT-LST CREATE-REWRITE-RULE [GC for 533 SFUN pages..(T=17).GC finished] HYPS-THAT-INSTANTIATE-FREE-VARS [GC for 15872 CONTIGUOUS-BLOCKS 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 FORCED-HYPS [GC for 6437 CONS pages..(T=16).GC finished] STRIP-TOP-LEVEL-NOTS-AND-FORCES FREE-VARIABLE-ERROR? EXTEND-GENEQV-ALIST (COVERED-GENEQV-ALIST COVERED-GENEQV-ALIST-LST) UNCOVERED-EQUIVS [GC for 6447 CONS pages..(T=17).GC finished] (UNCOVERED-EQUIVS-ALIST UNCOVERED-EQUIVS-ALIST-LST) DOUBLE-REWRITE-OPPORTUNITIES SHOW-DOUBLE-REWRITE-OPPORTUNITIES1 SHOW-DOUBLE-REWRITE-OPPORTUNITIES IRRELEVANT-LOOP-STOPPER-PAIRS [GC for 6457 CONS pages..(T=16).GC finished] NON-REC-DEF-RULES-MSG-1 NON-REC-DEF-RULES-MSG [GC for 6467 CONS pages..(T=17).GC finished] CHK-REWRITE-RULE-WARNINGS CHK-ACCEPTABLE-REWRITE-RULE2 CHK-ACCEPTABLE-REWRITE-RULE1 CHK-ACCEPTABLE-REWRITE-RULE ADD-REWRITE-RULE2 ADD-REWRITE-RULE1 ADD-REWRITE-RULE EXPAND-INEQUALITY-FNCALL1 EXPAND-INEQUALITY-FNCALL [GC for 6477 CONS pages..(T=17).GC finished] ALL-VARS-IN-POLY-LST SUBBAGP-EQ ALWAYS-BIGGERP-DATA ALWAYS-BIGGERP-DATA-LST ALWAYS-BIGGERP NO-ELEMENT-ALWAYS-BIGGERP MAXIMAL-TERMS1 MAXIMAL-TERMS COLLECT-WHEN-FFNNAMESP [GC for 543 SFUN pages..(T=16).GC finished] MAKE-FREE-MAX-TERMS-MSG1 MAKE-FREE-MAX-TERMS-MSG EXTERNAL-LINEARIZE BAD-SYNP-HYP-MSG-FOR-LINEAR SHOW-DOUBLE-REWRITE-OPPORTUNITIES-LINEAR CHK-ACCEPTABLE-LINEAR-RULE2 CHK-ACCEPTABLE-LINEAR-RULE1 [GC for 6477 CONS pages..(T=16).GC finished] [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=21).GC finished] CHK-ACCEPTABLE-LINEAR-RULE ADD-LINEAR-RULE3 ADD-LINEAR-RULE2 ADD-LINEAR-RULE1 ADD-LINEAR-RULE [GC for 6487 CONS pages..(T=16).GC finished] DESTRUCTURE-WELL-FOUNDED-RELATION-RULE [GC for 6497 CONS pages..(T=16).GC finished] CHK-ACCEPTABLE-WELL-FOUNDED-RELATION-RULE ADD-WELL-FOUNDED-RELATION-RULE CHK-ACCEPTABLE-BUILT-IN-CLAUSE-RULE2 CHK-ACCEPTABLE-BUILT-IN-CLAUSE-RULE1 CHK-ACCEPTABLE-BUILT-IN-CLAUSE-RULE (FN-AND-MAXIMAL-LEVEL-NO FN-AND-MAXIMAL-LEVEL-NO-LST) [GC for 543 SFUN pages..(T=16).GC finished] BUILT-IN-CLAUSE-DISCRIMINATOR-FN ALL-FNNAMES-SUBSUMER MAKE-BUILT-IN-CLAUSE-RULES1 CHK-INITIAL-BUILT-IN-CLAUSES MAKE-BUILT-IN-CLAUSE-RULES CLASSIFY-AND-STORE-BUILT-IN-CLAUSE-RULES ADD-BUILT-IN-CLAUSE-RULE [GC for 6497 CONS pages..(T=16).GC finished] DESTRUCTURE-COMPOUND-RECOGNIZER [GC for 6507 CONS pages..(T=16).GC finished] MAKE-RECOGNIZER-TUPLE [GC for 6507 CONS pages..(T=16).GC finished] COMMENT-ON-NEW-RECOG-TUPLE1 COMMENT-ON-NEW-RECOG-TUPLE CHK-ACCEPTABLE-COMPOUND-RECOGNIZER-RULE ADD-COMPOUND-RECOGNIZER-RULE [GC for 6517 CONS pages..(T=16).GC finished] CHK-TRIGGERS DESTRUCTURE-FORWARD-CHAINING-TERM CHK-ACCEPTABLE-FORWARD-CHAINING-RULE PUTPROP-FORWARD-CHAINING-RULES-LST ADD-FORWARD-CHAINING-RULE EVALUATOR-CLAUSE/ARGLIST EVALUATOR-CLAUSE [GC for 543 SFUN pages..(T=16).GC finished] EVALUATOR-CLAUSES1 EVALUATOR-CLAUSES CDRP [GC for 1563 RELOCATABLE-BLOCKS pages..(T=17).GC finished] EXPAND-EQ-AND-ATOM-TERM-LST NORMALIZE-ALLEGED-EVALUATOR-CLAUSE NORMALIZE-ALLEGED-EVALUATOR-CLAUSE-SET SHALLOW-CLAUSIFY1 SHALLOW-CLAUSIFY [GC for 6517 CONS pages..(T=17).GC finished] FIND-EVFN-LST-IN-CLAUSE GUESS-EVFN-LST-FOR-EVFN FIND-FN-IN-CLAUSE [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=21).GC finished] GUESS-FN-ARGS-LST-FOR-EVFN NORMALIZED-EVALUATOR-CL-SET CHK-EVALUATOR NAMEDP-PREFIX DEFEVALUATOR-FORM/DEFTHM-NAME DEFEVALUATOR-FORM/DEFTHM-HINTS DEFEVALUATOR-FORM/DEFTHM [GC for 543 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 DEFEVALUATOR-CHECK-MSG DEFEVALUATOR-CHECK [GC for 543 SFUN pages..(T=20).GC finished] DEFEVALUATOR-CHECK-FORM DEFEVALUATOR TERM-TABLE TERM-TABLE REMOVE-META-EXTRACT-CONTEXTUAL-HYPS REMOVE-META-EXTRACT-GLOBAL-HYPS META-RULE-HYPOTHESIS-FUNCTIONS META-FN-ARGS [GC for 6527 CONS pages..(T=22).GC finished] CHK-META-FUNCTION EV-LST-FROM-EV ATTACHED-FNS SIBLINGS CANONICAL-SIBLING (CANONICAL-FFN-SYMBS CANONICAL-FFN-SYMBS-LST) [GC for 543 SFUN pages..(T=21).GC finished] COLLECT-CANONICAL-SIBLINGS CONSTRAINTS-LIST CONSTRAINT-INFO+ IMMEDIATE-CANONICAL-ANCESTORS CANONICAL-ANCESTORS-REC CANONICAL-ANCESTORS CANONICAL-ANCESTORS-LST [GC for 543 SFUN 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 6537 CONS pages..(T=21).GC finished] INTERPRET-TERM-AS-META-RULE [GC for 6547 CONS pages..(T=21).GC finished] CHK-ACCEPTABLE-META-RULE ADD-META-RULE1 MAYBE-PUTPROP-LST MARK-ATTACHMENT-DISALLOWED2 [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] MARK-ATTACHMENT-DISALLOWED1 MARK-ATTACHMENT-DISALLOWED ADD-META-RULE (DESTRUCTORS DESTRUCTORS-LST) STRIP-FFN-SYMBS [GC for 543 SFUN pages..(T=21).GC finished] CHK-ACCEPTABLE-ELIM-RULE1 CHK-ACCEPTABLE-ELIM-RULE ADD-ELIM-RULE1 ADD-ELIM-RULE CHK-ACCEPTABLE-GENERALIZE-RULE ADD-GENERALIZE-RULE FIND-TYPE-PRESCRIPTION-PAT [GC for 543 SFUN pages..(T=21).GC finished] TYPE-PRESCRIPTION-DISJUNCTP TYPE-PRESCRIPTION-CONCLP SUBST-NIL-INTO-TYPE-PRESCRIPTION-DISJUNCT SUBST-NIL-INTO-TYPE-PRESCRIPTION-CONCL UNPRETTYIFY-TP [GC for 6557 CONS pages..(T=22).GC finished] DESTRUCTURE-TYPE-PRESCRIPTION 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 [GC for 543 SFUN pages..(T=21).GC finished] WARNED-NON-REC-FNS-ALIST-TP-HYPS CHK-ACCEPTABLE-TYPE-PRESCRIPTION-RULE FIX-PKG FIX-INTERN$ FIX-INTERN-IN-PKG-OF-SYM PACK-TO-STRING GEN-SYM-SYM [GC for 543 SFUN pages..(T=21).GC finished] BOOLEAN-FN REFLEXIVITY SYMMETRY TRANSITIVITY EQUIVALENCE-RELATION-CONDITION FIND-CANDIDATE-EQUIVALENCE-RELATION [GC for 674 SYMBOL pages..(T=22).GC finished] COLLECT-PROBLEMATIC-PRE-EQUIVALENCE-RULE-NAMES CHK-ACCEPTABLE-EQUIVALENCE-RULE ADD-EQUIVALENCE-RULE CHK-ACCEPTABLE-REFINEMENT-RULE [GC for 6567 CONS pages..(T=21).GC finished] COLLECT-COARSENINGS PUTPROP-COARSENINGS [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] UNION-VALUES EXTEND-VALUE-SET EXTEND-EACH-VALUE-SET CLOSE-VALUE-SETS ADD-REFINEMENT-RULE CORRESPONDING-ARGS-EQ-EXCEPT [GC for 543 SFUN pages..(T=21).GC finished] [GC for 1563 RELOCATABLE-BLOCKS pages..(T=21).GC finished] (DUPLICATE-VARS-1 DUPLICATE-VARS-1-LST) DUPLICATE-VARS (REPLACE-DUPLICATE-VARS-WITH-ANONYMOUS-VAR-1 REPLACE-DUPLICATE-VARS-WITH-ANONYMOUS-VAR-1-LST) REPLACE-DUPLICATE-VARS-WITH-ANONYMOUS-VAR SPLIT-AT-POSITION [GC for 543 SFUN pages..(T=21).GC finished] MAKE-PEQUIV-PATTERN MAKE-PEQUIV (VAR-ADDRESS VAR-ADDRESS-LST) [GC for 6577 CONS pages..(T=21).GC finished] INTERPRET-TERM-AS-CONGRUENCE-RULE SOME-CONGRUENCE-RULE-SAME SOME-CONGRUENCE-RULE-HAS-REFINEMENT [GC for 6587 CONS pages..(T=21).GC finished] CHK-ACCEPTABLE-CONGRUENCE-RULE ADD-CONGRUENCE-RULE-TO-CONGRUENCE CONS-ASSOC-EQ-REC CONS-ASSOC-EQ [GC for 6597 CONS pages..(T=21).GC finished] ADD-CONGRUENCE-RULE CHK-DESTRUCTURE-DEFINITION CHK-ACCEPTABLE-DEFINITION-INSTALL-BODY CHK-ACCEPTABLE-DEFINITION-RULE [GC for 543 SFUN pages..(T=20).GC finished] CHK-ACCEPTABLE-INDUCTION-RULE ADD-INDUCTION-RULE CHK-ACCEPTABLE-TYPE-SET-INVERTER-RULE ADD-TYPE-SET-INVERTER-RULE TILDE-@-ILLEGAL-CLAUSE-PROCESSOR-SIG-MSG [GC for 543 SFUN pages..(T=21).GC finished] DESTRUCTURE-CLAUSE-PROCESSOR-RULE CHK-ACCEPTABLE-CLAUSE-PROCESSOR-RULE ADD-CLAUSE-PROCESSOR-RULE [GC for 6607 CONS pages..(T=21).GC finished] TRUSTED-CL-PROC-TABLE-GUARD TRUSTED-CL-PROC-TABLE DEFINE-TRUSTED-CLAUSE-PROCESSOR PRIMITIVE-INSTRUCTIONP NON-PRIMITIVE-INSTRUCTIONS [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=25).GC finished] CHK-PRIMITIVE-INSTRUCTION-LISTP TRANSLATE-INSTRUCTIONS CONTROLLER-ALISTP ALIST-TO-KEYWORD-ALIST [GC for 543 SFUN pages..(T=21).GC finished] ELIMINATE-MACRO-ALIASES FIX-LOOP-STOPPER-ALIST GUESS-CONTROLLER-ALIST-FOR-DEFINITION-RULE CHK-LEGAL-LINEAR-TRIGGER-TERMS1 CHK-LEGAL-LINEAR-TRIGGER-TERMS [GC for 543 SFUN pages..(T=21).GC finished] BACKCHAIN-LIMIT-LISTP RECOVER-METAFUNCTION-OR-CLAUSE-PROCESSOR-SIGNATURES EQUAL-EXCEPT-ON-NON-STOBJS ARITY-ALISTP COMPATIBLE-ARITY-ALISTSP COLLECT-DISAGREEING-ARITY-ASSUMPTIONS [GC for 6617 CONS pages..(T=21).GC finished] [GC for 6627 CONS pages..(T=21).GC finished] [GC for 6637 CONS pages..(T=22).GC finished] [GC for 6647 CONS pages..(T=22).GC finished] INTERPRET-TERM-AS-WELL-FORMEDNESS-GUARANTEE-THM [GC for 6657 CONS pages..(T=21).GC finished] TRANSLATE-WELL-FORMEDNESS-GUARANTEE [GC for 6657 CONS pages..(T=21).GC finished] [GC for 6667 CONS pages..(T=21).GC finished] [GC for 6667 CONS pages..(T=21).GC finished] TRANSLATE-RULE-CLASS-ALIST [GC for 6677 CONS pages..(T=21).GC finished] TRANSLATE-RULE-CLASS1 REASON-FOR-NON-KEYWORD-VALUE-LISTP TRANSLATE-RULE-CLASS TRANSLATE-RULE-CLASSES1 TRANSLATE-RULE-CLASSES CHK-ACCEPTABLE-X-RULE CHK-ACCEPTABLE-X-RULES [GC for 553 SFUN pages..(T=21).GC finished] COLLECT-KEYS-EQ CHK-ACCEPTABLE-RULES ADD-X-RULE ADD-RULES1 TRUNCATE-CLASS-ALIST TRUNCATE-CLASSES MAKE-RUNES1 MAKE-RUNES [GC for 553 SFUN pages..(T=21).GC finished] MAKE-RUNIC-MAPPING-PAIRS ADD-RULES REDUNDANT-THEOREMP NON-TAUTOLOGICAL-CLASSES [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] [GC for 1563 RELOCATABLE-BLOCKS pages..(T=21).GC finished] PROVE-COROLLARIES1 PROVE-COROLLARIES ENABLED-RUNEP-STRING UNTRANSLATE-HYPS [GC for 6677 CONS pages..(T=21).GC finished] INFO-FOR-LEMMAS ASSOC-EQ-EQ INFO-FOR-WELL-FOUNDED-RELATION-RULES INFO-FOR-BUILT-IN-CLAUSE-RULES1 INFO-FOR-BUILT-IN-CLAUSE-RULES INFO-FOR-COMPOUND-RECOGNIZER-RULES INFO-FOR-GENERALIZE-RULES [GC for 6677 CONS pages..(T=22).GC finished] INFO-FOR-LINEAR-LEMMAS INFO-FOR-ELIMINATE-DESTRUCTORS-RULE INFO-FOR-CONGRUENCES INFO-FOR-PEQUIVS INFO-FOR-COARSENINGS INFO-FOR-FORWARD-CHAINING-RULES [GC for 6677 CONS pages..(T=22).GC finished] DECODE-TYPE-SET-LST INFO-FOR-TYPE-PRESCRIPTIONS INFO-FOR-INDUCTION-RULES INFO-FOR-TYPE-SET-INVERTER-RULES INFO-FOR-X-RULES [GC for 6677 CONS pages..(T=21).GC finished] INFO-FOR-RULES PRINT-INFO-FOR-RULES-ENTRY PRINT-INFO-FOR-RULES PR-BODY PR-FN PRINT-CLAUSE-PROCESSOR-RULES1 PRINT-CLAUSE-PROCESSOR-RULES NEW-NUMES WORLD-TO-NEXT-COMMAND [GC for 553 SFUN pages..(T=21).GC finished] PR!-FN PR PR! DISABLEDP-FN-LST DISABLEDP-FN DISABLEDP COLLECT-ABBREVIATION-SUBCLASS [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] RUNES-TO-MONITOR1 *MONITORABLE-RUNE-TYPES* MONITORABLE-RUNES MONITORABLE-RUNES-FROM-MAPPING-PAIRS RUNES-TO-MONITOR REMOVE1-ASSOC-EQUAL? REMOVE1-ASSOC-EQUAL?-LST MONITOR1 REMOVE1-ASSOC-EQUAL-LST [GC for 553 SFUN pages..(T=22).GC finished] SET-DIFFERENCE-ASSOC-EQUAL UNMONITOR1 MONITOR-FN [GC for 6677 CONS pages..(T=22).GC finished] UNMONITOR-FN MONITORED-RUNES-FN BRR-FN BRR BRR@ MONITOR UNMONITOR MONITORED-RUNES PROCEED-FROM-BRKPT1 [GC for 6687 CONS pages..(T=21).GC finished] EXIT-BRR OK-IF-FN OK-IF PRINT-RULE-STORAGE-DEPENDENCIES DEFAXIOM-SUPPORTERS [GC for 6697 CONS pages..(T=21).GC finished] DEFAXIOM-FN WARN-ON-INAPPROPRIATE-DEFUN-MODE WITH-WATERFALL-PARALLELISM-TIMINGS TRANSLATE-FOR-DEFTHM [GC for 6707 CONS pages..(T=22).GC finished] [GC for 6717 CONS pages..(T=21).GC finished] DEFTHM-FN1 DEFTHM-FN [GC for 6717 CONS pages..(T=21).GC finished] THM-FN THM CHK-EXTENSIBLE-RULE-CLASSES EXTEND-RULE-CLASSES *DEFEQUIV-PACKAGE-VALUES* DEFEQUIV-FORM [GC for 6717 CONS pages..(T=21).GC finished] DEFEQUIV-FN DEFEQUIV *DEFREFINEMENT-PACKAGE-VALUES* DEFREFINEMENT-FORM DEFREFINEMENT-FN DEFREFINEMENT *DEFCONG-PACKAGE-VALUES* DEFCONG-FORM [GC for 6727 CONS pages..(T=23).GC finished] DEFCONG-FN DEFCONG Finished loading "defthm.lisp". ACL2 loading "other-events.lisp". "ACL2" MACRO-VARS-KEY [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] MACRO-VARS-AFTER-REST MACRO-VARS-OPTIONAL MACRO-VARS CHK-LEGAL-DEFCONST-NAME DEFCONST-FN1 WEAK-HCOMP-BOOK-HT-ENTRY-P [GC for 553 SFUN pages..(T=22).GC finished] DEFCONST-VAL LARGE-CONSP DEFCONST-FN CHK-LEGAL-INIT-MSG CHK-LEGAL-INIT [GC for 6737 CONS pages..(T=21).GC finished] CHK-MACRO-ARGLIST-KEYS CHK-MACRO-ARGLIST-AFTER-REST CHK-MACRO-ARGLIST-OPTIONAL CHK-MACRO-ARGLIST1 CHK-MACRO-ARGLIST-MSG [GC for 553 SFUN pages..(T=21).GC finished] CHK-MACRO-ARGLIST DEFMACRO-FN1 CHK-DEFMACRO-WIDTH REDUNDANT-DEFMACROP [GC for 1563 RELOCATABLE-BLOCKS pages..(T=22).GC finished] COLLECT-NON-APPLY$-PRIMPS2 (COLLECT-NON-APPLY$-PRIMPS1 COLLECT-NON-APPLY$-PRIMPS1-LST) COLLECT-NON-APPLY$-PRIMPS CHK-DEFMACRO-UNTOUCHABLE [GC for 6747 CONS pages..(T=22).GC finished] DEFMACRO-FN *INITIAL-EVENT-DEFMACROS* BOOT-TRANSLATE PRIMORDIAL-EVENT-MACRO-AND-FN1 [GC for 6757 CONS pages..(T=22).GC finished] PRIMORDIAL-EVENT-MACRO-AND-FN PRIMORDIAL-EVENT-MACROS-AND-FNS *INITIAL-TYPE-PRESCRIPTIONS* COLLECT-WORLD-GLOBALS *BOOT-STRAP-INVARIANT-RISK-SYMBOLS* PRIMORDIAL-WORLD-GLOBALS [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] ARGLISTS-TO-NILS *UNATTACHABLE-PRIMITIVES* INITIALIZE-INVARIANT-RISK PUTPROP-RECOGNIZER-ALIST PRIMORDIAL-WORLD SAME-NAME-TWICE CONFLICTING-IMPORTS [GC for 553 SFUN pages..(T=21).GC finished] 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 684 SYMBOL pages..(T=22).GC finished] CHK-ACCEPTABLE-DEFPKG DEFPKG-FN THEORY-FN-CALLP [GC for 6767 CONS pages..(T=22).GC finished] INTERSECTION-AUGMENTED-THEORIES-FN1 CHECK-THEORY-MSG1 CHECK-THEORY-MSG CHECK-THEORY-ACTION CHECK-THEORY MAYBE-CHECK-THEORY INTERSECTION-THEORIES-FN INTERSECTION-THEORIES UNION-AUGMENTED-THEORIES-FN1 [GC for 553 SFUN pages..(T=21).GC finished] UNION-THEORIES-FN1 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 [GC for 553 SFUN pages..(T=21).GC finished] NO-AUGMENTED-RUNE-BASED-ON REVAPPEND-DELETE-AUGMENTED-RUNES-BASED-ON-SYMBOLS1 REVAPPEND-DELETE-AUGMENTED-RUNES-BASED-ON-SYMBOLS [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] CURRENT-THEORY-FN CURRENT-THEORY1-AUGMENTED UNION-CURRENT-THEORY-FN UNION-THEORIES SET-DIFFERENCE-CURRENT-THEORY-FN SET-DIFFERENCE-THEORIES UNIVERSAL-THEORY-FN1 UNIVERSAL-THEORY-FN [GC for 553 SFUN pages..(T=22).GC finished] UNIVERSAL-THEORY FUNCTION-THEORY-FN1 FUNCTION-THEORY-FN FUNCTION-THEORY EXECUTABLE-COUNTERPART-THEORY-FN EXECUTABLE-COUNTERPART-THEORY STANDARD-THEORIES CURRENT-THEORY END-PREHISTORIC-WORLD [GC for 553 SFUN pages..(T=22).GC finished] THEORY-NAMEP THEORY-FN THEORY REDUNDANT-DEFTHEORY-P DEFTHEORY-FN :REDUNDANT SET-IN-THEORY-REDUNDANT-OKP [GC for 6777 CONS pages..(T=23).GC finished] IN-THEORY-FN IN-ARITHMETIC-THEORY-FN DISABLE ENABLE THEORY-INVARIANT-TABLE [GC for 6787 CONS pages..(T=23).GC finished] [GC for 6797 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 553 SFUN pages..(T=22).GC finished] FORMALS-PRETTY-FLAGS-MISMATCH-MSG [GC for 6807 CONS pages..(T=22).GC finished] CHK-SIGNATURE CHK-SIGNATURES [GC for 553 SFUN pages..(T=22).GC finished] CHK-ACCEPTABLE-ENCAPSULATE1 NAME-INTRODUCED CHK-EMBEDDED-EVENT-FORM-ORIG-FORM-MSG *ACL2-DEFAULTS-TABLE-MACROS* [GC for 6817 CONS pages..(T=22).GC finished] CHK-EMBEDDED-EVENT-FORM DESTRUCTURE-EXPANSION REBUILD-EXPANSION [GC for 553 SFUN pages..(T=22).GC finished] SET-RAW-MODE-ON [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] SET-RAW-MODE-OFF SET-RAW-MODE-ON! SET-RAW-MODE ADD-RAW-ARITY REMOVE-RAW-ARITY ALIST-TO-BINDINGS ACL2-RAW-EVAL GET-AND-CHK-LAST-MAKE-EVENT-EXPANSION *LOCAL-VALUE-TRIPLE-ELIDED* ELIDE-LOCALS [GC for 553 SFUN pages..(T=23).GC finished] (ELIDE-LOCALS-REC ELIDE-LOCALS-LST) MAKE-RECORD-EXPANSION? ACL2-SYSTEM-TABLE MAYBE-ADD-EVENT-LANDMARK [GC for 6827 CONS pages..(T=22).GC finished] [GC for 1563 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 UNION-EQ-CARS [GC for 6837 CONS pages..(T=22).GC finished] CHK-ACCEPTABLE-ENCAPSULATE2 CONJOIN-INTO-ALIST CLASSES-THEOREMS CONSTRAINTS-INTRODUCED1 NEW-TRIPS-REC NEW-TRIPS CONSTRAINTS-INTRODUCED PUTPROP-CONSTRAINTS MAYBE-INSTALL-ACL2-DEFAULTS-TABLE [GC for 563 SFUN pages..(T=21).GC finished] UPDATE-FOR-REDO-FLAT REDO-FLAT CERT-OP EVAL-EVENT-LST-ENVIRONMENT [GC for 6847 CONS pages..(T=22).GC finished] PROCESS-EMBEDDED-EVENTS [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] CONSTRAINED-FUNCTIONS COLLECT-LOGICALS EXPORTED-FUNCTION-NAMES GET-SUBVERSIVES ANCESTRAL-FFN-SYMBS-LST ENCAPSULATE-CONSTRAINT BOGUS-EXPORTED-COMPLIANTS REMOVE-TYPE-PRESCRIPTION-CERT-DATA [GC for 6857 CONS pages..(T=22).GC finished] ENCAPSULATE-PASS-2 TILDE-@-ABBREVIATE-OBJECT-PHRASE ENCAPSULATE-CTX PRINT-ENCAPSULATE-MSG1 [GC for 6867 CONS pages..(T=22).GC finished] PRINT-ENCAPSULATE-MSG2 PRINT-ENCAPSULATE-MSG3/EXPORTED-NAMES PRINT-ENCAPSULATE-MSG3/CONSTRAINTS PRINT-ENCAPSULATE-MSG3 [GC for 6867 CONS pages..(T=22).GC finished] (FIND-FIRST-NON-LOCAL-NAME FIND-FIRST-NON-LOCAL-NAME-LST) EQUAL-MOD-ELIDE-LOCALS1 (EQUAL-MOD-ELIDE-LOCALS EQUAL-MOD-ELIDE-LOCALS-LST) CORRESPONDING-ENCAP-EVENTS CORRESPONDING-ENCAPS [GC for 6877 CONS pages..(T=22).GC finished] REDUNDANT-ENCAPSULATE-TUPLEP REDUNDANT-ENCAPSULATEP MARK-MISSING-AS-HIDDEN-P [GC for 6877 CONS pages..(T=23).GC finished] [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] KNOWN-PACKAGE-ALIST-INCLUDED-P ENCAPSULATE-FIX-KNOWN-PACKAGE-ALIST SUBST-BY-POSITION1 SUBST-BY-POSITION INTRO-UDF-GUARDS INTRO-UDF-NON-CLASSICALP ASSOC-PROOF-SUPPORTERS-ALIST UPDATE-PROOF-SUPPORTERS-ALIST-3 POSN-FIRST-NON-EVENT [GC for 563 SFUN pages..(T=22).GC finished] UPDATE-PROOF-SUPPORTERS-ALIST-2 UPDATE-PROOF-SUPPORTERS-ALIST-1 UPDATE-PROOF-SUPPORTERS-ALIST INSTALL-PROOF-SUPPORTERS-ALIST EMPTY-ENCAPSULATE CERT-DATA-TP-FROM-RUNIC-TYPE-PRESCRIPTION CERT-DATA-TPS-FROM-FNS CERT-DATA-FOR-CERTIFICATE NEWLY-DEFINED-TOP-LEVEL-FNS-REC [GC for 563 SFUN pages..(T=22).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 6877 CONS pages..(T=22).GC finished] [GC for 6887 CONS pages..(T=22).GC finished] ENCAPSULATE-FN [GC for 6897 CONS pages..(T=22).GC finished] PROGN-FN1 [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] PROGN-FN PROGN!-FN CHK-BOOK-NAME INCLUDE-BOOK-ALIST-SUBSETP CBD-FN CBD GET-PORTCULLIS-CMDS OUR-MERGE-PATHNAMES [GC for 563 SFUN pages..(T=22).GC finished] EXPAND-TILDE-TO-USER-HOME-DIR T CANONICAL-DIRNAME! DIRECTORY-OF-ABSOLUTE-PATHNAME EXTEND-PATHNAME MAYBE-ADD-SEPARATOR SET-CBD-FN SET-CBD SET-CBD-STATE [GC for 563 SFUN pages..(T=22).GC finished] PARSE-BOOK-NAME SYSFILE-P [GC for 1563 RELOCATABLE-BLOCKS pages..(T=21).GC finished] SYSFILE-FILENAME FILENAME-TO-SYSFILE SYSFILE-TO-FILENAME (MAKE-INCLUDE-BOOKS-ABSOLUTE-1 MAKE-INCLUDE-BOOKS-ABSOLUTE-LST) MAKE-INCLUDE-BOOKS-ABSOLUTE [GC for 563 SFUN pages..(T=22).GC finished] FIRST-KNOWN-PACKAGE-ALIST DEFPKG-ITEMS-REC NEW-DEFPKG-P [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] DEFPKG-ITEMS NEW-DEFPKG-LIST2 MAKE-HIDDEN-DEFPKG NEW-DEFPKG-LIST1 NEW-DEFPKG-LIST (TERM-IGNORE-OKP TERM-LIST-IGNORE-OKP) [GC for 563 SFUN pages..(T=22).GC finished] HIDDEN-DEFPKG-EVENTS1 HIDDEN-DEFPKG-EVENTS FIX-PORTCULLIS-CMDS1 FIX-PORTCULLIS-CMDS COLLECT-UNCERTIFIED-BOOKS CHK-IN-PACKAGE ILL-FORMED-CERTIFICATE-ER [GC for 6907 CONS pages..(T=22).GC finished] INCLUDE-BOOK-ER-WARNING-SUMMARY INCLUDE-BOOK-ER1 INCLUDE-BOOK-ER POST-ALIST-FROM-CHANNEL CERTIFICATE-FILE-AND-INPUT-CHANNEL1 PCERT-OP-P CERTIFICATE-FILE-AND-INPUT-CHANNEL [GC for 563 SFUN pages..(T=21).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 15872 CONTIGUOUS-BLOCKS pages..(T=28).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 6917 CONS pages..(T=23).GC finished] CHK-RAISE-PORTCULLIS1 MARK-LOCAL-INCLUDED-BOOKS UNMARK-AND-DELETE-LOCAL-INCLUDED-BOOKS EARLIER-ACL2-VERSIONP ACL2-VERSION-R-P [GC for 694 SYMBOL pages..(T=22).GC finished] SYSFILE-OR-STRING-LISTP TTAG-ALISTP CERT-ANNOTATIONSP WEAK-CERT-OBJ-P *TRIVIAL-BOOK-HASH* CERT-HASH [GC for 563 SFUN pages..(T=23).GC finished] INCLUDE-BOOK-ALIST-ENTRY-P SYSFILE-TO-FILENAME-TTAG-ALIST-VAL SYSFILE-TO-FILENAME-TTAG-ALISTP SYSFILE-TO-FILENAME-CERT-ANNOTATIONS SYSFILE-TO-FILENAME-INCLUDE-BOOK-ENTRY SYSFILE-TO-FILENAME-INCLUDE-BOOK-ALIST1 [GC for 563 SFUN pages..(T=22).GC finished] SYSFILE-TO-FILENAME-INCLUDE-BOOK-ALIST FILENAME-TO-SYSFILE-TTAG-ALIST-VAL [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] FILENAME-TO-SYSFILE-TTAG-ALISTP FILENAME-TO-SYSFILE-CERT-ANNOTATIONS FILENAME-TO-SYSFILE-INCLUDE-BOOK-ENTRY FILENAME-TO-SYSFILE-INCLUDE-BOOK-ALIST1 FILENAME-TO-SYSFILE-INCLUDE-BOOK-ALIST KEYWORD-LISTP [GC for 563 SFUN pages..(T=23).GC finished] READ-FILE-INTO-TEMPLATE FAST-CERT-DATA CHK-RAISE-PORTCULLIS [GC for 6927 CONS pages..(T=22).GC finished] CHK-CERTIFICATE-FILE1 CERTIFICATE-FILE [GC for 6937 CONS pages..(T=23).GC finished] CHK-CERTIFICATE-FILE EQUAL-MODULO-HIDDEN-DEFPKGS CERT-OBJ-FOR-CONVERT CHK-ACCEPTABLE-CERTIFY-BOOK1 TRANSLATE-BOOK-NAMES FIX-TTAGS [GC for 6947 CONS pages..(T=22).GC finished] CHK-WELL-FORMED-TTAGS CHECK-CERTIFICATE-FILE-EXISTS CHK-ACCEPTABLE-CERTIFY-BOOK PRINT-OBJECTS REPLACE-INITIAL-SUBSTRING [GC for 563 SFUN pages..(T=22).GC finished] [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] REPLACE-STRING-PREFIX-IN-TREE WITH-OUTPUT-OBJECT-CHANNEL-SHARING ELIDE-LOCALS-AND-SPLIT-EXPANSION-ALIST [GC for 6957 CONS pages..(T=23).GC finished] MAKE-CERTIFICATE-FILE1 MAKE-CERTIFICATE-FILE MAKE-CERTIFICATE-FILES OPEN-INPUT-OBJECT-FILE [GC for 563 SFUN pages..(T=22).GC finished] READ-OBJECT-FILE1 READ-OBJECT-FILE CHK-CERT-ANNOTATIONS [GC for 1563 RELOCATABLE-BLOCKS pages..(T=22).GC finished] CHK-CERT-ANNOTATIONS-POST-ALIST CHK-INPUT-OBJECT-FILE INCLUDE-BOOK-DIR INCLUDE-BOOK-DIR-WITH-CHK ACCUMULATE-POST-ALIST [GC for 563 SFUN pages..(T=23).GC finished] 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 563 SFUN pages..(T=22).GC finished] CONVERT-BOOK-NAME-TO-ACL2X-NAME ACL2X-ALISTP [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] READ-ACL2X-FILE [GC for 6967 CONS pages..(T=22).GC finished] EVAL-PORT-FILE GETENV! UPDATE-PCERT-BOOKS CONVERT-NON-NIL-SYMBOLS-TO-KEYWORDS [GC for 6977 CONS pages..(T=22).GC finished] [GC for 6987 CONS pages..(T=23).GC finished] [GC for 6997 CONS pages..(T=22).GC finished] INCLUDE-BOOK-FN1 CHK-INCLUDE-BOOK-INPUTS [GC for 7007 CONS pages..(T=23).GC finished] INCLUDE-BOOK-FN SPONTANEOUS-DECERTIFICATIONP1 SPONTANEOUS-DECERTIFICATIONP REMOVE-DUPLICATES-EQUAL-FROM-END INCLUDE-BOOK-ALIST-SUBSETP-FAILURE-WITNESSES [GC for 563 SFUN pages..(T=23).GC finished] EXPANSION-FILENAME TOP-LEVEL-LOOP$-ALIST-REC TOP-LEVEL-LOOP$-ALIST [GC for 112 CFUN pages..(T=22).GC finished] WRITE-EXPANSION-FILE COLLECT-IDEAL-USER-DEFUNS1 COLLECT-IDEAL-USER-DEFUNS SET-DIFFERENCE-EQ-SORTED PKG-NAMES0 [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] HONS-UNION-ORDERED-STRING-LISTS PKG-NAMES-MEMOIZE PKG-NAMES DELETE-NAMES-FROM-KPA-REC DELETE-NAMES-FROM-KPA PRINT-CERTIFY-BOOK-STEP-2 PRINT-CERTIFY-BOOK-STEP-3 PRINT-CERTIFY-BOOK-GUARDS-WARNING [GC for 7017 CONS pages..(T=22).GC finished] CHK-CERTIFY-BOOK-STEP-3 PRINT-CERTIFY-BOOK-STEP-4 PRINT-CERTIFY-BOOK-STEP-5 HCOMP-BUILD-FROM-STATE T HONS-COPY-WITH-STATE IDENTITY-WITH-STATE :ATTACHMENTS-RECORDED [GC for 7017 CONS pages..(T=22).GC finished] WRITE-ACL2X-FILE [GC for 7027 CONS pages..(T=24).GC finished] MERGE-INTO-EXPANSION-ALIST1 ACL2X-ALISTP-DOMAINS-SUBSETP MERGE-INTO-EXPANSION-ALIST [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] RESTRICT-EXPANSION-ALIST ELIDE-LOCALS-FROM-EXPANSION-ALIST [GC for 7027 CONS pages..(T=23).GC finished] WRITE-PORT-FILE SAVE-PARALLELISM-SETTINGS INCLUDE-BOOK-ALIST-EQUAL-MODULO-LOCAL COPY-OBJECT-CHANNEL-UNTIL-MARKER [GC for 7037 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 COUNT-FORMS-IN-CHANNEL SKIP-FORMS-IN-CHANNEL POST-ALIST-FROM-PCERT1-1 [GC for 7047 CONS pages..(T=23).GC finished] POST-ALIST-FROM-PCERT1 CERTIFICATE-POST-ALIST CERTIFY-BOOK-FINISH-COMPLETE EXPANSION-ALIST-CONFLICT CHK-ABSSTOBJ-INVARIANTS SYMBOL-PACKAGE-NAME-SET [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] NAMES-OF-SYMBOLS-IN-PACKAGE SYMBOL-LIST-TO-PACKAGE-ALIST1 SYMBOL-LIST-TO-PACKAGE-ALIST BOOKDATA-ALIST1 BOOKDATA-ALIST MAYBE-WRITE-BOOKDATA FROMTO REMOVE-SMALLER-KEYS-FROM-SORTED-ALIST [GC for 573 SFUN pages..(T=23).GC finished] CERT-INCLUDE-EXPANSION-ALIST [GC for 7047 CONS pages..(T=23).GC finished] [GC for 7057 CONS pages..(T=22).GC finished] [GC for 7067 CONS pages..(T=23).GC finished] [GC for 7077 CONS pages..(T=23).GC finished] [GC for 7087 CONS pages..(T=22).GC finished] [GC for 7097 CONS pages..(T=22).GC finished] [GC for 7107 CONS pages..(T=22).GC finished] CERTIFY-BOOK-FN CERTIFY-BOOK CERTIFY-BOOK! REDUNDANT-DEFCHOOSEP CHK-ARGLIST-FOR-DEFCHOOSE WITHOUT-WARNINGS-FN WITHOUT-WARNINGS TRANSLATE-IGNORE-OK TRANSLATE-WITHOUT-WARNINGS-IGNORE-OK DEFCHOOSE-CONSTRAINT-BASIC [GC for 7117 CONS pages..(T=23).GC finished] GENERATE-VARIABLE-LST-SIMPLE DEFCHOOSE-CONSTRAINT-EXTRA DEFCHOOSE-CONSTRAINT [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] DEFCHOOSE-FN *DEFUN-SK-KEYWORDS* NON-ACCEPTABLE-DEFUN-SK-P [GC for 1563 RELOCATABLE-BLOCKS pages..(T=23).GC finished] DEFINITION-RULE-NAME VERIFY-GUARDS? PARSE-DEFUN-SK-DCLS DEFUN-SK-FN DEFUN-SK DOUBLET-STYLE-SYMBOL-TO-SYMBOL-ALISTP CHK-LEGAL-DEFSTOBJ-NAME [GC for 573 SFUN pages..(T=22).GC finished] CHK-UNRESTRICTED-GUARDS-FOR-USER-FNS CHK-STOBJ-FIELD-DESCRIPTOR [GC for 7117 CONS pages..(T=22).GC finished] CHK-ACCEPTABLE-DEFSTOBJ-RENAMING CHK-ACCEPTABLE-DEFSTOBJ1 DEFSTOBJ-REDUNDANCY-BUNDLE OLD-DEFSTOBJ-REDUNDANCY-BUNDLE [GC for 7117 CONS pages..(T=23).GC finished] REDUNDANT-DEFSTOBJP CONGRUENT-STOBJ-FIELDS CHK-ACCEPTABLE-DEFSTOBJ [GC for 7117 CONS pages..(T=23).GC finished] DEFSTOBJ-FIELD-FNS-AXIOMATIC-DEFS [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] DEFSTOBJ-AXIOMATIC-INIT-FIELDS DEFSTOBJ-CREATOR-FN DEFSTOBJ-AXIOMATIC-DEFS PUT-STOBJS-IN-AND-OUTS1 PUT-STOBJS-IN-AND-OUTS DEFCONST-NAME-ALIST [GC for 573 SFUN pages..(T=23).GC finished] ACCESSOR-ARRAY PUT-DEFSTOBJ-INVARIANT-RISK DEFSTOBJ-FN DEFABSSTOBJ CONCRETE-STOBJ DEFABSSTOBJ-MISSING-EVENTS REDUNDANT-DEFABSSTOBJP ABSSTOBJ-CORRESPONDENCE-CONCL-LST [GC for 7117 CONS pages..(T=23).GC finished] FLATTEN-ANDS-IN-LIT! ABSSTOBJ-CORRESPONDENCE-FORMULA ABSSTOBJ-PRESERVED-FORMULA WEAK-ABSSTOBJ-METHOD-P [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] (FN-STOBJ-UPDATES-P STOBJ-UPDATES-P STOBJ-UPDATES-LISTP) UNPROTECTED-EXPORT-P [GC for 704 SYMBOL pages..(T=23).GC finished] [GC for 7117 CONS pages..(T=23).GC finished] TRANSLATE-ABSSTOBJ-FIELD SIMPLE-TRANSLATE-ABSSTOBJ-FIELDS ONE-WAY-UNIFY-P OBVIOUSLY-EQUAL-LAMBDA-ARGS [GC for 573 SFUN pages..(T=23).GC finished] (OBVIOUSLY-EQUIV-TERMS OBVIOUSLY-EQUIV-TERMS-LST) OBVIOUSLY-IFF-EQUIV-TERMS CHK-DEFABSSTOBJ-METHOD-LEMMAS CHK-DEFABSSTOBJ-METHOD [GC for 7127 CONS pages..(T=22).GC finished] CHK-ACCEPTABLE-DEFABSSTOBJ1 FIRST-KEYWORD [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] CHK-ACCEPTABLE-DEFABSSTOBJ DEFABSSTOBJ-AXIOMATIC-DEFS [GC for 7137 CONS pages..(T=22).GC finished] [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] DEFABSSTOBJ-RAW-DEF DEFABSSTOBJ-RAW-DEFS-REC DEFABSSTOBJ-RAW-DEFS EXPAND-RECOGNIZER PUT-ABSSTOBJS-IN-AND-OUTS METHOD-EXEC [GC for 573 SFUN pages..(T=23).GC finished] DEFABSSTOBJ-RAW-INIT DEFABSSTOBJ-MISSING-MSG UPDATE-GUARD-POST DEFABSSTOBJ-LOGIC-SUBST CHK-DEFABSSTOBJ-GUARD CHK-DEFABSSTOBJ-GUARDS1 [GC for 573 SFUN pages..(T=23).GC finished] CHK-DEFABSSTOBJ-GUARDS MAKE-ABSSTOBJ-LOGIC-EXEC-PAIRS PUT-DEFABSSTOBJ-INVARIANT-RISK [GC for 7147 CONS pages..(T=23).GC finished] DEFABSSTOBJ-FN1 DEFABSSTOBJ-FN CREATE-STATE WITH-LOCAL-STATE STOBJ-LET COLLECT-BADGED-FNS [GC for 7157 CONS pages..(T=23).GC finished] COLLECT-MACROS PUSH-UNTOUCHABLE-FN REMOVE-UNTOUCHABLE-FN DEF-BODY-LEMMAS SHOW-BODIES SET-BODY-FN1 [GC for 7167 CONS pages..(T=23).GC finished] SET-BODY-FN TRACE-MULTIPLICITY *1*DEFP TRACE$-ER-MSG [GC for 1563 RELOCATABLE-BLOCKS pages..(T=23).GC finished] DECLS-AND-DOC [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] TRACE$-WHEN-GCOND STOBJ-EVISCERATION-ALIST TRACE-EVISCERATION-ALIST SET-TRACE-EVISC-TUPLE CHK-TRACE-OPTIONS-AUX [GC for 573 SFUN pages..(T=23).GC finished] TRACE$-VALUE-MSGP CHK-TRACE-OPTIONS MEMOIZE-OFF-TRACE-ERROR UNTRACE$-FN1 [GC for 573 SFUN pages..(T=23).GC finished] UNTRACE$-REC UNTRACE$-FN MAYBE-UNTRACE$-FN MAYBE-UNTRACE$ TRACE$-FN-GENERAL TRACE$-FN-SIMPLE *TRACE-KEYWORDS* *TRACE-KEYWORDS-NEEDING-TTAG* [GC for 573 SFUN pages..(T=23).GC finished] FIRST-ASSOC-KEYWORD *ILLEGAL-TRACE-SPEC-FMT-STRING* TRACE$-FN TRACE$-LST TRACE$ WITH-UBT! TRACE! UNTRACE$ OPEN-TRACE-FILE-FN OPEN-TRACE-FILE [GC for 573 SFUN pages..(T=23).GC finished] CLOSE-TRACE-FILE-FN CLOSE-TRACE-FILE BREAK-ON-ERROR DEFEXEC-EXTRACT-KEY PARSE-DEFEXEC-DCLS-1 FIX-EXEC-XARGS PARSE-DEFEXEC-DCLS [GC for 7177 CONS pages..(T=23).GC finished] DEFEXEC WEAK-SAR-P APPLICABLE-REWRITE-RULES1 APPLICABLE-LINEAR-RULES1 [GC for 7187 CONS pages..(T=23).GC finished] PC-RELIEVE-HYP [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] (PC-RELIEVE-HYPS1-ITER PC-RELIEVE-HYPS1) PC-RELIEVE-HYPS REMOVE-TRIVIAL-LITS UNRELIEVED-HYPS [GC for 573 SFUN pages..(T=22).GC finished] UNTRANSLATE-SUBST-ABB SHOW-REWRITE-LINEAR [GC for 7197 CONS pages..(T=23).GC finished] SHOW-REWRITES-LINEARS EXPAND-ASSUMPTIONS-1 EXPAND-ASSUMPTIONS HYPS-TYPE-ALIST [GC for 7207 CONS pages..(T=22).GC finished] SHOW-REWRITES-LINEARS-FN SHOW-META-LEMMAS1 SHOW-META-LEMMAS DECODED-TYPE-SET-FROM-TP-RULE [GC for 7217 CONS pages..(T=23).GC finished] SHOW-TYPE-PRESCRIPTION-RULE SHOW-TYPE-PRESCRIPTION-RULES1 SHOW-TYPE-PRESCRIPTION-RULES PL2-FN PL-FN PL PL2 ACL2-DEFAULTS-TABLE-LOCAL-CTX-P [GC for 7227 CONS pages..(T=23).GC finished] CHANGE-INCLUDE-BOOK-DIR ADD-CUSTOM-KEYWORD-HINT-FN RESET-PREHISTORY CHECKPOINT-WORLD RESET-KILL-RING [GC for 7237 CONS pages..(T=23).GC finished] RESET-PREHISTORY-FN [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] MEMOIZE-TABLE-CHK-COMMUTATIVE NON-MEMOIZABLE-STOBJS FILTER-ABSSTOBJS [GC for 7247 CONS pages..(T=23).GC finished] MEMOIZE-TABLE-CHK MEMOIZE-TABLE REMOVE-STOBJS-IN-BY-POSITION ADD-SUFFIX-TO-FN [GC for 7257 CONS pages..(T=23).GC finished] (FSUBCOR-VAR FSUBCOR-VAR-LST) (PRINT-GV-SUBSTITUTE-P1 PRINT-GV-SUBSTITUTE-P1-LST) PRINT-GV-SUBSTITUTE-P PRINT-GV-FORM PRINT-GV-CONJUNCT PRINT-GV1 [GC for 7267 CONS pages..(T=24).GC finished] PRINT-GV-FN SET-PRINT-GV-DEFAULTS-FN SET-PRINT-GV-DEFAULTS PRINT-GV-EVISC-TUPLE PRINT-GV-DEFAULT PRINT-GV DISABLE-IPRINT-AR ENABLE-IPRINT-AR *IPRINT-ACTIONS* SET-IPRINT-FN1 INIT-IPRINT-FAL+ [GC for 7277 CONS pages..(T=24).GC finished] SET-IPRINT-FN SET-IPRINT *EVISC-TUPLE-SITES* SET-SITE-EVISC-TUPLE CHK-EVISC-TUPLE SET-EVISC-TUPLE-LST [GC for 7277 CONS pages..(T=23).GC finished] [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] SET-EVISC-TUPLE-FN1 IPRINT-VIRGINP SET-EVISC-TUPLE-FN SET-EVISC-TUPLE TOP-LEVEL [GC for 1563 RELOCATABLE-BLOCKS pages..(T=22).GC finished] TAMENESS-CONDITIONS SUCCESSIVE-CADRS NECC-NAME-ARGS-INSTANCE DEFWARRANT-EVENT [GC for 7287 CONS pages..(T=23).GC finished] TRANSLATE-DEFATTACH-HELPERS *DEFATTACH-KEYS* DEFATTACH-UNKNOWN-CONSTRAINTS-ERROR INTERSECTION-DOMAINS [GC for 7297 CONS pages..(T=23).GC finished] PROCESS-DEFATTACH-ARGS1 DUPLICATE-KEYSP-EQ SPLIT-AT-FIRST-KEYWORD [GC for 7307 CONS pages..(T=23).GC finished] MAYBE-REMOVE1-EQ FILTER-FOR-ATTACHMENT *DEFATTACH-KEYS-EXTENDED* PROCESS-DEFATTACH-ARGS [GC for 7317 CONS pages..(T=24).GC finished] PROVE-DEFATTACH-GUARDS1 [GC for 7327 CONS pages..(T=23).GC finished] PROVE-DEFATTACH-GUARDS TRUE-APPLY$-WARRANT DEFATTACH-CONSTRAINT-REC DEFATTACH-CONSTRAINT [GC for 7327 CONS pages..(T=24).GC finished] PROVE-DEFATTACH-CONSTRAINT ATTACHMENT-COMPONENT-OWNER [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] DEFATTACH-COMPONENT-HAS-OWNER DEFATTACH-MERGE-INTO-COMPONENT DEFATTACH-MERGE-COMPONENTS DEFATTACH-MERGE DEFATTACH-MERGE-LST [GC for 714 SYMBOL pages..(T=24).GC finished] DEFATTACH-MERGE-LST-LST DEFATTACH-LOOP-ERROR-MSG DEFATTACH-LOOP-ERROR DEFATTACH-CLOSE DEFATTACH-ERASE-COMPONENTS DEFATTACH-ERASE-P [GC for 583 SFUN pages..(T=23).GC finished] DEFATTACH-ERASE1 DEFATTACH-ERASE COLLECT-EXT-ANC EXTEND-ATTACHMENT-COMPONENTS COMPONENT-PATH-EXTENSION EXTEND-ATTACHMENT-RECORD [GC for 583 SFUN pages..(T=22).GC finished] UPDATE-ATTACHMENT-RECORDS1 UPDATE-ATTACHMENT-RECORDS ATTACHMENT-RECORDS CHK-DEFATTACH-LOOP DEFAXIOM-SUPPORTER-MSG-LIST [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] CHK-ACCEPTABLE-DEFATTACH ATTACHMENT-CLTL-CMD [GC for 7337 CONS pages..(T=24).GC finished] DEFATTACH-FN DEFATTACH-SYSTEM CHK-RETURN-LAST-ENTRY RETURN-LAST-TABLE DEFMACRO-LAST *FMT-CONTROL-DEFAULTS* *FIXED-FMT-CONTROLS* FMT-CONTROL-BINDINGS1 [GC for 583 SFUN pages..(T=23).GC finished] FMT-CONTROL-BINDINGS SET-IPRINT-AR CHANNEL-TO-STRING [GC for 7347 CONS pages..(T=26).GC finished] [GC for 7357 CONS pages..(T=26).GC finished] [GC for 583 SFUN pages..(T=26).GC finished] FMS-TO-STRING-FN FMS-TO-STRING [GC for 7367 CONS pages..(T=23).GC finished] [GC for 7367 CONS pages..(T=23).GC finished] [GC for 1563 RELOCATABLE-BLOCKS pages..(T=24).GC finished] [GC for 7377 CONS pages..(T=24).GC finished] FMS!-TO-STRING-FN FMS!-TO-STRING [GC for 7387 CONS pages..(T=23).GC finished] [GC for 7387 CONS pages..(T=24).GC finished] [GC for 583 SFUN pages..(T=24).GC finished] FMT-TO-STRING-FN FMT-TO-STRING [GC for 7397 CONS pages..(T=23).GC finished] [GC for 7397 CONS pages..(T=24).GC finished] [GC for 583 SFUN pages..(T=24).GC finished] FMT!-TO-STRING-FN FMT!-TO-STRING [GC for 7407 CONS pages..(T=23).GC finished] [GC for 7407 CONS pages..(T=24).GC finished] [GC for 583 SFUN pages..(T=24).GC finished] FMT1-TO-STRING-FN FMT1-TO-STRING [GC for 7417 CONS pages..(T=23).GC finished] [GC for 7417 CONS pages..(T=24).GC finished] [GC for 583 SFUN pages..(T=24).GC finished] [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] FMT1!-TO-STRING-FN FMT1!-TO-STRING ATTACHMENT-PAIRS SIBLING-ATTACHMENTS EXT-ANCESTORS-ATTACHMENTS4 EXT-ANCESTORS-ATTACHMENTS3 EXT-ANCESTORS-ATTACHMENTS2 CANONICAL-CDRS [GC for 583 SFUN pages..(T=23).GC finished] [GC for 1563 RELOCATABLE-BLOCKS pages..(T=23).GC finished] EXT-ANCESTORS-ATTACHMENTS1 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* [GC for 583 SFUN pages..(T=24).GC finished] DEFUN-INLINE-FORM DEFUN-INLINE DEFUND-INLINE DEFUN-NOTINLINE DEFUND-NOTINLINE REGENERATE-TAU-DATABASE-FN0 REGENERATE-TAU-DATABASE-FN1 REGENERATE-TAU-DATABASE-FN RATIONAL-TO-DECIMAL-STRING DEFUND T [GC for 583 SFUN pages..(T=22).GC finished] [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] MAKE-EVENT-CTX [GC for 7427 CONS pages..(T=23).GC finished] [GC for 7427 CONS pages..(T=23).GC finished] [GC for 7427 CONS pages..(T=23).GC finished] [GC for 7427 CONS pages..(T=23).GC finished] [GC for 7437 CONS pages..(T=25).GC finished] [GC for 7447 CONS pages..(T=25).GC finished] [GC for 7457 CONS pages..(T=25).GC finished] [GC for 7467 CONS pages..(T=24).GC finished] [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] PROTECTED-EVAL MAKE-EVENT-DEBUG-PRE MAKE-EVENT-DEBUG-POST DO-PROOFS? MAKE-EVENT-FN2 [GC for 583 SFUN pages..(T=23).GC finished] MAKE-EVENT-FN2-LST MAKE-EVENT-FN1 ULTIMATE-EXPANSION MAKE-EVENT-FN GET-CHECK-INVARIANT-RISK SET-CHECK-INVARIANT-RISK [GC for 583 SFUN pages..(T=25).GC finished] SET-CHECK-INVARIANT-RISK-FN GET-REGISTER-INVARIANT-RISK SET-REGISTER-INVARIANT-RISK SORT-FBOUNDPS T T APPLY$-LAMBDA-LOGICAL Finished loading "other-events.lisp". ACL2 loading "ld.lisp". "ACL2" WEAK-LD-PROMPT-MEMO-P DEFAULT-PRINT-PROMPT PRINT-PROMPT INITIALIZE-TIMERS [GC for 593 SFUN pages..(T=24).GC finished] MAYBE-ADD-COMMAND-LANDMARK REPLACE-LAST-CDR LD-STANDARD-OI-MISSING CHK-ACCEPTABLE-LD-FN1-PAIR CLOSE-CHANNELS CHK-ACCEPTABLE-LD-FN1 CHK-ACCEPTABLE-LD-FN [GC for 7477 CONS pages..(T=24).GC finished] F-PUT-LD-SPECIALS F-GET-LD-SPECIALS LD-READ-KEYWORD-COMMAND1 EXIT-LD LD-READ-KEYWORD-COMMAND LD-FIX-COMMAND LD-READ-COMMAND [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] LD-PRINT-COMMAND LD-FILTER-COMMAND LD-PRINT-RESULTS LD-PRINT-PROMPT LD-RETURN-ERROR INITIALIZE-ACCUMULATED-WARNINGS LD-READ-EVAL-PRINT [GC for 593 SFUN pages..(T=24).GC finished] LD-LOOP GET-DIRECTORY-OF-FILE UPDATE-CBD LD-FN-BODY LD-FN1 LD-FN-ALIST LD-FN0 [GC for 593 SFUN pages..(T=24).GC finished] LD-FN LD QUICK-TEST [GC for 1563 RELOCATABLE-BLOCKS pages..(T=23).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 [GC for 593 SFUN pages..(T=23).GC finished] ROTATE-KILL-RING UBT-UBU-FN1 UBT?-UBU?-FN UBT-UBU-FN UBT!-UBU!-FN UBT-PREHISTORY [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] UBT-PREHISTORY-FN OOPS-WARNING OOPS-FN OOPS I-AM-HERE REBUILD-FN-READ-FILTER REBUILD-FN REBUILD *BASIC-SWEEP-ERROR-STR* SWEEP-SYMBOL-BINDING-FOR-BAD-SYMBOL SWEEP-GLOBAL-LST [GC for 593 SFUN pages..(T=23).GC finished] SWEEP-STACK-ENTRY-FOR-BAD-SYMBOL SWEEP-T-STACK SWEEP-ACL2-ORACLE SWEEP-GLOBAL-STATE-FOR-LISP-OBJECTS WET DISASSEMBLE$ NEAR-MISSES COMPILE-FUNCTION KEEP-TMP-FILES COMP-FN COMP COMP-GCL SCAN-PAST-DEEPER-EVENT-LANDMARKS [GC for 724 SYMBOL pages..(T=24).GC finished] PUFFABLE-ENCAPSULATE-P PUFFABLE-COMMAND-BLOCKP PUFFABLE-COMMAND-NUMBERP PUFF-INCLUDE-BOOK PUFF-COMMAND-BLOCK1 PUFF-COMMAND-BLOCK COMMANDS-BACK-TO-1 [GC for 7477 CONS pages..(T=24).GC finished] COMMANDS-BACK-TO PUFFED-COMMAND-SEQUENCE LD-READ-EVAL-PRINT-SIMPLE LD-LOOP-SIMPLE LD-SIMPLE [GC for 7487 CONS pages..(T=24).GC finished] [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] PUFF-FN1 PUFF-REPORT PUFF-FN PUFF*-FN11 PUFF*-FN1 [GC for 7487 CONS pages..(T=24).GC finished] PUFF*-FN PUFF PUFF* MINI-PROVEALL SET-GUARD-CHECKING DMR-STOP-FN DMR-STOP DMR-START-FN DMR-START *META-LEVEL-FUNCTION-PROBLEM-1* *META-LEVEL-FUNCTION-PROBLEM-1A* *META-LEVEL-FUNCTION-PROBLEM-1B* *META-LEVEL-FUNCTION-PROBLEM-1C* *META-LEVEL-FUNCTION-PROBLEM-1D* *META-LEVEL-FUNCTION-PROBLEM-1E* *META-LEVEL-FUNCTION-PROBLEM-2* *META-LEVEL-FUNCTION-PROBLEM-3* T MFC-TS MFC-RW MFC-RW+ MFC-RELIEVE-HYP MFC-AP CONGRUENCE-RULE-LISTP TERM-ALISTP-FAILURE-MSG [GC for 7497 CONS pages..(T=24).GC finished] FIND-RUNED-LINEAR-LEMMA MFC-FORCE-FLG UPDATE-RNCST-FOR-FORCEP PRINT-SAVED-OUTPUT-LST [GC for 7507 CONS pages..(T=24).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 [GC for 593 SFUN pages..(T=23).GC finished] WITH-STANDARD-CO-AND-PROOFS-CO-TO-FILE WOF PSOF DEFUN-FOR-STATE-NAME DEFUN-FOR-STATE SET-LD-EVISC-TUPLE SET-LD-EVISC-TUPLE-STATE SET-ABBREV-EVISC-TUPLE SET-ABBREV-EVISC-TUPLE-STATE SET-GAG-MODE-EVISC-TUPLE SET-GAG-MODE-EVISC-TUPLE-STATE [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] SET-TERM-EVISC-TUPLE SET-TERM-EVISC-TUPLE-STATE WITHOUT-EVISC-FN WITHOUT-EVISC Finished loading "ld.lisp". ACL2 loading "proof-builder-b.lisp". "ACL2" INSTALL-NEW-PC-META-OR-MACRO DEFINE-PC-META-OR-MACRO-FN DEFINE-PC-META DEFINE-PC-MACRO DEFINE-PC-ATOMIC-MACRO TOGGLE-PC-MACRO DEFINE-PC-PRIMITIVE PC-COMMAND-TABLE NON-BOUNDED-NUMS [GC for 593 SFUN pages..(T=25).GC finished] DELETE-BY-POSITION PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7517 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE 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 7527 CONS pages..(T=24).GC finished] [GC for 7537 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE [GC for 7547 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE [GC for 1563 RELOCATABLE-BLOCKS pages..(T=24).GC finished] PC-COMMAND-TABLE PRINT-COMMANDS MAKE-PRETTY-START-INSTR RAW-INDEXED-INSTRS [GC for 7557 CONS pages..(T=23).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE DEFINE-PC-HELP [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] EVISC-INDEXED-INSTRS-1 EVISC-INDEXED-INSTRS-REC MARK-UNFINISHED-INSTRS EVISC-INDEXED-INSTRS PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 593 SFUN pages..(T=23).GC finished] PROMOTE-GUTS PC-COMMAND-TABLE REMOVE-BY-INDICES PC-COMMAND-TABLE BOUNDED-INTEGER-LISTP FETCH-TERM-AND-CL [GC for 593 SFUN pages..(T=24).GC finished] FETCH-TERM GOVERNORS TERM-ID-IFF ? T ABBREVIATIONS-ALIST (CHK-?S CHK-?S-LST) [GC for 593 SFUN pages..(T=24).GC finished] REMOVE-?S TRANSLATE-ABB TRANS0 P-BODY PC-COMMAND-TABLE [GC for 7567 CONS pages..(T=24).GC finished] [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] PC-COMMAND-TABLE TAKE-BY-INDICES PRINT-HYPS SOME-> PRINT-HYPS-TOP [GC for 7577 CONS pages..(T=24).GC finished] PRINT-GOVERNORS-TOP PAIR-INDICES [GC for 7587 CONS pages..(T=25).GC finished] [GC for 7597 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PAIR-KEYWORDS NULL-POOL [GC for 593 SFUN pages..(T=25).GC finished] INITIAL-PSPV PC-PROVE SUBLIS-EQUAL ABBREVIATIONS-ALIST-? FIND-?-FN [GC for 593 SFUN pages..(T=23).GC finished] UNPROVED-PC-PROVE-CLAUSES PROVER-CALL MAKE-NEW-GOALS SAME-GOAL REMOVE-BYES-FROM-TAG-TREE [GC for 7607 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] 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 PC-COMMAND-TABLE [GC for 593 SFUN pages..(T=24).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE NOT-IN-DOMAIN-EQ PC-COMMAND-TABLE [GC for 7607 CONS pages..(T=24).GC finished] [GC for 7617 CONS pages..(T=24).GC finished] PRINT-ABBREVIATIONS PC-COMMAND-TABLE [GC for 593 SFUN pages..(T=24).GC finished] DROP-FROM-END PC-COMMAND-TABLE PC-COMMAND-TABLE EXPAND-ADDRESS-RECURSE DIVE-ONCE-MORE-ERROR ABBREVIATION-RAW-TERM-P ADDR-RECUR OR-ADDR [GC for 7627 CONS pages..(T=24).GC finished] 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 [GC for 7637 CONS pages..(T=24).GC finished] EXPAND-ADDRESS DV-ERROR [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] PC-COMMAND-TABLE [GC for 1563 RELOCATABLE-BLOCKS pages..(T=24).GC finished] (DEPOSIT-TERM DEPOSIT-TERM-LST) GENEQV-AT-SUBTERM GENEQV-AT-SUBTERM-TOP MAYBE-TRUNCATE-CURRENT-ADDRESS [GC for 593 SFUN pages..(T=25).GC finished] DEPOSIT-TERM-IN-GOAL SPLIT-IMPLIES FIND-EQUIVALENCE-HYP-TERM PC-COMMAND-TABLE [GC for 7647 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 593 SFUN pages..(T=24).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7657 CONS pages..(T=23).GC finished] PRINT-ON-SEPARATE-LINES PC-COMMAND-TABLE [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] MODIFIED-ERROR-TRIPLE-FOR-SEQUENCE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7657 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE EXTRACT-GOAL [GC for 7667 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE CHANGE-BY-POSITION PC-COMMAND-TABLE [GC for 7677 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7677 CONS pages..(T=25).GC finished] [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=32).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE DEFINE-PC-BIND* PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7687 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE FIND-EQUIVALENCE-HYP-TERM-NO-TARGET PC-COMMAND-TABLE [GC for 7687 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE APPLICABLE-REWRITE-RULES [GC for 7697 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7697 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE TRANSLATE-SUBST-ABB1 [GC for 734 SYMBOL pages..(T=24).GC finished] SINGLE-VALUED-SYMBOLP-ALISTP CHECK-CARS-ARE-VARIABLES [GC for 7697 CONS pages..(T=27).GC finished] TRANSLATE-SUBST-ABB MAKE-REWRITE-INSTR [GC for 7707 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE [GC for 7717 CONS pages..(T=24).GC finished] APPLICABLE-LINEAR-RULES MAKE-LINEAR-INSTR [GC for 7717 CONS pages..(T=25).GC finished] [GC for 1563 RELOCATABLE-BLOCKS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=31).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 7727 CONS pages..(T=24).GC finished] [GC for 7727 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE BUILD-PC-ENABLED-STRUCTURE-FROM-ENS [GC for 7737 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7747 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE CHANGE-LAST [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=32).GC finished] ASSIGN-EVENT-NAME-AND-RULE-CLASSES SAVE-FN PC-COMMAND-TABLE RETRIEVE PC-COMMAND-TABLE UNSAVE-FN UNSAVE [GC for 7747 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE SHOW-RETRIEVED-GOAL [GC for 7747 CONS pages..(T=25).GC finished] RETRIEVE-FN PRINT-ALL-GOALS PC-COMMAND-TABLE PRINT-CONC [GC for 7757 CONS pages..(T=25).GC finished] PRINT-ALL-CONCS PC-COMMAND-TABLE GEN-VAR-MARKER TRANSLATE-GENERALIZE-ALIST-1 [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] NON-GEN-VAR-MARKERS FIND-DUPLICATE-GENERALIZE-ENTRIES TRANSLATE-GENERALIZE-ALIST-2 TRANSLATE-GENERALIZE-ALIST ALL-VARS-GOALS PC-STATE-VARS [GC for 603 SFUN pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7757 CONS pages..(T=26).GC finished] PC-COMMAND-TABLE [GC for 16384 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 [GC for 603 SFUN pages..(T=25).GC finished] INSTR-NAME PC-FREE-INSTR-P FIND-POSSIBLE-PUT PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 603 SFUN pages..(T=25).GC finished] PC-COMMAND-TABLE [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] PC-COMMAND-TABLE SAVE-FC-REPORT-SETTINGS RESTORE-FC-REPORT-SETTINGS [GC for 7767 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 603 SFUN pages..(T=23).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE ACL2-WRAP PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 1563 RELOCATABLE-BLOCKS pages..(T=26).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE GOAL-TERMS [GC for 122 CFUN pages..(T=24).GC finished] WRAP1-AUX1 WRAP1-AUX2 PC-COMMAND-TABLE [GC for 7777 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE SHOW-GENEQV [GC for 16640 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] PC-COMMAND-TABLE GOALS-TO-CLAUSE-LIST PROOF-BUILDER-CLAUSE-LIST TTREE-TO-SUMMARY-DATA [GC for 7787 CONS pages..(T=25).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 7797 CONS pages..(T=25).GC finished] [GC for 7807 CONS pages..(T=25).GC finished] "ACL2-USER" Finished loading "defpkgs.lisp". ACL2 loading '((IN-PACKAGE "ACL2") (DEFUN FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1 (RUNES AVOID-FNS WRLD ANS) (DECLARE (XARGS :MODE :PROGRAM)) (COND (# ANS) (T #))) (DEFCONST *APPLY$-USERFN-CALLERS* '(APPLY$ EV$ APPLY$-USERFN)) (DEFCONST *BLACKLISTED-APPLY$-FNS* '(SYNP HIDE WORMHOLE1 WORMHOLE-EVAL SYS-CALL HONS-CLEAR! HONS-WASH! ...)) (DEFUN FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES (WORLD) (DECLARE (XARGS :MODE :PROGRAM)) (FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1 (FUNCTION-THEORY :HERE) *BLACKLISTED-APPLY$-FNS* WORLD NIL)) (WHEN-PASS-2 (MAKE-EVENT (CONS # #))) (DEFUN COMPUTE-BADGE-OF-PRIMITIVES (TERMS-AND-OUT-ARITIES) (DECLARE (XARGS :MODE :PROGRAM)) (COND (# NIL) (T #))) ...). "ACL2" [GC for 7817 CONS pages..(T=25).GC finished] FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1 *APPLY$-USERFN-CALLERS* *BLACKLISTED-APPLY$-FNS* FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES NIL COMPUTE-BADGE-OF-PRIMITIVES NIL APPLY$-BADGEP N-CAR-CADR-CADDR-ETC MAKE-APPLY$-PRIM-BODY-FN NIL NIL Finished loading '((IN-PACKAGE "ACL2") (DEFUN FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1 (RUNES AVOID-FNS WRLD ANS) (DECLARE (XARGS :MODE :PROGRAM)) (COND (# ANS) (T #))) (DEFCONST *APPLY$-USERFN-CALLERS* '(APPLY$ EV$ APPLY$-USERFN)) (DEFCONST *BLACKLISTED-APPLY$-FNS* '(SYNP HIDE WORMHOLE1 WORMHOLE-EVAL SYS-CALL HONS-CLEAR! HONS-WASH! ...)) (DEFUN FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES (WORLD) (DECLARE (XARGS :MODE :PROGRAM)) (FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1 (FUNCTION-THEORY :HERE) *BLACKLISTED-APPLY$-FNS* WORLD NIL)) (WHEN-PASS-2 (MAKE-EVENT (CONS # #))) (DEFUN COMPUTE-BADGE-OF-PRIMITIVES (TERMS-AND-OUT-ARITIES) (DECLARE (XARGS :MODE :PROGRAM)) (COND (# NIL) (T #))) ...). ACL2 loading '((IN-PACKAGE "ACL2") (WHEN-PASS-2 (ENCAPSULATE (#) (LOCAL #) (DEFTHM BADGE-USERFN-TYPE # :RULE-CLASSES #)) (ENCAPSULATE (#) (LOCAL #) (DEFTHM APPLY$-USERFN-TAKES-ARITY-ARGS # :RULE-CLASSES NIL)) (ENCAPSULATE (#) (LOCAL #) (DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS # :RULE-CLASSES #)) (DEFSTUB UNTAME-EV$ (X A) T) (DEFCONST *APPLY$-BOOT-FNS-BADGE-ALIST* (CONS # #)))). "ACL2" NIL Finished loading '((IN-PACKAGE "ACL2") (WHEN-PASS-2 (ENCAPSULATE (#) (LOCAL #) (DEFTHM BADGE-USERFN-TYPE # :RULE-CLASSES #)) (ENCAPSULATE (#) (LOCAL #) (DEFTHM APPLY$-USERFN-TAKES-ARITY-ARGS # :RULE-CLASSES NIL)) (ENCAPSULATE (#) (LOCAL #) (DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS # :RULE-CLASSES #)) (DEFSTUB UNTAME-EV$ (X A) T) (DEFCONST *APPLY$-BOOT-FNS-BADGE-ALIST* (CONS # #)))). ACL2 loading '((IN-PACKAGE "ACL2") (WHEN-PASS-2 (DEFUN BADGE (FN) (DECLARE #) (COND # # # # # # ...)) (IN-THEORY (DISABLE APPLY$-PRIMP BADGE-PRIM)) (IN-THEORY (DISABLE BADGE)) (DEFABBREV TAMEP-LAMBDAP (FN) (AND # # #)) (MUTUAL-RECURSION (DEFUN TAMEP # # #) (DEFUN TAMEP-FUNCTIONP # # #) (DEFUN SUITABLY-TAMEP-LISTP # # #)) (MUTUAL-RECURSION (DEFUN APPLY$ # # #) (DEFUN APPLY$-LAMBDA # # #) (DEFUN EV$ # # #) (DEFUN EV$-LIST # # #)) ...)). "ACL2" NIL Finished loading '((IN-PACKAGE "ACL2") (WHEN-PASS-2 (DEFUN BADGE (FN) (DECLARE #) (COND # # # # # # ...)) (IN-THEORY (DISABLE APPLY$-PRIMP BADGE-PRIM)) (IN-THEORY (DISABLE BADGE)) (DEFABBREV TAMEP-LAMBDAP (FN) (AND # # #)) (MUTUAL-RECURSION (DEFUN TAMEP # # #) (DEFUN TAMEP-FUNCTIONP # # #) (DEFUN SUITABLY-TAMEP-LISTP # # #)) (MUTUAL-RECURSION (DEFUN APPLY$ # # #) (DEFUN APPLY$-LAMBDA # # #) (DEFUN EV$ # # #) (DEFUN EV$-LIST # # #)) ...)). [GC for 16640 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] [GC for 1563 RELOCATABLE-BLOCKS pages..(T=25).GC finished] ACL2 loading '((LOGIC)). Finished loading '((LOGIC)). ACL2 loading '((IN-PACKAGE "ACL2") (DEFCONST *COMMON-LISP-SYMBOLS-FROM-MAIN-LISP-PACKAGE* '(&ALLOW-OTHER-KEYS *PRINT-MISER-WIDTH* &AUX *PRINT-PPRINT-DISPATCH* &BODY *PRINT-PRETTY* &ENVIRONMENT ...)) (DEFCONST *COMMON-LISP-SPECIALS-AND-CONSTANTS* '(* ** *** *BREAK-ON-SIGNALS* *COMPILE-FILE-PATHNAME* *COMPILE-FILE-TRUENAME* *COMPILE-PRINT* ...)) (DEFCONST NIL 'NIL " NIL, a symbol, represents in Common Lisp both the false truth value and the empty list.") (DEFCONST T 'T "T, a symbol, represents the true truth value in Common Lisp.") (DEFCONST *STOBJ-INLINE-DECLARE* '(DECLARE #)) (DEFMACRO MAKE-PACKAGE-ENTRY (&KEY NAME IMPORTS HIDDEN-P BOOK-PATH DEFPKG-EVENT-FORM TTERM) (CONS 'LIST* (CONS NAME #))) ...). "ACL2" :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 1954 RELOCATABLE-BLOCKS pages..(T=26).GC finished] :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT IFF XOR :REDUNDANT :REDUNDANT IFF-IS-AN-EQUIVALENCE :REDUNDANT IFF-IMPLIES-EQUAL-IMPLIES-1 IFF-IMPLIES-EQUAL-IMPLIES-2 :REDUNDANT IFF-IMPLIES-EQUAL-NOT HIDE :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT LIST-MACRO :REDUNDANT AND-MACRO :REDUNDANT OR-MACRO :REDUNDANT :REDUNDANT BOOLEANP-COMPOUND-RECOGNIZER (:NUMBER-OF-ENABLED-RUNES 724) :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT COND-CLAUSESP [GC for 603 SFUN pages..(T=25).GC finished] COND-MACRO :REDUNDANT :REDUNDANT EQLABLEP-RECOG (:NUMBER-OF-ENABLED-RUNES 732) :REDUNDANT :REDUNDANT :REDUNDANT MAKE-CHARACTER-LIST :REDUNDANT :REDUNDANT ALISTP-FORWARD-TO-TRUE-LISTP EQLABLE-ALISTP-FORWARD-TO-ALISTP ACONS :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT SYMBOL-LISTP-FORWARD-TO-TRUE-LISTP SYMBOL-DOUBLET-LISTP REVERSE-STRIP-CARS :REDUNDANT [GC for 603 SFUN pages..(T=25).GC finished] REVERSE-STRIP-CDRS STRIP-CDRS :REDUNDANT ILLEGAL :REDUNDANT RETURN-LAST-FN :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT TRUE-LISTP-APPEND CAR-CDR-ELIM CAR-CONS CDR-CONS CONS-EQUAL APPEND-TO-NIL :REDUNDANT :REDUNDANT STRING-LISTP STRING-APPEND-LST [GC for 603 SFUN pages..(T=25).GC finished] GUARD-CHECK-FN :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT MEMBER-EQ-EXEC :REDUNDANT :REDUNDANT :REDUNDANT MEMBER-EQ-EXEC-IS-MEMBER-EQUAL MEMBER-EQL-EXEC-IS-MEMBER-EQUAL :REDUNDANT SUBSETP-EQ-EXEC :REDUNDANT :REDUNDANT :REDUNDANT SUBSETP-EQ-EXEC-IS-SUBSETP-EQUAL SUBSETP-EQL-EXEC-IS-SUBSETP-EQUAL :REDUNDANT :REDUNDANT SYMBOL-ALISTP-FORWARD-TO-EQLABLE-ALISTP [GC for 603 SFUN pages..(T=25).GC finished] CHARACTER-ALISTP CHARACTER-ALISTP-FORWARD-TO-EQLABLE-ALISTP :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT ASSOC-EQ-EXEC-IS-ASSOC-EQUAL ASSOC-EQL-EXEC-IS-ASSOC-EQUAL :REDUNDANT ASSOC-EQ-EQUAL-ALISTP ASSOC-EQ-EQUAL :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT ZP-COMPOUND-RECOGNIZER ZP-OPEN (:NUMBER-OF-ENABLED-RUNES 816) :REDUNDANT ZIP-COMPOUND-RECOGNIZER ZIP-OPEN (:NUMBER-OF-ENABLED-RUNES 817) :REDUNDANT :REDUNDANT SLEEP PROPER-CONSP [GC for 7827 CONS pages..(T=26).GC finished] [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=32).GC finished] IMPROPER-CONSP :REDUNDANT CONJUGATE ADD-SUFFIX :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT CLOSURE ASSOCIATIVITY-OF-+ COMMUTATIVITY-OF-+ FIX UNICITY-OF-0 INVERSE-OF-+ ASSOCIATIVITY-OF-* COMMUTATIVITY-OF-* UNICITY-OF-1 INVERSE-OF-* DISTRIBUTIVITY <-ON-OTHERS ZERO TRICHOTOMY POSITIVE RATIONAL-IMPLIES1 RATIONAL-IMPLIES2 INTEGER-IMPLIES-RATIONAL COMPLEX-IMPLIES1 COMPLEX-DEFINITION (:NUMBER-OF-ENABLED-RUNES 845) NONZERO-IMAGPART REALPART-IMAGPART-ELIM REALPART-COMPLEX IMAGPART-COMPLEX COMPLEX-EQUAL :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 7837 CONS pages..(T=25).GC finished] (:NUMBER-OF-ENABLED-RUNES 849) :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT EXTRA-INFO (:NUMBER-OF-ENABLED-RUNES 849) :REDUNDANT :REDUNDANT :REDUNDANT (:NUMBER-OF-ENABLED-RUNES 849) :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT NONNEGATIVE-PRODUCT INTEGER-0 INTEGER-1 INTEGER-STEP LOWEST-TERMS BASIC-TAU-RULES BOOLEANP-CHARACTERP CHARACTERP-PAGE CHARACTERP-TAB CHARACTERP-RUBOUT CHARACTERP-RETURN [GC for 7847 CONS pages..(T=26).GC finished] NO-DUPLICATESP-EQ-EXEC NO-DUPLICATESP-EQL-EXEC NO-DUPLICATESP-EQUAL :REDUNDANT NO-DUPLICATESP-EQ-EXEC-IS-NO-DUPLICATESP-EQUAL NO-DUPLICATESP-EQL-EXEC-IS-NO-DUPLICATESP-EQUAL :REDUNDANT [GC for 7857 CONS pages..(T=26).GC finished] CHK-NO-DUPLICATESP R-EQLABLE-ALISTP R-SYMBOL-ALISTP RASSOC-EQ-EXEC [GC for 603 SFUN 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 STANDARD-CHAR-P STANDARD-CHAR-P+ STANDARD-CHAR-LISTP [GC for 7867 CONS pages..(T=25).GC finished] CHARACTER-LISTP CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP STANDARD-CHAR-LISTP-FORWARD-TO-CHARACTER-LISTP COERCE-INVERSE-1 COERCE-INVERSE-2 CHARACTER-LISTP-COERCE (:NUMBER-OF-ENABLED-RUNES 919) STRING ALPHA-CHAR-P UPPER-CASE-P [GC for 7877 CONS pages..(T=25).GC finished] LOWER-CASE-P CHAR-UPCASE CHAR-DOWNCASE LOWER-CASE-P-CHAR-DOWNCASE UPPER-CASE-P-CHAR-UPCASE LOWER-CASE-P-FORWARD-TO-ALPHA-CHAR-P UPPER-CASE-P-FORWARD-TO-ALPHA-CHAR-P ALPHA-CHAR-P-FORWARD-TO-STANDARD-CHAR-P [GC for 7887 CONS pages..(T=25).GC finished] STANDARD-CHAR-P-FORWARD-TO-CHARACTERP CHARACTERP-CHAR-DOWNCASE CHARACTERP-CHAR-UPCASE (:NUMBER-OF-ENABLED-RUNES 940) [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=32).GC finished] STRING-DOWNCASE1 CHARACTER-LISTP-STRING-DOWNCASE-1 STRING-DOWNCASE STRING-UPCASE1 CHARACTER-LISTP-STRING-UPCASE1-1 STRING-UPCASE [GC for 7897 CONS pages..(T=26).GC finished] OUR-DIGIT-CHAR-P :REDUNDANT CHAR-EQUAL ATOM-LISTP ATOM-LISTP-FORWARD-TO-TRUE-LISTP EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP GOOD-ATOM-LISTP GOOD-ATOM-LISTP-FORWARD-TO-ATOM-LISTP CHARACTERP-NTH :REDUNDANT RFIX REALFIX :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT NATP-COMPOUND-RECOGNIZER [GC for 7907 CONS pages..(T=26).GC finished] NAT-ALISTP NAT-ALISTP-FORWARD-TO-EQLABLE-ALISTP STANDARD-STRING-P1 STANDARD-STRING-P STANDARD-STRING-LISTP :REDUNDANT :REDUNDANT :REDUNDANT STANDARD-STRING-ALISTP STANDARD-STRING-ALISTP-FORWARD-TO-ALISTP :REDUNDANT :REDUNDANT BITP-COMPOUND-RECOGNIZER BITP-AS-INEQUALITY :REDUNDANT [GC for 7917 CONS pages..(T=25).GC finished] POSP-COMPOUND-RECOGNIZER :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT O-P O-P-IMPLIES-O CHAR<= CHAR>= STRING<-L [GC for 603 SFUN pages..(T=26).GC finished] STRING< STRING> STRING<= STRING>= SYMBOL-< STRING<-L-IRREFLEXIVE STRING<-IRREFLEXIVE [GC for 8157 CONS pages..(T=27).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 :REDUNDANT :REDUNDANT [GC for 8167 CONS pages..(T=26).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 PLIST-WORLDP-FORWARD-TO-ASSOC-EQ-EQUAL-ALISTP PUTPROP :REDUNDANT [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] GETPROP-DEFAULT :REDUNDANT :REDUNDANT ORDERED-SYMBOL-ALISTP (:NUMBER-OF-ENABLED-RUNES 1532) ORDERED-SYMBOL-ALISTP-FORWARD-TO-SYMBOL-ALISTP ADD-PAIR REMOVE1-ASSOC-EQ-EXEC [GC for 8177 CONS pages..(T=26).GC finished] REMOVE1-ASSOC-EQL-EXEC REMOVE1-ASSOC-EQUAL :REDUNDANT REMOVE1-ASSOC-EQ-EXEC-IS-REMOVE1-ASSOC-EQUAL REMOVE1-ASSOC-EQL-EXEC-IS-REMOVE1-ASSOC-EQUAL :REDUNDANT REMOVE-ASSOC-EQ-EXEC [GC for 8187 CONS pages..(T=26).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 8197 CONS pages..(T=26).GC finished] GETPROPS (:NUMBER-OF-ENABLED-RUNES 1584) EQUAL-CHAR-CODE HAS-PROPSP1 [GC for 8207 CONS pages..(T=26).GC finished] HAS-PROPSP EXTEND-WORLD RETRACT-WORLD GLOBAL-VAL :REDUNDANT :REDUNDANT CONJOIN2 [GC for 603 SFUN pages..(T=26).GC finished] CONJOIN [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] CONJOIN-UNTRANSLATED-TERMS DISJOIN2 DISJOIN DISJOIN-LST KWOTE? [GC for 603 SFUN pages..(T=26).GC finished] CONJOIN? <=? >? DISJOIN? :REDUNDANT :REDUNDANT WEAK-SATISFIES-TYPE-SPEC-P :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT THE-CHECK :REDUNDANT :REDUNDANT [GC for 603 SFUN pages..(T=27).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 ARRAY1P-FORWARD [GC for 8217 CONS pages..(T=27).GC finished] ARRAY1P-LINEAR BOUNDED-INTEGER-ALISTP2 ASSOC2 ARRAY2P [GC for 8227 CONS pages..(T=27).GC finished] ARRAY2P-FORWARD ARRAY2P-LINEAR HEADER DIMENSIONS [GC for 8237 CONS pages..(T=26).GC finished] MAXIMUM-LENGTH DEFAULT AREF1 [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] COMPRESS11 ARRAY-ORDER COMPRESS1 ARRAY1P-CONS [GC for 8247 CONS pages..(T=27).GC finished] ASET1 AREF2 COMPRESS211 [GC for 8257 CONS pages..(T=27).GC finished] COMPRESS21 COMPRESS2 ARRAY2P-CONS ASET2 FLUSH-COMPRESS MAYBE-FLUSH-AND-COMPRESS1 [GC for 8267 CONS pages..(T=25).GC finished] CDRN MV-NTH MAKE-MV-NTHS :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT UPDATE-NTH [GC for 8277 CONS pages..(T=26).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 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 603 SFUN pages..(T=26).GC finished] [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] 32-BIT-INTEGER-LISTP 32-BIT-INTEGER-LISTP-FORWARD-TO-INTEGER-LISTP OPEN-INPUT-CHANNELS UPDATE-OPEN-INPUT-CHANNELS OPEN-OUTPUT-CHANNELS UPDATE-OPEN-OUTPUT-CHANNELS [GC for 603 SFUN pages..(T=26).GC finished] GLOBAL-TABLE UPDATE-GLOBAL-TABLE T-STACK UPDATE-T-STACK 32-BIT-INTEGER-STACK UPDATE-32-BIT-INTEGER-STACK [GC for 8287 CONS pages..(T=25).GC finished] BIG-CLOCK-ENTRY UPDATE-BIG-CLOCK-ENTRY IDATES UPDATE-IDATES ACL2-ORACLE [GC for 8297 CONS pages..(T=27).GC finished] UPDATE-ACL2-ORACLE [GC for 1954 RELOCATABLE-BLOCKS pages..(T=27).GC finished] FILE-CLOCK UPDATE-FILE-CLOCK READABLE-FILES [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] WRITTEN-FILES UPDATE-WRITTEN-FILES READ-FILES UPDATE-READ-FILES WRITEABLE-FILES [GC for 603 SFUN pages..(T=27).GC finished] LIST-ALL-PACKAGE-NAMES-LST UPDATE-LIST-ALL-PACKAGE-NAMES-LST USER-STOBJ-ALIST1 UPDATE-USER-STOBJ-ALIST1 :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT UNTOUCHABLE-MARKER :REDUNDANT :REDUNDANT [GC for 8307 CONS pages..(T=27).GC finished] INIT-IPRINT-AR :REDUNDANT :REDUNDANT DEFAULT-TOTAL-PARALLELISM-WORK-LIMIT :REDUNDANT :REDUNDANT :REDUNDANT T :REDUNDANT ALL-BOUNDP KNOWN-PACKAGE-ALISTP KNOWN-PACKAGE-ALISTP-FORWARD-TO-TRUE-LIST-LISTP-AND-ALISTP [GC for 8317 CONS pages..(T=27).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 OPEN-CHANNEL1 OPEN-CHANNEL1-FORWARD-TO-TRUE-LISTP-AND-CONSP OPEN-CHANNEL-LISTP [GC for 8327 CONS pages..(T=27).GC finished] OPEN-CHANNELS-P OPEN-CHANNELS-P-FORWARD FILE-CLOCK-P FILE-CLOCK-P-FORWARD-TO-INTEGERP [GC for 18688 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 READABLE-FILES-P READABLE-FILES-P-FORWARD-TO-READABLE-FILES-LISTP WRITTEN-FILE WRITTEN-FILE-FORWARD-TO-TRUE-LISTP-AND-CONSP [GC for 8337 CONS pages..(T=28).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 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 8347 CONS pages..(T=28).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 WRITABLE-FILE-LISTP WRITABLE-FILE-LISTP-FORWARD-TO-TRUE-LIST-LISTP WRITEABLE-FILES-P WRITEABLE-FILES-P-FORWARD-TO-WRITABLE-FILE-LISTP [GC for 8357 CONS pages..(T=27).GC finished] STATE-P1 STATE-P1-FORWARD STATE-P [GC for 8367 CONS pages..(T=27).GC finished] (:NUMBER-OF-ENABLED-RUNES 1959) STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 :REDUNDANT :REDUNDANT BUILD-STATE1 COERCE-STATE-TO-OBJECT COERCE-OBJECT-TO-STATE CREATE-STATE [GC for 8377 CONS pages..(T=28).GC finished] GLOBAL-TABLE-CARS1 GLOBAL-TABLE-CARS [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] BOUNDP-GLOBAL1 BOUNDP-GLOBAL :REDUNDANT MAKUNBOUND-GLOBAL [GC for 8387 CONS pages..(T=28).GC finished] GET-GLOBAL PUT-GLOBAL :REDUNDANT :REDUNDANT ALWAYS-BOUNDP-GLOBAL [GC for 8397 CONS pages..(T=26).GC finished] STATE-GLOBAL-LET*-BINDINGS-P STATE-GLOBAL-LET*-GET-GLOBALS STATE-GLOBAL-LET*-PUT-GLOBALS [GC for 8407 CONS pages..(T=27).GC finished] STATE-GLOBAL-LET*-CLEANUP :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT INTEGER-RANGE-P NIL SIGNED-BYTE-P UNSIGNED-BYTE-P INTEGER-RANGE-P-FORWARD [GC for 8417 CONS pages..(T=26).GC finished] SIGNED-BYTE-P-FORWARD-TO-INTEGERP UNSIGNED-BYTE-P-FORWARD-TO-NONNEGATIVE-INTEGERP :REDUNDANT ZPF NIL SUBSTITUTE NIL ALL-VARS1 ALL-VARS NIL CHECK-VARS-NOT-FREE-TEST [GC for 8427 CONS pages..(T=27).GC finished] T NIL :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT INTEGER-LENGTH BINARY-LOGAND LOGNAND [GC for 8437 CONS pages..(T=27).GC finished] BINARY-LOGIOR LOGORC1 [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] LOGORC2 LOGANDC1 LOGANDC2 BINARY-LOGEQV BINARY-LOGXOR [GC for 603 SFUN pages..(T=27).GC finished] LOGNOR LOGTEST :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8447 CONS pages..(T=28).GC finished] BOOLE$ SET-FORMS-FROM-BINDINGS :REDUNDANT ALIST-DIFFERENCE-EQ :REDUNDANT :REDUNDANT [GC for 8457 CONS pages..(T=27).GC finished] DIGIT-TO-CHAR PRINT-BASE-P :REDUNDANT EXPLODE-NONNEGATIVE-INTEGER TRUE-LISTP-EXPLODE-NONNEGATIVE-INTEGER NIL NIL EXPLODE-NONNEGATIVE-INTEGER :REDUNDANT [GC for 8467 CONS pages..(T=27).GC finished] EXPLODE-ATOM :REDUNDANT EXPLODE-ATOM+ TRUE-LIST-LISTP-FORWARD-TO-TRUE-LISTP-ASSOC-EQUAL TRUE-LISTP-CADR-ASSOC-EQ-FOR-OPEN-CHANNELS-P NIL [GC for 8477 CONS pages..(T=27).GC finished] OPEN-INPUT-CHANNEL-P1 OPEN-OUTPUT-CHANNEL-P1 OPEN-INPUT-CHANNEL-P OPEN-OUTPUT-CHANNEL-P [GC for 8487 CONS pages..(T=27).GC finished] [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] OPEN-OUTPUT-CHANNEL-ANY-P1 OPEN-OUTPUT-CHANNEL-ANY-P OPEN-INPUT-CHANNEL-ANY-P1 OPEN-INPUT-CHANNEL-ANY-P NON-FREE-VAR-RUNES [GC for 603 SFUN pages..(T=28).GC finished] FREE-VAR-RUNES NATP-POSITION-AC :REDUNDANT :REDUNDANT :REDUNDANT OS ABSOLUTE-PATHNAME-STRING-P [GC for 8497 CONS pages..(T=28).GC finished] ILLEGAL-RULER-EXTENDERS-VALUES :REDUNDANT RULER-EXTENDERS-MSG-AUX RULER-EXTENDERS-MSG [GC for 8507 CONS pages..(T=28).GC finished] STRICT-SYMBOL-<-SORTEDP :REDUNDANT :REDUNDANT :REDUNDANT INCLUDE-BOOK-DIR-ALIST-ENTRY-P INCLUDE-BOOK-DIR-ALISTP :REDUNDANT TTAG GET-REGISTER-INVARIANT-RISK-WORLD [GC for 8517 CONS pages..(T=27).GC finished] :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT SET-PRINT-CASE :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT CHECK-PRINT-BASE SET-PRINT-BASE :REDUNDANT [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] SET-PRINT-CIRCLE SET-PRINT-ESCAPE SET-PRINT-PRETTY SET-PRINT-RADIX SET-PRINT-READABLY [GC for 603 SFUN pages..(T=27).GC finished] CHECK-NULL-OR-NATP SET-PRINT-LENGTH SET-PRINT-LEVEL SET-PRINT-LINES SET-PRINT-RIGHT-MARGIN [GC for 8527 CONS pages..(T=27).GC finished] PRINC$ WRITE-BYTE$ W [GC for 8537 CONS pages..(T=27).GC finished] GET-SERIALIZE-CHARACTER HONS-ENABLEDP SET-SERIALIZE-CHARACTER-FN SET-SERIALIZE-CHARACTER [GC for 8547 CONS pages..(T=28).GC finished] [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] SET-SERIALIZE-CHARACTER-SYSTEM PRINT-OBJECT$-SER ALL-BOUNDP-PRESERVES-ASSOC-EQUAL NIL PRINT-OBJECT$ PRINT-OBJECT$-PRESERVING-CASE MAKE-INPUT-CHANNEL [GC for 8557 CONS pages..(T=27).GC finished] MAKE-OUTPUT-CHANNEL OPEN-INPUT-CHANNEL NTH-UPDATE-NTH TRUE-LISTP-UPDATE-NTH NIL NTH-UPDATE-NTH-ARRAY CLOSE-INPUT-CHANNEL [GC for 8567 CONS pages..(T=27).GC finished] OPEN-OUTPUT-CHANNEL OPEN-OUTPUT-CHANNEL! :REDUNDANT :REDUNDANT FMT-TO-COMMENT-WINDOW FMT-TO-COMMENT-WINDOW! [GC for 8577 CONS pages..(T=28).GC finished] PAIRLIS2 :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT LOCK-SYMBOL-NAME-P ASSIGN-LOCK :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT GET-OUTPUT-STREAM-STRING$-FN :REDUNDANT [GC for 8587 CONS pages..(T=28).GC finished] CLOSE-OUTPUT-CHANNEL MAYBE-FINISH-OUTPUT$ [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] READ-CHAR$ PEEK-CHAR$ READ-BYTE$ RAW-MODE-P [GC for 603 SFUN pages..(T=27).GC finished] READ-OBJECT [GC for 1954 RELOCATABLE-BLOCKS pages..(T=27).GC finished] READ-OBJECT-WITH-CASE READ-OBJECT-SUPPRESS :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT SOME-SLASHABLE PRIN1-WITH-SLASHES1 [GC for 8597 CONS pages..(T=27).GC finished] PRIN1-WITH-SLASHES :REDUNDANT :REDUNDANT MAY-NEED-SLASHES1 NIL [GC for 8607 CONS pages..(T=27).GC finished] MAY-NEED-SLASHES-FN :REDUNDANT NEEDS-SLASHES T-STACK-LENGTH1 T-STACK-LENGTH [GC for 603 SFUN pages..(T=27).GC finished] [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] MAKE-LIST-AC :REDUNDANT EXTEND-T-STACK T STRINGP-SUBSEQ-TYPE-PRESCRIPTION TRUE-LISTP-SUBSEQ-TYPE-PRESCRIPTION NIL W HONS-ENABLEDP SET-SERIALIZE-CHARACTER-FN SET-SERIALIZE-CHARACTER SET-SERIALIZE-CHARACTER-SYSTEM :REDUNDANT :REDUNDANT SHRINK-T-STACK [GC for 603 SFUN pages..(T=28).GC finished] AREF-T-STACK ASET-T-STACK 32-BIT-INTEGER-STACK-LENGTH1 32-BIT-INTEGER-STACK-LENGTH [GC for 603 SFUN pages..(T=27).GC finished] EXTEND-32-BIT-INTEGER-STACK SHRINK-32-BIT-INTEGER-STACK AREF-32-BIT-INTEGER-STACK ASET-32-BIT-INTEGER-STACK :REDUNDANT :REDUNDANT BIG-CLOCK-NEGATIVE-P [GC for 603 SFUN pages..(T=28).GC finished] DECREMENT-BIG-CLOCK LIST-ALL-PACKAGE-NAMES [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] USER-STOBJ-ALIST UPDATE-USER-STOBJ-ALIST POWER-EVAL READ-IDATE [GC for 603 SFUN pages..(T=28).GC finished] READ-RUN-TIME READ-ACL2-ORACLE READ-ACL2-ORACLE@PAR GETENV$ SETENV$ [GC for 8617 CONS pages..(T=28).GC finished] RANDOM$ NATP-RANDOM$ RANDOM$-LINEAR (:NUMBER-OF-ENABLED-RUNES 2420) SYS-CALL (:NUMBER-OF-ENABLED-RUNES 2422) SYS-CALL-STATUS T UPDATE-ACL2-ORACLE-PRESERVES-STATE-P1 [GC for 8627 CONS pages..(T=28).GC finished] (:NUMBER-OF-ENABLED-RUNES 2426) SYS-CALL+ SYS-CALL* NIL READ-RUN-TIME-PRESERVES-STATE-P1 READ-ACL2-ORACLE-PRESERVES-STATE-P1 (:NUMBER-OF-ENABLED-RUNES 2433) NIL NTH-0-READ-RUN-TIME-TYPE-PRESCRIPTION (:NUMBER-OF-ENABLED-RUNES 2433) NIL [GC for 8637 CONS pages..(T=28).GC finished] MAIN-TIMER [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] PUT-ASSOC-EQ-EXEC PUT-ASSOC-EQL-EXEC [GC for 8647 CONS pages..(T=28).GC finished] PUT-ASSOC-EQUAL :REDUNDANT :REDUNDANT PUT-ASSOC-EQ-EXEC-IS-PUT-ASSOC-EQUAL PUT-ASSOC-EQL-EXEC-IS-PUT-ASSOC-EQUAL :REDUNDANT NIL NIL NIL SET-TIMER GET-TIMER NIL [GC for 8657 CONS pages..(T=28).GC finished] PUSH-TIMER RATIONALP-+ RATIONALP-* RATIONALP-UNARY-- RATIONALP-UNARY-/ RATIONALP-IMPLIES-ACL2-NUMBERP POP-TIMER ADD-TIMERS NTH-0-CONS NIL NTH-ADD1 MAIN-TIMER-TYPE-PRESCRIPTION ORDERED-SYMBOL-ALISTP-ADD-PAIR-FORWARD ASSOC-ADD-PAIR [GC for 8667 CONS pages..(T=28).GC finished] ADD-PAIR-PRESERVES-ALL-BOUNDP STATE-P1-UPDATE-MAIN-TIMER INCREMENT-TIMER PRINT-RATIONAL-AS-DECIMAL [GC for 8677 CONS pages..(T=28).GC finished] PRINT-TIMER STATE-P1-UPDATE-PRINT-BASE SET-PRINT-BASE-RADIX [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] KNOWN-PACKAGE-ALIST SYMBOL-IN-CURRENT-PACKAGE-P [GC for 8687 CONS pages..(T=27).GC finished] PRIN1$ NIL CURRENT-PACKAGE STATE-P1-UPDATE-NTH-2-WORLD :REDUNDANT :REDUNDANT LD-SKIP-PROOFSP :REDUNDANT :REDUNDANT :REDUNDANT T [GC for 8697 CONS pages..(T=28).GC finished] MAKE-VAR-LST UNION-EQ-EXEC [GC for 603 SFUN pages..(T=29).GC finished] UNION-EQL-EXEC UNION-EQUAL :REDUNDANT UNION-EQ-EXEC-IS-UNION-EQUAL UNION-EQL-EXEC-IS-UNION-EQUAL PARSE-ARGS-AND-TEST :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8707 CONS pages..(T=28).GC finished] [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] INTERSECTION-EQ-EXEC INTERSECTION-EQL-EXEC INTERSECTION-EQUAL :REDUNDANT INTERSECTION-EQ-EXEC-IS-INTERSECTION-EQUAL INTERSECTION-EQL-EXEC-IS-INTERSECTION-EQUAL :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8717 CONS pages..(T=28).GC finished] GET-ENFORCE-REDUNDANCY :REDUNDANT DEFAULT-VERIFY-GUARDS-EAGERNESS :REDUNDANT DEFAULT-COMPILE-FNS :REDUNDANT SET-COMPILER-ENABLED [GC for 8727 CONS pages..(T=28).GC finished] SET-PORT-FILE-ENABLED DEFAULT-MEASURE-FUNCTION :REDUNDANT DEFAULT-WELL-FOUNDED-RELATION :REDUNDANT :REDUNDANT [GC for 603 SFUN pages..(T=28).GC finished] DEFAULT-DEFUN-MODE DEFAULT-DEFUN-MODE-FROM-STATE :REDUNDANT :REDUNDANT [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] INVISIBLE-FNS-TABLE :REDUNDANT UNARY-FUNCTION-SYMBOL-LISTP INVISIBLE-FNS-ENTRYP :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8737 CONS pages..(T=29).GC finished] BACKCHAIN-LIMIT :REDUNDANT DEFAULT-BACKCHAIN-LIMIT STEP-LIMIT-FROM-TABLE :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8747 CONS pages..(T=28).GC finished] REWRITE-STACK-LIMIT CASE-SPLIT-LIMITATIONS :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT UNTRANS-TABLE :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT MATCH-FREE-DEFAULT :REDUNDANT :REDUNDANT [GC for 603 SFUN pages..(T=27).GC finished] MATCH-FREE-OVERRIDE :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT RAW-INCLUDE-BOOK-DIR-P :REDUNDANT :REDUNDANT :REDUNDANT [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] NON-LINEARP :REDUNDANT :REDUNDANT TAU-AUTO-MODEP :REDUNDANT GET-IN-THEORY-REDUNDANT-OKP :REDUNDANT :REDUNDANT MACRO-ALIASES-TABLE MACRO-ALIASES :REDUNDANT MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE [GC for 8757 CONS pages..(T=29).GC finished] MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE 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 [GC for 8767 CONS pages..(T=29).GC finished] :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT T (:NUMBER-OF-ENABLED-RUNES 2642) :REDUNDANT MACRO-ALIASES-TABLE PAIRLIS$-TRUE-LIST-FIX BOOLEAN-LISTP BOOLEAN-LISTP-CONS BOOLEAN-LISTP-FORWARD BOOLEAN-LISTP-FORWARD-TO-SYMBOL-LISTP [GC for 8777 CONS pages..(T=29).GC finished] COMPLETION-OF-+ DEFAULT-+-1 DEFAULT-+-2 COMPLETION-OF-* DEFAULT-*-1 DEFAULT-*-2 COMPLETION-OF-UNARY-MINUS DEFAULT-UNARY-MINUS COMPLETION-OF-UNARY-/ DEFAULT-UNARY-/ COMPLETION-OF-< DEFAULT-<-1 DEFAULT-<-2 COMPLETION-OF-CAR DEFAULT-CAR COMPLETION-OF-CDR DEFAULT-CDR CONS-CAR-CDR COMPLETION-OF-CHAR-CODE DEFAULT-CHAR-CODE COMPLETION-OF-CODE-CHAR DEFAULT-CODE-CHAR COMPLETION-OF-COMPLEX DEFAULT-COMPLEX-1 DEFAULT-COMPLEX-2 COMPLEX-0 ADD-DEF-COMPLEX REALPART-+ IMAGPART-+ COMPLETION-OF-COERCE DEFAULT-COERCE-1 MAKE-CHARACTER-LIST-MAKE-CHARACTER-LIST DEFAULT-COERCE-2 DEFAULT-COERCE-3 COMPLETION-OF-DENOMINATOR [GC for 8787 CONS pages..(T=29).GC finished] DEFAULT-DENOMINATOR COMPLETION-OF-IMAGPART DEFAULT-IMAGPART COMPLETION-OF-INTERN-IN-PACKAGE-OF-SYMBOL DEFAULT-INTERN-IN-PACKAGE-OF-SYMBOL COMPLETION-OF-NUMERATOR DEFAULT-NUMERATOR COMPLETION-OF-REALPART DEFAULT-REALPART COMPLETION-OF-SYMBOL-NAME DEFAULT-SYMBOL-NAME COMPLETION-OF-SYMBOL-PACKAGE-NAME DEFAULT-SYMBOL-PACKAGE-NAME DOUBLE-REWRITE CHK-WITH-PROVER-TIME-LIMIT-ARG :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT TIME-LIMIT5-REACHED-P :REDUNDANT :REDUNDANT CHK-WITH-GUARD-CHECKING-ARG :REDUNDANT [GC for 754 SYMBOL pages..(T=29).GC finished] WITH-GUARD-CHECKING-GATE :REDUNDANT :REDUNDANT :REDUNDANT ABORT! :REDUNDANT [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] P! (:NUMBER-OF-ENABLED-RUNES 2695) :REDUNDANT :REDUNDANT WORMHOLE1 WORMHOLE-P [GC for 8797 CONS pages..(T=28).GC finished] DUPLICATES EVENS [GC for 8807 CONS pages..(T=29).GC finished] ODDS SET-EQUALP-EQUAL :REDUNDANT :REDUNDANT :REDUNDANT RECORD-ACCESSOR-FUNCTION-NAME :REDUNDANT [GC for 8817 CONS pages..(T=28).GC finished] MFC-CLAUSE MFC-RDEPTH TYPE-ALIST-ENTRYP TYPE-ALISTP [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] MFC-TYPE-ALIST MFC-ANCESTORS MFC-UNIFY-SUBST MFC-WORLD PSEUDO-TERM-LISTP-MFC-CLAUSE TYPE-ALISTP-MFC-TYPE-ALIST BAD-ATOM BAD-ATOM-COMPOUND-RECOGNIZER (:NUMBER-OF-ENABLED-RUNES 2748) [GC for 8827 CONS pages..(T=29).GC finished] BOOLEANP-BAD-ATOM<= BAD-ATOM<=-ANTISYMMETRIC BAD-ATOM<=-TRANSITIVE BAD-ATOM<=-TOTAL ALPHORDER LEXORDER NIL NIL NIL ALPHORDER-REFLEXIVE NIL ALPHORDER-TRANSITIVE [GC for 8837 CONS pages..(T=28).GC finished] ALPHORDER-ANTI-SYMMETRIC ALPHORDER-TOTAL (:NUMBER-OF-ENABLED-RUNES 2760) LEXORDER-REFLEXIVE LEXORDER-ANTI-SYMMETRIC LEXORDER-TRANSITIVE LEXORDER-TOTAL (:NUMBER-OF-ENABLED-RUNES 2762) MERGE-LEXORDER NIL NIL TRUE-LISTP-MERGE-SORT-LEXORDER MERGE-SORT-LEXORDER :REDUNDANT [GC for 8847 CONS pages..(T=29).GC finished] RESIZE-LIST-EXEC RESIZE-LIST RESIZE-LIST-EXEC-IS-RESIZE-LIST RESIZE-LIST E/D-FN :REDUNDANT To verify that the 30 encapsulated events correctly extend the current theory we will evaluate them. The theory thus constructed is only ephemeral. Encapsulated Events: ACL2 !>>(LOGIC) [GC for 8857 CONS pages..(T=29).GC finished] 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) The event ( DEFUN SYMBOL-LISTP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN SYMBOL-LISTP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP BINARY-APPEND) The event ( DEFUN BINARY-APPEND ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN BINARY-APPEND ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP STRING-APPEND) The event ( DEFUN STRING-APPEND ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN STRING-APPEND ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP PLIST-WORLDP) The event ( DEFUN PLIST-WORLDP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN PLIST-WORLDP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FGETPROP) The event ( DEFUN FGETPROP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN FGETPROP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SGETPROP) The event ( DEFUN SGETPROP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN SGETPROP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FUNCTION-SYMBOLP) The event ( DEFUN FUNCTION-SYMBOLP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN FUNCTION-SYMBOLP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP STRIP-CARS) The event ( DEFUN STRIP-CARS ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN STRIP-CARS ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQ-EXEC$GUARD-CHECK) The event ( DEFUN ASSOC-EQ-EXEC$GUARD-CHECK ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN ASSOC-EQ-EXEC$GUARD-CHECK ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQ-EXEC) The event ( DEFUN ASSOC-EQ-EXEC ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN ASSOC-EQ-EXEC ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TABLE-ALIST) The event ( DEFUN TABLE-ALIST ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN TABLE-ALIST ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT End of Encapsulated Events. [GC for 8867 CONS pages..(T=29).GC finished] ACL2 Observation in ( ENCAPSULATE NIL (LOGIC) ...): The submitted encapsulate event has created no new ACL2 events, and thus is leaving the ACL2 logical world unchanged. See :DOC encapsulate. Summary Form: ( ENCAPSULATE NIL (LOGIC) ...) Rules: NIL Time: 0.61 seconds (prove: 0.00, print: 0.00, other: 0.61) :EMPTY-ENCAPSULATE Since MOD-EXPT is non-recursive, its admission is trivial. We observe that the type of MOD-EXPT is described by the theorem (ACL2-NUMBERP (MOD-EXPT BASE EXP MOD)). We used the :type-prescription rule MOD. Computing the guard conjecture for MOD-EXPT.... The guard conjecture for MOD-EXPT is trivial to prove, given the :executable- counterpart of EQLABLEP and the :type-prescription rules EXPT-TYPE-PRESCRIPTION-NON-ZERO-BASE and RATIONALP-EXPT-TYPE-PRESCRIPTION. MOD-EXPT is compliant with Common Lisp. [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=37).GC finished] 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.58 seconds (prove: 0.00, print: 0.00, other: 0.58) 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.20 seconds (prove: 0.00, print: 0.00, other: 0.20) 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.22 seconds (prove: 0.00, print: 0.00, other: 0.22) 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 8877 CONS pages..(T=29).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 8887 CONS pages..(T=29).GC finished] The destructor terms (CAR KEYWORD-ALIST) and (CDR KEYWORD-ALIST) can be eliminated. Furthermore, those terms are at the root of a chain of two rounds of destructor elimination. (1) Use CAR-CDR-ELIM to replace KEYWORD-ALIST by (CONS KEYWORD-ALIST1 KEYWORD-ALIST2), (CAR KEYWORD-ALIST) by KEYWORD-ALIST1 and (CDR KEYWORD-ALIST) by KEYWORD-ALIST2. (2) Use CAR-CDR-ELIM, again, to replace KEYWORD-ALIST2 by (CONS KEYWORD-ALIST3 KEYWORD-ALIST4), (CAR KEYWORD-ALIST2) by KEYWORD-ALIST3 and (CDR KEYWORD-ALIST2) by KEYWORD-ALIST4. These steps produce the following two goals. Subgoal 2 (IMPLIES (AND (NOT (CONSP KEYWORD-ALIST2)) (CONSP (CONS KEYWORD-ALIST1 KEYWORD-ALIST2)) (NOT (EQUAL KEY KEYWORD-ALIST1))) (< (ACL2-COUNT (CDR KEYWORD-ALIST2)) (+ 1 (ACL2-COUNT KEYWORD-ALIST1) (ACL2-COUNT KEYWORD-ALIST2)))). This simplifies, using the :executable-counterpart of ACL2-COUNT, primitive type reasoning and the :rewrite rule DEFAULT-CDR, to Subgoal 2' (IMPLIES (AND (NOT (CONSP KEYWORD-ALIST2)) (NOT (EQUAL KEY KEYWORD-ALIST1))) (< 0 (+ 1 (ACL2-COUNT KEYWORD-ALIST1) (ACL2-COUNT KEYWORD-ALIST2)))). But simplification reduces this to T, using primitive type reasoning and the :type-prescription rule ACL2-COUNT. Subgoal 1 (IMPLIES (AND (CONSP (CONS KEYWORD-ALIST3 KEYWORD-ALIST4)) (CONSP (LIST* KEYWORD-ALIST1 KEYWORD-ALIST3 KEYWORD-ALIST4)) (NOT (EQUAL KEY KEYWORD-ALIST1))) (< (ACL2-COUNT KEYWORD-ALIST4) (+ 1 (ACL2-COUNT KEYWORD-ALIST1) (ACL2-COUNT (CONS KEYWORD-ALIST3 KEYWORD-ALIST4))))). This simplifies, using the :definition ACL2-COUNT, primitive type reasoning and the :rewrite rules CAR-CONS and CDR-CONS, to Subgoal 1' (IMPLIES (NOT (EQUAL KEY KEYWORD-ALIST1)) (< (ACL2-COUNT KEYWORD-ALIST4) (+ 1 (ACL2-COUNT KEYWORD-ALIST1) 1 (ACL2-COUNT KEYWORD-ALIST3) (ACL2-COUNT KEYWORD-ALIST4)))). But simplification reduces this to T, using linear arithmetic, primitive type reasoning and the :type-prescription rule ACL2-COUNT. Q.E.D. That completes the proof of the measure theorem for SPLICE-KEYWORD-ALIST. Thus, we admit this function under the principle of definition. We could deduce no constraints on the type of SPLICE-KEYWORD-ALIST. Computing the guard conjecture for SPLICE-KEYWORD-ALIST.... The non-trivial part of the guard conjecture for SPLICE-KEYWORD-ALIST, given primitive type reasoning, the :forward-chaining rules KEYWORD-VALUE-LISTP-FORWARD-TO-TRUE-LISTP and KEYWORDP-FORWARD-TO-SYMBOLP and the :type-prescription rules KEYWORD-VALUE-LISTP and KEYWORDP, is Goal (IMPLIES (AND (TRUE-LISTP NEW-SEGMENT) (KEYWORD-VALUE-LISTP KEYWORD-ALIST) (KEYWORDP KEY) (NOT (ENDP KEYWORD-ALIST)) (NOT (EQ KEY (CAR KEYWORD-ALIST)))) (KEYWORD-VALUE-LISTP (CDDR KEYWORD-ALIST))). 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 8897 CONS pages..(T=29).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<) (:ELIM CAR-CDR-ELIM) (:EXECUTABLE-COUNTERPART ACL2-COUNT) (:FAKE-RUNE-FOR-LINEAR NIL) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING KEYWORD-VALUE-LISTP-FORWARD-TO-TRUE-LISTP) (:FORWARD-CHAINING KEYWORDP-FORWARD-TO-SYMBOLP) (:REWRITE CAR-CONS) (:REWRITE CDR-CONS) (:REWRITE DEFAULT-CDR) (:TYPE-PRESCRIPTION ACL2-COUNT) (:TYPE-PRESCRIPTION KEYWORD-VALUE-LISTP) (:TYPE-PRESCRIPTION KEYWORDP)) Time: 1.24 seconds (prove: 0.90, print: 0.00, other: 0.34) Prover steps counted: 1836 SPLICE-KEYWORD-ALIST The event ( DEFMACRO SHOW-CUSTOM-KEYWORD-HINT-EXPANSION ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO SHOW-CUSTOM-KEYWORD-HINT-EXPANSION ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since SEARCH-FN-GUARD is non-recursive, its admission is trivial. We observe that the type of SEARCH-FN-GUARD is described by the theorem (OR (EQUAL (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P) T) (EQUAL (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P) NIL)). We used primitive type reasoning and the :type-prescription rules HARD-ERROR and STANDARD-CHAR-LISTP. Computing the guard conjecture for SEARCH-FN-GUARD.... [GC for 8907 CONS pages..(T=29).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 8917 CONS pages..(T=29).GC finished] [GC for 8927 CONS pages..(T=29).GC finished] [GC for 8937 CONS pages..(T=28).GC finished] [GC for 8947 CONS pages..(T=28).GC finished] TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.15 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 8957 CONS pages..(T=28).GC finished] [GC for 8967 CONS pages..(T=27).GC finished] [GC for 8977 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.41 seconds (prove: 2.00, print: 0.01, other: 0.40) Prover steps counted: 1480 TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent in the tau system was 1.99 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 8987 CONS pages..(T=29).GC finished] By case analysis we reduce the conjecture to the following two conjectures. Subgoal 2 (O-P (NFIX (+ 1 END2 (- START2)))). But simplification reduces this to T, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definitions NFIX, O-FINP and O-P and primitive type reasoning. Subgoal 1 (IMPLIES (AND (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2)))) (NOT (EQUAL SEQ1 (SUBSEQ SEQ2 START2 (+ START2 (LENGTH SEQ1))))) (< (+ START2 (LENGTH SEQ1)) END2)) (O< (NFIX (+ 1 END2 (- (+ 1 START2)))) (NFIX (+ 1 END2 (- START2))))). This simplifies, using the :definitions LENGTH (if-intro), NFIX (if- intro), NOT (if-intro), O-FINP and O< (if-intro), the :executable- counterpart of NOT and primitive type reasoning, to the following six conjectures. Subgoal 1.6 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (STRINGP SEQ1) (NOT (EQUAL SEQ1 (SUBSEQ SEQ2 START2 (+ START2 (LEN (COERCE SEQ1 'LIST)))))) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2)) (<= 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.5 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (STRINGP SEQ1) (NOT (EQUAL SEQ1 (SUBSEQ SEQ2 START2 (+ START2 (LEN (COERCE SEQ1 'LIST)))))) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (< (+ 1 END2 (- (+ 1 START2))) 0)) (< 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.4 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (STRINGP SEQ1) (NOT (EQUAL SEQ1 (SUBSEQ SEQ2 START2 (+ START2 (LEN (COERCE SEQ1 'LIST)))))) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= 0 (+ 1 END2 (- (+ 1 START2))))) (< (+ 1 END2 (- (+ 1 START2))) (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.3 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (NOT (STRINGP SEQ1)) (NOT (EQUAL SEQ1 (SUBSEQ SEQ2 START2 (+ START2 (LEN SEQ1))))) (< (+ START2 (LEN SEQ1)) END2)) (<= 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.2 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (NOT (STRINGP SEQ1)) (NOT (EQUAL SEQ1 (SUBSEQ SEQ2 START2 (+ START2 (LEN SEQ1))))) (< (+ START2 (LEN SEQ1)) END2) (< (+ 1 END2 (- (+ 1 START2))) 0)) (< 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.1 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (NOT (STRINGP SEQ1)) (NOT (EQUAL SEQ1 (SUBSEQ SEQ2 START2 (+ START2 (LEN SEQ1))))) (< (+ START2 (LEN SEQ1)) END2) (<= 0 (+ 1 END2 (- (+ 1 START2))))) (< (+ 1 END2 (- (+ 1 START2))) (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Q.E.D. That completes the proof of the measure theorem for SEARCH-FROM-START. Thus, we admit this function under the principle of definition. We observe that the type of SEARCH-FROM-START is described by the theorem (OR (INTEGERP (SEARCH-FROM-START SEQ1 SEQ2 START2 END2)) (EQUAL (SEARCH-FROM-START SEQ1 SEQ2 START2 END2) NIL)). Computing the guard conjecture for SEARCH-FROM-START.... [GC for 8997 CONS pages..(T=29).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 9007 CONS pages..(T=29).GC finished] [GC for 9017 CONS pages..(T=29).GC finished] [GC for 9027 CONS pages..(T=28).GC finished] [GC for 9037 CONS pages..(T=29).GC finished] [GC for 9037 CONS pages..(T=29).GC finished] TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.49 secs; see :DOC time-tracker-tau. [GC for 9037 CONS pages..(T=29).GC finished] [GC for 9037 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)) (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 9037 CONS pages..(T=28).GC finished] This simplifies, using the :definitions LENGTH, NOT (if-intro), SUBSEQ and SUBSEQ-LIST, the :executable-counterpart of NOT, primitive type reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription rule LEN, to the following three conjectures. Subgoal 4.3 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (TRUE-LISTP SEQ1)) (<= (+ START2 (LEN SEQ1)) (LEN SEQ2))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 4.2 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (TRUE-LISTP SEQ1)) (<= START2 (+ START2 (LEN SEQ1)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 4.1 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (TRUE-LISTP SEQ1) (NOT (EQUAL SEQ1 (TAKE (+ (- START2) START2 (LEN SEQ1)) (NTHCDR START2 SEQ2)))) (< (+ START2 (LEN SEQ1)) END2)) (<= (+ 1 START2 (LEN SEQ1)) END2)). [GC for 9037 CONS pages..(T=29).GC finished] 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 9037 CONS pages..(T=28).GC finished] This simplifies, using the :definitions LENGTH, NOT (if-intro), SUBSEQ and SUBSEQ-LIST, the :executable-counterpart of NOT, primitive type reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription rules LEN and TRUE-LISTP-TAKE, to the following three conjectures. Subgoal 3.3 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1)) (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) (LEN SEQ2))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 3.2 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1)) (<= START2 (+ START2 (LEN (COERCE SEQ1 'LIST))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 3.1 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2)) (<= (+ 1 START2 (LEN (COERCE SEQ1 'LIST))) END2)). [GC for 9037 CONS pages..(T=28).GC finished] 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 9037 CONS pages..(T=28).GC finished] [GC for 9037 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 rule COMMUTATIVITY-OF-+ and the :type-prescription rule LEN, to the following three conjectures. Subgoal 2.3 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (TRUE-LISTP SEQ1)) (<= (+ START2 (LEN SEQ1)) (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 2.2 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (TRUE-LISTP SEQ1)) (<= START2 (+ START2 (LEN SEQ1)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 2.1 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (TRUE-LISTP SEQ1) (< (+ START2 (LEN SEQ1)) END2)) (<= (+ 1 START2 (LEN SEQ1)) END2)). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1 (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1)) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (<= 0 START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (INTEGERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL BOUND2 NIL) (<= BOUND2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL BOUND2 NIL) (INTEGERP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (NOT BOUND2) (<= START2 BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) BOUND2 (<= START2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= (+ 1 START2 (LENGTH SEQ1)) END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))). [GC for 9037 CONS pages..(T=29).GC finished] [GC for 9037 CONS pages..(T=29).GC finished] [GC for 9037 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 rule COMMUTATIVITY-OF-+ and the :type-prescription rule LEN, to the following three conjectures. Subgoal 1.3 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1)) (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.2 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1)) (<= START2 (+ START2 (LEN (COERCE SEQ1 'LIST))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.1 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1) (NOT (EQUAL SEQ1 (COERCE (TAKE (+ (- START2) START2 (LEN (COERCE SEQ1 'LIST))) (NTHCDR START2 (COERCE SEQ2 'LIST))) 'STRING))) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2)) (<= (+ 1 START2 (LEN (COERCE SEQ1 'LIST))) END2)). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Q.E.D. That completes the proof of the guard theorem for SEARCH-FROM-START. SEARCH-FROM-START is compliant with Common Lisp. [GC for 1954 RELOCATABLE-BLOCKS pages..(T=29).GC finished] Summary Form: ( DEFUN SEARCH-FROM-START ...) Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER) (:DEFINITION LENGTH) (:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION NULL) (:DEFINITION O-FINP) (:DEFINITION O-P) (:DEFINITION O<) (:DEFINITION SUBSEQ) (:DEFINITION SUBSEQ-LIST) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE ASSOCIATIVITY-OF-+) (:REWRITE COMMUTATIVITY-OF-+) (:TYPE-PRESCRIPTION LEN) (:TYPE-PRESCRIPTION LENGTH) (:TYPE-PRESCRIPTION TRUE-LISTP-TAKE)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION LENGTH) (:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION O<)) Time: 6.06 seconds (prove: 5.06, print: 0.04, other: 0.96) Prover steps counted: 11094 TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent in the tau system was 3.53 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 case analysis we reduce the conjecture to the following two conjectures. Subgoal 2 (O-P (NFIX (+ 1 END2 (- START2)))). But simplification reduces this to T, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definitions NFIX, O-FINP and O-P and primitive type reasoning. Subgoal 1 (IMPLIES (AND (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2)))) (< (+ START2 (LENGTH SEQ1)) END2)) (O< (NFIX (+ 1 END2 (- (+ 1 START2)))) (NFIX (+ 1 END2 (- START2))))). This simplifies, using the :definitions LENGTH (if-intro), NFIX (if- intro), NOT (if-intro), O-FINP and O< (if-intro), the :executable- counterpart of NOT and primitive type reasoning, to the following six conjectures. Subgoal 1.6 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (STRINGP SEQ1) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2)) (<= 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.5 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (STRINGP SEQ1) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (< (+ 1 END2 (- (+ 1 START2))) 0)) (< 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.4 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (STRINGP SEQ1) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= 0 (+ 1 END2 (- (+ 1 START2))))) (< (+ 1 END2 (- (+ 1 START2))) (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.3 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (NOT (STRINGP SEQ1)) (< (+ START2 (LEN SEQ1)) END2)) (<= 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.2 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (NOT (STRINGP SEQ1)) (< (+ START2 (LEN SEQ1)) END2) (< (+ 1 END2 (- (+ 1 START2))) 0)) (< 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.1 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (NOT (STRINGP SEQ1)) (< (+ START2 (LEN SEQ1)) END2) (<= 0 (+ 1 END2 (- (+ 1 START2))))) (< (+ 1 END2 (- (+ 1 START2))) (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Q.E.D. That completes the proof of the measure theorem for SEARCH-FROM-END. Thus, we admit this function under the principle of definition. We observe that the type of SEARCH-FROM-END is described by the theorem (OR (OR (INTEGERP (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 ACC)) (EQUAL (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 ACC) NIL)) (EQUAL (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 ACC) ACC) (EQUAL (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 ACC) START2)). We used primitive type reasoning. Computing the guard conjecture for SEARCH-FROM-END.... [GC for 9037 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))) (LET NIL (LET NIL (AND (RATIONALP BOUND2) (RATIONALP END2) (OR (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (<= END2 BOUND2) (INTEGERP END2)) (OR (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (<= END2 BOUND2) (<= (+ (+ 1 START2) (LENGTH SEQ1)) END2)) (OR (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2)))))))) (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1) (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))))) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (<= 0 START2) (INTEGERP START2) (OR (NULL BOUND2) (<= BOUND2 (LENGTH SEQ2))) (OR (NULL BOUND2) (INTEGERP BOUND2)) (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (NOT BOUND2) (<= START2 BOUND2)) (OR BOUND2 (<= START2 (LENGTH SEQ2))) (LET NIL (LET NIL (AND (RATIONALP BOUND2) (RATIONALP END2) (OR (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (<= END2 BOUND2) (INTEGERP END2)) (OR (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (<= END2 BOUND2) (<= (+ (+ 1 START2) (LENGTH SEQ1)) END2)) (OR (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2)))))))) (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (TRUE-LISTP SEQ1) (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))))) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (<= 0 START2) (INTEGERP START2) (OR (NULL BOUND2) (<= BOUND2 (LENGTH SEQ2))) (OR (NULL BOUND2) (INTEGERP BOUND2)) (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (NOT BOUND2) (<= START2 BOUND2)) (OR BOUND2 (<= START2 (LENGTH SEQ2))) (LET NIL (LET NIL (AND (RATIONALP BOUND2) (RATIONALP END2) (OR (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (<= END2 BOUND2) (INTEGERP END2)) (OR (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (<= END2 BOUND2) (<= (+ (+ 1 START2) (LENGTH SEQ1)) END2)) (OR (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2)))))))) (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1) (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))))) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (<= 0 START2) (INTEGERP START2) (OR (NULL BOUND2) (<= BOUND2 (LENGTH SEQ2))) (OR (NULL BOUND2) (INTEGERP BOUND2)) (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (NOT BOUND2) (<= START2 BOUND2)) (OR BOUND2 (<= START2 (LENGTH SEQ2))) (LET NIL (LET NIL (AND (RATIONALP BOUND2) (RATIONALP END2) (OR (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (<= END2 BOUND2) (INTEGERP END2)) (OR (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (<= END2 BOUND2) (<= (+ (+ 1 START2) (LENGTH SEQ1)) END2)) (OR (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))))))). [GC for 9037 CONS pages..(T=27).GC finished] [GC for 9037 CONS pages..(T=28).GC finished] [GC for 9037 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))) (LET NIL (AND (RATIONALP BOUND2) (RATIONALP END2) (OR (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (<= END2 BOUND2) (INTEGERP END2)) (OR (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (<= END2 BOUND2) (<= (+ 1 START2 (LENGTH SEQ1)) END2)) (OR (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))))). [GC for 9037 CONS pages..(T=28).GC finished] TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.15 secs; see :DOC time-tracker-tau. This simplifies, using the :definitions LENGTH and NOT (if-intro), the :executable-counterpart of NOT, primitive type reasoning and the :type-prescription rule LEN, to the following three conjectures. Subgoal 4.3 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (TRUE-LISTP SEQ1)) (<= (+ START2 (LEN SEQ1)) (LEN SEQ2))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 4.2 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (TRUE-LISTP SEQ1)) (<= START2 (+ START2 (LEN SEQ1)))). [GC for 9037 CONS pages..(T=28).GC finished] But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 4.1 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (TRUE-LISTP SEQ1) (< (+ START2 (LEN SEQ1)) END2)) (<= (+ 1 START2 (LEN SEQ1)) END2)). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 3 (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1) (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))))) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (<= 0 START2) (INTEGERP START2) (OR (EQUAL BOUND2 NIL) (<= BOUND2 (LENGTH SEQ2))) (OR (EQUAL BOUND2 NIL) (INTEGERP BOUND2)) (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (NOT BOUND2) (<= START2 BOUND2)) (OR BOUND2 (<= START2 (LENGTH SEQ2))) (LET NIL (AND (RATIONALP BOUND2) (RATIONALP END2) (OR (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (<= END2 BOUND2) (INTEGERP END2)) (OR (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (<= END2 BOUND2) (<= (+ 1 START2 (LENGTH SEQ1)) END2)) (OR (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))))). [GC for 9037 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 3.3 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1)) (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) (LEN SEQ2))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 3.2 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1)) (<= START2 (+ START2 (LEN (COERCE SEQ1 'LIST))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 3.1 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2)) (<= (+ 1 START2 (LEN (COERCE SEQ1 'LIST))) END2)). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 2 (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (TRUE-LISTP SEQ1) (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))))) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (<= 0 START2) (INTEGERP START2) (OR (EQUAL BOUND2 NIL) (<= BOUND2 (LENGTH SEQ2))) (OR (EQUAL BOUND2 NIL) (INTEGERP BOUND2)) (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (NOT BOUND2) (<= START2 BOUND2)) (OR BOUND2 (<= START2 (LENGTH SEQ2))) (LET NIL (AND (RATIONALP BOUND2) (RATIONALP END2) (OR (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (<= END2 BOUND2) (INTEGERP END2)) (OR (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (<= END2 BOUND2) (<= (+ 1 START2 (LENGTH SEQ1)) END2)) (OR (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))))). [GC for 9037 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))) (LET NIL (AND (RATIONALP BOUND2) (RATIONALP END2) (OR (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (<= END2 BOUND2) (INTEGERP END2)) (OR (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (<= END2 BOUND2) (<= (+ 1 START2 (LENGTH SEQ1)) END2)) (OR (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))))). [GC for 9037 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))))). 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. [GC for 9037 CONS pages..(T=28).GC finished] Summary Form: ( DEFUN SEARCH-FROM-END ...) Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER) (:DEFINITION LENGTH) (:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION NULL) (:DEFINITION O-FINP) (:DEFINITION O-P) (:DEFINITION O<) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE ASSOCIATIVITY-OF-+) (:TYPE-PRESCRIPTION LEN) (:TYPE-PRESCRIPTION LENGTH)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION LENGTH) (:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION O<)) Time: 3.26 seconds (prove: 2.34, print: 0.03, other: 0.89) Prover steps counted: 5254 TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent in the tau system was 1.74 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))). 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))). [GC for 9037 CONS pages..(T=29).GC finished] 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.30 seconds (prove: 0.30, print: 0.00, other: 0.00) Prover steps counted: 555 STANDARD-CHAR-LISTP-NTHCDR ACL2 !>>(LOCAL (DEFTHM STANDARD-CHAR-LISTP-REVAPPEND (IMPLIES (AND (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))) :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP))))) [Note: A hint was supplied for our processing of the goal above. Thanks!] Name the formula above *1. Perhaps we can prove *1 by induction. Three induction schemes are suggested by this conjecture. These merge into two derived induction schemes. However, one of these is flawed and so we are left with one viable candidate. We will induct according to a scheme suggested by (REVAPPEND X AC). This suggestion was produced using the :induction rules REVAPPEND and STANDARD-CHAR-LISTP. If we let (:P AC X) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP X)) (:P (CONS (CAR X) AC) (CDR X))) (:P AC X)) (IMPLIES (ENDP X) (:P AC X))). This induction is justified by the same argument used to admit REVAPPEND. Note, however, that the unmeasured variable AC is being instantiated. When applied to the goal at hand the above induction scheme produces four nontautological subgoals. Subgoal *1/4 (IMPLIES (AND (NOT (ENDP X)) (STANDARD-CHAR-LISTP (REVAPPEND (CDR X) (CONS (CAR X) AC))) (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/4' (IMPLIES (AND (CONSP X) (STANDARD-CHAR-LISTP (REVAPPEND (CDR X) (CONS (CAR X) AC))) (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))). But simplification reduces this to T, using the :definitions REVAPPEND and STANDARD-CHAR-LISTP and the :type-prescription rule STANDARD-CHAR-LISTP. Subgoal *1/3 (IMPLIES (AND (NOT (ENDP X)) (NOT (STANDARD-CHAR-LISTP (CONS (CAR X) AC))) (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/3' (IMPLIES (AND (CONSP X) (NOT (STANDARD-CHAR-LISTP (CONS (CAR X) AC))) (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))). But simplification reduces this to T, using the :definition STANDARD-CHAR-LISTP, primitive type reasoning, the :forward-chaining rules ATOM-LISTP-FORWARD-TO-TRUE-LISTP, CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP, EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP and STANDARD-CHAR-LISTP-FORWARD-TO-CHARACTER-LISTP, the :rewrite rules CAR-CONS and CDR-CONS and the :type-prescription rules ATOM-LISTP, CHARACTER-LISTP, EQLABLE-LISTP, STANDARD-CHAR-LISTP and STANDARD-CHAR-P. Subgoal *1/2 (IMPLIES (AND (NOT (ENDP X)) (NOT (STANDARD-CHAR-LISTP (CDR X))) (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))). [GC for 9037 CONS pages..(T=28).GC finished] 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.30, print: 0.00, other: 0.01) 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. 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))). [GC for 9037 CONS pages..(T=28).GC finished] 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.30 seconds (prove: 0.30, 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))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP and LEN, the :executable-counterparts of CDR, CONSP and LEN, primitive type reasoning and the :type-prescription rule LEN. Subgoal *1/2 (IMPLIES (AND (NOT (ZP N)) (NOT (CHARACTER-LISTP (CDR X))) (CHARACTER-LISTP X) (<= N (LEN X))) (CHARACTER-LISTP (TAKE N X))). But simplification reduces this to T, using the :definition CHARACTER-LISTP, the :executable-counterparts of CDR, CHARACTER-LISTP, CONSP and LEN and primitive type reasoning. Subgoal *1/1 (IMPLIES (AND (ZP N) (CHARACTER-LISTP X) (<= N (LEN X))) (CHARACTER-LISTP (TAKE N X))). [GC for 9037 CONS pages..(T=28).GC finished] But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP, LEN and TAKE, the :executable-counterparts of CHARACTER-LISTP, CONSP and LEN and primitive type reasoning. That completes the proof of *1. Q.E.D. The storage of CHARACTER-LISTP-OF-TAKE depends upon the :type-prescription rule CHARACTER-LISTP. Summary Form: ( DEFTHM CHARACTER-LISTP-OF-TAKE ...) Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER) (:DEFINITION CHARACTER-LISTP) (:DEFINITION LEN) (:DEFINITION NOT) (:DEFINITION TAKE) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CHARACTER-LISTP) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART LEN) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION CHARACTER-LISTP) (:INDUCTION LEN) (:INDUCTION TAKE) (:REWRITE CAR-CONS) (:REWRITE CDR-CONS) (:TYPE-PRESCRIPTION CHARACTER-LISTP) (:TYPE-PRESCRIPTION LEN) (:TYPE-PRESCRIPTION TRUE-LISTP-TAKE)) Time: 0.30 seconds (prove: 0.30, print: 0.00, other: 0.00) Prover steps counted: 532 CHARACTER-LISTP-OF-TAKE ACL2 !>>(LOCAL (DEFTHM CHARACTER-LISTP-NTHCDR (IMPLIES (CHARACTER-LISTP X) (CHARACTER-LISTP (NTHCDR N X))))) Name the formula above *1. Perhaps we can prove *1 by induction. Two induction schemes are suggested by this conjecture. These merge into one derived induction scheme. We will induct according to a scheme suggested by (NTHCDR N X). This suggestion was produced using the :induction rules CHARACTER-LISTP and NTHCDR. If we let (:P N X) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ZP N)) (:P (+ N -1) (CDR X))) (:P N X)) (IMPLIES (ZP N) (:P N X))). This induction is justified by the same argument used to admit NTHCDR. Note, however, that the unmeasured variable X is being instantiated. When applied to the goal at hand the above induction scheme produces three nontautological subgoals. Subgoal *1/3 (IMPLIES (AND (NOT (ZP N)) (CHARACTER-LISTP (NTHCDR (+ N -1) (CDR X))) (CHARACTER-LISTP X)) (CHARACTER-LISTP (NTHCDR N X))). This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP and NTHCDR, the :executable-counterparts of CDR and CONSP, primitive type reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription rule CHARACTER-LISTP, to Subgoal *1/3' (IMPLIES (AND (NOT (ZP N)) (CHARACTER-LISTP (NTHCDR (+ N -1) NIL)) (NOT X)) (CHARACTER-LISTP (NTHCDR (+ -1 N) NIL))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/2 (IMPLIES (AND (NOT (ZP N)) (NOT (CHARACTER-LISTP (CDR X))) (CHARACTER-LISTP X)) (CHARACTER-LISTP (NTHCDR N X))). But simplification reduces this to T, using the :definition CHARACTER-LISTP, the :executable-counterparts of CDR, CHARACTER-LISTP and CONSP and primitive type reasoning. Subgoal *1/1 (IMPLIES (AND (ZP N) (CHARACTER-LISTP X)) (CHARACTER-LISTP (NTHCDR N X))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP and NTHCDR, the :executable-counterparts of CHARACTER-LISTP and CONSP, primitive type reasoning and the :type-prescription rule CHARACTER-LISTP. That completes the proof of *1. Q.E.D. The storage of CHARACTER-LISTP-NTHCDR depends upon the :type-prescription rule CHARACTER-LISTP. Summary Form: ( DEFTHM CHARACTER-LISTP-NTHCDR ...) Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER) (:DEFINITION CHARACTER-LISTP) (:DEFINITION NOT) (:DEFINITION NTHCDR) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CHARACTER-LISTP) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION CHARACTER-LISTP) (:INDUCTION NTHCDR) (:REWRITE COMMUTATIVITY-OF-+) (:TYPE-PRESCRIPTION CHARACTER-LISTP)) Time: 0.01 seconds (prove: 0.01, print: 0.00, other: 0.00) Prover steps counted: 442 CHARACTER-LISTP-NTHCDR ACL2 !>>(LOCAL (DEFTHM NTHCDR-NIL (EQUAL (NTHCDR N NIL) NIL))) By case analysis we reduce the conjecture to Goal' (NOT (NTHCDR N NIL)). Name the formula above *1. Perhaps we can prove *1 by induction. One induction scheme is suggested by this conjecture. We will induct according to a scheme suggested by (NTHCDR N NIL). This suggestion was produced using the :induction rule NTHCDR. If we let (:P N) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ZP N)) (:P (+ N -1))) (:P N)) (IMPLIES (ZP N) (:P N))). This induction is justified by the same argument used to admit NTHCDR. When applied to the goal at hand the above induction scheme produces two nontautological subgoals. Subgoal *1/2 (IMPLIES (AND (NOT (ZP N)) (NOT (NTHCDR (+ N -1) NIL))) (NOT (NTHCDR N NIL))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER and the :definition NTHCDR. Subgoal *1/1 (IMPLIES (ZP N) (NOT (NTHCDR N NIL))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER and the :definition NTHCDR. That completes the proof of *1. Q.E.D. Summary Form: ( DEFTHM NTHCDR-NIL ...) Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER) (:DEFINITION NOT) (:DEFINITION NTHCDR) (:INDUCTION NTHCDR)) Time: 0.01 seconds (prove: 0.01, print: 0.00, other: 0.00) Prover steps counted: 135 NTHCDR-NIL ACL2 !>>(LOCAL (DEFTHM LEN-NTHCDR (EQUAL (LEN (NTHCDR N X)) (NFIX (- (LEN X) (NFIX N)))))) This simplifies, using the :definition NFIX (if-intro), to the following three conjectures. Subgoal 3 (IMPLIES (NOT (INTEGERP N)) (EQUAL (LEN (NTHCDR N X)) (NFIX (+ (LEN X) 0)))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions FIX, NFIX and NTHCDR, primitive type reasoning, the :rewrite rules COMMUTATIVITY-OF-+ and UNICITY-OF-0 and the :type-prescription rule LEN. Subgoal 2 (IMPLIES (AND (INTEGERP N) (<= 0 N)) (EQUAL (LEN (NTHCDR N X)) (NFIX (+ (LEN X) (- N))))). This simplifies, using the :definition NFIX (if-intro), primitive type reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription rule LEN, to the following two conjectures. Subgoal 2.2 (IMPLIES (AND (INTEGERP N) (<= 0 N) (< (+ (- N) (LEN X)) 0)) (EQUAL (LEN (NTHCDR N X)) 0)). [GC for 9037 CONS pages..(T=27).GC finished] Name the formula above *1. Subgoal 2.1 (IMPLIES (AND (INTEGERP N) (<= 0 N) (<= 0 (+ (- N) (LEN X)))) (EQUAL (LEN (NTHCDR N X)) (+ (- N) (LEN X)))). Normally we would attempt to prove Subgoal 2.1 by induction. However, we prefer in this instance to focus on the original input conjecture rather than this simplified special case. We therefore abandon our previous work on this conjecture and reassign the name *1 to the original conjecture. (See :DOC otf-flg.) Perhaps we can prove *1 by induction. Two induction schemes are suggested by this conjecture. These merge into one derived induction scheme. We will induct according to a scheme suggested by (LEN X), but modified to accommodate (NTHCDR N X). These suggestions were produced using the :induction rules LEN and NTHCDR. If we let (:P N X) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (NOT (CONSP X)) (:P N X)) (IMPLIES (AND (CONSP X) (:P (+ N -1) (CDR X))) (:P N X))). This induction is justified by the same argument used to admit LEN. Note, however, that the unmeasured variable N is being instantiated. When applied to the goal at hand the above induction scheme produces two nontautological subgoals. Subgoal *1/2 (IMPLIES (NOT (CONSP X)) (EQUAL (LEN (NTHCDR N X)) (NFIX (+ (LEN X) (- (NFIX N)))))). This simplifies, using the :definitions FIX (if-intro), LEN, NFIX (if- intro) and NTHCDR (if-intro), primitive type reasoning and the :rewrite rule UNICITY-OF-0, to the following two conjectures. Subgoal *1/2.2 (IMPLIES (AND (NOT (CONSP X)) (ZP N)) (EQUAL (LEN X) 0)). But simplification reduces this to T, using the :definition LEN and the :executable-counterpart of EQUAL. Subgoal *1/2.1 (IMPLIES (AND (NOT (CONSP X)) (NOT (ZP N))) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) 0)). But simplification reduces this to T, using the :executable-counterparts of EQUAL and LEN and the :rewrite rules COMMUTATIVITY-OF-+, DEFAULT-CDR and NTHCDR-NIL. Subgoal *1/1 (IMPLIES (AND (CONSP X) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) (- (NFIX (+ N -1))))))) (EQUAL (LEN (NTHCDR N X)) (NFIX (+ (LEN X) (- (NFIX N)))))). This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions FIX, LEN, NFIX (if-intro) and NTHCDR (if-intro), the :executable-counterpart of UNARY--, primitive type reasoning, the :rewrite rules ASSOCIATIVITY-OF-+, COMMUTATIVITY-OF-+ and UNICITY-OF-0 and the :type-prescription rule LEN, to the following eight conjectures. Subgoal *1/1.8 (IMPLIES (AND (CONSP X) (INTEGERP (+ -1 N)) (<= 0 (+ -1 N)) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) (- (+ -1 N))))) (< (+ (- N) 1 (LEN (CDR X))) 0)) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) 0)). This simplifies, using the :definition NFIX, the :executable-counterpart of EQUAL, primitive type reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription rule LEN, to Subgoal *1/1.8' (IMPLIES (AND (CONSP X) (INTEGERP (+ -1 N)) (<= 0 (+ -1 N)) (<= 0 (+ (- (+ -1 N)) (LEN (CDR X)))) (EQUAL (LEN (NTHCDR (+ -1 N) (CDR X))) (+ (- (+ -1 N)) (LEN (CDR X)))) (< (+ (- N) 1 (LEN (CDR X))) 0)) (EQUAL (LEN (NTHCDR (+ -1 N) (CDR X))) 0)). [GC for 9037 CONS pages..(T=28).GC finished] But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/1.7 (IMPLIES (AND (CONSP X) (INTEGERP (+ -1 N)) (<= 0 (+ -1 N)) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) (- (+ -1 N))))) (<= 0 (+ (- N) 1 (LEN (CDR X))))) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (+ (- N) 1 (LEN (CDR X))))). This simplifies, using the :definition NFIX (if-intro), primitive type reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription rule LEN, to the following two conjectures. Subgoal *1/1.7.2 (IMPLIES (AND (CONSP X) (INTEGERP (+ -1 N)) (<= 0 (+ -1 N)) (< (+ (- (+ -1 N)) (LEN (CDR X))) 0) (EQUAL (LEN (NTHCDR (+ -1 N) (CDR X))) 0) (<= 0 (+ (- N) 1 (LEN (CDR X))))) (EQUAL 0 (+ (- N) 1 (LEN (CDR X))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/1.7.1 (IMPLIES (AND (CONSP X) (INTEGERP (+ -1 N)) (<= 0 (+ -1 N)) (<= 0 (+ (- (+ -1 N)) (LEN (CDR X)))) (EQUAL (LEN (NTHCDR (+ -1 N) (CDR X))) (+ (- (+ -1 N)) (LEN (CDR X)))) (<= 0 (+ (- N) 1 (LEN (CDR X))))) (EQUAL (LEN (NTHCDR (+ -1 N) (CDR X))) (+ (- N) 1 (LEN (CDR X))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/1.6 (IMPLIES (AND (CONSP X) (< (+ -1 N) 0) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) 0))) (ZP N) (NOT (INTEGERP N))) (EQUAL (LEN X) (NFIX (+ 1 (LEN (CDR X)) 0)))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions FIX, LEN and NFIX, primitive type reasoning, the :rewrite rules COMMUTATIVITY-OF-+ and UNICITY-OF-0 and the :type-prescription rule LEN. Subgoal *1/1.5 (IMPLIES (AND (CONSP X) (< (+ -1 N) 0) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) 0))) (NOT (ZP N)) (NOT (INTEGERP N))) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ 1 (LEN (CDR X)) 0)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/1.4 (IMPLIES (AND (CONSP X) (< (+ -1 N) 0) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) 0))) (NOT (ZP N)) (INTEGERP N) (<= 0 N)) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ 1 (LEN (CDR X)) (- N))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/1.3 (IMPLIES (AND (CONSP X) (< (+ -1 N) 0) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) 0))) (ZP N) (INTEGERP N) (<= 0 N)) (EQUAL (LEN X) (NFIX (+ 1 (LEN (CDR X)) (- N))))). This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :executable-counterparts of <, BINARY-+, INTEGERP, NOT, UNARY-- and ZP and linear arithmetic, to Subgoal *1/1.3' (IMPLIES (AND (CONSP X) (EQUAL (LEN (NTHCDR -1 (CDR X))) (NFIX (+ (LEN (CDR X)) 0)))) (EQUAL (LEN X) (NFIX (+ 1 (LEN (CDR X)) 0)))). But simplification reduces this to T, using the :definitions FIX, LEN, NFIX and NTHCDR, the :executable-counterpart of ZP, primitive type reasoning, the :rewrite rules COMMUTATIVITY-OF-+ and UNICITY-OF-0 and the :type-prescription rule LEN. Subgoal *1/1.2 (IMPLIES (AND (CONSP X) (< (+ -1 N) 0) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) 0))) (ZP N) (< N 0)) (EQUAL (LEN X) (NFIX (+ 1 (LEN (CDR X)) 0)))). [GC for 9037 CONS pages..(T=28).GC finished] But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions FIX, LEN and NFIX, primitive type reasoning, the :rewrite rules COMMUTATIVITY-OF-+ and UNICITY-OF-0 and the :type-prescription rule LEN. Subgoal *1/1.1 (IMPLIES (AND (CONSP X) (< (+ -1 N) 0) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) 0))) (NOT (ZP N)) (< N 0)) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ 1 (LEN (CDR X)) 0)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. That completes the proof of *1. Q.E.D. Summary Form: ( DEFTHM LEN-NTHCDR ...) Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER) (:DEFINITION FIX) (:DEFINITION LEN) (:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION NTHCDR) (:EXECUTABLE-COUNTERPART <) (:EXECUTABLE-COUNTERPART BINARY-+) (:EXECUTABLE-COUNTERPART EQUAL) (:EXECUTABLE-COUNTERPART INTEGERP) (:EXECUTABLE-COUNTERPART LEN) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:EXECUTABLE-COUNTERPART UNARY--) (:EXECUTABLE-COUNTERPART ZP) (:FAKE-RUNE-FOR-LINEAR NIL) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION LEN) (:INDUCTION NTHCDR) (:REWRITE ASSOCIATIVITY-OF-+) (:REWRITE COMMUTATIVITY-OF-+) (:REWRITE DEFAULT-CDR) (:REWRITE NTHCDR-NIL) (:REWRITE UNICITY-OF-0) (:TYPE-PRESCRIPTION LEN)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION FIX) (:DEFINITION NFIX) (:DEFINITION NTHCDR)) Time: 0.90 seconds (prove: 0.89, print: 0.01, other: 0.00) Prover steps counted: 2873 LEN-NTHCDR ACL2 !>>(LOCAL (DEFTHM SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP (IMPLIES (AND (STRINGP SEQ) (NATP START) (NATP END) (<= START END) (<= END (LENGTH SEQ)) (STANDARD-CHAR-LISTP (COERCE SEQ 'LIST))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ START END) 'LIST))))) ACL2 Warning [Non-rec] in ( DEFTHM SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP ...): A :REWRITE rule generated from SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP will be triggered only by terms containing the function symbol SUBSEQ, which has a non-recursive definition. Unless this definition is disabled, this rule is unlikely ever to be used. By the simple :definition NATP we reduce the conjecture to Goal' (IMPLIES (AND (STRINGP SEQ) (INTEGERP START) (<= 0 START) (INTEGERP END) (<= 0 END) (<= START END) (<= END (LENGTH SEQ)) (STANDARD-CHAR-LISTP (COERCE SEQ 'LIST))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ START END) 'LIST))). This simplifies, using the :definitions LENGTH, SUBSEQ and SUBSEQ-LIST, to Goal'' (IMPLIES (AND (STRINGP SEQ) (INTEGERP START) (<= 0 START) (INTEGERP END) (<= 0 END) (<= START END) (<= END (LEN (COERCE SEQ 'LIST))) (STANDARD-CHAR-LISTP (COERCE SEQ 'LIST))) (STANDARD-CHAR-LISTP (COERCE (COERCE (TAKE (+ END (- START)) (NTHCDR START (COERCE SEQ 'LIST))) 'STRING) 'LIST))). 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.01 seconds (prove: 0.01, print: 0.00, other: 0.00) Prover steps counted: 582 SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-REVAPPEND (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y)))) Name the formula above *1. Perhaps we can prove *1 by induction. Two induction schemes are suggested by this conjecture. However, one of these is flawed and so we are left with one viable candidate. We will induct according to a scheme suggested by (REVAPPEND X Y). This suggestion was produced using the :induction rule REVAPPEND. If we let (:P X Y) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP X)) (:P (CDR X) (CONS (CAR X) Y))) (:P X Y)) (IMPLIES (ENDP X) (:P X Y))). This induction is justified by the same argument used to admit REVAPPEND. Note, however, that the unmeasured variable Y is being instantiated. When applied to the goal at hand the above induction scheme produces two nontautological subgoals. Subgoal *1/2 (IMPLIES (AND (NOT (ENDP X)) (EQUAL (TRUE-LISTP (REVAPPEND (CDR X) (CONS (CAR X) Y))) (TRUE-LISTP (CONS (CAR X) Y)))) (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/2' (IMPLIES (AND (CONSP X) (EQUAL (TRUE-LISTP (REVAPPEND (CDR X) (CONS (CAR X) Y))) (TRUE-LISTP (CONS (CAR X) Y)))) (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y))). [GC for 9037 CONS pages..(T=28).GC finished] 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.30 seconds (prove: 0.29, print: 0.01, other: 0.00) Prover steps counted: 311 TRUE-LISTP-REVAPPEND ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR (IMPLIES (TRUE-LISTP X) (TRUE-LISTP (NTHCDR N X))))) But we reduce the conjecture to T, by the :type-prescription rule TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION. Q.E.D. The storage of TRUE-LISTP-NTHCDR depends upon the :type-prescription rule TRUE-LISTP. Summary Form: ( DEFTHM TRUE-LISTP-NTHCDR ...) Rules: ((:TYPE-PRESCRIPTION TRUE-LISTP) (:TYPE-PRESCRIPTION TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION)) Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRUE-LISTP-NTHCDR ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-SUBSEQ (IMPLIES (TRUE-LISTP SEQ) (TRUE-LISTP (SUBSEQ SEQ START END))) :RULE-CLASSES (:REWRITE :TYPE-PRESCRIPTION))) ACL2 Observation in ( DEFTHM TRUE-LISTP-SUBSEQ ...): Our heuristics choose (SUBSEQ SEQ START END) as the :TYPED-TERM. ACL2 Warning [Non-rec] in ( DEFTHM TRUE-LISTP-SUBSEQ ...): A :REWRITE rule generated from TRUE-LISTP-SUBSEQ will be triggered only by terms containing the function symbol SUBSEQ, which has a non-recursive definition. Unless this definition is disabled, this rule is unlikely ever to be used. But we reduce the conjecture to T, by the :type-prescription rule TRUE-LISTP-SUBSEQ-TYPE-PRESCRIPTION. Q.E.D. The storage of TRUE-LISTP-SUBSEQ depends upon the :type-prescription rule TRUE-LISTP. Summary Form: ( DEFTHM TRUE-LISTP-SUBSEQ ...) Rules: ((:TYPE-PRESCRIPTION TRUE-LISTP) (:TYPE-PRESCRIPTION TRUE-LISTP-SUBSEQ-TYPE-PRESCRIPTION)) Warnings: Non-rec Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRUE-LISTP-SUBSEQ ACL2 !>>(LOCAL (DEFTHM LEN-REVAPPEND (EQUAL (LEN (REVAPPEND X Y)) (+ (LEN X) (LEN Y))))) Name the formula above *1. Perhaps we can prove *1 by induction. Three induction schemes are suggested by this conjecture. These merge into two derived induction schemes. However, one of these is flawed and so we are left with one viable candidate. We will induct according to a scheme suggested by (LEN X), but modified to accommodate (REVAPPEND X Y). These suggestions were produced using the :induction rules LEN and REVAPPEND. If we let (:P X Y) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (NOT (CONSP X)) (:P X Y)) (IMPLIES (AND (CONSP X) (:P (CDR X) (CONS (CAR X) Y))) (:P X Y))). This induction is justified by the same argument used to admit LEN. Note, however, that the unmeasured variable Y is being instantiated. When applied to the goal at hand the above induction scheme produces two nontautological subgoals. Subgoal *1/2 (IMPLIES (NOT (CONSP X)) (EQUAL (LEN (REVAPPEND X Y)) (+ (LEN X) (LEN Y)))). But simplification reduces this to T, using the :definitions FIX, LEN and REVAPPEND, primitive type reasoning, the :rewrite rule UNICITY-OF-0 and the :type-prescription rule LEN. Subgoal *1/1 (IMPLIES (AND (CONSP X) (EQUAL (LEN (REVAPPEND (CDR X) (CONS (CAR X) Y))) (+ (LEN (CDR X)) (LEN (CONS (CAR X) Y))))) (EQUAL (LEN (REVAPPEND X Y)) (+ (LEN X) (LEN Y)))). This simplifies, using the :definitions LEN and REVAPPEND, primitive type reasoning and the :rewrite rules CDR-CONS and COMMUTATIVITY-OF-+, to Subgoal *1/1' (IMPLIES (AND (CONSP X) (EQUAL (LEN (REVAPPEND (CDR X) (CONS (CAR X) Y))) (+ (LEN (CDR X)) 1 (LEN Y)))) (EQUAL (+ (LEN (CDR X)) 1 (LEN Y)) (+ (LEN Y) 1 (LEN (CDR X))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. That completes the proof of *1. Q.E.D. Summary Form: ( DEFTHM LEN-REVAPPEND ...) Rules: ((:DEFINITION FIX) (:DEFINITION LEN) (:DEFINITION NOT) (:DEFINITION REVAPPEND) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION LEN) (:INDUCTION REVAPPEND) (:REWRITE CDR-CONS) (:REWRITE COMMUTATIVITY-OF-+) (:REWRITE UNICITY-OF-0) (:TYPE-PRESCRIPTION LEN)) Time: 0.01 seconds (prove: 0.01, print: 0.00, other: 0.00) Prover steps counted: 385 LEN-REVAPPEND ACL2 !>>(LOCAL (DEFTHM LEN-OF-TAKE (EQUAL (LEN (TAKE N LST)) (NFIX N)))) This simplifies, using the :definition NFIX (if-intro), to the following three conjectures. Subgoal 3 (IMPLIES (NOT (INTEGERP N)) (EQUAL (LEN (TAKE N LST)) 0)). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definition TAKE and the :executable- counterparts of EQUAL and LEN. Subgoal 2 (IMPLIES (AND (INTEGERP N) (<= 0 N)) (EQUAL (LEN (TAKE N LST)) N)). Name the formula above *1. Subgoal 1 (IMPLIES (< N 0) (EQUAL (LEN (TAKE N LST)) 0)). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definition TAKE and the :executable- counterparts of EQUAL and LEN. So we now return to *1, which is (IMPLIES (AND (INTEGERP N) (<= 0 N)) (EQUAL (LEN (TAKE N LST)) N)). Perhaps we can prove *1 by induction. One induction scheme is suggested by this conjecture. We will induct according to a scheme suggested by (TAKE N LST). This suggestion was produced using the :induction rule TAKE. If we let (:P LST N) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ZP N)) (:P (CDR LST) (+ -1 N))) (:P LST N)) (IMPLIES (ZP N) (:P LST N))). This induction is justified by the same argument used to admit TAKE. Note, however, that the unmeasured variable LST is being instantiated. When applied to the goal at hand the above induction scheme produces four nontautological subgoals. Subgoal *1/4 (IMPLIES (AND (NOT (ZP N)) (EQUAL (LEN (TAKE (+ -1 N) (CDR LST))) (+ -1 N)) (INTEGERP N) (<= 0 N)) (EQUAL (LEN (TAKE N LST)) N)). [GC for 9037 CONS pages..(T=28).GC finished] This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions LEN and TAKE, primitive type reasoning, the :rewrite rule CDR-CONS and the :type-prescription rule TRUE-LISTP-TAKE, to Subgoal *1/4' (IMPLIES (AND (NOT (ZP N)) (EQUAL (LEN (TAKE (+ -1 N) (CDR LST))) (+ -1 N)) (<= 0 N)) (EQUAL (+ 1 -1 N) N)). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/3 (IMPLIES (AND (NOT (ZP N)) (< (+ -1 N) 0) (INTEGERP N) (<= 0 N)) (EQUAL (LEN (TAKE N LST)) N)). But we reduce the conjecture to T, by the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER and primitive type reasoning. Subgoal *1/2 (IMPLIES (AND (NOT (ZP N)) (NOT (INTEGERP (+ -1 N))) (INTEGERP N) (<= 0 N)) (EQUAL (LEN (TAKE N LST)) N)). But we reduce the conjecture to T, by the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER. Subgoal *1/1 (IMPLIES (AND (ZP N) (INTEGERP N) (<= 0 N)) (EQUAL (LEN (TAKE N LST)) N)). This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :executable-counterparts of <, INTEGERP, NOT and ZP and linear arithmetic, to Subgoal *1/1' (EQUAL (LEN (TAKE 0 LST)) 0). But simplification reduces this to T, using the :definition TAKE and the :executable-counterparts of EQUAL, LEN and ZP. That completes the proof of *1. Q.E.D. Summary Form: ( DEFTHM LEN-OF-TAKE ...) Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER) (:DEFINITION LEN) (:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION TAKE) (:EXECUTABLE-COUNTERPART <) (:EXECUTABLE-COUNTERPART EQUAL) (:EXECUTABLE-COUNTERPART INTEGERP) (:EXECUTABLE-COUNTERPART LEN) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:EXECUTABLE-COUNTERPART ZP) (:FAKE-RUNE-FOR-LINEAR NIL) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION TAKE) (:REWRITE CDR-CONS) (:TYPE-PRESCRIPTION TRUE-LISTP-TAKE)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION NFIX)) Time: 0.30 seconds (prove: 0.30, print: 0.00, other: 0.00) Prover steps counted: 413 LEN-OF-TAKE ACL2 !>>(LOCAL (DEFTHM LEN-SUBSEQ (IMPLIES (AND (TRUE-LISTP SEQ) (NATP START) (NATP END) (<= START END)) (EQUAL (LEN (SUBSEQ SEQ START END)) (- END START))))) ACL2 Warning [Non-rec] in ( DEFTHM LEN-SUBSEQ ...): A :REWRITE rule generated from LEN-SUBSEQ will be triggered only by terms containing the function symbol SUBSEQ, which has a non-recursive definition. Unless this definition is disabled, this rule is unlikely ever to be used. By the simple :definition NATP we reduce the conjecture to Goal' (IMPLIES (AND (TRUE-LISTP SEQ) (INTEGERP START) (<= 0 START) (INTEGERP END) (<= 0 END) (<= START END)) (EQUAL (LEN (SUBSEQ SEQ START END)) (+ END (- START)))). 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 9037 CONS pages..(T=29).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) (LIST (STRING-DOWNCASE SEQ1) (STRING-DOWNCASE SEQ2)) (LIST SEQ1 SEQ2)) (AND (ACL2-NUMBERP START2) (ACL2-NUMBERP END2) (ACL2-NUMBERP (- START2)) (ACL2-NUMBERP START1) (ACL2-NUMBERP END1) (ACL2-NUMBERP (- START1)) (RATIONALP (+ END2 (- START2))) (RATIONALP (+ END1 (- START1))) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (INTEGERP END2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (INTEGERP START2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (<= (+ START2 (LENGTH SEQ1)) END2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (<= END2 (LENGTH SEQ2))) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (<= 0 START2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (INTEGERP END2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (INTEGERP START2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (<= (+ START2 (LENGTH SEQ1)) END2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (<= END2 (LENGTH SEQ2))) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (<= 0 START2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (TRUE-LISTP SEQ2) (STRINGP SEQ2))))))))))) (IMPLIES (AND (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P) (NOT END1P) (NOT (TRUE-LISTP SEQ1))) (STRINGP SEQ1))). [Note: A hint was supplied for our processing of the goal above. Thanks!] [GC for 9037 CONS pages..(T=28).GC finished] [GC for 9047 CONS pages..(T=28).GC finished] [GC for 9057 CONS pages..(T=28).GC finished] By the simple :definitions EQ, NULL, SEARCH-FN-GUARD and STRING-DOWNCASE and the :executable-counterpart of TAU-SYSTEM we reduce the conjecture to Goal' (IMPLIES (AND (MEMBER-EQUAL TEST '(EQUAL CHAR-EQUAL)) (COND ((STRINGP SEQ1) (AND (STRINGP SEQ2) (COND ((EQUAL TEST 'EQUAL) (LET ((END1 (IF END1P END1 (LENGTH SEQ1))) (END2 (IF END2P END2 (LENGTH SEQ2)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) ((STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (AND (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (LET ((END1 (IF END1P END1 (LENGTH SEQ1))) (END2 (IF END2P END2 (LENGTH SEQ2)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))))) (T NIL)))) ((EQUAL TEST 'CHAR-EQUAL) NIL) ((TRUE-LISTP SEQ1) (AND (TRUE-LISTP SEQ2) (LET ((END1 (IF END1P END1 (LENGTH SEQ1))) (END2 (IF END2P END2 (LENGTH SEQ2)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))))) (T NIL))) (LET ((END1 (IF END1P END1 (LENGTH SEQ1)))) (AND (OR END2P (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (LET ((END2 (IF END2P END2 (LENGTH SEQ2)))) (AND (<= 0 START1) (INTEGERP START1) (OR (EQUAL END1 NIL) (<= END1 (LENGTH SEQ1))) (OR (EQUAL END1 NIL) (INTEGERP END1)) (OR (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (NOT END1) (<= START1 END1)) (OR END1 (<= START1 (LENGTH SEQ1))) (LET ((SEQ1 (SUBSEQ SEQ1 START1 END1))) (AND (OR (NOT (EQUAL TEST 'CHAR-EQUAL)) (STRINGP SEQ1)) (OR (NOT (EQUAL TEST 'CHAR-EQUAL)) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))) (OR (NOT (EQUAL TEST 'CHAR-EQUAL)) (STRINGP SEQ2)) (OR (NOT (EQUAL TEST 'CHAR-EQUAL)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))) (MV-LET (SEQ1 SEQ2) (IF (EQUAL TEST 'CHAR-EQUAL) (LIST (COERCE (STRING-DOWNCASE1 (COERCE SEQ1 'LIST)) 'STRING) (COERCE (STRING-DOWNCASE1 (COERCE SEQ2 'LIST)) 'STRING)) (LIST SEQ1 SEQ2)) (AND (ACL2-NUMBERP START2) (ACL2-NUMBERP END2) (ACL2-NUMBERP (- START2)) (ACL2-NUMBERP START1) (ACL2-NUMBERP END1) (ACL2-NUMBERP (- START1)) (RATIONALP (+ END2 (- START2))) (RATIONALP (+ END1 (- START1))) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (INTEGERP END2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (INTEGERP START2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (<= (+ START2 (LENGTH SEQ1)) END2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (<= END2 (LENGTH SEQ2))) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (<= 0 START2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (INTEGERP END2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (INTEGERP START2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (<= (+ START2 (LENGTH SEQ1)) END2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (<= END2 (LENGTH SEQ2))) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (<= 0 START2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (TRUE-LISTP SEQ2) (STRINGP SEQ2))))))))))). [GC for 9057 CONS pages..(T=28).GC finished] [GC for 9057 CONS pages..(T=28).GC finished] TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.46 secs; see :DOC time-tracker-tau. [GC for 9057 CONS pages..(T=29).GC finished] [GC for 9057 CONS pages..(T=28).GC finished] [GC for 9057 CONS pages..(T=28).GC finished] [GC for 9067 CONS pages..(T=28).GC finished] [GC for 9067 CONS pages..(T=29).GC finished] [GC for 9067 CONS pages..(T=29).GC finished] [GC for 9067 CONS pages..(T=29).GC finished] [GC for 9077 CONS pages..(T=28).GC finished] [GC for 9077 CONS pages..(T=28).GC finished] This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definitions LENGTH, MEMBER-EQUAL (if- intro), MV-NTH and NOT (if-intro), the :executable-counterparts of ACL2-NUMBERP, CAR, CDR, CONSP, EQUAL and NOT, linear arithmetic, primitive type reasoning, the :rewrite rules CHARACTER-LISTP-STRING-DOWNCASE-1, COERCE-INVERSE-1, COMMUTATIVITY-OF-+, LEN-STRING-DOWNCASE1, LEN-SUBSEQ, LEN-SUBSEQ-STRING and SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP and the :type-prescription rules LEN, STANDARD-CHAR-LISTP, STRINGP-SUBSEQ-TYPE-PRESCRIPTION and TRUE-LISTP-SUBSEQ, to the following 183 conjectures. Subgoal 183 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 182 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 181 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (ACL2-NUMBERP END2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 180 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (ACL2-NUMBERP END1)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 179 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (RATIONALP (+ END2 (- START2)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 178 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 177 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (INTEGERP END1)) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 176 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (RATIONALP (+ END1 (- START1)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 175 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). [GC for 9077 CONS pages..(T=29).GC finished] By the simple :definition NATP we reduce the conjecture to Subgoal 175' (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). But simplification reduces this to T, using the :definition LENGTH. Subgoal 174 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) END2)). By the simple :definition NATP we reduce the conjecture to Subgoal 174' (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) END2)). [GC for 9077 CONS pages..(T=28).GC finished] This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH and the :rewrite rule LEN-SUBSEQ-STRING, to Subgoal 174'' (IMPLIES (AND (STRINGP SEQ1) (STRINGP SEQ2) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LEN (COERCE SEQ1 'LIST))) (<= END2 (LEN (COERCE SEQ2 'LIST))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ START2 END1 (- START1)) END2)). But simplification reduces this to T, using linear arithmetic and primitive type reasoning. Subgoal 173 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (INTEGERP END2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 172 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 171 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 170 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (INTEGERP END1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 169 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (<= START1 (LEN (COERCE SEQ1 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 168 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) END1). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 167 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (RATIONALP (+ NIL (- START1)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 166 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (ACL2-NUMBERP END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 165 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (RATIONALP (+ END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 164 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (<= END1 (LEN (COERCE SEQ1 'LIST)))). 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 9077 CONS pages..(T=28).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)))) (<= (+ START2 (- START1) (LEN (COERCE SEQ1 'LIST))) END2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 151 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). 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 9077 CONS pages..(T=28).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 9077 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 9077 CONS pages..(T=29).GC finished] This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite rule LEN-SUBSEQ-STRING and the :type-prescription rule LEN, to Subgoal 135'' (IMPLIES (AND (STRINGP SEQ1) (STRINGP SEQ2) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (<= 0 (LEN (COERCE SEQ2 'LIST))) (<= START1 END1) (<= START2 (LEN (COERCE SEQ2 'LIST))) (<= END1 (LEN (COERCE SEQ1 'LIST))) (<= (LEN (COERCE SEQ2 'LIST)) (LEN (COERCE SEQ2 'LIST))) (<= (+ END1 (- START1)) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (+ START2 END1 (- START1)) (LEN (COERCE SEQ2 'LIST)))). But simplification reduces this to T, using linear arithmetic, primitive type reasoning and the :type-prescription rule LEN. Subgoal 134 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (RATIONALP (+ (- START2) (LEN (COERCE SEQ2 'LIST))))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 133 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (INTEGERP END1)) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 132 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (ACL2-NUMBERP END1)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 131 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 130 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 129 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ (- START2) (LEN (COERCE SEQ2 'LIST))))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 128 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= (LEN (COERCE SEQ1 'LIST)) (LEN (COERCE SEQ1 'LIST)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 127 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 126 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 125 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 124 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (LEN (COERCE SEQ2 'LIST)) (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 123 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (+ START2 (- START1) (LEN (COERCE SEQ1 'LIST))) (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 122 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 121 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). [GC for 9077 CONS pages..(T=29).GC finished] 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 9077 CONS pages..(T=29).GC finished] By the simple :definition NATP we reduce the conjecture to Subgoal 113' (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (SUBSEQ SEQ1 START1 END1))) END2)). This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH and the :rewrite rule LEN-SUBSEQ, to Subgoal 113'' (IMPLIES (AND (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LEN SEQ1)) (<= END2 (LEN SEQ2)) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ START2 END1 (- START1)) END2)). But simplification reduces this to T, using linear arithmetic and primitive type reasoning. Subgoal 112 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (INTEGERP END2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 111 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 110 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 109 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (INTEGERP END1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 108 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (<= START1 (LEN SEQ1))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 107 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) END1). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 106 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (RATIONALP (+ NIL (- START1)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 105 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (ACL2-NUMBERP END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 104 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (RATIONALP (+ END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 103 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (<= END1 (LEN SEQ1))). [GC for 9077 CONS pages..(T=29).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)))) (<= (+ START2 (- START1) (LEN SEQ1)) END2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 90 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN SEQ1)) (+ END2 (- START2)))) (<= END2 (LEN SEQ2))). [GC for 9077 CONS pages..(T=29).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 9077 CONS pages..(T=29).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 9077 CONS pages..(T=29).GC finished] This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite rule LEN-SUBSEQ and the :type-prescription rule LEN, to Subgoal 74'' (IMPLIES (AND (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (<= 0 (LEN SEQ2)) (<= START1 END1) (<= START2 (LEN SEQ2)) (<= END1 (LEN SEQ1)) (<= (LEN SEQ2) (LEN SEQ2)) (<= (+ END1 (- START1)) (+ (- START2) (LEN SEQ2)))) (<= (+ START2 END1 (- START1)) (LEN SEQ2))). But simplification reduces this to T, using linear arithmetic, primitive type reasoning and the :type-prescription rule LEN. Subgoal 73 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (RATIONALP (+ (- START2) (LEN SEQ2)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 72 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (INTEGERP END1)) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 71 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (ACL2-NUMBERP END1)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 70 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 69 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 68 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ (- START2) (LEN SEQ2)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 67 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= (LEN SEQ1) (LEN SEQ1))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 66 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 65 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN SEQ1)) (+ (- START2) (LEN SEQ2)))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 64 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN SEQ1)) (+ (- START2) (LEN SEQ2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 63 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN SEQ1)) (+ (- START2) (LEN SEQ2)))) (<= (LEN SEQ2) (LEN SEQ2))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 62 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN SEQ1)) (+ (- START2) (LEN SEQ2)))) (<= (+ START2 (- START1) (LEN SEQ1)) (LEN SEQ2))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 61 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 60 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 59 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) END1). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 58 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (<= END1 (LEN (COERCE SEQ1 'LIST)))). [GC for 9077 CONS pages..(T=29).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 9077 CONS pages..(T=28).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 9077 CONS pages..(T=28).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 LEN-SUBSEQ-STRING and SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP and the :type-prescription rule STANDARD-CHAR-LISTP, to Subgoal 37'' (IMPLIES (AND (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LEN (COERCE SEQ1 'LIST))) (<= END2 (LEN (COERCE SEQ2 'LIST))) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ START2 END1 (- START1)) END2)). But simplification reduces this to T, using linear arithmetic and primitive type reasoning. Subgoal 36 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST)) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). [GC for 9077 CONS pages..(T=28).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 [GC for 9077 CONS pages..(T=29).GC finished] (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= (LEN (COERCE SEQ1 'LIST)) (LEN (COERCE SEQ1 'LIST)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 30 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 29 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ END2 (- START2)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 28 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (<= (+ START2 (- START1) (LEN (COERCE SEQ1 'LIST))) END2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 27 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). By the simple :definition NATP we reduce the conjecture to Subgoal 27' (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP (LEN (COERCE SEQ1 'LIST))) (<= 0 (LEN (COERCE SEQ1 'LIST))) (INTEGERP END2) (<= 0 END2) (<= START1 (LEN (COERCE SEQ1 'LIST))) (<= START2 END2) (<= (LEN (COERCE SEQ1 'LIST)) (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). [GC for 9077 CONS pages..(T=28).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 9077 CONS pages..(T=28).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 9077 CONS pages..(T=29).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 9077 CONS pages..(T=29).GC finished] This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite rule LEN-SUBSEQ-STRING and the :type-prescription rule LEN, to Subgoal 10'' (IMPLIES (AND (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (<= 0 (LEN (COERCE SEQ2 'LIST))) (<= START1 END1) (<= START2 (LEN (COERCE SEQ2 'LIST))) (<= END1 (LEN (COERCE SEQ1 'LIST))) (<= (LEN (COERCE SEQ2 'LIST)) (LEN (COERCE SEQ2 'LIST))) (<= (+ END1 (- START1)) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (+ START2 END1 (- START1)) (LEN (COERCE SEQ2 'LIST)))). But simplification reduces this to T, using linear arithmetic, primitive type reasoning and the :type-prescription rule LEN. Subgoal 9 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 8 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 7 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ (- START2) (LEN (COERCE SEQ2 'LIST))))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 6 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= (LEN (COERCE SEQ1 'LIST)) (LEN (COERCE SEQ1 'LIST)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 5 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 4 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 3 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 2 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (LEN (COERCE SEQ2 'LIST)) (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 1 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (+ START2 (- START1) (LEN (COERCE SEQ1 'LIST))) (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Q.E.D. That completes the proof of the guard theorem for SEARCH-FN. SEARCH-FN is compliant with Common Lisp. Summary Form: ( DEFUN SEARCH-FN ...) Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER) (:DEFINITION EQ) (:DEFINITION LENGTH) (:DEFINITION MEMBER-EQUAL) (:DEFINITION MV-NTH) (:DEFINITION NATP) (:DEFINITION NOT) (:DEFINITION NULL) (:DEFINITION SEARCH-FN-GUARD) (:DEFINITION STRING-DOWNCASE) (:EXECUTABLE-COUNTERPART ACL2-NUMBERP) (:EXECUTABLE-COUNTERPART CAR) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART EQUAL) (:EXECUTABLE-COUNTERPART NATP) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-LINEAR NIL) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE CHARACTER-LISTP-STRING-DOWNCASE-1) (:REWRITE COERCE-INVERSE-1) (:REWRITE COMMUTATIVITY-OF-+) (:REWRITE LEN-STRING-DOWNCASE1) (:REWRITE LEN-SUBSEQ) (:REWRITE LEN-SUBSEQ-STRING) (:REWRITE SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP) (:TYPE-PRESCRIPTION LEN) (:TYPE-PRESCRIPTION SEARCH-FROM-END) (:TYPE-PRESCRIPTION SEARCH-FROM-START) (:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP) (:TYPE-PRESCRIPTION STRINGP-SUBSEQ-TYPE-PRESCRIPTION) (:TYPE-PRESCRIPTION TRUE-LISTP-SUBSEQ)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION MEMBER-EQUAL) (:DEFINITION NOT)) [GC for 9077 CONS pages..(T=29).GC finished] Time: 11.04 seconds (prove: 9.94, print: 0.72, other: 0.38) Prover steps counted: 63875 TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent in the tau system was 3.52 seconds. See :DOC time-tracker-tau. SEARCH-FN End of Encapsulated Events. Having verified that the encapsulated events validate the signatures of the ENCAPSULATE event, we discard the ephemeral theory and extend the original theory as directed by the signatures and the non-LOCAL events. We export SEARCH-FN. Summary Form: ( ENCAPSULATE NIL (LOCAL ...) ...) Rules: NIL Warnings: Non-rec Time: 14.83 seconds (prove: 12.98, print: 0.74, other: 1.11) Prover steps counted: 72310 T The event ( DEFMACRO SEARCH ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO SEARCH ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT [Note: A hint was supplied for our processing of the goal above. Thanks!] Name the formula above *1. Perhaps we can prove *1 by induction. Two induction schemes are suggested by this conjecture. These merge into one derived induction scheme. We will induct according to a scheme suggested by (NTH N X). This suggestion was produced using the :induction rules EQLABLE-LISTP and NTH. If we let (:P N X) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP X)) (NOT (ZP N)) (:P (+ -1 N) (CDR X))) (:P N X)) (IMPLIES (AND (NOT (ENDP X)) (ZP N)) (:P N X)) (IMPLIES (ENDP X) (:P N X))). This induction is justified by the same argument used to admit NTH. Note, however, that the unmeasured variable X is being instantiated. When applied to the goal at hand the above induction scheme produces four nontautological subgoals. Subgoal *1/4 (IMPLIES (AND (NOT (ENDP X)) (NOT (ZP N)) (EQLABLEP (NTH (+ -1 N) (CDR X))) (EQLABLE-LISTP X)) (EQLABLEP (NTH N X))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/4' (IMPLIES (AND (CONSP X) (NOT (ZP N)) (EQLABLEP (NTH (+ -1 N) (CDR X))) (EQLABLE-LISTP X)) (EQLABLEP (NTH N X))). But simplification reduces this to T, using the :compound-recognizer rules EQLABLEP-RECOG and ZP-COMPOUND-RECOGNIZER and the :definitions EQLABLE-LISTP and NTH. Subgoal *1/3 (IMPLIES (AND (NOT (ENDP X)) (NOT (ZP N)) (NOT (EQLABLE-LISTP (CDR X))) (EQLABLE-LISTP X)) (EQLABLEP (NTH N X))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/3' (IMPLIES (AND (CONSP X) (NOT (ZP N)) (NOT (EQLABLE-LISTP (CDR X))) (EQLABLE-LISTP X)) (EQLABLEP (NTH N X))). But simplification reduces this to T, using the :definition EQLABLE-LISTP. Subgoal *1/2 (IMPLIES (AND (NOT (ENDP X)) (ZP N) (EQLABLE-LISTP X)) (EQLABLEP (NTH N X))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/2' (IMPLIES (AND (CONSP X) (ZP N) (EQLABLE-LISTP X)) (EQLABLEP (NTH N X))). But simplification reduces this to T, using the :compound-recognizer rules EQLABLEP-RECOG and ZP-COMPOUND-RECOGNIZER and the :definitions EQLABLE-LISTP and NTH. Subgoal *1/1 (IMPLIES (AND (ENDP X) (EQLABLE-LISTP X)) (EQLABLEP (NTH N X))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/1' (IMPLIES (AND (NOT (CONSP X)) (EQLABLE-LISTP X)) (EQLABLEP (NTH N X))). But simplification reduces this to T, using the :definitions EQLABLE-LISTP and NTH, the :executable-counterparts of CONSP and EQLABLEP and primitive type reasoning. That completes the proof of *1. Q.E.D. The storage of EQLABLEP-NTH depends upon the :compound-recognizer rule EQLABLEP-RECOG and the :type-prescription rule EQLABLEP. Summary Form: ( DEFTHM EQLABLEP-NTH ...) Rules: ((:COMPOUND-RECOGNIZER EQLABLEP-RECOG) (:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER) (:DEFINITION ENDP) (:DEFINITION EQLABLE-LISTP) (:DEFINITION NOT) (:DEFINITION NTH) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART EQLABLEP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION EQLABLE-LISTP) (:INDUCTION NTH) (:TYPE-PRESCRIPTION EQLABLEP)) Time: 0.02 seconds (prove: 0.01, print: 0.01, 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 simple :rewrite rule ASSOCIATIVITY-OF-+ we reduce the conjecture to the following two conjectures. Subgoal 2 (O-P (NFIX (+ 1 END (- START)))). But simplification reduces this to T, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definitions NFIX, O-FINP and O-P and primitive type reasoning. Subgoal 1 (IMPLIES (NOT (OR (NOT (INTEGERP START)) (NOT (INTEGERP END)) (<= END START))) (O< (NFIX (+ 1 END (- (+ 1 START)))) (NFIX (+ 1 END (- START))))). [GC for 9077 CONS pages..(T=29).GC finished] This simplifies, using the :definitions NFIX (if-intro), NOT (if-intro), O-FINP and O< (if-intro), the :executable-counterpart of NOT and primitive type reasoning, to the following three conjectures. Subgoal 1.3 (IMPLIES (AND (INTEGERP START) (INTEGERP END) (< START END)) (<= 0 (+ 1 END (- START)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.2 (IMPLIES (AND (INTEGERP START) (INTEGERP END) (< START END) (< (+ 1 END (- (+ 1 START))) 0)) (< 0 (+ 1 END (- START)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.1 (IMPLIES (AND (INTEGERP START) (INTEGERP END) (< START END) (<= 0 (+ 1 END (- (+ 1 START))))) (< (+ 1 END (- (+ 1 START))) (+ 1 END (- START)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Q.E.D. That completes the proof of the measure theorem for COUNT-STRINGP. Thus, we admit this function under the principle of definition. We observe that the type of COUNT-STRINGP is described by the theorem (AND (INTEGERP (COUNT-STRINGP ITEM X START END)) (<= 0 (COUNT-STRINGP ITEM X START END))). We used primitive type reasoning. Computing the guard conjecture for COUNT-STRINGP.... The non-trivial part of the guard conjecture for COUNT-STRINGP, given the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, primitive type reasoning and the :type-prescription rules COUNT-STRINGP and LENGTH, is Goal (AND (IMPLIES (AND (<= END (LENGTH X)) (NATP END) (NATP START) (STRINGP X) (NOT (OR (NOT (INTEGERP START)) (NOT (INTEGERP END)) (<= END START)))) (< START (LENGTH X))) (IMPLIES (AND (<= END (LENGTH X)) (NATP END) (NATP START) (STRINGP X) (NOT (OR (NOT (INTEGERP START)) (NOT (INTEGERP END)) (<= END START))) (NOT (EQLABLEP ITEM))) (EQLABLEP (CHAR X START)))). By the simple :definitions CHAR and NATP we reduce the conjecture to the following two conjectures. Subgoal 2 (IMPLIES (AND (<= END (LENGTH X)) (INTEGERP END) (<= 0 END) (INTEGERP START) (<= 0 START) (STRINGP X) (NOT (OR (NOT (INTEGERP START)) (NOT (INTEGERP END)) (<= END START)))) (< START (LENGTH X))). This simplifies, using the :definitions LENGTH and NOT and the :executable- counterpart of NOT, to Subgoal 2' (IMPLIES (AND (<= END (LEN (COERCE X 'LIST))) (INTEGERP END) (<= 0 END) (INTEGERP START) (<= 0 START) (STRINGP X) (< START END)) (< START (LEN (COERCE X 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1 (IMPLIES (AND (<= END (LENGTH X)) (INTEGERP END) (<= 0 END) (INTEGERP START) (<= 0 START) (STRINGP X) (NOT (OR (NOT (INTEGERP START)) (NOT (INTEGERP END)) (<= END START))) (NOT (EQLABLEP ITEM))) (EQLABLEP (NTH START (COERCE X 'LIST)))). But simplification reduces this to T, using the :definitions LENGTH and NOT, the :executable-counterpart of NOT, the :forward-chaining rules CHARACTER-LISTP-COERCE and CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP, the :rewrite rule EQLABLEP-NTH and the :type-prescription rules CHARACTER-LISTP and EQLABLE-LISTP. Q.E.D. That completes the proof of the guard theorem for COUNT-STRINGP. COUNT-STRINGP is compliant with Common Lisp. Summary Form: ( DEFUN COUNT-STRINGP ...) Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER) (:DEFINITION CHAR) (:DEFINITION LENGTH) (:DEFINITION NATP) (:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION O-FINP) (:DEFINITION O-P) (:DEFINITION O<) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING CHARACTER-LISTP-COERCE) (:FORWARD-CHAINING CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP) (:REWRITE ASSOCIATIVITY-OF-+) (:REWRITE EQLABLEP-NTH) (:TYPE-PRESCRIPTION CHARACTER-LISTP) (:TYPE-PRESCRIPTION COUNT-STRINGP) (:TYPE-PRESCRIPTION EQLABLE-LISTP) (:TYPE-PRESCRIPTION LENGTH)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION O<)) Time: 0.64 seconds (prove: 0.31, print: 0.00, other: 0.33) Prover steps counted: 924 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 9077 CONS pages..(T=28).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.60 seconds (prove: 0.30, print: 0.00, other: 0.30) 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 9077 CONS pages..(T=27).GC finished] [GC for 9077 CONS pages..(T=28).GC finished] [GC for 9077 CONS pages..(T=28).GC finished] [GC for 9077 CONS pages..(T=28).GC finished] TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.14 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 9077 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 9077 CONS pages..(T=29).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 9077 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 9077 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. [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=37).GC finished] Summary Form: ( DEFUN COUNT-FN ...) Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER) (:DEFINITION LENGTH) (:DEFINITION NATP) (:DEFINITION NOT) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE COMMUTATIVITY-OF-+) (:TYPE-PRESCRIPTION COUNT-LISTP) (:TYPE-PRESCRIPTION COUNT-STRINGP) (:TYPE-PRESCRIPTION LEN) (:TYPE-PRESCRIPTION LENGTH) (:TYPE-PRESCRIPTION TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION)) Time: 3.07 seconds (prove: 2.33, print: 0.02, other: 0.72) Prover steps counted: 2976 TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent in the tau system was 2.32 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: 3.44 seconds (prove: 2.33, print: 0.02, other: 1.09) 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.19 seconds (prove: 0.00, print: 0.01, other: 0.18) 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. [GC for 603 SFUN pages..(T=28).GC finished] 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.80 seconds (prove: 0.01, print: 0.00, other: 0.79) Prover steps counted: 299 (DUMB-OCCUR-VAR DUMB-OCCUR-VAR-LST) The event ( DEFUN MAKE-SHARP-ATSIGN ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN MAKE-SHARP-ATSIGN ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFUN SHARP-ATSIGN-ALIST ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN SHARP-ATSIGN-ALIST ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO TIME$1 ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO TIME$1 ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO TIME$ ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO TIME$ ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT To verify that the five encapsulated events correctly extend the current theory we will evaluate them. The theory thus constructed is only ephemeral. Encapsulated Events: ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-REVAPPEND (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y)))) Name the formula above *1. Perhaps we can prove *1 by induction. Two induction schemes are suggested by this conjecture. However, one of these is flawed and so we are left with one viable candidate. We will induct according to a scheme suggested by (REVAPPEND X Y). This suggestion was produced using the :induction rule REVAPPEND. If we let (:P X Y) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP X)) (:P (CDR X) (CONS (CAR X) Y))) (:P X Y)) (IMPLIES (ENDP X) (:P X Y))). This induction is justified by the same argument used to admit REVAPPEND. Note, however, that the unmeasured variable Y is being instantiated. When applied to the goal at hand the above induction scheme produces two nontautological subgoals. Subgoal *1/2 (IMPLIES (AND (NOT (ENDP X)) (EQUAL (TRUE-LISTP (REVAPPEND (CDR X) (CONS (CAR X) Y))) (TRUE-LISTP (CONS (CAR X) Y)))) (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/2' (IMPLIES (AND (CONSP X) (EQUAL (TRUE-LISTP (REVAPPEND (CDR X) (CONS (CAR X) Y))) (TRUE-LISTP (CONS (CAR X) Y)))) (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y))). But simplification reduces this to T, using the :definitions REVAPPEND and TRUE-LISTP, primitive type reasoning and the :rewrite rule CDR-CONS. Subgoal *1/1 (IMPLIES (ENDP X) (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/1' (IMPLIES (NOT (CONSP X)) (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y))). 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.02 seconds (prove: 0.01, print: 0.00, other: 0.01) Prover steps counted: 311 TRUE-LISTP-REVAPPEND ACL2 !>>(VERIFY-GUARDS THROW-NONEXEC-ERROR) Computing the guard conjecture for THROW-NONEXEC-ERROR.... The guard conjecture for THROW-NONEXEC-ERROR is trivial to prove. THROW-NONEXEC-ERROR is compliant with Common Lisp. Summary Form: ( VERIFY-GUARDS THROW-NONEXEC-ERROR) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) THROW-NONEXEC-ERROR ACL2 !>>(VERIFY-GUARDS DEFUN-NX-FN) Computing the guard conjecture for DEFUN-NX-FN.... The guard conjecture for DEFUN-NX-FN is trivial to prove, given primitive type reasoning and the :type-prescription rule BUTLAST. DEFUN-NX-FN is compliant with Common Lisp. Summary Form: ( VERIFY-GUARDS DEFUN-NX-FN) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL) (:TYPE-PRESCRIPTION BUTLAST)) Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) DEFUN-NX-FN ACL2 !>>(VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1) Computing the guard conjecture for UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1.... The non-trivial part of the guard conjecture for UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1 is Goal (AND (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS) (NOT (CONSP DEFS))) (EQ DEFS NIL)) (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS) (NOT (ENDP DEFS))) (MUTUAL-RECURSION-GUARDP (CDR DEFS))) (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS) (NOT (ENDP DEFS)) (EQ (CAR (CAR DEFS)) 'DEFUN-NX)) (TRUE-LISTP (CADDR (CAR DEFS)))) (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS) (NOT (ENDP DEFS)) (EQ (CAR (CAR DEFS)) 'DEFUN-NX)) (TRUE-LISTP (CAR DEFS))) (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS) (NOT (ENDP DEFS)) (NOT (CONSP (CAR DEFS)))) (EQUAL (CAR DEFS) NIL)) (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS) (NOT (ENDP DEFS)) (EQ (CAR (CAR DEFS)) 'DEFUND-NX)) (TRUE-LISTP (CAR DEFS))) (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS) (NOT (ENDP DEFS)) (EQ (CAR (CAR DEFS)) 'DEFUND-NX)) (TRUE-LISTP (CADDR (CAR DEFS))))). By the simple :definitions ENDP and EQ we reduce the conjecture to the following seven conjectures. Subgoal 7 (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS) (NOT (CONSP DEFS))) (EQUAL DEFS NIL)). But simplification reduces this to T, using the :definition MUTUAL-RECURSION-GUARDP. Subgoal 6 (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS) (CONSP DEFS)) (MUTUAL-RECURSION-GUARDP (CDR DEFS))). But simplification reduces this to T, using the :definitions MEMBER-EQUAL and MUTUAL-RECURSION-GUARDP, the :executable-counterparts of CAR, CDR and CONSP and primitive type reasoning. Subgoal 5 (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS) (CONSP DEFS) (EQUAL (CAR (CAR DEFS)) 'DEFUN-NX)) (TRUE-LISTP (CADDR (CAR DEFS)))). But simplification reduces this to T, using the :definitions MUTUAL-RECURSION-GUARDP and TRUE-LISTP and primitive type reasoning. Subgoal 4 (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS) (CONSP DEFS) (EQUAL (CAR (CAR DEFS)) 'DEFUN-NX)) (TRUE-LISTP (CAR DEFS))). But simplification reduces this to T, using the :definition MUTUAL-RECURSION-GUARDP. Subgoal 3 (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS) (CONSP DEFS) (NOT (CONSP (CAR DEFS)))) (EQUAL (CAR DEFS) NIL)). But simplification reduces this to T, using the :definition MUTUAL-RECURSION-GUARDP. Subgoal 2 (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS) (CONSP DEFS) (EQUAL (CAR (CAR DEFS)) 'DEFUND-NX)) (TRUE-LISTP (CAR DEFS))). But simplification reduces this to T, using the :definition MUTUAL-RECURSION-GUARDP. Subgoal 1 (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS) (CONSP DEFS) (EQUAL (CAR (CAR DEFS)) 'DEFUND-NX)) (TRUE-LISTP (CADDR (CAR DEFS)))). But simplification reduces this to T, using the :definitions MUTUAL-RECURSION-GUARDP and TRUE-LISTP and primitive type reasoning. Q.E.D. That completes the proof of the guard theorem for UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1. UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1 is compliant with Common Lisp. Summary Form: ( VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1) Rules: ((:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION MEMBER-EQUAL) (:DEFINITION MUTUAL-RECURSION-GUARDP) (:DEFINITION NOT) (:DEFINITION TRUE-LISTP) (:EXECUTABLE-COUNTERPART CAR) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CONSP) (:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.01 seconds (prove: 0.00, print: 0.01, other: 0.00) Prover steps counted: 829 UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1 ACL2 !>>(VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX) Computing the guard conjecture for UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX.... The non-trivial part of the guard conjecture for UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX is Goal [GC for 9077 CONS pages..(T=29).GC finished] (AND (IMPLIES (MUTUAL-RECURSION-GUARDP DEFS) (LET ((X 'DEFUN-NX) (ALIST DEFS)) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST)) (EQUAL (ASSOC-EQUAL X ALIST) (ASSOC-EQ-EXEC X ALIST))))) (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS) (NOT (ASSOC-EQUAL 'DEFUN-NX DEFS))) (LET ((X 'DEFUND-NX) (ALIST DEFS)) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST)) (EQUAL (ASSOC-EQUAL X ALIST) (ASSOC-EQ-EXEC X ALIST)))))). By the simple :rewrite rule ASSOC-EQ-EXEC-IS-ASSOC-EQUAL we reduce the conjecture to the following two conjectures. Subgoal 2 (IMPLIES (MUTUAL-RECURSION-GUARDP DEFS) (LET ((X 'DEFUN-NX) (ALIST DEFS)) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))))). This simplifies, using the :executable-counterparts of NOT and SYMBOLP and the :type-prescription rule ALISTP, to Subgoal 2' (IMPLIES (MUTUAL-RECURSION-GUARDP DEFS) (ALISTP DEFS)). Name the formula above *1. Subgoal 1 (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS) (NOT (ASSOC-EQUAL 'DEFUN-NX DEFS))) (LET ((X 'DEFUND-NX) (ALIST DEFS)) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))))). This simplifies, using the :executable-counterparts of NOT and SYMBOLP and the :type-prescription rule ALISTP, to Subgoal 1' (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS) (NOT (ASSOC-EQUAL 'DEFUN-NX DEFS))) (ALISTP DEFS)). Normally we would attempt to prove Subgoal 1' by induction. However, we prefer in this instance to focus on the original input conjecture rather than this simplified special case. We therefore abandon our previous work on this conjecture and reassign the name *1 to the original conjecture. (See :DOC otf-flg.) Perhaps we can prove *1 by induction. Three induction schemes are suggested by this conjecture. Subsumption reduces that number to two. These merge into one derived induction scheme. We will induct according to a scheme suggested by (ASSOC-EQUAL 'DEFUN-NX DEFS). This suggestion was produced using the :induction rules ASSOC-EQUAL and MUTUAL-RECURSION-GUARDP. If we let (:P DEFS) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP DEFS)) (NOT (EQUAL 'DEFUN-NX (CAR (CAR DEFS)))) (:P (CDR DEFS))) (:P DEFS)) (IMPLIES (AND (NOT (ENDP DEFS)) (EQUAL 'DEFUN-NX (CAR (CAR DEFS)))) (:P DEFS)) (IMPLIES (ENDP DEFS) (:P DEFS))). This induction is justified by the same argument used to admit ASSOC-EQUAL. When applied to the goal at hand the above induction scheme produces three nontautological subgoals. Subgoal *1/3 (IMPLIES (AND (NOT (ENDP DEFS)) (NOT (EQUAL 'DEFUN-NX (CAR (CAR DEFS)))) (AND (OR (NOT (MUTUAL-RECURSION-GUARDP (CDR DEFS))) (LET ((X 'DEFUN-NX) (ALIST (CDR DEFS))) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST)) (EQUAL (ASSOC-EQUAL X ALIST) (ASSOC-EQ-EXEC X ALIST))))) (OR (NOT (MUTUAL-RECURSION-GUARDP (CDR DEFS))) (ASSOC-EQUAL 'DEFUN-NX (CDR DEFS)) (LET ((X 'DEFUND-NX) (ALIST (CDR DEFS))) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST)) (EQUAL (ASSOC-EQUAL X ALIST) (ASSOC-EQ-EXEC X ALIST))))))) (AND (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS)) (LET ((X 'DEFUN-NX) (ALIST DEFS)) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST)) (EQUAL (ASSOC-EQUAL X ALIST) (ASSOC-EQ-EXEC X ALIST))))) (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS)) (ASSOC-EQUAL 'DEFUN-NX DEFS) (LET ((X 'DEFUND-NX) (ALIST DEFS)) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST)) (EQUAL (ASSOC-EQUAL X ALIST) (ASSOC-EQ-EXEC X ALIST))))))). By the simple :definition ENDP and the simple :rewrite rule ASSOC-EQ-EXEC-IS-ASSOC-EQUAL we reduce the conjecture to Subgoal *1/3' (IMPLIES (AND (CONSP DEFS) (NOT (EQUAL 'DEFUN-NX (CAR (CAR DEFS)))) (OR (NOT (MUTUAL-RECURSION-GUARDP (CDR DEFS))) (LET ((X 'DEFUN-NX) (ALIST (CDR DEFS))) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))))) (OR (NOT (MUTUAL-RECURSION-GUARDP (CDR DEFS))) (ASSOC-EQUAL 'DEFUN-NX (CDR DEFS)) (LET ((X 'DEFUND-NX) (ALIST (CDR DEFS))) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST)))))) (AND (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS)) (LET ((X 'DEFUN-NX) (ALIST DEFS)) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))))) (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS)) (ASSOC-EQUAL 'DEFUN-NX DEFS) (LET ((X 'DEFUND-NX) (ALIST DEFS)) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))))))). But simplification reduces this to T, using the :definitions ALISTP, ASSOC-EQUAL, MEMBER-EQUAL, MUTUAL-RECURSION-GUARDP and NOT, the :executable- counterparts of CAR, CDR, CONSP, NOT and SYMBOLP, primitive type reasoning and the :type-prescription rule ALISTP. Subgoal *1/2 (IMPLIES (AND (NOT (ENDP DEFS)) (EQUAL 'DEFUN-NX (CAR (CAR DEFS)))) (AND (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS)) (LET ((X 'DEFUN-NX) (ALIST DEFS)) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST)) (EQUAL (ASSOC-EQUAL X ALIST) (ASSOC-EQ-EXEC X ALIST))))) (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS)) (ASSOC-EQUAL 'DEFUN-NX DEFS) (LET ((X 'DEFUND-NX) (ALIST DEFS)) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST)) (EQUAL (ASSOC-EQUAL X ALIST) (ASSOC-EQ-EXEC X ALIST))))))). By the simple :definition ENDP and the simple :rewrite rule ASSOC-EQ-EXEC-IS-ASSOC-EQUAL we reduce the conjecture to Subgoal *1/2' (IMPLIES (AND (CONSP DEFS) (EQUAL 'DEFUN-NX (CAR (CAR DEFS)))) (AND (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS)) (LET ((X 'DEFUN-NX) (ALIST DEFS)) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))))) (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS)) (ASSOC-EQUAL 'DEFUN-NX DEFS) (LET ((X 'DEFUND-NX) (ALIST DEFS)) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))))))). This simplifies, using the :definitions ASSOC-EQUAL, MUTUAL-RECURSION-GUARDP and NOT, the :executable-counterparts of EQUAL, MEMBER-EQUAL, NOT and SYMBOLP, primitive type reasoning and the :type-prescription rule ALISTP, to Subgoal *1/2'' (IMPLIES (AND (CONSP DEFS) (EQUAL 'DEFUN-NX (CAR (CAR DEFS))) (CONSP (CAR DEFS)) (TRUE-LISTP (CAR DEFS)) (TRUE-LISTP (CADDR (CAR DEFS))) (MUTUAL-RECURSION-GUARDP (CDR DEFS))) (ALISTP DEFS)). [GC for 9077 CONS pages..(T=29).GC finished] This simplifies, using the :definitions ALISTP and TRUE-LISTP (if-intro), the :executable-counterparts of CAR, CDR and TRUE-LISTP and primitive type reasoning, to the following two conjectures. Subgoal *1/2.2 (IMPLIES (AND (CONSP DEFS) (EQUAL 'DEFUN-NX (CAR (CAR DEFS))) (CONSP (CAR DEFS)) (CONSP (CDR (CAR DEFS))) (TRUE-LISTP (CDDR (CAR DEFS))) (TRUE-LISTP (CADDR (CAR DEFS))) (MUTUAL-RECURSION-GUARDP (CDR DEFS))) (ALISTP (CDR DEFS))). The destructor terms (CAR DEFS) and (CDR DEFS) can be eliminated. Furthermore, those terms are at the root of a chain of four rounds of destructor elimination. (1) Use CAR-CDR-ELIM to replace DEFS by (CONS DEFS1 DEFS2), (CAR DEFS) by DEFS1 and (CDR DEFS) by DEFS2. (2) Use CAR-CDR-ELIM, again, to replace DEFS1 by (CONS DEFS3 DEFS4), (CAR DEFS1) by DEFS3 and (CDR DEFS1) by DEFS4 and restrict the type of the new variable DEFS3 to be that of the term it replaces. (3) Use CAR-CDR-ELIM to replace DEFS4 by (CONS DEFS5 DEFS6), (CAR DEFS4) by DEFS5 and (CDR DEFS4) by DEFS6. (4) Finally, use CAR-CDR-ELIM to replace DEFS6 by (CONS DEFS7 DEFS8), (CAR DEFS6) by DEFS7 and (CDR DEFS6) by DEFS8 and restrict the type of the new variable DEFS8 to be that of the term it replaces, as established by primitive type reasoning. These steps produce the following two goals. Subgoal *1/2.2.2 (IMPLIES (AND (NOT (CONSP DEFS6)) (CONSP (CONS DEFS5 DEFS6)) (SYMBOLP DEFS3) (NOT (EQUAL DEFS3 T)) (NOT (EQUAL DEFS3 NIL)) (CONSP (LIST* DEFS3 DEFS5 DEFS6)) (CONSP (CONS (LIST* DEFS3 DEFS5 DEFS6) DEFS2)) (EQUAL 'DEFUN-NX DEFS3) (TRUE-LISTP DEFS6) (TRUE-LISTP (CAR DEFS6)) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). By case analysis we reduce the conjecture to Subgoal *1/2.2.2' (IMPLIES (AND (NOT (CONSP DEFS6)) (CONSP (CONS DEFS5 DEFS6)) (SYMBOLP DEFS3) (NOT (EQUAL DEFS3 T)) DEFS3 (CONSP (LIST* DEFS3 DEFS5 DEFS6)) (CONSP (CONS (LIST* DEFS3 DEFS5 DEFS6) DEFS2)) (EQUAL 'DEFUN-NX DEFS3) (TRUE-LISTP DEFS6) (TRUE-LISTP (CAR DEFS6)) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). This simplifies, using the :definition TRUE-LISTP, the :executable- counterparts of CAR, CONSP, EQUAL, NOT, SYMBOLP and TRUE-LISTP and primitive type reasoning, to Subgoal *1/2.2.2'' (IMPLIES (AND (NOT DEFS6) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). This simplifies, using trivial observations, to Subgoal *1/2.2.2''' (IMPLIES (MUTUAL-RECURSION-GUARDP DEFS2) (ALISTP DEFS2)). Name the formula above *1.1. Subgoal *1/2.2.1 (IMPLIES (AND (TRUE-LISTP DEFS8) (CONSP (CONS DEFS7 DEFS8)) (CONSP (LIST* DEFS5 DEFS7 DEFS8)) (SYMBOLP DEFS3) (NOT (EQUAL DEFS3 T)) (NOT (EQUAL DEFS3 NIL)) (CONSP (LIST* DEFS3 DEFS5 DEFS7 DEFS8)) (CONSP (CONS (LIST* DEFS3 DEFS5 DEFS7 DEFS8) DEFS2)) (EQUAL 'DEFUN-NX DEFS3) (TRUE-LISTP (CONS DEFS7 DEFS8)) (TRUE-LISTP DEFS7) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). By case analysis we reduce the conjecture to Subgoal *1/2.2.1' (IMPLIES (AND (TRUE-LISTP DEFS8) (CONSP (CONS DEFS7 DEFS8)) (CONSP (LIST* DEFS5 DEFS7 DEFS8)) (SYMBOLP DEFS3) (NOT (EQUAL DEFS3 T)) DEFS3 (CONSP (LIST* DEFS3 DEFS5 DEFS7 DEFS8)) (CONSP (CONS (LIST* DEFS3 DEFS5 DEFS7 DEFS8) DEFS2)) (EQUAL 'DEFUN-NX DEFS3) (TRUE-LISTP (CONS DEFS7 DEFS8)) (TRUE-LISTP DEFS7) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). This simplifies, using the :executable-counterparts of EQUAL, NOT and SYMBOLP and primitive type reasoning, to Subgoal *1/2.2.1'' (IMPLIES (AND (TRUE-LISTP DEFS8) (TRUE-LISTP (CONS DEFS7 DEFS8)) (TRUE-LISTP DEFS7) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). We suspect that the terms (TRUE-LISTP DEFS8), (TRUE-LISTP (CONS DEFS7 DEFS8)) and (TRUE-LISTP DEFS7) are irrelevant to the truth of this conjecture and throw them out. We will thus try to prove Subgoal *1/2.2.1''' (IMPLIES (MUTUAL-RECURSION-GUARDP DEFS2) (ALISTP DEFS2)). Name the formula above *1.2. Subgoal *1/2.1 (IMPLIES (AND (CONSP DEFS) (EQUAL 'DEFUN-NX (CAR (CAR DEFS))) (CONSP (CAR DEFS)) (NOT (CONSP (CDR (CAR DEFS)))) (NOT (CDR (CAR DEFS))) (MUTUAL-RECURSION-GUARDP (CDR DEFS))) (ALISTP (CDR DEFS))). This simplifies, using the :executable-counterpart of CONSP, to Subgoal *1/2.1' (IMPLIES (AND (CONSP DEFS) (EQUAL 'DEFUN-NX (CAR (CAR DEFS))) (CONSP (CAR DEFS)) (NOT (CDR (CAR DEFS))) (MUTUAL-RECURSION-GUARDP (CDR DEFS))) (ALISTP (CDR DEFS))). [GC for 9077 CONS pages..(T=28).GC finished] The destructor terms (CAR DEFS) and (CDR DEFS) can be eliminated. Furthermore, those terms are at the root of a chain of two rounds of destructor elimination. (1) Use CAR-CDR-ELIM to replace DEFS by (CONS DEFS1 DEFS2), (CAR DEFS) by DEFS1 and (CDR DEFS) by DEFS2. (2) Use CAR-CDR-ELIM, again, to replace DEFS1 by (CONS DEFS3 DEFS4), (CAR DEFS1) by DEFS3 and (CDR DEFS1) by DEFS4 and restrict the type of the new variable DEFS3 to be that of the term it replaces. These steps produce the following goal. Subgoal *1/2.1'' (IMPLIES (AND (SYMBOLP DEFS3) (NOT (EQUAL DEFS3 T)) (NOT (EQUAL DEFS3 NIL)) (CONSP (CONS DEFS3 DEFS4)) (CONSP (CONS (CONS DEFS3 DEFS4) DEFS2)) (EQUAL 'DEFUN-NX DEFS3) (NOT DEFS4) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). By case analysis we reduce the conjecture to Subgoal *1/2.1''' (IMPLIES (AND (SYMBOLP DEFS3) (NOT (EQUAL DEFS3 T)) DEFS3 (CONSP (CONS DEFS3 DEFS4)) (CONSP (CONS (CONS DEFS3 DEFS4) DEFS2)) (EQUAL 'DEFUN-NX DEFS3) (NOT DEFS4) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). This simplifies, using the :executable-counterparts of CONS, CONSP, EQUAL, NOT and SYMBOLP and primitive type reasoning, to Subgoal *1/2.1'4' (IMPLIES (MUTUAL-RECURSION-GUARDP DEFS2) (ALISTP DEFS2)). Name the formula above *1.3. Subgoal *1/1 (IMPLIES (ENDP DEFS) (AND (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS)) (LET ((X 'DEFUN-NX) (ALIST DEFS)) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST)) (EQUAL (ASSOC-EQUAL X ALIST) (ASSOC-EQ-EXEC X ALIST))))) (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS)) (ASSOC-EQUAL 'DEFUN-NX DEFS) (LET ((X 'DEFUND-NX) (ALIST DEFS)) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST)) (EQUAL (ASSOC-EQUAL X ALIST) (ASSOC-EQ-EXEC X ALIST))))))). By the simple :definition ENDP and the simple :rewrite rule ASSOC-EQ-EXEC-IS-ASSOC-EQUAL we reduce the conjecture to Subgoal *1/1' (IMPLIES (NOT (CONSP DEFS)) (AND (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS)) (LET ((X 'DEFUN-NX) (ALIST DEFS)) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))))) (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS)) (ASSOC-EQUAL 'DEFUN-NX DEFS) (LET ((X 'DEFUND-NX) (ALIST DEFS)) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))))))). But simplification reduces this to T, using the :definitions MUTUAL-RECURSION-GUARDP and NOT, the :executable-counterparts of ALISTP, ASSOC-EQUAL, NOT and SYMBOLP and primitive type reasoning. So we now return to *1.3, which is (IMPLIES (MUTUAL-RECURSION-GUARDP DEFS2) (ALISTP DEFS2)). But the formula above is subsumed by *1.2, which we'll try to prove later. We therefore regard *1.3 as proved (pending the proof of the more general *1.2). We next consider *1.2, which is (IMPLIES (MUTUAL-RECURSION-GUARDP DEFS2) (ALISTP DEFS2)). But the formula above is subsumed by *1.1, which we'll try to prove later. We therefore regard *1.2 as proved (pending the proof of the more general *1.1). We next consider *1.1, which is (IMPLIES (MUTUAL-RECURSION-GUARDP DEFS2) (ALISTP DEFS2)). Perhaps we can prove *1.1 by induction. Two induction schemes are suggested by this conjecture. Subsumption reduces that number to one. We will induct according to a scheme suggested by (MUTUAL-RECURSION-GUARDP DEFS2). This suggestion was produced using the :induction rules ALISTP and MUTUAL-RECURSION-GUARDP. If we let (:P DEFS2) denote *1.1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ATOM DEFS2)) (NOT (CONSP (CAR DEFS2)))) (:P DEFS2)) (IMPLIES (AND (NOT (ATOM DEFS2)) (CONSP (CAR DEFS2)) (NOT (TRUE-LISTP (CAR DEFS2)))) (:P DEFS2)) (IMPLIES (AND (NOT (ATOM DEFS2)) (CONSP (CAR DEFS2)) (TRUE-LISTP (CAR DEFS2)) (NOT (TRUE-LISTP (CADDR (CAR DEFS2))))) (:P DEFS2)) (IMPLIES (AND (NOT (ATOM DEFS2)) (CONSP (CAR DEFS2)) (TRUE-LISTP (CAR DEFS2)) (TRUE-LISTP (CADDR (CAR DEFS2))) (NOT (MEMBER-EQUAL (CAR (CAR DEFS2)) '(DEFUN DEFUND DEFUN-NX DEFUND-NX)))) (:P DEFS2)) (IMPLIES (AND (NOT (ATOM DEFS2)) (CONSP (CAR DEFS2)) (TRUE-LISTP (CAR DEFS2)) (TRUE-LISTP (CADDR (CAR DEFS2))) (MEMBER-EQUAL (CAR (CAR DEFS2)) '(DEFUN DEFUND DEFUN-NX DEFUND-NX)) (:P (CDR DEFS2))) (:P DEFS2)) (IMPLIES (ATOM DEFS2) (:P DEFS2))). This induction is justified by the same argument used to admit MUTUAL-RECURSION-GUARDP. When applied to the goal at hand the above induction scheme produces seven nontautological subgoals. Subgoal *1.1/7 (IMPLIES (AND (NOT (ATOM DEFS2)) (NOT (CONSP (CAR DEFS2))) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). By the simple :definition ATOM we reduce the conjecture to Subgoal *1.1/7' (IMPLIES (AND (CONSP DEFS2) (NOT (CONSP (CAR DEFS2))) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). But simplification reduces this to T, using the :definition MUTUAL-RECURSION-GUARDP. Subgoal *1.1/6 (IMPLIES (AND (NOT (ATOM DEFS2)) (CONSP (CAR DEFS2)) (NOT (TRUE-LISTP (CAR DEFS2))) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). By the simple :definition ATOM we reduce the conjecture to Subgoal *1.1/6' (IMPLIES (AND (CONSP DEFS2) (CONSP (CAR DEFS2)) (NOT (TRUE-LISTP (CAR DEFS2))) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). But simplification reduces this to T, using the :definition MUTUAL-RECURSION-GUARDP. Subgoal *1.1/5 (IMPLIES (AND (NOT (ATOM DEFS2)) (CONSP (CAR DEFS2)) (TRUE-LISTP (CAR DEFS2)) (NOT (TRUE-LISTP (CADDR (CAR DEFS2)))) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). By the simple :definition ATOM we reduce the conjecture to Subgoal *1.1/5' (IMPLIES (AND (CONSP DEFS2) (CONSP (CAR DEFS2)) (TRUE-LISTP (CAR DEFS2)) (NOT (TRUE-LISTP (CADDR (CAR DEFS2)))) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). But simplification reduces this to T, using the :definitions MUTUAL-RECURSION-GUARDP and TRUE-LISTP and primitive type reasoning. Subgoal *1.1/4 (IMPLIES (AND (NOT (ATOM DEFS2)) (CONSP (CAR DEFS2)) (TRUE-LISTP (CAR DEFS2)) (TRUE-LISTP (CADDR (CAR DEFS2))) (NOT (MEMBER-EQUAL (CAR (CAR DEFS2)) '(DEFUN DEFUND DEFUN-NX DEFUND-NX))) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). By the simple :definition ATOM we reduce the conjecture to Subgoal *1.1/4' (IMPLIES (AND (CONSP DEFS2) (CONSP (CAR DEFS2)) (TRUE-LISTP (CAR DEFS2)) (TRUE-LISTP (CADDR (CAR DEFS2))) (NOT (MEMBER-EQUAL (CAR (CAR DEFS2)) '(DEFUN DEFUND DEFUN-NX DEFUND-NX))) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). But simplification reduces this to T, using the :definitions MEMBER-EQUAL, MUTUAL-RECURSION-GUARDP and TRUE-LISTP, the :executable-counterparts of CAR, CDR, CONSP and TRUE-LISTP and primitive type reasoning. Subgoal *1.1/3 (IMPLIES (AND (NOT (ATOM DEFS2)) (CONSP (CAR DEFS2)) (TRUE-LISTP (CAR DEFS2)) (TRUE-LISTP (CADDR (CAR DEFS2))) (MEMBER-EQUAL (CAR (CAR DEFS2)) '(DEFUN DEFUND DEFUN-NX DEFUND-NX)) (ALISTP (CDR DEFS2)) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). By the simple :definition ATOM we reduce the conjecture to Subgoal *1.1/3' (IMPLIES (AND (CONSP DEFS2) (CONSP (CAR DEFS2)) (TRUE-LISTP (CAR DEFS2)) (TRUE-LISTP (CADDR (CAR DEFS2))) (MEMBER-EQUAL (CAR (CAR DEFS2)) '(DEFUN DEFUND DEFUN-NX DEFUND-NX)) (ALISTP (CDR DEFS2)) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). [GC for 9077 CONS pages..(T=28).GC finished] But simplification reduces this to T, using the :definitions ALISTP, MEMBER-EQUAL, MUTUAL-RECURSION-GUARDP and TRUE-LISTP, the :executable- counterparts of CAR, CDR, CONSP, MEMBER-EQUAL and TRUE-LISTP, primitive type reasoning and the :type-prescription rule ALISTP. Subgoal *1.1/2 (IMPLIES (AND (NOT (ATOM DEFS2)) (CONSP (CAR DEFS2)) (TRUE-LISTP (CAR DEFS2)) (TRUE-LISTP (CADDR (CAR DEFS2))) (MEMBER-EQUAL (CAR (CAR DEFS2)) '(DEFUN DEFUND DEFUN-NX DEFUND-NX)) (NOT (MUTUAL-RECURSION-GUARDP (CDR DEFS2))) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). By the simple :definition ATOM we reduce the conjecture to Subgoal *1.1/2' (IMPLIES (AND (CONSP DEFS2) (CONSP (CAR DEFS2)) (TRUE-LISTP (CAR DEFS2)) (TRUE-LISTP (CADDR (CAR DEFS2))) (MEMBER-EQUAL (CAR (CAR DEFS2)) '(DEFUN DEFUND DEFUN-NX DEFUND-NX)) (NOT (MUTUAL-RECURSION-GUARDP (CDR DEFS2))) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). But simplification reduces this to T, using the :definitions MEMBER-EQUAL, MUTUAL-RECURSION-GUARDP and TRUE-LISTP, the :executable-counterparts of CAR, CDR, CONSP, MEMBER-EQUAL and TRUE-LISTP and primitive type reasoning. Subgoal *1.1/1 (IMPLIES (AND (ATOM DEFS2) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). By the simple :definition ATOM we reduce the conjecture to Subgoal *1.1/1' (IMPLIES (AND (NOT (CONSP DEFS2)) (MUTUAL-RECURSION-GUARDP DEFS2)) (ALISTP DEFS2)). But simplification reduces this to T, using the :definition MUTUAL-RECURSION-GUARDP, the :executable-counterparts of ALISTP and CONSP and primitive type reasoning. That completes the proofs of *1.1 and *1. Q.E.D. That completes the proof of the guard theorem for UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX. UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX is compliant with Common Lisp. Summary Form: ( VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX) Rules: ((:DEFINITION ALISTP) (:DEFINITION ASSOC-EQUAL) (:DEFINITION ATOM) (:DEFINITION ENDP) (:DEFINITION MEMBER-EQUAL) (:DEFINITION MUTUAL-RECURSION-GUARDP) (:DEFINITION NOT) (:DEFINITION TRUE-LISTP) (:ELIM CAR-CDR-ELIM) (:EXECUTABLE-COUNTERPART ALISTP) (:EXECUTABLE-COUNTERPART ASSOC-EQUAL) (:EXECUTABLE-COUNTERPART CAR) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CONS) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART EQUAL) (:EXECUTABLE-COUNTERPART MEMBER-EQUAL) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART SYMBOLP) (:EXECUTABLE-COUNTERPART TRUE-LISTP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION ALISTP) (:INDUCTION ASSOC-EQUAL) (:INDUCTION MUTUAL-RECURSION-GUARDP) (:REWRITE ASSOC-EQ-EXEC-IS-ASSOC-EQUAL) (:TYPE-PRESCRIPTION ALISTP)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION TRUE-LISTP)) Time: 1.25 seconds (prove: 0.94, print: 0.31, other: 0.00) Prover steps counted: 10355 UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX End of Encapsulated Events. Having verified that the encapsulated events validate the signatures of the ENCAPSULATE event, we discard the ephemeral theory and extend the original theory as directed by the signatures and the non-LOCAL events. Summary Form: ( ENCAPSULATE NIL (LOCAL ...) ...) Rules: NIL Time: 1.28 seconds (prove: 0.95, print: 0.32, other: 0.01) Prover steps counted: 11495 T Since GC$-FN is non-recursive, its admission is trivial. We observe that the type of GC$-FN is described by the theorem (EQUAL (GC$-FN ARGS) NIL). Computing the guard conjecture for GC$-FN.... The guard conjecture for GC$-FN is trivial to prove. GC$-FN is compliant with Common Lisp. Summary Form: ( DEFUN GC$-FN ...) Rules: NIL Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10) 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.10 seconds (prove: 0.00, print: 0.00, other: 0.10) 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.17 seconds (prove: 0.00, print: 0.00, other: 0.17) GET-WORMHOLE-STATUS Since FILE-WRITE-DATE$ is non-recursive, its admission is trivial. We observe that the type of FILE-WRITE-DATE$ is described by the theorem (AND (CONSP (FILE-WRITE-DATE$ FILE STATE)) (TRUE-LISTP (FILE-WRITE-DATE$ FILE STATE))). We used primitive type reasoning. (FILE-WRITE-DATE$ * STATE) => (MV * STATE). Computing the guard conjecture for FILE-WRITE-DATE$.... The guard conjecture for FILE-WRITE-DATE$ is trivial to prove, given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rule STATE-P. FILE-WRITE-DATE$ is compliant with Common Lisp. Summary Form: ( DEFUN FILE-WRITE-DATE$ ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1) (:TYPE-PRESCRIPTION STATE-P)) Time: 0.20 seconds (prove: 0.00, print: 0.00, other: 0.20) 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.22 seconds (prove: 0.00, print: 0.00, other: 0.22) 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.... [GC for 9077 CONS pages..(T=28).GC finished] 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.48 seconds (prove: 0.01, print: 0.00, other: 0.47) 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. [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] Summary Form: ( DEFUN BREAK$ ...) Rules: NIL Time: 0.46 seconds (prove: 0.00, print: 0.00, other: 0.46) 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.09 seconds (prove: 0.00, print: 0.00, other: 0.09) PRINT-CALL-HISTORY The event ( DEFMACRO DEBUGGER-ENABLEDP-VAL ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO DEBUGGER-ENABLEDP-VAL ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since DEBUGGER-ENABLEDP is non-recursive, its admission is trivial. We observe that the type of DEBUGGER-ENABLEDP is described by the theorem (OR (EQUAL (DEBUGGER-ENABLEDP STATE) T) (EQUAL (DEBUGGER-ENABLEDP STATE) NIL)). (DEBUGGER-ENABLEDP STATE) => *. Computing the guard conjecture for DEBUGGER-ENABLEDP.... The non-trivial part of the guard conjecture for DEBUGGER-ENABLEDP, given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rule STATE-P, is Goal (AND (IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE) (STATE-P STATE)) (BOUNDP-GLOBAL1 'DEBUGGER-ENABLE STATE)) (IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE) (STATE-P STATE)) (LET ((X (GET-GLOBAL 'DEBUGGER-ENABLE STATE)) (L '(T :BREAK :BREAK-BT :BT-BREAK))) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQ-EXEC X L)))))). But we reduce the conjecture to T, by the simple :definitions BOUNDP-GLOBAL, BOUNDP-GLOBAL1, GET-GLOBAL, GLOBAL-TABLE and STATE-P, the :executable- counterpart of TAU-SYSTEM and the simple :rewrite rule MEMBER-EQ-EXEC-IS-MEMBER-EQUAL. Q.E.D. That completes the proof of the guard theorem for DEBUGGER-ENABLEDP. DEBUGGER-ENABLEDP is compliant with Common Lisp. 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.32 seconds (prove: 0.00, print: 0.00, other: 0.32) 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.... [GC for 9077 CONS pages..(T=29).GC finished] 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.60 seconds (prove: 0.00, print: 0.00, other: 0.60) Prover steps counted: 129 MAYBE-PRINT-CALL-HISTORY The event ( DEFMACRO WITH-RECKLESS-READTABLE ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WITH-RECKLESS-READTABLE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO SET-DEBUGGER-ENABLE ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO SET-DEBUGGER-ENABLE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since SET-DEBUGGER-ENABLE-FN is non-recursive, its admission is trivial. We observe that the type of SET-DEBUGGER-ENABLE-FN is described by the theorem (CONSP (SET-DEBUGGER-ENABLE-FN VAL STATE)). We used the :type-prescription rule PUT-GLOBAL. (SET-DEBUGGER-ENABLE-FN * STATE) => STATE. Computing the guard conjecture for SET-DEBUGGER-ENABLE-FN.... 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 9077 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) (ACCUMULATED-TTREE) (ACL2-RAW-MODE-P) (ACL2-SOURCES-DIR) (ACL2-VERSION . "ACL2 Version 8.3") (ACL2-WORLD-ALIST) (ACL2P-CHECKPOINTS-FOR-SUMMARY) (AXIOMSP) (BDDNOTES) (BOOK-HASH-ALISTP) (BOOT-STRAP-FLG . T) (BRR-EVISC-TUPLE-INITIALIZED) (CERT-DATA) (CERTIFY-BOOK-INFO) (CHECK-INVARIANT-RISK . :WARNING) (CHECK-SUM-WEIRDNESS) (CHECKPOINT-FORCED-GOALS) (CHECKPOINT-PROCESSORS ELIMINATE-DESTRUCTORS-CLAUSE FERTILIZE-CLAUSE GENERALIZE-CLAUSE ELIMINATE-IRRELEVANCE-CLAUSE PUSH-CLAUSE :INDUCT) (CHECKPOINT-SUMMARY-LIMIT NIL . 3) (COMPILED-FILE-EXTENSION) (COMPILER-ENABLED) (CONNECTED-BOOK-DIRECTORY) (CURRENT-ACL2-WORLD) (CURRENT-PACKAGE . "ACL2") (DEBUG-PSPV) (DEBUGGER-ENABLE) (DEFAXIOMS-OKP-CERT . T) (DEFERRED-TTAG-NOTES . :NOT-DEFERRED) (DEFERRED-TTAG-NOTES-SAVED) (DMRP) (EVISC-HITP-WITHOUT-IPRINT) (EVISCERATE-HIDE-TERMS) (FMT-HARD-RIGHT-MARGIN . 77) (FMT-SOFT-RIGHT-MARGIN . 65) (GAG-MODE) (GAG-MODE-EVISC-TUPLE) (GAG-STATE) (GAG-STATE-SAVED) (GET-INTERNAL-TIME-AS-REALTIME) (GLOBAL-ENABLED-STRUCTURE) (GSTACKP) (GUARD-CHECKING-ON . T) (HOST-LISP) (IGNORE-CERT-FILES) (ILLEGAL-TO-CERTIFY-MESSAGE) (IN-LOCAL-FLG) (IN-PROVE-FLG) (IN-VERIFY-FLG) (INCLUDING-UNCERTIFIED-P) (INHIBIT-ER-HARD) (INHIBIT-OUTPUT-LST SUMMARY) (INHIBIT-OUTPUT-LST-STACK) (INHIBITED-SUMMARY-TYPES) (INSIDE-SKIP-PROOFS) (IPRINT-AR (:HEADER :DIMENSIONS (10001) :MAXIMUM-LENGTH 40004 :DEFAULT NIL :NAME IPRINT-AR :ORDER :NONE) (0 0)) (IPRINT-FAL) (IPRINT-HARD-BOUND . 10000) (IPRINT-SOFT-BOUND . 1000) (KEEP-TMP-FILES) (LAST-EVENT-DATA) (LAST-MAKE-EVENT-EXPANSION) (LAST-STEP-LIMIT . -1) (LD-LEVEL . 0) (LD-OKP . :DEFAULT) (LD-REDEFINITION-ACTION) (LD-SKIP-PROOFSP) (LOGIC-FNS-WITH-RAW-CODE MOD-EXPT HEADER SEARCH-FN STATE-P1 AREF2 AREF1 FGETPROP GETENV$ WORMHOLE-EVAL WORMHOLE1 GET-WORMHOLE-STATUS ASET2 SGETPROP SETENV$ GETPROPS COMPRESS1 TIME-LIMIT5-REACHED-P FMT-TO-COMMENT-WINDOW LEN CPU-CORE-COUNT NONNEGATIVE-INTEGER-QUOTIENT CHECK-PRINT-BASE RETRACT-WORLD ASET1 ARRAY1P BOOLE$ ARRAY2P STRIP-CDRS COMPRESS2 STRIP-CARS PLIST-WORLDP WORMHOLE-P MAY-NEED-SLASHES-FN FMT-TO-COMMENT-WINDOW! HAS-PROPSP HARD-ERROR ABORT! P! FLUSH-COMPRESS MAYBE-FLUSH-AND-COMPRESS1 ALPHORDER EXTEND-WORLD DEFAULT-TOTAL-PARALLELISM-WORK-LIMIT USER-STOBJ-ALIST READ-ACL2-ORACLE READ-ACL2-ORACLE@PAR UPDATE-USER-STOBJ-ALIST DECREMENT-BIG-CLOCK PUT-GLOBAL CLOSE-INPUT-CHANNEL MAKUNBOUND-GLOBAL OPEN-INPUT-CHANNEL OPEN-INPUT-CHANNEL-P1 BOUNDP-GLOBAL1 GLOBAL-TABLE-CARS1 EXTEND-T-STACK LIST-ALL-PACKAGE-NAMES CLOSE-OUTPUT-CHANNEL WRITE-BYTE$ SHRINK-T-STACK ASET-32-BIT-INTEGER-STACK GET-GLOBAL 32-BIT-INTEGER-STACK-LENGTH1 EXTEND-32-BIT-INTEGER-STACK ASET-T-STACK AREF-T-STACK READ-CHAR$ AREF-32-BIT-INTEGER-STACK OPEN-OUTPUT-CHANNEL OPEN-OUTPUT-CHANNEL-P1 PRINC$ READ-OBJECT BIG-CLOCK-NEGATIVE-P PEEK-CHAR$ SHRINK-32-BIT-INTEGER-STACK READ-RUN-TIME READ-BYTE$ READ-IDATE T-STACK-LENGTH1 PRINT-OBJECT$-SER GET-OUTPUT-STREAM-STRING$-FN MV-LIST RETURN-LAST ZPF IDENTITY ENDP NTHCDR LAST REVAPPEND NULL BUTLAST STRING NOT MOD PLUSP ATOM LISTP ZP FLOOR CEILING TRUNCATE ROUND REM LOGBITP ASH LOGCOUNT SIGNUM INTEGER-LENGTH EXPT SUBSTITUTE ZEROP MINUSP ODDP EVENP = /= MAX MIN CONJUGATE LOGANDC1 LOGANDC2 LOGNAND LOGNOR LOGNOT LOGORC1 LOGORC2 LOGTEST ABS STRING-EQUAL STRING< STRING> STRING<= STRING>= STRING-UPCASE STRING-DOWNCASE KEYWORDP EQ EQL CHAR SUBST SUBLIS ACONS NTH SUBSEQ LENGTH REVERSE ZIP STANDARD-CHAR-P ALPHA-CHAR-P UPPER-CASE-P LOWER-CASE-P CHAR< CHAR> CHAR<= CHAR>= CHAR-EQUAL CHAR-UPCASE CHAR-DOWNCASE RANDOM$ THROW-NONEXEC-ERROR GC$-FN SET-COMPILER-ENABLED GOOD-BYE-FN TAKE FILE-WRITE-DATE$ PRINT-CALL-HISTORY SET-DEBUGGER-ENABLE-FN BREAK$ PRIN1$ PRIN1-WITH-SLASHES MEMBER-EQUAL ASSOC-EQUAL SUBSETP-EQUAL RASSOC-EQUAL REMOVE-EQUAL POSITION-EQUAL MAYBE-FINISH-OUTPUT$ SYMBOL-IN-CURRENT-PACKAGE-P SLEEP FAST-ALIST-LEN HONS-COPY-PERSISTENT HONS-SUMMARY HONS-CLEAR HONS-CLEAR! HONS-WASH HONS-WASH! FAST-ALIST-CLEAN FAST-ALIST-FORK HONS-EQUAL-LITE NUMBER-SUBTREES FAST-ALIST-SUMMARY HONS-ACONS! CLEAR-MEMOIZE-TABLES HONS-COPY HONS-ACONS CLEAR-MEMOIZE-TABLE FAST-ALIST-FREE HONS-EQUAL HONS-RESIZE-FN HONS-GET HONS FAST-ALIST-CLEAN! FAST-ALIST-FORK! MEMOIZE-SUMMARY CLEAR-MEMOIZE-STATISTICS MAKE-FAST-ALIST SERIALIZE-READ-FN SERIALIZE-WRITE-FN READ-OBJECT-SUPPRESS READ-OBJECT-WITH-CASE PRINT-OBJECT$-PRESERVING-CASE ASSIGN-LOCK THROW-OR-ATTACH-CALL TIME-TRACKER-FN GC-VERBOSE-FN SET-ABSSTOBJ-DEBUG-FN SYS-CALL-STATUS SYS-CALL SYS-CALL+ SYS-CALL* CANONICAL-PATHNAME DOPPELGANGER-BADGE-USERFN DOPPELGANGER-APPLY$-USERFN EV-FNCALL-W-GUARD1 PRINT-CL-CACHE-FN MFC-ANCESTORS MFC-CLAUSE MFC-RDEPTH MFC-TYPE-ALIST MFC-UNIFY-SUBST MFC-WORLD MFC-AP-FN MFC-RELIEVE-HYP-FN MFC-RELIEVE-HYP-TTREE MFC-RW+-FN MFC-RW+-TTREE MFC-RW-FN MFC-RW-TTREE MFC-TS-FN MFC-TS-TTREE MAGIC-EV-FNCALL NEVER-MEMOIZE-FN BIG-N ZP-BIG-N DECREMENT-BIG-N ANCESTORS-CHECK ONCEP-TP PRINT-CLAUSE-ID-OKP TOO-MANY-IFS-POST-REWRITE TOO-MANY-IFS-PRE-REWRITE SET-GC-STRATEGY-FN GC-STRATEGY READ-FILE-INTO-STRING2 CONS-WITH-HINT FILE-LENGTH$ DELETE-FILE$ SET-BAD-LISP-CONSP-MEMOIZE APPLY$-LAMBDA APPLY$-PRIM) (MACROS-WITH-RAW-CODE THEORY-INVARIANT SET-LET*-ABSTRACTIONP DEFAXIOM SET-BOGUS-MUTUAL-RECURSION-OK SET-RULER-EXTENDERS DELETE-INCLUDE-BOOK-DIR DELETE-INCLUDE-BOOK-DIR! CERTIFY-BOOK PROGN! F-PUT-GLOBAL PUSH-UNTOUCHABLE SET-BACKCHAIN-LIMIT SET-DEFAULT-HINTS! SET-RW-CACHE-STATE! SET-INDUCTION-DEPTH-LIMIT! SET-OVERRIDE-HINTS-MACRO DEFTHEORY PSTK VERIFY-GUARDS DEFCHOOSE SET-DEFAULT-BACKCHAIN-LIMIT SET-STATE-OK SET-IGNORE-OK SET-NON-LINEARP SET-TAU-AUTO-MODE WITH-OUTPUT SET-COMPILE-FNS ADD-INCLUDE-BOOK-DIR ADD-INCLUDE-BOOK-DIR! CLEAR-PSTK ADD-CUSTOM-KEYWORD-HINT INITIAL-GSTACK ACL2-UNWIND-PROTECT SET-WELL-FOUNDED-RELATION CATCH-TIME-LIMIT5 CATCH-TIME-LIMIT5@PAR DEFUNS ADD-DEFAULT-HINTS! LOCAL ENCAPSULATE REMOVE-DEFAULT-HINTS! INCLUDE-BOOK PPROGN SET-ENFORCE-REDUNDANCY LOGIC ER DEFLABEL MV-LET PROGRAM VALUE-TRIPLE SET-BODY COMP SET-BOGUS-DEFUN-HINTS-OK DMR-STOP DEFPKG SET-MEASURE-FUNCTION SET-INHIBIT-WARNINGS! DEFTHM MV F-BIG-CLOCK-NEGATIVE-P RESET-PREHISTORY MUTUAL-RECURSION SET-REWRITE-STACK-LIMIT SET-PROVER-STEP-LIMIT ADD-MATCH-FREE-OVERRIDE SET-MATCH-FREE-DEFAULT THE-MV TABLE IN-ARITHMETIC-THEORY REGENERATE-TAU-DATABASE SET-CASE-SPLIT-LIMITATIONS SET-IRRELEVANT-FORMALS-OK REMOVE-UNTOUCHABLE IN-THEORY WITH-OUTPUT-FORCED DMR-START REWRITE-ENTRY SKIP-PROOFS F-BOUNDP-GLOBAL MAKE-EVENT SET-VERIFY-GUARDS-EAGERNESS WORMHOLE VERIFY-TERMINATION-BOOT-STRAP START-PROOF-TREE F-DECREMENT-BIG-CLOCK DEFABSSTOBJ DEFSTOBJ DEFUND DEFTTAG PUSH-GFRAME DEFTHMD F-GET-GLOBAL CAAR CADR CDAR CDDR CAAAR CAADR CADAR CADDR CDAAR CDADR CDDAR CDDDR CAAAAR CAAADR CAADAR CAADDR CADAAR CADADR CADDAR CADDDR CDAAAR CDAADR CDADAR CDADDR CDDAAR CDDADR CDDDAR CDDDDR REST MAKE-LIST LIST OR AND * LOGIOR LOGXOR LOGAND SEARCH LOGEQV CONCATENATE LET* DEFUN THE > <= >= + - / 1+ 1- PROGN DEFMACRO COND CASE LIST* APPEND DEFCONST IN-PACKAGE INTERN FIRST SECOND THIRD FOURTH FIFTH SIXTH SEVENTH EIGHTH NINTH TENTH DIGIT-CHAR-P UNMEMOIZE MEMOIZE DEFUNS-STD DEFTHM-STD DEFUN-STD POR PAND PLET PARGS SPEC-MV-LET TRACE! WITH-LIVE-STATE WITH-OUTPUT-OBJECT-CHANNEL-SHARING WITH-HCOMP-BINDINGS WITH-HCOMP-HT-BINDINGS REDEF+ REDEF- BIND-ACL2-TIME-LIMIT DEFATTACH DEFPROXY COUNT MEMBER ASSOC SUBSETP RASSOC REMOVE REMOVE-DUPLICATES POSITION CATCH-STEP-LIMIT STEP-LIMIT-ERROR WATERFALL-PRINT-CLAUSE-ID@PAR DEFLOCK F-PUT-GLOBAL@PAR SET-WATERFALL-PARALLELISM WITH-PROVER-STEP-LIMIT WATERFALL1-WRAPPER@PAR WITH-WATERFALL-PARALLELISM-TIMINGS WITH-PARALLELISM-HAZARD-WARNINGS WARN-ABOUT-PARALLELISM-HAZARD WITH-ENSURED-PARALLELISM-FINISHING STATE-GLOBAL-LET* WITH-RECKLESS-READTABLE WITH-LOCK CATCH-THROW-TO-LOCAL-TOP-LEVEL WITH-FAST-ALIST-RAW WITH-STOLEN-ALIST-RAW FAST-ALIST-FREE-ON-EXIT-RAW STOBJ-LET ADD-LD-KEYWORD-ALIAS! SET-LD-KEYWORD-ALIASES! WITH-GUARD-CHECKING-EVENT WHEN-PASS-2 LOOP$ OUR-WITH-TERMINAL-INPUT) (MAIN-TIMER . 0) (MAKE-EVENT-DEBUG) (MAKE-EVENT-DEBUG-DEPTH . 0) (MATCH-FREE-ERROR) (MODIFYING-INCLUDE-BOOK-DIR-ALIST) (PARALLEL-EXECUTION-ENABLED) (PARALLELISM-HAZARDS-ACTION) (PC-ERP) (PC-OUTPUT) (PC-PRINT-MACROEXPANSION-FLG) (PC-PRINT-PROMPT-AND-INSTR-FLG . T) (PC-PROMPT . "->: ") (PC-PROMPT-DEPTH-PREFIX . "#") (PC-SS-ALIST) (PC-VAL) (PORT-FILE-ENABLED . T) (PPR-FLAT-RIGHT-MARGIN . 40) (PRINT-BASE . 10) (PRINT-CASE . :UPCASE) (PRINT-CIRCLE) (PRINT-CIRCLE-FILES . T) (PRINT-CLAUSE-IDS) (PRINT-ESCAPE . T) (PRINT-GV-DEFAULTS) (PRINT-LENGTH) (PRINT-LEVEL) (PRINT-LINES) (PRINT-PRETTY) (PRINT-RADIX) (PRINT-READABLY) (PRINT-RIGHT-MARGIN) (PROGRAM-FNS-WITH-RAW-CODE RELIEVE-HYP-SYNP EV-W-LST SIMPLIFY-CLAUSE1 EV-REC-ACL2-UNWIND-PROTECT ALLOCATE-FIXNUM-RANGE TRACE$-FN-GENERAL EV-FNCALL! OPEN-TRACE-FILE-FN SET-TRACE-EVISC-TUPLE EV-FNCALL-W-BODY EV-REC SETUP-SIMPLIFY-CLAUSE-POT-LST1 SAVE-EXEC-FN CW-GSTACK-FN RECOMPRESS-GLOBAL-ENABLED-STRUCTURE EV-W VERBOSE-PSTACK COMP-FN ACL2-RAW-EVAL PSTACK-FN DMR-START-FN EV-FNCALL-META LD-LOOP PRINT-SUMMARY EV EV-LST ALLEGRO-ALLOCATE-SLOWLY-FN CERTIFY-BOOK-FN TRANSLATE11-FLET-ALIST1 INCLUDE-BOOK-FN1 INCLUDE-BOOK-FN SET-W PROVE-LOOP CHK-VIRGIN-MSG W-OF-ANY-STATE LD-FN-BODY UNTRANSLATE LONGEST-COMMON-TAIL-LENGTH-REC COMPILE-FUNCTION UNTRANSLATE-LST EV-SYNP ADD-POLYS DMR-STOP-FN LD-PRINT-RESULTS CLOSE-TRACE-FILE-FN EV-FNCALL-REC EV-FNCALL LD-FN0 LD-FN WRITE-EXPANSION-FILE LATCH-STOBJS1 CHK-PACKAGE-REINCARNATION-IMPORT-RESTRICTIONS UNTRACE$-FN1 BDD-TOP DEFSTOBJ-FIELD-FNS-RAW-DEFS TIMES-MOD-M31 IPRINT-AR-AREF1 PROVE MAKE-EVENT-FN OOPS-WARNING CHECKPOINT-WORLD UBT-PREHISTORY-FN GET-DECLAIM-LIST PATHNAME-UNIX-TO-OS HCOMP-BUILD-FROM-STATE DEFCONST-VAL PUSH-WARNING-FRAME POP-WARNING-FRAME PUSH-WARNING INITIALIZE-ACCUMULATED-WARNINGS EV-REC-RETURN-LAST CHK-RETURN-LAST-ENTRY FCHECKSUM-ATOM STEP-LIMIT-ERROR1 WATERFALL1-LST@PAR WATERFALL1-WRAPPER@PAR-BEFORE WATERFALL1-WRAPPER@PAR-AFTER INCREMENT-WATERFALL-PARALLELISM-COUNTER FLUSH-WATERFALL-PARALLELISM-HASHTABLES CLEAR-CURRENT-WATERFALL-PARALLELISM-HT SETUP-WATERFALL-PARALLELISM-HT-FOR-NAME SET-WATERFALL-PARALLELISM-FN FIX-STOBJ-ARRAY-TYPE SET-GC-THRESHOLD$-FN CERTIFY-BOOK-FINISH-COMPLETE CHK-ABSSTOBJ-INVARIANTS GET-STOBJ-CREATOR IPRINT-ORACLE-UPDATES IPRINT-ORACLE-UPDATES@PAR LD-FIX-COMMAND UPDATE-ENABLED-STRUCTURE-ARRAY UPDATE-ENABLED-STRUCTURE FCHECKSUM-OBJ2 CHECK-SUM-OBJ VERIFY-GUARDS-FN1 EV-FNCALL+-W EXTEND-CURRENT-THEORY DEFSTOBJ-FN APPLY-USER-STOBJ-ALIST-OR-KWOTE) (PROMPT-FUNCTION . DEFAULT-PRINT-PROMPT) (PROMPT-MEMO) (PROOF-TREE) (PROOF-TREE-BUFFER-WIDTH . 65) (PROOF-TREE-CTX) (PROOF-TREE-INDENT . "| ") (PROOF-TREE-START-PRINTED) (PROOFS-CO . ACL2-OUTPUT-CHANNEL::STANDARD-CHARACTER-OUTPUT-0) (PROTECT-MEMOIZE-STATISTICS) (RAW-ARITY-ALIST) (RAW-GUARD-WARNINGP) (RAW-INCLUDE-BOOK-DIR!-ALIST . :IGNORE) (RAW-INCLUDE-BOOK-DIR-ALIST . :IGNORE) (RAW-PROOF-FORMAT) (RAW-WARNING-FORMAT) (REDO-FLAT-FAIL) (REDO-FLAT-SUCC) (REDUNDANT-WITH-RAW-CODE-OKP) (RETRACE-P) (SAFE-MODE) (SAVE-EXPANSION-FILE) (SAVED-OUTPUT-P) (SAVED-OUTPUT-REVERSED) (SAVED-OUTPUT-TOKEN-LST) (SCRIPT-MODE) (SERIALIZE-CHARACTER) (SERIALIZE-CHARACTER-SYSTEM) (SHOW-CUSTOM-KEYWORD-HINT-EXPANSION) (SKIP-NOTIFY-ON-DEFTTAG) (SKIP-PROOFS-BY-SYSTEM) (SKIP-PROOFS-OKP-CERT . T) (SKIP-RESET-PREHISTORY) (SLOW-APPLY$-ACTION . T) (SLOW-ARRAY-ACTION . :BREAK) (SPLITTER-OUTPUT . T) (STANDARD-CO . ACL2-OUTPUT-CHANNEL::STANDARD-CHARACTER-OUTPUT-0) (STANDARD-OI . ACL2-OUTPUT-CHANNEL::STANDARD-OBJECT-INPUT-0) (STEP-LIMIT-RECORD) (SYSTEM-ATTACHMENTS-CACHE) (SYSTEM-BOOKS-DIR) (TEMP-TOUCHABLE-FNS) (TEMP-TOUCHABLE-VARS) (TERM-EVISC-TUPLE . :DEFAULT) (TIMER-ALIST) (TMP-DIR) (TOTAL-PARALLELISM-WORK-LIMIT . 8000) (TOTAL-PARALLELISM-WORK-LIMIT-ERROR . T) (TRACE-CO . ACL2-OUTPUT-CHANNEL::STANDARD-CHARACTER-OUTPUT-0) (TRACE-SPECS) (TRIPLE-PRINT-PREFIX . " ") (TTAGS-ALLOWED . :ALL) (UNDONE-WORLDS-KILL-RING NIL NIL NIL) (USER-HOME-DIR) (VERBOSE-THEORY-WARNING . T) (VERIFY-TERMINATION-ON-RAW-PROGRAM-OKP APPLY$-LAMBDA) (WALKABOUT-ALIST) (WATERFALL-PARALLELISM) (WATERFALL-PARALLELISM-TIMING-THRESHOLD . 10000) (WATERFALL-PRINTING . :FULL) (WATERFALL-PRINTING-WHEN-FINISHED) (WINDOW-INTERFACE-POSTLUDE . "#>\\>#<\\\\>") (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 9077 CONS pages..(T=29).GC finished] [GC for 9077 CONS pages..(T=28).GC finished] [GC for 9087 CONS pages..(T=29).GC finished] [GC for 9097 CONS pages..(T=29).GC finished] [GC for 9107 CONS pages..(T=29).GC finished] [GC for 9107 CONS pages..(T=29).GC finished] [GC for 9107 CONS pages..(T=29).GC finished] [GC for 9107 CONS pages..(T=29).GC finished] [GC for 9107 CONS pages..(T=29).GC finished] [GC for 9107 CONS pages..(T=29).GC finished] [GC for 9107 CONS pages..(T=28).GC finished] [GC for 9107 CONS pages..(T=29).GC finished] [GC for 9107 CONS pages..(T=29).GC finished] [GC for 9107 CONS pages..(T=29).GC finished] [GC for 9107 CONS pages..(T=29).GC finished] [GC for 9107 CONS pages..(T=29).GC finished] [GC for 9107 CONS pages..(T=29).GC finished] [GC for 9107 CONS pages..(T=29).GC finished] [GC for 9107 CONS pages..(T=29).GC finished] [GC for 9107 CONS pages..(T=29).GC finished] [GC for 9107 CONS pages..(T=30).GC finished] [GC for 9107 CONS pages..(T=29).GC finished] [GC for 9107 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=28).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=30).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=30).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=28).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9117 CONS pages..(T=27).GC finished] [GC for 9117 CONS pages..(T=28).GC finished] [GC for 9117 CONS pages..(T=28).GC finished] [GC for 9117 CONS pages..(T=28).GC finished] [GC for 9117 CONS pages..(T=30).GC finished] [GC for 9117 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=30).GC finished] [GC for 9127 CONS pages..(T=30).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=30).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=30).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=27).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=27).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=30).GC finished] [GC for 9127 CONS pages..(T=30).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=30).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=32).GC finished] [GC for 9127 CONS pages..(T=33).GC finished] [GC for 9127 CONS pages..(T=32).GC finished] [GC for 9127 CONS pages..(T=32).GC finished] [GC for 9127 CONS pages..(T=32).GC finished] [GC for 9127 CONS pages..(T=31).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=30).GC finished] [GC for 9127 CONS pages..(T=30).GC finished] [GC for 9127 CONS pages..(T=30).GC finished] [GC for 9127 CONS pages..(T=30).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=28).GC finished] But simplification reduces this to T, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definitions 32-BIT-INTEGER-STACK, ACL2-ORACLE, ALL-BOUNDP, BIG-CLOCK-ENTRY, BOUNDP-GLOBAL1, FILE-CLOCK, FILE-CLOCK-P, GLOBAL-TABLE, IDATES, LENGTH, LIST-ALL-PACKAGE-NAMES-LST, MEMBER-EQUAL, NOT, NTH, OPEN-CHANNELS-P, OPEN-INPUT-CHANNELS, OPEN-OUTPUT-CHANNELS, PUT-GLOBAL, READ-FILES, READ-FILES-P, READABLE-FILES, READABLE-FILES-P, STATE-P, STATE-P1, T-STACK, UPDATE-GLOBAL-TABLE, USER-STOBJ-ALIST1, WRITEABLE-FILES, WRITEABLE-FILES-P, WRITTEN-FILES and WRITTEN-FILES-P, the :executable-counterparts of ALL-BOUNDP, BINARY-+, CAR, CDR, CONSP, EQLABLE-ALISTP, EQUAL, MAX, NFIX, NTH, OPEN-CHANNEL-LISTP, ORDERED-SYMBOL-ALISTP and ZP, primitive type reasoning, the :forward- chaining rules CONSP-ASSOC-EQUAL, EQLABLE-ALISTP-FORWARD-TO-ALISTP, ORDERED-SYMBOL-ALISTP-FORWARD-TO-SYMBOL-ALISTP and SYMBOL-ALISTP-FORWARD-TO-EQLABLE-ALISTP, the :rewrite rules ADD-PAIR-PRESERVES-ALL-BOUNDP, ASSOC-ADD-PAIR, LEN-UPDATE-NTH, NTH-UPDATE-NTH, ORDERED-SYMBOL-ALISTP-ADD-PAIR and STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rules 32-BIT-INTEGER-LISTP, ALISTP, CONSP-ASSOC-EQUAL, EQLABLE-ALISTP, INTEGER-LISTP, KNOWN-PACKAGE-ALISTP, OPEN-CHANNEL-LISTP, ORDERED-SYMBOL-ALISTP, PLIST-WORLDP, READ-FILE-LISTP, READABLE-FILES-LISTP, SYMBOL-ALISTP, TIMER-ALISTP, TRUE-LIST-LISTP, TRUE-LISTP-UPDATE-NTH, UPDATE-NTH, WRITABLE-FILE-LISTP and WRITTEN-FILE-LISTP. Q.E.D. That completes the proof of the guard theorem for SET-DEBUGGER-ENABLE-FN. SET-DEBUGGER-ENABLE-FN is compliant with Common Lisp. Summary Form: ( DEFUN SET-DEBUGGER-ENABLE-FN ...) Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER) (:DEFINITION 32-BIT-INTEGER-STACK) (:DEFINITION ACL2-ORACLE) (:DEFINITION ALL-BOUNDP) (:DEFINITION BIG-CLOCK-ENTRY) (:DEFINITION BOUNDP-GLOBAL1) (:DEFINITION FILE-CLOCK) (:DEFINITION FILE-CLOCK-P) (:DEFINITION GET-GLOBAL) (:DEFINITION GLOBAL-TABLE) (:DEFINITION IDATES) (:DEFINITION LENGTH) (:DEFINITION LIST-ALL-PACKAGE-NAMES-LST) (:DEFINITION MEMBER-EQUAL) (:DEFINITION NATP) (:DEFINITION NOT) (:DEFINITION NTH) (:DEFINITION OPEN-CHANNELS-P) (:DEFINITION OPEN-INPUT-CHANNELS) (:DEFINITION OPEN-OUTPUT-CHANNELS) (:DEFINITION PUT-GLOBAL) (:DEFINITION READ-FILES) (:DEFINITION READ-FILES-P) (:DEFINITION READABLE-FILES) (:DEFINITION READABLE-FILES-P) (:DEFINITION STATE-P) (:DEFINITION STATE-P1) (:DEFINITION T-STACK) (:DEFINITION UPDATE-GLOBAL-TABLE) (:DEFINITION USER-STOBJ-ALIST1) (:DEFINITION WRITEABLE-FILES) (:DEFINITION WRITEABLE-FILES-P) (:DEFINITION WRITTEN-FILES) (:DEFINITION WRITTEN-FILES-P) (:EXECUTABLE-COUNTERPART ALL-BOUNDP) (:EXECUTABLE-COUNTERPART BINARY-+) (:EXECUTABLE-COUNTERPART CAR) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART EQLABLE-ALISTP) (:EXECUTABLE-COUNTERPART EQUAL) (:EXECUTABLE-COUNTERPART MAX) (:EXECUTABLE-COUNTERPART NFIX) (:EXECUTABLE-COUNTERPART NTH) (:EXECUTABLE-COUNTERPART OPEN-CHANNEL-LISTP) (:EXECUTABLE-COUNTERPART ORDERED-SYMBOL-ALISTP) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:EXECUTABLE-COUNTERPART ZP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING CONSP-ASSOC-EQUAL) (:FORWARD-CHAINING EQLABLE-ALISTP-FORWARD-TO-ALISTP) (:FORWARD-CHAINING ORDERED-SYMBOL-ALISTP-FORWARD-TO-SYMBOL-ALISTP) (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1) (:FORWARD-CHAINING SYMBOL-ALISTP-FORWARD-TO-EQLABLE-ALISTP) (:REWRITE ADD-PAIR-PRESERVES-ALL-BOUNDP) (:REWRITE ASSOC-ADD-PAIR) (:REWRITE LEN-UPDATE-NTH) (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL) (:REWRITE NTH-UPDATE-NTH) (:REWRITE ORDERED-SYMBOL-ALISTP-ADD-PAIR) (:REWRITE STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1) (:TYPE-PRESCRIPTION 32-BIT-INTEGER-LISTP) (:TYPE-PRESCRIPTION ALISTP) (:TYPE-PRESCRIPTION CONSP-ASSOC-EQUAL) (:TYPE-PRESCRIPTION EQLABLE-ALISTP) (:TYPE-PRESCRIPTION INTEGER-LISTP) (:TYPE-PRESCRIPTION KNOWN-PACKAGE-ALISTP) (:TYPE-PRESCRIPTION MEMBER-EQ-EXEC$GUARD-CHECK) (:TYPE-PRESCRIPTION OPEN-CHANNEL-LISTP) (:TYPE-PRESCRIPTION ORDERED-SYMBOL-ALISTP) (:TYPE-PRESCRIPTION PLIST-WORLDP) (:TYPE-PRESCRIPTION PUT-GLOBAL) (:TYPE-PRESCRIPTION READ-FILE-LISTP) (:TYPE-PRESCRIPTION READABLE-FILES-LISTP) (:TYPE-PRESCRIPTION STATE-P) (:TYPE-PRESCRIPTION SYMBOL-ALISTP) (:TYPE-PRESCRIPTION TIMER-ALISTP) (:TYPE-PRESCRIPTION TRUE-LIST-LISTP) (:TYPE-PRESCRIPTION TRUE-LISTP-UPDATE-NTH) (:TYPE-PRESCRIPTION UPDATE-NTH) (:TYPE-PRESCRIPTION WRITABLE-FILE-LISTP) (:TYPE-PRESCRIPTION WRITTEN-FILE-LISTP)) Time: 67.25 seconds (prove: 67.02, print: 0.02, other: 0.21) Prover steps counted: 281062 SET-DEBUGGER-ENABLE-FN Summary Form: ( IN-THEORY (DISABLE ...)) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) (:NUMBER-OF-ENABLED-RUNES 2866) Summary Form: ( IN-THEORY (DISABLE ...)) Rules: NIL Time: 0.01 seconds (prove: 0.00, print: 0.00, other: 0.01) (:NUMBER-OF-ENABLED-RUNES 2865) Summary Form: ( IN-THEORY (DISABLE ...)) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) (:NUMBER-OF-ENABLED-RUNES 2864) Since ADD-@PAR-SUFFIX is non-recursive, its admission is trivial. We observe that the type of ADD-@PAR-SUFFIX is described by the theorem (SYMBOLP (ADD-@PAR-SUFFIX SYMBOL)). We used the :type-prescription rule SYMBOLP-INTERN-IN-PACKAGE-OF-SYMBOL. Computing the guard conjecture for ADD-@PAR-SUFFIX.... The guard conjecture for ADD-@PAR-SUFFIX is trivial to prove, given primitive type reasoning and the :type-prescription rule STRING-APPEND. ADD-@PAR-SUFFIX is compliant with Common Lisp. Summary Form: ( DEFUN ADD-@PAR-SUFFIX ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL) (:TYPE-PRESCRIPTION STRING-APPEND) (:TYPE-PRESCRIPTION SYMBOLP-INTERN-IN-PACKAGE-OF-SYMBOL)) Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18) ADD-@PAR-SUFFIX The admission of GENERATE-@PAR-MAPPINGS is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT SYMBOLS). We observe that the type of GENERATE-@PAR-MAPPINGS is described by the theorem (TRUE-LISTP (GENERATE-@PAR-MAPPINGS SYMBOLS)). We used primitive type reasoning. Computing the guard conjecture for GENERATE-@PAR-MAPPINGS.... The non-trivial part of the guard conjecture for GENERATE-@PAR-MAPPINGS, given the :forward-chaining rule SYMBOL-LISTP-FORWARD-TO-TRUE-LISTP and the :type-prescription rule SYMBOL-LISTP, is Goal (AND (IMPLIES (AND (SYMBOL-LISTP SYMBOLS) (NOT (ENDP SYMBOLS))) (SYMBOLP (CAR SYMBOLS))) (IMPLIES (AND (SYMBOL-LISTP SYMBOLS) (NOT (ENDP SYMBOLS))) (SYMBOL-LISTP (CDR SYMBOLS)))). By the simple :definition ENDP we reduce the conjecture to the following two conjectures. Subgoal 2 (IMPLIES (AND (SYMBOL-LISTP SYMBOLS) (CONSP SYMBOLS)) (SYMBOLP (CAR SYMBOLS))). But simplification reduces this to T, using the :definition SYMBOL-LISTP. Subgoal 1 (IMPLIES (AND (SYMBOL-LISTP SYMBOLS) (CONSP SYMBOLS)) (SYMBOL-LISTP (CDR SYMBOLS))). But simplification reduces this to T, using the :definition SYMBOL-LISTP. Q.E.D. That completes the proof of the guard theorem for GENERATE-@PAR-MAPPINGS. GENERATE-@PAR-MAPPINGS is compliant with Common Lisp. Summary Form: ( DEFUN GENERATE-@PAR-MAPPINGS ...) Rules: ((:DEFINITION ENDP) (:DEFINITION NOT) (:DEFINITION SYMBOL-LISTP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING SYMBOL-LISTP-FORWARD-TO-TRUE-LISTP) (:TYPE-PRESCRIPTION SYMBOL-LISTP)) Time: 0.24 seconds (prove: 0.00, print: 0.00, other: 0.24) 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))). [GC for 9127 CONS pages..(T=29).GC finished] 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.56 seconds (prove: 0.29, print: 0.00, other: 0.27) 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.01 seconds (prove: 0.00, print: 0.00, other: 0.01) :REDUNDANT ACL2 !>>(DEFMACRO APPLY-OVERRIDE-HINTS@PAR (&REST RST) (CONS 'APPLY-OVERRIDE-HINTS RST)) The event ( DEFMACRO APPLY-OVERRIDE-HINTS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO APPLY-OVERRIDE-HINTS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO APPLY-REORDER-HINT@PAR (&REST RST) (CONS 'APPLY-REORDER-HINT RST)) The event ( DEFMACRO APPLY-REORDER-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO APPLY-REORDER-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR (&REST RST) (CONS 'APPLY-TOP-HINTS-CLAUSE RST)) The event ( DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR (&REST RST) (CONS 'CHECK-TRANSLATED-OVERRIDE-HINT RST)) The event ( DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHK-ARGLIST@PAR (&REST RST) (CONS 'CHK-ARGLIST RST)) The event ( DEFMACRO CHK-ARGLIST@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO CHK-ARGLIST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR (&REST RST) (CONS 'CHK-DO-NOT-EXPR-VALUE RST)) The event ( DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHK-EQUAL-ARITIES@PAR (&REST RST) (CONS 'CHK-EQUAL-ARITIES RST)) The event ( DEFMACRO CHK-EQUAL-ARITIES@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CHK-EQUAL-ARITIES@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHK-EQUIV-CLASSICALP@PAR (&REST RST) (CONS 'CHK-EQUIV-CLASSICALP RST)) The event ( DEFMACRO CHK-EQUIV-CLASSICALP@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CHK-EQUIV-CLASSICALP@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHK-THEORY-EXPR-VALUE@PAR (&REST RST) (CONS 'CHK-THEORY-EXPR-VALUE RST)) The event ( DEFMACRO CHK-THEORY-EXPR-VALUE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CHK-THEORY-EXPR-VALUE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR (&REST RST) (CONS 'CHK-THEORY-EXPR-VALUE1 RST)) The event ( DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHK-THEORY-INVARIANT@PAR (&REST RST) (CONS 'CHK-THEORY-INVARIANT RST)) The event ( DEFMACRO CHK-THEORY-INVARIANT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CHK-THEORY-INVARIANT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHK-THEORY-INVARIANT1@PAR (&REST RST) (CONS 'CHK-THEORY-INVARIANT1 RST)) The event ( DEFMACRO CHK-THEORY-INVARIANT1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CHK-THEORY-INVARIANT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR (&REST RST) (CONS 'CUSTOM-KEYWORD-HINT-INTERPRETER RST)) The event ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR (&REST RST) (CONS 'CUSTOM-KEYWORD-HINT-INTERPRETER1 RST)) The event ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR (&REST RST) (CONS 'EVAL-AND-TRANSLATE-HINT-EXPRESSION RST)) The event ( DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR (&REST RST) (CONS 'FIND-APPLICABLE-HINT-SETTINGS RST)) The event ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR (&REST RST) (CONS 'FIND-APPLICABLE-HINT-SETTINGS1 RST)) The event ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO GAG-STATE-EXITING-CL-ID@PAR (&REST RST) (CONS 'GAG-STATE-EXITING-CL-ID RST)) The event ( DEFMACRO GAG-STATE-EXITING-CL-ID@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO GAG-STATE-EXITING-CL-ID@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR (&REST RST) (CONS 'LOAD-HINT-SETTINGS-INTO-PSPV RST)) The event ( DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR (&REST RST) (CONS 'LOAD-HINT-SETTINGS-INTO-RCNST RST)) The event ( DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR (&REST RST) (CONS 'LOAD-THEORY-INTO-ENABLED-STRUCTURE RST)) The event ( DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR (&REST RST) (CONS 'MAYBE-WARN-ABOUT-THEORY RST)) The event ( DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR ...) Rules: NIL Time: 0.01 seconds (prove: 0.00, print: 0.00, other: 0.01) :REDUNDANT ACL2 !>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR (&REST RST) (CONS 'MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS RST)) The event ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR (&REST RST) (CONS 'MAYBE-WARN-ABOUT-THEORY-SIMPLE RST)) The event ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR (&REST RST) (CONS 'MAYBE-WARN-FOR-USE-HINT RST)) The event ( DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR (&REST RST) (CONS 'PAIR-CL-ID-WITH-HINT-SETTING RST)) The event ( DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO PROCESS-BACKTRACK-HINT@PAR (&REST RST) (CONS 'PROCESS-BACKTRACK-HINT RST)) The event ( DEFMACRO PROCESS-BACKTRACK-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO PROCESS-BACKTRACK-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO PUSH-CLAUSE@PAR (&REST RST) (CONS 'PUSH-CLAUSE RST)) The event ( DEFMACRO PUSH-CLAUSE@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO PUSH-CLAUSE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR (&REST RST) (CONS 'PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM RST)) The event ( DEFMACRO PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO RECORD-GAG-STATE@PAR (&REST RST) (CONS 'RECORD-GAG-STATE RST)) The event ( DEFMACRO RECORD-GAG-STATE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO RECORD-GAG-STATE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO THANKS-FOR-THE-HINT@PAR (&REST RST) (CONS 'THANKS-FOR-THE-HINT RST)) The event ( DEFMACRO THANKS-FOR-THE-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO THANKS-FOR-THE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE@PAR (&REST RST) (CONS 'TRANSLATE RST)) The event ( DEFMACRO TRANSLATE@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO TRANSLATE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE1@PAR (&REST RST) (CONS 'TRANSLATE1 RST)) The event ( DEFMACRO TRANSLATE1@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO TRANSLATE1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BACKCHAIN-LIMIT-RW-HINT RST)) The event ( DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BACKTRACK-HINT RST)) The event ( DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-BDD-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BDD-HINT RST)) The event ( DEFMACRO TRANSLATE-BDD-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-BDD-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-BDD-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-BDD-HINT1 RST)) The event ( DEFMACRO TRANSLATE-BDD-HINT1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-BDD-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-BY-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BY-HINT RST)) The event ( DEFMACRO TRANSLATE-BY-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-BY-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT RST)) The event ( DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-CASES-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CASES-HINT RST)) The event ( DEFMACRO TRANSLATE-CASES-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-CASES-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CLAUSE-PROCESSOR-HINT RST)) The event ( DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CUSTOM-KEYWORD-HINT RST)) The event ( DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-DO-NOT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-DO-NOT-HINT RST)) The event ( DEFMACRO TRANSLATE-DO-NOT-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-DO-NOT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-DO-NOT-INDUCT-HINT RST)) The event ( DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-ERROR-HINT@PAR (&REST RST) (CONS 'TRANSLATE-ERROR-HINT RST)) The event ( DEFMACRO TRANSLATE-ERROR-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-ERROR-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-HINT@PAR (&REST RST) (CONS 'TRANSLATE-EXPAND-HINT RST)) The event ( DEFMACRO TRANSLATE-EXPAND-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-EXPAND-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-EXPAND-HINT1 RST)) The event ( DEFMACRO TRANSLATE-EXPAND-HINT1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-EXPAND-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-TERM@PAR (&REST RST) (CONS 'TRANSLATE-EXPAND-TERM RST)) The event ( DEFMACRO TRANSLATE-EXPAND-TERM@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-EXPAND-TERM@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-TERM1@PAR (&REST RST) (CONS 'TRANSLATE-EXPAND-TERM1 RST)) The event ( DEFMACRO TRANSLATE-EXPAND-TERM1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-EXPAND-TERM1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR (&REST RST) (CONS 'TRANSLATE-FUNCTIONAL-SUBSTITUTION RST)) The event ( DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR (&REST RST) (CONS 'TRANSLATE-HANDS-OFF-HINT RST)) The event ( DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-HANDS-OFF-HINT1 RST)) The event ( DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINT@PAR (&REST RST) (CONS 'TRANSLATE-HINT RST)) The event ( DEFMACRO TRANSLATE-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINTS@PAR (&REST RST) (CONS 'TRANSLATE-HINTS RST)) The event ( DEFMACRO TRANSLATE-HINTS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINTS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINTS1@PAR (&REST RST) (CONS 'TRANSLATE-HINTS1 RST)) The event ( DEFMACRO TRANSLATE-HINTS1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINTS1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINTS2@PAR (&REST RST) (CONS 'TRANSLATE-HINTS2 RST)) The event ( DEFMACRO TRANSLATE-HINTS2@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINTS2@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINTS+1@PAR (&REST RST) (CONS 'TRANSLATE-HINTS+1 RST)) The event ( DEFMACRO TRANSLATE-HINTS+1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINTS+1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR (&REST RST) (CONS 'TRANSLATE-HINT-EXPRESSION RST)) The event ( DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR (&REST RST) (CONS 'TRANSLATE-HINT-EXPRESSIONS RST)) The event ( DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINT-SETTINGS@PAR (&REST RST) (CONS 'TRANSLATE-HINT-SETTINGS RST)) The event ( DEFMACRO TRANSLATE-HINT-SETTINGS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINT-SETTINGS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-INDUCT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-INDUCT-HINT RST)) The event ( DEFMACRO TRANSLATE-INDUCT-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-INDUCT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-LMI@PAR (&REST RST) (CONS 'TRANSLATE-LMI RST)) The event ( DEFMACRO TRANSLATE-LMI@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-LMI@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR (&REST RST) (CONS 'TRANSLATE-LMI/FUNCTIONAL-INSTANCE RST)) The event ( DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-LMI/INSTANCE@PAR (&REST RST) (CONS 'TRANSLATE-LMI/INSTANCE RST)) The event ( DEFMACRO TRANSLATE-LMI/INSTANCE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-LMI/INSTANCE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-NO-OP-HINT@PAR (&REST RST) (CONS 'TRANSLATE-NO-OP-HINT RST)) The event ( DEFMACRO TRANSLATE-NO-OP-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-NO-OP-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR (&REST RST) (CONS 'TRANSLATE-NO-THANKS-HINT RST)) The event ( DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR (&REST RST) (CONS 'TRANSLATE-NONLINEARP-HINT RST)) The event ( DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-OR-HINT@PAR (&REST RST) (CONS 'TRANSLATE-OR-HINT RST)) The event ( DEFMACRO TRANSLATE-OR-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-OR-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-REORDER-HINT@PAR (&REST RST) (CONS 'TRANSLATE-REORDER-HINT RST)) The event ( DEFMACRO TRANSLATE-REORDER-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-REORDER-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-RESTRICT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-RESTRICT-HINT RST)) The event ( DEFMACRO TRANSLATE-RESTRICT-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-RESTRICT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR (&REST RST) (CONS 'TRANSLATE-RW-CACHE-STATE-HINT RST)) The event ( DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR (&REST RST) (CONS 'TRANSLATE-SIMPLE-OR-ERROR-TRIPLE RST)) The event ( DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-SUBSTITUTION@PAR (&REST RST) (CONS 'TRANSLATE-SUBSTITUTION RST)) The event ( DEFMACRO TRANSLATE-SUBSTITUTION@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-SUBSTITUTION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR (&REST RST) (CONS 'TRANSLATE-SUBSTITUTION-LST RST)) The event ( DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-TERM-LST@PAR (&REST RST) (CONS 'TRANSLATE-TERM-LST RST)) The event ( DEFMACRO TRANSLATE-TERM-LST@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-TERM-LST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-USE-HINT@PAR (&REST RST) (CONS 'TRANSLATE-USE-HINT RST)) The event ( DEFMACRO TRANSLATE-USE-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-USE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-USE-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-USE-HINT1 RST)) The event ( DEFMACRO TRANSLATE-USE-HINT1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-USE-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-X-HINT-VALUE@PAR (&REST RST) (CONS 'TRANSLATE-X-HINT-VALUE RST)) The event ( DEFMACRO TRANSLATE-X-HINT-VALUE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-X-HINT-VALUE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR (&REST RST) (CONS 'WARN-ON-DUPLICATE-HINT-GOAL-SPECS RST)) The event ( DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL-MSG@PAR (&REST RST) (CONS 'WATERFALL-MSG RST)) The event ( DEFMACRO WATERFALL-MSG@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL-MSG@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL-PRINT-CLAUSE@PAR (&REST RST) (CONS 'WATERFALL-PRINT-CLAUSE RST)) The event ( DEFMACRO WATERFALL-PRINT-CLAUSE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL-PRINT-CLAUSE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL-STEP@PAR (&REST RST) (CONS 'WATERFALL-STEP RST)) The event ( DEFMACRO WATERFALL-STEP@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL-STEP@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL-STEP1@PAR (&REST RST) (CONS 'WATERFALL-STEP1 RST)) The event ( DEFMACRO WATERFALL-STEP1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL-STEP1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL-STEP-CLEANUP@PAR (&REST RST) (CONS 'WATERFALL-STEP-CLEANUP RST)) The event ( DEFMACRO WATERFALL-STEP-CLEANUP@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL-STEP-CLEANUP@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL0@PAR (&REST RST) (CONS 'WATERFALL0 RST)) The event ( DEFMACRO WATERFALL0@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO WATERFALL0@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL0-OR-HIT@PAR (&REST RST) (CONS 'WATERFALL0-OR-HIT RST)) The event ( DEFMACRO WATERFALL0-OR-HIT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL0-OR-HIT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL0-WITH-HINT-SETTINGS@PAR (&REST RST) (CONS 'WATERFALL0-WITH-HINT-SETTINGS RST)) The event ( DEFMACRO WATERFALL0-WITH-HINT-SETTINGS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL0-WITH-HINT-SETTINGS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL1@PAR (&REST RST) (CONS 'WATERFALL1 RST)) The event ( DEFMACRO WATERFALL1@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO WATERFALL1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Summary Form: ( PROGN (DEFMACRO CATCH-TIME-LIMIT5@PAR ...) ...) Rules: NIL Time: 0.05 seconds (prove: 0.00, print: 0.00, other: 0.05) :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 [GC for 9127 CONS pages..by O-P) and the measure (ACL2-COUNT FORMS).(T=29).GC finished] 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.58 seconds (prove: 0.00, print: 0.00, other: 0.58) 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.24 seconds (prove: 0.00, print: 0.00, other: 0.24) 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.21 seconds (prove: 0.00, print: 0.00, other: 0.21) 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. [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=37).GC finished] Summary Form: ( DEFUN LOGICP ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.60 seconds (prove: 0.00, print: 0.00, other: 0.60) LOGICP The event ( DEFMACRO LOGICALP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO LOGICALP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO PROGRAMP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO PROGRAMP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFCONST *STOBJS-OUT-INVALID* ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFCONST *STOBJS-OUT-INVALID* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since STOBJS-OUT is non-recursive, its admission is trivial. We could deduce no constraints on the type of STOBJS-OUT. However, in normalizing the definition we used the :type-prescription rule ILLEGAL. Computing the guard conjecture for STOBJS-OUT.... The non-trivial part of the guard conjecture for STOBJS-OUT, given the :type-prescription rule MEMBER-EQ-EXEC$GUARD-CHECK, is Goal (AND (IMPLIES (AND (SYMBOLP FN) (PLIST-WORLDP W)) (LET ((X FN) (L '(IF RETURN-LAST))) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQ-EXEC X L))))) (IMPLIES (AND (NOT (LET ((X FN) (L '(IF RETURN-LAST))) (MEMBER-EQUAL X L))) (PLIST-WORLDP W) (SYMBOLP FN) (NOT (EQ FN 'CONS))) (NOT (MEMBER-EQUAL FN '(IF RETURN-LAST))))). But we reduce the conjecture to T, by the simple :definition EQ, the :executable-counterpart of TAU-SYSTEM and the simple :rewrite rule MEMBER-EQ-EXEC-IS-MEMBER-EQUAL. Q.E.D. That completes the proof of the guard theorem for STOBJS-OUT. STOBJS-OUT is compliant with Common Lisp. Summary Form: ( DEFUN STOBJS-OUT ...) Rules: ((:DEFINITION EQ) (:DEFINITION NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL) (:TYPE-PRESCRIPTION ILLEGAL) (:TYPE-PRESCRIPTION MEMBER-EQ-EXEC$GUARD-CHECK)) Time: 0.35 seconds (prove: 0.00, print: 0.00, other: 0.35) Prover steps counted: 98 STOBJS-OUT Since EV-FNCALL-W-GUARD1 is non-recursive, its admission is trivial. We observe that the type of EV-FNCALL-W-GUARD1 is described by the theorem (OR (CONSP (EV-FNCALL-W-GUARD1 FN WRLD TEMP-TOUCHABLE-FNS)) (EQUAL (EV-FNCALL-W-GUARD1 FN WRLD TEMP-TOUCHABLE-FNS) NIL)). We used primitive type reasoning. Computing the guard conjecture for EV-FNCALL-W-GUARD1.... The non-trivial part of the guard conjecture for EV-FNCALL-W-GUARD1 is Goal (AND (IMPLIES (AND (PLIST-WORLDP WRLD) (SYMBOLP FN) (NOT (EQ FN 'IF))) (LET ((X FN) (ALIST '((HONS-WASH!) (HONS-CLEAR!) (OPEN-OUTPUT-CHANNEL!) (REMOVE-UNTOUCHABLE-FN " Note that the same restriction applies to the macro ~x0, whose ~ expansions generate calls of ~x1." (#\0 . REMOVE-UNTOUCHABLE) (#\1 . REMOVE-UNTOUCHABLE-FN)) (SET-RAW-MODE-ON " If you do not plan to certify books in this session, then ~ instead you may want to call ~x0; see :DOC ~x0." (#\0 . SET-RAW-MODE-ON!)) (SET-TEMP-TOUCHABLE-FNS) (SET-TEMP-TOUCHABLE-VARS) (SYS-CALL) (SYS-CALL*) (SYS-CALL+)))) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST)) (EQUAL (ASSOC-EQUAL X ALIST) (ASSOC-EQ-EXEC X ALIST))))) (IMPLIES (AND (PLIST-WORLDP WRLD) (SYMBOLP FN) (NOT (EQ FN 'IF)) (NOT (ASSOC-EQUAL FN '((HONS-WASH!) (HONS-CLEAR!) (OPEN-OUTPUT-CHANNEL!) (REMOVE-UNTOUCHABLE-FN " Note that the same restriction applies to the macro ~x0, whose ~ expansions generate calls of ~x1." (#\0 . REMOVE-UNTOUCHABLE) (#\1 . REMOVE-UNTOUCHABLE-FN)) (SET-RAW-MODE-ON " If you do not plan to certify books in this session, then ~ instead you may want to call ~x0; see :DOC ~x0." (#\0 . SET-RAW-MODE-ON!)) (SET-TEMP-TOUCHABLE-FNS) (SET-TEMP-TOUCHABLE-VARS) (SYS-CALL) (SYS-CALL*) (SYS-CALL+))))) (LET ((FORMALS (FGETPROP FN 'FORMALS T WRLD))) (AND (SYMBOLP FN) (PLIST-WORLDP WRLD) (LET ((STOBJS-IN (STOBJS-IN FN WRLD))) (AND (PLIST-WORLDP WRLD) (LET ((UNTOUCHABLE-FNS (GLOBAL-VAL 'UNTOUCHABLE-FNS WRLD))) (AND (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (LET ((X FN) (L UNTOUCHABLE-FNS)) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQ-EXEC X L))))) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (MEMBER-EQUAL FN UNTOUCHABLE-FNS) (LET ((X FN) (L UNTOUCHABLE-FNS)) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQ-EXEC X L))))) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQ T TEMP-TOUCHABLE-FNS) (NOT (TRUE-LISTP TEMP-TOUCHABLE-FNS)) (LET ((X FN) (L TEMP-TOUCHABLE-FNS)) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQ-EXEC X L))))) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQ T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (NOT (NULL FORMALS)) (SYMBOLP FN)) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQ T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (NOT (NULL FORMALS)) (PLIST-WORLDP WRLD)) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQ T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (NULL FORMALS) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (PLIST-WORLDP WRLD)) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQ T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (NULL FORMALS) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (SYMBOLP FN)) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQ T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (NULL FORMALS) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (EQ FN 'RETURN-LAST) (SYMBOLP FN)) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQ T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (NULL FORMALS) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (EQ FN 'RETURN-LAST) (NOT (LET ((X FN) (L '(IF RETURN-LAST))) (MBE :LOGIC (PROG2$ (MEMBER-EQ-EXEC$GUARD-CHECK X L) (MEMBER-EQUAL X L)) :EXEC (MEMBER-EQ-EXEC X L))))) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQ T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (NULL FORMALS) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (EQ FN 'RETURN-LAST) (PLIST-WORLDP WRLD)))))))))). [GC for 9127 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 (ASSOC-EQUAL FN '((HONS-WASH!) (HONS-CLEAR!) (OPEN-OUTPUT-CHANNEL!) (REMOVE-UNTOUCHABLE-FN " Note that the same restriction applies to the macro ~x0, whose ~ expansions generate calls of ~x1." (#\0 . REMOVE-UNTOUCHABLE) (#\1 . REMOVE-UNTOUCHABLE-FN)) (SET-RAW-MODE-ON " If you do not plan to certify books in this session, then ~ instead you may want to call ~x0; see :DOC ~x0." (#\0 . SET-RAW-MODE-ON!)) (SET-TEMP-TOUCHABLE-FNS) (SET-TEMP-TOUCHABLE-VARS) (SYS-CALL) (SYS-CALL*) (SYS-CALL+))))) (LET ((FORMALS (FGETPROP FN 'FORMALS T WRLD))) (AND (SYMBOLP FN) (PLIST-WORLDP WRLD) (LET ((STOBJS-IN (STOBJS-IN FN WRLD))) (AND (PLIST-WORLDP WRLD) (LET ((UNTOUCHABLE-FNS (FGETPROP 'UNTOUCHABLE-FNS 'GLOBAL-VALUE '(:ERROR "GLOBAL-VAL didn't find a value. Initialize this ~ symbol in PRIMORDIAL-WORLD-GLOBALS.") WRLD))) (AND (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (LET ((X FN) (L UNTOUCHABLE-FNS)) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L))))) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (MEMBER-EQUAL FN UNTOUCHABLE-FNS) (LET ((X FN) (L UNTOUCHABLE-FNS)) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L))))) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQUAL T TEMP-TOUCHABLE-FNS) (NOT (TRUE-LISTP TEMP-TOUCHABLE-FNS)) (LET ((X FN) (L TEMP-TOUCHABLE-FNS)) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L))))) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQUAL T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (NOT (EQUAL FORMALS NIL)) (SYMBOLP FN)) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQUAL T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (NOT (EQUAL FORMALS NIL)) (PLIST-WORLDP WRLD)) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQUAL T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (EQUAL FORMALS NIL) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (PLIST-WORLDP WRLD)) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQUAL T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (EQUAL FORMALS NIL) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (SYMBOLP FN)) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQUAL T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (EQUAL FORMALS NIL) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (EQUAL FN 'RETURN-LAST) (SYMBOLP FN)) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQUAL T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (EQUAL FORMALS NIL) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (EQUAL FN 'RETURN-LAST) (NOT (MEMBER-EQUAL FN '(IF RETURN-LAST)))) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQUAL T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (EQUAL FORMALS NIL) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (EQUAL FN 'RETURN-LAST) (PLIST-WORLDP WRLD))))))))). [GC for 9127 CONS pages..(T=29).GC finished] [GC for 9127 CONS pages..(T=29).GC finished] But simplification reduces this to T, using the :definitions ASSOC-EQUAL, MEMBER-EQUAL, NOT and STOBJS-IN, the :executable-counterparts of CAR, CDR, CONSP and NOT, primitive type reasoning and the :type-prescription rule PLIST-WORLDP. Q.E.D. That completes the proof of the guard theorem for EV-FNCALL-W-GUARD1. EV-FNCALL-W-GUARD1 is compliant with Common Lisp. Summary Form: ( DEFUN EV-FNCALL-W-GUARD1 ...) Rules: ((:DEFINITION ASSOC-EQUAL) (:DEFINITION EQ) (:DEFINITION GLOBAL-VAL) (:DEFINITION MEMBER-EQ-EXEC$GUARD-CHECK) (:DEFINITION MEMBER-EQUAL) (:DEFINITION NOT) (:DEFINITION NULL) (:DEFINITION RETURN-LAST) (:DEFINITION STOBJS-IN) (:EXECUTABLE-COUNTERPART CAR) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE ASSOC-EQ-EXEC-IS-ASSOC-EQUAL) (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL) (:TYPE-PRESCRIPTION PLIST-WORLDP)) Time: 1.05 seconds (prove: 0.91, print: 0.01, other: 0.13) Prover steps counted: 3573 EV-FNCALL-W-GUARD1 Since EV-FNCALL-W-GUARD is non-recursive, its admission is trivial. We could deduce no constraints on the type of EV-FNCALL-W-GUARD. Computing the guard conjecture for EV-FNCALL-W-GUARD.... The guard conjecture for EV-FNCALL-W-GUARD is trivial to prove, given the :compound-recognizer rule EQLABLEP-RECOG and the :type-prescription rules EV-FNCALL-W-GUARD1 and LENGTH. EV-FNCALL-W-GUARD is compliant with Common Lisp. Summary Form: ( DEFUN EV-FNCALL-W-GUARD ...) Rules: ((:COMPOUND-RECOGNIZER EQLABLEP-RECOG) (:TYPE-PRESCRIPTION EV-FNCALL-W-GUARD1) (:TYPE-PRESCRIPTION LENGTH)) Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10) 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.10 seconds (prove: 0.01, print: 0.00, other: 0.09) Prover steps counted: 51 TIME-TRACKER-FN The event ( DEFMACRO TIME-TRACKER ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO TIME-TRACKER ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since SET-ABSSTOBJ-DEBUG-FN is non-recursive, its admission is trivial. We observe that the type of SET-ABSSTOBJ-DEBUG-FN is described by the theorem (EQUAL (SET-ABSSTOBJ-DEBUG-FN VAL ALWAYS) VAL). Computing the guard conjecture for SET-ABSSTOBJ-DEBUG-FN.... The guard conjecture for SET-ABSSTOBJ-DEBUG-FN is trivial to prove. SET-ABSSTOBJ-DEBUG-FN is compliant with Common Lisp. Summary Form: ( DEFUN SET-ABSSTOBJ-DEBUG-FN ...) Rules: NIL Time: 0.11 seconds (prove: 0.00, print: 0.00, other: 0.11) SET-ABSSTOBJ-DEBUG-FN The event ( DEFMACRO SET-ABSSTOBJ-DEBUG ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO SET-ABSSTOBJ-DEBUG ...) Rules: NIL Time: 0.01 seconds (prove: 0.00, print: 0.00, other: 0.01) :REDUNDANT [GC for 9127 CONS pages..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.18 seconds (prove: 0.00, print: 0.00, other: 0.18) GC-STRATEGY The event ( DEFCONST *EXPANDABLE-BOOT-STRAP-NON-REC-FNS* ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFCONST *EXPANDABLE-BOOT-STRAP-NON-REC-FNS* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFCONST *DEFINITION-MINIMAL-THEORY* ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFCONST *DEFINITION-MINIMAL-THEORY* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFCONST *DEFINITION-MINIMAL-THEORY-ALIST* ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFCONST *DEFINITION-MINIMAL-THEORY-ALIST* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since BBODY-FN is non-recursive, its admission is trivial. We could deduce no constraints on the type of BBODY-FN. However, in normalizing the definition we used the :type-prescription rule ILLEGAL. Computing the guard conjecture for BBODY-FN.... The non-trivial part of the guard conjecture for BBODY-FN, given the :type-prescription rule MEMBER-EQ-EXEC$GUARD-CHECK, is Goal (AND (LET ((X FN) (L '(MV-NTH IFF NOT IMPLIES EQ ATOM EQL = /= NULL ENDP ZEROP SYNP PLUSP MINUSP LISTP RETURN-LAST MV-LIST CONS-WITH-HINT THE-CHECK WORMHOLE-EVAL FORCE CASE-SPLIT DOUBLE-REWRITE))) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQ-EXEC X L)))) (IMPLIES (LET ((X FN) (L '(MV-NTH IFF NOT IMPLIES EQ ATOM EQL = /= NULL ENDP ZEROP SYNP PLUSP MINUSP LISTP RETURN-LAST MV-LIST CONS-WITH-HINT THE-CHECK WORMHOLE-EVAL FORCE CASE-SPLIT DOUBLE-REWRITE))) (MEMBER-EQUAL X L)) (LET ((PAIR (ASSOC-EQUAL FN '((/= IF (EQUAL X Y) 'NIL 'T) (= EQUAL X Y) (ATOM IF (CONSP X) 'NIL 'T) (CASE-SPLIT . X) (CONS-WITH-HINT CONS X Y) (DOUBLE-REWRITE . X) (ENDP IF (CONSP X) 'NIL 'T) (EQ EQUAL X Y) (EQL EQUAL X Y) (FORCE . X) (IFF IF P (IF Q 'T 'NIL) (IF Q 'NIL 'T)) (IMPLIES IF P (IF Q 'T 'NIL) 'T) (LISTP IF (CONSP X) 'T (EQUAL X 'NIL)) (MINUSP < X '0) (MV-LIST . X) (MV-NTH IF (CONSP L) (IF (ZP N) (CAR L) (MV-NTH (BINARY-+ '-1 N) (CDR L))) 'NIL) (NOT IF P 'NIL 'T) (NULL EQUAL X 'NIL) (PLUSP < '0 X) (RETURN-LAST . LAST-ARG) (SYNP QUOTE T) (THE-CHECK . Y) (WORMHOLE-EVAL QUOTE NIL) (ZEROP EQUAL X '0))))) (AND (OR (NOT PAIR) (CONSP PAIR) (EQUAL PAIR NIL)) PAIR))) (IMPLIES (LET ((X FN) (L '(MV-NTH IFF NOT IMPLIES EQ ATOM EQL = /= NULL ENDP ZEROP SYNP PLUSP MINUSP LISTP RETURN-LAST MV-LIST CONS-WITH-HINT THE-CHECK WORMHOLE-EVAL FORCE CASE-SPLIT DOUBLE-REWRITE))) (MEMBER-EQUAL X L)) (LET ((X FN) (ALIST '((/= IF (EQUAL X Y) 'NIL 'T) (= EQUAL X Y) (ATOM IF (CONSP X) 'NIL 'T) (CASE-SPLIT . X) (CONS-WITH-HINT CONS X Y) (DOUBLE-REWRITE . X) (ENDP IF (CONSP X) 'NIL 'T) (EQ EQUAL X Y) (EQL EQUAL X Y) (FORCE . X) (IFF IF P (IF Q 'T 'NIL) (IF Q 'NIL 'T)) (IMPLIES IF P (IF Q 'T 'NIL) 'T) (LISTP IF (CONSP X) 'T (EQUAL X 'NIL)) (MINUSP < X '0) (MV-LIST . X) (MV-NTH IF (CONSP L) (IF (ZP N) (CAR L) (MV-NTH (BINARY-+ '-1 N) (CDR L))) 'NIL) (NOT IF P 'NIL 'T) (NULL EQUAL X 'NIL) (PLUSP < '0 X) (RETURN-LAST . LAST-ARG) (SYNP QUOTE T) (THE-CHECK . Y) (WORMHOLE-EVAL QUOTE NIL) (ZEROP EQUAL X '0)))) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST)) (EQUAL (ASSOC-EQUAL X ALIST) (ASSOC-EQ-EXEC X ALIST)))))). By the :executable-counterparts of IF, SYMBOL-LISTP, TAU-SYSTEM and TRUE-LISTP and the simple :rewrite rules ASSOC-EQ-EXEC-IS-ASSOC-EQUAL and MEMBER-EQ-EXEC-IS-MEMBER-EQUAL we reduce the conjecture to Goal' (IMPLIES (MEMBER-EQUAL FN '(MV-NTH IFF NOT IMPLIES EQ ATOM EQL = /= NULL ENDP ZEROP SYNP PLUSP MINUSP LISTP RETURN-LAST MV-LIST CONS-WITH-HINT THE-CHECK WORMHOLE-EVAL FORCE CASE-SPLIT DOUBLE-REWRITE)) (LET ((PAIR (ASSOC-EQUAL FN '((/= IF (EQUAL X Y) 'NIL 'T) (= EQUAL X Y) (ATOM IF (CONSP X) 'NIL 'T) (CASE-SPLIT . X) (CONS-WITH-HINT CONS X Y) (DOUBLE-REWRITE . X) (ENDP IF (CONSP X) 'NIL 'T) (EQ EQUAL X Y) (EQL EQUAL X Y) (FORCE . X) (IFF IF P (IF Q 'T 'NIL) (IF Q 'NIL 'T)) (IMPLIES IF P (IF Q 'T 'NIL) 'T) (LISTP IF (CONSP X) 'T (EQUAL X 'NIL)) (MINUSP < X '0) (MV-LIST . X) (MV-NTH IF (CONSP L) (IF (ZP N) (CAR L) (MV-NTH (BINARY-+ '-1 N) (CDR L))) 'NIL) (NOT IF P 'NIL 'T) (NULL EQUAL X 'NIL) (PLUSP < '0 X) (RETURN-LAST . LAST-ARG) (SYNP QUOTE T) (THE-CHECK . Y) (WORMHOLE-EVAL QUOTE NIL) (ZEROP EQUAL X '0))))) (AND (OR (NOT PAIR) (CONSP PAIR) (EQUAL PAIR NIL)) PAIR))). [GC for 9127 CONS pages..(T=29).GC finished] But simplification reduces this to T, using the :definition MEMBER-EQUAL, the :executable-counterparts of ASSOC-EQUAL, CAR, CDR and CONSP and primitive type reasoning. Q.E.D. That completes the proof of the guard theorem for BBODY-FN. BBODY-FN is compliant with Common Lisp. Summary Form: ( DEFUN BBODY-FN ...) Rules: ((:DEFINITION MEMBER-EQUAL) (:DEFINITION NOT) (:EXECUTABLE-COUNTERPART ASSOC-EQUAL) (:EXECUTABLE-COUNTERPART CAR) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART IF) (:EXECUTABLE-COUNTERPART SYMBOL-LISTP) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:EXECUTABLE-COUNTERPART TRUE-LISTP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE ASSOC-EQ-EXEC-IS-ASSOC-EQUAL) (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL) (:TYPE-PRESCRIPTION ILLEGAL) (:TYPE-PRESCRIPTION MEMBER-EQ-EXEC$GUARD-CHECK)) Time: 0.57 seconds (prove: 0.30, print: 0.01, other: 0.26) Prover steps counted: 668 BBODY-FN The event ( DEFMACRO BBODY ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO BBODY ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since FILE-LENGTH$ is non-recursive, its admission is trivial. We observe that the type of FILE-LENGTH$ is described by the theorem (AND (CONSP (FILE-LENGTH$ FILE STATE)) (TRUE-LISTP (FILE-LENGTH$ FILE STATE))). We used primitive type reasoning. (FILE-LENGTH$ * STATE) => (MV * STATE). Computing the guard conjecture for FILE-LENGTH$.... The guard conjecture for FILE-LENGTH$ is trivial to prove, given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rule STATE-P. FILE-LENGTH$ is compliant with Common Lisp. [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=37).GC finished] 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.60 seconds (prove: 0.00, print: 0.00, other: 0.60) 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.01 seconds (prove: 0.00, print: 0.00, other: 0.01) :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.01 seconds (prove: 0.00, print: 0.00, other: 0.01) :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 9127 CONS pages..(T=28).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 9137 CONS pages..(T=29).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.99 seconds (prove: 0.61, print: 0.01, other: 0.37) Prover steps counted: 985 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. Summary Form: ( DEFUN READ-FILE-INTO-STRING2-LOGICAL ...) Rules: ((:TYPE-PRESCRIPTION STRINGP-SUBSEQ-TYPE-PRESCRIPTION)) Time: 0.44 seconds (prove: 0.00, print: 0.00, other: 0.44) 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.22 seconds (prove: 0.00, print: 0.00, other: 0.22) [GC for 9147 CONS pages..(T=29).GC finished] 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. [GC for 132 CFUN pages..(T=30).GC finished] Summary Form: ( DEFUN PRINT-CL-CACHE-FN ...) Rules: NIL Time: 0.40 seconds (prove: 0.00, print: 0.00, other: 0.40) 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.12 seconds (prove: 0.00, print: 0.00, other: 0.12) 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)))). 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)))). [GC for 9147 CONS pages..(T=29).GC finished] 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)))). This simplifies, using the :definitions ACL2-COUNT (if-intro), HONS-REMOVE-ASSOC and INTEGER-ABS (if-intro), the :executable-counterpart of ACL2-COUNT, primitive type reasoning and the :rewrite rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+, to the following two conjectures. Subgoal *1/3.2 (IMPLIES (AND (NOT (CONSP AL2)) (RATIONALP AL2) (NOT (INTEGERP AL2)) (< (NUMERATOR AL2) 0)) (< 0 (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (DENOMINATOR AL2) (- (NUMERATOR AL2))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/3.1 (IMPLIES (AND (NOT (CONSP AL2)) (RATIONALP AL2) (NOT (INTEGERP AL2)) (<= 0 (NUMERATOR AL2))) (< 0 (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (DENOMINATOR AL2) (NUMERATOR AL2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/2 (IMPLIES (AND (NOT (CONSP AL2)) (RATIONALP AL2) (INTEGERP AL2)) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2)) (+ 2 (ACL2-COUNT AL2) (ACL2-COUNT AL3) (ACL2-COUNT AL4)))). 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)))). [GC for 9147 CONS pages..(T=28).GC finished] 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))))). 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 [GC for 9147 CONS pages..(T=28).GC finished] 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.07 seconds (prove: 0.65, print: 0.31, other: 0.11) Prover steps counted: 5904 COUNT-KEYS Finished loading '((IN-PACKAGE "ACL2") (DEFCONST *COMMON-LISP-SYMBOLS-FROM-MAIN-LISP-PACKAGE* '(&ALLOW-OTHER-KEYS *PRINT-MISER-WIDTH* &AUX *PRINT-PPRINT-DISPATCH* &BODY *PRINT-PRETTY* &ENVIRONMENT ...)) (DEFCONST *COMMON-LISP-SPECIALS-AND-CONSTANTS* '(* ** *** *BREAK-ON-SIGNALS* *COMPILE-FILE-PATHNAME* *COMPILE-FILE-TRUENAME* *COMPILE-PRINT* ...)) (DEFCONST NIL 'NIL " NIL, a symbol, represents in Common Lisp both the false truth value and the empty list.") (DEFCONST T 'T "T, a symbol, represents the true truth value in Common Lisp.") (DEFCONST *STOBJ-INLINE-DECLARE* '(DECLARE #)) (DEFMACRO MAKE-PACKAGE-ENTRY (&KEY NAME IMPORTS HIDDEN-P BOOK-PATH DEFPKG-EVENT-FORM TTERM) (CONS 'LIST* (CONS NAME #))) ...). ACL2 loading '((IN-PACKAGE "ACL2") (DEFN CLEAR-MEMOIZE-TABLE (FN) FN) (DEFN CLEAR-MEMOIZE-TABLES NIL NIL) (DEFN MEMOIZE-SUMMARY NIL NIL) (DEFN CLEAR-MEMOIZE-STATISTICS NIL NIL) (DEFMACRO MEMSUM NIL '(MEMOIZE-SUMMARY)) (DEFCONST *HONS-PRIMITIVE-FNS* '(HONS-COPY HONS HONS-EQUAL HONS-EQUAL-LITE HONS-CLEAR HONS-CLEAR! HONS-WASH ...)) ...). "ACL2" CLEAR-MEMOIZE-TABLE CLEAR-MEMOIZE-TABLES MEMOIZE-SUMMARY CLEAR-MEMOIZE-STATISTICS :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=37).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 [GC for 603 SFUN pages..(T=29).GC finished] HONS-EQUAL-LITE HONS-CLEAR HONS-CLEAR! HONS-WASH HONS-WASH! [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=39).GC finished] HONS-SUMMARY :REDUNDANT HONS-RESIZE-FN :REDUNDANT :REDUNDANT GET-SLOW-ALIST-ACTION HONS-ACONS! MAKE-FAST-ALIST FAST-ALIST-FORK [GC for 603 SFUN pages..(T=33).GC finished] FAST-ALIST-FORK! :REDUNDANT :REDUNDANT MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE FAST-ALIST-CLEAN FAST-ALIST-CLEAN! FAST-ALIST-LEN [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=37).GC finished] FAST-ALIST-SUMMARY :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT CONS-SUBTREES NUMBER-SUBTREES FLUSH-HONS-GET-HASH-TABLE-LINK (:NUMBER-OF-ENABLED-RUNES 3042) 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 [GC for 603 SFUN pages..(T=30).GC finished] 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 9147 CONS pages..(T=29).GC finished] [GC for 9157 CONS pages..(T=30).GC finished] [GC for 9167 CONS pages..(T=29).GC finished] [GC for 9177 CONS pages..(T=30).GC finished] CONS-TERM1 CONS-TERM [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=37).GC finished] SYMBOL-CLASS PACKN1 [GC for 603 SFUN pages..(T=29).GC finished] T :REDUNDANT GUARD-OR-TERMINATION-THEOREM-MSG ALIST-KEYS-SUBSETP KEYWORD-LISTP [GC for 603 SFUN pages..(T=29).GC finished] PAIRLIS-X1 [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=37).GC finished] PAIRLIS-X2 FIRST-KEYWORD SYMBOL-NAME-LST T [GC for 613 SFUN pages..(T=30).GC finished] [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=39).GC finished] [GC for 9187 CONS pages..(T=30).GC finished] T :ATTACHMENTS-RECORDED T :ATTACHMENTS-RECORDED [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=37).GC finished] (PSEUDO-VARIANTP PSEUDO-VARIANTP-LIST) MEMBER-CHAR-STRINGP TERMINAL-SUBSTRINGP1 TERMINAL-SUBSTRINGP EVG-OCCUR MIN-FIXNUM [GC for 9197 CONS pages..(T=29).GC finished] [GC for 9207 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 18688 CONTIGUOUS-BLOCKS pages..(T=38).GC finished] (OCCUR OCCUR-LST) [GC for 9217 CONS pages..(T=29).GC finished] [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=37).GC finished] [GC for 1954 RELOCATABLE-BLOCKS pages..(T=29).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 9227 CONS pages..(T=29).GC finished] EARLIER-ANCESTOR-BIGGERP FN-COUNT-1 FN-COUNT-1-TYPE FN-COUNT-1 [GC for 9237 CONS pages..(T=29).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 9247 CONS pages..(T=30).GC finished] ANCESTORS-CHECK1 ANCESTORS-CHECK-BUILTIN MEMBER-EQUAL-MOD-COMMUTING STRIP-ANCESTOR-LITERALS [GC for 9257 CONS pages..(T=29).GC finished] T T :ATTACHMENTS-RECORDED :ATTACHMENTS-RECORDED :ATTACHMENTS-RECORDED HONS-COPY-WITH-STATE IDENTITY-WITH-STATE :ATTACHMENTS-RECORDED RW-CACHE-DEBUG-BUILTIN :ATTACHMENTS-RECORDED RW-CACHE-DEBUG-ACTION-BUILTIN :ATTACHMENTS-RECORDED [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=38).GC finished] RW-CACHEABLE-FAILURE-REASON-BUILTIN :ATTACHMENTS-RECORDED ALL-DIGITS-P D-POS-LISTP POS-LISTP :REDUNDANT D-POS-LISTP-FORWARD-TO-TRUE-LISTP CLAUSE-ID-P T PRINT-CLAUSE-ID-OKP-BUILTIN :ATTACHMENTS-RECORDED [GC for 9267 CONS pages..(T=30).GC finished] T :ATTACHMENTS-RECORDED 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 [GC for 9277 CONS pages..(T=30).GC finished] T STRICT-MERGE-SYMBOL-< T 24 32 57 *ACL2-PRIMITIVES* 32 [GC for 9287 CONS pages..(T=30).GC finished] (:NUMBER-OF-ENABLED-RUNES 3330) (:NUMBER-OF-ENABLED-RUNES 3329) FORMALS CONSTRAINT-INFO UNKNOWN-CONSTRAINTS-P [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=38).GC finished] (:DEFUND META-EXTRACT-FORMULA) TYPE-SET-QUOTE TYPE-SET-QUOTE TYPESPEC-CHECK [GC for 9297 CONS pages..(T=29).GC finished] META-EXTRACT-RW+-TERM META-EXTRACT-CONTEXTUAL-FACT [GC for 9307 CONS pages..(T=29).GC finished] REWRITE-RULE-TERM-EXEC REWRITE-RULE-TERM META-EXTRACT-GLOBAL-FACT FNCALL-TERM LOGICALLY-EQUIVALENT-STATES [GC for 9317 CONS pages..(T=29).GC finished] META-EXTRACT-GLOBAL-FACT+ MACRO-ALIASES-TABLE Finished loading '((IN-PACKAGE "ACL2") (VERIFY-TERMINATION-BOOT-STRAP QUOTE-LISTP) (VERIFY-TERMINATION-BOOT-STRAP CONS-TERM1) (VERIFY-TERMINATION-BOOT-STRAP CONS-TERM) (VERIFY-TERMINATION-BOOT-STRAP SYMBOL-CLASS) (VERIFY-TERMINATION-BOOT-STRAP PACKN1) (ENCAPSULATE NIL (LOCAL (DEFTHM CHARACTER-LISTP-EXPLODE-NONNEGATIVE-INTEGER # :RULE-CLASSES #)) (LOCAL (DEFTHM CHARACTER-LISTP-EXPLODE-ATOM # :RULE-CLASSES #)) (VERIFY-TERMINATION-BOOT-STRAP PACKN-POS) (VERIFY-TERMINATION-BOOT-STRAP FIND-FIRST-NON-CL-SYMBOL) (VERIFY-TERMINATION-BOOT-STRAP PACKN) ...) ...). ACL2 loading '((IN-PACKAGE "ACL2") (DEFUN FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1 (RUNES AVOID-FNS WRLD ANS) (DECLARE (XARGS :MODE :PROGRAM)) (COND (# ANS) (T #))) (DEFCONST *APPLY$-USERFN-CALLERS* '(APPLY$ EV$ APPLY$-USERFN)) (DEFCONST *BLACKLISTED-APPLY$-FNS* '(SYNP HIDE WORMHOLE1 WORMHOLE-EVAL SYS-CALL HONS-CLEAR! HONS-WASH! ...)) (DEFUN FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES (WORLD) (DECLARE (XARGS :MODE :PROGRAM)) (FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1 (FUNCTION-THEORY :HERE) *BLACKLISTED-APPLY$-FNS* WORLD NIL)) (WHEN-PASS-2 (MAKE-EVENT (CONS # #))) (DEFUN COMPUTE-BADGE-OF-PRIMITIVES (TERMS-AND-OUT-ARITIES) (DECLARE (XARGS :MODE :PROGRAM)) (COND (# NIL) (T #))) ...). "ACL2" :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT NIL :REDUNDANT [GC for 9327 CONS pages..(T=30).GC finished] [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=38).GC finished] NIL APPLY$-BADGEP N-CAR-CADR-CADDR-ETC :REDUNDANT [GC for 9337 CONS pages..(T=29).GC finished] (:NUMBER-OF-ENABLED-RUNES 3369) [GC for 9347 CONS pages..(T=29).GC finished] [GC for 9357 CONS pages..(T=30).GC finished] [GC for 9367 CONS pages..(T=30).GC finished] [GC for 9377 CONS pages..(T=29).GC finished] [GC for 9387 CONS pages..(T=29).GC finished] [GC for 9397 CONS pages..(T=30).GC finished] [GC for 9407 CONS pages..(T=30).GC finished] [GC for 9417 CONS pages..(T=29).GC finished] [GC for 9427 CONS pages..(T=30).GC finished] [GC for 9437 CONS pages..(T=30).GC finished] [GC for 9447 CONS pages..(T=31).GC finished] [GC for 9457 CONS pages..(T=30).GC finished] [GC for 9467 CONS pages..(T=29).GC finished] [GC for 9477 CONS pages..(T=30).GC finished] [GC for 9487 CONS pages..(T=29).GC finished] [GC for 9497 CONS pages..(T=29).GC finished] [GC for 9507 CONS pages..(T=30).GC finished] [GC for 9517 CONS pages..(T=30).GC finished] [GC for 9527 CONS pages..(T=30).GC finished] [GC for 9537 CONS pages..(T=29).GC finished] [GC for 9547 CONS pages..(T=30).GC finished] [GC for 9557 CONS pages..(T=29).GC finished] [GC for 9567 CONS pages..(T=30).GC finished] [GC for 9577 CONS pages..(T=30).GC finished] [GC for 9587 CONS pages..(T=30).GC finished] [GC for 9597 CONS pages..(T=30).GC finished] [GC for 9607 CONS pages..(T=30).GC finished] [GC for 9607 CONS pages..(T=29).GC finished] [GC for 9607 CONS pages..(T=30).GC finished] [GC for 9607 CONS pages..(T=30).GC finished] [GC for 9617 CONS pages..(T=29).GC finished] [GC for 9617 CONS pages..(T=30).GC finished] [GC for 9617 CONS pages..(T=29).GC finished] [GC for 9617 CONS pages..(T=29).GC finished] [GC for 9617 CONS pages..(T=30).GC finished] [GC for 9617 CONS pages..(T=29).GC finished] [GC for 9617 CONS pages..(T=29).GC finished] [GC for 9627 CONS pages..(T=29).GC finished] [GC for 9627 CONS pages..(T=30).GC finished] [GC for 9627 CONS pages..(T=30).GC finished] [GC for 9627 CONS pages..(T=29).GC finished] [GC for 9627 CONS pages..(T=30).GC finished] [GC for 9627 CONS pages..(T=30).GC finished] [GC for 9637 CONS pages..(T=29).GC finished] [GC for 9637 CONS pages..(T=30).GC finished] [GC for 9637 CONS pages..(T=29).GC finished] [GC for 9647 CONS pages..(T=30).GC finished] [GC for 9657 CONS pages..(T=30).GC finished] [GC for 9667 CONS pages..(T=30).GC finished] [GC for 9677 CONS pages..(T=30).GC finished] [GC for 9687 CONS pages..(T=31).GC finished] [GC for 9697 CONS pages..(T=30).GC finished] [GC for 9707 CONS pages..(T=31).GC finished] [GC for 9717 CONS pages..(T=31).GC finished] [GC for 9727 CONS pages..(T=31).GC finished] [GC for 9737 CONS pages..(T=31).GC finished] [GC for 9747 CONS pages..(T=32).GC finished] [GC for 9757 CONS pages..(T=31).GC finished] [GC for 9767 CONS pages..(T=32).GC finished] [GC for 9777 CONS pages..(T=31).GC finished] [GC for 9787 CONS pages..(T=30).GC finished] [GC for 9797 CONS pages..(T=31).GC finished] [GC for 9807 CONS pages..(T=31).GC finished] [GC for 9817 CONS pages..(T=31).GC finished] [GC for 9827 CONS pages..(T=31).GC finished] [GC for 9837 CONS pages..(T=31).GC finished] [GC for 9847 CONS pages..(T=31).GC finished] [GC for 9857 CONS pages..(T=34).GC finished] [GC for 9867 CONS pages..(T=33).GC finished] [GC for 9877 CONS pages..(T=32).GC finished] [GC for 9887 CONS pages..(T=32).GC finished] [GC for 9897 CONS pages..(T=33).GC finished] [GC for 9907 CONS pages..(T=33).GC finished] [GC for 9917 CONS pages..(T=34).GC finished] [GC for 9927 CONS pages..(T=32).GC finished] [GC for 9937 CONS pages..(T=31).GC finished] [GC for 9947 CONS pages..(T=30).GC finished] [GC for 9957 CONS pages..(T=31).GC finished] [GC for 9967 CONS pages..(T=31).GC finished] [GC for 9977 CONS pages..(T=31).GC finished] [GC for 9987 CONS pages..(T=31).GC finished] [GC for 9997 CONS pages..(T=30).GC finished] [GC for 10007 CONS pages..(T=31).GC finished] [GC for 10017 CONS pages..(T=30).GC finished] [GC for 10027 CONS pages..(T=31).GC finished] [GC for 10037 CONS pages..(T=31).GC finished] [GC for 10047 CONS pages..(T=31).GC finished] [GC for 10057 CONS pages..(T=31).GC finished] [GC for 10067 CONS pages..(T=31).GC finished] [GC for 10077 CONS pages..(T=31).GC finished] [GC for 10087 CONS pages..(T=30).GC finished] [GC for 10097 CONS pages..(T=30).GC finished] [GC for 10107 CONS pages..(T=30).GC finished] [GC for 10117 CONS pages..(T=32).GC finished] [GC for 10127 CONS pages..(T=31).GC finished] [GC for 10137 CONS pages..(T=31).GC finished] [GC for 10147 CONS pages..(T=31).GC finished] [GC for 10157 CONS pages..(T=30).GC finished] [GC for 10167 CONS pages..(T=31).GC finished] [GC for 10177 CONS pages..(T=31).GC finished] [GC for 10187 CONS pages..(T=30).GC finished] [GC for 10197 CONS pages..(T=31).GC finished] [GC for 10207 CONS pages..(T=31).GC finished] [GC for 10217 CONS pages..(T=31).GC finished] [GC for 10227 CONS pages..(T=32).GC finished] [GC for 10237 CONS pages..(T=30).GC finished] [GC for 10247 CONS pages..(T=30).GC finished] [GC for 10257 CONS pages..(T=30).GC finished] [GC for 10267 CONS pages..(T=31).GC finished] [GC for 10277 CONS pages..(T=31).GC finished] [GC for 10287 CONS pages..(T=32).GC finished] [GC for 10297 CONS pages..(T=31).GC finished] [GC for 10307 CONS pages..(T=31).GC finished] [GC for 10317 CONS pages..(T=32).GC finished] [GC for 10327 CONS pages..(T=32).GC finished] [GC for 10337 CONS pages..(T=32).GC finished] [GC for 10347 CONS pages..(T=32).GC finished] [GC for 10357 CONS pages..(T=31).GC finished] [GC for 10367 CONS pages..(T=31).GC finished] [GC for 10377 CONS pages..(T=32).GC finished] [GC for 10387 CONS pages..(T=32).GC finished] [GC for 10397 CONS pages..(T=32).GC finished] [GC for 10407 CONS pages..(T=32).GC finished] [GC for 10417 CONS pages..(T=31).GC finished] [GC for 10427 CONS pages..(T=31).GC finished] [GC for 10437 CONS pages..(T=32).GC finished] [GC for 10447 CONS pages..(T=31).GC finished] [GC for 10457 CONS pages..(T=31).GC finished] [GC for 10467 CONS pages..(T=31).GC finished] [GC for 10477 CONS pages..(T=30).GC finished] [GC for 10487 CONS pages..(T=30).GC finished] [GC for 10497 CONS pages..(T=31).GC finished] [GC for 10507 CONS pages..(T=32).GC finished] [GC for 10517 CONS pages..(T=32).GC finished] [GC for 10527 CONS pages..(T=32).GC finished] [GC for 10537 CONS pages..(T=32).GC finished] [GC for 10547 CONS pages..(T=31).GC finished] [GC for 10557 CONS pages..(T=31).GC finished] [GC for 10567 CONS pages..(T=32).GC finished] [GC for 10577 CONS pages..(T=32).GC finished] [GC for 10587 CONS pages..(T=31).GC finished] [GC for 10597 CONS pages..(T=31).GC finished] [GC for 10607 CONS pages..(T=31).GC finished] [GC for 10617 CONS pages..(T=32).GC finished] [GC for 10627 CONS pages..(T=32).GC finished] [GC for 10637 CONS pages..(T=31).GC finished] [GC for 10647 CONS pages..(T=32).GC finished] [GC for 10657 CONS pages..(T=32).GC finished] [GC for 10667 CONS pages..(T=32).GC finished] [GC for 10677 CONS pages..(T=32).GC finished] [GC for 10687 CONS pages..(T=33).GC finished] [GC for 10697 CONS pages..(T=32).GC finished] [GC for 10707 CONS pages..(T=32).GC finished] [GC for 10717 CONS pages..(T=32).GC finished] [GC for 10727 CONS pages..(T=32).GC finished] [GC for 10737 CONS pages..(T=31).GC finished] [GC for 10747 CONS pages..(T=31).GC finished] [GC for 10757 CONS pages..(T=32).GC finished] [GC for 10767 CONS pages..(T=32).GC finished] [GC for 10777 CONS pages..(T=32).GC finished] [GC for 10787 CONS pages..(T=31).GC finished] [GC for 10797 CONS pages..(T=31).GC finished] [GC for 10807 CONS pages..(T=31).GC finished] [GC for 10817 CONS pages..(T=31).GC finished] [GC for 10827 CONS pages..(T=31).GC finished] [GC for 10837 CONS pages..(T=31).GC finished] [GC for 10847 CONS pages..(T=31).GC finished] [GC for 10857 CONS pages..(T=30).GC finished] [GC for 10857 CONS pages..(T=30).GC finished] [GC for 10857 CONS pages..(T=30).GC finished] [GC for 10857 CONS pages..(T=31).GC finished] [GC for 10857 CONS pages..(T=32).GC finished] [GC for 10857 CONS pages..(T=32).GC finished] [GC for 10857 CONS pages..(T=32).GC finished] [GC for 10857 CONS pages..(T=32).GC finished] [GC for 10867 CONS pages..(T=32).GC finished] [GC for 10877 CONS pages..(T=32).GC finished] [GC for 10887 CONS pages..(T=32).GC finished] [GC for 10897 CONS pages..(T=33).GC finished] NIL Finished loading '((IN-PACKAGE "ACL2") (DEFUN FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1 (RUNES AVOID-FNS WRLD ANS) (DECLARE (XARGS :MODE :PROGRAM)) (COND (# ANS) (T #))) (DEFCONST *APPLY$-USERFN-CALLERS* '(APPLY$ EV$ APPLY$-USERFN)) (DEFCONST *BLACKLISTED-APPLY$-FNS* '(SYNP HIDE WORMHOLE1 WORMHOLE-EVAL SYS-CALL HONS-CLEAR! HONS-WASH! ...)) (DEFUN FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES (WORLD) (DECLARE (XARGS :MODE :PROGRAM)) (FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1 (FUNCTION-THEORY :HERE) *BLACKLISTED-APPLY$-FNS* WORLD NIL)) (WHEN-PASS-2 (MAKE-EVENT (CONS # #))) (DEFUN COMPUTE-BADGE-OF-PRIMITIVES (TERMS-AND-OUT-ARITIES) (DECLARE (XARGS :MODE :PROGRAM)) (COND (# NIL) (T #))) ...). ACL2 loading '((IN-PACKAGE "ACL2") (WHEN-PASS-2 (ENCAPSULATE (#) (LOCAL #) (DEFTHM BADGE-USERFN-TYPE # :RULE-CLASSES #)) (ENCAPSULATE (#) (LOCAL #) (DEFTHM APPLY$-USERFN-TAKES-ARITY-ARGS # :RULE-CLASSES NIL)) (ENCAPSULATE (#) (LOCAL #) (DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS # :RULE-CLASSES #)) (DEFSTUB UNTAME-EV$ (X A) T) (DEFCONST *APPLY$-BOOT-FNS-BADGE-ALIST* (CONS # #)))). "ACL2" 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 10907 CONS pages..(T=31).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 613 SFUN pages..(T=31).GC finished] [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=40).GC finished] NIL Finished loading '((IN-PACKAGE "ACL2") (WHEN-PASS-2 (ENCAPSULATE (#) (LOCAL #) (DEFTHM BADGE-USERFN-TYPE # :RULE-CLASSES #)) (ENCAPSULATE (#) (LOCAL #) (DEFTHM APPLY$-USERFN-TAKES-ARITY-ARGS # :RULE-CLASSES NIL)) (ENCAPSULATE (#) (LOCAL #) (DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS # :RULE-CLASSES #)) (DEFSTUB UNTAME-EV$ (X A) T) (DEFCONST *APPLY$-BOOT-FNS-BADGE-ALIST* (CONS # #)))). ACL2 loading '((IN-PACKAGE "ACL2") (WHEN-PASS-2 (DEFUN BADGE (FN) (DECLARE #) (COND # # # # # # ...)) (IN-THEORY (DISABLE APPLY$-PRIMP BADGE-PRIM)) (IN-THEORY (DISABLE BADGE)) (DEFABBREV TAMEP-LAMBDAP (FN) (AND # # #)) (MUTUAL-RECURSION (DEFUN TAMEP # # #) (DEFUN TAMEP-FUNCTIONP # # #) (DEFUN SUITABLY-TAMEP-LISTP # # #)) (MUTUAL-RECURSION (DEFUN APPLY$ # # #) (DEFUN APPLY$-LAMBDA # # #) (DEFUN EV$ # # #) (DEFUN EV$-LIST # # #)) ...)). "ACL2" [GC for 613 SFUN pages..(T=31).GC finished] [GC for 613 SFUN pages..(T=31).GC finished] [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=39).GC finished] [GC for 613 SFUN pages..(T=31).GC finished] [GC for 613 SFUN pages..(T=31).GC finished] [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=40).GC finished] [GC for 613 SFUN pages..(T=31).GC finished] [GC for 1954 RELOCATABLE-BLOCKS pages..(T=31).GC finished] [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=40).GC finished] [GC for 613 SFUN pages..(T=31).GC finished] [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=39).GC finished] [GC for 613 SFUN pages..(T=31).GC finished] [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=39).GC finished] [GC for 613 SFUN pages..(T=30).GC finished] [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=40).GC finished] [GC for 613 SFUN pages..(T=30).GC finished] NIL Finished loading '((IN-PACKAGE "ACL2") (WHEN-PASS-2 (DEFUN BADGE (FN) (DECLARE #) (COND # # # # # # ...)) (IN-THEORY (DISABLE APPLY$-PRIMP BADGE-PRIM)) (IN-THEORY (DISABLE BADGE)) (DEFABBREV TAMEP-LAMBDAP (FN) (AND # # #)) (MUTUAL-RECURSION (DEFUN TAMEP # # #) (DEFUN TAMEP-FUNCTIONP # # #) (DEFUN SUITABLY-TAMEP-LISTP # # #)) (MUTUAL-RECURSION (DEFUN APPLY$ # # #) (DEFUN APPLY$-LAMBDA # # #) (DEFUN EV$ # # #) (DEFUN EV$-LIST # # #)) ...)). ACL2 loading '((IN-PACKAGE "ACL2") (VERIFY-TERMINATION-BOOT-STRAP SAFE-ACCESS-COMMAND-TUPLE-FORM) (VERIFY-TERMINATION-BOOT-STRAP ACL2-SYSTEM-NAMEP) (MUTUAL-RECURSION (DEFUN SYSTEM-PSEUDO-TERMP (X W) (DECLARE #) (COND # # # # #)) (DEFUN SYSTEM-PSEUDO-TERM-LISTP (LST W) (DECLARE #) (COND # #))) (DEFUN PAIR-FNS-WITH-MEASURED-SUBSETS (FNS WRLD ACC) (DECLARE (XARGS :GUARD #)) (COND (# #) (T #))) (DEFUN NEW-VERIFY-GUARDS-FNS1 (WRLD INSTALLED-WRLD ACC) (DECLARE (XARGS :GUARD #)) (COND (# #) (# #) (T #))) (DEFUN NEW-VERIFY-GUARDS-FNS (STATE) (DECLARE (XARGS :STOBJS STATE)) (LET (#) (NEW-VERIFY-GUARDS-FNS1 WRLD WRLD NIL))) ...). "ACL2" [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=40).GC finished] SAFE-ACCESS-COMMAND-TUPLE-FORM ACL2-SYSTEM-NAMEP (SYSTEM-PSEUDO-TERMP SYSTEM-PSEUDO-TERM-LISTP) PAIR-FNS-WITH-MEASURED-SUBSETS [GC for 613 SFUN pages..(T=30).GC finished] NEW-VERIFY-GUARDS-FNS1 NEW-VERIFY-GUARDS-FNS :REDUNDANT *SYSTEM-VERIFY-GUARDS-ALIST* *LEN-SYSTEM-VERIFY-GUARDS-ALIST* CHK-NEW-VERIFIED-GUARDS SYSTEM-VERIFY-GUARDS-AUX CONS-ABSOLUTE-EVENT-NUMBERS [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=40).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 (LEGAL-CONSTANTP1) (LEGAL-CONSTANTP1))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LEGAL-CONSTANTP1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LAMBDA-KEYWORDP) (LAMBDA-KEYWORDP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LAMBDA-KEYWORDP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LEGAL-VARIABLE-OR-CONSTANT-NAMEP) (LEGAL-VARIABLE-OR-CONSTANT-NAMEP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LEGAL-VARIABLE-OR-CONSTANT-NAMEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LEGAL-VARIABLEP) (LEGAL-VARIABLEP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LEGAL-VARIABLEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ARGLISTP1 (DECLARE (XARGS :MEASURE #))) (ARGLISTP1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ARGLISTP1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ARGLISTP) (ARGLISTP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ARGLISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FIND-FIRST-BAD-ARG (DECLARE (XARGS :MEASURE #))) (FIND-FIRST-BAD-ARG (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FIND-FIRST-BAD-ARG)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (NEWLINE))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 613 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 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. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS WRITE-FOR-READ)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ILLEGAL-FMT-STRING))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ILLEGAL-FMT-STRING)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SCAN-PAST-WHITESPACE (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SCAN-PAST-WHITESPACE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ZERO-ONE-OR-MORE))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ZERO-ONE-OR-MORE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FIND-ALTERNATIVE-SKIP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FIND-ALTERNATIVE-SKIP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FIND-ALTERNATIVE-START1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 613 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 FIND-ALTERNATIVE-START1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMT-CHAR))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FMT-CHAR)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FIND-ALTERNATIVE-START))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 18944 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 FIND-ALTERNATIVE-START)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FIND-ALTERNATIVE-STOP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FIND-ALTERNATIVE-STOP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMT-VAR))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FMT-VAR)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STANDARD-EVISC-TUPLEP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS STANDARD-EVISC-TUPLEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WORLD-EVISCERATION-ALIST))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS WORLD-EVISCERATION-ALIST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ABBREV-EVISC-TUPLE))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ABBREV-EVISC-TUPLE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MSGP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 613 SFUN 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 MSGP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMX-CW-MSG-1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) 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 613 SFUN 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. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS WARNING-OFF-P1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (OBSERVATION1-CW))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 18944 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 OBSERVATION1-CW)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STOBJP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS STOBJP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (EQUAL-X-CONSTANT))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS EQUAL-X-CONSTANT)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MATCH-TESTS-AND-BINDINGS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MATCH-TESTS-AND-BINDINGS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MATCH-CLAUSE))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MATCH-CLAUSE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MATCH-CLAUSE-LIST (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MATCH-CLAUSE-LIST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FIND-DOT-DOT (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FIND-DOT-DOT)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LEGAL-CONSTANTP) (LEGAL-CONSTANTP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 1954 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 LEGAL-CONSTANTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (COLLECT-NON-X (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS COLLECT-NON-X)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DOUBLET-LISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS DOUBLET-LISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (PLIST-WORLDP-WITH-FORMALS (DECLARE (XARGS :MEASURE #))) (PLIST-WORLDP-WITH-FORMALS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS PLIST-WORLDP-WITH-FORMALS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ARITY) (ARITY))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ARITY)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DEFUN-MODE))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS DEFUN-MODE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ARITIES-OKP (DECLARE (XARGS :MEASURE #))) (ARITIES-OKP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ARITIES-OKP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LATEST-BODY))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LATEST-BODY)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DEF-BODY))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 613 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 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.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ALL->=-LEN)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STRIP-CADRS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS STRIP-CADRS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CONS-TERM1-MV2))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS CONS-TERM1-MV2)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBLIS-VAR1-LST (DECLARE (XARGS :MEASURE #))) (SUBLIS-VAR1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 613 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 SUBLIS-VAR1-LST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBLIS-VAR))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUBLIS-VAR)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBLIS-VAR-LST))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUBLIS-VAR-LST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBCOR-VAR1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUBCOR-VAR1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBCOR-VAR (DECLARE (XARGS :MEASURE #))) (SUBCOR-VAR-LST (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUBCOR-VAR)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DUMB-NEGATE-LIT))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 19200 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 DUMB-NEGATE-LIT)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TERMP (DECLARE (XARGS :MEASURE #))) (TERM-LISTP (DECLARE (XARGS :MEASURE #))) (TERM-LISTP (DECLARE (XARGS :MEASURE #))) (TERMP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS TERMP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TERM-LIST-LISTP (DECLARE (XARGS :MEASURE #))) (TERM-LIST-LISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS TERM-LIST-LISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGS))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ACCESS-COMMAND-TUPLE-NUMBER))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ACCESS-COMMAND-TUPLE-NUMBER)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBST-VAR (DECLARE (XARGS :MEASURE #))) (SUBST-VAR-LST (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 613 SFUN 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 SUBST-VAR)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ALL-FNNAMES1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ALL-FNNAMES1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (REMOVE-GUARD-HOLDERS1 (DECLARE (XARGS :MEASURE #))) (REMOVE-GUARD-HOLDERS1-LST (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS REMOVE-GUARD-HOLDERS1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (REMOVE-GUARD-HOLDERS-WEAK))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS REMOVE-GUARD-HOLDERS-WEAK)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SILENT-ERROR))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SILENT-ERROR)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ER-CMP-FN))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ER-CMP-FN)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WARNING1-CW))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 613 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 WARNING1-CW)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CHK-LENGTH-AND-KEYS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS CHK-LENGTH-AND-KEYS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DUPLICATE-KEYS-ACTION))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS DUPLICATE-KEYS-ACTION)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LEGAL-INITP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LEGAL-INITP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGLIST-KEYSP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGLIST-KEYSP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGLIST-AFTER-RESTP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGLIST-AFTER-RESTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGLIST-OPTIONALP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 613 SFUN 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-ARGLIST-OPTIONALP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGLIST1P (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGLIST1P)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBSEQUENCEP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUBSEQUENCEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (COLLECT-LAMBDA-KEYWORDPS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS COLLECT-LAMBDA-KEYWORDPS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGS-STRUCTUREP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGS-STRUCTUREP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FFNNAMEP (DECLARE (XARGS :MEASURE #))) (FFNNAMEP-LST (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 19200 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 FFNNAMEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FORMALIZED-VARLISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FORMALIZED-VARLISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (THROW-NONEXEC-ERROR-P1))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS THROW-NONEXEC-ERROR-P1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (THROW-NONEXEC-ERROR-P))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS THROW-NONEXEC-ERROR-P)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DEREF-MACRO-NAME))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS DEREF-MACRO-NAME)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WEAK-APPLY$-BADGE-ALISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS WEAK-APPLY$-BADGE-ALISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ILKS-PLIST-WORLDP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ILKS-PLIST-WORLDP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ILKS-PER-ARGUMENT-SLOT))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 613 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 ILKS-PER-ARGUMENT-SLOT)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGIC-FNSP (DECLARE (XARGS :MEASURE #))) (LOGIC-FNS-LISTP (DECLARE (XARGS :MEASURE #))) (LOGIC-FNSP (DECLARE (XARGS :MEASURE #))) (LOGIC-FNS-LISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LOGIC-FNSP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGIC-TERMP) (LOGIC-TERMP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LOGIC-TERMP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGIC-TERM-LISTP) (LOGIC-TERM-LISTP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LOGIC-TERM-LISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGIC-FNS-LIST-LISTP (DECLARE (XARGS :MEASURE #))) (LOGIC-FNS-LIST-LISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LOGIC-FNS-LIST-LISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGIC-TERM-LIST-LISTP) (LOGIC-TERM-LIST-LISTP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LOGIC-TERM-LIST-LISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TERM-ORDER1))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 613 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 TERM-ORDER1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (RUNEP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS RUNEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FNUME))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FNUME)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TRANSLATE-ABBREV-RUNE))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS TRANSLATE-ABBREV-RUNE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ENABLED-STRUCTURE-P))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ENABLED-STRUCTURE-P)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ENABLED-NUMEP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ENABLED-NUMEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ENABLED-RUNEP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ENABLED-RUNEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TERM-ORDER))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 613 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 TERM-ORDER)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ENS))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ENS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (IMPLICATE))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS IMPLICATE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBST-EXPR1 (DECLARE (XARGS :MEASURE #))) (SUBST-EXPR1-LST (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 19200 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 SUBST-EXPR1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBST-EXPR-ERROR))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUBST-EXPR-ERROR)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBST-EXPR))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUBST-EXPR)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CLEAN-BRR-STACK1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS CLEAN-BRR-STACK1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CLEAN-BRR-STACK))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS CLEAN-BRR-STACK)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MERGE-TERM-ORDER (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MERGE-TERM-ORDER)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MERGE-SORT-TERM-ORDER (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MERGE-SORT-TERM-ORDER)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (COLLECT-BY-POSITION (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 613 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-BY-POSITION)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MAKE-LAMBDA-APPLICATION))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MAKE-LAMBDA-APPLICATION)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LAMBDA-SUBTERMP (DECLARE (XARGS :MEASURE #))) (LAMBDA-SUBTERMP-LST (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LAMBDA-SUBTERMP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TERMIFY-CLAUSE-SET (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS TERMIFY-CLAUSE-SET)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGICAL-NAMEP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LOGICAL-NAMEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ALIST-TO-DOUBLETS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ALIST-TO-DOUBLETS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STRING-PREFIXP-1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 613 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 STRING-PREFIXP-1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STRING-PREFIXP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS STRING-PREFIXP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (RELATIVIZE-BOOK-PATH))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS RELATIVIZE-BOOK-PATH)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MERGE-SYMBOL-< (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MERGE-SYMBOL-<)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MERGE-SORT-SYMBOL-< (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MERGE-SORT-SYMBOL-<)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (OVERRIDE-HINTS))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS OVERRIDE-HINTS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SCAN-TO-CLTL-COMMAND (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SCAN-TO-CLTL-COMMAND)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (PLAUSIBLE-DCLSP1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 613 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 PLAUSIBLE-DCLSP1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (PLAUSIBLE-DCLSP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS PLAUSIBLE-DCLSP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STRIP-KEYWORD-LIST (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS STRIP-KEYWORD-LIST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STRIP-DCLS1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 19200 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 STRIP-DCLS1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STRIP-DCLS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS STRIP-DCLS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FETCH-DCL-FIELDS2 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FETCH-DCL-FIELDS2)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FETCH-DCL-FIELDS1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FETCH-DCL-FIELDS1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FETCH-DCL-FIELDS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FETCH-DCL-FIELDS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FETCH-DCL-FIELD))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FETCH-DCL-FIELD)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (REMOVE-LAMBDAS1 (DECLARE (XARGS :MEASURE #))) (REMOVE-LAMBDAS-LST (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 613 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 REMOVE-LAMBDAS1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (REMOVE-LAMBDAS))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS REMOVE-LAMBDAS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (BACKCHAIN-LIMIT-LISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS BACKCHAIN-LIMIT-LISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ARITY-ALISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ARITY-ALISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DISABLEDP-FN-LST (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS DISABLEDP-FN-LST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DISABLEDP-FN))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 764 SYMBOL 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 DISABLEDP-FN)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-VARS-KEY (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-VARS-KEY)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-VARS-AFTER-REST))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-VARS-AFTER-REST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-VARS-OPTIONAL (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-VARS-OPTIONAL)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-VARS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-VARS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SYSFILE-P))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SYSFILE-P)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SYSFILE-OR-STRING-LISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SYSFILE-OR-STRING-LISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TTAG-ALISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 613 SFUN 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 TTAG-ALISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CERT-ANNOTATIONSP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS CERT-ANNOTATIONSP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ADD-SUFFIX-TO-FN))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ADD-SUFFIX-TO-FN)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FSUBCOR-VAR-LST (DECLARE (XARGS :MEASURE #))) (FSUBCOR-VAR (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FSUBCOR-VAR-LST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (META-EXTRACT-RW+-TERM))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 19200 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 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. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS META-EXTRACT-GLOBAL-FACT+)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TAMEP (DECLARE (XARGS :MEASURE #))) (SUITABLY-TAMEP-LISTP (DECLARE (XARGS :MEASURE #))) (TAMEP-FUNCTIONP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS TAMEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (EV$-LIST (DECLARE (XARGS :MEASURE #))) (APPLY$ (DECLARE (XARGS :MEASURE #))) (EV$ (DECLARE (XARGS :MEASURE #))) (APPLY$-LAMBDA (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 613 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 EV$-LIST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TAILS-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS TAILS-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TAILS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) 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.) [GC for 1954 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 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.) 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.) [GC for 613 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 FROM-TO-BY)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (UNTIL$-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS UNTIL$-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (UNTIL$ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS UNTIL$)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (UNTIL$+-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS UNTIL$+-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (UNTIL$+ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS UNTIL$+)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WHEN$-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 19200 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 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.) 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.) [GC for 613 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 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.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS COLLECT$-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (COLLECT$ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 613 SFUN 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 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 (REVAPPEND-TRUE-LIST-FIX (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS REVAPPEND-TRUE-LIST-FIX)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (APPEND$-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS APPEND$-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (APPEND$ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS APPEND$)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (APPEND$+-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS APPEND$+-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (APPEND$+ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 613 SFUN 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 APPEND$+)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. T SYSTEM-EVENT [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=40).GC finished] SYSTEM-EVENTS-FN SYSTEM-EVENTS SYSTEM-INCLUDE-BOOK-FORMS CHECK-SYSTEM-EVENTS (:NUMBER-OF-ENABLED-RUNES 4148) (:NUMBER-OF-ENABLED-RUNES 4138) T [GC for 613 SFUN pages..(T=32).GC finished] FN-EQUAL FN-EQUAL-IS-AN-EQUIVALENCE NATP-FROM-TO-BY-MEASURE MEMPOS [GC for 613 SFUN pages..(T=33).GC finished] [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=43).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=41).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=41).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 1954 RELOCATABLE-BLOCKS pages..(T=32).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=43).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=41).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=31).GC finished] [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=43).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=41).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 1954 RELOCATABLE-BLOCKS pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=41).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 774 SYMBOL pages..(T=31).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 613 SFUN pages..(T=31).GC finished] [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=41).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=41).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 1954 RELOCATABLE-BLOCKS pages..(T=32).GC finished] [GC for 613 SFUN pages..(T=34).GC finished] [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 142 CFUN pages..(T=33).GC finished] [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=43).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 613 SFUN pages..(T=33).GC finished] [GC for 613 SFUN pages..(T=32).GC finished] NIL :SKIPPED 4246 END-OF-PASS-2 Finished loading '((IN-PACKAGE "ACL2") (VERIFY-TERMINATION-BOOT-STRAP SAFE-ACCESS-COMMAND-TUPLE-FORM) (VERIFY-TERMINATION-BOOT-STRAP ACL2-SYSTEM-NAMEP) (MUTUAL-RECURSION (DEFUN SYSTEM-PSEUDO-TERMP (X W) (DECLARE #) (COND # # # # #)) (DEFUN SYSTEM-PSEUDO-TERM-LISTP (LST W) (DECLARE #) (COND # #))) (DEFUN PAIR-FNS-WITH-MEASURED-SUBSETS (FNS WRLD ACC) (DECLARE (XARGS :GUARD #)) (COND (# #) (T #))) (DEFUN NEW-VERIFY-GUARDS-FNS1 (WRLD INSTALLED-WRLD ACC) (DECLARE (XARGS :GUARD #)) (COND (# #) (# #) (T #))) (DEFUN NEW-VERIFY-GUARDS-FNS (STATE) (DECLARE (XARGS :STOBJS STATE)) (LET (#) (NEW-VERIFY-GUARDS-FNS1 WRLD WRLD NIL))) ...). ACL2 loading '((COMP-FN :EXEC NIL "1" STATE)). [GC for 1954 RELOCATABLE-BLOCKS pages..(T=32).GC finished] [GC for 10907 CONS pages..(T=32).GC finished] [GC for 1954 RELOCATABLE-BLOCKS pages..(T=32).GC finished] [GC for 784 SYMBOL pages..(T=34).GC finished] [GC for 1954 RELOCATABLE-BLOCKS pages..(T=33).GC finished] [GC for 257 ARRAY pages..(T=33).GC finished] [GC for 257 ARRAY pages..(T=32).GC finished] [GC for 257 ARRAY pages..(T=33).GC finished] [GC for 267 ARRAY pages..(T=34).GC finished] [GC for 277 ARRAY pages..(T=34).GC finished] [GC for 287 ARRAY pages..(T=34).GC finished] [GC for 297 ARRAY pages..(T=34).GC finished] [GC for 307 ARRAY pages..(T=34).GC finished] [GC for 317 ARRAY pages..(T=34).GC finished] [GC for 327 ARRAY pages..(T=34).GC finished] [GC for 84 STRUCTURE pages..(T=34).GC finished] [GC for 337 ARRAY pages..(T=34).GC finished] [GC for 347 ARRAY pages..(T=34).GC finished] [GC for 357 ARRAY pages..(T=34).GC finished] [GC for 367 ARRAY pages..(T=34).GC finished] [GC for 377 ARRAY pages..(T=35).GC finished] [GC for 387 ARRAY pages..(T=35).GC finished] [GC for 397 ARRAY pages..(T=36).GC finished] [GC for 407 ARRAY pages..(T=35).GC finished] [GC for 417 ARRAY pages..(T=36).GC finished] [GC for 427 ARRAY pages..(T=35).GC finished] [GC for 437 ARRAY pages..(T=35).GC finished] [GC for 447 ARRAY pages..(T=35).GC finished] [GC for 457 ARRAY pages..(T=34).GC finished] [GC for 467 ARRAY pages..(T=34).GC finished] [GC for 477 ARRAY pages..(T=34).GC finished] [GC for 487 ARRAY pages..(T=34).GC finished] [GC for 497 ARRAY pages..(T=35).GC finished] [GC for 126 STRUCTURE pages..(T=34).GC finished] [GC for 507 ARRAY pages..(T=36).GC finished] [GC for 517 ARRAY pages..(T=35).GC finished] [GC for 527 ARRAY pages..(T=35).GC finished] [GC for 537 ARRAY pages..(T=35).GC finished] [GC for 1954 RELOCATABLE-BLOCKS pages..(T=36).GC finished] [GC for 547 ARRAY pages..(T=36).GC finished] [GC for 557 ARRAY pages..(T=35).GC finished] [GC for 567 ARRAY pages..(T=35).GC finished] [GC for 577 ARRAY pages..(T=35).GC finished] [GC for 587 ARRAY pages..(T=36).GC finished] [GC for 597 ARRAY pages..(T=36).GC finished] [GC for 607 ARRAY pages..(T=36).GC finished] [GC for 617 ARRAY pages..(T=36).GC finished] [GC for 627 ARRAY pages..(T=36).GC finished] [GC for 637 ARRAY pages..(T=36).GC finished] [GC for 647 ARRAY pages..(T=36).GC finished] [GC for 657 ARRAY pages..(T=36).GC finished] [GC for 667 ARRAY pages..(T=36).GC finished] [GC for 677 ARRAY pages..(T=36).GC finished] [GC for 687 ARRAY pages..(T=36).GC finished] [GC for 697 ARRAY pages..(T=36).GC finished] [GC for 707 ARRAY pages..(T=36).GC finished] [GC for 717 ARRAY pages..(T=36).GC finished] [GC for 727 ARRAY pages..(T=36).GC finished] [GC for 737 ARRAY pages..(T=35).GC finished] [GC for 747 ARRAY pages..(T=36).GC finished] [GC for 757 ARRAY pages..(T=35).GC finished] [GC for 767 ARRAY pages..(T=35).GC finished] [GC for 777 ARRAY pages..(T=36).GC finished] [GC for 189 STRUCTURE pages..(T=38).GC finished] [GC for 787 ARRAY pages..(T=37).GC finished] [GC for 797 ARRAY pages..(T=37).GC finished] [GC for 807 ARRAY pages..(T=37).GC finished] [GC for 817 ARRAY pages..(T=38).GC finished] [GC for 827 ARRAY pages..(T=37).GC finished] [GC for 837 ARRAY pages..(T=38).GC finished] [GC for 847 ARRAY pages..(T=37).GC finished] [GC for 857 ARRAY pages..(T=37).GC finished] [GC for 867 ARRAY pages..(T=36).GC finished] [GC for 877 ARRAY pages..(T=37).GC finished] [GC for 887 ARRAY pages..(T=38).GC finished] [GC for 897 ARRAY pages..(T=37).GC finished] [GC for 907 ARRAY pages..(T=38).GC finished] [GC for 917 ARRAY pages..(T=37).GC finished] [GC for 927 ARRAY pages..(T=37).GC finished] [GC for 937 ARRAY pages..(T=38).GC finished] [GC for 947 ARRAY pages..(T=38).GC finished] [GC for 10907 CONS pages..(T=39).GC finished] [GC for 957 ARRAY pages..(T=38).GC finished] [GC for 967 ARRAY pages..(T=38).GC finished] [GC for 10917 CONS pages..(T=36).GC finished] [GC for 977 ARRAY pages..(T=37).GC finished] [GC for 10927 CONS pages..(T=38).GC finished] [GC for 987 ARRAY pages..(T=37).GC finished] [GC for 10937 CONS pages..(T=37).GC finished] [GC for 997 ARRAY pages..(T=37).GC finished] [GC for 10947 CONS pages..(T=38).GC finished] [GC for 1007 ARRAY pages..(T=38).GC finished] [GC for 1017 ARRAY pages..(T=38).GC finished] [GC for 10957 CONS pages..(T=39).GC finished] [GC for 1027 ARRAY pages..(T=39).GC finished] [GC for 10967 CONS pages..(T=39).GC finished] [GC for 1037 ARRAY pages..(T=38).GC finished] [GC for 10977 CONS pages..(T=38).GC finished] [GC for 1047 ARRAY pages..(T=38).GC finished] [GC for 10987 CONS pages..(T=38).GC finished] [GC for 1057 ARRAY pages..(T=38).GC finished] [GC for 10997 CONS pages..(T=38).GC finished] [GC for 1067 ARRAY pages..(T=38).GC finished] [GC for 11007 CONS pages..(T=37).GC finished] [GC for 1077 ARRAY pages..(T=37).GC finished] [GC for 11017 CONS pages..(T=38).GC finished] [GC for 1087 ARRAY pages..(T=39).GC finished] [GC for 1954 RELOCATABLE-BLOCKS pages..(T=39).GC finished] [GC for 1097 ARRAY pages..(T=38).GC finished] [GC for 11027 CONS pages..(T=39).GC finished] [GC for 1107 ARRAY pages..(T=39).GC finished] [GC for 11037 CONS pages..(T=39).GC finished] [GC for 1117 ARRAY pages..(T=39).GC finished] [GC for 11047 CONS pages..(T=38).GC finished] [GC for 1127 ARRAY pages..(T=38).GC finished] [GC for 11057 CONS pages..(T=39).GC finished] [GC for 1137 ARRAY pages..(T=38).GC finished] [GC for 11067 CONS pages..(T=39).GC finished] [GC for 1147 ARRAY pages..(T=38).GC finished] [GC for 11077 CONS pages..(T=39).GC finished] [GC for 1157 ARRAY pages..(T=39).GC finished] [GC for 11087 CONS pages..(T=38).GC finished] [GC for 1167 ARRAY pages..(T=39).GC finished] [GC for 1177 ARRAY pages..(T=38).GC finished] [GC for 283 STRUCTURE pages..(T=39).GC finished] [GC for 11097 CONS pages..(T=39).GC finished] [GC for 1187 ARRAY pages..(T=39).GC finished] [GC for 11107 CONS pages..(T=39).GC finished] [GC for 1197 ARRAY pages..(T=38).GC finished] [GC for 11117 CONS pages..(T=38).GC finished] [GC for 1207 ARRAY pages..(T=39).GC finished] [GC for 11127 CONS pages..(T=39).GC finished] [GC for 1217 ARRAY pages..(T=39).GC finished] [GC for 11137 CONS pages..(T=39).GC finished] [GC for 1227 ARRAY pages..(T=38).GC finished] [GC for 1237 ARRAY pages..(T=39).GC finished] [GC for 11147 CONS pages..(T=39).GC finished] [GC for 1247 ARRAY pages..(T=39).GC finished] [GC for 11157 CONS pages..(T=39).GC finished] [GC for 1257 ARRAY pages..(T=39).GC finished] [GC for 11167 CONS pages..(T=40).GC finished] [GC for 1267 ARRAY pages..(T=40).GC finished] [GC for 11177 CONS pages..(T=40).GC finished] [GC for 1277 ARRAY pages..(T=40).GC finished] [GC for 11187 CONS pages..(T=40).GC finished] [GC for 1287 ARRAY pages..(T=39).GC finished] [GC for 11197 CONS pages..(T=39).GC finished] [GC for 1297 ARRAY pages..(T=38).GC finished] [GC for 1307 ARRAY pages..(T=40).GC finished] [GC for 11207 CONS pages..(T=39).GC finished] [GC for 1317 ARRAY pages..(T=40).GC finished] [GC for 11217 CONS pages..(T=39).GC finished] [GC for 1327 ARRAY pages..(T=40).GC finished] [GC for 11227 CONS pages..(T=39).GC finished] [GC for 1337 ARRAY pages..(T=39).GC finished] [GC for 11237 CONS pages..(T=40).GC finished] [GC for 1347 ARRAY pages..(T=40).GC finished] [GC for 11247 CONS pages..(T=39).GC finished] [GC for 1357 ARRAY pages..(T=39).GC finished] [GC for 11257 CONS pages..(T=40).GC finished] [GC for 1367 ARRAY pages..(T=40).GC finished] [GC for 1377 ARRAY pages..(T=40).GC finished] [GC for 11267 CONS pages..(T=40).GC finished] [GC for 1387 ARRAY pages..(T=39).GC finished] [GC for 11277 CONS pages..(T=40).GC finished] [GC for 1397 ARRAY pages..(T=40).GC finished] [GC for 11287 CONS pages..(T=40).GC finished] [GC for 1407 ARRAY pages..(T=40).GC finished] [GC for 11297 CONS pages..(T=40).GC finished] [GC for 1417 ARRAY pages..(T=40).GC finished] [GC for 11307 CONS pages..(T=41).GC finished] [GC for 1427 ARRAY pages..(T=39).GC finished] [GC for 11317 CONS pages..(T=38).GC finished] [GC for 1437 ARRAY pages..(T=40).GC finished] [GC for 1447 ARRAY pages..(T=40).GC finished] [GC for 11327 CONS pages..(T=41).GC finished] [GC for 1457 ARRAY pages..(T=41).GC finished] [GC for 11337 CONS pages..(T=40).GC finished] [GC for 1467 ARRAY pages..(T=41).GC finished] [GC for 11347 CONS pages..(T=41).GC finished] [GC for 1477 ARRAY pages..(T=41).GC finished] [GC for 11357 CONS pages..(T=40).GC finished] [GC for 1487 ARRAY pages..(T=40).GC finished] [GC for 11367 CONS pages..(T=41).GC finished] [GC for 1497 ARRAY pages..(T=41).GC finished] [GC for 11377 CONS pages..(T=41).GC finished] [GC for 1507 ARRAY pages..(T=41).GC finished] [GC for 1954 RELOCATABLE-BLOCKS pages..(T=42).GC finished] [GC for 11387 CONS pages..(T=42).GC finished] [GC for 1517 ARRAY pages..(T=41).GC finished] [GC for 1527 ARRAY pages..(T=40).GC finished] [GC for 11397 CONS pages..(T=41).GC finished] [GC for 1537 ARRAY pages..(T=41).GC finished] [GC for 11407 CONS pages..(T=41).GC finished] [GC for 1547 ARRAY pages..(T=41).GC finished] [GC for 11417 CONS pages..(T=40).GC finished] [GC for 1557 ARRAY pages..(T=41).GC finished] [GC for 11427 CONS pages..(T=42).GC finished] [GC for 1567 ARRAY pages..(T=42).GC finished] [GC for 11437 CONS pages..(T=41).GC finished] [GC for 1577 ARRAY pages..(T=40).GC finished] [GC for 11447 CONS pages..(T=40).GC finished] [GC for 1587 ARRAY pages..(T=41).GC finished] [GC for 11457 CONS pages..(T=42).GC finished] [GC for 1597 ARRAY pages..(T=42).GC finished] [GC for 11467 CONS pages..(T=42).GC finished] [GC for 1607 ARRAY pages..(T=41).GC finished] [GC for 1617 ARRAY pages..(T=41).GC finished] [GC for 11477 CONS pages..(T=41).GC finished] [GC for 1627 ARRAY pages..(T=42).GC finished] [GC for 11487 CONS pages..(T=42).GC finished] [GC for 1637 ARRAY pages..(T=42).GC finished] [GC for 11497 CONS pages..(T=41).GC finished] [GC for 1647 ARRAY pages..(T=41).GC finished] [GC for 11507 CONS pages..(T=41).GC finished] [GC for 1657 ARRAY pages..(T=42).GC finished] [GC for 1667 ARRAY pages..(T=41).GC finished] [GC for 11517 CONS pages..(T=41).GC finished] [GC for 1677 ARRAY pages..(T=41).GC finished] [GC for 11527 CONS pages..(T=42).GC finished] [GC for 1687 ARRAY pages..(T=41).GC finished] [GC for 11537 CONS pages..(T=42).GC finished] [GC for 1697 ARRAY pages..(T=41).GC finished] [GC for 11547 CONS pages..(T=41).GC finished] [GC for 1707 ARRAY pages..(T=41).GC finished] [GC for 11557 CONS pages..(T=42).GC finished] [GC for 1717 ARRAY pages..(T=41).GC finished] [GC for 11567 CONS pages..(T=42).GC finished] [GC for 1727 ARRAY pages..(T=42).GC finished] [GC for 1737 ARRAY pages..(T=42).GC finished] [GC for 11577 CONS pages..(T=43).GC finished] [GC for 1747 ARRAY pages..(T=42).GC finished] [GC for 424 STRUCTURE pages..(T=42).GC finished] [GC for 11587 CONS pages..(T=42).GC finished] [GC for 1757 ARRAY pages..(T=41).GC finished] [GC for 11597 CONS pages..(T=41).GC finished] [GC for 1767 ARRAY pages..(T=43).GC finished] [GC for 11607 CONS pages..(T=43).GC finished] [GC for 1777 ARRAY pages..(T=42).GC finished] [GC for 11617 CONS pages..(T=42).GC finished] [GC for 1787 ARRAY pages..(T=42).GC finished] [GC for 11627 CONS pages..(T=41).GC finished] [GC for 1797 ARRAY pages..(T=41).GC finished] [GC for 11637 CONS pages..(T=41).GC finished] [GC for 1807 ARRAY pages..(T=42).GC finished] [GC for 1817 ARRAY pages..(T=42).GC finished] [GC for 11647 CONS pages..(T=42).GC finished] [GC for 1827 ARRAY pages..(T=43).GC finished] [GC for 11657 CONS pages..(T=42).GC finished] [GC for 1837 ARRAY pages..(T=42).GC finished] [GC for 11667 CONS pages..(T=42).GC finished] [GC for 1847 ARRAY pages..(T=43).GC finished] [GC for 11677 CONS pages..(T=43).GC finished] [GC for 1857 ARRAY pages..(T=41).GC finished] [GC for 11687 CONS pages..(T=42).GC finished] [GC for 1954 RELOCATABLE-BLOCKS pages..(T=43).GC finished] [GC for 1867 ARRAY pages..(T=44).GC finished] [GC for 11697 CONS pages..(T=43).GC finished] [GC for 1877 ARRAY pages..(T=44).GC finished] [GC for 11707 CONS pages..(T=43).GC finished] [GC for 1887 ARRAY pages..(T=43).GC finished] [GC for 11717 CONS pages..(T=42).GC finished] [GC for 1897 ARRAY pages..(T=43).GC finished] [GC for 11727 CONS pages..(T=42).GC finished] [GC for 1907 ARRAY pages..(T=43).GC finished] [GC for 1917 ARRAY pages..(T=44).GC finished] [GC for 11737 CONS pages..(T=43).GC finished] [GC for 1927 ARRAY pages..(T=44).GC finished] [GC for 11747 CONS pages..(T=43).GC finished] [GC for 1937 ARRAY pages..(T=44).GC finished] [GC for 11757 CONS pages..(T=44).GC finished] [GC for 1947 ARRAY pages..(T=43).GC finished] [GC for 11767 CONS pages..(T=43).GC finished] [GC for 1957 ARRAY pages..(T=43).GC finished] [GC for 11777 CONS pages..(T=44).GC finished] [GC for 1967 ARRAY pages..(T=44).GC finished] [GC for 11787 CONS pages..(T=43).GC finished] [GC for 1977 ARRAY pages..(T=44).GC finished] [GC for 11797 CONS pages..(T=42).GC finished] [GC for 1987 ARRAY pages..(T=43).GC finished] [GC for 11807 CONS pages..(T=42).GC finished] [GC for 11817 CONS pages..(T=43).GC finished] [GC for 1997 ARRAY pages..(T=42).GC finished] [GC for 11827 CONS pages..(T=43).GC finished] [GC for 11837 CONS pages..(T=42).GC finished] [GC for 11847 CONS pages..(T=42).GC finished] [GC for 11857 CONS pages..(T=44).GC finished] [GC for 11867 CONS pages..(T=44).GC finished] [GC for 11877 CONS pages..(T=44).GC finished] [GC for 11887 CONS pages..(T=44).GC finished] [GC for 11897 CONS pages..(T=45).GC finished] [GC for 11907 CONS pages..(T=45).GC finished] [GC for 11917 CONS pages..(T=44).GC finished] [GC for 11927 CONS pages..(T=44).GC finished] [GC for 613 SFUN pages..(T=44).GC finished] [GC for 11937 CONS pages..(T=44).GC finished] [GC for 11947 CONS pages..(T=45).GC finished] [GC for 11957 CONS pages..(T=44).GC finished] [GC for 11967 CONS pages..(T=45).GC finished] [GC for 11977 CONS pages..(T=45).GC finished] [GC for 1954 RELOCATABLE-BLOCKS pages..(T=45).GC finished] [GC for 11987 CONS pages..(T=44).GC finished] [GC for 11997 CONS pages..(T=45).GC finished] [GC for 12007 CONS pages..(T=44).GC finished] [GC for 12017 CONS pages..(T=44).GC finished] [GC for 12027 CONS pages..(T=45).GC finished] [GC for 12037 CONS pages..(T=45).GC finished] [GC for 12047 CONS pages..(T=44).GC finished] [GC for 12057 CONS pages..(T=44).GC finished] [GC for 12067 CONS pages..(T=44).GC finished] [GC for 12077 CONS pages..(T=45).GC finished] [GC for 12087 CONS pages..(T=44).GC finished] [GC for 12097 CONS pages..(T=42).GC finished] [GC for 12107 CONS pages..(T=45).GC finished] [GC for 2007 ARRAY pages..(T=44).GC finished] [GC for 623 SFUN pages..(T=45).GC finished] [GC for 12117 CONS pages..(T=44).GC finished] [GC for 12127 CONS pages..(T=45).GC finished] [GC for 12137 CONS pages..(T=45).GC finished] [GC for 12147 CONS pages..(T=45).GC finished] [GC for 12157 CONS pages..(T=45).GC finished] [GC for 12167 CONS pages..(T=46).GC finished] [GC for 12177 CONS pages..(T=45).GC finished] [GC for 12187 CONS pages..(T=46).GC finished] [GC for 12197 CONS pages..(T=46).GC finished] [GC for 633 SFUN pages..(T=46).GC finished] [GC for 12207 CONS pages..(T=46).GC finished] [GC for 12217 CONS pages..(T=46).GC finished] [GC for 633 SFUN pages..(T=45).GC finished] [GC for 12227 CONS pages..(T=44).GC finished] [GC for 12237 CONS pages..(T=44).GC finished] [GC for 12247 CONS pages..(T=44).GC finished] [GC for 12257 CONS pages..(T=45).GC finished] [GC for 12267 CONS pages..(T=46).GC finished] [GC for 12277 CONS pages..(T=46).GC finished] [GC for 12287 CONS pages..(T=47).GC finished] [GC for 12297 CONS pages..(T=47).GC finished] [GC for 643 SFUN pages..(T=46).GC finished] [GC for 12307 CONS pages..(T=46).GC finished] [GC for 643 SFUN pages..(T=46).GC finished] [GC for 12317 CONS pages..(T=47).GC finished] [GC for 12327 CONS pages..(T=47).GC finished] [GC for 12337 CONS pages..(T=46).GC finished] [GC for 12347 CONS pages..(T=45).GC finished] [GC for 12357 CONS pages..(T=45).GC finished] [GC for 23552 CONTIGUOUS-BLOCKS pages..(T=43).GC finished] T Finished loading '((COMP-FN :EXEC NIL "1" STATE)). [GC for 1954 RELOCATABLE-BLOCKS pages..(T=35).GC finished] [GC for 12367 CONS pages..(T=38).GC finished] [GC for 12377 CONS pages..(T=38).GC finished] [GC for 12387 CONS pages..(T=38).GC finished] [GC for 12397 CONS pages..(T=39).GC finished] [GC for 12407 CONS pages..(T=37).GC finished] [GC for 12417 CONS pages..(T=38).GC finished] [GC for 12427 CONS pages..(T=39).GC finished] [GC for 12437 CONS pages..(T=38).GC finished] [GC for 12447 CONS pages..(T=38).GC finished] [GC for 12457 CONS pages..(T=38).GC finished] [GC for 12467 CONS pages..(T=38).GC finished] [GC for 12477 CONS pages..(T=38).GC finished] [GC for 12487 CONS pages..(T=38).GC finished] [GC for 12497 CONS pages..(T=38).GC finished] [GC for 12507 CONS pages..(T=38).GC finished] [GC for 12517 CONS pages..(T=38).GC finished] [GC for 12527 CONS pages..(T=40).GC finished] [GC for 12537 CONS pages..(T=41).GC finished] [GC for 12547 CONS pages..(T=39).GC finished] [GC for 12557 CONS pages..(T=40).GC finished] [GC for 12567 CONS pages..(T=40).GC finished] [GC for 12577 CONS pages..(T=39).GC finished] [GC for 12587 CONS pages..(T=40).GC finished] [GC for 12597 CONS pages..(T=39).GC finished] [GC for 12607 CONS pages..(T=40).GC finished] [GC for 12617 CONS pages..(T=38).GC finished] [GC for 12627 CONS pages..(T=40).GC finished] [GC for 12637 CONS pages..(T=39).GC finished] [GC for 12647 CONS pages..(T=39).GC finished] [GC for 12657 CONS pages..(T=40).GC finished] [GC for 12667 CONS pages..(T=41).GC finished] [GC for 12677 CONS pages..(T=39).GC finished] [GC for 12687 CONS pages..(T=40).GC finished] [GC for 12697 CONS pages..(T=41).GC finished] [GC for 12707 CONS pages..(T=40).GC finished] [GC for 12717 CONS pages..(T=41).GC finished] [GC for 12727 CONS pages..(T=40).GC finished] [GC for 12737 CONS pages..(T=41).GC finished] [GC for 12747 CONS pages..(T=40).GC finished] [GC for 12757 CONS pages..(T=41).GC finished] [GC for 12767 CONS pages..(T=40).GC finished] [GC for 12777 CONS pages..(T=39).GC finished] [GC for 12787 CONS pages..(T=39).GC finished] [GC for 12797 CONS pages..(T=38).GC finished] [GC for 12807 CONS pages..(T=38).GC finished] [GC for 12817 CONS pages..(T=39).GC finished] [GC for 12827 CONS pages..(T=39).GC finished] [GC for 12837 CONS pages..(T=39).GC finished] [GC for 12847 CONS pages..(T=39).GC finished] [GC for 12857 CONS pages..(T=39).GC finished] [GC for 12867 CONS pages..(T=39).GC finished] [GC for 12877 CONS pages..(T=39).GC finished] [GC for 12887 CONS pages..(T=39).GC finished] [GC for 12897 CONS pages..(T=39).GC finished] [GC for 12907 CONS pages..(T=40).GC finished] [GC for 12917 CONS pages..(T=39).GC finished] [GC for 12927 CONS pages..(T=39).GC finished] [GC for 12937 CONS pages..(T=39).GC finished] [GC for 12947 CONS pages..(T=38).GC finished] [GC for 12957 CONS pages..(T=38).GC finished] [GC for 12967 CONS pages..(T=38).GC finished] [GC for 12977 CONS pages..(T=38).GC finished] [GC for 12987 CONS pages..(T=39).GC finished] [GC for 12997 CONS pages..(T=40).GC finished] [GC for 13007 CONS pages..(T=39).GC finished] [GC for 13017 CONS pages..(T=39).GC finished] [GC for 13027 CONS pages..(T=39).GC finished] [GC for 13037 CONS pages..(T=39).GC finished] [GC for 13047 CONS pages..(T=39).GC finished] [GC for 13057 CONS pages..(T=39).GC finished] [GC for 13067 CONS pages..(T=39).GC finished] [GC for 13077 CONS pages..(T=39).GC finished] [GC for 13087 CONS pages..(T=39).GC finished] [GC for 13097 CONS pages..(T=39).GC finished] [GC for 13107 CONS pages..(T=40).GC finished] [GC for 13117 CONS pages..(T=41).GC finished] [GC for 13127 CONS pages..(T=40).GC finished] [GC for 13137 CONS pages..(T=41).GC finished] [GC for 13147 CONS pages..(T=41).GC finished] [GC for 13157 CONS pages..(T=40).GC finished] [GC for 13167 CONS pages..(T=40).GC finished] [GC for 13177 CONS pages..(T=40).GC finished] [GC for 13187 CONS pages..(T=40).GC finished] [GC for 13197 CONS pages..(T=40).GC finished] [GC for 13207 CONS pages..(T=40).GC finished] [GC for 13217 CONS pages..(T=40).GC finished] [GC for 13227 CONS pages..(T=40).GC finished] [GC for 653 SFUN pages..(T=40).GC finished] [GC for 13237 CONS pages..(T=40).GC finished] [GC for 13247 CONS pages..(T=40).GC finished] [GC for 13257 CONS pages..(T=40).GC finished] [GC for 13267 CONS pages..(T=40).GC finished] [GC for 13277 CONS pages..(T=41).GC finished] [GC for 13287 CONS pages..(T=41).GC finished] [GC for 13297 CONS pages..(T=40).GC finished] [GC for 13307 CONS pages..(T=40).GC finished] [GC for 13317 CONS pages..(T=40).GC finished] [GC for 13327 CONS pages..(T=40).GC finished] [GC for 13337 CONS pages..(T=39).GC finished] [GC for 13347 CONS pages..(T=41).GC finished] [GC for 13357 CONS pages..(T=40).GC finished] [GC for 13367 CONS pages..(T=41).GC finished] [GC for 13377 CONS pages..(T=40).GC finished] [GC for 13387 CONS pages..(T=40).GC finished] [GC for 13397 CONS pages..(T=41).GC finished] [GC for 13407 CONS pages..(T=41).GC finished] [GC for 13417 CONS pages..(T=41).GC finished] [GC for 13427 CONS pages..(T=41).GC finished] [GC for 13437 CONS pages..(T=41).GC finished] [GC for 13447 CONS pages..(T=40).GC finished] [GC for 13457 CONS pages..(T=39).GC finished] [GC for 13467 CONS pages..(T=40).GC finished] [GC for 13477 CONS pages..(T=40).GC finished] [GC for 13487 CONS pages..(T=41).GC finished] [GC for 13497 CONS pages..(T=40).GC finished] [GC for 13507 CONS pages..(T=40).GC finished] [GC for 13517 CONS pages..(T=41).GC finished] [GC for 13527 CONS pages..(T=40).GC finished] [GC for 13537 CONS pages..(T=40).GC finished] [GC for 13547 CONS pages..(T=39).GC finished] [GC for 13557 CONS pages..(T=40).GC finished] [GC for 13567 CONS pages..(T=41).GC finished] [GC for 13577 CONS pages..(T=40).GC finished] [GC for 13587 CONS pages..(T=40).GC finished] [GC for 13597 CONS pages..(T=40).GC finished] [GC for 13607 CONS pages..(T=40).GC finished] [GC for 13617 CONS pages..(T=41).GC finished] [GC for 13627 CONS pages..(T=40).GC finished] [GC for 13637 CONS pages..(T=39).GC finished] [GC for 13647 CONS pages..(T=41).GC finished] [GC for 13657 CONS pages..(T=40).GC finished] [GC for 13667 CONS pages..(T=41).GC finished] [GC for 13677 CONS pages..(T=40).GC finished] [GC for 13687 CONS pages..(T=41).GC finished] [GC for 13697 CONS pages..(T=41).GC finished] [GC for 13707 CONS pages..(T=42).GC finished] [GC for 13717 CONS pages..(T=43).GC finished] [GC for 13727 CONS pages..(T=42).GC finished] [GC for 13737 CONS pages..(T=42).GC finished] [GC for 13747 CONS pages..(T=42).GC finished] [GC for 13757 CONS pages..(T=42).GC finished] [GC for 13767 CONS pages..(T=42).GC finished] [GC for 13777 CONS pages..(T=42).GC finished] [GC for 13787 CONS pages..(T=42).GC finished] [GC for 13797 CONS pages..(T=42).GC finished] [GC for 13807 CONS pages..(T=43).GC finished] [GC for 13817 CONS pages..(T=42).GC finished] [GC for 13827 CONS pages..(T=42).GC finished] [GC for 13837 CONS pages..(T=42).GC finished] [GC for 13847 CONS pages..(T=42).GC finished] [GC for 13857 CONS pages..(T=42).GC finished] [GC for 13867 CONS pages..(T=42).GC finished] [GC for 13877 CONS pages..(T=42).GC finished] [GC for 13887 CONS pages..(T=42).GC finished] [GC for 13897 CONS pages..(T=42).GC finished] [GC for 13907 CONS pages..(T=41).GC finished] [GC for 663 SFUN pages..(T=43).GC finished] [GC for 13917 CONS pages..(T=41).GC finished] [GC for 13927 CONS pages..(T=42).GC finished] [GC for 13937 CONS pages..(T=41).GC finished] [GC for 13947 CONS pages..(T=41).GC finished] [GC for 13957 CONS pages..(T=40).GC finished] [GC for 13967 CONS pages..(T=42).GC finished] [GC for 13977 CONS pages..(T=42).GC finished] [GC for 13987 CONS pages..(T=42).GC finished] [GC for 13997 CONS pages..(T=41).GC finished] [GC for 14007 CONS pages..(T=42).GC finished] [GC for 14017 CONS pages..(T=42).GC finished] [GC for 14027 CONS pages..(T=42).GC finished] [GC for 14037 CONS pages..(T=41).GC finished] [GC for 14047 CONS pages..(T=43).GC finished] [GC for 14057 CONS pages..(T=42).GC finished] [GC for 14067 CONS pages..(T=43).GC finished] [GC for 14077 CONS pages..(T=42).GC finished] [GC for 14087 CONS pages..(T=42).GC finished] [GC for 14097 CONS pages..(T=42).GC finished] [GC for 14107 CONS pages..(T=42).GC finished] [GC for 14117 CONS pages..(T=42).GC finished] [GC for 14127 CONS pages..(T=42).GC finished] [GC for 14137 CONS pages..(T=42).GC finished] [GC for 14147 CONS pages..(T=42).GC finished] [GC for 14157 CONS pages..(T=43).GC finished] [GC for 14167 CONS pages..(T=42).GC finished] [GC for 14177 CONS pages..(T=42).GC finished] [GC for 1954 RELOCATABLE-BLOCKS pages..(T=42).GC finished] [GC for 14187 CONS pages..(T=41).GC finished] [GC for 673 SFUN pages..(T=41).GC finished] [GC for 14197 CONS pages..(T=43).GC finished] [GC for 14207 CONS pages..(T=43).GC finished] [GC for 683 SFUN pages..(T=43).GC finished] [GC for 14217 CONS pages..(T=43).GC finished] [GC for 14227 CONS pages..(T=42).GC finished] [GC for 14237 CONS pages..(T=43).GC finished] [GC for 14247 CONS pages..(T=42).GC finished] [GC for 14257 CONS pages..(T=43).GC finished] [GC for 14267 CONS pages..(T=43).GC finished] [GC for 14277 CONS pages..(T=43).GC finished] [GC for 14287 CONS pages..(T=43).GC finished] [GC for 14297 CONS pages..(T=42).GC finished] [GC for 14307 CONS pages..(T=42).GC finished] [GC for 14317 CONS pages..(T=43).GC finished] [GC for 14327 CONS pages..(T=43).GC finished] [GC for 14337 CONS pages..(T=42).GC finished] [GC for 14347 CONS pages..(T=43).GC finished] [GC for 14357 CONS pages..(T=43).GC finished] [GC for 14367 CONS pages..(T=43).GC finished] [GC for 14377 CONS pages..(T=42).GC finished] [GC for 14387 CONS pages..(T=43).GC finished] [GC for 14397 CONS pages..(T=43).GC finished] [GC for 14407 CONS pages..(T=43).GC finished] [GC for 14417 CONS pages..(T=43).GC finished] [GC for 14427 CONS pages..(T=44).GC finished] [GC for 14437 CONS pages..(T=43).GC finished] [GC for 14447 CONS pages..(T=43).GC finished] [GC for 14457 CONS pages..(T=42).GC finished] [GC for 14467 CONS pages..(T=42).GC finished] [GC for 14477 CONS pages..(T=43).GC finished] [GC for 14487 CONS pages..(T=43).GC finished] [GC for 14497 CONS pages..(T=42).GC finished] [GC for 14507 CONS pages..(T=43).GC finished] [GC for 14517 CONS pages..(T=44).GC finished] [GC for 14527 CONS pages..(T=44).GC finished] [GC for 14537 CONS pages..(T=43).GC finished] [GC for 14547 CONS pages..(T=43).GC finished] [GC for 14557 CONS pages..(T=43).GC finished] [GC for 14567 CONS pages..(T=44).GC finished] [GC for 14577 CONS pages..(T=44).GC finished] [GC for 14587 CONS pages..(T=43).GC finished] [GC for 14597 CONS pages..(T=42).GC finished] [GC for 14607 CONS pages..(T=44).GC finished] [GC for 14617 CONS pages..(T=43).GC finished] [GC for 14627 CONS pages..(T=43).GC finished] [GC for 14637 CONS pages..(T=44).GC finished] [GC for 14647 CONS pages..(T=44).GC finished] [GC for 14657 CONS pages..(T=44).GC finished] [GC for 14667 CONS pages..(T=44).GC finished] [GC for 14677 CONS pages..(T=43).GC finished] [GC for 14687 CONS pages..(T=43).GC finished] [GC for 14697 CONS pages..(T=43).GC finished] [GC for 14707 CONS pages..(T=43).GC finished] [GC for 14717 CONS pages..(T=42).GC finished] [GC for 14727 CONS pages..(T=42).GC finished] [GC for 14737 CONS pages..(T=43).GC finished] [GC for 14747 CONS pages..(T=43).GC finished] [GC for 14757 CONS pages..(T=44).GC finished] [GC for 14767 CONS pages..(T=44).GC finished] [GC for 14777 CONS pages..(T=43).GC finished] [GC for 14787 CONS pages..(T=44).GC finished] [GC for 14797 CONS pages..(T=43).GC finished] [GC for 14807 CONS pages..(T=44).GC finished] [GC for 14817 CONS pages..(T=44).GC finished] [GC for 14827 CONS pages..(T=44).GC finished] [GC for 14837 CONS pages..(T=44).GC finished] [GC for 14847 CONS pages..(T=43).GC finished] [GC for 14857 CONS pages..(T=44).GC finished] [GC for 14867 CONS pages..(T=44).GC finished] [GC for 14877 CONS pages..(T=44).GC finished] [GC for 14887 CONS pages..(T=44).GC finished] [GC for 14897 CONS pages..(T=44).GC finished] [GC for 14907 CONS pages..(T=43).GC finished] [GC for 14917 CONS pages..(T=43).GC finished] [GC for 14927 CONS pages..(T=44).GC finished] [GC for 14937 CONS pages..(T=45).GC finished] [GC for 14947 CONS pages..(T=44).GC finished] [GC for 14957 CONS pages..(T=43).GC finished] [GC for 14967 CONS pages..(T=44).GC finished] [GC for 14977 CONS pages..(T=43).GC finished] [GC for 14987 CONS pages..(T=42).GC finished] [GC for 14997 CONS pages..(T=43).GC finished] [GC for 15007 CONS pages..(T=43).GC finished] [GC for 15017 CONS pages..(T=45).GC finished] [GC for 15027 CONS pages..(T=45).GC finished] [GC for 15037 CONS pages..(T=45).GC finished] [GC for 15047 CONS pages..(T=44).GC finished] [GC for 15057 CONS pages..(T=44).GC finished] [GC for 15067 CONS pages..(T=45).GC finished] [GC for 693 SFUN pages..(T=45).GC finished] [GC for 15077 CONS pages..(T=44).GC finished] [GC for 15087 CONS pages..(T=45).GC finished] [GC for 15097 CONS pages..(T=44).GC finished] [GC for 15107 CONS pages..(T=44).GC finished] [GC for 15117 CONS pages..(T=43).GC finished] [GC for 15127 CONS pages..(T=44).GC finished] [GC for 15137 CONS pages..(T=45).GC finished] [GC for 794 SYMBOL pages..(T=45).GC finished] ****************************************************************************** Initialization complete, beginning the check and save. ****************************************************************************** Warning: SIMPLE-WARNING: TRACE is being redefined. Warning: SIMPLE-WARNING: UNTRACE is being redefined. [GC for 24064 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 36608 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 1954 RELOCATABLE-BLOCKS pages..(T=35).GC finished] make[2]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 Initialization SUCCEEDED. make[2]: Leaving directory '/build/acl2-8.3dfsg' if [ -f worklispext ]; then /usr/bin/make move-to-old LISPEXT=`cat worklispext` ;\ elif [ -f saved_acl2 ]; then \ mv -f saved_acl2 osaved_acl2 ;\ else \ touch saved_acl2 ;\ mv -f saved_acl2 osaved_acl2 ;\ fi make[2]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 if [ -f saved_acl2 ] && [ -f saved_acl2.gcl ]; then \ echo "Moving " saved_acl2.gcl " to osaved_acl2.gcl"; \ mv -f saved_acl2.gcl osaved_acl2.gcl; \ cat saved_acl2 | sed -e 's/saved_acl2.gcl$/osaved_acl2.gcl/' > osaved_acl2 ;\ chmod 775 osaved_acl2 ;\ rm -f saved_acl2 ; fi make[2]: Leaving directory '/build/acl2-8.3dfsg' mv -f nsaved_acl2 saved_acl2 if [ -f worklispext ]; then /usr/bin/make move-new LISPEXT=`cat worklispext` ; fi make[2]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 if [ -f nsaved_acl2.gcl ]; then \ mv -f nsaved_acl2.gcl saved_acl2.gcl ; fi make[2]: Leaving directory '/build/acl2-8.3dfsg' rm -f worklispext rm -f workxxx /usr/bin/make do_saved make[2]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 rm -fr saved mkdir saved chmod 775 saved cp *.lisp acl2-characters GNUmakefile saved/ chmod 666 saved/* make[2]: Leaving directory '/build/acl2-8.3dfsg' rm -f workxxx /usr/bin/make chmod_image make[2]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 if [ -f saved_acl2 ]; then \ chmod 775 saved_acl2 ;\ fi make[2]: Leaving directory '/build/acl2-8.3dfsg' Successfully built /build/acl2-8.3dfsg/saved_acl2. make[1]: Leaving directory '/build/acl2-8.3dfsg' mv *saved_acl2.gcl saved_acl2 HOME=$(pwd) /usr/bin/make mini-proveall make[1]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 Mini-proveall passed. make[1]: Leaving directory '/build/acl2-8.3dfsg' mv mini-proveall.out debian/mini-proveall.out echo "(f-put-global 'old-certification-dir \"$(pwd)/books\" state)" \ "(f-put-global 'new-certification-dir \"/usr/share/acl2-8.3dfsg/books\" state)" \ ":q #-native-reloc (setq si::*multiply-stacks* 4) :q (in-package :acl2) " \ "#+(or sparc sparc64)(progn (si::sgc-on nil) (fmakunbound 'si::sgc-on))" \ "(save-exec \"saved_acl2.c\" \"Modified to produce final certification files\")" | HOME=$(pwd) ./saved_acl2 GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ ACL2 Version 8.3 built September 23, 2022 14:14:25. Copyright (C) 2020, Regents of the University of Texas ACL2 comes with ABSOLUTELY NO WARRANTY. This is free software and you are welcome to redistribute it under certain conditions. For details, see the LICENSE file distributed with ACL2. Initialized with (INITIALIZE-ACL2 'INCLUDE-BOOK *ACL2-PASS-2-FILES*). See the documentation topic note-8-3 for recent changes. Note: We have modified the prompt in some underlying Lisps to further distinguish it from the ACL2 prompt. ACL2 Version 8.3. Level 1. Cbd "/build/acl2-8.3dfsg/". System books directory "/build/acl2-8.3dfsg/books/". Type :help for help. Type (good-bye) 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 49152 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 8 RELOCATABLE-BLOCKS pages..(T=36).GC finished] mv saved_acl2.c.gcl saved_acl2.c mv saved_acl2 saved_acl2.ori cp saved_acl2.c saved_acl2 BUILDDIR="$(dirname $(pwd))" \ FINALDIR="/usr/share/acl2-8.3dfsg" \ HOME=$(pwd) \ GCL_MULTIPROCESS_MEMORY_POOL=t \ /usr/bin/make -j 8 -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/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 cd books ; /usr/bin/make -k ACL2=/build/acl2-8.3dfsg/saved_acl2 moreclean make[2]: Entering directory '/build/acl2-8.3dfsg/books' ACL2_SYSTEM_BOOKS is /build/acl2-8.3dfsg/books Determining ACL2 features (for ACL2 = /build/acl2-8.3dfsg/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 ACL2_HAS_HONS := 1 ACL2_HAS_ANSI := 1 ACL2_HAS_PARALLEL := ACL2_HAS_REALS := ACL2_COMP_EXT := o ACL2_HOST_LISP := GCL OS_HAS_ABC := OS_HAS_GLUCOSE := OS_HAS_IPASIR := OS_HAS_SMTLINK := USE_QUICKLISP := 0 Done with features. Scanning for books... real 0m0.156s user 0m0.069s sys 0m0.053s Scanning for dependencies... real 2m44.194s user 2m42.404s sys 0m1.759s Done scanning. Reading book deps Makefile-deps created on Fri Sep 23 15:10:39 -12 2022 Excluding books that are CCL-only: [] Excluding non-GCL books: [acl2s/acl2s-sigs.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/mode-acl2s-dependencies.cert acl2s/properties.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-slow.cert doc/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 ] Excluding books that need ABC: [centaur/glmc/counter.cert centaur/glmc/glmc-test.cert ] Excluding books that need Glucose: [centaur/aig/aig-sat-tests.cert centaur/esim/tests/add.cert centaur/esim/tests/common.cert centaur/esim/tests/divide.cert centaur/esim/tests/idiv.cert centaur/esim/tests/multiply.cert centaur/esim/tests/regs.cert centaur/esim/tests/subtract.cert centaur/esim/tutorial/boothmul.cert centaur/fgl/tests.cert centaur/glmc/counter.cert centaur/glmc/glmc-test.cert centaur/sv/tutorial/alu.cert centaur/sv/tutorial/boothpipe.cert centaur/sv/tutorial/counter.cert centaur/sv/tutorial/sums.cert workshops/2017/swords/support/demos.cert ] Excluding books that need Ipasir: [centaur/fgl/tests.cert centaur/ipasir/ipasir-backend-extra.cert centaur/ipasir/ipasir-backend.cert centaur/ipasir/ipasir-tests.cert centaur/ipasir/soundness-bug-fixed.cert centaur/ipasir/soundness-bug2-fixed.cert centaur/sv/tutorial/sums.cert workshops/2020/sumners/bake-models.cert workshops/2020/sumners/bake-proofs.cert workshops/2020/sumners/gen-models.cert workshops/2020/sumners/gl-fin-set.cert workshops/2020/sumners/top.cert ] Excluding books that need SMTLINK: [projects/smtlink/doc.cert projects/smtlink/examples/examples.cert projects/smtlink/examples/ringosc.cert ] Excluding ACL2(r)-only books: [nonstd/fft/fft-trig-with-axioms.cert nonstd/fft/fft-trig.cert nonstd/integrals/continuous-function.cert nonstd/integrals/equivalence-continuous-function.cert nonstd/integrals/equivalence-ftc.cert nonstd/integrals/equivalence-integrals.cert nonstd/integrals/ftc-1.cert nonstd/integrals/ftc-2.cert nonstd/integrals/integrable-functions.cert nonstd/integrals/integral-of-polynomials.cert nonstd/integrals/integration-composition-equivalences.cert nonstd/integrals/integration-composition.cert nonstd/integrals/make-partition.cert nonstd/integrals/split-integral-by-subintervals.cert nonstd/nsa/alternating-series.cert nonstd/nsa/chain-rule.cert nonstd/nsa/complex-polar.cert nonstd/nsa/continuity-product.cert nonstd/nsa/continuity.cert nonstd/nsa/derivative-raise.cert nonstd/nsa/derivatives-composition.cert nonstd/nsa/derivatives.cert nonstd/nsa/equivalence-continuity.cert nonstd/nsa/equivalence-derivatives-composition.cert nonstd/nsa/equivalence-derivatives.cert nonstd/nsa/equivalence-limits.cert nonstd/nsa/exp-continuous.cert nonstd/nsa/exp-sum.cert nonstd/nsa/exp.cert nonstd/nsa/factorial.cert nonstd/nsa/intervals.cert nonstd/nsa/inverse-derivatives.cert nonstd/nsa/inverse-monotone.cert nonstd/nsa/inverse-square.cert nonstd/nsa/inverse-trig.cert nonstd/nsa/inverses.cert nonstd/nsa/ln.cert nonstd/nsa/next-integer.cert nonstd/nsa/norm.cert nonstd/nsa/nsa.cert nonstd/nsa/overspill-proof.cert nonstd/nsa/overspill-test.cert nonstd/nsa/overspill.cert nonstd/nsa/raise.cert nonstd/nsa/sine.cert nonstd/nsa/sqrt.cert nonstd/nsa/trig-approx.cert nonstd/nsa/trig.cert nonstd/polynomials/polynomial-calculus.cert nonstd/polynomials/polynomial-defuns.cert nonstd/polynomials/polynomial-lemmas.cert nonstd/sqrt/no-sqrt.cert nonstd/transcendentals/nested-intervals-revised.cert nonstd/transcendentals/nested-intervals.cert nonstd/transcendentals/reals-are-uncountable-1.cert nonstd/transcendentals/reals-are-uncountable-2.cert nonstd/workshops/1999/analysis/continuity.cert nonstd/workshops/1999/analysis/derivatives.cert nonstd/workshops/1999/analysis/exercise1.cert nonstd/workshops/1999/analysis/exercise2.cert nonstd/workshops/1999/analysis/exercise3.cert nonstd/workshops/1999/analysis/exercise4.cert nonstd/workshops/1999/analysis/exercise5.cert nonstd/workshops/1999/analysis/exercise6.cert nonstd/workshops/1999/analysis/exercise7.cert nonstd/workshops/1999/analysis/exercise8.cert nonstd/workshops/1999/calculus/book/between-i-close-implies-i-close.cert nonstd/workshops/1999/calculus/book/between-limited-implies-limited.cert nonstd/workshops/1999/calculus/book/defaxioms.cert nonstd/workshops/1999/calculus/book/equal-riemann-rcfn-refinement-reduction.cert nonstd/workshops/1999/calculus/book/ftoc-lemma.cert nonstd/workshops/1999/calculus/book/fundamental-theorem-of-calculus.cert nonstd/workshops/1999/calculus/book/i-close-implies-abs-difference-small.cert nonstd/workshops/1999/calculus/book/i-limited-rcfn.cert nonstd/workshops/1999/calculus/book/i-small-maxlist-abslist-difflist-maps.cert nonstd/workshops/1999/calculus/book/integral-rcfn-equal-if-i-close.cert nonstd/workshops/1999/calculus/book/integral-rcfn-lemmas.cert nonstd/workshops/1999/calculus/book/integral-rcfn-quotient-between-non-classical.cert nonstd/workshops/1999/calculus/book/integral-rcfn.cert nonstd/workshops/1999/calculus/book/make-partition.cert nonstd/workshops/1999/calculus/book/map-rcfn-close-to-map-rcfn-refinement.cert nonstd/workshops/1999/calculus/book/map-rcfn-refinement-cdr-co-member.cert nonstd/workshops/1999/calculus/book/max-and-min-attained.cert nonstd/workshops/1999/calculus/book/max-x-between.cert nonstd/workshops/1999/calculus/book/maxlist-abslist-difflist-maps-lt.cert nonstd/workshops/1999/calculus/book/min-max-x-rec-lemmas.cert nonstd/workshops/1999/calculus/book/min-x-and-max-x-lemmas.cert nonstd/workshops/1999/calculus/book/min-x-between.cert nonstd/workshops/1999/calculus/book/next-gte-close.cert nonstd/workshops/1999/calculus/book/nsa-lemmas.cert nonstd/workshops/1999/calculus/book/nsa.cert nonstd/workshops/1999/calculus/book/partitions-give-i-close-riemann-sum.cert nonstd/workshops/1999/calculus/book/proof-outline.cert nonstd/workshops/1999/calculus/book/rcfn-next-gte-close.cert nonstd/workshops/1999/calculus/book/rcfn-standard-part.cert nonstd/workshops/1999/calculus/book/refinement-makes-i-small-change-1.cert nonstd/workshops/1999/calculus/book/refinement-makes-i-small-change.cert nonstd/workshops/1999/calculus/book/riemann-bound.cert nonstd/workshops/1999/calculus/book/riemann-defuns.cert nonstd/workshops/1999/calculus/book/riemann-lemmas.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-between.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-lower-bound.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-refinement-is-riemann-rcfn.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-upper-bound.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral-1.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral-2.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral.cert nonstd/workshops/1999/calculus/book/riemann.cert nonstd/workshops/1999/calculus/book/split-integral-by-subintervals.cert nonstd/workshops/1999/calculus/book/standard-part-equal-if-i-close.cert nonstd/workshops/1999/calculus/book/standard-part-preserves-between.cert nonstd/workshops/1999/calculus/book/standard-part-riemann-rcfn-is-standard.cert nonstd/workshops/1999/calculus/book/two-times-r-is-not-less-than-standard-part.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/abs-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/chain-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/composition-elem.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/differentiator.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/exp-minimal.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/exp-properties.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-square.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-trig-derivatives.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-trig-ex.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/ln-derivative-real.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/nsa-ex.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/product-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sin-cos-minimal.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sqrt-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sum-composition.cert nonstd/workshops/2013/helms-gamboa-quantum/support/quantum.cert projects/hybrid-systems/abs.cert projects/hybrid-systems/arith-nsa4.cert projects/hybrid-systems/computed-hints.cert projects/hybrid-systems/eexp.cert projects/hybrid-systems/example.cert projects/hybrid-systems/nsa.cert projects/hybrid-systems/o-real-p.cert projects/hybrid-systems/phi-exists.cert projects/hybrid-systems/phi-properties.cert projects/hybrid-systems/phi-unique.cert projects/hybrid-systems/tm-floor.cert workshops/2015/chau-kaufmann-hunt/support/cosines-orthog.cert workshops/2015/chau-kaufmann-hunt/support/fourier-coefficients-2.cert workshops/2015/chau-kaufmann-hunt/support/fourier-coefficients.cert workshops/2015/chau-kaufmann-hunt/support/fourier-inner-product.cert workshops/2015/chau-kaufmann-hunt/support/fourier-sums.cert workshops/2015/chau-kaufmann-hunt/support/int-infinite-sum-1.cert workshops/2015/chau-kaufmann-hunt/support/int-infinite-sum-2.cert workshops/2015/chau-kaufmann-hunt/support/int-sum.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/continuity-2.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/continuous-function-2.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/ftc-1-2.cert workshops/2015/chau-kaufmann-hunt/support/sine-cosine-orthog.cert workshops/2015/chau-kaufmann-hunt/support/sines-orthog.cert workshops/2015/chau-kaufmann-hunt/support/utils.cert workshops/2018/gamboa-cowles/complex-continuity.cert workshops/2018/gamboa-cowles/complex-lemmas.cert workshops/2018/gamboa-cowles/complex-polynomials.cert workshops/2018/gamboa-cowles/de-moivre.cert workshops/2018/gamboa-cowles/norm2.cert workshops/2018/kwan-greenstreet/cauchy-schwarz.cert workshops/2018/kwan-greenstreet/continuity.cert workshops/2018/kwan-greenstreet/convex.cert workshops/2018/kwan-greenstreet/ftc-2.cert workshops/2018/kwan-greenstreet/metric.cert workshops/2018/kwan-greenstreet/nesterov-1.cert workshops/2018/kwan-greenstreet/nesterov-2.cert workshops/2018/kwan-greenstreet/nesterov-3.cert workshops/2018/kwan-greenstreet/nesterov-4.cert workshops/2018/kwan-greenstreet/nesterov-top.cert workshops/2018/kwan-greenstreet/norm.cert workshops/2018/kwan-greenstreet/top.cert workshops/2018/kwan-greenstreet/vectors.cert workshops/2020/gamboa-cowles-gamboa/floor1-non-R.cert workshops/2020/gamboa-cowles-gamboa/norm-1C.cert workshops/2020/gamboa-cowles-gamboa/number-field.cert workshops/2020/gamboa-cowles-gamboa/polylist.cert workshops/2020/gamboa-cowles-gamboa/prior/raise-to.cert workshops/2020/kwan-peng-greenstreet/abstract-cs.cert ] Excluding books that depend on Quicklisp: [acl2s/cgen/fixers-gl-backend.cert centaur/4v-sexpr/sexpr-purebool-p.cert centaur/4v-sexpr/top.cert centaur/aig/aig-sat-tests.cert centaur/aig/aig-sat.cert centaur/aig/faig-purebool-p.cert centaur/aig/top-doc.cert centaur/aig/top.cert centaur/aignet/abc-wrappers.cert centaur/aignet/abc.cert centaur/aignet/cube-sat.cert centaur/aignet/top-doc.cert centaur/aignet/top.cert centaur/aignet/transforms.cert centaur/esim/stv/stv-debug.cert centaur/esim/stv/stv2c/top.cert centaur/esim/tests/add.cert centaur/esim/tests/common.cert centaur/esim/tests/divide.cert centaur/esim/tests/idiv.cert centaur/esim/tests/multiply.cert centaur/esim/tests/regs.cert centaur/esim/tests/subtract.cert centaur/esim/top-doc.cert centaur/esim/tutorial/alu16-book.cert centaur/esim/tutorial/boothmul.cert centaur/esim/tutorial/counter.cert centaur/esim/tutorial/intro.cert centaur/esim/vcd/vcd-impl.cert centaur/esim/vcd/vcd.cert centaur/fgl/equivcheck.cert centaur/fgl/sat-default.cert centaur/fgl/satlink-sat.cert centaur/fgl/tests.cert centaur/fgl/top-bare.cert centaur/fgl/top-doc.cert centaur/fgl/top.cert centaur/gl/bfr-fraig-satlink.cert centaur/gl/bfr-satlink.cert centaur/gl/gl-ttags.cert centaur/gl/top-doc.cert centaur/glmc/bfr-mcheck-abc.cert centaur/glmc/counter.cert centaur/glmc/glmc-test.cert centaur/ipasir/ipasir-backend-extra.cert centaur/ipasir/ipasir-backend.cert centaur/ipasir/ipasir-tests.cert centaur/ipasir/soundness-bug-fixed.cert centaur/ipasir/soundness-bug2-fixed.cert centaur/misc/sharedlibtest/app.cert centaur/misc/tshell-tests.cert centaur/misc/tshell.cert centaur/quicklisp/base.cert centaur/quicklisp/bordeaux.cert centaur/quicklisp/bt-semaphore.cert centaur/quicklisp/cffi.cert centaur/quicklisp/cl-fad.cert centaur/quicklisp/fastnumio.cert centaur/quicklisp/html-template.cert centaur/quicklisp/hunchentoot.cert centaur/quicklisp/osicat.cert centaur/quicklisp/shellpool.cert centaur/quicklisp/top.cert centaur/quicklisp/uiop.cert centaur/satlink/benchmarks.cert centaur/satlink/check-config.cert centaur/satlink/top.cert centaur/sv/cosims/cosims.cert centaur/sv/tutorial/alu.cert centaur/sv/tutorial/boothpipe.cert centaur/sv/tutorial/counter.cert centaur/sv/tutorial/sums.cert centaur/vl/kit/server.cert centaur/vl/kit/top.cert centaur/vl/loader/preprocessor/tests.cert centaur/vl/server/top.cert centaur/vl/top-doc.cert centaur/vl2014/kit/gather.cert centaur/vl2014/kit/json.cert centaur/vl2014/kit/lint.cert centaur/vl2014/kit/model.cert centaur/vl2014/kit/pp.cert centaur/vl2014/kit/progutils.cert centaur/vl2014/kit/server.cert centaur/vl2014/kit/shell.cert centaur/vl2014/kit/top.cert centaur/vl2014/server/file-layout.cert centaur/vl2014/server/server.cert centaur/vl2014/top-doc.cert doc/top-slow.cert doc/top.cert kestrel/hdwallet/top.cert kestrel/hdwallet/wallet-executable.cert kestrel/hdwallet/wallet-tests.cert kestrel/java/atj/implementation.cert kestrel/java/atj/input-processing.cert kestrel/java/atj/tests/abnf-deep-guarded.cert kestrel/java/atj/tests/abnf-deep-unguarded.cert kestrel/java/atj/tests/abnf-shallow-guarded.cert kestrel/java/atj/tests/abnf-shallow-unguarded.cert kestrel/java/atj/tests/abnf.cert kestrel/java/atj/tests/acl2-times.cert kestrel/java/atj/tests/factorial-deep-guarded.cert kestrel/java/atj/tests/factorial-deep-unguarded.cert kestrel/java/atj/tests/factorial-shallow-guarded.cert kestrel/java/atj/tests/factorial-shallow-unguarded.cert kestrel/java/atj/tests/factorial.cert kestrel/java/atj/tests/fibonacci-deep-guarded.cert kestrel/java/atj/tests/fibonacci-deep-unguarded.cert kestrel/java/atj/tests/fibonacci-shallow-guarded.cert kestrel/java/atj/tests/fibonacci-shallow-unguarded.cert kestrel/java/atj/tests/fibonacci.cert kestrel/java/atj/tests/multivalue-deep-guarded.cert kestrel/java/atj/tests/multivalue-deep-unguarded.cert kestrel/java/atj/tests/multivalue-shallow-guarded.cert kestrel/java/atj/tests/multivalue-shallow-unguarded.cert kestrel/java/atj/tests/multivalue.cert kestrel/java/atj/tests/natives-deep-guarded.cert kestrel/java/atj/tests/natives-deep-unguarded.cert kestrel/java/atj/tests/natives-shallow-guarded.cert kestrel/java/atj/tests/natives-shallow-unguarded.cert kestrel/java/atj/tests/natives.cert kestrel/java/atj/tests/primarrays-shallow-guarded.cert kestrel/java/atj/tests/primarrays.cert kestrel/java/atj/tests/primitives-deep-guarded.cert kestrel/java/atj/tests/primitives-deep-unguarded.cert kestrel/java/atj/tests/primitives-shallow-guarded.cert kestrel/java/atj/tests/primitives-shallow-unguarded.cert kestrel/java/atj/tests/primitives.cert kestrel/java/atj/top.cert kestrel/java/top.cert kestrel/top-doc.cert kestrel/top.cert oslib/copy.cert oslib/dirname.cert oslib/file-types.cert oslib/ls.cert oslib/mkdir.cert oslib/rmtree.cert oslib/tests/copy.cert oslib/tests/dirname.cert oslib/tests/file-types.cert oslib/tests/ls.cert oslib/tests/mkdir.cert oslib/tests/top.cert oslib/top.cert projects/doc.cert projects/include-doc.cert projects/rp-rewriter/lib/mult/demo.cert projects/rp-rewriter/lib/mult2/demo.cert projects/sidekick/eventdata.cert projects/sidekick/explore.cert projects/sidekick/lint.cert projects/sidekick/lock.cert projects/sidekick/lookup.cert projects/sidekick/server.cert projects/sidekick/session.cert projects/sidekick/top.cert projects/sidekick/webcommand.cert projects/smtlink/config.cert projects/smtlink/doc.cert projects/smtlink/examples/examples.cert projects/smtlink/examples/inverter.cert projects/smtlink/examples/ringosc.cert projects/smtlink/examples/util.cert projects/smtlink/top.cert projects/smtlink/trusted/prove.cert projects/smtlink/trusted/run.cert projects/smtlink/trusted/trusted-cp.cert projects/smtlink/trusted/write.cert projects/smtlink/trusted/z3-py/header.cert projects/smtlink/trusted/z3-py/recover-type-hyp.cert projects/smtlink/trusted/z3-py/translate-type.cert projects/smtlink/trusted/z3-py/translator.cert projects/smtlink/verified/Smtlink.cert projects/smtlink/verified/add-hypo-cp.cert projects/smtlink/verified/computed-hints.cert projects/smtlink/verified/expand-cp.cert projects/smtlink/verified/extractor.cert projects/smtlink/verified/hint-interface.cert projects/smtlink/verified/hint-please.cert projects/smtlink/verified/type-extract-cp.cert projects/smtlink/verified/type-hyp.cert projects/smtlink/verified/uninterpreted-fn-cp.cert projects/top-doc.cert quicklisp/base.cert quicklisp/bordeaux.cert quicklisp/bt-semaphore.cert quicklisp/cffi.cert quicklisp/cl-fad.cert quicklisp/fastnumio.cert quicklisp/html-template.cert quicklisp/hunchentoot.cert quicklisp/osicat.cert quicklisp/shellpool.cert quicklisp/top.cert quicklisp/uiop.cert system/doc/acl2-manual.cert tools/oracle-timelimit-tests.cert tools/oracle-timelimit.cert workshops/2017/swords/support/demos.cert workshops/2018/sumners/exa.cert workshops/2018/sumners/exbase.cert workshops/2018/sumners/exloop.cert workshops/2018/sumners/exsim.cert workshops/2018/sumners/extra.cert workshops/2018/sumners/readme.cert workshops/2018/sumners/svcnf.cert workshops/2020/kwan-peng-greenstreet/abstract-cs.cert workshops/2020/sswords-rewriter/support.cert workshops/2020/sumners/bake-models.cert workshops/2020/sumners/bake-proofs.cert workshops/2020/sumners/gen-models.cert workshops/2020/sumners/gl-fin-set.cert workshops/2020/sumners/gl-setup.cert workshops/2020/sumners/top.cert xdoc/all.cert xdoc/save-fancy.cert xdoc/save-rendered.cert xdoc/save.cert ] Using clean.pl to remove certificates, etc. /build/acl2-8.3dfsg/books/build/clean.pl clean.pl: scanning for generated files clean.pl: found 3 targets (0 seconds) clean.pl: deleted 3 files (0 seconds) Cleaning 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/acl2-8.3dfsg/books/projects/milawa/ACL2' Calculating cert dependencies... Calculating pcert dependencies... Done with dependencies. Cleaning ACL2 directory (certificates, ACL2 images, etc.) clean.pl: scanning for generated files clean.pl: found 1 targets (0 seconds) clean.pl: deleted 1 files (0 seconds) Cleaning ../Proofs directory. make[3]: Leaving directory '/build/acl2-8.3dfsg/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/acl2-8.3dfsg/books/build/Makefile-comp /build/acl2-8.3dfsg/books/build/Makefile-comp-pre /build/acl2-8.3dfsg/books/build/Makefile-deps /build/acl2-8.3dfsg/books/build/Makefile-books /build/acl2-8.3dfsg/books/build/Makefile-features /build/acl2-8.3dfsg/books/build/Makefile-cache serialize/test.sao bdd/benchmarks.lisp nonstd/workshops/1999/calculus/book/tree.lisp centaur/getopt/demo2.core centaur/getopt/demo2.gcl centaur/getopt/demo2.lw centaur/getopt/demo2.lx86cl64 centaur/getopt/demo2.dx86cl64 centaur/getopt/demo2.ccl nonstd/workshops/1999/calculus/book/outline/ projects/sat/lrat/incremental/lrat-check projects/sat/lrat/incremental/lrat-check.* projects/sat/lrat/cube/cube-check projects/sat/lrat/cube/cube-check.* projects/apply-model/ex1/evaluation-apply.lisp projects/apply-model/ex1/evaluation-user-defs.lisp projects/apply-model/ex2/evaluation-apply.lisp projects/apply-model/ex2/evaluation-user-defs.lisp projects/apply-model-2/ex1/evaluation-apply.lisp projects/apply-model-2/ex1/evaluation-user-defs.lisp projects/apply-model-2/ex2/evaluation-apply.lisp projects/apply-model-2/ex2/evaluation-user-defs.lisp for dir in system/toothbrush/ clause-processors/SULFA/ projects/translators/l3-to-acl2/ workshops/1999/multiplier/ workshops/2003/greve-wilding-vanfleet/support/ workshops/2003/kaufmann/support/input/ workshops/2004/sumners-ray/support/ projects/apply-model/ projects/apply-model-2/ \ workshops/2003/kaufmann/support/rtl ; \ do \ if [ -f $dir/Makefile ] ; then \ (cd $dir ; /usr/bin/make clean) ; \ fi ; \ done make[3]: Entering directory '/build/acl2-8.3dfsg/books/system/toothbrush' Updating dependencies in /build/acl2-8.3dfsg/books/system/toothbrush Note: For toothbrush, ACL2_DIR = /build/acl2-8.3dfsg/. cd tests ; /usr/bin/make clean make[4]: Entering directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests' make[5]: Entering directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests/test1' Updating dependencies in /build/acl2-8.3dfsg/books/system/toothbrush/tests/test1 rm -f output.lsp success.txt tb-exec* rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[5]: Leaving directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests/test1' make[5]: Entering directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests/test2' Updating dependencies in /build/acl2-8.3dfsg/books/system/toothbrush/tests/test2 rm -f output.lsp success.txt tb-exec* rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[5]: Leaving directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests/test2' make[5]: Entering directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests/test-par' Updating dependencies in /build/acl2-8.3dfsg/books/system/toothbrush/tests/test-par rm -f output.lsp success.txt tb-exec* rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[5]: Leaving directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests/test-par' make[5]: Entering directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests/dag-unification' Updating dependencies in /build/acl2-8.3dfsg/books/system/toothbrush/tests/dag-unification rm -f output.lsp success.txt tb-exec* rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[5]: Leaving directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests/dag-unification' make[4]: Leaving directory '/build/acl2-8.3dfsg/books/system/toothbrush/tests' rm -f defined-syms.lsp rm -f success.txt rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/system/toothbrush' make[3]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA' rm -f \#*\# *~ rm -f scripts/interpret_sulfa_file /usr/bin/make PERL=perl SAT_SOLVER=/build/acl2-8.3dfsg/books/clause-processors/SULFA/../../../aux/minisat2//minisat/core/minisat SAT_SOLVER_TYPE=minisat CC=gcc clean-subdirs make[4]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA' for dir in scripts c-files books; do \ /usr/bin/make PERL=perl SAT_SOLVER=/build/acl2-8.3dfsg/books/clause-processors/SULFA/../../../aux/minisat2//minisat/core/minisat SAT_SOLVER_TYPE=minisat CC=gcc clean -C $dir; \ done make[5]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/scripts' rm -f sexpr-sat-solver *~ \#*\# rm -f *acl2_with_smt* temp_command_file.lisp rm -fr sat-temp-files rm -fr sulfa_smt_temp rm -f sulfa-smt rm -f interpret_sulfa_file make[5]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/scripts' make[5]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/c-files' rm -f sat-input-formater smt-prep zchaff-output-formater minisat-output-formater *~ #*# make[5]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/c-files' make[5]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books' make[6]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books/sat' rm -f \#*\# *.cert *~ *.sexpr *.d *.sot sulfa-dir-const.lisp sat-setup.data rm -f -r sat-temp-files rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[6]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books/sat' make[6]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books/clause-processors' Updating dependencies in /build/acl2-8.3dfsg/books/clause-processors/SULFA/books/clause-processors rm -f *.cert *~ *.sexpr *.d *.sot *~ \#*\# rm -f -r sat-temp-files rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[6]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books/clause-processors' make[6]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books/sat-tests' rm -f *.cert *~ *.sexpr *.d *.sot rm -f -r sat-temp-files rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[6]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books/sat-tests' make[6]: Entering directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books/bv-smt-solver' Updating dependencies in /build/acl2-8.3dfsg/books/clause-processors/SULFA/books/bv-smt-solver rm -f *.cert *~ *.sexpr *.d *.sot *~ \#*\# *.smt *.prepped rm -fr sat-temp-files rm -f *.bak rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[6]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books/bv-smt-solver' make[5]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA/books' make[4]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA' make[3]: Leaving directory '/build/acl2-8.3dfsg/books/clause-processors/SULFA' make[3]: Entering directory '/build/acl2-8.3dfsg/books/projects/translators/l3-to-acl2' Makefile:22: ACL2_DIR is /build/acl2-8.3dfsg make[4]: Entering directory '/build/acl2-8.3dfsg/books/projects/translators/l3-to-acl2/translator' Updating dependencies in /build/acl2-8.3dfsg/books/projects/translators/l3-to-acl2/translator rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[4]: Leaving directory '/build/acl2-8.3dfsg/books/projects/translators/l3-to-acl2/translator' make[4]: Entering directory '/build/acl2-8.3dfsg/books/projects/translators/l3-to-acl2/examples/thacker' Makefile:35: L3_TO_ACL2_DIR is /build/acl2-8.3dfsg/books/projects/translators/l3-to-acl2/translator rm -f tiny.lisp tiny-logic.lisp run-check.txt rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[4]: Leaving directory '/build/acl2-8.3dfsg/books/projects/translators/l3-to-acl2/examples/thacker' rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/projects/translators/l3-to-acl2' make[3]: Entering directory '/build/acl2-8.3dfsg/books/workshops/1999/multiplier' rm -f fmul.lisp fmul-star.lisp rm -f *.tem rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/workshops/1999/multiplier' make[3]: Entering directory '/build/acl2-8.3dfsg/books/workshops/2003/greve-wilding-vanfleet/support' rm -f consistency-test.lisp make.lisp consistency-test-passed.lisp rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/workshops/2003/greve-wilding-vanfleet/support' make[3]: Entering directory '/build/acl2-8.3dfsg/books/workshops/2003/kaufmann/support/input' rm -f defs-out.lisp defs-eq.lisp lemmas-out.lisp check.txt rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/workshops/2003/kaufmann/support/input' make[3]: Entering directory '/build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support' Updating dependencies in /build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support rm -f *.rpt rm -f success.txt rm -f run.date run.log run.err rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support' make[3]: Entering directory '/build/acl2-8.3dfsg/books/projects/apply-model' cd ex1 ; /usr/bin/make clean make[4]: Entering directory '/build/acl2-8.3dfsg/books/projects/apply-model/ex1' System books directory is /build/acl2-8.3dfsg/books rm -f evaluation-apply.lisp evaluation-user-defs.lisp Makefile-deps rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[4]: Leaving directory '/build/acl2-8.3dfsg/books/projects/apply-model/ex1' cd ex2 ; /usr/bin/make clean make[4]: Entering directory '/build/acl2-8.3dfsg/books/projects/apply-model/ex2' System books directory is /build/acl2-8.3dfsg/books rm -f evaluation-apply.lisp evaluation-user-defs.lisp Makefile-deps rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[4]: Leaving directory '/build/acl2-8.3dfsg/books/projects/apply-model/ex2' rm -f Makefile-tmp rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/projects/apply-model' make[3]: Entering directory '/build/acl2-8.3dfsg/books/projects/apply-model-2' cd ex1 ; /usr/bin/make clean make[4]: Entering directory '/build/acl2-8.3dfsg/books/projects/apply-model-2/ex1' System books directory is /build/acl2-8.3dfsg/books rm -f evaluation-apply.lisp evaluation-user-defs.lisp Makefile-deps rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[4]: Leaving directory '/build/acl2-8.3dfsg/books/projects/apply-model-2/ex1' cd ex2 ; /usr/bin/make clean make[4]: Entering directory '/build/acl2-8.3dfsg/books/projects/apply-model-2/ex2' System books directory is /build/acl2-8.3dfsg/books rm -f evaluation-apply.lisp evaluation-user-defs.lisp Makefile-deps rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[4]: Leaving directory '/build/acl2-8.3dfsg/books/projects/apply-model-2/ex2' rm -f Makefile-tmp rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/projects/apply-model-2' make[3]: Entering directory '/build/acl2-8.3dfsg/books/workshops/2003/kaufmann/support/rtl' rm -f model.lisp model-defs.lisp model-eq.lisp model.lisp bvecp.lisp rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \ *.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \ *.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \ *.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \ *.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp make[3]: Leaving directory '/build/acl2-8.3dfsg/books/workshops/2003/kaufmann/support/rtl' Removing even more generated files (documentation, etc). rm -rf doc/manual system/doc/manual system/doc/manual-fast doc/xdoc.sao make[2]: Leaving directory '/build/acl2-8.3dfsg/books' /usr/bin/make -k ACL2=/build/acl2-8.3dfsg/saved_acl2 regression make[2]: Entering directory '/build/acl2-8.3dfsg' ACL2_WD is /build/acl2-8.3dfsg ACL2 is /build/acl2-8.3dfsg/saved_acl2 uname -a Linux codethink11-arm64 4.15.0-154-generic #161-Ubuntu SMP Fri Jul 30 13:01:15 UTC 2021 aarch64 GNU/Linux cd books ; /usr/bin/make -k all ACL2=/build/acl2-8.3dfsg/saved_acl2 make[3]: Entering directory '/build/acl2-8.3dfsg/books' ACL2_SYSTEM_BOOKS is /build/acl2-8.3dfsg/books Determining ACL2 features (for ACL2 = /build/acl2-8.3dfsg/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 ACL2_HAS_HONS := 1 ACL2_HAS_ANSI := 1 ACL2_HAS_PARALLEL := ACL2_HAS_REALS := ACL2_COMP_EXT := o ACL2_HOST_LISP := GCL OS_HAS_ABC := OS_HAS_GLUCOSE := OS_HAS_IPASIR := OS_HAS_SMTLINK := USE_QUICKLISP := 0 Done with features. Scanning for books... real 0m0.131s user 0m0.055s sys 0m0.066s Scanning for dependencies... real 2m50.244s user 2m48.365s sys 0m1.773s Done scanning. Reading book deps Makefile-deps created on Fri Sep 23 15:13:54 -12 2022 Excluding books that are CCL-only: [] Excluding non-GCL books: [acl2s/acl2s-sigs.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/mode-acl2s-dependencies.cert acl2s/properties.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-slow.cert doc/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 ] Excluding books that need ABC: [centaur/glmc/counter.cert centaur/glmc/glmc-test.cert ] Excluding books that need Glucose: [centaur/aig/aig-sat-tests.cert centaur/esim/tests/add.cert centaur/esim/tests/common.cert centaur/esim/tests/divide.cert centaur/esim/tests/idiv.cert centaur/esim/tests/multiply.cert centaur/esim/tests/regs.cert centaur/esim/tests/subtract.cert centaur/esim/tutorial/boothmul.cert centaur/fgl/tests.cert centaur/glmc/counter.cert centaur/glmc/glmc-test.cert centaur/sv/tutorial/alu.cert centaur/sv/tutorial/boothpipe.cert centaur/sv/tutorial/counter.cert centaur/sv/tutorial/sums.cert workshops/2017/swords/support/demos.cert ] Excluding books that need Ipasir: [centaur/fgl/tests.cert centaur/ipasir/ipasir-backend-extra.cert centaur/ipasir/ipasir-backend.cert centaur/ipasir/ipasir-tests.cert centaur/ipasir/soundness-bug-fixed.cert centaur/ipasir/soundness-bug2-fixed.cert centaur/sv/tutorial/sums.cert workshops/2020/sumners/bake-models.cert workshops/2020/sumners/bake-proofs.cert workshops/2020/sumners/gen-models.cert workshops/2020/sumners/gl-fin-set.cert workshops/2020/sumners/top.cert ] Excluding books that need SMTLINK: [projects/smtlink/doc.cert projects/smtlink/examples/examples.cert projects/smtlink/examples/ringosc.cert ] Excluding ACL2(r)-only books: [nonstd/fft/fft-trig-with-axioms.cert nonstd/fft/fft-trig.cert nonstd/integrals/continuous-function.cert nonstd/integrals/equivalence-continuous-function.cert nonstd/integrals/equivalence-ftc.cert nonstd/integrals/equivalence-integrals.cert nonstd/integrals/ftc-1.cert nonstd/integrals/ftc-2.cert nonstd/integrals/integrable-functions.cert nonstd/integrals/integral-of-polynomials.cert nonstd/integrals/integration-composition-equivalences.cert nonstd/integrals/integration-composition.cert nonstd/integrals/make-partition.cert nonstd/integrals/split-integral-by-subintervals.cert nonstd/nsa/alternating-series.cert nonstd/nsa/chain-rule.cert nonstd/nsa/complex-polar.cert nonstd/nsa/continuity-product.cert nonstd/nsa/continuity.cert nonstd/nsa/derivative-raise.cert nonstd/nsa/derivatives-composition.cert nonstd/nsa/derivatives.cert nonstd/nsa/equivalence-continuity.cert nonstd/nsa/equivalence-derivatives-composition.cert nonstd/nsa/equivalence-derivatives.cert nonstd/nsa/equivalence-limits.cert nonstd/nsa/exp-continuous.cert nonstd/nsa/exp-sum.cert nonstd/nsa/exp.cert nonstd/nsa/factorial.cert nonstd/nsa/intervals.cert nonstd/nsa/inverse-derivatives.cert nonstd/nsa/inverse-monotone.cert nonstd/nsa/inverse-square.cert nonstd/nsa/inverse-trig.cert nonstd/nsa/inverses.cert nonstd/nsa/ln.cert nonstd/nsa/next-integer.cert nonstd/nsa/norm.cert nonstd/nsa/nsa.cert nonstd/nsa/overspill-proof.cert nonstd/nsa/overspill-test.cert nonstd/nsa/overspill.cert nonstd/nsa/raise.cert nonstd/nsa/sine.cert nonstd/nsa/sqrt.cert nonstd/nsa/trig-approx.cert nonstd/nsa/trig.cert nonstd/polynomials/polynomial-calculus.cert nonstd/polynomials/polynomial-defuns.cert nonstd/polynomials/polynomial-lemmas.cert nonstd/sqrt/no-sqrt.cert nonstd/transcendentals/nested-intervals-revised.cert nonstd/transcendentals/nested-intervals.cert nonstd/transcendentals/reals-are-uncountable-1.cert nonstd/transcendentals/reals-are-uncountable-2.cert nonstd/workshops/1999/analysis/continuity.cert nonstd/workshops/1999/analysis/derivatives.cert nonstd/workshops/1999/analysis/exercise1.cert nonstd/workshops/1999/analysis/exercise2.cert nonstd/workshops/1999/analysis/exercise3.cert nonstd/workshops/1999/analysis/exercise4.cert nonstd/workshops/1999/analysis/exercise5.cert nonstd/workshops/1999/analysis/exercise6.cert nonstd/workshops/1999/analysis/exercise7.cert nonstd/workshops/1999/analysis/exercise8.cert nonstd/workshops/1999/calculus/book/between-i-close-implies-i-close.cert nonstd/workshops/1999/calculus/book/between-limited-implies-limited.cert nonstd/workshops/1999/calculus/book/defaxioms.cert nonstd/workshops/1999/calculus/book/equal-riemann-rcfn-refinement-reduction.cert nonstd/workshops/1999/calculus/book/ftoc-lemma.cert nonstd/workshops/1999/calculus/book/fundamental-theorem-of-calculus.cert nonstd/workshops/1999/calculus/book/i-close-implies-abs-difference-small.cert nonstd/workshops/1999/calculus/book/i-limited-rcfn.cert nonstd/workshops/1999/calculus/book/i-small-maxlist-abslist-difflist-maps.cert nonstd/workshops/1999/calculus/book/integral-rcfn-equal-if-i-close.cert nonstd/workshops/1999/calculus/book/integral-rcfn-lemmas.cert nonstd/workshops/1999/calculus/book/integral-rcfn-quotient-between-non-classical.cert nonstd/workshops/1999/calculus/book/integral-rcfn.cert nonstd/workshops/1999/calculus/book/make-partition.cert nonstd/workshops/1999/calculus/book/map-rcfn-close-to-map-rcfn-refinement.cert nonstd/workshops/1999/calculus/book/map-rcfn-refinement-cdr-co-member.cert nonstd/workshops/1999/calculus/book/max-and-min-attained.cert nonstd/workshops/1999/calculus/book/max-x-between.cert nonstd/workshops/1999/calculus/book/maxlist-abslist-difflist-maps-lt.cert nonstd/workshops/1999/calculus/book/min-max-x-rec-lemmas.cert nonstd/workshops/1999/calculus/book/min-x-and-max-x-lemmas.cert nonstd/workshops/1999/calculus/book/min-x-between.cert nonstd/workshops/1999/calculus/book/next-gte-close.cert nonstd/workshops/1999/calculus/book/nsa-lemmas.cert nonstd/workshops/1999/calculus/book/nsa.cert nonstd/workshops/1999/calculus/book/partitions-give-i-close-riemann-sum.cert nonstd/workshops/1999/calculus/book/proof-outline.cert nonstd/workshops/1999/calculus/book/rcfn-next-gte-close.cert nonstd/workshops/1999/calculus/book/rcfn-standard-part.cert nonstd/workshops/1999/calculus/book/refinement-makes-i-small-change-1.cert nonstd/workshops/1999/calculus/book/refinement-makes-i-small-change.cert nonstd/workshops/1999/calculus/book/riemann-bound.cert nonstd/workshops/1999/calculus/book/riemann-defuns.cert nonstd/workshops/1999/calculus/book/riemann-lemmas.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-between.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-lower-bound.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-refinement-is-riemann-rcfn.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-upper-bound.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral-1.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral-2.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral.cert nonstd/workshops/1999/calculus/book/riemann.cert nonstd/workshops/1999/calculus/book/split-integral-by-subintervals.cert nonstd/workshops/1999/calculus/book/standard-part-equal-if-i-close.cert nonstd/workshops/1999/calculus/book/standard-part-preserves-between.cert nonstd/workshops/1999/calculus/book/standard-part-riemann-rcfn-is-standard.cert nonstd/workshops/1999/calculus/book/two-times-r-is-not-less-than-standard-part.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/abs-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/chain-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/composition-elem.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/differentiator.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/exp-minimal.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/exp-properties.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-square.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-trig-derivatives.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-trig-ex.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/ln-derivative-real.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/nsa-ex.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/product-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sin-cos-minimal.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sqrt-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sum-composition.cert nonstd/workshops/2013/helms-gamboa-quantum/support/quantum.cert projects/hybrid-systems/abs.cert projects/hybrid-systems/arith-nsa4.cert projects/hybrid-systems/computed-hints.cert projects/hybrid-systems/eexp.cert projects/hybrid-systems/example.cert projects/hybrid-systems/nsa.cert projects/hybrid-systems/o-real-p.cert projects/hybrid-systems/phi-exists.cert projects/hybrid-systems/phi-properties.cert projects/hybrid-systems/phi-unique.cert projects/hybrid-systems/tm-floor.cert workshops/2015/chau-kaufmann-hunt/support/cosines-orthog.cert workshops/2015/chau-kaufmann-hunt/support/fourier-coefficients-2.cert workshops/2015/chau-kaufmann-hunt/support/fourier-coefficients.cert workshops/2015/chau-kaufmann-hunt/support/fourier-inner-product.cert workshops/2015/chau-kaufmann-hunt/support/fourier-sums.cert workshops/2015/chau-kaufmann-hunt/support/int-infinite-sum-1.cert workshops/2015/chau-kaufmann-hunt/support/int-infinite-sum-2.cert workshops/2015/chau-kaufmann-hunt/support/int-sum.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/continuity-2.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/continuous-function-2.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/ftc-1-2.cert workshops/2015/chau-kaufmann-hunt/support/sine-cosine-orthog.cert workshops/2015/chau-kaufmann-hunt/support/sines-orthog.cert workshops/2015/chau-kaufmann-hunt/support/utils.cert workshops/2018/gamboa-cowles/complex-continuity.cert workshops/2018/gamboa-cowles/complex-lemmas.cert workshops/2018/gamboa-cowles/complex-polynomials.cert workshops/2018/gamboa-cowles/de-moivre.cert workshops/2018/gamboa-cowles/norm2.cert workshops/2018/kwan-greenstreet/cauchy-schwarz.cert workshops/2018/kwan-greenstreet/continuity.cert workshops/2018/kwan-greenstreet/convex.cert workshops/2018/kwan-greenstreet/ftc-2.cert workshops/2018/kwan-greenstreet/metric.cert workshops/2018/kwan-greenstreet/nesterov-1.cert workshops/2018/kwan-greenstreet/nesterov-2.cert workshops/2018/kwan-greenstreet/nesterov-3.cert workshops/2018/kwan-greenstreet/nesterov-4.cert workshops/2018/kwan-greenstreet/nesterov-top.cert workshops/2018/kwan-greenstreet/norm.cert workshops/2018/kwan-greenstreet/top.cert workshops/2018/kwan-greenstreet/vectors.cert workshops/2020/gamboa-cowles-gamboa/floor1-non-R.cert workshops/2020/gamboa-cowles-gamboa/norm-1C.cert workshops/2020/gamboa-cowles-gamboa/number-field.cert workshops/2020/gamboa-cowles-gamboa/polylist.cert workshops/2020/gamboa-cowles-gamboa/prior/raise-to.cert workshops/2020/kwan-peng-greenstreet/abstract-cs.cert ] Excluding books that depend on Quicklisp: [acl2s/cgen/fixers-gl-backend.cert centaur/4v-sexpr/sexpr-purebool-p.cert centaur/4v-sexpr/top.cert centaur/aig/aig-sat-tests.cert centaur/aig/aig-sat.cert centaur/aig/faig-purebool-p.cert centaur/aig/top-doc.cert centaur/aig/top.cert centaur/aignet/abc-wrappers.cert centaur/aignet/abc.cert centaur/aignet/cube-sat.cert centaur/aignet/top-doc.cert centaur/aignet/top.cert centaur/aignet/transforms.cert centaur/esim/stv/stv-debug.cert centaur/esim/stv/stv2c/top.cert centaur/esim/tests/add.cert centaur/esim/tests/common.cert centaur/esim/tests/divide.cert centaur/esim/tests/idiv.cert centaur/esim/tests/multiply.cert centaur/esim/tests/regs.cert centaur/esim/tests/subtract.cert centaur/esim/top-doc.cert centaur/esim/tutorial/alu16-book.cert centaur/esim/tutorial/boothmul.cert centaur/esim/tutorial/counter.cert centaur/esim/tutorial/intro.cert centaur/esim/vcd/vcd-impl.cert centaur/esim/vcd/vcd.cert centaur/fgl/equivcheck.cert centaur/fgl/sat-default.cert centaur/fgl/satlink-sat.cert centaur/fgl/tests.cert centaur/fgl/top-bare.cert centaur/fgl/top-doc.cert centaur/fgl/top.cert centaur/gl/bfr-fraig-satlink.cert centaur/gl/bfr-satlink.cert centaur/gl/gl-ttags.cert centaur/gl/top-doc.cert centaur/glmc/bfr-mcheck-abc.cert centaur/glmc/counter.cert centaur/glmc/glmc-test.cert centaur/ipasir/ipasir-backend-extra.cert centaur/ipasir/ipasir-backend.cert centaur/ipasir/ipasir-tests.cert centaur/ipasir/soundness-bug-fixed.cert centaur/ipasir/soundness-bug2-fixed.cert centaur/misc/sharedlibtest/app.cert centaur/misc/tshell-tests.cert centaur/misc/tshell.cert centaur/quicklisp/base.cert centaur/quicklisp/bordeaux.cert centaur/quicklisp/bt-semaphore.cert centaur/quicklisp/cffi.cert centaur/quicklisp/cl-fad.cert centaur/quicklisp/fastnumio.cert centaur/quicklisp/html-template.cert centaur/quicklisp/hunchentoot.cert centaur/quicklisp/osicat.cert centaur/quicklisp/shellpool.cert centaur/quicklisp/top.cert centaur/quicklisp/uiop.cert centaur/satlink/benchmarks.cert centaur/satlink/check-config.cert centaur/satlink/top.cert centaur/sv/cosims/cosims.cert centaur/sv/tutorial/alu.cert centaur/sv/tutorial/boothpipe.cert centaur/sv/tutorial/counter.cert centaur/sv/tutorial/sums.cert centaur/vl/kit/server.cert centaur/vl/kit/top.cert centaur/vl/loader/preprocessor/tests.cert centaur/vl/server/top.cert centaur/vl/top-doc.cert centaur/vl2014/kit/gather.cert centaur/vl2014/kit/json.cert centaur/vl2014/kit/lint.cert centaur/vl2014/kit/model.cert centaur/vl2014/kit/pp.cert centaur/vl2014/kit/progutils.cert centaur/vl2014/kit/server.cert centaur/vl2014/kit/shell.cert centaur/vl2014/kit/top.cert centaur/vl2014/server/file-layout.cert centaur/vl2014/server/server.cert centaur/vl2014/top-doc.cert doc/top-slow.cert doc/top.cert kestrel/hdwallet/top.cert kestrel/hdwallet/wallet-executable.cert kestrel/hdwallet/wallet-tests.cert kestrel/java/atj/implementation.cert kestrel/java/atj/input-processing.cert kestrel/java/atj/tests/abnf-deep-guarded.cert kestrel/java/atj/tests/abnf-deep-unguarded.cert kestrel/java/atj/tests/abnf-shallow-guarded.cert kestrel/java/atj/tests/abnf-shallow-unguarded.cert kestrel/java/atj/tests/abnf.cert kestrel/java/atj/tests/acl2-times.cert kestrel/java/atj/tests/factorial-deep-guarded.cert kestrel/java/atj/tests/factorial-deep-unguarded.cert kestrel/java/atj/tests/factorial-shallow-guarded.cert kestrel/java/atj/tests/factorial-shallow-unguarded.cert kestrel/java/atj/tests/factorial.cert kestrel/java/atj/tests/fibonacci-deep-guarded.cert kestrel/java/atj/tests/fibonacci-deep-unguarded.cert kestrel/java/atj/tests/fibonacci-shallow-guarded.cert kestrel/java/atj/tests/fibonacci-shallow-unguarded.cert kestrel/java/atj/tests/fibonacci.cert kestrel/java/atj/tests/multivalue-deep-guarded.cert kestrel/java/atj/tests/multivalue-deep-unguarded.cert kestrel/java/atj/tests/multivalue-shallow-guarded.cert kestrel/java/atj/tests/multivalue-shallow-unguarded.cert kestrel/java/atj/tests/multivalue.cert kestrel/java/atj/tests/natives-deep-guarded.cert kestrel/java/atj/tests/natives-deep-unguarded.cert kestrel/java/atj/tests/natives-shallow-guarded.cert kestrel/java/atj/tests/natives-shallow-unguarded.cert kestrel/java/atj/tests/natives.cert kestrel/java/atj/tests/primarrays-shallow-guarded.cert kestrel/java/atj/tests/primarrays.cert kestrel/java/atj/tests/primitives-deep-guarded.cert kestrel/java/atj/tests/primitives-deep-unguarded.cert kestrel/java/atj/tests/primitives-shallow-guarded.cert kestrel/java/atj/tests/primitives-shallow-unguarded.cert kestrel/java/atj/tests/primitives.cert kestrel/java/atj/top.cert kestrel/java/top.cert kestrel/top-doc.cert kestrel/top.cert oslib/copy.cert oslib/dirname.cert oslib/file-types.cert oslib/ls.cert oslib/mkdir.cert oslib/rmtree.cert oslib/tests/copy.cert oslib/tests/dirname.cert oslib/tests/file-types.cert oslib/tests/ls.cert oslib/tests/mkdir.cert oslib/tests/top.cert oslib/top.cert projects/doc.cert projects/include-doc.cert projects/rp-rewriter/lib/mult/demo.cert projects/rp-rewriter/lib/mult2/demo.cert projects/sidekick/eventdata.cert projects/sidekick/explore.cert projects/sidekick/lint.cert projects/sidekick/lock.cert projects/sidekick/lookup.cert projects/sidekick/server.cert projects/sidekick/session.cert projects/sidekick/top.cert projects/sidekick/webcommand.cert projects/smtlink/config.cert projects/smtlink/doc.cert projects/smtlink/examples/examples.cert projects/smtlink/examples/inverter.cert projects/smtlink/examples/ringosc.cert projects/smtlink/examples/util.cert projects/smtlink/top.cert projects/smtlink/trusted/prove.cert projects/smtlink/trusted/run.cert projects/smtlink/trusted/trusted-cp.cert projects/smtlink/trusted/write.cert projects/smtlink/trusted/z3-py/header.cert projects/smtlink/trusted/z3-py/recover-type-hyp.cert projects/smtlink/trusted/z3-py/translate-type.cert projects/smtlink/trusted/z3-py/translator.cert projects/smtlink/verified/Smtlink.cert projects/smtlink/verified/add-hypo-cp.cert projects/smtlink/verified/computed-hints.cert projects/smtlink/verified/expand-cp.cert projects/smtlink/verified/extractor.cert projects/smtlink/verified/hint-interface.cert projects/smtlink/verified/hint-please.cert projects/smtlink/verified/type-extract-cp.cert projects/smtlink/verified/type-hyp.cert projects/smtlink/verified/uninterpreted-fn-cp.cert projects/top-doc.cert quicklisp/base.cert quicklisp/bordeaux.cert quicklisp/bt-semaphore.cert quicklisp/cffi.cert quicklisp/cl-fad.cert quicklisp/fastnumio.cert quicklisp/html-template.cert quicklisp/hunchentoot.cert quicklisp/osicat.cert quicklisp/shellpool.cert quicklisp/top.cert quicklisp/uiop.cert system/doc/acl2-manual.cert tools/oracle-timelimit-tests.cert tools/oracle-timelimit.cert workshops/2017/swords/support/demos.cert workshops/2018/sumners/exa.cert workshops/2018/sumners/exbase.cert workshops/2018/sumners/exloop.cert workshops/2018/sumners/exsim.cert workshops/2018/sumners/extra.cert workshops/2018/sumners/readme.cert workshops/2018/sumners/svcnf.cert workshops/2020/kwan-peng-greenstreet/abstract-cs.cert workshops/2020/sswords-rewriter/support.cert workshops/2020/sumners/bake-models.cert workshops/2020/sumners/bake-proofs.cert workshops/2020/sumners/gen-models.cert workshops/2020/sumners/gl-fin-set.cert workshops/2020/sumners/gl-setup.cert workshops/2020/sumners/top.cert xdoc/all.cert xdoc/save-fancy.cert xdoc/save-rendered.cert xdoc/save.cert ] Note: Skipping system/toothbrush/success.txt for host Lisp GCL. Making /build/acl2-8.3dfsg/books/std/portcullis.cert on 23-Sep-2022 15:13:55 Built /build/acl2-8.3dfsg/books/std/portcullis.cert (2.177s) Making /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/mini-theories.cert on 23-Sep-2022 15:13:57 Built /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/mini-theories.cert (1.958s) Making /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/banner.cert on 23-Sep-2022 15:13:59 Built /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/banner.cert (1.809s) Making /build/acl2-8.3dfsg/books/cowles/portcullis.cert on 23-Sep-2022 15:14:01 Built /build/acl2-8.3dfsg/books/cowles/portcullis.cert (2.194s) Making /build/acl2-8.3dfsg/books/data-structures/portcullis.cert on 23-Sep-2022 15:14:03 Built /build/acl2-8.3dfsg/books/data-structures/portcullis.cert (1.874s) Making /build/acl2-8.3dfsg/books/centaur/bitops/portcullis.cert on 23-Sep-2022 15:14:05 Built /build/acl2-8.3dfsg/books/centaur/bitops/portcullis.cert (2.143s) Making /build/acl2-8.3dfsg/books/tools/mv-nth.cert on 23-Sep-2022 15:14:08 Built /build/acl2-8.3dfsg/books/tools/mv-nth.cert (3.076s) Making /build/acl2-8.3dfsg/books/data-structures/set-defuns.cert on 23-Sep-2022 15:14:11 Built /build/acl2-8.3dfsg/books/data-structures/set-defuns.cert (2.389s) Making /build/acl2-8.3dfsg/books/ordinals/ordinal-definitions.cert on 23-Sep-2022 15:14:14 Built /build/acl2-8.3dfsg/books/ordinals/ordinal-definitions.cert (8.328s) Making /build/acl2-8.3dfsg/books/meta/term-defuns.cert on 23-Sep-2022 15:14:22 Built /build/acl2-8.3dfsg/books/meta/term-defuns.cert (3.202s) Making /build/acl2-8.3dfsg/books/meta/pseudo-termp-lemmas.cert on 23-Sep-2022 15:14:25 Built /build/acl2-8.3dfsg/books/meta/pseudo-termp-lemmas.cert (2.213s) Making /build/acl2-8.3dfsg/books/rtl/rel4/arithmetic/ground-zero.cert on 23-Sep-2022 15:14:28 Built /build/acl2-8.3dfsg/books/rtl/rel4/arithmetic/ground-zero.cert (1.783s) Making /build/acl2-8.3dfsg/books/rtl/rel4/support/util.cert on 23-Sep-2022 15:14:30 Built /build/acl2-8.3dfsg/books/rtl/rel4/support/util.cert (2.476s) Making /build/acl2-8.3dfsg/books/rtl/rel4/support/cat-def.cert on 23-Sep-2022 15:14:32 Built /build/acl2-8.3dfsg/books/rtl/rel4/support/cat-def.cert (3.050s) Making /build/acl2-8.3dfsg/books/rtl/rel4/arithmetic/negative-syntaxp.cert on 23-Sep-2022 15:14:35 Built /build/acl2-8.3dfsg/books/rtl/rel4/arithmetic/negative-syntaxp.cert (2.188s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/default-hint.cert on 23-Sep-2022 15:14:38 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/default-hint.cert (1.952s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/building-blocks.cert on 23-Sep-2022 15:14:40 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/building-blocks.cert (3.683s) Making /build/acl2-8.3dfsg/books/arithmetic-3/pass1/basic-arithmetic-helper.cert on 23-Sep-2022 15:14:44 Built /build/acl2-8.3dfsg/books/arithmetic-3/pass1/basic-arithmetic-helper.cert (1.847s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/banner.cert on 23-Sep-2022 15:14:46 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/banner.cert (1.781s) Making /build/acl2-8.3dfsg/books/rtl/rel4/arithmetic/inverted-factor.cert on 23-Sep-2022 15:14:48 Built /build/acl2-8.3dfsg/books/rtl/rel4/arithmetic/inverted-factor.cert (3.127s) Making /build/acl2-8.3dfsg/books/rtl/rel4/arithmetic/predicate.cert on 23-Sep-2022 15:14:51 Built /build/acl2-8.3dfsg/books/rtl/rel4/arithmetic/predicate.cert (1.875s) Making /build/acl2-8.3dfsg/books/rtl/rel4/support/rewrite-theory.cert on 23-Sep-2022 15:14:53 Built /build/acl2-8.3dfsg/books/rtl/rel4/support/rewrite-theory.cert (2.029s) Making /build/acl2-8.3dfsg/books/rtl/rel4/support/logs.cert on 23-Sep-2022 15:14:55 Built /build/acl2-8.3dfsg/books/rtl/rel4/support/logs.cert (3.640s) Making /build/acl2-8.3dfsg/books/rtl/rel4/support/all-ones.cert on 23-Sep-2022 15:14:59 Built /build/acl2-8.3dfsg/books/rtl/rel4/support/all-ones.cert (1.952s) Making /build/acl2-8.3dfsg/books/rtl/rel4/support/logior1-proofs.cert on 23-Sep-2022 15:15:01 Built /build/acl2-8.3dfsg/books/rtl/rel4/support/logior1-proofs.cert (1.946s) Making /build/acl2-8.3dfsg/books/rtl/rel4/support/rom-helpers.cert on 23-Sep-2022 15:15:03 Built /build/acl2-8.3dfsg/books/rtl/rel4/support/rom-helpers.cert (2.435s) Making /build/acl2-8.3dfsg/books/rtl/rel4/support/openers.cert on 23-Sep-2022 15:15:06 Built /build/acl2-8.3dfsg/books/rtl/rel4/support/openers.cert (2.295s) Making /build/acl2-8.3dfsg/books/rtl/rel4/support/package-defs.cert on 23-Sep-2022 15:15:08 Built /build/acl2-8.3dfsg/books/rtl/rel4/support/package-defs.cert (1.714s) Making /build/acl2-8.3dfsg/books/rtl/rel4/lib/util.cert on 23-Sep-2022 15:15:10 Built /build/acl2-8.3dfsg/books/rtl/rel4/lib/util.cert (2.551s) cd workshops/2004/sumners-ray/support ; /bin/bash -c "/usr/bin/make" make[4]: Entering directory '/build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support' Updating dependencies in /build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support Using ACL2=/build/acl2-8.3dfsg/saved_acl2 make[5]: Entering directory '/build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support' Making /build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support/basis.cert on Fri Sep 23 15:15:13 -12 2022 -rw-r--r-- 1 pbuilder1 pbuilder1 10515 Sep 23 15:15 basis.cert Making /build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support/total-order.cert on Fri Sep 23 15:15:18 -12 2022 -rw-r--r-- 1 pbuilder1 pbuilder1 1195 Sep 23 15:15 total-order.cert Making /build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support/crit.cert on Fri Sep 23 15:15:19 -12 2022 -rw-r--r-- 1 pbuilder1 pbuilder1 7079 Sep 23 15:15 crit.cert Making /build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support/sets.cert on Fri Sep 23 15:15:23 -12 2022 -rw-r--r-- 1 pbuilder1 pbuilder1 12493 Sep 23 15:15 sets.cert Making /build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support/records.cert on Fri Sep 23 15:15:46 -12 2022 -rw-r--r-- 1 pbuilder1 pbuilder1 9850 Sep 23 15:16 records.cert Making /build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support/mesi.cert on Fri Sep 23 15:16:47 -12 2022 -rw-r--r-- 1 pbuilder1 pbuilder1 15113 Sep 23 15:16 mesi.cert Making /build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support/success.txt on Fri Sep 23 15:16:51 -12 2022 -rw-r--r-- 1 pbuilder1 pbuilder1 49 Sep 23 15:18 success.txt make[5]: Leaving directory '/build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support' make[4]: Leaving directory '/build/acl2-8.3dfsg/books/workshops/2004/sumners-ray/support' Making /build/acl2-8.3dfsg/books/system/legal-variablep.cert on 23-Sep-2022 15:18:03 Built /build/acl2-8.3dfsg/books/system/legal-variablep.cert (2.374s) Making /build/acl2-8.3dfsg/books/std/lists/list-defuns.cert on 23-Sep-2022 15:18:06 Built /build/acl2-8.3dfsg/books/std/lists/list-defuns.cert (4.970s) Making /build/acl2-8.3dfsg/books/std/lists/mfc-utils.cert on 23-Sep-2022 15:18:11 Built /build/acl2-8.3dfsg/books/std/lists/mfc-utils.cert (3.249s) Making /build/acl2-8.3dfsg/books/std/osets/instance.cert on 23-Sep-2022 15:18:14 Built /build/acl2-8.3dfsg/books/std/osets/instance.cert (6.270s) Making /build/acl2-8.3dfsg/books/make-event/acl2x-help.cert on 23-Sep-2022 15:18:20 Built /build/acl2-8.3dfsg/books/make-event/acl2x-help.cert (4.536s) Making /build/acl2-8.3dfsg/books/clause-processors/remove-hyp.cert on 23-Sep-2022 15:18:25 Built /build/acl2-8.3dfsg/books/clause-processors/remove-hyp.cert (2.558s) Making /build/acl2-8.3dfsg/books/clause-processors/ev-find-rules.cert on 23-Sep-2022 15:18:28 Built /build/acl2-8.3dfsg/books/clause-processors/ev-find-rules.cert (3.808s) Making /build/acl2-8.3dfsg/books/data-structures/no-duplicates.cert on 23-Sep-2022 15:18:32 Built /build/acl2-8.3dfsg/books/data-structures/no-duplicates.cert (1.936s) Making /build/acl2-8.3dfsg/books/system/sublis-var.cert on 23-Sep-2022 15:18:34 Built /build/acl2-8.3dfsg/books/system/sublis-var.cert (5.859s) Making /build/acl2-8.3dfsg/books/misc/definline.cert on 23-Sep-2022 15:18:40 Built /build/acl2-8.3dfsg/books/misc/definline.cert (1.799s) Making /build/acl2-8.3dfsg/books/std/typed-lists/portcullis.cert on 23-Sep-2022 15:18:42 Built /build/acl2-8.3dfsg/books/std/typed-lists/portcullis.cert (2.005s) Making /build/acl2-8.3dfsg/books/coi/symbol-fns/portcullis.cert on 23-Sep-2022 15:18:44 Built /build/acl2-8.3dfsg/books/coi/symbol-fns/portcullis.cert (1.807s) Making /build/acl2-8.3dfsg/books/hacking/doc-section.cert on 23-Sep-2022 15:18:46 Built /build/acl2-8.3dfsg/books/hacking/doc-section.cert (1.700s) Making /build/acl2-8.3dfsg/books/hacking/defstruct-parsing.cert on 23-Sep-2022 15:18:48 Built /build/acl2-8.3dfsg/books/hacking/defstruct-parsing.cert (3.481s) Making /build/acl2-8.3dfsg/books/hacking/rewrite-code.cert on 23-Sep-2022 15:18:51 Built /build/acl2-8.3dfsg/books/hacking/rewrite-code.cert (9.607s) Making /build/acl2-8.3dfsg/books/hacking/progn-bang-enh.cert on 23-Sep-2022 15:19:01 Built /build/acl2-8.3dfsg/books/hacking/progn-bang-enh.cert (1.883s) Making /build/acl2-8.3dfsg/books/hacking/raw.cert on 23-Sep-2022 15:19:03 Built /build/acl2-8.3dfsg/books/hacking/raw.cert (2.343s) Making /build/acl2-8.3dfsg/books/hacking/redefun.cert on 23-Sep-2022 15:19:06 Built /build/acl2-8.3dfsg/books/hacking/redefun.cert (2.535s) Making /build/acl2-8.3dfsg/books/hacking/bridge.cert on 23-Sep-2022 15:19:08 Built /build/acl2-8.3dfsg/books/hacking/bridge.cert (2.789s) Making /build/acl2-8.3dfsg/books/hacking/subsumption.cert on 23-Sep-2022 15:19:11 Built /build/acl2-8.3dfsg/books/hacking/subsumption.cert (2.661s) Making /build/acl2-8.3dfsg/books/coi/symbol-fns/symbol-fns.cert on 23-Sep-2022 15:19:14 Built /build/acl2-8.3dfsg/books/coi/symbol-fns/symbol-fns.cert (4.215s) Making /build/acl2-8.3dfsg/books/tools/defmacfun.cert on 23-Sep-2022 15:19:18 Built /build/acl2-8.3dfsg/books/tools/defmacfun.cert (4.511s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/num-list-fns.cert on 23-Sep-2022 15:19:23 Built /build/acl2-8.3dfsg/books/acl2s/defdata/num-list-fns.cert (4.747s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/mv-proof.cert on 23-Sep-2022 15:19:28 Built /build/acl2-8.3dfsg/books/acl2s/defdata/mv-proof.cert (2.669s) Making /build/acl2-8.3dfsg/books/coi/util/portcullis.cert on 23-Sep-2022 15:19:31 Built /build/acl2-8.3dfsg/books/coi/util/portcullis.cert (1.781s) Making /build/acl2-8.3dfsg/books/arithmetic-2/pass1/basic-arithmetic-helper.cert on 23-Sep-2022 15:19:33 Built /build/acl2-8.3dfsg/books/arithmetic-2/pass1/basic-arithmetic-helper.cert (1.871s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/ground-zero.cert on 23-Sep-2022 15:19:35 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/ground-zero.cert (1.708s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/negative-syntaxp.cert on 23-Sep-2022 15:19:36 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/negative-syntaxp.cert (2.263s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/inverted-factor.cert on 23-Sep-2022 15:19:39 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/inverted-factor.cert (3.198s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/predicate.cert on 23-Sep-2022 15:19:42 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/predicate.cert (2.079s) Making /build/acl2-8.3dfsg/books/arithmetic/factorial.cert on 23-Sep-2022 15:19:44 Built /build/acl2-8.3dfsg/books/arithmetic/factorial.cert (2.577s) Making /build/acl2-8.3dfsg/books/arithmetic/sumlist.cert on 23-Sep-2022 15:19:47 Built /build/acl2-8.3dfsg/books/arithmetic/sumlist.cert (2.515s) Making /build/acl2-8.3dfsg/books/bdd/bdd-primitives.cert on 23-Sep-2022 15:19:50 Built /build/acl2-8.3dfsg/books/bdd/bdd-primitives.cert (5.984s) Making /build/acl2-8.3dfsg/books/bdd/bool-ops.cert on 23-Sep-2022 15:19:56 Built /build/acl2-8.3dfsg/books/bdd/bool-ops.cert (1.883s) Making /build/acl2-8.3dfsg/books/build/portcullis.cert on 23-Sep-2022 15:19:58 Built /build/acl2-8.3dfsg/books/build/portcullis.cert (2.024s) Making /build/acl2-8.3dfsg/books/build/test/dollar-test1.cert on 23-Sep-2022 15:20:00 Built /build/acl2-8.3dfsg/books/build/test/dollar-test1.cert (1.811s) Making /build/acl2-8.3dfsg/books/build/test/dollar-test2.foo.cert on 23-Sep-2022 15:20:02 Built /build/acl2-8.3dfsg/books/build/test/dollar-test2.foo.cert (1.786s) Making /build/acl2-8.3dfsg/books/build/test/dollar-test3.bar.cert on 23-Sep-2022 15:20:04 Built /build/acl2-8.3dfsg/books/build/test/dollar-test3.bar.cert (1.814s) Making /build/acl2-8.3dfsg/books/build/test/ifdeftest/thm-base.cert on 23-Sep-2022 15:20:06 Built /build/acl2-8.3dfsg/books/build/test/ifdeftest/thm-base.cert (2.279s) Making /build/acl2-8.3dfsg/books/oslib/portcullis.cert on 23-Sep-2022 15:20:08 Built /build/acl2-8.3dfsg/books/oslib/portcullis.cert (2.170s) Making /build/acl2-8.3dfsg/books/centaur/bridge/portcullis.cert on 23-Sep-2022 15:20:11 Built /build/acl2-8.3dfsg/books/centaur/bridge/portcullis.cert (2.124s) Making /build/acl2-8.3dfsg/books/centaur/nrev/portcullis.cert on 23-Sep-2022 15:20:13 Built /build/acl2-8.3dfsg/books/centaur/nrev/portcullis.cert (1.971s) Making /build/acl2-8.3dfsg/books/centaur/depgraph/portcullis.cert on 23-Sep-2022 15:20:15 Built /build/acl2-8.3dfsg/books/centaur/depgraph/portcullis.cert (1.967s) Making /build/acl2-8.3dfsg/books/centaur/satlink/portcullis.cert on 23-Sep-2022 15:20:17 Built /build/acl2-8.3dfsg/books/centaur/satlink/portcullis.cert (2.148s) Making /build/acl2-8.3dfsg/books/misc/gentle.cert on 23-Sep-2022 15:20:19 Built /build/acl2-8.3dfsg/books/misc/gentle.cert (3.675s) Making /build/acl2-8.3dfsg/books/std/lists/acl2-count.cert on 23-Sep-2022 15:20:23 Built /build/acl2-8.3dfsg/books/std/lists/acl2-count.cert (2.243s) Making /build/acl2-8.3dfsg/books/data-structures/list-defuns.cert on 23-Sep-2022 15:20:26 Built /build/acl2-8.3dfsg/books/data-structures/list-defuns.cert (4.336s) Making /build/acl2-8.3dfsg/books/system/f-put-global.cert on 23-Sep-2022 15:20:30 Built /build/acl2-8.3dfsg/books/system/f-put-global.cert (2.674s) Making /build/acl2-8.3dfsg/books/misc/computed-hint-rewrite.cert on 23-Sep-2022 15:20:33 Built /build/acl2-8.3dfsg/books/misc/computed-hint-rewrite.cert (3.447s) Making /build/acl2-8.3dfsg/books/clause-processors/find-subterms.cert on 23-Sep-2022 15:20:37 Built /build/acl2-8.3dfsg/books/clause-processors/find-subterms.cert (2.930s) Making /build/acl2-8.3dfsg/books/centaur/misc/arrays.cert on 23-Sep-2022 15:20:40 Built /build/acl2-8.3dfsg/books/centaur/misc/arrays.cert (2.550s) Making /build/acl2-8.3dfsg/books/centaur/truth/portcullis.cert on 23-Sep-2022 15:20:42 Built /build/acl2-8.3dfsg/books/centaur/truth/portcullis.cert (2.214s) Making /build/acl2-8.3dfsg/books/centaur/misc/u32-listp.cert on 23-Sep-2022 15:20:45 Built /build/acl2-8.3dfsg/books/centaur/misc/u32-listp.cert (2.047s) Making /build/acl2-8.3dfsg/books/centaur/misc/s32-listp.cert on 23-Sep-2022 15:20:47 Built /build/acl2-8.3dfsg/books/centaur/misc/s32-listp.cert (1.934s) Making /build/acl2-8.3dfsg/books/centaur/bed/portcullis.cert on 23-Sep-2022 15:20:49 Built /build/acl2-8.3dfsg/books/centaur/bed/portcullis.cert (2.087s) Making /build/acl2-8.3dfsg/books/centaur/clex/portcullis.cert on 23-Sep-2022 15:20:51 Built /build/acl2-8.3dfsg/books/centaur/clex/portcullis.cert (2.047s) Making /build/acl2-8.3dfsg/books/centaur/defrstobj/portcullis.cert on 23-Sep-2022 15:20:53 Built /build/acl2-8.3dfsg/books/centaur/defrstobj/portcullis.cert (1.964s) Making /build/acl2-8.3dfsg/books/centaur/defrstobj2/portcullis.cert on 23-Sep-2022 15:20:56 Built /build/acl2-8.3dfsg/books/centaur/defrstobj2/portcullis.cert (2.159s) Making /build/acl2-8.3dfsg/books/centaur/misc/ap.cert on 23-Sep-2022 15:20:58 Built /build/acl2-8.3dfsg/books/centaur/misc/ap.cert (1.953s) Making /build/acl2-8.3dfsg/books/centaur/misc/errmsg.cert on 23-Sep-2022 15:21:00 Built /build/acl2-8.3dfsg/books/centaur/misc/errmsg.cert (1.899s) Making /build/acl2-8.3dfsg/books/oslib/read-acl2-oracle.cert on 23-Sep-2022 15:21:02 Built /build/acl2-8.3dfsg/books/oslib/read-acl2-oracle.cert (2.233s) Making /build/acl2-8.3dfsg/books/rtl/rel11/portcullis.cert on 23-Sep-2022 15:21:04 Built /build/acl2-8.3dfsg/books/rtl/rel11/portcullis.cert (2.135s) Making /build/acl2-8.3dfsg/books/centaur/memoize/portcullis.cert on 23-Sep-2022 15:21:07 Built /build/acl2-8.3dfsg/books/centaur/memoize/portcullis.cert (1.795s) Making /build/acl2-8.3dfsg/books/centaur/misc/count-up.cert on 23-Sep-2022 15:21:09 Built /build/acl2-8.3dfsg/books/centaur/misc/count-up.cert (2.204s) Making /build/acl2-8.3dfsg/books/centaur/misc/remove-assoc.cert on 23-Sep-2022 15:21:11 Built /build/acl2-8.3dfsg/books/centaur/misc/remove-assoc.cert (1.830s) Making /build/acl2-8.3dfsg/books/centaur/misc/stobj-swap.cert on 23-Sep-2022 15:21:13 Built /build/acl2-8.3dfsg/books/centaur/misc/stobj-swap.cert (2.029s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/portcullis.cert on 23-Sep-2022 15:21:15 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/portcullis.cert (1.795s) Making /build/acl2-8.3dfsg/books/coi/util/in-conclusion.cert on 23-Sep-2022 15:21:17 Built /build/acl2-8.3dfsg/books/coi/util/in-conclusion.cert (3.861s) Making /build/acl2-8.3dfsg/books/coi/util/ith.cert on 23-Sep-2022 15:21:21 Built /build/acl2-8.3dfsg/books/coi/util/ith.cert (1.966s) Making /build/acl2-8.3dfsg/books/coi/nary/portcullis.cert on 23-Sep-2022 15:21:23 Built /build/acl2-8.3dfsg/books/coi/nary/portcullis.cert (1.657s) Making /build/acl2-8.3dfsg/books/system/apply/apply-prim.cert on 23-Sep-2022 15:21:25 Built /build/acl2-8.3dfsg/books/system/apply/apply-prim.cert (500.249s) Making /build/acl2-8.3dfsg/books/projects/apply/definductor.cert on 23-Sep-2022 15:29:45 Built /build/acl2-8.3dfsg/books/projects/apply/definductor.cert (8.164s) Making /build/acl2-8.3dfsg/books/textbook/chap11/perm.cert on 23-Sep-2022 15:29:54 Built /build/acl2-8.3dfsg/books/textbook/chap11/perm.cert (2.461s) Making /build/acl2-8.3dfsg/books/clause-processors/replace-impl.cert on 23-Sep-2022 15:29:56 Built /build/acl2-8.3dfsg/books/clause-processors/replace-impl.cert (4.931s) Making /build/acl2-8.3dfsg/books/coi/adviser/portcullis.cert on 23-Sep-2022 15:30:01 Built /build/acl2-8.3dfsg/books/coi/adviser/portcullis.cert (1.907s) Making /build/acl2-8.3dfsg/books/coi/util/mv-nth.cert on 23-Sep-2022 15:30:03 Built /build/acl2-8.3dfsg/books/coi/util/mv-nth.cert (2.651s) Making /build/acl2-8.3dfsg/books/coi/util/syntaxp.cert on 23-Sep-2022 15:30:06 Built /build/acl2-8.3dfsg/books/coi/util/syntaxp.cert (2.034s) Making /build/acl2-8.3dfsg/books/coi/util/iff.cert on 23-Sep-2022 15:30:08 Built /build/acl2-8.3dfsg/books/coi/util/iff.cert (1.912s) Making /build/acl2-8.3dfsg/books/coi/util/defbinding.cert on 23-Sep-2022 15:30:10 Built /build/acl2-8.3dfsg/books/coi/util/defbinding.cert (1.873s) Making /build/acl2-8.3dfsg/books/coi/syntax/portcullis.cert on 23-Sep-2022 15:30:12 Built /build/acl2-8.3dfsg/books/coi/syntax/portcullis.cert (1.849s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/util.cert on 23-Sep-2022 15:30:14 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/util.cert (2.665s) Making /build/acl2-8.3dfsg/books/coi/defpun/defpun.cert on 23-Sep-2022 15:30:17 Built /build/acl2-8.3dfsg/books/coi/defpun/defpun.cert (7.433s) Making /build/acl2-8.3dfsg/books/data-structures/memories/portcullis.cert on 23-Sep-2022 15:30:25 Built /build/acl2-8.3dfsg/books/data-structures/memories/portcullis.cert (1.822s) Making /build/acl2-8.3dfsg/books/coi/util/clause-processor.cert on 23-Sep-2022 15:30:27 Built /build/acl2-8.3dfsg/books/coi/util/clause-processor.cert (3.344s) Making /build/acl2-8.3dfsg/books/coi/util/table.cert on 23-Sep-2022 15:30:30 Built /build/acl2-8.3dfsg/books/coi/util/table.cert (2.302s) Making /build/acl2-8.3dfsg/books/coi/defung/portcullis.cert on 23-Sep-2022 15:30:33 Built /build/acl2-8.3dfsg/books/coi/defung/portcullis.cert (1.998s) Making /build/acl2-8.3dfsg/books/coi/maps/portcullis.cert on 23-Sep-2022 15:30:35 Built /build/acl2-8.3dfsg/books/coi/maps/portcullis.cert (2.178s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/symbols.cert on 23-Sep-2022 15:30:37 Built /build/acl2-8.3dfsg/books/coi/super-ihs/symbols.cert (3.835s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/min-max.cert on 23-Sep-2022 15:30:41 Built /build/acl2-8.3dfsg/books/coi/super-ihs/min-max.cert (1.953s) Making /build/acl2-8.3dfsg/books/coi/nary/nth-rules.cert on 23-Sep-2022 15:30:43 Built /build/acl2-8.3dfsg/books/coi/nary/nth-rules.cert (7.522s) Making /build/acl2-8.3dfsg/books/coi/util/deffix.cert on 23-Sep-2022 15:30:51 Built /build/acl2-8.3dfsg/books/coi/util/deffix.cert (5.949s) Making /build/acl2-8.3dfsg/books/coi/nary/rewrite-equal-hint.cert on 23-Sep-2022 15:30:57 Built /build/acl2-8.3dfsg/books/coi/nary/rewrite-equal-hint.cert (3.164s) Making /build/acl2-8.3dfsg/books/coi/nary/skip-rewrite.cert on 23-Sep-2022 15:31:00 Built /build/acl2-8.3dfsg/books/coi/nary/skip-rewrite.cert (5.833s) Making /build/acl2-8.3dfsg/books/coi/quantification/portcullis.cert on 23-Sep-2022 15:31:07 Built /build/acl2-8.3dfsg/books/coi/quantification/portcullis.cert (1.886s) Making /build/acl2-8.3dfsg/books/coi/util/rule-sets-support.cert on 23-Sep-2022 15:31:09 Built /build/acl2-8.3dfsg/books/coi/util/rule-sets-support.cert (9.548s) Making /build/acl2-8.3dfsg/books/coi/symbol-fns/symbol-fns-exports.cert on 23-Sep-2022 15:31:18 Built /build/acl2-8.3dfsg/books/coi/symbol-fns/symbol-fns-exports.cert (1.947s) Making /build/acl2-8.3dfsg/books/coi/syntax/defbinding.cert on 23-Sep-2022 15:31:20 Built /build/acl2-8.3dfsg/books/coi/syntax/defbinding.cert (3.847s) Making /build/acl2-8.3dfsg/books/coi/syntax/syn-pkg.cert on 23-Sep-2022 15:31:24 Built /build/acl2-8.3dfsg/books/coi/syntax/syn-pkg.cert (1.944s) Making /build/acl2-8.3dfsg/books/coi/util/extra-info.cert on 23-Sep-2022 15:31:26 Built /build/acl2-8.3dfsg/books/coi/util/extra-info.cert (2.093s) Making /build/acl2-8.3dfsg/books/coi/util/fixequiv.cert on 23-Sep-2022 15:31:29 Built /build/acl2-8.3dfsg/books/coi/util/fixequiv.cert (2.951s) Making /build/acl2-8.3dfsg/books/coi/util/tau.cert on 23-Sep-2022 15:31:32 Built /build/acl2-8.3dfsg/books/coi/util/tau.cert (4.120s) Making /build/acl2-8.3dfsg/books/data-structures/alist-defuns.cert on 23-Sep-2022 15:31:36 Built /build/acl2-8.3dfsg/books/data-structures/alist-defuns.cert (9.075s) Making /build/acl2-8.3dfsg/books/data-structures/number-list-defuns.cert on 23-Sep-2022 15:31:45 Built /build/acl2-8.3dfsg/books/data-structures/number-list-defuns.cert (3.369s) Making /build/acl2-8.3dfsg/books/defexec/find-path/graph/helpers.cert on 23-Sep-2022 15:31:49 Built /build/acl2-8.3dfsg/books/defexec/find-path/graph/helpers.cert (2.500s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/misc/memos.cert on 23-Sep-2022 15:31:52 Built /build/acl2-8.3dfsg/books/defexec/other-apps/misc/memos.cert (4.533s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/misc/stobjsim.cert on 23-Sep-2022 15:31:56 Built /build/acl2-8.3dfsg/books/defexec/other-apps/misc/stobjsim.cert (8.401s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/total-order.cert on 23-Sep-2022 15:32:05 Built /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/total-order.cert (2.394s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/nth-update-nth.cert on 23-Sep-2022 15:32:07 Built /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/nth-update-nth.cert (2.083s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/permutations.cert on 23-Sep-2022 15:32:10 Built /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/permutations.cert (3.109s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/records/inline.cert on 23-Sep-2022 15:32:13 Built /build/acl2-8.3dfsg/books/defexec/other-apps/records/inline.cert (4.568s) Making /build/acl2-8.3dfsg/books/system/extend-pathname.cert on 23-Sep-2022 15:32:18 Built /build/acl2-8.3dfsg/books/system/extend-pathname.cert (5.870s) Making /build/acl2-8.3dfsg/books/system/verified-termination-and-guards.cert on 23-Sep-2022 15:32:24 Built /build/acl2-8.3dfsg/books/system/verified-termination-and-guards.cert (4.632s) Making /build/acl2-8.3dfsg/books/system/pseudo-termp-lemmas.cert on 23-Sep-2022 15:32:28 Built /build/acl2-8.3dfsg/books/system/pseudo-termp-lemmas.cert (1.808s) Making /build/acl2-8.3dfsg/books/system/convert-normalized-term-to-pairs.cert on 23-Sep-2022 15:32:30 Built /build/acl2-8.3dfsg/books/system/convert-normalized-term-to-pairs.cert (10.454s) Making /build/acl2-8.3dfsg/books/system/merge-sort-term-order.cert on 23-Sep-2022 15:32:41 Built /build/acl2-8.3dfsg/books/system/merge-sort-term-order.cert (2.608s) Making /build/acl2-8.3dfsg/books/system/merge-sort-symbol-lt.cert on 23-Sep-2022 15:32:44 Built /build/acl2-8.3dfsg/books/system/merge-sort-symbol-lt.cert (2.262s) Making /build/acl2-8.3dfsg/books/system/case-match.cert on 23-Sep-2022 15:32:46 Built /build/acl2-8.3dfsg/books/system/case-match.cert (3.876s) Making /build/acl2-8.3dfsg/books/system/fmx-cw.cert on 23-Sep-2022 15:32:50 Built /build/acl2-8.3dfsg/books/system/fmx-cw.cert (10.505s) Making /build/acl2-8.3dfsg/books/system/all-fnnames.cert on 23-Sep-2022 15:33:01 Built /build/acl2-8.3dfsg/books/system/all-fnnames.cert (1.961s) Making /build/acl2-8.3dfsg/books/demos/list-equality-from-nth.cert on 23-Sep-2022 15:33:03 Built /build/acl2-8.3dfsg/books/demos/list-equality-from-nth.cert (2.168s) Making /build/acl2-8.3dfsg/books/demos/list-theory.cert on 23-Sep-2022 15:33:05 Built /build/acl2-8.3dfsg/books/demos/list-theory.cert (2.008s) Making /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/perm.cert on 23-Sep-2022 15:33:07 Built /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/perm.cert (2.564s) Making /build/acl2-8.3dfsg/books/demos/meta-wf-guarantee-example.cert on 23-Sep-2022 15:33:10 Built /build/acl2-8.3dfsg/books/demos/meta-wf-guarantee-example.cert (14.642s) Making /build/acl2-8.3dfsg/books/misc/defun-plus.cert on 23-Sep-2022 15:33:25 Built /build/acl2-8.3dfsg/books/misc/defun-plus.cert (4.068s) Making /build/acl2-8.3dfsg/books/demos/modeling/nested-stobj-toy-isa.cert on 23-Sep-2022 15:33:29 Built /build/acl2-8.3dfsg/books/demos/modeling/nested-stobj-toy-isa.cert (34.805s) Making /build/acl2-8.3dfsg/books/demos/nth-update-nth-meta-extract.cert on 23-Sep-2022 15:34:04 Built /build/acl2-8.3dfsg/books/demos/nth-update-nth-meta-extract.cert (14.944s) Making /build/acl2-8.3dfsg/books/make-event/embeddable-event-forms.cert on 23-Sep-2022 15:34:19 Built /build/acl2-8.3dfsg/books/make-event/embeddable-event-forms.cert (1.914s) Making /build/acl2-8.3dfsg/books/demos/parallel/matrix-multiplication-setup.cert on 23-Sep-2022 15:34:21 Built /build/acl2-8.3dfsg/books/demos/parallel/matrix-multiplication-setup.cert (7.013s) Making /build/acl2-8.3dfsg/books/demos/proofs/linear.cert on 23-Sep-2022 15:34:28 Built /build/acl2-8.3dfsg/books/demos/proofs/linear.cert (2.303s) Making /build/acl2-8.3dfsg/books/demos/proofs/type-prescription.cert on 23-Sep-2022 15:34:31 Built /build/acl2-8.3dfsg/books/demos/proofs/type-prescription.cert (2.255s) Making /build/acl2-8.3dfsg/books/demos/register-invariant-risk-support.cert on 23-Sep-2022 15:34:33 Built /build/acl2-8.3dfsg/books/demos/register-invariant-risk-support.cert (3.009s) Making /build/acl2-8.3dfsg/books/demos/stobj-equality-from-fields.cert on 23-Sep-2022 15:34:36 Built /build/acl2-8.3dfsg/books/demos/stobj-equality-from-fields.cert (3.809s) Making /build/acl2-8.3dfsg/books/demos/tutorial-problems/equivalence-of-two-functions/kaufmann.cert on 23-Sep-2022 15:34:40 Built /build/acl2-8.3dfsg/books/demos/tutorial-problems/equivalence-of-two-functions/kaufmann.cert (2.300s) Making /build/acl2-8.3dfsg/books/demos/tutorial-problems/introductory-challenge-problem-4-athena.cert on 23-Sep-2022 15:34:43 Built /build/acl2-8.3dfsg/books/demos/tutorial-problems/introductory-challenge-problem-4-athena.cert (3.382s) Making /build/acl2-8.3dfsg/books/demos/tutorial-problems/introductory-challenge-problem-4.cert on 23-Sep-2022 15:34:46 Built /build/acl2-8.3dfsg/books/demos/tutorial-problems/introductory-challenge-problem-4.cert (3.594s) Making /build/acl2-8.3dfsg/books/projects/sat/dimacs-reader/portcullis.cert on 23-Sep-2022 15:34:50 Built /build/acl2-8.3dfsg/books/projects/sat/dimacs-reader/portcullis.cert (1.940s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-array/portcullis.cert on 23-Sep-2022 15:34:52 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-array/portcullis.cert (2.054s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/portcullis.cert on 23-Sep-2022 15:34:54 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/portcullis.cert (1.886s) Making /build/acl2-8.3dfsg/books/projects/farray/portcullis.cert on 23-Sep-2022 15:34:56 Built /build/acl2-8.3dfsg/books/projects/farray/portcullis.cert (1.807s) Making /build/acl2-8.3dfsg/books/system/doc/portcullis.cert on 23-Sep-2022 15:34:58 Built /build/acl2-8.3dfsg/books/system/doc/portcullis.cert (2.261s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/portcullis.cert on 23-Sep-2022 15:35:01 Built /build/acl2-8.3dfsg/books/kestrel/crypto/portcullis.cert (2.805s) Making /build/acl2-8.3dfsg/books/kestrel/prime-fields/portcullis.cert on 23-Sep-2022 15:35:04 Built /build/acl2-8.3dfsg/books/kestrel/prime-fields/portcullis.cert (1.963s) Making /build/acl2-8.3dfsg/books/kestrel/java/portcullis.cert on 23-Sep-2022 15:35:06 Built /build/acl2-8.3dfsg/books/kestrel/java/portcullis.cert (2.393s) Making /build/acl2-8.3dfsg/books/kestrel/apt/portcullis.cert on 23-Sep-2022 15:35:09 Built /build/acl2-8.3dfsg/books/kestrel/apt/portcullis.cert (2.208s) Making /build/acl2-8.3dfsg/books/kestrel/soft/portcullis.cert on 23-Sep-2022 15:35:11 Built /build/acl2-8.3dfsg/books/kestrel/soft/portcullis.cert (2.306s) Making /build/acl2-8.3dfsg/books/kestrel/abnf/portcullis.cert on 23-Sep-2022 15:35:13 Built /build/acl2-8.3dfsg/books/kestrel/abnf/portcullis.cert (2.356s) Making /build/acl2-8.3dfsg/books/projects/irv/portcullis.cert on 23-Sep-2022 15:35:16 Built /build/acl2-8.3dfsg/books/projects/irv/portcullis.cert (2.537s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/omaps/portcullis.cert on 23-Sep-2022 15:35:19 Built /build/acl2-8.3dfsg/books/kestrel/utilities/omaps/portcullis.cert (2.235s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/keccak/portcullis.cert on 23-Sep-2022 15:35:21 Built /build/acl2-8.3dfsg/books/kestrel/crypto/keccak/portcullis.cert (1.849s) Making /build/acl2-8.3dfsg/books/finite-set-theory/total-ordering.cert on 23-Sep-2022 15:35:23 Built /build/acl2-8.3dfsg/books/finite-set-theory/total-ordering.cert (5.045s) Making /build/acl2-8.3dfsg/books/hacking/dynamic-make-event.cert on 23-Sep-2022 15:35:28 Built /build/acl2-8.3dfsg/books/hacking/dynamic-make-event.cert (2.216s) Making /build/acl2-8.3dfsg/books/misc/evalable-printing.cert on 23-Sep-2022 15:35:31 Built /build/acl2-8.3dfsg/books/misc/evalable-printing.cert (3.627s) Making /build/acl2-8.3dfsg/books/hints/huet-lang-algorithm.cert on 23-Sep-2022 15:35:34 Built /build/acl2-8.3dfsg/books/hints/huet-lang-algorithm.cert (22.397s) Making /build/acl2-8.3dfsg/books/hints/subgoalp.cert on 23-Sep-2022 15:35:57 Built /build/acl2-8.3dfsg/books/hints/subgoalp.cert (3.253s) Making /build/acl2-8.3dfsg/books/hints/use-pkg.cert on 23-Sep-2022 15:36:00 Built /build/acl2-8.3dfsg/books/hints/use-pkg.cert (4.723s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/acceptable-rewrite-rule-p.cert on 23-Sep-2022 15:36:05 Built /build/acl2-8.3dfsg/books/kestrel/utilities/acceptable-rewrite-rule-p.cert (2.107s) Making /build/acl2-8.3dfsg/books/kestrel/alists-light/acons.cert on 23-Sep-2022 15:36:07 Built /build/acl2-8.3dfsg/books/kestrel/alists-light/acons.cert (1.863s) Making /build/acl2-8.3dfsg/books/kestrel/alists-light/assoc-equal.cert on 23-Sep-2022 15:36:09 Built /build/acl2-8.3dfsg/books/kestrel/alists-light/assoc-equal.cert (2.020s) Making /build/acl2-8.3dfsg/books/kestrel/alists-light/lookup-equal.cert on 23-Sep-2022 15:36:12 Built /build/acl2-8.3dfsg/books/kestrel/alists-light/lookup-equal.cert (2.156s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/cons.cert on 23-Sep-2022 15:36:14 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/cons.cert (1.925s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/take.cert on 23-Sep-2022 15:36:16 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/take.cert (3.075s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/cdr.cert on 23-Sep-2022 15:36:19 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/cdr.cert (2.032s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/len.cert on 23-Sep-2022 15:36:21 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/len.cert (2.115s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/true-list-fix.cert on 23-Sep-2022 15:36:24 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/true-list-fix.cert (1.902s) Making /build/acl2-8.3dfsg/books/kestrel/alists-light/pairlis-dollar.cert on 23-Sep-2022 15:36:26 Built /build/acl2-8.3dfsg/books/kestrel/alists-light/pairlis-dollar.cert (1.909s) Making /build/acl2-8.3dfsg/books/kestrel/alists-light/strip-cars.cert on 23-Sep-2022 15:36:28 Built /build/acl2-8.3dfsg/books/kestrel/alists-light/strip-cars.cert (2.043s) Making /build/acl2-8.3dfsg/books/kestrel/alists-light/strip-cdrs.cert on 23-Sep-2022 15:36:30 Built /build/acl2-8.3dfsg/books/kestrel/alists-light/strip-cdrs.cert (1.992s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/make-executable.cert on 23-Sep-2022 15:36:32 Built /build/acl2-8.3dfsg/books/kestrel/utilities/make-executable.cert (6.443s) Making /build/acl2-8.3dfsg/books/workshops/2017/coglio-kaufmann-smith/support/transformation-table.cert on 23-Sep-2022 15:36:39 Built /build/acl2-8.3dfsg/books/workshops/2017/coglio-kaufmann-smith/support/transformation-table.cert (2.358s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/plus.cert on 23-Sep-2022 15:36:41 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/plus.cert (1.986s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/less-than.cert on 23-Sep-2022 15:36:43 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/less-than.cert (2.195s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/complex.cert on 23-Sep-2022 15:36:46 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/complex.cert (1.855s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/plus-and-minus.cert on 23-Sep-2022 15:36:48 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/plus-and-minus.cert (1.891s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/minus.cert on 23-Sep-2022 15:36:50 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/minus.cert (1.870s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/plus-and-times.cert on 23-Sep-2022 15:36:52 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/plus-and-times.cert (1.914s) Making /build/acl2-8.3dfsg/books/kestrel/simpl-imp/portcullis.cert on 23-Sep-2022 15:36:54 Built /build/acl2-8.3dfsg/books/kestrel/simpl-imp/portcullis.cert (2.263s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/kdf/portcullis.cert on 23-Sep-2022 15:36:56 Built /build/acl2-8.3dfsg/books/kestrel/crypto/kdf/portcullis.cert (1.864s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/hmac/portcullis.cert on 23-Sep-2022 15:36:58 Built /build/acl2-8.3dfsg/books/kestrel/crypto/hmac/portcullis.cert (1.934s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/padding/portcullis.cert on 23-Sep-2022 15:37:00 Built /build/acl2-8.3dfsg/books/kestrel/crypto/padding/portcullis.cert (1.787s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/sha-2/portcullis.cert on 23-Sep-2022 15:37:02 Built /build/acl2-8.3dfsg/books/kestrel/crypto/sha-2/portcullis.cert (1.895s) Making /build/acl2-8.3dfsg/books/kestrel/axe/axe-syntax.cert on 23-Sep-2022 15:37:04 Built /build/acl2-8.3dfsg/books/kestrel/axe/axe-syntax.cert (2.182s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/equal-of-booleans.cert on 23-Sep-2022 15:37:07 Built /build/acl2-8.3dfsg/books/kestrel/utilities/equal-of-booleans.cert (1.831s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/all-integerp.cert on 23-Sep-2022 15:37:09 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/all-integerp.cert (2.070s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/nth.cert on 23-Sep-2022 15:37:11 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/nth.cert (2.078s) Making /build/acl2-8.3dfsg/books/kestrel/booleans/bool-fix.cert on 23-Sep-2022 15:37:13 Built /build/acl2-8.3dfsg/books/kestrel/booleans/bool-fix.cert (1.876s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/myif.cert on 23-Sep-2022 15:37:15 Built /build/acl2-8.3dfsg/books/kestrel/utilities/myif.cert (2.284s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/member-equal.cert on 23-Sep-2022 15:37:18 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/member-equal.cert (2.107s) Making /build/acl2-8.3dfsg/books/kestrel/bv/unsigned-byte-p-forced.cert on 23-Sep-2022 15:37:20 Built /build/acl2-8.3dfsg/books/kestrel/bv/unsigned-byte-p-forced.cert (1.936s) Making /build/acl2-8.3dfsg/books/rtl/rel11/support/util.cert on 23-Sep-2022 15:37:22 Built /build/acl2-8.3dfsg/books/rtl/rel11/support/util.cert (3.217s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/smaller-termp.cert on 23-Sep-2022 15:37:25 Built /build/acl2-8.3dfsg/books/kestrel/utilities/smaller-termp.cert (1.903s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/integer-arithmetic/operations.cert on 23-Sep-2022 15:37:27 Built /build/acl2-8.3dfsg/books/kestrel/utilities/integer-arithmetic/operations.cert (2.445s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/keccak/keccak-team-test-data.cert on 23-Sep-2022 15:37:30 Built /build/acl2-8.3dfsg/books/kestrel/crypto/keccak/keccak-team-test-data.cert (4.095s) Making /build/acl2-8.3dfsg/books/kestrel/file-io-light/open-input-channel.cert on 23-Sep-2022 15:37:35 Built /build/acl2-8.3dfsg/books/kestrel/file-io-light/open-input-channel.cert (1.992s) Making /build/acl2-8.3dfsg/books/kestrel/file-io-light/open-output-channel.cert on 23-Sep-2022 15:37:37 Built /build/acl2-8.3dfsg/books/kestrel/file-io-light/open-output-channel.cert (2.190s) Making /build/acl2-8.3dfsg/books/kestrel/file-io-light/file-length-dollar.cert on 23-Sep-2022 15:37:39 Built /build/acl2-8.3dfsg/books/kestrel/file-io-light/file-length-dollar.cert (1.900s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/add-to-set-equal.cert on 23-Sep-2022 15:37:41 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/add-to-set-equal.cert (1.804s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/firstn-def.cert on 23-Sep-2022 15:37:43 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/firstn-def.cert (2.089s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/intersection-equal.cert on 23-Sep-2022 15:37:45 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/intersection-equal.cert (1.964s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/last.cert on 23-Sep-2022 15:37:47 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/last.cert (1.825s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/memberp-def.cert on 23-Sep-2022 15:37:49 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/memberp-def.cert (1.920s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/subsetp-equal.cert on 23-Sep-2022 15:37:51 Tick Built /build/acl2-8.3dfsg/books/kestrel/lists-light/subsetp-equal.cert (3.300s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/remove1-equal.cert on 23-Sep-2022 15:37:55 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/remove1-equal.cert (2.070s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/remove-equal.cert on 23-Sep-2022 15:37:57 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/remove-equal.cert (2.044s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/set-difference-equal.cert on 23-Sep-2022 15:37:59 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/set-difference-equal.cert (1.906s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/subrange-def.cert on 23-Sep-2022 15:38:01 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/subrange-def.cert (2.098s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/symbol-listp.cert on 23-Sep-2022 15:38:04 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/symbol-listp.cert (2.027s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/update-nth.cert on 23-Sep-2022 15:38:06 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/update-nth.cert (2.118s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/union-equal.cert on 23-Sep-2022 15:38:08 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/union-equal.cert (1.914s) Making /build/acl2-8.3dfsg/books/kestrel/std/util/defarbrec-template.cert on 23-Sep-2022 15:38:10 Built /build/acl2-8.3dfsg/books/kestrel/std/util/defarbrec-template.cert (3.972s) Making /build/acl2-8.3dfsg/books/kestrel/std/util/defiso-templates.cert on 23-Sep-2022 15:38:14 Built /build/acl2-8.3dfsg/books/kestrel/std/util/defiso-templates.cert (4.608s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/forms.cert on 23-Sep-2022 15:38:19 Built /build/acl2-8.3dfsg/books/kestrel/utilities/forms.cert (1.889s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/make-and.cert on 23-Sep-2022 15:38:21 Built /build/acl2-8.3dfsg/books/kestrel/utilities/make-and.cert (1.913s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/keyword-value-lists2.cert on 23-Sep-2022 15:38:23 Built /build/acl2-8.3dfsg/books/kestrel/utilities/keyword-value-lists2.cert (2.680s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/world.cert on 23-Sep-2022 15:38:26 Built /build/acl2-8.3dfsg/books/kestrel/utilities/world.cert (6.711s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/pack.cert on 23-Sep-2022 15:38:33 Built /build/acl2-8.3dfsg/books/kestrel/utilities/pack.cert (2.994s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/substitution.cert on 23-Sep-2022 15:38:36 Built /build/acl2-8.3dfsg/books/kestrel/utilities/substitution.cert (2.606s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/defthm-events.cert on 23-Sep-2022 15:38:39 Built /build/acl2-8.3dfsg/books/kestrel/utilities/defthm-events.cert (2.475s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/disables.cert on 23-Sep-2022 15:38:41 Built /build/acl2-8.3dfsg/books/kestrel/utilities/disables.cert (1.814s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/erp.cert on 23-Sep-2022 15:38:43 Built /build/acl2-8.3dfsg/books/kestrel/utilities/erp.cert (1.777s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/remove-duplicates-equal-dollar.cert on 23-Sep-2022 15:38:45 Built /build/acl2-8.3dfsg/books/kestrel/utilities/remove-duplicates-equal-dollar.cert (2.208s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/make-or.cert on 23-Sep-2022 15:38:48 Built /build/acl2-8.3dfsg/books/kestrel/utilities/make-or.cert (1.999s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/verify-guards-program.cert on 23-Sep-2022 15:38:50 Built /build/acl2-8.3dfsg/books/kestrel/utilities/verify-guards-program.cert (4.923s) Making /build/acl2-8.3dfsg/books/make-event/acl2x-help-test.acl2x on 23-Sep-2022 15:38:55 Built /build/acl2-8.3dfsg/books/make-event/acl2x-help-test.acl2x (1.075s) Making /build/acl2-8.3dfsg/books/make-event/basic-check.cert on 23-Sep-2022 15:38:56 Built /build/acl2-8.3dfsg/books/make-event/basic-check.cert (2.142s) Making /build/acl2-8.3dfsg/books/make-event/basic-pkg-check.cert on 23-Sep-2022 15:38:58 Built /build/acl2-8.3dfsg/books/make-event/basic-pkg-check.cert (2.225s) Making /build/acl2-8.3dfsg/books/make-event/basic-pkg.cert on 23-Sep-2022 15:39:01 Built /build/acl2-8.3dfsg/books/make-event/basic-pkg.cert (2.105s) Making /build/acl2-8.3dfsg/books/make-event/basic.cert on 23-Sep-2022 15:39:03 Built /build/acl2-8.3dfsg/books/make-event/basic.cert (2.411s) Making /build/acl2-8.3dfsg/books/make-event/defconst-fast.cert on 23-Sep-2022 15:39:05 Built /build/acl2-8.3dfsg/books/make-event/defconst-fast.cert (1.789s) Making /build/acl2-8.3dfsg/books/make-event/defrule.cert on 23-Sep-2022 15:39:07 Built /build/acl2-8.3dfsg/books/make-event/defrule.cert (2.685s) Making /build/acl2-8.3dfsg/books/make-event/dotimes.cert on 23-Sep-2022 15:39:10 Built /build/acl2-8.3dfsg/books/make-event/dotimes.cert (6.188s) Making /build/acl2-8.3dfsg/books/make-event/double-cert-test-1.acl2x on 23-Sep-2022 15:39:16 Built /build/acl2-8.3dfsg/books/make-event/double-cert-test-1.acl2x (1.064s) Making /build/acl2-8.3dfsg/books/make-event/gen-defun-check.cert on 23-Sep-2022 15:39:18 Built /build/acl2-8.3dfsg/books/make-event/gen-defun-check.cert (2.882s) Making /build/acl2-8.3dfsg/books/make-event/gen-defun.cert on 23-Sep-2022 15:39:21 Built /build/acl2-8.3dfsg/books/make-event/gen-defun.cert (3.009s) Making /build/acl2-8.3dfsg/books/make-event/inline-book.cert on 23-Sep-2022 15:39:24 Built /build/acl2-8.3dfsg/books/make-event/inline-book.cert (3.491s) Making /build/acl2-8.3dfsg/books/make-event/local-elided.cert on 23-Sep-2022 15:39:27 Built /build/acl2-8.3dfsg/books/make-event/local-elided.cert (2.507s) Making /build/acl2-8.3dfsg/books/make-event/logical-tangent.cert on 23-Sep-2022 15:39:30 Built /build/acl2-8.3dfsg/books/make-event/logical-tangent.cert (1.800s) Making /build/acl2-8.3dfsg/books/make-event/macros-skip-proofs.cert on 23-Sep-2022 15:39:32 Built /build/acl2-8.3dfsg/books/make-event/macros-skip-proofs.cert (2.303s) Making /build/acl2-8.3dfsg/books/make-event/make-redundant.cert on 23-Sep-2022 15:39:34 Built /build/acl2-8.3dfsg/books/make-event/make-redundant.cert (2.058s) Making /build/acl2-8.3dfsg/books/make-event/nested-check.cert on 23-Sep-2022 15:39:37 Built /build/acl2-8.3dfsg/books/make-event/nested-check.cert (2.458s) Making /build/acl2-8.3dfsg/books/make-event/nested.cert on 23-Sep-2022 15:39:39 Built /build/acl2-8.3dfsg/books/make-event/nested.cert (2.067s) Making /build/acl2-8.3dfsg/books/make-event/require-book.cert on 23-Sep-2022 15:39:41 Built /build/acl2-8.3dfsg/books/make-event/require-book.cert (4.798s) Making /build/acl2-8.3dfsg/books/make-event/search-generation.cert on 23-Sep-2022 15:39:46 Built /build/acl2-8.3dfsg/books/make-event/search-generation.cert (2.268s) Making /build/acl2-8.3dfsg/books/make-event/stobj-test.acl2x on 23-Sep-2022 15:39:49 Built /build/acl2-8.3dfsg/books/make-event/stobj-test.acl2x (1.071s) Making /build/acl2-8.3dfsg/books/misc/book-checks.cert on 23-Sep-2022 15:39:50 Built /build/acl2-8.3dfsg/books/misc/book-checks.cert (3.685s) Making /build/acl2-8.3dfsg/books/misc/callers-and-ancestors.cert on 23-Sep-2022 15:39:54 Built /build/acl2-8.3dfsg/books/misc/callers-and-ancestors.cert (4.240s) Making /build/acl2-8.3dfsg/books/misc/character-encoding-test.cert on 23-Sep-2022 15:39:58 Built /build/acl2-8.3dfsg/books/misc/character-encoding-test.cert (1.886s) Making /build/acl2-8.3dfsg/books/misc/check-acl2-exports.cert on 23-Sep-2022 15:40:00 Built /build/acl2-8.3dfsg/books/misc/check-acl2-exports.cert (3.602s) Making /build/acl2-8.3dfsg/books/misc/check-fn-inst.cert on 23-Sep-2022 15:40:04 Built /build/acl2-8.3dfsg/books/misc/check-fn-inst.cert (2.570s) Making /build/acl2-8.3dfsg/books/misc/check-state.cert on 23-Sep-2022 15:40:07 Built /build/acl2-8.3dfsg/books/misc/check-state.cert (2.070s) Making /build/acl2-8.3dfsg/books/misc/computed-hint.cert on 23-Sep-2022 15:40:09 Built /build/acl2-8.3dfsg/books/misc/computed-hint.cert (4.936s) Making /build/acl2-8.3dfsg/books/misc/csort.cert on 23-Sep-2022 15:40:14 Built /build/acl2-8.3dfsg/books/misc/csort.cert (8.198s) Making /build/acl2-8.3dfsg/books/tools/dead-events.cert on 23-Sep-2022 15:40:22 Built /build/acl2-8.3dfsg/books/tools/dead-events.cert (5.633s) Making /build/acl2-8.3dfsg/books/misc/defabsstobj-example-1.cert on 23-Sep-2022 15:40:28 Built /build/acl2-8.3dfsg/books/misc/defabsstobj-example-1.cert (14.876s) Making /build/acl2-8.3dfsg/books/misc/defabsstobj-example-2.cert on 23-Sep-2022 15:40:43 Built /build/acl2-8.3dfsg/books/misc/defabsstobj-example-2.cert (7.712s) Making /build/acl2-8.3dfsg/books/misc/defabsstobj-example-3.cert on 23-Sep-2022 15:40:51 Built /build/acl2-8.3dfsg/books/misc/defabsstobj-example-3.cert (9.800s) Making /build/acl2-8.3dfsg/books/misc/defabsstobj-example-4.cert on 23-Sep-2022 15:41:01 Built /build/acl2-8.3dfsg/books/misc/defabsstobj-example-4.cert (4.452s) Making /build/acl2-8.3dfsg/books/misc/defabsstobj-example-5.cert on 23-Sep-2022 15:41:06 Built /build/acl2-8.3dfsg/books/misc/defabsstobj-example-5.cert (10.548s) Making /build/acl2-8.3dfsg/books/misc/defattach-bang.cert on 23-Sep-2022 15:41:16 Built /build/acl2-8.3dfsg/books/misc/defattach-bang.cert (2.552s) Making /build/acl2-8.3dfsg/books/misc/defproxy-test.cert on 23-Sep-2022 15:41:19 Built /build/acl2-8.3dfsg/books/misc/defproxy-test.cert (2.401s) Making /build/acl2-8.3dfsg/books/misc/dijkstra-shortest-path.cert on 23-Sep-2022 15:41:22 Built /build/acl2-8.3dfsg/books/misc/dijkstra-shortest-path.cert (122.051s) Making /build/acl2-8.3dfsg/books/misc/disassemble.cert on 23-Sep-2022 15:43:24 Built /build/acl2-8.3dfsg/books/misc/disassemble.cert (1.843s) Making /build/acl2-8.3dfsg/books/misc/eliminate-irrelevance-tests.cert on 23-Sep-2022 15:43:26 Built /build/acl2-8.3dfsg/books/misc/eliminate-irrelevance-tests.cert (2.699s) Making /build/acl2-8.3dfsg/books/misc/enumerate.cert on 23-Sep-2022 15:43:29 Built /build/acl2-8.3dfsg/books/misc/enumerate.cert (2.097s) Making /build/acl2-8.3dfsg/books/misc/getprop.cert on 23-Sep-2022 15:43:31 Built /build/acl2-8.3dfsg/books/misc/getprop.cert (4.965s) Making /build/acl2-8.3dfsg/books/misc/hanoi.cert on 23-Sep-2022 15:43:36 Built /build/acl2-8.3dfsg/books/misc/hanoi.cert (9.197s) Making /build/acl2-8.3dfsg/books/misc/hidden-defpkg-checks/pkg1.cert on 23-Sep-2022 15:43:45 Built /build/acl2-8.3dfsg/books/misc/hidden-defpkg-checks/pkg1.cert (1.847s) Making /build/acl2-8.3dfsg/books/misc/hidden-defpkg-checks/pkg2.cert on 23-Sep-2022 15:43:47 Built /build/acl2-8.3dfsg/books/misc/hidden-defpkg-checks/pkg2.cert (1.823s) Making /build/acl2-8.3dfsg/books/misc/how-to-prove-thms.cert on 23-Sep-2022 15:43:49 Built /build/acl2-8.3dfsg/books/misc/how-to-prove-thms.cert (5.847s) Making /build/acl2-8.3dfsg/books/misc/integer-type-set-test.cert on 23-Sep-2022 15:43:55 Built /build/acl2-8.3dfsg/books/misc/integer-type-set-test.cert (2.100s) Making /build/acl2-8.3dfsg/books/misc/multi-v-uni.cert on 23-Sep-2022 15:43:58 Built /build/acl2-8.3dfsg/books/misc/multi-v-uni.cert (14.168s) Making /build/acl2-8.3dfsg/books/misc/oprof.cert on 23-Sep-2022 15:44:12 Built /build/acl2-8.3dfsg/books/misc/oprof.cert (2.007s) Making /build/acl2-8.3dfsg/books/misc/priorities.cert on 23-Sep-2022 15:44:14 Built /build/acl2-8.3dfsg/books/misc/priorities.cert (2.849s) Making /build/acl2-8.3dfsg/books/misc/process-book-readme.cert on 23-Sep-2022 15:44:17 Built /build/acl2-8.3dfsg/books/misc/process-book-readme.cert (4.077s) Making /build/acl2-8.3dfsg/books/misc/profiling.cert on 23-Sep-2022 15:44:21 Built /build/acl2-8.3dfsg/books/misc/profiling.cert (2.849s) Making /build/acl2-8.3dfsg/books/misc/redef-pkg.cert on 23-Sep-2022 15:44:24 Built /build/acl2-8.3dfsg/books/misc/redef-pkg.cert (3.636s) Making /build/acl2-8.3dfsg/books/misc/save-time.cert on 23-Sep-2022 15:44:28 Built /build/acl2-8.3dfsg/books/misc/save-time.cert (3.214s) Making /build/acl2-8.3dfsg/books/misc/sort-symbols.cert on 23-Sep-2022 15:44:31 Built /build/acl2-8.3dfsg/books/misc/sort-symbols.cert (3.809s) Making /build/acl2-8.3dfsg/books/misc/sticky-disable.cert on 23-Sep-2022 15:44:35 Built /build/acl2-8.3dfsg/books/misc/sticky-disable.cert (2.563s) Making /build/acl2-8.3dfsg/books/misc/transfinite.cert on 23-Sep-2022 15:44:38 Built /build/acl2-8.3dfsg/books/misc/transfinite.cert (2.706s) Making /build/acl2-8.3dfsg/books/misc/wet.cert on 23-Sep-2022 15:44:41 Built /build/acl2-8.3dfsg/books/misc/wet.cert (4.098s) Making /build/acl2-8.3dfsg/books/models/jvm/guard-verified-m1/use-when.cert on 23-Sep-2022 15:44:45 Built /build/acl2-8.3dfsg/books/models/jvm/guard-verified-m1/use-when.cert (3.178s) Making /build/acl2-8.3dfsg/books/models/jvm/m1-original/problem-set-1-answers.cert on 23-Sep-2022 15:44:48 Built /build/acl2-8.3dfsg/books/models/jvm/m1-original/problem-set-1-answers.cert (5.455s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/util.cert on 23-Sep-2022 15:44:54 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/util.cert (3.168s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/ground-zero.cert on 23-Sep-2022 15:44:57 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/ground-zero.cert (2.407s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/rewrite-theory.cert on 23-Sep-2022 15:45:00 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/rewrite-theory.cert (2.606s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/cat-def.cert on 23-Sep-2022 15:45:03 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/cat-def.cert (3.794s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/negative-syntaxp.cert on 23-Sep-2022 15:45:07 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/negative-syntaxp.cert (2.765s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/inverted-factor.cert on 23-Sep-2022 15:45:09 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/inverted-factor.cert (3.746s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/predicate.cert on 23-Sep-2022 15:45:13 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/predicate.cert (2.552s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logs.cert on 23-Sep-2022 15:45:16 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logs.cert (4.377s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/all-ones.cert on 23-Sep-2022 15:45:21 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/all-ones.cert (2.777s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logior1-proofs.cert on 23-Sep-2022 15:45:23 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logior1-proofs.cert (2.403s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/openers.cert on 23-Sep-2022 15:45:26 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/openers.cert (2.813s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/package-defs.cert on 23-Sep-2022 15:45:29 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/package-defs.cert (2.422s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/util.cert on 23-Sep-2022 15:45:32 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/util.cert (3.079s) Making /build/acl2-8.3dfsg/books/models/jvm/m5/perm.cert on 23-Sep-2022 15:45:35 Built /build/acl2-8.3dfsg/books/models/jvm/m5/perm.cert (2.870s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/1999/calculus/solutions/partition-defuns.cert on 23-Sep-2022 15:45:38 Built /build/acl2-8.3dfsg/books/nonstd/workshops/1999/calculus/solutions/partition-defuns.cert (2.748s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/1999/calculus/solutions/riemann-rcfn-helpers.cert on 23-Sep-2022 15:45:41 Built /build/acl2-8.3dfsg/books/nonstd/workshops/1999/calculus/solutions/riemann-rcfn-helpers.cert (2.477s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/2011/reid-gamboa-differentiator/support/composition-helpers.cert on 23-Sep-2022 15:45:43 Built /build/acl2-8.3dfsg/books/nonstd/workshops/2011/reid-gamboa-differentiator/support/composition-helpers.cert (6.934s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/2011/reid-gamboa-differentiator/support/defderivative.cert on 23-Sep-2022 15:45:50 Built /build/acl2-8.3dfsg/books/nonstd/workshops/2011/reid-gamboa-differentiator/support/defderivative.cert (2.068s) Making /build/acl2-8.3dfsg/books/ordinals/ordinal-counter-examples.cert on 23-Sep-2022 15:45:53 Built /build/acl2-8.3dfsg/books/ordinals/ordinal-counter-examples.cert (1.811s) Making /build/acl2-8.3dfsg/books/ordinals/proof-of-well-foundedness.cert on 23-Sep-2022 15:45:55 Built /build/acl2-8.3dfsg/books/ordinals/proof-of-well-foundedness.cert (4.960s) Making /build/acl2-8.3dfsg/books/tools/theory-tools.cert on 23-Sep-2022 15:46:00 Built /build/acl2-8.3dfsg/books/tools/theory-tools.cert (2.851s) Making /build/acl2-8.3dfsg/books/projects/regex/portcullis.cert on 23-Sep-2022 15:46:03 Built /build/acl2-8.3dfsg/books/projects/regex/portcullis.cert (2.480s) Making /build/acl2-8.3dfsg/books/projects/async/tools/convert-edif.cert on 23-Sep-2022 15:46:06 Built /build/acl2-8.3dfsg/books/projects/async/tools/convert-edif.cert (2.637s) Making /build/acl2-8.3dfsg/books/projects/codewalker/if-tracker.cert on 23-Sep-2022 15:46:08 Built /build/acl2-8.3dfsg/books/projects/codewalker/if-tracker.cert (3.972s) Making /build/acl2-8.3dfsg/books/projects/equational/bewijs.cert on 23-Sep-2022 15:46:12 Built /build/acl2-8.3dfsg/books/projects/equational/bewijs.cert (2.551s) Making /build/acl2-8.3dfsg/books/projects/equational/general.cert on 23-Sep-2022 15:46:15 Built /build/acl2-8.3dfsg/books/projects/equational/general.cert (3.193s) Making /build/acl2-8.3dfsg/books/projects/fm9001/portcullis.cert on 23-Sep-2022 15:46:18 Built /build/acl2-8.3dfsg/books/projects/fm9001/portcullis.cert (1.786s) Making /build/acl2-8.3dfsg/books/projects/leftist-trees/leftist-tree-defuns.cert on 23-Sep-2022 15:46:20 Built /build/acl2-8.3dfsg/books/projects/leftist-trees/leftist-tree-defuns.cert (4.461s) Making /build/acl2-8.3dfsg/books/sorting/perm.cert on 23-Sep-2022 15:46:25 Built /build/acl2-8.3dfsg/books/sorting/perm.cert (2.413s) Making /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/portcullis.cert on 23-Sep-2022 15:46:28 Built /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/portcullis.cert (1.776s) Making /build/acl2-8.3dfsg/books/projects/pltpa/pltpa.cert on 23-Sep-2022 15:46:29 Built /build/acl2-8.3dfsg/books/projects/pltpa/pltpa.cert (33.631s) Making /build/acl2-8.3dfsg/books/projects/regex/defset-macros.cert on 23-Sep-2022 15:47:03 Built /build/acl2-8.3dfsg/books/projects/regex/defset-macros.cert (13.964s) Making /build/acl2-8.3dfsg/books/projects/regex/regex-chartrans.cert on 23-Sep-2022 15:47:17 Built /build/acl2-8.3dfsg/books/projects/regex/regex-chartrans.cert (3.594s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/incremental/limits.cert on 23-Sep-2022 15:47:21 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/incremental/limits.cert (6.653s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/ternary.cert on 23-Sep-2022 15:47:28 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/ternary.cert (2.152s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/literal.cert on 23-Sep-2022 15:47:30 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/literal.cert (2.221s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/mv-nth.cert on 23-Sep-2022 15:47:33 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/mv-nth.cert (1.960s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/lrat-checker.cert on 23-Sep-2022 15:47:35 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/lrat-checker.cert (15.444s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/lrat-checker.cert on 23-Sep-2022 15:47:50 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/lrat-checker.cert (16.740s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/stobj-based/limits.cert on 23-Sep-2022 15:48:07 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/stobj-based/limits.cert (5.949s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-array/supplemental/sb60.cert on 23-Sep-2022 15:48:13 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-array/supplemental/sb60.cert (1.936s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-array/supplemental/ternary.cert on 23-Sep-2022 15:48:15 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-array/supplemental/ternary.cert (2.241s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-array/supplemental/mv-nth.cert on 23-Sep-2022 15:48:18 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-array/supplemental/mv-nth.cert (1.944s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-array/supplemental/old-literal.cert on 23-Sep-2022 15:48:20 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-array/supplemental/old-literal.cert (2.290s) Making /build/acl2-8.3dfsg/books/projects/security/jfkr/encryption.cert on 23-Sep-2022 15:48:22 Built /build/acl2-8.3dfsg/books/projects/security/jfkr/encryption.cert (3.384s) Making /build/acl2-8.3dfsg/books/projects/stateman/portcullis.cert on 23-Sep-2022 15:48:26 Built /build/acl2-8.3dfsg/books/projects/stateman/portcullis.cert (2.119s) Making /build/acl2-8.3dfsg/books/tau/bounders/find-minimal-2d.cert on 23-Sep-2022 15:48:28 Built /build/acl2-8.3dfsg/books/tau/bounders/find-minimal-2d.cert (3.381s) Making /build/acl2-8.3dfsg/books/tau/bounders/find-maximal-2d.cert on 23-Sep-2022 15:48:32 Built /build/acl2-8.3dfsg/books/tau/bounders/find-maximal-2d.cert (3.121s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/tree-manip/quicksort.cert on 23-Sep-2022 15:48:35 Built /build/acl2-8.3dfsg/books/projects/taspi/code/tree-manip/quicksort.cert (3.649s) Making /build/acl2-8.3dfsg/books/projects/taspi/database/db-from-list.cert on 23-Sep-2022 15:48:39 Built /build/acl2-8.3dfsg/books/projects/taspi/database/db-from-list.cert (2.263s) Making /build/acl2-8.3dfsg/books/projects/taspi/proofs/sets.cert on 23-Sep-2022 15:48:41 Built /build/acl2-8.3dfsg/books/projects/taspi/proofs/sets.cert (8.905s) Making /build/acl2-8.3dfsg/books/projects/taspi/tree-generation/distance-based/naive-quartet-method.cert on 23-Sep-2022 15:48:50 Built /build/acl2-8.3dfsg/books/projects/taspi/tree-generation/distance-based/naive-quartet-method.cert (14.872s) Making /build/acl2-8.3dfsg/books/projects/taspi/tree-score/efficient-pscores-help.cert on 23-Sep-2022 15:49:05 Built /build/acl2-8.3dfsg/books/projects/taspi/tree-score/efficient-pscores-help.cert (2.650s) Making /build/acl2-8.3dfsg/books/projects/wp-gen/shared.cert on 23-Sep-2022 15:49:08 Built /build/acl2-8.3dfsg/books/projects/wp-gen/shared.cert (2.455s) Making /build/acl2-8.3dfsg/books/proofstyles/completeness/generic-partial.cert on 23-Sep-2022 15:49:11 Built /build/acl2-8.3dfsg/books/proofstyles/completeness/generic-partial.cert (3.111s) Making /build/acl2-8.3dfsg/books/proofstyles/completeness/generic-total.cert on 23-Sep-2022 15:49:14 Built /build/acl2-8.3dfsg/books/proofstyles/completeness/generic-total.cert (3.349s) Making /build/acl2-8.3dfsg/books/proofstyles/soundness/clock-partial.cert on 23-Sep-2022 15:49:17 Built /build/acl2-8.3dfsg/books/proofstyles/soundness/clock-partial.cert (3.105s) Making /build/acl2-8.3dfsg/books/proofstyles/soundness/clock-total.cert on 23-Sep-2022 15:49:21 Built /build/acl2-8.3dfsg/books/proofstyles/soundness/clock-total.cert (3.534s) Making /build/acl2-8.3dfsg/books/rtl/rel1/support/rewrite-theory.cert on 23-Sep-2022 15:49:24 Built /build/acl2-8.3dfsg/books/rtl/rel1/support/rewrite-theory.cert (2.237s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/lib/openers.cert on 23-Sep-2022 15:49:27 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/lib/openers.cert (2.907s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/lib/package-defs.cert on 23-Sep-2022 15:49:30 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/lib/package-defs.cert (2.431s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/openers.cert on 23-Sep-2022 15:49:32 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/openers.cert (2.782s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/package-defs.cert on 23-Sep-2022 15:49:35 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/package-defs.cert (2.463s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2/openers.cert on 23-Sep-2022 15:49:38 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2/openers.cert (2.854s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2/package-defs.cert on 23-Sep-2022 15:49:41 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2/package-defs.cert (2.374s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib3/openers.cert on 23-Sep-2022 15:49:43 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib3/openers.cert (2.854s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib3/package-defs.cert on 23-Sep-2022 15:49:46 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib3/package-defs.cert (2.131s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/fast-and.cert on 23-Sep-2022 15:49:49 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/fast-and.cert (2.585s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/log-equal.cert on 23-Sep-2022 15:49:51 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/log-equal.cert (2.267s) Making /build/acl2-8.3dfsg/books/rtl/rel4/lib/openers.cert on 23-Sep-2022 15:49:54 Built /build/acl2-8.3dfsg/books/rtl/rel4/lib/openers.cert (2.440s) Making /build/acl2-8.3dfsg/books/rtl/rel4/lib/package-defs.cert on 23-Sep-2022 15:49:56 Built /build/acl2-8.3dfsg/books/rtl/rel4/lib/package-defs.cert (1.813s) Making /build/acl2-8.3dfsg/books/rtl/rel4/lib/rom-helpers.cert on 23-Sep-2022 15:49:58 Built /build/acl2-8.3dfsg/books/rtl/rel4/lib/rom-helpers.cert (2.333s) Making /build/acl2-8.3dfsg/books/rtl/rel4/support/fast-and.cert on 23-Sep-2022 15:50:01 Built /build/acl2-8.3dfsg/books/rtl/rel4/support/fast-and.cert (2.133s) Making /build/acl2-8.3dfsg/books/rtl/rel4/support/log-equal.cert on 23-Sep-2022 15:50:03 Built /build/acl2-8.3dfsg/books/rtl/rel4/support/log-equal.cert (1.806s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/rewrite-theory.cert on 23-Sep-2022 15:50:05 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/rewrite-theory.cert (2.170s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/cat-def.cert on 23-Sep-2022 15:50:07 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/cat-def.cert (3.009s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logs.cert on 23-Sep-2022 15:50:10 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logs.cert (3.772s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/all-ones.cert on 23-Sep-2022 15:50:14 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/all-ones.cert (2.122s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logior1-proofs.cert on 23-Sep-2022 15:50:17 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logior1-proofs.cert (1.870s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/rom-helpers.cert on 23-Sep-2022 15:50:19 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/rom-helpers.cert (2.493s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/openers.cert on 23-Sep-2022 15:50:21 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/openers.cert (2.280s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/package-defs.cert on 23-Sep-2022 15:50:24 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/package-defs.cert (1.852s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/util.cert on 23-Sep-2022 15:50:26 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/util.cert (2.648s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib2/rom-helpers.cert on 23-Sep-2022 15:50:28 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib2/rom-helpers.cert (2.355s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib3.delta2/rom-helpers.cert on 23-Sep-2022 15:50:31 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib3.delta2/rom-helpers.cert (2.289s) Making /build/acl2-8.3dfsg/books/rtl/rel9/lib/openers.cert on 23-Sep-2022 15:50:33 Built /build/acl2-8.3dfsg/books/rtl/rel9/lib/openers.cert (2.438s) Making /build/acl2-8.3dfsg/books/rtl/rel9/lib/package-defs.cert on 23-Sep-2022 15:50:36 Built /build/acl2-8.3dfsg/books/rtl/rel9/lib/package-defs.cert (1.926s) Making /build/acl2-8.3dfsg/books/rtl/rel9/lib/rom-helpers.cert on 23-Sep-2022 15:50:38 Built /build/acl2-8.3dfsg/books/rtl/rel9/lib/rom-helpers.cert (2.282s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/openers.cert on 23-Sep-2022 15:50:40 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/openers.cert (2.311s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/package-defs.cert on 23-Sep-2022 15:50:43 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/package-defs.cert (1.951s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/rom-helpers.cert on 23-Sep-2022 15:50:45 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/rom-helpers.cert (2.231s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib2/openers.cert on 23-Sep-2022 15:50:47 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib2/openers.cert (2.451s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib2/package-defs.cert on 23-Sep-2022 15:50:50 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib2/package-defs.cert (1.825s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib3/openers.cert on 23-Sep-2022 15:50:52 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib3/openers.cert (2.361s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib3/package-defs.cert on 23-Sep-2022 15:50:54 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib3/package-defs.cert (1.858s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib3/rom-helpers.cert on 23-Sep-2022 15:50:56 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib3/rom-helpers.cert (2.374s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/fast-and.cert on 23-Sep-2022 15:50:59 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/fast-and.cert (2.158s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/log-equal.cert on 23-Sep-2022 15:51:01 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/log-equal.cert (1.877s) Making /build/acl2-8.3dfsg/books/std/util/generate-symbol.cert on 23-Sep-2022 15:51:03 Built /build/acl2-8.3dfsg/books/std/util/generate-symbol.cert (3.237s) Making /build/acl2-8.3dfsg/books/system/compare-out-files.cert on 23-Sep-2022 15:51:07 Built /build/acl2-8.3dfsg/books/system/compare-out-files.cert (19.787s) Making /build/acl2-8.3dfsg/books/system/dead-source-code.cert on 23-Sep-2022 15:51:27 Built /build/acl2-8.3dfsg/books/system/dead-source-code.cert (6.986s) Making /build/acl2-8.3dfsg/books/system/optimize-check-aux.cert on 23-Sep-2022 15:51:34 Built /build/acl2-8.3dfsg/books/system/optimize-check-aux.cert (2.950s) Making /build/acl2-8.3dfsg/books/system/pcert/acl2x-pcert-test-1.acl2x on 23-Sep-2022 15:51:37 Built /build/acl2-8.3dfsg/books/system/pcert/acl2x-pcert-test-1.acl2x (1.084s) Making /build/acl2-8.3dfsg/books/system/pcert/acl2x-pcert-test-2.acl2x on 23-Sep-2022 15:51:38 Built /build/acl2-8.3dfsg/books/system/pcert/acl2x-pcert-test-2.acl2x (1.021s) Making /build/acl2-8.3dfsg/books/system/pcert/elide-test.pcert0 on 23-Sep-2022 15:51:39 Built /build/acl2-8.3dfsg/books/system/pcert/elide-test.pcert0 (2.387s) Making /build/acl2-8.3dfsg/books/system/pcert/sub.pcert0 on 23-Sep-2022 15:51:42 Built /build/acl2-8.3dfsg/books/system/pcert/sub.pcert0 (2.360s) Making /build/acl2-8.3dfsg/books/system/pcert/pkg-test.cert on 23-Sep-2022 15:51:44 Built /build/acl2-8.3dfsg/books/system/pcert/pkg-test.cert (1.903s) Making /build/acl2-8.3dfsg/books/system/tests/cert-data/encap.cert on 23-Sep-2022 15:51:46 Built /build/acl2-8.3dfsg/books/system/tests/cert-data/encap.cert (2.197s) Making /build/acl2-8.3dfsg/books/system/tests/cert-data/redef.cert on 23-Sep-2022 15:51:49 Built /build/acl2-8.3dfsg/books/system/tests/cert-data/redef.cert (1.987s) Making /build/acl2-8.3dfsg/books/system/tests/cert-data/sub1.cert on 23-Sep-2022 15:51:51 Built /build/acl2-8.3dfsg/books/system/tests/cert-data/sub1.cert (2.024s) Making /build/acl2-8.3dfsg/books/system/tests/cert-data/verify-termination.cert on 23-Sep-2022 15:51:53 Built /build/acl2-8.3dfsg/books/system/tests/cert-data/verify-termination.cert (1.889s) Making /build/acl2-8.3dfsg/books/system/tests/fmt-to-string.cert on 23-Sep-2022 15:51:55 Built /build/acl2-8.3dfsg/books/system/tests/fmt-to-string.cert (1.948s) Making /build/acl2-8.3dfsg/books/system/tests/induction-rule-with-disabled-scheme.cert on 23-Sep-2022 15:51:57 Built /build/acl2-8.3dfsg/books/system/tests/induction-rule-with-disabled-scheme.cert (2.144s) Making /build/acl2-8.3dfsg/books/system/tests/nested-stobj-formals.cert on 23-Sep-2022 15:52:00 Built /build/acl2-8.3dfsg/books/system/tests/nested-stobj-formals.cert (3.985s) Making /build/acl2-8.3dfsg/books/system/tests/state-p-in-guard.cert on 23-Sep-2022 15:52:04 Built /build/acl2-8.3dfsg/books/system/tests/state-p-in-guard.cert (2.519s) Making /build/acl2-8.3dfsg/books/system/tests/stobj-issues.cert on 23-Sep-2022 15:52:06 Built /build/acl2-8.3dfsg/books/system/tests/stobj-issues.cert (12.046s) Making /build/acl2-8.3dfsg/books/system/tests/tau-contradiction.cert on 23-Sep-2022 15:52:19 Built /build/acl2-8.3dfsg/books/system/tests/tau-contradiction.cert (2.086s) Making /build/acl2-8.3dfsg/books/system/tests/verify-termination/sub.cert on 23-Sep-2022 15:52:21 Built /build/acl2-8.3dfsg/books/system/tests/verify-termination/sub.cert (1.804s) Making /build/acl2-8.3dfsg/books/system/update-state.cert on 23-Sep-2022 15:52:23 Built /build/acl2-8.3dfsg/books/system/update-state.cert (9.450s) Making /build/acl2-8.3dfsg/books/tau/bounders/find-maximal-1d.cert on 23-Sep-2022 15:52:32 Built /build/acl2-8.3dfsg/books/tau/bounders/find-maximal-1d.cert (2.777s) Making /build/acl2-8.3dfsg/books/tau/bounders/find-minimal-1d.cert on 23-Sep-2022 15:52:35 Built /build/acl2-8.3dfsg/books/tau/bounders/find-minimal-1d.cert (2.682s) Making /build/acl2-8.3dfsg/books/textbook/chap10/ac-example.cert on 23-Sep-2022 15:52:38 Built /build/acl2-8.3dfsg/books/textbook/chap10/ac-example.cert (2.608s) Making /build/acl2-8.3dfsg/books/textbook/chap10/adder.cert on 23-Sep-2022 15:52:41 Built /build/acl2-8.3dfsg/books/textbook/chap10/adder.cert (3.107s) Making /build/acl2-8.3dfsg/books/textbook/chap10/compiler.cert on 23-Sep-2022 15:52:44 Built /build/acl2-8.3dfsg/books/textbook/chap10/compiler.cert (5.004s) Making /build/acl2-8.3dfsg/books/textbook/chap10/fact.cert on 23-Sep-2022 15:52:49 Built /build/acl2-8.3dfsg/books/textbook/chap10/fact.cert (2.283s) Making /build/acl2-8.3dfsg/books/textbook/chap10/insertion-sort.cert on 23-Sep-2022 15:52:52 Built /build/acl2-8.3dfsg/books/textbook/chap10/insertion-sort.cert (2.860s) Making /build/acl2-8.3dfsg/books/textbook/chap10/tree.cert on 23-Sep-2022 15:52:55 Built /build/acl2-8.3dfsg/books/textbook/chap10/tree.cert (2.979s) Making /build/acl2-8.3dfsg/books/textbook/chap11/compress.cert on 23-Sep-2022 15:52:58 Built /build/acl2-8.3dfsg/books/textbook/chap11/compress.cert (3.764s) Making /build/acl2-8.3dfsg/books/textbook/chap11/encap.cert on 23-Sep-2022 15:53:02 Built /build/acl2-8.3dfsg/books/textbook/chap11/encap.cert (3.061s) Making /build/acl2-8.3dfsg/books/textbook/chap11/how-many-soln2.cert on 23-Sep-2022 15:53:05 Built /build/acl2-8.3dfsg/books/textbook/chap11/how-many-soln2.cert (4.220s) Making /build/acl2-8.3dfsg/books/textbook/chap11/summations.cert on 23-Sep-2022 15:53:09 Built /build/acl2-8.3dfsg/books/textbook/chap11/summations.cert (3.693s) Making /build/acl2-8.3dfsg/books/textbook/chap11/xtr.cert on 23-Sep-2022 15:53:13 Built /build/acl2-8.3dfsg/books/textbook/chap11/xtr.cert (2.859s) Making /build/acl2-8.3dfsg/books/textbook/chap3/programs.cert on 23-Sep-2022 15:53:16 Built /build/acl2-8.3dfsg/books/textbook/chap3/programs.cert (3.932s) Making /build/acl2-8.3dfsg/books/textbook/chap4/solutions-program-mode.cert on 23-Sep-2022 15:53:20 Built /build/acl2-8.3dfsg/books/textbook/chap4/solutions-program-mode.cert (11.011s) Making /build/acl2-8.3dfsg/books/textbook/chap5/solutions.cert on 23-Sep-2022 15:53:31 Built /build/acl2-8.3dfsg/books/textbook/chap5/solutions.cert (3.035s) Making /build/acl2-8.3dfsg/books/tools/cws.cert on 23-Sep-2022 15:53:35 Built /build/acl2-8.3dfsg/books/tools/cws.cert (2.037s) Making /build/acl2-8.3dfsg/books/tools/define-keyed-function.cert on 23-Sep-2022 15:53:37 Built /build/acl2-8.3dfsg/books/tools/define-keyed-function.cert (2.984s) Making /build/acl2-8.3dfsg/books/tools/defined-const.cert on 23-Sep-2022 15:53:40 Built /build/acl2-8.3dfsg/books/tools/defined-const.cert (7.561s) Making /build/acl2-8.3dfsg/books/tools/in-raw-mode.cert on 23-Sep-2022 15:53:48 Built /build/acl2-8.3dfsg/books/tools/in-raw-mode.cert (1.793s) Making /build/acl2-8.3dfsg/books/tools/k-induction.cert on 23-Sep-2022 15:53:49 Built /build/acl2-8.3dfsg/books/tools/k-induction.cert (2.903s) Making /build/acl2-8.3dfsg/books/tools/oracle-eval-real.cert on 23-Sep-2022 15:53:53 Built /build/acl2-8.3dfsg/books/tools/oracle-eval-real.cert (2.322s) Making /build/acl2-8.3dfsg/books/tools/prettygoals/portcullis.cert on 23-Sep-2022 15:53:55 Built /build/acl2-8.3dfsg/books/tools/prettygoals/portcullis.cert (2.175s) Making /build/acl2-8.3dfsg/books/tools/rewrite-with-equality.cert on 23-Sep-2022 15:53:57 Built /build/acl2-8.3dfsg/books/tools/rewrite-with-equality.cert (8.198s) Making /build/acl2-8.3dfsg/books/tools/saved-errors.cert on 23-Sep-2022 15:54:06 Built /build/acl2-8.3dfsg/books/tools/saved-errors.cert (3.029s) Making /build/acl2-8.3dfsg/books/tools/table-replay.cert on 23-Sep-2022 15:54:09 Built /build/acl2-8.3dfsg/books/tools/table-replay.cert (2.118s) Making /build/acl2-8.3dfsg/books/tools/time-dollar-with-gc.cert on 23-Sep-2022 15:54:11 Built /build/acl2-8.3dfsg/books/tools/time-dollar-with-gc.cert (1.843s) Making /build/acl2-8.3dfsg/books/tools/with-supporters-test-sub.cert on 23-Sep-2022 15:54:13 Built /build/acl2-8.3dfsg/books/tools/with-supporters-test-sub.cert (2.206s) Making /build/acl2-8.3dfsg/books/unicode/uchar.cert on 23-Sep-2022 15:54:15 Built /build/acl2-8.3dfsg/books/unicode/uchar.cert (2.762s) Making /build/acl2-8.3dfsg/books/workshops/1999/calculus/solutions/partition-defuns.cert on 23-Sep-2022 15:54:18 Built /build/acl2-8.3dfsg/books/workshops/1999/calculus/solutions/partition-defuns.cert (2.762s) Making /build/acl2-8.3dfsg/books/workshops/1999/calculus/solutions/riemann-rcfn-helpers.cert on 23-Sep-2022 15:54:21 Built /build/acl2-8.3dfsg/books/workshops/1999/calculus/solutions/riemann-rcfn-helpers.cert (2.374s) Making /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/help-defuns.cert on 23-Sep-2022 15:54:24 Built /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/help-defuns.cert (3.227s) Making /build/acl2-8.3dfsg/books/workshops/1999/embedded/Exercises/Exercise1-1/Exercise1.1.cert on 23-Sep-2022 15:54:27 Built /build/acl2-8.3dfsg/books/workshops/1999/embedded/Exercises/Exercise1-1/Exercise1.1.cert (3.246s) Making /build/acl2-8.3dfsg/books/workshops/1999/embedded/Exercises/Exercise1-3/Exercise1.3.cert on 23-Sep-2022 15:54:30 Built /build/acl2-8.3dfsg/books/workshops/1999/embedded/Exercises/Exercise1-3/Exercise1.3.cert (2.538s) Making /build/acl2-8.3dfsg/books/workshops/1999/embedded/Proof-Of-Contribution/Generic.cert on 23-Sep-2022 15:54:33 Built /build/acl2-8.3dfsg/books/workshops/1999/embedded/Proof-Of-Contribution/Generic.cert (1.979s) Making /build/acl2-8.3dfsg/books/workshops/1999/embedded/Proof-Of-Contribution/Memory-Assoc.cert on 23-Sep-2022 15:54:35 Built /build/acl2-8.3dfsg/books/workshops/1999/embedded/Proof-Of-Contribution/Memory-Assoc.cert (5.026s) Making /build/acl2-8.3dfsg/books/workshops/1999/graph/helpers.cert on 23-Sep-2022 15:54:40 Built /build/acl2-8.3dfsg/books/workshops/1999/graph/helpers.cert (2.376s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/sets.cert on 23-Sep-2022 15:54:43 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/sets.cert (4.775s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/gensym-e.cert on 23-Sep-2022 15:54:48 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/gensym-e.cert (8.376s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/exercises/solution6.cert on 23-Sep-2022 15:54:56 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/exercises/solution6.cert (8.423s) Making /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise1.cert on 23-Sep-2022 15:55:05 Built /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise1.cert (1.933s) Making /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise2.cert on 23-Sep-2022 15:55:07 Built /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise2.cert (2.134s) Making /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise4a.cert on 23-Sep-2022 15:55:09 Built /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise4a.cert (1.978s) Making /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise4b.cert on 23-Sep-2022 15:55:12 Built /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise4b.cert (2.236s) Making /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise5.cert on 23-Sep-2022 15:55:14 Built /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise5.cert (2.721s) Making /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise6a.cert on 23-Sep-2022 15:55:17 Built /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise6a.cert (2.592s) Making /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise6b.cert on 23-Sep-2022 15:55:19 Built /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise6b.cert (2.785s) Making /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise7a.cert on 23-Sep-2022 15:55:22 Built /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise7a.cert (1.984s) Making /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise7b.cert on 23-Sep-2022 15:55:25 Built /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise7b.cert (2.149s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/book/sets.cert on 23-Sep-2022 15:55:27 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/book/sets.cert (3.088s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/defung.cert on 23-Sep-2022 15:55:30 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/defung.cert (2.414s) Making /build/acl2-8.3dfsg/books/workshops/1999/pipeline/exercise.cert on 23-Sep-2022 15:55:33 Built /build/acl2-8.3dfsg/books/workshops/1999/pipeline/exercise.cert (2.548s) Making /build/acl2-8.3dfsg/books/workshops/1999/vhdl/vhdl.cert on 23-Sep-2022 15:55:35 Built /build/acl2-8.3dfsg/books/workshops/1999/vhdl/vhdl.cert (10.823s) Making /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/util.cert on 23-Sep-2022 15:55:46 Built /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/util.cert (3.335s) Making /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/gensym-e.cert on 23-Sep-2022 15:55:50 Built /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/gensym-e.cert (8.429s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/top/alist-thms.cert on 23-Sep-2022 15:55:58 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/top/alist-thms.cert (2.429s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/top/nth-thms.cert on 23-Sep-2022 15:56:01 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/top/nth-thms.cert (1.936s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/top/defun-weak-sk.cert on 23-Sep-2022 15:56:03 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/top/defun-weak-sk.cert (2.343s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/top/inst.cert on 23-Sep-2022 15:56:06 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/top/inst.cert (2.035s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/top/det-macros.cert on 23-Sep-2022 15:56:08 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/top/det-macros.cert (3.162s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/top/inst.cert on 23-Sep-2022 15:56:11 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/top/inst.cert (2.076s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/top/non-det-macros.cert on 23-Sep-2022 15:56:13 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/top/non-det-macros.cert (3.034s) Making /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/term.cert on 23-Sep-2022 15:56:16 Built /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/term.cert (3.276s) Making /build/acl2-8.3dfsg/books/workshops/2000/moore-manolios/partial-functions/defpun-original.cert on 23-Sep-2022 15:56:20 Built /build/acl2-8.3dfsg/books/workshops/2000/moore-manolios/partial-functions/defpun-original.cert (6.034s) Making /build/acl2-8.3dfsg/books/workshops/2000/moore-manolios/partial-functions/tjvm.cert on 23-Sep-2022 15:56:26 Built /build/acl2-8.3dfsg/books/workshops/2000/moore-manolios/partial-functions/tjvm.cert (9.968s) Making /build/acl2-8.3dfsg/books/workshops/2000/sumners2/bdds/bdd-mgr.cert on 23-Sep-2022 15:56:36 Built /build/acl2-8.3dfsg/books/workshops/2000/sumners2/bdds/bdd-mgr.cert (13.239s) Making /build/acl2-8.3dfsg/books/workshops/2002/cowles-flat/support/flat.cert on 23-Sep-2022 15:56:50 Built /build/acl2-8.3dfsg/books/workshops/2002/cowles-flat/support/flat.cert (6.830s) Making /build/acl2-8.3dfsg/books/workshops/2002/cowles-primrec/support/bad-def.cert on 23-Sep-2022 15:56:57 Built /build/acl2-8.3dfsg/books/workshops/2002/cowles-primrec/support/bad-def.cert (2.244s) Making /build/acl2-8.3dfsg/books/workshops/2002/cowles-primrec/support/bad-def1.cert on 23-Sep-2022 15:56:59 Built /build/acl2-8.3dfsg/books/workshops/2002/cowles-primrec/support/bad-def1.cert (2.222s) Making /build/acl2-8.3dfsg/books/workshops/2002/cowles-primrec/support/defpr.cert on 23-Sep-2022 15:57:01 Built /build/acl2-8.3dfsg/books/workshops/2002/cowles-primrec/support/defpr.cert (5.449s) Making /build/acl2-8.3dfsg/books/workshops/2002/cowles-primrec/support/fix.cert on 23-Sep-2022 15:57:07 Built /build/acl2-8.3dfsg/books/workshops/2002/cowles-primrec/support/fix.cert (2.127s) Making /build/acl2-8.3dfsg/books/workshops/2002/cowles-primrec/support/primitive.cert on 23-Sep-2022 15:57:09 Built /build/acl2-8.3dfsg/books/workshops/2002/cowles-primrec/support/primitive.cert (4.007s) Making /build/acl2-8.3dfsg/books/workshops/2002/cowles-primrec/support/tail.cert on 23-Sep-2022 15:57:13 Built /build/acl2-8.3dfsg/books/workshops/2002/cowles-primrec/support/tail.cert (2.989s) Making /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/finite-set-theory/total-ordering-original.cert on 23-Sep-2022 15:57:16 Built /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/finite-set-theory/total-ordering-original.cert (5.127s) Making /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/finite-set-theory/total-ordering.cert on 23-Sep-2022 15:57:22 Built /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/finite-set-theory/total-ordering.cert (2.444s) Making /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/records/records-original.cert on 23-Sep-2022 15:57:24 Built /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/records/records-original.cert (17.317s) Making /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/sorting/perm.cert on 23-Sep-2022 15:57:42 Built /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/sorting/perm.cert (2.505s) Making /build/acl2-8.3dfsg/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/generic-theory.cert on 23-Sep-2022 15:57:44 Built /build/acl2-8.3dfsg/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/generic-theory.cert (2.972s) Making /build/acl2-8.3dfsg/books/workshops/2002/martin-alonso-perez-sancho/support/Adleman.cert on 23-Sep-2022 15:57:48 Built /build/acl2-8.3dfsg/books/workshops/2002/martin-alonso-perez-sancho/support/Adleman.cert (8.554s) Making /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-2/upol-2.cert on 23-Sep-2022 15:57:56 Built /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-2/upol-2.cert (3.299s) Making /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-2/upol-1.cert on 23-Sep-2022 15:58:00 Built /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-2/upol-1.cert (3.208s) Making /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/term.cert on 23-Sep-2022 15:58:03 Built /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/term.cert (2.590s) Making /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/ordinal-ordering.cert on 23-Sep-2022 15:58:06 Built /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/ordinal-ordering.cert (2.533s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-dags/support/defpun.cert on 23-Sep-2022 15:58:08 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-dags/support/defpun.cert (5.869s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/basic.cert on 23-Sep-2022 15:58:14 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/basic.cert (6.916s) Making /build/acl2-8.3dfsg/books/workshops/2003/austel/support/abs-type.cert on 23-Sep-2022 15:58:22 Built /build/acl2-8.3dfsg/books/workshops/2003/austel/support/abs-type.cert (8.040s) Making /build/acl2-8.3dfsg/books/workshops/2003/cowles-gamboa-van-baalen_matrix/support/alist2.cert on 23-Sep-2022 15:58:30 Built /build/acl2-8.3dfsg/books/workshops/2003/cowles-gamboa-van-baalen_matrix/support/alist2.cert (5.551s) Making /build/acl2-8.3dfsg/books/workshops/2003/cowles-gamboa-van-baalen_matrix/support/array2.cert on 23-Sep-2022 15:58:35 Built /build/acl2-8.3dfsg/books/workshops/2003/cowles-gamboa-van-baalen_matrix/support/array2.cert (5.433s) Making /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/total-order.cert on 23-Sep-2022 15:58:41 Built /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/total-order.cert (1.887s) Making /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/bis.cert on 23-Sep-2022 15:58:43 Built /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/bis.cert (3.136s) Making /build/acl2-8.3dfsg/books/workshops/2003/sumners/support/n2n.cert on 23-Sep-2022 15:58:46 Built /build/acl2-8.3dfsg/books/workshops/2003/sumners/support/n2n.cert (8.026s) Making /build/acl2-8.3dfsg/books/workshops/2003/sumners/support/simple.cert on 23-Sep-2022 15:58:55 Built /build/acl2-8.3dfsg/books/workshops/2003/sumners/support/simple.cert (3.110s) Making /build/acl2-8.3dfsg/books/workshops/2004/cowles-gamboa/support/WyoM1.cert on 23-Sep-2022 15:58:58 Built /build/acl2-8.3dfsg/books/workshops/2004/cowles-gamboa/support/WyoM1.cert (7.157s) Making /build/acl2-8.3dfsg/books/workshops/2004/davis/support/instance.cert on 23-Sep-2022 15:59:05 Built /build/acl2-8.3dfsg/books/workshops/2004/davis/support/instance.cert (6.252s) Making /build/acl2-8.3dfsg/books/workshops/2004/davis/support/primitives.cert on 23-Sep-2022 15:59:12 Built /build/acl2-8.3dfsg/books/workshops/2004/davis/support/primitives.cert (7.887s) Making /build/acl2-8.3dfsg/books/workshops/2004/gameiro-manolios/support/nth-thms.cert on 23-Sep-2022 15:59:20 Built /build/acl2-8.3dfsg/books/workshops/2004/gameiro-manolios/support/nth-thms.cert (1.826s) Making /build/acl2-8.3dfsg/books/workshops/2004/legato/support/generic-theories.cert on 23-Sep-2022 15:59:22 Built /build/acl2-8.3dfsg/books/workshops/2004/legato/support/generic-theories.cert (7.588s) Making /build/acl2-8.3dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/det-macros.cert on 23-Sep-2022 15:59:29 Built /build/acl2-8.3dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/det-macros.cert (2.949s) Making /build/acl2-8.3dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/total-order.cert on 23-Sep-2022 15:59:32 Built /build/acl2-8.3dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/total-order.cert (1.983s) Making /build/acl2-8.3dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/seq.cert on 23-Sep-2022 15:59:34 Built /build/acl2-8.3dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/seq.cert (1.989s) Making /build/acl2-8.3dfsg/books/workshops/2004/roach-fraij/support/roach-fraij-script.cert on 23-Sep-2022 15:59:37 Built /build/acl2-8.3dfsg/books/workshops/2004/roach-fraij/support/roach-fraij-script.cert (8.808s) Making /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/lists.cert on 23-Sep-2022 15:59:46 Built /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/lists.cert (3.884s) Making /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/predicatesNCie.cert on 23-Sep-2022 15:59:50 Built /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/predicatesNCie.cert (6.699s) Making /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/switch.cert on 23-Sep-2022 15:59:56 Built /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/switch.cert (2.715s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/lists/list-exports.cert on 23-Sep-2022 15:59:59 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/lists/list-exports.cert (1.816s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/syntax/syn-pkg.cert on 23-Sep-2022 16:00:01 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/syntax/syn-pkg.cert (1.853s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/lists/mv-nth.cert on 23-Sep-2022 16:00:03 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/lists/mv-nth.cert (2.197s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/symbol-fns/symbol-fns-exports.cert on 23-Sep-2022 16:00:06 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/symbol-fns/symbol-fns-exports.cert (1.782s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/cons.cert on 23-Sep-2022 16:00:08 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/cons.cert (3.386s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/coe-fld.cert on 23-Sep-2022 16:00:11 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/coe-fld.cert (3.750s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/futermino.cert on 23-Sep-2022 16:00:15 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/futermino.cert (2.691s) Making /build/acl2-8.3dfsg/books/workshops/2006/greve/nary/nary.cert on 23-Sep-2022 16:00:18 Built /build/acl2-8.3dfsg/books/workshops/2006/greve/nary/nary.cert (11.370s) Making /build/acl2-8.3dfsg/books/workshops/2006/greve/nary/nth-rules.cert on 23-Sep-2022 16:00:29 Built /build/acl2-8.3dfsg/books/workshops/2006/greve/nary/nth-rules.cert (7.546s) Making /build/acl2-8.3dfsg/books/workshops/2006/hunt-reeber/support/acl2.cert on 23-Sep-2022 16:00:37 Built /build/acl2-8.3dfsg/books/workshops/2006/hunt-reeber/support/acl2.cert (4.508s) Making /build/acl2-8.3dfsg/books/workshops/2006/hunt-reeber/support/bdd.cert on 23-Sep-2022 16:00:42 Built /build/acl2-8.3dfsg/books/workshops/2006/hunt-reeber/support/bdd.cert (9.577s) Making /build/acl2-8.3dfsg/books/workshops/2006/hunt-reeber/support/sat.cert on 23-Sep-2022 16:00:52 Built /build/acl2-8.3dfsg/books/workshops/2006/hunt-reeber/support/sat.cert (4.263s) Making /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/austel.cert on 23-Sep-2022 16:00:56 Built /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/austel.cert (2.361s) Making /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/greve1.cert on 23-Sep-2022 16:00:58 Built /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/greve1.cert (2.522s) Making /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/greve2.cert on 23-Sep-2022 16:01:01 Built /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/greve2.cert (2.465s) Making /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/greve3.cert on 23-Sep-2022 16:01:04 Built /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/greve3.cert (2.929s) Making /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/mini-proveall.cert on 23-Sep-2022 16:01:07 Built /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/mini-proveall.cert (4.420s) Making /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/rhs1-iff.cert on 23-Sep-2022 16:01:11 Built /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/rhs1-iff.cert (1.798s) Making /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/rhs1.cert on 23-Sep-2022 16:01:13 Built /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/rhs1.cert (1.660s) Making /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/rhs2.cert on 23-Sep-2022 16:01:15 Built /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/rhs2.cert (1.752s) Making /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/smith1.cert on 23-Sep-2022 16:01:17 Built /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/smith1.cert (2.019s) Making /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/sumners1.cert on 23-Sep-2022 16:01:19 Built /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/sumners1.cert (2.000s) Making /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/warnings.cert on 23-Sep-2022 16:01:21 Built /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/warnings.cert (1.756s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/symbol-manip.cert on 23-Sep-2022 16:01:23 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/symbol-manip.cert (2.103s) Making /build/acl2-8.3dfsg/books/workshops/2006/rager/support/ptest-fib.cert on 23-Sep-2022 16:01:25 Built /build/acl2-8.3dfsg/books/workshops/2006/rager/support/ptest-fib.cert (2.545s) Making /build/acl2-8.3dfsg/books/workshops/2006/rager/support/ptest-if-normalization.cert on 23-Sep-2022 16:01:28 Built /build/acl2-8.3dfsg/books/workshops/2006/rager/support/ptest-if-normalization.cert (11.243s) Making /build/acl2-8.3dfsg/books/workshops/2006/ray/tail/exists.cert on 23-Sep-2022 16:01:39 Built /build/acl2-8.3dfsg/books/workshops/2006/ray/tail/exists.cert (3.540s) Making /build/acl2-8.3dfsg/books/workshops/2006/ray/tail/forall.cert on 23-Sep-2022 16:01:43 Built /build/acl2-8.3dfsg/books/workshops/2006/ray/tail/forall.cert (3.599s) Making /build/acl2-8.3dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-interfaces.cert on 23-Sep-2022 16:01:47 Built /build/acl2-8.3dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-interfaces.cert (2.105s) Making /build/acl2-8.3dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-nodeset.cert on 23-Sep-2022 16:01:49 Built /build/acl2-8.3dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-nodeset.cert (2.406s) Making /build/acl2-8.3dfsg/books/workshops/2007/cowles-et-al/support/greve/defpun.cert on 23-Sep-2022 16:01:52 Built /build/acl2-8.3dfsg/books/workshops/2007/cowles-et-al/support/greve/defpun.cert (7.326s) Making /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/rewrite-code.cert on 23-Sep-2022 16:01:59 Built /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/rewrite-code.cert (9.472s) Making /build/acl2-8.3dfsg/books/workshops/2007/erickson/bprove/bash.cert on 23-Sep-2022 16:02:09 Built /build/acl2-8.3dfsg/books/workshops/2007/erickson/bprove/bash.cert (4.889s) Making /build/acl2-8.3dfsg/books/workshops/2007/erickson/bprove/gen.cert on 23-Sep-2022 16:02:14 Built /build/acl2-8.3dfsg/books/workshops/2007/erickson/bprove/gen.cert (4.170s) Making /build/acl2-8.3dfsg/books/workshops/2007/rimlinger/support/Rimlinger.cert on 23-Sep-2022 16:02:18 Built /build/acl2-8.3dfsg/books/workshops/2007/rimlinger/support/Rimlinger.cert (26.088s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-interfaces.cert on 23-Sep-2022 16:02:44 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-interfaces.cert (2.180s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-nodeset.cert on 23-Sep-2022 16:02:47 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-nodeset.cert (2.276s) Making /build/acl2-8.3dfsg/books/workshops/2009/hardin/deque-stobj/deque-stobj.cert on 23-Sep-2022 16:02:49 Built /build/acl2-8.3dfsg/books/workshops/2009/hardin/deque-stobj/deque-stobj.cert (11.348s) Making /build/acl2-8.3dfsg/books/workshops/2009/liu/support/mylet.cert on 23-Sep-2022 16:03:01 Built /build/acl2-8.3dfsg/books/workshops/2009/liu/support/mylet.cert (2.669s) Making /build/acl2-8.3dfsg/books/workshops/2009/sumners/support/kas.cert on 23-Sep-2022 16:03:03 Tick Built /build/acl2-8.3dfsg/books/workshops/2009/sumners/support/kas.cert (1346.376s) Making /build/acl2-8.3dfsg/books/workshops/2009/vandenbroek-schmaltz/GeNoC/generic-modules/types.cert on 23-Sep-2022 16:25:30 Built /build/acl2-8.3dfsg/books/workshops/2009/vandenbroek-schmaltz/GeNoC/generic-modules/types.cert (6.200s) Making /build/acl2-8.3dfsg/books/workshops/2009/verbeek-schmaltz/verbeek/instantiations/genoc/simple-ct-global/sets.cert on 23-Sep-2022 16:25:36 Built /build/acl2-8.3dfsg/books/workshops/2009/verbeek-schmaltz/verbeek/instantiations/genoc/simple-ct-global/sets.cert (2.200s) Making /build/acl2-8.3dfsg/books/workshops/2011/krug-et-al/support/Memory/memory-raw.cert on 23-Sep-2022 16:25:39 Built /build/acl2-8.3dfsg/books/workshops/2011/krug-et-al/support/Memory/memory-raw.cert (2.417s) Making /build/acl2-8.3dfsg/books/workshops/2011/verbeek-schmaltz/sources/perm.pcert0 on 23-Sep-2022 16:25:41 Built /build/acl2-8.3dfsg/books/workshops/2011/verbeek-schmaltz/sources/perm.pcert0 (2.280s) Making /build/acl2-8.3dfsg/books/workshops/2013/hardin-hardin/support/integer-listp-theorems.cert on 23-Sep-2022 16:25:44 Built /build/acl2-8.3dfsg/books/workshops/2013/hardin-hardin/support/integer-listp-theorems.cert (1.776s) Making /build/acl2-8.3dfsg/books/workshops/2013/joosten-van-gastel-schmaltz/books/perm.cert on 23-Sep-2022 16:25:46 Built /build/acl2-8.3dfsg/books/workshops/2013/joosten-van-gastel-schmaltz/books/perm.cert (2.804s) Making /build/acl2-8.3dfsg/books/workshops/2013/van-gastel-schmaltz/books/perm.cert on 23-Sep-2022 16:25:49 Built /build/acl2-8.3dfsg/books/workshops/2013/van-gastel-schmaltz/books/perm.cert (3.115s) Making /build/acl2-8.3dfsg/books/workshops/2017/kaufmann-swords/support/intro.cert on 23-Sep-2022 16:25:52 Built /build/acl2-8.3dfsg/books/workshops/2017/kaufmann-swords/support/intro.cert (3.002s) Making /build/acl2-8.3dfsg/books/workshops/2018/mehta/bounded-nat-listp.cert on 23-Sep-2022 16:25:55 Built /build/acl2-8.3dfsg/books/workshops/2018/mehta/bounded-nat-listp.cert (2.523s) Making /build/acl2-8.3dfsg/books/workshops/2018/mehta/generate-index-list.cert on 23-Sep-2022 16:25:58 Built /build/acl2-8.3dfsg/books/workshops/2018/mehta/generate-index-list.cert (2.086s) Making /build/acl2-8.3dfsg/books/xdoc/base.cert on 23-Sep-2022 16:26:00 Built /build/acl2-8.3dfsg/books/xdoc/base.cert (4.645s) Making /build/acl2-8.3dfsg/books/arithmetic/realp.cert on 23-Sep-2022 16:26:05 Built /build/acl2-8.3dfsg/books/arithmetic/realp.cert (2.357s) Making /build/acl2-8.3dfsg/books/arithmetic/real-listp.cert on 23-Sep-2022 16:26:07 Built /build/acl2-8.3dfsg/books/arithmetic/real-listp.cert (2.638s) Making /build/acl2-8.3dfsg/books/std/util/bstar.cert on 23-Sep-2022 16:26:10 Built /build/acl2-8.3dfsg/books/std/util/bstar.cert (10.000s) Making /build/acl2-8.3dfsg/books/centaur/fty/portcullis.cert on 23-Sep-2022 16:26:20 Built /build/acl2-8.3dfsg/books/centaur/fty/portcullis.cert (2.185s) Making /build/acl2-8.3dfsg/books/data-structures/set-defthms.cert on 23-Sep-2022 16:26:22 Built /build/acl2-8.3dfsg/books/data-structures/set-defthms.cert (2.790s) Making /build/acl2-8.3dfsg/books/ordinals/ordinal-total-order.cert on 23-Sep-2022 16:26:25 Built /build/acl2-8.3dfsg/books/ordinals/ordinal-total-order.cert (8.102s) Making /build/acl2-8.3dfsg/books/meta/term-lemmas.cert on 23-Sep-2022 16:26:34 Built /build/acl2-8.3dfsg/books/meta/term-lemmas.cert (2.376s) Making /build/acl2-8.3dfsg/books/rtl/rel4/support/ground-zero.cert on 23-Sep-2022 16:26:36 Built /build/acl2-8.3dfsg/books/rtl/rel4/support/ground-zero.cert (2.057s) Making /build/acl2-8.3dfsg/books/arithmetic-3/pass1/basic-arithmetic.cert on 23-Sep-2022 16:26:38 Built /build/acl2-8.3dfsg/books/arithmetic-3/pass1/basic-arithmetic.cert (2.369s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/remove-weak-inequalities.cert on 23-Sep-2022 16:26:41 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/remove-weak-inequalities.cert (2.704s) Making /build/acl2-8.3dfsg/books/rtl/rel4/arithmetic/rationalp.cert on 23-Sep-2022 16:26:44 Built /build/acl2-8.3dfsg/books/rtl/rel4/arithmetic/rationalp.cert (1.999s) Making /build/acl2-8.3dfsg/books/rtl/rel4/arithmetic/common-factor-defuns.cert on 23-Sep-2022 16:26:46 Built /build/acl2-8.3dfsg/books/rtl/rel4/arithmetic/common-factor-defuns.cert (4.184s) Making /build/acl2-8.3dfsg/books/rtl/rel4/arithmetic/complex-rationalp.cert on 23-Sep-2022 16:26:50 Built /build/acl2-8.3dfsg/books/rtl/rel4/arithmetic/complex-rationalp.cert (1.794s) Making /build/acl2-8.3dfsg/books/rtl/rel4/support/logior1.cert on 23-Sep-2022 16:26:52 Built /build/acl2-8.3dfsg/books/rtl/rel4/support/logior1.cert (1.874s) Making /build/acl2-8.3dfsg/books/system/termp.cert on 23-Sep-2022 16:26:54 Built /build/acl2-8.3dfsg/books/system/termp.cert (3.945s) Making /build/acl2-8.3dfsg/books/std/osets/computed-hints.cert on 23-Sep-2022 16:26:58 Built /build/acl2-8.3dfsg/books/std/osets/computed-hints.cert (3.882s) Making /build/acl2-8.3dfsg/books/clause-processors/use-by-hint.cert on 23-Sep-2022 16:27:02 Built /build/acl2-8.3dfsg/books/clause-processors/use-by-hint.cert (3.127s) Making /build/acl2-8.3dfsg/books/clause-processors/join-thms.cert on 23-Sep-2022 16:27:06 Built /build/acl2-8.3dfsg/books/clause-processors/join-thms.cert (2.791s) Making /build/acl2-8.3dfsg/books/tools/def-functional-instance.cert on 23-Sep-2022 16:27:09 Built /build/acl2-8.3dfsg/books/tools/def-functional-instance.cert (3.503s) Making /build/acl2-8.3dfsg/books/clause-processors/magic-ev.cert on 23-Sep-2022 16:27:12 Built /build/acl2-8.3dfsg/books/clause-processors/magic-ev.cert (4.803s) Making /build/acl2-8.3dfsg/books/tools/match-tree.cert on 23-Sep-2022 16:27:17 Built /build/acl2-8.3dfsg/books/tools/match-tree.cert (11.026s) Making /build/acl2-8.3dfsg/books/system/meta-extract.cert on 23-Sep-2022 16:27:28 Built /build/acl2-8.3dfsg/books/system/meta-extract.cert (2.680s) Making /build/acl2-8.3dfsg/books/tools/easy-simplify.cert on 23-Sep-2022 16:27:31 Built /build/acl2-8.3dfsg/books/tools/easy-simplify.cert (3.861s) Making /build/acl2-8.3dfsg/books/acl2s/portcullis.cert on 23-Sep-2022 16:27:35 Built /build/acl2-8.3dfsg/books/acl2s/portcullis.cert (2.386s) Making /build/acl2-8.3dfsg/books/hacking/hacker.cert on 23-Sep-2022 16:27:38 Built /build/acl2-8.3dfsg/books/hacking/hacker.cert (4.524s) Making /build/acl2-8.3dfsg/books/coi/util/pseudo-translate.cert on 23-Sep-2022 16:27:42 Built /build/acl2-8.3dfsg/books/coi/util/pseudo-translate.cert (3.109s) Making /build/acl2-8.3dfsg/books/arithmetic-2/pass1/basic-arithmetic.cert on 23-Sep-2022 16:27:46 Built /build/acl2-8.3dfsg/books/arithmetic-2/pass1/basic-arithmetic.cert (1.996s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/rationalp.cert on 23-Sep-2022 16:27:48 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/rationalp.cert (1.934s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/common-factor-defuns.cert on 23-Sep-2022 16:27:50 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/common-factor-defuns.cert (3.953s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/complex-rationalp.cert on 23-Sep-2022 16:27:54 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/complex-rationalp.cert (1.903s) Making /build/acl2-8.3dfsg/books/bdd/alu.cert on 23-Sep-2022 16:27:56 Built /build/acl2-8.3dfsg/books/bdd/alu.cert (8.173s) Making /build/acl2-8.3dfsg/books/bdd/cbf.cert on 23-Sep-2022 16:28:04 Built /build/acl2-8.3dfsg/books/bdd/cbf.cert (7.109s) Making /build/acl2-8.3dfsg/books/bdd/hamming.cert on 23-Sep-2022 16:28:12 Built /build/acl2-8.3dfsg/books/bdd/hamming.cert (3.608s) Making /build/acl2-8.3dfsg/books/bdd/pg-theory.cert on 23-Sep-2022 16:28:15 Built /build/acl2-8.3dfsg/books/bdd/pg-theory.cert (4.143s) Making /build/acl2-8.3dfsg/books/build/ifdef.cert on 23-Sep-2022 16:28:20 Built /build/acl2-8.3dfsg/books/build/ifdef.cert (3.911s) Making /build/acl2-8.3dfsg/books/centaur/getopt/portcullis.cert on 23-Sep-2022 16:28:24 Built /build/acl2-8.3dfsg/books/centaur/getopt/portcullis.cert (2.363s) Making /build/acl2-8.3dfsg/books/centaur/ipasir/portcullis.cert on 23-Sep-2022 16:28:26 Built /build/acl2-8.3dfsg/books/centaur/ipasir/portcullis.cert (2.538s) Making /build/acl2-8.3dfsg/books/centaur/misc/hons-extra.cert on 23-Sep-2022 16:28:29 Built /build/acl2-8.3dfsg/books/centaur/misc/hons-extra.cert (3.286s) Making /build/acl2-8.3dfsg/books/std/strings/defs-aux.cert on 23-Sep-2022 16:28:32 Built /build/acl2-8.3dfsg/books/std/strings/defs-aux.cert (2.928s) Making /build/acl2-8.3dfsg/books/std/stobjs/absstobjs.cert on 23-Sep-2022 16:28:36 Built /build/acl2-8.3dfsg/books/std/stobjs/absstobjs.cert (2.848s) Making /build/acl2-8.3dfsg/books/centaur/acre/portcullis.cert on 23-Sep-2022 16:28:39 Built /build/acl2-8.3dfsg/books/centaur/acre/portcullis.cert (2.681s) Making /build/acl2-8.3dfsg/books/tools/with-quoted-forms.cert on 23-Sep-2022 16:28:41 Built /build/acl2-8.3dfsg/books/tools/with-quoted-forms.cert (4.966s) Making /build/acl2-8.3dfsg/books/centaur/misc/prev-stobj-binding.cert on 23-Sep-2022 16:28:46 Built /build/acl2-8.3dfsg/books/centaur/misc/prev-stobj-binding.cert (3.779s) Making /build/acl2-8.3dfsg/books/std/stobjs/nested-stobjs.cert on 23-Sep-2022 16:28:50 Built /build/acl2-8.3dfsg/books/std/stobjs/nested-stobjs.cert (3.298s) Making /build/acl2-8.3dfsg/books/tools/symlet.cert on 23-Sep-2022 16:28:54 Built /build/acl2-8.3dfsg/books/tools/symlet.cert (2.635s) Making /build/acl2-8.3dfsg/books/centaur/meta/portcullis.cert on 23-Sep-2022 16:28:57 Built /build/acl2-8.3dfsg/books/centaur/meta/portcullis.cert (2.525s) Making /build/acl2-8.3dfsg/books/clause-processors/decomp-hint.cert on 23-Sep-2022 16:28:59 Built /build/acl2-8.3dfsg/books/clause-processors/decomp-hint.cert (6.858s) Making /build/acl2-8.3dfsg/books/centaur/lispfloat/portcullis.cert on 23-Sep-2022 16:29:06 Built /build/acl2-8.3dfsg/books/centaur/lispfloat/portcullis.cert (2.671s) Making /build/acl2-8.3dfsg/books/centaur/misc/absstobjs.cert on 23-Sep-2022 16:29:09 Built /build/acl2-8.3dfsg/books/centaur/misc/absstobjs.cert (2.335s) Making /build/acl2-8.3dfsg/books/centaur/misc/fal-graphs.cert on 23-Sep-2022 16:29:12 Built /build/acl2-8.3dfsg/books/centaur/misc/fal-graphs.cert (2.744s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/lrat-checker.cert on 23-Sep-2022 16:29:15 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/lrat-checker.cert (16.018s) Making /build/acl2-8.3dfsg/books/coi/util/implies.cert on 23-Sep-2022 16:29:31 Built /build/acl2-8.3dfsg/books/coi/util/implies.cert (2.492s) Making /build/acl2-8.3dfsg/books/xdoc/xdoc-error.cert on 23-Sep-2022 16:29:33 Built /build/acl2-8.3dfsg/books/xdoc/xdoc-error.cert (5.183s) Making /build/acl2-8.3dfsg/books/std/strings/pretty-defs-aux.cert on 23-Sep-2022 16:29:39 Built /build/acl2-8.3dfsg/books/std/strings/pretty-defs-aux.cert (2.541s) Making /build/acl2-8.3dfsg/books/xdoc/verbosep.cert on 23-Sep-2022 16:29:42 Built /build/acl2-8.3dfsg/books/xdoc/verbosep.cert (2.534s) Making /build/acl2-8.3dfsg/books/system/apply/apply-constraints.cert on 23-Sep-2022 16:29:44 Built /build/acl2-8.3dfsg/books/system/apply/apply-constraints.cert (4.068s) Making /build/acl2-8.3dfsg/books/textbook/chap11/perm-append.cert on 23-Sep-2022 16:29:48 Built /build/acl2-8.3dfsg/books/textbook/chap11/perm-append.cert (1.971s) Making /build/acl2-8.3dfsg/books/clause-processors/null-fail-hints.cert on 23-Sep-2022 16:29:51 Built /build/acl2-8.3dfsg/books/clause-processors/null-fail-hints.cert (2.860s) Making /build/acl2-8.3dfsg/books/coi/adviser/adviser-pkg.cert on 23-Sep-2022 16:29:54 Built /build/acl2-8.3dfsg/books/coi/adviser/adviser-pkg.cert (2.031s) Making /build/acl2-8.3dfsg/books/coi/lists/portcullis.cert on 23-Sep-2022 16:29:56 Built /build/acl2-8.3dfsg/books/coi/lists/portcullis.cert (2.083s) Making /build/acl2-8.3dfsg/books/coi/syntax/auxilary.cert on 23-Sep-2022 16:29:58 Built /build/acl2-8.3dfsg/books/coi/syntax/auxilary.cert (2.309s) Making /build/acl2-8.3dfsg/books/coi/syntax/defevaluator.cert on 23-Sep-2022 16:30:00 Built /build/acl2-8.3dfsg/books/coi/syntax/defevaluator.cert (2.988s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/ground-zero.cert on 23-Sep-2022 16:30:04 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/ground-zero.cert (1.939s) Making /build/acl2-8.3dfsg/books/coi/defung/map-ec-call.cert on 23-Sep-2022 16:30:06 Built /build/acl2-8.3dfsg/books/coi/defung/map-ec-call.cert (4.848s) Making /build/acl2-8.3dfsg/books/coi/dtrees/portcullis.cert on 23-Sep-2022 16:30:11 Built /build/acl2-8.3dfsg/books/coi/dtrees/portcullis.cert (2.685s) Making /build/acl2-8.3dfsg/books/coi/lists/mv-nth.cert on 23-Sep-2022 16:30:14 Built /build/acl2-8.3dfsg/books/coi/lists/mv-nth.cert (2.515s) Making /build/acl2-8.3dfsg/books/coi/lists/nth-meta.cert on 23-Sep-2022 16:30:16 Built /build/acl2-8.3dfsg/books/coi/lists/nth-meta.cert (4.242s) Making /build/acl2-8.3dfsg/books/coi/lists/nth-meta2.cert on 23-Sep-2022 16:30:21 Built /build/acl2-8.3dfsg/books/coi/lists/nth-meta2.cert (3.608s) Making /build/acl2-8.3dfsg/books/coi/util/ifixequiv.cert on 23-Sep-2022 16:30:24 Built /build/acl2-8.3dfsg/books/coi/util/ifixequiv.cert (2.240s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/intermediate-program.cert on 23-Sep-2022 16:30:27 Built /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/intermediate-program.cert (4.826s) Making /build/acl2-8.3dfsg/books/system/subst-var.cert on 23-Sep-2022 16:30:32 Built /build/acl2-8.3dfsg/books/system/subst-var.cert (6.617s) Making /build/acl2-8.3dfsg/books/demos/register-invariant-risk.cert on 23-Sep-2022 16:30:38 Built /build/acl2-8.3dfsg/books/demos/register-invariant-risk.cert (2.197s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/ecurve/portcullis.cert on 23-Sep-2022 16:30:41 Built /build/acl2-8.3dfsg/books/kestrel/crypto/ecurve/portcullis.cert (2.266s) Making /build/acl2-8.3dfsg/books/kestrel/alists-light/lookup-eq.cert on 23-Sep-2022 16:30:43 Built /build/acl2-8.3dfsg/books/kestrel/alists-light/lookup-eq.cert (2.370s) Making /build/acl2-8.3dfsg/books/kestrel/alists-light/lookup-eq-safe.cert on 23-Sep-2022 16:30:46 Built /build/acl2-8.3dfsg/books/kestrel/alists-light/lookup-eq-safe.cert (2.420s) Making /build/acl2-8.3dfsg/books/kestrel/alists-light/lookup-equal-safe.cert on 23-Sep-2022 16:30:48 Built /build/acl2-8.3dfsg/books/kestrel/alists-light/lookup-equal-safe.cert (2.220s) Making /build/acl2-8.3dfsg/books/kestrel/alists-light/lookup-safe.cert on 23-Sep-2022 16:30:51 Built /build/acl2-8.3dfsg/books/kestrel/alists-light/lookup-safe.cert (2.328s) Making /build/acl2-8.3dfsg/books/kestrel/alists-light/lookup.cert on 23-Sep-2022 16:30:53 Built /build/acl2-8.3dfsg/books/kestrel/alists-light/lookup.cert (2.506s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/nthcdr.cert on 23-Sep-2022 16:30:56 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/nthcdr.cert (3.642s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/butlast.cert on 23-Sep-2022 16:31:00 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/butlast.cert (2.311s) Making /build/acl2-8.3dfsg/books/workshops/2017/coglio-kaufmann-smith/support/pattern-matching.cert on 23-Sep-2022 16:31:02 Built /build/acl2-8.3dfsg/books/workshops/2017/coglio-kaufmann-smith/support/pattern-matching.cert (6.819s) Making /build/acl2-8.3dfsg/books/kestrel/apt/utilities/pattern-matching.cert on 23-Sep-2022 16:31:09 Built /build/acl2-8.3dfsg/books/kestrel/apt/utilities/pattern-matching.cert (6.985s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/imagpart.cert on 23-Sep-2022 16:31:16 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/imagpart.cert (2.245s) Making /build/acl2-8.3dfsg/books/kestrel/auto-termination/termination-database-utilities.cert on 23-Sep-2022 16:31:19 Built /build/acl2-8.3dfsg/books/kestrel/auto-termination/termination-database-utilities.cert (30.126s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/all-unsigned-byte-p.cert on 23-Sep-2022 16:31:49 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/all-unsigned-byte-p.cert (2.763s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/repeat.cert on 23-Sep-2022 16:31:52 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/repeat.cert (3.169s) Making /build/acl2-8.3dfsg/books/kestrel/booleans/booland.cert on 23-Sep-2022 16:31:55 Built /build/acl2-8.3dfsg/books/kestrel/booleans/booland.cert (2.431s) Making /build/acl2-8.3dfsg/books/kestrel/booleans/boolor.cert on 23-Sep-2022 16:31:58 Built /build/acl2-8.3dfsg/books/kestrel/booleans/boolor.cert (2.261s) Making /build/acl2-8.3dfsg/books/kestrel/booleans/boolxor.cert on 23-Sep-2022 16:32:00 Built /build/acl2-8.3dfsg/books/kestrel/booleans/boolxor.cert (2.234s) Making /build/acl2-8.3dfsg/books/kestrel/booleans/boolif.cert on 23-Sep-2022 16:32:03 Built /build/acl2-8.3dfsg/books/kestrel/booleans/boolif.cert (2.201s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/no-duplicatesp-equal.cert on 23-Sep-2022 16:32:05 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/no-duplicatesp-equal.cert (2.215s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/firstn.cert on 23-Sep-2022 16:32:08 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/firstn.cert (2.669s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/ecurve/points.cert on 23-Sep-2022 16:32:10 Built /build/acl2-8.3dfsg/books/kestrel/crypto/ecurve/points.cert (2.772s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/integer-arithmetic/meta-iplus-equal.cert on 23-Sep-2022 16:32:13 Built /build/acl2-8.3dfsg/books/kestrel/utilities/integer-arithmetic/meta-iplus-equal.cert (13.103s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/memberp.cert on 23-Sep-2022 16:32:27 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/memberp.cert (3.632s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/perm-def.cert on 23-Sep-2022 16:32:30 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/perm-def.cert (2.207s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/subrange.cert on 23-Sep-2022 16:32:33 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/subrange.cert (2.497s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/conjunctions.cert on 23-Sep-2022 16:32:35 Built /build/acl2-8.3dfsg/books/kestrel/utilities/conjunctions.cert (3.139s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/my-get-event.cert on 23-Sep-2022 16:32:39 Built /build/acl2-8.3dfsg/books/kestrel/utilities/my-get-event.cert (3.181s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/make-and-nice.cert on 23-Sep-2022 16:32:42 Built /build/acl2-8.3dfsg/books/kestrel/utilities/make-and-nice.cert (2.800s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/make-or-nice.cert on 23-Sep-2022 16:32:45 Built /build/acl2-8.3dfsg/books/kestrel/utilities/make-or-nice.cert (2.004s) Making /build/acl2-8.3dfsg/books/make-event/acl2x-help-test.cert on 23-Sep-2022 16:32:47 Built /build/acl2-8.3dfsg/books/make-event/acl2x-help-test.cert (2.064s) Making /build/acl2-8.3dfsg/books/make-event/defconst-fast-examples.cert on 23-Sep-2022 16:32:49 Built /build/acl2-8.3dfsg/books/make-event/defconst-fast-examples.cert (1.817s) Making /build/acl2-8.3dfsg/books/make-event/double-cert-test-1.cert on 23-Sep-2022 16:32:51 Built /build/acl2-8.3dfsg/books/make-event/double-cert-test-1.cert (2.360s) Making /build/acl2-8.3dfsg/books/make-event/stobj-test.cert on 23-Sep-2022 16:32:54 Built /build/acl2-8.3dfsg/books/make-event/stobj-test.cert (2.889s) Making /build/acl2-8.3dfsg/books/misc/dead-events.cert on 23-Sep-2022 16:32:57 Built /build/acl2-8.3dfsg/books/misc/dead-events.cert (2.053s) Making /build/acl2-8.3dfsg/books/misc/hidden-defpkg-checks/sub1.cert on 23-Sep-2022 16:32:59 Built /build/acl2-8.3dfsg/books/misc/hidden-defpkg-checks/sub1.cert (2.158s) Making /build/acl2-8.3dfsg/books/misc/hidden-defpkg-checks/sub2.cert on 23-Sep-2022 16:33:01 Built /build/acl2-8.3dfsg/books/misc/hidden-defpkg-checks/sub2.cert (2.009s) Making /build/acl2-8.3dfsg/books/models/jvm/guard-verified-m1/good-statep.cert on 23-Sep-2022 16:33:03 Built /build/acl2-8.3dfsg/books/models/jvm/guard-verified-m1/good-statep.cert (113.114s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/ground-zero.cert on 23-Sep-2022 16:34:57 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/ground-zero.cert (2.679s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/rationalp.cert on 23-Sep-2022 16:35:00 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/rationalp.cert (2.535s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/common-factor-defuns.cert on 23-Sep-2022 16:35:02 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/common-factor-defuns.cert (4.658s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/complex-rationalp.cert on 23-Sep-2022 16:35:07 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/complex-rationalp.cert (2.618s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logior1.cert on 23-Sep-2022 16:35:10 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logior1.cert (2.680s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/1999/calculus/solutions/mesh-append.cert on 23-Sep-2022 16:35:13 Built /build/acl2-8.3dfsg/books/nonstd/workshops/1999/calculus/solutions/mesh-append.cert (2.034s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/1999/calculus/solutions/mesh-make-partition.cert on 23-Sep-2022 16:35:15 Built /build/acl2-8.3dfsg/books/nonstd/workshops/1999/calculus/solutions/mesh-make-partition.cert (1.921s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/1999/calculus/solutions/partitionp-make-partition-rec.cert on 23-Sep-2022 16:35:17 Built /build/acl2-8.3dfsg/books/nonstd/workshops/1999/calculus/solutions/partitionp-make-partition-rec.cert (1.823s) Making /build/acl2-8.3dfsg/books/tools/types-misc.cert on 23-Sep-2022 16:35:19 Built /build/acl2-8.3dfsg/books/tools/types-misc.cert (4.831s) Making /build/acl2-8.3dfsg/books/projects/codewalker/simplify-under-hyps.cert on 23-Sep-2022 16:35:24 Built /build/acl2-8.3dfsg/books/projects/codewalker/simplify-under-hyps.cert (6.591s) Making /build/acl2-8.3dfsg/books/projects/equational/unification.cert on 23-Sep-2022 16:35:31 Built /build/acl2-8.3dfsg/books/projects/equational/unification.cert (4.845s) Making /build/acl2-8.3dfsg/books/projects/fm9001/constants.cert on 23-Sep-2022 16:35:36 Built /build/acl2-8.3dfsg/books/projects/fm9001/constants.cert (2.405s) Making /build/acl2-8.3dfsg/books/projects/fm9001/primp-database.cert on 23-Sep-2022 16:35:38 Built /build/acl2-8.3dfsg/books/projects/fm9001/primp-database.cert (2.793s) Making /build/acl2-8.3dfsg/books/sorting/ordered-perms.cert on 23-Sep-2022 16:35:41 Built /build/acl2-8.3dfsg/books/sorting/ordered-perms.cert (2.643s) Making /build/acl2-8.3dfsg/books/sorting/convert-perm-to-how-many.cert on 23-Sep-2022 16:35:44 Built /build/acl2-8.3dfsg/books/sorting/convert-perm-to-how-many.cert (2.972s) Making /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/array-lemmas.cert on 23-Sep-2022 16:35:47 Built /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/array-lemmas.cert (3.207s) Making /build/acl2-8.3dfsg/books/projects/pltpa/chk-jacm-proveall.cert on 23-Sep-2022 16:35:51 Built /build/acl2-8.3dfsg/books/projects/pltpa/chk-jacm-proveall.cert (2.530s) Making /build/acl2-8.3dfsg/books/projects/pltpa/chk-standard-proveall.cert on 23-Sep-2022 16:35:53 Built /build/acl2-8.3dfsg/books/projects/pltpa/chk-standard-proveall.cert (2.748s) Making /build/acl2-8.3dfsg/books/projects/regex/defset-encapsulates.cert on 23-Sep-2022 16:35:56 Built /build/acl2-8.3dfsg/books/projects/regex/defset-encapsulates.cert (10.518s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/truth-monotone.cert on 23-Sep-2022 16:36:07 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/truth-monotone.cert (2.275s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/unit-propagation-monotone.cert on 23-Sep-2022 16:36:09 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/unit-propagation-monotone.cert (17.227s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/sets.cert on 23-Sep-2022 16:36:27 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/sets.cert (4.862s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/lrat-parser.cert on 23-Sep-2022 16:36:32 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/lrat-parser.cert (10.589s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/truth-monotone.cert on 23-Sep-2022 16:36:43 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/truth-monotone.cert (2.320s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/unit-propagation-monotone.cert on 23-Sep-2022 16:36:45 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/unit-propagation-monotone.cert (19.440s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/test-driver.cert on 23-Sep-2022 16:37:05 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/test-driver.cert (2.631s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/lrat-parser.cert on 23-Sep-2022 16:37:07 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/lrat-parser.cert (10.228s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/truth-monotone.cert on 23-Sep-2022 16:37:18 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/truth-monotone.cert (2.142s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/unit-propagation-monotone.cert on 23-Sep-2022 16:37:20 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/unit-propagation-monotone.cert (17.404s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/test-driver.cert on 23-Sep-2022 16:37:38 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/test-driver.cert (2.568s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/lrat-parser.cert on 23-Sep-2022 16:37:40 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/lrat-parser.cert (10.645s) Making /build/acl2-8.3dfsg/books/projects/taspi/proofs/omerge-good-order.cert on 23-Sep-2022 16:37:51 Tick Built /build/acl2-8.3dfsg/books/projects/taspi/proofs/omerge-good-order.cert (13.165s) Making /build/acl2-8.3dfsg/books/rtl/rel4/user/logior1.cert on 23-Sep-2022 16:38:05 Built /build/acl2-8.3dfsg/books/rtl/rel4/user/logior1.cert (1.871s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logior1.cert on 23-Sep-2022 16:38:07 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logior1.cert (2.145s) Making /build/acl2-8.3dfsg/books/sorting/bsort.cert on 23-Sep-2022 16:38:09 Built /build/acl2-8.3dfsg/books/sorting/bsort.cert (2.960s) Making /build/acl2-8.3dfsg/books/sorting/msort.cert on 23-Sep-2022 16:38:12 Built /build/acl2-8.3dfsg/books/sorting/msort.cert (3.327s) Making /build/acl2-8.3dfsg/books/std/util/tests/bstar.cert on 23-Sep-2022 16:38:15 Built /build/acl2-8.3dfsg/books/std/util/tests/bstar.cert (5.902s) Making /build/acl2-8.3dfsg/books/system/doc/convert-legacy-doc/write-acl2-xdoc.cert on 23-Sep-2022 16:38:22 Built /build/acl2-8.3dfsg/books/system/doc/convert-legacy-doc/write-acl2-xdoc.cert (3.116s) Making /build/acl2-8.3dfsg/books/system/optimize-check.cert on 23-Sep-2022 16:38:25 Built /build/acl2-8.3dfsg/books/system/optimize-check.cert (2.893s) Making /build/acl2-8.3dfsg/books/system/pcert/acl2x-pcert-test-1.cert on 23-Sep-2022 16:38:28 Built /build/acl2-8.3dfsg/books/system/pcert/acl2x-pcert-test-1.cert (2.052s) Making /build/acl2-8.3dfsg/books/system/pcert/acl2x-pcert-test-2.cert on 23-Sep-2022 16:38:30 Built /build/acl2-8.3dfsg/books/system/pcert/acl2x-pcert-test-2.cert (2.273s) Making /build/acl2-8.3dfsg/books/system/pcert/elide-test.pcert1 on 23-Sep-2022 16:38:32 Built /build/acl2-8.3dfsg/books/system/pcert/elide-test.pcert1 (1.169s) Making /build/acl2-8.3dfsg/books/system/pcert/sub.pcert1 on 23-Sep-2022 16:38:34 Built /build/acl2-8.3dfsg/books/system/pcert/sub.pcert1 (1.331s) Making /build/acl2-8.3dfsg/books/system/tests/cert-data/top1.cert on 23-Sep-2022 16:38:35 Built /build/acl2-8.3dfsg/books/system/tests/cert-data/top1.cert (1.870s) Making /build/acl2-8.3dfsg/books/system/tests/cert-data/top1a.cert on 23-Sep-2022 16:38:37 Built /build/acl2-8.3dfsg/books/system/tests/cert-data/top1a.cert (1.751s) Making /build/acl2-8.3dfsg/books/system/tests/verify-termination/top.cert on 23-Sep-2022 16:38:39 Built /build/acl2-8.3dfsg/books/system/tests/verify-termination/top.cert (1.936s) Making /build/acl2-8.3dfsg/books/textbook/chap11/mergesort.cert on 23-Sep-2022 16:38:41 Built /build/acl2-8.3dfsg/books/textbook/chap11/mergesort.cert (3.318s) Making /build/acl2-8.3dfsg/books/textbook/chap11/qsort.cert on 23-Sep-2022 16:38:45 Built /build/acl2-8.3dfsg/books/textbook/chap11/qsort.cert (3.315s) Making /build/acl2-8.3dfsg/books/tools/bstar.cert on 23-Sep-2022 16:38:48 Built /build/acl2-8.3dfsg/books/tools/bstar.cert (2.214s) Making /build/acl2-8.3dfsg/books/tools/case-splitting-rules.cert on 23-Sep-2022 16:38:51 Built /build/acl2-8.3dfsg/books/tools/case-splitting-rules.cert (4.481s) Making /build/acl2-8.3dfsg/books/tools/deftuple.cert on 23-Sep-2022 16:38:55 Built /build/acl2-8.3dfsg/books/tools/deftuple.cert (6.315s) Making /build/acl2-8.3dfsg/books/tools/last-theory-change.cert on 23-Sep-2022 16:39:02 Built /build/acl2-8.3dfsg/books/tools/last-theory-change.cert (3.129s) Making /build/acl2-8.3dfsg/books/workshops/1999/calculus/solutions/mesh-append.cert on 23-Sep-2022 16:39:05 Built /build/acl2-8.3dfsg/books/workshops/1999/calculus/solutions/mesh-append.cert (2.108s) Making /build/acl2-8.3dfsg/books/workshops/1999/calculus/solutions/mesh-make-partition.cert on 23-Sep-2022 16:39:07 Built /build/acl2-8.3dfsg/books/workshops/1999/calculus/solutions/mesh-make-partition.cert (2.064s) Making /build/acl2-8.3dfsg/books/workshops/1999/calculus/solutions/partitionp-make-partition-rec.cert on 23-Sep-2022 16:39:09 Built /build/acl2-8.3dfsg/books/workshops/1999/calculus/solutions/partitionp-make-partition-rec.cert (1.745s) Making /build/acl2-8.3dfsg/books/workshops/1999/embedded/Proof-Of-Contribution/Mapping.cert on 23-Sep-2022 16:39:11 Built /build/acl2-8.3dfsg/books/workshops/1999/embedded/Proof-Of-Contribution/Mapping.cert (2.583s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/permutations.cert on 23-Sep-2022 16:39:14 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/permutations.cert (4.384s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/book/fast-sets.cert on 23-Sep-2022 16:39:19 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/book/fast-sets.cert (2.940s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/book/fixpoints.cert on 23-Sep-2022 16:39:22 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/book/fixpoints.cert (2.682s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/perm.cert on 23-Sep-2022 16:39:24 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/perm.cert (3.196s) Making /build/acl2-8.3dfsg/books/workshops/1999/vhdl/fact.cert on 23-Sep-2022 16:39:28 Built /build/acl2-8.3dfsg/books/workshops/1999/vhdl/fact.cert (5.841s) Making /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/base.cert on 23-Sep-2022 16:39:34 Built /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/base.cert (2.726s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/top/isa128.cert on 23-Sep-2022 16:39:37 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/top/isa128.cert (3.051s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/ma/isa.cert on 23-Sep-2022 16:39:40 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/ma/isa.cert (2.905s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/ma/ma.cert on 23-Sep-2022 16:39:43 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/ma/ma.cert (3.404s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/top/isa128int.cert on 23-Sep-2022 16:39:46 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/top/isa128int.cert (3.060s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/int/isa-int.cert on 23-Sep-2022 16:39:50 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/int/isa-int.cert (3.277s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/ma/isa.cert on 23-Sep-2022 16:39:53 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/ma/isa.cert (3.045s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/ma/ma.cert on 23-Sep-2022 16:39:56 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/ma/ma.cert (3.596s) Making /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/monomial.cert on 23-Sep-2022 16:40:00 Built /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/monomial.cert (3.120s) Making /build/acl2-8.3dfsg/books/workshops/2000/moore-manolios/partial-functions/examples.cert on 23-Sep-2022 16:40:03 Built /build/acl2-8.3dfsg/books/workshops/2000/moore-manolios/partial-functions/examples.cert (7.593s) Making /build/acl2-8.3dfsg/books/workshops/2000/sumners2/bdds/bdd-spec.cert on 23-Sep-2022 16:40:11 Built /build/acl2-8.3dfsg/books/workshops/2000/sumners2/bdds/bdd-spec.cert (18.601s) Making /build/acl2-8.3dfsg/books/workshops/2002/cowles-flat/support/flat-ackermann.cert on 23-Sep-2022 16:40:30 Built /build/acl2-8.3dfsg/books/workshops/2002/cowles-flat/support/flat-ackermann.cert (40.030s) Making /build/acl2-8.3dfsg/books/workshops/2002/cowles-flat/support/flat-nested.cert on 23-Sep-2022 16:41:10 Built /build/acl2-8.3dfsg/books/workshops/2002/cowles-flat/support/flat-nested.cert (4.743s) Making /build/acl2-8.3dfsg/books/workshops/2002/cowles-flat/support/flat-primitive.cert on 23-Sep-2022 16:41:15 Built /build/acl2-8.3dfsg/books/workshops/2002/cowles-flat/support/flat-primitive.cert (4.005s) Making /build/acl2-8.3dfsg/books/workshops/2002/cowles-flat/support/flat-reverse.cert on 23-Sep-2022 16:41:19 Built /build/acl2-8.3dfsg/books/workshops/2002/cowles-flat/support/flat-reverse.cert (422.668s) Making /build/acl2-8.3dfsg/books/workshops/2002/cowles-flat/support/flat-tail.cert on 23-Sep-2022 16:48:22 Built /build/acl2-8.3dfsg/books/workshops/2002/cowles-flat/support/flat-tail.cert (3.516s) Making /build/acl2-8.3dfsg/books/workshops/2002/cowles-flat/support/flat-z.cert on 23-Sep-2022 16:48:26 Built /build/acl2-8.3dfsg/books/workshops/2002/cowles-flat/support/flat-z.cert (3.044s) Making /build/acl2-8.3dfsg/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/generic-multiset.cert on 23-Sep-2022 16:48:29 Built /build/acl2-8.3dfsg/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/generic-multiset.cert (7.452s) Making /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-2/npol.cert on 23-Sep-2022 16:48:36 Built /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-2/npol.cert (2.819s) Making /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/monomial.cert on 23-Sep-2022 16:48:39 Built /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/monomial.cert (3.020s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/terms.cert on 23-Sep-2022 16:48:43 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/terms.cert (11.598s) Making /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/apply-total-order.cert on 23-Sep-2022 16:48:54 Built /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/apply-total-order.cert (3.101s) Making /build/acl2-8.3dfsg/books/workshops/2004/davis/support/computed-hints.cert on 23-Sep-2022 16:48:58 Built /build/acl2-8.3dfsg/books/workshops/2004/davis/support/computed-hints.cert (3.425s) Making /build/acl2-8.3dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/records.cert on 23-Sep-2022 16:49:01 Built /build/acl2-8.3dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/records.cert (4.646s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/bag-pkg.cert on 23-Sep-2022 16:49:06 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/bag-pkg.cert (1.927s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/symbol-fns/symbol-fns.cert on 23-Sep-2022 16:49:08 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/symbol-fns/symbol-fns.cert (3.484s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fumonomio.cert on 23-Sep-2022 16:49:12 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fumonomio.cert (5.050s) Making /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/mini-proveall-plus.cert on 23-Sep-2022 16:49:17 Built /build/acl2-8.3dfsg/books/workshops/2006/kaufmann-moore/support/mini-proveall-plus.cert (1.730s) Making /build/acl2-8.3dfsg/books/workshops/2007/erickson/bprove/refute.cert on 23-Sep-2022 16:49:19 Built /build/acl2-8.3dfsg/books/workshops/2007/erickson/bprove/refute.cert (6.770s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/nodeset/2D-mesh-nodeset.cert on 23-Sep-2022 16:49:26 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/nodeset/2D-mesh-nodeset.cert (4.523s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/nodeset/octagon-nodeset.cert on 23-Sep-2022 16:49:30 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/nodeset/octagon-nodeset.cert (2.497s) Making /build/acl2-8.3dfsg/books/workshops/2011/verbeek-schmaltz/sources/perm.pcert1 on 23-Sep-2022 16:49:33 Built /build/acl2-8.3dfsg/books/workshops/2011/verbeek-schmaltz/sources/perm.pcert1 (1.657s) Making /build/acl2-8.3dfsg/books/xdoc/xtopic.cert on 23-Sep-2022 16:49:35 Built /build/acl2-8.3dfsg/books/xdoc/xtopic.cert (2.326s) cd bdd ; /bin/bash -c "(echo '(ld \"create-benchmarks.lsp\")' | /build/acl2-8.3dfsg/saved_acl2)" GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ ACL2 Version 8.3 built September 23, 2022 14:14:25 then September 23, 2022 15:07:52. Copyright (C) 2020, Regents of the University of Texas ACL2 comes with ABSOLUTELY NO WARRANTY. This is free software and you are welcome to redistribute it under certain conditions. For details, see the LICENSE file distributed with ACL2. Initialized with (INITIALIZE-ACL2 'INCLUDE-BOOK *ACL2-PASS-2-FILES*). See the documentation topic note-8-3 for recent changes. Note: We have modified the prompt in some underlying Lisps to further distinguish it from the ACL2 prompt. MODIFICATION NOTICE: Modified to produce final certification files ACL2 Version 8.3. Level 1. Cbd "/build/acl2-8.3dfsg/books/bdd/". System books directory "/build/acl2-8.3dfsg/books/". Type :help for help. Type (good-bye) to quit completely out of ACL2. ACL2 !> ACL2 Version 8.3. Level 2. Cbd "/build/acl2-8.3dfsg/books/bdd/". System books directory "/build/acl2-8.3dfsg/books/". Type :help for help. Type (good-bye) 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.03 seconds (prove: 0.00, print: 0.00, other: 0.03) "/build/acl2-8.3dfsg/books/bdd/cbf.lisp" ACL2 !>>ACL2 !>>Bye. :EOF ACL2 !>Bye. Making /build/acl2-8.3dfsg/books/xdoc/fmt-to-str-orig.cert on 23-Sep-2022 16:49:37 Built /build/acl2-8.3dfsg/books/xdoc/fmt-to-str-orig.cert (3.165s) Making /build/acl2-8.3dfsg/books/data-structures/set-theory.cert on 23-Sep-2022 16:49:41 Built /build/acl2-8.3dfsg/books/data-structures/set-theory.cert (1.841s) Making /build/acl2-8.3dfsg/books/meta/meta-plus-equal.cert on 23-Sep-2022 16:49:43 Built /build/acl2-8.3dfsg/books/meta/meta-plus-equal.cert (5.389s) Making /build/acl2-8.3dfsg/books/meta/meta-plus-lessp.cert on 23-Sep-2022 16:49:48 Built /build/acl2-8.3dfsg/books/meta/meta-plus-lessp.cert (4.298s) Making /build/acl2-8.3dfsg/books/arithmetic-3/pass1/inequalities.cert on 23-Sep-2022 16:49:53 Built /build/acl2-8.3dfsg/books/arithmetic-3/pass1/inequalities.cert (1.971s) Making /build/acl2-8.3dfsg/books/clause-processors/ev-theoremp.cert on 23-Sep-2022 16:49:55 Built /build/acl2-8.3dfsg/books/clause-processors/ev-theoremp.cert (2.273s) Making /build/acl2-8.3dfsg/books/hacking/defcode.cert on 23-Sep-2022 16:49:57 Built /build/acl2-8.3dfsg/books/hacking/defcode.cert (3.945s) Making /build/acl2-8.3dfsg/books/acl2s/check-equal.cert on 23-Sep-2022 16:50:01 Built /build/acl2-8.3dfsg/books/acl2s/check-equal.cert (6.104s) Making /build/acl2-8.3dfsg/books/arithmetic-2/pass1/inequalities.cert on 23-Sep-2022 16:50:08 Built /build/acl2-8.3dfsg/books/arithmetic-2/pass1/inequalities.cert (1.947s) Making /build/acl2-8.3dfsg/books/bdd/alu-proofs.cert on 23-Sep-2022 16:50:10 Built /build/acl2-8.3dfsg/books/bdd/alu-proofs.cert (4.837s) Making /build/acl2-8.3dfsg/books/build/test/ifdeftest/defs.cert on 23-Sep-2022 16:50:15 Built /build/acl2-8.3dfsg/books/build/test/ifdeftest/defs.cert (2.565s) Making /build/acl2-8.3dfsg/books/centaur/aignet/portcullis.cert on 23-Sep-2022 16:50:17 Built /build/acl2-8.3dfsg/books/centaur/aignet/portcullis.cert (2.584s) Making /build/acl2-8.3dfsg/books/centaur/meta/assoc-is-hons-assoc.cert on 23-Sep-2022 16:50:20 Built /build/acl2-8.3dfsg/books/centaur/meta/assoc-is-hons-assoc.cert (2.537s) Making /build/acl2-8.3dfsg/books/coi/nary/nary.cert on 23-Sep-2022 16:50:23 Built /build/acl2-8.3dfsg/books/coi/nary/nary.cert (11.485s) Making /build/acl2-8.3dfsg/books/coi/alists/portcullis.cert on 23-Sep-2022 16:50:34 Built /build/acl2-8.3dfsg/books/coi/alists/portcullis.cert (2.117s) Making /build/acl2-8.3dfsg/books/coi/lists/acl2-count.cert on 23-Sep-2022 16:50:37 Built /build/acl2-8.3dfsg/books/coi/lists/acl2-count.cert (2.303s) Making /build/acl2-8.3dfsg/books/coi/bags/portcullis.cert on 23-Sep-2022 16:50:39 Built /build/acl2-8.3dfsg/books/coi/bags/portcullis.cert (2.171s) Making /build/acl2-8.3dfsg/books/coi/syntax/syntax-extensions.cert on 23-Sep-2022 16:50:42 Built /build/acl2-8.3dfsg/books/coi/syntax/syntax-extensions.cert (2.992s) Making /build/acl2-8.3dfsg/books/coi/paths/portcullis.cert on 23-Sep-2022 16:50:45 Built /build/acl2-8.3dfsg/books/coi/paths/portcullis.cert (2.116s) Making /build/acl2-8.3dfsg/books/coi/gacc/portcullis.cert on 23-Sep-2022 16:50:47 Built /build/acl2-8.3dfsg/books/coi/gacc/portcullis.cert (2.722s) Making /build/acl2-8.3dfsg/books/coi/nary/example2.cert on 23-Sep-2022 16:50:50 Built /build/acl2-8.3dfsg/books/coi/nary/example2.cert (3.911s) Making /build/acl2-8.3dfsg/books/coi/util/nfixequiv.cert on 23-Sep-2022 16:50:54 Built /build/acl2-8.3dfsg/books/coi/util/nfixequiv.cert (2.379s) Making /build/acl2-8.3dfsg/books/system/subst-expr.cert on 23-Sep-2022 16:50:56 Built /build/acl2-8.3dfsg/books/system/subst-expr.cert (9.245s) Making /build/acl2-8.3dfsg/books/kestrel/bitcoin/portcullis.cert on 23-Sep-2022 16:51:06 Built /build/acl2-8.3dfsg/books/kestrel/bitcoin/portcullis.cert (2.377s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/ecdsa/portcullis.cert on 23-Sep-2022 16:51:08 Built /build/acl2-8.3dfsg/books/kestrel/crypto/ecdsa/portcullis.cert (2.223s) Making /build/acl2-8.3dfsg/books/hacking/dynamic-make-event-test.cert on 23-Sep-2022 16:51:11 Built /build/acl2-8.3dfsg/books/hacking/dynamic-make-event-test.cert (7.272s) Making /build/acl2-8.3dfsg/books/hacking/evalable-ld-printing.cert on 23-Sep-2022 16:51:18 Built /build/acl2-8.3dfsg/books/hacking/evalable-ld-printing.cert (3.030s) Making /build/acl2-8.3dfsg/books/kestrel/alists-light/lookup-eq-lst.cert on 23-Sep-2022 16:51:21 Built /build/acl2-8.3dfsg/books/kestrel/alists-light/lookup-eq-lst.cert (2.081s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/append.cert on 23-Sep-2022 16:51:23 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/append.cert (2.523s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/realpart.cert on 23-Sep-2022 16:51:26 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/realpart.cert (1.859s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/all-unsigned-byte-p-of-repeat.cert on 23-Sep-2022 16:51:28 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/all-unsigned-byte-p-of-repeat.cert (1.946s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/unsigned-byte-listp.cert on 23-Sep-2022 16:51:30 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/unsigned-byte-listp.cert (2.094s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/all-integerp-of-repeat.cert on 23-Sep-2022 16:51:33 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/all-integerp-of-repeat.cert (1.853s) Making /build/acl2-8.3dfsg/books/kestrel/booleans/booleans.cert on 23-Sep-2022 16:51:35 Built /build/acl2-8.3dfsg/books/kestrel/booleans/booleans.cert (2.391s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/reverse-list.cert on 23-Sep-2022 16:51:37 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/reverse-list.cert (3.842s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/integer-arithmetic/meta-rules.cert on 23-Sep-2022 16:51:41 Built /build/acl2-8.3dfsg/books/kestrel/utilities/integer-arithmetic/meta-rules.cert (1.936s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/perm.cert on 23-Sep-2022 16:51:43 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/perm.cert (3.340s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/reverse-list-def.cert on 23-Sep-2022 16:51:47 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/reverse-list-def.cert (2.287s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/declares0.cert on 23-Sep-2022 16:51:49 Built /build/acl2-8.3dfsg/books/kestrel/utilities/declares0.cert (12.935s) Making /build/acl2-8.3dfsg/books/make-event/double-cert-test.cert on 23-Sep-2022 16:52:02 Built /build/acl2-8.3dfsg/books/make-event/double-cert-test.cert (1.939s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/rtl.cert on 23-Sep-2022 16:52:04 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/rtl.cert (9.393s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/1999/calculus/solutions/partitionp-make-partition.cert on 23-Sep-2022 16:52:14 Built /build/acl2-8.3dfsg/books/nonstd/workshops/1999/calculus/solutions/partitionp-make-partition.cert (1.812s) Making /build/acl2-8.3dfsg/books/projects/equational/weighting.cert on 23-Sep-2022 16:52:16 Built /build/acl2-8.3dfsg/books/projects/equational/weighting.cert (4.830s) Making /build/acl2-8.3dfsg/books/sorting/equisort.cert on 23-Sep-2022 16:52:21 Built /build/acl2-8.3dfsg/books/sorting/equisort.cert (3.128s) Making /build/acl2-8.3dfsg/books/sorting/isort.cert on 23-Sep-2022 16:52:24 Built /build/acl2-8.3dfsg/books/sorting/isort.cert (2.617s) Making /build/acl2-8.3dfsg/books/sorting/equisort2.cert on 23-Sep-2022 16:52:27 Built /build/acl2-8.3dfsg/books/sorting/equisort2.cert (2.467s) Making /build/acl2-8.3dfsg/books/sorting/equisort3.cert on 23-Sep-2022 16:52:29 Built /build/acl2-8.3dfsg/books/sorting/equisort3.cert (1.776s) Making /build/acl2-8.3dfsg/books/projects/regex/equal-based-set.cert on 23-Sep-2022 16:52:31 Built /build/acl2-8.3dfsg/books/projects/regex/equal-based-set.cert (3.091s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/unit-propagation-implies-unsat.cert on 23-Sep-2022 16:52:35 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/unit-propagation-implies-unsat.cert (2.487s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/unique.cert on 23-Sep-2022 16:52:37 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/unique.cert (3.881s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/run.cert on 23-Sep-2022 16:52:41 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/run.cert (4.216s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/unit-propagation-implies-unsat.cert on 23-Sep-2022 16:52:46 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/unit-propagation-implies-unsat.cert (2.697s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/run.cert on 23-Sep-2022 16:52:48 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/run.cert (4.213s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/unit-propagation-implies-unsat.cert on 23-Sep-2022 16:52:53 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/unit-propagation-implies-unsat.cert (2.531s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/run.cert on 23-Sep-2022 16:52:55 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/run.cert (4.360s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/test-driver.cert on 23-Sep-2022 16:53:00 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/test-driver.cert (2.708s) Making /build/acl2-8.3dfsg/books/projects/taspi/proofs/fringes-taspi.cert on 23-Sep-2022 16:53:03 Built /build/acl2-8.3dfsg/books/projects/taspi/proofs/fringes-taspi.cert (290.636s) Making /build/acl2-8.3dfsg/books/system/pcert/elide-test.cert on 23-Sep-2022 16:57:54 Built /build/acl2-8.3dfsg/books/system/pcert/elide-test.cert (1.054s) Making /build/acl2-8.3dfsg/books/system/pcert/sub.cert on 23-Sep-2022 16:57:55 Built /build/acl2-8.3dfsg/books/system/pcert/sub.cert (1.126s) Making /build/acl2-8.3dfsg/books/system/tests/cert-data/top.cert on 23-Sep-2022 16:57:56 Built /build/acl2-8.3dfsg/books/system/tests/cert-data/top.cert (1.900s) Making /build/acl2-8.3dfsg/books/workshops/1999/calculus/solutions/partitionp-make-partition.cert on 23-Sep-2022 16:57:58 Built /build/acl2-8.3dfsg/books/workshops/1999/calculus/solutions/partitionp-make-partition.cert (1.908s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/book/relations.cert on 23-Sep-2022 16:58:00 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/book/relations.cert (3.515s) Making /build/acl2-8.3dfsg/books/workshops/1999/vhdl/exercises.cert on 23-Sep-2022 16:58:04 Built /build/acl2-8.3dfsg/books/workshops/1999/vhdl/exercises.cert (2.012s) Making /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/expr.cert on 23-Sep-2022 16:58:06 Built /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/expr.cert (32.660s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/top/ma128.cert on 23-Sep-2022 16:58:39 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/top/ma128.cert (6.158s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/top/ma128int.cert on 23-Sep-2022 16:58:45 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/top/ma128int.cert (6.550s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/int/ma-int.cert on 23-Sep-2022 16:58:52 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/int/ma-int.cert (4.342s) Making /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/polynomial.cert on 23-Sep-2022 16:58:56 Built /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/polynomial.cert (3.284s) Making /build/acl2-8.3dfsg/books/workshops/2000/sumners2/bdds/bdd-prf.cert on 23-Sep-2022 16:59:00 Built /build/acl2-8.3dfsg/books/workshops/2000/sumners2/bdds/bdd-prf.cert (22.540s) Making /build/acl2-8.3dfsg/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/multiset-assoc.cert on 23-Sep-2022 16:59:23 Built /build/acl2-8.3dfsg/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/multiset-assoc.cert (4.747s) Making /build/acl2-8.3dfsg/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/multiset-list.cert on 23-Sep-2022 16:59:27 Built /build/acl2-8.3dfsg/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/multiset-list.cert (3.346s) Making /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/upol.cert on 23-Sep-2022 16:59:31 Built /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/upol.cert (2.250s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/matching.cert on 23-Sep-2022 16:59:33 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/matching.cert (4.645s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/subsumption-definition-v0.cert on 23-Sep-2022 16:59:38 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/subsumption-definition-v0.cert (3.927s) Making /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/records.cert on 23-Sep-2022 16:59:42 Built /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/records.cert (4.836s) Making /build/acl2-8.3dfsg/books/workshops/2004/davis/support/membership.cert on 23-Sep-2022 16:59:47 Built /build/acl2-8.3dfsg/books/workshops/2004/davis/support/membership.cert (5.534s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/bag-exports.cert on 23-Sep-2022 16:59:53 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/bag-exports.cert (1.884s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/syntax/auxilary.cert on 23-Sep-2022 16:59:55 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/syntax/auxilary.cert (2.215s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fupolinomio.cert on 23-Sep-2022 16:59:57 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fupolinomio.cert (2.364s) Making /build/acl2-8.3dfsg/books/workshops/2007/erickson/bprove/lemgen.cert on 23-Sep-2022 17:00:00 Built /build/acl2-8.3dfsg/books/workshops/2007/erickson/bprove/lemgen.cert (67.344s) Making /build/acl2-8.3dfsg/books/workshops/2011/verbeek-schmaltz/sources/perm.cert on 23-Sep-2022 17:01:07 Built /build/acl2-8.3dfsg/books/workshops/2011/verbeek-schmaltz/sources/perm.cert (1.130s) Making /build/acl2-8.3dfsg/books/workshops/2018/sumners/portcullis.cert on 23-Sep-2022 17:01:09 Built /build/acl2-8.3dfsg/books/workshops/2018/sumners/portcullis.cert (2.647s) Making /build/acl2-8.3dfsg/books/bdd/benchmarks.cert on 23-Sep-2022 17:01:11 Built /build/acl2-8.3dfsg/books/bdd/benchmarks.cert (5.372s) Making /build/acl2-8.3dfsg/books/workshops/2003/greve-wilding-vanfleet/deps.cert on 23-Sep-2022 17:01:17 Built /build/acl2-8.3dfsg/books/workshops/2003/greve-wilding-vanfleet/deps.cert (1.656s) Making /build/acl2-8.3dfsg/books/arithmetic-3/pass1/prefer-times.cert on 23-Sep-2022 17:01:19 Built /build/acl2-8.3dfsg/books/arithmetic-3/pass1/prefer-times.cert (1.938s) Making /build/acl2-8.3dfsg/books/hacking/table-guard.cert on 23-Sep-2022 17:01:21 Built /build/acl2-8.3dfsg/books/hacking/table-guard.cert (13.154s) Making /build/acl2-8.3dfsg/books/arithmetic-2/pass1/prefer-times.cert on 23-Sep-2022 17:01:34 Built /build/acl2-8.3dfsg/books/arithmetic-2/pass1/prefer-times.cert (2.042s) Making /build/acl2-8.3dfsg/books/build/test/ifdeftest/thms.cert on 23-Sep-2022 17:01:36 Built /build/acl2-8.3dfsg/books/build/test/ifdeftest/thms.cert (2.287s) Making /build/acl2-8.3dfsg/books/centaur/gl/portcullis.cert on 23-Sep-2022 17:01:39 Built /build/acl2-8.3dfsg/books/centaur/gl/portcullis.cert (2.802s) Making /build/acl2-8.3dfsg/books/centaur/fgl/portcullis.cert on 23-Sep-2022 17:01:42 Built /build/acl2-8.3dfsg/books/centaur/fgl/portcullis.cert (2.773s) Making /build/acl2-8.3dfsg/books/coi/alists/alist-pkg.cert on 23-Sep-2022 17:01:45 Built /build/acl2-8.3dfsg/books/coi/alists/alist-pkg.cert (2.228s) Making /build/acl2-8.3dfsg/books/coi/syntax/syntax.cert on 23-Sep-2022 17:01:47 Built /build/acl2-8.3dfsg/books/coi/syntax/syntax.cert (5.457s) Making /build/acl2-8.3dfsg/books/coi/records/portcullis.cert on 23-Sep-2022 17:01:53 Built /build/acl2-8.3dfsg/books/coi/records/portcullis.cert (2.790s) Making /build/acl2-8.3dfsg/books/coi/gacc/gacc-exports.cert on 23-Sep-2022 17:01:55 Built /build/acl2-8.3dfsg/books/coi/gacc/gacc-exports.cert (2.850s) Making /build/acl2-8.3dfsg/books/coi/gacc/gacc-pkg.cert on 23-Sep-2022 17:01:59 Built /build/acl2-8.3dfsg/books/coi/gacc/gacc-pkg.cert (2.667s) Making /build/acl2-8.3dfsg/books/coi/syntax/quine.cert on 23-Sep-2022 17:02:01 Built /build/acl2-8.3dfsg/books/coi/syntax/quine.cert (2.782s) Making /build/acl2-8.3dfsg/books/projects/x86isa/portcullis/portcullis.cert on 23-Sep-2022 17:02:04 Built /build/acl2-8.3dfsg/books/projects/x86isa/portcullis/portcullis.cert (3.113s) Making /build/acl2-8.3dfsg/books/kestrel/ethereum/portcullis.cert on 23-Sep-2022 17:02:08 Built /build/acl2-8.3dfsg/books/kestrel/ethereum/portcullis.cert (2.412s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/revappend.cert on 23-Sep-2022 17:02:10 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/revappend.cert (2.248s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/times.cert on 23-Sep-2022 17:02:12 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/times.cert (3.171s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/all-unsigned-byte-p-of-reverse-list.cert on 23-Sep-2022 17:02:16 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/all-unsigned-byte-p-of-reverse-list.cert (2.410s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/first-n-ac.cert on 23-Sep-2022 17:02:18 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/first-n-ac.cert (2.161s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/perm2.cert on 23-Sep-2022 17:02:21 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/perm2.cert (1.942s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/defun-events.cert on 23-Sep-2022 17:02:23 Built /build/acl2-8.3dfsg/books/kestrel/utilities/defun-events.cert (6.647s) Making /build/acl2-8.3dfsg/books/projects/equational/paramod.cert on 23-Sep-2022 17:02:30 Built /build/acl2-8.3dfsg/books/projects/equational/paramod.cert (3.934s) Making /build/acl2-8.3dfsg/books/projects/equational/resolution.cert on 23-Sep-2022 17:02:34 Built /build/acl2-8.3dfsg/books/projects/equational/resolution.cert (5.494s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/unit-propagation-correct.cert on 23-Sep-2022 17:02:39 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/unit-propagation-correct.cert (5.706s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/assignment.cert on 23-Sep-2022 17:02:45 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/assignment.cert (2.110s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/clause.cert on 23-Sep-2022 17:02:47 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/clause.cert (2.334s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/unit-propagation-correct.cert on 23-Sep-2022 17:02:50 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/unit-propagation-correct.cert (5.187s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/unit-propagation-correct.cert on 23-Sep-2022 17:02:55 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/unit-propagation-correct.cert (5.257s) Making /build/acl2-8.3dfsg/books/system/pcert/mid.cert on 23-Sep-2022 17:03:01 Built /build/acl2-8.3dfsg/books/system/pcert/mid.cert (1.887s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/book/models.cert on 23-Sep-2022 17:03:03 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/book/models.cert (3.370s) Making /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/pstate.cert on 23-Sep-2022 17:03:06 Built /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/pstate.cert (6.393s) Making /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/cstate.cert on 23-Sep-2022 17:03:13 Built /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/cstate.cert (10.995s) Making /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/sets.cert on 23-Sep-2022 17:03:24 Built /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/sets.cert (2.712s) Making /build/acl2-8.3dfsg/books/workshops/2004/davis/support/fast.cert on 23-Sep-2022 17:03:27 Built /build/acl2-8.3dfsg/books/workshops/2004/davis/support/fast.cert (11.370s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuforma-normal.cert on 23-Sep-2022 17:03:38 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuforma-normal.cert (11.470s) Making /build/acl2-8.3dfsg/books/workshops/2007/erickson/bprove/exdefs.cert on 23-Sep-2022 17:03:50 Built /build/acl2-8.3dfsg/books/workshops/2007/erickson/bprove/exdefs.cert (25.923s) Making /build/acl2-8.3dfsg/books/workshops/2018/sumners/exload.cert on 23-Sep-2022 17:04:16 Built /build/acl2-8.3dfsg/books/workshops/2018/sumners/exload.cert (2.745s) Making /build/acl2-8.3dfsg/books/workshops/2020/sumners/portcullis.cert on 23-Sep-2022 17:04:19 Built /build/acl2-8.3dfsg/books/workshops/2020/sumners/portcullis.cert (2.764s) cd workshops/2003/greve-wilding-vanfleet/support ; /bin/bash -c "/usr/bin/make" make[4]: Entering directory '/build/acl2-8.3dfsg/books/workshops/2003/greve-wilding-vanfleet/support' Using ACL2=/build/acl2-8.3dfsg/saved_acl2 /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/acl2-8.3dfsg/saved_acl2' make[5]: Entering directory '/build/acl2-8.3dfsg/books/workshops/2003/greve-wilding-vanfleet/support' Making /build/acl2-8.3dfsg/books/workshops/2003/greve-wilding-vanfleet/support/separation.cert on Fri Sep 23 17:04:22 -12 2022 -rw-r--r-- 1 pbuilder1 pbuilder1 2499 Sep 23 17:04 separation.cert Making /build/acl2-8.3dfsg/books/workshops/2003/greve-wilding-vanfleet/support/compatible.cert on Fri Sep 23 17:04:24 -12 2022 -rw-r--r-- 1 pbuilder1 pbuilder1 3102 Sep 23 17:04 compatible.cert Making /build/acl2-8.3dfsg/books/workshops/2003/greve-wilding-vanfleet/support/firewallspec.cert on Fri Sep 23 17:04:25 -12 2022 -rw-r--r-- 1 pbuilder1 pbuilder1 2590 Sep 23 17:04 firewallspec.cert [GC for 49152 CONTIGUOUS-BLOCKS pages..(T=43).GC finished] Making /build/acl2-8.3dfsg/books/workshops/2003/greve-wilding-vanfleet/support/firewallworks.cert on Fri Sep 23 17:04:28 -12 2022 -rw-r--r-- 1 pbuilder1 pbuilder1 8727 Sep 23 17:04 firewallworks.cert make[5]: Leaving directory '/build/acl2-8.3dfsg/books/workshops/2003/greve-wilding-vanfleet/support' make[4]: Leaving directory '/build/acl2-8.3dfsg/books/workshops/2003/greve-wilding-vanfleet/support' Making /build/acl2-8.3dfsg/books/arithmetic-3/pass1/expt-helper.cert on 23-Sep-2022 17:04:30 Built /build/acl2-8.3dfsg/books/arithmetic-3/pass1/expt-helper.cert (2.467s) Making /build/acl2-8.3dfsg/books/arithmetic-2/pass1/expt-helper.cert on 23-Sep-2022 17:04:32 Built /build/acl2-8.3dfsg/books/arithmetic-2/pass1/expt-helper.cert (2.664s) Making /build/acl2-8.3dfsg/books/arithmetic-2/pass1/numerator-and-denominator-helper.cert on 23-Sep-2022 17:04:35 Built /build/acl2-8.3dfsg/books/arithmetic-2/pass1/numerator-and-denominator-helper.cert (4.777s) Making /build/acl2-8.3dfsg/books/centaur/gl/pseudo-termp-lemmas.cert on 23-Sep-2022 17:04:40 Built /build/acl2-8.3dfsg/books/centaur/gl/pseudo-termp-lemmas.cert (3.227s) Making /build/acl2-8.3dfsg/books/centaur/glmc/portcullis.cert on 23-Sep-2022 17:04:43 Built /build/acl2-8.3dfsg/books/centaur/glmc/portcullis.cert (2.690s) Making /build/acl2-8.3dfsg/books/coi/bags/cons.cert on 23-Sep-2022 17:04:46 Built /build/acl2-8.3dfsg/books/coi/bags/cons.cert (3.644s) Making /build/acl2-8.3dfsg/books/coi/defstructure/portcullis.cert on 23-Sep-2022 17:04:50 Built /build/acl2-8.3dfsg/books/coi/defstructure/portcullis.cert (3.039s) Making /build/acl2-8.3dfsg/books/kestrel/hdwallet/portcullis.cert on 23-Sep-2022 17:04:53 Built /build/acl2-8.3dfsg/books/kestrel/hdwallet/portcullis.cert (2.644s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/reverse.cert on 23-Sep-2022 17:04:56 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/reverse.cert (1.899s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/times-and-divides.cert on 23-Sep-2022 17:04:58 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/times-and-divides.cert (1.935s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/nonnegative-integer-quotient.cert on 23-Sep-2022 17:05:00 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/nonnegative-integer-quotient.cert (2.254s) Making /build/acl2-8.3dfsg/books/kestrel/lists-light/top.cert on 23-Sep-2022 17:05:02 Built /build/acl2-8.3dfsg/books/kestrel/lists-light/top.cert (2.729s) Making /build/acl2-8.3dfsg/books/projects/equational/prover.cert on 23-Sep-2022 17:05:05 Built /build/acl2-8.3dfsg/books/projects/equational/prover.cert (3.540s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/satisfiable-add-proof-clause-base.cert on 23-Sep-2022 17:05:09 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/satisfiable-add-proof-clause-base.cert (2.346s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/all-literals.cert on 23-Sep-2022 17:05:11 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/all-literals.cert (2.691s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/satisfiable-add-proof-clause-base.cert on 23-Sep-2022 17:05:14 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/satisfiable-add-proof-clause-base.cert (3.150s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/satisfiable-add-proof-clause-base.cert on 23-Sep-2022 17:05:18 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/satisfiable-add-proof-clause-base.cert (2.456s) Making /build/acl2-8.3dfsg/books/system/pcert/top.pcert0 on 23-Sep-2022 17:05:20 Built /build/acl2-8.3dfsg/books/system/pcert/top.pcert0 (2.266s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/book/syntax.cert on 23-Sep-2022 17:05:23 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/book/syntax.cert (3.325s) Making /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/compile.cert on 23-Sep-2022 17:05:26 Built /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/compile.cert (5.069s) Making /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/lstate.cert on 23-Sep-2022 17:05:31 Built /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/lstate.cert (4.022s) Making /build/acl2-8.3dfsg/books/workshops/2004/davis/support/outer.cert on 23-Sep-2022 17:05:35 Built /build/acl2-8.3dfsg/books/workshops/2004/davis/support/outer.cert (17.119s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fusuma.cert on 23-Sep-2022 17:05:53 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fusuma.cert (2.939s) Making /build/acl2-8.3dfsg/books/arithmetic-3/pass1/expt.cert on 23-Sep-2022 17:05:56 Built /build/acl2-8.3dfsg/books/arithmetic-3/pass1/expt.cert (3.123s) Making /build/acl2-8.3dfsg/books/arithmetic-2/pass1/expt.cert on 23-Sep-2022 17:05:59 Built /build/acl2-8.3dfsg/books/arithmetic-2/pass1/expt.cert (2.685s) Making /build/acl2-8.3dfsg/books/arithmetic-2/pass1/numerator-and-denominator.cert on 23-Sep-2022 17:06:02 Built /build/acl2-8.3dfsg/books/arithmetic-2/pass1/numerator-and-denominator.cert (2.042s) Making /build/acl2-8.3dfsg/books/centaur/glmc/glmc-templates.cert on 23-Sep-2022 17:06:04 Built /build/acl2-8.3dfsg/books/centaur/glmc/glmc-templates.cert (2.672s) Making /build/acl2-8.3dfsg/books/coi/defstructure/defstructure-pkg.cert on 23-Sep-2022 17:06:07 Built /build/acl2-8.3dfsg/books/coi/defstructure/defstructure-pkg.cert (3.010s) Making /build/acl2-8.3dfsg/books/kestrel/alists-light/pairlis-dollar-fast.cert on 23-Sep-2022 17:06:10 Built /build/acl2-8.3dfsg/books/kestrel/alists-light/pairlis-dollar-fast.cert (2.289s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/satisfiable-maybe-shrink-formula.cert on 23-Sep-2022 17:06:12 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/satisfiable-maybe-shrink-formula.cert (5.636s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/evaluator.cert on 23-Sep-2022 17:06:18 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/evaluator.cert (16.962s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/satisfiable-add-proof-clause-rup.cert on 23-Sep-2022 17:06:35 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/satisfiable-add-proof-clause-rup.cert (2.645s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/satisfiable-maybe-shrink-formula.cert on 23-Sep-2022 17:06:38 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/satisfiable-maybe-shrink-formula.cert (5.341s) Making /build/acl2-8.3dfsg/books/system/pcert/top.pcert1 on 23-Sep-2022 17:06:44 Built /build/acl2-8.3dfsg/books/system/pcert/top.pcert1 (1.136s) Making /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/mstate.cert on 23-Sep-2022 17:06:45 Built /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/mstate.cert (18.300s) Making /build/acl2-8.3dfsg/books/workshops/2004/davis/support/sort.cert on 23-Sep-2022 17:07:03 Built /build/acl2-8.3dfsg/books/workshops/2004/davis/support/sort.cert (4.686s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fucongruencias-suma.cert on 23-Sep-2022 17:07:08 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fucongruencias-suma.cert (2.616s) Making /build/acl2-8.3dfsg/books/arithmetic-3/pass1/mini-theories.cert on 23-Sep-2022 17:07:11 Built /build/acl2-8.3dfsg/books/arithmetic-3/pass1/mini-theories.cert (2.117s) Making /build/acl2-8.3dfsg/books/arithmetic-3/pass1/non-linear.cert on 23-Sep-2022 17:07:13 Built /build/acl2-8.3dfsg/books/arithmetic-3/pass1/non-linear.cert (2.039s) Making /build/acl2-8.3dfsg/books/arithmetic-2/pass1/mini-theories.cert on 23-Sep-2022 17:07:15 Built /build/acl2-8.3dfsg/books/arithmetic-2/pass1/mini-theories.cert (2.100s) Making /build/acl2-8.3dfsg/books/kestrel/alists-light/top.cert on 23-Sep-2022 17:07:18 Built /build/acl2-8.3dfsg/books/kestrel/alists-light/top.cert (1.999s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/satisfiable-add-proof-clause-rup.cert on 23-Sep-2022 17:07:20 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/satisfiable-add-proof-clause-rup.cert (2.714s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/unit-propagation.cert on 23-Sep-2022 17:07:23 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/supplemental/unit-propagation.cert (4.453s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/sat-drat-claim-1.cert on 23-Sep-2022 17:07:27 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/sat-drat-claim-1.cert (2.523s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/satisfiable-add-proof-clause-rup.cert on 23-Sep-2022 17:07:30 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/satisfiable-add-proof-clause-rup.cert (2.768s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/rat-checker.cert on 23-Sep-2022 17:07:33 Tick Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/rat-checker.cert (71.496s) Making /build/acl2-8.3dfsg/books/system/pcert/top.cert on 23-Sep-2022 17:08:45 Built /build/acl2-8.3dfsg/books/system/pcert/top.cert (1.220s) Making /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/setup.cert on 23-Sep-2022 17:08:46 Built /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/setup.cert (8.873s) Making /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepproc1.cert on 23-Sep-2022 17:08:55 Built /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepproc1.cert (110.481s) Making /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepproc0.cert on 23-Sep-2022 17:10:46 Built /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepproc0.cert (23.138s) Making /build/acl2-8.3dfsg/books/workshops/2004/davis/support/sets.cert on 23-Sep-2022 17:11:09 Built /build/acl2-8.3dfsg/books/workshops/2004/davis/support/sets.cert (7.105s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuopuesto.cert on 23-Sep-2022 17:11:16 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuopuesto.cert (3.073s) Making /build/acl2-8.3dfsg/books/arithmetic-3/pass1/num-and-denom-helper.cert on 23-Sep-2022 17:11:19 Built /build/acl2-8.3dfsg/books/arithmetic-3/pass1/num-and-denom-helper.cert (4.861s) Making /build/acl2-8.3dfsg/books/arithmetic-2/pass1/top.cert on 23-Sep-2022 17:11:24 Built /build/acl2-8.3dfsg/books/arithmetic-2/pass1/top.cert (1.874s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/sat-drat-claim-1.cert on 23-Sep-2022 17:11:26 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/sat-drat-claim-1.cert (2.481s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/drat/drat-checker-basic.cert on 23-Sep-2022 17:11:29 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/drat/drat-checker-basic.cert (71.877s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/sat-drat-claim-2-3.cert on 23-Sep-2022 17:12:41 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/sat-drat-claim-2-3.cert (24.161s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/sat-drat-claim-1.cert on 23-Sep-2022 17:13:05 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/sat-drat-claim-1.cert (2.375s) Making /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepproc2.cert on 23-Sep-2022 17:13:08 Built /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepproc2.cert (266.135s) Making /build/acl2-8.3dfsg/books/workshops/2004/davis/support/quantify.cert on 23-Sep-2022 17:17:34 Built /build/acl2-8.3dfsg/books/workshops/2004/davis/support/quantify.cert (11.465s) Making /build/acl2-8.3dfsg/books/workshops/2004/davis/support/set-order.cert on 23-Sep-2022 17:17:46 Built /build/acl2-8.3dfsg/books/workshops/2004/davis/support/set-order.cert (2.582s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuproducto.cert on 23-Sep-2022 17:17:49 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuproducto.cert (5.991s) Making /build/acl2-8.3dfsg/books/arithmetic-3/pass1/numerator-and-denominator.cert on 23-Sep-2022 17:17:55 Built /build/acl2-8.3dfsg/books/arithmetic-3/pass1/numerator-and-denominator.cert (2.166s) Making /build/acl2-8.3dfsg/books/arithmetic-2/meta/pre.cert on 23-Sep-2022 17:17:57 Built /build/acl2-8.3dfsg/books/arithmetic-2/meta/pre.cert (1.919s) Making /build/acl2-8.3dfsg/books/arithmetic-2/meta/integerp.cert on 23-Sep-2022 17:17:59 Built /build/acl2-8.3dfsg/books/arithmetic-2/meta/integerp.cert (2.062s) Making /build/acl2-8.3dfsg/books/arithmetic-2/meta/integerp-meta.cert on 23-Sep-2022 17:18:01 Built /build/acl2-8.3dfsg/books/arithmetic-2/meta/integerp-meta.cert (10.589s) Making /build/acl2-8.3dfsg/books/arithmetic-2/meta/common-meta.cert on 23-Sep-2022 17:18:12 Built /build/acl2-8.3dfsg/books/arithmetic-2/meta/common-meta.cert (15.531s) Making /build/acl2-8.3dfsg/books/arithmetic-2/meta/cancel-terms-helper.cert on 23-Sep-2022 17:18:28 Built /build/acl2-8.3dfsg/books/arithmetic-2/meta/cancel-terms-helper.cert (2.894s) Making /build/acl2-8.3dfsg/books/arithmetic-2/meta/numerator-and-denominator.cert on 23-Sep-2022 17:18:31 Built /build/acl2-8.3dfsg/books/arithmetic-2/meta/numerator-and-denominator.cert (1.955s) Making /build/acl2-8.3dfsg/books/arithmetic-2/meta/expt-helper.cert on 23-Sep-2022 17:18:33 Built /build/acl2-8.3dfsg/books/arithmetic-2/meta/expt-helper.cert (2.067s) Making /build/acl2-8.3dfsg/books/arithmetic-2/meta/non-linear.cert on 23-Sep-2022 17:18:35 Built /build/acl2-8.3dfsg/books/arithmetic-2/meta/non-linear.cert (2.775s) Making /build/acl2-8.3dfsg/books/arithmetic-2/meta/mini-theories.cert on 23-Sep-2022 17:18:38 Built /build/acl2-8.3dfsg/books/arithmetic-2/meta/mini-theories.cert (1.903s) Making /build/acl2-8.3dfsg/books/arithmetic-2/meta/post.cert on 23-Sep-2022 17:18:40 Built /build/acl2-8.3dfsg/books/arithmetic-2/meta/post.cert (2.237s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/sat-drat-claim-2.cert on 23-Sep-2022 17:18:42 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/sat-drat-claim-2.cert (2.635s) Making /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepprocess.cert on 23-Sep-2022 17:18:45 Built /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepprocess.cert (6.744s) Making /build/acl2-8.3dfsg/books/workshops/2004/davis/support/map.cert on 23-Sep-2022 17:18:52 Built /build/acl2-8.3dfsg/books/workshops/2004/davis/support/map.cert (10.147s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fucongruencias-producto.cert on 23-Sep-2022 17:19:02 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fucongruencias-producto.cert (9.080s) Making /build/acl2-8.3dfsg/books/arithmetic-3/pass1/top.cert on 23-Sep-2022 17:19:12 Built /build/acl2-8.3dfsg/books/arithmetic-3/pass1/top.cert (2.020s) Making /build/acl2-8.3dfsg/books/arithmetic-2/meta/cancel-terms-meta.cert on 23-Sep-2022 17:19:14 Built /build/acl2-8.3dfsg/books/arithmetic-2/meta/cancel-terms-meta.cert (16.578s) Making /build/acl2-8.3dfsg/books/arithmetic-2/meta/collect-terms-meta.cert on 23-Sep-2022 17:19:31 Built /build/acl2-8.3dfsg/books/arithmetic-2/meta/collect-terms-meta.cert (2.922s) Making /build/acl2-8.3dfsg/books/arithmetic-2/meta/expt.cert on 23-Sep-2022 17:19:34 Built /build/acl2-8.3dfsg/books/arithmetic-2/meta/expt.cert (3.049s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/satisfiable-add-proof-clause-drat.cert on 23-Sep-2022 17:19:37 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/satisfiable-add-proof-clause-drat.cert (6.240s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fupolinomio-normalizado.cert on 23-Sep-2022 17:19:43 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fupolinomio-normalizado.cert (3.642s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/mini-theories-helper.cert on 23-Sep-2022 17:19:47 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/mini-theories-helper.cert (2.355s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/common.cert on 23-Sep-2022 17:19:50 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/common.cert (6.482s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/basic-helper.cert on 23-Sep-2022 17:19:56 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/basic-helper.cert (2.156s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/simplify-helper.cert on 23-Sep-2022 17:19:59 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/simplify-helper.cert (2.807s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/numerator-and-denominator.cert on 23-Sep-2022 17:20:01 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/numerator-and-denominator.cert (1.922s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/integerp.cert on 23-Sep-2022 17:20:04 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/integerp.cert (9.874s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/integerp-meta.cert on 23-Sep-2022 17:20:14 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/integerp-meta.cert (25.937s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/collect.cert on 23-Sep-2022 17:20:40 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/collect.cert (4.188s) Making /build/acl2-8.3dfsg/books/arithmetic-2/meta/top.cert on 23-Sep-2022 17:20:44 Built /build/acl2-8.3dfsg/books/arithmetic-2/meta/top.cert (2.182s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/satisfiable-add-proof-clause.cert on 23-Sep-2022 17:20:46 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/satisfiable-add-proof-clause.cert (2.013s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuquot-rem.cert on 23-Sep-2022 17:20:49 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuquot-rem.cert (100.702s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/mini-theories.cert on 23-Sep-2022 17:22:29 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/mini-theories.cert (2.007s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/basic.cert on 23-Sep-2022 17:22:32 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/basic.cert (3.875s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/soundness.cert on 23-Sep-2022 17:22:36 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/soundness.cert (3.725s) Making /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/ltl.cert on 23-Sep-2022 17:22:40 Built /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/ltl.cert (46.596s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/normalize.cert on 23-Sep-2022 17:23:26 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/normalize.cert (11.175s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/simplify.cert on 23-Sep-2022 17:23:38 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/simplify.cert (31.650s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/arithmetic-theory.cert on 23-Sep-2022 17:24:10 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/arithmetic-theory.cert (8.768s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/top.cert on 23-Sep-2022 17:24:18 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev1/top.cert (8.994s) Making /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/bisimilarity.cert on 23-Sep-2022 17:24:28 Built /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/bisimilarity.cert (51.836s) Making /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/conjunction.cert on 23-Sep-2022 17:25:20 Built /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/conjunction.cert (49.975s) Making /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/top.cert on 23-Sep-2022 17:26:10 Built /build/acl2-8.3dfsg/books/arithmetic-3/bind-free/top.cert (3.118s) Making /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/circuit-bisim.cert on 23-Sep-2022 17:26:13 Built /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/circuit-bisim.cert (7.033s) Making /build/acl2-8.3dfsg/books/arithmetic-3/floor-mod/floor-mod.cert on 23-Sep-2022 17:26:20 Built /build/acl2-8.3dfsg/books/arithmetic-3/floor-mod/floor-mod.cert (39.643s) Making /build/acl2-8.3dfsg/books/projects/symbolic/tiny-fib/defstobj+.cert on 23-Sep-2022 17:27:00 Built /build/acl2-8.3dfsg/books/projects/symbolic/tiny-fib/defstobj+.cert (7.984s) Making /build/acl2-8.3dfsg/books/proofstyles/invclock/c2i/c2i-partial.cert on 23-Sep-2022 17:27:08 Built /build/acl2-8.3dfsg/books/proofstyles/invclock/c2i/c2i-partial.cert (5.278s) Making /build/acl2-8.3dfsg/books/proofstyles/invclock/i2c/i2c-partial.cert on 23-Sep-2022 17:27:14 Built /build/acl2-8.3dfsg/books/proofstyles/invclock/i2c/i2c-partial.cert (4.994s) Making /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/circuits.cert on 23-Sep-2022 17:27:19 Built /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/circuits.cert (9.264s) Making /build/acl2-8.3dfsg/books/workshops/2004/legato/support/generic-theory-alternative-induction-mult.cert on 23-Sep-2022 17:27:28 Built /build/acl2-8.3dfsg/books/workshops/2004/legato/support/generic-theory-alternative-induction-mult.cert (90.363s) Making /build/acl2-8.3dfsg/books/workshops/2004/legato/support/generic-theory-alternative-induction-sum.cert on 23-Sep-2022 17:28:59 Built /build/acl2-8.3dfsg/books/workshops/2004/legato/support/generic-theory-alternative-induction-sum.cert (7.305s) Making /build/acl2-8.3dfsg/books/workshops/2004/legato/support/generic-theory-loop-invariant-mult.cert on 23-Sep-2022 17:29:06 Built /build/acl2-8.3dfsg/books/workshops/2004/legato/support/generic-theory-loop-invariant-mult.cert (390.030s) Making /build/acl2-8.3dfsg/books/workshops/2004/legato/support/generic-theory-loop-invariant-sum.cert on 23-Sep-2022 17:35:36 Built /build/acl2-8.3dfsg/books/workshops/2004/legato/support/generic-theory-loop-invariant-sum.cert (6.989s) Making /build/acl2-8.3dfsg/books/workshops/2004/legato/support/generic-theory-tail-recursion-mult.cert on 23-Sep-2022 17:35:44 Tick Built /build/acl2-8.3dfsg/books/workshops/2004/legato/support/generic-theory-tail-recursion-mult.cert (573.439s) Making /build/acl2-8.3dfsg/books/workshops/2004/legato/support/generic-theory-tail-recursion-sum.cert on 23-Sep-2022 17:45:17 Built /build/acl2-8.3dfsg/books/workshops/2004/legato/support/generic-theory-tail-recursion-sum.cert (6.308s) Making /build/acl2-8.3dfsg/books/workshops/2004/legato/support/proof-by-generalization-mult.cert on 23-Sep-2022 17:45:24 Built /build/acl2-8.3dfsg/books/workshops/2004/legato/support/proof-by-generalization-mult.cert (143.007s) Making /build/acl2-8.3dfsg/books/workshops/2004/legato/support/proof-by-generalization-sum.cert on 23-Sep-2022 17:47:47 Built /build/acl2-8.3dfsg/books/workshops/2004/legato/support/proof-by-generalization-sum.cert (7.505s) Making /build/acl2-8.3dfsg/books/workshops/2004/matthews-vroon/support/tiny-fib-example/defstobj+.cert on 23-Sep-2022 17:47:54 Built /build/acl2-8.3dfsg/books/workshops/2004/matthews-vroon/support/tiny-fib-example/defstobj+.cert (7.560s) Making /build/acl2-8.3dfsg/books/workshops/2004/ray/support/generic.cert on 23-Sep-2022 17:48:02 Built /build/acl2-8.3dfsg/books/workshops/2004/ray/support/generic.cert (4.787s) Making /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/mod_lemmas.cert on 23-Sep-2022 17:48:07 Built /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/mod_lemmas.cert (4.621s) Making /build/acl2-8.3dfsg/books/workshops/2006/gordon-hunt-kaufmann-reynolds/support/data.cert on 23-Sep-2022 17:48:12 Built /build/acl2-8.3dfsg/books/workshops/2006/gordon-hunt-kaufmann-reynolds/support/data.cert (4.565s) Making /build/acl2-8.3dfsg/books/workshops/2006/swords-cook/lcsoundness/defsum-thms.cert on 23-Sep-2022 17:48:17 Built /build/acl2-8.3dfsg/books/workshops/2006/swords-cook/lcsoundness/defsum-thms.cert (3.182s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/octagon-routing/mod_lemmas.cert on 23-Sep-2022 17:48:20 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/octagon-routing/mod_lemmas.cert (4.676s) Making /build/acl2-8.3dfsg/books/arithmetic-3/top.cert on 23-Sep-2022 17:48:25 Built /build/acl2-8.3dfsg/books/arithmetic-3/top.cert (2.933s) Making /build/acl2-8.3dfsg/books/arithmetic-3/floor-mod/mod-expt-fast.cert on 23-Sep-2022 17:48:28 Built /build/acl2-8.3dfsg/books/arithmetic-3/floor-mod/mod-expt-fast.cert (26.120s) Making /build/acl2-8.3dfsg/books/clause-processors/bv-add-common.cert on 23-Sep-2022 17:48:54 Built /build/acl2-8.3dfsg/books/clause-processors/bv-add-common.cert (6.233s) Making /build/acl2-8.3dfsg/books/clause-processors/bv-add.cert on 23-Sep-2022 17:49:00 Built /build/acl2-8.3dfsg/books/clause-processors/bv-add.cert (9.942s) Making /build/acl2-8.3dfsg/books/data-structures/memories/log2.cert on 23-Sep-2022 17:49:11 Built /build/acl2-8.3dfsg/books/data-structures/memories/log2.cert (4.360s) Making /build/acl2-8.3dfsg/books/data-structures/memories/memtree.cert on 23-Sep-2022 17:49:15 Built /build/acl2-8.3dfsg/books/data-structures/memories/memtree.cert (53.877s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/expt.cert on 23-Sep-2022 17:50:09 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/expt.cert (3.053s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/padding/pad-to-448.cert on 23-Sep-2022 17:50:12 Built /build/acl2-8.3dfsg/books/kestrel/crypto/padding/pad-to-448.cert (4.444s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/padding/pad-to-896.cert on 23-Sep-2022 17:50:17 Built /build/acl2-8.3dfsg/books/kestrel/crypto/padding/pad-to-896.cert (4.557s) Making /build/acl2-8.3dfsg/books/misc/radix.cert on 23-Sep-2022 17:50:22 Built /build/acl2-8.3dfsg/books/misc/radix.cert (5.291s) Making /build/acl2-8.3dfsg/books/misc/random.cert on 23-Sep-2022 17:50:27 Built /build/acl2-8.3dfsg/books/misc/random.cert (4.499s) Making /build/acl2-8.3dfsg/books/projects/security/jfkr/diffie-helman.cert on 23-Sep-2022 17:50:32 Built /build/acl2-8.3dfsg/books/projects/security/jfkr/diffie-helman.cert (15.324s) Making /build/acl2-8.3dfsg/books/projects/security/jfkr/random.cert on 23-Sep-2022 17:50:47 Built /build/acl2-8.3dfsg/books/projects/security/jfkr/random.cert (3.492s) Making /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/cone-of-influence.cert on 23-Sep-2022 17:50:51 Built /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/cone-of-influence.cert (29.654s) Making /build/acl2-8.3dfsg/books/workshops/2004/ray/support/defcoerce.cert on 23-Sep-2022 17:51:21 Built /build/acl2-8.3dfsg/books/workshops/2004/ray/support/defcoerce.cert (8.076s) Making /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/routing_defuns.cert on 23-Sep-2022 17:51:29 Built /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/routing_defuns.cert (75.416s) Making /build/acl2-8.3dfsg/books/workshops/2006/gordon-hunt-kaufmann-reynolds/support/basic.cert on 23-Sep-2022 17:52:44 Built /build/acl2-8.3dfsg/books/workshops/2006/gordon-hunt-kaufmann-reynolds/support/basic.cert (3.500s) Making /build/acl2-8.3dfsg/books/workshops/2006/gordon-hunt-kaufmann-reynolds/support/guarded.cert on 23-Sep-2022 17:52:48 Built /build/acl2-8.3dfsg/books/workshops/2006/gordon-hunt-kaufmann-reynolds/support/guarded.cert (3.455s) Making /build/acl2-8.3dfsg/books/workshops/2006/gordon-hunt-kaufmann-reynolds/support/stobjs.cert on 23-Sep-2022 17:52:52 Built /build/acl2-8.3dfsg/books/workshops/2006/gordon-hunt-kaufmann-reynolds/support/stobjs.cert (4.679s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/octagon-routing/routing_defuns.cert on 23-Sep-2022 17:52:56 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/octagon-routing/routing_defuns.cert (76.144s) Making /build/acl2-8.3dfsg/books/workshops/2009/cowles-gamboa-triangle-square/materials/log2.cert on 23-Sep-2022 17:54:13 Built /build/acl2-8.3dfsg/books/workshops/2009/cowles-gamboa-triangle-square/materials/log2.cert (5.977s) Making /build/acl2-8.3dfsg/books/workshops/2011/cowles-gamboa-sierpinski/support/r-no-cover.cert on 23-Sep-2022 17:54:19 Built /build/acl2-8.3dfsg/books/workshops/2011/cowles-gamboa-sierpinski/support/r-no-cover.cert (31.927s) Making /build/acl2-8.3dfsg/books/workshops/2011/cowles-gamboa-sierpinski/support/s-no-cover.cert on 23-Sep-2022 17:54:51 Built /build/acl2-8.3dfsg/books/workshops/2011/cowles-gamboa-sierpinski/support/s-no-cover.cert (12.212s) Making /build/acl2-8.3dfsg/books/workshops/2011/cowles-gamboa-sierpinski/support/s-no-cover1.cert on 23-Sep-2022 17:55:03 Built /build/acl2-8.3dfsg/books/workshops/2011/cowles-gamboa-sierpinski/support/s-no-cover1.cert (11.984s) Making /build/acl2-8.3dfsg/books/clause-processors/bv-add-tests.cert on 23-Sep-2022 17:55:16 Built /build/acl2-8.3dfsg/books/clause-processors/bv-add-tests.cert (9.818s) Making /build/acl2-8.3dfsg/books/coi/records/fast/log2.cert on 23-Sep-2022 17:55:25 Built /build/acl2-8.3dfsg/books/coi/records/fast/log2.cert (2.133s) Making /build/acl2-8.3dfsg/books/coi/records/fast/memtree.cert on 23-Sep-2022 17:55:28 Built /build/acl2-8.3dfsg/books/coi/records/fast/memtree.cert (1.890s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/expt2.cert on 23-Sep-2022 17:55:30 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/expt2.cert (3.392s) Making /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/reductions.cert on 23-Sep-2022 17:55:33 Built /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/reductions.cert (5.585s) Making /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/getting_rid_of_mod.cert on 23-Sep-2022 17:55:39 Built /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/getting_rid_of_mod.cert (269.961s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/octagon-routing/getting_rid_of_mod.cert on 23-Sep-2022 18:00:09 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/octagon-routing/getting_rid_of_mod.cert (271.654s) Making /build/acl2-8.3dfsg/books/workshops/2009/cowles-gamboa-triangle-square/materials/tri-sq.cert on 23-Sep-2022 18:04:41 Built /build/acl2-8.3dfsg/books/workshops/2009/cowles-gamboa-triangle-square/materials/tri-sq.cert (37.804s) Making /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/impl-hack.cert on 23-Sep-2022 18:05:19 Built /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/impl-hack.cert (2.476s) Making /build/acl2-8.3dfsg/books/arithmetic-5/support/basic-arithmetic-helper.cert on 23-Sep-2022 18:05:22 Built /build/acl2-8.3dfsg/books/arithmetic-5/support/basic-arithmetic-helper.cert (1.866s) Making /build/acl2-8.3dfsg/books/system/observation1-cw.cert on 23-Sep-2022 18:05:24 Built /build/acl2-8.3dfsg/books/system/observation1-cw.cert (2.097s) Making /build/acl2-8.3dfsg/books/arithmetic-5/support/basic-arithmetic.cert on 23-Sep-2022 18:05:26 Built /build/acl2-8.3dfsg/books/arithmetic-5/support/basic-arithmetic.cert (2.218s) Making /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/dynamic-e-d.cert on 23-Sep-2022 18:05:28 Built /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/dynamic-e-d.cert (2.545s) Making /build/acl2-8.3dfsg/books/arithmetic-5/support/inequalities.cert on 23-Sep-2022 18:05:31 Built /build/acl2-8.3dfsg/books/arithmetic-5/support/inequalities.cert (2.222s) Making /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/default-hint.cert on 23-Sep-2022 18:05:34 Built /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/default-hint.cert (3.818s) Making /build/acl2-8.3dfsg/books/arithmetic-5/support/prefer-times.cert on 23-Sep-2022 18:05:38 Built /build/acl2-8.3dfsg/books/arithmetic-5/support/prefer-times.cert (2.095s) Making /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/elim-hint.cert on 23-Sep-2022 18:05:40 Built /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/elim-hint.cert (9.198s) Making /build/acl2-8.3dfsg/books/arithmetic-5/support/expt-helper.cert on 23-Sep-2022 18:05:49 Built /build/acl2-8.3dfsg/books/arithmetic-5/support/expt-helper.cert (2.773s) Making /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/distributivity.cert on 23-Sep-2022 18:05:52 Built /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/distributivity.cert (1.782s) Making /build/acl2-8.3dfsg/books/arithmetic-5/support/expt.cert on 23-Sep-2022 18:05:54 Built /build/acl2-8.3dfsg/books/arithmetic-5/support/expt.cert (2.968s) Making /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/we-are-here.cert on 23-Sep-2022 18:05:57 Built /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/we-are-here.cert (1.947s) Making /build/acl2-8.3dfsg/books/arithmetic-5/support/non-linear.cert on 23-Sep-2022 18:05:59 Built /build/acl2-8.3dfsg/books/arithmetic-5/support/non-linear.cert (2.374s) Making /build/acl2-8.3dfsg/books/arithmetic-5/support/mini-theories.cert on 23-Sep-2022 18:06:02 Built /build/acl2-8.3dfsg/books/arithmetic-5/support/mini-theories.cert (2.090s) Making /build/acl2-8.3dfsg/books/arithmetic-5/support/num-and-denom-helper.cert on 23-Sep-2022 18:06:04 Built /build/acl2-8.3dfsg/books/arithmetic-5/support/num-and-denom-helper.cert (4.904s) Making /build/acl2-8.3dfsg/books/xdoc/book-thms.cert on 23-Sep-2022 18:06:09 Built /build/acl2-8.3dfsg/books/xdoc/book-thms.cert (3.503s) Making /build/acl2-8.3dfsg/books/arithmetic-5/support/numerator-and-denominator.cert on 23-Sep-2022 18:06:13 Built /build/acl2-8.3dfsg/books/arithmetic-5/support/numerator-and-denominator.cert (2.120s) Making /build/acl2-8.3dfsg/books/xdoc/book-thms-example.cert on 23-Sep-2022 18:06:15 Built /build/acl2-8.3dfsg/books/xdoc/book-thms-example.cert (2.332s) Making /build/acl2-8.3dfsg/books/arithmetic-5/support/top.cert on 23-Sep-2022 18:06:18 Built /build/acl2-8.3dfsg/books/arithmetic-5/support/top.cert (2.144s) Making /build/acl2-8.3dfsg/books/xdoc/top.cert on 23-Sep-2022 18:06:20 Built /build/acl2-8.3dfsg/books/xdoc/top.cert (7.997s) Making /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/types-helper.cert on 23-Sep-2022 18:06:28 Built /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/types-helper.cert (1.888s) Making /build/acl2-8.3dfsg/books/data-structures/utilities.cert on 23-Sep-2022 18:06:30 Built /build/acl2-8.3dfsg/books/data-structures/utilities.cert (11.870s) Making /build/acl2-8.3dfsg/books/cowles/acl2-asg.cert on 23-Sep-2022 18:06:42 Built /build/acl2-8.3dfsg/books/cowles/acl2-asg.cert (3.165s) Making /build/acl2-8.3dfsg/books/arithmetic/rational-listp.cert on 23-Sep-2022 18:06:45 Built /build/acl2-8.3dfsg/books/arithmetic/rational-listp.cert (2.329s) Making /build/acl2-8.3dfsg/books/arithmetic/nat-listp.cert on 23-Sep-2022 18:06:48 Built /build/acl2-8.3dfsg/books/arithmetic/nat-listp.cert (2.571s) Making /build/acl2-8.3dfsg/books/std/util/support.cert on 23-Sep-2022 18:06:51 Built /build/acl2-8.3dfsg/books/std/util/support.cert (6.209s) Making /build/acl2-8.3dfsg/books/tools/rulesets.cert on 23-Sep-2022 18:06:57 Built /build/acl2-8.3dfsg/books/tools/rulesets.cert (5.593s) Making /build/acl2-8.3dfsg/books/std/util/cons.cert on 23-Sep-2022 18:07:03 Built /build/acl2-8.3dfsg/books/std/util/cons.cert (2.963s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/defmacroq.cert on 23-Sep-2022 18:07:06 Built /build/acl2-8.3dfsg/books/kestrel/utilities/defmacroq.cert (2.744s) Making /build/acl2-8.3dfsg/books/std/basic/defs.cert on 23-Sep-2022 18:07:09 Built /build/acl2-8.3dfsg/books/std/basic/defs.cert (4.446s) Making /build/acl2-8.3dfsg/books/misc/file-io.cert on 23-Sep-2022 18:07:13 Built /build/acl2-8.3dfsg/books/misc/file-io.cert (4.634s) Making /build/acl2-8.3dfsg/books/std/lists/abstract.cert on 23-Sep-2022 18:07:18 Built /build/acl2-8.3dfsg/books/std/lists/abstract.cert (7.578s) Making /build/acl2-8.3dfsg/books/std/basic/inductions.cert on 23-Sep-2022 18:07:26 Built /build/acl2-8.3dfsg/books/std/basic/inductions.cert (2.944s) Making /build/acl2-8.3dfsg/books/misc/total-order.cert on 23-Sep-2022 18:07:29 Built /build/acl2-8.3dfsg/books/misc/total-order.cert (5.159s) Making /build/acl2-8.3dfsg/books/tools/flag.cert on 23-Sep-2022 18:07:34 Built /build/acl2-8.3dfsg/books/tools/flag.cert (17.655s) Making /build/acl2-8.3dfsg/books/std/testing/must-be-redundant.cert on 23-Sep-2022 18:07:52 Tick Built /build/acl2-8.3dfsg/books/std/testing/must-be-redundant.cert (2.241s) Making /build/acl2-8.3dfsg/books/std/testing/must-eval-to.cert on 23-Sep-2022 18:07:55 Built /build/acl2-8.3dfsg/books/std/testing/must-eval-to.cert (2.518s) Making /build/acl2-8.3dfsg/books/std/basic/pos-fix.cert on 23-Sep-2022 18:07:57 Built /build/acl2-8.3dfsg/books/std/basic/pos-fix.cert (2.291s) Making /build/acl2-8.3dfsg/books/clause-processors/equality.cert on 23-Sep-2022 18:08:00 Built /build/acl2-8.3dfsg/books/clause-processors/equality.cert (5.359s) Making /build/acl2-8.3dfsg/books/std/lists/index-of.cert on 23-Sep-2022 18:08:05 Built /build/acl2-8.3dfsg/books/std/lists/index-of.cert (3.616s) Making /build/acl2-8.3dfsg/books/std/lists/len.cert on 23-Sep-2022 18:08:09 Built /build/acl2-8.3dfsg/books/std/lists/len.cert (2.679s) Making /build/acl2-8.3dfsg/books/std/alists/alist-keys.cert on 23-Sep-2022 18:08:12 Built /build/acl2-8.3dfsg/books/std/alists/alist-keys.cert (3.076s) Making /build/acl2-8.3dfsg/books/std/lists/remove1-equal.cert on 23-Sep-2022 18:08:15 Built /build/acl2-8.3dfsg/books/std/lists/remove1-equal.cert (2.450s) Making /build/acl2-8.3dfsg/books/std/lists/suffixp.cert on 23-Sep-2022 18:08:18 Built /build/acl2-8.3dfsg/books/std/lists/suffixp.cert (2.627s) Making /build/acl2-8.3dfsg/books/std/lists/true-listp.cert on 23-Sep-2022 18:08:20 Built /build/acl2-8.3dfsg/books/std/lists/true-listp.cert (2.331s) Making /build/acl2-8.3dfsg/books/std/lists/union.cert on 23-Sep-2022 18:08:23 Built /build/acl2-8.3dfsg/books/std/lists/union.cert (2.423s) Making /build/acl2-8.3dfsg/books/std/alists/alist-vals.cert on 23-Sep-2022 18:08:25 Built /build/acl2-8.3dfsg/books/std/alists/alist-vals.cert (2.975s) Making /build/acl2-8.3dfsg/books/std/alists/alist-fix.cert on 23-Sep-2022 18:08:29 Built /build/acl2-8.3dfsg/books/std/alists/alist-fix.cert (2.545s) Making /build/acl2-8.3dfsg/books/std/alists/append-alist-keys.cert on 23-Sep-2022 18:08:31 Built /build/acl2-8.3dfsg/books/std/alists/append-alist-keys.cert (2.775s) Making /build/acl2-8.3dfsg/books/std/alists/append-alist-vals.cert on 23-Sep-2022 18:08:34 Built /build/acl2-8.3dfsg/books/std/alists/append-alist-vals.cert (2.917s) Making /build/acl2-8.3dfsg/books/std/alists/alist-equiv.cert on 23-Sep-2022 18:08:37 Built /build/acl2-8.3dfsg/books/std/alists/alist-equiv.cert (4.650s) Making /build/acl2-8.3dfsg/books/std/alists/hons-remove-assoc.cert on 23-Sep-2022 18:08:42 Built /build/acl2-8.3dfsg/books/std/alists/hons-remove-assoc.cert (2.763s) Making /build/acl2-8.3dfsg/books/std/alists/hons-rassoc-equal.cert on 23-Sep-2022 18:08:45 Built /build/acl2-8.3dfsg/books/std/alists/hons-rassoc-equal.cert (3.077s) Making /build/acl2-8.3dfsg/books/xdoc/constructors.cert on 23-Sep-2022 18:08:48 Built /build/acl2-8.3dfsg/books/xdoc/constructors.cert (14.267s) Making /build/acl2-8.3dfsg/books/std/alists/remove-assoc-equal.cert on 23-Sep-2022 18:09:03 Built /build/acl2-8.3dfsg/books/std/alists/remove-assoc-equal.cert (2.271s) Making /build/acl2-8.3dfsg/books/std/alists/assoc.cert on 23-Sep-2022 18:09:05 Built /build/acl2-8.3dfsg/books/std/alists/assoc.cert (2.199s) Making /build/acl2-8.3dfsg/books/std/testing/assert-bang.cert on 23-Sep-2022 18:09:07 Built /build/acl2-8.3dfsg/books/std/testing/assert-bang.cert (2.412s) Making /build/acl2-8.3dfsg/books/std/testing/assert-bang-stobj.cert on 23-Sep-2022 18:09:10 Built /build/acl2-8.3dfsg/books/std/testing/assert-bang-stobj.cert (2.297s) Making /build/acl2-8.3dfsg/books/std/osets/primitives.cert on 23-Sep-2022 18:09:12 Built /build/acl2-8.3dfsg/books/std/osets/primitives.cert (4.706s) Making /build/acl2-8.3dfsg/books/tools/save-obligs.cert on 23-Sep-2022 18:09:17 Built /build/acl2-8.3dfsg/books/tools/save-obligs.cert (4.409s) Making /build/acl2-8.3dfsg/books/misc/without-waterfall-parallelism.cert on 23-Sep-2022 18:09:22 Built /build/acl2-8.3dfsg/books/misc/without-waterfall-parallelism.cert (2.512s) Making /build/acl2-8.3dfsg/books/std/util/defredundant.cert on 23-Sep-2022 18:09:24 Built /build/acl2-8.3dfsg/books/std/util/defredundant.cert (8.382s) Making /build/acl2-8.3dfsg/books/std/strings/cat-base.cert on 23-Sep-2022 18:09:33 Built /build/acl2-8.3dfsg/books/std/strings/cat-base.cert (4.243s) Making /build/acl2-8.3dfsg/books/std/system/non-parallel-book.cert on 23-Sep-2022 18:09:37 Built /build/acl2-8.3dfsg/books/std/system/non-parallel-book.cert (2.346s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/records/records.cert on 23-Sep-2022 18:09:40 Built /build/acl2-8.3dfsg/books/defexec/other-apps/records/records.cert (5.677s) Making /build/acl2-8.3dfsg/books/hacking/hacking-xdoc.cert on 23-Sep-2022 18:09:46 Built /build/acl2-8.3dfsg/books/hacking/hacking-xdoc.cert (2.568s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/proof-builder-macros.cert on 23-Sep-2022 18:09:48 Built /build/acl2-8.3dfsg/books/kestrel/utilities/proof-builder-macros.cert (4.784s) Making /build/acl2-8.3dfsg/books/misc/bash.cert on 23-Sep-2022 18:09:53 Built /build/acl2-8.3dfsg/books/misc/bash.cert (6.292s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/library-support.cert on 23-Sep-2022 18:10:00 Built /build/acl2-8.3dfsg/books/acl2s/defdata/library-support.cert (6.274s) Making /build/acl2-8.3dfsg/books/build/doc.cert on 23-Sep-2022 18:10:06 Built /build/acl2-8.3dfsg/books/build/doc.cert (2.605s) Making /build/acl2-8.3dfsg/books/tools/safe-case.cert on 23-Sep-2022 18:10:09 Built /build/acl2-8.3dfsg/books/tools/safe-case.cert (2.442s) Making /build/acl2-8.3dfsg/books/centaur/misc/tuplep.cert on 23-Sep-2022 18:10:12 Built /build/acl2-8.3dfsg/books/centaur/misc/tuplep.cert (2.800s) Making /build/acl2-8.3dfsg/books/centaur/misc/beta-reduce-full.cert on 23-Sep-2022 18:10:15 Built /build/acl2-8.3dfsg/books/centaur/misc/beta-reduce-full.cert (5.394s) Making /build/acl2-8.3dfsg/books/std/basic/two-nats-measure.cert on 23-Sep-2022 18:10:20 Built /build/acl2-8.3dfsg/books/std/basic/two-nats-measure.cert (4.076s) Making /build/acl2-8.3dfsg/books/std/strings/defs-program.acl2x on 23-Sep-2022 18:10:24 Built /build/acl2-8.3dfsg/books/std/strings/defs-program.acl2x (14.248s) Making /build/acl2-8.3dfsg/books/tools/include-raw.cert on 23-Sep-2022 18:10:39 Built /build/acl2-8.3dfsg/books/tools/include-raw.cert (3.128s) Making /build/acl2-8.3dfsg/books/std/alists/abstract.cert on 23-Sep-2022 18:10:42 Built /build/acl2-8.3dfsg/books/std/alists/abstract.cert (4.155s) Making /build/acl2-8.3dfsg/books/std/util/defconsts.cert on 23-Sep-2022 18:10:46 Built /build/acl2-8.3dfsg/books/std/util/defconsts.cert (6.285s) Making /build/acl2-8.3dfsg/books/std/util/defmvtypes.cert on 23-Sep-2022 18:10:53 Built /build/acl2-8.3dfsg/books/std/util/defmvtypes.cert (3.831s) Making /build/acl2-8.3dfsg/books/std/util/def-bound-theorems.cert on 23-Sep-2022 18:10:57 Built /build/acl2-8.3dfsg/books/std/util/def-bound-theorems.cert (3.212s) Making /build/acl2-8.3dfsg/books/centaur/fty/fty-sum-casemacro.cert on 23-Sep-2022 18:11:00 Built /build/acl2-8.3dfsg/books/centaur/fty/fty-sum-casemacro.cert (8.256s) Making /build/acl2-8.3dfsg/books/std/typed-lists/signed-byte-listp.cert on 23-Sep-2022 18:11:09 Built /build/acl2-8.3dfsg/books/std/typed-lists/signed-byte-listp.cert (2.463s) Making /build/acl2-8.3dfsg/books/std/basic/intern-in-package-of-symbol.cert on 23-Sep-2022 18:11:11 Built /build/acl2-8.3dfsg/books/std/basic/intern-in-package-of-symbol.cert (2.426s) Making /build/acl2-8.3dfsg/books/centaur/misc/starlogic.cert on 23-Sep-2022 18:11:14 Built /build/acl2-8.3dfsg/books/centaur/misc/starlogic.cert (3.011s) Making /build/acl2-8.3dfsg/books/std/io/file-measure.cert on 23-Sep-2022 18:11:17 Built /build/acl2-8.3dfsg/books/std/io/file-measure.cert (3.499s) Making /build/acl2-8.3dfsg/books/centaur/misc/memory-mgmt-logic.cert on 23-Sep-2022 18:11:21 Built /build/acl2-8.3dfsg/books/centaur/misc/memory-mgmt-logic.cert (2.901s) Making /build/acl2-8.3dfsg/books/clause-processors/term-patterns.cert on 23-Sep-2022 18:11:24 Built /build/acl2-8.3dfsg/books/clause-processors/term-patterns.cert (5.316s) Making /build/acl2-8.3dfsg/books/tools/pattern-match.cert on 23-Sep-2022 18:11:29 Built /build/acl2-8.3dfsg/books/tools/pattern-match.cert (6.850s) Making /build/acl2-8.3dfsg/books/tools/defevaluator-fast.cert on 23-Sep-2022 18:11:36 Built /build/acl2-8.3dfsg/books/tools/defevaluator-fast.cert (3.265s) Making /build/acl2-8.3dfsg/books/system/random.cert on 23-Sep-2022 18:11:40 Built /build/acl2-8.3dfsg/books/system/random.cert (3.219s) Making /build/acl2-8.3dfsg/books/data-structures/array1.cert on 23-Sep-2022 18:11:43 Built /build/acl2-8.3dfsg/books/data-structures/array1.cert (6.660s) Making /build/acl2-8.3dfsg/books/tools/trivial-ancestors-check.cert on 23-Sep-2022 18:11:50 Built /build/acl2-8.3dfsg/books/tools/trivial-ancestors-check.cert (2.844s) Making /build/acl2-8.3dfsg/books/tools/do-not.cert on 23-Sep-2022 18:11:53 Built /build/acl2-8.3dfsg/books/tools/do-not.cert (3.160s) Making /build/acl2-8.3dfsg/books/std/util/termhints.cert on 23-Sep-2022 18:11:56 Built /build/acl2-8.3dfsg/books/std/util/termhints.cert (5.832s) Making /build/acl2-8.3dfsg/books/clause-processors/sublis-var-meaning.cert on 23-Sep-2022 18:12:02 Built /build/acl2-8.3dfsg/books/clause-processors/sublis-var-meaning.cert (7.796s) Making /build/acl2-8.3dfsg/books/misc/records.cert on 23-Sep-2022 18:12:10 Built /build/acl2-8.3dfsg/books/misc/records.cert (5.126s) Making /build/acl2-8.3dfsg/books/centaur/misc/memory-mgmt.cert on 23-Sep-2022 18:12:15 Built /build/acl2-8.3dfsg/books/centaur/misc/memory-mgmt.cert (2.345s) Making /build/acl2-8.3dfsg/books/centaur/misc/outer-local.cert on 23-Sep-2022 18:12:18 Built /build/acl2-8.3dfsg/books/centaur/misc/outer-local.cert (3.559s) Making /build/acl2-8.3dfsg/books/clause-processors/ev-ind.cert on 23-Sep-2022 18:12:21 Built /build/acl2-8.3dfsg/books/clause-processors/ev-ind.cert (2.906s) Making /build/acl2-8.3dfsg/books/centaur/misc/fast-alist-pop.cert on 23-Sep-2022 18:12:25 Built /build/acl2-8.3dfsg/books/centaur/misc/fast-alist-pop.cert (4.513s) Making /build/acl2-8.3dfsg/books/tools/some-events.cert on 23-Sep-2022 18:12:29 Built /build/acl2-8.3dfsg/books/tools/some-events.cert (3.148s) Making /build/acl2-8.3dfsg/books/centaur/fgl/doc.cert on 23-Sep-2022 18:12:32 Built /build/acl2-8.3dfsg/books/centaur/fgl/doc.cert (2.980s) Making /build/acl2-8.3dfsg/books/centaur/gl/and-star.cert on 23-Sep-2022 18:12:36 Built /build/acl2-8.3dfsg/books/centaur/gl/and-star.cert (2.913s) Making /build/acl2-8.3dfsg/books/centaur/gl/doc.cert on 23-Sep-2022 18:12:39 Built /build/acl2-8.3dfsg/books/centaur/gl/doc.cert (2.941s) Making /build/acl2-8.3dfsg/books/centaur/gl/tutorial.cert on 23-Sep-2022 18:12:42 Built /build/acl2-8.3dfsg/books/centaur/gl/tutorial.cert (2.855s) Making /build/acl2-8.3dfsg/books/centaur/memoize/old/case.cert on 23-Sep-2022 18:12:45 Built /build/acl2-8.3dfsg/books/centaur/memoize/old/case.cert (3.518s) Making /build/acl2-8.3dfsg/books/centaur/memoize/old/profile.cert on 23-Sep-2022 18:12:49 Built /build/acl2-8.3dfsg/books/centaur/memoize/old/profile.cert (12.216s) Making /build/acl2-8.3dfsg/books/centaur/memoize/top.cert on 23-Sep-2022 18:13:01 Built /build/acl2-8.3dfsg/books/centaur/memoize/top.cert (6.528s) Making /build/acl2-8.3dfsg/books/centaur/misc/iffstar.cert on 23-Sep-2022 18:13:08 Built /build/acl2-8.3dfsg/books/centaur/misc/iffstar.cert (2.157s) Making /build/acl2-8.3dfsg/books/centaur/misc/outer-local-tests.cert on 23-Sep-2022 18:13:10 Built /build/acl2-8.3dfsg/books/centaur/misc/outer-local-tests.cert (2.321s) Making /build/acl2-8.3dfsg/books/centaur/misc/suffixp.cert on 23-Sep-2022 18:13:12 Built /build/acl2-8.3dfsg/books/centaur/misc/suffixp.cert (2.480s) Making /build/acl2-8.3dfsg/books/misc/equal-by-g-help.cert on 23-Sep-2022 18:13:15 Built /build/acl2-8.3dfsg/books/misc/equal-by-g-help.cert (7.405s) Making /build/acl2-8.3dfsg/books/std/io/open-channels.cert on 23-Sep-2022 18:13:23 Built /build/acl2-8.3dfsg/books/std/io/open-channels.cert (3.238s) Making /build/acl2-8.3dfsg/books/xdoc/defxdoc-raw.cert on 23-Sep-2022 18:13:26 Built /build/acl2-8.3dfsg/books/xdoc/defxdoc-raw.cert (4.646s) Making /build/acl2-8.3dfsg/books/misc/beta-reduce.cert on 23-Sep-2022 18:13:31 Built /build/acl2-8.3dfsg/books/misc/beta-reduce.cert (5.223s) Making /build/acl2-8.3dfsg/books/clause-processors/autohide.cert on 23-Sep-2022 18:13:36 Built /build/acl2-8.3dfsg/books/clause-processors/autohide.cert (5.147s) Making /build/acl2-8.3dfsg/books/clause-processors/constant-prop.cert on 23-Sep-2022 18:13:41 Built /build/acl2-8.3dfsg/books/clause-processors/constant-prop.cert (52.585s) Making /build/acl2-8.3dfsg/books/coi/util/good-rewrite-order.cert on 23-Sep-2022 18:14:34 Built /build/acl2-8.3dfsg/books/coi/util/good-rewrite-order.cert (3.005s) Making /build/acl2-8.3dfsg/books/coi/util/defdoc.cert on 23-Sep-2022 18:14:37 Built /build/acl2-8.3dfsg/books/coi/util/defdoc.cert (2.864s) Making /build/acl2-8.3dfsg/books/misc/defpun.cert on 23-Sep-2022 18:14:40 Built /build/acl2-8.3dfsg/books/misc/defpun.cert (6.702s) Making /build/acl2-8.3dfsg/books/coi/util/skip-rewrite.cert on 23-Sep-2022 18:14:47 Built /build/acl2-8.3dfsg/books/coi/util/skip-rewrite.cert (3.421s) Making /build/acl2-8.3dfsg/books/coi/documentation.cert on 23-Sep-2022 18:14:51 Built /build/acl2-8.3dfsg/books/coi/documentation.cert (2.255s) Making /build/acl2-8.3dfsg/books/coi/osets/primitives.cert on 23-Sep-2022 18:14:53 Built /build/acl2-8.3dfsg/books/coi/osets/primitives.cert (2.898s) Making /build/acl2-8.3dfsg/books/data-structures/memories/memory-impl.cert on 23-Sep-2022 18:14:56 Built /build/acl2-8.3dfsg/books/data-structures/memories/memory-impl.cert (16.232s) Making /build/acl2-8.3dfsg/books/data-structures/memories/private.cert on 23-Sep-2022 18:15:13 Built /build/acl2-8.3dfsg/books/data-structures/memories/private.cert (2.420s) Making /build/acl2-8.3dfsg/books/coi/quantification/quantified-equivalence.cert on 23-Sep-2022 18:15:15 Built /build/acl2-8.3dfsg/books/coi/quantification/quantified-equivalence.cert (6.906s) Making /build/acl2-8.3dfsg/books/coi/records/fast/memory-impl.cert on 23-Sep-2022 18:15:22 Built /build/acl2-8.3dfsg/books/coi/records/fast/memory-impl.cert (2.467s) Making /build/acl2-8.3dfsg/books/coi/records/fast/private.cert on 23-Sep-2022 18:15:25 Built /build/acl2-8.3dfsg/books/coi/records/fast/private.cert (2.592s) Making /build/acl2-8.3dfsg/books/coi/util/rule-sets-documentation.cert on 23-Sep-2022 18:15:28 Built /build/acl2-8.3dfsg/books/coi/util/rule-sets-documentation.cert (2.371s) Making /build/acl2-8.3dfsg/books/coi/util/ifdef.cert on 23-Sep-2022 18:15:30 Built /build/acl2-8.3dfsg/books/coi/util/ifdef.cert (2.923s) Making /build/acl2-8.3dfsg/books/coi/util/rewrite-equiv.cert on 23-Sep-2022 18:15:33 Built /build/acl2-8.3dfsg/books/coi/util/rewrite-equiv.cert (4.421s) Making /build/acl2-8.3dfsg/books/data-structures/defalist.cert on 23-Sep-2022 18:15:38 Built /build/acl2-8.3dfsg/books/data-structures/defalist.cert (9.050s) Making /build/acl2-8.3dfsg/books/data-structures/structures.cert on 23-Sep-2022 18:15:47 Built /build/acl2-8.3dfsg/books/data-structures/structures.cert (27.549s) Making /build/acl2-8.3dfsg/books/defexec/defpun-exec/defpun-exec.cert on 23-Sep-2022 18:16:15 Built /build/acl2-8.3dfsg/books/defexec/defpun-exec/defpun-exec.cert (3.007s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/records/recordsim.cert on 23-Sep-2022 18:16:18 Built /build/acl2-8.3dfsg/books/defexec/other-apps/records/recordsim.cert (26.774s) Making /build/acl2-8.3dfsg/books/tools/run-script.cert on 23-Sep-2022 18:16:45 Built /build/acl2-8.3dfsg/books/tools/run-script.cert (2.613s) Making /build/acl2-8.3dfsg/books/demos/constants-that-require-modifying-state.cert on 23-Sep-2022 18:16:48 Built /build/acl2-8.3dfsg/books/demos/constants-that-require-modifying-state.cert (2.721s) Making /build/acl2-8.3dfsg/books/std/io/unsound-read.cert on 23-Sep-2022 18:16:50 Built /build/acl2-8.3dfsg/books/std/io/unsound-read.cert (4.370s) Making /build/acl2-8.3dfsg/books/std/typed-alists/keyword-to-keyword-value-list-alistp.cert on 23-Sep-2022 18:16:55 Built /build/acl2-8.3dfsg/books/std/typed-alists/keyword-to-keyword-value-list-alistp.cert (2.276s) Making /build/acl2-8.3dfsg/books/std/testing/assert-qmark.cert on 23-Sep-2022 18:16:57 Built /build/acl2-8.3dfsg/books/std/testing/assert-qmark.cert (2.603s) Making /build/acl2-8.3dfsg/books/system/subcor-var.cert on 23-Sep-2022 18:17:00 Built /build/acl2-8.3dfsg/books/system/subcor-var.cert (7.493s) Making /build/acl2-8.3dfsg/books/std/typed-lists/string-or-symbol-listp.cert on 23-Sep-2022 18:17:08 Built /build/acl2-8.3dfsg/books/std/typed-lists/string-or-symbol-listp.cert (2.327s) Making /build/acl2-8.3dfsg/books/system/pseudo-event-formp.cert on 23-Sep-2022 18:17:10 Built /build/acl2-8.3dfsg/books/system/pseudo-event-formp.cert (2.179s) Making /build/acl2-8.3dfsg/books/system/pseudo-command-formp.cert on 23-Sep-2022 18:17:13 Built /build/acl2-8.3dfsg/books/system/pseudo-command-formp.cert (2.275s) Making /build/acl2-8.3dfsg/books/system/pseudo-tests-and-callsp.cert on 23-Sep-2022 18:17:15 Built /build/acl2-8.3dfsg/books/system/pseudo-tests-and-callsp.cert (2.317s) Making /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/lecture1-book.cert on 23-Sep-2022 18:17:17 Built /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/lecture1-book.cert (7.460s) Making /build/acl2-8.3dfsg/books/misc/defp.cert on 23-Sep-2022 18:17:25 Built /build/acl2-8.3dfsg/books/misc/defp.cert (4.503s) Making /build/acl2-8.3dfsg/books/demos/mini-proveall-book.cert on 23-Sep-2022 18:17:30 Built /build/acl2-8.3dfsg/books/demos/mini-proveall-book.cert (5.227s) Making /build/acl2-8.3dfsg/books/demos/partial-encapsulate-support.cert on 23-Sep-2022 18:17:35 Built /build/acl2-8.3dfsg/books/demos/partial-encapsulate-support.cert (2.713s) Making /build/acl2-8.3dfsg/books/doc/more-topics.cert on 23-Sep-2022 18:17:38 Built /build/acl2-8.3dfsg/books/doc/more-topics.cert (4.153s) Making /build/acl2-8.3dfsg/books/doc/practices.cert on 23-Sep-2022 18:17:42 Built /build/acl2-8.3dfsg/books/doc/practices.cert (4.051s) Making /build/acl2-8.3dfsg/books/doc/top-topic.cert on 23-Sep-2022 18:17:46 Built /build/acl2-8.3dfsg/books/doc/top-topic.cert (4.288s) Making /build/acl2-8.3dfsg/books/hints/hint-wrapper.cert on 23-Sep-2022 18:17:51 Built /build/acl2-8.3dfsg/books/hints/hint-wrapper.cert (3.067s) Making /build/acl2-8.3dfsg/books/misc/seq.cert on 23-Sep-2022 18:17:54 Built /build/acl2-8.3dfsg/books/misc/seq.cert (7.795s) Making /build/acl2-8.3dfsg/books/xdoc/defxdoc-plus.cert on 23-Sep-2022 18:18:02 Built /build/acl2-8.3dfsg/books/xdoc/defxdoc-plus.cert (3.059s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/pseudo-event-formp.cert on 23-Sep-2022 18:18:05 Built /build/acl2-8.3dfsg/books/kestrel/std/system/pseudo-event-formp.cert (2.554s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/doublets.cert on 23-Sep-2022 18:18:08 Built /build/acl2-8.3dfsg/books/kestrel/utilities/doublets.cert (3.140s) Making /build/acl2-8.3dfsg/books/kestrel/apt/utilities/xdoc-constructors.cert on 23-Sep-2022 18:18:11 Built /build/acl2-8.3dfsg/books/kestrel/apt/utilities/xdoc-constructors.cert (3.499s) Making /build/acl2-8.3dfsg/books/tools/er-soft-logic.cert on 23-Sep-2022 18:18:15 Built /build/acl2-8.3dfsg/books/tools/er-soft-logic.cert (3.291s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/all-vars.cert on 23-Sep-2022 18:18:18 Built /build/acl2-8.3dfsg/books/kestrel/std/system/all-vars.cert (3.654s) Making /build/acl2-8.3dfsg/books/misc/install-not-normalized.cert on 23-Sep-2022 18:18:22 Built /build/acl2-8.3dfsg/books/misc/install-not-normalized.cert (5.085s) Making /build/acl2-8.3dfsg/books/kestrel/apt/common-concepts.cert on 23-Sep-2022 18:18:27 Built /build/acl2-8.3dfsg/books/kestrel/apt/common-concepts.cert (2.941s) Making /build/acl2-8.3dfsg/books/kestrel/apt/common-options.cert on 23-Sep-2022 18:18:30 Built /build/acl2-8.3dfsg/books/kestrel/apt/common-options.cert (2.874s) Making /build/acl2-8.3dfsg/books/kestrel/std/basic/mbt-dollar.cert on 23-Sep-2022 18:18:34 Built /build/acl2-8.3dfsg/books/kestrel/std/basic/mbt-dollar.cert (3.032s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/conjoin.cert on 23-Sep-2022 18:18:37 Built /build/acl2-8.3dfsg/books/kestrel/std/system/conjoin.cert (2.529s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/defthmr.cert on 23-Sep-2022 18:18:39 Built /build/acl2-8.3dfsg/books/kestrel/utilities/defthmr.cert (3.595s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/directed-untranslate.cert on 23-Sep-2022 18:18:43 Built /build/acl2-8.3dfsg/books/kestrel/utilities/directed-untranslate.cert (43.257s) Making /build/acl2-8.3dfsg/books/kestrel/auto-termination/injections.cert on 23-Sep-2022 18:19:27 Built /build/acl2-8.3dfsg/books/kestrel/auto-termination/injections.cert (3.822s) Making /build/acl2-8.3dfsg/books/kestrel/auto-termination/fms-bang-list.cert on 23-Sep-2022 18:19:31 Built /build/acl2-8.3dfsg/books/kestrel/auto-termination/fms-bang-list.cert (2.443s) Making /build/acl2-8.3dfsg/books/kestrel/auto-termination/strict-merge-sort.cert on 23-Sep-2022 18:19:33 Built /build/acl2-8.3dfsg/books/kestrel/auto-termination/strict-merge-sort.cert (3.017s) Making /build/acl2-8.3dfsg/books/kestrel/auto-termination/subsetp-eq-linear.cert on 23-Sep-2022 18:19:36 Built /build/acl2-8.3dfsg/books/kestrel/auto-termination/subsetp-eq-linear.cert (2.825s) Making /build/acl2-8.3dfsg/books/kestrel/built-in-theorems-doc.cert on 23-Sep-2022 18:19:39 Built /build/acl2-8.3dfsg/books/kestrel/built-in-theorems-doc.cert (2.609s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/hmac/doc.cert on 23-Sep-2022 18:19:42 Built /build/acl2-8.3dfsg/books/kestrel/crypto/hmac/doc.cert (2.704s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/kdf/doc.cert on 23-Sep-2022 18:19:45 Built /build/acl2-8.3dfsg/books/kestrel/crypto/kdf/doc.cert (2.579s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/keccak/documentation.cert on 23-Sep-2022 18:19:48 Built /build/acl2-8.3dfsg/books/kestrel/crypto/keccak/documentation.cert (2.626s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/padding/doc.cert on 23-Sep-2022 18:19:50 Built /build/acl2-8.3dfsg/books/kestrel/crypto/padding/doc.cert (2.774s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/sha-2/doc.cert on 23-Sep-2022 18:19:53 Built /build/acl2-8.3dfsg/books/kestrel/crypto/sha-2/doc.cert (2.708s) Making /build/acl2-8.3dfsg/books/kestrel/ethereum/scalars.cert on 23-Sep-2022 18:19:56 Built /build/acl2-8.3dfsg/books/kestrel/ethereum/scalars.cert (2.822s) Making /build/acl2-8.3dfsg/books/kestrel/ethereum/crypto.cert on 23-Sep-2022 18:19:59 Built /build/acl2-8.3dfsg/books/kestrel/ethereum/crypto.cert (2.875s) Making /build/acl2-8.3dfsg/books/kestrel/java/aij/top.cert on 23-Sep-2022 18:20:02 Built /build/acl2-8.3dfsg/books/kestrel/java/aij/top.cert (2.730s) Making /build/acl2-8.3dfsg/books/kestrel/std/basic/symbol-name-lst.cert on 23-Sep-2022 18:20:05 Built /build/acl2-8.3dfsg/books/kestrel/std/basic/symbol-name-lst.cert (2.562s) Making /build/acl2-8.3dfsg/books/kestrel/java/atj/documentation.cert on 23-Sep-2022 18:20:08 Built /build/acl2-8.3dfsg/books/kestrel/java/atj/documentation.cert (2.632s) Making /build/acl2-8.3dfsg/books/kestrel/prime-fields/doc.cert on 23-Sep-2022 18:20:11 Built /build/acl2-8.3dfsg/books/kestrel/prime-fields/doc.cert (2.582s) Making /build/acl2-8.3dfsg/books/kestrel/soft/documentation.cert on 23-Sep-2022 18:20:13 Built /build/acl2-8.3dfsg/books/kestrel/soft/documentation.cert (2.819s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/arglistp.cert on 23-Sep-2022 18:20:16 Built /build/acl2-8.3dfsg/books/kestrel/std/system/arglistp.cert (2.120s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/arity.cert on 23-Sep-2022 18:20:19 Built /build/acl2-8.3dfsg/books/kestrel/std/system/arity.cert (2.209s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/enhanced-utilities.cert on 23-Sep-2022 18:20:21 Built /build/acl2-8.3dfsg/books/kestrel/std/system/enhanced-utilities.cert (2.637s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/function-symbolp.cert on 23-Sep-2022 18:20:24 Built /build/acl2-8.3dfsg/books/kestrel/std/system/function-symbolp.cert (2.241s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/getprops.cert on 23-Sep-2022 18:20:26 Built /build/acl2-8.3dfsg/books/kestrel/std/system/getprops.cert (2.393s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/plist-worldp-with-formals.cert on 23-Sep-2022 18:20:29 Built /build/acl2-8.3dfsg/books/kestrel/std/system/plist-worldp-with-formals.cert (2.301s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/trans-eval-error-triple.cert on 23-Sep-2022 18:20:31 Built /build/acl2-8.3dfsg/books/kestrel/utilities/trans-eval-error-triple.cert (2.560s) Making /build/acl2-8.3dfsg/books/kestrel/std/util/defmax-nat-template.cert on 23-Sep-2022 18:20:34 Built /build/acl2-8.3dfsg/books/kestrel/std/util/defmax-nat-template.cert (3.735s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/apply-fn-if-known.cert on 23-Sep-2022 18:20:38 Built /build/acl2-8.3dfsg/books/kestrel/utilities/apply-fn-if-known.cert (2.669s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/assert.cert on 23-Sep-2022 18:20:41 Built /build/acl2-8.3dfsg/books/kestrel/utilities/assert.cert (2.511s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/auto-instance.cert on 23-Sep-2022 18:20:43 Built /build/acl2-8.3dfsg/books/kestrel/utilities/auto-instance.cert (7.666s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/terms.cert on 23-Sep-2022 18:20:51 Built /build/acl2-8.3dfsg/books/kestrel/utilities/terms.cert (12.061s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/doublets2.cert on 23-Sep-2022 18:21:03 Built /build/acl2-8.3dfsg/books/kestrel/utilities/doublets2.cert (3.152s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/include-book-paths.cert on 23-Sep-2022 18:21:07 Built /build/acl2-8.3dfsg/books/kestrel/utilities/include-book-paths.cert (5.364s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/non-ascii-pathnames.cert on 23-Sep-2022 18:21:12 Built /build/acl2-8.3dfsg/books/kestrel/utilities/non-ascii-pathnames.cert (2.265s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/prove-interface.cert on 23-Sep-2022 18:21:14 Built /build/acl2-8.3dfsg/books/kestrel/utilities/prove-interface.cert (7.589s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/skip-in-book.cert on 23-Sep-2022 18:21:22 Built /build/acl2-8.3dfsg/books/kestrel/utilities/skip-in-book.cert (2.231s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/sublis-expr-plus.cert on 23-Sep-2022 18:21:25 Built /build/acl2-8.3dfsg/books/kestrel/utilities/sublis-expr-plus.cert (5.964s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/ubi.cert on 23-Sep-2022 18:21:31 Built /build/acl2-8.3dfsg/books/kestrel/utilities/ubi.cert (3.407s) Making /build/acl2-8.3dfsg/books/make-event/read-from-file.cert on 23-Sep-2022 18:21:34 Built /build/acl2-8.3dfsg/books/make-event/read-from-file.cert (2.311s) Making /build/acl2-8.3dfsg/books/misc/bash-bsd.cert on 23-Sep-2022 18:21:37 Built /build/acl2-8.3dfsg/books/misc/bash-bsd.cert (2.207s) Making /build/acl2-8.3dfsg/books/misc/defmac.cert on 23-Sep-2022 18:21:39 Built /build/acl2-8.3dfsg/books/misc/defmac.cert (3.151s) Making /build/acl2-8.3dfsg/books/misc/defopener.cert on 23-Sep-2022 18:21:42 Built /build/acl2-8.3dfsg/books/misc/defopener.cert (11.088s) Making /build/acl2-8.3dfsg/books/misc/dft.cert on 23-Sep-2022 18:21:54 Built /build/acl2-8.3dfsg/books/misc/dft.cert (12.265s) Making /build/acl2-8.3dfsg/books/misc/dump-events.cert on 23-Sep-2022 18:22:06 Built /build/acl2-8.3dfsg/books/misc/dump-events.cert (3.408s) Making /build/acl2-8.3dfsg/books/misc/find-lemmas.cert on 23-Sep-2022 18:22:10 Built /build/acl2-8.3dfsg/books/misc/find-lemmas.cert (3.036s) Making /build/acl2-8.3dfsg/books/misc/invariants.cert on 23-Sep-2022 18:22:13 Built /build/acl2-8.3dfsg/books/misc/invariants.cert (6.482s) Making /build/acl2-8.3dfsg/books/misc/meta-lemmas.cert on 23-Sep-2022 18:22:19 Built /build/acl2-8.3dfsg/books/misc/meta-lemmas.cert (4.883s) Making /build/acl2-8.3dfsg/books/misc/pigeonhole.cert on 23-Sep-2022 18:22:24 Built /build/acl2-8.3dfsg/books/misc/pigeonhole.cert (4.696s) Making /build/acl2-8.3dfsg/books/misc/records-bsd.cert on 23-Sep-2022 18:22:29 Built /build/acl2-8.3dfsg/books/misc/records-bsd.cert (2.136s) Making /build/acl2-8.3dfsg/books/misc/records0.cert on 23-Sep-2022 18:22:32 Built /build/acl2-8.3dfsg/books/misc/records0.cert (14.927s) Making /build/acl2-8.3dfsg/books/misc/seqw.cert on 23-Sep-2022 18:22:47 Built /build/acl2-8.3dfsg/books/misc/seqw.cert (5.023s) Making /build/acl2-8.3dfsg/books/misc/simp.cert on 23-Sep-2022 18:22:52 Built /build/acl2-8.3dfsg/books/misc/simp.cert (3.123s) Making /build/acl2-8.3dfsg/books/misc/simplify-defuns.cert on 23-Sep-2022 18:22:55 Built /build/acl2-8.3dfsg/books/misc/simplify-defuns.cert (15.695s) Making /build/acl2-8.3dfsg/books/misc/simplify-thm.cert on 23-Sep-2022 18:23:11 Built /build/acl2-8.3dfsg/books/misc/simplify-thm.cert (3.428s) Making /build/acl2-8.3dfsg/books/misc/sin-cos.cert on 23-Sep-2022 18:23:15 Built /build/acl2-8.3dfsg/books/misc/sin-cos.cert (5.232s) Making /build/acl2-8.3dfsg/books/misc/total-order-bsd.cert on 23-Sep-2022 18:23:20 Built /build/acl2-8.3dfsg/books/misc/total-order-bsd.cert (2.110s) Making /build/acl2-8.3dfsg/books/misc/trace-star.cert on 23-Sep-2022 18:23:22 Built /build/acl2-8.3dfsg/books/misc/trace-star.cert (3.122s) Making /build/acl2-8.3dfsg/books/misc/with-waterfall-parallelism.cert on 23-Sep-2022 18:23:26 Built /build/acl2-8.3dfsg/books/misc/with-waterfall-parallelism.cert (2.415s) Making /build/acl2-8.3dfsg/books/parsers/earley/defprimitive.cert on 23-Sep-2022 18:23:28 Built /build/acl2-8.3dfsg/books/parsers/earley/defprimitive.cert (3.431s) Making /build/acl2-8.3dfsg/books/tools/defsum.cert on 23-Sep-2022 18:23:32 Built /build/acl2-8.3dfsg/books/tools/defsum.cert (15.864s) Making /build/acl2-8.3dfsg/books/rtl/rel11/lib/doc.cert on 23-Sep-2022 18:23:48 Built /build/acl2-8.3dfsg/books/rtl/rel11/lib/doc.cert (4.531s) Making /build/acl2-8.3dfsg/books/projects/cache-coherence/german-protocol/german.cert on 23-Sep-2022 18:23:52 Built /build/acl2-8.3dfsg/books/projects/cache-coherence/german-protocol/german.cert (43.634s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/apply-total-order.cert on 23-Sep-2022 18:24:36 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/apply-total-order.cert (3.817s) Making /build/acl2-8.3dfsg/books/projects/leftist-trees/leftist-trees-xdoc.cert on 23-Sep-2022 18:24:40 Built /build/acl2-8.3dfsg/books/projects/leftist-trees/leftist-trees-xdoc.cert (2.520s) Making /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/groundwork/local.cert on 23-Sep-2022 18:24:43 Built /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/groundwork/local.cert (2.889s) Making /build/acl2-8.3dfsg/books/projects/milawa/doc.cert on 23-Sep-2022 18:24:46 Built /build/acl2-8.3dfsg/books/projects/milawa/doc.cert (2.461s) Making /build/acl2-8.3dfsg/books/projects/oracle/stv-decomp-theory-expander.cert on 23-Sep-2022 18:24:49 Built /build/acl2-8.3dfsg/books/projects/oracle/stv-decomp-theory-expander.cert (2.702s) Making /build/acl2-8.3dfsg/books/projects/rac/lisp/translate.cert on 23-Sep-2022 18:24:51 Built /build/acl2-8.3dfsg/books/projects/rac/lisp/translate.cert (9.620s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/top.cert on 23-Sep-2022 18:25:01 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-itp13/top.cert (3.997s) Making /build/acl2-8.3dfsg/books/projects/taspi/taspi-xdoc.cert on 23-Sep-2022 18:25:05 Built /build/acl2-8.3dfsg/books/projects/taspi/taspi-xdoc.cert (3.007s) Making /build/acl2-8.3dfsg/books/proof-builder/extras.cert on 23-Sep-2022 18:25:09 Built /build/acl2-8.3dfsg/books/proof-builder/extras.cert (3.624s) Making /build/acl2-8.3dfsg/books/proofstyles/counterexamples/halt-flg.cert on 23-Sep-2022 18:25:12 Built /build/acl2-8.3dfsg/books/proofstyles/counterexamples/halt-flg.cert (3.726s) Making /build/acl2-8.3dfsg/books/proofstyles/counterexamples/memory-clearing.cert on 23-Sep-2022 18:25:16 Built /build/acl2-8.3dfsg/books/proofstyles/counterexamples/memory-clearing.cert (3.585s) Making /build/acl2-8.3dfsg/books/proofstyles/counterexamples/realistic.cert on 23-Sep-2022 18:25:20 Built /build/acl2-8.3dfsg/books/proofstyles/counterexamples/realistic.cert (4.912s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/rtlarr.cert on 23-Sep-2022 18:25:25 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/rtlarr.cert (5.955s) Making /build/acl2-8.3dfsg/books/std/io/serialize-tests.cert on 23-Sep-2022 18:25:31 Built /build/acl2-8.3dfsg/books/std/io/serialize-tests.cert (9.568s) Making /build/acl2-8.3dfsg/books/std/lists/same-lengthp.cert on 23-Sep-2022 18:25:41 Built /build/acl2-8.3dfsg/books/std/lists/same-lengthp.cert (2.628s) Making /build/acl2-8.3dfsg/books/std/misc/intern-in-package-of-symbol.cert on 23-Sep-2022 18:25:44 Built /build/acl2-8.3dfsg/books/std/misc/intern-in-package-of-symbol.cert (2.266s) Making /build/acl2-8.3dfsg/books/std/misc/two-nats-measure.cert on 23-Sep-2022 18:25:46 Built /build/acl2-8.3dfsg/books/std/misc/two-nats-measure.cert (2.466s) Making /build/acl2-8.3dfsg/books/std/strings/stringless.cert on 23-Sep-2022 18:25:49 Built /build/acl2-8.3dfsg/books/std/strings/stringless.cert (3.261s) Making /build/acl2-8.3dfsg/books/std/typed-alists/keyword-to-keyword-value-list-alistp-tests.cert on 23-Sep-2022 18:25:52 Built /build/acl2-8.3dfsg/books/std/typed-alists/keyword-to-keyword-value-list-alistp-tests.cert (2.504s) Making /build/acl2-8.3dfsg/books/tools/advise.cert on 23-Sep-2022 18:25:55 Built /build/acl2-8.3dfsg/books/tools/advise.cert (4.235s) Making /build/acl2-8.3dfsg/books/system/acl2-system-exports.cert on 23-Sep-2022 18:25:59 Built /build/acl2-8.3dfsg/books/system/acl2-system-exports.cert (2.542s) Making /build/acl2-8.3dfsg/books/system/doc/acl2-doc.cert on 23-Sep-2022 18:26:02 Built /build/acl2-8.3dfsg/books/system/doc/acl2-doc.cert (10.549s) Making /build/acl2-8.3dfsg/books/system/origin.cert on 23-Sep-2022 18:26:15 Built /build/acl2-8.3dfsg/books/system/origin.cert (3.000s) Making /build/acl2-8.3dfsg/books/system/doc/developers-guide.cert on 23-Sep-2022 18:26:18 Built /build/acl2-8.3dfsg/books/system/doc/developers-guide.cert (3.240s) Making /build/acl2-8.3dfsg/books/system/event-names.cert on 23-Sep-2022 18:26:21 Built /build/acl2-8.3dfsg/books/system/event-names.cert (3.596s) Making /build/acl2-8.3dfsg/books/system/hons-check/hons-check.cert on 23-Sep-2022 18:26:25 Built /build/acl2-8.3dfsg/books/system/hons-check/hons-check.cert (5.984s) Making /build/acl2-8.3dfsg/books/tools/defthmg.cert on 23-Sep-2022 18:26:31 Built /build/acl2-8.3dfsg/books/tools/defthmg.cert (3.585s) Making /build/acl2-8.3dfsg/books/tools/equality-with-hons-copy.cert on 23-Sep-2022 18:26:35 Built /build/acl2-8.3dfsg/books/tools/equality-with-hons-copy.cert (2.978s) Making /build/acl2-8.3dfsg/books/tools/fake-event.cert on 23-Sep-2022 18:26:38 Built /build/acl2-8.3dfsg/books/tools/fake-event.cert (2.974s) Making /build/acl2-8.3dfsg/books/tools/flag-tests.cert on 23-Sep-2022 18:26:41 Built /build/acl2-8.3dfsg/books/tools/flag-tests.cert (9.823s) Making /build/acl2-8.3dfsg/books/tools/memoize-prover-fns.cert on 23-Sep-2022 18:26:51 Built /build/acl2-8.3dfsg/books/tools/memoize-prover-fns.cert (50.889s) Making /build/acl2-8.3dfsg/books/tools/oracle-eval.cert on 23-Sep-2022 18:27:42 Built /build/acl2-8.3dfsg/books/tools/oracle-eval.cert (2.856s) Making /build/acl2-8.3dfsg/books/tools/oracle-time.cert on 23-Sep-2022 18:27:45 Built /build/acl2-8.3dfsg/books/tools/oracle-time.cert (5.720s) Making /build/acl2-8.3dfsg/books/tools/plev.cert on 23-Sep-2022 18:27:51 Built /build/acl2-8.3dfsg/books/tools/plev.cert (3.155s) Making /build/acl2-8.3dfsg/books/tools/removable-runes.cert on 23-Sep-2022 18:27:55 Built /build/acl2-8.3dfsg/books/tools/removable-runes.cert (6.581s) Making /build/acl2-8.3dfsg/books/tools/with-supporters.cert on 23-Sep-2022 18:28:01 Built /build/acl2-8.3dfsg/books/tools/with-supporters.cert (5.919s) Making /build/acl2-8.3dfsg/books/workshops/1999/pipeline/utils.cert on 23-Sep-2022 18:28:07 Built /build/acl2-8.3dfsg/books/workshops/1999/pipeline/utils.cert (3.488s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/utils.cert on 23-Sep-2022 18:28:11 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/utils.cert (3.376s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/utils.cert on 23-Sep-2022 18:28:15 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/utils.cert (3.397s) Making /build/acl2-8.3dfsg/books/workshops/2000/moore-manolios/partial-functions/defpun.cert on 23-Sep-2022 18:28:18 Built /build/acl2-8.3dfsg/books/workshops/2000/moore-manolios/partial-functions/defpun.cert (2.522s) Making /build/acl2-8.3dfsg/books/workshops/2000/sumners1/cdeq/records.cert on 23-Sep-2022 18:28:21 Built /build/acl2-8.3dfsg/books/workshops/2000/sumners1/cdeq/records.cert (4.765s) Making /build/acl2-8.3dfsg/books/workshops/2002/kaufmann-sumners/support/records.cert on 23-Sep-2022 18:28:26 Built /build/acl2-8.3dfsg/books/workshops/2002/kaufmann-sumners/support/records.cert (4.650s) Making /build/acl2-8.3dfsg/books/workshops/2002/kaufmann-sumners/support/records0.cert on 23-Sep-2022 18:28:30 Built /build/acl2-8.3dfsg/books/workshops/2002/kaufmann-sumners/support/records0.cert (14.618s) Making /build/acl2-8.3dfsg/books/workshops/2002/kaufmann-sumners/support/sets.cert on 23-Sep-2022 18:28:45 Built /build/acl2-8.3dfsg/books/workshops/2002/kaufmann-sumners/support/sets.cert (14.442s) Making /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/records/total-order.cert on 23-Sep-2022 18:29:00 Built /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/records/total-order.cert (2.320s) Making /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/sorting/total-order.cert on 23-Sep-2022 18:29:02 Built /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/sorting/total-order.cert (2.330s) Making /build/acl2-8.3dfsg/books/workshops/2003/greve-wilding_defrecord/support/defrecord.cert on 23-Sep-2022 18:29:05 Built /build/acl2-8.3dfsg/books/workshops/2003/greve-wilding_defrecord/support/defrecord.cert (3.766s) Making /build/acl2-8.3dfsg/books/workshops/2003/tsong/support/shim.cert on 23-Sep-2022 18:29:09 Built /build/acl2-8.3dfsg/books/workshops/2003/tsong/support/shim.cert (201.402s) Making /build/acl2-8.3dfsg/books/workshops/2004/cowles-gamboa/support/tail-rec.cert on 23-Sep-2022 18:32:30 Built /build/acl2-8.3dfsg/books/workshops/2004/cowles-gamboa/support/tail-rec.cert (6.189s) Making /build/acl2-8.3dfsg/books/workshops/2004/greve/support/defrecord.cert on 23-Sep-2022 18:32:37 Built /build/acl2-8.3dfsg/books/workshops/2004/greve/support/defrecord.cert (8.458s) Making /build/acl2-8.3dfsg/books/workshops/2004/ray/support/defpun-exec.cert on 23-Sep-2022 18:32:45 Built /build/acl2-8.3dfsg/books/workshops/2004/ray/support/defpun-exec.cert (6.456s) Making /build/acl2-8.3dfsg/books/workshops/2006/swords-cook/lcsoundness/pattern-match.cert on 23-Sep-2022 18:32:52 Built /build/acl2-8.3dfsg/books/workshops/2006/swords-cook/lcsoundness/pattern-match.cert (6.598s) Making /build/acl2-8.3dfsg/books/workshops/2007/cowles-et-al/support/greve/defxch.cert on 23-Sep-2022 18:32:59 Built /build/acl2-8.3dfsg/books/workshops/2007/cowles-et-al/support/greve/defxch.cert (6.795s) Making /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/hacker.cert on 23-Sep-2022 18:33:06 Built /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/hacker.cert (4.770s) Making /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/defstruct-parsing.cert on 23-Sep-2022 18:33:11 Built /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/defstruct-parsing.cert (4.260s) Making /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/dillinger-et-al-xdoc.cert on 23-Sep-2022 18:33:15 Built /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/dillinger-et-al-xdoc.cert (2.405s) Making /build/acl2-8.3dfsg/books/workshops/2007/rubio/support/abstract-reductions/abstract-proofs.cert on 23-Sep-2022 18:33:18 Built /build/acl2-8.3dfsg/books/workshops/2007/rubio/support/abstract-reductions/abstract-proofs.cert (5.619s) Making /build/acl2-8.3dfsg/books/workshops/2009/kaufmann-kornerup-reitblatt/support/preliminaries.cert on 23-Sep-2022 18:33:23 Built /build/acl2-8.3dfsg/books/workshops/2009/kaufmann-kornerup-reitblatt/support/preliminaries.cert (3.497s) Making /build/acl2-8.3dfsg/books/workshops/2009/kaufmann-kornerup-reitblatt/support/generic-loop-inv.cert on 23-Sep-2022 18:33:27 Built /build/acl2-8.3dfsg/books/workshops/2009/kaufmann-kornerup-reitblatt/support/generic-loop-inv.cert (3.208s) Making /build/acl2-8.3dfsg/books/workshops/2011/cowles-gamboa-sierpinski/support/verifying-macros.cert on 23-Sep-2022 18:33:30 Built /build/acl2-8.3dfsg/books/workshops/2011/cowles-gamboa-sierpinski/support/verifying-macros.cert (256.057s) Making /build/acl2-8.3dfsg/books/workshops/2011/krug-et-al/support/Utilities/records.cert on 23-Sep-2022 18:37:47 Built /build/acl2-8.3dfsg/books/workshops/2011/krug-et-al/support/Utilities/records.cert (2.255s) Making /build/acl2-8.3dfsg/books/workshops/2011/krug-et-al/support/Utilities/total-order.cert on 23-Sep-2022 18:37:49 Built /build/acl2-8.3dfsg/books/workshops/2011/krug-et-al/support/Utilities/total-order.cert (2.253s) Making /build/acl2-8.3dfsg/books/workshops/2013/goel-hunt-kaufmann/support/defabsstobj-example.cert on 23-Sep-2022 18:37:51 Tick Built /build/acl2-8.3dfsg/books/workshops/2013/goel-hunt-kaufmann/support/defabsstobj-example.cert (7.681s) Making /build/acl2-8.3dfsg/books/workshops/2017/sumners/support/sets.cert on 23-Sep-2022 18:37:59 Built /build/acl2-8.3dfsg/books/workshops/2017/sumners/support/sets.cert (24.995s) Making /build/acl2-8.3dfsg/books/cowles/acl2-agp.cert on 23-Sep-2022 18:38:24 Built /build/acl2-8.3dfsg/books/cowles/acl2-agp.cert (3.445s) Making /build/acl2-8.3dfsg/books/std/util/defrule.cert on 23-Sep-2022 18:38:28 Built /build/acl2-8.3dfsg/books/std/util/defrule.cert (5.269s) Making /build/acl2-8.3dfsg/books/std/util/defval.cert on 23-Sep-2022 18:38:33 Built /build/acl2-8.3dfsg/books/std/util/defval.cert (4.164s) Making /build/acl2-8.3dfsg/books/std/util/look-up.cert on 23-Sep-2022 18:38:38 Built /build/acl2-8.3dfsg/books/std/util/look-up.cert (3.985s) Making /build/acl2-8.3dfsg/books/std/util/da-base.cert on 23-Sep-2022 18:38:42 Built /build/acl2-8.3dfsg/books/std/util/da-base.cert (12.015s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/make-termination-theorem.cert on 23-Sep-2022 18:38:54 Built /build/acl2-8.3dfsg/books/kestrel/utilities/make-termination-theorem.cert (3.958s) Making /build/acl2-8.3dfsg/books/std/lists/list-fix.cert on 23-Sep-2022 18:38:58 Built /build/acl2-8.3dfsg/books/std/lists/list-fix.cert (3.336s) Making /build/acl2-8.3dfsg/books/rtl/rel4/support/rtlarr.cert on 23-Sep-2022 18:39:02 Built /build/acl2-8.3dfsg/books/rtl/rel4/support/rtlarr.cert (6.102s) Making /build/acl2-8.3dfsg/books/std/testing/must-eval-to-t.cert on 23-Sep-2022 18:39:08 Built /build/acl2-8.3dfsg/books/std/testing/must-eval-to-t.cert (2.474s) Making /build/acl2-8.3dfsg/books/std/lists/revappend.cert on 23-Sep-2022 18:39:11 Built /build/acl2-8.3dfsg/books/std/lists/revappend.cert (2.991s) Making /build/acl2-8.3dfsg/books/centaur/fty/fixtype.cert on 23-Sep-2022 18:39:14 Built /build/acl2-8.3dfsg/books/centaur/fty/fixtype.cert (12.523s) Making /build/acl2-8.3dfsg/books/centaur/misc/universal-equiv.cert on 23-Sep-2022 18:39:26 Built /build/acl2-8.3dfsg/books/centaur/misc/universal-equiv.cert (4.212s) Making /build/acl2-8.3dfsg/books/std/alists/fal-extract.cert on 23-Sep-2022 18:39:31 Built /build/acl2-8.3dfsg/books/std/alists/fal-extract.cert (3.167s) Making /build/acl2-8.3dfsg/books/std/alists/fal-extract-vals.cert on 23-Sep-2022 18:39:34 Built /build/acl2-8.3dfsg/books/std/alists/fal-extract-vals.cert (3.188s) Making /build/acl2-8.3dfsg/books/std/alists/remove-assocs.cert on 23-Sep-2022 18:39:37 Built /build/acl2-8.3dfsg/books/std/alists/remove-assocs.cert (4.071s) Making /build/acl2-8.3dfsg/books/std/alists/alist-map-keys.cert on 23-Sep-2022 18:39:42 Built /build/acl2-8.3dfsg/books/std/alists/alist-map-keys.cert (4.031s) Making /build/acl2-8.3dfsg/books/std/alists/alist-map-vals.cert on 23-Sep-2022 18:39:46 Built /build/acl2-8.3dfsg/books/std/alists/alist-map-vals.cert (3.884s) Making /build/acl2-8.3dfsg/books/std/testing/assert-equal.cert on 23-Sep-2022 18:39:50 Built /build/acl2-8.3dfsg/books/std/testing/assert-equal.cert (2.320s) Making /build/acl2-8.3dfsg/books/std/osets/membership.cert on 23-Sep-2022 18:39:52 Built /build/acl2-8.3dfsg/books/std/osets/membership.cert (8.500s) Making /build/acl2-8.3dfsg/books/xdoc/str.acl2x on 23-Sep-2022 18:40:01 Built /build/acl2-8.3dfsg/books/xdoc/str.acl2x (6.396s) Making /build/acl2-8.3dfsg/books/std/strings/printtree.cert on 23-Sep-2022 18:40:07 Built /build/acl2-8.3dfsg/books/std/strings/printtree.cert (5.429s) Making /build/acl2-8.3dfsg/books/hacking/all.cert on 23-Sep-2022 18:40:13 Built /build/acl2-8.3dfsg/books/hacking/all.cert (3.594s) Making /build/acl2-8.3dfsg/books/acl2s/utilities.cert on 23-Sep-2022 18:40:17 Built /build/acl2-8.3dfsg/books/acl2s/utilities.cert (12.152s) Making /build/acl2-8.3dfsg/books/tools/templates.cert on 23-Sep-2022 18:40:29 Built /build/acl2-8.3dfsg/books/tools/templates.cert (8.975s) Making /build/acl2-8.3dfsg/books/centaur/vl2014/portcullis.cert on 23-Sep-2022 18:40:38 Built /build/acl2-8.3dfsg/books/centaur/vl2014/portcullis.cert (3.036s) Making /build/acl2-8.3dfsg/books/centaur/gl/def-gl-rewrite.cert on 23-Sep-2022 18:40:41 Built /build/acl2-8.3dfsg/books/centaur/gl/def-gl-rewrite.cert (8.136s) Making /build/acl2-8.3dfsg/books/std/strings/defs-program.cert on 23-Sep-2022 18:40:50 Built /build/acl2-8.3dfsg/books/std/strings/defs-program.cert (56.580s) Making /build/acl2-8.3dfsg/books/std/stobjs/clone.cert on 23-Sep-2022 18:41:46 Built /build/acl2-8.3dfsg/books/std/stobjs/clone.cert (5.602s) Making /build/acl2-8.3dfsg/books/std/util/defaggrify-defrec.cert on 23-Sep-2022 18:41:52 Built /build/acl2-8.3dfsg/books/std/util/defaggrify-defrec.cert (4.050s) Making /build/acl2-8.3dfsg/books/std/util/defval-tests.cert on 23-Sep-2022 18:41:56 Built /build/acl2-8.3dfsg/books/std/util/defval-tests.cert (2.848s) Making /build/acl2-8.3dfsg/books/centaur/ubdds/core.cert on 23-Sep-2022 18:41:59 Built /build/acl2-8.3dfsg/books/centaur/ubdds/core.cert (16.812s) Making /build/acl2-8.3dfsg/books/centaur/esim/portcullis.cert on 23-Sep-2022 18:42:16 Built /build/acl2-8.3dfsg/books/centaur/esim/portcullis.cert (3.292s) Making /build/acl2-8.3dfsg/books/centaur/vl2014/util/cwtime.cert on 23-Sep-2022 18:42:20 Built /build/acl2-8.3dfsg/books/centaur/vl2014/util/cwtime.cert (3.098s) Making /build/acl2-8.3dfsg/books/centaur/esim/vcd/vcd-stub.cert on 23-Sep-2022 18:42:23 Built /build/acl2-8.3dfsg/books/centaur/esim/vcd/vcd-stub.cert (3.505s) Making /build/acl2-8.3dfsg/books/centaur/fgl/aabf.cert on 23-Sep-2022 18:42:27 Built /build/acl2-8.3dfsg/books/centaur/fgl/aabf.cert (8.844s) Making /build/acl2-8.3dfsg/books/centaur/fgl/scratchobj.cert on 23-Sep-2022 18:42:36 Built /build/acl2-8.3dfsg/books/centaur/fgl/scratchobj.cert (3.867s) Making /build/acl2-8.3dfsg/books/std/util/tests/utils.cert on 23-Sep-2022 18:42:40 Built /build/acl2-8.3dfsg/books/std/util/tests/utils.cert (3.051s) Making /build/acl2-8.3dfsg/books/xdoc/word-wrap.cert on 23-Sep-2022 18:42:43 Built /build/acl2-8.3dfsg/books/xdoc/word-wrap.cert (5.058s) Making /build/acl2-8.3dfsg/books/centaur/memoize/old/watch.cert on 23-Sep-2022 18:42:48 Built /build/acl2-8.3dfsg/books/centaur/memoize/old/watch.cert (6.490s) Making /build/acl2-8.3dfsg/books/centaur/memoize/tests.cert on 23-Sep-2022 18:42:55 Built /build/acl2-8.3dfsg/books/centaur/memoize/tests.cert (2.522s) Making /build/acl2-8.3dfsg/books/misc/equal-by-g.cert on 23-Sep-2022 18:42:58 Built /build/acl2-8.3dfsg/books/misc/equal-by-g.cert (2.973s) Making /build/acl2-8.3dfsg/books/std/strings/pretty-program.acl2x on 23-Sep-2022 18:43:01 Built /build/acl2-8.3dfsg/books/std/strings/pretty-program.acl2x (25.657s) Making /build/acl2-8.3dfsg/books/centaur/vl2014/doc.cert on 23-Sep-2022 18:43:26 Built /build/acl2-8.3dfsg/books/centaur/vl2014/doc.cert (2.862s) Making /build/acl2-8.3dfsg/books/coi/util/debug.cert on 23-Sep-2022 18:43:29 Built /build/acl2-8.3dfsg/books/coi/util/debug.cert (2.981s) Making /build/acl2-8.3dfsg/books/coi/defpun/defxch.cert on 23-Sep-2022 18:43:33 Built /build/acl2-8.3dfsg/books/coi/defpun/defxch.cert (7.102s) Making /build/acl2-8.3dfsg/books/coi/osets/membership.cert on 23-Sep-2022 18:43:40 Built /build/acl2-8.3dfsg/books/coi/osets/membership.cert (3.598s) Making /build/acl2-8.3dfsg/books/data-structures/memories/memory.cert on 23-Sep-2022 18:43:44 Built /build/acl2-8.3dfsg/books/data-structures/memories/memory.cert (10.919s) Making /build/acl2-8.3dfsg/books/coi/quantification/quantified-congruence.cert on 23-Sep-2022 18:43:55 Built /build/acl2-8.3dfsg/books/coi/quantification/quantified-congruence.cert (16.918s) Making /build/acl2-8.3dfsg/books/coi/util/rule-sets.cert on 23-Sep-2022 18:44:12 Built /build/acl2-8.3dfsg/books/coi/util/rule-sets.cert (3.598s) Making /build/acl2-8.3dfsg/books/system/kestrel.cert on 23-Sep-2022 18:44:16 Built /build/acl2-8.3dfsg/books/system/kestrel.cert (5.251s) Making /build/acl2-8.3dfsg/books/system/remove-guard-holders-lemmas.cert on 23-Sep-2022 18:44:21 Built /build/acl2-8.3dfsg/books/system/remove-guard-holders-lemmas.cert (181.279s) Making /build/acl2-8.3dfsg/books/system/pseudo-event-form-listp.cert on 23-Sep-2022 18:47:22 Built /build/acl2-8.3dfsg/books/system/pseudo-event-form-listp.cert (2.346s) Making /build/acl2-8.3dfsg/books/system/pseudo-event-landmarkp.cert on 23-Sep-2022 18:47:25 Built /build/acl2-8.3dfsg/books/system/pseudo-event-landmarkp.cert (2.533s) Making /build/acl2-8.3dfsg/books/system/pseudo-command-landmarkp.cert on 23-Sep-2022 18:47:28 Built /build/acl2-8.3dfsg/books/system/pseudo-command-landmarkp.cert (2.516s) Making /build/acl2-8.3dfsg/books/system/pseudo-tests-and-calls-listp.cert on 23-Sep-2022 18:47:30 Built /build/acl2-8.3dfsg/books/system/pseudo-tests-and-calls-listp.cert (2.655s) Making /build/acl2-8.3dfsg/books/demos/partial-encapsulate.cert on 23-Sep-2022 18:47:33 Built /build/acl2-8.3dfsg/books/demos/partial-encapsulate.cert (4.008s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/lists/len-const-theorems.cert on 23-Sep-2022 18:47:37 Built /build/acl2-8.3dfsg/books/kestrel/utilities/lists/len-const-theorems.cert (3.015s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/lists/primitive-theorems.cert on 23-Sep-2022 18:47:40 Built /build/acl2-8.3dfsg/books/kestrel/utilities/lists/primitive-theorems.cert (2.846s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/er-soft-plus.cert on 23-Sep-2022 18:47:43 Built /build/acl2-8.3dfsg/books/kestrel/utilities/er-soft-plus.cert (2.836s) Making /build/acl2-8.3dfsg/books/kestrel/auto-termination/defunt.cert on 23-Sep-2022 18:47:46 Built /build/acl2-8.3dfsg/books/kestrel/auto-termination/defunt.cert (7.799s) Making /build/acl2-8.3dfsg/books/kestrel/auto-termination/termination-database.cert on 23-Sep-2022 18:47:54 Built /build/acl2-8.3dfsg/books/kestrel/auto-termination/termination-database.cert (15.887s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/padding/top.cert on 23-Sep-2022 18:48:10 Built /build/acl2-8.3dfsg/books/kestrel/crypto/padding/top.cert (2.881s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/lists/intersection-theorems.cert on 23-Sep-2022 18:48:13 Built /build/acl2-8.3dfsg/books/kestrel/utilities/lists/intersection-theorems.cert (2.319s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/lists/add-to-set-theorems.cert on 23-Sep-2022 18:48:16 Built /build/acl2-8.3dfsg/books/kestrel/utilities/lists/add-to-set-theorems.cert (2.366s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/lists/last-theorems.cert on 23-Sep-2022 18:48:18 Built /build/acl2-8.3dfsg/books/kestrel/utilities/lists/last-theorems.cert (2.378s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/lists/set-difference-theorems.cert on 23-Sep-2022 18:48:21 Built /build/acl2-8.3dfsg/books/kestrel/utilities/lists/set-difference-theorems.cert (2.318s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/records.cert on 23-Sep-2022 18:48:23 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/records.cert (5.472s) Making /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/g-delete-keys.cert on 23-Sep-2022 18:48:29 Built /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/g-delete-keys.cert (2.581s) Making /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/groundwork/demo1.cert on 23-Sep-2022 18:48:32 Built /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/groundwork/demo1.cert (8.202s) Making /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/groundwork/demo2.cert on 23-Sep-2022 18:48:40 Built /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/groundwork/demo2.cert (8.200s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/rtl.cert on 23-Sep-2022 18:48:48 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/rtl.cert (9.338s) Making /build/acl2-8.3dfsg/books/std/io/serialize-tests2.cert on 23-Sep-2022 18:48:58 Built /build/acl2-8.3dfsg/books/std/io/serialize-tests2.cert (2.882s) Making /build/acl2-8.3dfsg/books/std/util/tests/defaggrify-defrec.cert on 23-Sep-2022 18:49:01 Built /build/acl2-8.3dfsg/books/std/util/tests/defaggrify-defrec.cert (12.503s) Making /build/acl2-8.3dfsg/books/system/doc/acl2-doc-wrap.cert on 23-Sep-2022 18:49:14 Built /build/acl2-8.3dfsg/books/system/doc/acl2-doc-wrap.cert (5.504s) Making /build/acl2-8.3dfsg/books/system/doc/convert-legacy-doc/import-acl2doc.cert on 23-Sep-2022 18:49:19 Built /build/acl2-8.3dfsg/books/system/doc/convert-legacy-doc/import-acl2doc.cert (4.972s) Making /build/acl2-8.3dfsg/books/tools/clone-stobj.cert on 23-Sep-2022 18:49:24 Built /build/acl2-8.3dfsg/books/tools/clone-stobj.cert (2.454s) Making /build/acl2-8.3dfsg/books/tools/oracle-time-tests.cert on 23-Sep-2022 18:49:27 Built /build/acl2-8.3dfsg/books/tools/oracle-time-tests.cert (763.156s) Making /build/acl2-8.3dfsg/books/tools/plev-ccl.cert on 23-Sep-2022 19:02:10 Built /build/acl2-8.3dfsg/books/tools/plev-ccl.cert (3.794s) Making /build/acl2-8.3dfsg/books/tools/with-supporters-test-top.cert on 23-Sep-2022 19:02:14 Built /build/acl2-8.3dfsg/books/tools/with-supporters-test-top.cert (3.312s) Making /build/acl2-8.3dfsg/books/unicode/sum-list.cert on 23-Sep-2022 19:02:18 Built /build/acl2-8.3dfsg/books/unicode/sum-list.cert (2.891s) Making /build/acl2-8.3dfsg/books/workshops/2000/moore-manolios/partial-functions/tjvm-examples.cert on 23-Sep-2022 19:02:21 Built /build/acl2-8.3dfsg/books/workshops/2000/moore-manolios/partial-functions/tjvm-examples.cert (4.072s) Making /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/records/records.cert on 23-Sep-2022 19:02:25 Built /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/records/records.cert (13.625s) Making /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/sorting/perm-order.cert on 23-Sep-2022 19:02:39 Built /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/sorting/perm-order.cert (2.493s) Making /build/acl2-8.3dfsg/books/workshops/2006/swords-cook/lcsoundness/defsum.cert on 23-Sep-2022 19:02:41 Built /build/acl2-8.3dfsg/books/workshops/2006/swords-cook/lcsoundness/defsum.cert (16.148s) Making /build/acl2-8.3dfsg/books/workshops/2007/cowles-et-al/support/greve/defminterm.cert on 23-Sep-2022 19:02:58 Built /build/acl2-8.3dfsg/books/workshops/2007/cowles-et-al/support/greve/defminterm.cert (18.327s) Making /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/defcode-macro.cert on 23-Sep-2022 19:03:16 Built /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/defcode-macro.cert (2.630s) Making /build/acl2-8.3dfsg/books/workshops/2007/rubio/support/abstract-reductions/confluence.cert on 23-Sep-2022 19:03:19 Built /build/acl2-8.3dfsg/books/workshops/2007/rubio/support/abstract-reductions/confluence.cert (4.862s) Making /build/acl2-8.3dfsg/books/workshops/2009/kaufmann-kornerup-reitblatt/support/gauss-fns.cert on 23-Sep-2022 19:03:24 Built /build/acl2-8.3dfsg/books/workshops/2009/kaufmann-kornerup-reitblatt/support/gauss-fns.cert (8.102s) Making /build/acl2-8.3dfsg/books/xdoc/import-acl2doc.cert on 23-Sep-2022 19:03:32 Built /build/acl2-8.3dfsg/books/xdoc/import-acl2doc.cert (5.156s) Making /build/acl2-8.3dfsg/books/cowles/acl2-crg.cert on 23-Sep-2022 19:03:38 Built /build/acl2-8.3dfsg/books/cowles/acl2-crg.cert (3.400s) Making /build/acl2-8.3dfsg/books/std/util/formals.cert on 23-Sep-2022 19:03:41 Built /build/acl2-8.3dfsg/books/std/util/formals.cert (6.922s) Making /build/acl2-8.3dfsg/books/std/util/returnspecs.cert on 23-Sep-2022 19:03:48 Built /build/acl2-8.3dfsg/books/std/util/returnspecs.cert (11.893s) Making /build/acl2-8.3dfsg/books/std/lists/append.cert on 23-Sep-2022 19:04:00 Built /build/acl2-8.3dfsg/books/std/lists/append.cert (2.648s) Making /build/acl2-8.3dfsg/books/rtl/rel4/support/rtl.cert on 23-Sep-2022 19:04:03 Built /build/acl2-8.3dfsg/books/rtl/rel4/support/rtl.cert (8.523s) Making /build/acl2-8.3dfsg/books/std/testing/must-fail.cert on 23-Sep-2022 19:04:12 Built /build/acl2-8.3dfsg/books/std/testing/must-fail.cert (2.669s) Making /build/acl2-8.3dfsg/books/std/testing/must-succeed.cert on 23-Sep-2022 19:04:15 Built /build/acl2-8.3dfsg/books/std/testing/must-succeed.cert (2.353s) Making /build/acl2-8.3dfsg/books/std/testing/assert.cert on 23-Sep-2022 19:04:17 Built /build/acl2-8.3dfsg/books/std/testing/assert.cert (2.172s) Making /build/acl2-8.3dfsg/books/std/osets/delete.cert on 23-Sep-2022 19:04:19 Built /build/acl2-8.3dfsg/books/std/osets/delete.cert (4.108s) Making /build/acl2-8.3dfsg/books/std/osets/union.cert on 23-Sep-2022 19:04:24 Built /build/acl2-8.3dfsg/books/std/osets/union.cert (7.097s) Making /build/acl2-8.3dfsg/books/std/osets/intersect.cert on 23-Sep-2022 19:04:31 Built /build/acl2-8.3dfsg/books/std/osets/intersect.cert (11.578s) Making /build/acl2-8.3dfsg/books/std/osets/difference.cert on 23-Sep-2022 19:04:43 Built /build/acl2-8.3dfsg/books/std/osets/difference.cert (8.830s) Making /build/acl2-8.3dfsg/books/std/osets/cardinality.cert on 23-Sep-2022 19:04:52 Built /build/acl2-8.3dfsg/books/std/osets/cardinality.cert (3.533s) Making /build/acl2-8.3dfsg/books/xdoc/str.cert on 23-Sep-2022 19:04:55 Built /build/acl2-8.3dfsg/books/xdoc/str.cert (11.039s) Making /build/acl2-8.3dfsg/books/std/strings/printtree-fix.cert on 23-Sep-2022 19:05:07 Built /build/acl2-8.3dfsg/books/std/strings/printtree-fix.cert (2.813s) Making /build/acl2-8.3dfsg/books/acl2s/cgen/acl2s-parameter.cert on 23-Sep-2022 19:05:09 Built /build/acl2-8.3dfsg/books/acl2s/cgen/acl2s-parameter.cert (6.977s) Making /build/acl2-8.3dfsg/books/acl2s/cgen/basis.cert on 23-Sep-2022 19:05:17 Built /build/acl2-8.3dfsg/books/acl2s/cgen/basis.cert (7.758s) Making /build/acl2-8.3dfsg/books/acl2s/cgen/utilities.cert on 23-Sep-2022 19:05:25 Built /build/acl2-8.3dfsg/books/acl2s/cgen/utilities.cert (17.344s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/defdata-util.cert on 23-Sep-2022 19:05:42 Built /build/acl2-8.3dfsg/books/acl2s/defdata/defdata-util.cert (22.018s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/random-state-basis1.cert on 23-Sep-2022 19:06:04 Built /build/acl2-8.3dfsg/books/acl2s/defdata/random-state-basis1.cert (7.601s) Making /build/acl2-8.3dfsg/books/centaur/vl/portcullis.cert on 23-Sep-2022 19:06:12 Built /build/acl2-8.3dfsg/books/centaur/vl/portcullis.cert (2.734s) Making /build/acl2-8.3dfsg/books/centaur/fty/database.cert on 23-Sep-2022 19:06:15 Built /build/acl2-8.3dfsg/books/centaur/fty/database.cert (37.936s) Making /build/acl2-8.3dfsg/books/centaur/ubdds/extra-operations.cert on 23-Sep-2022 19:06:53 Built /build/acl2-8.3dfsg/books/centaur/ubdds/extra-operations.cert (28.594s) Making /build/acl2-8.3dfsg/books/centaur/misc/seed-random.cert on 23-Sep-2022 19:07:22 Built /build/acl2-8.3dfsg/books/centaur/misc/seed-random.cert (3.842s) Making /build/acl2-8.3dfsg/books/xdoc/alter.cert on 23-Sep-2022 19:07:26 Built /build/acl2-8.3dfsg/books/xdoc/alter.cert (4.278s) Making /build/acl2-8.3dfsg/books/centaur/esim/plist.cert on 23-Sep-2022 19:07:30 Built /build/acl2-8.3dfsg/books/centaur/esim/plist.cert (4.662s) Making /build/acl2-8.3dfsg/books/centaur/fgl/aabf-nest.cert on 23-Sep-2022 19:07:35 Built /build/acl2-8.3dfsg/books/centaur/fgl/aabf-nest.cert (6.031s) Making /build/acl2-8.3dfsg/books/centaur/ubdds/deps.cert on 23-Sep-2022 19:07:41 Tick Built /build/acl2-8.3dfsg/books/centaur/ubdds/deps.cert (21.234s) Making /build/acl2-8.3dfsg/books/centaur/sv/portcullis.cert on 23-Sep-2022 19:08:02 Built /build/acl2-8.3dfsg/books/centaur/sv/portcullis.cert (2.902s) Making /build/acl2-8.3dfsg/books/centaur/misc/stobj-swap-test.cert on 23-Sep-2022 19:08:05 Built /build/acl2-8.3dfsg/books/centaur/misc/stobj-swap-test.cert (23.948s) Making /build/acl2-8.3dfsg/books/std/strings/pretty-program.cert on 23-Sep-2022 19:08:30 Built /build/acl2-8.3dfsg/books/std/strings/pretty-program.cert (35.711s) Making /build/acl2-8.3dfsg/books/centaur/sv/tutorial/support.cert on 23-Sep-2022 19:09:05 Built /build/acl2-8.3dfsg/books/centaur/sv/tutorial/support.cert (3.827s) Making /build/acl2-8.3dfsg/books/centaur/vl/doc.cert on 23-Sep-2022 19:09:09 Built /build/acl2-8.3dfsg/books/centaur/vl/doc.cert (2.715s) Making /build/acl2-8.3dfsg/books/coi/defpun/defminterm.cert on 23-Sep-2022 19:09:12 Built /build/acl2-8.3dfsg/books/coi/defpun/defminterm.cert (18.589s) Making /build/acl2-8.3dfsg/books/coi/util/defun-support.cert on 23-Sep-2022 19:09:31 Built /build/acl2-8.3dfsg/books/coi/util/defun-support.cert (17.191s) Making /build/acl2-8.3dfsg/books/coi/osets/fast.cert on 23-Sep-2022 19:09:48 Built /build/acl2-8.3dfsg/books/coi/osets/fast.cert (3.481s) Making /build/acl2-8.3dfsg/books/coi/records/memory.cert on 23-Sep-2022 19:09:52 Built /build/acl2-8.3dfsg/books/coi/records/memory.cert (4.148s) Making /build/acl2-8.3dfsg/books/coi/records/fast/memory.cert on 23-Sep-2022 19:09:56 Built /build/acl2-8.3dfsg/books/coi/records/fast/memory.cert (3.126s) Making /build/acl2-8.3dfsg/books/coi/util/defsubtype.cert on 23-Sep-2022 19:10:00 Built /build/acl2-8.3dfsg/books/coi/util/defsubtype.cert (3.758s) Making /build/acl2-8.3dfsg/books/std/testing/must-be-table-key.cert on 23-Sep-2022 19:10:03 Built /build/acl2-8.3dfsg/books/std/testing/must-be-table-key.cert (2.304s) Making /build/acl2-8.3dfsg/books/std/testing/must-not-be-table-key.cert on 23-Sep-2022 19:10:06 Built /build/acl2-8.3dfsg/books/std/testing/must-not-be-table-key.cert (2.322s) Making /build/acl2-8.3dfsg/books/system/remove-guard-holders.cert on 23-Sep-2022 19:10:08 Built /build/acl2-8.3dfsg/books/system/remove-guard-holders.cert (3.017s) Making /build/acl2-8.3dfsg/books/system/pseudo-good-worldp.cert on 23-Sep-2022 19:10:12 Built /build/acl2-8.3dfsg/books/system/pseudo-good-worldp.cert (30.618s) Making /build/acl2-8.3dfsg/books/demos/parallel/matrix-multiplication-serial.cert on 23-Sep-2022 19:10:42 Built /build/acl2-8.3dfsg/books/demos/parallel/matrix-multiplication-serial.cert (3.950s) Making /build/acl2-8.3dfsg/books/projects/smtlink/portcullis.cert on 23-Sep-2022 19:10:46 Built /build/acl2-8.3dfsg/books/projects/smtlink/portcullis.cert (3.390s) Making /build/acl2-8.3dfsg/books/projects/sidekick/portcullis.cert on 23-Sep-2022 19:10:50 Built /build/acl2-8.3dfsg/books/projects/sidekick/portcullis.cert (2.815s) Making /build/acl2-8.3dfsg/books/doc/relnotes.cert on 23-Sep-2022 19:10:53 Built /build/acl2-8.3dfsg/books/doc/relnotes.cert (5.134s) Making /build/acl2-8.3dfsg/books/workshops/2017/coglio-kaufmann-smith/support/runes.cert on 23-Sep-2022 19:10:58 Built /build/acl2-8.3dfsg/books/workshops/2017/coglio-kaufmann-smith/support/runes.cert (3.000s) Making /build/acl2-8.3dfsg/books/kestrel/auto-termination/top.cert on 23-Sep-2022 19:11:01 Built /build/acl2-8.3dfsg/books/kestrel/auto-termination/top.cert (2.354s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/pseudo-event-formp-tests.cert on 23-Sep-2022 19:11:04 Built /build/acl2-8.3dfsg/books/kestrel/std/system/pseudo-event-formp-tests.cert (2.448s) Making /build/acl2-8.3dfsg/books/make-event/assert-include.cert on 23-Sep-2022 19:11:07 Built /build/acl2-8.3dfsg/books/make-event/assert-include.cert (2.168s) Making /build/acl2-8.3dfsg/books/misc/assert.cert on 23-Sep-2022 19:11:09 Built /build/acl2-8.3dfsg/books/misc/assert.cert (2.111s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/properties-of-sets.cert on 23-Sep-2022 19:11:11 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/properties-of-sets.cert (3.252s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/variables.cert on 23-Sep-2022 19:11:15 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/variables.cert (2.457s) Making /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/fancy-worseguy.cert on 23-Sep-2022 19:11:17 Built /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/fancy-worseguy.cert (2.688s) Making /build/acl2-8.3dfsg/books/projects/security/jfkr/jfkr.cert on 23-Sep-2022 19:11:20 Built /build/acl2-8.3dfsg/books/projects/security/jfkr/jfkr.cert (21.279s) Making /build/acl2-8.3dfsg/books/std/testing/assert-qmark-tests.cert on 23-Sep-2022 19:11:41 Built /build/acl2-8.3dfsg/books/std/testing/assert-qmark-tests.cert (2.518s) Making /build/acl2-8.3dfsg/books/std/util/defmvtypes-tests.cert on 23-Sep-2022 19:11:44 Built /build/acl2-8.3dfsg/books/std/util/defmvtypes-tests.cert (2.103s) Making /build/acl2-8.3dfsg/books/std/util/defredundant-tests.cert on 23-Sep-2022 19:11:46 Built /build/acl2-8.3dfsg/books/std/util/defredundant-tests.cert (2.293s) Making /build/acl2-8.3dfsg/books/std/util/formals-tests.cert on 23-Sep-2022 19:11:49 Built /build/acl2-8.3dfsg/books/std/util/formals-tests.cert (2.634s) Making /build/acl2-8.3dfsg/books/std/util/look-up-tests.cert on 23-Sep-2022 19:11:52 Built /build/acl2-8.3dfsg/books/std/util/look-up-tests.cert (2.425s) Making /build/acl2-8.3dfsg/books/std/util/returnspecs-tests.cert on 23-Sep-2022 19:11:54 Built /build/acl2-8.3dfsg/books/std/util/returnspecs-tests.cert (2.591s) Making /build/acl2-8.3dfsg/books/std/util/tests/defval.cert on 23-Sep-2022 19:11:57 Built /build/acl2-8.3dfsg/books/std/util/tests/defval.cert (2.478s) Making /build/acl2-8.3dfsg/books/system/fancy-string-reader-test.cert on 23-Sep-2022 19:11:59 Built /build/acl2-8.3dfsg/books/system/fancy-string-reader-test.cert (2.138s) Making /build/acl2-8.3dfsg/books/system/tests/untranslate.cert on 23-Sep-2022 19:12:02 Built /build/acl2-8.3dfsg/books/system/tests/untranslate.cert (2.314s) Making /build/acl2-8.3dfsg/books/system/worldp-check.cert on 23-Sep-2022 19:12:04 Built /build/acl2-8.3dfsg/books/system/worldp-check.cert (3.165s) Making /build/acl2-8.3dfsg/books/unicode/z-listp.cert on 23-Sep-2022 19:12:08 Built /build/acl2-8.3dfsg/books/unicode/z-listp.cert (2.972s) Making /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/sorting/insertion-sort.cert on 23-Sep-2022 19:12:11 Built /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/sorting/insertion-sort.cert (2.955s) Making /build/acl2-8.3dfsg/books/workshops/2007/cowles-et-al/support/greve/ack.cert on 23-Sep-2022 19:12:14 Built /build/acl2-8.3dfsg/books/workshops/2007/cowles-et-al/support/greve/ack.cert (7.088s) Making /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/defcode.cert on 23-Sep-2022 19:12:21 Built /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/defcode.cert (4.245s) Making /build/acl2-8.3dfsg/books/workshops/2009/kaufmann-kornerup-reitblatt/support/gauss-work.cert on 23-Sep-2022 19:12:25 Built /build/acl2-8.3dfsg/books/workshops/2009/kaufmann-kornerup-reitblatt/support/gauss-work.cert (3.456s) Making /build/acl2-8.3dfsg/books/xdoc/defxdoc-plus-tests.cert on 23-Sep-2022 19:12:29 Built /build/acl2-8.3dfsg/books/xdoc/defxdoc-plus-tests.cert (2.780s) Making /build/acl2-8.3dfsg/books/arithmetic/equalities.cert on 23-Sep-2022 19:12:32 Built /build/acl2-8.3dfsg/books/arithmetic/equalities.cert (4.541s) Making /build/acl2-8.3dfsg/books/std/util/define.cert on 23-Sep-2022 19:12:37 Built /build/acl2-8.3dfsg/books/std/util/define.cert (27.017s) Making /build/acl2-8.3dfsg/books/std/lists/equiv.cert on 23-Sep-2022 19:13:04 Built /build/acl2-8.3dfsg/books/std/lists/equiv.cert (3.396s) Making /build/acl2-8.3dfsg/books/meta/meta-times-equal.cert on 23-Sep-2022 19:13:07 Built /build/acl2-8.3dfsg/books/meta/meta-times-equal.cert (8.523s) Making /build/acl2-8.3dfsg/books/std/testing/must-fail-local.cert on 23-Sep-2022 19:13:16 Built /build/acl2-8.3dfsg/books/std/testing/must-fail-local.cert (2.298s) Making /build/acl2-8.3dfsg/books/std/testing/must-fail-with-error.cert on 23-Sep-2022 19:13:19 Built /build/acl2-8.3dfsg/books/std/testing/must-fail-with-error.cert (2.288s) Making /build/acl2-8.3dfsg/books/std/testing/must-fail-with-hard-error.cert on 23-Sep-2022 19:13:21 Built /build/acl2-8.3dfsg/books/std/testing/must-fail-with-hard-error.cert (2.192s) Making /build/acl2-8.3dfsg/books/std/testing/must-fail-with-soft-error.cert on 23-Sep-2022 19:13:23 Built /build/acl2-8.3dfsg/books/std/testing/must-fail-with-soft-error.cert (2.245s) Making /build/acl2-8.3dfsg/books/std/testing/must-not-prove.cert on 23-Sep-2022 19:13:26 Built /build/acl2-8.3dfsg/books/std/testing/must-not-prove.cert (2.108s) Making /build/acl2-8.3dfsg/books/std/testing/must-prove.cert on 23-Sep-2022 19:13:28 Built /build/acl2-8.3dfsg/books/std/testing/must-prove.cert (2.105s) Making /build/acl2-8.3dfsg/books/std/testing/must-succeed-star.cert on 23-Sep-2022 19:13:30 Built /build/acl2-8.3dfsg/books/std/testing/must-succeed-star.cert (2.392s) Making /build/acl2-8.3dfsg/books/std/lists/rev.cert on 23-Sep-2022 19:13:33 Built /build/acl2-8.3dfsg/books/std/lists/rev.cert (3.366s) Making /build/acl2-8.3dfsg/books/std/lists/flatten.cert on 23-Sep-2022 19:13:36 Built /build/acl2-8.3dfsg/books/std/lists/flatten.cert (2.739s) Making /build/acl2-8.3dfsg/books/centaur/fty/basetypes.cert on 23-Sep-2022 19:13:39 Built /build/acl2-8.3dfsg/books/centaur/fty/basetypes.cert (7.746s) Making /build/acl2-8.3dfsg/books/std/lists/last.cert on 23-Sep-2022 19:13:47 Built /build/acl2-8.3dfsg/books/std/lists/last.cert (2.786s) Making /build/acl2-8.3dfsg/books/std/strings/char-fix.cert on 23-Sep-2022 19:13:50 Built /build/acl2-8.3dfsg/books/std/strings/char-fix.cert (3.167s) Making /build/acl2-8.3dfsg/books/std/alists/hons-assoc-equal.cert on 23-Sep-2022 19:13:53 Built /build/acl2-8.3dfsg/books/std/alists/hons-assoc-equal.cert (2.530s) Making /build/acl2-8.3dfsg/books/std/alists/worth-hashing.cert on 23-Sep-2022 19:13:56 Built /build/acl2-8.3dfsg/books/std/alists/worth-hashing.cert (3.281s) Making /build/acl2-8.3dfsg/books/std/alists/alist-defuns.cert on 23-Sep-2022 19:13:59 Built /build/acl2-8.3dfsg/books/std/alists/alist-defuns.cert (5.227s) Making /build/acl2-8.3dfsg/books/std/util/maybe-defthm.cert on 23-Sep-2022 19:14:05 Built /build/acl2-8.3dfsg/books/std/util/maybe-defthm.cert (2.983s) Making /build/acl2-8.3dfsg/books/std/osets/outer.cert on 23-Sep-2022 19:14:08 Built /build/acl2-8.3dfsg/books/std/osets/outer.cert (18.838s) Making /build/acl2-8.3dfsg/books/std/osets/sort.cert on 23-Sep-2022 19:14:27 Built /build/acl2-8.3dfsg/books/std/osets/sort.cert (4.481s) Making /build/acl2-8.3dfsg/books/std/strings/printtree-concat.cert on 23-Sep-2022 19:14:31 Built /build/acl2-8.3dfsg/books/std/strings/printtree-concat.cert (3.507s) Making /build/acl2-8.3dfsg/books/std/util/defines.cert on 23-Sep-2022 19:14:35 Built /build/acl2-8.3dfsg/books/std/util/defines.cert (16.870s) Making /build/acl2-8.3dfsg/books/std/strings/symbols.cert on 23-Sep-2022 19:14:52 Built /build/acl2-8.3dfsg/books/std/strings/symbols.cert (3.646s) Making /build/acl2-8.3dfsg/books/acl2s/cgen/type.cert on 23-Sep-2022 19:14:56 Built /build/acl2-8.3dfsg/books/acl2s/cgen/type.cert (14.389s) Making /build/acl2-8.3dfsg/books/acl2s/cgen/cgen-state.cert on 23-Sep-2022 19:15:11 Built /build/acl2-8.3dfsg/books/acl2s/cgen/cgen-state.cert (13.705s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/builtin-combinators.cert on 23-Sep-2022 19:15:24 Built /build/acl2-8.3dfsg/books/acl2s/defdata/builtin-combinators.cert (10.793s) Making /build/acl2-8.3dfsg/books/acl2s/cgen/cgen-rules.cert on 23-Sep-2022 19:15:35 Built /build/acl2-8.3dfsg/books/acl2s/cgen/cgen-rules.cert (9.414s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/register-combinator.cert on 23-Sep-2022 19:15:45 Built /build/acl2-8.3dfsg/books/acl2s/defdata/register-combinator.cert (4.269s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/defdata-core.cert on 23-Sep-2022 19:15:49 Built /build/acl2-8.3dfsg/books/acl2s/defdata/defdata-core.cert (24.398s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/enumerators-gen.cert on 23-Sep-2022 19:16:14 Built /build/acl2-8.3dfsg/books/acl2s/defdata/enumerators-gen.cert (10.000s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/register-data-constructor.cert on 23-Sep-2022 19:16:24 Built /build/acl2-8.3dfsg/books/acl2s/defdata/register-data-constructor.cert (5.052s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/defdata-attach.cert on 23-Sep-2022 19:16:29 Built /build/acl2-8.3dfsg/books/acl2s/defdata/defdata-attach.cert (8.274s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/listof.cert on 23-Sep-2022 19:16:38 Built /build/acl2-8.3dfsg/books/acl2s/defdata/listof.cert (4.924s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/record.cert on 23-Sep-2022 19:16:43 Built /build/acl2-8.3dfsg/books/acl2s/defdata/record.cert (14.866s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/map.cert on 23-Sep-2022 19:16:58 Built /build/acl2-8.3dfsg/books/acl2s/defdata/map.cert (6.113s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/tau-characterization.cert on 23-Sep-2022 19:17:04 Built /build/acl2-8.3dfsg/books/acl2s/defdata/tau-characterization.cert (14.146s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/sig.cert on 23-Sep-2022 19:17:18 Built /build/acl2-8.3dfsg/books/acl2s/defdata/sig.cert (19.293s) Making /build/acl2-8.3dfsg/books/centaur/4v-sexpr/portcullis.cert on 23-Sep-2022 19:17:38 Built /build/acl2-8.3dfsg/books/centaur/4v-sexpr/portcullis.cert (3.132s) Making /build/acl2-8.3dfsg/books/misc/hons-help.cert on 23-Sep-2022 19:17:41 Built /build/acl2-8.3dfsg/books/misc/hons-help.cert (7.263s) Making /build/acl2-8.3dfsg/books/centaur/aig/portcullis.cert on 23-Sep-2022 19:17:48 Built /build/acl2-8.3dfsg/books/centaur/aig/portcullis.cert (3.168s) Making /build/acl2-8.3dfsg/books/centaur/vl/util/cwtime.cert on 23-Sep-2022 19:17:52 Built /build/acl2-8.3dfsg/books/centaur/vl/util/cwtime.cert (3.158s) Making /build/acl2-8.3dfsg/books/data-structures/list-defthms.cert on 23-Sep-2022 19:17:55 Built /build/acl2-8.3dfsg/books/data-structures/list-defthms.cert (13.563s) Making /build/acl2-8.3dfsg/books/centaur/misc/sneaky-load.cert on 23-Sep-2022 19:18:09 Built /build/acl2-8.3dfsg/books/centaur/misc/sneaky-load.cert (7.207s) Making /build/acl2-8.3dfsg/books/centaur/misc/dfs-measure.cert on 23-Sep-2022 19:18:16 Built /build/acl2-8.3dfsg/books/centaur/misc/dfs-measure.cert (5.656s) Making /build/acl2-8.3dfsg/books/centaur/4v-sexpr/sexpr-fixpoint-rewriting.cert on 23-Sep-2022 19:18:22 Built /build/acl2-8.3dfsg/books/centaur/4v-sexpr/sexpr-fixpoint-rewriting.cert (3.602s) Making /build/acl2-8.3dfsg/books/std/util/defmapappend.cert on 23-Sep-2022 19:18:26 Built /build/acl2-8.3dfsg/books/std/util/defmapappend.cert (8.138s) Making /build/acl2-8.3dfsg/books/centaur/fty/fty-parseutils.cert on 23-Sep-2022 19:18:34 Built /build/acl2-8.3dfsg/books/centaur/fty/fty-parseutils.cert (6.726s) Making /build/acl2-8.3dfsg/books/centaur/vl/util/cw-unformatted.cert on 23-Sep-2022 19:18:41 Built /build/acl2-8.3dfsg/books/centaur/vl/util/cw-unformatted.cert (4.634s) Making /build/acl2-8.3dfsg/books/centaur/misc/fast-cons-memo.cert on 23-Sep-2022 19:18:46 Built /build/acl2-8.3dfsg/books/centaur/misc/fast-cons-memo.cert (4.758s) Making /build/acl2-8.3dfsg/books/std/basic/bytep.cert on 23-Sep-2022 19:18:51 Built /build/acl2-8.3dfsg/books/std/basic/bytep.cert (3.252s) Making /build/acl2-8.3dfsg/books/centaur/ubdds/subset.cert on 23-Sep-2022 19:18:54 Built /build/acl2-8.3dfsg/books/centaur/ubdds/subset.cert (23.863s) Making /build/acl2-8.3dfsg/books/std/stobjs/1d-arr.cert on 23-Sep-2022 19:19:18 Built /build/acl2-8.3dfsg/books/std/stobjs/1d-arr.cert (3.914s) Making /build/acl2-8.3dfsg/books/centaur/misc/nth-equiv.cert on 23-Sep-2022 19:19:22 Built /build/acl2-8.3dfsg/books/centaur/misc/nth-equiv.cert (4.327s) Making /build/acl2-8.3dfsg/books/centaur/misc/rewrite-rule.cert on 23-Sep-2022 19:19:27 Built /build/acl2-8.3dfsg/books/centaur/misc/rewrite-rule.cert (5.651s) Making /build/acl2-8.3dfsg/books/centaur/aignet/statsmgr.cert on 23-Sep-2022 19:19:32 Built /build/acl2-8.3dfsg/books/centaur/aignet/statsmgr.cert (8.751s) Making /build/acl2-8.3dfsg/books/centaur/esim/esim-primitives.cert on 23-Sep-2022 19:19:41 Built /build/acl2-8.3dfsg/books/centaur/esim/esim-primitives.cert (3.641s) Making /build/acl2-8.3dfsg/books/centaur/vl2014/util/gc.cert on 23-Sep-2022 19:19:45 Built /build/acl2-8.3dfsg/books/centaur/vl2014/util/gc.cert (5.290s) Making /build/acl2-8.3dfsg/books/centaur/fgl/syntax-bind.cert on 23-Sep-2022 19:19:51 Built /build/acl2-8.3dfsg/books/centaur/fgl/syntax-bind.cert (4.597s) Making /build/acl2-8.3dfsg/books/std/util/defret-mutual-generate.cert on 23-Sep-2022 19:19:55 Built /build/acl2-8.3dfsg/books/std/util/defret-mutual-generate.cert (14.961s) Making /build/acl2-8.3dfsg/books/centaur/fgl/def-fgl-thm.cert on 23-Sep-2022 19:20:10 Built /build/acl2-8.3dfsg/books/centaur/fgl/def-fgl-thm.cert (4.836s) Making /build/acl2-8.3dfsg/books/centaur/fgl/gatecount-stub.cert on 23-Sep-2022 19:20:15 Built /build/acl2-8.3dfsg/books/centaur/fgl/gatecount-stub.cert (3.532s) Making /build/acl2-8.3dfsg/books/centaur/gl/def-gl-rule.cert on 23-Sep-2022 19:20:19 Built /build/acl2-8.3dfsg/books/centaur/gl/def-gl-rule.cert (3.768s) Making /build/acl2-8.3dfsg/books/centaur/misc/1d-arr.cert on 23-Sep-2022 19:20:23 Built /build/acl2-8.3dfsg/books/centaur/misc/1d-arr.cert (2.966s) Making /build/acl2-8.3dfsg/books/oslib/lisptype-logic.cert on 23-Sep-2022 19:20:26 Built /build/acl2-8.3dfsg/books/oslib/lisptype-logic.cert (3.872s) Making /build/acl2-8.3dfsg/books/centaur/misc/spacewalk.cert on 23-Sep-2022 19:20:30 Built /build/acl2-8.3dfsg/books/centaur/misc/spacewalk.cert (2.973s) Making /build/acl2-8.3dfsg/books/oslib/date-logic.cert on 23-Sep-2022 19:20:33 Built /build/acl2-8.3dfsg/books/oslib/date-logic.cert (4.027s) Making /build/acl2-8.3dfsg/books/xdoc/fmt-to-str.cert on 23-Sep-2022 19:20:37 Built /build/acl2-8.3dfsg/books/xdoc/fmt-to-str.cert (3.532s) Making /build/acl2-8.3dfsg/books/std/io/read-string.cert on 23-Sep-2022 19:20:41 Built /build/acl2-8.3dfsg/books/std/io/read-string.cert (5.656s) Making /build/acl2-8.3dfsg/books/xdoc/unsound-eval.cert on 23-Sep-2022 19:20:47 Built /build/acl2-8.3dfsg/books/xdoc/unsound-eval.cert (6.180s) Making /build/acl2-8.3dfsg/books/centaur/vl/util/gc.cert on 23-Sep-2022 19:20:53 Built /build/acl2-8.3dfsg/books/centaur/vl/util/gc.cert (5.360s) Making /build/acl2-8.3dfsg/books/oslib/dirname-logic.cert on 23-Sep-2022 19:20:59 Built /build/acl2-8.3dfsg/books/oslib/dirname-logic.cert (6.254s) Making /build/acl2-8.3dfsg/books/oslib/mkdir-logic.cert on 23-Sep-2022 19:21:05 Built /build/acl2-8.3dfsg/books/oslib/mkdir-logic.cert (3.912s) Making /build/acl2-8.3dfsg/books/coi/defpun/ack.cert on 23-Sep-2022 19:21:09 Built /build/acl2-8.3dfsg/books/coi/defpun/ack.cert (7.430s) Making /build/acl2-8.3dfsg/books/coi/util/recursion-support.cert on 23-Sep-2022 19:21:17 Built /build/acl2-8.3dfsg/books/coi/util/recursion-support.cert (9.228s) Making /build/acl2-8.3dfsg/books/coi/osets/outer.cert on 23-Sep-2022 19:21:26 Built /build/acl2-8.3dfsg/books/coi/osets/outer.cert (4.684s) Making /build/acl2-8.3dfsg/books/coi/termination/assuming/compiler-proof.cert on 23-Sep-2022 19:21:31 Built /build/acl2-8.3dfsg/books/coi/termination/assuming/compiler-proof.cert (16.862s) Making /build/acl2-8.3dfsg/books/data-structures/alist-defthms.cert on 23-Sep-2022 19:21:48 Built /build/acl2-8.3dfsg/books/data-structures/alist-defthms.cert (6.095s) Making /build/acl2-8.3dfsg/books/data-structures/deflist.cert on 23-Sep-2022 19:21:54 Built /build/acl2-8.3dfsg/books/data-structures/deflist.cert (10.444s) Making /build/acl2-8.3dfsg/books/std/basic/nibblep.cert on 23-Sep-2022 19:22:05 Built /build/acl2-8.3dfsg/books/std/basic/nibblep.cert (3.245s) Making /build/acl2-8.3dfsg/books/system/bind-macro-args.cert on 23-Sep-2022 19:22:08 Built /build/acl2-8.3dfsg/books/system/bind-macro-args.cert (7.075s) Making /build/acl2-8.3dfsg/books/demos/parallel/matrix-multiplication-parallel.cert on 23-Sep-2022 19:22:16 Built /build/acl2-8.3dfsg/books/demos/parallel/matrix-multiplication-parallel.cert (5.983s) Making /build/acl2-8.3dfsg/books/doc/compare-fast-vs-slow.cert on 23-Sep-2022 19:22:22 Built /build/acl2-8.3dfsg/books/doc/compare-fast-vs-slow.cert (8.752s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/macro-keyword-args.cert on 23-Sep-2022 19:22:31 Built /build/acl2-8.3dfsg/books/kestrel/std/system/macro-keyword-args.cert (4.022s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/macro-required-args.cert on 23-Sep-2022 19:22:35 Built /build/acl2-8.3dfsg/books/kestrel/std/system/macro-required-args.cert (3.687s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/function-namep.cert on 23-Sep-2022 19:22:39 Built /build/acl2-8.3dfsg/books/kestrel/std/system/function-namep.cert (3.233s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/non-executablep.cert on 23-Sep-2022 19:22:42 Built /build/acl2-8.3dfsg/books/kestrel/std/system/non-executablep.cert (3.301s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/thm-formula.cert on 23-Sep-2022 19:22:46 Built /build/acl2-8.3dfsg/books/kestrel/std/system/thm-formula.cert (3.447s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/pseudo-lambdap.cert on 23-Sep-2022 19:22:49 Built /build/acl2-8.3dfsg/books/kestrel/std/system/pseudo-lambdap.cert (3.392s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/maybe-pseudo-event-formp.cert on 23-Sep-2022 19:22:53 Built /build/acl2-8.3dfsg/books/kestrel/std/system/maybe-pseudo-event-formp.cert (3.247s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/define-sk.cert on 23-Sep-2022 19:22:56 Built /build/acl2-8.3dfsg/books/kestrel/utilities/define-sk.cert (14.515s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/untranslate-preprocessing.cert on 23-Sep-2022 19:23:11 Built /build/acl2-8.3dfsg/books/kestrel/utilities/untranslate-preprocessing.cert (3.529s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/add-suffix-to-fn-or-const.cert on 23-Sep-2022 19:23:14 Built /build/acl2-8.3dfsg/books/kestrel/std/system/add-suffix-to-fn-or-const.cert (4.147s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/fresh-namep.cert on 23-Sep-2022 19:23:19 Built /build/acl2-8.3dfsg/books/kestrel/std/system/fresh-namep.cert (4.346s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/maybe-unquote.cert on 23-Sep-2022 19:23:23 Built /build/acl2-8.3dfsg/books/kestrel/utilities/maybe-unquote.cert (2.888s) Making /build/acl2-8.3dfsg/books/kestrel/std/basic/symbol-package-name-lst.cert on 23-Sep-2022 19:23:26 Built /build/acl2-8.3dfsg/books/kestrel/std/basic/symbol-package-name-lst.cert (3.490s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/all-non-gv-exec-ffn-symbs.cert on 23-Sep-2022 19:23:30 Built /build/acl2-8.3dfsg/books/kestrel/std/system/all-non-gv-exec-ffn-symbs.cert (3.272s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/guard-verified-p.cert on 23-Sep-2022 19:23:33 Built /build/acl2-8.3dfsg/books/kestrel/std/system/guard-verified-p.cert (3.386s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/all-vars-in-untranslated-term.cert on 23-Sep-2022 19:23:37 Built /build/acl2-8.3dfsg/books/kestrel/std/system/all-vars-in-untranslated-term.cert (3.387s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/check-user-term.cert on 23-Sep-2022 19:23:40 Built /build/acl2-8.3dfsg/books/kestrel/std/system/check-user-term.cert (3.506s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/fsublis-var.cert on 23-Sep-2022 19:23:44 Built /build/acl2-8.3dfsg/books/kestrel/std/system/fsublis-var.cert (4.093s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/guard-verified-exec-fnsp.cert on 23-Sep-2022 19:23:48 Built /build/acl2-8.3dfsg/books/kestrel/std/system/guard-verified-exec-fnsp.cert (3.334s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/guard-verified-fnsp.cert on 23-Sep-2022 19:23:52 Built /build/acl2-8.3dfsg/books/kestrel/std/system/guard-verified-fnsp.cert (3.965s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/lambda-closedp.cert on 23-Sep-2022 19:23:56 Built /build/acl2-8.3dfsg/books/kestrel/std/system/lambda-closedp.cert (3.621s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/lambda-guard-verified-exec-fnsp.cert on 23-Sep-2022 19:24:00 Built /build/acl2-8.3dfsg/books/kestrel/std/system/lambda-guard-verified-exec-fnsp.cert (3.421s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/lambda-guard-verified-fnsp.cert on 23-Sep-2022 19:24:03 Built /build/acl2-8.3dfsg/books/kestrel/std/system/lambda-guard-verified-fnsp.cert (3.582s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/lambda-logic-fnsp.cert on 23-Sep-2022 19:24:07 Built /build/acl2-8.3dfsg/books/kestrel/std/system/lambda-logic-fnsp.cert (3.478s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/lambdap.cert on 23-Sep-2022 19:24:10 Built /build/acl2-8.3dfsg/books/kestrel/std/system/lambdap.cert (4.070s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/term-guard-obligation.cert on 23-Sep-2022 19:24:15 Built /build/acl2-8.3dfsg/books/kestrel/std/system/term-guard-obligation.cert (3.599s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/classes.cert on 23-Sep-2022 19:24:18 Built /build/acl2-8.3dfsg/books/kestrel/std/system/classes.cert (3.279s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/theorem-symbolp.cert on 23-Sep-2022 19:24:22 Built /build/acl2-8.3dfsg/books/kestrel/std/system/theorem-symbolp.cert (3.360s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/definedp.cert on 23-Sep-2022 19:24:25 Built /build/acl2-8.3dfsg/books/kestrel/std/system/definedp.cert (3.276s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/event-landmark-names.cert on 23-Sep-2022 19:24:29 Built /build/acl2-8.3dfsg/books/kestrel/std/system/event-landmark-names.cert (3.426s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/fundef-disabledp.cert on 23-Sep-2022 19:24:32 Built /build/acl2-8.3dfsg/books/kestrel/std/system/fundef-disabledp.cert (3.199s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/guard-verified-p-plus.cert on 23-Sep-2022 19:24:36 Built /build/acl2-8.3dfsg/books/kestrel/std/system/guard-verified-p-plus.cert (3.449s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/included-books.cert on 23-Sep-2022 19:24:39 Built /build/acl2-8.3dfsg/books/kestrel/std/system/included-books.cert (3.213s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/induction-machine.cert on 23-Sep-2022 19:24:43 Built /build/acl2-8.3dfsg/books/kestrel/std/system/induction-machine.cert (3.299s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/irecursivep.cert on 23-Sep-2022 19:24:46 Built /build/acl2-8.3dfsg/books/kestrel/std/system/irecursivep.cert (3.253s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/known-packages.cert on 23-Sep-2022 19:24:50 Built /build/acl2-8.3dfsg/books/kestrel/std/system/known-packages.cert (3.432s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/logic-function-namep.cert on 23-Sep-2022 19:24:53 Built /build/acl2-8.3dfsg/books/kestrel/std/system/logic-function-namep.cert (3.514s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/logical-name-listp.cert on 23-Sep-2022 19:24:57 Built /build/acl2-8.3dfsg/books/kestrel/std/system/logical-name-listp.cert (3.523s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/macro-symbolp.cert on 23-Sep-2022 19:25:00 Built /build/acl2-8.3dfsg/books/kestrel/std/system/macro-symbolp.cert (3.431s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/measure.cert on 23-Sep-2022 19:25:04 Built /build/acl2-8.3dfsg/books/kestrel/std/system/measure.cert (3.705s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/measured-subset.cert on 23-Sep-2022 19:25:08 Built /build/acl2-8.3dfsg/books/kestrel/std/system/measured-subset.cert (3.716s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/no-stobjs-p.cert on 23-Sep-2022 19:25:12 Built /build/acl2-8.3dfsg/books/kestrel/std/system/no-stobjs-p.cert (3.663s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/stobjs-in-plus.cert on 23-Sep-2022 19:25:16 Built /build/acl2-8.3dfsg/books/kestrel/std/system/stobjs-in-plus.cert (3.400s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/stobjs-out-plus.cert on 23-Sep-2022 19:25:19 Built /build/acl2-8.3dfsg/books/kestrel/std/system/stobjs-out-plus.cert (3.488s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/non-executablep-plus.cert on 23-Sep-2022 19:25:23 Built /build/acl2-8.3dfsg/books/kestrel/std/system/non-executablep-plus.cert (3.381s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/number-of-results.cert on 23-Sep-2022 19:25:26 Built /build/acl2-8.3dfsg/books/kestrel/std/system/number-of-results.cert (3.288s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/pseudo-tests-and-callp.cert on 23-Sep-2022 19:25:30 Built /build/acl2-8.3dfsg/books/kestrel/std/system/pseudo-tests-and-callp.cert (3.263s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/primitivep.cert on 23-Sep-2022 19:25:33 Built /build/acl2-8.3dfsg/books/kestrel/std/system/primitivep.cert (3.409s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/ruler-extenders.cert on 23-Sep-2022 19:25:37 Built /build/acl2-8.3dfsg/books/kestrel/std/system/ruler-extenders.cert (3.721s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/rune-disabledp.cert on 23-Sep-2022 19:25:40 Built /build/acl2-8.3dfsg/books/kestrel/std/system/rune-disabledp.cert (3.281s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/thm-formula-plus.cert on 23-Sep-2022 19:25:44 Built /build/acl2-8.3dfsg/books/kestrel/std/system/thm-formula-plus.cert (3.523s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/theorem-namep.cert on 23-Sep-2022 19:25:48 Built /build/acl2-8.3dfsg/books/kestrel/std/system/theorem-namep.cert (3.530s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/well-founded-relation.cert on 23-Sep-2022 19:25:51 Built /build/acl2-8.3dfsg/books/kestrel/std/system/well-founded-relation.cert (3.583s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/keyword-value-lists.cert on 23-Sep-2022 19:25:55 Built /build/acl2-8.3dfsg/books/kestrel/utilities/keyword-value-lists.cert (4.327s) Making /build/acl2-8.3dfsg/books/kestrel/event-macros/intro-macros.cert on 23-Sep-2022 19:25:59 Built /build/acl2-8.3dfsg/books/kestrel/event-macros/intro-macros.cert (3.538s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/ibody.cert on 23-Sep-2022 19:26:03 Built /build/acl2-8.3dfsg/books/kestrel/std/system/ibody.cert (3.360s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/check-list-call.cert on 23-Sep-2022 19:26:07 Built /build/acl2-8.3dfsg/books/kestrel/std/system/check-list-call.cert (4.001s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/quote-term.cert on 23-Sep-2022 19:26:11 Built /build/acl2-8.3dfsg/books/kestrel/std/system/quote-term.cert (2.845s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/unquote-term.cert on 23-Sep-2022 19:26:14 Built /build/acl2-8.3dfsg/books/kestrel/std/system/unquote-term.cert (3.686s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/conjoin-equalities.cert on 23-Sep-2022 19:26:18 Built /build/acl2-8.3dfsg/books/kestrel/std/system/conjoin-equalities.cert (3.751s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/make-mv-let-call.cert on 23-Sep-2022 19:26:21 Built /build/acl2-8.3dfsg/books/kestrel/std/system/make-mv-let-call.cert (4.588s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/make-mv-nth-calls.cert on 23-Sep-2022 19:26:26 Built /build/acl2-8.3dfsg/books/kestrel/std/system/make-mv-nth-calls.cert (3.849s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/table-alist-plus.cert on 23-Sep-2022 19:26:30 Built /build/acl2-8.3dfsg/books/kestrel/std/system/table-alist-plus.cert (3.474s) Making /build/acl2-8.3dfsg/books/kestrel/std/basic/symbol-package-name-non-cl.cert on 23-Sep-2022 19:26:34 Built /build/acl2-8.3dfsg/books/kestrel/std/basic/symbol-package-name-non-cl.cert (3.250s) Making /build/acl2-8.3dfsg/books/kestrel/library-wrappers/arithmetic-equalities.cert on 23-Sep-2022 19:26:37 Built /build/acl2-8.3dfsg/books/kestrel/library-wrappers/arithmetic-equalities.cert (2.437s) Making /build/acl2-8.3dfsg/books/kestrel/std/util/deffixer.cert on 23-Sep-2022 19:26:40 Built /build/acl2-8.3dfsg/books/kestrel/std/util/deffixer.cert (4.407s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/lists/rev-theorems.cert on 23-Sep-2022 19:26:44 Built /build/acl2-8.3dfsg/books/kestrel/utilities/lists/rev-theorems.cert (3.262s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/ecurve/secp256k1-domain-parameters.cert on 23-Sep-2022 19:26:48 Built /build/acl2-8.3dfsg/books/kestrel/crypto/ecurve/secp256k1-domain-parameters.cert (3.542s) Making /build/acl2-8.3dfsg/books/kestrel/bitcoin/bip39-english-words.cert on 23-Sep-2022 19:26:51 Built /build/acl2-8.3dfsg/books/kestrel/bitcoin/bip39-english-words.cert (3.778s) Making /build/acl2-8.3dfsg/books/kestrel/event-macros/intro-macros-tests.cert on 23-Sep-2022 19:26:55 Built /build/acl2-8.3dfsg/books/kestrel/event-macros/intro-macros-tests.cert (3.130s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/dumb-occur-var-open.cert on 23-Sep-2022 19:26:59 Built /build/acl2-8.3dfsg/books/kestrel/std/system/dumb-occur-var-open.cert (4.145s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/remove-trivial-vars.cert on 23-Sep-2022 19:27:03 Built /build/acl2-8.3dfsg/books/kestrel/std/system/remove-trivial-vars.cert (5.129s) Making /build/acl2-8.3dfsg/books/kestrel/java/language/floating-point-value-set-parameters.cert on 23-Sep-2022 19:27:08 Built /build/acl2-8.3dfsg/books/kestrel/java/language/floating-point-value-set-parameters.cert (3.827s) Making /build/acl2-8.3dfsg/books/kestrel/std/util/defconstrained-recognizer.cert on 23-Sep-2022 19:27:12 Built /build/acl2-8.3dfsg/books/kestrel/std/util/defconstrained-recognizer.cert (3.809s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/all-vars-open.cert on 23-Sep-2022 19:27:16 Built /build/acl2-8.3dfsg/books/kestrel/std/system/all-vars-open.cert (4.684s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/check-lambda-call.cert on 23-Sep-2022 19:27:21 Built /build/acl2-8.3dfsg/books/kestrel/std/system/check-lambda-call.cert (3.732s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/remove-dead-if-branches.cert on 23-Sep-2022 19:27:25 Built /build/acl2-8.3dfsg/books/kestrel/std/system/remove-dead-if-branches.cert (5.672s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/remove-mbe.cert on 23-Sep-2022 19:27:31 Built /build/acl2-8.3dfsg/books/kestrel/std/system/remove-mbe.cert (5.081s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/remove-progn.cert on 23-Sep-2022 19:27:36 Built /build/acl2-8.3dfsg/books/kestrel/std/system/remove-progn.cert (4.747s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/remove-unused-vars.cert on 23-Sep-2022 19:27:41 Built /build/acl2-8.3dfsg/books/kestrel/std/system/remove-unused-vars.cert (6.083s) Making /build/acl2-8.3dfsg/books/kestrel/java/atj/tutorial.cert on 23-Sep-2022 19:27:47 Built /build/acl2-8.3dfsg/books/kestrel/java/atj/tutorial.cert (4.443s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/defchoose-queries.cert on 23-Sep-2022 19:27:52 Built /build/acl2-8.3dfsg/books/kestrel/std/system/defchoose-queries.cert (4.574s) Making /build/acl2-8.3dfsg/books/kestrel/std/basic/symbol-package-name-lst-tests.cert on 23-Sep-2022 19:27:56 Built /build/acl2-8.3dfsg/books/kestrel/std/basic/symbol-package-name-lst-tests.cert (3.076s) Making /build/acl2-8.3dfsg/books/kestrel/std/basic/symbol-package-name-non-cl-tests.cert on 23-Sep-2022 19:28:00 Built /build/acl2-8.3dfsg/books/kestrel/std/basic/symbol-package-name-non-cl-tests.cert (3.073s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/add-suffix-to-fn-or-const-tests.cert on 23-Sep-2022 19:28:03 Built /build/acl2-8.3dfsg/books/kestrel/std/system/add-suffix-to-fn-or-const-tests.cert (3.204s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/all-non-gv-exec-ffn-symbs-tests.cert on 23-Sep-2022 19:28:06 Built /build/acl2-8.3dfsg/books/kestrel/std/system/all-non-gv-exec-ffn-symbs-tests.cert (3.221s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/check-lambda-call-tests.cert on 23-Sep-2022 19:28:09 Built /build/acl2-8.3dfsg/books/kestrel/std/system/check-lambda-call-tests.cert (3.139s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/check-list-call-tests.cert on 23-Sep-2022 19:28:13 Built /build/acl2-8.3dfsg/books/kestrel/std/system/check-list-call-tests.cert (3.003s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/conjoin-equalities-tests.cert on 23-Sep-2022 19:28:16 Built /build/acl2-8.3dfsg/books/kestrel/std/system/conjoin-equalities-tests.cert (3.076s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/dumb-occur-var-open-tests.cert on 23-Sep-2022 19:28:19 Built /build/acl2-8.3dfsg/books/kestrel/std/system/dumb-occur-var-open-tests.cert (3.150s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/fsublis-var-tests.cert on 23-Sep-2022 19:28:22 Built /build/acl2-8.3dfsg/books/kestrel/std/system/fsublis-var-tests.cert (3.180s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/pure-raw-p.cert on 23-Sep-2022 19:28:26 Built /build/acl2-8.3dfsg/books/kestrel/std/system/pure-raw-p.cert (3.333s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/rawp.cert on 23-Sep-2022 19:28:29 Built /build/acl2-8.3dfsg/books/kestrel/std/system/rawp.cert (3.659s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/included-books-tests.cert on 23-Sep-2022 19:28:33 Built /build/acl2-8.3dfsg/books/kestrel/std/system/included-books-tests.cert (2.803s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/known-packages-tests.cert on 23-Sep-2022 19:28:36 Built /build/acl2-8.3dfsg/books/kestrel/std/system/known-packages-tests.cert (3.211s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/lambda-closedp-tests.cert on 23-Sep-2022 19:28:39 Built /build/acl2-8.3dfsg/books/kestrel/std/system/lambda-closedp-tests.cert (3.203s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/lambdap-tests.cert on 23-Sep-2022 19:28:43 Built /build/acl2-8.3dfsg/books/kestrel/std/system/lambdap-tests.cert (3.234s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/logical-name-listp-tests.cert on 23-Sep-2022 19:28:46 Built /build/acl2-8.3dfsg/books/kestrel/std/system/logical-name-listp-tests.cert (3.067s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/make-mv-let-call-tests.cert on 23-Sep-2022 19:28:49 Built /build/acl2-8.3dfsg/books/kestrel/std/system/make-mv-let-call-tests.cert (3.075s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/make-mv-nth-calls-tests.cert on 23-Sep-2022 19:28:52 Built /build/acl2-8.3dfsg/books/kestrel/std/system/make-mv-nth-calls-tests.cert (3.179s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/maybe-pseudo-event-formp-tests.cert on 23-Sep-2022 19:28:56 Built /build/acl2-8.3dfsg/books/kestrel/std/system/maybe-pseudo-event-formp-tests.cert (3.120s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/pseudo-tests-and-callp-tests.cert on 23-Sep-2022 19:28:59 Built /build/acl2-8.3dfsg/books/kestrel/std/system/pseudo-tests-and-callp-tests.cert (3.070s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/pure-raw-p-tests.cert on 23-Sep-2022 19:29:02 Built /build/acl2-8.3dfsg/books/kestrel/std/system/pure-raw-p-tests.cert (3.086s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/quote-term-tests.cert on 23-Sep-2022 19:29:06 Built /build/acl2-8.3dfsg/books/kestrel/std/system/quote-term-tests.cert (2.663s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/remove-dead-if-branches-tests.cert on 23-Sep-2022 19:29:08 Built /build/acl2-8.3dfsg/books/kestrel/std/system/remove-dead-if-branches-tests.cert (3.291s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/remove-mbe-tests.cert on 23-Sep-2022 19:29:12 Built /build/acl2-8.3dfsg/books/kestrel/std/system/remove-mbe-tests.cert (3.319s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/remove-progn-tests.cert on 23-Sep-2022 19:29:15 Built /build/acl2-8.3dfsg/books/kestrel/std/system/remove-progn-tests.cert (3.223s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/remove-trivial-vars-tests.cert on 23-Sep-2022 19:29:19 Built /build/acl2-8.3dfsg/books/kestrel/std/system/remove-trivial-vars-tests.cert (3.290s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/remove-unused-vars-tests.cert on 23-Sep-2022 19:29:22 Built /build/acl2-8.3dfsg/books/kestrel/std/system/remove-unused-vars-tests.cert (3.398s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/term-guard-obligation-tests.cert on 23-Sep-2022 19:29:26 Built /build/acl2-8.3dfsg/books/kestrel/std/system/term-guard-obligation-tests.cert (3.017s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/unquote-term-tests.cert on 23-Sep-2022 19:29:29 Built /build/acl2-8.3dfsg/books/kestrel/std/system/unquote-term-tests.cert (3.033s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/system/fresh-names.cert on 23-Sep-2022 19:29:32 Built /build/acl2-8.3dfsg/books/kestrel/utilities/system/fresh-names.cert (3.554s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/typed-tuples.cert on 23-Sep-2022 19:29:36 Built /build/acl2-8.3dfsg/books/kestrel/utilities/typed-tuples.cert (3.430s) Making /build/acl2-8.3dfsg/books/oslib/getpid-logic.cert on 23-Sep-2022 19:29:39 Built /build/acl2-8.3dfsg/books/oslib/getpid-logic.cert (3.851s) Making /build/acl2-8.3dfsg/books/oslib/rmtree-logic.cert on 23-Sep-2022 19:29:43 Built /build/acl2-8.3dfsg/books/oslib/rmtree-logic.cert (4.001s) Making /build/acl2-8.3dfsg/books/parsers/earley/strings.cert on 23-Sep-2022 19:29:47 Built /build/acl2-8.3dfsg/books/parsers/earley/strings.cert (5.111s) Making /build/acl2-8.3dfsg/books/projects/smtlink/trusted/z3-py/magic-fix.cert on 23-Sep-2022 19:29:53 Built /build/acl2-8.3dfsg/books/projects/smtlink/trusted/z3-py/magic-fix.cert (4.112s) Making /build/acl2-8.3dfsg/books/std/io/read-string-tests.cert on 23-Sep-2022 19:29:57 Built /build/acl2-8.3dfsg/books/std/io/read-string-tests.cert (3.353s) Making /build/acl2-8.3dfsg/books/std/stobjs/tests/1d-arr.cert on 23-Sep-2022 19:30:00 Built /build/acl2-8.3dfsg/books/std/stobjs/tests/1d-arr.cert (23.053s) Making /build/acl2-8.3dfsg/books/std/util/extensions/assert-return-thms.cert on 23-Sep-2022 19:30:24 Built /build/acl2-8.3dfsg/books/std/util/extensions/assert-return-thms.cert (3.651s) Making /build/acl2-8.3dfsg/books/std/util/maybe-defthm-tests.cert on 23-Sep-2022 19:30:27 Built /build/acl2-8.3dfsg/books/std/util/maybe-defthm-tests.cert (2.461s) Making /build/acl2-8.3dfsg/books/std/util/tests/defredundant.cert on 23-Sep-2022 19:30:30 Built /build/acl2-8.3dfsg/books/std/util/tests/defredundant.cert (4.356s) Making /build/acl2-8.3dfsg/books/system/hons-check/memoize-tests.cert on 23-Sep-2022 19:30:35 Built /build/acl2-8.3dfsg/books/system/hons-check/memoize-tests.cert (345.629s) Making /build/acl2-8.3dfsg/books/tools/stobj-frame.cert on 23-Sep-2022 19:36:20 Built /build/acl2-8.3dfsg/books/tools/stobj-frame.cert (8.222s) Making /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/sorting/quicksort.cert on 23-Sep-2022 19:36:29 Built /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/sorting/quicksort.cert (3.634s) Making /build/acl2-8.3dfsg/books/workshops/2003/schmaltz-borrione/support/predicates.cert on 23-Sep-2022 19:36:32 Built /build/acl2-8.3dfsg/books/workshops/2003/schmaltz-borrione/support/predicates.cert (3.612s) Making /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/node.cert on 23-Sep-2022 19:36:36 Built /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/node.cert (10.113s) Making /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/intersect.cert on 23-Sep-2022 19:36:46 Built /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/intersect.cert (3.462s) Making /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/trip_book.cert on 23-Sep-2022 19:36:50 Built /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/trip_book.cert (11.379s) Making /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/routing_local_lemmas.cert on 23-Sep-2022 19:37:02 Tick Built /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/routing_local_lemmas.cert (308.711s) Making /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/scheduler_book.cert on 23-Sep-2022 19:42:11 Built /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/scheduler_book.cert (3.910s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/vector-comp-canon.cert on 23-Sep-2022 19:42:15 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/vector-comp-canon.cert (2.988s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/list-defthms-help.cert on 23-Sep-2022 19:42:18 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/list-defthms-help.cert (2.913s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/append-defthms-help.cert on 23-Sep-2022 19:42:21 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/append-defthms-help.cert (2.608s) Making /build/acl2-8.3dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-types.cert on 23-Sep-2022 19:42:24 Built /build/acl2-8.3dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-types.cert (7.293s) Making /build/acl2-8.3dfsg/books/workshops/2007/cowles-et-al/support/greve/while.cert on 23-Sep-2022 19:42:31 Built /build/acl2-8.3dfsg/books/workshops/2007/cowles-et-al/support/greve/while.cert (8.858s) Making /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/raw.cert on 23-Sep-2022 19:42:40 Built /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/raw.cert (3.148s) Making /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/redefun.cert on 23-Sep-2022 19:42:43 Built /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/redefun.cert (3.499s) Making /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/bridge.cert on 23-Sep-2022 19:42:47 Built /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/bridge.cert (2.839s) Making /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/subsumption.cert on 23-Sep-2022 19:42:50 Built /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/subsumption.cert (3.339s) Making /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/table-guard.cert on 23-Sep-2022 19:42:53 Built /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/table-guard.cert (13.781s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-types.cert on 23-Sep-2022 19:43:07 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-types.cert (7.704s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/interfaces/bi-phi-m.cert on 23-Sep-2022 19:43:15 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/interfaces/bi-phi-m.cert (10.879s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/octagon-routing/routing_local_lemmas.cert on 23-Sep-2022 19:43:26 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/octagon-routing/routing_local_lemmas.cert (273.504s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/scheduling/intersect.cert on 23-Sep-2022 19:48:00 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/scheduling/intersect.cert (3.037s) Making /build/acl2-8.3dfsg/books/workshops/2009/kaufmann-kornerup-reitblatt/support/gauss.cert on 23-Sep-2022 19:48:03 Built /build/acl2-8.3dfsg/books/workshops/2009/kaufmann-kornerup-reitblatt/support/gauss.cert (2.489s) Making /build/acl2-8.3dfsg/books/workshops/2009/verbeek-schmaltz/verbeek/generic-modules/GeNoC-types.cert on 23-Sep-2022 19:48:06 Built /build/acl2-8.3dfsg/books/workshops/2009/verbeek-schmaltz/verbeek/generic-modules/GeNoC-types.cert (11.465s) Making /build/acl2-8.3dfsg/books/workshops/2009/verbeek-schmaltz/verbeek/instantiations/scheduling/circuit-switching-global/intersect.cert on 23-Sep-2022 19:48:17 Built /build/acl2-8.3dfsg/books/workshops/2009/verbeek-schmaltz/verbeek/instantiations/scheduling/circuit-switching-global/intersect.cert (2.971s) Making /build/acl2-8.3dfsg/books/workshops/2011/verbeek-schmaltz/sources/GeNoC-types.pcert0 on 23-Sep-2022 19:48:21 Built /build/acl2-8.3dfsg/books/workshops/2011/verbeek-schmaltz/sources/GeNoC-types.pcert0 (11.722s) Making /build/acl2-8.3dfsg/books/workshops/2013/van-gastel-schmaltz/books/akeys.cert on 23-Sep-2022 19:48:32 Built /build/acl2-8.3dfsg/books/workshops/2013/van-gastel-schmaltz/books/akeys.cert (2.535s) Making /build/acl2-8.3dfsg/books/workshops/2020/sswords-mutual-ind/example.cert on 23-Sep-2022 19:48:35 Built /build/acl2-8.3dfsg/books/workshops/2020/sswords-mutual-ind/example.cert (4.919s) Making /build/acl2-8.3dfsg/books/arithmetic/inequalities.cert on 23-Sep-2022 19:48:40 Built /build/acl2-8.3dfsg/books/arithmetic/inequalities.cert (3.317s) Making /build/acl2-8.3dfsg/books/std/lists/take.cert on 23-Sep-2022 19:48:44 Built /build/acl2-8.3dfsg/books/std/lists/take.cert (4.288s) Making /build/acl2-8.3dfsg/books/meta/meta.cert on 23-Sep-2022 19:48:48 Built /build/acl2-8.3dfsg/books/meta/meta.cert (2.537s) Making /build/acl2-8.3dfsg/books/std/testing/eval.cert on 23-Sep-2022 19:48:51 Built /build/acl2-8.3dfsg/books/std/testing/eval.cert (2.648s) Making /build/acl2-8.3dfsg/books/std/lists/rcons.cert on 23-Sep-2022 19:48:54 Built /build/acl2-8.3dfsg/books/std/lists/rcons.cert (2.919s) Making /build/acl2-8.3dfsg/books/std/lists/duplicity.cert on 23-Sep-2022 19:48:57 Built /build/acl2-8.3dfsg/books/std/lists/duplicity.cert (3.405s) Making /build/acl2-8.3dfsg/books/std/lists/nth.cert on 23-Sep-2022 19:49:00 Built /build/acl2-8.3dfsg/books/std/lists/nth.cert (5.972s) Making /build/acl2-8.3dfsg/books/std/lists/prefixp.cert on 23-Sep-2022 19:49:06 Built /build/acl2-8.3dfsg/books/std/lists/prefixp.cert (3.438s) Making /build/acl2-8.3dfsg/books/std/strings/make-character-list.cert on 23-Sep-2022 19:49:10 Built /build/acl2-8.3dfsg/books/std/strings/make-character-list.cert (3.696s) Making /build/acl2-8.3dfsg/books/std/lists/subseq.cert on 23-Sep-2022 19:49:14 Built /build/acl2-8.3dfsg/books/std/lists/subseq.cert (2.783s) Making /build/acl2-8.3dfsg/books/std/lists/update-nth.cert on 23-Sep-2022 19:49:17 Built /build/acl2-8.3dfsg/books/std/lists/update-nth.cert (5.107s) Making /build/acl2-8.3dfsg/books/std/alists/alistp.cert on 23-Sep-2022 19:49:22 Built /build/acl2-8.3dfsg/books/std/alists/alistp.cert (2.979s) Making /build/acl2-8.3dfsg/books/std/alists/alists-compatible.cert on 23-Sep-2022 19:49:25 Built /build/acl2-8.3dfsg/books/std/alists/alists-compatible.cert (4.657s) Making /build/acl2-8.3dfsg/books/std/alists/fast-alist-clean.cert on 23-Sep-2022 19:49:30 Built /build/acl2-8.3dfsg/books/std/alists/fast-alist-clean.cert (4.083s) Making /build/acl2-8.3dfsg/books/std/alists/strip-cars.cert on 23-Sep-2022 19:49:34 Built /build/acl2-8.3dfsg/books/std/alists/strip-cars.cert (3.159s) Making /build/acl2-8.3dfsg/books/std/alists/strip-cdrs.cert on 23-Sep-2022 19:49:38 Built /build/acl2-8.3dfsg/books/std/alists/strip-cdrs.cert (3.066s) Making /build/acl2-8.3dfsg/books/std/alists/pairlis.cert on 23-Sep-2022 19:49:41 Built /build/acl2-8.3dfsg/books/std/alists/pairlis.cert (2.766s) Making /build/acl2-8.3dfsg/books/std/util/deflist-base.cert on 23-Sep-2022 19:49:44 Built /build/acl2-8.3dfsg/books/std/util/deflist-base.cert (9.112s) Making /build/acl2-8.3dfsg/books/std/lists/butlast.cert on 23-Sep-2022 19:49:53 Built /build/acl2-8.3dfsg/books/std/lists/butlast.cert (3.153s) Making /build/acl2-8.3dfsg/books/xdoc/names.cert on 23-Sep-2022 19:49:56 Built /build/acl2-8.3dfsg/books/xdoc/names.cert (5.569s) Making /build/acl2-8.3dfsg/books/clause-processors/meta-extract-user.cert on 23-Sep-2022 19:50:02 Built /build/acl2-8.3dfsg/books/clause-processors/meta-extract-user.cert (22.419s) Making /build/acl2-8.3dfsg/books/centaur/fty/fixequiv.cert on 23-Sep-2022 19:50:25 Built /build/acl2-8.3dfsg/books/centaur/fty/fixequiv.cert (12.089s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/alistof.cert on 23-Sep-2022 19:50:37 Built /build/acl2-8.3dfsg/books/acl2s/defdata/alistof.cert (5.229s) Making /build/acl2-8.3dfsg/books/acl2s/defdata/register-type.cert on 23-Sep-2022 19:50:42 Built /build/acl2-8.3dfsg/books/acl2s/defdata/register-type.cert (5.233s) Making /build/acl2-8.3dfsg/books/misc/hons-help2.cert on 23-Sep-2022 19:50:48 Built /build/acl2-8.3dfsg/books/misc/hons-help2.cert (4.122s) Making /build/acl2-8.3dfsg/books/centaur/misc/alist-defs.cert on 23-Sep-2022 19:50:52 Built /build/acl2-8.3dfsg/books/centaur/misc/alist-defs.cert (4.400s) Making /build/acl2-8.3dfsg/books/centaur/nrev/pure.cert on 23-Sep-2022 19:50:57 Built /build/acl2-8.3dfsg/books/centaur/nrev/pure.cert (8.506s) Making /build/acl2-8.3dfsg/books/std/util/defalist-base.cert on 23-Sep-2022 19:51:05 Built /build/acl2-8.3dfsg/books/std/util/defalist-base.cert (10.709s) Making /build/acl2-8.3dfsg/books/centaur/fty/docgen.cert on 23-Sep-2022 19:51:16 Built /build/acl2-8.3dfsg/books/centaur/fty/docgen.cert (14.320s) Making /build/acl2-8.3dfsg/books/centaur/fty/fty-sum.cert on 23-Sep-2022 19:51:31 Built /build/acl2-8.3dfsg/books/centaur/fty/fty-sum.cert (23.973s) Making /build/acl2-8.3dfsg/books/centaur/fty/fty-alist.cert on 23-Sep-2022 19:51:55 Built /build/acl2-8.3dfsg/books/centaur/fty/fty-alist.cert (10.772s) Making /build/acl2-8.3dfsg/books/centaur/fty/fty-list.cert on 23-Sep-2022 19:52:06 Built /build/acl2-8.3dfsg/books/centaur/fty/fty-list.cert (8.614s) Making /build/acl2-8.3dfsg/books/centaur/fty/fty-transsum.cert on 23-Sep-2022 19:52:15 Built /build/acl2-8.3dfsg/books/centaur/fty/fty-transsum.cert (10.010s) Making /build/acl2-8.3dfsg/books/centaur/fty/fty-sugar.cert on 23-Sep-2022 19:52:25 Built /build/acl2-8.3dfsg/books/centaur/fty/fty-sugar.cert (18.055s) Making /build/acl2-8.3dfsg/books/centaur/vl2014/util/cw-unformatted.cert on 23-Sep-2022 19:52:43 Built /build/acl2-8.3dfsg/books/centaur/vl2014/util/cw-unformatted.cert (3.076s) Making /build/acl2-8.3dfsg/books/centaur/misc/evaluator-metatheorems.cert on 23-Sep-2022 19:52:46 Built /build/acl2-8.3dfsg/books/centaur/misc/evaluator-metatheorems.cert (15.628s) Making /build/acl2-8.3dfsg/books/centaur/fgl/ubdd.cert on 23-Sep-2022 19:53:02 Built /build/acl2-8.3dfsg/books/centaur/fgl/ubdd.cert (26.255s) Making /build/acl2-8.3dfsg/books/clause-processors/pseudo-term-fty.cert on 23-Sep-2022 19:53:28 Built /build/acl2-8.3dfsg/books/clause-processors/pseudo-term-fty.cert (22.104s) Making /build/acl2-8.3dfsg/books/centaur/meta/pseudo-rewrite-rule.cert on 23-Sep-2022 19:53:51 Built /build/acl2-8.3dfsg/books/centaur/meta/pseudo-rewrite-rule.cert (5.258s) Making /build/acl2-8.3dfsg/books/centaur/meta/def-formula-checks.cert on 23-Sep-2022 19:53:56 Built /build/acl2-8.3dfsg/books/centaur/meta/def-formula-checks.cert (7.272s) Making /build/acl2-8.3dfsg/books/centaur/fgl/subst-functions.cert on 23-Sep-2022 19:54:03 Built /build/acl2-8.3dfsg/books/centaur/fgl/subst-functions.cert (14.878s) Making /build/acl2-8.3dfsg/books/centaur/meta/reconstruct.cert on 23-Sep-2022 19:54:19 Built /build/acl2-8.3dfsg/books/centaur/meta/reconstruct.cert (4.510s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/nrev.cert on 23-Sep-2022 19:54:23 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/nrev.cert (6.589s) Making /build/acl2-8.3dfsg/books/std/strings/printtree-fty.cert on 23-Sep-2022 19:54:30 Built /build/acl2-8.3dfsg/books/std/strings/printtree-fty.cert (4.008s) Making /build/acl2-8.3dfsg/books/centaur/gl/defthm-using-gl.cert on 23-Sep-2022 19:54:34 Built /build/acl2-8.3dfsg/books/centaur/gl/defthm-using-gl.cert (3.645s) Making /build/acl2-8.3dfsg/books/centaur/gl/rewrite-tables.cert on 23-Sep-2022 19:54:38 Built /build/acl2-8.3dfsg/books/centaur/gl/rewrite-tables.cert (8.678s) Making /build/acl2-8.3dfsg/books/oslib/lisptype.cert on 23-Sep-2022 19:54:47 Built /build/acl2-8.3dfsg/books/oslib/lisptype.cert (4.992s) Making /build/acl2-8.3dfsg/books/centaur/nrev/fast.cert on 23-Sep-2022 19:54:52 Built /build/acl2-8.3dfsg/books/centaur/nrev/fast.cert (4.625s) Making /build/acl2-8.3dfsg/books/xdoc/autolink.cert on 23-Sep-2022 19:54:57 Built /build/acl2-8.3dfsg/books/xdoc/autolink.cert (6.931s) Making /build/acl2-8.3dfsg/books/clause-processors/equality-tests.cert on 23-Sep-2022 19:55:04 Built /build/acl2-8.3dfsg/books/clause-processors/equality-tests.cert (2.426s) Making /build/acl2-8.3dfsg/books/coi/util/defun.cert on 23-Sep-2022 19:55:06 Built /build/acl2-8.3dfsg/books/coi/util/defun.cert (6.986s) Making /build/acl2-8.3dfsg/books/coi/osets/sort.cert on 23-Sep-2022 19:55:14 Built /build/acl2-8.3dfsg/books/coi/osets/sort.cert (3.895s) Making /build/acl2-8.3dfsg/books/coi/util/extra-info-test.cert on 23-Sep-2022 19:55:18 Built /build/acl2-8.3dfsg/books/coi/util/extra-info-test.cert (2.905s) Making /build/acl2-8.3dfsg/books/data-structures/alist-theory.cert on 23-Sep-2022 19:55:21 Built /build/acl2-8.3dfsg/books/data-structures/alist-theory.cert (2.963s) Making /build/acl2-8.3dfsg/books/data-structures/list-theory.cert on 23-Sep-2022 19:55:24 Built /build/acl2-8.3dfsg/books/data-structures/list-theory.cert (2.852s) Making /build/acl2-8.3dfsg/books/data-structures/number-list-defthms.cert on 23-Sep-2022 19:55:27 Built /build/acl2-8.3dfsg/books/data-structures/number-list-defthms.cert (3.466s) Making /build/acl2-8.3dfsg/books/defexec/reflexive/reflexive.cert on 23-Sep-2022 19:55:30 Built /build/acl2-8.3dfsg/books/defexec/reflexive/reflexive.cert (3.094s) Making /build/acl2-8.3dfsg/books/std/testing/top.cert on 23-Sep-2022 19:55:34 Built /build/acl2-8.3dfsg/books/std/testing/top.cert (2.884s) Making /build/acl2-8.3dfsg/books/demos/knuth-bendix-problem-1.cert on 23-Sep-2022 19:55:37 Built /build/acl2-8.3dfsg/books/demos/knuth-bendix-problem-1.cert (3.043s) Making /build/acl2-8.3dfsg/books/demos/modeling/network-state-basic.cert on 23-Sep-2022 19:55:40 Built /build/acl2-8.3dfsg/books/demos/modeling/network-state-basic.cert (5.247s) Making /build/acl2-8.3dfsg/books/demos/modeling/nondeterminism.cert on 23-Sep-2022 19:55:45 Built /build/acl2-8.3dfsg/books/demos/modeling/nondeterminism.cert (3.070s) Making /build/acl2-8.3dfsg/books/demos/parallel/fibonacci.cert on 23-Sep-2022 19:55:49 Built /build/acl2-8.3dfsg/books/demos/parallel/fibonacci.cert (5.795s) Making /build/acl2-8.3dfsg/books/demos/patterned-congruences.cert on 23-Sep-2022 19:55:54 Built /build/acl2-8.3dfsg/books/demos/patterned-congruences.cert (13.006s) Making /build/acl2-8.3dfsg/books/demos/split-types-examples.cert on 23-Sep-2022 19:56:08 Built /build/acl2-8.3dfsg/books/demos/split-types-examples.cert (3.987s) Making /build/acl2-8.3dfsg/books/hints/basic-tests.cert on 23-Sep-2022 19:56:12 Built /build/acl2-8.3dfsg/books/hints/basic-tests.cert (8.780s) Making /build/acl2-8.3dfsg/books/hints/merge-hint.cert on 23-Sep-2022 19:56:21 Built /build/acl2-8.3dfsg/books/hints/merge-hint.cert (6.051s) Making /build/acl2-8.3dfsg/books/hints/huet-lang-algorithm-tests.cert on 23-Sep-2022 19:56:27 Built /build/acl2-8.3dfsg/books/hints/huet-lang-algorithm-tests.cert (4.546s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/pseudo-termfnp.cert on 23-Sep-2022 19:56:32 Built /build/acl2-8.3dfsg/books/kestrel/std/system/pseudo-termfnp.cert (3.552s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/fresh-logical-name-with-dollars-suffix.cert on 23-Sep-2022 19:56:35 Built /build/acl2-8.3dfsg/books/kestrel/std/system/fresh-logical-name-with-dollars-suffix.cert (3.869s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/user-interface.cert on 23-Sep-2022 19:56:39 Built /build/acl2-8.3dfsg/books/kestrel/utilities/user-interface.cert (4.796s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/all-non-gv-ffn-symbs.cert on 23-Sep-2022 19:56:44 Built /build/acl2-8.3dfsg/books/kestrel/std/system/all-non-gv-ffn-symbs.cert (4.380s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/apply-term.cert on 23-Sep-2022 19:56:49 Built /build/acl2-8.3dfsg/books/kestrel/std/system/apply-term.cert (3.627s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/check-user-lambda.cert on 23-Sep-2022 19:56:53 Built /build/acl2-8.3dfsg/books/kestrel/std/system/check-user-lambda.cert (3.854s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/fapply-term.cert on 23-Sep-2022 19:56:57 Built /build/acl2-8.3dfsg/books/kestrel/std/system/fapply-term.cert (3.687s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/termfnp.cert on 23-Sep-2022 19:57:00 Built /build/acl2-8.3dfsg/books/kestrel/std/system/termfnp.cert (3.910s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/arity-plus.cert on 23-Sep-2022 19:57:05 Built /build/acl2-8.3dfsg/books/kestrel/std/system/arity-plus.cert (3.602s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/classes-plus.cert on 23-Sep-2022 19:57:08 Built /build/acl2-8.3dfsg/books/kestrel/std/system/classes-plus.cert (3.888s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/definedp-plus.cert on 23-Sep-2022 19:57:12 Built /build/acl2-8.3dfsg/books/kestrel/std/system/definedp-plus.cert (3.830s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/formals-plus.cert on 23-Sep-2022 19:57:16 Built /build/acl2-8.3dfsg/books/kestrel/std/system/formals-plus.cert (3.591s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/fundef-enabledp.cert on 23-Sep-2022 19:57:20 Built /build/acl2-8.3dfsg/books/kestrel/std/system/fundef-enabledp.cert (3.262s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/irecursivep-plus.cert on 23-Sep-2022 19:57:23 Built /build/acl2-8.3dfsg/books/kestrel/std/system/irecursivep-plus.cert (3.652s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/known-packages-plus.cert on 23-Sep-2022 19:57:27 Built /build/acl2-8.3dfsg/books/kestrel/std/system/known-packages-plus.cert (3.539s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/macro-args-plus.cert on 23-Sep-2022 19:57:31 Built /build/acl2-8.3dfsg/books/kestrel/std/system/macro-args-plus.cert (3.610s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/macro-namep.cert on 23-Sep-2022 19:57:35 Built /build/acl2-8.3dfsg/books/kestrel/std/system/macro-namep.cert (3.346s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/measure-plus.cert on 23-Sep-2022 19:57:38 Built /build/acl2-8.3dfsg/books/kestrel/std/system/measure-plus.cert (3.890s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/measured-subset-plus.cert on 23-Sep-2022 19:57:42 Built /build/acl2-8.3dfsg/books/kestrel/std/system/measured-subset-plus.cert (3.872s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/no-stobjs-p-plus.cert on 23-Sep-2022 19:57:46 Built /build/acl2-8.3dfsg/books/kestrel/std/system/no-stobjs-p-plus.cert (3.794s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/number-of-results-plus.cert on 23-Sep-2022 19:57:50 Built /build/acl2-8.3dfsg/books/kestrel/std/system/number-of-results-plus.cert (3.925s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/primitivep-plus.cert on 23-Sep-2022 19:57:54 Built /build/acl2-8.3dfsg/books/kestrel/std/system/primitivep-plus.cert (3.801s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/ruler-extenders-plus.cert on 23-Sep-2022 19:57:58 Built /build/acl2-8.3dfsg/books/kestrel/std/system/ruler-extenders-plus.cert (3.759s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/rune-enabledp.cert on 23-Sep-2022 19:58:02 Built /build/acl2-8.3dfsg/books/kestrel/std/system/rune-enabledp.cert (3.340s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/uguard.cert on 23-Sep-2022 19:58:06 Built /build/acl2-8.3dfsg/books/kestrel/std/system/uguard.cert (3.205s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/well-founded-relation-plus.cert on 23-Sep-2022 19:58:09 Built /build/acl2-8.3dfsg/books/kestrel/std/system/well-founded-relation-plus.cert (3.684s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/install-not-normalized-event.cert on 23-Sep-2022 19:58:13 Built /build/acl2-8.3dfsg/books/kestrel/std/system/install-not-normalized-event.cert (4.089s) Making /build/acl2-8.3dfsg/books/kestrel/apt/casesplit-template.cert on 23-Sep-2022 19:58:17 Built /build/acl2-8.3dfsg/books/kestrel/apt/casesplit-template.cert (2.555s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/apply-fn-into-ifs.cert on 23-Sep-2022 19:58:20 Built /build/acl2-8.3dfsg/books/kestrel/std/system/apply-fn-into-ifs.cert (3.973s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/quote-term-list.cert on 23-Sep-2022 19:58:24 Built /build/acl2-8.3dfsg/books/kestrel/std/system/quote-term-list.cert (3.326s) Making /build/acl2-8.3dfsg/books/kestrel/apt/utilities/defaults-table.cert on 23-Sep-2022 19:58:27 Built /build/acl2-8.3dfsg/books/kestrel/apt/utilities/defaults-table.cert (3.940s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/copy-def.cert on 23-Sep-2022 19:58:31 Built /build/acl2-8.3dfsg/books/kestrel/utilities/copy-def.cert (7.513s) Making /build/acl2-8.3dfsg/books/kestrel/apt/parteval-template.cert on 23-Sep-2022 19:58:39 Built /build/acl2-8.3dfsg/books/kestrel/apt/parteval-template.cert (2.477s) Making /build/acl2-8.3dfsg/books/kestrel/library-wrappers/arithmetic-inequalities.cert on 23-Sep-2022 19:58:42 Built /build/acl2-8.3dfsg/books/kestrel/library-wrappers/arithmetic-inequalities.cert (2.737s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/lists/index-of-theorems.cert on 23-Sep-2022 19:58:45 Built /build/acl2-8.3dfsg/books/kestrel/utilities/lists/index-of-theorems.cert (2.947s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/lists/prefixp-theorems.cert on 23-Sep-2022 19:58:48 Built /build/acl2-8.3dfsg/books/kestrel/utilities/lists/prefixp-theorems.cert (3.982s) Making /build/acl2-8.3dfsg/books/kestrel/java/aij/assumptions.cert on 23-Sep-2022 19:58:52 Built /build/acl2-8.3dfsg/books/kestrel/java/aij/assumptions.cert (3.491s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/check-nary-lambda-call.cert on 23-Sep-2022 19:58:55 Built /build/acl2-8.3dfsg/books/kestrel/std/system/check-nary-lambda-call.cert (4.086s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/term-possible-numbers-of-results.cert on 23-Sep-2022 19:59:00 Built /build/acl2-8.3dfsg/books/kestrel/std/system/term-possible-numbers-of-results.cert (4.531s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/testing.cert on 23-Sep-2022 19:59:04 Built /build/acl2-8.3dfsg/books/kestrel/utilities/testing.cert (2.810s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/all-non-gv-ffn-symbs-tests.cert on 23-Sep-2022 19:59:07 Built /build/acl2-8.3dfsg/books/kestrel/std/system/all-non-gv-ffn-symbs-tests.cert (3.227s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/apply-fn-into-ifs-tests.cert on 23-Sep-2022 19:59:11 Built /build/acl2-8.3dfsg/books/kestrel/std/system/apply-fn-into-ifs-tests.cert (3.281s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/apply-term-tests.cert on 23-Sep-2022 19:59:14 Built /build/acl2-8.3dfsg/books/kestrel/std/system/apply-term-tests.cert (3.210s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/arity-plus-tests.cert on 23-Sep-2022 19:59:18 Built /build/acl2-8.3dfsg/books/kestrel/std/system/arity-plus-tests.cert (3.231s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/check-nary-lambda-call-tests.cert on 23-Sep-2022 19:59:21 Built /build/acl2-8.3dfsg/books/kestrel/std/system/check-nary-lambda-call-tests.cert (3.282s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/check-user-lambda-tests.cert on 23-Sep-2022 19:59:24 Built /build/acl2-8.3dfsg/books/kestrel/std/system/check-user-lambda-tests.cert (3.374s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/check-user-term-tests.cert on 23-Sep-2022 19:59:28 Built /build/acl2-8.3dfsg/books/kestrel/std/system/check-user-term-tests.cert (3.469s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/classes-plus-tests.cert on 23-Sep-2022 19:59:32 Built /build/acl2-8.3dfsg/books/kestrel/std/system/classes-plus-tests.cert (3.465s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/classes-tests.cert on 23-Sep-2022 19:59:35 Built /build/acl2-8.3dfsg/books/kestrel/std/system/classes-tests.cert (3.205s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/defchoose-queries-tests.cert on 23-Sep-2022 19:59:39 Built /build/acl2-8.3dfsg/books/kestrel/std/system/defchoose-queries-tests.cert (3.544s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/definedp-plus-tests.cert on 23-Sep-2022 19:59:42 Built /build/acl2-8.3dfsg/books/kestrel/std/system/definedp-plus-tests.cert (3.422s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/definedp-tests.cert on 23-Sep-2022 19:59:46 Built /build/acl2-8.3dfsg/books/kestrel/std/system/definedp-tests.cert (3.459s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/event-landmark-names-tests.cert on 23-Sep-2022 19:59:49 Built /build/acl2-8.3dfsg/books/kestrel/std/system/event-landmark-names-tests.cert (3.464s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/fapply-term-tests.cert on 23-Sep-2022 19:59:53 Built /build/acl2-8.3dfsg/books/kestrel/std/system/fapply-term-tests.cert (3.254s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/formals-plus-tests.cert on 23-Sep-2022 19:59:56 Built /build/acl2-8.3dfsg/books/kestrel/std/system/formals-plus-tests.cert (3.320s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/fresh-logical-name-with-dollars-suffix-tests.cert on 23-Sep-2022 20:00:00 Built /build/acl2-8.3dfsg/books/kestrel/std/system/fresh-logical-name-with-dollars-suffix-tests.cert (3.401s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/function-namep-tests.cert on 23-Sep-2022 20:00:03 Built /build/acl2-8.3dfsg/books/kestrel/std/system/function-namep-tests.cert (3.295s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/fundef-disabledp-tests.cert on 23-Sep-2022 20:00:07 Built /build/acl2-8.3dfsg/books/kestrel/std/system/fundef-disabledp-tests.cert (3.228s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/fundef-enabledp-tests.cert on 23-Sep-2022 20:00:10 Built /build/acl2-8.3dfsg/books/kestrel/std/system/fundef-enabledp-tests.cert (3.053s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/guard-verified-exec-fnsp-tests.cert on 23-Sep-2022 20:00:13 Built /build/acl2-8.3dfsg/books/kestrel/std/system/guard-verified-exec-fnsp-tests.cert (3.258s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/guard-verified-fnsp-tests.cert on 23-Sep-2022 20:00:17 Built /build/acl2-8.3dfsg/books/kestrel/std/system/guard-verified-fnsp-tests.cert (3.503s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/guard-verified-p-plus-tests.cert on 23-Sep-2022 20:00:21 Built /build/acl2-8.3dfsg/books/kestrel/std/system/guard-verified-p-plus-tests.cert (3.286s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/guard-verified-p-tests.cert on 23-Sep-2022 20:00:24 Built /build/acl2-8.3dfsg/books/kestrel/std/system/guard-verified-p-tests.cert (3.387s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/ibody-tests.cert on 23-Sep-2022 20:00:28 Built /build/acl2-8.3dfsg/books/kestrel/std/system/ibody-tests.cert (3.158s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/induction-machine-tests.cert on 23-Sep-2022 20:00:31 Built /build/acl2-8.3dfsg/books/kestrel/std/system/induction-machine-tests.cert (3.263s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/install-not-normalized-dollar.cert on 23-Sep-2022 20:00:34 Built /build/acl2-8.3dfsg/books/kestrel/std/system/install-not-normalized-dollar.cert (3.546s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/install-not-normalized-event-tests.cert on 23-Sep-2022 20:00:38 Built /build/acl2-8.3dfsg/books/kestrel/std/system/install-not-normalized-event-tests.cert (3.743s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/irecursivep-plus-tests.cert on 23-Sep-2022 20:00:42 Built /build/acl2-8.3dfsg/books/kestrel/std/system/irecursivep-plus-tests.cert (3.285s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/irecursivep-tests.cert on 23-Sep-2022 20:00:45 Built /build/acl2-8.3dfsg/books/kestrel/std/system/irecursivep-tests.cert (3.274s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/known-packages-plus-tests.cert on 23-Sep-2022 20:00:49 Built /build/acl2-8.3dfsg/books/kestrel/std/system/known-packages-plus-tests.cert (3.121s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/lambda-guard-verified-exec-fnsp-tests.cert on 23-Sep-2022 20:00:52 Built /build/acl2-8.3dfsg/books/kestrel/std/system/lambda-guard-verified-exec-fnsp-tests.cert (3.523s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/lambda-guard-verified-fnsp-tests.cert on 23-Sep-2022 20:00:56 Built /build/acl2-8.3dfsg/books/kestrel/std/system/lambda-guard-verified-fnsp-tests.cert (3.692s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/lambda-logic-fnsp-tests.cert on 23-Sep-2022 20:01:00 Built /build/acl2-8.3dfsg/books/kestrel/std/system/lambda-logic-fnsp-tests.cert (3.382s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/logic-function-namep-tests.cert on 23-Sep-2022 20:01:03 Built /build/acl2-8.3dfsg/books/kestrel/std/system/logic-function-namep-tests.cert (3.505s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/macro-args-plus-tests.cert on 23-Sep-2022 20:01:07 Built /build/acl2-8.3dfsg/books/kestrel/std/system/macro-args-plus-tests.cert (3.437s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/macro-keyword-args-tests.cert on 23-Sep-2022 20:01:10 Built /build/acl2-8.3dfsg/books/kestrel/std/system/macro-keyword-args-tests.cert (3.704s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/macro-namep-tests.cert on 23-Sep-2022 20:01:14 Built /build/acl2-8.3dfsg/books/kestrel/std/system/macro-namep-tests.cert (3.388s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/macro-required-args-tests.cert on 23-Sep-2022 20:01:18 Built /build/acl2-8.3dfsg/books/kestrel/std/system/macro-required-args-tests.cert (3.769s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/macro-symbolp-tests.cert on 23-Sep-2022 20:01:22 Built /build/acl2-8.3dfsg/books/kestrel/std/system/macro-symbolp-tests.cert (3.403s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/measure-plus-tests.cert on 23-Sep-2022 20:01:25 Built /build/acl2-8.3dfsg/books/kestrel/std/system/measure-plus-tests.cert (3.603s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/measure-tests.cert on 23-Sep-2022 20:01:29 Built /build/acl2-8.3dfsg/books/kestrel/std/system/measure-tests.cert (3.318s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/measured-subset-plus-tests.cert on 23-Sep-2022 20:01:33 Built /build/acl2-8.3dfsg/books/kestrel/std/system/measured-subset-plus-tests.cert (3.478s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/measured-subset-tests.cert on 23-Sep-2022 20:01:36 Built /build/acl2-8.3dfsg/books/kestrel/std/system/measured-subset-tests.cert (3.420s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/no-stobjs-p-plus-tests.cert on 23-Sep-2022 20:01:40 Built /build/acl2-8.3dfsg/books/kestrel/std/system/no-stobjs-p-plus-tests.cert (3.501s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/no-stobjs-p-tests.cert on 23-Sep-2022 20:01:43 Built /build/acl2-8.3dfsg/books/kestrel/std/system/no-stobjs-p-tests.cert (3.294s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/non-executablep-plus-tests.cert on 23-Sep-2022 20:01:47 Built /build/acl2-8.3dfsg/books/kestrel/std/system/non-executablep-plus-tests.cert (3.495s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/non-executablep-tests.cert on 23-Sep-2022 20:01:50 Built /build/acl2-8.3dfsg/books/kestrel/std/system/non-executablep-tests.cert (3.632s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/number-of-results-plus-tests.cert on 23-Sep-2022 20:01:54 Built /build/acl2-8.3dfsg/books/kestrel/std/system/number-of-results-plus-tests.cert (3.512s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/number-of-results-tests.cert on 23-Sep-2022 20:01:58 Built /build/acl2-8.3dfsg/books/kestrel/std/system/number-of-results-tests.cert (3.540s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/primitivep-plus-tests.cert on 23-Sep-2022 20:02:02 Built /build/acl2-8.3dfsg/books/kestrel/std/system/primitivep-plus-tests.cert (3.550s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/primitivep-tests.cert on 23-Sep-2022 20:02:05 Built /build/acl2-8.3dfsg/books/kestrel/std/system/primitivep-tests.cert (3.512s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/pseudo-lambdap-tests.cert on 23-Sep-2022 20:02:09 Built /build/acl2-8.3dfsg/books/kestrel/std/system/pseudo-lambdap-tests.cert (3.480s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/pseudo-termfnp-tests.cert on 23-Sep-2022 20:02:13 Built /build/acl2-8.3dfsg/books/kestrel/std/system/pseudo-termfnp-tests.cert (3.255s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/quote-term-list-tests.cert on 23-Sep-2022 20:02:16 Built /build/acl2-8.3dfsg/books/kestrel/std/system/quote-term-list-tests.cert (2.802s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/rawp-tests.cert on 23-Sep-2022 20:02:19 Built /build/acl2-8.3dfsg/books/kestrel/std/system/rawp-tests.cert (3.557s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/ruler-extenders-plus-tests.cert on 23-Sep-2022 20:02:23 Built /build/acl2-8.3dfsg/books/kestrel/std/system/ruler-extenders-plus-tests.cert (3.314s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/ruler-extenders-tests.cert on 23-Sep-2022 20:02:26 Built /build/acl2-8.3dfsg/books/kestrel/std/system/ruler-extenders-tests.cert (3.354s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/rune-disabledp-tests.cert on 23-Sep-2022 20:02:30 Built /build/acl2-8.3dfsg/books/kestrel/std/system/rune-disabledp-tests.cert (3.460s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/rune-enabledp-tests.cert on 23-Sep-2022 20:02:34 Built /build/acl2-8.3dfsg/books/kestrel/std/system/rune-enabledp-tests.cert (3.865s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/stobjs-in-plus-tests.cert on 23-Sep-2022 20:02:38 Built /build/acl2-8.3dfsg/books/kestrel/std/system/stobjs-in-plus-tests.cert (3.748s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/stobjs-out-plus-tests.cert on 23-Sep-2022 20:02:41 Built /build/acl2-8.3dfsg/books/kestrel/std/system/stobjs-out-plus-tests.cert (3.586s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/table-alist-plus-tests.cert on 23-Sep-2022 20:02:45 Built /build/acl2-8.3dfsg/books/kestrel/std/system/table-alist-plus-tests.cert (3.472s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/term-possible-numbers-of-results-tests.cert on 23-Sep-2022 20:02:49 Built /build/acl2-8.3dfsg/books/kestrel/std/system/term-possible-numbers-of-results-tests.cert (3.513s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/termfnp-tests.cert on 23-Sep-2022 20:02:53 Built /build/acl2-8.3dfsg/books/kestrel/std/system/termfnp-tests.cert (3.908s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/theorem-namep-tests.cert on 23-Sep-2022 20:02:57 Built /build/acl2-8.3dfsg/books/kestrel/std/system/theorem-namep-tests.cert (3.887s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/theorem-queries.cert on 23-Sep-2022 20:03:01 Built /build/acl2-8.3dfsg/books/kestrel/std/system/theorem-queries.cert (3.509s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/theorem-symbolp-tests.cert on 23-Sep-2022 20:03:04 Built /build/acl2-8.3dfsg/books/kestrel/std/system/theorem-symbolp-tests.cert (3.659s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/thm-formula-plus-tests.cert on 23-Sep-2022 20:03:08 Built /build/acl2-8.3dfsg/books/kestrel/std/system/thm-formula-plus-tests.cert (3.890s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/thm-formula-tests.cert on 23-Sep-2022 20:03:12 Built /build/acl2-8.3dfsg/books/kestrel/std/system/thm-formula-tests.cert (3.337s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/uguard-tests.cert on 23-Sep-2022 20:03:16 Built /build/acl2-8.3dfsg/books/kestrel/std/system/uguard-tests.cert (3.728s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/well-founded-relation-plus-tests.cert on 23-Sep-2022 20:03:20 Built /build/acl2-8.3dfsg/books/kestrel/std/system/well-founded-relation-plus-tests.cert (3.516s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/well-founded-relation-tests.cert on 23-Sep-2022 20:03:23 Built /build/acl2-8.3dfsg/books/kestrel/std/system/well-founded-relation-tests.cert (3.546s) Making /build/acl2-8.3dfsg/books/kestrel/std/util/defiso-proof-templates.cert on 23-Sep-2022 20:03:27 Built /build/acl2-8.3dfsg/books/kestrel/std/util/defiso-proof-templates.cert (2.857s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/auto-instance-tests.cert on 23-Sep-2022 20:03:30 Built /build/acl2-8.3dfsg/books/kestrel/utilities/auto-instance-tests.cert (3.321s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/copy-def-tests.cert on 23-Sep-2022 20:03:34 Built /build/acl2-8.3dfsg/books/kestrel/utilities/copy-def-tests.cert (3.441s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/def-constant-opener.cert on 23-Sep-2022 20:03:37 Built /build/acl2-8.3dfsg/books/kestrel/utilities/def-constant-opener.cert (4.432s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/deftest.cert on 23-Sep-2022 20:03:42 Built /build/acl2-8.3dfsg/books/kestrel/utilities/deftest.cert (3.904s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/define-sk-tests.cert on 23-Sep-2022 20:03:46 Built /build/acl2-8.3dfsg/books/kestrel/utilities/define-sk-tests.cert (11.109s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/defopeners.cert on 23-Sep-2022 20:03:57 Built /build/acl2-8.3dfsg/books/kestrel/utilities/defopeners.cert (11.550s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/deftest-tests.cert on 23-Sep-2022 20:04:09 Built /build/acl2-8.3dfsg/books/kestrel/utilities/deftest-tests.cert (3.265s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/directed-untranslate-tests.cert on 23-Sep-2022 20:04:12 Built /build/acl2-8.3dfsg/books/kestrel/utilities/directed-untranslate-tests.cert (3.393s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/doublets-tests.cert on 23-Sep-2022 20:04:16 Built /build/acl2-8.3dfsg/books/kestrel/utilities/doublets-tests.cert (2.852s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/keyword-value-lists-tests.cert on 23-Sep-2022 20:04:19 Built /build/acl2-8.3dfsg/books/kestrel/utilities/keyword-value-lists-tests.cert (3.684s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/magic-macroexpand.cert on 23-Sep-2022 20:04:23 Built /build/acl2-8.3dfsg/books/kestrel/utilities/magic-macroexpand.cert (6.150s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/make-termination-theorem-tests.cert on 23-Sep-2022 20:04:29 Built /build/acl2-8.3dfsg/books/kestrel/utilities/make-termination-theorem-tests.cert (16.741s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/maybe-unquote-tests.cert on 23-Sep-2022 20:04:46 Built /build/acl2-8.3dfsg/books/kestrel/utilities/maybe-unquote-tests.cert (3.288s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/proof-builder-macros-tests.cert on 23-Sep-2022 20:04:49 Built /build/acl2-8.3dfsg/books/kestrel/utilities/proof-builder-macros-tests.cert (3.970s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/prove-interface-tests.cert on 23-Sep-2022 20:04:53 Built /build/acl2-8.3dfsg/books/kestrel/utilities/prove-interface-tests.cert (18.297s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/system/fresh-names-tests.cert on 23-Sep-2022 20:05:12 Built /build/acl2-8.3dfsg/books/kestrel/utilities/system/fresh-names-tests.cert (3.414s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/typed-tuples-tests.cert on 23-Sep-2022 20:05:15 Built /build/acl2-8.3dfsg/books/kestrel/utilities/typed-tuples-tests.cert (3.437s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/verify-guards-program-tests.cert on 23-Sep-2022 20:05:19 Built /build/acl2-8.3dfsg/books/kestrel/utilities/verify-guards-program-tests.cert (5.235s) Making /build/acl2-8.3dfsg/books/make-event/eval-check.cert on 23-Sep-2022 20:05:24 Built /build/acl2-8.3dfsg/books/make-event/eval-check.cert (2.417s) Making /build/acl2-8.3dfsg/books/make-event/defrefine.cert on 23-Sep-2022 20:05:27 Built /build/acl2-8.3dfsg/books/make-event/defrefine.cert (5.101s) Making /build/acl2-8.3dfsg/books/make-event/eval-tests.cert on 23-Sep-2022 20:05:32 Built /build/acl2-8.3dfsg/books/make-event/eval-tests.cert (2.620s) Making /build/acl2-8.3dfsg/books/make-event/local-elided-include.cert on 23-Sep-2022 20:05:35 Built /build/acl2-8.3dfsg/books/make-event/local-elided-include.cert (2.944s) Making /build/acl2-8.3dfsg/books/make-event/local-requires-skip-check.cert on 23-Sep-2022 20:05:38 Built /build/acl2-8.3dfsg/books/make-event/local-requires-skip-check.cert (2.901s) Making /build/acl2-8.3dfsg/books/make-event/macros.cert on 23-Sep-2022 20:05:41 Built /build/acl2-8.3dfsg/books/make-event/macros.cert (3.230s) Making /build/acl2-8.3dfsg/books/make-event/macros-skip-proofs-include.cert on 23-Sep-2022 20:05:44 Built /build/acl2-8.3dfsg/books/make-event/macros-skip-proofs-include.cert (2.917s) Making /build/acl2-8.3dfsg/books/make-event/make-event-keywords-or-exp.cert on 23-Sep-2022 20:05:47 Built /build/acl2-8.3dfsg/books/make-event/make-event-keywords-or-exp.cert (4.168s) Making /build/acl2-8.3dfsg/books/make-event/portcullis-expansion.cert on 23-Sep-2022 20:05:52 Built /build/acl2-8.3dfsg/books/make-event/portcullis-expansion.cert (3.818s) Making /build/acl2-8.3dfsg/books/make-event/test-case.cert on 23-Sep-2022 20:05:56 Built /build/acl2-8.3dfsg/books/make-event/test-case.cert (2.483s) Making /build/acl2-8.3dfsg/books/misc/assert-tests.cert on 23-Sep-2022 20:05:58 Built /build/acl2-8.3dfsg/books/misc/assert-tests.cert (2.328s) Making /build/acl2-8.3dfsg/books/misc/congruent-stobjs-test.cert on 23-Sep-2022 20:06:01 Built /build/acl2-8.3dfsg/books/misc/congruent-stobjs-test.cert (15.874s) Making /build/acl2-8.3dfsg/books/misc/eval-tests.cert on 23-Sep-2022 20:06:17 Built /build/acl2-8.3dfsg/books/misc/eval-tests.cert (2.474s) Making /build/acl2-8.3dfsg/books/misc/eval.cert on 23-Sep-2022 20:06:20 Built /build/acl2-8.3dfsg/books/misc/eval.cert (2.553s) Making /build/acl2-8.3dfsg/books/misc/int-division.cert on 23-Sep-2022 20:06:22 Built /build/acl2-8.3dfsg/books/misc/int-division.cert (3.631s) Making /build/acl2-8.3dfsg/books/misc/hidden-defpkg-checks/top.cert on 23-Sep-2022 20:06:26 Built /build/acl2-8.3dfsg/books/misc/hidden-defpkg-checks/top.cert (2.613s) Making /build/acl2-8.3dfsg/books/misc/hons-tests.cert on 23-Sep-2022 20:06:29 Built /build/acl2-8.3dfsg/books/misc/hons-tests.cert (35.666s) Making /build/acl2-8.3dfsg/books/misc/install-not-normalized-tests.cert on 23-Sep-2022 20:07:05 Built /build/acl2-8.3dfsg/books/misc/install-not-normalized-tests.cert (3.197s) Making /build/acl2-8.3dfsg/books/misc/misc2/defpun-exec-domain-example.cert on 23-Sep-2022 20:07:08 Built /build/acl2-8.3dfsg/books/misc/misc2/defpun-exec-domain-example.cert (3.398s) Making /build/acl2-8.3dfsg/books/misc/misc2/ruler-extenders-tests.cert on 23-Sep-2022 20:07:12 Built /build/acl2-8.3dfsg/books/misc/misc2/ruler-extenders-tests.cert (4.920s) Making /build/acl2-8.3dfsg/books/misc/misc2/step-limits.cert on 23-Sep-2022 20:07:17 Built /build/acl2-8.3dfsg/books/misc/misc2/step-limits.cert (2.766s) Making /build/acl2-8.3dfsg/books/oslib/getpid.cert on 23-Sep-2022 20:07:20 Built /build/acl2-8.3dfsg/books/oslib/getpid.cert (5.030s) Making /build/acl2-8.3dfsg/books/oslib/tests/lisptype.cert on 23-Sep-2022 20:07:25 Built /build/acl2-8.3dfsg/books/oslib/tests/lisptype.cert (3.738s) Making /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/groundwork/array-rec.cert on 23-Sep-2022 20:07:29 Built /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/groundwork/array-rec.cert (4.498s) Making /build/acl2-8.3dfsg/books/projects/pltpa/standard-proveall-failures.cert on 23-Sep-2022 20:07:33 Built /build/acl2-8.3dfsg/books/projects/pltpa/standard-proveall-failures.cert (9.150s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/gen-helper/extra.cert on 23-Sep-2022 20:07:43 Built /build/acl2-8.3dfsg/books/projects/taspi/code/gen-helper/extra.cert (5.936s) Making /build/acl2-8.3dfsg/books/std/util/tests/define.cert on 23-Sep-2022 20:07:49 Tick Built /build/acl2-8.3dfsg/books/std/util/tests/define.cert (12.226s) Making /build/acl2-8.3dfsg/books/system/deps-pcert.cert on 23-Sep-2022 20:08:01 Built /build/acl2-8.3dfsg/books/system/deps-pcert.cert (2.223s) Making /build/acl2-8.3dfsg/books/system/parallel/hint-tests.cert on 23-Sep-2022 20:08:04 Built /build/acl2-8.3dfsg/books/system/parallel/hint-tests.cert (2.143s) Making /build/acl2-8.3dfsg/books/system/parallel/spec-mv-let.cert on 23-Sep-2022 20:08:06 Built /build/acl2-8.3dfsg/books/system/parallel/spec-mv-let.cert (2.946s) Making /build/acl2-8.3dfsg/books/system/parallel/stress-tests.cert on 23-Sep-2022 20:08:09 Built /build/acl2-8.3dfsg/books/system/parallel/stress-tests.cert (8.460s) Making /build/acl2-8.3dfsg/books/system/parallel/syntax-tests.cert on 23-Sep-2022 20:08:18 Built /build/acl2-8.3dfsg/books/system/parallel/syntax-tests.cert (6.068s) Making /build/acl2-8.3dfsg/books/system/pcert/acl2x-pcert-test-2-include.pcert0 on 23-Sep-2022 20:08:24 Built /build/acl2-8.3dfsg/books/system/pcert/acl2x-pcert-test-2-include.pcert0 (2.752s) Making /build/acl2-8.3dfsg/books/system/tests/cached-fn-inst.cert on 23-Sep-2022 20:08:27 Built /build/acl2-8.3dfsg/books/system/tests/cached-fn-inst.cert (2.554s) Making /build/acl2-8.3dfsg/books/system/tests/defstub.cert on 23-Sep-2022 20:08:30 Built /build/acl2-8.3dfsg/books/system/tests/defstub.cert (2.833s) Making /build/acl2-8.3dfsg/books/system/tests/defun-sk-tests.cert on 23-Sep-2022 20:08:33 Built /build/acl2-8.3dfsg/books/system/tests/defun-sk-tests.cert (9.581s) Making /build/acl2-8.3dfsg/books/system/tests/local-stobj.cert on 23-Sep-2022 20:08:42 Built /build/acl2-8.3dfsg/books/system/tests/local-stobj.cert (24.914s) Making /build/acl2-8.3dfsg/books/system/tests/nested-stobj-tests.cert on 23-Sep-2022 20:09:07 Built /build/acl2-8.3dfsg/books/system/tests/nested-stobj-tests.cert (29.666s) Making /build/acl2-8.3dfsg/books/system/tests/read-file-into-string.cert on 23-Sep-2022 20:09:37 Built /build/acl2-8.3dfsg/books/system/tests/read-file-into-string.cert (3.486s) Making /build/acl2-8.3dfsg/books/system/tests/swap-stobjs.cert on 23-Sep-2022 20:09:41 Built /build/acl2-8.3dfsg/books/system/tests/swap-stobjs.cert (9.970s) Making /build/acl2-8.3dfsg/books/tools/without-subsumption.cert on 23-Sep-2022 20:09:51 Built /build/acl2-8.3dfsg/books/tools/without-subsumption.cert (4.569s) Making /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/aof.cert on 23-Sep-2022 20:09:56 Built /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/aof.cert (3.999s) Making /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/collect_msg_book.cert on 23-Sep-2022 20:10:00 Built /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/collect_msg_book.cert (46.303s) Making /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/local_trip_book.cert on 23-Sep-2022 20:10:46 Built /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/local_trip_book.cert (37.228s) Making /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/routing_main.cert on 23-Sep-2022 20:11:24 Built /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/routing_main.cert (4.106s) Making /build/acl2-8.3dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-misc.cert on 23-Sep-2022 20:11:28 Built /build/acl2-8.3dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-misc.cert (10.303s) Making /build/acl2-8.3dfsg/books/workshops/2006/swords-cook/lcsoundness/LambdaCalcBasis.cert on 23-Sep-2022 20:11:38 Built /build/acl2-8.3dfsg/books/workshops/2006/swords-cook/lcsoundness/LambdaCalcBasis.cert (25.325s) Making /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/all.cert on 23-Sep-2022 20:12:04 Built /build/acl2-8.3dfsg/books/workshops/2007/dillinger-et-al/code/all.cert (3.611s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-misc.cert on 23-Sep-2022 20:12:08 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-misc.cert (10.200s) Making /build/acl2-8.3dfsg/books/workshops/2011/verbeek-schmaltz/sources/GeNoC-types.pcert1 on 23-Sep-2022 20:12:18 Built /build/acl2-8.3dfsg/books/workshops/2011/verbeek-schmaltz/sources/GeNoC-types.pcert1 (2.009s) Making /build/acl2-8.3dfsg/books/workshops/2017/coglio-kaufmann-smith/support/testing.cert on 23-Sep-2022 20:12:20 Built /build/acl2-8.3dfsg/books/workshops/2017/coglio-kaufmann-smith/support/testing.cert (3.647s) Making /build/acl2-8.3dfsg/books/workshops/2018/greve-gacek/types.cert on 23-Sep-2022 20:12:24 Built /build/acl2-8.3dfsg/books/workshops/2018/greve-gacek/types.cert (10.323s) Making /build/acl2-8.3dfsg/books/arithmetic/natp-posp.cert on 23-Sep-2022 20:12:34 Built /build/acl2-8.3dfsg/books/arithmetic/natp-posp.cert (2.741s) Making /build/acl2-8.3dfsg/books/arithmetic/mod-gcd.cert on 23-Sep-2022 20:12:37 Built /build/acl2-8.3dfsg/books/arithmetic/mod-gcd.cert (8.383s) Making /build/acl2-8.3dfsg/books/std/lists/nthcdr.cert on 23-Sep-2022 20:12:46 Built /build/acl2-8.3dfsg/books/std/lists/nthcdr.cert (3.719s) Making /build/acl2-8.3dfsg/books/std/lists/sets.cert on 23-Sep-2022 20:12:50 Built /build/acl2-8.3dfsg/books/std/lists/sets.cert (6.784s) Making /build/acl2-8.3dfsg/books/std/lists/no-duplicatesp.cert on 23-Sep-2022 20:12:57 Built /build/acl2-8.3dfsg/books/std/lists/no-duplicatesp.cert (3.793s) Making /build/acl2-8.3dfsg/books/std/strings/coerce.cert on 23-Sep-2022 20:13:01 Built /build/acl2-8.3dfsg/books/std/strings/coerce.cert (4.040s) Making /build/acl2-8.3dfsg/books/std/lists/sublistp.cert on 23-Sep-2022 20:13:05 Built /build/acl2-8.3dfsg/books/std/lists/sublistp.cert (5.853s) Making /build/acl2-8.3dfsg/books/std/alists/fal-all-boundp.cert on 23-Sep-2022 20:13:11 Built /build/acl2-8.3dfsg/books/std/alists/fal-all-boundp.cert (4.469s) Making /build/acl2-8.3dfsg/books/std/alists/fal-find-any.cert on 23-Sep-2022 20:13:16 Built /build/acl2-8.3dfsg/books/std/alists/fal-find-any.cert (4.161s) Making /build/acl2-8.3dfsg/books/std/osets/under-set-equiv.cert on 23-Sep-2022 20:13:20 Built /build/acl2-8.3dfsg/books/std/osets/under-set-equiv.cert (6.911s) Making /build/acl2-8.3dfsg/books/clause-processors/term-vars.cert on 23-Sep-2022 20:13:27 Built /build/acl2-8.3dfsg/books/clause-processors/term-vars.cert (8.304s) Making /build/acl2-8.3dfsg/books/std/util/defaggregate.cert on 23-Sep-2022 20:13:35 Built /build/acl2-8.3dfsg/books/std/util/defaggregate.cert (16.510s) Making /build/acl2-8.3dfsg/books/std/util/defprojection.cert on 23-Sep-2022 20:13:52 Built /build/acl2-8.3dfsg/books/std/util/defprojection.cert (11.521s) Making /build/acl2-8.3dfsg/books/centaur/fty/deftypes.cert on 23-Sep-2022 20:14:04 Built /build/acl2-8.3dfsg/books/centaur/fty/deftypes.cert (74.099s) Making /build/acl2-8.3dfsg/books/centaur/gl/defagg.cert on 23-Sep-2022 20:15:18 Built /build/acl2-8.3dfsg/books/centaur/gl/defagg.cert (6.566s) Making /build/acl2-8.3dfsg/books/clause-processors/eval-alist-equiv.cert on 23-Sep-2022 20:15:25 Built /build/acl2-8.3dfsg/books/clause-processors/eval-alist-equiv.cert (5.567s) Making /build/acl2-8.3dfsg/books/centaur/meta/world-equiv.cert on 23-Sep-2022 20:15:31 Built /build/acl2-8.3dfsg/books/centaur/meta/world-equiv.cert (4.505s) Making /build/acl2-8.3dfsg/books/centaur/meta/resolve-flag-cp.cert on 23-Sep-2022 20:15:35 Built /build/acl2-8.3dfsg/books/centaur/meta/resolve-flag-cp.cert (19.565s) Making /build/acl2-8.3dfsg/books/centaur/fty/tests/simple.cert on 23-Sep-2022 20:15:55 Built /build/acl2-8.3dfsg/books/centaur/fty/tests/simple.cert (15.744s) Making /build/acl2-8.3dfsg/books/centaur/fty/visitor.cert on 23-Sep-2022 20:16:11 Built /build/acl2-8.3dfsg/books/centaur/fty/visitor.cert (39.918s) Making /build/acl2-8.3dfsg/books/centaur/misc/dag-measure-thms.cert on 23-Sep-2022 20:16:51 Built /build/acl2-8.3dfsg/books/centaur/misc/dag-measure-thms.cert (14.558s) Making /build/acl2-8.3dfsg/books/centaur/misc/intern-debugging.cert on 23-Sep-2022 20:17:06 Built /build/acl2-8.3dfsg/books/centaur/misc/intern-debugging.cert (3.547s) Making /build/acl2-8.3dfsg/books/centaur/satlink/config.cert on 23-Sep-2022 20:17:09 Built /build/acl2-8.3dfsg/books/centaur/satlink/config.cert (5.914s) Making /build/acl2-8.3dfsg/books/xdoc/preprocess.cert on 23-Sep-2022 20:17:15 Built /build/acl2-8.3dfsg/books/xdoc/preprocess.cert (28.646s) Making /build/acl2-8.3dfsg/books/xdoc/parse-xml.cert on 23-Sep-2022 20:17:44 Built /build/acl2-8.3dfsg/books/xdoc/parse-xml.cert (10.385s) Making /build/acl2-8.3dfsg/books/coi/nary/new.cert on 23-Sep-2022 20:17:55 Built /build/acl2-8.3dfsg/books/coi/nary/new.cert (6.561s) Making /build/acl2-8.3dfsg/books/data-structures/number-list-theory.cert on 23-Sep-2022 20:18:01 Built /build/acl2-8.3dfsg/books/data-structures/number-list-theory.cert (2.815s) Making /build/acl2-8.3dfsg/books/hints/consider-hint.cert on 23-Sep-2022 20:18:04 Built /build/acl2-8.3dfsg/books/hints/consider-hint.cert (8.691s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/ubody.cert on 23-Sep-2022 20:18:13 Built /build/acl2-8.3dfsg/books/kestrel/std/system/ubody.cert (3.954s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/orelse.cert on 23-Sep-2022 20:18:17 Built /build/acl2-8.3dfsg/books/kestrel/utilities/orelse.cert (4.851s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/apply-unary-to-terms.cert on 23-Sep-2022 20:18:22 Built /build/acl2-8.3dfsg/books/kestrel/std/system/apply-unary-to-terms.cert (4.060s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/fapply-unary-to-terms.cert on 23-Sep-2022 20:18:27 Built /build/acl2-8.3dfsg/books/kestrel/std/system/fapply-unary-to-terms.cert (4.614s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/induction-machine-plus.cert on 23-Sep-2022 20:18:32 Built /build/acl2-8.3dfsg/books/kestrel/std/system/induction-machine-plus.cert (3.754s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/macro-keyword-args-plus.cert on 23-Sep-2022 20:18:35 Built /build/acl2-8.3dfsg/books/kestrel/std/system/macro-keyword-args-plus.cert (4.191s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/macro-required-args-plus.cert on 23-Sep-2022 20:18:40 Built /build/acl2-8.3dfsg/books/kestrel/std/system/macro-required-args-plus.cert (3.915s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/recursive-calls.cert on 23-Sep-2022 20:18:44 Built /build/acl2-8.3dfsg/books/kestrel/std/system/recursive-calls.cert (3.765s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/ubody-plus.cert on 23-Sep-2022 20:18:48 Built /build/acl2-8.3dfsg/books/kestrel/std/system/ubody-plus.cert (3.851s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/uguard-plus.cert on 23-Sep-2022 20:18:52 Built /build/acl2-8.3dfsg/books/kestrel/std/system/uguard-plus.cert (3.787s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/unwrapped-nonexec-body.cert on 23-Sep-2022 20:18:56 Built /build/acl2-8.3dfsg/books/kestrel/std/system/unwrapped-nonexec-body.cert (3.724s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/unwrapped-nonexec-body-plus.cert on 23-Sep-2022 20:19:00 Built /build/acl2-8.3dfsg/books/kestrel/std/system/unwrapped-nonexec-body-plus.cert (4.095s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/system/paired-names.cert on 23-Sep-2022 20:19:04 Built /build/acl2-8.3dfsg/books/kestrel/utilities/system/paired-names.cert (4.596s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/mvify.cert on 23-Sep-2022 20:19:09 Built /build/acl2-8.3dfsg/books/kestrel/std/system/mvify.cert (5.385s) Making /build/acl2-8.3dfsg/books/kestrel/apt/utilities/pattern-matching-ext-support.cert on 23-Sep-2022 20:19:14 Built /build/acl2-8.3dfsg/books/kestrel/apt/utilities/pattern-matching-ext-support.cert (54.846s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/divides.cert on 23-Sep-2022 20:20:09 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/divides.cert (2.913s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/lists/nthcdr-theorems.cert on 23-Sep-2022 20:20:12 Built /build/acl2-8.3dfsg/books/kestrel/utilities/lists/nthcdr-theorems.cert (3.408s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/tail-recursive-p.cert on 23-Sep-2022 20:20:16 Built /build/acl2-8.3dfsg/books/kestrel/std/system/tail-recursive-p.cert (4.332s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/all-vars-open-tests.cert on 23-Sep-2022 20:20:20 Built /build/acl2-8.3dfsg/books/kestrel/std/system/all-vars-open-tests.cert (3.972s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/apply-unary-to-terms-tests.cert on 23-Sep-2022 20:20:25 Built /build/acl2-8.3dfsg/books/kestrel/std/system/apply-unary-to-terms-tests.cert (3.150s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/fapply-unary-to-terms-tests.cert on 23-Sep-2022 20:20:28 Built /build/acl2-8.3dfsg/books/kestrel/std/system/fapply-unary-to-terms-tests.cert (3.462s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/induction-machine-plus-tests.cert on 23-Sep-2022 20:20:31 Built /build/acl2-8.3dfsg/books/kestrel/std/system/induction-machine-plus-tests.cert (3.484s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/macro-keyword-args-plus-tests.cert on 23-Sep-2022 20:20:35 Built /build/acl2-8.3dfsg/books/kestrel/std/system/macro-keyword-args-plus-tests.cert (3.510s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/macro-queries.cert on 23-Sep-2022 20:20:39 Built /build/acl2-8.3dfsg/books/kestrel/std/system/macro-queries.cert (3.474s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/macro-required-args-plus-tests.cert on 23-Sep-2022 20:20:42 Built /build/acl2-8.3dfsg/books/kestrel/std/system/macro-required-args-plus-tests.cert (3.684s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/mvify-tests.cert on 23-Sep-2022 20:20:46 Built /build/acl2-8.3dfsg/books/kestrel/std/system/mvify-tests.cert (3.408s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/ubody-plus-tests.cert on 23-Sep-2022 20:20:50 Built /build/acl2-8.3dfsg/books/kestrel/std/system/ubody-plus-tests.cert (3.328s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/ubody-tests.cert on 23-Sep-2022 20:20:53 Built /build/acl2-8.3dfsg/books/kestrel/std/system/ubody-tests.cert (3.322s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/uguard-plus-tests.cert on 23-Sep-2022 20:20:57 Built /build/acl2-8.3dfsg/books/kestrel/std/system/uguard-plus-tests.cert (3.742s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/unwrapped-nonexec-body-plus-tests.cert on 23-Sep-2022 20:21:01 Built /build/acl2-8.3dfsg/books/kestrel/std/system/unwrapped-nonexec-body-plus-tests.cert (3.411s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/unwrapped-nonexec-body-tests.cert on 23-Sep-2022 20:21:04 Built /build/acl2-8.3dfsg/books/kestrel/std/system/unwrapped-nonexec-body-tests.cert (3.461s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/def-constant-opener-tests.cert on 23-Sep-2022 20:21:08 Built /build/acl2-8.3dfsg/books/kestrel/utilities/def-constant-opener-tests.cert (4.036s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/defopeners-tests.cert on 23-Sep-2022 20:21:12 Built /build/acl2-8.3dfsg/books/kestrel/utilities/defopeners-tests.cert (4.210s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/system/paired-names-tests.cert on 23-Sep-2022 20:21:16 Built /build/acl2-8.3dfsg/books/kestrel/utilities/system/paired-names-tests.cert (3.805s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/user-interface-tests.cert on 23-Sep-2022 20:21:20 Built /build/acl2-8.3dfsg/books/kestrel/utilities/user-interface-tests.cert (4.332s) Making /build/acl2-8.3dfsg/books/make-event/assert-check.cert on 23-Sep-2022 20:21:25 Built /build/acl2-8.3dfsg/books/make-event/assert-check.cert (6.586s) Making /build/acl2-8.3dfsg/books/make-event/eval-check-tests.cert on 23-Sep-2022 20:21:32 Built /build/acl2-8.3dfsg/books/make-event/eval-check-tests.cert (2.705s) Making /build/acl2-8.3dfsg/books/make-event/local-requires-skip-check-include.cert on 23-Sep-2022 20:21:35 Built /build/acl2-8.3dfsg/books/make-event/local-requires-skip-check-include.cert (2.648s) Making /build/acl2-8.3dfsg/books/make-event/macros-include.cert on 23-Sep-2022 20:21:37 Built /build/acl2-8.3dfsg/books/make-event/macros-include.cert (2.633s) Making /build/acl2-8.3dfsg/books/make-event/make-event-keywords-or-exp-check.cert on 23-Sep-2022 20:21:40 Built /build/acl2-8.3dfsg/books/make-event/make-event-keywords-or-exp-check.cert (2.619s) Making /build/acl2-8.3dfsg/books/make-event/portcullis-expansion-include.cert on 23-Sep-2022 20:21:43 Built /build/acl2-8.3dfsg/books/make-event/portcullis-expansion-include.cert (4.262s) Making /build/acl2-8.3dfsg/books/make-event/test-case-check.cert on 23-Sep-2022 20:21:47 Built /build/acl2-8.3dfsg/books/make-event/test-case-check.cert (6.815s) Making /build/acl2-8.3dfsg/books/oslib/tests/getpid.cert on 23-Sep-2022 20:21:54 Built /build/acl2-8.3dfsg/books/oslib/tests/getpid.cert (3.351s) Making /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/groundwork/demo3.cert on 23-Sep-2022 20:21:58 Built /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/groundwork/demo3.cert (10.426s) Making /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/groundwork/demo4.cert on 23-Sep-2022 20:22:08 Built /build/acl2-8.3dfsg/books/projects/legacy-defrstobj/groundwork/demo4.cert (10.058s) Making /build/acl2-8.3dfsg/books/projects/sb-machine/portcullis.cert on 23-Sep-2022 20:22:19 Built /build/acl2-8.3dfsg/books/projects/sb-machine/portcullis.cert (5.074s) Making /build/acl2-8.3dfsg/books/projects/sb-machine/proofs/completed/portcullis.cert on 23-Sep-2022 20:22:24 Built /build/acl2-8.3dfsg/books/projects/sb-machine/proofs/completed/portcullis.cert (4.899s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/brlens/brlens.cert on 23-Sep-2022 20:22:29 Built /build/acl2-8.3dfsg/books/projects/taspi/code/brlens/brlens.cert (4.920s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/gen-trees/tree-predicates.cert on 23-Sep-2022 20:22:34 Built /build/acl2-8.3dfsg/books/projects/taspi/code/gen-trees/tree-predicates.cert (8.908s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/gen-helper/sets.cert on 23-Sep-2022 20:22:43 Built /build/acl2-8.3dfsg/books/projects/taspi/code/gen-helper/sets.cert (7.843s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/gen-helper/fast-lists.cert on 23-Sep-2022 20:22:51 Built /build/acl2-8.3dfsg/books/projects/taspi/code/gen-helper/fast-lists.cert (6.468s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/sequences/align.cert on 23-Sep-2022 20:22:58 Built /build/acl2-8.3dfsg/books/projects/taspi/code/sequences/align.cert (9.114s) Making /build/acl2-8.3dfsg/books/projects/taspi/tree-score/efficient-pscores.cert on 23-Sep-2022 20:23:07 Built /build/acl2-8.3dfsg/books/projects/taspi/tree-score/efficient-pscores.cert (9.351s) Making /build/acl2-8.3dfsg/books/std/util/tests/defprojection.cert on 23-Sep-2022 20:23:16 Built /build/acl2-8.3dfsg/books/std/util/tests/defprojection.cert (19.949s) Making /build/acl2-8.3dfsg/books/system/pcert/acl2x-pcert-test-2-include.pcert1 on 23-Sep-2022 20:23:37 Built /build/acl2-8.3dfsg/books/system/pcert/acl2x-pcert-test-2-include.pcert1 (1.612s) Making /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/simulator.cert on 23-Sep-2022 20:23:38 Built /build/acl2-8.3dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/simulator.cert (11.530s) Making /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/make_travel_list_book.cert on 23-Sep-2022 20:23:50 Built /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/make_travel_list_book.cert (6.592s) Making /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/trip_thms.cert on 23-Sep-2022 20:23:57 Built /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/trip_thms.cert (19.783s) Making /build/acl2-8.3dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-routing.cert on 23-Sep-2022 20:24:17 Built /build/acl2-8.3dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-routing.cert (3.324s) Making /build/acl2-8.3dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-scheduling.cert on 23-Sep-2022 20:24:20 Built /build/acl2-8.3dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-scheduling.cert (7.145s) Making /build/acl2-8.3dfsg/books/workshops/2006/swords-cook/lcsoundness/LambdaCalcSoundness.cert on 23-Sep-2022 20:24:27 Built /build/acl2-8.3dfsg/books/workshops/2006/swords-cook/lcsoundness/LambdaCalcSoundness.cert (29.476s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-routing.cert on 23-Sep-2022 20:24:57 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-routing.cert (3.655s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-scheduling.cert on 23-Sep-2022 20:25:01 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-scheduling.cert (7.248s) Making /build/acl2-8.3dfsg/books/workshops/2011/verbeek-schmaltz/sources/GeNoC-types.cert on 23-Sep-2022 20:25:08 Built /build/acl2-8.3dfsg/books/workshops/2011/verbeek-schmaltz/sources/GeNoC-types.cert (1.709s) Making /build/acl2-8.3dfsg/books/xdoc/tests/preprocessor-tests.cert on 23-Sep-2022 20:25:10 Built /build/acl2-8.3dfsg/books/xdoc/tests/preprocessor-tests.cert (5.867s) Making /build/acl2-8.3dfsg/books/arithmetic/rationals.cert on 23-Sep-2022 20:25:16 Built /build/acl2-8.3dfsg/books/arithmetic/rationals.cert (2.717s) Making /build/acl2-8.3dfsg/books/std/lists/repeat.cert on 23-Sep-2022 20:25:19 Built /build/acl2-8.3dfsg/books/std/lists/repeat.cert (3.343s) Making /build/acl2-8.3dfsg/books/std/lists/final-cdr.cert on 23-Sep-2022 20:25:22 Built /build/acl2-8.3dfsg/books/std/lists/final-cdr.cert (2.752s) Making /build/acl2-8.3dfsg/books/std/lists/intersection.cert on 23-Sep-2022 20:25:25 Built /build/acl2-8.3dfsg/books/std/lists/intersection.cert (4.818s) Making /build/acl2-8.3dfsg/books/std/lists/intersectp.cert on 23-Sep-2022 20:25:30 Built /build/acl2-8.3dfsg/books/std/lists/intersectp.cert (3.068s) Making /build/acl2-8.3dfsg/books/std/lists/remove.cert on 23-Sep-2022 20:25:34 Built /build/acl2-8.3dfsg/books/std/lists/remove.cert (4.824s) Making /build/acl2-8.3dfsg/books/std/lists/resize-list.cert on 23-Sep-2022 20:25:38 Built /build/acl2-8.3dfsg/books/std/lists/resize-list.cert (2.975s) Making /build/acl2-8.3dfsg/books/std/lists/reverse.cert on 23-Sep-2022 20:25:42 Built /build/acl2-8.3dfsg/books/std/lists/reverse.cert (3.817s) Making /build/acl2-8.3dfsg/books/std/lists/set-difference.cert on 23-Sep-2022 20:25:46 Built /build/acl2-8.3dfsg/books/std/lists/set-difference.cert (2.997s) Making /build/acl2-8.3dfsg/books/std/alists/top.cert on 23-Sep-2022 20:25:49 Built /build/acl2-8.3dfsg/books/std/alists/top.cert (4.316s) Making /build/acl2-8.3dfsg/books/std/osets/top.cert on 23-Sep-2022 20:25:53 Built /build/acl2-8.3dfsg/books/std/osets/top.cert (8.565s) Making /build/acl2-8.3dfsg/books/clause-processors/unify-subst.cert on 23-Sep-2022 20:26:02 Built /build/acl2-8.3dfsg/books/clause-processors/unify-subst.cert (21.043s) Making /build/acl2-8.3dfsg/books/centaur/misc/alist-equiv.cert on 23-Sep-2022 20:26:23 Built /build/acl2-8.3dfsg/books/centaur/misc/alist-equiv.cert (5.652s) Making /build/acl2-8.3dfsg/books/centaur/gl/gl-util.cert on 23-Sep-2022 20:26:29 Built /build/acl2-8.3dfsg/books/centaur/gl/gl-util.cert (10.457s) Making /build/acl2-8.3dfsg/books/clause-processors/just-expand.cert on 23-Sep-2022 20:26:40 Built /build/acl2-8.3dfsg/books/clause-processors/just-expand.cert (21.023s) Making /build/acl2-8.3dfsg/books/std/typed-lists/unsigned-byte-listp.cert on 23-Sep-2022 20:27:01 Built /build/acl2-8.3dfsg/books/std/typed-lists/unsigned-byte-listp.cert (3.240s) Making /build/acl2-8.3dfsg/books/centaur/acre/types.cert on 23-Sep-2022 20:27:04 Built /build/acl2-8.3dfsg/books/centaur/acre/types.cert (23.565s) Making /build/acl2-8.3dfsg/books/centaur/vl/util/default-hints.cert on 23-Sep-2022 20:27:28 Built /build/acl2-8.3dfsg/books/centaur/vl/util/default-hints.cert (4.544s) Making /build/acl2-8.3dfsg/books/clause-processors/instantiate.cert on 23-Sep-2022 20:27:33 Built /build/acl2-8.3dfsg/books/clause-processors/instantiate.cert (6.242s) Making /build/acl2-8.3dfsg/books/centaur/aig/best-aig.cert on 23-Sep-2022 20:27:39 Built /build/acl2-8.3dfsg/books/centaur/aig/best-aig.cert (9.529s) Making /build/acl2-8.3dfsg/books/centaur/gl/gl-mbe.cert on 23-Sep-2022 20:27:49 Built /build/acl2-8.3dfsg/books/centaur/gl/gl-mbe.cert (4.778s) Making /build/acl2-8.3dfsg/books/clause-processors/stobj-preservation.cert on 23-Sep-2022 20:27:54 Built /build/acl2-8.3dfsg/books/clause-processors/stobj-preservation.cert (7.826s) Making /build/acl2-8.3dfsg/books/centaur/depgraph/mergesort-alist-values.cert on 23-Sep-2022 20:28:02 Built /build/acl2-8.3dfsg/books/centaur/depgraph/mergesort-alist-values.cert (5.346s) Making /build/acl2-8.3dfsg/books/centaur/meta/subst.cert on 23-Sep-2022 20:28:07 Built /build/acl2-8.3dfsg/books/centaur/meta/subst.cert (8.400s) Making /build/acl2-8.3dfsg/books/centaur/misc/hons-remove-dups.cert on 23-Sep-2022 20:28:16 Built /build/acl2-8.3dfsg/books/centaur/misc/hons-remove-dups.cert (6.581s) Making /build/acl2-8.3dfsg/books/clause-processors/find-matching.cert on 23-Sep-2022 20:28:22 Built /build/acl2-8.3dfsg/books/clause-processors/find-matching.cert (4.721s) Making /build/acl2-8.3dfsg/books/centaur/gl/glcp-templates.cert on 23-Sep-2022 20:28:27 Built /build/acl2-8.3dfsg/books/centaur/gl/glcp-templates.cert (37.257s) Making /build/acl2-8.3dfsg/books/clause-processors/bindinglist.cert on 23-Sep-2022 20:29:05 Built /build/acl2-8.3dfsg/books/clause-processors/bindinglist.cert (16.473s) Making /build/acl2-8.3dfsg/books/centaur/misc/dag-measure.cert on 23-Sep-2022 20:29:21 Built /build/acl2-8.3dfsg/books/centaur/misc/dag-measure.cert (10.391s) Making /build/acl2-8.3dfsg/books/xdoc/prepare-topic.cert on 23-Sep-2022 20:29:32 Built /build/acl2-8.3dfsg/books/xdoc/prepare-topic.cert (11.622s) Making /build/acl2-8.3dfsg/books/xdoc/spellcheck.cert on 23-Sep-2022 20:29:44 Built /build/acl2-8.3dfsg/books/xdoc/spellcheck.cert (7.288s) Making /build/acl2-8.3dfsg/books/clause-processors/doc.cert on 23-Sep-2022 20:29:51 Built /build/acl2-8.3dfsg/books/clause-processors/doc.cert (3.287s) Making /build/acl2-8.3dfsg/books/clause-processors/replace-equalities.cert on 23-Sep-2022 20:29:54 Built /build/acl2-8.3dfsg/books/clause-processors/replace-equalities.cert (10.561s) Making /build/acl2-8.3dfsg/books/coi/osets/sets.cert on 23-Sep-2022 20:30:05 Built /build/acl2-8.3dfsg/books/coi/osets/sets.cert (3.908s) Making /build/acl2-8.3dfsg/books/std/osets/quantify.cert on 23-Sep-2022 20:30:09 Built /build/acl2-8.3dfsg/books/std/osets/quantify.cert (13.869s) Making /build/acl2-8.3dfsg/books/data-structures/top.cert on 23-Sep-2022 20:30:23 Built /build/acl2-8.3dfsg/books/data-structures/top.cert (3.345s) Making /build/acl2-8.3dfsg/books/hints/consider-hint-tests.cert on 23-Sep-2022 20:30:27 Built /build/acl2-8.3dfsg/books/hints/consider-hint-tests.cert (6.756s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/oset-theorems.cert on 23-Sep-2022 20:30:34 Built /build/acl2-8.3dfsg/books/kestrel/utilities/oset-theorems.cert (3.347s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/strings/chars-codes.cert on 23-Sep-2022 20:30:37 Built /build/acl2-8.3dfsg/books/kestrel/utilities/strings/chars-codes.cert (5.917s) Making /build/acl2-8.3dfsg/books/workshops/2017/coglio-kaufmann-smith/support/option-parsing.cert on 23-Sep-2022 20:30:43 Built /build/acl2-8.3dfsg/books/workshops/2017/coglio-kaufmann-smith/support/option-parsing.cert (4.685s) Making /build/acl2-8.3dfsg/books/kestrel/apt/utilities/pattern-matching-ext.cert on 23-Sep-2022 20:30:48 Built /build/acl2-8.3dfsg/books/kestrel/apt/utilities/pattern-matching-ext.cert (11.615s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/denominator.cert on 23-Sep-2022 20:31:00 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/denominator.cert (2.738s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/omaps/core.cert on 23-Sep-2022 20:31:03 Built /build/acl2-8.3dfsg/books/kestrel/utilities/omaps/core.cert (14.937s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/lists/take-theorems.cert on 23-Sep-2022 20:31:18 Built /build/acl2-8.3dfsg/books/kestrel/utilities/lists/take-theorems.cert (3.321s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/lists/append-theorems.cert on 23-Sep-2022 20:31:21 Built /build/acl2-8.3dfsg/books/kestrel/utilities/lists/append-theorems.cert (3.291s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/lists/intersectp-theorems.cert on 23-Sep-2022 20:31:25 Built /build/acl2-8.3dfsg/books/kestrel/utilities/lists/intersectp-theorems.cert (3.111s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/omaps/tests.cert on 23-Sep-2022 20:31:28 Built /build/acl2-8.3dfsg/books/kestrel/utilities/omaps/tests.cert (4.102s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/strings/chars-codes-tests.cert on 23-Sep-2022 20:31:32 Built /build/acl2-8.3dfsg/books/kestrel/utilities/strings/chars-codes-tests.cert (3.778s) Making /build/acl2-8.3dfsg/books/make-event/assert-check-include.cert on 23-Sep-2022 20:31:36 Built /build/acl2-8.3dfsg/books/make-event/assert-check-include.cert (5.529s) Making /build/acl2-8.3dfsg/books/projects/hexnet/helper-functions.cert on 23-Sep-2022 20:31:42 Built /build/acl2-8.3dfsg/books/projects/hexnet/helper-functions.cert (3.349s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/stobj-based/lrat-checker.cert on 23-Sep-2022 20:31:45 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/stobj-based/lrat-checker.cert (124.982s) Making /build/acl2-8.3dfsg/books/projects/sb-machine/sb.cert on 23-Sep-2022 20:33:51 Built /build/acl2-8.3dfsg/books/projects/sb-machine/sb.cert (45.309s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/brlens/trees-with-brlens.cert on 23-Sep-2022 20:34:36 Built /build/acl2-8.3dfsg/books/projects/taspi/code/brlens/trees-with-brlens.cert (6.541s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/gen-trees/sets-lists-trees.cert on 23-Sep-2022 20:34:43 Built /build/acl2-8.3dfsg/books/projects/taspi/code/gen-trees/sets-lists-trees.cert (8.267s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/gen-trees/btrees.cert on 23-Sep-2022 20:34:51 Built /build/acl2-8.3dfsg/books/projects/taspi/code/gen-trees/btrees.cert (11.034s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/gen-helper/bdd-functions.cert on 23-Sep-2022 20:35:02 Built /build/acl2-8.3dfsg/books/projects/taspi/code/gen-helper/bdd-functions.cert (44.686s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/gen-trees/app-rev-lists.cert on 23-Sep-2022 20:35:47 Built /build/acl2-8.3dfsg/books/projects/taspi/code/gen-trees/app-rev-lists.cert (6.885s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/tree-manip/sort-help.cert on 23-Sep-2022 20:35:54 Built /build/acl2-8.3dfsg/books/projects/taspi/code/tree-manip/sort-help.cert (9.166s) Making /build/acl2-8.3dfsg/books/projects/taspi/tree-score/min-length.cert on 23-Sep-2022 20:36:04 Built /build/acl2-8.3dfsg/books/projects/taspi/tree-score/min-length.cert (11.439s) Making /build/acl2-8.3dfsg/books/projects/taspi/tree-score/opt-pairwise.cert on 23-Sep-2022 20:36:15 Built /build/acl2-8.3dfsg/books/projects/taspi/tree-score/opt-pairwise.cert (5.063s) Making /build/acl2-8.3dfsg/books/std/osets/quantify-tests.cert on 23-Sep-2022 20:36:20 Built /build/acl2-8.3dfsg/books/std/osets/quantify-tests.cert (32.775s) Making /build/acl2-8.3dfsg/books/std/util/deflist-aux.cert on 23-Sep-2022 20:36:53 Built /build/acl2-8.3dfsg/books/std/util/deflist-aux.cert (3.953s) Making /build/acl2-8.3dfsg/books/system/hons-check/basic.cert on 23-Sep-2022 20:36:57 Built /build/acl2-8.3dfsg/books/system/hons-check/basic.cert (4.208s) Making /build/acl2-8.3dfsg/books/system/pcert/acl2x-pcert-test-2-include.cert on 23-Sep-2022 20:37:02 Built /build/acl2-8.3dfsg/books/system/pcert/acl2x-pcert-test-2-include.cert (1.592s) Making /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/octagon_book.cert on 23-Sep-2022 20:37:04 Built /build/acl2-8.3dfsg/books/workshops/2004/schmaltz-borrione/support/octagon_book.cert (41.012s) Making /build/acl2-8.3dfsg/books/workshops/2006/rager/support/ptest-mergesort.cert on 23-Sep-2022 20:37:45 Built /build/acl2-8.3dfsg/books/workshops/2006/rager/support/ptest-mergesort.cert (3.979s) Making /build/acl2-8.3dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC.cert on 23-Sep-2022 20:37:49 Tick Built /build/acl2-8.3dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC.cert (33.749s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC.cert on 23-Sep-2022 20:38:23 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC.cert (33.111s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/xy-routing/xy-routing.cert on 23-Sep-2022 20:38:56 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/xy-routing/xy-routing.cert (14.948s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/octagon-routing/routing_main.cert on 23-Sep-2022 20:39:11 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/octagon-routing/routing_main.cert (12.373s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/scheduling/circuit-scheduling.cert on 23-Sep-2022 20:39:24 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/scheduling/circuit-scheduling.cert (10.399s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/scheduling/packet-scheduling.cert on 23-Sep-2022 20:39:34 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/scheduling/packet-scheduling.cert (9.983s) Making /build/acl2-8.3dfsg/books/workshops/2020/peng-greenstreet/evaluator.cert on 23-Sep-2022 20:39:44 Built /build/acl2-8.3dfsg/books/workshops/2020/peng-greenstreet/evaluator.cert (5.874s) Making /build/acl2-8.3dfsg/books/arithmetic/top.cert on 23-Sep-2022 20:39:50 Built /build/acl2-8.3dfsg/books/arithmetic/top.cert (2.647s) Making /build/acl2-8.3dfsg/books/std/lists/all-equalp.cert on 23-Sep-2022 20:39:53 Built /build/acl2-8.3dfsg/books/std/lists/all-equalp.cert (3.794s) Making /build/acl2-8.3dfsg/books/std/lists/remove-duplicates.cert on 23-Sep-2022 20:39:57 Built /build/acl2-8.3dfsg/books/std/lists/remove-duplicates.cert (4.191s) Making /build/acl2-8.3dfsg/books/std/strings/arithmetic.cert on 23-Sep-2022 20:40:02 Built /build/acl2-8.3dfsg/books/std/strings/arithmetic.cert (4.288s) Making /build/acl2-8.3dfsg/books/std/osets/element-list.cert on 23-Sep-2022 20:40:06 Built /build/acl2-8.3dfsg/books/std/osets/element-list.cert (5.354s) Making /build/acl2-8.3dfsg/books/std/util/wizard.cert on 23-Sep-2022 20:40:12 Built /build/acl2-8.3dfsg/books/std/util/wizard.cert (7.089s) Making /build/acl2-8.3dfsg/books/std/strings/strline.cert on 23-Sep-2022 20:40:19 Built /build/acl2-8.3dfsg/books/std/strings/strline.cert (6.379s) Making /build/acl2-8.3dfsg/books/std/strings/strsplit.cert on 23-Sep-2022 20:40:25 Built /build/acl2-8.3dfsg/books/std/strings/strsplit.cert (5.142s) Making /build/acl2-8.3dfsg/books/arithmetic/abs.cert on 23-Sep-2022 20:40:31 Built /build/acl2-8.3dfsg/books/arithmetic/abs.cert (2.783s) Making /build/acl2-8.3dfsg/books/arithmetic/binomial.cert on 23-Sep-2022 20:40:34 Built /build/acl2-8.3dfsg/books/arithmetic/binomial.cert (6.059s) Making /build/acl2-8.3dfsg/books/centaur/vl2014/util/default-hints.cert on 23-Sep-2022 20:40:40 Built /build/acl2-8.3dfsg/books/centaur/vl2014/util/default-hints.cert (4.295s) Making /build/acl2-8.3dfsg/books/centaur/bitops/floor-mod.cert on 23-Sep-2022 20:40:44 Built /build/acl2-8.3dfsg/books/centaur/bitops/floor-mod.cert (5.634s) Making /build/acl2-8.3dfsg/books/centaur/misc/load-stobj.cert on 23-Sep-2022 20:40:50 Built /build/acl2-8.3dfsg/books/centaur/misc/load-stobj.cert (5.962s) Making /build/acl2-8.3dfsg/books/centaur/meta/term-vars.cert on 23-Sep-2022 20:40:56 Built /build/acl2-8.3dfsg/books/centaur/meta/term-vars.cert (12.558s) Making /build/acl2-8.3dfsg/books/xdoc/archive.cert on 23-Sep-2022 20:41:09 Built /build/acl2-8.3dfsg/books/xdoc/archive.cert (8.118s) Making /build/acl2-8.3dfsg/books/coi/osets/quantify.cert on 23-Sep-2022 20:41:17 Built /build/acl2-8.3dfsg/books/coi/osets/quantify.cert (3.380s) Making /build/acl2-8.3dfsg/books/std/osets/map.cert on 23-Sep-2022 20:41:21 Built /build/acl2-8.3dfsg/books/std/osets/map.cert (11.383s) Making /build/acl2-8.3dfsg/books/coi/osets/set-order.cert on 23-Sep-2022 20:41:32 Built /build/acl2-8.3dfsg/books/coi/osets/set-order.cert (4.001s) Making /build/acl2-8.3dfsg/books/coi/osets/set-processor.cert on 23-Sep-2022 20:41:36 Built /build/acl2-8.3dfsg/books/coi/osets/set-processor.cert (5.157s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed3.cert on 23-Sep-2022 20:41:42 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed3.cert (43.769s) Making /build/acl2-8.3dfsg/books/demos/proofs/tightness-lemma-proof.cert on 23-Sep-2022 20:42:26 Built /build/acl2-8.3dfsg/books/demos/proofs/tightness-lemma-proof.cert (14.024s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/strings/strings-codes.cert on 23-Sep-2022 20:42:40 Built /build/acl2-8.3dfsg/books/kestrel/utilities/strings/strings-codes.cert (4.530s) Making /build/acl2-8.3dfsg/books/workshops/2017/coglio-kaufmann-smith/support/process-keyword-args.cert on 23-Sep-2022 20:42:45 Built /build/acl2-8.3dfsg/books/workshops/2017/coglio-kaufmann-smith/support/process-keyword-args.cert (3.593s) Making /build/acl2-8.3dfsg/books/kestrel/apt/utilities/pattern-matching-ext-tests.cert on 23-Sep-2022 20:42:48 Built /build/acl2-8.3dfsg/books/kestrel/apt/utilities/pattern-matching-ext-tests.cert (7.799s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/numerator.cert on 23-Sep-2022 20:42:56 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/numerator.cert (2.637s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/unsigned-byte-fixing.cert on 23-Sep-2022 20:42:59 Built /build/acl2-8.3dfsg/books/kestrel/utilities/unsigned-byte-fixing.cert (3.781s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/integer-arithmetic/rules.cert on 23-Sep-2022 20:43:03 Built /build/acl2-8.3dfsg/books/kestrel/utilities/integer-arithmetic/rules.cert (2.772s) Making /build/acl2-8.3dfsg/books/tools/remove-hyps.cert on 23-Sep-2022 20:43:06 Built /build/acl2-8.3dfsg/books/tools/remove-hyps.cert (6.636s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/signed-byte-fixing.cert on 23-Sep-2022 20:43:13 Built /build/acl2-8.3dfsg/books/kestrel/utilities/signed-byte-fixing.cert (4.042s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/strings/char-code-theorems.cert on 23-Sep-2022 20:43:17 Built /build/acl2-8.3dfsg/books/kestrel/utilities/strings/char-code-theorems.cert (3.685s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/strings/strings-codes-tests.cert on 23-Sep-2022 20:43:21 Built /build/acl2-8.3dfsg/books/kestrel/utilities/strings/strings-codes-tests.cert (4.535s) Making /build/acl2-8.3dfsg/books/misc/arithmetic-top-theory.cert on 23-Sep-2022 20:43:26 Built /build/acl2-8.3dfsg/books/misc/arithmetic-top-theory.cert (2.780s) Making /build/acl2-8.3dfsg/books/misc/defattach-example.cert on 23-Sep-2022 20:43:28 Built /build/acl2-8.3dfsg/books/misc/defattach-example.cert (3.654s) Making /build/acl2-8.3dfsg/books/nonstd/nsa/inner-sums.cert on 23-Sep-2022 20:43:32 Built /build/acl2-8.3dfsg/books/nonstd/nsa/inner-sums.cert (7.697s) Making /build/acl2-8.3dfsg/books/nonstd/sqrt/iter-sqrt.cert on 23-Sep-2022 20:43:40 Built /build/acl2-8.3dfsg/books/nonstd/sqrt/iter-sqrt.cert (12.576s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley1.cert on 23-Sep-2022 20:43:53 Built /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley1.cert (4.673s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley2.cert on 23-Sep-2022 20:43:58 Built /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley2.cert (8.583s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley3.cert on 23-Sep-2022 20:44:06 Built /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley3.cert (19.699s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley3a.cert on 23-Sep-2022 20:44:26 Built /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley3a.cert (10.612s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley4.cert on 23-Sep-2022 20:44:37 Built /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley4.cert (19.293s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley4a.cert on 23-Sep-2022 20:44:57 Built /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley4a.cert (11.208s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley5.cert on 23-Sep-2022 20:45:08 Built /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley5.cert (19.486s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley5a.cert on 23-Sep-2022 20:45:28 Built /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley5a.cert (10.990s) Making /build/acl2-8.3dfsg/books/projects/hexnet/hexnet-model.cert on 23-Sep-2022 20:45:39 Built /build/acl2-8.3dfsg/books/projects/hexnet/hexnet-model.cert (44.577s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/sat-drat-claim-2-3.cert on 23-Sep-2022 20:46:24 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/sat-drat-claim-2-3.cert (41.204s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/sat-drat-claim-2-3.cert on 23-Sep-2022 20:47:05 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/sat-drat-claim-2-3.cert (46.396s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/stobj-based/lrat-parser.cert on 23-Sep-2022 20:47:52 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/stobj-based/lrat-parser.cert (19.862s) Making /build/acl2-8.3dfsg/books/projects/sb-machine/proofs/completed/fence.cert on 23-Sep-2022 20:48:12 Built /build/acl2-8.3dfsg/books/projects/sb-machine/proofs/completed/fence.cert (8.367s) Making /build/acl2-8.3dfsg/books/projects/sb-machine/proofs/completed/stupid.cert on 23-Sep-2022 20:48:20 Built /build/acl2-8.3dfsg/books/projects/sb-machine/proofs/completed/stupid.cert (7.761s) Making /build/acl2-8.3dfsg/books/projects/sb-machine/proofs/completed/stupid2.cert on 23-Sep-2022 20:48:28 Built /build/acl2-8.3dfsg/books/projects/sb-machine/proofs/completed/stupid2.cert (9.046s) Making /build/acl2-8.3dfsg/books/projects/sb-machine/proofs/completed/stupid3.cert on 23-Sep-2022 20:48:38 Built /build/acl2-8.3dfsg/books/projects/sb-machine/proofs/completed/stupid3.cert (8.627s) Making /build/acl2-8.3dfsg/books/projects/sb-machine/proofs/completed/writes-with-fence-dumb.cert on 23-Sep-2022 20:48:46 Built /build/acl2-8.3dfsg/books/projects/sb-machine/proofs/completed/writes-with-fence-dumb.cert (18.996s) Making /build/acl2-8.3dfsg/books/projects/sb-machine/proofs/completed/writes-with-fence-ghost.cert on 23-Sep-2022 20:49:05 Built /build/acl2-8.3dfsg/books/projects/sb-machine/proofs/completed/writes-with-fence-ghost.cert (26.534s) Making /build/acl2-8.3dfsg/books/projects/sb-machine/proofs/completed/writes-with-fence.cert on 23-Sep-2022 20:49:32 Built /build/acl2-8.3dfsg/books/projects/sb-machine/proofs/completed/writes-with-fence.cert (19.059s) Making /build/acl2-8.3dfsg/books/projects/sb-machine/tools.cert on 23-Sep-2022 20:49:51 Built /build/acl2-8.3dfsg/books/projects/sb-machine/tools.cert (8.464s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/replete/replete-helper.cert on 23-Sep-2022 20:50:00 Built /build/acl2-8.3dfsg/books/projects/taspi/code/replete/replete-helper.cert (13.813s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/gen-trees/btrees-bdds.cert on 23-Sep-2022 20:50:14 Built /build/acl2-8.3dfsg/books/projects/taspi/code/gen-trees/btrees-bdds.cert (34.016s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/gen-helper/top.cert on 23-Sep-2022 20:50:48 Built /build/acl2-8.3dfsg/books/projects/taspi/code/gen-helper/top.cert (4.311s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/tree-manip/insertion-based-sort.cert on 23-Sep-2022 20:50:53 Built /build/acl2-8.3dfsg/books/projects/taspi/code/tree-manip/insertion-based-sort.cert (19.413s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/tree-manip/merge-based-sort.cert on 23-Sep-2022 20:51:12 Built /build/acl2-8.3dfsg/books/projects/taspi/code/tree-manip/merge-based-sort.cert (18.717s) Making /build/acl2-8.3dfsg/books/projects/taspi/database/props.cert on 23-Sep-2022 20:51:31 Built /build/acl2-8.3dfsg/books/projects/taspi/database/props.cert (6.163s) Making /build/acl2-8.3dfsg/books/projects/taspi/tree-score/ambig-score.cert on 23-Sep-2022 20:51:37 Built /build/acl2-8.3dfsg/books/projects/taspi/tree-score/ambig-score.cert (5.927s) Making /build/acl2-8.3dfsg/books/std/osets/map-tests.cert on 23-Sep-2022 20:51:43 Built /build/acl2-8.3dfsg/books/std/osets/map-tests.cert (27.496s) Making /build/acl2-8.3dfsg/books/std/strings/strline-tests.cert on 23-Sep-2022 20:52:11 Built /build/acl2-8.3dfsg/books/std/strings/strline-tests.cert (3.297s) Making /build/acl2-8.3dfsg/books/std/strings/strsplit-tests.cert on 23-Sep-2022 20:52:14 Built /build/acl2-8.3dfsg/books/std/strings/strsplit-tests.cert (2.781s) Making /build/acl2-8.3dfsg/books/std/util/tests/defrule.cert on 23-Sep-2022 20:52:17 Built /build/acl2-8.3dfsg/books/std/util/tests/defrule.cert (4.911s) Making /build/acl2-8.3dfsg/books/textbook/chap11/how-many-soln1.cert on 23-Sep-2022 20:52:23 Built /build/acl2-8.3dfsg/books/textbook/chap11/how-many-soln1.cert (4.767s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/arithmetic.cert on 23-Sep-2022 20:52:27 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/arithmetic.cert (2.727s) Making /build/acl2-8.3dfsg/books/workshops/1999/pipeline/trivia.cert on 23-Sep-2022 20:52:30 Built /build/acl2-8.3dfsg/books/workshops/1999/pipeline/trivia.cert (3.009s) Making /build/acl2-8.3dfsg/books/workshops/1999/vhdl/fact-proof.cert on 23-Sep-2022 20:52:33 Built /build/acl2-8.3dfsg/books/workshops/1999/vhdl/fact-proof.cert (5.857s) Making /build/acl2-8.3dfsg/books/workshops/2003/cowles-gamboa-van-baalen_matrix/support/matrix.cert on 23-Sep-2022 20:52:39 Built /build/acl2-8.3dfsg/books/workshops/2003/cowles-gamboa-van-baalen_matrix/support/matrix.cert (263.561s) Making /build/acl2-8.3dfsg/books/workshops/2003/schmaltz-borrione/support/inequalities.cert on 23-Sep-2022 20:57:03 Built /build/acl2-8.3dfsg/books/workshops/2003/schmaltz-borrione/support/inequalities.cert (2.709s) Making /build/acl2-8.3dfsg/books/workshops/2004/cowles-gamboa/support/WyoM1-utilities.cert on 23-Sep-2022 20:57:06 Built /build/acl2-8.3dfsg/books/workshops/2004/cowles-gamboa/support/WyoM1-utilities.cert (2.785s) Making /build/acl2-8.3dfsg/books/workshops/2004/cowles-gamboa/support/knuth.cert on 23-Sep-2022 20:57:09 Built /build/acl2-8.3dfsg/books/workshops/2004/cowles-gamboa/support/knuth.cert (10.582s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed1.cert on 23-Sep-2022 20:57:20 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed1.cert (6.565s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed2a.cert on 23-Sep-2022 20:57:27 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed2a.cert (10.259s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed6a.cert on 23-Sep-2022 20:57:37 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed6a.cert (10.869s) Making /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/doubleY-routing/doubleY-routing.cert on 23-Sep-2022 20:57:48 Built /build/acl2-8.3dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/doubleY-routing/doubleY-routing.cert (104.044s) Making /build/acl2-8.3dfsg/books/workshops/2011/krug-et-al/support/Utilities/disjoint.cert on 23-Sep-2022 20:59:32 Built /build/acl2-8.3dfsg/books/workshops/2011/krug-et-al/support/Utilities/disjoint.cert (9.016s) Making /build/acl2-8.3dfsg/books/rtl/rel1/support/x-2xx.cert on 23-Sep-2022 20:59:42 Built /build/acl2-8.3dfsg/books/rtl/rel1/support/x-2xx.cert (3.433s) Making /build/acl2-8.3dfsg/books/arithmetic/top-with-meta.cert on 23-Sep-2022 20:59:45 Built /build/acl2-8.3dfsg/books/arithmetic/top-with-meta.cert (2.540s) Making /build/acl2-8.3dfsg/books/arithmetic/idiv.cert on 23-Sep-2022 20:59:48 Built /build/acl2-8.3dfsg/books/arithmetic/idiv.cert (3.176s) Making /build/acl2-8.3dfsg/books/rtl/rel4/arithmetic/x-2xx.cert on 23-Sep-2022 20:59:51 Built /build/acl2-8.3dfsg/books/rtl/rel4/arithmetic/x-2xx.cert (3.503s) Making /build/acl2-8.3dfsg/books/std/strings/eqv.cert on 23-Sep-2022 20:59:55 Built /build/acl2-8.3dfsg/books/std/strings/eqv.cert (7.672s) Making /build/acl2-8.3dfsg/books/std/strings/subseq.cert on 23-Sep-2022 21:00:03 Built /build/acl2-8.3dfsg/books/std/strings/subseq.cert (4.615s) Making /build/acl2-8.3dfsg/books/add-ons/hash-stobjs.cert on 23-Sep-2022 21:00:07 Built /build/acl2-8.3dfsg/books/add-ons/hash-stobjs.cert (3.950s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/x-2xx.cert on 23-Sep-2022 21:00:11 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/x-2xx.cert (3.094s) Making /build/acl2-8.3dfsg/books/centaur/misc/numlist.cert on 23-Sep-2022 21:00:15 Built /build/acl2-8.3dfsg/books/centaur/misc/numlist.cert (3.492s) Making /build/acl2-8.3dfsg/books/centaur/misc/nat-list-duplicates.cert on 23-Sep-2022 21:00:18 Built /build/acl2-8.3dfsg/books/centaur/misc/nat-list-duplicates.cert (13.204s) Making /build/acl2-8.3dfsg/books/centaur/ubdds/param.cert on 23-Sep-2022 21:00:32 Built /build/acl2-8.3dfsg/books/centaur/ubdds/param.cert (50.843s) Making /build/acl2-8.3dfsg/books/centaur/fty/baselists.cert on 23-Sep-2022 21:01:23 Built /build/acl2-8.3dfsg/books/centaur/fty/baselists.cert (11.235s) Making /build/acl2-8.3dfsg/books/centaur/clex/charlist-fix.cert on 23-Sep-2022 21:01:34 Built /build/acl2-8.3dfsg/books/centaur/clex/charlist-fix.cert (5.358s) Making /build/acl2-8.3dfsg/books/centaur/fgl/defapply.cert on 23-Sep-2022 21:01:40 Built /build/acl2-8.3dfsg/books/centaur/fgl/defapply.cert (7.284s) Making /build/acl2-8.3dfsg/books/centaur/meta/substitute.cert on 23-Sep-2022 21:01:47 Built /build/acl2-8.3dfsg/books/centaur/meta/substitute.cert (10.809s) Making /build/acl2-8.3dfsg/books/centaur/meta/bindinglist.cert on 23-Sep-2022 21:01:58 Built /build/acl2-8.3dfsg/books/centaur/meta/bindinglist.cert (41.796s) Making /build/acl2-8.3dfsg/books/centaur/meta/urewrite.cert on 23-Sep-2022 21:02:40 Built /build/acl2-8.3dfsg/books/centaur/meta/urewrite.cert (37.843s) Making /build/acl2-8.3dfsg/books/centaur/fty/top.cert on 23-Sep-2022 21:03:18 Built /build/acl2-8.3dfsg/books/centaur/fty/top.cert (5.879s) Making /build/acl2-8.3dfsg/books/centaur/misc/load-stobj-tests.cert on 23-Sep-2022 21:03:24 Built /build/acl2-8.3dfsg/books/centaur/misc/load-stobj-tests.cert (12.130s) Making /build/acl2-8.3dfsg/books/centaur/ubdds/param2.cert on 23-Sep-2022 21:03:36 Built /build/acl2-8.3dfsg/books/centaur/ubdds/param2.cert (50.165s) Making /build/acl2-8.3dfsg/books/clause-processors/basic-examples.cert on 23-Sep-2022 21:04:27 Built /build/acl2-8.3dfsg/books/clause-processors/basic-examples.cert (11.895s) Making /build/acl2-8.3dfsg/books/coi/osets/listsets-base.cert on 23-Sep-2022 21:04:39 Built /build/acl2-8.3dfsg/books/coi/osets/listsets-base.cert (6.444s) Making /build/acl2-8.3dfsg/books/coi/osets/map.cert on 23-Sep-2022 21:04:45 Built /build/acl2-8.3dfsg/books/coi/osets/map.cert (3.175s) Making /build/acl2-8.3dfsg/books/coi/termination/assuming/compiler.cert on 23-Sep-2022 21:04:49 Built /build/acl2-8.3dfsg/books/coi/termination/assuming/compiler.cert (86.095s) Making /build/acl2-8.3dfsg/books/defexec/dag-unification/basic.cert on 23-Sep-2022 21:06:15 Built /build/acl2-8.3dfsg/books/defexec/dag-unification/basic.cert (8.413s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/programs.cert on 23-Sep-2022 21:06:23 Built /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/programs.cert (24.298s) Making /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/m1.cert on 23-Sep-2022 21:06:48 Built /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/m1.cert (6.740s) Making /build/acl2-8.3dfsg/books/demos/proofs/tightness-lemma.cert on 23-Sep-2022 21:06:55 Built /build/acl2-8.3dfsg/books/demos/proofs/tightness-lemma.cert (4.582s) Making /build/acl2-8.3dfsg/books/kestrel/fty/defset.cert on 23-Sep-2022 21:06:59 Built /build/acl2-8.3dfsg/books/kestrel/fty/defset.cert (8.308s) Making /build/acl2-8.3dfsg/books/kestrel/fty/nati.cert on 23-Sep-2022 21:07:08 Built /build/acl2-8.3dfsg/books/kestrel/fty/nati.cert (7.871s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/typed-lists/nat-list-fix-theorems.cert on 23-Sep-2022 21:07:16 Built /build/acl2-8.3dfsg/books/kestrel/utilities/typed-lists/nat-list-fix-theorems.cert (6.223s) Making /build/acl2-8.3dfsg/books/projects/x86isa/portcullis/sharp-dot-constants.cert on 23-Sep-2022 21:07:22 Built /build/acl2-8.3dfsg/books/projects/x86isa/portcullis/sharp-dot-constants.cert (6.256s) Making /build/acl2-8.3dfsg/books/kestrel/fty/defbyte.cert on 23-Sep-2022 21:07:29 Built /build/acl2-8.3dfsg/books/kestrel/fty/defbyte.cert (10.442s) Making /build/acl2-8.3dfsg/books/kestrel/fty/deflist-of-len.cert on 23-Sep-2022 21:07:39 Built /build/acl2-8.3dfsg/books/kestrel/fty/deflist-of-len.cert (7.780s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/unsigned-byte-list-fixing.cert on 23-Sep-2022 21:07:47 Built /build/acl2-8.3dfsg/books/kestrel/utilities/unsigned-byte-list-fixing.cert (4.717s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/integer-arithmetic/top.cert on 23-Sep-2022 21:07:52 Tick Built /build/acl2-8.3dfsg/books/kestrel/utilities/integer-arithmetic/top.cert (2.300s) Making /build/acl2-8.3dfsg/books/kestrel/fty/nibble.cert on 23-Sep-2022 21:07:55 Built /build/acl2-8.3dfsg/books/kestrel/fty/nibble.cert (6.702s) Making /build/acl2-8.3dfsg/books/kestrel/ethereum/words.cert on 23-Sep-2022 21:08:01 Built /build/acl2-8.3dfsg/books/kestrel/ethereum/words.cert (6.992s) Making /build/acl2-8.3dfsg/books/kestrel/fty/defomap.cert on 23-Sep-2022 21:08:09 Built /build/acl2-8.3dfsg/books/kestrel/fty/defomap.cert (8.987s) Making /build/acl2-8.3dfsg/books/kestrel/fty/defbyte-tests.cert on 23-Sep-2022 21:08:18 Built /build/acl2-8.3dfsg/books/kestrel/fty/defbyte-tests.cert (12.486s) Making /build/acl2-8.3dfsg/books/kestrel/fty/deffixtype-alias.cert on 23-Sep-2022 21:08:30 Built /build/acl2-8.3dfsg/books/kestrel/fty/deffixtype-alias.cert (6.540s) Making /build/acl2-8.3dfsg/books/kestrel/fty/deflist-of-len-tests.cert on 23-Sep-2022 21:08:37 Built /build/acl2-8.3dfsg/books/kestrel/fty/deflist-of-len-tests.cert (8.798s) Making /build/acl2-8.3dfsg/books/kestrel/fty/defomap-tests.cert on 23-Sep-2022 21:08:46 Built /build/acl2-8.3dfsg/books/kestrel/fty/defomap-tests.cert (15.079s) Making /build/acl2-8.3dfsg/books/kestrel/fty/defset-tests.cert on 23-Sep-2022 21:09:01 Built /build/acl2-8.3dfsg/books/kestrel/fty/defset-tests.cert (63.894s) Making /build/acl2-8.3dfsg/books/kestrel/fty/map.cert on 23-Sep-2022 21:10:05 Built /build/acl2-8.3dfsg/books/kestrel/fty/map.cert (6.921s) Making /build/acl2-8.3dfsg/books/kestrel/fty/nati-tests.cert on 23-Sep-2022 21:10:12 Built /build/acl2-8.3dfsg/books/kestrel/fty/nati-tests.cert (6.685s) Making /build/acl2-8.3dfsg/books/kestrel/fty/set.cert on 23-Sep-2022 21:10:19 Built /build/acl2-8.3dfsg/books/kestrel/fty/set.cert (6.728s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/strings/chars-codes-fty.cert on 23-Sep-2022 21:10:26 Built /build/acl2-8.3dfsg/books/kestrel/utilities/strings/chars-codes-fty.cert (6.086s) Making /build/acl2-8.3dfsg/books/kestrel/java/language/primitive-types.cert on 23-Sep-2022 21:10:32 Built /build/acl2-8.3dfsg/books/kestrel/java/language/primitive-types.cert (17.481s) Making /build/acl2-8.3dfsg/books/kestrel/java/language/optional-integer-type-suffix.cert on 23-Sep-2022 21:10:50 Built /build/acl2-8.3dfsg/books/kestrel/java/language/optional-integer-type-suffix.cert (8.170s) Making /build/acl2-8.3dfsg/books/kestrel/java/language/floating-point-literals.cert on 23-Sep-2022 21:10:58 Built /build/acl2-8.3dfsg/books/kestrel/java/language/floating-point-literals.cert (7.075s) Making /build/acl2-8.3dfsg/books/kestrel/java/language/pointers.cert on 23-Sep-2022 21:11:05 Built /build/acl2-8.3dfsg/books/kestrel/java/language/pointers.cert (7.918s) Making /build/acl2-8.3dfsg/books/kestrel/library-wrappers/arithmetic-top-with-meta.cert on 23-Sep-2022 21:11:14 Built /build/acl2-8.3dfsg/books/kestrel/library-wrappers/arithmetic-top-with-meta.cert (2.680s) Making /build/acl2-8.3dfsg/books/kestrel/simpl-imp/abstract-syntax.cert on 23-Sep-2022 21:11:16 Built /build/acl2-8.3dfsg/books/kestrel/simpl-imp/abstract-syntax.cert (24.488s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/tail-recursive-p-tests.cert on 23-Sep-2022 21:11:41 Built /build/acl2-8.3dfsg/books/kestrel/std/system/tail-recursive-p-tests.cert (4.039s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/bytes-legacy.cert on 23-Sep-2022 21:11:45 Built /build/acl2-8.3dfsg/books/kestrel/utilities/bytes-legacy.cert (29.482s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/integer-range-fixing.cert on 23-Sep-2022 21:12:15 Built /build/acl2-8.3dfsg/books/kestrel/utilities/integer-range-fixing.cert (6.402s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/omaps/with-fixing-theorems.cert on 23-Sep-2022 21:12:21 Built /build/acl2-8.3dfsg/books/kestrel/utilities/omaps/with-fixing-theorems.cert (6.703s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/signed-byte-list-fixing.cert on 23-Sep-2022 21:12:28 Built /build/acl2-8.3dfsg/books/kestrel/utilities/signed-byte-list-fixing.cert (6.049s) Making /build/acl2-8.3dfsg/books/misc/defpm.cert on 23-Sep-2022 21:12:34 Built /build/acl2-8.3dfsg/books/misc/defpm.cert (10.238s) Making /build/acl2-8.3dfsg/books/misc/dft-ex.cert on 23-Sep-2022 21:12:45 Built /build/acl2-8.3dfsg/books/misc/dft-ex.cert (7.564s) Making /build/acl2-8.3dfsg/books/misc/fast-coerce.cert on 23-Sep-2022 21:12:53 Built /build/acl2-8.3dfsg/books/misc/fast-coerce.cert (4.763s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/x-2xx.cert on 23-Sep-2022 21:12:57 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/x-2xx.cert (3.053s) Making /build/acl2-8.3dfsg/books/models/jvm/m5/infinite-fair-schedule.cert on 23-Sep-2022 21:13:01 Built /build/acl2-8.3dfsg/books/models/jvm/m5/infinite-fair-schedule.cert (4.678s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/1999/calculus/book/top-with-meta.cert on 23-Sep-2022 21:13:05 Built /build/acl2-8.3dfsg/books/nonstd/workshops/1999/calculus/book/top-with-meta.cert (2.653s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley1a.cert on 23-Sep-2022 21:13:08 Built /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley1a.cert (5.211s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley2a.cert on 23-Sep-2022 21:13:14 Built /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley2a.cert (2.839s) Making /build/acl2-8.3dfsg/books/projects/regex/regex-defs.cert on 23-Sep-2022 21:13:17 Built /build/acl2-8.3dfsg/books/projects/regex/regex-defs.cert (12.805s) Making /build/acl2-8.3dfsg/books/projects/cache-coherence/vi/vi-impl.cert on 23-Sep-2022 21:13:30 Built /build/acl2-8.3dfsg/books/projects/cache-coherence/vi/vi-impl.cert (35.768s) Making /build/acl2-8.3dfsg/books/projects/farray/farray.cert on 23-Sep-2022 21:14:05 Built /build/acl2-8.3dfsg/books/projects/farray/farray.cert (18.902s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/sat-drat-claim-2.cert on 23-Sep-2022 21:14:25 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/sat-drat-claim-2.cert (3.284s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/sat-drat-claim-2.cert on 23-Sep-2022 21:14:28 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/sat-drat-claim-2.cert (3.171s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/stobj-based/run.cert on 23-Sep-2022 21:14:31 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/stobj-based/run.cert (4.755s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/stobj-based/test-driver.cert on 23-Sep-2022 21:14:36 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/stobj-based/test-driver.cert (2.819s) Making /build/acl2-8.3dfsg/books/projects/sat/proof-checker-array/farray.cert on 23-Sep-2022 21:14:39 Built /build/acl2-8.3dfsg/books/projects/sat/proof-checker-array/farray.cert (18.840s) Making /build/acl2-8.3dfsg/books/projects/smtlink/examples/basictypes.cert on 23-Sep-2022 21:14:58 Built /build/acl2-8.3dfsg/books/projects/smtlink/examples/basictypes.cert (8.996s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/replete/replete.cert on 23-Sep-2022 21:15:07 Built /build/acl2-8.3dfsg/books/projects/taspi/code/replete/replete.cert (7.849s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/gen-trees/btrees-bdds-sets.cert on 23-Sep-2022 21:15:15 Built /build/acl2-8.3dfsg/books/projects/taspi/code/gen-trees/btrees-bdds-sets.cert (6.821s) Making /build/acl2-8.3dfsg/books/projects/taspi/database/entry.cert on 23-Sep-2022 21:15:22 Built /build/acl2-8.3dfsg/books/projects/taspi/database/entry.cert (9.198s) Making /build/acl2-8.3dfsg/books/proofstyles/completeness/clock-partial.cert on 23-Sep-2022 21:15:32 Built /build/acl2-8.3dfsg/books/proofstyles/completeness/clock-partial.cert (3.303s) Making /build/acl2-8.3dfsg/books/proofstyles/completeness/clock-total.cert on 23-Sep-2022 21:15:35 Built /build/acl2-8.3dfsg/books/proofstyles/completeness/clock-total.cert (3.331s) Making /build/acl2-8.3dfsg/books/proofstyles/soundness/stepwise-invariants-partial.cert on 23-Sep-2022 21:15:39 Built /build/acl2-8.3dfsg/books/proofstyles/soundness/stepwise-invariants-partial.cert (4.496s) Making /build/acl2-8.3dfsg/books/system/too-many-ifs.cert on 23-Sep-2022 21:15:43 Built /build/acl2-8.3dfsg/books/system/too-many-ifs.cert (4.669s) Making /build/acl2-8.3dfsg/books/textbook/chap11/summations-book.cert on 23-Sep-2022 21:15:48 Built /build/acl2-8.3dfsg/books/textbook/chap11/summations-book.cert (4.282s) Making /build/acl2-8.3dfsg/books/textbook/chap11/xtr2.cert on 23-Sep-2022 21:15:53 Built /build/acl2-8.3dfsg/books/textbook/chap11/xtr2.cert (3.694s) Making /build/acl2-8.3dfsg/books/tools/with-arith1-help.cert on 23-Sep-2022 21:15:56 Built /build/acl2-8.3dfsg/books/tools/with-arith1-help.cert (3.355s) Making /build/acl2-8.3dfsg/books/unicode/partition.cert on 23-Sep-2022 21:16:00 Built /build/acl2-8.3dfsg/books/unicode/partition.cert (3.879s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/meta.cert on 23-Sep-2022 21:16:04 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/meta.cert (2.840s) Making /build/acl2-8.3dfsg/books/workshops/1999/ste/util.cert on 23-Sep-2022 21:16:07 Built /build/acl2-8.3dfsg/books/workshops/1999/ste/util.cert (5.032s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/top/meta.cert on 23-Sep-2022 21:16:12 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/top/meta.cert (2.787s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/trivia.cert on 23-Sep-2022 21:16:15 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/trivia.cert (2.655s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/trivia.cert on 23-Sep-2022 21:16:18 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/trivia.cert (2.766s) Making /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/finite-set-theory/set-theory-original.cert on 23-Sep-2022 21:16:21 Built /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/finite-set-theory/set-theory-original.cert (131.190s) Making /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/finite-set-theory/set-theory.cert on 23-Sep-2022 21:18:32 Built /build/acl2-8.3dfsg/books/workshops/2002/manolios-kaufmann/support/finite-set-theory/set-theory.cert (96.906s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-dags/support/basic.cert on 23-Sep-2022 21:20:09 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-dags/support/basic.cert (8.242s) Making /build/acl2-8.3dfsg/books/workshops/2003/cowles-gamboa-van-baalen_matrix/support/matalg.cert on 23-Sep-2022 21:20:18 Built /build/acl2-8.3dfsg/books/workshops/2003/cowles-gamboa-van-baalen_matrix/support/matalg.cert (15.209s) Making /build/acl2-8.3dfsg/books/workshops/2003/hbl/support/sol1.cert on 23-Sep-2022 21:20:33 Built /build/acl2-8.3dfsg/books/workshops/2003/hbl/support/sol1.cert (27.020s) Making /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/vector.cert on 23-Sep-2022 21:21:00 Built /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/vector.cert (4.282s) Making /build/acl2-8.3dfsg/books/workshops/2004/cowles-gamboa/support/WyoM1-correct.cert on 23-Sep-2022 21:21:05 Built /build/acl2-8.3dfsg/books/workshops/2004/cowles-gamboa/support/WyoM1-correct.cert (5.871s) Making /build/acl2-8.3dfsg/books/workshops/2004/gameiro-manolios/support/top-with-meta.cert on 23-Sep-2022 21:21:11 Built /build/acl2-8.3dfsg/books/workshops/2004/gameiro-manolios/support/top-with-meta.cert (2.870s) Making /build/acl2-8.3dfsg/books/workshops/2004/greve/support/mark.cert on 23-Sep-2022 21:21:14 Built /build/acl2-8.3dfsg/books/workshops/2004/greve/support/mark.cert (10.104s) Making /build/acl2-8.3dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/meta.cert on 23-Sep-2022 21:21:24 Built /build/acl2-8.3dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/meta.cert (2.734s) Making /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/basic.cert on 23-Sep-2022 21:21:27 Built /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/basic.cert (8.418s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/lists/lists.cert on 23-Sep-2022 21:21:36 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/lists/lists.cert (6.561s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/prime-fac.cert on 23-Sep-2022 21:21:42 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/prime-fac.cert (14.121s) Making /build/acl2-8.3dfsg/books/workshops/2007/cowles-et-al/support/cowles/while-loop.cert on 23-Sep-2022 21:21:57 Built /build/acl2-8.3dfsg/books/workshops/2007/cowles-et-al/support/cowles/while-loop.cert (36.907s) Making /build/acl2-8.3dfsg/books/workshops/2007/cowles-et-al/support/ray/reflexive.cert on 23-Sep-2022 21:22:34 Built /build/acl2-8.3dfsg/books/workshops/2007/cowles-et-al/support/ray/reflexive.cert (5.284s) Making /build/acl2-8.3dfsg/books/workshops/2013/hardin-hardin/support/nthcdr-theorems.cert on 23-Sep-2022 21:22:39 Built /build/acl2-8.3dfsg/books/workshops/2013/hardin-hardin/support/nthcdr-theorems.cert (3.638s) Making /build/acl2-8.3dfsg/books/workshops/2017/sumners/support/general-theory.cert on 23-Sep-2022 21:22:43 Built /build/acl2-8.3dfsg/books/workshops/2017/sumners/support/general-theory.cert (10.205s) Making /build/acl2-8.3dfsg/books/workshops/2017/sumners/support/bounded-ords.cert on 23-Sep-2022 21:22:53 Built /build/acl2-8.3dfsg/books/workshops/2017/sumners/support/bounded-ords.cert (35.065s) Making /build/acl2-8.3dfsg/books/workshops/2020/peng-greenstreet/utils/basics.cert on 23-Sep-2022 21:23:28 Built /build/acl2-8.3dfsg/books/workshops/2020/peng-greenstreet/utils/basics.cert (7.453s) Making /build/acl2-8.3dfsg/books/ordinals/top-with-meta.cert on 23-Sep-2022 21:23:36 Built /build/acl2-8.3dfsg/books/ordinals/top-with-meta.cert (2.807s) Making /build/acl2-8.3dfsg/books/std/strings/char-case.cert on 23-Sep-2022 21:23:39 Built /build/acl2-8.3dfsg/books/std/strings/char-case.cert (7.949s) Making /build/acl2-8.3dfsg/books/std/strings/strprefixp.cert on 23-Sep-2022 21:23:47 Built /build/acl2-8.3dfsg/books/std/strings/strprefixp.cert (6.876s) Making /build/acl2-8.3dfsg/books/centaur/meta/unify-strict.cert on 23-Sep-2022 21:23:54 Built /build/acl2-8.3dfsg/books/centaur/meta/unify-strict.cert (12.377s) Making /build/acl2-8.3dfsg/books/centaur/meta/lambda-measure.cert on 23-Sep-2022 21:24:07 Built /build/acl2-8.3dfsg/books/centaur/meta/lambda-measure.cert (14.849s) Making /build/acl2-8.3dfsg/books/defexec/dag-unification/dags.cert on 23-Sep-2022 21:24:22 Built /build/acl2-8.3dfsg/books/defexec/dag-unification/dags.cert (14.676s) Making /build/acl2-8.3dfsg/books/defexec/dag-unification/terms.cert on 23-Sep-2022 21:24:37 Built /build/acl2-8.3dfsg/books/defexec/dag-unification/terms.cert (13.159s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/first-last.cert on 23-Sep-2022 21:24:50 Built /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/first-last.cert (3.367s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/spec-properties.cert on 23-Sep-2022 21:24:53 Built /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/spec-properties.cert (3.721s) Making /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/compile.cert on 23-Sep-2022 21:24:57 Built /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/compile.cert (5.582s) Making /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/g-direct.cert on 23-Sep-2022 21:25:03 Built /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/g-direct.cert (3.566s) Making /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/g-invariant.cert on 23-Sep-2022 21:25:07 Built /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/g-invariant.cert (4.789s) Making /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/lecture2-book.cert on 23-Sep-2022 21:25:12 Built /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/lecture2-book.cert (3.560s) Making /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/lecture3-book.cert on 23-Sep-2022 21:25:15 Built /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/lecture3-book.cert (3.721s) Making /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/lecture4-book.cert on 23-Sep-2022 21:25:19 Built /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/lecture4-book.cert (3.469s) Making /build/acl2-8.3dfsg/books/kestrel/fty/byte.cert on 23-Sep-2022 21:25:23 Built /build/acl2-8.3dfsg/books/kestrel/fty/byte.cert (7.163s) Making /build/acl2-8.3dfsg/books/kestrel/fty/defubyte.cert on 23-Sep-2022 21:25:30 Built /build/acl2-8.3dfsg/books/kestrel/fty/defubyte.cert (6.260s) Making /build/acl2-8.3dfsg/books/kestrel/fty/defsbyte.cert on 23-Sep-2022 21:25:37 Built /build/acl2-8.3dfsg/books/kestrel/fty/defsbyte.cert (5.997s) Making /build/acl2-8.3dfsg/books/kestrel/fty/deffixtype-alias-tests.cert on 23-Sep-2022 21:25:43 Built /build/acl2-8.3dfsg/books/kestrel/fty/deffixtype-alias-tests.cert (15.277s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/strings/strings-codes-fty.cert on 23-Sep-2022 21:25:58 Built /build/acl2-8.3dfsg/books/kestrel/utilities/strings/strings-codes-fty.cert (6.201s) Making /build/acl2-8.3dfsg/books/kestrel/java/language/primitive-function-macros.cert on 23-Sep-2022 21:26:05 Built /build/acl2-8.3dfsg/books/kestrel/java/language/primitive-function-macros.cert (10.735s) Making /build/acl2-8.3dfsg/books/kestrel/java/language/reference-values.cert on 23-Sep-2022 21:26:15 Built /build/acl2-8.3dfsg/books/kestrel/java/language/reference-values.cert (8.338s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/integer-range-fixing-tests.cert on 23-Sep-2022 21:26:24 Built /build/acl2-8.3dfsg/books/kestrel/utilities/integer-range-fixing-tests.cert (5.900s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley1b.cert on 23-Sep-2022 21:26:30 Built /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley1b.cert (10.997s) Making /build/acl2-8.3dfsg/books/projects/cache-coherence/vi/utils.cert on 23-Sep-2022 21:26:41 Built /build/acl2-8.3dfsg/books/projects/cache-coherence/vi/utils.cert (15.547s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/satisfiable-add-proof-clause-drat.cert on 23-Sep-2022 21:26:57 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/satisfiable-add-proof-clause-drat.cert (3.655s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/satisfiable-add-proof-clause-drat.cert on 23-Sep-2022 21:27:01 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/satisfiable-add-proof-clause-drat.cert (3.520s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/fringes/fringes.cert on 23-Sep-2022 21:27:04 Built /build/acl2-8.3dfsg/books/projects/taspi/code/fringes/fringes.cert (11.745s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/replete/replete-guards.cert on 23-Sep-2022 21:27:16 Built /build/acl2-8.3dfsg/books/projects/taspi/code/replete/replete-guards.cert (11.152s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/gen-trees/top.cert on 23-Sep-2022 21:27:27 Built /build/acl2-8.3dfsg/books/projects/taspi/code/gen-trees/top.cert (5.505s) Making /build/acl2-8.3dfsg/books/proofstyles/completeness/stepwise-invariants-partial.cert on 23-Sep-2022 21:27:33 Built /build/acl2-8.3dfsg/books/proofstyles/completeness/stepwise-invariants-partial.cert (3.697s) Making /build/acl2-8.3dfsg/books/proofstyles/completeness/stepwise-invariants-total.cert on 23-Sep-2022 21:27:37 Built /build/acl2-8.3dfsg/books/proofstyles/completeness/stepwise-invariants-total.cert (4.147s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/sets.cert on 23-Sep-2022 21:27:41 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/sets.cert (8.568s) Making /build/acl2-8.3dfsg/books/workshops/1999/ste/boolean.cert on 23-Sep-2022 21:27:50 Built /build/acl2-8.3dfsg/books/workshops/1999/ste/boolean.cert (6.294s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-dags/support/terms.cert on 23-Sep-2022 21:27:56 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-dags/support/terms.cert (13.115s) Making /build/acl2-8.3dfsg/books/workshops/2003/gamboa-cowles-van-baalen/support/linalg.cert on 23-Sep-2022 21:28:10 Built /build/acl2-8.3dfsg/books/workshops/2003/gamboa-cowles-van-baalen/support/linalg.cert (6.031s) Making /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/mdefuns.cert on 23-Sep-2022 21:28:16 Built /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/mdefuns.cert (4.208s) Making /build/acl2-8.3dfsg/books/workshops/2004/gameiro-manolios/support/interval.cert on 23-Sep-2022 21:28:20 Built /build/acl2-8.3dfsg/books/workshops/2004/gameiro-manolios/support/interval.cert (12.364s) Making /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/dags.cert on 23-Sep-2022 21:28:33 Built /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/dags.cert (15.854s) Making /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/terms.cert on 23-Sep-2022 21:28:49 Built /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/terms.cert (13.155s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/basic.cert on 23-Sep-2022 21:29:02 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/basic.cert (92.179s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/lists/list-top.cert on 23-Sep-2022 21:30:35 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/lists/list-top.cert (2.440s) Making /build/acl2-8.3dfsg/books/workshops/2007/cowles-et-al/support/ray/reflexive-macros.cert on 23-Sep-2022 21:30:37 Built /build/acl2-8.3dfsg/books/workshops/2007/cowles-et-al/support/ray/reflexive-macros.cert (9.535s) Making /build/acl2-8.3dfsg/books/workshops/2017/sumners/support/trans-theory.cert on 23-Sep-2022 21:30:47 Built /build/acl2-8.3dfsg/books/workshops/2017/sumners/support/trans-theory.cert (235.677s) Making /build/acl2-8.3dfsg/books/ordinals/ordinal-basic-thms.cert on 23-Sep-2022 21:34:43 Built /build/acl2-8.3dfsg/books/ordinals/ordinal-basic-thms.cert (3.910s) Making /build/acl2-8.3dfsg/books/std/strings/ieqv.cert on 23-Sep-2022 21:34:47 Built /build/acl2-8.3dfsg/books/std/strings/ieqv.cert (7.705s) Making /build/acl2-8.3dfsg/books/std/strings/strpos.cert on 23-Sep-2022 21:34:55 Built /build/acl2-8.3dfsg/books/std/strings/strpos.cert (6.517s) Making /build/acl2-8.3dfsg/books/std/strings/strrpos.cert on 23-Sep-2022 21:35:01 Built /build/acl2-8.3dfsg/books/std/strings/strrpos.cert (9.810s) Making /build/acl2-8.3dfsg/books/std/strings/suffixp.cert on 23-Sep-2022 21:35:11 Built /build/acl2-8.3dfsg/books/std/strings/suffixp.cert (4.750s) Making /build/acl2-8.3dfsg/books/centaur/meta/equivalence.cert on 23-Sep-2022 21:35:16 Built /build/acl2-8.3dfsg/books/centaur/meta/equivalence.cert (12.850s) Making /build/acl2-8.3dfsg/books/centaur/meta/parse-rewrite.cert on 23-Sep-2022 21:35:29 Built /build/acl2-8.3dfsg/books/centaur/meta/parse-rewrite.cert (23.588s) Making /build/acl2-8.3dfsg/books/centaur/misc/sharedlibs.cert on 23-Sep-2022 21:35:53 Built /build/acl2-8.3dfsg/books/centaur/misc/sharedlibs.cert (4.109s) Making /build/acl2-8.3dfsg/books/defexec/dag-unification/matching.cert on 23-Sep-2022 21:35:57 Built /build/acl2-8.3dfsg/books/defexec/dag-unification/matching.cert (5.706s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/extraction.cert on 23-Sep-2022 21:36:03 Built /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/extraction.cert (3.183s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/intermediate-to-spec.cert on 23-Sep-2022 21:36:06 Built /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/intermediate-to-spec.cert (3.848s) Making /build/acl2-8.3dfsg/books/kestrel/fty/ubyte1.cert on 23-Sep-2022 21:36:10 Built /build/acl2-8.3dfsg/books/kestrel/fty/ubyte1.cert (6.909s) Making /build/acl2-8.3dfsg/books/kestrel/fty/ubyte2.cert on 23-Sep-2022 21:36:17 Built /build/acl2-8.3dfsg/books/kestrel/fty/ubyte2.cert (6.762s) Making /build/acl2-8.3dfsg/books/kestrel/fty/ubyte3.cert on 23-Sep-2022 21:36:24 Built /build/acl2-8.3dfsg/books/kestrel/fty/ubyte3.cert (6.752s) Making /build/acl2-8.3dfsg/books/kestrel/fty/ubyte4.cert on 23-Sep-2022 21:36:31 Built /build/acl2-8.3dfsg/books/kestrel/fty/ubyte4.cert (6.806s) Making /build/acl2-8.3dfsg/books/kestrel/fty/ubyte8.cert on 23-Sep-2022 21:36:38 Built /build/acl2-8.3dfsg/books/kestrel/fty/ubyte8.cert (6.876s) Making /build/acl2-8.3dfsg/books/kestrel/fty/ubyte11.cert on 23-Sep-2022 21:36:45 Built /build/acl2-8.3dfsg/books/kestrel/fty/ubyte11.cert (6.944s) Making /build/acl2-8.3dfsg/books/kestrel/fty/ubyte16.cert on 23-Sep-2022 21:36:52 Built /build/acl2-8.3dfsg/books/kestrel/fty/ubyte16.cert (6.701s) Making /build/acl2-8.3dfsg/books/kestrel/fty/ubyte32.cert on 23-Sep-2022 21:36:59 Built /build/acl2-8.3dfsg/books/kestrel/fty/ubyte32.cert (6.980s) Making /build/acl2-8.3dfsg/books/kestrel/fty/ubyte64.cert on 23-Sep-2022 21:37:06 Built /build/acl2-8.3dfsg/books/kestrel/fty/ubyte64.cert (7.011s) Making /build/acl2-8.3dfsg/books/kestrel/fty/ubyte128.cert on 23-Sep-2022 21:37:13 Built /build/acl2-8.3dfsg/books/kestrel/fty/ubyte128.cert (7.040s) Making /build/acl2-8.3dfsg/books/kestrel/fty/ubyte256.cert on 23-Sep-2022 21:37:21 Built /build/acl2-8.3dfsg/books/kestrel/fty/ubyte256.cert (7.023s) Making /build/acl2-8.3dfsg/books/kestrel/fty/sbyte1.cert on 23-Sep-2022 21:37:28 Built /build/acl2-8.3dfsg/books/kestrel/fty/sbyte1.cert (6.874s) Making /build/acl2-8.3dfsg/books/kestrel/fty/sbyte2.cert on 23-Sep-2022 21:37:35 Built /build/acl2-8.3dfsg/books/kestrel/fty/sbyte2.cert (6.845s) Making /build/acl2-8.3dfsg/books/kestrel/fty/sbyte3.cert on 23-Sep-2022 21:37:42 Built /build/acl2-8.3dfsg/books/kestrel/fty/sbyte3.cert (6.755s) Making /build/acl2-8.3dfsg/books/kestrel/fty/sbyte4.cert on 23-Sep-2022 21:37:49 Tick Built /build/acl2-8.3dfsg/books/kestrel/fty/sbyte4.cert (6.979s) Making /build/acl2-8.3dfsg/books/kestrel/fty/sbyte8.cert on 23-Sep-2022 21:37:56 Built /build/acl2-8.3dfsg/books/kestrel/fty/sbyte8.cert (7.031s) Making /build/acl2-8.3dfsg/books/kestrel/fty/sbyte16.cert on 23-Sep-2022 21:38:03 Built /build/acl2-8.3dfsg/books/kestrel/fty/sbyte16.cert (6.919s) Making /build/acl2-8.3dfsg/books/kestrel/fty/sbyte32.cert on 23-Sep-2022 21:38:10 Built /build/acl2-8.3dfsg/books/kestrel/fty/sbyte32.cert (7.121s) Making /build/acl2-8.3dfsg/books/kestrel/fty/sbyte64.cert on 23-Sep-2022 21:38:17 Built /build/acl2-8.3dfsg/books/kestrel/fty/sbyte64.cert (7.233s) Making /build/acl2-8.3dfsg/books/kestrel/fty/sbyte128.cert on 23-Sep-2022 21:38:25 Built /build/acl2-8.3dfsg/books/kestrel/fty/sbyte128.cert (6.943s) Making /build/acl2-8.3dfsg/books/kestrel/fty/sbyte256.cert on 23-Sep-2022 21:38:32 Built /build/acl2-8.3dfsg/books/kestrel/fty/sbyte256.cert (7.112s) Making /build/acl2-8.3dfsg/books/kestrel/java/language/floating-point-placeholders.cert on 23-Sep-2022 21:38:39 Built /build/acl2-8.3dfsg/books/kestrel/java/language/floating-point-placeholders.cert (17.852s) Making /build/acl2-8.3dfsg/books/kestrel/java/language/escape-sequences.cert on 23-Sep-2022 21:38:57 Built /build/acl2-8.3dfsg/books/kestrel/java/language/escape-sequences.cert (10.860s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley1c.cert on 23-Sep-2022 21:39:08 Built /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley1c.cert (76.961s) Making /build/acl2-8.3dfsg/books/projects/cache-coherence/vi/vi-correct.cert on 23-Sep-2022 21:40:25 Tick Built /build/acl2-8.3dfsg/books/projects/cache-coherence/vi/vi-correct.cert (2228.183s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/satisfiable-add-proof-clause.cert on 23-Sep-2022 22:17:34 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/satisfiable-add-proof-clause.cert (3.327s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/satisfiable-add-proof-clause.cert on 23-Sep-2022 22:17:37 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/satisfiable-add-proof-clause.cert (2.790s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/build/build-term.cert on 23-Sep-2022 22:17:40 Built /build/acl2-8.3dfsg/books/projects/taspi/code/build/build-term.cert (8.377s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/fringes/fringes-guards.cert on 23-Sep-2022 22:17:49 Built /build/acl2-8.3dfsg/books/projects/taspi/code/fringes/fringes-guards.cert (67.972s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/sequences/seqs.cert on 23-Sep-2022 22:18:57 Built /build/acl2-8.3dfsg/books/projects/taspi/code/sequences/seqs.cert (6.871s) Making /build/acl2-8.3dfsg/books/projects/taspi/tree-score/circle-scoring.cert on 23-Sep-2022 22:19:04 Built /build/acl2-8.3dfsg/books/projects/taspi/tree-score/circle-scoring.cert (7.869s) Making /build/acl2-8.3dfsg/books/std/strings/suffixp-tests.cert on 23-Sep-2022 22:19:12 Built /build/acl2-8.3dfsg/books/std/strings/suffixp-tests.cert (4.036s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/fast-sets.cert on 23-Sep-2022 22:19:16 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/fast-sets.cert (5.987s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/fixpoints.cert on 23-Sep-2022 22:19:22 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/fixpoints.cert (5.518s) Making /build/acl2-8.3dfsg/books/workshops/1999/ste/state.cert on 23-Sep-2022 22:19:28 Built /build/acl2-8.3dfsg/books/workshops/1999/ste/state.cert (84.108s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-dags/support/dag-unification.cert on 23-Sep-2022 22:20:52 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-dags/support/dag-unification.cert (38.130s) Making /build/acl2-8.3dfsg/books/workshops/2003/gamboa-cowles-van-baalen/support/kalman-defs.cert on 23-Sep-2022 22:21:30 Built /build/acl2-8.3dfsg/books/workshops/2003/gamboa-cowles-van-baalen/support/kalman-defs.cert (8.948s) Making /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/mdefthms.cert on 23-Sep-2022 22:21:40 Built /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/mdefthms.cert (7.350s) Making /build/acl2-8.3dfsg/books/workshops/2004/gameiro-manolios/support/transversality.cert on 23-Sep-2022 22:21:47 Built /build/acl2-8.3dfsg/books/workshops/2004/gameiro-manolios/support/transversality.cert (5.659s) Making /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/matching.cert on 23-Sep-2022 22:21:53 Built /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/matching.cert (6.220s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/syntax/syntax-extensions.cert on 23-Sep-2022 22:21:59 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/syntax/syntax-extensions.cert (3.867s) Making /build/acl2-8.3dfsg/books/workshops/2017/sumners/support/bakery.cert on 23-Sep-2022 22:22:03 Tick Tick Built /build/acl2-8.3dfsg/books/workshops/2017/sumners/support/bakery.cert (4177.196s) Making /build/acl2-8.3dfsg/books/ordinals/ordinal-addition.cert on 23-Sep-2022 23:31:41 Built /build/acl2-8.3dfsg/books/ordinals/ordinal-addition.cert (15.807s) Making /build/acl2-8.3dfsg/books/std/strings/cat.cert on 23-Sep-2022 23:31:57 Built /build/acl2-8.3dfsg/books/std/strings/cat.cert (7.217s) Making /build/acl2-8.3dfsg/books/std/strings/firstn-chars.cert on 23-Sep-2022 23:32:04 Built /build/acl2-8.3dfsg/books/std/strings/firstn-chars.cert (5.762s) Making /build/acl2-8.3dfsg/books/std/strings/iprefixp.cert on 23-Sep-2022 23:32:10 Built /build/acl2-8.3dfsg/books/std/strings/iprefixp.cert (5.017s) Making /build/acl2-8.3dfsg/books/std/strings/iless.cert on 23-Sep-2022 23:32:15 Built /build/acl2-8.3dfsg/books/std/strings/iless.cert (15.608s) Making /build/acl2-8.3dfsg/books/std/strings/pad.cert on 23-Sep-2022 23:32:31 Built /build/acl2-8.3dfsg/books/std/strings/pad.cert (7.137s) Making /build/acl2-8.3dfsg/books/std/strings/prefix-lines.cert on 23-Sep-2022 23:32:38 Built /build/acl2-8.3dfsg/books/std/strings/prefix-lines.cert (5.374s) Making /build/acl2-8.3dfsg/books/std/strings/strsubst.cert on 23-Sep-2022 23:32:44 Built /build/acl2-8.3dfsg/books/std/strings/strsubst.cert (7.011s) Making /build/acl2-8.3dfsg/books/std/strings/strtok.cert on 23-Sep-2022 23:32:51 Built /build/acl2-8.3dfsg/books/std/strings/strtok.cert (8.313s) Making /build/acl2-8.3dfsg/books/std/strings/substrp.cert on 23-Sep-2022 23:33:00 Built /build/acl2-8.3dfsg/books/std/strings/substrp.cert (4.658s) Making /build/acl2-8.3dfsg/books/std/util/defenum.cert on 23-Sep-2022 23:33:04 Built /build/acl2-8.3dfsg/books/std/util/defenum.cert (7.725s) Making /build/acl2-8.3dfsg/books/centaur/vl2014/util/deftranssum.cert on 23-Sep-2022 23:33:12 Built /build/acl2-8.3dfsg/books/centaur/vl2014/util/deftranssum.cert (5.984s) Making /build/acl2-8.3dfsg/books/centaur/fgl/rule-types.cert on 23-Sep-2022 23:33:18 Built /build/acl2-8.3dfsg/books/centaur/fgl/rule-types.cert (31.900s) Making /build/acl2-8.3dfsg/books/centaur/vl/util/printedlist.cert on 23-Sep-2022 23:33:50 Built /build/acl2-8.3dfsg/books/centaur/vl/util/printedlist.cert (5.715s) Making /build/acl2-8.3dfsg/books/centaur/lispfloat/ops-logic.cert on 23-Sep-2022 23:33:56 Built /build/acl2-8.3dfsg/books/centaur/lispfloat/ops-logic.cert (8.815s) Making /build/acl2-8.3dfsg/books/centaur/vl/util/bits.cert on 23-Sep-2022 23:34:05 Built /build/acl2-8.3dfsg/books/centaur/vl/util/bits.cert (10.344s) Making /build/acl2-8.3dfsg/books/oslib/catpath.cert on 23-Sep-2022 23:34:16 Built /build/acl2-8.3dfsg/books/oslib/catpath.cert (4.870s) Making /build/acl2-8.3dfsg/books/oslib/file-types-logic.cert on 23-Sep-2022 23:34:21 Built /build/acl2-8.3dfsg/books/oslib/file-types-logic.cert (13.560s) Making /build/acl2-8.3dfsg/books/defexec/dag-unification/subsumption.cert on 23-Sep-2022 23:34:35 Built /build/acl2-8.3dfsg/books/defexec/dag-unification/subsumption.cert (6.858s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/merge-intermediate.cert on 23-Sep-2022 23:34:42 Built /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/merge-intermediate.cert (5.927s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/load-extract.cert on 23-Sep-2022 23:34:48 Built /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/load-extract.cert (3.091s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/defun-sk-queries.cert on 23-Sep-2022 23:34:51 Built /build/acl2-8.3dfsg/books/kestrel/std/system/defun-sk-queries.cert (9.574s) Making /build/acl2-8.3dfsg/books/kestrel/event-macros/evmac-input-print-p.cert on 23-Sep-2022 23:35:01 Built /build/acl2-8.3dfsg/books/kestrel/event-macros/evmac-input-print-p.cert (4.932s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/enumerations.cert on 23-Sep-2022 23:35:06 Built /build/acl2-8.3dfsg/books/kestrel/utilities/enumerations.cert (5.469s) Making /build/acl2-8.3dfsg/books/kestrel/fty/defbyte-standard-instances.cert on 23-Sep-2022 23:35:11 Built /build/acl2-8.3dfsg/books/kestrel/fty/defbyte-standard-instances.cert (8.253s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/defun-sk-queries-tests.cert on 23-Sep-2022 23:35:20 Built /build/acl2-8.3dfsg/books/kestrel/std/system/defun-sk-queries-tests.cert (6.542s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/function-queries.cert on 23-Sep-2022 23:35:26 Built /build/acl2-8.3dfsg/books/kestrel/std/system/function-queries.cert (5.290s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/enumerations-tests.cert on 23-Sep-2022 23:35:32 Built /build/acl2-8.3dfsg/books/kestrel/utilities/enumerations-tests.cert (4.401s) Making /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley1d.cert on 23-Sep-2022 23:35:36 Built /build/acl2-8.3dfsg/books/nonstd/workshops/2017/cayley/cayley1d.cert (40.119s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/soundness.cert on 23-Sep-2022 23:36:17 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/soundness.cert (13.632s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/soundness.cert on 23-Sep-2022 23:36:30 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/soundness.cert (14.546s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/build/build-term-guards.cert on 23-Sep-2022 23:36:45 Built /build/acl2-8.3dfsg/books/projects/taspi/code/build/build-term-guards.cert (11.021s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/fringes/fringes-props.cert on 23-Sep-2022 23:36:56 Built /build/acl2-8.3dfsg/books/projects/taspi/code/fringes/fringes-props.cert (6.230s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/sequences/p-inform.cert on 23-Sep-2022 23:37:03 Built /build/acl2-8.3dfsg/books/projects/taspi/code/sequences/p-inform.cert (6.881s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/tree-manip/mv-root.cert on 23-Sep-2022 23:37:10 Built /build/acl2-8.3dfsg/books/projects/taspi/code/tree-manip/mv-root.cert (7.922s) Making /build/acl2-8.3dfsg/books/projects/taspi/sets-input/consensus.cert on 23-Sep-2022 23:37:18 Built /build/acl2-8.3dfsg/books/projects/taspi/sets-input/consensus.cert (7.796s) Making /build/acl2-8.3dfsg/books/projects/taspi/sets-input/tree-compat.cert on 23-Sep-2022 23:37:26 Built /build/acl2-8.3dfsg/books/projects/taspi/sets-input/tree-compat.cert (7.649s) Making /build/acl2-8.3dfsg/books/projects/taspi/sets-input/tree-support-in-set.cert on 23-Sep-2022 23:37:33 Built /build/acl2-8.3dfsg/books/projects/taspi/sets-input/tree-support-in-set.cert (8.191s) Making /build/acl2-8.3dfsg/books/projects/taspi/tree-distance/rf.cert on 23-Sep-2022 23:37:42 Built /build/acl2-8.3dfsg/books/projects/taspi/tree-distance/rf.cert (6.870s) Making /build/acl2-8.3dfsg/books/projects/taspi/tree-distance/symm-diff.cert on 23-Sep-2022 23:37:49 Tick Built /build/acl2-8.3dfsg/books/projects/taspi/tree-distance/symm-diff.cert (5.835s) Making /build/acl2-8.3dfsg/books/projects/taspi/tree-score/costs.cert on 23-Sep-2022 23:37:55 Built /build/acl2-8.3dfsg/books/projects/taspi/tree-score/costs.cert (7.884s) Making /build/acl2-8.3dfsg/books/std/strings/strsubst-tests.cert on 23-Sep-2022 23:38:03 Built /build/acl2-8.3dfsg/books/std/strings/strsubst-tests.cert (3.846s) Making /build/acl2-8.3dfsg/books/std/strings/strtok-tests.cert on 23-Sep-2022 23:38:07 Built /build/acl2-8.3dfsg/books/std/strings/strtok-tests.cert (3.767s) Making /build/acl2-8.3dfsg/books/std/util/defenum-tests.cert on 23-Sep-2022 23:38:11 Built /build/acl2-8.3dfsg/books/std/util/defenum-tests.cert (4.241s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/relations.cert on 23-Sep-2022 23:38:15 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/relations.cert (4.877s) Making /build/acl2-8.3dfsg/books/workshops/1999/ste/run.cert on 23-Sep-2022 23:38:20 Built /build/acl2-8.3dfsg/books/workshops/1999/ste/run.cert (71.564s) Making /build/acl2-8.3dfsg/books/workshops/2003/gamboa-cowles-van-baalen/support/kalman-proof.cert on 23-Sep-2022 23:39:32 Built /build/acl2-8.3dfsg/books/workshops/2003/gamboa-cowles-van-baalen/support/kalman-proof.cert (167.751s) Making /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/mzero.cert on 23-Sep-2022 23:42:20 Built /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/mzero.cert (3.359s) Making /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/mentry.cert on 23-Sep-2022 23:42:23 Built /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/mentry.cert (4.881s) Making /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/mid.cert on 23-Sep-2022 23:42:28 Built /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/mid.cert (3.244s) Making /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/subsumption.cert on 23-Sep-2022 23:42:32 Built /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/subsumption.cert (6.848s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/syntax/syntax.cert on 23-Sep-2022 23:42:39 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/syntax/syntax.cert (5.518s) Making /build/acl2-8.3dfsg/books/xdoc/tests/defsection-tests.cert on 23-Sep-2022 23:42:44 Built /build/acl2-8.3dfsg/books/xdoc/tests/defsection-tests.cert (5.108s) Making /build/acl2-8.3dfsg/books/ordinals/ordinal-isomorphism.cert on 23-Sep-2022 23:42:50 Built /build/acl2-8.3dfsg/books/ordinals/ordinal-isomorphism.cert (28.414s) Making /build/acl2-8.3dfsg/books/ordinals/ordinal-multiplication.cert on 23-Sep-2022 23:43:18 Built /build/acl2-8.3dfsg/books/ordinals/ordinal-multiplication.cert (18.247s) Making /build/acl2-8.3dfsg/books/std/strings/case-conversion.cert on 23-Sep-2022 23:43:37 Built /build/acl2-8.3dfsg/books/std/strings/case-conversion.cert (11.300s) Making /build/acl2-8.3dfsg/books/std/strings/istrprefixp.cert on 23-Sep-2022 23:43:48 Built /build/acl2-8.3dfsg/books/std/strings/istrprefixp.cert (7.056s) Making /build/acl2-8.3dfsg/books/centaur/vl2014/util/defoption.cert on 23-Sep-2022 23:43:55 Built /build/acl2-8.3dfsg/books/centaur/vl2014/util/defoption.cert (5.738s) Making /build/acl2-8.3dfsg/books/centaur/fgl/rules.cert on 23-Sep-2022 23:44:01 Built /build/acl2-8.3dfsg/books/centaur/fgl/rules.cert (21.324s) Making /build/acl2-8.3dfsg/books/projects/rp-rewriter/portcullis.cert on 23-Sep-2022 23:44:23 Built /build/acl2-8.3dfsg/books/projects/rp-rewriter/portcullis.cert (4.397s) Making /build/acl2-8.3dfsg/books/oslib/ls-logic.cert on 23-Sep-2022 23:44:27 Built /build/acl2-8.3dfsg/books/oslib/ls-logic.cert (8.705s) Making /build/acl2-8.3dfsg/books/defexec/dag-unification/subsumption-subst.cert on 23-Sep-2022 23:44:36 Built /build/acl2-8.3dfsg/books/defexec/dag-unification/subsumption-subst.cert (5.391s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/split-qs-properties.cert on 23-Sep-2022 23:44:42 Built /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/split-qs-properties.cert (3.852s) Making /build/acl2-8.3dfsg/books/kestrel/auto-termination/td-cands.cert on 23-Sep-2022 23:44:46 Built /build/acl2-8.3dfsg/books/kestrel/auto-termination/td-cands.cert (9.724s) Making /build/acl2-8.3dfsg/books/kestrel/fty/defbyte-standard-instances-tests.cert on 23-Sep-2022 23:44:56 Built /build/acl2-8.3dfsg/books/kestrel/fty/defbyte-standard-instances-tests.cert (7.842s) Making /build/acl2-8.3dfsg/books/oslib/copy-logic.cert on 23-Sep-2022 23:45:04 Built /build/acl2-8.3dfsg/books/oslib/copy-logic.cert (11.248s) Making /build/acl2-8.3dfsg/books/projects/async/portcullis.cert on 23-Sep-2022 23:45:15 Built /build/acl2-8.3dfsg/books/projects/async/portcullis.cert (3.847s) Making /build/acl2-8.3dfsg/books/projects/rp-rewriter/lib/mult/doc.cert on 23-Sep-2022 23:45:19 Built /build/acl2-8.3dfsg/books/projects/rp-rewriter/lib/mult/doc.cert (4.520s) Making /build/acl2-8.3dfsg/books/projects/rp-rewriter/lib/mult2/doc.cert on 23-Sep-2022 23:45:24 Built /build/acl2-8.3dfsg/books/projects/rp-rewriter/lib/mult2/doc.cert (4.251s) Making /build/acl2-8.3dfsg/books/projects/rp-rewriter/meta/portcullis.cert on 23-Sep-2022 23:45:28 Built /build/acl2-8.3dfsg/books/projects/rp-rewriter/meta/portcullis.cert (4.656s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/stobj-based/equiv.cert on 23-Sep-2022 23:45:33 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/stobj-based/equiv.cert (88.247s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/top.cert on 23-Sep-2022 23:47:02 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/early/rev2/top.cert (9.675s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/top.cert on 23-Sep-2022 23:47:12 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/list-based/top.cert (9.266s) Making /build/acl2-8.3dfsg/books/projects/taspi/code/tree-manip/top.cert on 23-Sep-2022 23:47:21 Built /build/acl2-8.3dfsg/books/projects/taspi/code/tree-manip/top.cert (6.015s) Making /build/acl2-8.3dfsg/books/projects/taspi/sets-input/greedy.cert on 23-Sep-2022 23:47:27 Built /build/acl2-8.3dfsg/books/projects/taspi/sets-input/greedy.cert (6.411s) Making /build/acl2-8.3dfsg/books/projects/taspi/single-input/taxa-based.cert on 23-Sep-2022 23:47:34 Built /build/acl2-8.3dfsg/books/projects/taspi/single-input/taxa-based.cert (44.165s) Making /build/acl2-8.3dfsg/books/projects/taspi/sets-input/multipolar-loose.cert on 23-Sep-2022 23:48:18 Built /build/acl2-8.3dfsg/books/projects/taspi/sets-input/multipolar-loose.cert (8.197s) Making /build/acl2-8.3dfsg/books/projects/taspi/tree-score/pscores.cert on 23-Sep-2022 23:48:26 Built /build/acl2-8.3dfsg/books/projects/taspi/tree-score/pscores.cert (10.859s) Making /build/acl2-8.3dfsg/books/projects/taspi/tree-score/fitch-scoring.cert on 23-Sep-2022 23:48:37 Built /build/acl2-8.3dfsg/books/projects/taspi/tree-score/fitch-scoring.cert (14.637s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/models.cert on 23-Sep-2022 23:48:52 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/models.cert (4.138s) Making /build/acl2-8.3dfsg/books/workshops/1999/ste/expression.cert on 23-Sep-2022 23:48:56 Built /build/acl2-8.3dfsg/books/workshops/1999/ste/expression.cert (8.801s) Making /build/acl2-8.3dfsg/books/workshops/2003/gamboa-cowles-van-baalen/support/kalman-demo.cert on 23-Sep-2022 23:49:05 Built /build/acl2-8.3dfsg/books/workshops/2003/gamboa-cowles-van-baalen/support/kalman-demo.cert (3.945s) Making /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/madd.cert on 23-Sep-2022 23:49:10 Built /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/madd.cert (8.566s) Making /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/subsumption-subst.cert on 23-Sep-2022 23:49:18 Built /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/subsumption-subst.cert (5.523s) Making /build/acl2-8.3dfsg/books/xdoc/save-classic.cert on 23-Sep-2022 23:49:24 Built /build/acl2-8.3dfsg/books/xdoc/save-classic.cert (10.345s) Making /build/acl2-8.3dfsg/books/ordinals/e0-ordinal.cert on 23-Sep-2022 23:49:34 Built /build/acl2-8.3dfsg/books/ordinals/e0-ordinal.cert (4.062s) Making /build/acl2-8.3dfsg/books/ordinals/ordinal-exponentiation.cert on 23-Sep-2022 23:49:39 Built /build/acl2-8.3dfsg/books/ordinals/ordinal-exponentiation.cert (36.718s) Making /build/acl2-8.3dfsg/books/std/strings/istrpos.cert on 23-Sep-2022 23:50:16 Built /build/acl2-8.3dfsg/books/std/strings/istrpos.cert (7.937s) Making /build/acl2-8.3dfsg/books/projects/rp-rewriter/aux-functions.cert on 23-Sep-2022 23:50:24 Built /build/acl2-8.3dfsg/books/projects/rp-rewriter/aux-functions.cert (24.464s) Making /build/acl2-8.3dfsg/books/projects/rp-rewriter/proofs/local-lemmas.cert on 23-Sep-2022 23:50:48 Built /build/acl2-8.3dfsg/books/projects/rp-rewriter/proofs/local-lemmas.cert (4.758s) Making /build/acl2-8.3dfsg/books/centaur/svl/portcullis.cert on 23-Sep-2022 23:50:53 Built /build/acl2-8.3dfsg/books/centaur/svl/portcullis.cert (5.431s) Making /build/acl2-8.3dfsg/books/defexec/dag-unification/list-unification-rules.cert on 23-Sep-2022 23:50:59 Built /build/acl2-8.3dfsg/books/defexec/dag-unification/list-unification-rules.cert (9.887s) Making /build/acl2-8.3dfsg/books/defexec/find-path/graph/find-path3.cert on 23-Sep-2022 23:51:09 Built /build/acl2-8.3dfsg/books/defexec/find-path/graph/find-path3.cert (8.977s) Making /build/acl2-8.3dfsg/books/defexec/find-path/graph/find-path1.cert on 23-Sep-2022 23:51:18 Built /build/acl2-8.3dfsg/books/defexec/find-path/graph/find-path1.cert (9.060s) Making /build/acl2-8.3dfsg/books/defexec/find-path/graph/find-path2.cert on 23-Sep-2022 23:51:27 Built /build/acl2-8.3dfsg/books/defexec/find-path/graph/find-path2.cert (8.194s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/sort-qs-properties.cert on 23-Sep-2022 23:51:36 Built /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/sort-qs-properties.cert (6.107s) Making /build/acl2-8.3dfsg/books/finite-set-theory/set-theory.cert on 23-Sep-2022 23:51:42 Built /build/acl2-8.3dfsg/books/finite-set-theory/set-theory.cert (128.901s) Making /build/acl2-8.3dfsg/books/kestrel/auto-termination/defunt-top.cert on 23-Sep-2022 23:53:51 Built /build/acl2-8.3dfsg/books/kestrel/auto-termination/defunt-top.cert (8.575s) Making /build/acl2-8.3dfsg/books/misc/grcd.cert on 23-Sep-2022 23:54:00 Built /build/acl2-8.3dfsg/books/misc/grcd.cert (7.370s) Making /build/acl2-8.3dfsg/books/misc/goodstein.cert on 23-Sep-2022 23:54:07 Built /build/acl2-8.3dfsg/books/misc/goodstein.cert (4.350s) Making /build/acl2-8.3dfsg/books/misc/problem13.cert on 23-Sep-2022 23:54:12 Built /build/acl2-8.3dfsg/books/misc/problem13.cert (3.925s) Making /build/acl2-8.3dfsg/books/powerlists/algebra.cert on 23-Sep-2022 23:54:16 Built /build/acl2-8.3dfsg/books/powerlists/algebra.cert (13.551s) Making /build/acl2-8.3dfsg/books/projects/async/macros.cert on 23-Sep-2022 23:54:30 Built /build/acl2-8.3dfsg/books/projects/async/macros.cert (8.917s) Making /build/acl2-8.3dfsg/books/projects/async/primp-database.cert on 23-Sep-2022 23:54:39 Built /build/acl2-8.3dfsg/books/projects/async/primp-database.cert (4.576s) Making /build/acl2-8.3dfsg/books/projects/async/serial-adder/32-bit-serial-adder-old/primp-database.cert on 23-Sep-2022 23:54:43 Built /build/acl2-8.3dfsg/books/projects/async/serial-adder/32-bit-serial-adder-old/primp-database.cert (4.594s) Making /build/acl2-8.3dfsg/books/projects/async/serial-adder/32-bit-serial-adder-old/constants.cert on 23-Sep-2022 23:54:48 Built /build/acl2-8.3dfsg/books/projects/async/serial-adder/32-bit-serial-adder-old/constants.cert (4.531s) Making /build/acl2-8.3dfsg/books/projects/async/serial-adder/32-bit-serial-adder-old/utils.cert on 23-Sep-2022 23:54:53 Built /build/acl2-8.3dfsg/books/projects/async/serial-adder/32-bit-serial-adder-old/utils.cert (6.666s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/measures.cert on 23-Sep-2022 23:55:00 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/measures.cert (4.617s) Making /build/acl2-8.3dfsg/books/projects/rp-rewriter/meta/falist-meta-fns.cert on 23-Sep-2022 23:55:05 Built /build/acl2-8.3dfsg/books/projects/rp-rewriter/meta/falist-meta-fns.cert (6.376s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/stobj-based/soundness.cert on 23-Sep-2022 23:55:11 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/stobj-based/soundness.cert (2.877s) Making /build/acl2-8.3dfsg/books/projects/taspi/database/db.cert on 23-Sep-2022 23:55:14 Built /build/acl2-8.3dfsg/books/projects/taspi/database/db.cert (48.008s) Making /build/acl2-8.3dfsg/books/projects/taspi/sets-input/mast.cert on 23-Sep-2022 23:56:02 Built /build/acl2-8.3dfsg/books/projects/taspi/sets-input/mast.cert (6.686s) Making /build/acl2-8.3dfsg/books/projects/taspi/single-input/tree-stats.cert on 23-Sep-2022 23:56:09 Built /build/acl2-8.3dfsg/books/projects/taspi/single-input/tree-stats.cert (7.376s) Making /build/acl2-8.3dfsg/books/projects/taspi/tree-generation/tree-gen-helper/basics.cert on 23-Sep-2022 23:56:17 Built /build/acl2-8.3dfsg/books/projects/taspi/tree-generation/tree-gen-helper/basics.cert (8.758s) Making /build/acl2-8.3dfsg/books/proofstyles/invclock/c2i/c2i-total.cert on 23-Sep-2022 23:56:26 Built /build/acl2-8.3dfsg/books/proofstyles/invclock/c2i/c2i-total.cert (8.982s) Making /build/acl2-8.3dfsg/books/proofstyles/invclock/compose/compose-c-c-partial.cert on 23-Sep-2022 23:56:35 Built /build/acl2-8.3dfsg/books/proofstyles/invclock/compose/compose-c-c-partial.cert (5.728s) Making /build/acl2-8.3dfsg/books/proofstyles/invclock/compose/compose-c-c-total.cert on 23-Sep-2022 23:56:41 Built /build/acl2-8.3dfsg/books/proofstyles/invclock/compose/compose-c-c-total.cert (6.246s) Making /build/acl2-8.3dfsg/books/proofstyles/invclock/i2c/i2c-total.cert on 23-Sep-2022 23:56:47 Built /build/acl2-8.3dfsg/books/proofstyles/invclock/i2c/i2c-total.cert (5.061s) Making /build/acl2-8.3dfsg/books/textbook/chap11/finite-sets.cert on 23-Sep-2022 23:56:52 Built /build/acl2-8.3dfsg/books/textbook/chap11/finite-sets.cert (4.268s) Making /build/acl2-8.3dfsg/books/textbook/chap11/starters.cert on 23-Sep-2022 23:56:57 Built /build/acl2-8.3dfsg/books/textbook/chap11/starters.cert (3.867s) Making /build/acl2-8.3dfsg/books/textbook/chap11/tautology.cert on 23-Sep-2022 23:57:01 Built /build/acl2-8.3dfsg/books/textbook/chap11/tautology.cert (13.835s) Making /build/acl2-8.3dfsg/books/textbook/chap6/selected-solutions.cert on 23-Sep-2022 23:57:15 Built /build/acl2-8.3dfsg/books/textbook/chap6/selected-solutions.cert (7.685s) Making /build/acl2-8.3dfsg/books/workshops/1999/compiler/machine.cert on 23-Sep-2022 23:57:22 Built /build/acl2-8.3dfsg/books/workshops/1999/compiler/machine.cert (8.241s) Making /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/measure.cert on 23-Sep-2022 23:57:31 Built /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/measure.cert (2.979s) Making /build/acl2-8.3dfsg/books/workshops/1999/graph/find-path1.cert on 23-Sep-2022 23:57:34 Built /build/acl2-8.3dfsg/books/workshops/1999/graph/find-path1.cert (9.372s) Making /build/acl2-8.3dfsg/books/workshops/1999/graph/find-path2.cert on 23-Sep-2022 23:57:43 Built /build/acl2-8.3dfsg/books/workshops/1999/graph/find-path2.cert (8.888s) Making /build/acl2-8.3dfsg/books/workshops/1999/graph/find-path3.cert on 23-Sep-2022 23:57:53 Built /build/acl2-8.3dfsg/books/workshops/1999/graph/find-path3.cert (9.163s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/base.cert on 23-Sep-2022 23:58:02 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/base.cert (15.267s) Making /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise3.cert on 23-Sep-2022 23:58:17 Built /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/exercise3.cert (3.439s) Making /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/knuth-arch.cert on 23-Sep-2022 23:58:21 Built /build/acl2-8.3dfsg/books/workshops/1999/knuth-91/knuth-arch.cert (11.261s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/book/semantics.cert on 23-Sep-2022 23:58:32 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/book/semantics.cert (5.297s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/syntax.cert on 23-Sep-2022 23:58:38 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/syntax.cert (4.630s) Making /build/acl2-8.3dfsg/books/workshops/1999/ste/circuit.cert on 23-Sep-2022 23:58:43 Built /build/acl2-8.3dfsg/books/workshops/1999/ste/circuit.cert (5.599s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/top/det-encap-wfbisim.cert on 23-Sep-2022 23:58:48 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/top/det-encap-wfbisim.cert (5.216s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/top/non-det-encap-wfbisim.cert on 23-Sep-2022 23:58:54 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/top/non-det-encap-wfbisim.cert (5.646s) Making /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/multiset.cert on 23-Sep-2022 23:58:59 Built /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/multiset.cert (9.360s) Making /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/examples/newman/abstract-proofs.cert on 23-Sep-2022 23:59:09 Built /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/examples/newman/abstract-proofs.cert (5.726s) Making /build/acl2-8.3dfsg/books/workshops/2000/sumners1/cdeq/cdeq-defs.cert on 23-Sep-2022 23:59:15 Built /build/acl2-8.3dfsg/books/workshops/2000/sumners1/cdeq/cdeq-defs.cert (17.942s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-dags/support/dags.cert on 23-Sep-2022 23:59:33 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-dags/support/dags.cert (10.328s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/subsumption.cert on 23-Sep-2022 23:59:44 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/subsumption.cert (6.344s) Making /build/acl2-8.3dfsg/books/workshops/2003/hbl/support/sol2.cert on 23-Sep-2022 23:59:50 Built /build/acl2-8.3dfsg/books/workshops/2003/hbl/support/sol2.cert (24.039s) Making /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/mscal.cert on 24-Sep-2022 00:00:14 Built /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/mscal.cert (4.914s) Making /build/acl2-8.3dfsg/books/workshops/2003/matlin-mccune/support/simp.cert on 24-Sep-2022 00:00:19 Built /build/acl2-8.3dfsg/books/workshops/2003/matlin-mccune/support/simp.cert (9.106s) Making /build/acl2-8.3dfsg/books/workshops/2003/moore_rockwell/support/memory-taggings.cert on 24-Sep-2022 00:00:29 Built /build/acl2-8.3dfsg/books/workshops/2003/moore_rockwell/support/memory-taggings.cert (132.835s) Making /build/acl2-8.3dfsg/books/workshops/2003/moore_vcg/support/m5.cert on 24-Sep-2022 00:02:42 Built /build/acl2-8.3dfsg/books/workshops/2003/moore_vcg/support/m5.cert (58.389s) Making /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/concrete-ltl.cert on 24-Sep-2022 00:03:40 Built /build/acl2-8.3dfsg/books/workshops/2003/ray-matthews-tuttle/support/concrete-ltl.cert (90.222s) Making /build/acl2-8.3dfsg/books/workshops/2003/sumners/support/cfair.cert on 24-Sep-2022 00:05:11 Built /build/acl2-8.3dfsg/books/workshops/2003/sumners/support/cfair.cert (8.226s) Making /build/acl2-8.3dfsg/books/workshops/2003/sumners/support/fair1.cert on 24-Sep-2022 00:05:19 Built /build/acl2-8.3dfsg/books/workshops/2003/sumners/support/fair1.cert (5.080s) Making /build/acl2-8.3dfsg/books/workshops/2003/sumners/support/fair2.cert on 24-Sep-2022 00:05:24 Built /build/acl2-8.3dfsg/books/workshops/2003/sumners/support/fair2.cert (4.310s) Making /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/prefix-unification-rules.cert on 24-Sep-2022 00:05:29 Built /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/prefix-unification-rules.cert (9.720s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/meta.cert on 24-Sep-2022 00:05:39 Tick Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/meta.cert (312.211s) Making /build/acl2-8.3dfsg/books/workshops/2007/rubio/support/multisets/multiset.cert on 24-Sep-2022 00:10:51 Built /build/acl2-8.3dfsg/books/workshops/2007/rubio/support/multisets/multiset.cert (9.501s) Making /build/acl2-8.3dfsg/books/xdoc/importance.cert on 24-Sep-2022 00:11:01 Built /build/acl2-8.3dfsg/books/xdoc/importance.cert (29.313s) Making /build/acl2-8.3dfsg/books/ordinals/limits.cert on 24-Sep-2022 00:11:30 Built /build/acl2-8.3dfsg/books/ordinals/limits.cert (8.370s) Making /build/acl2-8.3dfsg/books/std/strings/isubstrp.cert on 24-Sep-2022 00:11:39 Built /build/acl2-8.3dfsg/books/std/strings/isubstrp.cert (5.786s) Making /build/acl2-8.3dfsg/books/projects/rp-rewriter/proofs/aux-function-lemmas.cert on 24-Sep-2022 00:11:45 Built /build/acl2-8.3dfsg/books/projects/rp-rewriter/proofs/aux-function-lemmas.cert (15.906s) Making /build/acl2-8.3dfsg/books/centaur/svl/tools.cert on 24-Sep-2022 00:12:01 Built /build/acl2-8.3dfsg/books/centaur/svl/tools.cert (6.090s) Making /build/acl2-8.3dfsg/books/centaur/svl/svl-flatten-simplify-lemmas.cert on 24-Sep-2022 00:12:07 Built /build/acl2-8.3dfsg/books/centaur/svl/svl-flatten-simplify-lemmas.cert (5.480s) Making /build/acl2-8.3dfsg/books/defexec/dag-unification/dag-unification-rules.cert on 24-Sep-2022 00:12:13 Built /build/acl2-8.3dfsg/books/defexec/dag-unification/dag-unification-rules.cert (14.765s) Making /build/acl2-8.3dfsg/books/defexec/find-path/graph/linear-find-path.cert on 24-Sep-2022 00:12:28 Built /build/acl2-8.3dfsg/books/defexec/find-path/graph/linear-find-path.cert (15.026s) Making /build/acl2-8.3dfsg/books/ordinals/ordinals.cert on 24-Sep-2022 00:12:43 Built /build/acl2-8.3dfsg/books/ordinals/ordinals.cert (3.072s) Making /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/final-theorem.cert on 24-Sep-2022 00:12:46 Built /build/acl2-8.3dfsg/books/defexec/other-apps/qsort/final-theorem.cert (3.489s) Making /build/acl2-8.3dfsg/books/misc/fibonacci.cert on 24-Sep-2022 00:12:50 Built /build/acl2-8.3dfsg/books/misc/fibonacci.cert (3.920s) Making /build/acl2-8.3dfsg/books/nonstd/fft/eval-poly.cert on 24-Sep-2022 00:12:54 Built /build/acl2-8.3dfsg/books/nonstd/fft/eval-poly.cert (5.227s) Making /build/acl2-8.3dfsg/books/powerlists/sort.cert on 24-Sep-2022 00:12:59 Built /build/acl2-8.3dfsg/books/powerlists/sort.cert (4.513s) Making /build/acl2-8.3dfsg/books/powerlists/simple.cert on 24-Sep-2022 00:13:04 Built /build/acl2-8.3dfsg/books/powerlists/simple.cert (5.742s) Making /build/acl2-8.3dfsg/books/projects/async/vector-macros.cert on 24-Sep-2022 00:13:10 Built /build/acl2-8.3dfsg/books/projects/async/vector-macros.cert (6.052s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/fairenv.cert on 24-Sep-2022 00:13:16 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/fairenv.cert (4.455s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/lexicographic.cert on 24-Sep-2022 00:13:21 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/lexicographic.cert (2.967s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/sorted/lrat-checker-support.cert on 24-Sep-2022 00:13:24 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/sorted/lrat-checker-support.cert (7.426s) Making /build/acl2-8.3dfsg/books/projects/symbolic/generic/assertions.cert on 24-Sep-2022 00:13:31 Built /build/acl2-8.3dfsg/books/projects/symbolic/generic/assertions.cert (4.782s) Making /build/acl2-8.3dfsg/books/projects/symbolic/generic/measures.cert on 24-Sep-2022 00:13:36 Built /build/acl2-8.3dfsg/books/projects/symbolic/generic/measures.cert (5.644s) Making /build/acl2-8.3dfsg/books/projects/symbolic/generic/partial-correctness.cert on 24-Sep-2022 00:13:42 Built /build/acl2-8.3dfsg/books/projects/symbolic/generic/partial-correctness.cert (6.797s) Making /build/acl2-8.3dfsg/books/projects/taspi/database/filters.cert on 24-Sep-2022 00:13:49 Built /build/acl2-8.3dfsg/books/projects/taspi/database/filters.cert (47.308s) Making /build/acl2-8.3dfsg/books/projects/taspi/sets-input/mct.cert on 24-Sep-2022 00:14:37 Built /build/acl2-8.3dfsg/books/projects/taspi/sets-input/mct.cert (6.666s) Making /build/acl2-8.3dfsg/books/projects/taspi/tree-generation/branch-and-bound/bandb.cert on 24-Sep-2022 00:14:44 Built /build/acl2-8.3dfsg/books/projects/taspi/tree-generation/branch-and-bound/bandb.cert (45.344s) Making /build/acl2-8.3dfsg/books/projects/taspi/tree-generation/heuristics/spr.cert on 24-Sep-2022 00:15:29 Built /build/acl2-8.3dfsg/books/projects/taspi/tree-generation/heuristics/spr.cert (9.995s) Making /build/acl2-8.3dfsg/books/proofstyles/completeness/assertions-partial.cert on 24-Sep-2022 00:15:39 Built /build/acl2-8.3dfsg/books/proofstyles/completeness/assertions-partial.cert (4.909s) Making /build/acl2-8.3dfsg/books/proofstyles/completeness/assertions-total.cert on 24-Sep-2022 00:15:44 Built /build/acl2-8.3dfsg/books/proofstyles/completeness/assertions-total.cert (5.343s) Making /build/acl2-8.3dfsg/books/proofstyles/invclock/c2i/clock-to-inv.cert on 24-Sep-2022 00:15:50 Built /build/acl2-8.3dfsg/books/proofstyles/invclock/c2i/clock-to-inv.cert (4.344s) Making /build/acl2-8.3dfsg/books/proofstyles/invclock/i2c/inv-to-clock.cert on 24-Sep-2022 00:15:54 Built /build/acl2-8.3dfsg/books/proofstyles/invclock/i2c/inv-to-clock.cert (4.142s) Making /build/acl2-8.3dfsg/books/proofstyles/soundness/assertions-partial.cert on 24-Sep-2022 00:15:59 Built /build/acl2-8.3dfsg/books/proofstyles/soundness/assertions-partial.cert (15.069s) Making /build/acl2-8.3dfsg/books/proofstyles/soundness/assertions-total.cert on 24-Sep-2022 00:16:14 Built /build/acl2-8.3dfsg/books/proofstyles/soundness/assertions-total.cert (15.286s) Making /build/acl2-8.3dfsg/books/proofstyles/soundness/stepwise-invariants-total.cert on 24-Sep-2022 00:16:29 Built /build/acl2-8.3dfsg/books/proofstyles/soundness/stepwise-invariants-total.cert (4.878s) Making /build/acl2-8.3dfsg/books/workshops/1999/compiler/compiler.cert on 24-Sep-2022 00:16:34 Built /build/acl2-8.3dfsg/books/workshops/1999/compiler/compiler.cert (6.071s) Making /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/primitives.cert on 24-Sep-2022 00:16:41 Built /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/primitives.cert (3.642s) Making /build/acl2-8.3dfsg/books/workshops/1999/graph/linear-find-path.cert on 24-Sep-2022 00:16:45 Built /build/acl2-8.3dfsg/books/workshops/1999/graph/linear-find-path.cert (14.967s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/variables.cert on 24-Sep-2022 00:17:00 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/variables.cert (25.901s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/xeval.cert on 24-Sep-2022 00:17:26 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/xeval.cert (6.344s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/exercises/solution1.cert on 24-Sep-2022 00:17:32 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/exercises/solution1.cert (3.820s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/exercises/solution5.cert on 24-Sep-2022 00:17:36 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/exercises/solution5.cert (8.617s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/sugar.cert on 24-Sep-2022 00:17:45 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/sugar.cert (8.830s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/semantics.cert on 24-Sep-2022 00:17:54 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/semantics.cert (46.403s) Making /build/acl2-8.3dfsg/books/workshops/1999/ste/trajectory.cert on 24-Sep-2022 00:18:41 Built /build/acl2-8.3dfsg/books/workshops/1999/ste/trajectory.cert (3.923s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/top/ma128-isa128.cert on 24-Sep-2022 00:18:45 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/top/ma128-isa128.cert (12.556s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/ma/ma-isa-flush.cert on 24-Sep-2022 00:18:57 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/ma/ma-isa-flush.cert (24.821s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/ma/ma-isa.cert on 24-Sep-2022 00:19:22 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/ma/ma-isa.cert (6.636s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/top/ma128int-isa128int.cert on 24-Sep-2022 00:19:29 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/top/ma128int-isa128int.cert (13.443s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/int/ma-int-isa-int.cert on 24-Sep-2022 00:19:43 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/int/ma-int-isa-int.cert (7.894s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/ma/ma-isa.cert on 24-Sep-2022 00:19:51 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/ma/ma-isa.cert (7.020s) Making /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/defmul.cert on 24-Sep-2022 00:19:58 Built /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/defmul.cert (12.935s) Making /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/examples/newman/confluence-v0.cert on 24-Sep-2022 00:20:11 Built /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/examples/newman/confluence-v0.cert (5.387s) Making /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/examples/newman/confluence.cert on 24-Sep-2022 00:20:17 Built /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/examples/newman/confluence.cert (5.128s) Making /build/acl2-8.3dfsg/books/workshops/2000/sumners1/cdeq/cdeq-phase1.cert on 24-Sep-2022 00:20:22 Built /build/acl2-8.3dfsg/books/workshops/2000/sumners1/cdeq/cdeq-phase1.cert (4.808s) Making /build/acl2-8.3dfsg/books/workshops/2000/sumners1/cdeq/cdeq-phase2.cert on 24-Sep-2022 00:20:27 Built /build/acl2-8.3dfsg/books/workshops/2000/sumners1/cdeq/cdeq-phase2.cert (153.189s) Making /build/acl2-8.3dfsg/books/workshops/2000/sumners1/cdeq/cdeq-phase3.cert on 24-Sep-2022 00:23:00 Built /build/acl2-8.3dfsg/books/workshops/2000/sumners1/cdeq/cdeq-phase3.cert (4.017s) Making /build/acl2-8.3dfsg/books/workshops/2000/sumners1/cdeq/cdeq-phase4.cert on 24-Sep-2022 00:23:04 Built /build/acl2-8.3dfsg/books/workshops/2000/sumners1/cdeq/cdeq-phase4.cert (14.617s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/anti-unification.cert on 24-Sep-2022 00:23:19 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/anti-unification.cert (8.291s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/renamings.cert on 24-Sep-2022 00:23:28 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/renamings.cert (6.022s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/subsumption-subst.cert on 24-Sep-2022 00:23:34 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/subsumption-subst.cert (4.970s) Making /build/acl2-8.3dfsg/books/workshops/2003/greve-wilding_mbe/support/fpst.cert on 24-Sep-2022 00:23:39 Built /build/acl2-8.3dfsg/books/workshops/2003/greve-wilding_mbe/support/fpst.cert (126.796s) Making /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/msub.cert on 24-Sep-2022 00:25:46 Built /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/msub.cert (2.890s) Making /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/mmult.cert on 24-Sep-2022 00:25:49 Built /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/mmult.cert (20.737s) Making /build/acl2-8.3dfsg/books/workshops/2003/sumners/support/example1.cert on 24-Sep-2022 00:26:10 Built /build/acl2-8.3dfsg/books/workshops/2003/sumners/support/example1.cert (4.362s) Making /build/acl2-8.3dfsg/books/workshops/2003/sumners/support/example2.cert on 24-Sep-2022 00:26:14 Built /build/acl2-8.3dfsg/books/workshops/2003/sumners/support/example2.cert (4.479s) Making /build/acl2-8.3dfsg/books/workshops/2003/sumners/support/example3.cert on 24-Sep-2022 00:26:19 Built /build/acl2-8.3dfsg/books/workshops/2003/sumners/support/example3.cert (19.207s) Making /build/acl2-8.3dfsg/books/workshops/2003/sustik/support/dickson.cert on 24-Sep-2022 00:26:38 Built /build/acl2-8.3dfsg/books/workshops/2003/sustik/support/dickson.cert (11.830s) Making /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/dag-unification-rules.cert on 24-Sep-2022 00:26:50 Built /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/dag-unification-rules.cert (16.651s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/bind-free-rules.cert on 24-Sep-2022 00:27:07 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/bind-free-rules.cert (26.635s) Making /build/acl2-8.3dfsg/books/workshops/2007/rubio/support/multisets/defmul.cert on 24-Sep-2022 00:27:34 Built /build/acl2-8.3dfsg/books/workshops/2007/rubio/support/multisets/defmul.cert (11.983s) Making /build/acl2-8.3dfsg/books/workshops/2011/krug-et-al/support/Symbolic/vanilla-partial-correctness.cert on 24-Sep-2022 00:27:46 Built /build/acl2-8.3dfsg/books/workshops/2011/krug-et-al/support/Symbolic/vanilla-partial-correctness.cert (9.440s) Making /build/acl2-8.3dfsg/books/workshops/2014/puri-ray-hao-xie/support/functions.cert on 24-Sep-2022 00:27:56 Built /build/acl2-8.3dfsg/books/workshops/2014/puri-ray-hao-xie/support/functions.cert (12.940s) Making /build/acl2-8.3dfsg/books/xdoc/linkcheck.cert on 24-Sep-2022 00:28:09 Built /build/acl2-8.3dfsg/books/xdoc/linkcheck.cert (9.114s) Making /build/acl2-8.3dfsg/books/ordinals/ordinals-without-arithmetic.cert on 24-Sep-2022 00:28:18 Built /build/acl2-8.3dfsg/books/ordinals/ordinals-without-arithmetic.cert (2.389s) Making /build/acl2-8.3dfsg/books/defexec/dag-unification/terms-as-dag.cert on 24-Sep-2022 00:28:21 Built /build/acl2-8.3dfsg/books/defexec/dag-unification/terms-as-dag.cert (27.844s) Making /build/acl2-8.3dfsg/books/defexec/dag-unification/terms-dag-stobj.cert on 24-Sep-2022 00:28:49 Built /build/acl2-8.3dfsg/books/defexec/dag-unification/terms-dag-stobj.cert (5.454s) Making /build/acl2-8.3dfsg/books/defexec/find-path/fpst.cert on 24-Sep-2022 00:28:54 Built /build/acl2-8.3dfsg/books/defexec/find-path/fpst.cert (123.751s) Making /build/acl2-8.3dfsg/books/defexec/ordinals/supporting-ordinals.cert on 24-Sep-2022 00:30:58 Built /build/acl2-8.3dfsg/books/defexec/ordinals/supporting-ordinals.cert (4.116s) Making /build/acl2-8.3dfsg/books/nonstd/fft/fft-omega.cert on 24-Sep-2022 00:31:02 Built /build/acl2-8.3dfsg/books/nonstd/fft/fft-omega.cert (5.429s) Making /build/acl2-8.3dfsg/books/powerlists/merge-sort.cert on 24-Sep-2022 00:31:08 Built /build/acl2-8.3dfsg/books/powerlists/merge-sort.cert (4.919s) Making /build/acl2-8.3dfsg/books/powerlists/prefix-sum.cert on 24-Sep-2022 00:31:13 Built /build/acl2-8.3dfsg/books/powerlists/prefix-sum.cert (12.044s) Making /build/acl2-8.3dfsg/books/powerlists/gray-code.cert on 24-Sep-2022 00:31:25 Built /build/acl2-8.3dfsg/books/powerlists/gray-code.cert (5.997s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/properties.cert on 24-Sep-2022 00:31:31 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/properties.cert (11.752s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/programs.cert on 24-Sep-2022 00:31:43 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/programs.cert (5.876s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/sorted/lrat-checker.cert on 24-Sep-2022 00:31:49 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/sorted/lrat-checker.cert (22.984s) Making /build/acl2-8.3dfsg/books/projects/symbolic/generic/total-correctness.cert on 24-Sep-2022 00:32:13 Built /build/acl2-8.3dfsg/books/projects/symbolic/generic/total-correctness.cert (7.082s) Making /build/acl2-8.3dfsg/books/projects/taspi/sets-input/top.cert on 24-Sep-2022 00:32:20 Built /build/acl2-8.3dfsg/books/projects/taspi/sets-input/top.cert (6.048s) Making /build/acl2-8.3dfsg/books/projects/taspi/tree-generation/heuristics/tbr.cert on 24-Sep-2022 00:32:26 Built /build/acl2-8.3dfsg/books/projects/taspi/tree-generation/heuristics/tbr.cert (16.463s) Making /build/acl2-8.3dfsg/books/workshops/1999/compiler/evaluator.cert on 24-Sep-2022 00:32:43 Built /build/acl2-8.3dfsg/books/workshops/1999/compiler/evaluator.cert (13.677s) Making /build/acl2-8.3dfsg/books/workshops/1999/compiler/exercises.cert on 24-Sep-2022 00:32:56 Built /build/acl2-8.3dfsg/books/workshops/1999/compiler/exercises.cert (3.626s) Making /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/syntax.cert on 24-Sep-2022 00:33:00 Built /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/syntax.cert (4.674s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/alls.cert on 24-Sep-2022 00:33:05 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/alls.cert (5.984s) Making /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/ctl.cert on 24-Sep-2022 00:33:11 Built /build/acl2-8.3dfsg/books/workshops/1999/mu-calculus/solutions/ctl.cert (11.405s) Making /build/acl2-8.3dfsg/books/workshops/1999/ste/assertion.cert on 24-Sep-2022 00:33:23 Built /build/acl2-8.3dfsg/books/workshops/1999/ste/assertion.cert (215.201s) Making /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/lexicographical-ordering.cert on 24-Sep-2022 00:36:58 Built /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/lexicographical-ordering.cert (5.191s) Making /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/examples/ackermann/ackermann.cert on 24-Sep-2022 00:37:03 Built /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/examples/ackermann/ackermann.cert (5.595s) Making /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/examples/mccarthy-91/mccarthy-91.cert on 24-Sep-2022 00:37:09 Built /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/examples/mccarthy-91/mccarthy-91.cert (4.809s) Making /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/examples/newman/newman.cert on 24-Sep-2022 00:37:14 Built /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/examples/newman/newman.cert (7.844s) Making /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/npol-ordering-1.cert on 24-Sep-2022 00:37:22 Built /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/npol-ordering-1.cert (4.036s) Making /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/npol-ordering-2.cert on 24-Sep-2022 00:37:26 Built /build/acl2-8.3dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/npol-ordering-2.cert (4.175s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/subsumption-well-founded.cert on 24-Sep-2022 00:37:31 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/subsumption-well-founded.cert (4.883s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/unification-pattern.cert on 24-Sep-2022 00:37:36 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/unification-pattern.cert (7.665s) Making /build/acl2-8.3dfsg/books/workshops/2003/greve-wilding_mbe/support/run-fpst.cert on 24-Sep-2022 00:37:44 Built /build/acl2-8.3dfsg/books/workshops/2003/greve-wilding_mbe/support/run-fpst.cert (9.017s) Making /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/mtrans.cert on 24-Sep-2022 00:37:53 Tick Built /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/mtrans.cert (6.308s) Making /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/q-dag-unification-rules.cert on 24-Sep-2022 00:37:59 Built /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/q-dag-unification-rules.cert (6.954s) Making /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/terms-as-dag.cert on 24-Sep-2022 00:38:06 Built /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/terms-as-dag.cert (28.459s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/neq.cert on 24-Sep-2022 00:38:35 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/neq.cert (8.452s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/two-level.cert on 24-Sep-2022 00:38:44 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/two-level.cert (9.939s) Making /build/acl2-8.3dfsg/books/workshops/2007/rubio/support/abstract-reductions/newman.cert on 24-Sep-2022 00:38:54 Built /build/acl2-8.3dfsg/books/workshops/2007/rubio/support/abstract-reductions/newman.cert (8.017s) Making /build/acl2-8.3dfsg/books/workshops/2011/krug-et-al/support/Symbolic/extended-partial-correctness.cert on 24-Sep-2022 00:39:02 Built /build/acl2-8.3dfsg/books/workshops/2011/krug-et-al/support/Symbolic/extended-partial-correctness.cert (9.115s) Making /build/acl2-8.3dfsg/books/workshops/2014/puri-ray-hao-xie/support/semantics.cert on 24-Sep-2022 00:39:11 Built /build/acl2-8.3dfsg/books/workshops/2014/puri-ray-hao-xie/support/semantics.cert (132.229s) Making /build/acl2-8.3dfsg/books/ordinals/lexicographic-book.cert on 24-Sep-2022 00:41:24 Built /build/acl2-8.3dfsg/books/ordinals/lexicographic-book.cert (5.956s) Making /build/acl2-8.3dfsg/books/defexec/dag-unification/dag-unification-l.cert on 24-Sep-2022 00:41:30 Built /build/acl2-8.3dfsg/books/defexec/dag-unification/dag-unification-l.cert (4.747s) Making /build/acl2-8.3dfsg/books/defexec/find-path/run-fpst.cert on 24-Sep-2022 00:41:35 Built /build/acl2-8.3dfsg/books/defexec/find-path/run-fpst.cert (8.340s) Making /build/acl2-8.3dfsg/books/powerlists/batcher-sort.cert on 24-Sep-2022 00:41:43 Built /build/acl2-8.3dfsg/books/powerlists/batcher-sort.cert (50.998s) Making /build/acl2-8.3dfsg/books/powerlists/cla-adder.cert on 24-Sep-2022 00:42:34 Built /build/acl2-8.3dfsg/books/powerlists/cla-adder.cert (8.073s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/labels.cert on 24-Sep-2022 00:42:42 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/labels.cert (2.778s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/stutter1-match.cert on 24-Sep-2022 00:42:45 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/stutter1-match.cert (20.930s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/pos-temp.cert on 24-Sep-2022 00:43:06 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/pos-temp.cert (3.435s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/initial-state.cert on 24-Sep-2022 00:43:10 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/initial-state.cert (2.940s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/sorted/lrat-parser.cert on 24-Sep-2022 00:43:13 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/sorted/lrat-parser.cert (7.330s) Making /build/acl2-8.3dfsg/books/projects/symbolic/generic/defsimulate.cert on 24-Sep-2022 00:43:21 Built /build/acl2-8.3dfsg/books/projects/symbolic/generic/defsimulate.cert (17.510s) Making /build/acl2-8.3dfsg/books/projects/taspi/tree-generation/heuristics/do-search.cert on 24-Sep-2022 00:43:38 Built /build/acl2-8.3dfsg/books/projects/taspi/tree-generation/heuristics/do-search.cert (16.185s) Making /build/acl2-8.3dfsg/books/workshops/1999/compiler/proof1.cert on 24-Sep-2022 00:43:55 Built /build/acl2-8.3dfsg/books/workshops/1999/compiler/proof1.cert (9.371s) Making /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/arity.cert on 24-Sep-2022 00:44:04 Built /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/arity.cert (4.161s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/wfftype.cert on 24-Sep-2022 00:44:08 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/wfftype.cert (11.124s) Making /build/acl2-8.3dfsg/books/workshops/1999/ste/lemma-4.cert on 24-Sep-2022 00:44:20 Built /build/acl2-8.3dfsg/books/workshops/1999/ste/lemma-4.cert (145.867s) Making /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/normal-form.cert on 24-Sep-2022 00:46:46 Built /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/normal-form.cert (9.772s) Making /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/examples/newman/local-confluence.cert on 24-Sep-2022 00:46:56 Built /build/acl2-8.3dfsg/books/workshops/2000/ruiz/multiset/examples/newman/local-confluence.cert (6.090s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/unification.cert on 24-Sep-2022 00:47:02 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/unification.cert (6.171s) Making /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/matrices.cert on 24-Sep-2022 00:47:08 Built /build/acl2-8.3dfsg/books/workshops/2003/hendrix/support/matrices.cert (3.016s) Making /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/q-dag-unification.cert on 24-Sep-2022 00:47:11 Built /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/q-dag-unification.cert (111.947s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/two-level-meta.cert on 24-Sep-2022 00:49:04 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/two-level-meta.cert (5.338s) Making /build/acl2-8.3dfsg/books/workshops/2007/rubio/support/abstract-reductions/convergent.cert on 24-Sep-2022 00:49:09 Built /build/acl2-8.3dfsg/books/workshops/2007/rubio/support/abstract-reductions/convergent.cert (6.566s) Making /build/acl2-8.3dfsg/books/workshops/2011/krug-et-al/support/Symbolic/defsimulate+.cert on 24-Sep-2022 00:49:16 Built /build/acl2-8.3dfsg/books/workshops/2011/krug-et-al/support/Symbolic/defsimulate+.cert (10.649s) Making /build/acl2-8.3dfsg/books/workshops/2014/puri-ray-hao-xie/support/general-theorems.cert on 24-Sep-2022 00:49:27 Built /build/acl2-8.3dfsg/books/workshops/2014/puri-ray-hao-xie/support/general-theorems.cert (4.480s) Making /build/acl2-8.3dfsg/books/ordinals/lexicographic-ordering-without-arithmetic.cert on 24-Sep-2022 00:49:31 Built /build/acl2-8.3dfsg/books/ordinals/lexicographic-ordering-without-arithmetic.cert (2.452s) Making /build/acl2-8.3dfsg/books/ordinals/lexicographic-ordering.cert on 24-Sep-2022 00:49:34 Built /build/acl2-8.3dfsg/books/ordinals/lexicographic-ordering.cert (2.867s) Making /build/acl2-8.3dfsg/books/defexec/dag-unification/dag-unification-st.cert on 24-Sep-2022 00:49:37 Built /build/acl2-8.3dfsg/books/defexec/dag-unification/dag-unification-st.cert (20.954s) Making /build/acl2-8.3dfsg/books/powerlists/bitonic-sort.cert on 24-Sep-2022 00:49:58 Built /build/acl2-8.3dfsg/books/powerlists/bitonic-sort.cert (9.730s) Making /build/acl2-8.3dfsg/books/projects/codewalker/terminatricks.cert on 24-Sep-2022 00:50:08 Built /build/acl2-8.3dfsg/books/projects/codewalker/terminatricks.cert (35.775s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/lexicographic-pos.cert on 24-Sep-2022 00:50:44 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/lexicographic-pos.cert (3.640s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/sorted/run.cert on 24-Sep-2022 00:50:48 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/sorted/run.cert (3.366s) Making /build/acl2-8.3dfsg/books/projects/sat/lrat/sorted/test-driver.cert on 24-Sep-2022 00:50:51 Built /build/acl2-8.3dfsg/books/projects/sat/lrat/sorted/test-driver.cert (3.814s) Making /build/acl2-8.3dfsg/books/projects/wp-gen/mutrec/mutrec.cert on 24-Sep-2022 00:50:55 Built /build/acl2-8.3dfsg/books/projects/wp-gen/mutrec/mutrec.cert (6.087s) Making /build/acl2-8.3dfsg/books/system/toothbrush-deps.cert on 24-Sep-2022 00:51:01 Built /build/acl2-8.3dfsg/books/system/toothbrush-deps.cert (2.461s) Making /build/acl2-8.3dfsg/books/system/untranslate-car-cdr.cert on 24-Sep-2022 00:51:04 Built /build/acl2-8.3dfsg/books/system/untranslate-car-cdr.cert (6.825s) Making /build/acl2-8.3dfsg/books/workshops/1999/compiler/proof.cert on 24-Sep-2022 00:51:11 Built /build/acl2-8.3dfsg/books/workshops/1999/compiler/proof.cert (30.078s) Making /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/sts-okp.cert on 24-Sep-2022 00:51:41 Built /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/sts-okp.cert (3.969s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/stage.cert on 24-Sep-2022 00:51:45 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/stage.cert (2.840s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/cnf.cert on 24-Sep-2022 00:51:48 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/cnf.cert (14.322s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/exercises/solution3.cert on 24-Sep-2022 00:52:03 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/exercises/solution3.cert (12.200s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/nnf.cert on 24-Sep-2022 00:52:15 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/nnf.cert (27.487s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/rename.cert on 24-Sep-2022 00:52:43 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/rename.cert (20.064s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/pull.cert on 24-Sep-2022 00:53:03 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/pull.cert (27.225s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/right-assoc.cert on 24-Sep-2022 00:53:30 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/right-assoc.cert (28.069s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/simplify.cert on 24-Sep-2022 00:53:59 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/simplify.cert (18.517s) Making /build/acl2-8.3dfsg/books/workshops/1999/ste/fundamental.cert on 24-Sep-2022 00:54:17 Built /build/acl2-8.3dfsg/books/workshops/1999/ste/fundamental.cert (100.642s) Making /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/addition.cert on 24-Sep-2022 00:55:58 Built /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/addition.cert (3.730s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/mg-instance.cert on 24-Sep-2022 00:56:02 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/mg-instance.cert (3.186s) Making /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/q-dag-unification-st.cert on 24-Sep-2022 00:56:05 Built /build/acl2-8.3dfsg/books/workshops/2004/ruiz-et-al/support/q-dag-unification-st.cert (28.332s) Making /build/acl2-8.3dfsg/books/workshops/2007/rubio/support/simplicial-topology/generate-degenerate.cert on 24-Sep-2022 00:56:34 Built /build/acl2-8.3dfsg/books/workshops/2007/rubio/support/simplicial-topology/generate-degenerate.cert (31.566s) Making /build/acl2-8.3dfsg/books/workshops/2009/fraij-roach/support/functions.cert on 24-Sep-2022 00:57:06 Built /build/acl2-8.3dfsg/books/workshops/2009/fraij-roach/support/functions.cert (10.275s) Making /build/acl2-8.3dfsg/books/workshops/2009/verbeek-schmaltz/verbeek/generic-modules/own-perm.cert on 24-Sep-2022 00:57:16 Built /build/acl2-8.3dfsg/books/workshops/2009/verbeek-schmaltz/verbeek/generic-modules/own-perm.cert (3.309s) Making /build/acl2-8.3dfsg/books/workshops/2013/verbeek-schmaltz/books/asynch2.cert on 24-Sep-2022 00:57:20 Built /build/acl2-8.3dfsg/books/workshops/2013/verbeek-schmaltz/books/asynch2.cert (6.119s) Making /build/acl2-8.3dfsg/books/workshops/2013/verbeek-schmaltz/books/parse-state-machine-descriptions.cert on 24-Sep-2022 00:57:26 Built /build/acl2-8.3dfsg/books/workshops/2013/verbeek-schmaltz/books/parse-state-machine-descriptions.cert (5.054s) Making /build/acl2-8.3dfsg/books/acl2s/ccg/ccg-settings-dependencies.cert on 24-Sep-2022 00:57:31 Built /build/acl2-8.3dfsg/books/acl2s/ccg/ccg-settings-dependencies.cert (2.875s) Making /build/acl2-8.3dfsg/books/acl2s/cgen/simple-graph-array.cert on 24-Sep-2022 00:57:34 Built /build/acl2-8.3dfsg/books/acl2s/cgen/simple-graph-array.cert (15.354s) Making /build/acl2-8.3dfsg/books/system/apply/apply.cert on 24-Sep-2022 00:57:50 Built /build/acl2-8.3dfsg/books/system/apply/apply.cert (79.867s) Making /build/acl2-8.3dfsg/books/coi/util/ordinal-order.cert on 24-Sep-2022 00:59:10 Built /build/acl2-8.3dfsg/books/coi/util/ordinal-order.cert (8.595s) Making /build/acl2-8.3dfsg/books/coi/defung/split.cert on 24-Sep-2022 00:59:18 Built /build/acl2-8.3dfsg/books/coi/defung/split.cert (41.513s) Making /build/acl2-8.3dfsg/books/coi/nary/ordinal-order.cert on 24-Sep-2022 01:00:00 Built /build/acl2-8.3dfsg/books/coi/nary/ordinal-order.cert (8.146s) Making /build/acl2-8.3dfsg/books/coi/termination/assuming/zero.cert on 24-Sep-2022 01:00:08 Built /build/acl2-8.3dfsg/books/coi/termination/assuming/zero.cert (16.208s) Making /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/utilities.cert on 24-Sep-2022 01:00:25 Built /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/utilities.cert (4.964s) Making /build/acl2-8.3dfsg/books/projects/codewalker/codewalker.cert on 24-Sep-2022 01:00:30 Built /build/acl2-8.3dfsg/books/projects/codewalker/codewalker.cert (50.911s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/stutter2.cert on 24-Sep-2022 01:01:21 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/stutter2.cert (149.156s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/inv-persists.cert on 24-Sep-2022 01:03:50 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/inv-persists.cert (33.490s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/inv-sufficient.cert on 24-Sep-2022 01:04:24 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/inv-sufficient.cert (2.850s) Making /build/acl2-8.3dfsg/books/projects/wp-gen/wp-gen.cert on 24-Sep-2022 01:04:27 Built /build/acl2-8.3dfsg/books/projects/wp-gen/wp-gen.cert (9.656s) Making /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/de4.cert on 24-Sep-2022 01:04:37 Built /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/de4.cert (5.850s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/keval.cert on 24-Sep-2022 01:04:43 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/keval.cert (8.502s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/instance.cert on 24-Sep-2022 01:04:51 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/instance.cert (11.755s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/sk-misc-lemmas.cert on 24-Sep-2022 01:05:03 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/sk-misc-lemmas.cert (8.374s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/rename-sound.cert on 24-Sep-2022 01:05:12 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/rename-sound.cert (11.694s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/rename-unique.cert on 24-Sep-2022 01:05:24 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/rename-unique.cert (10.400s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/sk-useless.cert on 24-Sep-2022 01:05:34 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/sk-useless.cert (42.898s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/sk-step.cert on 24-Sep-2022 01:06:17 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/sk-step.cert (12.056s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/pull-sound.cert on 24-Sep-2022 01:06:30 Tick Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/pull-sound.cert (118.887s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/pull-pulls.cert on 24-Sep-2022 01:08:29 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/pull-pulls.cert (68.200s) Making /build/acl2-8.3dfsg/books/workshops/1999/ste/inference.cert on 24-Sep-2022 01:09:37 Built /build/acl2-8.3dfsg/books/workshops/1999/ste/inference.cert (529.266s) Making /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/negation.cert on 24-Sep-2022 01:18:26 Built /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/negation.cert (3.773s) Making /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/lattice-of-terms.cert on 24-Sep-2022 01:18:30 Built /build/acl2-8.3dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/lattice-of-terms.cert (4.999s) Making /build/acl2-8.3dfsg/books/workshops/2009/fraij-roach/support/theorems.cert on 24-Sep-2022 01:18:35 Built /build/acl2-8.3dfsg/books/workshops/2009/fraij-roach/support/theorems.cert (54.869s) Making /build/acl2-8.3dfsg/books/workshops/2013/verbeek-schmaltz/books/asynch.cert on 24-Sep-2022 01:19:30 Built /build/acl2-8.3dfsg/books/workshops/2013/verbeek-schmaltz/books/asynch.cert (286.029s) Making /build/acl2-8.3dfsg/books/acl2s/cgen/select.cert on 24-Sep-2022 01:24:17 Built /build/acl2-8.3dfsg/books/acl2s/cgen/select.cert (12.400s) Making /build/acl2-8.3dfsg/books/projects/apply/base.cert on 24-Sep-2022 01:24:29 Built /build/acl2-8.3dfsg/books/projects/apply/base.cert (283.895s) Making /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/fast.cert on 24-Sep-2022 01:29:13 Built /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/fast.cert (25.175s) Making /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/final-theorems.cert on 24-Sep-2022 01:29:39 Built /build/acl2-8.3dfsg/books/projects/concurrent-programs/bakery/final-theorems.cert (2.827s) Making /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/examples.cert on 24-Sep-2022 01:29:42 Built /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/examples.cert (2.582s) Making /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/thm-example.cert on 24-Sep-2022 01:29:44 Built /build/acl2-8.3dfsg/books/workshops/1999/de-hdl/thm-example.cert (5.223s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/close.cert on 24-Sep-2022 01:29:50 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/close.cert (89.958s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/exercises/solution2.cert on 24-Sep-2022 01:31:20 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/exercises/solution2.cert (32.750s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/rename-top.cert on 24-Sep-2022 01:31:53 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/rename-top.cert (2.784s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/sk-xbuild.cert on 24-Sep-2022 01:31:56 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/sk-xbuild.cert (223.928s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/pull-top.cert on 24-Sep-2022 01:35:40 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/pull-top.cert (2.663s) Making /build/acl2-8.3dfsg/books/workshops/1999/ste/example.cert on 24-Sep-2022 01:35:43 Built /build/acl2-8.3dfsg/books/workshops/1999/ste/example.cert (6.380s) Making /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/congruences-1.cert on 24-Sep-2022 01:35:49 Built /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/congruences-1.cert (4.297s) Making /build/acl2-8.3dfsg/books/workshops/2013/verbeek-schmaltz/books/mybook.cert on 24-Sep-2022 01:35:54 Built /build/acl2-8.3dfsg/books/workshops/2013/verbeek-schmaltz/books/mybook.cert (3.422s) Making /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/m1-fast.cert on 24-Sep-2022 01:35:57 Built /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/m1-fast.cert (12.699s) Making /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/preliminary-material.cert on 24-Sep-2022 01:36:10 Built /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/preliminary-material.cert (22.356s) Making /build/acl2-8.3dfsg/books/projects/apply/apply-lemmas.cert on 24-Sep-2022 01:36:33 Built /build/acl2-8.3dfsg/books/projects/apply/apply-lemmas.cert (4.854s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/uc-conj.cert on 24-Sep-2022 01:36:38 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/uc-conj.cert (24.314s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/prop-subsume.cert on 24-Sep-2022 01:37:02 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/prop-subsume.cert (41.589s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/instance-closure.cert on 24-Sep-2022 01:37:44 Tick Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/instance-closure.cert (50.543s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/resolve.cert on 24-Sep-2022 01:38:34 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/resolve.cert (14.811s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/paramod.cert on 24-Sep-2022 01:38:49 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/paramod.cert (39.333s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/exercises/solution4.cert on 24-Sep-2022 01:39:29 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/exercises/solution4.cert (15.477s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/sk-step-sound.cert on 24-Sep-2022 01:39:45 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/sk-step-sound.cert (43.846s) Making /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/multiplication.cert on 24-Sep-2022 01:40:29 Built /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/multiplication.cert (14.798s) Making /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/lecture5-book.cert on 24-Sep-2022 01:40:43 Built /build/acl2-8.3dfsg/books/demos/marktoberdorf-08/lecture5-book.cert (3.907s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/substitution.cert on 24-Sep-2022 01:40:48 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/substitution.cert (4.873s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/flip.cert on 24-Sep-2022 01:40:53 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/flip.cert (23.662s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/skolem-top.cert on 24-Sep-2022 01:41:16 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/skolem-top.cert (13.595s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/simultaneous-d.cert on 24-Sep-2022 01:41:30 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/simultaneous-d.cert (41.368s) Making /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/congruences-2.cert on 24-Sep-2022 01:42:12 Built /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/congruences-2.cert (6.999s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/derive.cert on 24-Sep-2022 01:42:19 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/derive.cert (43.415s) Making /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/examples.cert on 24-Sep-2022 01:43:03 Built /build/acl2-8.3dfsg/books/workshops/2000/medina/polynomials/examples.cert (4.142s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/modeler.cert on 24-Sep-2022 01:43:07 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/modeler.cert (6.946s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/prover.cert on 24-Sep-2022 01:43:14 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/prover.cert (5.199s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/simple-check.cert on 24-Sep-2022 01:43:19 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/simple-check.cert (4.333s) Making /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/top.cert on 24-Sep-2022 01:43:24 Built /build/acl2-8.3dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/top.cert (3.340s) Making /build/acl2-8.3dfsg/books/ihs/ihs-doc-topic.cert on 24-Sep-2022 01:43:27 Built /build/acl2-8.3dfsg/books/ihs/ihs-doc-topic.cert (2.731s) Making /build/acl2-8.3dfsg/books/misc/expander.cert on 24-Sep-2022 01:43:30 Built /build/acl2-8.3dfsg/books/misc/expander.cert (33.213s) Making /build/acl2-8.3dfsg/books/ihs/ihs-init.cert on 24-Sep-2022 01:44:04 Built /build/acl2-8.3dfsg/books/ihs/ihs-init.cert (6.090s) Making /build/acl2-8.3dfsg/books/make-event/gen-defthm-check.cert on 24-Sep-2022 01:44:10 Built /build/acl2-8.3dfsg/books/make-event/gen-defthm-check.cert (2.514s) Making /build/acl2-8.3dfsg/books/make-event/gen-defthm.cert on 24-Sep-2022 01:44:13 Built /build/acl2-8.3dfsg/books/make-event/gen-defthm.cert (2.442s) Making /build/acl2-8.3dfsg/books/misc/expander-tests.cert on 24-Sep-2022 01:44:15 Built /build/acl2-8.3dfsg/books/misc/expander-tests.cert (2.575s) Making /build/acl2-8.3dfsg/books/workshops/2003/schmaltz-al-sammane-et-al/support/consistency.cert on 24-Sep-2022 01:44:18 Built /build/acl2-8.3dfsg/books/workshops/2003/schmaltz-al-sammane-et-al/support/consistency.cert (3.739s) Making /build/acl2-8.3dfsg/books/ihs/ihs-theories.cert on 24-Sep-2022 01:44:22 Built /build/acl2-8.3dfsg/books/ihs/ihs-theories.cert (2.918s) Making /build/acl2-8.3dfsg/books/ihs/math-lemmas.cert on 24-Sep-2022 01:44:25 Built /build/acl2-8.3dfsg/books/ihs/math-lemmas.cert (3.714s) Making /build/acl2-8.3dfsg/books/acl2s/cgen/propagate.cert on 24-Sep-2022 01:44:29 Built /build/acl2-8.3dfsg/books/acl2s/cgen/propagate.cert (7.062s) Making /build/acl2-8.3dfsg/books/workshops/1999/embedded/Exercises/Exercise1-2/private-qr-lemmas.cert on 24-Sep-2022 01:44:36 Built /build/acl2-8.3dfsg/books/workshops/1999/embedded/Exercises/Exercise1-2/private-qr-lemmas.cert (15.573s) Making /build/acl2-8.3dfsg/books/workshops/1999/embedded/Proof-Of-Contribution/private-qr-lemmas.cert on 24-Sep-2022 01:44:52 Built /build/acl2-8.3dfsg/books/workshops/1999/embedded/Proof-Of-Contribution/private-qr-lemmas.cert (15.294s) Making /build/acl2-8.3dfsg/books/acl2s/cgen/infer-enum-shape.cert on 24-Sep-2022 01:45:08 Built /build/acl2-8.3dfsg/books/acl2s/cgen/infer-enum-shape.cert (18.650s) Making /build/acl2-8.3dfsg/books/workshops/1999/embedded/Exercises/Exercise1-2/Minimal-Mod-Lemmas.cert on 24-Sep-2022 01:45:26 Built /build/acl2-8.3dfsg/books/workshops/1999/embedded/Exercises/Exercise1-2/Minimal-Mod-Lemmas.cert (3.119s) Making /build/acl2-8.3dfsg/books/workshops/1999/embedded/Proof-Of-Contribution/Minimal-Mod-Lemmas.cert on 24-Sep-2022 01:45:30 Built /build/acl2-8.3dfsg/books/workshops/1999/embedded/Proof-Of-Contribution/Minimal-Mod-Lemmas.cert (2.973s) Making /build/acl2-8.3dfsg/books/acl2s/cgen/build-enumcalls.cert on 24-Sep-2022 01:45:33 Built /build/acl2-8.3dfsg/books/acl2s/cgen/build-enumcalls.cert (15.074s) Making /build/acl2-8.3dfsg/books/acl2s/cgen/fixers2.cert on 24-Sep-2022 01:45:48 Built /build/acl2-8.3dfsg/books/acl2s/cgen/fixers2.cert (22.508s) Making /build/acl2-8.3dfsg/books/ihs/quotient-remainder-lemmas.cert on 24-Sep-2022 01:46:11 Built /build/acl2-8.3dfsg/books/ihs/quotient-remainder-lemmas.cert (8.459s) Making /build/acl2-8.3dfsg/books/clause-processors/deps-SULFA.cert on 24-Sep-2022 01:46:20 Built /build/acl2-8.3dfsg/books/clause-processors/deps-SULFA.cert (2.217s) Making /build/acl2-8.3dfsg/books/std/strings/decimal.cert on 24-Sep-2022 01:46:22 Built /build/acl2-8.3dfsg/books/std/strings/decimal.cert (21.369s) Making /build/acl2-8.3dfsg/books/clause-processors/generalize.cert on 24-Sep-2022 01:46:43 Built /build/acl2-8.3dfsg/books/clause-processors/generalize.cert (16.013s) Making /build/acl2-8.3dfsg/books/arithmetic-2/floor-mod/floor-mod-helper.cert on 24-Sep-2022 01:47:00 Built /build/acl2-8.3dfsg/books/arithmetic-2/floor-mod/floor-mod-helper.cert (14.836s) Making /build/acl2-8.3dfsg/books/centaur/misc/vecs-ints.cert on 24-Sep-2022 01:47:15 Built /build/acl2-8.3dfsg/books/centaur/misc/vecs-ints.cert (12.992s) Making /build/acl2-8.3dfsg/books/centaur/ubdds/witness.cert on 24-Sep-2022 01:47:28 Built /build/acl2-8.3dfsg/books/centaur/ubdds/witness.cert (57.362s) Making /build/acl2-8.3dfsg/books/centaur/gl/defapply.cert on 24-Sep-2022 01:48:25 Built /build/acl2-8.3dfsg/books/centaur/gl/defapply.cert (11.019s) Making /build/acl2-8.3dfsg/books/centaur/bitops/logbitp-bounds.cert on 24-Sep-2022 01:48:36 Built /build/acl2-8.3dfsg/books/centaur/bitops/logbitp-bounds.cert (4.360s) Making /build/acl2-8.3dfsg/books/std/strings/stringify.cert on 24-Sep-2022 01:48:41 Built /build/acl2-8.3dfsg/books/std/strings/stringify.cert (7.711s) Making /build/acl2-8.3dfsg/books/centaur/meta/let-abs.cert on 24-Sep-2022 01:48:49 Built /build/acl2-8.3dfsg/books/centaur/meta/let-abs.cert (27.413s) Making /build/acl2-8.3dfsg/books/centaur/fty/tests/utils.cert on 24-Sep-2022 01:49:16 Built /build/acl2-8.3dfsg/books/centaur/fty/tests/utils.cert (5.510s) Making /build/acl2-8.3dfsg/books/centaur/misc/tailrec.cert on 24-Sep-2022 01:49:22 Built /build/acl2-8.3dfsg/books/centaur/misc/tailrec.cert (46.072s) Making /build/acl2-8.3dfsg/books/oslib/date.cert on 24-Sep-2022 01:50:08 Built /build/acl2-8.3dfsg/books/oslib/date.cert (6.194s) Making /build/acl2-8.3dfsg/books/centaur/svl/macros.cert on 24-Sep-2022 01:50:15 Built /build/acl2-8.3dfsg/books/centaur/svl/macros.cert (6.677s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed5aa.cert on 24-Sep-2022 01:50:22 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed5aa.cert (22.209s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/floor.cert on 24-Sep-2022 01:50:44 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/floor.cert (9.036s) Making /build/acl2-8.3dfsg/books/kestrel/library-wrappers/ihs-quotient-remainder-lemmas.cert on 24-Sep-2022 01:50:53 Built /build/acl2-8.3dfsg/books/kestrel/library-wrappers/ihs-quotient-remainder-lemmas.cert (3.234s) Making /build/acl2-8.3dfsg/books/oslib/tempfile-logic.cert on 24-Sep-2022 01:50:57 Built /build/acl2-8.3dfsg/books/oslib/tempfile-logic.cert (5.627s) Making /build/acl2-8.3dfsg/books/projects/smtlink/verified/basics.cert on 24-Sep-2022 01:51:02 Built /build/acl2-8.3dfsg/books/projects/smtlink/verified/basics.cert (6.121s) Making /build/acl2-8.3dfsg/books/std/strings/decimal-tests.cert on 24-Sep-2022 01:51:09 Built /build/acl2-8.3dfsg/books/std/strings/decimal-tests.cert (4.291s) Making /build/acl2-8.3dfsg/books/workshops/2000/moore-manolios/partial-functions/mod-1-property.cert on 24-Sep-2022 01:51:13 Built /build/acl2-8.3dfsg/books/workshops/2000/moore-manolios/partial-functions/mod-1-property.cert (3.461s) Making /build/acl2-8.3dfsg/books/workshops/2003/moore_vcg/support/utilities.cert on 24-Sep-2022 01:51:17 Built /build/acl2-8.3dfsg/books/workshops/2003/moore_vcg/support/utilities.cert (10.550s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed2b.cert on 24-Sep-2022 01:51:27 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed2b.cert (12.600s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed4aa.cert on 24-Sep-2022 01:51:40 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed4aa.cert (6.857s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed4ab.cert on 24-Sep-2022 01:51:47 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed4ab.cert (8.620s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed4ba.cert on 24-Sep-2022 01:51:56 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed4ba.cert (7.087s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed4bb.cert on 24-Sep-2022 01:52:03 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed4bb.cert (8.599s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed4ca.cert on 24-Sep-2022 01:52:12 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed4ca.cert (7.603s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed4cb.cert on 24-Sep-2022 01:52:20 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed4cb.cert (9.633s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed4da.cert on 24-Sep-2022 01:52:30 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed4da.cert (12.303s) Making /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed4db.cert on 24-Sep-2022 01:52:42 Built /build/acl2-8.3dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/ed4db.cert (14.549s) NOTE: Skipping SULFA subdirectory (need SAT solver installed as per books/clause-processors/SULFA/README). Making /build/acl2-8.3dfsg/books/misc/symbol-btree.cert on 24-Sep-2022 01:52:57 Built /build/acl2-8.3dfsg/books/misc/symbol-btree.cert (17.513s) Making /build/acl2-8.3dfsg/books/clause-processors/witness-cp.cert on 24-Sep-2022 01:53:14 Built /build/acl2-8.3dfsg/books/clause-processors/witness-cp.cert (33.411s) Making /build/acl2-8.3dfsg/books/std/strings/strnatless.cert on 24-Sep-2022 01:53:48 Built /build/acl2-8.3dfsg/books/std/strings/strnatless.cert (26.143s) Making /build/acl2-8.3dfsg/books/arithmetic-2/floor-mod/floor-mod.cert on 24-Sep-2022 01:54:14 Built /build/acl2-8.3dfsg/books/arithmetic-2/floor-mod/floor-mod.cert (6.637s) Making /build/acl2-8.3dfsg/books/centaur/misc/witness-cp.cert on 24-Sep-2022 01:54:21 Built /build/acl2-8.3dfsg/books/centaur/misc/witness-cp.cert (4.640s) Making /build/acl2-8.3dfsg/books/misc/untranslate-patterns.cert on 24-Sep-2022 01:54:26 Built /build/acl2-8.3dfsg/books/misc/untranslate-patterns.cert (6.163s) Making /build/acl2-8.3dfsg/books/centaur/fty/tests/defprod-scale.cert on 24-Sep-2022 01:54:32 Built /build/acl2-8.3dfsg/books/centaur/fty/tests/defprod-scale.cert (443.597s) Making /build/acl2-8.3dfsg/books/centaur/fty/tests/deftagsum-scale.cert on 24-Sep-2022 02:01:56 Tick Built /build/acl2-8.3dfsg/books/centaur/fty/tests/deftagsum-scale.cert (1320.405s) Making /build/acl2-8.3dfsg/books/centaur/fty/tests/deftranssum.cert on 24-Sep-2022 02:23:57 Tick Built /build/acl2-8.3dfsg/books/centaur/fty/tests/deftranssum.cert (1453.840s) Making /build/acl2-8.3dfsg/books/coi/adviser/adviser.cert on 24-Sep-2022 02:48:11 Built /build/acl2-8.3dfsg/books/coi/adviser/adviser.cert (11.516s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/mod.cert on 24-Sep-2022 02:48:22 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/mod.cert (31.568s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/floor-and-expt.cert on 24-Sep-2022 02:48:54 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/floor-and-expt.cert (3.422s) Making /build/acl2-8.3dfsg/books/kestrel/bv/logtail-def.cert on 24-Sep-2022 02:48:58 Built /build/acl2-8.3dfsg/books/kestrel/bv/logtail-def.cert (3.955s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/padding/pad-to-448-validation.cert on 24-Sep-2022 02:49:02 Built /build/acl2-8.3dfsg/books/kestrel/crypto/padding/pad-to-448-validation.cert (3.087s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/padding/pad-to-896-validation.cert on 24-Sep-2022 02:49:05 Built /build/acl2-8.3dfsg/books/kestrel/crypto/padding/pad-to-896-validation.cert (3.442s) Making /build/acl2-8.3dfsg/books/oslib/tempfile.cert on 24-Sep-2022 02:49:09 Built /build/acl2-8.3dfsg/books/oslib/tempfile.cert (5.060s) Making /build/acl2-8.3dfsg/books/projects/smtlink/verified/fty.cert on 24-Sep-2022 02:49:14 Built /build/acl2-8.3dfsg/books/projects/smtlink/verified/fty.cert (92.220s) Making /build/acl2-8.3dfsg/books/workshops/2000/moore-manolios/partial-functions/report.cert on 24-Sep-2022 02:50:46 Built /build/acl2-8.3dfsg/books/workshops/2000/moore-manolios/partial-functions/report.cert (8.838s) Making /build/acl2-8.3dfsg/books/workshops/2003/moore_vcg/support/demo.cert on 24-Sep-2022 02:50:55 Built /build/acl2-8.3dfsg/books/workshops/2003/moore_vcg/support/demo.cert (8.088s) Making /build/acl2-8.3dfsg/books/workshops/2003/schmaltz-borrione/support/decoder.cert on 24-Sep-2022 02:51:04 Built /build/acl2-8.3dfsg/books/workshops/2003/schmaltz-borrione/support/decoder.cert (4.105s) Making /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/misc.cert on 24-Sep-2022 02:51:08 Built /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/misc.cert (5.175s) Making /build/acl2-8.3dfsg/books/misc/rtl-untranslate.cert on 24-Sep-2022 02:51:13 Built /build/acl2-8.3dfsg/books/misc/rtl-untranslate.cert (11.817s) Making /build/acl2-8.3dfsg/books/centaur/4v-sexpr/4v-logic.cert on 24-Sep-2022 02:51:25 Built /build/acl2-8.3dfsg/books/centaur/4v-sexpr/4v-logic.cert (12.680s) Making /build/acl2-8.3dfsg/books/centaur/misc/alist-witness.cert on 24-Sep-2022 02:51:38 Built /build/acl2-8.3dfsg/books/centaur/misc/alist-witness.cert (7.805s) Making /build/acl2-8.3dfsg/books/centaur/misc/equal-sets.cert on 24-Sep-2022 02:51:46 Built /build/acl2-8.3dfsg/books/centaur/misc/equal-sets.cert (5.396s) Making /build/acl2-8.3dfsg/books/centaur/ubdds/lite.cert on 24-Sep-2022 02:51:52 Built /build/acl2-8.3dfsg/books/centaur/ubdds/lite.cert (23.596s) Making /build/acl2-8.3dfsg/books/centaur/gl/gobject-types.cert on 24-Sep-2022 02:52:15 Built /build/acl2-8.3dfsg/books/centaur/gl/gobject-types.cert (7.789s) Making /build/acl2-8.3dfsg/books/clause-processors/multi-env-trick.cert on 24-Sep-2022 02:52:23 Built /build/acl2-8.3dfsg/books/clause-processors/multi-env-trick.cert (6.009s) Making /build/acl2-8.3dfsg/books/centaur/misc/context-rw.cert on 24-Sep-2022 02:52:29 Built /build/acl2-8.3dfsg/books/centaur/misc/context-rw.cert (58.049s) Making /build/acl2-8.3dfsg/books/centaur/misc/osets-witnessing.cert on 24-Sep-2022 02:53:28 Built /build/acl2-8.3dfsg/books/centaur/misc/osets-witnessing.cert (8.283s) Making /build/acl2-8.3dfsg/books/centaur/gl/auto-bindings.cert on 24-Sep-2022 02:53:36 Built /build/acl2-8.3dfsg/books/centaur/gl/auto-bindings.cert (9.961s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/4vec-base.cert on 24-Sep-2022 02:53:46 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/4vec-base.cert (15.079s) Making /build/acl2-8.3dfsg/books/centaur/gl/gobject-type-thms.cert on 24-Sep-2022 02:54:02 Built /build/acl2-8.3dfsg/books/centaur/gl/gobject-type-thms.cert (4.487s) Making /build/acl2-8.3dfsg/books/clause-processors/let-abstraction.cert on 24-Sep-2022 02:54:06 Built /build/acl2-8.3dfsg/books/clause-processors/let-abstraction.cert (20.125s) Making /build/acl2-8.3dfsg/books/centaur/ubdds/sanity-check-macros.cert on 24-Sep-2022 02:54:26 Built /build/acl2-8.3dfsg/books/centaur/ubdds/sanity-check-macros.cert (24.549s) Making /build/acl2-8.3dfsg/books/clause-processors/nvalues-thms.cert on 24-Sep-2022 02:54:51 Built /build/acl2-8.3dfsg/books/clause-processors/nvalues-thms.cert (12.453s) Making /build/acl2-8.3dfsg/books/clause-processors/replace-defined-consts.cert on 24-Sep-2022 02:55:04 Built /build/acl2-8.3dfsg/books/clause-processors/replace-defined-consts.cert (7.824s) Making /build/acl2-8.3dfsg/books/coi/adviser/test.cert on 24-Sep-2022 02:55:12 Built /build/acl2-8.3dfsg/books/coi/adviser/test.cert (4.273s) Making /build/acl2-8.3dfsg/books/coi/lists/basic.cert on 24-Sep-2022 02:55:16 Built /build/acl2-8.3dfsg/books/coi/lists/basic.cert (11.849s) Making /build/acl2-8.3dfsg/books/coi/maps/maps.cert on 24-Sep-2022 02:55:28 Built /build/acl2-8.3dfsg/books/coi/maps/maps.cert (16.522s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/integerp.cert on 24-Sep-2022 02:55:45 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/integerp.cert (2.744s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/mod-and-expt.cert on 24-Sep-2022 02:55:48 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/mod-and-expt.cert (8.147s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/mod-expt-fast.cert on 24-Sep-2022 02:55:56 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/mod-expt-fast.cert (2.628s) Making /build/acl2-8.3dfsg/books/kestrel/bv/bvchop-def.cert on 24-Sep-2022 02:55:59 Built /build/acl2-8.3dfsg/books/kestrel/bv/bvchop-def.cert (2.962s) Making /build/acl2-8.3dfsg/books/kestrel/bv/lognot.cert on 24-Sep-2022 02:56:02 Built /build/acl2-8.3dfsg/books/kestrel/bv/lognot.cert (3.781s) Making /build/acl2-8.3dfsg/books/system/obviously-equiv-terms.cert on 24-Sep-2022 02:56:06 Built /build/acl2-8.3dfsg/books/system/obviously-equiv-terms.cert (61.120s) Making /build/acl2-8.3dfsg/books/workshops/2003/moore_vcg/support/vcg-examples.cert on 24-Sep-2022 02:57:07 Built /build/acl2-8.3dfsg/books/workshops/2003/moore_vcg/support/vcg-examples.cert (21.297s) Making /build/acl2-8.3dfsg/books/workshops/2003/schmaltz-borrione/support/arbiter.cert on 24-Sep-2022 02:57:29 Built /build/acl2-8.3dfsg/books/workshops/2003/schmaltz-borrione/support/arbiter.cert (5.966s) Making /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/bv-op-defuns.cert on 24-Sep-2022 02:57:35 Built /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/bv-op-defuns.cert (7.698s) Making /build/acl2-8.3dfsg/books/centaur/misc/fast-alists.cert on 24-Sep-2022 02:57:43 Built /build/acl2-8.3dfsg/books/centaur/misc/fast-alists.cert (9.936s) Making /build/acl2-8.3dfsg/books/centaur/misc/hons-sets.cert on 24-Sep-2022 02:57:53 Built /build/acl2-8.3dfsg/books/centaur/misc/hons-sets.cert (10.309s) Making /build/acl2-8.3dfsg/books/centaur/gl/rws.cert on 24-Sep-2022 02:58:04 Built /build/acl2-8.3dfsg/books/centaur/gl/rws.cert (46.735s) Making /build/acl2-8.3dfsg/books/centaur/esim/patterns.cert on 24-Sep-2022 02:58:50 Built /build/acl2-8.3dfsg/books/centaur/esim/patterns.cert (11.973s) Making /build/acl2-8.3dfsg/books/centaur/esim/local-theory.cert on 24-Sep-2022 02:59:03 Built /build/acl2-8.3dfsg/books/centaur/esim/local-theory.cert (9.832s) Making /build/acl2-8.3dfsg/books/coi/lists/memberp.cert on 24-Sep-2022 02:59:13 Built /build/acl2-8.3dfsg/books/coi/lists/memberp.cert (4.224s) Making /build/acl2-8.3dfsg/books/coi/alists/equiv.cert on 24-Sep-2022 02:59:17 Built /build/acl2-8.3dfsg/books/coi/alists/equiv.cert (5.406s) Making /build/acl2-8.3dfsg/books/coi/lists/repeat.cert on 24-Sep-2022 02:59:23 Built /build/acl2-8.3dfsg/books/coi/lists/repeat.cert (4.241s) Making /build/acl2-8.3dfsg/books/coi/records/records.cert on 24-Sep-2022 02:59:27 Built /build/acl2-8.3dfsg/books/coi/records/records.cert (10.795s) Making /build/acl2-8.3dfsg/books/coi/osets/listsets.cert on 24-Sep-2022 02:59:38 Built /build/acl2-8.3dfsg/books/coi/osets/listsets.cert (58.520s) Making /build/acl2-8.3dfsg/books/coi/maps/typed-maps.cert on 24-Sep-2022 03:00:37 Built /build/acl2-8.3dfsg/books/coi/maps/typed-maps.cert (5.367s) Making /build/acl2-8.3dfsg/books/coi/records/defrecord.cert on 24-Sep-2022 03:00:42 Built /build/acl2-8.3dfsg/books/coi/records/defrecord.cert (7.806s) Making /build/acl2-8.3dfsg/books/coi/records/defrecord-fast.cert on 24-Sep-2022 03:00:50 Built /build/acl2-8.3dfsg/books/coi/records/defrecord-fast.cert (7.029s) Making /build/acl2-8.3dfsg/books/coi/lists/mixed.cert on 24-Sep-2022 03:00:57 Built /build/acl2-8.3dfsg/books/coi/lists/mixed.cert (3.600s) Making /build/acl2-8.3dfsg/books/coi/lists/map-cons.cert on 24-Sep-2022 03:01:01 Built /build/acl2-8.3dfsg/books/coi/lists/map-cons.cert (4.002s) Making /build/acl2-8.3dfsg/books/coi/maps/aliases.cert on 24-Sep-2022 03:01:05 Built /build/acl2-8.3dfsg/books/coi/maps/aliases.cert (4.494s) Making /build/acl2-8.3dfsg/books/coi/paths/defs.cert on 24-Sep-2022 03:01:10 Built /build/acl2-8.3dfsg/books/coi/paths/defs.cert (4.830s) Making /build/acl2-8.3dfsg/books/coi/records/defarray.cert on 24-Sep-2022 03:01:15 Built /build/acl2-8.3dfsg/books/coi/records/defarray.cert (4.359s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/ceiling.cert on 24-Sep-2022 03:01:19 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/ceiling.cert (3.818s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/floor-mod-expt.cert on 24-Sep-2022 03:01:23 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/floor-mod-expt.cert (11.643s) Making /build/acl2-8.3dfsg/books/kestrel/bv/bvchop.cert on 24-Sep-2022 03:01:35 Built /build/acl2-8.3dfsg/books/kestrel/bv/bvchop.cert (5.730s) Making /build/acl2-8.3dfsg/books/kestrel/bv/slice-def.cert on 24-Sep-2022 03:01:41 Built /build/acl2-8.3dfsg/books/kestrel/bv/slice-def.cert (3.370s) Making /build/acl2-8.3dfsg/books/kestrel/bv/logand.cert on 24-Sep-2022 03:01:45 Built /build/acl2-8.3dfsg/books/kestrel/bv/logand.cert (71.854s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/len-mult-of-8p.cert on 24-Sep-2022 03:02:57 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/len-mult-of-8p.cert (3.527s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/bvchop-list.cert on 24-Sep-2022 03:03:00 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/bvchop-list.cert (5.159s) Making /build/acl2-8.3dfsg/books/workshops/2003/schmaltz-borrione/support/transfers.cert on 24-Sep-2022 03:03:06 Built /build/acl2-8.3dfsg/books/workshops/2003/schmaltz-borrione/support/transfers.cert (9.880s) Making /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/bv-op-defthms.cert on 24-Sep-2022 03:03:16 Built /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/bv-op-defthms.cert (7.325s) Making /build/acl2-8.3dfsg/books/centaur/4v-sexpr/sexpr-eval.cert on 24-Sep-2022 03:03:23 Built /build/acl2-8.3dfsg/books/centaur/4v-sexpr/sexpr-eval.cert (21.417s) Making /build/acl2-8.3dfsg/books/centaur/misc/filter-alist.cert on 24-Sep-2022 03:03:45 Built /build/acl2-8.3dfsg/books/centaur/misc/filter-alist.cert (9.989s) Making /build/acl2-8.3dfsg/books/centaur/misc/interp-function-lookup.cert on 24-Sep-2022 03:03:55 Built /build/acl2-8.3dfsg/books/centaur/misc/interp-function-lookup.cert (13.841s) Making /build/acl2-8.3dfsg/books/centaur/gl/factor-fns.cert on 24-Sep-2022 03:04:09 Built /build/acl2-8.3dfsg/books/centaur/gl/factor-fns.cert (12.862s) Making /build/acl2-8.3dfsg/books/centaur/gl/eval-f-i-cp.cert on 24-Sep-2022 03:04:22 Built /build/acl2-8.3dfsg/books/centaur/gl/eval-f-i-cp.cert (16.381s) Making /build/acl2-8.3dfsg/books/coi/lists/subsetp.cert on 24-Sep-2022 03:04:38 Built /build/acl2-8.3dfsg/books/coi/lists/subsetp.cert (4.576s) Making /build/acl2-8.3dfsg/books/coi/alists/strip.cert on 24-Sep-2022 03:04:43 Built /build/acl2-8.3dfsg/books/coi/alists/strip.cert (4.688s) Making /build/acl2-8.3dfsg/books/coi/lists/nth-and-update-nth.cert on 24-Sep-2022 03:04:48 Built /build/acl2-8.3dfsg/books/coi/lists/nth-and-update-nth.cert (14.194s) Making /build/acl2-8.3dfsg/books/coi/osets/multicons.cert on 24-Sep-2022 03:05:02 Built /build/acl2-8.3dfsg/books/coi/osets/multicons.cert (17.464s) Making /build/acl2-8.3dfsg/books/coi/gacc/abstract-gacc.cert on 24-Sep-2022 03:05:20 Built /build/acl2-8.3dfsg/books/coi/gacc/abstract-gacc.cert (8.882s) Making /build/acl2-8.3dfsg/books/coi/lists/update-nth-array.cert on 24-Sep-2022 03:05:29 Built /build/acl2-8.3dfsg/books/coi/lists/update-nth-array.cert (4.597s) Making /build/acl2-8.3dfsg/books/coi/osets/multiappend.cert on 24-Sep-2022 03:05:34 Built /build/acl2-8.3dfsg/books/coi/osets/multiappend.cert (7.331s) Making /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/top.cert on 24-Sep-2022 03:05:41 Built /build/acl2-8.3dfsg/books/kestrel/arithmetic-light/top.cert (3.128s) Making /build/acl2-8.3dfsg/books/kestrel/bv/defs-bitwise.cert on 24-Sep-2022 03:05:45 Built /build/acl2-8.3dfsg/books/kestrel/bv/defs-bitwise.cert (3.931s) Making /build/acl2-8.3dfsg/books/kestrel/bv/getbit-def.cert on 24-Sep-2022 03:05:49 Built /build/acl2-8.3dfsg/books/kestrel/bv/getbit-def.cert (3.565s) Making /build/acl2-8.3dfsg/books/kestrel/bv/logior.cert on 24-Sep-2022 03:05:52 Built /build/acl2-8.3dfsg/books/kestrel/bv/logior.cert (26.012s) Making /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/padding-1-256.cert on 24-Sep-2022 03:06:19 Built /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/padding-1-256.cert (15.211s) Making /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/padding-384-512.cert on 24-Sep-2022 03:06:34 Built /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/padding-384-512.cert (19.302s) Making /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/sha-functions.cert on 24-Sep-2022 03:06:54 Built /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/sha-functions.cert (5.552s) Making /build/acl2-8.3dfsg/books/centaur/4v-sexpr/sexpr-equivs.cert on 24-Sep-2022 03:06:59 Built /build/acl2-8.3dfsg/books/centaur/4v-sexpr/sexpr-equivs.cert (23.401s) Making /build/acl2-8.3dfsg/books/centaur/4v-sexpr/sexpr-3v.cert on 24-Sep-2022 03:07:23 Built /build/acl2-8.3dfsg/books/centaur/4v-sexpr/sexpr-3v.cert (14.865s) Making /build/acl2-8.3dfsg/books/centaur/4v-sexpr/sexpr-freq.cert on 24-Sep-2022 03:07:38 Tick Built /build/acl2-8.3dfsg/books/centaur/4v-sexpr/sexpr-freq.cert (19.927s) Making /build/acl2-8.3dfsg/books/centaur/misc/defapply.cert on 24-Sep-2022 03:07:58 Built /build/acl2-8.3dfsg/books/centaur/misc/defapply.cert (58.322s) Making /build/acl2-8.3dfsg/books/coi/lists/remove.cert on 24-Sep-2022 03:08:56 Built /build/acl2-8.3dfsg/books/coi/lists/remove.cert (5.720s) Making /build/acl2-8.3dfsg/books/coi/lists/find-index.cert on 24-Sep-2022 03:09:02 Built /build/acl2-8.3dfsg/books/coi/lists/find-index.cert (4.508s) Making /build/acl2-8.3dfsg/books/coi/dtrees/base.cert on 24-Sep-2022 03:09:07 Built /build/acl2-8.3dfsg/books/coi/dtrees/base.cert (56.335s) Making /build/acl2-8.3dfsg/books/coi/lists/list-top.cert on 24-Sep-2022 03:10:04 Built /build/acl2-8.3dfsg/books/coi/lists/list-top.cert (3.856s) Making /build/acl2-8.3dfsg/books/kestrel/bv/logorc1.cert on 24-Sep-2022 03:10:08 Built /build/acl2-8.3dfsg/books/kestrel/bv/logorc1.cert (2.908s) Making /build/acl2-8.3dfsg/books/kestrel/bv/logeqv.cert on 24-Sep-2022 03:10:11 Built /build/acl2-8.3dfsg/books/kestrel/bv/logeqv.cert (2.993s) Making /build/acl2-8.3dfsg/books/kestrel/bv/logior-b.cert on 24-Sep-2022 03:10:14 Built /build/acl2-8.3dfsg/books/kestrel/bv/logior-b.cert (3.476s) Making /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/parsing.cert on 24-Sep-2022 03:10:17 Built /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/parsing.cert (5.237s) Making /build/acl2-8.3dfsg/books/coi/lists/disjoint.cert on 24-Sep-2022 03:10:23 Built /build/acl2-8.3dfsg/books/coi/lists/disjoint.cert (4.925s) Making /build/acl2-8.3dfsg/books/coi/lists/remove-induction.cert on 24-Sep-2022 03:10:28 Built /build/acl2-8.3dfsg/books/coi/lists/remove-induction.cert (7.769s) Making /build/acl2-8.3dfsg/books/coi/dtrees/deps.cert on 24-Sep-2022 03:10:36 Built /build/acl2-8.3dfsg/books/coi/dtrees/deps.cert (46.776s) Making /build/acl2-8.3dfsg/books/kestrel/bv/logxor.cert on 24-Sep-2022 03:11:23 Built /build/acl2-8.3dfsg/books/kestrel/bv/logxor.cert (3.541s) Making /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/sha-1.cert on 24-Sep-2022 03:11:27 Built /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/sha-1.cert (8.667s) Making /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/sha-256.cert on 24-Sep-2022 03:11:35 Built /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/sha-256.cert (8.922s) Making /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/sha-384-512.cert on 24-Sep-2022 03:11:44 Built /build/acl2-8.3dfsg/books/workshops/2003/toma-borrione/support/sha-384-512.cert (9.507s) Making /build/acl2-8.3dfsg/books/coi/lists/set.cert on 24-Sep-2022 03:11:54 Built /build/acl2-8.3dfsg/books/coi/lists/set.cert (23.044s) Making /build/acl2-8.3dfsg/books/coi/bags/basic.cert on 24-Sep-2022 03:12:17 Built /build/acl2-8.3dfsg/books/coi/bags/basic.cert (67.893s) Making /build/acl2-8.3dfsg/books/coi/dtrees/equiv.cert on 24-Sep-2022 03:13:25 Built /build/acl2-8.3dfsg/books/coi/dtrees/equiv.cert (37.552s) Making /build/acl2-8.3dfsg/books/coi/osets/conversions.cert on 24-Sep-2022 03:14:03 Built /build/acl2-8.3dfsg/books/coi/osets/conversions.cert (5.340s) Making /build/acl2-8.3dfsg/books/coi/lists/listset-induction.cert on 24-Sep-2022 03:14:09 Built /build/acl2-8.3dfsg/books/coi/lists/listset-induction.cert (4.698s) Making /build/acl2-8.3dfsg/books/kestrel/bv/logxor-b.cert on 24-Sep-2022 03:14:14 Built /build/acl2-8.3dfsg/books/kestrel/bv/logxor-b.cert (3.497s) Making /build/acl2-8.3dfsg/books/coi/alists/keyquiv.cert on 24-Sep-2022 03:14:17 Built /build/acl2-8.3dfsg/books/coi/alists/keyquiv.cert (17.606s) Making /build/acl2-8.3dfsg/books/coi/bags/meta.cert on 24-Sep-2022 03:14:35 Built /build/acl2-8.3dfsg/books/coi/bags/meta.cert (74.219s) Making /build/acl2-8.3dfsg/books/coi/alists/clearkey.cert on 24-Sep-2022 03:15:49 Built /build/acl2-8.3dfsg/books/coi/alists/clearkey.cert (5.752s) Making /build/acl2-8.3dfsg/books/coi/bags/pick-a-point.cert on 24-Sep-2022 03:15:55 Built /build/acl2-8.3dfsg/books/coi/bags/pick-a-point.cert (5.136s) Making /build/acl2-8.3dfsg/books/coi/alists/subkeyquiv.cert on 24-Sep-2022 03:16:01 Built /build/acl2-8.3dfsg/books/coi/alists/subkeyquiv.cert (22.916s) Making /build/acl2-8.3dfsg/books/coi/bags/extras.cert on 24-Sep-2022 03:16:24 Built /build/acl2-8.3dfsg/books/coi/bags/extras.cert (4.576s) Making /build/acl2-8.3dfsg/books/coi/records/domain.cert on 24-Sep-2022 03:16:28 Built /build/acl2-8.3dfsg/books/coi/records/domain.cert (48.191s) Making /build/acl2-8.3dfsg/books/coi/paths/dominates.cert on 24-Sep-2022 03:17:17 Built /build/acl2-8.3dfsg/books/coi/paths/dominates.cert (32.881s) Making /build/acl2-8.3dfsg/books/coi/dtrees/raw.cert on 24-Sep-2022 03:17:50 Built /build/acl2-8.3dfsg/books/coi/dtrees/raw.cert (13.483s) Making /build/acl2-8.3dfsg/books/coi/gacc/addr-range.cert on 24-Sep-2022 03:18:04 Built /build/acl2-8.3dfsg/books/coi/gacc/addr-range.cert (7.247s) Making /build/acl2-8.3dfsg/books/coi/gacc/block.cert on 24-Sep-2022 03:18:11 Built /build/acl2-8.3dfsg/books/coi/gacc/block.cert (14.960s) Making /build/acl2-8.3dfsg/books/coi/osets/extras.cert on 24-Sep-2022 03:18:26 Built /build/acl2-8.3dfsg/books/coi/osets/extras.cert (6.890s) Making /build/acl2-8.3dfsg/books/coi/records/fixedpoint.cert on 24-Sep-2022 03:18:33 Built /build/acl2-8.3dfsg/books/coi/records/fixedpoint.cert (15.302s) Making /build/acl2-8.3dfsg/books/coi/bags/bind-free-rules.cert on 24-Sep-2022 03:18:49 Built /build/acl2-8.3dfsg/books/coi/bags/bind-free-rules.cert (28.170s) Making /build/acl2-8.3dfsg/books/coi/alists/deshadow.cert on 24-Sep-2022 03:19:17 Built /build/acl2-8.3dfsg/books/coi/alists/deshadow.cert (7.454s) Making /build/acl2-8.3dfsg/books/coi/paths/diverge.cert on 24-Sep-2022 03:19:25 Built /build/acl2-8.3dfsg/books/coi/paths/diverge.cert (12.979s) Making /build/acl2-8.3dfsg/books/coi/records/set-domain.cert on 24-Sep-2022 03:19:38 Built /build/acl2-8.3dfsg/books/coi/records/set-domain.cert (5.607s) Making /build/acl2-8.3dfsg/books/coi/bags/neq.cert on 24-Sep-2022 03:19:44 Built /build/acl2-8.3dfsg/books/coi/bags/neq.cert (15.792s) Making /build/acl2-8.3dfsg/books/coi/alists/preimage.cert on 24-Sep-2022 03:19:59 Built /build/acl2-8.3dfsg/books/coi/alists/preimage.cert (6.016s) Making /build/acl2-8.3dfsg/books/coi/bags/two-level.cert on 24-Sep-2022 03:20:06 Built /build/acl2-8.3dfsg/books/coi/bags/two-level.cert (17.398s) Making /build/acl2-8.3dfsg/books/coi/dtrees/set.cert on 24-Sep-2022 03:20:23 Built /build/acl2-8.3dfsg/books/coi/dtrees/set.cert (68.516s) Making /build/acl2-8.3dfsg/books/coi/dtrees/leafp.cert on 24-Sep-2022 03:21:32 Built /build/acl2-8.3dfsg/books/coi/dtrees/leafp.cert (12.883s) Making /build/acl2-8.3dfsg/books/coi/dtrees/royalp.cert on 24-Sep-2022 03:21:45 Built /build/acl2-8.3dfsg/books/coi/dtrees/royalp.cert (12.911s) Making /build/acl2-8.3dfsg/books/coi/alists/top.cert on 24-Sep-2022 03:21:58 Built /build/acl2-8.3dfsg/books/coi/alists/top.cert (4.569s) Making /build/acl2-8.3dfsg/books/coi/bags/two-level-meta.cert on 24-Sep-2022 03:22:03 Built /build/acl2-8.3dfsg/books/coi/bags/two-level-meta.cert (5.744s) Making /build/acl2-8.3dfsg/books/coi/dtrees/erase.cert on 24-Sep-2022 03:22:09 Built /build/acl2-8.3dfsg/books/coi/dtrees/erase.cert (64.156s) Making /build/acl2-8.3dfsg/books/coi/paths/compatibility.cert on 24-Sep-2022 03:23:13 Built /build/acl2-8.3dfsg/books/coi/paths/compatibility.cert (4.776s) Making /build/acl2-8.3dfsg/books/coi/dtrees/child.cert on 24-Sep-2022 03:23:18 Built /build/acl2-8.3dfsg/books/coi/dtrees/child.cert (8.430s) Making /build/acl2-8.3dfsg/books/std/strings/explode-nonnegative-integer.cert on 24-Sep-2022 03:23:26 Built /build/acl2-8.3dfsg/books/std/strings/explode-nonnegative-integer.cert (25.255s) Making /build/acl2-8.3dfsg/books/coi/dtrees/top.cert on 24-Sep-2022 03:23:52 Built /build/acl2-8.3dfsg/books/coi/dtrees/top.cert (6.491s) Making /build/acl2-8.3dfsg/books/std/strings/explode-atom.cert on 24-Sep-2022 03:23:58 Built /build/acl2-8.3dfsg/books/std/strings/explode-atom.cert (5.067s) Making /build/acl2-8.3dfsg/books/coi/dtrees/dtree-examples.cert on 24-Sep-2022 03:24:04 Built /build/acl2-8.3dfsg/books/coi/dtrees/dtree-examples.cert (7.009s) Making /build/acl2-8.3dfsg/books/std/io/base.cert on 24-Sep-2022 03:24:11 Built /build/acl2-8.3dfsg/books/std/io/base.cert (13.899s) Making /build/acl2-8.3dfsg/books/std/strings/hexify.cert on 24-Sep-2022 03:24:25 Built /build/acl2-8.3dfsg/books/std/strings/hexify.cert (6.829s) Making /build/acl2-8.3dfsg/books/std/io/read-file-bytes.cert on 24-Sep-2022 03:24:32 Built /build/acl2-8.3dfsg/books/std/io/read-file-bytes.cert (6.397s) Making /build/acl2-8.3dfsg/books/std/io/read-file-lines.cert on 24-Sep-2022 03:24:38 Built /build/acl2-8.3dfsg/books/std/io/read-file-lines.cert (6.906s) Making /build/acl2-8.3dfsg/books/std/io/read-file-lines-no-newlines.cert on 24-Sep-2022 03:24:46 Built /build/acl2-8.3dfsg/books/std/io/read-file-lines-no-newlines.cert (6.647s) Making /build/acl2-8.3dfsg/books/std/io/read-file-objects.cert on 24-Sep-2022 03:24:52 Built /build/acl2-8.3dfsg/books/std/io/read-file-objects.cert (5.788s) Making /build/acl2-8.3dfsg/books/kestrel/file-io-light/open-output-channel-bang.cert on 24-Sep-2022 03:24:58 Built /build/acl2-8.3dfsg/books/kestrel/file-io-light/open-output-channel-bang.cert (5.892s) Making /build/acl2-8.3dfsg/books/kestrel/file-io-light/write-byte-dollar.cert on 24-Sep-2022 03:25:04 Built /build/acl2-8.3dfsg/books/kestrel/file-io-light/write-byte-dollar.cert (3.848s) Making /build/acl2-8.3dfsg/books/kestrel/file-io-light/write-bytes-to-channel.cert on 24-Sep-2022 03:25:08 Built /build/acl2-8.3dfsg/books/kestrel/file-io-light/write-bytes-to-channel.cert (4.576s) Making /build/acl2-8.3dfsg/books/kestrel/file-io-light/princ-dollar.cert on 24-Sep-2022 03:25:13 Built /build/acl2-8.3dfsg/books/kestrel/file-io-light/princ-dollar.cert (4.415s) Making /build/acl2-8.3dfsg/books/parsers/earley/read-line.cert on 24-Sep-2022 03:25:18 Built /build/acl2-8.3dfsg/books/parsers/earley/read-line.cert (5.105s) Making /build/acl2-8.3dfsg/books/std/io/nthcdr-bytes.cert on 24-Sep-2022 03:25:23 Built /build/acl2-8.3dfsg/books/std/io/nthcdr-bytes.cert (5.291s) Making /build/acl2-8.3dfsg/books/kestrel/file-io-light/write-bytes-to-file.cert on 24-Sep-2022 03:25:28 Built /build/acl2-8.3dfsg/books/kestrel/file-io-light/write-bytes-to-file.cert (3.993s) Making /build/acl2-8.3dfsg/books/kestrel/file-io-light/write-bytes-to-file-bang.cert on 24-Sep-2022 03:25:32 Built /build/acl2-8.3dfsg/books/kestrel/file-io-light/write-bytes-to-file-bang.cert (4.300s) Making /build/acl2-8.3dfsg/books/kestrel/file-io-light/write-strings-to-channel.cert on 24-Sep-2022 03:25:37 Built /build/acl2-8.3dfsg/books/kestrel/file-io-light/write-strings-to-channel.cert (4.345s) Making /build/acl2-8.3dfsg/books/std/io/take-bytes.cert on 24-Sep-2022 03:25:41 Built /build/acl2-8.3dfsg/books/std/io/take-bytes.cert (5.027s) Making /build/acl2-8.3dfsg/books/kestrel/file-io-light/write-strings-to-file.cert on 24-Sep-2022 03:25:47 Built /build/acl2-8.3dfsg/books/kestrel/file-io-light/write-strings-to-file.cert (4.098s) Making /build/acl2-8.3dfsg/books/kestrel/file-io-light/write-strings-to-file-bang.cert on 24-Sep-2022 03:25:51 Built /build/acl2-8.3dfsg/books/kestrel/file-io-light/write-strings-to-file-bang.cert (4.372s) Making /build/acl2-8.3dfsg/books/std/io/print-objects.cert on 24-Sep-2022 03:25:55 Built /build/acl2-8.3dfsg/books/std/io/print-objects.cert (6.524s) Making /build/acl2-8.3dfsg/books/kestrel/file-io-light/top.cert on 24-Sep-2022 03:26:02 Built /build/acl2-8.3dfsg/books/kestrel/file-io-light/top.cert (2.763s) Making /build/acl2-8.3dfsg/books/ihs/basic-definitions.cert on 24-Sep-2022 03:26:05 Built /build/acl2-8.3dfsg/books/ihs/basic-definitions.cert (19.073s) Making /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/expt-helper.cert on 24-Sep-2022 03:26:24 Built /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/expt-helper.cert (5.342s) Making /build/acl2-8.3dfsg/books/kestrel/bv/logapp-def.cert on 24-Sep-2022 03:26:30 Built /build/acl2-8.3dfsg/books/kestrel/bv/logapp-def.cert (5.116s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/logior-logapp-crock.cert on 24-Sep-2022 03:26:35 Built /build/acl2-8.3dfsg/books/coi/super-ihs/logior-logapp-crock.cert (21.047s) Making /build/acl2-8.3dfsg/books/kestrel/bv/bvcat-def.cert on 24-Sep-2022 03:26:56 Built /build/acl2-8.3dfsg/books/kestrel/bv/bvcat-def.cert (2.935s) Making /build/acl2-8.3dfsg/books/std/basic/arith-equiv-defs.cert on 24-Sep-2022 03:26:59 Built /build/acl2-8.3dfsg/books/std/basic/arith-equiv-defs.cert (4.230s) Making /build/acl2-8.3dfsg/books/kestrel/bv/bvcat2.cert on 24-Sep-2022 03:27:04 Built /build/acl2-8.3dfsg/books/kestrel/bv/bvcat2.cert (2.972s) Making /build/acl2-8.3dfsg/books/std/lists/bits-equiv.cert on 24-Sep-2022 03:27:07 Built /build/acl2-8.3dfsg/books/std/lists/bits-equiv.cert (4.625s) Making /build/acl2-8.3dfsg/books/std/lists/nats-equiv.cert on 24-Sep-2022 03:27:12 Built /build/acl2-8.3dfsg/books/std/lists/nats-equiv.cert (5.853s) Making /build/acl2-8.3dfsg/books/std/basic/arith-equivs.cert on 24-Sep-2022 03:27:18 Built /build/acl2-8.3dfsg/books/std/basic/arith-equivs.cert (5.558s) Making /build/acl2-8.3dfsg/books/centaur/misc/arith-equiv-defs.cert on 24-Sep-2022 03:27:23 Built /build/acl2-8.3dfsg/books/centaur/misc/arith-equiv-defs.cert (3.688s) Making /build/acl2-8.3dfsg/books/centaur/misc/nats-equiv.cert on 24-Sep-2022 03:27:27 Built /build/acl2-8.3dfsg/books/centaur/misc/nats-equiv.cert (3.594s) Making /build/acl2-8.3dfsg/books/centaur/misc/sparsemap-impl.cert on 24-Sep-2022 03:27:31 Built /build/acl2-8.3dfsg/books/centaur/misc/sparsemap-impl.cert (75.400s) Making /build/acl2-8.3dfsg/books/centaur/misc/tarjan.cert on 24-Sep-2022 03:28:47 Built /build/acl2-8.3dfsg/books/centaur/misc/tarjan.cert (83.276s) Making /build/acl2-8.3dfsg/books/centaur/misc/u32arr.cert on 24-Sep-2022 03:30:10 Built /build/acl2-8.3dfsg/books/centaur/misc/u32arr.cert (9.318s) Making /build/acl2-8.3dfsg/books/clause-processors/induction.cert on 24-Sep-2022 03:30:20 Built /build/acl2-8.3dfsg/books/clause-processors/induction.cert (11.141s) Making /build/acl2-8.3dfsg/books/std/basic/top.cert on 24-Sep-2022 03:30:31 Built /build/acl2-8.3dfsg/books/std/basic/top.cert (4.172s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/integers-from-to.cert on 24-Sep-2022 03:30:35 Built /build/acl2-8.3dfsg/books/kestrel/utilities/integers-from-to.cert (5.740s) Making /build/acl2-8.3dfsg/books/std/lists/top.cert on 24-Sep-2022 03:30:41 Built /build/acl2-8.3dfsg/books/std/lists/top.cert (4.950s) Making /build/acl2-8.3dfsg/books/std/strings/html-encode.cert on 24-Sep-2022 03:30:46 Built /build/acl2-8.3dfsg/books/std/strings/html-encode.cert (11.491s) Making /build/acl2-8.3dfsg/books/std/strings/strrange-equiv.cert on 24-Sep-2022 03:30:58 Built /build/acl2-8.3dfsg/books/std/strings/strrange-equiv.cert (5.759s) Making /build/acl2-8.3dfsg/books/centaur/acre/match.cert on 24-Sep-2022 03:31:04 Built /build/acl2-8.3dfsg/books/centaur/acre/match.cert (56.047s) Making /build/acl2-8.3dfsg/books/centaur/gl/bvar-db.cert on 24-Sep-2022 03:32:00 Built /build/acl2-8.3dfsg/books/centaur/gl/bvar-db.cert (21.619s) Making /build/acl2-8.3dfsg/books/centaur/satlink/varp.cert on 24-Sep-2022 03:32:22 Built /build/acl2-8.3dfsg/books/centaur/satlink/varp.cert (4.422s) Making /build/acl2-8.3dfsg/books/std/stobjs/bitarr.cert on 24-Sep-2022 03:32:27 Built /build/acl2-8.3dfsg/books/std/stobjs/bitarr.cert (8.751s) Making /build/acl2-8.3dfsg/books/std/stobjs/updater-independence.cert on 24-Sep-2022 03:32:36 Built /build/acl2-8.3dfsg/books/std/stobjs/updater-independence.cert (12.080s) Making /build/acl2-8.3dfsg/books/std/stobjs/2d-arr.cert on 24-Sep-2022 03:32:48 Built /build/acl2-8.3dfsg/books/std/stobjs/2d-arr.cert (9.337s) Making /build/acl2-8.3dfsg/books/centaur/misc/iter.cert on 24-Sep-2022 03:32:57 Built /build/acl2-8.3dfsg/books/centaur/misc/iter.cert (14.539s) Making /build/acl2-8.3dfsg/books/centaur/misc/smm-impl.cert on 24-Sep-2022 03:33:12 Built /build/acl2-8.3dfsg/books/centaur/misc/smm-impl.cert (53.201s) Making /build/acl2-8.3dfsg/books/centaur/misc/nth-nat-equiv.cert on 24-Sep-2022 03:34:05 Built /build/acl2-8.3dfsg/books/centaur/misc/nth-nat-equiv.cert (4.770s) Making /build/acl2-8.3dfsg/books/centaur/clex/arithmetic.cert on 24-Sep-2022 03:34:10 Built /build/acl2-8.3dfsg/books/centaur/clex/arithmetic.cert (6.033s) Making /build/acl2-8.3dfsg/books/centaur/defrstobj/generic.cert on 24-Sep-2022 03:34:17 Built /build/acl2-8.3dfsg/books/centaur/defrstobj/generic.cert (12.299s) Making /build/acl2-8.3dfsg/books/centaur/depgraph/invert.cert on 24-Sep-2022 03:34:29 Built /build/acl2-8.3dfsg/books/centaur/depgraph/invert.cert (7.189s) Making /build/acl2-8.3dfsg/books/centaur/depgraph/transdeps.cert on 24-Sep-2022 03:34:36 Built /build/acl2-8.3dfsg/books/centaur/depgraph/transdeps.cert (11.122s) Making /build/acl2-8.3dfsg/books/std/stobjs/nicestobj.cert on 24-Sep-2022 03:34:48 Built /build/acl2-8.3dfsg/books/std/stobjs/nicestobj.cert (16.643s) Making /build/acl2-8.3dfsg/books/centaur/fgl/theory.cert on 24-Sep-2022 03:35:04 Built /build/acl2-8.3dfsg/books/centaur/fgl/theory.cert (4.731s) Making /build/acl2-8.3dfsg/books/centaur/meta/congruence.cert on 24-Sep-2022 03:35:09 Built /build/acl2-8.3dfsg/books/centaur/meta/congruence.cert (40.320s) Making /build/acl2-8.3dfsg/books/centaur/fgl/array-alist.cert on 24-Sep-2022 03:35:50 Built /build/acl2-8.3dfsg/books/centaur/fgl/array-alist.cert (14.440s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/svex.cert on 24-Sep-2022 03:36:04 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/svex.cert (39.587s) Making /build/acl2-8.3dfsg/books/centaur/fty/tests/fixequiv.cert on 24-Sep-2022 03:36:44 Built /build/acl2-8.3dfsg/books/centaur/fty/tests/fixequiv.cert (9.089s) Making /build/acl2-8.3dfsg/books/centaur/fty/tests/visitor.cert on 24-Sep-2022 03:36:53 Built /build/acl2-8.3dfsg/books/centaur/fty/tests/visitor.cert (53.431s) Making /build/acl2-8.3dfsg/books/centaur/misc/2d-arr.cert on 24-Sep-2022 03:37:47 Built /build/acl2-8.3dfsg/books/centaur/misc/2d-arr.cert (4.686s) Making /build/acl2-8.3dfsg/books/centaur/misc/arith-equivs.cert on 24-Sep-2022 03:37:52 Tick Built /build/acl2-8.3dfsg/books/centaur/misc/arith-equivs.cert (3.850s) Making /build/acl2-8.3dfsg/books/centaur/misc/bitarr.cert on 24-Sep-2022 03:37:56 Built /build/acl2-8.3dfsg/books/centaur/misc/bitarr.cert (4.282s) Making /build/acl2-8.3dfsg/books/centaur/misc/lists.cert on 24-Sep-2022 03:38:00 Built /build/acl2-8.3dfsg/books/centaur/misc/lists.cert (4.591s) Making /build/acl2-8.3dfsg/books/centaur/misc/sparsemap.cert on 24-Sep-2022 03:38:05 Built /build/acl2-8.3dfsg/books/centaur/misc/sparsemap.cert (40.113s) Making /build/acl2-8.3dfsg/books/centaur/nrev/demo.cert on 24-Sep-2022 03:38:45 Built /build/acl2-8.3dfsg/books/centaur/nrev/demo.cert (6.708s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/freq.cert on 24-Sep-2022 03:38:52 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/freq.cert (17.179s) Making /build/acl2-8.3dfsg/books/kestrel/java/atj/java-abstract-syntax.cert on 24-Sep-2022 03:39:09 Built /build/acl2-8.3dfsg/books/kestrel/java/atj/java-abstract-syntax.cert (207.094s) Making /build/acl2-8.3dfsg/books/kestrel/std/system/all-fnnames.cert on 24-Sep-2022 03:42:37 Built /build/acl2-8.3dfsg/books/kestrel/std/system/all-fnnames.cert (5.991s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/integers-from-to-tests.cert on 24-Sep-2022 03:42:43 Built /build/acl2-8.3dfsg/books/kestrel/utilities/integers-from-to-tests.cert (4.155s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/lists/set-size.cert on 24-Sep-2022 03:42:47 Built /build/acl2-8.3dfsg/books/kestrel/utilities/lists/set-size.cert (7.114s) Making /build/acl2-8.3dfsg/books/projects/simple-url-parser/parse-url.cert on 24-Sep-2022 03:42:54 Built /build/acl2-8.3dfsg/books/projects/simple-url-parser/parse-url.cert (8.506s) Making /build/acl2-8.3dfsg/books/std/stobjs/tests/2d-arr.cert on 24-Sep-2022 03:43:03 Built /build/acl2-8.3dfsg/books/std/stobjs/tests/2d-arr.cert (53.515s) Making /build/acl2-8.3dfsg/books/tools/untranslate-for-exec.cert on 24-Sep-2022 03:43:57 Built /build/acl2-8.3dfsg/books/tools/untranslate-for-exec.cert (15.145s) Making /build/acl2-8.3dfsg/books/centaur/misc/smm.cert on 24-Sep-2022 03:44:12 Built /build/acl2-8.3dfsg/books/centaur/misc/smm.cert (30.982s) Making /build/acl2-8.3dfsg/books/centaur/clex/linecol.cert on 24-Sep-2022 03:44:43 Built /build/acl2-8.3dfsg/books/centaur/clex/linecol.cert (10.488s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/vars.cert on 24-Sep-2022 03:44:54 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/vars.cert (28.450s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/context-alist.cert on 24-Sep-2022 03:45:23 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/context-alist.cert (17.339s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/lists/set-size-tests.cert on 24-Sep-2022 03:45:40 Built /build/acl2-8.3dfsg/books/kestrel/utilities/lists/set-size-tests.cert (3.207s) Making /build/acl2-8.3dfsg/books/kestrel/utilities/lists/top.cert on 24-Sep-2022 03:45:43 Built /build/acl2-8.3dfsg/books/kestrel/utilities/lists/top.cert (3.860s) Making /build/acl2-8.3dfsg/books/std/stobjs/tests/clone.cert on 24-Sep-2022 03:45:47 Built /build/acl2-8.3dfsg/books/std/stobjs/tests/clone.cert (10.195s) Making /build/acl2-8.3dfsg/books/tools/untranslate-for-exec-tests.cert on 24-Sep-2022 03:45:58 Built /build/acl2-8.3dfsg/books/tools/untranslate-for-exec-tests.cert (7.172s) Making /build/acl2-8.3dfsg/books/centaur/sv/mods/address.cert on 24-Sep-2022 03:46:05 Built /build/acl2-8.3dfsg/books/centaur/sv/mods/address.cert (33.783s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/constraints.cert on 24-Sep-2022 03:46:39 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/constraints.cert (14.686s) Making /build/acl2-8.3dfsg/books/centaur/sv/mods/path-string.cert on 24-Sep-2022 03:46:54 Built /build/acl2-8.3dfsg/books/centaur/sv/mods/path-string.cert (18.574s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/packbv-def.cert on 24-Sep-2022 03:47:13 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/packbv-def.cert (3.367s) Making /build/acl2-8.3dfsg/books/kestrel/bv/defs-shifts.cert on 24-Sep-2022 03:47:16 Built /build/acl2-8.3dfsg/books/kestrel/bv/defs-shifts.cert (3.316s) Making /build/acl2-8.3dfsg/books/ihs/logops-definitions.cert on 24-Sep-2022 03:47:20 Built /build/acl2-8.3dfsg/books/ihs/logops-definitions.cert (13.568s) Making /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/numerator-and-denominator.cert on 24-Sep-2022 03:47:33 Built /build/acl2-8.3dfsg/books/arithmetic-5/lib/basic-ops/numerator-and-denominator.cert (2.380s) Making /build/acl2-8.3dfsg/books/ihs/ihs-definitions.cert on 24-Sep-2022 03:47:36 Built /build/acl2-8.3dfsg/books/ihs/ihs-definitions.cert (4.057s) Making /build/acl2-8.3dfsg/books/ihs/logops-lemmas.cert on 24-Sep-2022 03:47:40 Built /build/acl2-8.3dfsg/books/ihs/logops-lemmas.cert (18.299s) Making /build/acl2-8.3dfsg/books/projects/avr-isa/avr8_isa.cert on 24-Sep-2022 03:47:59 Built /build/acl2-8.3dfsg/books/projects/avr-isa/avr8_isa.cert (13.782s) Making /build/acl2-8.3dfsg/books/centaur/fgl/arith-base.cert on 24-Sep-2022 03:48:13 Built /build/acl2-8.3dfsg/books/centaur/fgl/arith-base.cert (12.252s) Making /build/acl2-8.3dfsg/books/kestrel/library-wrappers/ihs-logops-lemmas.cert on 24-Sep-2022 03:48:25 Built /build/acl2-8.3dfsg/books/kestrel/library-wrappers/ihs-logops-lemmas.cert (4.192s) Making /build/acl2-8.3dfsg/books/kestrel/bv/unsigned-byte-p.cert on 24-Sep-2022 03:48:29 Built /build/acl2-8.3dfsg/books/kestrel/bv/unsigned-byte-p.cert (5.144s) Making /build/acl2-8.3dfsg/books/projects/avr-isa/avr8_isa_lemmas.cert on 24-Sep-2022 03:48:35 Built /build/acl2-8.3dfsg/books/projects/avr-isa/avr8_isa_lemmas.cert (4.696s) Making /build/acl2-8.3dfsg/books/projects/symbolic/tiny-fib/tiny.cert on 24-Sep-2022 03:48:40 Built /build/acl2-8.3dfsg/books/projects/symbolic/tiny-fib/tiny.cert (29.979s) Making /build/acl2-8.3dfsg/books/workshops/1999/simulator/tiny.cert on 24-Sep-2022 03:49:10 Built /build/acl2-8.3dfsg/books/workshops/1999/simulator/tiny.cert (23.186s) Making /build/acl2-8.3dfsg/books/workshops/2004/matthews-vroon/support/tiny-fib-example/tiny.cert on 24-Sep-2022 03:49:33 Built /build/acl2-8.3dfsg/books/workshops/2004/matthews-vroon/support/tiny-fib-example/tiny.cert (27.756s) Making /build/acl2-8.3dfsg/books/workshops/2004/sawada/support/ihs.cert on 24-Sep-2022 03:50:01 Built /build/acl2-8.3dfsg/books/workshops/2004/sawada/support/ihs.cert (3.926s) Making /build/acl2-8.3dfsg/books/centaur/fgl/fgl-object.cert on 24-Sep-2022 03:50:05 Built /build/acl2-8.3dfsg/books/centaur/fgl/fgl-object.cert (29.267s) Making /build/acl2-8.3dfsg/books/centaur/fgl/binder-rules.cert on 24-Sep-2022 03:50:35 Built /build/acl2-8.3dfsg/books/centaur/fgl/binder-rules.cert (35.477s) Making /build/acl2-8.3dfsg/books/centaur/fgl/checks.cert on 24-Sep-2022 03:51:10 Built /build/acl2-8.3dfsg/books/centaur/fgl/checks.cert (8.073s) Making /build/acl2-8.3dfsg/books/centaur/fgl/casesplit.cert on 24-Sep-2022 03:51:18 Built /build/acl2-8.3dfsg/books/centaur/fgl/casesplit.cert (23.934s) Making /build/acl2-8.3dfsg/books/kestrel/bv/logtail.cert on 24-Sep-2022 03:51:43 Built /build/acl2-8.3dfsg/books/kestrel/bv/logtail.cert (5.491s) Making /build/acl2-8.3dfsg/books/kestrel/bv/logapp.cert on 24-Sep-2022 03:51:48 Built /build/acl2-8.3dfsg/books/kestrel/bv/logapp.cert (12.183s) Making /build/acl2-8.3dfsg/books/projects/symbolic/tiny-fib/tiny-rewrites.cert on 24-Sep-2022 03:52:00 Built /build/acl2-8.3dfsg/books/projects/symbolic/tiny-fib/tiny-rewrites.cert (8.181s) Making /build/acl2-8.3dfsg/books/projects/symbolic/tiny-fib/fib-def.cert on 24-Sep-2022 03:52:09 Built /build/acl2-8.3dfsg/books/projects/symbolic/tiny-fib/fib-def.cert (4.685s) Making /build/acl2-8.3dfsg/books/projects/symbolic/tiny-triangle/triangle-def.cert on 24-Sep-2022 03:52:14 Built /build/acl2-8.3dfsg/books/projects/symbolic/tiny-triangle/triangle-def.cert (4.651s) Making /build/acl2-8.3dfsg/books/workshops/1999/simulator/exercises.cert on 24-Sep-2022 03:52:18 Built /build/acl2-8.3dfsg/books/workshops/1999/simulator/exercises.cert (6.845s) Making /build/acl2-8.3dfsg/books/workshops/2004/matthews-vroon/support/tiny-fib-example/fib-def.cert on 24-Sep-2022 03:52:25 Built /build/acl2-8.3dfsg/books/workshops/2004/matthews-vroon/support/tiny-fib-example/fib-def.cert (4.708s) Making /build/acl2-8.3dfsg/books/workshops/2004/matthews-vroon/support/tiny-fib-example/tiny-rewrites.cert on 24-Sep-2022 03:52:30 Built /build/acl2-8.3dfsg/books/workshops/2004/matthews-vroon/support/tiny-fib-example/tiny-rewrites.cert (7.778s) Making /build/acl2-8.3dfsg/books/workshops/2004/sawada/support/bv.cert on 24-Sep-2022 03:52:38 Built /build/acl2-8.3dfsg/books/workshops/2004/sawada/support/bv.cert (22.304s) Making /build/acl2-8.3dfsg/books/centaur/fgl/bvar-db.cert on 24-Sep-2022 03:53:01 Built /build/acl2-8.3dfsg/books/centaur/fgl/bvar-db.cert (39.407s) Making /build/acl2-8.3dfsg/books/centaur/fgl/def-fgl-rewrite.cert on 24-Sep-2022 03:53:40 Built /build/acl2-8.3dfsg/books/centaur/fgl/def-fgl-rewrite.cert (23.427s) Making /build/acl2-8.3dfsg/books/kestrel/bv/slice.cert on 24-Sep-2022 03:54:04 Built /build/acl2-8.3dfsg/books/kestrel/bv/slice.cert (4.814s) Making /build/acl2-8.3dfsg/books/projects/symbolic/generic/tiny-fib-correct.cert on 24-Sep-2022 03:54:09 Built /build/acl2-8.3dfsg/books/projects/symbolic/generic/tiny-fib-correct.cert (13.451s) Making /build/acl2-8.3dfsg/books/projects/symbolic/tiny-triangle/tiny-triangle-correct.cert on 24-Sep-2022 03:54:22 Built /build/acl2-8.3dfsg/books/projects/symbolic/tiny-triangle/tiny-triangle-correct.cert (12.860s) Making /build/acl2-8.3dfsg/books/workshops/2004/matthews-vroon/support/tiny-fib-example/partial-clock-functions.cert on 24-Sep-2022 03:54:35 Built /build/acl2-8.3dfsg/books/workshops/2004/matthews-vroon/support/tiny-fib-example/partial-clock-functions.cert (21.586s) Making /build/acl2-8.3dfsg/books/centaur/fgl/enums.cert on 24-Sep-2022 03:54:57 Built /build/acl2-8.3dfsg/books/centaur/fgl/enums.cert (16.252s) Making /build/acl2-8.3dfsg/books/centaur/fgl/sat-binder-defs.cert on 24-Sep-2022 03:55:14 Built /build/acl2-8.3dfsg/books/centaur/fgl/sat-binder-defs.cert (15.672s) Making /build/acl2-8.3dfsg/books/kestrel/bv/getbit.cert on 24-Sep-2022 03:55:29 Built /build/acl2-8.3dfsg/books/kestrel/bv/getbit.cert (4.553s) Making /build/acl2-8.3dfsg/books/centaur/fgl/greedy-max-sat.cert on 24-Sep-2022 03:55:34 Built /build/acl2-8.3dfsg/books/centaur/fgl/greedy-max-sat.cert (21.342s) Making /build/acl2-8.3dfsg/books/kestrel/bv/bvplus.cert on 24-Sep-2022 03:55:56 Built /build/acl2-8.3dfsg/books/kestrel/bv/bvplus.cert (4.790s) Making /build/acl2-8.3dfsg/books/kestrel/bv/bvcat.cert on 24-Sep-2022 03:56:01 Built /build/acl2-8.3dfsg/books/kestrel/bv/bvcat.cert (32.921s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/byte-to-bits.cert on 24-Sep-2022 03:56:34 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/byte-to-bits.cert (3.568s) Making /build/acl2-8.3dfsg/books/kestrel/bv/ops64.cert on 24-Sep-2022 03:56:37 Built /build/acl2-8.3dfsg/books/kestrel/bv/ops64.cert (3.381s) Making /build/acl2-8.3dfsg/books/kestrel/bv/bvxor.cert on 24-Sep-2022 03:56:41 Built /build/acl2-8.3dfsg/books/kestrel/bv/bvxor.cert (4.320s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/bits-to-byte-little.cert on 24-Sep-2022 03:56:46 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/bits-to-byte-little.cert (3.549s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/bits-to-byte.cert on 24-Sep-2022 03:56:49 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/bits-to-byte.cert (3.848s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/byte-to-bits-little.cert on 24-Sep-2022 03:56:53 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/byte-to-bits-little.cert (3.603s) Making /build/acl2-8.3dfsg/books/kestrel/bv/bitxor.cert on 24-Sep-2022 03:56:57 Built /build/acl2-8.3dfsg/books/kestrel/bv/bitxor.cert (3.492s) Making /build/acl2-8.3dfsg/books/kestrel/bv/leftrotate.cert on 24-Sep-2022 03:57:01 Built /build/acl2-8.3dfsg/books/kestrel/bv/leftrotate.cert (4.216s) Making /build/acl2-8.3dfsg/books/kestrel/bv/putbits.cert on 24-Sep-2022 03:57:05 Built /build/acl2-8.3dfsg/books/kestrel/bv/putbits.cert (4.629s) Making /build/acl2-8.3dfsg/books/kestrel/bv/ops32.cert on 24-Sep-2022 03:57:10 Built /build/acl2-8.3dfsg/books/kestrel/bv/ops32.cert (3.440s) Making /build/acl2-8.3dfsg/books/kestrel/bv/rightrotate.cert on 24-Sep-2022 03:57:13 Built /build/acl2-8.3dfsg/books/kestrel/bv/rightrotate.cert (4.370s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/bytes-to-bits.cert on 24-Sep-2022 03:57:18 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/bytes-to-bits.cert (4.179s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/bvxor-list.cert on 24-Sep-2022 03:57:22 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/bvxor-list.cert (3.694s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/bits-to-bytes-little.cert on 24-Sep-2022 03:57:26 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/bits-to-bytes-little.cert (3.926s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/bits-to-bytes.cert on 24-Sep-2022 03:57:30 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/bits-to-bytes.cert (4.000s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/bytes-to-bits-little.cert on 24-Sep-2022 03:57:34 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/bytes-to-bits-little.cert (4.155s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/string-to-bits.cert on 24-Sep-2022 03:57:39 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/string-to-bits.cert (3.766s) Making /build/acl2-8.3dfsg/books/kestrel/bv/top.cert on 24-Sep-2022 03:57:42 Built /build/acl2-8.3dfsg/books/kestrel/bv/top.cert (4.079s) Making /build/acl2-8.3dfsg/books/std/bitsets/bignum-extract.cert on 24-Sep-2022 03:57:47 Built /build/acl2-8.3dfsg/books/std/bitsets/bignum-extract.cert (5.072s) Making /build/acl2-8.3dfsg/books/centaur/4v-sexpr/bitspecs.cert on 24-Sep-2022 03:57:52 Built /build/acl2-8.3dfsg/books/centaur/4v-sexpr/bitspecs.cert (35.557s) Making /build/acl2-8.3dfsg/books/std/bitsets/bignum-extract-opt.cert on 24-Sep-2022 03:58:28 Built /build/acl2-8.3dfsg/books/std/bitsets/bignum-extract-opt.cert (5.155s) Making /build/acl2-8.3dfsg/books/centaur/bitops/ihsext-basics.cert on 24-Sep-2022 03:58:33 Built /build/acl2-8.3dfsg/books/centaur/bitops/ihsext-basics.cert (58.450s) Making /build/acl2-8.3dfsg/books/std/bitsets/bignum-extract-opt-tests.cert on 24-Sep-2022 03:59:32 Built /build/acl2-8.3dfsg/books/std/bitsets/bignum-extract-opt-tests.cert (4.263s) Making /build/acl2-8.3dfsg/books/centaur/aignet/bit-lemmas.cert on 24-Sep-2022 03:59:36 Built /build/acl2-8.3dfsg/books/centaur/aignet/bit-lemmas.cert (4.782s) Making /build/acl2-8.3dfsg/books/centaur/bitops/signed-byte-p.cert on 24-Sep-2022 03:59:41 Built /build/acl2-8.3dfsg/books/centaur/bitops/signed-byte-p.cert (11.500s) Making /build/acl2-8.3dfsg/books/centaur/bitops/trailing-0-count.cert on 24-Sep-2022 03:59:53 Built /build/acl2-8.3dfsg/books/centaur/bitops/trailing-0-count.cert (16.248s) Making /build/acl2-8.3dfsg/books/centaur/bitops/part-select.cert on 24-Sep-2022 04:00:09 Built /build/acl2-8.3dfsg/books/centaur/bitops/part-select.cert (6.083s) Making /build/acl2-8.3dfsg/books/centaur/bitops/fast-logext.cert on 24-Sep-2022 04:00:15 Built /build/acl2-8.3dfsg/books/centaur/bitops/fast-logext.cert (8.895s) Making /build/acl2-8.3dfsg/books/centaur/bitops/ash-bounds.cert on 24-Sep-2022 04:00:24 Built /build/acl2-8.3dfsg/books/centaur/bitops/ash-bounds.cert (6.546s) Making /build/acl2-8.3dfsg/books/centaur/bed/ops.cert on 24-Sep-2022 04:00:31 Built /build/acl2-8.3dfsg/books/centaur/bed/ops.cert (9.533s) Making /build/acl2-8.3dfsg/books/centaur/bitops/defaults.cert on 24-Sep-2022 04:00:41 Built /build/acl2-8.3dfsg/books/centaur/bitops/defaults.cert (4.588s) Making /build/acl2-8.3dfsg/books/centaur/bitops/fast-part-select.cert on 24-Sep-2022 04:00:46 Built /build/acl2-8.3dfsg/books/centaur/bitops/fast-part-select.cert (14.451s) Making /build/acl2-8.3dfsg/books/centaur/bitops/limited-shifts.cert on 24-Sep-2022 04:01:00 Built /build/acl2-8.3dfsg/books/centaur/bitops/limited-shifts.cert (8.698s) Making /build/acl2-8.3dfsg/books/centaur/bitops/logsaturate.cert on 24-Sep-2022 04:01:09 Built /build/acl2-8.3dfsg/books/centaur/bitops/logsaturate.cert (5.979s) Making /build/acl2-8.3dfsg/books/centaur/bitops/parity.cert on 24-Sep-2022 04:01:15 Built /build/acl2-8.3dfsg/books/centaur/bitops/parity.cert (7.039s) Making /build/acl2-8.3dfsg/books/centaur/bitops/width-find-rule.cert on 24-Sep-2022 04:01:22 Built /build/acl2-8.3dfsg/books/centaur/bitops/width-find-rule.cert (5.408s) Making /build/acl2-8.3dfsg/books/centaur/misc/intstack.cert on 24-Sep-2022 04:01:28 Built /build/acl2-8.3dfsg/books/centaur/misc/intstack.cert (33.228s) Making /build/acl2-8.3dfsg/books/centaur/fgl/scratch-nontagidx.cert on 24-Sep-2022 04:02:01 Built /build/acl2-8.3dfsg/books/centaur/fgl/scratch-nontagidx.cert (15.145s) Making /build/acl2-8.3dfsg/books/centaur/gl/gl-misc-defs.cert on 24-Sep-2022 04:02:17 Built /build/acl2-8.3dfsg/books/centaur/gl/gl-misc-defs.cert (10.760s) Making /build/acl2-8.3dfsg/books/std/io/combine.cert on 24-Sep-2022 04:02:28 Built /build/acl2-8.3dfsg/books/std/io/combine.cert (9.463s) Making /build/acl2-8.3dfsg/books/unicode/utf8-table36.cert on 24-Sep-2022 04:02:37 Built /build/acl2-8.3dfsg/books/unicode/utf8-table36.cert (11.077s) Making /build/acl2-8.3dfsg/books/unicode/utf8-table37.cert on 24-Sep-2022 04:02:49 Built /build/acl2-8.3dfsg/books/unicode/utf8-table37.cert (15.069s) Making /build/acl2-8.3dfsg/books/centaur/bitops/extra-defs.cert on 24-Sep-2022 04:03:04 Built /build/acl2-8.3dfsg/books/centaur/bitops/extra-defs.cert (17.988s) Making /build/acl2-8.3dfsg/books/centaur/bed/eval.cert on 24-Sep-2022 04:03:22 Built /build/acl2-8.3dfsg/books/centaur/bed/eval.cert (5.055s) Making /build/acl2-8.3dfsg/books/centaur/bed/print.cert on 24-Sep-2022 04:03:27 Built /build/acl2-8.3dfsg/books/centaur/bed/print.cert (5.617s) Making /build/acl2-8.3dfsg/books/std/io/read-ints.cert on 24-Sep-2022 04:03:33 Built /build/acl2-8.3dfsg/books/std/io/read-ints.cert (36.918s) Making /build/acl2-8.3dfsg/books/unicode/utf8-encode.cert on 24-Sep-2022 04:04:10 Built /build/acl2-8.3dfsg/books/unicode/utf8-encode.cert (9.399s) Making /build/acl2-8.3dfsg/books/centaur/bed/mk1.cert on 24-Sep-2022 04:04:20 Built /build/acl2-8.3dfsg/books/centaur/bed/mk1.cert (20.414s) Making /build/acl2-8.3dfsg/books/unicode/utf8-decode.cert on 24-Sep-2022 04:04:40 Tick Built /build/acl2-8.3dfsg/books/unicode/utf8-decode.cert (223.103s) Making /build/acl2-8.3dfsg/books/centaur/bed/up.cert on 24-Sep-2022 04:08:23 Built /build/acl2-8.3dfsg/books/centaur/bed/up.cert (10.308s) Making /build/acl2-8.3dfsg/books/unicode/read-utf8.cert on 24-Sep-2022 04:08:34 Built /build/acl2-8.3dfsg/books/unicode/read-utf8.cert (37.389s) Making /build/acl2-8.3dfsg/books/centaur/satlink/litp.cert on 24-Sep-2022 04:09:11 Built /build/acl2-8.3dfsg/books/centaur/satlink/litp.cert (12.311s) Making /build/acl2-8.3dfsg/books/centaur/aig/aiger-help.cert on 24-Sep-2022 04:09:24 Built /build/acl2-8.3dfsg/books/centaur/aig/aiger-help.cert (20.030s) Making /build/acl2-8.3dfsg/books/centaur/satlink/dimacs-lits.cert on 24-Sep-2022 04:09:44 Built /build/acl2-8.3dfsg/books/centaur/satlink/dimacs-lits.cert (8.766s) Making /build/acl2-8.3dfsg/books/centaur/satlink/cnf.cert on 24-Sep-2022 04:09:53 Built /build/acl2-8.3dfsg/books/centaur/satlink/cnf.cert (18.076s) Making /build/acl2-8.3dfsg/books/centaur/aignet/litp.cert on 24-Sep-2022 04:10:11 Built /build/acl2-8.3dfsg/books/centaur/aignet/litp.cert (5.679s) Making /build/acl2-8.3dfsg/books/centaur/ipasir/ipasir-logic.cert on 24-Sep-2022 04:10:17 Built /build/acl2-8.3dfsg/books/centaur/ipasir/ipasir-logic.cert (47.723s) Making /build/acl2-8.3dfsg/books/centaur/aignet/snodes.cert on 24-Sep-2022 04:11:05 Built /build/acl2-8.3dfsg/books/centaur/aignet/snodes.cert (10.664s) Making /build/acl2-8.3dfsg/books/centaur/aignet/aignet-logic.cert on 24-Sep-2022 04:11:16 Built /build/acl2-8.3dfsg/books/centaur/aignet/aignet-logic.cert (64.620s) Making /build/acl2-8.3dfsg/books/centaur/aignet/aignet-exec-thms.cert on 24-Sep-2022 04:12:21 Built /build/acl2-8.3dfsg/books/centaur/aignet/aignet-exec-thms.cert (77.056s) Making /build/acl2-8.3dfsg/books/centaur/aignet/aignet-logic-interface.cert on 24-Sep-2022 04:13:38 Built /build/acl2-8.3dfsg/books/centaur/aignet/aignet-logic-interface.cert (16.426s) Making /build/acl2-8.3dfsg/books/centaur/aignet/aignet-exec.cert on 24-Sep-2022 04:13:55 Built /build/acl2-8.3dfsg/books/centaur/aignet/aignet-exec.cert (29.049s) Making /build/acl2-8.3dfsg/books/centaur/aignet/arrays.cert on 24-Sep-2022 04:14:24 Built /build/acl2-8.3dfsg/books/centaur/aignet/arrays.cert (23.411s) Making /build/acl2-8.3dfsg/books/centaur/aignet/aignet-absstobj.cert on 24-Sep-2022 04:14:47 Built /build/acl2-8.3dfsg/books/centaur/aignet/aignet-absstobj.cert (70.323s) Making /build/acl2-8.3dfsg/books/centaur/aignet/mark-impls.cert on 24-Sep-2022 04:15:58 Built /build/acl2-8.3dfsg/books/centaur/aignet/mark-impls.cert (41.056s) Making /build/acl2-8.3dfsg/books/centaur/aignet/refcounts.cert on 24-Sep-2022 04:16:39 Built /build/acl2-8.3dfsg/books/centaur/aignet/refcounts.cert (24.757s) Making /build/acl2-8.3dfsg/books/centaur/aignet/levels.cert on 24-Sep-2022 04:17:04 Built /build/acl2-8.3dfsg/books/centaur/aignet/levels.cert (21.728s) Making /build/acl2-8.3dfsg/books/centaur/aignet/rollback.cert on 24-Sep-2022 04:17:26 Built /build/acl2-8.3dfsg/books/centaur/aignet/rollback.cert (9.482s) Making /build/acl2-8.3dfsg/books/centaur/fgl/aignet-pathcond-stobj.cert on 24-Sep-2022 04:17:36 Built /build/acl2-8.3dfsg/books/centaur/fgl/aignet-pathcond-stobj.cert (42.989s) Making /build/acl2-8.3dfsg/books/centaur/aignet/lit-lists.cert on 24-Sep-2022 04:18:19 Built /build/acl2-8.3dfsg/books/centaur/aignet/lit-lists.cert (8.207s) Making /build/acl2-8.3dfsg/books/centaur/satlink/cnf-basics.cert on 24-Sep-2022 04:18:27 Built /build/acl2-8.3dfsg/books/centaur/satlink/cnf-basics.cert (10.115s) Making /build/acl2-8.3dfsg/books/centaur/bitops/integer-length.cert on 24-Sep-2022 04:18:37 Built /build/acl2-8.3dfsg/books/centaur/bitops/integer-length.cert (6.032s) Making /build/acl2-8.3dfsg/books/centaur/satlink/lrat-interface.cert on 24-Sep-2022 04:18:44 Built /build/acl2-8.3dfsg/books/centaur/satlink/lrat-interface.cert (12.250s) Making /build/acl2-8.3dfsg/books/centaur/bitops/floor.cert on 24-Sep-2022 04:18:56 Built /build/acl2-8.3dfsg/books/centaur/bitops/floor.cert (8.514s) Making /build/acl2-8.3dfsg/books/centaur/bitops/logbitp-mismatch.cert on 24-Sep-2022 04:19:05 Built /build/acl2-8.3dfsg/books/centaur/bitops/logbitp-mismatch.cert (7.044s) Making /build/acl2-8.3dfsg/books/centaur/ipasir/ipasir-tools.cert on 24-Sep-2022 04:19:12 Built /build/acl2-8.3dfsg/books/centaur/ipasir/ipasir-tools.cert (17.857s) Making /build/acl2-8.3dfsg/books/centaur/bitops/equal-by-logbitp.cert on 24-Sep-2022 04:19:30 Built /build/acl2-8.3dfsg/books/centaur/bitops/equal-by-logbitp.cert (27.706s) Making /build/acl2-8.3dfsg/books/workshops/2018/sumners/ipasir-tools-off.cert on 24-Sep-2022 04:19:58 Built /build/acl2-8.3dfsg/books/workshops/2018/sumners/ipasir-tools-off.cert (12.365s) Making /build/acl2-8.3dfsg/books/centaur/bitops/fast-logrev.cert on 24-Sep-2022 04:20:10 Built /build/acl2-8.3dfsg/books/centaur/bitops/fast-logrev.cert (9.815s) Making /build/acl2-8.3dfsg/books/centaur/bitops/rotate.cert on 24-Sep-2022 04:20:20 Built /build/acl2-8.3dfsg/books/centaur/bitops/rotate.cert (18.579s) Making /build/acl2-8.3dfsg/books/centaur/bitops/merge.cert on 24-Sep-2022 04:20:39 Built /build/acl2-8.3dfsg/books/centaur/bitops/merge.cert (45.223s) Making /build/acl2-8.3dfsg/books/centaur/bitops/sparseint.cert on 24-Sep-2022 04:21:24 Built /build/acl2-8.3dfsg/books/centaur/bitops/sparseint.cert (187.535s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/4vec-subtypes.cert on 24-Sep-2022 04:24:32 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/4vec-subtypes.cert (12.655s) Making /build/acl2-8.3dfsg/books/centaur/vl/util/locations.cert on 24-Sep-2022 04:24:45 Built /build/acl2-8.3dfsg/books/centaur/vl/util/locations.cert (14.800s) Making /build/acl2-8.3dfsg/books/std/strings/base64.cert on 24-Sep-2022 04:25:00 Built /build/acl2-8.3dfsg/books/std/strings/base64.cert (30.024s) Making /build/acl2-8.3dfsg/books/workshops/2017/kaufmann-swords/support/context-rw-example.cert on 24-Sep-2022 04:25:30 Built /build/acl2-8.3dfsg/books/workshops/2017/kaufmann-swords/support/context-rw-example.cert (9.275s) Making /build/acl2-8.3dfsg/books/centaur/bitops/fast-rotate.cert on 24-Sep-2022 04:25:40 Built /build/acl2-8.3dfsg/books/centaur/bitops/fast-rotate.cert (30.583s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/4vec.cert on 24-Sep-2022 04:26:10 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/4vec.cert (61.495s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/4vmask.cert on 24-Sep-2022 04:27:12 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/4vmask.cert (24.307s) Making /build/acl2-8.3dfsg/books/centaur/vl/expr.cert on 24-Sep-2022 04:27:36 Built /build/acl2-8.3dfsg/books/centaur/vl/expr.cert (272.636s) Making /build/acl2-8.3dfsg/books/centaur/svl/bits-sbits-defs.cert on 24-Sep-2022 04:32:09 Built /build/acl2-8.3dfsg/books/centaur/svl/bits-sbits-defs.cert (9.927s) Making /build/acl2-8.3dfsg/books/std/strings/base64-tests.cert on 24-Sep-2022 04:32:19 Built /build/acl2-8.3dfsg/books/std/strings/base64-tests.cert (4.715s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/eval.cert on 24-Sep-2022 04:32:24 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/eval.cert (36.242s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/s4vec.cert on 24-Sep-2022 04:33:01 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/s4vec.cert (40.289s) Making /build/acl2-8.3dfsg/books/centaur/vl/mlib/coretypes.cert on 24-Sep-2022 04:33:41 Built /build/acl2-8.3dfsg/books/centaur/vl/mlib/coretypes.cert (18.213s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/xeval.cert on 24-Sep-2022 04:33:59 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/xeval.cert (18.636s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/rewrite-base.cert on 24-Sep-2022 04:34:18 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/rewrite-base.cert (32.495s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/rsh-concat.cert on 24-Sep-2022 04:34:51 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/rsh-concat.cert (40.011s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/lists.cert on 24-Sep-2022 04:35:31 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/lists.cert (26.982s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/env-ops.cert on 24-Sep-2022 04:35:58 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/env-ops.cert (21.140s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/svex-equivs.cert on 24-Sep-2022 04:36:19 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/svex-equivs.cert (14.080s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/junk.cert on 24-Sep-2022 04:36:34 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/junk.cert (16.599s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/rewrite-trace.cert on 24-Sep-2022 04:36:50 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/rewrite-trace.cert (19.722s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/seval.cert on 24-Sep-2022 04:37:10 Tick Built /build/acl2-8.3dfsg/books/centaur/sv/svex/seval.cert (51.726s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/lattice.cert on 24-Sep-2022 04:38:02 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/lattice.cert (77.678s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/concat-rw.cert on 24-Sep-2022 04:39:20 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/concat-rw.cert (34.440s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/unroll.cert on 24-Sep-2022 04:39:55 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/unroll.cert (49.798s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/argmasks.cert on 24-Sep-2022 04:40:45 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/argmasks.cert (335.155s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/rewrite-rules.cert on 24-Sep-2022 04:46:20 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/rewrite-rules.cert (433.909s) Making /build/acl2-8.3dfsg/books/centaur/bitops/part-install.cert on 24-Sep-2022 04:53:34 Built /build/acl2-8.3dfsg/books/centaur/bitops/part-install.cert (8.498s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/letabstract.cert on 24-Sep-2022 04:53:43 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/letabstract.cert (45.554s) Making /build/acl2-8.3dfsg/books/centaur/fty/bitstruct-theory.cert on 24-Sep-2022 04:54:29 Built /build/acl2-8.3dfsg/books/centaur/fty/bitstruct-theory.cert (15.384s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/rewrite.cert on 24-Sep-2022 04:54:44 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/rewrite.cert (100.579s) Making /build/acl2-8.3dfsg/books/centaur/fty/bitstruct.cert on 24-Sep-2022 04:56:25 Built /build/acl2-8.3dfsg/books/centaur/fty/bitstruct.cert (31.652s) Making /build/acl2-8.3dfsg/books/centaur/sv/svex/compose.cert on 24-Sep-2022 04:56:57 Built /build/acl2-8.3dfsg/books/centaur/sv/svex/compose.cert (211.540s) Making /build/acl2-8.3dfsg/books/centaur/fty/tests/bitstruct.cert on 24-Sep-2022 05:00:29 Built /build/acl2-8.3dfsg/books/centaur/fty/tests/bitstruct.cert (329.632s) Making /build/acl2-8.3dfsg/books/projects/x86isa/utils/basic-structs.cert on 24-Sep-2022 05:05:58 Built /build/acl2-8.3dfsg/books/projects/x86isa/utils/basic-structs.cert (72.311s) Making /build/acl2-8.3dfsg/books/centaur/sv/svtv/decomp.cert on 24-Sep-2022 05:07:11 Tick Built /build/acl2-8.3dfsg/books/centaur/sv/svtv/decomp.cert (222.190s) Making /build/acl2-8.3dfsg/books/centaur/fgl/config.cert on 24-Sep-2022 05:10:53 Built /build/acl2-8.3dfsg/books/centaur/fgl/config.cert (25.779s) Making /build/acl2-8.3dfsg/books/centaur/bitops/logrepeat.cert on 24-Sep-2022 05:11:19 Built /build/acl2-8.3dfsg/books/centaur/bitops/logrepeat.cert (11.121s) Making /build/acl2-8.3dfsg/books/centaur/fgl/member-equal.cert on 24-Sep-2022 05:11:30 Built /build/acl2-8.3dfsg/books/centaur/fgl/member-equal.cert (16.644s) Making /build/acl2-8.3dfsg/books/centaur/truth/truth.cert on 24-Sep-2022 05:11:47 Built /build/acl2-8.3dfsg/books/centaur/truth/truth.cert (93.271s) Making /build/acl2-8.3dfsg/books/centaur/bitops/ihs-extensions.cert on 24-Sep-2022 05:13:21 Built /build/acl2-8.3dfsg/books/centaur/bitops/ihs-extensions.cert (15.412s) Making /build/acl2-8.3dfsg/books/centaur/truth/sizes.cert on 24-Sep-2022 05:13:36 Built /build/acl2-8.3dfsg/books/centaur/truth/sizes.cert (89.330s) Making /build/acl2-8.3dfsg/books/centaur/bitops/saturate.cert on 24-Sep-2022 05:15:06 Built /build/acl2-8.3dfsg/books/centaur/bitops/saturate.cert (8.339s) Making /build/acl2-8.3dfsg/books/centaur/esim/tutorial/booth-support.cert on 24-Sep-2022 05:15:14 Built /build/acl2-8.3dfsg/books/centaur/esim/tutorial/booth-support.cert (9.108s) Making /build/acl2-8.3dfsg/books/centaur/fgl/arith-lemmas.cert on 24-Sep-2022 05:15:24 Built /build/acl2-8.3dfsg/books/centaur/fgl/arith-lemmas.cert (7.468s) Making /build/acl2-8.3dfsg/books/centaur/sv/tutorial/booth-support.cert on 24-Sep-2022 05:15:31 Built /build/acl2-8.3dfsg/books/centaur/sv/tutorial/booth-support.cert (9.465s) Making /build/acl2-8.3dfsg/books/centaur/aignet/axi-reductions.cert on 24-Sep-2022 05:15:41 Built /build/acl2-8.3dfsg/books/centaur/aignet/axi-reductions.cert (29.106s) Making /build/acl2-8.3dfsg/books/centaur/truth/perm4.cert on 24-Sep-2022 05:16:10 Built /build/acl2-8.3dfsg/books/centaur/truth/perm4.cert (50.025s) Making /build/acl2-8.3dfsg/books/centaur/fgl/symbolic-arithmetic.cert on 24-Sep-2022 05:17:00 Built /build/acl2-8.3dfsg/books/centaur/fgl/symbolic-arithmetic.cert (67.755s) Making /build/acl2-8.3dfsg/books/centaur/bitops/congruences.cert on 24-Sep-2022 05:18:08 Built /build/acl2-8.3dfsg/books/centaur/bitops/congruences.cert (20.341s) Making /build/acl2-8.3dfsg/books/centaur/gl/arith-lemmas.cert on 24-Sep-2022 05:18:29 Built /build/acl2-8.3dfsg/books/centaur/gl/arith-lemmas.cert (7.468s) Making /build/acl2-8.3dfsg/books/std/bitsets/bits-between.cert on 24-Sep-2022 05:18:37 Built /build/acl2-8.3dfsg/books/std/bitsets/bits-between.cert (16.110s) Making /build/acl2-8.3dfsg/books/ihs/ihs-lemmas.cert on 24-Sep-2022 05:18:53 Built /build/acl2-8.3dfsg/books/ihs/ihs-lemmas.cert (4.262s) Making /build/acl2-8.3dfsg/books/std/bitsets/sbitsets.cert on 24-Sep-2022 05:18:57 Built /build/acl2-8.3dfsg/books/std/bitsets/sbitsets.cert (102.535s) Making /build/acl2-8.3dfsg/books/arithmetic-3/extra/ext-compat.cert on 24-Sep-2022 05:20:40 Built /build/acl2-8.3dfsg/books/arithmetic-3/extra/ext-compat.cert (6.562s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/fp2.cert on 24-Sep-2022 05:20:47 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/fp2.cert (12.145s) Making /build/acl2-8.3dfsg/books/coi/nary/example.cert on 24-Sep-2022 05:20:59 Built /build/acl2-8.3dfsg/books/coi/nary/example.cert (21.596s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/plus-logapp-suck.cert on 24-Sep-2022 05:21:21 Built /build/acl2-8.3dfsg/books/coi/super-ihs/plus-logapp-suck.cert (8.432s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/signed-byte-p-overflow.cert on 24-Sep-2022 05:21:29 Built /build/acl2-8.3dfsg/books/coi/super-ihs/signed-byte-p-overflow.cert (7.722s) Making /build/acl2-8.3dfsg/books/ihs/@logops.cert on 24-Sep-2022 05:21:37 Built /build/acl2-8.3dfsg/books/ihs/@logops.cert (22.975s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/packbv.cert on 24-Sep-2022 05:22:00 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/packbv.cert (7.742s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/unpackbv.cert on 24-Sep-2022 05:22:08 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/unpackbv.cert (7.349s) Making /build/acl2-8.3dfsg/books/projects/paco/utilities.cert on 24-Sep-2022 05:22:16 Built /build/acl2-8.3dfsg/books/projects/paco/utilities.cert (21.569s) Making /build/acl2-8.3dfsg/books/misc/mult.cert on 24-Sep-2022 05:22:37 Built /build/acl2-8.3dfsg/books/misc/mult.cert (26.603s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/fp2.cert on 24-Sep-2022 05:23:04 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/fp2.cert (12.022s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/fp.cert on 24-Sep-2022 05:23:16 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/fp.cert (3.067s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/hacks.cert on 24-Sep-2022 05:23:20 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/hacks.cert (2.870s) Making /build/acl2-8.3dfsg/books/std/bitsets/sbitsets-tests.cert on 24-Sep-2022 05:23:23 Built /build/acl2-8.3dfsg/books/std/bitsets/sbitsets-tests.cert (3.493s) Making /build/acl2-8.3dfsg/books/textbook/chap4/solutions-logic-mode.cert on 24-Sep-2022 05:23:26 Built /build/acl2-8.3dfsg/books/textbook/chap4/solutions-logic-mode.cert (15.720s) Making /build/acl2-8.3dfsg/books/workshops/1999/pipeline/ihs.cert on 24-Sep-2022 05:23:42 Built /build/acl2-8.3dfsg/books/workshops/1999/pipeline/ihs.cert (5.866s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/top/ihs.cert on 24-Sep-2022 05:23:48 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/top/ihs.cert (4.381s) Making /build/acl2-8.3dfsg/books/workshops/2002/georgelin-borrione-ostier/support/utils.cert on 24-Sep-2022 05:23:53 Built /build/acl2-8.3dfsg/books/workshops/2002/georgelin-borrione-ostier/support/utils.cert (11.074s) Making /build/acl2-8.3dfsg/books/workshops/2006/greve/nary/example.cert on 24-Sep-2022 05:24:04 Built /build/acl2-8.3dfsg/books/workshops/2006/greve/nary/example.cert (32.085s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/source_shallow.cert on 24-Sep-2022 05:24:36 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/source_shallow.cert (13.908s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/denominator.cert on 24-Sep-2022 05:24:50 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/denominator.cert (2.849s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/unary-divide.cert on 24-Sep-2022 05:24:53 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/unary-divide.cert (2.807s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/product-proofs.cert on 24-Sep-2022 05:24:56 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/product-proofs.cert (2.877s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/integerp.cert on 24-Sep-2022 05:24:59 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/integerp.cert (2.867s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/sha-2/sha-256.cert on 24-Sep-2022 05:25:02 Built /build/acl2-8.3dfsg/books/kestrel/crypto/sha-2/sha-256.cert (10.181s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/sha-2/sha-512.cert on 24-Sep-2022 05:25:13 Built /build/acl2-8.3dfsg/books/kestrel/crypto/sha-2/sha-512.cert (10.133s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/packbv-and-unpackbv.cert on 24-Sep-2022 05:25:23 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/packbv-and-unpackbv.cert (3.667s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/packbv-tests.cert on 24-Sep-2022 05:25:27 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/packbv-tests.cert (3.372s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/hmac/hmac-sha-256.cert on 24-Sep-2022 05:25:30 Built /build/acl2-8.3dfsg/books/kestrel/crypto/hmac/hmac-sha-256.cert (4.565s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/padding/pad-to-448-tests.cert on 24-Sep-2022 05:25:35 Built /build/acl2-8.3dfsg/books/kestrel/crypto/padding/pad-to-448-tests.cert (3.353s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/padding/pad-to-896-tests.cert on 24-Sep-2022 05:25:38 Built /build/acl2-8.3dfsg/books/kestrel/crypto/padding/pad-to-896-tests.cert (3.522s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/sha-2/sha-224.cert on 24-Sep-2022 05:25:42 Built /build/acl2-8.3dfsg/books/kestrel/crypto/sha-2/sha-224.cert (4.251s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/sha-2/sha-384.cert on 24-Sep-2022 05:25:46 Built /build/acl2-8.3dfsg/books/kestrel/crypto/sha-2/sha-384.cert (5.064s) Making /build/acl2-8.3dfsg/books/projects/paco/output-module.cert on 24-Sep-2022 05:25:52 Built /build/acl2-8.3dfsg/books/projects/paco/output-module.cert (6.069s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/denominator.cert on 24-Sep-2022 05:25:58 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/denominator.cert (2.942s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/unary-divide.cert on 24-Sep-2022 05:26:01 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/unary-divide.cert (2.892s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/product-proofs.cert on 24-Sep-2022 05:26:04 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/product-proofs.cert (3.109s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/integerp.cert on 24-Sep-2022 05:26:07 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/integerp.cert (2.938s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/fp.cert on 24-Sep-2022 05:26:10 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/fp.cert (2.974s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/hacks.cert on 24-Sep-2022 05:26:14 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/hacks.cert (3.136s) Making /build/acl2-8.3dfsg/books/workshops/1999/pipeline/b-ops-aux-def.cert on 24-Sep-2022 05:26:17 Built /build/acl2-8.3dfsg/books/workshops/1999/pipeline/b-ops-aux-def.cert (4.712s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/serial/serial.cert on 24-Sep-2022 05:26:22 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/serial/serial.cert (8.788s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/ihs.cert on 24-Sep-2022 05:26:31 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/ihs.cert (4.464s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/b-ops-aux-def.cert on 24-Sep-2022 05:26:35 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/b-ops-aux-def.cert (4.706s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/ihs.cert on 24-Sep-2022 05:26:40 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/ihs.cert (4.392s) Making /build/acl2-8.3dfsg/books/workshops/2002/georgelin-borrione-ostier/support/generates-functions.cert on 24-Sep-2022 05:26:45 Built /build/acl2-8.3dfsg/books/workshops/2002/georgelin-borrione-ostier/support/generates-functions.cert (23.188s) Making /build/acl2-8.3dfsg/books/workshops/2002/georgelin-borrione-ostier/support/generates-theorems.cert on 24-Sep-2022 05:27:08 Built /build/acl2-8.3dfsg/books/workshops/2002/georgelin-borrione-ostier/support/generates-theorems.cert (6.158s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/computed-hints.cert on 24-Sep-2022 05:27:14 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/computed-hints.cert (7.296s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/numerator.cert on 24-Sep-2022 05:27:22 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/numerator.cert (3.389s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/product.cert on 24-Sep-2022 05:27:25 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/product.cert (2.823s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/even-odd.cert on 24-Sep-2022 05:27:28 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/even-odd.cert (3.367s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/hmac/hmac-sha-512.cert on 24-Sep-2022 05:27:32 Built /build/acl2-8.3dfsg/books/kestrel/crypto/hmac/hmac-sha-512.cert (4.383s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/tests-top.cert on 24-Sep-2022 05:27:36 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/tests-top.cert (3.435s) Making /build/acl2-8.3dfsg/books/kestrel/bv-lists/top.cert on 24-Sep-2022 05:27:40 Built /build/acl2-8.3dfsg/books/kestrel/bv-lists/top.cert (3.721s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/hmac/hmac-sha-256-tests.cert on 24-Sep-2022 05:27:44 Built /build/acl2-8.3dfsg/books/kestrel/crypto/hmac/hmac-sha-256-tests.cert (3.796s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/hmac/hmac-sha-512-tests.cert on 24-Sep-2022 05:27:48 Built /build/acl2-8.3dfsg/books/kestrel/crypto/hmac/hmac-sha-512-tests.cert (3.900s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/hmac/top.cert on 24-Sep-2022 05:27:52 Built /build/acl2-8.3dfsg/books/kestrel/crypto/hmac/top.cert (4.133s) Making /build/acl2-8.3dfsg/books/kestrel/crypto/sha-2/top.cert on 24-Sep-2022 05:27:56 Built /build/acl2-8.3dfsg/books/kestrel/crypto/sha-2/top.cert (4.249s) Making /build/acl2-8.3dfsg/books/projects/paco/foundations.cert on 24-Sep-2022 05:28:01 Built /build/acl2-8.3dfsg/books/projects/paco/foundations.cert (35.684s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/numerator.cert on 24-Sep-2022 05:28:37 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/numerator.cert (3.061s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/product.cert on 24-Sep-2022 05:28:40 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/product.cert (2.717s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/even-odd.cert on 24-Sep-2022 05:28:43 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/even-odd.cert (3.311s) Making /build/acl2-8.3dfsg/books/workshops/1999/pipeline/b-ops-aux.cert on 24-Sep-2022 05:28:46 Built /build/acl2-8.3dfsg/books/workshops/1999/pipeline/b-ops-aux.cert (7.626s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/netlist/netlist.cert on 24-Sep-2022 05:28:54 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/netlist/netlist.cert (5.290s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/serial/ma128serial.cert on 24-Sep-2022 05:28:59 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/serial/ma128serial.cert (4.976s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/serial/ma128intserial.cert on 24-Sep-2022 05:29:04 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/serial/ma128intserial.cert (5.183s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/b-ops-aux-def.cert on 24-Sep-2022 05:29:10 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/b-ops-aux-def.cert (4.781s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/b-ops-aux.cert on 24-Sep-2022 05:29:15 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/b-ops-aux.cert (4.610s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/b-ops-aux.cert on 24-Sep-2022 05:29:19 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/b-ops-aux.cert (4.587s) Making /build/acl2-8.3dfsg/books/workshops/2002/georgelin-borrione-ostier/support/acl2-transl.cert on 24-Sep-2022 05:29:24 Built /build/acl2-8.3dfsg/books/workshops/2002/georgelin-borrione-ostier/support/acl2-transl.cert (8.434s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/AES/AES-source-shallow-canon.cert on 24-Sep-2022 05:29:33 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/AES/AES-source-shallow-canon.cert (89.573s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/AES/AES-source-shallow-flatten.cert on 24-Sep-2022 05:31:03 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/AES/AES-source-shallow-flatten.cert (182.038s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/Fibonacci/fibs-source-shallow-canon.cert on 24-Sep-2022 05:34:05 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/Fibonacci/fibs-source-shallow-canon.cert (5.550s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/Fibonacci/fibs-source-shallow-flatten.cert on 24-Sep-2022 05:34:11 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/Fibonacci/fibs-source-shallow-flatten.cert (5.391s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/RC6/RC6-source-shallow-canon.cert on 24-Sep-2022 05:34:16 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/RC6/RC6-source-shallow-canon.cert (8.397s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/RC6/RC6-source-shallow-flatten.cert on 24-Sep-2022 05:34:25 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/RC6/RC6-source-shallow-flatten.cert (7.711s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/TEA/TEA-source-shallow-canon.cert on 24-Sep-2022 05:34:33 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/TEA/TEA-source-shallow-canon.cert (7.323s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/TEA/TEA-source-shallow-flatten.cert on 24-Sep-2022 05:34:40 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/TEA/TEA-source-shallow-flatten.cert (8.221s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/factorial/fac-source-shallow-canon.cert on 24-Sep-2022 05:34:48 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/factorial/fac-source-shallow-canon.cert (5.399s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/factorial/fac-source-shallow-flatten.cert on 24-Sep-2022 05:34:54 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/factorial/fac-source-shallow-flatten.cert (5.745s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/arith2.cert on 24-Sep-2022 05:35:00 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/arith2.cert (3.369s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/common-factor.cert on 24-Sep-2022 05:35:03 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/common-factor.cert (3.490s) Making /build/acl2-8.3dfsg/books/projects/paco/type-set.cert on 24-Sep-2022 05:35:07 Built /build/acl2-8.3dfsg/books/projects/paco/type-set.cert (151.062s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/arith2.cert on 24-Sep-2022 05:37:38 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/arith2.cert (3.267s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/common-factor.cert on 24-Sep-2022 05:37:42 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/common-factor.cert (3.657s) Making /build/acl2-8.3dfsg/books/workshops/1999/pipeline/basic-def.cert on 24-Sep-2022 05:37:46 Tick Built /build/acl2-8.3dfsg/books/workshops/1999/pipeline/basic-def.cert (17.151s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/netlist/ma128net.cert on 24-Sep-2022 05:38:03 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/netlist/ma128net.cert (4.601s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/serial/ma128serial-ma128.cert on 24-Sep-2022 05:38:08 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/serial/ma128serial-ma128.cert (6.448s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/netlist/ma128intnet.cert on 24-Sep-2022 05:38:15 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/netlist/ma128intnet.cert (4.591s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/serial/ma128intserial-ma128int.cert on 24-Sep-2022 05:38:19 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/serial/ma128intserial-ma128int.cert (7.023s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/basic-def.cert on 24-Sep-2022 05:38:27 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/basic-def.cert (17.691s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/basic-def.cert on 24-Sep-2022 05:38:45 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/basic-def.cert (16.486s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/arith.cert on 24-Sep-2022 05:39:01 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/arith.cert (3.045s) Making /build/acl2-8.3dfsg/books/projects/paco/rewrite.cert on 24-Sep-2022 05:39:04 Built /build/acl2-8.3dfsg/books/projects/paco/rewrite.cert (26.155s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/arith.cert on 24-Sep-2022 05:39:31 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/arith.cert (3.334s) Making /build/acl2-8.3dfsg/books/workshops/1999/pipeline/model.cert on 24-Sep-2022 05:39:34 Built /build/acl2-8.3dfsg/books/workshops/1999/pipeline/model.cert (11.309s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/netlist/ma128net-ma128serial.cert on 24-Sep-2022 05:39:46 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/netlist/ma128net-ma128serial.cert (5.179s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/netlist/ma128intnet-ma128intserial.cert on 24-Sep-2022 05:39:51 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/netlist/ma128intnet-ma128intserial.cert (5.744s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/model.cert on 24-Sep-2022 05:39:57 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/model.cert (11.178s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/model.cert on 24-Sep-2022 05:40:08 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/model.cert (11.045s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/nniq.cert on 24-Sep-2022 05:40:19 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/nniq.cert (5.022s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/even-odd2-proofs.cert on 24-Sep-2022 05:40:25 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/even-odd2-proofs.cert (4.297s) Making /build/acl2-8.3dfsg/books/projects/paco/simplify.cert on 24-Sep-2022 05:40:29 Built /build/acl2-8.3dfsg/books/projects/paco/simplify.cert (11.503s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/nniq.cert on 24-Sep-2022 05:40:41 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/nniq.cert (5.061s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/even-odd2-proofs.cert on 24-Sep-2022 05:40:46 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/even-odd2-proofs.cert (4.289s) Making /build/acl2-8.3dfsg/books/workshops/1999/pipeline/table-def.cert on 24-Sep-2022 05:40:50 Built /build/acl2-8.3dfsg/books/workshops/1999/pipeline/table-def.cert (12.154s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/table-def.cert on 24-Sep-2022 05:41:03 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/table-def.cert (12.185s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/proof.cert on 24-Sep-2022 05:41:15 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/proof.cert (5.928s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/table-def.cert on 24-Sep-2022 05:41:21 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/table-def.cert (12.169s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/floor-proofs.cert on 24-Sep-2022 05:41:33 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/floor-proofs.cert (4.334s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/even-odd2.cert on 24-Sep-2022 05:41:38 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/even-odd2.cert (3.215s) Making /build/acl2-8.3dfsg/books/projects/paco/elim-dest.cert on 24-Sep-2022 05:41:41 Built /build/acl2-8.3dfsg/books/projects/paco/elim-dest.cert (15.635s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/floor-proofs.cert on 24-Sep-2022 05:41:57 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/floor-proofs.cert (4.762s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/even-odd2.cert on 24-Sep-2022 05:42:02 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/even-odd2.cert (3.591s) Making /build/acl2-8.3dfsg/books/workshops/1999/pipeline/basic-lemmas.cert on 24-Sep-2022 05:42:06 Built /build/acl2-8.3dfsg/books/workshops/1999/pipeline/basic-lemmas.cert (7.518s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/basic-lemmas.cert on 24-Sep-2022 05:42:13 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/basic-lemmas.cert (7.685s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/basic-lemmas.cert on 24-Sep-2022 05:42:21 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/basic-lemmas.cert (7.783s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/floor.cert on 24-Sep-2022 05:42:29 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/floor.cert (2.452s) Making /build/acl2-8.3dfsg/books/projects/paco/induct.cert on 24-Sep-2022 05:42:32 Built /build/acl2-8.3dfsg/books/projects/paco/induct.cert (22.677s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/floor.cert on 24-Sep-2022 05:42:55 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/floor.cert (2.751s) Making /build/acl2-8.3dfsg/books/workshops/1999/pipeline/proof.cert on 24-Sep-2022 05:42:58 Built /build/acl2-8.3dfsg/books/workshops/1999/pipeline/proof.cert (9.032s) Making /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/proof.cert on 24-Sep-2022 05:43:07 Built /build/acl2-8.3dfsg/books/workshops/2000/manolios/pipeline/trivial/sawada-model/proof.cert (9.060s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/fl-proofs.cert on 24-Sep-2022 05:43:16 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/fl-proofs.cert (5.625s) Making /build/acl2-8.3dfsg/books/projects/paco/prove.cert on 24-Sep-2022 05:43:22 Built /build/acl2-8.3dfsg/books/projects/paco/prove.cert (9.763s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/fl-proofs.cert on 24-Sep-2022 05:43:32 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/fl-proofs.cert (5.882s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/fl.cert on 24-Sep-2022 05:43:38 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/fl.cert (2.903s) Making /build/acl2-8.3dfsg/books/projects/paco/database.cert on 24-Sep-2022 05:43:41 Built /build/acl2-8.3dfsg/books/projects/paco/database.cert (19.599s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/fl.cert on 24-Sep-2022 05:44:01 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/fl.cert (3.108s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/induct.cert on 24-Sep-2022 05:44:04 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/induct.cert (4.259s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/expt-proofs.cert on 24-Sep-2022 05:44:08 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/expt-proofs.cert (5.718s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/power2p.cert on 24-Sep-2022 05:44:14 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/power2p.cert (4.941s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/cg.cert on 24-Sep-2022 05:44:19 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/cg.cert (4.173s) Making /build/acl2-8.3dfsg/books/projects/paco/paco.cert on 24-Sep-2022 05:44:23 Built /build/acl2-8.3dfsg/books/projects/paco/paco.cert (5.455s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/power2p.cert on 24-Sep-2022 05:44:29 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/power2p.cert (4.979s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/expt-proofs.cert on 24-Sep-2022 05:44:34 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/expt-proofs.cert (6.066s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/induct.cert on 24-Sep-2022 05:44:40 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/induct.cert (4.256s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/mod-proofs.cert on 24-Sep-2022 05:44:45 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/mod-proofs.cert (20.358s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/cg.cert on 24-Sep-2022 05:45:05 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/cg.cert (4.391s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/expt.cert on 24-Sep-2022 05:45:10 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/expt.cert (3.643s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/mod-proofs.cert on 24-Sep-2022 05:45:14 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/mod-proofs.cert (19.324s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/expt.cert on 24-Sep-2022 05:45:33 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/expt.cert (3.493s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/mod.cert on 24-Sep-2022 05:45:37 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/mod.cert (3.390s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/basic.cert on 24-Sep-2022 05:45:41 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/basic.cert (4.007s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/expo-proofs.cert on 24-Sep-2022 05:45:45 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/expo-proofs.cert (8.395s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/mod.cert on 24-Sep-2022 05:45:53 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/mod.cert (3.469s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/extra-rules.cert on 24-Sep-2022 05:45:57 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/extra-rules.cert (5.340s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/expo-proofs.cert on 24-Sep-2022 05:46:02 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/expo-proofs.cert (9.004s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/basic.cert on 24-Sep-2022 05:46:11 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/basic.cert (4.027s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/fl-hacks.cert on 24-Sep-2022 05:46:16 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/fl-hacks.cert (4.001s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/expo.cert on 24-Sep-2022 05:46:20 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/expo.cert (4.676s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/fl-hacks.cert on 24-Sep-2022 05:46:25 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/fl-hacks.cert (3.756s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/expo.cert on 24-Sep-2022 05:46:29 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/expo.cert (5.428s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/extra-rules.cert on 24-Sep-2022 05:46:34 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/extra-rules.cert (5.224s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/ash.cert on 24-Sep-2022 05:46:40 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/ash.cert (3.826s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/ocat.cert on 24-Sep-2022 05:46:43 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/ocat.cert (6.412s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/fl-expt.cert on 24-Sep-2022 05:46:50 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/fl-expt.cert (4.357s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/fl-expt.cert on 24-Sep-2022 05:46:55 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/fl-expt.cert (4.470s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/ash.cert on 24-Sep-2022 05:46:59 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/ash.cert (4.066s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/ocat.cert on 24-Sep-2022 05:47:03 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/ocat.cert (6.916s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/arith.cert on 24-Sep-2022 05:47:10 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/arith.cert (3.871s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/mod-expt.cert on 24-Sep-2022 05:47:14 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/mod-expt.cert (8.894s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/mod-expt.cert on 24-Sep-2022 05:47:24 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/mod-expt.cert (9.177s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/arith.cert on 24-Sep-2022 05:47:33 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/arith.cert (4.176s) Making /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/top.cert on 24-Sep-2022 05:47:37 Built /build/acl2-8.3dfsg/books/rtl/rel9/arithmetic/top.cert (4.157s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/top.cert on 24-Sep-2022 05:47:42 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/top.cert (4.292s) Making /build/acl2-8.3dfsg/books/arithmetic-3/extra/ext.cert on 24-Sep-2022 05:47:46 Built /build/acl2-8.3dfsg/books/arithmetic-3/extra/ext.cert (4.308s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lognot.cert on 24-Sep-2022 05:47:50 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lognot.cert (4.539s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/eric.cert on 24-Sep-2022 05:47:55 Built /build/acl2-8.3dfsg/books/coi/super-ihs/eric.cert (7.909s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bvecp-proofs.cert on 24-Sep-2022 05:48:03 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bvecp-proofs.cert (5.651s) Making /build/acl2-8.3dfsg/books/coi/records/mem-domain.cert on 24-Sep-2022 05:48:09 Built /build/acl2-8.3dfsg/books/coi/records/mem-domain.cert (58.745s) Making /build/acl2-8.3dfsg/books/misc/misc2/misc.cert on 24-Sep-2022 05:49:08 Built /build/acl2-8.3dfsg/books/misc/misc2/misc.cert (4.274s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bvecp-proofs.cert on 24-Sep-2022 05:49:12 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bvecp-proofs.cert (5.670s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/float.cert on 24-Sep-2022 05:49:18 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/float.cert (22.370s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lognot.cert on 24-Sep-2022 05:49:41 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lognot.cert (4.731s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/mod4.cert on 24-Sep-2022 05:49:46 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/mod4.cert (4.937s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1.delta1/arith-extra.cert on 24-Sep-2022 05:49:51 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1.delta1/arith-extra.cert (4.168s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/float.cert on 24-Sep-2022 05:49:55 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/float.cert (21.828s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/mod4.cert on 24-Sep-2022 05:50:17 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/mod4.cert (4.886s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/arith-extra.cert on 24-Sep-2022 05:50:22 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/arith-extra.cert (4.042s) Making /build/acl2-8.3dfsg/books/workshops/2004/matthews-vroon/support/partial-clock-functions/partial-clock-functions.cert on 24-Sep-2022 05:50:26 Built /build/acl2-8.3dfsg/books/workshops/2004/matthews-vroon/support/partial-clock-functions/partial-clock-functions.cert (9.590s) Making /build/acl2-8.3dfsg/books/workshops/2009/liu/support/error-analysis-tool3.cert on 24-Sep-2022 05:50:36 Built /build/acl2-8.3dfsg/books/workshops/2009/liu/support/error-analysis-tool3.cert (8.030s) Making /build/acl2-8.3dfsg/books/arithmetic-3/extra/top-ext.cert on 24-Sep-2022 05:50:44 Built /build/acl2-8.3dfsg/books/arithmetic-3/extra/top-ext.cert (3.692s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logand-proofs.cert on 24-Sep-2022 05:50:48 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logand-proofs.cert (12.415s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bvecp.cert on 24-Sep-2022 05:51:01 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bvecp.cert (3.014s) Making /build/acl2-8.3dfsg/books/models/jvm/m1-original/m1-story.cert on 24-Sep-2022 05:51:04 Built /build/acl2-8.3dfsg/books/models/jvm/m1-original/m1-story.cert (13.303s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bvecp.cert on 24-Sep-2022 05:51:17 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bvecp.cert (3.110s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logand-proofs.cert on 24-Sep-2022 05:51:20 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logand-proofs.cert (13.750s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/trunc-proofs.cert on 24-Sep-2022 05:51:34 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/trunc-proofs.cert (26.674s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/sgn.cert on 24-Sep-2022 05:52:01 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/sgn.cert (3.268s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/clocks.cert on 24-Sep-2022 05:52:05 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/clocks.cert (3.445s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1.delta1/arith.cert on 24-Sep-2022 05:52:08 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1.delta1/arith.cert (3.431s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bits-proofs.cert on 24-Sep-2022 05:52:12 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bits-proofs.cert (27.001s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/encode.cert on 24-Sep-2022 05:52:39 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/encode.cert (5.470s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/decode-proofs.cert on 24-Sep-2022 05:52:45 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/decode-proofs.cert (3.429s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/shft.cert on 24-Sep-2022 05:52:48 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/shft.cert (4.959s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bias-proofs.cert on 24-Sep-2022 05:52:53 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bias-proofs.cert (3.458s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/trunc-proofs.cert on 24-Sep-2022 05:52:57 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/trunc-proofs.cert (26.181s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/sgn.cert on 24-Sep-2022 05:53:23 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/sgn.cert (3.061s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/clocks.cert on 24-Sep-2022 05:53:26 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/clocks.cert (3.252s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/arith.cert on 24-Sep-2022 05:53:30 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/arith.cert (3.368s) Making /build/acl2-8.3dfsg/books/sorting/qsort.cert on 24-Sep-2022 05:53:33 Built /build/acl2-8.3dfsg/books/sorting/qsort.cert (6.933s) Making /build/acl2-8.3dfsg/books/workshops/2004/matthews-vroon/support/partial-clock-functions/efficient-simulator.cert on 24-Sep-2022 05:53:40 Built /build/acl2-8.3dfsg/books/workshops/2004/matthews-vroon/support/partial-clock-functions/efficient-simulator.cert (4.742s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logand.cert on 24-Sep-2022 05:53:45 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logand.cert (2.970s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bits-proofs.cert on 24-Sep-2022 05:53:48 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bits-proofs.cert (28.058s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/encode.cert on 24-Sep-2022 05:54:17 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/encode.cert (5.953s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/decode-proofs.cert on 24-Sep-2022 05:54:23 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/decode-proofs.cert (3.360s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/shft.cert on 24-Sep-2022 05:54:26 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/shft.cert (4.939s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logand.cert on 24-Sep-2022 05:54:31 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logand.cert (3.133s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bias-proofs.cert on 24-Sep-2022 05:54:35 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bias-proofs.cert (3.593s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/trunc.cert on 24-Sep-2022 05:54:38 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/trunc.cert (4.751s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/lib/clocks.cert on 24-Sep-2022 05:54:43 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/lib/clocks.cert (3.114s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/clocks.cert on 24-Sep-2022 05:54:47 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/clocks.cert (3.059s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2/clocks.cert on 24-Sep-2022 05:54:50 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2/clocks.cert (3.154s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib3/clocks.cert on 24-Sep-2022 05:54:53 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib3/clocks.cert (3.094s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bits.cert on 24-Sep-2022 05:54:56 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bits.cert (4.681s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/decode.cert on 24-Sep-2022 05:55:01 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/decode.cert (3.153s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bias.cert on 24-Sep-2022 05:55:05 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bias.cert (3.044s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/trunc.cert on 24-Sep-2022 05:55:08 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/trunc.cert (4.179s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/model-helpers.cert on 24-Sep-2022 05:55:12 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/model-helpers.cert (3.449s) Making /build/acl2-8.3dfsg/books/rtl/rel9/lib/clocks.cert on 24-Sep-2022 05:55:16 Built /build/acl2-8.3dfsg/books/rtl/rel9/lib/clocks.cert (2.897s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/clocks.cert on 24-Sep-2022 05:55:19 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/clocks.cert (2.907s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib2/clocks.cert on 24-Sep-2022 05:55:22 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib2/clocks.cert (2.979s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib3/clocks.cert on 24-Sep-2022 05:55:25 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib3/clocks.cert (3.003s) Making /build/acl2-8.3dfsg/books/sorting/no-dups-qsort.cert on 24-Sep-2022 05:55:28 Built /build/acl2-8.3dfsg/books/sorting/no-dups-qsort.cert (5.301s) Making /build/acl2-8.3dfsg/books/sorting/sorts-equivalent.cert on 24-Sep-2022 05:55:34 Built /build/acl2-8.3dfsg/books/sorting/sorts-equivalent.cert (3.796s) Making /build/acl2-8.3dfsg/books/sorting/sorts-equivalent2.cert on 24-Sep-2022 05:55:38 Built /build/acl2-8.3dfsg/books/sorting/sorts-equivalent2.cert (3.736s) Making /build/acl2-8.3dfsg/books/sorting/sorts-equivalent3.cert on 24-Sep-2022 05:55:41 Built /build/acl2-8.3dfsg/books/sorting/sorts-equivalent3.cert (3.874s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/eric-meta.cert on 24-Sep-2022 05:55:46 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/eric-meta.cert (423.777s) Making /build/acl2-8.3dfsg/books/coi/bags/eric-meta.cert on 24-Sep-2022 06:02:50 Built /build/acl2-8.3dfsg/books/coi/bags/eric-meta.cert (161.875s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logior-proofs.cert on 24-Sep-2022 06:05:32 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logior-proofs.cert (13.777s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bits.cert on 24-Sep-2022 06:05:46 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bits.cert (4.934s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/decode.cert on 24-Sep-2022 06:05:51 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/decode.cert (3.337s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logior-proofs.cert on 24-Sep-2022 06:05:54 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logior-proofs.cert (13.663s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bias.cert on 24-Sep-2022 06:06:08 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bias.cert (2.961s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/away-proofs.cert on 24-Sep-2022 06:06:11 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/away-proofs.cert (28.921s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/model-helpers.cert on 24-Sep-2022 06:06:40 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/model-helpers.cert (3.260s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bitn-proofs.cert on 24-Sep-2022 06:06:44 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bitn-proofs.cert (14.203s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/cat-proofs.cert on 24-Sep-2022 06:06:58 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/cat-proofs.cert (28.589s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/away-proofs.cert on 24-Sep-2022 06:07:27 Tick Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/away-proofs.cert (28.945s) Making /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/top.cert on 24-Sep-2022 06:07:56 Built /build/acl2-8.3dfsg/books/workshops/2004/smith-et-al/support/bags/top.cert (5.172s) Making /build/acl2-8.3dfsg/books/coi/bags/top.cert on 24-Sep-2022 06:08:01 Built /build/acl2-8.3dfsg/books/coi/bags/top.cert (5.582s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logior.cert on 24-Sep-2022 06:08:07 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logior.cert (3.085s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bitn-proofs.cert on 24-Sep-2022 06:08:10 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bitn-proofs.cert (15.153s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/cat-proofs.cert on 24-Sep-2022 06:08:26 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/cat-proofs.cert (28.931s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logior.cert on 24-Sep-2022 06:08:55 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logior.cert (3.138s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/away.cert on 24-Sep-2022 06:08:58 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/away.cert (5.571s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bitn.cert on 24-Sep-2022 06:09:04 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bitn.cert (5.079s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/cat.cert on 24-Sep-2022 06:09:09 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/cat.cert (3.976s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/away.cert on 24-Sep-2022 06:09:13 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/away.cert (4.567s) Making /build/acl2-8.3dfsg/books/coi/alists/bindequiv.cert on 24-Sep-2022 06:09:18 Built /build/acl2-8.3dfsg/books/coi/alists/bindequiv.cert (18.262s) Making /build/acl2-8.3dfsg/books/coi/paths/path.cert on 24-Sep-2022 06:09:36 Built /build/acl2-8.3dfsg/books/coi/paths/path.cert (121.654s) Making /build/acl2-8.3dfsg/books/coi/gensym/gensym.cert on 24-Sep-2022 06:11:38 Built /build/acl2-8.3dfsg/books/coi/gensym/gensym.cert (18.127s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logorc1.cert on 24-Sep-2022 06:11:57 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logorc1.cert (3.140s) Making /build/acl2-8.3dfsg/books/coi/paths/meta.cert on 24-Sep-2022 06:12:00 Built /build/acl2-8.3dfsg/books/coi/paths/meta.cert (207.118s) Making /build/acl2-8.3dfsg/books/coi/paths/equiv.cert on 24-Sep-2022 06:15:27 Built /build/acl2-8.3dfsg/books/coi/paths/equiv.cert (59.750s) Making /build/acl2-8.3dfsg/books/coi/paths/list-path-connection.cert on 24-Sep-2022 06:16:27 Built /build/acl2-8.3dfsg/books/coi/paths/list-path-connection.cert (17.324s) Making /build/acl2-8.3dfsg/books/misc/misc2/reverse-by-separation.cert on 24-Sep-2022 06:16:45 Built /build/acl2-8.3dfsg/books/misc/misc2/reverse-by-separation.cert (246.216s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bitn.cert on 24-Sep-2022 06:20:51 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bitn.cert (5.426s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/cat.cert on 24-Sep-2022 06:20:57 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/cat.cert (4.285s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logorc1.cert on 24-Sep-2022 06:21:01 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logorc1.cert (3.166s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/sumbits.cert on 24-Sep-2022 06:21:04 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/sumbits.cert (4.122s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/near-proofs.cert on 24-Sep-2022 06:21:09 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/near-proofs.cert (48.958s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/near+-proofs.cert on 24-Sep-2022 06:21:58 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/near+-proofs.cert (18.450s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/simplify-model-helpers.cert on 24-Sep-2022 06:22:17 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/simplify-model-helpers.cert (3.451s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/setbits-proofs.cert on 24-Sep-2022 06:22:20 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/setbits-proofs.cert (163.798s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lnot-proofs.cert on 24-Sep-2022 06:25:04 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lnot-proofs.cert (15.561s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/sumbits.cert on 24-Sep-2022 06:25:20 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/sumbits.cert (4.303s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/near-proofs.cert on 24-Sep-2022 06:25:24 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/near-proofs.cert (50.080s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/near+-proofs.cert on 24-Sep-2022 06:26:15 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/near+-proofs.cert (18.448s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/simplify-model-helpers.cert on 24-Sep-2022 06:26:33 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/simplify-model-helpers.cert (3.340s) Making /build/acl2-8.3dfsg/books/coi/defstructure/defstructure.cert on 24-Sep-2022 06:26:37 Built /build/acl2-8.3dfsg/books/coi/defstructure/defstructure.cert (34.848s) Making /build/acl2-8.3dfsg/books/coi/gensym/gensym-list.cert on 24-Sep-2022 06:27:12 Built /build/acl2-8.3dfsg/books/coi/gensym/gensym-list.cert (5.808s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logeqv.cert on 24-Sep-2022 06:27:18 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logeqv.cert (7.246s) Making /build/acl2-8.3dfsg/books/coi/paths/pm.cert on 24-Sep-2022 06:27:25 Built /build/acl2-8.3dfsg/books/coi/paths/pm.cert (185.397s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/setbits-proofs.cert on 24-Sep-2022 06:30:31 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/setbits-proofs.cert (158.678s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lnot-proofs.cert on 24-Sep-2022 06:33:10 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lnot-proofs.cert (15.715s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logeqv.cert on 24-Sep-2022 06:33:26 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logeqv.cert (7.436s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/near.cert on 24-Sep-2022 06:33:33 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/near.cert (5.694s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/near+.cert on 24-Sep-2022 06:33:39 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/near+.cert (5.553s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/setbits.cert on 24-Sep-2022 06:33:45 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/setbits.cert (4.228s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lnot.cert on 24-Sep-2022 06:33:49 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lnot.cert (4.052s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/near.cert on 24-Sep-2022 06:33:54 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/near.cert (4.920s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/near+.cert on 24-Sep-2022 06:33:59 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/near+.cert (4.761s) Making /build/acl2-8.3dfsg/books/coi/generalize/generalize.cert on 24-Sep-2022 06:34:04 Built /build/acl2-8.3dfsg/books/coi/generalize/generalize.cert (18.275s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logxor.cert on 24-Sep-2022 06:34:22 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/logxor.cert (7.248s) Making /build/acl2-8.3dfsg/books/coi/paths/hints.cert on 24-Sep-2022 06:34:30 Built /build/acl2-8.3dfsg/books/coi/paths/hints.cert (8.028s) Making /build/acl2-8.3dfsg/books/coi/quantification/quantification.cert on 24-Sep-2022 06:34:38 Built /build/acl2-8.3dfsg/books/coi/quantification/quantification.cert (25.840s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/setbits.cert on 24-Sep-2022 06:35:04 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/setbits.cert (4.319s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lnot.cert on 24-Sep-2022 06:35:08 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lnot.cert (4.209s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logxor.cert on 24-Sep-2022 06:35:13 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logxor.cert (7.590s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/oddr-proofs.cert on 24-Sep-2022 06:35:20 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/oddr-proofs.cert (13.798s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/sticky-proofs.cert on 24-Sep-2022 06:35:34 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/sticky-proofs.cert (11.895s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/setbitn-proofs.cert on 24-Sep-2022 06:35:46 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/setbitn-proofs.cert (6.888s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/log-proofs.cert on 24-Sep-2022 06:35:53 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/log-proofs.cert (24.046s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/oddr-proofs.cert on 24-Sep-2022 06:36:18 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/oddr-proofs.cert (13.169s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/sticky-proofs.cert on 24-Sep-2022 06:36:31 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/sticky-proofs.cert (11.395s) Making /build/acl2-8.3dfsg/books/workshops/2018/greve-gacek/sets.cert on 24-Sep-2022 06:36:43 Built /build/acl2-8.3dfsg/books/workshops/2018/greve-gacek/sets.cert (11.332s) Making /build/acl2-8.3dfsg/books/coi/defung/phony-induction.cert on 24-Sep-2022 06:36:54 Built /build/acl2-8.3dfsg/books/coi/defung/phony-induction.cert (5.088s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/from-rtl.cert on 24-Sep-2022 06:36:59 Built /build/acl2-8.3dfsg/books/coi/super-ihs/from-rtl.cert (5.208s) Making /build/acl2-8.3dfsg/books/coi/paths/cp-set.cert on 24-Sep-2022 06:37:05 Built /build/acl2-8.3dfsg/books/coi/paths/cp-set.cert (25.554s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/setbitn-proofs.cert on 24-Sep-2022 06:37:30 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/setbitn-proofs.cert (7.010s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/log-proofs.cert on 24-Sep-2022 06:37:38 Tick Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/log-proofs.cert (24.508s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/oddr.cert on 24-Sep-2022 06:38:02 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/oddr.cert (5.873s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/sticky.cert on 24-Sep-2022 06:38:08 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/sticky.cert (5.570s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/setbitn.cert on 24-Sep-2022 06:38:14 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/setbitn.cert (4.518s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/log.cert on 24-Sep-2022 06:38:19 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/log.cert (4.467s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/oddr.cert on 24-Sep-2022 06:38:23 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/oddr.cert (5.028s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/sticky.cert on 24-Sep-2022 06:38:28 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/sticky.cert (5.256s) Making /build/acl2-8.3dfsg/books/workshops/2018/greve-gacek/varid-type.cert on 24-Sep-2022 06:38:34 Built /build/acl2-8.3dfsg/books/workshops/2018/greve-gacek/varid-type.cert (10.546s) Making /build/acl2-8.3dfsg/books/coi/defung/defung.cert on 24-Sep-2022 06:38:45 Built /build/acl2-8.3dfsg/books/coi/defung/defung.cert (45.304s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/arithmetic.cert on 24-Sep-2022 06:39:30 Built /build/acl2-8.3dfsg/books/coi/super-ihs/arithmetic.cert (7.374s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/setbitn.cert on 24-Sep-2022 06:39:38 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/setbitn.cert (4.822s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/log.cert on 24-Sep-2022 06:39:43 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/log.cert (4.337s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/merge.cert on 24-Sep-2022 06:39:47 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/merge.cert (52.475s) Making /build/acl2-8.3dfsg/books/workshops/2018/greve-gacek/env-type.cert on 24-Sep-2022 06:40:40 Built /build/acl2-8.3dfsg/books/workshops/2018/greve-gacek/env-type.cert (20.847s) Making /build/acl2-8.3dfsg/books/coi/defung/ack-variants.cert on 24-Sep-2022 06:41:01 Built /build/acl2-8.3dfsg/books/coi/defung/ack-variants.cert (24.350s) Making /build/acl2-8.3dfsg/books/coi/defung/defung-stress.cert on 24-Sep-2022 06:41:25 Built /build/acl2-8.3dfsg/books/coi/defung/defung-stress.cert (464.627s) Making /build/acl2-8.3dfsg/books/coi/defung/defung-test.cert on 24-Sep-2022 06:49:10 Built /build/acl2-8.3dfsg/books/coi/defung/defung-test.cert (170.283s) Making /build/acl2-8.3dfsg/books/coi/defung/fractran.cert on 24-Sep-2022 06:52:01 Built /build/acl2-8.3dfsg/books/coi/defung/fractran.cert (10.155s) Making /build/acl2-8.3dfsg/books/coi/defung/monadic.cert on 24-Sep-2022 06:52:11 Built /build/acl2-8.3dfsg/books/coi/defung/monadic.cert (12.939s) Making /build/acl2-8.3dfsg/books/coi/defung/rev3.cert on 24-Sep-2022 06:52:24 Built /build/acl2-8.3dfsg/books/coi/defung/rev3.cert (14.229s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/inductions.cert on 24-Sep-2022 06:52:38 Built /build/acl2-8.3dfsg/books/coi/super-ihs/inductions.cert (10.680s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/evenp.cert on 24-Sep-2022 06:52:49 Built /build/acl2-8.3dfsg/books/coi/super-ihs/evenp.cert (4.835s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/bit-functions.cert on 24-Sep-2022 06:52:54 Built /build/acl2-8.3dfsg/books/coi/super-ihs/bit-functions.cert (4.827s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/unsigned-byte-p.cert on 24-Sep-2022 06:52:59 Built /build/acl2-8.3dfsg/books/coi/super-ihs/unsigned-byte-p.cert (6.612s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/logcar.cert on 24-Sep-2022 06:53:06 Built /build/acl2-8.3dfsg/books/coi/super-ihs/logcar.cert (5.099s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/logcons.cert on 24-Sep-2022 06:53:11 Built /build/acl2-8.3dfsg/books/coi/super-ihs/logcons.cert (4.689s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/logbitp.cert on 24-Sep-2022 06:53:16 Built /build/acl2-8.3dfsg/books/coi/super-ihs/logbitp.cert (4.502s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/logapp.cert on 24-Sep-2022 06:53:21 Built /build/acl2-8.3dfsg/books/coi/super-ihs/logapp.cert (5.598s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/logbit.cert on 24-Sep-2022 06:53:26 Built /build/acl2-8.3dfsg/books/coi/super-ihs/logbit.cert (4.744s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/iter-sqrt.cert on 24-Sep-2022 06:53:31 Built /build/acl2-8.3dfsg/books/coi/super-ihs/iter-sqrt.cert (18.938s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/merge.cert on 24-Sep-2022 06:53:50 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/merge.cert (47.490s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/mulcat-proofs.cert on 24-Sep-2022 06:54:38 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/mulcat-proofs.cert (7.671s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/land0-proofs.cert on 24-Sep-2022 06:54:46 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/land0-proofs.cert (18.524s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lior0-proofs.cert on 24-Sep-2022 06:55:05 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lior0-proofs.cert (15.898s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lxor0-proofs.cert on 24-Sep-2022 06:55:21 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lxor0-proofs.cert (13.594s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/ireps.cert on 24-Sep-2022 06:55:34 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/ireps.cert (30.379s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lop1-proofs.cert on 24-Sep-2022 06:56:05 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lop1-proofs.cert (12.649s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/simple-loop-helpers.cert on 24-Sep-2022 06:56:18 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/simple-loop-helpers.cert (6.749s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/badguys.cert on 24-Sep-2022 06:56:25 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/badguys.cert (3.666s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/ash.cert on 24-Sep-2022 06:56:28 Built /build/acl2-8.3dfsg/books/coi/super-ihs/ash.cert (6.044s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/mulcat-proofs.cert on 24-Sep-2022 06:56:35 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/mulcat-proofs.cert (7.739s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/land0-proofs.cert on 24-Sep-2022 06:56:43 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/land0-proofs.cert (18.459s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lior0-proofs.cert on 24-Sep-2022 06:57:01 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lior0-proofs.cert (15.090s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lxor0-proofs.cert on 24-Sep-2022 06:57:16 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lxor0-proofs.cert (13.539s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/ireps.cert on 24-Sep-2022 06:57:30 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/ireps.cert (31.873s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/badguys.cert on 24-Sep-2022 06:58:02 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/badguys.cert (3.859s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/mulcat.cert on 24-Sep-2022 06:58:06 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/mulcat.cert (4.508s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/land0.cert on 24-Sep-2022 06:58:11 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/land0.cert (4.256s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lior0.cert on 24-Sep-2022 06:58:15 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lior0.cert (4.014s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lxor0.cert on 24-Sep-2022 06:58:19 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lxor0.cert (4.353s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/ereps-proofs.cert on 24-Sep-2022 06:58:24 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/ereps-proofs.cert (30.916s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bits-trunc-proofs.cert on 24-Sep-2022 06:58:55 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bits-trunc-proofs.cert (7.799s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/add3-proofs.cert on 24-Sep-2022 06:59:03 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/add3-proofs.cert (28.524s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lop1.cert on 24-Sep-2022 06:59:31 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lop1.cert (4.843s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/stick-proofs.cert on 24-Sep-2022 06:59:36 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/stick-proofs.cert (66.735s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/logcdr.cert on 24-Sep-2022 07:00:43 Built /build/acl2-8.3dfsg/books/coi/super-ihs/logcdr.cert (5.930s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/logtail.cert on 24-Sep-2022 07:00:49 Built /build/acl2-8.3dfsg/books/coi/super-ihs/logtail.cert (10.543s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/mulcat.cert on 24-Sep-2022 07:01:00 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/mulcat.cert (5.035s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/land0.cert on 24-Sep-2022 07:01:05 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/land0.cert (4.789s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lior0.cert on 24-Sep-2022 07:01:10 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lior0.cert (4.590s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lxor0.cert on 24-Sep-2022 07:01:15 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lxor0.cert (4.793s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/ereps-proofs.cert on 24-Sep-2022 07:01:20 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/ereps-proofs.cert (30.550s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bits-trunc-proofs.cert on 24-Sep-2022 07:01:51 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bits-trunc-proofs.cert (7.867s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bvecp-lemmas.cert on 24-Sep-2022 07:01:59 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bvecp-lemmas.cert (5.510s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/merge2.cert on 24-Sep-2022 07:02:04 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/merge2.cert (5.893s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/ereps.cert on 24-Sep-2022 07:02:10 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/ereps.cert (4.627s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lextra-proofs.cert on 24-Sep-2022 07:02:15 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lextra-proofs.cert (14.155s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bits-trunc.cert on 24-Sep-2022 07:02:29 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bits-trunc.cert (3.598s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/add3.cert on 24-Sep-2022 07:02:33 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/add3.cert (4.099s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lop2-proofs.cert on 24-Sep-2022 07:02:37 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lop2-proofs.cert (12.715s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/stick.cert on 24-Sep-2022 07:02:50 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/stick.cert (4.233s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bvecp-helpers.cert on 24-Sep-2022 07:02:55 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/bvecp-helpers.cert (4.327s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/loghead.cert on 24-Sep-2022 07:02:59 Built /build/acl2-8.3dfsg/books/coi/super-ihs/loghead.cert (14.426s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bvecp-lemmas.cert on 24-Sep-2022 07:03:14 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bvecp-lemmas.cert (5.999s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/merge2.cert on 24-Sep-2022 07:03:20 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/merge2.cert (5.794s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/ereps.cert on 24-Sep-2022 07:03:26 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/ereps.cert (4.748s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lextra-proofs.cert on 24-Sep-2022 07:03:31 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lextra-proofs.cert (14.433s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bits-trunc.cert on 24-Sep-2022 07:03:45 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bits-trunc.cert (3.777s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bvecp-helpers.cert on 24-Sep-2022 07:03:49 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/bvecp-helpers.cert (4.456s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lextra0.cert on 24-Sep-2022 07:03:54 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lextra0.cert (2.790s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/rnd.cert on 24-Sep-2022 07:03:57 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/rnd.cert (20.304s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lop2.cert on 24-Sep-2022 07:04:17 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lop2.cert (3.696s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/logext.cert on 24-Sep-2022 07:04:21 Built /build/acl2-8.3dfsg/books/coi/super-ihs/logext.cert (7.032s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/meta.cert on 24-Sep-2022 07:04:28 Built /build/acl2-8.3dfsg/books/coi/super-ihs/meta.cert (8.815s) Making /build/acl2-8.3dfsg/books/coi/gacc/mem.cert on 24-Sep-2022 07:04:37 Built /build/acl2-8.3dfsg/books/coi/gacc/mem.cert (18.157s) Making /build/acl2-8.3dfsg/books/coi/gacc/mem-fast.cert on 24-Sep-2022 07:04:56 Built /build/acl2-8.3dfsg/books/coi/gacc/mem-fast.cert (18.820s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lextra0.cert on 24-Sep-2022 07:05:15 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lextra0.cert (3.090s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/rnd.cert on 24-Sep-2022 07:05:18 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/rnd.cert (21.218s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/drnd-original.cert on 24-Sep-2022 07:05:39 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/drnd-original.cert (102.925s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lop3-proofs.cert on 24-Sep-2022 07:07:22 Tick Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lop3-proofs.cert (52.050s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/basics.cert on 24-Sep-2022 07:08:15 Built /build/acl2-8.3dfsg/books/coi/super-ihs/basics.cert (5.413s) Making /build/acl2-8.3dfsg/books/coi/gacc/fr-path-connection.cert on 24-Sep-2022 07:08:20 Built /build/acl2-8.3dfsg/books/coi/gacc/fr-path-connection.cert (64.284s) Making /build/acl2-8.3dfsg/books/coi/gacc/tr-path-connection.cert on 24-Sep-2022 07:09:25 Built /build/acl2-8.3dfsg/books/coi/gacc/tr-path-connection.cert (86.816s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/drnd-original.cert on 24-Sep-2022 07:10:52 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/drnd-original.cert (102.361s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lop3.cert on 24-Sep-2022 07:12:34 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lop3.cert (7.383s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/logpair.cert on 24-Sep-2022 07:12:42 Built /build/acl2-8.3dfsg/books/coi/super-ihs/logpair.cert (7.306s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/top1.cert on 24-Sep-2022 07:12:49 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/top1.cert (6.797s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/fadd.cert on 24-Sep-2022 07:12:56 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/fadd.cert (78.777s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/byte-p.cert on 24-Sep-2022 07:14:15 Built /build/acl2-8.3dfsg/books/coi/super-ihs/byte-p.cert (16.890s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/land.cert on 24-Sep-2022 07:14:32 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/land.cert (11.461s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lior.cert on 24-Sep-2022 07:14:44 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lior.cert (61.858s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lxor.cert on 24-Sep-2022 07:15:46 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lxor.cert (11.656s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/float-extra.cert on 24-Sep-2022 07:15:58 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/float-extra.cert (12.684s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/round-extra.cert on 24-Sep-2022 07:16:10 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/round-extra.cert (8.694s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/guards.cert on 24-Sep-2022 07:16:19 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/guards.cert (7.900s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/top1.cert on 24-Sep-2022 07:16:27 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/top1.cert (7.149s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/loglist.cert on 24-Sep-2022 07:16:35 Built /build/acl2-8.3dfsg/books/coi/super-ihs/loglist.cert (63.096s) Making /build/acl2-8.3dfsg/books/coi/gacc/ram0.cert on 24-Sep-2022 07:17:38 Built /build/acl2-8.3dfsg/books/coi/gacc/ram0.cert (9.318s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lextra.cert on 24-Sep-2022 07:17:47 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/lextra.cert (13.625s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/land.cert on 24-Sep-2022 07:18:01 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/land.cert (11.841s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lior.cert on 24-Sep-2022 07:18:13 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lior.cert (63.568s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lxor.cert on 24-Sep-2022 07:19:17 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lxor.cert (12.063s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/fadd-extra0.cert on 24-Sep-2022 07:19:29 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/fadd-extra0.cert (14.777s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/float-extra.cert on 24-Sep-2022 07:19:44 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/float-extra.cert (12.777s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/round-extra.cert on 24-Sep-2022 07:19:57 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/round-extra.cert (8.825s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/guards.cert on 24-Sep-2022 07:20:06 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/guards.cert (7.722s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/mult-proofs.cert on 24-Sep-2022 07:20:14 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/mult-proofs.cert (43.643s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/logical-logops.cert on 24-Sep-2022 07:20:58 Built /build/acl2-8.3dfsg/books/coi/super-ihs/logical-logops.cert (36.659s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/top.cert on 24-Sep-2022 07:21:35 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/top.cert (6.881s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lextra.cert on 24-Sep-2022 07:21:42 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/lextra.cert (53.705s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/fadd-extra.cert on 24-Sep-2022 07:22:35 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/fadd-extra.cert (14.796s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/bit-twiddling-logops.cert on 24-Sep-2022 07:22:50 Built /build/acl2-8.3dfsg/books/coi/super-ihs/bit-twiddling-logops.cert (126.674s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/rtl.cert on 24-Sep-2022 07:24:57 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/rtl.cert (14.746s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/basic.cert on 24-Sep-2022 07:25:12 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/basic.cert (7.445s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/support/top.cert on 24-Sep-2022 07:25:20 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/support/top.cert (7.173s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/hacks.cert on 24-Sep-2022 07:25:27 Built /build/acl2-8.3dfsg/books/coi/super-ihs/hacks.cert (7.567s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1.delta1/basic-extra.cert on 24-Sep-2022 07:25:35 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1.delta1/basic-extra.cert (4.743s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/bits.cert on 24-Sep-2022 07:25:40 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/bits.cert (10.194s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/bvecp-raw-helpers.cert on 24-Sep-2022 07:25:50 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/bvecp-raw-helpers.cert (6.337s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/bvecp-helpers.cert on 24-Sep-2022 07:25:57 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/bvecp-helpers.cert (3.824s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/simplify-model-helpers.cert on 24-Sep-2022 07:26:01 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/simplify-model-helpers.cert (3.699s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/rtl.cert on 24-Sep-2022 07:26:05 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/rtl.cert (15.211s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/basic.cert on 24-Sep-2022 07:26:20 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/basic.cert (7.560s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/c-functions.cert on 24-Sep-2022 07:26:28 Built /build/acl2-8.3dfsg/books/coi/super-ihs/c-functions.cert (6.741s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/lshu.cert on 24-Sep-2022 07:26:35 Built /build/acl2-8.3dfsg/books/coi/super-ihs/lshu.cert (6.006s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1.delta1/basic.cert on 24-Sep-2022 07:26:41 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1.delta1/basic.cert (3.130s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/log.cert on 24-Sep-2022 07:26:44 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/log.cert (9.421s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1.delta1/bvecp-raw-helpers-extra.cert on 24-Sep-2022 07:26:54 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1.delta1/bvecp-raw-helpers-extra.cert (9.324s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/rtlarr.cert on 24-Sep-2022 07:27:03 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/rtlarr.cert (5.520s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/basic-extra.cert on 24-Sep-2022 07:27:09 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/basic-extra.cert (4.209s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/bits.cert on 24-Sep-2022 07:27:13 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/bits.cert (10.302s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/bvecp-raw-helpers.cert on 24-Sep-2022 07:27:24 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/bvecp-raw-helpers.cert (5.420s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/bvecp-helpers.cert on 24-Sep-2022 07:27:29 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/bvecp-helpers.cert (3.737s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/simplify-model-helpers.cert on 24-Sep-2022 07:27:33 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/simplify-model-helpers.cert (3.336s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/super-ihs.cert on 24-Sep-2022 07:27:37 Built /build/acl2-8.3dfsg/books/coi/super-ihs/super-ihs.cert (69.477s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/float.cert on 24-Sep-2022 07:28:46 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/float.cert (9.194s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1.delta1/bvecp-raw-helpers.cert on 24-Sep-2022 07:28:56 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1.delta1/bvecp-raw-helpers.cert (5.288s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/basic.cert on 24-Sep-2022 07:29:01 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/basic.cert (3.425s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/log.cert on 24-Sep-2022 07:29:05 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/log.cert (9.766s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/bvecp-raw-helpers-extra.cert on 24-Sep-2022 07:29:15 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/bvecp-raw-helpers-extra.cert (9.324s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/simple-loop-helpers-extra.cert on 24-Sep-2022 07:29:24 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/simple-loop-helpers-extra.cert (3.103s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/ihs-defthms-help.cert on 24-Sep-2022 07:29:27 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/ihs-defthms-help.cert (8.435s) Making /build/acl2-8.3dfsg/books/coi/gacc/bits.cert on 24-Sep-2022 07:29:36 Built /build/acl2-8.3dfsg/books/coi/gacc/bits.cert (7.192s) Making /build/acl2-8.3dfsg/books/coi/gacc/list-ops-common.cert on 24-Sep-2022 07:29:43 Built /build/acl2-8.3dfsg/books/coi/gacc/list-ops-common.cert (37.044s) Making /build/acl2-8.3dfsg/books/coi/gacc/wrap.cert on 24-Sep-2022 07:30:20 Built /build/acl2-8.3dfsg/books/coi/gacc/wrap.cert (126.077s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/fast.cert on 24-Sep-2022 07:32:27 Built /build/acl2-8.3dfsg/books/coi/super-ihs/fast.cert (6.944s) Making /build/acl2-8.3dfsg/books/coi/super-ihs/carry.cert on 24-Sep-2022 07:32:34 Built /build/acl2-8.3dfsg/books/coi/super-ihs/carry.cert (9.972s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/reps.cert on 24-Sep-2022 07:32:44 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/reps.cert (8.687s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/float.cert on 24-Sep-2022 07:32:53 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/float.cert (8.765s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/bvecp-raw-helpers.cert on 24-Sep-2022 07:33:02 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/bvecp-raw-helpers.cert (4.595s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/simple-loop-helpers.cert on 24-Sep-2022 07:33:07 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/simple-loop-helpers.cert (5.906s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/make-theorems.cert on 24-Sep-2022 07:33:13 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/make-theorems.cert (13.873s) Making /build/acl2-8.3dfsg/books/coi/gacc/list-ops.cert on 24-Sep-2022 07:33:27 Built /build/acl2-8.3dfsg/books/coi/gacc/list-ops.cert (13.962s) Making /build/acl2-8.3dfsg/books/coi/gacc/list-ops-fast.cert on 24-Sep-2022 07:33:41 Built /build/acl2-8.3dfsg/books/coi/gacc/list-ops-fast.cert (16.805s) Making /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/round.cert on 24-Sep-2022 07:33:58 Built /build/acl2-8.3dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/round.cert (12.602s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/reps.cert on 24-Sep-2022 07:34:11 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1/reps.cert (8.371s) Making /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/simple-loop-helpers.cert on 24-Sep-2022 07:34:20 Built /build/acl2-8.3dfsg/books/rtl/rel9/support/lib1.delta1/simple-loop-helpers.cert (5.584s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/AES/proof-AES.cert on 24-Sep-2022 07:34:25 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/AES/proof-AES.cert (72.985s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/Fibonacci/proof-fibs.cert on 24-Sep-2022 07:35:38 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/Fibonacci/proof-fibs.cert (10.332s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/RC6/proof-RC6.cert on 24-Sep-2022 07:35:49 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/RC6/proof-RC6.cert (54.130s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/TEA/proof-TEA.cert on 24-Sep-2022 07:36:43 Tick Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/TEA/proof-TEA.cert (125.036s) Making /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/factorial/proof-fac.cert on 24-Sep-2022 07:38:48 Built /build/acl2-8.3dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/factorial/proof-fac.cert (13.021s) Making /build/acl2-8.3dfsg/books/coi/gacc/ram.cert on 24-Sep-2022 07:39:02 Sat Sep 24 19:39:11 UTC 2022 - pbuilder was killed by timeout after 18h.