Mon Aug 25 19:15:16 UTC 2025 I: starting to build hol88/unstable/amd64 on jenkins on '2025-08-25 19:14' Mon Aug 25 19:15:16 UTC 2025 I: The jenkins build log is/was available at https://jenkins.debian.net/userContent/reproducible/debian/build_service/amd64_3/66243/console.log Mon Aug 25 19:15:16 UTC 2025 I: Downloading source for unstable/hol88=2.02.19940316dfsg-8 --2025-08-25 19:15:16-- http://deb.debian.org/debian/pool/main/h/hol88/hol88_2.02.19940316dfsg-8.dsc Connecting to 46.16.76.132:3128... connected. Proxy request sent, awaiting response... 200 OK Length: 2265 (2.2K) [text/prs.lines.tag] Saving to: ‘hol88_2.02.19940316dfsg-8.dsc’ 0K .. 100% 272M=0s 2025-08-25 19:15:16 (272 MB/s) - ‘hol88_2.02.19940316dfsg-8.dsc’ saved [2265/2265] Mon Aug 25 19:15:17 UTC 2025 I: hol88_2.02.19940316dfsg-8.dsc -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA256 Format: 3.0 (quilt) Source: hol88 Binary: hol88, hol88-source, hol88-help, hol88-library, hol88-library-source, hol88-library-help, hol88-contrib-source, hol88-contrib-help, hol88-doc Architecture: any all Version: 2.02.19940316dfsg-8 Maintainer: Camm Maguire Standards-Version: 4.7.2 Build-Depends: debhelper-compat (= 13), gcl27 (>= 2.7.1-6), texlive-latex-base Package-List: hol88 deb math optional arch=any hol88-contrib-help deb math optional arch=all hol88-contrib-source deb math optional arch=all hol88-doc deb doc optional arch=all hol88-help deb math optional arch=all hol88-library deb math optional arch=any hol88-library-help deb math optional arch=all hol88-library-source deb math optional arch=all hol88-source deb math optional arch=all Checksums-Sha1: bc74d2d9ec9af6fe04c6b6853b0a9850897c4b7f 10359437 hol88_2.02.19940316dfsg.orig.tar.gz d8cc599ac8531d77eed2f1d0cfcac26532c9e94a 132052 hol88_2.02.19940316dfsg-8.debian.tar.xz Checksums-Sha256: 8e2a4f83cea20d0cf2416f7d55c951498f6c807b03ebc9381a02fa4c81c5da69 10359437 hol88_2.02.19940316dfsg.orig.tar.gz b37fdbfd5f95042ac1bb62fdfb49120c0eecbe59e90a99fb25fa24b241f6c49d 132052 hol88_2.02.19940316dfsg-8.debian.tar.xz Files: d916adf41bc7c1f9eb2a7c07ff442b01 10359437 hol88_2.02.19940316dfsg.orig.tar.gz 40592157fb32be7292e8ac1541f30d45 132052 hol88_2.02.19940316dfsg-8.debian.tar.xz -----BEGIN PGP SIGNATURE----- iQIzBAEBCAAdFiEE/iFPNjaXdzJC6BbsuEXOUQ+bcU0FAmgkojkACgkQuEXOUQ+b cU3Ipw/8DgK0XKBSabqNYoM5/5xDWZLQw8qLYlmpA75tC/OZxvd0dzaflI1nWUqf yo9Ad01bK24UBMU85kEc0pFFnV++CWgBy7Zusj619IMOTluavkRxZD0q3gwgaSkR 2D9Rdlh26dxuAGNhW5hyPCD/D67/4X8dCdttzvnFowt3igBMyvqtaws1msPjz5zz FfzNv8DSUQfsey3V9UYN1tS2zwWVMxfxKDHCa1mZvdQlSmLXtF098gde1B4NdkBW IHlPBMnzRv5WkpHJAKSbeXfrrVoy1TdhJ127AhxW2b4VIG1VpCsOmmeg40PMvb3P mFAViEnGc94cEPKC66cL2eeYnKm7x61W6P2X1rbjXur5uKoayPAS+1LhrGLZYmcL sTllHrJYXoubesT8oGP9iWOalE078rGAJNxNgv8DlAmNzchejJylOfnfieT2Otw2 zKxXU5fnjTX3HmWSFmR3voriHLu4aAZgWZ4MsHulNXeROz/GF9ynLApJWh6oDnqA FN8yB0Kwmtc/chprNqKJi2V1FQ+Sy5rVpUXlNG3eZpwiIV5BLeidA0meZB3tk6Kr 6tCvuiYGSDAaoyOldVRvxjywc4jvMqQYnwcFpkXpp9KDfm/I1gMhHInGX27mrHiV Dmgw1Nfyf9d5RnKyjp6Wl+iW3MLW+oi/AcJ7Kq2Hoi6HINcKLco= =onwA -----END PGP SIGNATURE----- Mon Aug 25 19:15:17 UTC 2025 I: Checking whether the package is not for us Mon Aug 25 19:15:17 UTC 2025 I: Starting 1st build on remote node ionos1-amd64.debian.net. Mon Aug 25 19:15:17 UTC 2025 I: Preparing to do remote build '1' on ionos1-amd64.debian.net. Mon Aug 25 22:29:55 UTC 2025 I: Deleting $TMPDIR on ionos1-amd64.debian.net. I: pbuilder: network access will be disabled during build I: Current time: Mon Aug 25 07:15:19 -12 2025 I: pbuilder-time-stamp: 1756149319 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/unstable-reproducible-base.tgz] I: copying local configuration W: --override-config is not set; not updating apt.conf Read the manpage for details. I: mounting /proc filesystem I: mounting /sys filesystem I: creating /{dev,run}/shm I: mounting /dev/pts filesystem I: redirecting /dev/ptmx to /dev/pts/ptmx I: policy-rc.d already exists I: Copying source file I: copying [hol88_2.02.19940316dfsg-8.dsc] I: copying [./hol88_2.02.19940316dfsg.orig.tar.gz] I: copying [./hol88_2.02.19940316dfsg-8.debian.tar.xz] I: Extracting source dpkg-source: warning: cannot verify inline signature for ./hol88_2.02.19940316dfsg-8.dsc: no acceptable signature found dpkg-source: info: extracting hol88 in hol88-2.02.19940316dfsg dpkg-source: info: unpacking hol88_2.02.19940316dfsg.orig.tar.gz dpkg-source: info: unpacking hol88_2.02.19940316dfsg-8.debian.tar.xz dpkg-source: info: using patch list from debian/patches/series dpkg-source: info: applying quilt-source-init dpkg-source: info: applying FTBFS_detection_fix dpkg-source: info: applying function_representation I: using fakeroot in build. I: Installing the build-deps I: user script /srv/workspace/pbuilder/1425500/tmp/hooks/D02_print_environment starting I: set BUILDDIR='/build/reproducible-path' BUILDUSERGECOS='first user,first room,first work-phone,first home-phone,first other' BUILDUSERNAME='pbuilder1' BUILD_ARCH='amd64' DEBIAN_FRONTEND='noninteractive' DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=40 ' DISTRIBUTION='unstable' HOME='/root' HOST_ARCH='amd64' IFS=' ' INVOCATION_ID='d125c85c6639462c9872654123f31a57' 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='1425500' PS1='# ' PS2='> ' PS4='+ ' PWD='/' SHELL='/bin/bash' SHLVL='2' SUDO_COMMAND='/usr/bin/timeout -k 18.1h 18h /usr/bin/ionice -c 3 /usr/bin/nice /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.lE5UHU2p/pbuilderrc_pP5O --distribution unstable --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/unstable-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.lE5UHU2p/b1 --logfile b1/build.log hol88_2.02.19940316dfsg-8.dsc' SUDO_GID='110' SUDO_HOME='/var/lib/jenkins' SUDO_UID='105' SUDO_USER='jenkins' TERM='unknown' TZ='/usr/share/zoneinfo/Etc/GMT+12' USER='root' _='/usr/bin/systemd-run' http_proxy='http://46.16.76.132:3128' I: uname -a Linux ionos1-amd64 6.12.41+deb13-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.12.41-1 (2025-08-12) x86_64 GNU/Linux I: ls -l /bin lrwxrwxrwx 1 root root 7 Aug 10 12:30 /bin -> usr/bin I: user script /srv/workspace/pbuilder/1425500/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy Version: 0.invalid.0 Architecture: amd64 Maintainer: Debian Pbuilder Team Description: Dummy package to satisfy dependencies with aptitude - created by pbuilder This package was created automatically by pbuilder to satisfy the build-dependencies of the package being currently built. Depends: debhelper-compat (= 13), gcl27 (>= 2.7.1-6), texlive-latex-base dpkg-deb: building package 'pbuilder-satisfydepends-dummy' in '/tmp/satisfydepends-aptitude/pbuilder-satisfydepends-dummy.deb'. Selecting previously unselected package pbuilder-satisfydepends-dummy. (Reading database ... 19855 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 gcl27 (>= 2.7.1-6); however: Package gcl27 is not installed. pbuilder-satisfydepends-dummy depends on texlive-latex-base; however: Package texlive-latex-base 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} file{a} fontconfig-config{a} fonts-dejavu-core{a} fonts-dejavu-mono{a} fonts-lmodern{a} gcl27{a} gettext{a} gettext-base{a} groff-base{a} intltool-debian{a} libarchive-zip-perl{a} libbrotli1{a} libcairo2{a} libcom-err2{a} libdebhelper-perl{a} libedit2{a} libelf1t64{a} libexpat1{a} libffi8{a} libfile-stripnondeterminism-perl{a} libfontconfig1{a} libfreetype6{a} libglib2.0-0t64{a} libgraphite2-3{a} libgssapi-krb5-2{a} libharfbuzz0b{a} libice6{a} libicu76{a} libk5crypto3{a} libkeyutils1{a} libkpathsea6{a} libkrb5-3{a} libkrb5support0{a} libmagic-mgc{a} libmagic1t64{a} libmpfi0{a} libpaper-utils{a} libpaper2{a} libpipeline1{a} libpixman-1-0{a} libpng16-16t64{a} libpotrace0{a} libproc2-0{a} libptexenc1{a} libsm6{a} libsynctex2{a} libteckit0{a} libtexlua53-5{a} libtext-charwidth-perl{a} libtext-wrapi18n-perl{a} libtirpc-common{a} libtirpc-dev{a} libtirpc3t64{a} libtool{a} libuchardet0{a} libunistring5{a} libx11-6{a} libx11-data{a} libxau6{a} libxaw7{a} libxcb-render0{a} libxcb-shm0{a} libxcb1{a} libxdmcp6{a} libxext6{a} libxi6{a} libxml2-16{a} libxmu6{a} libxpm4{a} libxrender1{a} libxt6t64{a} libzzip-0-13t64{a} m4{a} man-db{a} po-debconf{a} procps{a} sensible-utils{a} t1utils{a} tex-common{a} texlive-base{a} texlive-binaries{a} texlive-latex-base{a} ucf{a} x11-common{a} xdg-utils{a} The following packages are RECOMMENDED but will NOT be installed: curl dvisvgm krb5-locales libarchive-cpio-perl libfile-mimeinfo-perl libglib2.0-data libltdl-dev libmail-sendmail-perl libnet-dbus-perl libx11-protocol-perl linux-sysctl-defaults lmodern lynx psmisc shared-mime-info wget x11-utils x11-xserver-utils xdg-user-dirs 0 packages upgraded, 94 newly installed, 0 to remove and 0 not upgraded. Need to get 135 MB of archives. After unpacking 861 MB will be used. Writing extended state information... Get: 1 http://deb.debian.org/debian unstable/main amd64 libexpat1 amd64 2.7.1-2 [108 kB] Get: 2 http://deb.debian.org/debian unstable/main amd64 libproc2-0 amd64 2:4.0.4-9 [65.6 kB] Get: 3 http://deb.debian.org/debian unstable/main amd64 procps amd64 2:4.0.4-9 [882 kB] Get: 4 http://deb.debian.org/debian unstable/main amd64 sensible-utils all 0.0.26 [27.0 kB] Get: 5 http://deb.debian.org/debian unstable/main amd64 libmagic-mgc amd64 1:5.46-5 [338 kB] Get: 6 http://deb.debian.org/debian unstable/main amd64 libmagic1t64 amd64 1:5.46-5 [109 kB] Get: 7 http://deb.debian.org/debian unstable/main amd64 file amd64 1:5.46-5 [43.6 kB] Get: 8 http://deb.debian.org/debian unstable/main amd64 gettext-base amd64 0.23.1-2+b1 [244 kB] Get: 9 http://deb.debian.org/debian unstable/main amd64 libuchardet0 amd64 0.0.8-1+b2 [68.9 kB] Get: 10 http://deb.debian.org/debian unstable/main amd64 groff-base amd64 1.23.0-9 [1187 kB] Get: 11 http://deb.debian.org/debian unstable/main amd64 bsdextrautils amd64 2.41.1-1 [94.7 kB] Get: 12 http://deb.debian.org/debian unstable/main amd64 libpipeline1 amd64 1.5.8-1 [42.0 kB] Get: 13 http://deb.debian.org/debian unstable/main amd64 man-db amd64 2.13.1-1 [1469 kB] Get: 14 http://deb.debian.org/debian unstable/main amd64 libtext-charwidth-perl amd64 0.04-11+b4 [9476 B] Get: 15 http://deb.debian.org/debian unstable/main amd64 libtext-wrapi18n-perl all 0.06-10 [8808 B] Get: 16 http://deb.debian.org/debian unstable/main amd64 ucf all 3.0052 [43.3 kB] Get: 17 http://deb.debian.org/debian unstable/main amd64 m4 amd64 1.4.19-8 [294 kB] Get: 18 http://deb.debian.org/debian unstable/main amd64 autoconf all 2.72-3.1 [494 kB] Get: 19 http://deb.debian.org/debian unstable/main amd64 autotools-dev all 20240727.1 [60.2 kB] Get: 20 http://deb.debian.org/debian unstable/main amd64 automake all 1:1.17-4 [862 kB] Get: 21 http://deb.debian.org/debian unstable/main amd64 autopoint all 0.23.1-2 [770 kB] Get: 22 http://deb.debian.org/debian unstable/main amd64 libdebhelper-perl all 13.26 [91.8 kB] Get: 23 http://deb.debian.org/debian unstable/main amd64 libtool all 2.5.4-4 [539 kB] Get: 24 http://deb.debian.org/debian unstable/main amd64 dh-autoreconf all 20 [17.1 kB] Get: 25 http://deb.debian.org/debian unstable/main amd64 libarchive-zip-perl all 1.68-1 [104 kB] Get: 26 http://deb.debian.org/debian unstable/main amd64 libfile-stripnondeterminism-perl all 1.14.2-1 [19.8 kB] Get: 27 http://deb.debian.org/debian unstable/main amd64 dh-strip-nondeterminism all 1.14.2-1 [8768 B] Get: 28 http://deb.debian.org/debian unstable/main amd64 libelf1t64 amd64 0.192-4 [189 kB] Get: 29 http://deb.debian.org/debian unstable/main amd64 dwz amd64 0.15-1+b1 [110 kB] Get: 30 http://deb.debian.org/debian unstable/main amd64 libunistring5 amd64 1.3-2 [477 kB] Get: 31 http://deb.debian.org/debian unstable/main amd64 libxml2-16 amd64 2.14.5+dfsg-0.1 [640 kB] Get: 32 http://deb.debian.org/debian unstable/main amd64 gettext amd64 0.23.1-2+b1 [1680 kB] Get: 33 http://deb.debian.org/debian unstable/main amd64 intltool-debian all 0.35.0+20060710.6 [22.9 kB] Get: 34 http://deb.debian.org/debian unstable/main amd64 po-debconf all 1.0.21+nmu1 [248 kB] Get: 35 http://deb.debian.org/debian unstable/main amd64 debhelper all 13.26 [939 kB] Get: 36 http://deb.debian.org/debian unstable/main amd64 fonts-dejavu-mono all 2.37-8 [489 kB] Get: 37 http://deb.debian.org/debian unstable/main amd64 fonts-dejavu-core all 2.37-8 [840 kB] Get: 38 http://deb.debian.org/debian unstable/main amd64 fontconfig-config amd64 2.15.0-2.3 [318 kB] Get: 39 http://deb.debian.org/debian unstable/main amd64 fonts-lmodern all 2.005-1 [4540 kB] Get: 40 http://deb.debian.org/debian unstable/main amd64 libedit2 amd64 3.1-20250104-1 [93.8 kB] Get: 41 http://deb.debian.org/debian unstable/main amd64 libkrb5support0 amd64 1.21.3-5 [33.0 kB] Get: 42 http://deb.debian.org/debian unstable/main amd64 libcom-err2 amd64 1.47.2-3+b3 [25.0 kB] Get: 43 http://deb.debian.org/debian unstable/main amd64 libk5crypto3 amd64 1.21.3-5 [81.5 kB] Get: 44 http://deb.debian.org/debian unstable/main amd64 libkeyutils1 amd64 1.6.3-6 [9456 B] Get: 45 http://deb.debian.org/debian unstable/main amd64 libkrb5-3 amd64 1.21.3-5 [326 kB] Get: 46 http://deb.debian.org/debian unstable/main amd64 libgssapi-krb5-2 amd64 1.21.3-5 [138 kB] Get: 47 http://deb.debian.org/debian unstable/main amd64 libtirpc-common all 1.3.6+ds-1 [11.0 kB] Get: 48 http://deb.debian.org/debian unstable/main amd64 libtirpc3t64 amd64 1.3.6+ds-1 [83.3 kB] Get: 49 http://deb.debian.org/debian unstable/main amd64 libxau6 amd64 1:1.0.11-1 [20.4 kB] Get: 50 http://deb.debian.org/debian unstable/main amd64 libxdmcp6 amd64 1:1.1.5-1 [27.8 kB] Get: 51 http://deb.debian.org/debian unstable/main amd64 libxcb1 amd64 1.17.0-2+b1 [144 kB] Get: 52 http://deb.debian.org/debian unstable/main amd64 libx11-data all 2:1.8.12-1 [343 kB] Get: 53 http://deb.debian.org/debian unstable/main amd64 libx11-6 amd64 2:1.8.12-1 [815 kB] Get: 54 http://deb.debian.org/debian unstable/main amd64 libtirpc-dev amd64 1.3.6+ds-1 [191 kB] Get: 55 http://deb.debian.org/debian unstable/main amd64 gcl27 amd64 2.7.1-7 [65.8 MB] Get: 56 http://deb.debian.org/debian unstable/main amd64 libbrotli1 amd64 1.1.0-2+b7 [307 kB] Get: 57 http://deb.debian.org/debian unstable/main amd64 libpng16-16t64 amd64 1.6.50-1 [282 kB] Get: 58 http://deb.debian.org/debian unstable/main amd64 libfreetype6 amd64 2.13.3+dfsg-1 [452 kB] Get: 59 http://deb.debian.org/debian unstable/main amd64 libfontconfig1 amd64 2.15.0-2.3 [392 kB] Get: 60 http://deb.debian.org/debian unstable/main amd64 libpixman-1-0 amd64 0.44.0-3 [248 kB] Get: 61 http://deb.debian.org/debian unstable/main amd64 libxcb-render0 amd64 1.17.0-2+b1 [115 kB] Get: 62 http://deb.debian.org/debian unstable/main amd64 libxcb-shm0 amd64 1.17.0-2+b1 [105 kB] Get: 63 http://deb.debian.org/debian unstable/main amd64 libxext6 amd64 2:1.3.4-1+b3 [50.4 kB] Get: 64 http://deb.debian.org/debian unstable/main amd64 libxrender1 amd64 1:0.9.12-1 [27.9 kB] Get: 65 http://deb.debian.org/debian unstable/main amd64 libcairo2 amd64 1.18.4-1+b1 [538 kB] Get: 66 http://deb.debian.org/debian unstable/main amd64 libffi8 amd64 3.4.8-2 [24.1 kB] Get: 67 http://deb.debian.org/debian unstable/main amd64 libglib2.0-0t64 amd64 2.84.4-3 [1518 kB] Get: 68 http://deb.debian.org/debian unstable/main amd64 libgraphite2-3 amd64 1.3.14-3 [75.1 kB] Get: 69 http://deb.debian.org/debian unstable/main amd64 libharfbuzz0b amd64 10.2.0-1+b1 [479 kB] Get: 70 http://deb.debian.org/debian unstable/main amd64 x11-common all 1:7.7+24 [217 kB] Get: 71 http://deb.debian.org/debian unstable/main amd64 libice6 amd64 2:1.1.1-1 [65.4 kB] Get: 72 http://deb.debian.org/debian unstable/main amd64 libicu76 amd64 76.1-4 [9722 kB] Get: 73 http://deb.debian.org/debian unstable/main amd64 libkpathsea6 amd64 2025.20250727.75242+ds-4 [154 kB] Get: 74 http://deb.debian.org/debian unstable/main amd64 libmpfi0 amd64 1.5.4+ds-4 [35.5 kB] Get: 75 http://deb.debian.org/debian unstable/main amd64 libpaper2 amd64 2.2.5-0.3+b2 [16.7 kB] Get: 76 http://deb.debian.org/debian unstable/main amd64 libpaper-utils amd64 2.2.5-0.3+b2 [16.5 kB] Get: 77 http://deb.debian.org/debian unstable/main amd64 libpotrace0 amd64 1.16-2+b2 [25.6 kB] Get: 78 http://deb.debian.org/debian unstable/main amd64 libptexenc1 amd64 2025.20250727.75242+ds-4 [50.5 kB] Get: 79 http://deb.debian.org/debian unstable/main amd64 libsm6 amd64 2:1.2.6-1 [37.3 kB] Get: 80 http://deb.debian.org/debian unstable/main amd64 libsynctex2 amd64 2025.20250727.75242+ds-4 [58.2 kB] Get: 81 http://deb.debian.org/debian unstable/main amd64 libteckit0 amd64 2.5.12+ds1-1+b1 [341 kB] Get: 82 http://deb.debian.org/debian unstable/main amd64 libtexlua53-5 amd64 2025.20250727.75242+ds-4 [99.4 kB] Get: 83 http://deb.debian.org/debian unstable/main amd64 libxt6t64 amd64 1:1.2.1-1.2+b2 [188 kB] Get: 84 http://deb.debian.org/debian unstable/main amd64 libxmu6 amd64 2:1.1.3-3+b4 [59.0 kB] Get: 85 http://deb.debian.org/debian unstable/main amd64 libxpm4 amd64 1:3.5.17-1+b3 [56.2 kB] Get: 86 http://deb.debian.org/debian unstable/main amd64 libxaw7 amd64 2:1.0.16-1 [212 kB] Get: 87 http://deb.debian.org/debian unstable/main amd64 libxi6 amd64 2:1.8.2-1 [78.9 kB] Get: 88 http://deb.debian.org/debian unstable/main amd64 libzzip-0-13t64 amd64 0.13.78+dfsg.1-0.1 [59.0 kB] Get: 89 http://deb.debian.org/debian unstable/main amd64 t1utils amd64 1.41-4 [62.1 kB] Get: 90 http://deb.debian.org/debian unstable/main amd64 tex-common all 6.19 [29.4 kB] Get: 91 http://deb.debian.org/debian unstable/main amd64 texlive-binaries amd64 2025.20250727.75242+ds-4 [7261 kB] Get: 92 http://deb.debian.org/debian unstable/main amd64 xdg-utils all 1.2.1-2 [75.8 kB] Get: 93 http://deb.debian.org/debian unstable/main amd64 texlive-base all 2025.20250727-2 [23.1 MB] Get: 94 http://deb.debian.org/debian unstable/main amd64 texlive-latex-base all 2025.20250727-2 [1318 kB] Fetched 135 MB in 3s (43.5 MB/s) Preconfiguring packages ... Selecting previously unselected package libexpat1:amd64. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 19855 files and directories currently installed.) Preparing to unpack .../00-libexpat1_2.7.1-2_amd64.deb ... Unpacking libexpat1:amd64 (2.7.1-2) ... Selecting previously unselected package libproc2-0:amd64. Preparing to unpack .../01-libproc2-0_2%3a4.0.4-9_amd64.deb ... Unpacking libproc2-0:amd64 (2:4.0.4-9) ... Selecting previously unselected package procps. Preparing to unpack .../02-procps_2%3a4.0.4-9_amd64.deb ... Unpacking procps (2:4.0.4-9) ... Selecting previously unselected package sensible-utils. Preparing to unpack .../03-sensible-utils_0.0.26_all.deb ... Unpacking sensible-utils (0.0.26) ... Selecting previously unselected package libmagic-mgc. Preparing to unpack .../04-libmagic-mgc_1%3a5.46-5_amd64.deb ... Unpacking libmagic-mgc (1:5.46-5) ... Selecting previously unselected package libmagic1t64:amd64. Preparing to unpack .../05-libmagic1t64_1%3a5.46-5_amd64.deb ... Unpacking libmagic1t64:amd64 (1:5.46-5) ... Selecting previously unselected package file. Preparing to unpack .../06-file_1%3a5.46-5_amd64.deb ... Unpacking file (1:5.46-5) ... Selecting previously unselected package gettext-base. Preparing to unpack .../07-gettext-base_0.23.1-2+b1_amd64.deb ... Unpacking gettext-base (0.23.1-2+b1) ... Selecting previously unselected package libuchardet0:amd64. Preparing to unpack .../08-libuchardet0_0.0.8-1+b2_amd64.deb ... Unpacking libuchardet0:amd64 (0.0.8-1+b2) ... Selecting previously unselected package groff-base. Preparing to unpack .../09-groff-base_1.23.0-9_amd64.deb ... Unpacking groff-base (1.23.0-9) ... Selecting previously unselected package bsdextrautils. Preparing to unpack .../10-bsdextrautils_2.41.1-1_amd64.deb ... Unpacking bsdextrautils (2.41.1-1) ... Selecting previously unselected package libpipeline1:amd64. Preparing to unpack .../11-libpipeline1_1.5.8-1_amd64.deb ... Unpacking libpipeline1:amd64 (1.5.8-1) ... Selecting previously unselected package man-db. Preparing to unpack .../12-man-db_2.13.1-1_amd64.deb ... Unpacking man-db (2.13.1-1) ... Selecting previously unselected package libtext-charwidth-perl:amd64. Preparing to unpack .../13-libtext-charwidth-perl_0.04-11+b4_amd64.deb ... Unpacking libtext-charwidth-perl:amd64 (0.04-11+b4) ... Selecting previously unselected package libtext-wrapi18n-perl. Preparing to unpack .../14-libtext-wrapi18n-perl_0.06-10_all.deb ... Unpacking libtext-wrapi18n-perl (0.06-10) ... Selecting previously unselected package ucf. Preparing to unpack .../15-ucf_3.0052_all.deb ... Moving old data out of the way Unpacking ucf (3.0052) ... Selecting previously unselected package m4. Preparing to unpack .../16-m4_1.4.19-8_amd64.deb ... Unpacking m4 (1.4.19-8) ... Selecting previously unselected package autoconf. Preparing to unpack .../17-autoconf_2.72-3.1_all.deb ... Unpacking autoconf (2.72-3.1) ... Selecting previously unselected package autotools-dev. Preparing to unpack .../18-autotools-dev_20240727.1_all.deb ... Unpacking autotools-dev (20240727.1) ... Selecting previously unselected package automake. Preparing to unpack .../19-automake_1%3a1.17-4_all.deb ... Unpacking automake (1:1.17-4) ... Selecting previously unselected package autopoint. Preparing to unpack .../20-autopoint_0.23.1-2_all.deb ... Unpacking autopoint (0.23.1-2) ... Selecting previously unselected package libdebhelper-perl. Preparing to unpack .../21-libdebhelper-perl_13.26_all.deb ... Unpacking libdebhelper-perl (13.26) ... Selecting previously unselected package libtool. Preparing to unpack .../22-libtool_2.5.4-4_all.deb ... Unpacking libtool (2.5.4-4) ... Selecting previously unselected package dh-autoreconf. Preparing to unpack .../23-dh-autoreconf_20_all.deb ... Unpacking dh-autoreconf (20) ... Selecting previously unselected package libarchive-zip-perl. Preparing to unpack .../24-libarchive-zip-perl_1.68-1_all.deb ... Unpacking libarchive-zip-perl (1.68-1) ... Selecting previously unselected package libfile-stripnondeterminism-perl. Preparing to unpack .../25-libfile-stripnondeterminism-perl_1.14.2-1_all.deb ... Unpacking libfile-stripnondeterminism-perl (1.14.2-1) ... Selecting previously unselected package dh-strip-nondeterminism. Preparing to unpack .../26-dh-strip-nondeterminism_1.14.2-1_all.deb ... Unpacking dh-strip-nondeterminism (1.14.2-1) ... Selecting previously unselected package libelf1t64:amd64. Preparing to unpack .../27-libelf1t64_0.192-4_amd64.deb ... Unpacking libelf1t64:amd64 (0.192-4) ... Selecting previously unselected package dwz. Preparing to unpack .../28-dwz_0.15-1+b1_amd64.deb ... Unpacking dwz (0.15-1+b1) ... Selecting previously unselected package libunistring5:amd64. Preparing to unpack .../29-libunistring5_1.3-2_amd64.deb ... Unpacking libunistring5:amd64 (1.3-2) ... Selecting previously unselected package libxml2-16:amd64. Preparing to unpack .../30-libxml2-16_2.14.5+dfsg-0.1_amd64.deb ... Unpacking libxml2-16:amd64 (2.14.5+dfsg-0.1) ... Selecting previously unselected package gettext. Preparing to unpack .../31-gettext_0.23.1-2+b1_amd64.deb ... Unpacking gettext (0.23.1-2+b1) ... Selecting previously unselected package intltool-debian. Preparing to unpack .../32-intltool-debian_0.35.0+20060710.6_all.deb ... Unpacking intltool-debian (0.35.0+20060710.6) ... Selecting previously unselected package po-debconf. Preparing to unpack .../33-po-debconf_1.0.21+nmu1_all.deb ... Unpacking po-debconf (1.0.21+nmu1) ... Selecting previously unselected package debhelper. Preparing to unpack .../34-debhelper_13.26_all.deb ... Unpacking debhelper (13.26) ... Selecting previously unselected package fonts-dejavu-mono. Preparing to unpack .../35-fonts-dejavu-mono_2.37-8_all.deb ... Unpacking fonts-dejavu-mono (2.37-8) ... Selecting previously unselected package fonts-dejavu-core. Preparing to unpack .../36-fonts-dejavu-core_2.37-8_all.deb ... Unpacking fonts-dejavu-core (2.37-8) ... Selecting previously unselected package fontconfig-config. Preparing to unpack .../37-fontconfig-config_2.15.0-2.3_amd64.deb ... Unpacking fontconfig-config (2.15.0-2.3) ... Selecting previously unselected package fonts-lmodern. Preparing to unpack .../38-fonts-lmodern_2.005-1_all.deb ... Unpacking fonts-lmodern (2.005-1) ... Selecting previously unselected package libedit2:amd64. Preparing to unpack .../39-libedit2_3.1-20250104-1_amd64.deb ... Unpacking libedit2:amd64 (3.1-20250104-1) ... Selecting previously unselected package libkrb5support0:amd64. Preparing to unpack .../40-libkrb5support0_1.21.3-5_amd64.deb ... Unpacking libkrb5support0:amd64 (1.21.3-5) ... Selecting previously unselected package libcom-err2:amd64. Preparing to unpack .../41-libcom-err2_1.47.2-3+b3_amd64.deb ... Unpacking libcom-err2:amd64 (1.47.2-3+b3) ... Selecting previously unselected package libk5crypto3:amd64. Preparing to unpack .../42-libk5crypto3_1.21.3-5_amd64.deb ... Unpacking libk5crypto3:amd64 (1.21.3-5) ... Selecting previously unselected package libkeyutils1:amd64. Preparing to unpack .../43-libkeyutils1_1.6.3-6_amd64.deb ... Unpacking libkeyutils1:amd64 (1.6.3-6) ... Selecting previously unselected package libkrb5-3:amd64. Preparing to unpack .../44-libkrb5-3_1.21.3-5_amd64.deb ... Unpacking libkrb5-3:amd64 (1.21.3-5) ... Selecting previously unselected package libgssapi-krb5-2:amd64. Preparing to unpack .../45-libgssapi-krb5-2_1.21.3-5_amd64.deb ... Unpacking libgssapi-krb5-2:amd64 (1.21.3-5) ... Selecting previously unselected package libtirpc-common. Preparing to unpack .../46-libtirpc-common_1.3.6+ds-1_all.deb ... Unpacking libtirpc-common (1.3.6+ds-1) ... Selecting previously unselected package libtirpc3t64:amd64. Preparing to unpack .../47-libtirpc3t64_1.3.6+ds-1_amd64.deb ... Adding 'diversion of /lib/x86_64-linux-gnu/libtirpc.so.3 to /lib/x86_64-linux-gnu/libtirpc.so.3.usr-is-merged by libtirpc3t64' Adding 'diversion of /lib/x86_64-linux-gnu/libtirpc.so.3.0.0 to /lib/x86_64-linux-gnu/libtirpc.so.3.0.0.usr-is-merged by libtirpc3t64' Unpacking libtirpc3t64:amd64 (1.3.6+ds-1) ... Selecting previously unselected package libxau6:amd64. Preparing to unpack .../48-libxau6_1%3a1.0.11-1_amd64.deb ... Unpacking libxau6:amd64 (1:1.0.11-1) ... Selecting previously unselected package libxdmcp6:amd64. Preparing to unpack .../49-libxdmcp6_1%3a1.1.5-1_amd64.deb ... Unpacking libxdmcp6:amd64 (1:1.1.5-1) ... Selecting previously unselected package libxcb1:amd64. Preparing to unpack .../50-libxcb1_1.17.0-2+b1_amd64.deb ... Unpacking libxcb1:amd64 (1.17.0-2+b1) ... Selecting previously unselected package libx11-data. Preparing to unpack .../51-libx11-data_2%3a1.8.12-1_all.deb ... Unpacking libx11-data (2:1.8.12-1) ... Selecting previously unselected package libx11-6:amd64. Preparing to unpack .../52-libx11-6_2%3a1.8.12-1_amd64.deb ... Unpacking libx11-6:amd64 (2:1.8.12-1) ... Selecting previously unselected package libtirpc-dev:amd64. Preparing to unpack .../53-libtirpc-dev_1.3.6+ds-1_amd64.deb ... Unpacking libtirpc-dev:amd64 (1.3.6+ds-1) ... Selecting previously unselected package gcl27. Preparing to unpack .../54-gcl27_2.7.1-7_amd64.deb ... Unpacking gcl27 (2.7.1-7) ... Selecting previously unselected package libbrotli1:amd64. Preparing to unpack .../55-libbrotli1_1.1.0-2+b7_amd64.deb ... Unpacking libbrotli1:amd64 (1.1.0-2+b7) ... Selecting previously unselected package libpng16-16t64:amd64. Preparing to unpack .../56-libpng16-16t64_1.6.50-1_amd64.deb ... Unpacking libpng16-16t64:amd64 (1.6.50-1) ... Selecting previously unselected package libfreetype6:amd64. Preparing to unpack .../57-libfreetype6_2.13.3+dfsg-1_amd64.deb ... Unpacking libfreetype6:amd64 (2.13.3+dfsg-1) ... Selecting previously unselected package libfontconfig1:amd64. Preparing to unpack .../58-libfontconfig1_2.15.0-2.3_amd64.deb ... Unpacking libfontconfig1:amd64 (2.15.0-2.3) ... Selecting previously unselected package libpixman-1-0:amd64. Preparing to unpack .../59-libpixman-1-0_0.44.0-3_amd64.deb ... Unpacking libpixman-1-0:amd64 (0.44.0-3) ... Selecting previously unselected package libxcb-render0:amd64. Preparing to unpack .../60-libxcb-render0_1.17.0-2+b1_amd64.deb ... Unpacking libxcb-render0:amd64 (1.17.0-2+b1) ... Selecting previously unselected package libxcb-shm0:amd64. Preparing to unpack .../61-libxcb-shm0_1.17.0-2+b1_amd64.deb ... Unpacking libxcb-shm0:amd64 (1.17.0-2+b1) ... Selecting previously unselected package libxext6:amd64. Preparing to unpack .../62-libxext6_2%3a1.3.4-1+b3_amd64.deb ... Unpacking libxext6:amd64 (2:1.3.4-1+b3) ... Selecting previously unselected package libxrender1:amd64. Preparing to unpack .../63-libxrender1_1%3a0.9.12-1_amd64.deb ... Unpacking libxrender1:amd64 (1:0.9.12-1) ... Selecting previously unselected package libcairo2:amd64. Preparing to unpack .../64-libcairo2_1.18.4-1+b1_amd64.deb ... Unpacking libcairo2:amd64 (1.18.4-1+b1) ... Selecting previously unselected package libffi8:amd64. Preparing to unpack .../65-libffi8_3.4.8-2_amd64.deb ... Unpacking libffi8:amd64 (3.4.8-2) ... Selecting previously unselected package libglib2.0-0t64:amd64. Preparing to unpack .../66-libglib2.0-0t64_2.84.4-3_amd64.deb ... Unpacking libglib2.0-0t64:amd64 (2.84.4-3) ... Selecting previously unselected package libgraphite2-3:amd64. Preparing to unpack .../67-libgraphite2-3_1.3.14-3_amd64.deb ... Unpacking libgraphite2-3:amd64 (1.3.14-3) ... Selecting previously unselected package libharfbuzz0b:amd64. Preparing to unpack .../68-libharfbuzz0b_10.2.0-1+b1_amd64.deb ... Unpacking libharfbuzz0b:amd64 (10.2.0-1+b1) ... Selecting previously unselected package x11-common. Preparing to unpack .../69-x11-common_1%3a7.7+24_all.deb ... Unpacking x11-common (1:7.7+24) ... Selecting previously unselected package libice6:amd64. Preparing to unpack .../70-libice6_2%3a1.1.1-1_amd64.deb ... Unpacking libice6:amd64 (2:1.1.1-1) ... Selecting previously unselected package libicu76:amd64. Preparing to unpack .../71-libicu76_76.1-4_amd64.deb ... Unpacking libicu76:amd64 (76.1-4) ... Selecting previously unselected package libkpathsea6:amd64. Preparing to unpack .../72-libkpathsea6_2025.20250727.75242+ds-4_amd64.deb ... Unpacking libkpathsea6:amd64 (2025.20250727.75242+ds-4) ... Selecting previously unselected package libmpfi0:amd64. Preparing to unpack .../73-libmpfi0_1.5.4+ds-4_amd64.deb ... Unpacking libmpfi0:amd64 (1.5.4+ds-4) ... Selecting previously unselected package libpaper2:amd64. Preparing to unpack .../74-libpaper2_2.2.5-0.3+b2_amd64.deb ... Unpacking libpaper2:amd64 (2.2.5-0.3+b2) ... Selecting previously unselected package libpaper-utils. Preparing to unpack .../75-libpaper-utils_2.2.5-0.3+b2_amd64.deb ... Unpacking libpaper-utils (2.2.5-0.3+b2) ... Selecting previously unselected package libpotrace0:amd64. Preparing to unpack .../76-libpotrace0_1.16-2+b2_amd64.deb ... Unpacking libpotrace0:amd64 (1.16-2+b2) ... Selecting previously unselected package libptexenc1:amd64. Preparing to unpack .../77-libptexenc1_2025.20250727.75242+ds-4_amd64.deb ... Unpacking libptexenc1:amd64 (2025.20250727.75242+ds-4) ... Selecting previously unselected package libsm6:amd64. Preparing to unpack .../78-libsm6_2%3a1.2.6-1_amd64.deb ... Unpacking libsm6:amd64 (2:1.2.6-1) ... Selecting previously unselected package libsynctex2:amd64. Preparing to unpack .../79-libsynctex2_2025.20250727.75242+ds-4_amd64.deb ... Unpacking libsynctex2:amd64 (2025.20250727.75242+ds-4) ... Selecting previously unselected package libteckit0:amd64. Preparing to unpack .../80-libteckit0_2.5.12+ds1-1+b1_amd64.deb ... Unpacking libteckit0:amd64 (2.5.12+ds1-1+b1) ... Selecting previously unselected package libtexlua53-5:amd64. Preparing to unpack .../81-libtexlua53-5_2025.20250727.75242+ds-4_amd64.deb ... Unpacking libtexlua53-5:amd64 (2025.20250727.75242+ds-4) ... Selecting previously unselected package libxt6t64:amd64. Preparing to unpack .../82-libxt6t64_1%3a1.2.1-1.2+b2_amd64.deb ... Unpacking libxt6t64:amd64 (1:1.2.1-1.2+b2) ... Selecting previously unselected package libxmu6:amd64. Preparing to unpack .../83-libxmu6_2%3a1.1.3-3+b4_amd64.deb ... Unpacking libxmu6:amd64 (2:1.1.3-3+b4) ... Selecting previously unselected package libxpm4:amd64. Preparing to unpack .../84-libxpm4_1%3a3.5.17-1+b3_amd64.deb ... Unpacking libxpm4:amd64 (1:3.5.17-1+b3) ... Selecting previously unselected package libxaw7:amd64. Preparing to unpack .../85-libxaw7_2%3a1.0.16-1_amd64.deb ... Unpacking libxaw7:amd64 (2:1.0.16-1) ... Selecting previously unselected package libxi6:amd64. Preparing to unpack .../86-libxi6_2%3a1.8.2-1_amd64.deb ... Unpacking libxi6:amd64 (2:1.8.2-1) ... Selecting previously unselected package libzzip-0-13t64:amd64. Preparing to unpack .../87-libzzip-0-13t64_0.13.78+dfsg.1-0.1_amd64.deb ... Unpacking libzzip-0-13t64:amd64 (0.13.78+dfsg.1-0.1) ... Selecting previously unselected package t1utils. Preparing to unpack .../88-t1utils_1.41-4_amd64.deb ... Unpacking t1utils (1.41-4) ... Selecting previously unselected package tex-common. Preparing to unpack .../89-tex-common_6.19_all.deb ... Unpacking tex-common (6.19) ... Selecting previously unselected package texlive-binaries. Preparing to unpack .../90-texlive-binaries_2025.20250727.75242+ds-4_amd64.deb ... Unpacking texlive-binaries (2025.20250727.75242+ds-4) ... Selecting previously unselected package xdg-utils. Preparing to unpack .../91-xdg-utils_1.2.1-2_all.deb ... Unpacking xdg-utils (1.2.1-2) ... Selecting previously unselected package texlive-base. Preparing to unpack .../92-texlive-base_2025.20250727-2_all.deb ... Unpacking texlive-base (2025.20250727-2) ... Selecting previously unselected package texlive-latex-base. Preparing to unpack .../93-texlive-latex-base_2025.20250727-2_all.deb ... Unpacking texlive-latex-base (2025.20250727-2) ... Setting up libexpat1:amd64 (2.7.1-2) ... Setting up libpipeline1:amd64 (1.5.8-1) ... Setting up libgraphite2-3:amd64 (1.3.14-3) ... Setting up libpixman-1-0:amd64 (0.44.0-3) ... Setting up libtext-charwidth-perl:amd64 (0.04-11+b4) ... Setting up libxau6:amd64 (1:1.0.11-1) ... Setting up libxdmcp6:amd64 (1:1.1.5-1) ... Setting up libkeyutils1:amd64 (1.6.3-6) ... Setting up libxcb1:amd64 (1.17.0-2+b1) ... Setting up bsdextrautils (2.41.1-1) ... Setting up libmagic-mgc (1:5.46-5) ... Setting up libxcb-render0:amd64 (1.17.0-2+b1) ... Setting up libarchive-zip-perl (1.68-1) ... Setting up libxml2-16:amd64 (2.14.5+dfsg-0.1) ... Setting up libtirpc-common (1.3.6+ds-1) ... Setting up libdebhelper-perl (13.26) ... Setting up libbrotli1:amd64 (1.1.0-2+b7) ... Setting up libedit2:amd64 (3.1-20250104-1) ... Setting up libmagic1t64:amd64 (1:5.46-5) ... Setting up x11-common (1:7.7+24) ... invoke-rc.d: could not determine current runlevel Setting up X socket directories... /tmp/.X11-unix /tmp/.ICE-unix. Setting up gettext-base (0.23.1-2+b1) ... Setting up m4 (1.4.19-8) ... Setting up libxcb-shm0:amd64 (1.17.0-2+b1) ... Setting up libcom-err2:amd64 (1.47.2-3+b3) ... Setting up file (1:5.46-5) ... Setting up libtext-wrapi18n-perl (0.06-10) ... Setting up libelf1t64:amd64 (0.192-4) ... Setting up libkrb5support0:amd64 (1.21.3-5) ... Setting up autotools-dev (20240727.1) ... Setting up libzzip-0-13t64:amd64 (0.13.78+dfsg.1-0.1) ... Setting up libx11-data (2:1.8.12-1) ... Setting up libteckit0:amd64 (2.5.12+ds1-1+b1) ... Setting up t1utils (1.41-4) ... Setting up libtexlua53-5:amd64 (2025.20250727.75242+ds-4) ... Setting up libproc2-0:amd64 (2:4.0.4-9) ... Setting up libunistring5:amd64 (1.3-2) ... Setting up fonts-dejavu-mono (2.37-8) ... Setting up libpng16-16t64:amd64 (1.6.50-1) ... Setting up autopoint (0.23.1-2) ... Setting up libmpfi0:amd64 (1.5.4+ds-4) ... Setting up fonts-dejavu-core (2.37-8) ... Setting up libk5crypto3:amd64 (1.21.3-5) ... Setting up libkpathsea6:amd64 (2025.20250727.75242+ds-4) ... Setting up autoconf (2.72-3.1) ... Setting up libffi8:amd64 (3.4.8-2) ... Setting up dwz (0.15-1+b1) ... Setting up sensible-utils (0.0.26) ... Setting up libuchardet0:amd64 (0.0.8-1+b2) ... Setting up procps (2:4.0.4-9) ... Setting up fonts-lmodern (2.005-1) ... Setting up libx11-6:amd64 (2:1.8.12-1) ... Setting up libkrb5-3:amd64 (1.21.3-5) ... Setting up libicu76:amd64 (76.1-4) ... Setting up libpaper2:amd64 (2.2.5-0.3+b2) ... Setting up xdg-utils (1.2.1-2) ... update-alternatives: using /usr/bin/xdg-open to provide /usr/bin/open (open) in auto mode Setting up libsynctex2:amd64 (2025.20250727.75242+ds-4) ... Setting up libpotrace0:amd64 (1.16-2+b2) ... Setting up automake (1:1.17-4) ... update-alternatives: using /usr/bin/automake-1.17 to provide /usr/bin/automake (automake) in auto mode Setting up libfile-stripnondeterminism-perl (1.14.2-1) ... Setting up libice6:amd64 (2:1.1.1-1) ... Setting up gettext (0.23.1-2+b1) ... Setting up libxpm4:amd64 (1:3.5.17-1+b3) ... Setting up libxrender1:amd64 (1:0.9.12-1) ... Setting up libtool (2.5.4-4) ... Setting up fontconfig-config (2.15.0-2.3) ... Setting up libxext6:amd64 (2:1.3.4-1+b3) ... Setting up libpaper-utils (2.2.5-0.3+b2) ... Setting up intltool-debian (0.35.0+20060710.6) ... Setting up dh-autoreconf (20) ... Setting up libglib2.0-0t64:amd64 (2.84.4-3) ... No schema files found: doing nothing. Setting up libptexenc1:amd64 (2025.20250727.75242+ds-4) ... Setting up libfreetype6:amd64 (2.13.3+dfsg-1) ... Setting up libgssapi-krb5-2:amd64 (1.21.3-5) ... Setting up ucf (3.0052) ... Setting up dh-strip-nondeterminism (1.14.2-1) ... Setting up groff-base (1.23.0-9) ... Setting up libharfbuzz0b:amd64 (10.2.0-1+b1) ... Setting up libfontconfig1:amd64 (2.15.0-2.3) ... Setting up libsm6:amd64 (2:1.2.6-1) ... Setting up libxi6:amd64 (2:1.8.2-1) ... Setting up libtirpc3t64:amd64 (1.3.6+ds-1) ... Setting up po-debconf (1.0.21+nmu1) ... Setting up man-db (2.13.1-1) ... Not building database; man-db/auto-update is not 'true'. Setting up libcairo2:amd64 (1.18.4-1+b1) ... Setting up tex-common (6.19) ... update-language: texlive-base not installed and configured, doing nothing! Setting up libtirpc-dev:amd64 (1.3.6+ds-1) ... Setting up libxt6t64:amd64 (1:1.2.1-1.2+b2) ... Setting up gcl27 (2.7.1-7) ... Creating config file /etc/default/gcl27 with new version Setting up libxmu6:amd64 (2:1.1.3-3+b4) ... Setting up debhelper (13.26) ... Setting up libxaw7:amd64 (2:1.0.16-1) ... Setting up texlive-binaries (2025.20250727.75242+ds-4) ... 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 (2025.20250727-2) ... tl-paper: setting paper size for dvips to a4: /var/lib/texmf/dvips/config/config-paper.ps tl-paper: setting paper size for dvipdfmx to a4: /var/lib/texmf/dvipdfmx/dvipdfmx-paper.cfg tl-paper: setting paper size for xdvi to a4: /var/lib/texmf/xdvi/XDvi-paper tl-paper: setting paper size for pdftex to a4: /var/lib/texmf/tex/generic/tex-ini-files/pdftexconfig.tex Setting up texlive-latex-base (2025.20250727-2) ... Processing triggers for libc-bin (2.41-12) ... Processing triggers for tex-common (6.19) ... 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.37.1.2-1). 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. I: Building the package I: Running cd /build/reproducible-path/hol88-2.02.19940316dfsg/ && 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 > ../hol88_2.02.19940316dfsg-8_source.changes dpkg-buildpackage: info: source package hol88 dpkg-buildpackage: info: source version 2.02.19940316dfsg-8 dpkg-buildpackage: info: source distribution unstable dpkg-buildpackage: info: source changed by Camm Maguire dpkg-source --before-build . dpkg-buildpackage: info: host architecture amd64 debian/rules clean dh_testdir dh_testroot rm -f build-arch-stamp build-indep-stamp configure-stamp [ ! -f Makefile ] || /usr/bin/make clean make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg' /bin/rm -f ml/*_ml.o ml/*_ml.l ml/site.ml lisp/*.o /bin/rm -f hol-lcf basic-hol hol /usr/bin/make clean-library make[2]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg' (cd /build/reproducible-path/hol88-2.02.19940316dfsg/Library; /usr/bin/make Obj=o clean; cd ..) make[3]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library' for lib in unwind taut sets reduce arith pred_sets string finite_sets res_quan wellorder abs_theory reals window pair word record_proof parser prettyp trs latex-hol more_arithmetic numeral ind_defs ; \ do (cd $lib; /usr/bin/make Obj=o clean; cd ..) ; \ done make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind' rm -f *_ml.o *_ml.l ===> library unwind: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut' rm -f taut_check_ml.o taut_check_ml.l ===> library taut: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets' rm -f *_ml.o ===> library sets: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce' rm -f boolconv_ml.o arithconv_ml.o reduce_ml.o make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith' rm -f *_ml.l *_ml.o ===> library arith: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets' rm -f *_ml.o ===> library pred_sets: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string' rm -f *_ml.o ===> library string: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets' rm -f *_ml.o ===> library finite_sets: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan' rm -f *_ml.o ===> library res_quan: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder' make[4]: 'clean' is up to date. make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory' /bin/rm -f *_ml.o ===> abs_theory. All object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals' cd theories; make clean make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/theories' rm -f *_ml.o make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/theories' make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window' rm -f *.l *.c *.o *.h *.data ===> library window: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair' rm -f *.l *.c *.o *.h *.data *.i *.s *.ir ===> library pair: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word' rm -f *_ml.o ===> library word: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof' rm -f *_ml.o ===> library record_proof: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser' rm -f *_ml.o *_ml.l *.o ===> library parser: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp' rm -f PP_printer/*_ml.o PP_printer/*_ml.l rm -f PP_parser/*_ml.o PP_parser/*_ml.l rm -f PP_hol/*_ml.o PP_hol/*_ml.l ===> library prettyp: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs' rm -f *_ml.l *_ml.o ===> library trs: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/latex-hol' rm -f *.o ===> library latex-hol: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/latex-hol' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic' rm -f *_ml.o ===> library more_arithmetic: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral' rm -f numeral_rules_ml.o make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/ind_defs' rm -f *_ml.o ===> library ind_defs: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/ind_defs' ===> all library object code deleted make[3]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library' make[2]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg' =======> all hol and lisp object code deleted make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg' [ ! -f Makefile ] || /usr/bin/make clobber make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg' /bin/rm -f ml/*_ml.o ml/*_ml.l ml/site.ml lisp/*.o /bin/rm -f /build/reproducible-path/hol88-2.02.19940316dfsg/theories/*.th hol-lcf basic-hol hol /usr/bin/make clobber-library make[2]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg' (cd /build/reproducible-path/hol88-2.02.19940316dfsg/Library; /usr/bin/make Obj=o clobber; cd ..) make[3]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library' for lib in unwind taut sets reduce arith pred_sets string finite_sets res_quan wellorder abs_theory reals window pair word record_proof parser prettyp trs latex-hol more_arithmetic numeral ind_defs ; \ do (cd $lib; /usr/bin/make Obj=o clobber; cd ..) ; \ done make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind' rm -f *_ml.o *_ml.l ===> library unwind: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut' rm -f taut_check_ml.o taut_check_ml.l ===> library taut: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets' rm -f *_ml.o *_ml.l *.th ===> library sets: all object code and theory files deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce' rm -f boolconv_ml.o arithconv_ml.o reduce_ml.o make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith' rm -f *_ml.l *_ml.o ===> library arith: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets' rm -f *_ml.o *_ml.l *.th ===> library pred_sets: all object code and theory files deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string' rm -f *_ml.o *_ml.l *.th ===> library string: all object code and theory files deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets' rm -f *_ml.o *_ml.l *.th ===> library finite_sets: object code and theory files deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan' rm -f *_ml.o *_ml.l *.th ===> library res_quan: all object code and theory files deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder' rm -f WELLORDER.th make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory' /bin/rm -f *_ml.o *.th print ===> abs_theory: All object code and theory files deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals' cd theories; make clobber make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/theories' rm -f *_ml.o rm -f *.th make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/theories' make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window' rm -f *.l *.c *.o *.th *.h *.data ===> library window: all object code and theory files deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair' rm -f *.l *.c *.o *.th *.h *.data *.i *.s *.ir ===> library pair: all object code and theory files deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word' rm -f *_ml.o *_ml.l *.th ===> library word: all object code and theory files deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof' rm -f *_ml.o *_ml.l *.th ===> library record_proof: all object code and theory files deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser' rm -f *_ml.o *_ml.l *.o ===> library parser: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp' rm -f PP_printer/*_ml.o PP_printer/*_ml.l rm -f PP_parser/*_ml.o PP_parser/*_ml.l PP_parser/*_pp.ml rm -f PP_hol/*_ml.o PP_hol/*_ml.l PP_hol/*_pp.ml ===> library prettyp: all object code and _pp.ml files deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs' rm -f *_ml.l *_ml.o ===> library trs: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/latex-hol' rm -f latex_*_pp.ml *.o ===> library latex-hol: all object code and _pp.ml file deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/latex-hol' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic' rm -f *_ml.o *_ml.l *.th ===> library more_arithmetic: all object code and theory files deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral' rm -f numeral_rules_ml.o rm -f numeral.th make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/ind_defs' rm -f *_ml.o *_ml.l ===> library ind_defs: all object code deleted make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/ind_defs' ===> all library object code and theory files deleted make[3]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library' make[2]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg' =======> all object code and theory files deleted make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg' for i in $(find Library -name index.tex) Library/pred_sets/Manual/theorems.tex Library/record_proof/Manual/record_proof.ind ; do\ [ -e $i.sve ] || cp $i $i.sve ; done [ ! -f Makefile ] || /usr/bin/make -C Manual clean make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual' for i in Tutorial Description Reference Libraries Covers ; do /usr/bin/make -C $i clean ; done make[2]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Tutorial' rm -f *.dvi *.aux *.toc *.log make[2]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Tutorial' make[2]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Description' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[2]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Description' make[2]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Reference' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[2]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Reference' make[2]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Libraries' rm -f *.dvi *.aux *.toc *.log make[2]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Libraries' make[2]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Covers' rm -f *.log core *.aux *~ #* LOG ===> Fancy end and title pages cleaned up make[2]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Covers' make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual' [ ! -f Makefile ] || for i in $(find Library -name Manual); do /usr/bin/make -C $i clean ; done make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder/Manual' \ rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex; \ printf '\\begin{theindex}' >index.tex; \ printf '\\mbox{}' >>index.tex; \ printf '\\end{theindex}' >>index.tex make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory/Manual' \ rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex; \ printf '\\begin{theindex}' >index.tex; \ printf '\\mbox{}' >>index.tex; \ printf '\\end{theindex}' >>index.tex make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/Manual' \ rm -f *.dvi *.aux *.toc *.log *.idx *.ilg; \ printf '\\begin{theindex}' >index.tex; \ printf '\\mbox{}' >>index.tex; \ printf '\\end{theindex}' >>index.tex make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex *.bak; \ printf '\\begin{theindex}' >index.tex; \ printf '\\mbox{}' >>index.tex; \ printf '\\end{theindex}' >>index.tex make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex theorems.tex; \ printf '\\begin{theindex}' >index.tex; \ printf '\\mbox{}' >>index.tex; \ printf '\\end{theindex}' >>index.tex make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/latex-hol/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/latex-hol/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral/Manual' \ rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex; \ printf '\\begin{theindex}' >index.tex; \ printf '\\mbox{}' >>index.tex; \ printf '\\end{theindex}' >>index.tex make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce/Manual' \ rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex; \ printf '\\begin{theindex}' >index.tex; \ printf '\\mbox{}' >>index.tex; \ printf '\\end{theindex}' >>index.tex make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets/Manual' make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets/Manual' find -name X.tex -exec rm -rf {} \; dh_clean -X./ml/site.ml.orig -X./contrib/tooltool/Makefile.orig \ -X./contrib/tooltool/events.c.orig -X./contrib/tooltool/func_fix.c.orig \ -X./contrib/tooltool/lex.c.orig -X./contrib/tooltool/parse.y.orig \ -X./contrib/tooltool/patchlevel.h.orig -X./contrib/tooltool/windows.c.orig \ -X./contrib/Xhelp/hol_apro.orig -X./contrib/Xhelp/hol_ref.orig \ -X./contrib/Xhelp/xholhelp.h.orig -X./contrib/Xhelp/hol_thm.orig for i in $(find Library -name "*.sve") ; do mv $i $(echo $i | sed "s,\.sve,,1"); done rm -f debian/hol88.install debian/hol88-library.install debian/hol88-source.install debian/hol88-help.install debian/hol88-library-source.install debian/hol88-library-help.install debian/hol88-contrib-source.install debian/hol88-contrib-help.install debian/hol88-doc.install debian/hol88.links debian/hol88-library.links debian/hol88.sh find -name "*.dvi" -exec rm {} \; rm -f Manual/Tutorial/ack.tex Manual/Reference/ack.tex Manual/Description/ack.tex rm -f Manual/Covers/titlepages.ps Manual/Covers/endpages.ps rm -f bm.l foo* gcl ./lisp/f-ol-syntax.data cp debian/site_ml_orig ml/site.ml.orig rm -f Library/finite_sets/Manual/entries.tex \ Library/finite_sets/Manual/theorems.tex \ Library/more_arithmetic/Manual/theorems.tex \ Library/numeral/Manual/theorems.tex \ Library/pred_sets/Manual/entries.tex \ Library/prettyp/Manual/entries.tex \ Library/reals/Manual/theorems.tex \ Library/res_quan/Manual/entries.tex \ Library/sets/Manual/entries.tex \ Library/sets/Manual/theorems.tex \ Library/string/Manual/theorems.tex \ Library/wellorder/Manual/theorems.tex \ Library/word/Manual/theorems.tex \ Manual/Reference/entries.tex \ Manual/Reference/theorems.tex debian/rules binary dh_testdir touch configure-stamp echo '(shadow "LIST")' \ '(defmacro list (&rest r &aux (l (length r)))' \ '(let ((x (nthcdr (1- call-arguments-limit) r)))' \ '(if x `(nconc (cl::list ,@(ldiff r x)) (list ,@x)) `(cl::list ,@r))))' \ '(deftype list nil (quote cl::list))' \ '(use-package :cltl1-compat)' \ '(si::save-system "gcl")' | GCL_ANSI="no" gcl27 # FIXME list calls > call-arguments-limit GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ > T > LIST > LIST > T >PATH=$(pwd):$PATH /usr/bin/make all make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg' date Mon Aug 25 19:20:09 2025 /usr/bin/make hol make[2]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg' if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(compile-file "lisp/f-cl.l") (quit)'\ | gcl; else\ lisp/f-franz; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ > ;; Compiling lisp/f-cl.l. ;; When compiling (DEFUN WHILE ...) STYLE-WARNING: signature change on function WHILE, ((T T) CONS) -> ((T T) SYSTEM:PROPER-CONS) ;; When compiling (DEFUN LLPRINT) WARNING: ;; The variable |%theory_pp-flag| is undefined. ;; The compiler will assume this variable is a global. ;; When compiling (DEFUN INFILEPUSH) WARNING: ;; The variable INPUTSTACK is undefined. ;; The compiler will assume this variable is a global. ;; When compiling (DEFUN SET-FASL-FLAG) WARNING: ;; The variable |%print_fasl-flag| is undefined. ;; The compiler will assume this variable is a global. ;; When compiling (DEFUN INIT-IO) WARNING: ;; The variable OUTFILES is undefined. ;; The compiler will assume this variable is a global. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-macro.l") (quit)'\ | gcl; else\ lisp/f-macro; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-macro.l. ;; When compiling (DEFUN EXISTS) ;; inlining (#<@0000000004563D10> # ...) ;; inlining (#<@0000000004561990> # ...) ;; inlining (#<@000000000455ECB0> # ...) ;; inlining (SYSTEM::LMAP # ...) ;; inlining (SYSTEM::LMAPR # ...) ;; inlining (MAPL # ...) ;; inlining (MAPC # ...) ;; inlining (MAPCAR # ...) STYLE-WARNING: The variable IGNORE is not used. ;; When compiling (DEFUN FORALL) ;; inlining (#<@00000000049DFC20> # ...) ;; inlining (#<@00000000049DD8A0> # ...) ;; inlining (#<@00000000049DABC0> # ...) ;; inlining (SYSTEM::LMAP # ...) ;; inlining (SYSTEM::LMAPR # ...) ;; inlining (MAPL # ...) ;; inlining (MAPC # ...) ;; inlining (MAPCAR # ...) STYLE-WARNING: The variable IGNORE is not used. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-system.l") (quit)'\ | gcl; else\ lisp/f-system; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-system.l. ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a00 ;; When compiling (DEFUN FILETOKP) STYLE-WARNING: The variable TOK is not used. STYLE-WARNING: The variable KIND is not used. ;; When compiling (DEFUN COMPILE-LISP) ;; inlining (#<@0000000005D04FA0> # ...) ;; inlining (#<@0000000005CF6320> # ...) STYLE-WARNING: The variable X is not used. ;; When compiling (DEFUN COMPILE-LISP) ;; inlining (#<@0000000005D48590> # ...) ;; inlining (#<@0000000005D39910> # ...) STYLE-WARNING: The variable X is not used. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-system.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-system.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-help.l") (quit)'\ | gcl; else\ lisp/f-help; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-help.l. ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a00 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-help.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-help.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-ol-rec.l") (quit)'\ | gcl; else\ lisp/f-ol-rec; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-ol-rec.l. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/genmacs.l") (quit)'\ | gcl; else\ lisp/genmacs; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/genmacs.l. ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a00 ;;; Including lisp/f-ol-rec;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x2683760 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/genmacs.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/genmacs.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/mk-ml.l") (quit)'\ | gcl; else\ lisp/mk-ml; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/mk-ml.l. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/mk-ml.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/mk-ml.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/mk-hol-lcf.l") (quit)'\ | gcl; else\ lisp/mk-hol-lcf; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/mk-hol-lcf.l. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/mk-hol-lcf.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/mk-hol-lcf.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-constants.l") (quit)'\ | gcl; else\ lisp/f-constants; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-constants.l. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-site.l") (quit)'\ | gcl; else\ lisp/f-site; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-site.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-site.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-site.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-gp.l") (quit)'\ | gcl; else\ lisp/f-gp; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-gp.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-gp.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-gp.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-parser.l") (quit)'\ | gcl; else\ lisp/f-parser; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-parser.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parser.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parser.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-parsml.l") (quit)'\ | gcl; else\ lisp/f-parsml; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-parsml.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parsml.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parsml.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-mlprin.l") (quit)'\ | gcl; else\ lisp/f-mlprin; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-mlprin.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-mlprin.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-mlprin.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-typeml.l") (quit)'\ | gcl; else\ lisp/f-typeml; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-typeml.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-typeml.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-typeml.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-dml.l") (quit)'\ | gcl; else\ lisp/f-dml; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-dml.l. ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a00 ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2683760 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-dml.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-dml.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-format.l") (quit)'\ | gcl; else\ lisp/f-format; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-format.l. ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a00 ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2683760 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-format.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-format.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-tran.l") (quit)'\ | gcl; else\ lisp/f-tran; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-tran.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-tran.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-tran.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-iox-stand.l") (quit)'\ | gcl; else\ lisp/f-iox-stand; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-iox-stand.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-iox-stand.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-iox-stand.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-writml.l") (quit)'\ | gcl; else\ lisp/f-writml; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-writml.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;; When compiling (DEFUN ML-PRINT_VOID) STYLE-WARNING: The variable IGNORE is not used. ;; When compiling (DEFUN PRINT_PROD) STYLE-WARNING: The variable CL is not used. ;; When compiling (DEFUN PRINT_CONC) STYLE-WARNING: The variable TY is not used. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-writml.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-writml.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-tml.l") (quit)'\ | gcl; else\ lisp/f-tml; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-tml.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;; When compiling (DEFUN HOL-ERR) STYLE-WARNING: The variable X is not used. ;; When compiling (DEFUN OKPASS) ;; inlining (#<@0000000004789140> # ...) ;; inlining (#<@000000000477A4C0> # ...) STYLE-WARNING: The variable ERRTOK is not used. ;; When compiling (DEFUN ML-COMPILE) STYLE-WARNING: The variable $GCPRINT is not used. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-tml.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-tml.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-lis.l") (quit)'\ | gcl; else\ lisp/f-lis; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-lis.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-lis.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-lis.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-parsol.l") (quit)'\ | gcl; else\ lisp/f-parsol; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-parsol.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;; When compiling (DEFUN OLVARINFIX) WARNING: ;; The variable HOL-VAR-BINOPS is undefined. ;; The compiler will assume this variable is a global. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parsol.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parsol.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-typeol.l") (quit)'\ | gcl; else\ lisp/f-typeol; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-typeol.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;;; Including lisp/f-ol-rec;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26837b0 ;; When compiling (DEFUN CANON-TY) WARNING: Type mismatches binding declared T variable #:PROG2267 to type NIL. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-typeol.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-typeol.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-writol.l") (quit)'\ | gcl; else\ lisp/f-writol; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-writol.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;;; Including lisp/f-ol-rec;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26837b0 ;;; Including lisp/genmacs;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/genmacs.o 0x2686f60 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-writol.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-writol.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-thyfns.l") (quit)'\ | gcl; else\ lisp/f-thyfns; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-thyfns.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;;; Including lisp/f-ol-rec;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26837b0 ;; When compiling (DEFUN OPEN-THY-FILE) ;; inlining (#<@0000000004D24800> # ...) ;; inlining (#<@0000000004D157A0> # ...) STYLE-WARNING: The variable ERTOK is not used. ;; When compiling (DEFUN THY-READ) ;; inlining (#<@0000000004D6B890> # ...) ;; inlining (#<@0000000004D5C530> # ...) STYLE-WARNING: The variable ERTOK is not used. ;; When compiling (DEFUN GET-PARENT) STYLE-WARNING: The variable PARDATA is not used. ;; When compiling (DEFUN UNLOAD-THEORY) STYLE-WARNING: The variable TOK is not used. ;; When compiling (DEFUN WRITE-THY-FILE) STYLE-WARNING: The variable $GCPRINT is not used. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-thyfns.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-thyfns.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-freadth.l") (quit)'\ | gcl; else\ touch lisp/f-freadth.o; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-freadth.l. ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a00 ;; When compiling (DEFUN THY-READ) ;; inlining (#<@0000000004448F70> # ...) ;; inlining (#<@0000000004439C10> # ...) STYLE-WARNING: The variable ERTOK is not used. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-freadth.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-freadth.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-ol-syntax.l") (quit)'\ | gcl; else\ lisp/f-ol-syntax; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-ol-syntax.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;;; Including lisp/f-ol-rec;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26837b0 ;; When compiling (DEFUN Q-MK_EQUIV) ;; inlining (#<@000000000447BA20> # ...) ;; inlining (#<@0000000004471880> # ...) STYLE-WARNING: The variable TOK is not used. ;; When compiling (DEFUN Q-MK_INEQUIV) ;; inlining (#<@000000000448D9C0> # ...) ;; inlining (#<@0000000004484720> # ...) STYLE-WARNING: The variable TOK is not used. ;; When compiling (DEFUN Q-MK_COMB) WARNING: Type mismatches binding declared T variable #:PROG2267 to type NIL. ;; When compiling (DEFUN ML-MK_COMB) ;; inlining (#<@0000000005034B40> # ...) ;; inlining (#<@000000000502B8A0> # ...) STYLE-WARNING: The variable TOK is not used. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-syntax.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-syntax.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-subst.l") (quit)'\ | gcl; else\ lisp/f-subst; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-subst.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;;; Including lisp/f-ol-rec;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26837b0 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-subst.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-subst.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-inst.l") (quit)'\ | gcl; else\ lisp/f-inst; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-inst.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;;; Including lisp/f-ol-rec;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26837b0 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-inst.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-inst.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-simpl.l") (quit)'\ | gcl; else\ lisp/f-simpl; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-simpl.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;;; Including lisp/f-ol-rec;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26837b0 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-simpl.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-simpl.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/f-ol-net.l") (quit)'\ | gcl; else\ lisp/f-ol-net; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/f-ol-net.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;;; Including lisp/f-ol-rec;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26837b0 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-net.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-net.o" NIL NIL >echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/mk-ml")'\ '(load "lisp/mk-hol-lcf")'\ '(setq %system-name "HOL-LCF")'\ '(setq %liszt "")'\ '(setq %version "2.02 (GCL)")'\ '(set-make)'\ '(tml)'\ 'compile(`ml/ml-curry`,true);;'\ 'quit();;'\ | gcl GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/mk-ml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/mk-ml.o 0x2678010 ;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x267cfc0 ;; Finished loading "lisp/f-cl" ;; Loading "lisp/f-system" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-system.o 0x26869b0 ;; Finished loading "lisp/f-system" ;; Loading "lisp/f-constants" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2689a30 ;; Finished loading "lisp/f-constants" ;; Loading "lisp/f-site" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-site.o 0x2689a80 ;; Finished loading "lisp/f-site" ;; Loading "lisp/f-gp" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-gp.o 0x2689d50 ;; Finished loading "lisp/f-gp" ;; Loading "lisp/f-parser" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parser.o 0x268beb0 ;; Finished loading "lisp/f-parser" ;; Loading "lisp/f-parsml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parsml.o 0x2693050 ;; Finished loading "lisp/f-parsml" ;; Loading "lisp/f-mlprin" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-mlprin.o 0x269c2c0 ;; Finished loading "lisp/f-mlprin" ;; Loading "lisp/f-typeml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-typeml.o 0x26a19c0 ;; Finished loading "lisp/f-typeml" ;; Loading "lisp/f-dml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-dml.o 0x26afcb0 ;; Finished loading "lisp/f-dml" ;; Loading "lisp/f-format" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-format.o 0x26b3660 ;; Finished loading "lisp/f-format" ;; Loading "lisp/f-tran" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-tran.o 0x26b66a0 ;; Finished loading "lisp/f-tran" ;; Loading "lisp/f-iox-stand" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-iox-stand.o 0x26c4dc0 ;; Finished loading "lisp/f-iox-stand" ;; Loading "lisp/f-writml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-writml.o 0x26c8270 ;; Finished loading "lisp/f-writml" ;; Loading "lisp/f-tml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-tml.o 0x26cbee0 ;; Finished loading "lisp/f-tml" ;; Loading "lisp/f-lis" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-lis.o 0x26daaa0 ;; Finished loading "lisp/f-lis" ;; Loading "lisp/f-ol-rec" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26dbfb0 ;; Finished loading "lisp/f-ol-rec" ;; Loading "lisp/f-help" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-help.o 0x26df760 ;; Finished loading "lisp/f-help" ;; Finished loading "lisp/mk-ml" 20392 >;; Loading "lisp/mk-hol-lcf" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/mk-hol-lcf.o 0x26e0080 ;; Loading "lisp/f-parsol" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parsol.o 0x26e3830 ;; Finished loading "lisp/f-parsol" ;; Loading "lisp/f-typeol" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-typeol.o 0x26e8180 ;; Finished loading "lisp/f-typeol" ;; Loading "lisp/f-help" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-help.o 0x26ec890 ;; Finished loading "lisp/f-help" ;; Loading "lisp/f-format" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-format.o 0x26ed1b0 ;; Finished loading "lisp/f-format" ;; Loading "lisp/f-writol" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-writol.o 0x26f01f0 ;; Finished loading "lisp/f-writol" ;; Loading "lisp/f-thyfns" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-thyfns.o 0x26f6220 ;; Finished loading "lisp/f-thyfns" ;; Loading "lisp/f-freadth" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-freadth.o 0x2706530 lisp/f-freadth.l is redefining function THY-READ ;; Finished loading "lisp/f-freadth" ;; Loading "lisp/f-ol-syntax" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-syntax.o 0x2709620 ;; Finished loading "lisp/f-ol-syntax" ;; Loading "lisp/f-subst" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-subst.o 0x2711c80 ;; Finished loading "lisp/f-subst" ;; Loading "lisp/f-inst" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-inst.o 0x27189a0 ;; Finished loading "lisp/f-inst" ;; Loading "lisp/f-simpl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-simpl.o 0x2720380 ;; Finished loading "lisp/f-simpl" ;; Loading "lisp/f-ol-net" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-net.o 0x27226b0 ;; Finished loading "lisp/f-ol-net" ;; Finished loading "lisp/mk-hol-lcf" 14248 > "HOL-LCF" > "" > "2.02 (GCL)" > NIL > HOL-LCF version 2.02 (GCL) created 25/8/25 # mem = - : (* -> * list -> bool) map = - : ((* -> **) -> * list -> ** list) exists = - : ((* -> bool) -> * list -> bool) forall = - : ((* -> bool) -> * list -> bool) find = - : ((* -> bool) -> * list -> *) tryfind = - : ((* -> **) -> * list -> **) filter = - : ((* -> bool) -> * list -> * list) mapfilter = - : ((* -> **) -> * list -> ** list) rev_itlist = - : ((* -> ** -> **) -> * list -> ** -> **) compiling = false : bool compiling_stack = [] : bool list load = - : ((string # bool) -> void) compile = - : ((string # bool) -> void) Calling Lisp compiler File ml/ml-curry compiled () : void #echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/mk-ml")'\ '(load "lisp/mk-hol-lcf")'\ '(setq %system-name "HOL-LCF")'\ '(setq %liszt "")'\ '(setq %version "2.02 (GCL)")'\ '(set-make)'\ '(tml)'\ 'load(`ml/ml-curry`,false);;'\ 'compile(`ml/lis`,true);;'\ 'quit();;'\ | gcl GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/mk-ml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/mk-ml.o 0x2678010 ;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x267cfc0 ;; Finished loading "lisp/f-cl" ;; Loading "lisp/f-system" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-system.o 0x26869b0 ;; Finished loading "lisp/f-system" ;; Loading "lisp/f-constants" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2689a30 ;; Finished loading "lisp/f-constants" ;; Loading "lisp/f-site" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-site.o 0x2689a80 ;; Finished loading "lisp/f-site" ;; Loading "lisp/f-gp" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-gp.o 0x2689d50 ;; Finished loading "lisp/f-gp" ;; Loading "lisp/f-parser" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parser.o 0x268beb0 ;; Finished loading "lisp/f-parser" ;; Loading "lisp/f-parsml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parsml.o 0x2693050 ;; Finished loading "lisp/f-parsml" ;; Loading "lisp/f-mlprin" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-mlprin.o 0x269c2c0 ;; Finished loading "lisp/f-mlprin" ;; Loading "lisp/f-typeml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-typeml.o 0x26a19c0 ;; Finished loading "lisp/f-typeml" ;; Loading "lisp/f-dml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-dml.o 0x26afcb0 ;; Finished loading "lisp/f-dml" ;; Loading "lisp/f-format" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-format.o 0x26b3660 ;; Finished loading "lisp/f-format" ;; Loading "lisp/f-tran" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-tran.o 0x26b66a0 ;; Finished loading "lisp/f-tran" ;; Loading "lisp/f-iox-stand" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-iox-stand.o 0x26c4dc0 ;; Finished loading "lisp/f-iox-stand" ;; Loading "lisp/f-writml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-writml.o 0x26c8270 ;; Finished loading "lisp/f-writml" ;; Loading "lisp/f-tml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-tml.o 0x26cbee0 ;; Finished loading "lisp/f-tml" ;; Loading "lisp/f-lis" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-lis.o 0x26daaa0 ;; Finished loading "lisp/f-lis" ;; Loading "lisp/f-ol-rec" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26dbfb0 ;; Finished loading "lisp/f-ol-rec" ;; Loading "lisp/f-help" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-help.o 0x26df760 ;; Finished loading "lisp/f-help" ;; Finished loading "lisp/mk-ml" 20392 >;; Loading "lisp/mk-hol-lcf" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/mk-hol-lcf.o 0x26e0080 ;; Loading "lisp/f-parsol" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parsol.o 0x26e3830 ;; Finished loading "lisp/f-parsol" ;; Loading "lisp/f-typeol" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-typeol.o 0x26e8180 ;; Finished loading "lisp/f-typeol" ;; Loading "lisp/f-help" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-help.o 0x26ec890 ;; Finished loading "lisp/f-help" ;; Loading "lisp/f-format" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-format.o 0x26ed1b0 ;; Finished loading "lisp/f-format" ;; Loading "lisp/f-writol" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-writol.o 0x26f01f0 ;; Finished loading "lisp/f-writol" ;; Loading "lisp/f-thyfns" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-thyfns.o 0x26f6220 ;; Finished loading "lisp/f-thyfns" ;; Loading "lisp/f-freadth" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-freadth.o 0x2706530 lisp/f-freadth.l is redefining function THY-READ ;; Finished loading "lisp/f-freadth" ;; Loading "lisp/f-ol-syntax" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-syntax.o 0x2709620 ;; Finished loading "lisp/f-ol-syntax" ;; Loading "lisp/f-subst" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-subst.o 0x2711c80 ;; Finished loading "lisp/f-subst" ;; Loading "lisp/f-inst" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-inst.o 0x27189a0 ;; Finished loading "lisp/f-inst" ;; Loading "lisp/f-simpl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-simpl.o 0x2720380 ;; Finished loading "lisp/f-simpl" ;; Loading "lisp/f-ol-net" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-net.o 0x27226b0 ;; Finished loading "lisp/f-ol-net" ;; Finished loading "lisp/mk-hol-lcf" 14248 > "HOL-LCF" > "" > "2.02 (GCL)" > NIL > HOL-LCF version 2.02 (GCL) created 25/8/25 #;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/ml/ml-curry_ml.o 0x27254a0 .............() : void append = - : (* list -> * list -> * list) itlist = - : ((* -> ** -> **) -> * list -> ** -> **) end_itlist = - : ((* -> * -> *) -> * list -> *) assoc = - : (* -> (* # **) list -> (* # **)) rev_assoc = - : (* -> (** # *) list -> (** # *)) intersect = - : (* list -> * list -> * list) subtract = - : (* list -> * list -> * list) union = - : (* list -> * list -> * list) setify = - : (* list -> * list) split = - : ((* # **) list -> (* list # ** list)) combine = - : ((* list # ** list) -> (* # **) list) () : void com = - : ((* list # ** list) -> (* # **) list) distinct = - : (* list -> bool) chop_list = - : (int -> * list -> (* list # * list)) last = - : (* list -> *) butlast = - : (* list -> * list) partition = - : ((* -> bool) -> * list -> (* list # * list)) replicate = - : (* -> int -> * list) sort = - : (((* # *) -> bool) -> * list -> * list) splitp = - : ((* -> bool) -> * list -> (* list # * list)) remove = - : ((* -> bool) -> * list -> (* # * list)) Calling Lisp compiler File ml/lis compiled () : void #echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/mk-ml")'\ '(load "lisp/mk-hol-lcf")'\ '(setq %system-name "HOL-LCF")'\ '(setq %liszt "")'\ '(setq %version "2.02 (GCL)")'\ '(set-make)'\ '(tml)'\ 'load(`ml/ml-curry`,false);;'\ 'load(`ml/lis`,false);;'\ 'compile(`ml/gen`,true);;'\ 'quit();;'\ | gcl GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/mk-ml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/mk-ml.o 0x2678010 ;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x267cfc0 ;; Finished loading "lisp/f-cl" ;; Loading "lisp/f-system" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-system.o 0x26869b0 ;; Finished loading "lisp/f-system" ;; Loading "lisp/f-constants" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2689a30 ;; Finished loading "lisp/f-constants" ;; Loading "lisp/f-site" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-site.o 0x2689a80 ;; Finished loading "lisp/f-site" ;; Loading "lisp/f-gp" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-gp.o 0x2689d50 ;; Finished loading "lisp/f-gp" ;; Loading "lisp/f-parser" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parser.o 0x268beb0 ;; Finished loading "lisp/f-parser" ;; Loading "lisp/f-parsml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parsml.o 0x2693050 ;; Finished loading "lisp/f-parsml" ;; Loading "lisp/f-mlprin" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-mlprin.o 0x269c2c0 ;; Finished loading "lisp/f-mlprin" ;; Loading "lisp/f-typeml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-typeml.o 0x26a19c0 ;; Finished loading "lisp/f-typeml" ;; Loading "lisp/f-dml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-dml.o 0x26afcb0 ;; Finished loading "lisp/f-dml" ;; Loading "lisp/f-format" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-format.o 0x26b3660 ;; Finished loading "lisp/f-format" ;; Loading "lisp/f-tran" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-tran.o 0x26b66a0 ;; Finished loading "lisp/f-tran" ;; Loading "lisp/f-iox-stand" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-iox-stand.o 0x26c4dc0 ;; Finished loading "lisp/f-iox-stand" ;; Loading "lisp/f-writml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-writml.o 0x26c8270 ;; Finished loading "lisp/f-writml" ;; Loading "lisp/f-tml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-tml.o 0x26cbee0 ;; Finished loading "lisp/f-tml" ;; Loading "lisp/f-lis" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-lis.o 0x26daaa0 ;; Finished loading "lisp/f-lis" ;; Loading "lisp/f-ol-rec" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26dbfb0 ;; Finished loading "lisp/f-ol-rec" ;; Loading "lisp/f-help" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-help.o 0x26df760 ;; Finished loading "lisp/f-help" ;; Finished loading "lisp/mk-ml" 20392 >;; Loading "lisp/mk-hol-lcf" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/mk-hol-lcf.o 0x26e0080 ;; Loading "lisp/f-parsol" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parsol.o 0x26e3830 ;; Finished loading "lisp/f-parsol" ;; Loading "lisp/f-typeol" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-typeol.o 0x26e8180 ;; Finished loading "lisp/f-typeol" ;; Loading "lisp/f-help" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-help.o 0x26ec890 ;; Finished loading "lisp/f-help" ;; Loading "lisp/f-format" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-format.o 0x26ed1b0 ;; Finished loading "lisp/f-format" ;; Loading "lisp/f-writol" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-writol.o 0x26f01f0 ;; Finished loading "lisp/f-writol" ;; Loading "lisp/f-thyfns" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-thyfns.o 0x26f6220 ;; Finished loading "lisp/f-thyfns" ;; Loading "lisp/f-freadth" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-freadth.o 0x2706530 lisp/f-freadth.l is redefining function THY-READ ;; Finished loading "lisp/f-freadth" ;; Loading "lisp/f-ol-syntax" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-syntax.o 0x2709620 ;; Finished loading "lisp/f-ol-syntax" ;; Loading "lisp/f-subst" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-subst.o 0x2711c80 ;; Finished loading "lisp/f-subst" ;; Loading "lisp/f-inst" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-inst.o 0x27189a0 ;; Finished loading "lisp/f-inst" ;; Loading "lisp/f-simpl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-simpl.o 0x2720380 ;; Finished loading "lisp/f-simpl" ;; Loading "lisp/f-ol-net" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-net.o 0x27226b0 ;; Finished loading "lisp/f-ol-net" ;; Finished loading "lisp/mk-hol-lcf" 14248 > "HOL-LCF" > "" > "2.02 (GCL)" > NIL > HOL-LCF version 2.02 (GCL) created 25/8/25 #;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/ml/ml-curry_ml.o 0x27254a0 .............() : void ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/ml/lis_ml.o 0x2727c60 ......................() : void words2 = - : (string -> string -> string list) words = - : (string -> string list) maptok = - : ((string -> *) -> string -> * list) loadt = - : (string -> void) loadf = - : (string -> void) compilet = - : (string -> void) compilef = - : (string -> void) concat = - : (string -> string -> string) concatl = - : (string list -> string) () : void ^ = - : (string -> string -> string) message = - : (string -> void) () : void () : void () : void () : void o = - : (((* -> **) # (*** -> *)) -> *** -> **) CB = - : ((* -> **) -> (** -> ***) -> * -> ***) # = - : (((* -> **) # (*** -> ****)) -> (* # ***) -> (** # ****)) oo = - : ((((* # **) -> ***) # (**** -> *) # (**** -> **)) -> **** -> ***) I = - : (* -> *) K = - : (* -> ** -> *) KI = - : (* -> ** -> **) C = - : ((* -> ** -> ***) -> ** -> * -> ***) W = - : ((* -> * -> **) -> * -> **) B = - : ((* -> **) -> (*** -> *) -> *** -> **) S = - : ((* -> ** -> ***) -> (* -> **) -> * -> ***) () : void Co = - : (((* -> ** -> ***) # (**** -> *)) -> ** -> **** -> ***) pair = - : (* -> ** -> (* # **)) curry = - : (((* # **) -> ***) -> * -> ** -> ***) can = - : ((* -> **) -> * -> bool) assert = - : ((* -> bool) -> * -> *) syserror = - : (string -> *) set_fail_prefix = - : (string -> (* -> **) -> * -> **) set_fail = - : (string -> (* -> **) -> * -> **) funpow = - : (int -> (* -> *) -> * -> *) () : void install = - : (string -> void) Calling Lisp compiler File ml/gen compiled () : void #sed -e "s;ml/;/build/reproducible-path/hol88-2.02.19940316dfsg/ml/;g" \ -e "s;lisp/;/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/;g" ml/site.ml.orig > ml/site.ml echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/mk-ml")'\ '(load "lisp/mk-hol-lcf")'\ '(setq %system-name "HOL-LCF")'\ '(setq %liszt "")'\ '(setq %version "2.02 (GCL)")'\ '(set-make)'\ '(tml)'\ 'compile(`ml/site`,true);;'\ 'quit();;'\ | gcl GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/mk-ml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/mk-ml.o 0x2678010 ;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x267cfc0 ;; Finished loading "lisp/f-cl" ;; Loading "lisp/f-system" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-system.o 0x26869b0 ;; Finished loading "lisp/f-system" ;; Loading "lisp/f-constants" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2689a30 ;; Finished loading "lisp/f-constants" ;; Loading "lisp/f-site" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-site.o 0x2689a80 ;; Finished loading "lisp/f-site" ;; Loading "lisp/f-gp" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-gp.o 0x2689d50 ;; Finished loading "lisp/f-gp" ;; Loading "lisp/f-parser" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parser.o 0x268beb0 ;; Finished loading "lisp/f-parser" ;; Loading "lisp/f-parsml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parsml.o 0x2693050 ;; Finished loading "lisp/f-parsml" ;; Loading "lisp/f-mlprin" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-mlprin.o 0x269c2c0 ;; Finished loading "lisp/f-mlprin" ;; Loading "lisp/f-typeml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-typeml.o 0x26a19c0 ;; Finished loading "lisp/f-typeml" ;; Loading "lisp/f-dml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-dml.o 0x26afcb0 ;; Finished loading "lisp/f-dml" ;; Loading "lisp/f-format" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-format.o 0x26b3660 ;; Finished loading "lisp/f-format" ;; Loading "lisp/f-tran" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-tran.o 0x26b66a0 ;; Finished loading "lisp/f-tran" ;; Loading "lisp/f-iox-stand" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-iox-stand.o 0x26c4dc0 ;; Finished loading "lisp/f-iox-stand" ;; Loading "lisp/f-writml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-writml.o 0x26c8270 ;; Finished loading "lisp/f-writml" ;; Loading "lisp/f-tml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-tml.o 0x26cbee0 ;; Finished loading "lisp/f-tml" ;; Loading "lisp/f-lis" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-lis.o 0x26daaa0 ;; Finished loading "lisp/f-lis" ;; Loading "lisp/f-ol-rec" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26dbfb0 ;; Finished loading "lisp/f-ol-rec" ;; Loading "lisp/f-help" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-help.o 0x26df760 ;; Finished loading "lisp/f-help" ;; Finished loading "lisp/mk-ml" 20392 >;; Loading "lisp/mk-hol-lcf" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/mk-hol-lcf.o 0x26e0080 ;; Loading "lisp/f-parsol" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parsol.o 0x26e3830 ;; Finished loading "lisp/f-parsol" ;; Loading "lisp/f-typeol" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-typeol.o 0x26e8180 ;; Finished loading "lisp/f-typeol" ;; Loading "lisp/f-help" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-help.o 0x26ec890 ;; Finished loading "lisp/f-help" ;; Loading "lisp/f-format" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-format.o 0x26ed1b0 ;; Finished loading "lisp/f-format" ;; Loading "lisp/f-writol" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-writol.o 0x26f01f0 ;; Finished loading "lisp/f-writol" ;; Loading "lisp/f-thyfns" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-thyfns.o 0x26f6220 ;; Finished loading "lisp/f-thyfns" ;; Loading "lisp/f-freadth" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-freadth.o 0x2706530 lisp/f-freadth.l is redefining function THY-READ ;; Finished loading "lisp/f-freadth" ;; Loading "lisp/f-ol-syntax" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-syntax.o 0x2709620 ;; Finished loading "lisp/f-ol-syntax" ;; Loading "lisp/f-subst" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-subst.o 0x2711c80 ;; Finished loading "lisp/f-subst" ;; Loading "lisp/f-inst" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-inst.o 0x27189a0 ;; Finished loading "lisp/f-inst" ;; Loading "lisp/f-simpl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-simpl.o 0x2720380 ;; Finished loading "lisp/f-simpl" ;; Loading "lisp/f-ol-net" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-net.o 0x27226b0 ;; Finished loading "lisp/f-ol-net" ;; Finished loading "lisp/mk-hol-lcf" 14248 > "HOL-LCF" > "" > "2.02 (GCL)" > NIL > HOL-LCF version 2.02 (GCL) created 25/8/25 # concat = - : (string -> string -> string) ml_dir_pathname = `/build/reproducible-path/hol88-2.02.19940316dfsg/ml/` : string lisp_dir_pathname = `/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/` : string Calling Lisp compiler File ml/site compiled () : void #echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/mk-ml")'\ '(load "lisp/mk-hol-lcf")'\ '(setq %version "2.02 (GCL)")'\ '(set-make)'\ '(tml)'\ 'load(`ml/site`,false);;'\ 'load(`ml/ml-curry`,false);;'\ 'load(`ml/lis`,false);;'\ 'load(`ml/gen`,false);;'\ 'load(`ml/killpp`,false);;'\ 'lisp `(setq %system-name "HOL-LCF")`;;'\ 'lisp `(setq %liszt "")`;;'\ 'lisp `(setup)`;;' >foo echo '#+native-reloc(progn (load "foo")(ml-save "hol-lcf"))#-native-reloc(let ((si::*collect-binary-modules* t)(si::*binary-modules* nil)) (load "foo")(compiler::link (remove-duplicates si::*binary-modules* :test (function equal)) "hol-lcf" "(load \"debian/gcl_patch.l\")(load \"foo\")(ml-save \"hol-lcf\")" "" nil)(with-open-file (s "bm.l" :direction :output) (prin1 si::*binary-modules* s)))(quit)' | gcl GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "foo" ;; Loading "lisp/mk-ml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/mk-ml.o 0x2678010 ;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x267cfc0 ;; Finished loading "lisp/f-cl" ;; Loading "lisp/f-system" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-system.o 0x26869b0 ;; Finished loading "lisp/f-system" ;; Loading "lisp/f-constants" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2689a30 ;; Finished loading "lisp/f-constants" ;; Loading "lisp/f-site" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-site.o 0x2689a80 ;; Finished loading "lisp/f-site" ;; Loading "lisp/f-gp" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-gp.o 0x2689d50 ;; Finished loading "lisp/f-gp" ;; Loading "lisp/f-parser" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parser.o 0x268beb0 ;; Finished loading "lisp/f-parser" ;; Loading "lisp/f-parsml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parsml.o 0x2693050 ;; Finished loading "lisp/f-parsml" ;; Loading "lisp/f-mlprin" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-mlprin.o 0x269c2c0 ;; Finished loading "lisp/f-mlprin" ;; Loading "lisp/f-typeml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-typeml.o 0x26a19c0 ;; Finished loading "lisp/f-typeml" ;; Loading "lisp/f-dml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-dml.o 0x26afcb0 ;; Finished loading "lisp/f-dml" ;; Loading "lisp/f-format" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-format.o 0x26b3660 ;; Finished loading "lisp/f-format" ;; Loading "lisp/f-tran" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-tran.o 0x26b66a0 ;; Finished loading "lisp/f-tran" ;; Loading "lisp/f-iox-stand" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-iox-stand.o 0x26c4dc0 ;; Finished loading "lisp/f-iox-stand" ;; Loading "lisp/f-writml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-writml.o 0x26c8270 ;; Finished loading "lisp/f-writml" ;; Loading "lisp/f-tml" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-tml.o 0x26cbee0 ;; Finished loading "lisp/f-tml" ;; Loading "lisp/f-lis" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-lis.o 0x26daaa0 ;; Finished loading "lisp/f-lis" ;; Loading "lisp/f-ol-rec" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26dbfb0 ;; Finished loading "lisp/f-ol-rec" ;; Loading "lisp/f-help" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-help.o 0x26df760 ;; Finished loading "lisp/f-help" ;; Finished loading "lisp/mk-ml" ;; Loading "lisp/mk-hol-lcf" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/mk-hol-lcf.o 0x26e0080 ;; Loading "lisp/f-parsol" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-parsol.o 0x26e3830 ;; Finished loading "lisp/f-parsol" ;; Loading "lisp/f-typeol" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-typeol.o 0x26e8180 ;; Finished loading "lisp/f-typeol" ;; Loading "lisp/f-help" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-help.o 0x26ec890 ;; Finished loading "lisp/f-help" ;; Loading "lisp/f-format" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-format.o 0x26ed1b0 ;; Finished loading "lisp/f-format" ;; Loading "lisp/f-writol" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-writol.o 0x26f01f0 ;; Finished loading "lisp/f-writol" ;; Loading "lisp/f-thyfns" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-thyfns.o 0x26f6220 ;; Finished loading "lisp/f-thyfns" ;; Loading "lisp/f-freadth" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-freadth.o 0x2706530 lisp/f-freadth.l is redefining function THY-READ ;; Finished loading "lisp/f-freadth" ;; Loading "lisp/f-ol-syntax" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-syntax.o 0x2709620 ;; Finished loading "lisp/f-ol-syntax" ;; Loading "lisp/f-subst" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-subst.o 0x2711c80 ;; Finished loading "lisp/f-subst" ;; Loading "lisp/f-inst" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-inst.o 0x27189a0 ;; Finished loading "lisp/f-inst" ;; Loading "lisp/f-simpl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-simpl.o 0x2720380 ;; Finished loading "lisp/f-simpl" ;; Loading "lisp/f-ol-net" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-net.o 0x27226b0 ;; Finished loading "lisp/f-ol-net" ;; Finished loading "lisp/mk-hol-lcf" version 2.02 (GCL) created 25/8/25 #;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/ml/site_ml.o 0x27254a0 ...() : void ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/ml/ml-curry_ml.o 0x2725d10 .............() : void ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/ml/lis_ml.o 0x27284d0 ......................() : void ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/ml/gen_ml.o 0x272ea00 ..................................() : void ............() : void #() : void () : void () : void #;; Finished loading "foo" =======> hol-lcf made if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/genfns.l") (quit)'\ | gcl; else\ lisp/genfns; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/genfns.l. ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a00 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/genfns.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/genfns.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/gnt.l") (quit)'\ | gcl; else\ lisp/gnt; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/gnt.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;;; Including lisp/f-ol-rec;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26837b0 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/gnt.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/gnt.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/hol-pars.l") (quit)'\ | gcl; else\ lisp/hol-pars; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/hol-pars.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;;; Including lisp/f-ol-rec;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26837b0 ;;; Including lisp/genmacs;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/genmacs.o 0x2686f60 ;; When compiling (DEFUN LAMQ-RTN) STYLE-WARNING: The variable CONSTR is not used. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/hol-pars.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/hol-pars.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/parslist.l") (quit)'\ | gcl; else\ lisp/parslist; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/parslist.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;;; Including lisp/f-ol-rec;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26837b0 ;;; Including lisp/genmacs;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/genmacs.o 0x2686f60 ;; When compiling (DEFUN HOL-SCOLONSETUP) WARNING: ;; The variable %HOL-LIST-DEPTH is undefined. ;; The compiler will assume this variable is a global. ;; When compiling (DEFUN ML-DEFINE_FINITE_SET_SYNTAX) WARNING: ;; The variable |%print_set-flag| is undefined. ;; The compiler will assume this variable is a global. STYLE-WARNING: The variable SET-PROP is not used. ;; When compiling (DEFUN ML-DEFINE_SET_ABSTRACTION_SYNTAX) STYLE-WARNING: The variable SET-PROP is not used. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/parslist.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/parslist.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/parslet.l") (quit)'\ | gcl; else\ lisp/parslet; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/parslet.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;;; Including lisp/f-ol-rec;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26837b0 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/parslet.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/parslet.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/constp.l") (quit)'\ | gcl; else\ lisp/constp; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/constp.l. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/constp.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/constp.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/hol-writ.l") (quit)'\ | gcl; else\ lisp/hol-writ; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/hol-writ.l. ;;; Including lisp/f-constants;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-constants.o 0x2681a00 ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a50 ;;; Including lisp/f-ol-rec;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x26837b0 ;;; Including lisp/genmacs;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/genmacs.o 0x2686f60 ;; When compiling (DEFUN PRINT-TM) WARNING: ;; The variable HOL-VAR-BINOPS is undefined. ;; The compiler will assume this variable is a global. ;; When compiling (DEFUN IS-OL-SET-CONS) WARNING: ;; The variable %FINITE-SET-CONSTRUCTOR is undefined. ;; The compiler will assume this variable is a global. ;; When compiling (DEFUN PREP-OL-SET-ABSTRACTION) WARNING: ;; The variable %SET-ABSTRACTION-CONSTRUCTOR is undefined. ;; The compiler will assume this variable is a global. ;; When compiling (DEFUN PREP-OL-QUANT) STYLE-WARNING: The variable TY is not used. ;; When compiling (DEFUN PREP-OL-RESTRICT) STYLE-WARNING: The variable TY is not used. ;; When compiling (DEFUN PREP-OL-UNOP) STYLE-WARNING: The variable TY is not used. ;; When compiling (DEFUN PREP-OL-BINOP) STYLE-WARNING: The variable TY is not used. ;; When compiling (DEFUN ML-PRINT_THM) ;; inlining (#<@00000000068713A0> # ...) ;; inlining (#<@000000000686EF20> # ...) ;; inlining (SYSTEM::LMAP # ...) ;; inlining (SYSTEM::LMAPR # ...) ;; inlining (MAPL # ...) ;; inlining (MAPC # ...) STYLE-WARNING: The variable X is not used. ;; When compiling (DEFUN ML-PRINT_THM) WARNING: ;; The variable %MARGIN is undefined. ;; The compiler will assume this variable is a global. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/hol-writ.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/hol-writ.o" NIL NIL >if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/mk_pp_thm.l") (quit)'\ | gcl; else\ lisp/mk_pp_thm; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/mk_pp_thm.l. ;;; Including lisp/f-macro;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-macro.o 0x2681a00 ;;; Including lisp/f-ol-rec;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-ol-rec.o 0x2683760 ;;; Including lisp/genmacs;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/genmacs.o 0x2686f10 ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/mk_pp_thm.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/mk_pp_thm.o" NIL NIL >cd /build/reproducible-path/hol88-2.02.19940316dfsg/theories; rm -f PPLAMB.th;\ /build/reproducible-path/hol88-2.02.19940316dfsg/hol-lcf < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_PPLAMB.ml;\ cd /build/reproducible-path/hol88-2.02.19940316dfsg HOL-LCF version 2.02 (GCL) created 25/8/25 ###########################() : void ##() : void ##() : void ##=======> theory PPLAMB built cd /build/reproducible-path/hol88-2.02.19940316dfsg/theories; rm -f bool.th;\ /build/reproducible-path/hol88-2.02.19940316dfsg/hol-lcf < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_bool.ml;\ cd /build/reproducible-path/hol88-2.02.19940316dfsg HOL-LCF version 2.02 (GCL) created 25/8/25 ################################################################################################() : void ##Theory PPLAMB loaded () : void ##() : void ##() : void ##() : void #####|-"HOL_ASSERT $= = $=" : thm ### () : void () : void () : void () : void () : void () : void () : void () : void ........() : void ...................................................................................................................................() : void File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/hol-in-out loaded () : void ###() : void ##() : void ##() : void ##() : void ##############() : void ##|- T = ((\x. x) = (\x. x)) ##() : void ##|- $! = (\P. P = (\x. T)) ###########|- $? = (\P. P($@ P)) ##() : void ##|- $/\ = (\t1 t2. !t. (t1 ==> t2 ==> t) ==> t) ##() : void ##|- $\/ = (\t1 t2. !t. (t1 ==> t) ==> (t2 ==> t) ==> t) ############|- F = (!t. t) ##() : void ##|- $~ = (\t. t ==> F) ##() : void ####|- $?! = (\P. $? P /\ (!x y. P x /\ P y ==> (x = y))) ##|- LET = (\f x. f x) ###|- COND = (\t t1 t2. @x. ((t = T) ==> (x = t1)) /\ ((t = F) ==> (x = t2))) #######|- !P B. RES_FORALL P B = (!x. P x ==> B x) ###|- !P B. RES_EXISTS P B = (?x. P x /\ B x) ###|- !P B. RES_SELECT P B = (@x. P x /\ B x) ###|- ARB = (@x. T) ###|- !P B. RES_ABSTRACT P B = (\x. (P x => B x | ARB)) ###########|- !f. ONE_ONE f = (!x1 x2. (f x1 = f x2) ==> (x1 = x2)) ###|- !f. ONTO f = (!y. ?x. y = f x) ###############[|- !t. (t = T) \/ (t = F); |- !t1 t2. (t1 ==> t2) ==> (t2 ==> t1) ==> (t1 = t2); |- !t. (\x. t x) = t; |- !P x. P x ==> P($@ P)] : thm list #########|- !t1 t2. t1 IS_ASSUMPTION_OF t2 = t1 ==> t2 ##########|- !P rep. TYPE_DEFINITION P rep = (!x' x''. (rep x' = rep x'') ==> (x' = x'')) /\ (!x. P x = (?x'. x = rep x')) ######MK_PAIR_DEF = |- !x y. MK_PAIR x y = (\a b. (a = x) /\ (b = y)) ###IS_PAIR_DEF = |- !p. IS_PAIR p = (?x y. p = MK_PAIR x y) #########################################PAIR_EXISTS = |- ?p. IS_PAIR p ####|- ?rep. TYPE_DEFINITION IS_PAIR rep ###########|- REP_prod = (@rep. (!p' p''. (rep p' = rep p'') ==> (p' = p'')) /\ (!p. IS_PAIR p = (?p'. p = rep p'))) ##() : void ###|- !x y. x,y = (@p. REP_prod p = MK_PAIR x y) ###|- !p. FST p = (@x. ?y. MK_PAIR x y = REP_prod p) ###|- !p. SND p = (@y. ?x. MK_PAIR x y = REP_prod p) ##########[|- !x. FST x,SND x = x; |- !x y. FST(x,y) = x; |- !x y. SND(x,y) = y] : thm list #############################PAIR_EQ = |- !x y a b. (x,y = a,b) = (x = a) /\ (y = b) #####|- !f x y. UNCURRY f(x,y) = f x y ###|- !f x y. CURRY f x y = f(x,y) ##() : void ##=======> theory bool built cd /build/reproducible-path/hol88-2.02.19940316dfsg/theories; rm -f ind.th;\ /build/reproducible-path/hol88-2.02.19940316dfsg/hol-lcf < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_ind.ml;\ cd /build/reproducible-path/hol88-2.02.19940316dfsg HOL-LCF version 2.02 (GCL) created 25/8/25 ############################() : void ##Theory bool loaded () : void ##() : void ## () : void () : void () : void () : void () : void () : void () : void () : void ........() : void ...................................................................................................................................() : void File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/hol-in-out loaded () : void ##|- ?f. ONE_ONE f /\ ~ONTO f ##() : void ##=======> theory ind built cd /build/reproducible-path/hol88-2.02.19940316dfsg/theories; rm -f BASIC-HOL.th;\ /build/reproducible-path/hol88-2.02.19940316dfsg/hol-lcf < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_BASIC-HOL.ml;\ cd /build/reproducible-path/hol88-2.02.19940316dfsg HOL-LCF version 2.02 (GCL) created 25/8/25 ############################Theory ind loaded () : void ###.....................................................................................................................................................() : void ####.............() : void #...................................................................................() : void #............................() : void ##() : void #####() : void ##################TYPE_DEFINITION = |- !P rep. TYPE_DEFINITION P rep = (!x' x''. (rep x' = rep x'') ==> (x' = x'')) /\ (!x. P x = (?x'. x = rep x')) #############################ABS_REP_THM = |- !P. (?rep. TYPE_DEFINITION P rep) ==> (?rep abs. (!a. abs(rep a) = a) /\ (!r. P r = (rep(abs r) = r))) ###|- !P. (?rep. TYPE_DEFINITION P rep) ==> (?rep abs. (!a. abs(rep a) = a) /\ (!r. P r = (rep(abs r) = r))) ##=======> theory BASIC-HOL built echo 'compilet `ml/genfns`;;'\ 'quit();;'\ | hol-lcf HOL-LCF version 2.02 (GCL) created 25/8/25 # map2 = - : (((* # **) -> ***) -> (* list # ** list) -> *** list) itlist2 = - : (((* # **) -> *** -> ***) -> (* list # ** list) -> *** -> ***) set_equal = - : (* list -> * list -> bool) el = - : (int -> * list -> *) word_separators = [` `; ` `] : string list words = - : (string -> string list) maptok = - : ((string -> *) -> string -> * list) uncurry = - : ((* -> ** -> ***) -> (* # **) -> ***) Calling Lisp compiler File ml/genfns compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `bool`;;'\ 'lisp `(load "lisp/genfns")`;;'\ 'lisp `(load "lisp/gnt")`;;'\ 'lisp `(load "lisp/hol-pars")`;;'\ 'lisp `(load "lisp/parslist")`;;'\ 'lisp `(load "lisp/parslet")`;;'\ 'lisp `(load "lisp/constp")`;;'\ 'lisp `(load "lisp/hol-writ")`;;'\ 'lisp `(load "lisp/mk_pp_thm")`;;'\ 'compilet `ml/hol-syn`;;'\ 'quit();;'\ | hol-lcf HOL-LCF version 2.02 (GCL) created 25/8/25 #() : void Theory bool loaded () : void () : void () : void () : void () : void () : void () : void () : void () : void () : void New constructors declared: AssumeStep : (term -> step) ReflStep : (term -> step) SubstStep : (((thm # term) list # term # thm) -> step) BetaConvStep : (term -> step) AbsStep : ((term # thm) -> step) InstTypeStep : (((type # type) list # thm) -> step) DischStep : ((term # thm) -> step) MpStep : ((thm # thm) -> step) MkCombStep : ((thm # thm) -> step) MkAbsStep : (thm -> step) AlphaStep : ((term # term) -> step) AddAssumStep : ((term # thm) -> step) SymStep : (thm -> step) TransStep : ((thm # thm) -> step) ImpTransStep : ((thm # thm) -> step) ApTermStep : ((term # thm) -> step) ApThmStep : ((thm # term) -> step) EqMpStep : ((thm # thm) -> step) EqImpRuleStep : (thm -> step) SpecStep : ((term # thm) -> step) EqtIntroStep : (thm -> step) GenStep : ((term # thm) -> step) EtaConvStep : (term -> step) ExtStep : (thm -> step) ExistsStep : (((term # term) # thm) -> step) ChooseStep : (((term # thm) # thm) -> step) ImpAntisymRuleStep : ((thm # thm) -> step) MkExistsStep : (thm -> step) SubsStep : ((thm list # thm) -> step) SubsOccsStep : (((int list # thm) list # thm) -> step) SubstConvStep : (((thm # term) list # term # term) -> step) ConjStep : ((thm # thm) -> step) Conjunct1Step : (thm -> step) Conjunct2Step : (thm -> step) Disj1Step : ((thm # term) -> step) Disj2Step : ((term # thm) -> step) DisjCasesStep : ((thm # thm # thm) -> step) NotIntroStep : (thm -> step) NotElimStep : (thm -> step) ContrStep : ((term # thm) -> step) CcontrStep : ((term # thm) -> step) InstStep : (((term # term) list # thm) -> step) StoreDefinitionStep : ((string # term) -> step) DefinitionStep : ((string # string) -> step) DefExistsRuleStep : (term -> step) NewAxiomStep : ((string # term) -> step) AxiomStep : ((string # string) -> step) TheoremStep : ((string # string) -> step) NewConstantStep : ((string # type) -> step) NewTypeStep : ((int # string) -> step) NumConvStep : (term -> step) steplist = [] : step list record_proof_flag = false : bool suspended = false : bool is_recording_proof = - : (void -> bool) record_proof = - : (bool -> void) suspend_recording = - : (* -> void) resume_recording = - : (* -> void) RecordStep = - : (step -> void) get_steps = - : (void -> step list) ((-), (-), (-), (-), (-), -) : ((bool -> void) # (void -> bool) # (step -> void) # (void -> step list) # (* -> void) # (** -> void)) record_proof = - : (bool -> void) is_recording_proof = - : (void -> bool) RecordStep = - : (step -> void) get_steps = - : (void -> step list) suspend_recording = - : (* -> void) resume_recording = - : (* -> void) new_constant = - : ((string # type) -> void) arb_term = "arb" : term ARB_THM = |- $= = $= falsity = "F" : term bool_ty = ":bool" : type mk_forall = - : ((term # term) -> term) mk_exists = - : ((term # term) -> term) mk_select = - : ((term # term) -> term) mk_conj = - : ((term # term) -> term) mk_disj = - : ((term # term) -> term) mk_imp = - : ((term # term) -> term) mk_eq = - : ((term # term) -> term) mk_pair = - : ((term # term) -> term) mk_neg = - : (term -> term) dest_forall = - : (term -> (term # term)) dest_exists = - : (term -> (term # term)) dest_select = - : (term -> (term # term)) dest_conj = - : (term -> (term # term)) dest_disj = - : (term -> (term # term)) dest_eq = - : (term -> (term # term)) dest_pair = - : (term -> (term # term)) dest_imp = - : (term -> (term # term)) dest_neg = - : (term -> term) dest_neg_imp = - : (term -> (term # term)) dest_form = - : (form -> term) mk_form = - : (term -> form) mk_thm = - : ((term list # term) -> thm) dest_thm = - : (thm -> (term list # term)) hyp = - : (thm -> term list) concl = - : (thm -> term) hyp_union = - : (thm list -> term list) is_forall = - : (term -> bool) is_exists = - : (term -> bool) is_select = - : (term -> bool) is_conj = - : (term -> bool) is_disj = - : (term -> bool) is_imp = - : (term -> bool) is_eq = - : (term -> bool) is_pair = - : (term -> bool) is_neg = - : (term -> bool) is_neg_imp = - : (term -> bool) aconv = - : (term -> term -> bool) subst = - : ((term # term) list -> term -> term) subst_occs = - : (int list list -> (term # term) list -> term -> term) free_in = - : (term -> term -> bool) variant = - : (term list -> term -> term) type_in_type = - : (type -> type -> bool) type_in = - : (type -> term -> bool) inst_type = - : ((type # type) list -> type -> type) inst = - : (term list -> (type # type) list -> term -> term) match = - : (term -> term -> ((term # term) list # (type # type) list)) freesl = - : (term list -> term list) varsl = - : (term list -> term list) tyvarsl = - : (term list -> type list) thm_frees = - : (thm -> term list) disch = - : ((term # term list) -> term list) is_pred = - : (term -> bool) mk_pred = - : ((string # term) -> term) dest_pred = - : (term -> (string # term)) list_mk_abs = - : ((term list # term) -> term) list_mk_comb = - : ((term # term list) -> term) list_mk_conj = - : (term list -> term) list_mk_disj = - : (term list -> term) list_mk_imp = - : ((term list # term) -> term) list_mk_forall = - : ((term list # term) -> term) list_mk_exists = - : ((term list # term) -> term) list_mk_pair = - : (term list -> term) strip_abs = - : (term -> (term list # term)) strip_comb = - : (term -> (term # term list)) conjuncts = - : (term -> term list) disjuncts = - : (term -> term list) strip_imp = - : (term -> (term list # term)) strip_forall = - : (term -> (term list # term)) strip_exists = - : (term -> (term list # term)) strip_pair = - : (term -> term list) mk_cond = - : ((term # term # term) -> term) is_cond = - : (term -> bool) dest_cond = - : (term -> (term # term # term)) dest_let = - : (term -> (term # term)) mk_let = - : ((term # term) -> term) is_let = - : (term -> bool) mk_cons = - : ((term # term) -> term) dest_cons = - : (term -> (term # term)) is_cons = - : (term -> bool) mk_list = - : ((term list # type) -> term) dest_list = - : (term -> (term list # type)) is_list = - : (term -> bool) mk_pabs = - : ((term # term) -> term) dest_pabs = - : (term -> (term # term)) is_pabs = - : (term -> bool) lhs = - : (term -> term) rhs = - : (term -> term) find_term = - : ((term -> bool) -> term -> term) rator = - : (term -> term) rand = - : (term -> term) bndvar = - : (term -> term) body = - : (term -> term) find_terms = - : ((term -> bool) -> term -> term list) mk_primed_var = - : ((string # type) -> term) new_axiom = - : ((string # term) -> thm) new_open_axiom = - : ((string # term) -> thm) new_predicate = - : ((string # type) -> void) mk_definition = - : (term -> term) dest_definition = - : (term -> term) is_definition = - : (term -> bool) store_definition = - : ((string # term) -> thm) theorem = - : (string -> string -> thm) new_type = - : (int -> string -> void) delete_thm = - : (string -> string -> thm) pp_axiom = - : (string -> string -> thm) axiom = - : (string -> string -> thm) definition = - : (string -> string -> thm) new_infix = - : ((string # type) -> void) store_binders = - : (term list -> thm) list_of_binders = [] : term list new_binder = - : ((string # type) -> void) n_strip_quant = - : ((* -> (** # *)) -> int -> * -> (** list # *)) is_infix_type = - : (type -> bool) is_binder_type = - : (type -> bool) check_specification = - : (* -> (string # string) list -> thm -> (term list # term)) new_specification = - : (string -> (string # string) list -> thm -> thm) check_varstruct = - : (term -> term list) check_lhs = - : (term -> term list) get_type = - : (term -> type -> type) DEF_EXISTS_RULE = - : (term -> thm) new_gen_definition = - : (string -> (string # term) -> thm) new_definition = - : ((string # term) -> thm) new_infix_definition = - : ((string # term) -> thm) new_theory = - : (string -> void) close_theory = - : (void -> void) binders = - : (string -> term list) activate_binders = - : (string -> string list) ancestors = - : (string -> string list) thy_chked = [] : string list activate_all_binders = - : (string -> string list) load_theory = - : (string -> void) extend_theory = - : (string -> void) new_parent = - : (string -> void) ((-), (-), -) : ((string -> void) # (string -> void) # (string -> void)) load_theory = - : (string -> void) extend_theory = - : (string -> void) new_parent = - : (string -> void) new_binder_definition = - : ((string # term) -> thm) new_type_definition = - : ((string # term # thm) -> thm) ML_eval = - : (string -> void) New constructors declared: preterm_var : (string -> preterm) preterm_const : (string -> preterm) preterm_comb : ((preterm # preterm) -> preterm) preterm_abs : ((preterm # preterm) -> preterm) preterm_typed : ((preterm # type) -> preterm) preterm_antiquot : (term -> preterm) preterm_to_term = - : (preterm -> term) Calling Lisp compiler File ml/hol-syn compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `bool`;;'\ 'compilet `ml/hol-rule`;;'\ 'quit();;'\ | hol-lcf HOL-LCF version 2.02 (GCL) created 25/8/25 #() : void Theory bool loaded () : void () : void T_DEF = |- T = ((\x. x) = (\x. x)) F_DEF = |- F = (!t. t) FORALL_DEF = |- $! = (\P. P = (\x. T)) AND_DEF = |- $/\ = (\t1 t2. !t. (t1 ==> t2 ==> t) ==> t) OR_DEF = |- $\/ = (\t1 t2. !t. (t1 ==> t) ==> (t2 ==> t) ==> t) EXISTS_DEF = |- $? = (\P. P($@ P)) NOT_DEF = |- $~ = (\t. t ==> F) EXISTS_UNIQUE_DEF = |- ?! = (\P. $? P /\ (!x y. P x /\ P y ==> (x = y))) LET_DEF = |- LET = (\f x. f x) UNCURRY_DEF = |- !f x y. UNCURRY f(x,y) = f x y CURRY_DEF = |- !f x y. CURRY f x y = f(x,y) COND_DEF = |- COND = (\t t1 t2. @x. ((t = T) ==> (x = t1)) /\ ((t = F) ==> (x = t2))) TYPE_DEFINITION = |- !P rep. TYPE_DEFINITION P rep = (!x' x''. (rep x' = rep x'') ==> (x' = x'')) /\ (!x. P x = (?x'. x = rep x')) BOOL_CASES_AX = |- !t. (t = T) \/ (t = F) IMP_ANTISYM_AX = |- !t1 t2. (t1 ==> t2) ==> (t2 ==> t1) ==> (t1 = t2) ETA_AX = |- !t. (\x. t x) = t SELECT_AX = |- !P x. P x ==> P($@ P) PAIR = |- !x. FST x,SND x = x FST = |- !x y. FST(x,y) = x SND = |- !x y. SND(x,y) = y PAIR_EQ = |- !x y a b. (x,y = a,b) = (x = a) /\ (y = b) ASSUME = - : (term -> thm) REFL = - : (term -> thm) SUBST = - : ((thm # term) list -> term -> thm -> thm) BETA_CONV = - : (term -> thm) ABS = - : (term -> thm -> thm) INST_TYPE = - : ((type # type) list -> thm -> thm) DISCH = - : (term -> thm -> thm) MP = - : (thm -> thm -> thm) Calling Lisp compiler File ml/hol-rule compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `bool`;;'\ 'compilet `ml/hol-drule`;;'\ 'quit();;'\ | hol-lcf HOL-LCF version 2.02 (GCL) created 25/8/25 #() : void Theory bool loaded () : void () : void ADD_ASSUM = - : (term -> thm -> thm) SYM = - : (thm -> thm) () : void TRANS = - : (thm -> thm -> thm) IMP_TRANS = - : (thm -> thm -> thm) AP_TERM = - : (term -> thm -> thm) AP_THM = - : (thm -> term -> thm) EQ_MP = - : (thm -> thm -> thm) EQ_IMP_RULE = - : (thm -> (thm # thm)) TRUTH = |- T EQT_ELIM = - : (thm -> thm) SPEC = - : (term -> thm -> thm) SPECL = - : (term list -> thm -> thm) EQT_INTRO = - : (thm -> thm) GEN = - : (term -> thm -> thm) GENL = - : (term list -> thm -> thm) ETA_CONV = - : (term -> thm) EXT = - : (thm -> thm) SELECT_INTRO = - : (thm -> thm) SELECT_ELIM = - : (thm -> (term # thm) -> thm) EXISTS = - : ((term # term) -> thm -> thm) CHOOSE = - : ((term # thm) -> thm -> thm) SELECT_RULE = - : (thm -> thm) IMP_ANTISYM_RULE = - : (thm -> thm -> thm) MK_EXISTS = - : (thm -> thm) LIST_MK_EXISTS = - : (term list -> thm -> thm) FORALL_EQ = - : (term -> thm -> thm) EXISTS_EQ = - : (term -> thm -> thm) SELECT_EQ = - : (term -> thm -> thm) SUBS = - : (thm list -> thm -> thm) SUBS_OCCS = - : ((int list # thm) list -> thm -> thm) SUBST_CONV = - : ((thm # term) list -> term -> term -> thm) RIGHT_BETA = - : (thm -> thm) LIST_BETA_CONV = - : (term -> thm) RIGHT_LIST_BETA = - : (thm -> thm) AND_INTRO_THM = |- !t1 t2. t1 ==> t2 ==> t1 /\ t2 CONJ = - : (thm -> thm -> thm) AND1_THM = |- !t1 t2. t1 /\ t2 ==> t1 CONJUNCT1 = - : (thm -> thm) AND2_THM = |- !t1 t2. t1 /\ t2 ==> t2 CONJUNCT2 = - : (thm -> thm) CONJ_SYM = |- !t1 t2. t1 /\ t2 = t2 /\ t1 CONJ_ASSOC = |- !t1 t2 t3. t1 /\ t2 /\ t3 = (t1 /\ t2) /\ t3 CONJUNCTS_CONV = - : ((term # term) -> thm) CONJ_SET_CONV = - : (term list -> term list -> thm) FRONT_CONJ_CONV = - : (term list -> term -> thm) CONJ_DISCH = - : (term -> thm -> thm) CONJ_DISCHL = - : (term list -> thm -> thm) OR_INTRO_THM1 = |- !t1 t2. t1 ==> t1 \/ t2 DISJ1 = - : (thm -> term -> thm) OR_INTRO_THM2 = |- !t1 t2. t2 ==> t1 \/ t2 DISJ2 = - : (term -> thm -> thm) OR_ELIM_THM = |- !t t1 t2. t1 \/ t2 ==> (t1 ==> t) ==> (t2 ==> t) ==> t DISJ_CASES = - : (thm -> thm -> thm -> thm) FALSITY = |- !t. F ==> t IMP_F = |- !t. (t ==> F) ==> ~t NOT_INTRO = - : (thm -> thm) NEG_DISCH = - : (term -> thm -> thm) F_IMP = |- !t. ~t ==> t ==> F NOT_MP = - : (thm -> thm -> thm) UNDISCH = - : (thm -> thm) NOT_ELIM = - : (thm -> thm) NOT_EQ_SYM = - : (thm -> thm) AND_CLAUSES = |- !t. (T /\ t = t) /\ (t /\ T = t) /\ (F /\ t = F) /\ (t /\ F = F) /\ (t /\ t = t) OR_CLAUSES = |- !t. (T \/ t = T) /\ (t \/ T = T) /\ (F \/ t = t) /\ (t \/ F = t) /\ (t \/ t = t) IMP_CLAUSES = |- !t. (T ==> t = t) /\ (t ==> T = T) /\ (F ==> t = T) /\ (t ==> t = T) /\ (t ==> F = ~t) CONTR = - : (term -> thm -> thm) EQF_INTRO = - : (thm -> thm) EQF_ELIM = - : (thm -> thm) EXCLUDED_MIDDLE = |- !t. t \/ ~t CCONTR = - : (term -> thm -> thm) INST = - : ((term # term) list -> thm -> thm) NOT_F = |- !t. ~t ==> (t = F) NOT_AND = |- ~(t /\ ~t) OR_IMP_THM = |- !t1 t2. (t1 = t2 \/ t1) = t2 ==> t1 NOT_IMP = |- !t1 t2. ~(t1 ==> t2) = t1 /\ ~t2 DISJ_ASSOC = |- !t1 t2 t3. t1 \/ t2 \/ t3 = (t1 \/ t2) \/ t3 DISJ_SYM = |- !t1 t2. t1 \/ t2 = t2 \/ t1 DE_MORGAN_THM = |- !t1 t2. (~(t1 /\ t2) = ~t1 \/ ~t2) /\ (~(t1 \/ t2) = ~t1 /\ ~t2) ISPEC = - : (term -> thm -> thm) ISPECL = - : (term list -> thm -> thm) SELECT_REFL = |- !x. (@y. y = x) = x SELECT_UNIQUE = |- !P x. (!y. P y = (y = x)) ==> ($@ P = x) Calling Lisp compiler File ml/hol-drule compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `bool`;;'\ 'compilet `ml/drul`;;'\ 'quit();;'\ | hol-lcf HOL-LCF version 2.02 (GCL) created 25/8/25 #() : void Theory bool loaded () : void () : void GEN_ALL = - : (thm -> thm) DISCH_ALL = - : (thm -> thm) SPEC_VAR = - : (thm -> (term # thm)) UNDISCH_ALL = - : (thm -> thm) SPEC_ALL = - : (thm -> thm) PROVE_HYP = - : (thm -> thm -> thm) CONJ_PAIR = - : (thm -> (thm # thm)) LIST_CONJ = - : (thm list -> thm) CONJ_LIST = - : (int -> thm -> thm list) CONJUNCTS = - : (thm -> thm list) BODY_CONJUNCTS = - : (thm -> thm list) IMP_CANON = - : (thm -> thm list) LIST_MP = - : (thm list -> thm -> thm) CONTRAPOS = - : (thm -> thm) DISJ_IMP = - : (thm -> thm) IMP_ELIM = - : (thm -> thm) NOT_CLAUSES = |- (!t. ~~t = t) /\ (~T = F) /\ (~F = T) DISJ_CASES_UNION = - : (thm -> thm -> thm -> thm) EQ_REFL = |- !x. x = x REFL_CLAUSE = |- !x. (x = x) = T EQ_SYM = |- !x y. (x = y) ==> (y = x) EQ_SYM_EQ = |- !x y. (x = y) = (y = x) EQ_EXT = |- !f g. (!x. f x = g x) ==> (f = g) EQ_TRANS = |- !x y z. (x = y) /\ (y = z) ==> (x = z) BOOL_EQ_DISTINCT = |- ~(T = F) /\ ~(F = T) EQ_CLAUSES = |- !t. ((T = t) = t) /\ ((t = T) = t) /\ ((F = t) = ~t) /\ ((t = F) = ~t) MK_COMB = - : ((thm # thm) -> thm) MK_ABS = - : (thm -> thm) HALF_MK_ABS = - : (thm -> thm) ALPHA_CONV = - : (term -> term -> thm) ALPHA = - : (term -> term -> thm) GEN_ALPHA_CONV = - : (term -> term -> thm) COND_CLAUSES = |- !t1 t2. ((T => t1 | t2) = t1) /\ ((F => t1 | t2) = t2) COND_ID = |- !b t. (b => t | t) = t IMP_CONJ = - : (thm -> thm -> thm) EXISTS_IMP = - : (term -> thm -> thm) LEFT_AND_OVER_OR = |- !t1 t2 t3. t1 /\ (t2 \/ t3) = t1 /\ t2 \/ t1 /\ t3 RIGHT_AND_OVER_OR = |- !t1 t2 t3. (t2 \/ t3) /\ t1 = t2 /\ t1 \/ t3 /\ t1 LEFT_OR_OVER_AND = |- !t1 t2 t3. t1 \/ t2 /\ t3 = (t1 \/ t2) /\ (t1 \/ t3) RIGHT_OR_OVER_AND = |- !t1 t2 t3. t2 /\ t3 \/ t1 = (t2 \/ t1) /\ (t3 \/ t1) IMP_DISJ_THM = |- !t1 t2. t1 ==> t2 = ~t1 \/ t2 IMP_F_EQ_F = |- !t. t ==> F = (t = F) AND_IMP_INTRO = |- !t1 t2 t3. t1 ==> t2 ==> t3 = t1 /\ t2 ==> t3 EQ_IMP_THM = |- !t1 t2. (t1 = t2) = (t1 ==> t2) /\ (t2 ==> t1) EQ_EXPAND = |- !t1 t2. (t1 = t2) = t1 /\ t2 \/ ~t1 /\ ~t2 COND_RATOR = |- !b f g x. (b => f | g)x = (b => f x | g x) COND_RAND = |- !f b x y. f(b => x | y) = (b => f x | f y) COND_ABS = |- !b f g. (\x. (b => f x | g x)) = (b => f | g) COND_EXPAND = |- !b t1 t2. (b => t1 | t2) = (~b \/ t1) /\ (b \/ t2) Calling Lisp compiler File ml/drul compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `bool`;;'\ 'compilet `ml/hol-thyfn`;;'\ 'quit();;'\ | hol-lcf HOL-LCF version 2.02 (GCL) created 25/8/25 #() : void Theory bool loaded () : void () : void IS_ASSUMPTION_OF = |- !t1 t2. t1 IS_ASSUMPTION_OF t2 = t1 ==> t2 ASSUMPTION_DISCH = - : (term -> thm -> thm) ASSUMPTION_DISCH_ALL = - : (thm -> thm) ASSUMPTION_UNDISCH = - : (thm -> thm) ASSUMPTION_UNDISCH_ALL = - : (thm -> thm) save_thm = - : ((string # thm) -> thm) theorem = - : (string -> string -> thm) delete_thm = - : (string -> string -> thm) theorems = - : (string -> (string # thm) list) ((-), (-), (-), -) : (((string # thm) -> thm) # (string -> string -> thm) # (string -> string -> thm) # (string -> (string # thm) list)) save_thm = - : ((string # thm) -> thm) theorem = - : (string -> string -> thm) delete_thm = - : (string -> string -> thm) theorems = - : (string -> (string # thm) list) constants = - : (string -> term list) axioms = - : (string -> (string # thm) list) definition = - : (string -> string -> thm) definitions = - : (string -> (string # thm) list) print_list = - : (bool -> string -> (* -> **) -> * list -> void) print_theory = - : (string -> void) theorem_lfn = - : (string list -> thm) theorem_msg_lfn = - : (string list -> thm) load_theorem = - : (string -> string -> void) load_theorems = - : (string -> void list) definition_lfn = - : (string list -> thm) definition_msg_lfn = - : (string list -> thm) load_definition = - : (string -> string -> void) load_definitions = - : (string -> void list) axiom_lfn = - : (string list -> thm) axiom_msg_lfn = - : (string list -> thm) load_axiom = - : (string -> string -> void) load_axioms = - : (string -> void list) Calling Lisp compiler File ml/hol-thyfn compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `bool`;;'\ 'compilet `ml/tacticals`;;'\ 'quit();;'\ | hol-lcf HOL-LCF version 2.02 (GCL) created 25/8/25 #() : void Theory bool loaded () : void () : void type proof defined type goal defined type tactic defined TAC_PROOF = - : ((goal # tactic) -> thm) prove = - : ((term # tactic) -> thm) ASSUM_LIST = - : ((thm list -> tactic) -> tactic) POP_ASSUM = - : ((thm -> tactic) -> tactic) POP_ASSUM_LIST = - : ((thm list -> tactic) -> tactic) () : void () : void mapshape = - : (int list -> (* list -> **) list -> * list -> ** list) THEN = - : (tactic -> tactic -> tactic) THENL = - : (tactic -> tactic list -> tactic) ((-), -) : ((tactic -> tactic -> tactic) # (tactic -> tactic list -> tactic)) THEN = - : (tactic -> tactic -> tactic) THENL = - : (tactic -> tactic list -> tactic) () : void ORELSE = - : (tactic -> tactic -> tactic) FAIL_TAC = - : (string -> tactic) NO_TAC = - : tactic ALL_TAC = - : tactic TRY = - : (tactic -> tactic) REPEAT = - : (tactic -> tactic) achieves = - : (thm -> goal -> bool) chktac = - : ((goal list # proof) -> thm) check_valid = - : (goal -> (goal list # proof) -> bool) VALID = - : (tactic -> tactic) EVERY = - : (tactic list -> tactic) FIRST = - : (tactic list -> tactic) MAP_EVERY = - : ((* -> tactic) -> * list -> tactic) MAP_FIRST = - : ((* -> tactic) -> * list -> tactic) EVERY_ASSUM = - : ((thm -> tactic) -> tactic) FIRST_ASSUM = - : ((thm -> tactic) -> tactic) SUBGOAL_THEN = - : (term -> (thm -> tactic) -> tactic) CHANGED_TAC = - : (tactic -> tactic) Calling Lisp compiler File ml/tacticals compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `bool`;;'\ 'compilet `ml/tacont`;;'\ 'quit();;'\ | hol-lcf HOL-LCF version 2.02 (GCL) created 25/8/25 #() : void Theory bool loaded () : void () : void type thm_tactic defined type thm_tactical defined () : void () : void THEN_TCL = - : (thm_tactical -> thm_tactical -> thm_tactical) ORELSE_TCL = - : (thm_tactical -> thm_tactical -> thm_tactical) REPEAT_TCL = - : (thm_tactical -> thm_tactical) REPEAT_GTCL = - : (thm_tactical -> thm_tactical) ALL_THEN = - : thm_tactical NO_THEN = - : thm_tactical EVERY_TCL = - : (thm_tactical list -> thm_tactical) FIRST_TCL = - : (thm_tactical list -> thm_tactical) CONJUNCTS_THEN2 = - : (thm_tactic -> thm_tactical) CONJUNCTS_THEN = - : thm_tactical DISJ_CASES_THEN2 = - : (thm_tactic -> thm_tactical) DISJ_CASES_THEN = - : thm_tactical DISJ_CASES_THENL = - : (thm_tactic list -> thm_tactic) DISCH_THEN = - : (thm_tactic -> tactic) X_CHOOSE_THEN = - : (term -> thm_tactical) CHOOSE_THEN = - : thm_tactical X_CASES_THENL = - : (term list list -> thm_tactic list -> thm_tactic) X_CASES_THEN = - : (term list list -> thm_tactical) CASES_THENL = - : (thm_tactic list -> thm_tactic) STRIP_THM_THEN = - : thm_tactical Calling Lisp compiler File ml/tacont compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `bool`;;'\ 'compilet `ml/tactics`;;'\ 'quit();;'\ | hol-lcf HOL-LCF version 2.02 (GCL) created 25/8/25 #() : void Theory bool loaded () : void () : void ACCEPT_TAC = - : thm_tactic DISCARD_TAC = - : thm_tactic CONTR_TAC = - : thm_tactic ASSUME_TAC = - : thm_tactic FREEZE_THEN = - : thm_tactical CONJ_TAC = - : tactic DISJ1_TAC = - : tactic DISJ2_TAC = - : tactic MP_TAC = - : thm_tactic EQ_TAC = - : tactic X_GEN_TAC = - : (term -> tactic) GEN_TAC = - : tactic SPEC_TAC = - : ((term # term) -> tactic) EXISTS_TAC = - : (term -> tactic) GSUBST_TAC = - : (((term # term) list -> term -> term) -> thm list -> tactic) SUBST_TAC = - : (thm list -> tactic) SUBST_OCCS_TAC = - : ((int list # thm) list -> tactic) SUBST1_TAC = - : thm_tactic RULE_ASSUM_TAC = - : ((thm -> thm) -> tactic) SUBST_ALL_TAC = - : thm_tactic CHECK_ASSUME_TAC = - : thm_tactic STRIP_ASSUME_TAC = - : thm_tactic STRUCT_CASES_TAC = - : thm_tactic COND_CASES_TAC = - : tactic BOOL_CASES_TAC = - : (term -> tactic) STRIP_GOAL_THEN = - : (thm_tactic -> tactic) FILTER_GEN_TAC = - : (term -> tactic) FILTER_DISCH_THEN = - : (thm_tactic -> term -> tactic) FILTER_STRIP_THEN = - : (thm_tactic -> term -> tactic) DISCH_TAC = - : tactic DISJ_CASES_TAC = - : thm_tactic CHOOSE_TAC = - : thm_tactic X_CHOOSE_TAC = - : (term -> thm_tactic) STRIP_TAC = - : tactic FILTER_DISCH_TAC = - : (term -> tactic) FILTER_STRIP_TAC = - : (term -> tactic) ASM_CASES_TAC = - : (term -> tactic) REFL_TAC = - : tactic UNDISCH_TAC = - : (term -> tactic) AP_TERM_TAC = - : tactic AP_THM_TAC = - : tactic Calling Lisp compiler File ml/tactics compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `bool`;;'\ 'compilet `ml/conv`;;'\ 'quit();;'\ | hol-lcf HOL-LCF version 2.02 (GCL) created 25/8/25 #() : void Theory bool loaded () : void () : void type conv defined INST_TY_TERM = - : (((term # term) list # (type # type) list) -> thm -> thm) GSPEC = - : (thm -> thm) PART_MATCH = - : ((term -> term) -> thm -> conv) MATCH_MP = - : (thm -> thm -> thm) REWR_CONV = - : (thm -> conv) NO_CONV = - : conv ALL_CONV = - : conv () : void () : void THENC = - : (conv -> conv -> conv) ORELSEC = - : (conv -> conv -> conv) FIRST_CONV = - : (conv list -> conv) EVERY_CONV = - : (conv list -> conv) REPEATC = - : (conv -> conv) CHANGED_CONV = - : (conv -> conv) TRY_CONV = - : (conv -> conv) SUB_CONV = - : (conv -> conv) qconv = `QCONV` : string QCONV = - : (conv -> conv) ALL_QCONV = - : conv THENQC = - : (conv -> conv -> conv) ORELSEQC = - : ((term -> *) -> (term -> *) -> term -> *) REPEATQC = - : (conv -> conv) CHANGED_QCONV = - : (conv -> conv) TRY_QCONV = - : (conv -> conv) SUB_QCONV = - : (conv -> conv) SUB_ALPHA_QCONV = - : (conv -> conv) DEPTH_QCONV = - : ((conv -> conv) -> conv -> conv) DEPTH_CONV = - : (conv -> conv) REDEPTH_QCONV = - : ((conv -> conv) -> conv -> conv) REDEPTH_CONV = - : (conv -> conv) TOP_DEPTH_QCONV = - : ((conv -> conv) -> conv -> conv) TOP_DEPTH_CONV = - : (conv -> conv) ONCE_DEPTH_QCONV = - : ((conv -> conv) -> conv -> conv) ONCE_DEPTH_CONV = - : (conv -> conv) REW_DEPTH_CONV = - : (conv -> conv) ONCE_REW_DEPTH_CONV = - : (conv -> conv) ((-), (-), (-), (-), (-), -) : ((conv -> conv) # (conv -> conv) # (conv -> conv) # (conv -> conv) # (conv -> conv) # (conv -> conv)) DEPTH_CONV = - : (conv -> conv) REDEPTH_CONV = - : (conv -> conv) TOP_DEPTH_CONV = - : (conv -> conv) ONCE_DEPTH_CONV = - : (conv -> conv) REW_DEPTH_CONV = - : (conv -> conv) ONCE_REW_DEPTH_CONV = - : (conv -> conv) CONV_RULE = - : (conv -> thm -> thm) CONV_TAC = - : (conv -> tactic) BETA_RULE = - : (thm -> thm) BETA_TAC = - : tactic NOT_FORALL_CONV = - : conv NOT_EXISTS_CONV = - : conv EXISTS_NOT_CONV = - : conv FORALL_NOT_CONV = - : conv FORALL_AND_CONV = - : conv EXISTS_OR_CONV = - : conv AND_FORALL_CONV = - : conv LEFT_AND_FORALL_CONV = - : conv RIGHT_AND_FORALL_CONV = - : conv OR_EXISTS_CONV = - : conv LEFT_OR_EXISTS_CONV = - : conv RIGHT_OR_EXISTS_CONV = - : conv EXISTS_AND_CONV = - : conv AND_EXISTS_CONV = - : conv LEFT_AND_EXISTS_CONV = - : conv RIGHT_AND_EXISTS_CONV = - : conv FORALL_OR_CONV = - : conv OR_FORALL_CONV = - : conv LEFT_OR_FORALL_CONV = - : conv RIGHT_OR_FORALL_CONV = - : conv FORALL_IMP_CONV = - : conv LEFT_IMP_EXISTS_CONV = - : conv RIGHT_IMP_FORALL_CONV = - : conv EXISTS_IMP_CONV = - : conv LEFT_IMP_FORALL_CONV = - : conv RIGHT_IMP_EXISTS_CONV = - : conv X_SKOLEM_CONV = - : (term -> conv) SKOLEM_CONV = - : conv SYM_CONV = - : conv RIGHT_CONV_RULE = - : (conv -> thm -> thm) FUN_EQ_CONV = - : conv X_FUN_EQ_CONV = - : (term -> conv) CONTRAPOS_CONV = - : conv ANTE_CONJ_CONV = - : conv SWAP_EXISTS_CONV = - : conv RAND_CONV = - : (conv -> conv) RATOR_CONV = - : (conv -> conv) ABS_CONV = - : (conv -> conv) SELECT_CONV = - : conv bool_EQ_CONV = - : conv EXISTS_UNIQUE_CONV = - : conv COND_CONV = - : conv PAIRED_BETA_CONV = - : conv PAIRED_ETA_CONV = - : conv GEN_BETA_CONV = - : conv ITER_BETA_CONV = - : conv ARGS_CONV = - : (conv list -> conv) RED_WHERE = - : (term -> term -> conv) REDUCE = - : (term -> term -> thm -> thm) let_CONV = - : conv - : conv let_CONV = - : conv EXISTENCE = - : (thm -> thm) AC_CONV = - : ((thm # thm) -> conv) GSYM = - : (thm -> thm) Calling Lisp compiler File ml/conv compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `bool`;;'\ 'compilet `ml/hol-net`;;'\ 'quit();;'\ | hol-lcf HOL-LCF version 2.02 (GCL) created 25/8/25 #() : void Theory bool loaded () : void () : void nil_term_net = - : * term_net enter_term = - : ((term # *) -> * term_net -> * term_net) lookup_term = - : (* term_net -> term -> * list) merge_term_nets = - : (* term_net -> * term_net -> * term_net) Calling Lisp compiler File ml/hol-net compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `bool`;;'\ 'compilet `ml/rewrite`;;'\ 'quit();;'\ | hol-lcf HOL-LCF version 2.02 (GCL) created 25/8/25 #() : void Theory bool loaded () : void () : void mk_rewrites = - : (thm -> thm list) mk_rewritesl = - : (thm list -> thm list) mk_conv_net = - : (thm list -> conv term_net) - : (thm list -> conv term_net) mk_conv_net = - : (thm list -> conv term_net) FORALL_SIMP = |- !t. (!x. t) = t EXISTS_SIMP = |- !t. (?x. t) = t ABS_SIMP = |- !t1 t2. (\x. t1)t2 = t1 basic_rewrites = [|- !x. (x = x) = T; |- !t. ((T = t) = t) /\ ((t = T) = t) /\ ((F = t) = ~t) /\ ((t = F) = ~t); |- (!t. ~~t = t) /\ (~T = F) /\ (~F = T); |- !t. (T /\ t = t) /\ (t /\ T = t) /\ (F /\ t = F) /\ (t /\ F = F) /\ (t /\ t = t); |- !t. (T \/ t = T) /\ (t \/ T = T) /\ (F \/ t = t) /\ (t \/ F = t) /\ (t \/ t = t); |- !t. (T ==> t = t) /\ (t ==> T = T) /\ (F ==> t = T) /\ (t ==> t = T) /\ (t ==> F = ~t); |- !t1 t2. ((T => t1 | t2) = t1) /\ ((F => t1 | t2) = t2); |- !t. (!x. t) = t; |- !t. (?x. t) = t; |- !t1 t2. (\x. t1)t2 = t1; |- !x. FST x,SND x = x; |- !x y. FST(x,y) = x; |- !x y. SND(x,y) = y] : thm list GEN_REWRITE_CONV = - : ((conv -> conv) -> thm list -> thm list -> conv) PURE_REWRITE_CONV = - : (thm list -> conv) REWRITE_CONV = - : (thm list -> conv) PURE_ONCE_REWRITE_CONV = - : (thm list -> conv) ONCE_REWRITE_CONV = - : (thm list -> conv) GEN_REWRITE_RULE = - : ((conv -> conv) -> thm list -> thm list -> thm -> thm) PURE_REWRITE_RULE = - : (thm list -> thm -> thm) REWRITE_RULE = - : (thm list -> thm -> thm) PURE_ONCE_REWRITE_RULE = - : (thm list -> thm -> thm) ONCE_REWRITE_RULE = - : (thm list -> thm -> thm) PURE_ASM_REWRITE_RULE = - : (thm list -> thm -> thm) ASM_REWRITE_RULE = - : (thm list -> thm -> thm) PURE_ONCE_ASM_REWRITE_RULE = - : (thm list -> thm -> thm) ONCE_ASM_REWRITE_RULE = - : (thm list -> thm -> thm) FILTER_PURE_ASM_REWRITE_RULE = - : ((term -> bool) -> thm list -> thm -> thm) FILTER_ASM_REWRITE_RULE = - : ((term -> bool) -> thm list -> thm -> thm) FILTER_PURE_ONCE_ASM_REWRITE_RULE = - : ((term -> bool) -> thm list -> thm -> thm) FILTER_ONCE_ASM_REWRITE_RULE = - : ((term -> bool) -> thm list -> thm -> thm) GEN_REWRITE_TAC = - : ((conv -> conv) -> thm list -> thm list -> tactic) PURE_REWRITE_TAC = - : (thm list -> tactic) REWRITE_TAC = - : (thm list -> tactic) PURE_ONCE_REWRITE_TAC = - : (thm list -> tactic) ONCE_REWRITE_TAC = - : (thm list -> tactic) PURE_ASM_REWRITE_TAC = - : (thm list -> tactic) ASM_REWRITE_TAC = - : (thm list -> tactic) PURE_ONCE_ASM_REWRITE_TAC = - : (thm list -> tactic) ONCE_ASM_REWRITE_TAC = - : (thm list -> tactic) FILTER_PURE_ASM_REWRITE_TAC = - : ((term -> bool) -> thm list -> tactic) FILTER_ASM_REWRITE_TAC = - : ((term -> bool) -> thm list -> tactic) FILTER_PURE_ONCE_ASM_REWRITE_TAC = - : ((term -> bool) -> thm list -> tactic) FILTER_ONCE_ASM_REWRITE_TAC = - : ((term -> bool) -> thm list -> tactic) find_match = - : (term -> term -> ((term # term) list # (type # type) list)) SUBST_MATCH = - : (thm -> thm -> thm) Calling Lisp compiler File ml/rewrite compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `bool`;;'\ 'compilet `ml/resolve`;;'\ 'quit();;'\ | hol-lcf HOL-LCF version 2.02 (GCL) created 25/8/25 #() : void Theory bool loaded () : void () : void MATCH_ACCEPT_TAC = - : thm_tactic ANTE_RES_THEN = - : thm_tactical RES_CANON = - : (thm -> thm list) MATCH_MP = - : (thm -> thm -> thm) check = - : (string -> * list -> * list) IMP_RES_THEN = - : thm_tactical RES_THEN = - : (thm_tactic -> tactic) ((-), -) : (thm_tactical # (thm_tactic -> tactic)) IMP_RES_THEN = - : thm_tactical RES_THEN = - : (thm_tactic -> tactic) IMP_RES_TAC = - : thm_tactic RES_TAC = - : tactic MATCH_MP_TAC = - : thm_tactic Calling Lisp compiler File ml/resolve compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `bool`;;'\ 'compilet `ml/goals`;;'\ 'quit();;'\ | hol-lcf HOL-LCF version 2.02 (GCL) created 25/8/25 #() : void Theory bool loaded () : void () : void assignable_print_term = - : (term -> void) () : void print_hyps = - : (term list -> void) print_goal = - : (goal -> void) PROVE = - : ((term # tactic) -> thm) prove_thm = - : ((string # term # tactic) -> thm) type subgoals defined root_goal = - : tactic attempt_first = - : (subgoals -> tactic -> subgoals) rotate_goals = - : (subgoals -> subgoals) achieve_first = - : (subgoals -> thm -> subgoals) apply_proof = - : (subgoals -> thm) () : void print_subgoals = - : (subgoals -> void) print_stack = - : (subgoals list -> int -> void) pop_proofs = - : (subgoals list -> subgoals list) pop_proofs_print = - : (subgoals list -> subgoals list) push_print = - : (subgoals -> subgoals list -> subgoals list) push_fsubgoals = - : (subgoals list -> tactic -> subgoals list) push_subgoals = - : (subgoals list -> tactic -> subgoals list) rotate_top = - : (int -> subgoals list -> subgoals list) new_stack = - : (goal -> subgoals list) top_proof = - : (subgoals list -> thm) Calling Lisp compiler File ml/goals compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `bool`;;'\ 'compilet `ml/stack`;;'\ 'quit();;'\ | hol-lcf HOL-LCF version 2.02 (GCL) created 25/8/25 #() : void Theory bool loaded () : void () : void abs_goals = - : (subgoals list -> goalstack) rep_goals = - : (goalstack -> subgoals list) goals = - : goalstack backup_list = [] : goalstack list backup_limit = 12 : int print_state = - : (int -> void) change_state = - : (goalstack -> void) set_goal = - : (goal -> void) expandf = - : (tactic -> void) expand = - : (tactic -> void) rotate = - : (int -> void) backup = - : (void -> void) top_thm = - : (void -> thm) save_top_thm = - : (string -> thm) top_goal = - : (void -> goal) get_state = - : (void -> goalstack) set_state = - : (goalstack -> void) g = - : (term -> void) e = - : (tactic -> void) p = - : (int -> void) b = - : (void -> void) r = - : (int -> void) Calling Lisp compiler File ml/stack compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `BASIC-HOL`;;'\ 'compilet `ml/abs-rep`;;'\ 'quit();;'\ | hol-lcf HOL-LCF version 2.02 (GCL) created 25/8/25 #() : void Theory BASIC-HOL loaded () : void () : void ABS_REP_THM = |- !P. (?rep. TYPE_DEFINITION P rep) ==> (?rep abs. (!a. abs(rep a) = a) /\ (!r. P r = (rep(abs r) = r))) define_new_type_bijections = - : (string -> string -> string -> thm -> thm) prove_rep_fn_one_one = - : (thm -> thm) prove_rep_fn_onto = - : (thm -> thm) prove_abs_fn_onto = - : (thm -> thm) prove_abs_fn_one_one = - : (thm -> thm) Calling Lisp compiler File ml/abs-rep compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `BASIC-HOL`;;'\ 'loadf `ml/hol-in-out`;;'\ 'loadf `ml/hol-rule`;;'\ 'loadf `ml/hol-drule`;;'\ 'loadf `ml/drul`;;'\ 'loadf `ml/tacticals`;;'\ 'loadf `ml/tacont`;;'\ 'loadf `ml/tactics`;;'\ 'loadf `ml/conv`;;'\ 'loadf `ml/hol-net`;;'\ 'loadf `ml/rewrite`;;'\ 'loadf `ml/resolve`;;'\ 'loadf `ml/hol-thyfn`;;'\ 'loadf `ml/goals`;;'\ 'loadf `ml/stack`;;'\ 'loadf `ml/abs-rep`;;'\ 'activate_binders `bool`;;'\ 'lisp `(setq %liszt "")`;;'\ 'lisp `(setq %version "2.02 (GCL)")`;;'\ 'lisp `(setq %system-name "BASIC-HOL")`;;'\ 'lisp `(setup)`;;' >foo1 echo 'lisp `(throw (quote eof) t)`;; #+native-reloc(progn (with-open-file (s "foo1") (let ((*standard-input* s)) (tml)))(ml-save "basic-hol")) #-native-reloc(let ((si::*collect-binary-modules* t)(si::*binary-modules* (with-open-file (s "bm.l") (read s)))) (with-open-file (s "foo1") (let ((*standard-input* s)) (tml)))(compiler::link (remove-duplicates si::*binary-modules* :test (function equal)) "basic-hol" "(progn (load \"debian/gcl_patch.l\")(load \"foo\")(with-open-file (s \"foo1\") (let ((*standard-input* s)) (tml)))(ml-save \"basic-hol\")(quit))" "" nil)(with-open-file (s "bm.l" :direction :output) (prin1 si::*binary-modules* s))(quit))`;;' | hol-lcf HOL-LCF version 2.02 (GCL) created 25/8/25 #GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ > HOL-LCF version 2.02 (GCL) created 25/8/25 #() : void Theory BASIC-HOL loaded () : void .....................................................................................................................................................() : void #.............() : void ...................................................................................() : void ..................................................() : void ...................................() : void .........................() : void ..........................................() : void ...................................................................................................() : void ..() : void ......................() : void .............() : void ............................() : void ........................() : void .................() : void .......() : void [`?!`; `!`; `?`; `@`] : string list () : void () : void () : void () : void #=======> basic-hol88 made cd /build/reproducible-path/hol88-2.02.19940316dfsg/theories; rm -f combin.th;\ /build/reproducible-path/hol88-2.02.19940316dfsg/basic-hol < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_combin.ml;\ cd /build/reproducible-path/hol88-2.02.19940316dfsg BASIC-HOL version 2.02 (GCL) created 25/8/25 ##########################() : void #####o_DEF = |- !f g. f o g = (\x. f(g x)) ###K_DEF = |- K = (\x y. x) ######S_DEF = |- S = (\f g x. f x(g x)) ########I_DEF = |- I = S K K ###() : void #########o_THM = |- !f g x. (f o g)x = f(g x) ########o_ASSOC = |- !f g h. f o (g o h) = (f o g) o h ########K_THM = |- !x y. K x y = x ########S_THM = |- !f g x. S f g x = f x(g x) ########I_THM = |- !x. I x = x ##########I_o_ID = |- !f. (I o f = f) /\ (f o I = f) ##=======> theory combin built cd /build/reproducible-path/hol88-2.02.19940316dfsg/theories; rm -f num.th;\ /build/reproducible-path/hol88-2.02.19940316dfsg/basic-hol < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_num.ml;\ cd /build/reproducible-path/hol88-2.02.19940316dfsg BASIC-HOL version 2.02 (GCL) created 25/8/25 ##############################() : void ##INFINITY_AX = |- ?f. ONE_ONE f /\ ~ONTO f ##ONE_ONE_DEF = |- !f. ONE_ONE f = (!x1 x2. (f x1 = f x2) ==> (x1 = x2)) #ONTO_DEF = |- !f. ONTO f = (!y. ?x. y = f x) ######SUC_REP_DEF = |- SUC_REP = (@f. ONE_ONE f /\ ~ONTO f) #####ZERO_REP_DEF = |- ZERO_REP = (@x. !y. ~(x = SUC_REP y)) ##########IS_NUM_REP = |- !m. IS_NUM_REP m = (!P. P ZERO_REP /\ (!n. P n ==> P(SUC_REP n)) ==> P m) ########EXISTS_NUM_REP = |- ?n. IS_NUM_REP n ####num_TY_DEF = |- ?rep. TYPE_DEFINITION IS_NUM_REP rep ##########num_ISO_DEF = |- (!a. ABS_num(REP_num a) = a) /\ (!r. IS_NUM_REP r = (REP_num(ABS_num r) = r)) #####R_11 = |- !a a'. (REP_num a = REP_num a') = (a = a') R_ONTO = |- !r. IS_NUM_REP r = (?a. r = REP_num a) A_11 = |- !r r'. IS_NUM_REP r ==> IS_NUM_REP r' ==> ((ABS_num r = ABS_num r') = (r = r')) A_ONTO = |- !a. ?r. (a = ABS_num r) /\ IS_NUM_REP r ###############() : void #() : void ###ZERO_DEF = |- 0 = ABS_num ZERO_REP ####SUC_DEF = |- !m. SUC m = ABS_num(SUC_REP(REP_num m)) ##() : void ######IS_NUM_REP_ZERO = |- IS_NUM_REP ZERO_REP #######IS_NUM_SUC_REP = |- !i. IS_NUM_REP i ==> IS_NUM_REP(SUC_REP i) #######IS_NUM_REP_SUC_REP = |- !n. IS_NUM_REP(SUC_REP(REP_num n)) ####thm1 = |- ONE_ONE SUC_REP /\ ~ONTO SUC_REP #thm2 = |- (!x1 x2. (SUC_REP x1 = SUC_REP x2) ==> (x1 = x2)) /\ ~(!y. ?x. y = SUC_REP x) ####SUC_REP_11 = |- !x1 x2. (SUC_REP x1 = SUC_REP x2) ==> (x1 = x2) ########NOT_SUC_ZERO = |- !x. ~(SUC_REP x = ZERO_REP) ################NOT_SUC = |- !n. ~(SUC n = 0) ##############INV_SUC = |- !m n. (SUC m = SUC n) ==> (m = n) ###########ind_lemma1 = |- !P. P ZERO_REP /\ (!i. P i ==> P(SUC_REP i)) ==> (!i. IS_NUM_REP i ==> P i) ####lemma = |- A ==> A /\ B = A ==> B ############ind_lemma2 = |- !P. P ZERO_REP /\ (!i. IS_NUM_REP i /\ P i ==> P(SUC_REP i)) ==> (!i. IS_NUM_REP i ==> P i) ##########lemma1 = |- (!i. IS_NUM_REP i ==> P(ABS_num i)) = (!n. P n) ###############INDUCTION = |- !P. P 0 /\ (!n. P n ==> P(SUC n)) ==> (!n. P n) ##=======> theory num built cd /build/reproducible-path/hol88-2.02.19940316dfsg/theories; rm -f prim_rec.th;\ /build/reproducible-path/hol88-2.02.19940316dfsg/basic-hol < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_prim_rec.ml;\ cd /build/reproducible-path/hol88-2.02.19940316dfsg BASIC-HOL version 2.02 (GCL) created 25/8/25 #######################################################################() : void ##Theory num loaded () : void #####NOT_SUC = |- !n. ~(SUC n = 0) INV_SUC = |- !m n. (SUC m = SUC n) ==> (m = n) INDUCTION = |- !P. P 0 /\ (!n. P n ==> P(SUC n)) ==> (!n. P n) #####LESS = |- !m n. m < n = (?P. (!n'. P(SUC n') ==> P n') /\ P m /\ ~P n) ########### Section INDUCT_THEN begun BETAS = - : (term -> term -> conv) GTAC = - : (term -> tactic) TACF = - : (term -> term -> thm_tactic -> tactic) TACS = - : (term -> term -> thm_tactic -> tactic list) GOALS = - : (* -> ((* # term) -> (** # ***)) list -> term -> (** list # *** list)) GALPH = - : conv GALPHA = - : conv mapshape = - : (int list -> (* list -> **) list -> * list -> ** list) INDUCT_THEN = - : (thm -> thm_tactic -> tactic) - : (thm -> thm_tactic -> tactic) Section INDUCT_THEN ended INDUCT_THEN = - : (thm -> thm_tactic -> tactic) File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/ind.ml loaded () : void ####INDUCT_TAC = - : tactic ########INV_SUC_EQ = |- !m n. (SUC m = SUC n) = (m = n) ######LESS_REFL = |- !n. ~n < n ##########SUC_LESS = |- !m n. (SUC m) < n ==> m < n #########NOT_LESS_0 = |- !n. ~n < 0 #########LESS_0_0 = |- 0 < (SUC 0) #####################LESS_MONO = |- !m n. m < n ==> (SUC m) < (SUC n) #########LESS_SUC_REFL = |- !n. n < (SUC n) ###########LESS_SUC = |- !m n. m < n ==> m < (SUC n) #################LESS_LEMMA1 = |- !m n. m < (SUC n) ==> (m = n) \/ m < n ########LESS_LEMMA2 = |- !m n. (m = n) \/ m < n ==> m < (SUC n) #######LESS_THM = |- !m n. m < (SUC n) = (m = n) \/ m < n #########LESS_SUC_IMP = |- !m n. m < (SUC n) ==> ~(m = n) ==> m < n #######LESS_0 = |- !n. 0 < (SUC n) ##########EQ_LESS = |- !n. (SUC m = n) ==> m < n #######SUC_ID = |- !n. ~(SUC n = n) ########NOT_LESS_EQ = |- !m n. (m = n) ==> ~m < n ###########LESS_NOT_EQ = |- !m n. m < n ==> ~(m = n) ################################################SIMP_REC_REL = |- !fun x f n. SIMP_REC_REL fun x f n = (fun 0 = x) /\ (!m. m < n ==> (fun(SUC m) = f(fun m))) ######SIMP_REC_FUN = |- !x f n. SIMP_REC_FUN x f n = (@fun. SIMP_REC_REL fun x f n) ######SIMP_REC = |- !x f n. SIMP_REC x f n = SIMP_REC_FUN x f(SUC n)n ######################SIMP_REC_FUN_LEMMA = |- (?fun. SIMP_REC_REL fun x f n) = (SIMP_REC_FUN x f n 0 = x) /\ (!m. m < n ==> (SIMP_REC_FUN x f n(SUC m) = f(SIMP_REC_FUN x f n m))) ##################################SIMP_REC_EXISTS = |- !x f n. ?fun. SIMP_REC_REL fun x f n #############SIMP_REC_FUN_THM = |- !x f n. (SIMP_REC_FUN x f n 0 = x) /\ (!m. m < n ==> (SIMP_REC_FUN x f n(SUC m) = f(SIMP_REC_FUN x f n m))) ###SIMP_REC_FUN_THM1 = |- !x f n. SIMP_REC_FUN x f n 0 = x ###SIMP_REC_FUN_THM2 = |- !n m. m < n ==> (SIMP_REC_FUN x f n(SUC m) = f(SIMP_REC_FUN x f n m)) ###################SIMP_REC_UNIQUE = |- !n m1 m2 x f. n < m1 ==> n < m2 ==> (SIMP_REC_FUN x f m1 n = SIMP_REC_FUN x f m2 n) #######LESS_SUC_SUC = |- !m. m < (SUC m) /\ m < (SUC(SUC m)) ###############SIMP_REC_THM = |- !x f. (SIMP_REC x f 0 = x) /\ (!m. SIMP_REC x f(SUC m) = f(SIMP_REC x f m)) ########################PRE_DEF = |- !m. PRE m = ((m = 0) => 0 | (@n. m = SUC n)) ########SELECT_LEMMA = |- (@n. m = n) = m #######PRE = |- (PRE 0 = 0) /\ (!m. PRE(SUC m) = m) ######PRIM_REC_FUN = |- !x f. PRIM_REC_FUN x f = SIMP_REC(\n. x)(\fun n. f(fun(PRE n))n) ###########PRIM_REC_EQN = |- !x f. (!n. PRIM_REC_FUN x f 0 n = x) /\ (!m n. PRIM_REC_FUN x f(SUC m)n = f(PRIM_REC_FUN x f m(PRE n))n) #####PRIM_REC = |- !x f m. PRIM_REC x f m = PRIM_REC_FUN x f m(PRE m) ###########PRIM_REC_THM = |- !x f. (PRIM_REC x f 0 = x) /\ (!m. PRIM_REC x f(SUC m) = f(PRIM_REC x f m)m) ####################num_Axiom = |- !e f. ?! fn. (fn 0 = e) /\ (!n. fn(SUC n) = f(fn n)n) ###() : void ##=======> theory prim_rec built cd /build/reproducible-path/hol88-2.02.19940316dfsg/theories; rm -f fun.th;\ /build/reproducible-path/hol88-2.02.19940316dfsg/basic-hol < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_fun.ml;\ cd /build/reproducible-path/hol88-2.02.19940316dfsg BASIC-HOL version 2.02 (GCL) created 25/8/25 ###########################() : void ######ASSOC_DEF = |- !f. ASSOC f = (!x y z. f x(f y z) = f(f x y)z) ###COMM_DEF = |- !f. COMM f = (!x y. f x y = f y x) ####FCOMM_DEF = |- !f g. FCOMM f g = (!x y z. g x(f y z) = f(g x y)z) ###RIGHT_ID_DEF = |- !f e. RIGHT_ID f e = (!x. f x e = x) ###LEFT_ID_DEF = |- !f e. LEFT_ID f e = (!x. f e x = x) ###MONOID_DEF = |- !f e. MONOID f e = ASSOC f /\ RIGHT_ID f e /\ LEFT_ID f e ###() : void #######ASSOC_CONJ = |- ASSOC $/\ ####ASSOC_DISJ = |- ASSOC $\/ ####FCOMM_ASSOC = |- !f. FCOMM f f = ASSOC f #####################MONOID_CONJ_T = |- MONOID $/\ T ####MONOID_DISJ_F = |- MONOID $\/ F ##=======> theory fun built cd /build/reproducible-path/hol88-2.02.19940316dfsg/theories; rm -f arithmetic.th;\ /build/reproducible-path/hol88-2.02.19940316dfsg/basic-hol < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_arith.ml;\ /build/reproducible-path/hol88-2.02.19940316dfsg/basic-hol < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_arith_thms.ml;\ cd /build/reproducible-path/hol88-2.02.19940316dfsg BASIC-HOL version 2.02 (GCL) created 25/8/25 #############################() : void ##Theory prim_rec loaded Theory fun loaded [(); ()] : void list ########### Section prove_rec_fn_exists begun derive_existence_thm = - : (thm -> conv) mk_fn = - : ((term # term # term list # term # goal) -> (term # term list # thm)) instantiate_existence_thm = - : (thm -> conv) closeup = - : (term -> term) prove_rec_fn_exists = - : (thm -> conv) - : (thm -> conv) Section prove_rec_fn_exists ended prove_rec_fn_exists = - : (thm -> conv) new_recursive_definition = - : (bool -> thm -> string -> conv) File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/prim_rec.ml loaded () : void ###num_Axiom = |- !e f. ?! fn. (fn 0 = e) /\ (!n. fn(SUC n) = f(fn n)n) ####ADD = |- (!n. 0 + n = n) /\ (!m n. (SUC m) + n = SUC(m + n)) ####SUB = |- (!m. 0 - m = 0) /\ (!m n. (SUC m) - n = (m < n => 0 | SUC(m - n))) ####MULT = |- (!n. 0 * n = 0) /\ (!m n. (SUC m) * n = (m * n) + n) ####EXP = |- (!m. m EXP 0 = 1) /\ (!m n. m EXP (SUC n) = m * (m EXP n)) ########GREATER = |- !m n. m > n = n < m ###LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) ###GREATER_OR_EQ = |- !m n. m >= n = m > n \/ (m = n) ########FACT = |- (FACT 0 = 1) /\ (!n. FACT(SUC n) = (SUC n) * (FACT n)) ####EVEN = |- (EVEN 0 = T) /\ (!n. EVEN(SUC n) = ~EVEN n) ####ODD = |- (ODD 0 = F) /\ (!n. ODD(SUC n) = ~ODD n) #################() : void ## BASIC-HOL version 2.02 (GCL) created 25/8/25 ###########################Theory arithmetic loaded () : void ##########ADD = |- (!n. 0 + n = n) /\ (!m n. (SUC m) + n = SUC(m + n)) SUB = |- (!m. 0 - m = 0) /\ (!m n. (SUC m) - n = (m < n => 0 | SUC(m - n))) MULT = |- (!n. 0 * n = 0) /\ (!m n. (SUC m) * n = (m * n) + n) EXP = |- (!m. m EXP 0 = 1) /\ (!m n. m EXP (SUC n) = m * (m EXP n)) FACT = |- (FACT 0 = 1) /\ (!n. FACT(SUC n) = (SUC n) * (FACT n)) EVEN = |- (EVEN 0 = T) /\ (!n. EVEN(SUC n) = ~EVEN n) ODD = |- (ODD 0 = F) /\ (!n. ODD(SUC n) = ~ODD n) ####GREATER = |- !m n. m > n = n < m LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) GREATER_OR_EQ = |- !m n. m >= n = m > n \/ (m = n) ##################INV_SUC_EQ = |- !m n. (SUC m = SUC n) = (m = n) LESS_REFL = |- !n. ~n < n SUC_LESS = |- !m n. (SUC m) < n ==> m < n NOT_LESS_0 = |- !n. ~n < 0 LESS_MONO = |- !m n. m < n ==> (SUC m) < (SUC n) LESS_SUC_REFL = |- !n. n < (SUC n) LESS_SUC = |- !m n. m < n ==> m < (SUC n) LESS_THM = |- !m n. m < (SUC n) = (m = n) \/ m < n LESS_SUC_IMP = |- !m n. m < (SUC n) ==> ~(m = n) ==> m < n LESS_0 = |- !n. 0 < (SUC n) EQ_LESS = |- !n. (SUC m = n) ==> m < n SUC_ID = |- !n. ~(SUC n = n) NOT_LESS_EQ = |- !m n. (m = n) ==> ~m < n LESS_NOT_EQ = |- !m n. m < n ==> ~(m = n) LESS_SUC_SUC = |- !m. m < (SUC m) /\ m < (SUC(SUC m)) PRE = |- (PRE 0 = 0) /\ (!m. PRE(SUC m) = m) #####NOT_SUC = |- !n. ~(SUC n = 0) INV_SUC = |- !m n. (SUC m = SUC n) ==> (m = n) INDUCTION = |- !P. P 0 /\ (!n. P n ==> P(SUC n)) ==> (!n. P n) ######ASSOC_DEF = |- !f. ASSOC f = (!x y z. f x(f y z) = f(f x y)z) RIGHT_ID_DEF = |- !f e. RIGHT_ID f e = (!x. f x e = x) LEFT_ID_DEF = |- !f e. LEFT_ID f e = (!x. f e x = x) MONOID_DEF = |- !f e. MONOID f e = ASSOC f /\ RIGHT_ID f e /\ LEFT_ID f e ##### num_CONV = - : conv File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/numconv.ml loaded () : void ########### Section INDUCT_THEN begun BETAS = - : (term -> term -> conv) GTAC = - : (term -> tactic) TACF = - : (term -> term -> thm_tactic -> tactic) TACS = - : (term -> term -> thm_tactic -> tactic list) GOALS = - : (* -> ((* # term) -> (** # ***)) list -> term -> (** list # *** list)) GALPH = - : conv GALPHA = - : conv mapshape = - : (int list -> (* list -> **) list -> * list -> ** list) INDUCT_THEN = - : (thm -> thm_tactic -> tactic) - : (thm -> thm_tactic -> tactic) Section INDUCT_THEN ended INDUCT_THEN = - : (thm -> thm_tactic -> tactic) File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/ind.ml loaded () : void #####INDUCT_TAC = - : tactic ###########SUC_NOT = |- !n. ~(0 = SUC n) ########ADD_0 = |- !m. m + 0 = m ########ADD_SUC = |- !m n. SUC(m + n) = m + (SUC n) #########ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) ########ADD_SYM = |- !m n. m + n = n + m #########num_CASES = |- !m. (m = 0) \/ (?n. m = SUC n) ###########LESS_MONO_REV = |- !m n. (SUC m) < (SUC n) ==> m < n #########LESS_MONO_EQ = |- !m n. (SUC m) < (SUC n) = m < n ########SUC_SUB1 = |- !m. (SUC m) - 1 = m ########PRE_SUB1 = |- !m. PRE m = m - 1 ###############LESS_ADD = |- !m n. n < m ==> (?p. p + n = m) #######SUB_0 = |- !m. (0 - m = 0) /\ (m - 0 = m) ###############LESS_TRANS = |- !m n p. m < n /\ n < p ==> m < p #######ADD1 = |- !m. SUC m = m + 1 ###########LESS_ANTISYM = |- !m n. ~(m < n /\ n < m) ###########LESS_LESS_SUC = |- !m n. ~(m < n /\ n < (SUC m)) ##########FUN_EQ_LEMMA = |- !f x1 x2. f x1 /\ ~f x2 ==> ~(x1 = x2) ############LESS_OR = |- !m n. m < n ==> (SUC m) <= n ###########OR_LESS = |- !m n. (SUC m) <= n ==> m < n #######LESS_EQ = |- !m n. m < n = (SUC m) <= n ###########LESS_SUC_EQ_COR = |- !m n. m < n /\ ~(SUC m = n) ==> (SUC m) < n ###############LESS_NOT_SUC = |- !m n. m < n /\ ~(n = SUC m) ==> (SUC m) < n #######LESS_0_CASES = |- !m. (0 = m) \/ 0 < m #####################LESS_CASES_IMP = |- !m n. ~m < n /\ ~(m = n) ==> n < m ###########LESS_CASES = |- !m n. m < n \/ n <= m #########ADD_INV_0 = |- !m n. (m + n = m) ==> (n = 0) ###############LESS_EQ_ADD = |- !m n. m <= (m + n) #######LESS_EQ_SUC_REFL = |- !m. m <= (SUC m) #############LESS_ADD_NONZERO = |- !m n. ~(n = 0) ==> m < (m + n) ############LESS_EQ_ANTISYM = |- !m n. ~(m < n /\ n <= m) #############NOT_LESS = |- !m n. ~m < n = n <= m ######################SUB_EQ_0 = |- !m n. (m - n = 0) = m <= n #######ADD_ASSOC = |- !m n p. m + (n + p) = (m + n) + p #######MULT_0 = |- !m. m * 0 = 0 #######MULT_SUC = |- !m n. m * (SUC n) = m + (m * n) #######MULT_LEFT_1 = |- !m. 1 * m = m ########MULT_RIGHT_1 = |- !m. m * 1 = m ###########MULT_CLAUSES = |- !m n. (0 * m = 0) /\ (m * 0 = 0) /\ (1 * m = m) /\ (m * 1 = m) /\ ((SUC m) * n = (m * n) + n) /\ (m * (SUC n) = m + (m * n)) ########MULT_SYM = |- !m n. m * n = n * m ############RIGHT_ADD_DISTRIB = |- !m n p. (m + n) * p = (m * p) + (n * p) ###############LEFT_ADD_DISTRIB = |- !m n p. p * (m + n) = (p * m) + (p * n) #######MULT_ASSOC = |- !m n p. m * (n * p) = (m * n) * p ###############SUB_ADD = |- !m n. n <= m ==> ((m - n) + n = m) #############PRE_SUB = |- !m n. PRE(m - n) = (PRE m) - n ########ADD_EQ_0 = |- !m n. (m + n = 0) = (m = 0) /\ (n = 0) ##########ADD_INV_0_EQ = |- !m n. (m + n = m) = (n = 0) ########PRE_SUC_EQ = |- !m n. 0 < n ==> ((m = PRE n) = (SUC m = n)) ########INV_PRE_EQ = |- !m n. 0 < m /\ 0 < n ==> ((PRE m = PRE n) = (m = n)) ##########LESS_SUC_NOT = |- !m n. m < n ==> ~n < (SUC m) ##################TOTALLY_AD_HOC_LEMMA = |- !m n. (m + (SUC n) = n) = (SUC m = 0) #######################ADD_EQ_SUB = |- !m n p. n <= p ==> ((m + n = p) = (m = p - n)) ###########LESS_MONO_ADD = |- !m n p. m < n ==> (m + p) < (n + p) #########LESS_MONO_ADD_INV = |- !m n p. (m + p) < (n + p) ==> m < n ########LESS_MONO_ADD_EQ = |- !m n p. (m + p) < (n + p) = m < n #########EQ_MONO_ADD_EQ = |- !m n p. (m + p = n + p) = (m = n) #########LESS_EQ_MONO_ADD_EQ = |- !m n p. (m + p) <= (n + p) = m <= n ###########LESS_EQ_TRANS = |- !m n p. m <= n /\ n <= p ==> m <= p #############LESS_EQ_LESS_EQ_MONO = |- !m n p q. m <= p /\ n <= q ==> (m + n) <= (p + q) #######LESS_EQ_REFL = |- !m. m <= m #######LESS_IMP_LESS_OR_EQ = |- !m n. m < n ==> m <= n ##############LESS_MONO_MULT = |- !m n p. m <= n ==> (m * p) <= (n * p) ##################RIGHT_SUB_DISTRIB = |- !m n p. (m - n) * p = (m * p) - (n * p) ###########LEFT_SUB_DISTRIB = |- !m n p. p * (m - n) = (p * m) - (p * n) ################LESS_ADD_1 = |- !m n. n < m ==> (?p. m = n + (p + 1)) #############EXP_ADD = |- !p q n. n EXP (p + q) = (n EXP p) * (n EXP q) ##########NOT_ODD_EQ_EVEN = |- !n m. ~(SUC(n + n) = m + m) #######################MULT_SUC_EQ = |- !p m n. (n * (SUC p) = m * (SUC p)) = (n = m) ########MULT_EXP_MONO = |- !p q n m. (n * ((SUC q) EXP p) = m * ((SUC q) EXP p)) = (n = m) #########LESS_EQUAL_ANTISYM = |- !n m. n <= m /\ m <= n ==> (n = m) #########LESS_ADD_SUC = |- !m n. m < (m + (SUC n)) #########ZERO_LESS_EQ = |- !n. 0 <= n ######LESS_EQ_MONO = |- !n m. (SUC n) <= (SUC m) = n <= m #############LESS_OR_EQ_ADD = |- !n m. n < m \/ (?p. n = p + m) ############################lemma = |- ~(?n. P n /\ (!m. m < n ==> ~P m)) ==> (!n m. m < n ==> ~P m) ###############WOP = |- !P. (?n. P n) ==> (?n. P n /\ (!m. m < n ==> ~P m)) ###################exists_lemma = |- ?r q. k = (q * n) + r #############smallest_lemma = |- ?n'. (?q. k = (q * n) + n') /\ (!m. m < n' ==> (!q. ~(k = (q * n) + m))) ###########leq_add_lemma = |- !m n. n <= m ==> (?p. m = n + p) #####k_expr_lemma = |- (k = (q * n) + (n + p)) ==> (k = ((q + 1) * n) + p) ########less_add = . |- p < (n + p) #############DA = |- !k n. 0 < n ==> (?r q. (k = (q * n) + r) /\ r < n) #########Theory arithmetic loaded () : void #############MOD_exists = |- ?MOD. !n. 0 < n ==> (!k. ?q. (k = (q * n) + (MOD k n)) /\ (MOD k n) < n) ################MOD_DIV_exist = |- ?MOD DIV. !n. 0 < n ==> (!k. (k = ((DIV k n) * n) + (MOD k n)) /\ (MOD k n) < n) ####DIVISION = |- !n. 0 < n ==> (!k. (k = ((k DIV n) * n) + (k MOD n)) /\ (k MOD n) < n) ##() : void #############MOD_ONE = |- !k. k MOD (SUC 0) = 0 ################DIV_LESS_EQ = |- !n. 0 < n ==> (!k. (k DIV n) <= k) ###########################################################DIV_UNIQUE = |- !n k q. (?r. (k = (q * n) + r) /\ r < n) ==> (k DIV n = q) #########lemma = |- !n k q r. (k = (q * n) + r) /\ r < n ==> (k DIV n = q) #################MOD_UNIQUE = |- !n k r. (?q. (k = (q * n) + r) /\ r < n) ==> (k MOD n = r) ###############DIV_MULT = |- !n r. r < n ==> (!q. ((q * n) + r) DIV n = q) #########LESS_MOD = |- !n k. k < n ==> (k MOD n = k) ###########MOD_EQ_0 = |- !n. 0 < n ==> (!k. (k * n) MOD n = 0) ########ZERO_MOD = |- !n. 0 < n ==> (0 MOD n = 0) #########ZERO_DIV = |- !n. 0 < n ==> (0 DIV n = 0) #########MOD_MULT = |- !n r. r < n ==> (!q. ((q * n) + r) MOD n = r) ############MOD_TIMES = |- !n. 0 < n ==> (!q r. ((q * n) + r) MOD n = r MOD n) #############MOD_PLUS = |- !n. 0 < n ==> (!j k. ((j MOD n) + (k MOD n)) MOD n = (j + k) MOD n) ########MOD_MOD = |- !n. 0 < n ==> (!k. (k MOD n) MOD n = k MOD n) ###########SUB_MONO_EQ = |- !n m. (SUC n) - (SUC m) = n - m ##########SUB_PLUS = |- !a b c. a - (b + c) = (a - b) - c ######################INV_PRE_LESS = |- !m. 0 < m ==> (!n. (PRE m) < (PRE n) = m < n) ##########INV_PRE_LESS_EQ = |- !n. 0 < n ==> (!m. (PRE m) <= (PRE n) = m <= n) ########SUB_LESS_EQ = |- !n m. (n - m) <= n ##############SUB_EQ_EQ_0 = |- !m n. (m - n = m) = (m = 0) \/ (n = 0) ###########SUB_LESS_0 = |- !n m. m < n = 0 < (n - m) #########SUB_LESS_OR = |- !m n. n < m ==> n <= (m - 1) ################LESS_SUB_ADD_LESS = |- !n m i. i < (n - m) ==> (i + m) < n ########TIMES2 = |- !n. 2 * n = n + n #####################LESS_MULT_MONO = |- !m i n. ((SUC n) * m) < ((SUC n) * i) = m < i #######################MULT_MONO_EQ = |- !m i n. ((SUC n) * m = (SUC n) * i) = (m = i) ###########ADD_SUB = |- !a c. (a + c) - c = a ###############LESS_EQ_ADD_SUB = |- !c b. c <= b ==> (!a. (a + b) - c = a + (b - c)) ########SUB_EQUAL_0 = |- !c. c - c = 0 ##################LESS_EQ_SUB_LESS = |- !a b. b <= a ==> (!c. (a - b) < c = a < (b + c)) ######NOT_SUC_LESS_EQ = |- !n m. ~(SUC n) <= m = m <= n ###############SUB_SUB = |- !b c. c <= b ==> (!a. a - (b - c) = (a + c) - b) ###########LESS_IMP_LESS_ADD = |- !n m. n < m ==> (!p. n < (m + p)) ########LESS_EQ_IMP_LESS_SUC = |- !n m. n <= m ==> n < (SUC m) ###############SUB_LESS_EQ_ADD = |- !m p. m <= p ==> (!n. (p - m) <= n = p <= (m + n)) #############################SUB_CANCEL = |- !p n m. n <= p /\ m <= p ==> ((p - n = p - m) = (n = m)) ##########################CANCEL_SUB = |- !p n m. p <= n /\ p <= m ==> ((n - p = m - p) = (n = m)) ###########NOT_EXP_0 = |- !m n. ~((SUC n) EXP m = 0) ##########ZERO_LESS_EXP = |- !m n. 0 < ((SUC n) EXP m) ##########ODD_OR_EVEN = |- !n. ?m. (n = (SUC(SUC 0)) * m) \/ (n = ((SUC(SUC 0)) * m) + 1) ##########LESS_EXP_SUC_MONO = |- !n m. ((SUC(SUC m)) EXP n) < ((SUC(SUC m)) EXP (SUC n)) #########LESS_LESS_CASES = |- !m n. (m = n) \/ m < n \/ n < m #####GREATER_EQ = |- !n m. n >= m = m <= n ######LESS_EQ_CASES = |- !m n. m <= n \/ n <= m #######LESS_EQUAL_ADD = |- !m n. m <= n ==> (?p. n = m + p) ######LESS_EQ_EXISTS = |- !m n. m <= n = (?p. n = m + p) ####NOT_LESS_EQUAL = |- !m n. ~m <= n = n < m #######LESS_EQ_0 = |- !n. n <= 0 = (n = 0) ######MULT_EQ_0 = |- !m n. (m * n = 0) = (m = 0) \/ (n = 0) #####LESS_MULT2 = |- !m n. 0 < m /\ 0 < n ==> 0 < (m * n) #####LESS_EQ_LESS_TRANS = |- !m n p. m <= n /\ n < p ==> m < p #####LESS_LESS_EQ_TRANS = |- !m n p. m < n /\ n <= p ==> m < p #########FACT_LESS = |- !n. 0 < (FACT n) ########EVEN_ODD = |- !n. EVEN n = ~ODD n ####ODD_EVEN = |- !n. ODD n = ~EVEN n ####EVEN_OR_ODD = |- !n. EVEN n \/ ODD n ####EVEN_AND_ODD = |- !n. ~(EVEN n /\ ODD n) #####EVEN_ADD = |- !m n. EVEN(m + n) = (EVEN m = EVEN n) #####EVEN_MULT = |- !m n. EVEN(m * n) = EVEN m \/ EVEN n #####ODD_ADD = |- !m n. ODD(m + n) = ~(ODD m = ODD n) ####ODD_MULT = |- !m n. ODD(m * n) = ODD m /\ ODD n #####EVEN_DOUBLE = |- !n. EVEN(2 * n) ####ODD_DOUBLE = |- !n. ODD(SUC(2 * n)) ###########EVEN_ODD_EXISTS = |- !n. (EVEN n ==> (?m. n = 2 * m)) /\ (ODD n ==> (?m. n = SUC(2 * m))) ######EVEN_EXISTS = |- !n. EVEN n = (?m. n = 2 * m) ######ODD_EXISTS = |- !n. ODD n = (?m. n = SUC(2 * m)) ############EQ_LESS_EQ = |- !m n. (m = n) = m <= n /\ n <= m #######ADD_MONO_LESS_EQ = |- !m n p. (m + n) <= (m + p) = n <= p ######NOT_SUC_LESS_EQ_0 = |- !n. ~(SUC n) <= 0 ###########NOT_LEQ = |- !m n. ~m <= n = (SUC n) <= m #######NOT_NUM_EQ = |- !m n. ~(m = n) = (SUC m) <= n \/ (SUC n) <= m ######NOT_GREATER = |- !m n. ~m > n = m <= n ######NOT_GREATER_EQ = |- !m n. ~m >= n = (SUC m) <= n ########SUC_ONE_ADD = |- !n. SUC n = 1 + n ########SUC_ADD_SYM = |- !m n. SUC(m + n) = (SUC n) + m ########NOT_SUC_ADD_LESS_EQ = |- !m n. ~(SUC(m + n)) <= m #########################MULT_LESS_EQ_SUC = |- !m n p. m <= n = ((SUC p) * m) <= ((SUC p) * n) ################SUB_LEFT_ADD = |- !m n p. m + (n - p) = (n <= p => m | (m + n) - p) ################SUB_RIGHT_ADD = |- !m n p. (m - n) + p = (m <= n => p | (m + p) - n) ##############SUB_LEFT_SUB = |- !m n p. m - (n - p) = (n <= p => m | (m + p) - n) #########SUB_RIGHT_SUB = |- !m n p. (m - n) - p = m - (n + p) ###########SUB_LEFT_SUC = |- !m n. SUC(m - n) = (m <= n => SUC 0 | (SUC m) - n) ##########################SUB_LEFT_LESS_EQ = |- !m n p. m <= (n - p) = (m + p) <= n \/ m <= 0 #################SUB_RIGHT_LESS_EQ = |- !m n p. (m - n) <= p = m <= (n + p) #########SUB_LEFT_LESS = |- !m n p. m < (n - p) = (m + p) < n #################SUB_RIGHT_LESS = |- !m n p. (m - n) < p = m < (n + p) /\ 0 < p ############SUB_LEFT_GREATER_EQ = |- !m n p. m >= (n - p) = (m + p) >= n ############SUB_RIGHT_GREATER_EQ = |- !m n p. (m - n) >= p = m >= (n + p) \/ 0 >= p #########SUB_LEFT_GREATER = |- !m n p. m > (n - p) = (m + p) > n /\ m > 0 #########SUB_RIGHT_GREATER = |- !m n p. (m - n) > p = m > (n + p) #############SUB_LEFT_EQ = |- !m n p. (m = n - p) = (m + p = n) \/ m <= 0 /\ n <= p ##############SUB_RIGHT_EQ = |- !m n p. (m - n = p) = (m = n + p) \/ m <= n /\ p <= 0 #######ASSOC_ADD = |- ASSOC $+ ####RIGHT_ID_ADD_0 = |- RIGHT_ID $+ 0 ####LEFT_ID_ADD_0 = |- LEFT_ID $+ 0 #####MONOID_ADD_0 = |- MONOID $+ 0 ####ASSOC_MULT = |- ASSOC $* ####RIGHT_ID_MULT_1 = |- RIGHT_ID $* 1 ####LEFT_ID_MULT_1 = |- LEFT_ID $* 1 ####MONOID_MULT_1 = |- MONOID $* 1 ##=======> theory arithmetic built cd /build/reproducible-path/hol88-2.02.19940316dfsg/theories; rm -f list.th;\ /build/reproducible-path/hol88-2.02.19940316dfsg/basic-hol < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_list.ml;\ /build/reproducible-path/hol88-2.02.19940316dfsg/basic-hol < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_list_defs.ml;\ /build/reproducible-path/hol88-2.02.19940316dfsg/basic-hol < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_list_thms.ml;\ cd /build/reproducible-path/hol88-2.02.19940316dfsg BASIC-HOL version 2.02 (GCL) created 25/8/25 ##################################() : void ###Theory arithmetic loaded () : void ###NOT_LESS_0 = |- !n. ~n < 0 #PRIM_REC_THM = |- !x f. (PRIM_REC x f 0 = x) /\ (!m. PRIM_REC x f(SUC m) = f(PRIM_REC x f m)m) #PRE = |- (PRE 0 = 0) /\ (!m. PRE(SUC m) = m) #LESS_0 = |- !n. 0 < (SUC n) ###NOT_SUC = |- !n. ~(SUC n = 0) #INDUCTION = |- !P. P 0 /\ (!n. P n ==> P(SUC n)) ==> (!n. P n) ###ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) #LESS_ADD_1 = |- !m n. n < m ==> (?p. m = n + (p + 1)) #LESS_EQ = |- !m n. m < n = (SUC m) <= n #NOT_LESS = |- !m n. ~m < n = n <= m #LESS_EQ_ADD = |- !m n. m <= (m + n) #num_CASES = |- !m. (m = 0) \/ (?n. m = SUC n) #LESS_MONO_EQ = |- !m n. (SUC m) < (SUC n) = m < n ########### Section INDUCT_THEN begun BETAS = - : (term -> term -> conv) GTAC = - : (term -> tactic) TACF = - : (term -> term -> thm_tactic -> tactic) TACS = - : (term -> term -> thm_tactic -> tactic list) GOALS = - : (* -> ((* # term) -> (** # ***)) list -> term -> (** list # *** list)) GALPH = - : conv GALPHA = - : conv mapshape = - : (int list -> (* list -> **) list -> * list -> ** list) INDUCT_THEN = - : (thm -> thm_tactic -> tactic) - : (thm -> thm_tactic -> tactic) Section INDUCT_THEN ended INDUCT_THEN = - : (thm -> thm_tactic -> tactic) File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/ind.ml loaded () : void #####INDUCT_TAC = - : tactic #### num_CONV = - : conv File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/numconv.ml loaded () : void ######IS_list_REP = |- !r. IS_list_REP r = (?f n. r = (\m. (m < n => f m | (@x. T))),n) ########EXISTS_list_REP = |- ?p. IS_list_REP p #####list_TY_DEF = |- ?rep. TYPE_DEFINITION IS_list_REP rep ##########list_ISO_DEF = |- (!a. ABS_list(REP_list a) = a) /\ (!r. IS_list_REP r = (REP_list(ABS_list r) = r)) #####R_ONTO = |- !r. IS_list_REP r = (?a. r = REP_list a) A_11 = |- !r r'. IS_list_REP r ==> IS_list_REP r' ==> ((ABS_list r = ABS_list r') = (r = r')) A_R = |- !a. ABS_list(REP_list a) = a R_A = |- !r. IS_list_REP r = (REP_list(ABS_list r) = r) ########NIL_DEF = |- [] = ABS_list((\n. @e. T),0) #######CONS_DEF = |- !h t. CONS h t = ABS_list ((\m. ((m = 0) => h | FST(REP_list t)(PRE m))),SUC(SND(REP_list t))) ##() : void #######################lemma1 = |- !x f. ?fn. (!g. fn(g,0) = x) /\ (!g n. fn(g,n + 1) = f(fn((\i. g(i + 1)),n))(g 0)(ABS_list((\i. g(i + 1)),n))) ######NIL_lemma = |- REP_list[] = (\n. @x. T),0 ######REP_lemma = |- IS_list_REP(REP_list l) ########################CONS_lemma = |- REP_list(CONS h t) = (\m. ((m = 0) => h | FST(REP_list t)(PRE m))),SUC(SND(REP_list t)) #############exists_lemma = |- !x f. ?fn. (fn[] = x) /\ (!h t. fn(CONS h t) = f(fn t)h t) ####A_11_lemma = |- (IS_list_REP r' /\ IS_list_REP r) /\ (r = r') ==> (ABS_list r = ABS_list r') #########R_A_lemma = |- REP_list(ABS_list((\m. (m < n => f(SUC m) | (@x. T))),n)) = (\m. (m < n => f(SUC m) | (@x. T))),n #####################cons_lemma = |- ABS_list((\m. (m < (SUC n) => f m | (@x. T))),SUC n) = CONS(f 0)(ABS_list((\m. (m < n => f(SUC m) | (@x. T))),n)) ###########################list_Axiom = |- !x f. ?! fn. (fn[] = x) /\ (!h t. fn(CONS h t) = f(fn t)h t) ## BASIC-HOL version 2.02 (GCL) created 25/8/25 #################################Theory list loaded () : void #Theory combin loaded () : void #####list_Axiom = |- !x f. ?! fn. (fn[] = x) /\ (!h t. fn(CONS h t) = f(fn t)h t) ##num_Axiom = |- !e f. ?! fn. (fn 0 = e) /\ (!n. fn(SUC n) = f(fn n)n) #PRE = |- (PRE 0 = 0) /\ (!m. PRE(SUC m) = m) ##UNCURRY_DEF = |- !f x y. UNCURRY f(x,y) = f x y #o_DEF = |- !f g. f o g = (\x. f(g x)) ################################# Section INDUCT_THEN begun BETAS = - : (term -> term -> conv) GTAC = - : (term -> tactic) TACF = - : (term -> term -> thm_tactic -> tactic) TACS = - : (term -> term -> thm_tactic -> tactic list) GOALS = - : (* -> ((* # term) -> (** # ***)) list -> term -> (** list # *** list)) GALPH = - : conv GALPHA = - : conv mapshape = - : (int list -> (* list -> **) list -> * list -> ** list) INDUCT_THEN = - : (thm -> thm_tactic -> tactic) - : (thm -> thm_tactic -> tactic) Section INDUCT_THEN ended INDUCT_THEN = - : (thm -> thm_tactic -> tactic) File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/ind.ml loaded () : void #####INDUCT_TAC = - : tactic ########## Section prove_rec_fn_exists begun derive_existence_thm = - : (thm -> conv) mk_fn = - : ((term # term # term list # term # goal) -> (term # term list # thm)) instantiate_existence_thm = - : (thm -> conv) closeup = - : (term -> term) prove_rec_fn_exists = - : (thm -> conv) - : (thm -> conv) Section prove_rec_fn_exists ended prove_rec_fn_exists = - : (thm -> conv) new_recursive_definition = - : (bool -> thm -> string -> conv) File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/prim_rec.ml loaded () : void ###### () : void Section prove_induction_thm begun UNIQUENESS = - : (thm -> thm) DEPTH_FORALL_CONV = - : (conv -> conv) CONJS_CONV = - : (conv -> conv) CONJS_SIMP = - : (conv -> conv) T_AND_CONV = - : conv GENL_T = - : (term list -> thm) SIMP_CONV = - : conv HYP_SIMP = - : conv ANTE_ALL_CONV = - : conv CONCL_SIMP = - : conv prove_induction_thm = - : (thm -> thm) - : (thm -> thm) Section prove_induction_thm ended prove_induction_thm = - : (thm -> thm) Section prove_cases_thm begun NOT_ALL_THENC = - : (conv -> conv) BASE_CONV = - : conv STEP_CONV = - : conv NOT_IN_CONV = - : conv STEP_SIMP = - : conv DISJS_CHAIN = - : (conv -> thm -> thm) prove_cases_thm = - : (thm -> thm) - : (thm -> thm) Section prove_cases_thm ended prove_cases_thm = - : (thm -> thm) Section prove_constructors_one_one begun PAIR_EQ_CONV = - : conv list_variant = - : (term list -> term list -> term list) prove_const_one_one = - : (thm -> conv) prove_constructors_one_one = - : (thm -> thm) - : (thm -> thm) Section prove_constructors_one_one ended prove_constructors_one_one = - : (thm -> thm) prove_constructors_distinct = - : (thm -> thm) File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/tyfns.ml loaded () : void ####LIST_INDUCT_TAC = - : tactic ## num_CONV = - : conv File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/numconv.ml loaded () : void ########NULL_DEF = |- (NULL[] = T) /\ (!h t. NULL(CONS h t) = F) ####HD = |- !h t. HD(CONS h t) = h ####TL = |- !h t. TL(CONS h t) = t ###new_list_rec_definition = - : ((string # term) -> thm) ########SNOC = |- (!x. SNOC x[] = [x]) /\ (!x x' l. SNOC x(CONS x' l) = CONS x'(SNOC x l)) ##########FOLDR = |- (!f e. FOLDR f e[] = e) /\ (!f e x l. FOLDR f e(CONS x l) = f x(FOLDR f e l)) ####FOLDL = |- (!f e. FOLDL f e[] = e) /\ (!f e x l. FOLDL f e(CONS x l) = FOLDL f(f e x)l) ###########FILTER = |- (!P. FILTER P[] = []) /\ (!P x l. FILTER P(CONS x l) = (P x => CONS x(FILTER P l) | FILTER P l)) ############SCANL = |- (!f e. SCANL f e[] = [e]) /\ (!f e x l. SCANL f e(CONS x l) = CONS e(SCANL f(f e x)l)) #####SCANR = |- (!f e. SCANR f e[] = [e]) /\ (!f e x l. SCANR f e(CONS x l) = CONS(f x(HD(SCANR f e l)))(SCANR f e l)) ############REVERSE = |- (REVERSE[] = []) /\ (!x l. REVERSE(CONS x l) = SNOC x(REVERSE l)) ###########APPEND = |- (!l. APPEND[]l = l) /\ (!l1 l2 h. APPEND(CONS h l1)l2 = CONS h(APPEND l1 l2)) ###########FLAT = |- (FLAT[] = []) /\ (!h t. FLAT(CONS h t) = APPEND h(FLAT t)) ##########LENGTH = |- (LENGTH[] = 0) /\ (!h t. LENGTH(CONS h t) = SUC(LENGTH t)) ##########MAP = |- (!f. MAP f[] = []) /\ (!f h t. MAP f(CONS h t) = CONS(f h)(MAP f t)) #############################MAP2 = |- (!f. MAP2 f[][] = []) /\ (!f h1 t1 h2 t2. MAP2 f(CONS h1 t1)(CONS h2 t2) = CONS(f h1 h2)(MAP2 f t1 t2)) #################ALL_EL = |- (!P. ALL_EL P[] = T) /\ (!P x l. ALL_EL P(CONS x l) = P x /\ ALL_EL P l) #########SOME_EL = |- (!P. SOME_EL P[] = F) /\ (!P x l. SOME_EL P(CONS x l) = P x \/ SOME_EL P l) ########IS_EL_DEF = |- !x l. IS_EL x l = SOME_EL($= x)l ###AND_EL_DEF = |- AND_EL = ALL_EL I ###OR_EL_DEF = |- OR_EL = SOME_EL I #####################FIRSTN = |- (!l. FIRSTN 0 l = []) /\ (!n x l. FIRSTN(SUC n)(CONS x l) = CONS x(FIRSTN n l)) ###########BUTFIRSTN = |- (!l. BUTFIRSTN 0 l = l) /\ (!n x l. BUTFIRSTN(SUC n)(CONS x l) = BUTFIRSTN n l) ###############SEG = |- (!k l. SEG 0 k l = []) /\ (!m x l. SEG(SUC m)0(CONS x l) = CONS x(SEG m 0 l)) /\ (!m k x l. SEG(SUC m)(SUC k)(CONS x l) = SEG(SUC m)k l) ######LAST_DEF = |- !l. LAST l = HD(SEG 1(PRE(LENGTH l))l) ###BUTLAST_DEF = |- !l. BUTLAST l = SEG(PRE(LENGTH l))0 l ####LENGTH_SNOC = |- !x l. LENGTH(SNOC x l) = SUC(LENGTH l) ###########LAST = |- !x l. LAST(SNOC x l) = x #########BUTLAST = |- !x l. BUTLAST(SNOC x l) = l ###########LASTN = |- (!l. LASTN 0 l = []) /\ (!n x l. LASTN(SUC n)(SNOC x l) = SNOC x(LASTN n l)) ###########BUTLASTN = |- (!l. BUTLASTN 0 l = l) /\ (!n x l. BUTLASTN(SUC n)(SNOC x l) = BUTLASTN n l) ###########EL = |- (!l. EL 0 l = HD l) /\ (!l n. EL(SUC n)l = EL n(TL l)) ####ELL = |- (!l. ELL 0 l = LAST l) /\ (!n l. ELL(SUC n)l = ELL n(BUTLAST l)) ################################IS_PREFIX = |- (!l. IS_PREFIX l[] = T) /\ (!x l. IS_PREFIX[](CONS x l) = F) /\ (!x1 l1 x2 l2. IS_PREFIX(CONS x1 l1)(CONS x2 l2) = (x1 = x2) /\ IS_PREFIX l1 l2) #####REVERSE_SNOC = |- !x l. REVERSE(SNOC x l) = CONS x(REVERSE l) ###REVERSE_REVERSE = |- !l. REVERSE(REVERSE l) = l ######forall_REVERSE = |- !P. (!l. P(REVERSE l)) = (!l. P l) ########f_REVERSE_lemma = |- !f1 f2. ((\x. f1(REVERSE x)) = (\x. f2(REVERSE x))) = (f1 = f2) #######################SNOC_Axiom = |- !e f. ?! fn. (fn[] = e) /\ (!x l. fn(SNOC x l) = f(fn l)x l) ####################################IS_SUFFIX = |- (!l. IS_SUFFIX l[] = T) /\ (!x l. IS_SUFFIX[](SNOC x l) = F) /\ (!x1 l1 x2 l2. IS_SUFFIX(SNOC x1 l1)(SNOC x2 l2) = (x1 = x2) /\ IS_SUFFIX l1 l2) ################IS_SUBLIST = |- (!l. IS_SUBLIST l[] = T) /\ (!x l. IS_SUBLIST[](CONS x l) = F) /\ (!x1 l1 x2 l2. IS_SUBLIST(CONS x1 l1)(CONS x2 l2) = (x1 = x2) /\ IS_PREFIX l1 l2 \/ IS_SUBLIST l1(CONS x2 l2)) ######SPLITP = |- (!P. SPLITP P[] = [],[]) /\ (!P x l. SPLITP P(CONS x l) = (P x => ([],CONS x l) | (CONS x(FST(SPLITP P l)),SND(SPLITP P l)))) ###PREFIX_DEF = |- !P l. PREFIX P l = FST(SPLITP($~ o P)l) ###SUFFIX_DEF = |- !P l. SUFFIX P l = FOLDL(\l' x. (P x => SNOC x l' | []))[]l ######################ZIP = |- (ZIP([],[]) = []) /\ (!x1 l1 x2 l2. ZIP(CONS x1 l1,CONS x2 l2) = CONS(x1,x2)(ZIP(l1,l2))) #####UNZIP = |- (UNZIP[] = [],[]) /\ (!x l. UNZIP(CONS x l) = CONS(FST x)(FST(UNZIP l)),CONS(SND x)(SND(UNZIP l))) ###UNZIP_FST_DEF = |- !l. UNZIP_FST l = FST(UNZIP l) ###UNZIP_SND_DEF = |- !l. UNZIP_SND l = SND(UNZIP l) #########SUM = |- (SUM[] = 0) /\ (!h t. SUM(CONS h t) = h + (SUM t)) ##########GENLIST = |- (!f. GENLIST f 0 = []) /\ (!f n. GENLIST f(SUC n) = SNOC(f n)(GENLIST f n)) ####REPLICATE = |- (!x. REPLICATE 0 x = []) /\ (!n x. REPLICATE(SUC n)x = CONS x(REPLICATE n x)) ##() : void ## BASIC-HOL version 2.02 (GCL) created 25/8/25 ###############################Theory list loaded () : void #####list_Axiom = |- !x f. ?! fn. (fn[] = x) /\ (!h t. fn(CONS h t) = f(fn t)h t) #NULL_DEF = |- (NULL[] = T) /\ (!h t. NULL(CONS h t) = F) #HD = |- !h t. HD(CONS h t) = h #TL = |- !h t. TL(CONS h t) = t #SNOC = |- (!x. SNOC x[] = [x]) /\ (!x x' l. SNOC x(CONS x' l) = CONS x'(SNOC x l)) #FOLDR = |- (!f e. FOLDR f e[] = e) /\ (!f e x l. FOLDR f e(CONS x l) = f x(FOLDR f e l)) #FOLDL = |- (!f e. FOLDL f e[] = e) /\ (!f e x l. FOLDL f e(CONS x l) = FOLDL f(f e x)l) #FILTER = |- (!P. FILTER P[] = []) /\ (!P x l. FILTER P(CONS x l) = (P x => CONS x(FILTER P l) | FILTER P l)) #MAP = |- (!f. MAP f[] = []) /\ (!f h t. MAP f(CONS h t) = CONS(f h)(MAP f t)) #MAP2 = |- (!f. MAP2 f[][] = []) /\ (!f h1 t1 h2 t2. MAP2 f(CONS h1 t1)(CONS h2 t2) = CONS(f h1 h2)(MAP2 f t1 t2)) #SCANR = |- (!f e. SCANR f e[] = [e]) /\ (!f e x l. SCANR f e(CONS x l) = CONS(f x(HD(SCANR f e l)))(SCANR f e l)) #SCANL = |- (!f e. SCANL f e[] = [e]) /\ (!f e x l. SCANL f e(CONS x l) = CONS e(SCANL f(f e x)l)) #SEG = |- (!k l. SEG 0 k l = []) /\ (!m x l. SEG(SUC m)0(CONS x l) = CONS x(SEG m 0 l)) /\ (!m k x l. SEG(SUC m)(SUC k)(CONS x l) = SEG(SUC m)k l) #REVERSE = |- (REVERSE[] = []) /\ (!x l. REVERSE(CONS x l) = SNOC x(REVERSE l)) #APPEND = |- (!l. APPEND[]l = l) /\ (!l1 l2 h. APPEND(CONS h l1)l2 = CONS h(APPEND l1 l2)) #FLAT = |- (FLAT[] = []) /\ (!h t. FLAT(CONS h t) = APPEND h(FLAT t)) #LENGTH = |- (LENGTH[] = 0) /\ (!h t. LENGTH(CONS h t) = SUC(LENGTH t)) #ALL_EL = |- (!P. ALL_EL P[] = T) /\ (!P x l. ALL_EL P(CONS x l) = P x /\ ALL_EL P l) #SOME_EL = |- (!P. SOME_EL P[] = F) /\ (!P x l. SOME_EL P(CONS x l) = P x \/ SOME_EL P l) #IS_EL_DEF = |- !x l. IS_EL x l = SOME_EL($= x)l #AND_EL_DEF = |- AND_EL = ALL_EL I #OR_EL_DEF = |- OR_EL = SOME_EL I #FIRSTN = |- (!l. FIRSTN 0 l = []) /\ (!n x l. FIRSTN(SUC n)(CONS x l) = CONS x(FIRSTN n l)) #BUTFIRSTN = |- (!l. BUTFIRSTN 0 l = l) /\ (!n x l. BUTFIRSTN(SUC n)(CONS x l) = BUTFIRSTN n l) #LASTN = |- (!l. LASTN 0 l = []) /\ (!n x l. LASTN(SUC n)(SNOC x l) = SNOC x(LASTN n l)) #BUTLASTN = |- (!l. BUTLASTN 0 l = l) /\ (!n x l. BUTLASTN(SUC n)(SNOC x l) = BUTLASTN n l) #LAST_DEF = |- !l. LAST l = HD(SEG 1(PRE(LENGTH l))l) #BUTLAST_DEF = |- !l. BUTLAST l = SEG(PRE(LENGTH l))0 l #EL = |- (!l. EL 0 l = HD l) /\ (!l n. EL(SUC n)l = EL n(TL l)) #ELL = |- (!l. ELL 0 l = LAST l) /\ (!n l. ELL(SUC n)l = ELL n(BUTLAST l)) #IS_PREFIX = |- (!l. IS_PREFIX l[] = T) /\ (!x l. IS_PREFIX[](CONS x l) = F) /\ (!x1 l1 x2 l2. IS_PREFIX(CONS x1 l1)(CONS x2 l2) = (x1 = x2) /\ IS_PREFIX l1 l2) #IS_SUFFIX = |- (!l. IS_SUFFIX l[] = T) /\ (!x l. IS_SUFFIX[](SNOC x l) = F) /\ (!x1 l1 x2 l2. IS_SUFFIX(SNOC x1 l1)(SNOC x2 l2) = (x1 = x2) /\ IS_SUFFIX l1 l2) #IS_SUBLIST = |- (!l. IS_SUBLIST l[] = T) /\ (!x l. IS_SUBLIST[](CONS x l) = F) /\ (!x1 l1 x2 l2. IS_SUBLIST(CONS x1 l1)(CONS x2 l2) = (x1 = x2) /\ IS_PREFIX l1 l2 \/ IS_SUBLIST l1(CONS x2 l2)) #SPLITP = |- (!P. SPLITP P[] = [],[]) /\ (!P x l. SPLITP P(CONS x l) = (P x => ([],CONS x l) | (CONS x(FST(SPLITP P l)),SND(SPLITP P l)))) #PREFIX_DEF = |- !P l. PREFIX P l = FST(SPLITP($~ o P)l) #SUFFIX_DEF = |- !P l. SUFFIX P l = FOLDL(\l' x. (P x => SNOC x l' | []))[]l #ZIP = |- (ZIP([],[]) = []) /\ (!x1 l1 x2 l2. ZIP(CONS x1 l1,CONS x2 l2) = CONS(x1,x2)(ZIP(l1,l2))) #UNZIP = |- (UNZIP[] = [],[]) /\ (!x l. UNZIP(CONS x l) = CONS(FST x)(FST(UNZIP l)),CONS(SND x)(SND(UNZIP l))) #UNZIP_FST_DEF = |- !l. UNZIP_FST l = FST(UNZIP l) #UNZIP_SND_DEF = |- !l. UNZIP_SND l = SND(UNZIP l) #SUM = |- (SUM[] = 0) /\ (!h t. SUM(CONS h t) = h + (SUM t)) #GENLIST = |- (!f. GENLIST f 0 = []) /\ (!f n. GENLIST f(SUC n) = SNOC(f n)(GENLIST f n)) #REPLICATE = |- (!x. REPLICATE 0 x = []) /\ (!n x. REPLICATE(SUC n)x = CONS x(REPLICATE n x)) #####NOT_SUC = |- !n. ~(SUC n = 0) #INV_SUC = |- !m n. (SUC m = SUC n) ==> (m = n) #INDUCTION = |- !P. P 0 /\ (!n. P n ==> P(SUC n)) ==> (!n. P n) ##############################[(); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); ()] : void list #####################################################################################################[(); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); ()] : void list #######ASSOC_DEF = |- !f. ASSOC f = (!x y z. f x(f y z) = f(f x y)z) #COMM_DEF = |- !f. COMM f = (!x y. f x y = f y x) #FCOMM_DEF = |- !f g. FCOMM f g = (!x y z. g x(f y z) = f(g x y)z) #RIGHT_ID_DEF = |- !f e. RIGHT_ID f e = (!x. f x e = x) #LEFT_ID_DEF = |- !f e. LEFT_ID f e = (!x. f e x = x) #MONOID_DEF = |- !f e. MONOID f e = ASSOC f /\ RIGHT_ID f e /\ LEFT_ID f e ##ASSOC_CONJ = |- ASSOC $/\ #ASSOC_DISJ = |- ASSOC $\/ #FCOMM_ASSOC = |- !f. FCOMM f f = ASSOC f #MONOID_CONJ_T = |- MONOID $/\ T #MONOID_DISJ_F = |- MONOID $/\ T ####o_DEF = |- !f g. f o g = (\x. f(g x)) #o_THM = |- !f g x. (f o g)x = f(g x) #I_THM = |- !x. I x = x ##UNCURRY_DEF = |- !f x y. UNCURRY f(x,y) = f x y ######### Section INDUCT_THEN begun BETAS = - : (term -> term -> conv) GTAC = - : (term -> tactic) TACF = - : (term -> term -> thm_tactic -> tactic) TACS = - : (term -> term -> thm_tactic -> tactic list) GOALS = - : (* -> ((* # term) -> (** # ***)) list -> term -> (** list # *** list)) GALPH = - : conv GALPHA = - : conv mapshape = - : (int list -> (* list -> **) list -> * list -> ** list) INDUCT_THEN = - : (thm -> thm_tactic -> tactic) - : (thm -> thm_tactic -> tactic) Section INDUCT_THEN ended INDUCT_THEN = - : (thm -> thm_tactic -> tactic) File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/ind.ml loaded () : void #####INDUCT_TAC = - : tactic ########## Section prove_rec_fn_exists begun derive_existence_thm = - : (thm -> conv) mk_fn = - : ((term # term # term list # term # goal) -> (term # term list # thm)) instantiate_existence_thm = - : (thm -> conv) closeup = - : (term -> term) prove_rec_fn_exists = - : (thm -> conv) - : (thm -> conv) Section prove_rec_fn_exists ended prove_rec_fn_exists = - : (thm -> conv) new_recursive_definition = - : (bool -> thm -> string -> conv) File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/prim_rec.ml loaded () : void ###### () : void Section prove_induction_thm begun UNIQUENESS = - : (thm -> thm) DEPTH_FORALL_CONV = - : (conv -> conv) CONJS_CONV = - : (conv -> conv) CONJS_SIMP = - : (conv -> conv) T_AND_CONV = - : conv GENL_T = - : (term list -> thm) SIMP_CONV = - : conv HYP_SIMP = - : conv ANTE_ALL_CONV = - : conv CONCL_SIMP = - : conv prove_induction_thm = - : (thm -> thm) - : (thm -> thm) Section prove_induction_thm ended prove_induction_thm = - : (thm -> thm) Section prove_cases_thm begun NOT_ALL_THENC = - : (conv -> conv) BASE_CONV = - : conv STEP_CONV = - : conv NOT_IN_CONV = - : conv STEP_SIMP = - : conv DISJS_CHAIN = - : (conv -> thm -> thm) prove_cases_thm = - : (thm -> thm) - : (thm -> thm) Section prove_cases_thm ended prove_cases_thm = - : (thm -> thm) Section prove_constructors_one_one begun PAIR_EQ_CONV = - : conv list_variant = - : (term list -> term list -> term list) prove_const_one_one = - : (thm -> conv) prove_constructors_one_one = - : (thm -> thm) - : (thm -> thm) Section prove_constructors_one_one ended prove_constructors_one_one = - : (thm -> thm) prove_constructors_distinct = - : (thm -> thm) File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/tyfns.ml loaded () : void ## num_CONV = - : conv File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/numconv.ml loaded () : void #########NULL = |- NULL[] /\ (!h t. ~NULL(CONS h t)) ######list_INDUCT = |- !P. P[] /\ (!t. P t ==> (!h. P(CONS h t))) ==> (!l. P l) ###LIST_INDUCT_TAC = - : tactic ####list_CASES = |- !l. (l = []) \/ (?t h. l = CONS h t) ####CONS_11 = |- !h t h' t'. (CONS h t = CONS h' t') = (h = h') /\ (t = t') ###NOT_NIL_CONS = |- !h t. ~([] = CONS h t) ####NOT_CONS_NIL = |- !h t. ~(CONS h t = []) ######LIST_NOT_EQ = |- !l1 l2. ~(l1 = l2) ==> (!h1 h2. ~(CONS h1 l1 = CONS h2 l2)) ######NOT_EQ_LIST = |- !h1 h2. ~(h1 = h2) ==> (!l1 l2. ~(CONS h1 l1 = CONS h2 l2)) ######EQ_LIST = |- !h1 h2. (h1 = h2) ==> (!l1 l2. (l1 = l2) ==> (CONS h1 l1 = CONS h2 l2)) #########CONS = |- !l. ~NULL l ==> (CONS(HD l)(TL l) = l) ########APPEND_ASSOC = |- !l1 l2 l3. APPEND l1(APPEND l2 l3) = APPEND(APPEND l1 l2)l3 #######Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) LENGTH_APPEND = |- !l1 l2. LENGTH(APPEND l1 l2) = (LENGTH l1) + (LENGTH l2) ########MAP_APPEND = |- !f l1 l2. MAP f(APPEND l1 l2) = APPEND(MAP f l1)(MAP f l2) ######LENGTH_MAP = |- !l f. LENGTH(MAP f l) = LENGTH l #########################################LENGTH_NIL = |- !l. (LENGTH l = 0) = (l = []) ##############Theorem INV_SUC_EQ autoloading from theory `prim_rec` ... INV_SUC_EQ = |- !m n. (SUC m = SUC n) = (m = n) LENGTH_CONS = |- !l n. (LENGTH l = SUC n) = (?h l'. (LENGTH l' = n) /\ (l = CONS h l')) #################LENGTH_EQ_SUC = |- !P n. (!l. (LENGTH l = SUC n) ==> P l) = (!l. (LENGTH l = n) ==> (\l. !x. P(CONS x l))l) ###########LENGTH_EQ_NIL = |- !P. (!l. (LENGTH l = 0) ==> P l) = P[] ####################Theorem SUC_NOT autoloading from theory `arithmetic` ... SUC_NOT = |- !n. ~(0 = SUC n) LENGTH_MAP2 = |- !l1 l2. (LENGTH l1 = LENGTH l2) ==> (!f. (LENGTH(MAP2 f l1 l2) = LENGTH l1) /\ (LENGTH(MAP2 f l1 l2) = LENGTH l2)) ## Section begun chk_var = - : (term list -> term -> bool) FORALL_PERM_RULE = - : (term list -> thm -> thm) FORALL_PERM_CONV = - : (term list -> conv) FORALL_PERM_TAC = - : (term list -> tactic) ((-), (-), -) : ((term list -> thm -> thm) # (term list -> conv) # (term list -> tactic)) Section ended FORALL_PERM_RULE = - : (term list -> thm -> thm) FORALL_PERM_CONV = - : (term list -> conv) FORALL_PERM_TAC = - : (term list -> tactic) NULL_EQ_NIL = |- !l. NULL l = (l = []) LENGTH_EQ = |- !x y. (x = y) ==> (LENGTH x = LENGTH y) Theorem LESS_0 autoloading from theory `prim_rec` ... LESS_0 = |- !n. 0 < (SUC n) Theorem NOT_LESS_0 autoloading from theory `prim_rec` ... NOT_LESS_0 = |- !n. ~n < 0 LENGTH_NOT_NULL = |- !l. 0 < (LENGTH l) = ~NULL l REVERSE_SNOC = |- !x l. REVERSE(SNOC x l) = CONS x(REVERSE l) REVERSE_REVERSE = |- !l. REVERSE(REVERSE l) = l forall_REVERSE = |- !P. (!l. P(REVERSE l)) = (!l. P l) f_REVERSE_lemma = |- !f1 f2. ((\x. f1(REVERSE x)) = (\x. f2(REVERSE x))) = (f1 = f2) SNOC_Axiom = |- !e f. ?! fn. (fn[] = e) /\ (!x l. fn(SNOC x l) = f(fn l)x l) SNOC_INDUCT = |- !P. P[] /\ (!l. P l ==> (!x. P(SNOC x l))) ==> (!l. P l) SNOC_CASES = |- !l. (l = []) \/ (?l' x. l = SNOC x l') LENGTH_SNOC = |- !x l. LENGTH(SNOC x l) = SUC(LENGTH l) NOT_NULL_SNOC = |- !x l. ~NULL(SNOC x l) NOT_NIL_SNOC = |- !x l. ~([] = SNOC x l) NOT_SNOC_NIL = |- !x l. ~(SNOC x l = []) SNOC_11 = |- !x l x' l'. (SNOC x l = SNOC x' l') = (x = x') /\ (l = l') Theorem ADD1 autoloading from theory `arithmetic` ... ADD1 = |- !m. SUC m = m + 1 Theorem EQ_MONO_ADD_EQ autoloading from theory `arithmetic` ... EQ_MONO_ADD_EQ = |- !m n p. (m + p = n + p) = (m = n) SNOC_EQ_LENGTH_EQ = |- !x1 l1 x2 l2. (SNOC x1 l1 = SNOC x2 l2) ==> (LENGTH l1 = LENGTH l2) SNOC_REVERSE_CONS = |- !x l. SNOC x l = REVERSE(CONS x(REVERSE l)) SNOC_APPEND = |- !x l. SNOC x l = APPEND l[x] MAP_SNOC = |- !f x l. MAP f(SNOC x l) = SNOC(f x)(MAP f l) FOLDR_SNOC = |- !f e x l. FOLDR f e(SNOC x l) = FOLDR f(f x e)l FOLDL_SNOC = |- !f e x l. FOLDL f e(SNOC x l) = f(FOLDL f e l)x SNOC_INDUCT_TAC = - : tactic FOLDR_FOLDL = |- !f e. MONOID f e ==> (!l. FOLDR f e l = FOLDL f e l) LENGTH_FOLDR = |- !l. LENGTH l = FOLDR(\x l'. SUC l')0 l LENGTH_FOLDL = |- !l. LENGTH l = FOLDL(\l' x. SUC l')0 l MAP_FOLDR = |- !f l. MAP f l = FOLDR(\x l'. CONS(f x)l')[]l MAP_FOLDL = |- !f l. MAP f l = FOLDL(\l' x. SNOC(f x)l')[]l MAP_o = |- !f g. MAP(f o g) = (MAP f) o (MAP g) MAP_MAP_o = |- !f g l. MAP f(MAP g l) = MAP(f o g)l FILTER_FOLDR = |- !P l. FILTER P l = FOLDR(\x l'. (P x => CONS x l' | l'))[]l FILTER_SNOC = |- !P x l. FILTER P(SNOC x l) = (P x => SNOC x(FILTER P l) | FILTER P l) FILTER_FOLDL = |- !P l. FILTER P l = FOLDL(\l' x. (P x => SNOC x l' | l'))[]l FILTER_COMM = |- !f1 f2 l. FILTER f1(FILTER f2 l) = FILTER f2(FILTER f1 l) FILTER_IDEM = |- !f l. FILTER f(FILTER f l) = FILTER f l FILTER_MAP = |- !f1 f2 l. FILTER f1(MAP f2 l) = MAP f2(FILTER(f1 o f2)l) Theorem ADD_SUC autoloading from theory `arithmetic` ... ADD_SUC = |- !m n. SUC(m + n) = m + (SUC n) Theorem LESS_EQ_MONO autoloading from theory `arithmetic` ... LESS_EQ_MONO = |- !n m. (SUC n) <= (SUC m) = n <= m Definition ADD autoloading from theory `arithmetic` ... ADD = |- (!n. 0 + n = n) /\ (!m n. (SUC m) + n = SUC(m + n)) Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) Theorem ADD_0 autoloading from theory `arithmetic` ... ADD_0 = |- !m. m + 0 = m LENGTH_SEG = |- !n k l. (n + k) <= (LENGTH l) ==> (LENGTH(SEG n k l) = n) APPEND_NIL = |- (!l. APPEND l[] = l) /\ (!l. APPEND[]l = l) APPEND_SNOC = |- !l1 x l2. APPEND l1(SNOC x l2) = SNOC x(APPEND l1 l2) REVERSE_APPEND = |- !l1 l2. REVERSE(APPEND l1 l2) = APPEND(REVERSE l2)(REVERSE l1) APPEND_FOLDR = |- !l1 l2. APPEND l1 l2 = FOLDR CONS l2 l1 APPEND_FOLDL = |- !l1 l2. APPEND l1 l2 = FOLDL(\l' x. SNOC x l')l1 l2 FOLDR_APPEND = |- !f e l1 l2. FOLDR f e(APPEND l1 l2) = FOLDR f(FOLDR f e l2)l1 FOLDL_APPEND = |- !f e l1 l2. FOLDL f e(APPEND l1 l2) = FOLDL f(FOLDL f e l1)l2 CONS_APPEND = |- !x l. CONS x l = APPEND[x]l ASSOC_APPEND = |- ASSOC APPEND RIGHT_ID_APPEND_NIL = |- RIGHT_ID APPEND[] LEFT_ID_APPEND_NIL = |- LEFT_ID APPEND[] MONOID_APPEND_NIL = |- MONOID APPEND[] APPEND_LENGTH_EQ = |- !l1 l1'. (LENGTH l1 = LENGTH l1') ==> (!l2 l2'. (LENGTH l2 = LENGTH l2') ==> ((APPEND l1 l2 = APPEND l1' l2') = (l1 = l1') /\ (l2 = l2'))) FILTER_APPEND = |- !f l1 l2. FILTER f(APPEND l1 l2) = APPEND(FILTER f l1)(FILTER f l2) FLAT_SNOC = |- !x l. FLAT(SNOC x l) = APPEND(FLAT l)x FLAT_FOLDR = |- !l. FLAT l = FOLDR APPEND[]l FLAT_FOLDL = |- !l. FLAT l = FOLDL APPEND[]l LENGTH_FLAT = |- !l. LENGTH(FLAT l) = SUM(MAP LENGTH l) REVERSE_FOLDR = |- !l. REVERSE l = FOLDR SNOC[]l REVERSE_FOLDL = |- !l. REVERSE l = FOLDL(\l' x. CONS x l')[]l LENGTH_REVERSE = |- !l. LENGTH(REVERSE l) = LENGTH l REVERSE_EQ_NIL = |- !l. (REVERSE l = []) = (l = []) ALL_EL_SNOC = |- !P x l. ALL_EL P(SNOC x l) = ALL_EL P l /\ P x ALL_EL_CONJ = |- !P Q l. ALL_EL(\x. P x /\ Q x)l = ALL_EL P l /\ ALL_EL Q l ALL_EL_MAP = |- !P f l. ALL_EL P(MAP f l) = ALL_EL(P o f)l ALL_EL_APPEND = |- !P l1 l2. ALL_EL P(APPEND l1 l2) = ALL_EL P l1 /\ ALL_EL P l2 SOME_EL_SNOC = |- !P x l. SOME_EL P(SNOC x l) = P x \/ SOME_EL P l NOT_ALL_EL_SOME_EL = |- !P l. ~ALL_EL P l = SOME_EL($~ o P)l NOT_SOME_EL_ALL_EL = |- !P l. ~SOME_EL P l = ALL_EL($~ o P)l IS_EL = |- (!x. IS_EL x[] = F) /\ (!y x l. IS_EL y(CONS x l) = (y = x) \/ IS_EL y l) IS_EL_SNOC = |- !y x l. IS_EL y(SNOC x l) = (y = x) \/ IS_EL y l Theorem ADD_ASSOC autoloading from theory `arithmetic` ... ADD_ASSOC = |- !m n p. m + (n + p) = (m + n) + p SUM_SNOC = |- !x l. SUM(SNOC x l) = (SUM l) + x SUM_FOLDR = |- !l. SUM l = FOLDR $+ 0 l SUM_FOLDL = |- !l. SUM l = FOLDL $+ 0 l IS_PREFIX_APPEND = |- !l1 l2. IS_PREFIX l1 l2 = (?l. l1 = APPEND l2 l) IS_SUFFIX_APPEND = |- !l1 l2. IS_SUFFIX l1 l2 = (?l. l1 = APPEND l l2) IS_SUBLIST_APPEND = |- !l1 l2. IS_SUBLIST l1 l2 = (?l l'. l1 = APPEND l(APPEND l2 l')) IS_PREFIX_IS_SUBLIST = |- !l1 l2. IS_PREFIX l1 l2 ==> IS_SUBLIST l1 l2 IS_SUFFIX_IS_SUBLIST = |- !l1 l2. IS_SUFFIX l1 l2 ==> IS_SUBLIST l1 l2 IS_PREFIX_REVERSE = |- !l1 l2. IS_PREFIX(REVERSE l1)(REVERSE l2) = IS_SUFFIX l1 l2 IS_SUFFIX_REVERSE = |- !l1 l2. IS_SUFFIX(REVERSE l1)(REVERSE l2) = IS_PREFIX l1 l2 IS_SUBLIST_REVERSE = |- !l1 l2. IS_SUBLIST(REVERSE l1)(REVERSE l2) = IS_SUBLIST l1 l2 PREFIX_FOLDR = |- !P l. PREFIX P l = FOLDR(\x l'. (P x => CONS x l' | []))[]l PREFIX = |- (!P. PREFIX P[] = []) /\ (!P x l. PREFIX P(CONS x l) = (P x => CONS x(PREFIX P l) | [])) IS_PREFIX_PREFIX = |- !P l. IS_PREFIX l(PREFIX P l) LENGTH_SCANL = |- !f e l. LENGTH(SCANL f e l) = SUC(LENGTH l) LENGTH_SCANR = |- !f e l. LENGTH(SCANR f e l) = SUC(LENGTH l) COMM_MONOID_FOLDL = |- !f. COMM f ==> (!e'. MONOID f e' ==> (!e l. FOLDL f e l = f e(FOLDL f e' l))) COMM_MONOID_FOLDR = |- !f. COMM f ==> (!e'. MONOID f e' ==> (!e l. FOLDR f e l = f e(FOLDR f e' l))) FCOMM_FOLDR_APPEND = |- !g f. FCOMM g f ==> (!e. LEFT_ID g e ==> (!l1 l2. FOLDR f e(APPEND l1 l2) = g(FOLDR f e l1)(FOLDR f e l2))) FCOMM_FOLDL_APPEND = |- !f g. FCOMM f g ==> (!e. RIGHT_ID g e ==> (!l1 l2. FOLDL f e(APPEND l1 l2) = g(FOLDL f e l1)(FOLDL f e l2))) MONOID_FOLDR_APPEND_FOLDR = |- !f e. MONOID f e ==> (!l1 l2. FOLDR f e(APPEND l1 l2) = f(FOLDR f e l1)(FOLDR f e l2)) MONOID_FOLDL_APPEND_FOLDL = |- !f e. MONOID f e ==> (!l1 l2. FOLDL f e(APPEND l1 l2) = f(FOLDL f e l1)(FOLDL f e l2)) FOLDL_SINGLE = |- !f e x. FOLDL f e[x] = f e x FOLDR_SINGLE = |- !f e x. FOLDR f e[x] = f x e FOLDR_CONS_NIL = |- !l. FOLDR CONS[]l = l FOLDL_SNOC_NIL = |- !l. FOLDL(\xs x. SNOC x xs)[]l = l FOLDR_FOLDL_REVERSE = |- !f e l. FOLDR f e l = FOLDL(\x y. f y x)e(REVERSE l) FOLDL_FOLDR_REVERSE = |- !f e l. FOLDL f e l = FOLDR(\x y. f y x)e(REVERSE l) FOLDR_REVERSE = |- !f e l. FOLDR f e(REVERSE l) = FOLDL(\x y. f y x)e l FOLDL_REVERSE = |- !f e l. FOLDL f e(REVERSE l) = FOLDR(\x y. f y x)e l FOLDR_MAP = |- !f e g l. FOLDR f e(MAP g l) = FOLDR(\x y. f(g x)y)e l FOLDL_MAP = |- !f e g l. FOLDL f e(MAP g l) = FOLDL(\x y. f x(g y))e l ALL_EL_FOLDR = |- !P l. ALL_EL P l = FOLDR(\x l'. P x /\ l')T l ALL_EL_FOLDL = |- !P l. ALL_EL P l = FOLDL(\l' x. l' /\ P x)T l SOME_EL_FOLDR = |- !P l. SOME_EL P l = FOLDR(\x l'. P x \/ l')F l SOME_EL_FOLDL = |- !P l. SOME_EL P l = FOLDL(\l' x. l' \/ P x)F l ALL_EL_FOLDR_MAP = |- !P l. ALL_EL P l = FOLDR $/\ T(MAP P l) ALL_EL_FOLDL_MAP = |- !P l. ALL_EL P l = FOLDL $/\ T(MAP P l) SOME_EL_FOLDR_MAP = |- !P l. SOME_EL P l = FOLDR $\/ F(MAP P l) SOME_EL_FOLDL_MAP = |- !P l. SOME_EL P l = FOLDL $\/ F(MAP P l) FOLDR_FILTER = |- !f e P l. FOLDR f e(FILTER P l) = FOLDR(\x y. (P x => f x y | y))e l FOLDL_FILTER = |- !f e P l. FOLDL f e(FILTER P l) = FOLDL(\x y. (P y => f x y | x))e l ASSOC_FOLDR_FLAT = |- !f. ASSOC f ==> (!e. LEFT_ID f e ==> (!l. FOLDR f e(FLAT l) = FOLDR f e(MAP(FOLDR f e)l))) ASSOC_FOLDL_FLAT = |- !f. ASSOC f ==> (!e. RIGHT_ID f e ==> (!l. FOLDL f e(FLAT l) = FOLDL f e(MAP(FOLDL f e)l))) MAP_FLAT = |- !f l. MAP f(FLAT l) = FLAT(MAP(MAP f)l) FILTER_FLAT = |- !P l. FILTER P(FLAT l) = FLAT(MAP(FILTER P)l) SOME_EL_MAP = |- !P f l. SOME_EL P(MAP f l) = SOME_EL(P o f)l SOME_EL_APPEND = |- !P l1 l2. SOME_EL P(APPEND l1 l2) = SOME_EL P l1 \/ SOME_EL P l2 SOME_EL_DISJ = |- !P Q l. SOME_EL(\x. P x \/ Q x)l = SOME_EL P l \/ SOME_EL Q l IS_EL_APPEND = |- !l1 l2 x. IS_EL x(APPEND l1 l2) = IS_EL x l1 \/ IS_EL x l2 IS_EL_FOLDR = |- !y l. IS_EL y l = FOLDR(\x l'. (y = x) \/ l')F l IS_EL_FOLDL = |- !y l. IS_EL y l = FOLDL(\l' x. l' \/ (y = x))F l NULL_FOLDR = |- !l. NULL l = FOLDR(\x l'. F)T l NULL_FOLDL = |- !l. NULL l = FOLDL(\x l'. F)T l MAP_REVERSE = |- !f l. MAP f(REVERSE l) = REVERSE(MAP f l) FILTER_REVERSE = |- !P l. FILTER P(REVERSE l) = REVERSE(FILTER P l) Theorem PRE autoloading from theory `prim_rec` ... PRE = |- (PRE 0 = 0) /\ (!m. PRE(SUC m) = m) LAST = |- !x l. LAST(SNOC x l) = x BUTLAST = |- !x l. BUTLAST(SNOC x l) = l SEG_LENGTH_ID = |- !l. SEG(LENGTH l)0 l = l SEG_SUC_CONS = |- !m n l x. SEG m(SUC n)(CONS x l) = SEG m n l SEG_0_SNOC = |- !m l x. m <= (LENGTH l) ==> (SEG m 0(SNOC x l) = SEG m 0 l) Theorem SUB_LESS_EQ autoloading from theory `arithmetic` ... SUB_LESS_EQ = |- !n m. (n - m) <= n Theorem SUB_MONO_EQ autoloading from theory `arithmetic` ... SUB_MONO_EQ = |- !n m. (SUC n) - (SUC m) = n - m Theorem SUB_0 autoloading from theory `arithmetic` ... SUB_0 = |- !m. (0 - m = 0) /\ (m - 0 = m) BUTLASTN_SEG = |- !n l. n <= (LENGTH l) ==> (BUTLASTN n l = SEG((LENGTH l) - n)0 l) LASTN_CONS = |- !n l. n <= (LENGTH l) ==> (!x. LASTN n(CONS x l) = LASTN n l) LENGTH_LASTN = |- !n l. n <= (LENGTH l) ==> (LENGTH(LASTN n l) = n) LASTN_LENGTH_ID = |- !l. LASTN(LENGTH l)l = l Theorem ZERO_LESS_EQ autoloading from theory `arithmetic` ... ZERO_LESS_EQ = |- !n. 0 <= n LASTN_LASTN = |- !l n m. m <= (LENGTH l) ==> n <= m ==> (LASTN n(LASTN m l) = LASTN n l) Theorem NOT_SUC_LESS_EQ_0 autoloading from theory `arithmetic` ... NOT_SUC_LESS_EQ_0 = |- !n. ~(SUC n) <= 0 NOT_SUC_LESS_EQ_0 = |- !n. ~(SUC n) <= 0 FIRSTN_LENGTH_ID = |- !l. FIRSTN(LENGTH l)l = l FIRSTN_SNOC = |- !n l. n <= (LENGTH l) ==> (!x. FIRSTN n(SNOC x l) = FIRSTN n l) BUTLASTN_LENGTH_NIL = |- !l. BUTLASTN(LENGTH l)l = [] BUTLASTN_SUC_BUTLAST = |- !n l. n < (LENGTH l) ==> (BUTLASTN(SUC n)l = BUTLASTN n(BUTLAST l)) Theorem LESS_MONO_EQ autoloading from theory `arithmetic` ... LESS_MONO_EQ = |- !m n. (SUC m) < (SUC n) = m < n BUTLASTN_BUTLAST = |- !n l. n < (LENGTH l) ==> (BUTLASTN n(BUTLAST l) = BUTLAST(BUTLASTN n l)) LENGTH_BUTLASTN = |- !n l. n <= (LENGTH l) ==> (LENGTH(BUTLASTN n l) = (LENGTH l) - n) ADD_SUC_lem = |- !m n. m + (SUC n) = (SUC m) + n BUTLASTN_BUTLASTN = |- !m n l. (n + m) <= (LENGTH l) ==> (BUTLASTN n(BUTLASTN m l) = BUTLASTN(n + m)l) APPEND_BUTLASTN_LASTN = |- !n l. n <= (LENGTH l) ==> (APPEND(BUTLASTN n l)(LASTN n l) = l) Theorem LESS_EQ_ADD autoloading from theory `arithmetic` ... LESS_EQ_ADD = |- !m n. m <= (m + n) Theorem ADD_SYM autoloading from theory `arithmetic` ... ADD_SYM = |- !m n. m + n = n + m APPEND_FIRSTN_LASTN = |- !m n l. (m + n = LENGTH l) ==> (APPEND(FIRSTN n l)(LASTN m l) = l) BUTLASTN_APPEND2 = |- !n l1 l2. n <= (LENGTH l2) ==> (BUTLASTN n(APPEND l1 l2) = APPEND l1(BUTLASTN n l2)) Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m <= m BUTLASTN_LENGTH_APPEND = |- !l2 l1. BUTLASTN(LENGTH l2)(APPEND l1 l2) = l1 LASTN_LENGTH_APPEND = |- !l1 l2. LASTN(LENGTH l2)(APPEND l1 l2) = l2 BUTLASTN_CONS = |- !n l. n <= (LENGTH l) ==> (!x. BUTLASTN n(CONS x l) = CONS x(BUTLASTN n l)) BUTLASTN_LENGTH_CONS = |- !l x. BUTLASTN(LENGTH l)(CONS x l) = [x] LAST_LASTN_LAST = |- !n l. n <= (LENGTH l) ==> 0 < n ==> (LAST(LASTN n l) = LAST l) BUTLASTN_LASTN_NIL = |- !n l. n <= (LENGTH l) ==> (BUTLASTN n(LASTN n l) = []) LASTN_BUTLASTN = |- !n m l. (n + m) <= (LENGTH l) ==> (LASTN n(BUTLASTN m l) = BUTLASTN m(LASTN(n + m)l)) BUTLASTN_LASTN = |- !m n l. m <= n /\ n <= (LENGTH l) ==> (BUTLASTN m(LASTN n l) = LASTN(n - m)(BUTLASTN m l)) LASTN_1 = |- !l. ~(l = []) ==> (LASTN 1 l = [LAST l]) BUTLASTN_1 = |- !l. ~(l = []) ==> (BUTLASTN 1 l = BUTLAST l) BUTLASTN_APPEND1 = |- !l2 n. (LENGTH l2) <= n ==> (!l1. BUTLASTN n(APPEND l1 l2) = BUTLASTN(n - (LENGTH l2))l1) LASTN_APPEND2 = |- !n l2. n <= (LENGTH l2) ==> (!l1. LASTN n(APPEND l1 l2) = LASTN n l2) LASTN_APPEND1 = |- !l2 n. (LENGTH l2) <= n ==> (!l1. LASTN n(APPEND l1 l2) = APPEND(LASTN(n - (LENGTH l2))l1)l2) LASTN_MAP = |- !n l. n <= (LENGTH l) ==> (!f. LASTN n(MAP f l) = MAP f(LASTN n l)) BUTLASTN_MAP = |- !n l. n <= (LENGTH l) ==> (!f. BUTLASTN n(MAP f l) = MAP f(BUTLASTN n l)) ALL_EL_LASTN = |- !P l. ALL_EL P l ==> (!m. m <= (LENGTH l) ==> ALL_EL P(LASTN m l)) ALL_EL_BUTLASTN = |- !P l. ALL_EL P l ==> (!m. m <= (LENGTH l) ==> ALL_EL P(BUTLASTN m l)) LENGTH_FIRSTN = |- !n l. n <= (LENGTH l) ==> (LENGTH(FIRSTN n l) = n) FIRSTN_FIRSTN = |- !m l. m <= (LENGTH l) ==> (!n. n <= m ==> (FIRSTN n(FIRSTN m l) = FIRSTN n l)) LENGTH_BUTFIRSTN = |- !n l. n <= (LENGTH l) ==> (LENGTH(BUTFIRSTN n l) = (LENGTH l) - n) BUTFIRSTN_LENGTH_NIL = |- !l. BUTFIRSTN(LENGTH l)l = [] BUTFIRSTN_APPEND1 = |- !n l1. n <= (LENGTH l1) ==> (!l2. BUTFIRSTN n(APPEND l1 l2) = APPEND(BUTFIRSTN n l1)l2) BUTFIRSTN_APPEND2 = |- !l1 n. (LENGTH l1) <= n ==> (!l2. BUTFIRSTN n(APPEND l1 l2) = BUTFIRSTN(n - (LENGTH l1))l2) BUTFIRSTN_BUTFIRSTN = |- !n m l. (n + m) <= (LENGTH l) ==> (BUTFIRSTN n(BUTFIRSTN m l) = BUTFIRSTN(n + m)l) APPEND_FIRSTN_BUTFIRSTN = |- !n l. n <= (LENGTH l) ==> (APPEND(FIRSTN n l)(BUTFIRSTN n l) = l) Theorem SUB_EQUAL_0 autoloading from theory `arithmetic` ... SUB_EQUAL_0 = |- !c. c - c = 0 Theorem LESS_EQ autoloading from theory `arithmetic` ... LESS_EQ = |- !m n. m < n = (SUC m) <= n Definition SUB autoloading from theory `arithmetic` ... SUB = |- (!m. 0 - m = 0) /\ (!m n. (SUC m) - n = (m < n => 0 | SUC(m - n))) Theorem LESS_SUC_NOT autoloading from theory `arithmetic` ... LESS_SUC_NOT = |- !m n. m < n ==> ~n < (SUC m) LASTN_SEG = |- !n l. n <= (LENGTH l) ==> (LASTN n l = SEG n((LENGTH l) - n)l) FIRSTN_SEG = |- !n l. n <= (LENGTH l) ==> (FIRSTN n l = SEG n 0 l) BUTFIRSTN_SEG = |- !n l. n <= (LENGTH l) ==> (BUTFIRSTN n l = SEG((LENGTH l) - n)n l) APPEND_BUTLAST_LAST = |- !l. ~(l = []) ==> (APPEND(BUTLAST l)[LAST l] = l) BUTFIRSTN_SNOC = |- !n l. n <= (LENGTH l) ==> (!x. BUTFIRSTN n(SNOC x l) = SNOC x(BUTFIRSTN n l)) APPEND_BUTLASTN_BUTFIRSTN = |- !m n l. (m + n = LENGTH l) ==> (APPEND(BUTLASTN m l)(BUTFIRSTN n l) = l) SEG_SEG = |- !n1 m1 n2 m2 l. (n1 + m1) <= (LENGTH l) /\ (n2 + m2) <= n1 ==> (SEG n2 m2(SEG n1 m1 l) = SEG n2(m1 + m2)l) SEG_APPEND1 = |- !n m l1. (n + m) <= (LENGTH l1) ==> (!l2. SEG n m(APPEND l1 l2) = SEG n m l1) SEG_APPEND2 = |- !l1 m n l2. (LENGTH l1) <= m /\ n <= (LENGTH l2) ==> (SEG n m(APPEND l1 l2) = SEG n(m - (LENGTH l1))l2) SEG_FIRSTN_BUTFIRSTN = |- !n m l. (n + m) <= (LENGTH l) ==> (SEG n m l = FIRSTN n(BUTFIRSTN m l)) Theorem ADD_SUB autoloading from theory `arithmetic` ... ADD_SUB = |- !a c. (a + c) - c = a Theorem NOT_LESS autoloading from theory `arithmetic` ... NOT_LESS = |- !m n. ~m < n = n <= m Theorem LESS_0_CASES autoloading from theory `arithmetic` ... LESS_0_CASES = |- !m. (0 = m) \/ 0 < m Theorem LESS_EQUAL_ANTISYM autoloading from theory `arithmetic` ... LESS_EQUAL_ANTISYM = |- !n m. n <= m /\ m <= n ==> (n = m) SEG_APPEND = |- !m l1 n l2. m < (LENGTH l1) /\ (LENGTH l1) <= (n + m) /\ (n + m) <= ((LENGTH l1) + (LENGTH l2)) ==> (SEG n m(APPEND l1 l2) = APPEND(SEG((LENGTH l1) - m)m l1)(SEG((n + m) - (LENGTH l1))0 l2)) SEG_LENGTH_SNOC = |- !l x. SEG 1(LENGTH l)(SNOC x l) = [x] SEG_SNOC = |- !n m l. (n + m) <= (LENGTH l) ==> (!x. SEG n m(SNOC x l) = SEG n m l) Theorem SUB_LESS_0 autoloading from theory `arithmetic` ... SUB_LESS_0 = |- !n m. m < n = 0 < (n - m) Theorem PRE_SUC_EQ autoloading from theory `arithmetic` ... PRE_SUC_EQ = |- !m n. 0 < n ==> ((m = PRE n) = (SUC m = n)) ELL_SEG = |- !n l. n < (LENGTH l) ==> (ELL n l = HD(SEG 1(PRE((LENGTH l) - n))l)) REWRITE1_TAC = - : thm_tactic SNOC_FOLDR = |- !x l. SNOC x l = FOLDR CONS[x]l IS_EL_FOLDR_MAP = |- !x l. IS_EL x l = FOLDR $\/ F(MAP($= x)l) IS_EL_FOLDL_MAP = |- !x l. IS_EL x l = FOLDL $\/ F(MAP($= x)l) FILTER_FILTER = |- !P Q l. FILTER P(FILTER Q l) = FILTER(\x. P x /\ Q x)l FCOMM_FOLDR_FLAT = |- !g f. FCOMM g f ==> (!e. LEFT_ID g e ==> (!l. FOLDR f e(FLAT l) = FOLDR g e(MAP(FOLDR f e)l))) FCOMM_FOLDL_FLAT = |- !f g. FCOMM f g ==> (!e. RIGHT_ID g e ==> (!l. FOLDL f e(FLAT l) = FOLDL g e(MAP(FOLDL f e)l))) FOLDR1 = |- !f. (!a b c. f a(f b c) = f b(f a c)) ==> (!e l. FOLDR f(f h e)l = f h(FOLDR f e l)) FOLDL1 = |- !f. (!a b c. f(f a b)c = f(f a c)b) ==> (!e l. FOLDL f(f e h)l = f(FOLDL f e l)h) FOLDR_REVERSE2 = |- !f. (!a b c. f a(f b c) = f b(f a c)) ==> (!e l. FOLDR f e(REVERSE l) = FOLDR f e l) FOLDR_MAP_REVERSE = |- !f. (!a b c. f a(f b c) = f b(f a c)) ==> (!e g l. FOLDR f e(MAP g(REVERSE l)) = FOLDR f e(MAP g l)) FOLDR_FILTER_REVERSE = |- !f. (!a b c. f a(f b c) = f b(f a c)) ==> (!e P l. FOLDR f e(FILTER P(REVERSE l)) = FOLDR f e(FILTER P l)) FOLDL_REVERSE2 = |- !f. (!a b c. f(f a b)c = f(f a c)b) ==> (!e l. FOLDL f e(REVERSE l) = FOLDL f e l) COMM_ASSOC_LEM1 = |- !f. COMM f ==> ASSOC f ==> (!a b c. f a(f b c) = f b(f a c)) COMM_ASSOC_LEM2 = |- !f. COMM f ==> ASSOC f ==> (!a b c. f(f a b)c = f(f a c)b) COMM_ASSOC_FOLDR_REVERSE = |- !f. COMM f ==> ASSOC f ==> (!e l. FOLDR f e(REVERSE l) = FOLDR f e l) COMM_ASSOC_FOLDL_REVERSE = |- !f. COMM f ==> ASSOC f ==> (!e l. FOLDL f e(REVERSE l) = FOLDL f e l) ELL_LAST = |- !l. ~NULL l ==> (ELL 0 l = LAST l) ELL_0_SNOC = |- !l x. ELL 0(SNOC x l) = x ELL_SNOC = |- !n. 0 < n ==> (!x l. ELL n(SNOC x l) = ELL(PRE n)l) ELL_SUC_SNOC = |- !n x l. ELL(SUC n)(SNOC x l) = ELL n l ELL_CONS = |- !n l. n < (LENGTH l) ==> (!x. ELL n(CONS x l) = ELL n l) ELL_LENGTH_CONS = |- !l x. ELL(LENGTH l)(CONS x l) = x ELL_LENGTH_SNOC = |- !l x. ELL(LENGTH l)(SNOC x l) = (NULL l => x | HD l) ELL_APPEND2 = |- !n l2. n < (LENGTH l2) ==> (!l1. ELL n(APPEND l1 l2) = ELL n l2) ELL_APPEND1 = |- !l2 n. (LENGTH l2) <= n ==> (!l1. ELL n(APPEND l1 l2) = ELL(n - (LENGTH l2))l1) ELL_PRE_LENGTH = |- !l. ~(l = []) ==> (ELL(PRE(LENGTH l))l = HD l) EL_LENGTH_SNOC = |- !l x. EL(LENGTH l)(SNOC x l) = x EL_PRE_LENGTH = |- !l. ~(l = []) ==> (EL(PRE(LENGTH l))l = LAST l) EL_SNOC = |- !n l. n < (LENGTH l) ==> (!x. EL n(SNOC x l) = EL n l) Theorem LESS_THM autoloading from theory `prim_rec` ... LESS_THM = |- !m n. m < (SUC n) = (m = n) \/ m < n Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n < (SUC n) Theorem LESS_REFL autoloading from theory `prim_rec` ... LESS_REFL = |- !n. ~n < n LESS_PRE_SUB_LESS = |- !n m. m < n ==> (PRE(n - m)) < n EL_ELL = |- !n l. n < (LENGTH l) ==> (EL n l = ELL(PRE((LENGTH l) - n))l) EL_LENGTH_APPEND = |- !l2 l1. ~NULL l2 ==> (EL(LENGTH l1)(APPEND l1 l2) = HD l2) Theorem LESS_SUC autoloading from theory `prim_rec` ... LESS_SUC = |- !m n. m < n ==> m < (SUC n) ELL_EL = |- !n l. n < (LENGTH l) ==> (ELL n l = EL(PRE((LENGTH l) - n))l) ELL_MAP = |- !n l f. n < (LENGTH l) ==> (ELL n(MAP f l) = f(ELL n l)) LENGTH_BUTLAST = |- !l. ~(l = []) ==> (LENGTH(BUTLAST l) = PRE(LENGTH l)) BUTFIRSTN_LENGTH_APPEND = |- !l1 l2. BUTFIRSTN(LENGTH l1)(APPEND l1 l2) = l2 FIRSTN_APPEND1 = |- !n l1. n <= (LENGTH l1) ==> (!l2. FIRSTN n(APPEND l1 l2) = FIRSTN n l1) FIRSTN_APPEND2 = |- !l1 n. (LENGTH l1) <= n ==> (!l2. FIRSTN n(APPEND l1 l2) = APPEND l1(FIRSTN(n - (LENGTH l1))l2)) FIRSTN_LENGTH_APPEND = |- !l1 l2. FIRSTN(LENGTH l1)(APPEND l1 l2) = l1 REVERSE_FLAT = |- !l. REVERSE(FLAT l) = FLAT(REVERSE(MAP REVERSE l)) MAP_COND = |- !f c l1 l2. MAP f(c => l1 | l2) = (c => MAP f l1 | MAP f l2) MAP_FILTER = |- !f P l. (!x. P(f x) = P x) ==> (MAP f(FILTER P l) = FILTER P(MAP f l)) FLAT_APPEND = |- !l1 l2. FLAT(APPEND l1 l2) = APPEND(FLAT l1)(FLAT l2) FLAT_REVERSE = |- !l. FLAT(REVERSE l) = REVERSE(FLAT(MAP REVERSE l)) FLAT_FLAT = |- !l. FLAT(FLAT l) = FLAT(MAP FLAT l) ALL_EL_REVERSE = |- !P l. ALL_EL P(REVERSE l) = ALL_EL P l SOME_EL_REVERSE = |- !P l. SOME_EL P(REVERSE l) = SOME_EL P l ALL_EL_SEG = |- !P l. ALL_EL P l ==> (!m k. (m + k) <= (LENGTH l) ==> ALL_EL P(SEG m k l)) ALL_EL_FIRSTN = |- !P l. ALL_EL P l ==> (!m. m <= (LENGTH l) ==> ALL_EL P(FIRSTN m l)) Theorem SUB_ADD autoloading from theory `arithmetic` ... SUB_ADD = |- !m n. n <= m ==> ((m - n) + n = m) ALL_EL_BUTFIRSTN = |- !P l. ALL_EL P l ==> (!m. m <= (LENGTH l) ==> ALL_EL P(BUTFIRSTN m l)) SOME_EL_SEG = |- !m k l. (m + k) <= (LENGTH l) ==> (!P. SOME_EL P(SEG m k l) ==> SOME_EL P l) SOME_EL_FIRSTN = |- !m l. m <= (LENGTH l) ==> (!P. SOME_EL P(FIRSTN m l) ==> SOME_EL P l) SOME_EL_BUTFIRSTN = |- !m l. m <= (LENGTH l) ==> (!P. SOME_EL P(BUTFIRSTN m l) ==> SOME_EL P l) SOME_EL_LASTN = |- !m l. m <= (LENGTH l) ==> (!P. SOME_EL P(LASTN m l) ==> SOME_EL P l) SOME_EL_BUTLASTN = |- !m l. m <= (LENGTH l) ==> (!P. SOME_EL P(BUTLASTN m l) ==> SOME_EL P l) IS_EL_REVERSE = |- !x l. IS_EL x(REVERSE l) = IS_EL x l IS_EL_FILTER = |- !P x. P x ==> (!l. IS_EL x(FILTER P l) = IS_EL x l) IS_EL_SEG = |- !n m l. (n + m) <= (LENGTH l) ==> (!x. IS_EL x(SEG n m l) ==> IS_EL x l) IS_EL_SOME_EL = |- !x l. IS_EL x l = SOME_EL($= x)l IS_EL_FIRSTN = |- !m l. m <= (LENGTH l) ==> (!x. IS_EL x(FIRSTN m l) ==> IS_EL x l) IS_EL_BUTFIRSTN = |- !m l. m <= (LENGTH l) ==> (!x. IS_EL x(BUTFIRSTN m l) ==> IS_EL x l) IS_EL_BUTLASTN = |- !m l. m <= (LENGTH l) ==> (!x. IS_EL x(BUTLASTN m l) ==> IS_EL x l) IS_EL_LASTN = |- !m l. m <= (LENGTH l) ==> (!x. IS_EL x(LASTN m l) ==> IS_EL x l) ZIP_SNOC = |- !l1 l2. (LENGTH l1 = LENGTH l2) ==> (!x1 x2. ZIP(SNOC x1 l1,SNOC x2 l2) = SNOC(x1,x2)(ZIP(l1,l2))) UNZIP_SNOC = |- !x l. UNZIP(SNOC x l) = SNOC(FST x)(FST(UNZIP l)),SNOC(SND x)(SND(UNZIP l)) LENGTH_ZIP = |- !l1 l2. (LENGTH l1 = LENGTH l2) ==> (LENGTH(ZIP(l1,l2)) = LENGTH l1) /\ (LENGTH(ZIP(l1,l2)) = LENGTH l2) LENGTH_UNZIP_FST = |- !l. LENGTH(UNZIP_FST l) = LENGTH l LENGTH_UNZIP_SND = |- !l. LENGTH(UNZIP_SND l) = LENGTH l ZIP_UNZIP = |- !l. ZIP(UNZIP l) = l UNZIP_ZIP = |- !l1 l2. (LENGTH l1 = LENGTH l2) ==> (UNZIP(ZIP(l1,l2)) = l1,l2) SUM_APPEND = |- !l1 l2. SUM(APPEND l1 l2) = (SUM l1) + (SUM l2) SUM_REVERSE = |- !l. SUM(REVERSE l) = SUM l SUM_FLAT = |- !l. SUM(FLAT l) = SUM(MAP SUM l) EL_APPEND1 = |- !n l1 l2. n < (LENGTH l1) ==> (EL n(APPEND l1 l2) = EL n l1) EL_APPEND2 = |- !l1 n. (LENGTH l1) <= n ==> (!l2. EL n(APPEND l1 l2) = EL(n - (LENGTH l1))l2) EL_MAP = |- !n l. n < (LENGTH l) ==> (!f. EL n(MAP f l) = f(EL n l)) EL_CONS = |- !n. 0 < n ==> (!x l. EL n(CONS x l) = EL(PRE n)l) EL_SEG = |- !n l. n < (LENGTH l) ==> (EL n l = HD(SEG 1 n l)) EL_IS_EL = |- !n l. n < (LENGTH l) ==> IS_EL(EL n l)l TL_SNOC = |- !x l. TL(SNOC x l) = (NULL l => [] | SNOC x(TL l)) SUB_SUC_LESS = |- !m n. n < m ==> (m - (SUC n)) < m Theorem SUB_PLUS autoloading from theory `arithmetic` ... SUB_PLUS = |- !a b c. a - (b + c) = (a - b) - c Theorem PRE_SUB1 autoloading from theory `arithmetic` ... PRE_SUB1 = |- !m. PRE m = m - 1 EL_REVERSE = |- !n l. n < (LENGTH l) ==> (EL n(REVERSE l) = EL(PRE((LENGTH l) - n))l) EL_REVERSE_ELL = |- !n l. n < (LENGTH l) ==> (EL n(REVERSE l) = ELL n l) ELL_LENGTH_APPEND = |- !l1 l2. ~NULL l1 ==> (ELL(LENGTH l2)(APPEND l1 l2) = LAST l1) ELL_IS_EL = |- !n l. n < (LENGTH l) ==> IS_EL(EL n l)l ELL_REVERSE = |- !n l. n < (LENGTH l) ==> (ELL n(REVERSE l) = ELL(PRE((LENGTH l) - n))l) ELL_REVERSE_EL = |- !n l. n < (LENGTH l) ==> (ELL n(REVERSE l) = EL n l) Theorem LESS_EQ_TRANS autoloading from theory `arithmetic` ... LESS_EQ_TRANS = |- !m n p. m <= n /\ n <= p ==> m <= p LESS_EQ_SPLIT = |- !m n p. (m + n) <= p ==> n <= p /\ m <= p Theorem LESS_EQ_MONO_ADD_EQ autoloading from theory `arithmetic` ... LESS_EQ_MONO_ADD_EQ = |- !m n p. (m + p) <= (n + p) = m <= n Theorem GREATER_EQ autoloading from theory `arithmetic` ... GREATER_EQ = |- !n m. n >= m = m <= n SUB_GREATER_EQ_ADD = |- !p n m. p >= n ==> ((p - n) >= m = p >= (m + n)) Theorem SUB_LESS_EQ_ADD autoloading from theory `arithmetic` ... SUB_LESS_EQ_ADD = |- !m p. m <= p ==> (!n. (p - m) <= n = p <= (m + n)) SUB_LESS_EQ_ADD = |- !p n m. n <= p ==> (m <= (p - n) = (m + n) <= p) FIRSTN_BUTLASTN = |- !n l. n <= (LENGTH l) ==> (FIRSTN n l = BUTLASTN((LENGTH l) - n)l) BUTLASTN_FIRSTN = |- !n l. n <= (LENGTH l) ==> (BUTLASTN n l = FIRSTN((LENGTH l) - n)l) LASTN_BUTFIRSTN = |- !n l. n <= (LENGTH l) ==> (LASTN n l = BUTFIRSTN((LENGTH l) - n)l) BUTFIRSTN_LASTN = |- !n l. n <= (LENGTH l) ==> (BUTFIRSTN n l = LASTN((LENGTH l) - n)l) SUB_ADD_lem = |- !l n m. (n + m) <= l ==> ((l - (n + m)) + n = l - m) SEG_LASTN_BUTLASTN = |- !n m l. (n + m) <= (LENGTH l) ==> (SEG n m l = LASTN n(BUTLASTN((LENGTH l) - (n + m))l)) BUTFIRSTN_REVERSE = |- !n l. n <= (LENGTH l) ==> (BUTFIRSTN n(REVERSE l) = REVERSE(BUTLASTN n l)) BUTLASTN_REVERSE = |- !n l. n <= (LENGTH l) ==> (BUTLASTN n(REVERSE l) = REVERSE(BUTFIRSTN n l)) LASTN_REVERSE = |- !n l. n <= (LENGTH l) ==> (LASTN n(REVERSE l) = REVERSE(FIRSTN n l)) FIRSTN_REVERSE = |- !n l. n <= (LENGTH l) ==> (FIRSTN n(REVERSE l) = REVERSE(LASTN n l)) Theorem SUB_SUB autoloading from theory `arithmetic` ... SUB_SUB = |- !b c. c <= b ==> (!a. a - (b - c) = (a + c) - b) SEG_REVERSE = |- !n m l. (n + m) <= (LENGTH l) ==> (SEG n m(REVERSE l) = REVERSE(SEG n((LENGTH l) - (n + m))l)) LENGTH_GENLIST = |- !f n. LENGTH(GENLIST f n) = n LENGTH_REPLICATE = |- !n x. LENGTH(REPLICATE n x) = n IS_EL_REPLICATE = |- !n. 0 < n ==> (!x. IS_EL x(REPLICATE n x)) ALL_EL_REPLICATE = |- !x n. ALL_EL($= x)(REPLICATE n x) AND_EL_FOLDL = |- !l. AND_EL l = FOLDL $/\ T l AND_EL_FOLDR = |- !l. AND_EL l = FOLDR $/\ T l OR_EL_FOLDL = |- !l. OR_EL l = FOLDL $\/ F l OR_EL_FOLDR = |- !l. OR_EL l = FOLDR $\/ F l MAP2_ZIP = |- !l1 l2. (LENGTH l1 = LENGTH l2) ==> (!f. MAP2 f l1 l2 = MAP(UNCURRY f)(ZIP(l1,l2))) File mk_list_thm2 loaded () : void ##=======> theory list built cd /build/reproducible-path/hol88-2.02.19940316dfsg/theories; rm -f tree.th;\ /build/reproducible-path/hol88-2.02.19940316dfsg/basic-hol < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_tree.ml;\ cd /build/reproducible-path/hol88-2.02.19940316dfsg BASIC-HOL version 2.02 (GCL) created 25/8/25 #############################() : void ###Theory list loaded () : void #########list_Axiom = |- !x f. ?! fn. (fn[] = x) /\ (!h t. fn(CONS h t) = f(fn t)h t) list_INDUCT = |- !P. P[] /\ (!t. P t ==> (!h. P(CONS h t))) ==> (!l. P l) CONS_11 = |- !h t h' t'. (CONS h t = CONS h' t') = (h = h') /\ (t = t') NULL = |- NULL[] /\ (!h t. ~NULL(CONS h t)) NOT_CONS_NIL = |- !h t. ~(CONS h t = []) NOT_NIL_CONS = |- !h t. ~([] = CONS h t) ALL_EL_CONJ = |- !P Q l. ALL_EL(\x. P x /\ Q x)l = ALL_EL P l /\ ALL_EL Q l ######ALL_EL = |- (!P. ALL_EL P[] = T) /\ (!P x l. ALL_EL P(CONS x l) = P x /\ ALL_EL P l) MAP = |- (!f. MAP f[] = []) /\ (!f h t. MAP f(CONS h t) = CONS(f h)(MAP f t)) HD = |- !h t. HD(CONS h t) = h TL = |- !h t. TL(CONS h t) = t ####LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) ###EXP = |- (!m. m EXP 0 = 1) /\ (!m n. m EXP (SUC n) = m * (m EXP n)) ####################LESS_ADD_1 = |- !m n. n < m ==> (?p. m = n + (p + 1)) ADD_SYM = |- !m n. m + n = n + m EXP_ADD = |- !p q n. n EXP (p + q) = (n EXP p) * (n EXP q) MULT_ASSOC = |- !m n p. m * (n * p) = (m * n) * p MULT_EXP_MONO = |- !p q n m. (n * ((SUC q) EXP p) = m * ((SUC q) EXP p)) = (n = m) MULT_CLAUSES = |- !m n. (0 * m = 0) /\ (m * 0 = 0) /\ (1 * m = m) /\ (m * 1 = m) /\ ((SUC m) * n = (m * n) + n) /\ (m * (SUC n) = m + (m * n)) ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) NOT_ODD_EQ_EVEN = |- !n m. ~(SUC(n + n) = m + m) LESS_CASES = |- !m n. m < n \/ n <= m WOP = |- !P. (?n. P n) ==> (?n. P n /\ (!m. m < n ==> ~P m)) num_CASES = |- !m. (m = 0) \/ (?n. m = SUC n) NOT_LESS = |- !m n. ~m < n = n <= m LESS_IMP_LESS_OR_EQ = |- !m n. m < n ==> m <= n LESS_EQ_TRANS = |- !m n p. m <= n /\ n <= p ==> m <= p LESS_EQ_ADD = |- !m n. m <= (m + n) LESS_TRANS = |- !m n p. m < n /\ n < p ==> m < p LESS_EQ_ANTISYM = |- !m n. ~(m < n /\ n <= m) LESS_EQ = |- !m n. m < n = (SUC m) <= n ###########INV_SUC_EQ = |- !m n. (SUC m = SUC n) = (m = n) PRIM_REC_THM = |- !x f. (PRIM_REC x f 0 = x) /\ (!m. PRIM_REC x f(SUC m) = f(PRIM_REC x f m)m) LESS_0 = |- !n. 0 < (SUC n) LESS_SUC_REFL = |- !n. n < (SUC n) LESS_THM = |- !m n. m < (SUC n) = (m = n) \/ m < n LESS_SUC = |- !m n. m < n ==> m < (SUC n) NOT_LESS_0 = |- !n. ~n < 0 LESS_REFL = |- !n. ~n < n ####NOT_SUC = |- !n. ~(SUC n = 0) INDUCTION = |- !P. P 0 /\ (!n. P n ==> P(SUC n)) ==> (!n. P n) ####### num_CONV = - : conv File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/numconv.ml loaded () : void ####### Section INDUCT_THEN begun BETAS = - : (term -> term -> conv) GTAC = - : (term -> tactic) TACF = - : (term -> term -> thm_tactic -> tactic) TACS = - : (term -> term -> thm_tactic -> tactic list) GOALS = - : (* -> ((* # term) -> (** # ***)) list -> term -> (** list # *** list)) GALPH = - : conv GALPHA = - : conv mapshape = - : (int list -> (* list -> **) list -> * list -> ** list) INDUCT_THEN = - : (thm -> thm_tactic -> tactic) - : (thm -> thm_tactic -> tactic) Section INDUCT_THEN ended INDUCT_THEN = - : (thm -> thm_tactic -> tactic) File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/ind.ml loaded () : void ####### Section prove_rec_fn_exists begun derive_existence_thm = - : (thm -> conv) mk_fn = - : ((term # term # term list # term # goal) -> (term # term list # thm)) instantiate_existence_thm = - : (thm -> conv) closeup = - : (term -> term) prove_rec_fn_exists = - : (thm -> conv) - : (thm -> conv) Section prove_rec_fn_exists ended prove_rec_fn_exists = - : (thm -> conv) new_recursive_definition = - : (bool -> thm -> string -> conv) File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/prim_rec.ml loaded () : void ###INDUCT_TAC = - : tactic ###LIST_INDUCT_TAC = - : tactic #####################arith_lemma = |- !p q n m. p < q ==> ~((SUC(n + n)) * (2 EXP p) = (SUC(m + m)) * (2 EXP q)) #############fun_11_1 = |- !p q n m. ((SUC(n + n)) * (2 EXP p) = (SUC(m + m)) * (2 EXP q)) ==> (p = q) ##############fun_11_2 = |- !p q n m. ((SUC(n + n)) * (2 EXP p) = (SUC(m + m)) * (2 EXP q)) ==> (n = m) #######ty = ":num" : type #########node_REP = |- (node_REP[] = 0) /\ (!h t. node_REP(CONS h t) = (SUC(h + h)) * (2 EXP (node_REP t))) ########################node_REP_one_one = |- !l1 l2. (node_REP l1 = node_REP l2) = (l1 = l2) #############Is_tree_REP = |- Is_tree_REP = (\t. !P. (!tl. ALL_EL P tl ==> P(node_REP tl)) ==> P t) #############ALL_EL_Is_tree_REP = |- !trl. ALL_EL Is_tree_REP trl = (!P. ALL_EL(\t. (!tl. ALL_EL P tl ==> P(node_REP tl)) ==> P t)trl) ##########Is_tree_lemma1 = |- !trl. ALL_EL Is_tree_REP trl ==> Is_tree_REP(node_REP trl) #####taut1 = |- !a b. ~(a ==> b) = a /\ ~b ###########################Is_tree_lemma2 = |- !t. Is_tree_REP t ==> (?trl. ALL_EL Is_tree_REP trl /\ (t = node_REP trl)) #######Is_tree_lemma3 = |- !tl. Is_tree_REP(node_REP tl) ==> ALL_EL Is_tree_REP tl #########Is_tree_lemma4 = |- !tl. Is_tree_REP(node_REP tl) = ALL_EL Is_tree_REP tl #########Exists_tree_REP = |- ?t. Is_tree_REP t ############tree_TY_DEF = |- ?rep. TYPE_DEFINITION Is_tree_REP rep ##########tree_ISO_DEF = |- (!a. ABS_tree(REP_tree a) = a) /\ (!r. Is_tree_REP r = (REP_tree(ABS_tree r) = r)) #######R_11 = |- !a a'. (REP_tree a = REP_tree a') = (a = a') R_ONTO = |- !r. Is_tree_REP r = (?a. r = REP_tree a) A_11 = |- !r r'. Is_tree_REP r ==> Is_tree_REP r' ==> ((ABS_tree r = ABS_tree r') = (r = r')) A_ONTO = |- !a. ?r. (a = ABS_tree r) /\ Is_tree_REP r A_R = |- !a. ABS_tree(REP_tree a) = a R_A = |- !r. Is_tree_REP r = (REP_tree(ABS_tree r) = r) ######node = |- !tl. node tl = ABS_tree(node_REP(MAP REP_tree tl)) #####dest_node = |- !t. dest_node t = (@p. t = node p) ##########IS_REP_lemma = |- !tl. ALL_EL Is_tree_REP(MAP REP_tree tl) ############REP_ABS_lemma = |- !tl. REP_tree(node tl) = node_REP(MAP REP_tree tl) ######ABS_REP = |- !tl. Is_tree_REP(node_REP(MAP REP_tree tl)) #####ABS_11_lemma = |- (ABS_tree(node_REP(MAP REP_tree tl1)) = ABS_tree(node_REP(MAP REP_tree tl2))) = (node_REP(MAP REP_tree tl1) = node_REP(MAP REP_tree tl2)) ###################node_11 = |- !tl1 tl2. (node tl1 = node tl2) = (tl1 = tl2) ########A_R_list = |- !tl. tl = MAP ABS_tree(MAP REP_tree tl) ######R_A_R = |- REP_tree(ABS_tree(REP_tree t)) = REP_tree t #####Is_R = |- Is_tree_REP(REP_tree t) ######R_A_R_list = |- !tl. MAP REP_tree(MAP ABS_tree(MAP REP_tree tl)) = MAP REP_tree tl ###########A_ONTO_list = |- !tl. ?trl. (tl = MAP ABS_tree trl) /\ ALL_EL Is_tree_REP trl ############R_ONTO_list = |- !trl. ALL_EL Is_tree_REP trl ==> (?tl. trl = MAP REP_tree tl) ########R_A_list = |- !trl. ALL_EL Is_tree_REP trl ==> (MAP REP_tree(MAP ABS_tree trl) = trl) ############################induct_lemma1 = |- (!tl. ALL_EL P tl ==> P(node tl)) = (!trl. ALL_EL Is_tree_REP trl ==> ALL_EL(\x. P(ABS_tree x))trl ==> (\x. P(ABS_tree x))(node_REP trl)) #################induct_lemma2 = |- (!t. P t) = (!rep. Is_tree_REP rep ==> (\r. Is_tree_REP r /\ (\x. P(ABS_tree x))r)rep) #############tree_Induct = |- !P. (!tl. ALL_EL P tl ==> P(node tl)) ==> (!t. P t) #######################tree_INDUCT = - : (thm -> thm) ####################tree_INDUCT_TAC = - : tactic ##############bht = |- bht = PRIM_REC (\tr. tr = node[]) (\res n tr. ?trl. (tr = node trl) /\ ALL_EL res trl) #########bht_thm = |- (bht 0 tr = (tr = node[])) /\ (bht(SUC n)tr = (?trl. (tr = node trl) /\ ALL_EL(bht n)trl)) ##################bht_lemma1 = |- !n tr. bht n tr ==> bht(SUC n)tr #########bht_lemma2 = |- !n tr. bht n tr ==> (!m. bht(n + m)tr) ######################bht_lemma3 = |- !trl. ALL_EL(\tr. ?n. bht n tr)trl ==> (?n. ALL_EL(bht n)trl) ##########exists_bht = |- !t. ?n. bht n t ##########min_bht = |- !t. ?n. bht n t /\ (!m. m < n ==> ~bht m t) ######HT = |- !t. HT t = (@n. bht n t /\ (!m. m < n ==> ~bht m t)) ###########HT_thm1 = |- !tr. bht(HT tr)tr ######HT_thm2 = |- !tr m. m < (HT tr) ==> ~bht m tr ##################HT_leaf = |- !trl. (HT(node trl) = 0) = (trl = []) ############HT_thm3 = |- !m tr. ~bht m tr ==> m < (HT tr) #####HT_thm4 = |- !tr m. m < (HT tr) = ~bht m tr ###################HT_thm5 = |- !n tl h. ~bht n(node tl) ==> ~bht n(node(CONS h tl)) ###########HT_thm6 = |- !trl tl t. ALL_EL(\t'. ~bht(HT t')(node tl))trl ==> ALL_EL(\t'. ~bht(HT t')(node(CONS h tl)))trl ##########################HT_node = |- !tl. ALL_EL(\t. (HT t) < (HT(node tl)))tl ########Less_lemma = |- !n m. n < (SUC m) = n <= m #############less_HT = |- !trl m n. m <= n ==> ALL_EL(\t. (HT t) < m)trl ==> ALL_EL(\t. (HT t) <= n)trl ###################less_HT2 = |- !trl n. (HT(node trl)) < n ==> ALL_EL(\t. (HT t) < n)trl ##########less_HT3 = |- !trl. (HT(node trl)) <= (HT(node[node trl])) ################less_HT4 = |- !trl m n. m <= n ==> ALL_EL(\t. (HT t) < m)trl ==> ALL_EL(\t. (HT t) < n)trl ######less_HT5 = |- !h. (HT h) < (HT(node[h])) ########less_HT6 = |- !h trl. (HT h) < (HT(node[node(CONS h trl)])) #####less_HT7 = |- ALL_EL(\t. (HT t) < (HT(node[node tl])))tl #####less_HT8 = |- ALL_EL(\t. (HT t) < (HT(node[node(CONS h trl)])))trl ##########dest_node_thm = |- !tl. dest_node(node tl) = tl ########################################approx_lemma = |- !f n. ?fn. !trl. (HT(node trl)) <= n ==> (fn(node trl) = f(MAP fn trl)) #########trf = |- !n f. trf n f = (@fn. !trl. (HT(node trl)) <= n ==> (fn(node trl) = f(MAP fn trl))) #########trf_thm = |- !f n trl. (HT(node trl)) <= n ==> (trf n f(node trl) = f(MAP(trf n f)trl)) #######################trf_EQ_thm = |- !t n m f. (HT t) < n /\ (HT t) < m ==> (trf n f t = trf m f t) #############trf_EQ_thm2 = |- !trl n m f. ALL_EL(\t. (HT t) < n)trl /\ ALL_EL(\t. (HT t) < m)trl ==> (MAP(trf n f)trl = MAP(trf m f)trl) ##############################FN_EXISTS = |- !f. ?fn. !trl. fn(node trl) = f(MAP fn trl) ##########FN_thm = |- ?FN. !f trl. FN f(node trl) = f(MAP(FN f)trl) ######AP = |- ?AP. (!l. AP[]l = []) /\ (!h t l. AP(CONS h t)l = CONS(h(HD l))(AP t(TL l))) ###AP = |- ?AP. (!l. AP[]l = []) /\ (!h t l. AP(CONS h t)l = CONS(h(HD l))(AP t(TL l))) #AP_DEF = ["!l. AP[]l = []"; "!h t l. AP(CONS h t)l = CONS(h(HD l))(AP t(TL l))"] : term list #########AP_MAP = .. |- !l. AP(MAP f l)l = MAP(\x. f x x)l #################EXISTS_THM = |- !f. ?fn. !tl. fn(node tl) = f(MAP fn tl)tl #########lemma = |- !l. ALL_EL(\x. f x = g x)l ==> (MAP f l = MAP g l) ###############tree_Axiom = |- !f. ?! fn. !tl. fn(node tl) = f(MAP fn tl)tl ###() : void ##=======> theory tree built cd /build/reproducible-path/hol88-2.02.19940316dfsg/theories; rm -f ltree.th;\ /build/reproducible-path/hol88-2.02.19940316dfsg/basic-hol < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_ltree.ml;\ cd /build/reproducible-path/hol88-2.02.19940316dfsg BASIC-HOL version 2.02 (GCL) created 25/8/25 ############################() : void ###Theory tree loaded () : void ###Theory combin loaded () : void #####node_11 = |- !tl1 tl2. (node tl1 = node tl2) = (tl1 = tl2) tree_Induct = |- !P. (!tl. ALL_EL P tl ==> P(node tl)) ==> (!t. P t) tree_Axiom = |- !f. ?! fn. !tl. fn(node tl) = f(MAP fn tl)tl ##########SUM = |- (SUM[] = 0) /\ (!h t. SUM(CONS h t) = h + (SUM t)) LENGTH = |- (LENGTH[] = 0) /\ (!h t. LENGTH(CONS h t) = SUC(LENGTH t)) MAP = |- (!f. MAP f[] = []) /\ (!f h t. MAP f(CONS h t) = CONS(f h)(MAP f t)) FLAT = |- (FLAT[] = []) /\ (!h t. FLAT(CONS h t) = APPEND h(FLAT t)) APPEND = |- (!l. APPEND[]l = l) /\ (!l1 l2 h. APPEND(CONS h l1)l2 = CONS h(APPEND l1 l2)) HD = |- !h t. HD(CONS h t) = h TL = |- !h t. TL(CONS h t) = t ALL_EL = |- (!P. ALL_EL P[] = T) /\ (!P x l. ALL_EL P(CONS x l) = P x /\ ALL_EL P l) #######list_Axiom = |- !x f. ?! fn. (fn[] = x) /\ (!h t. fn(CONS h t) = f(fn t)h t) list_INDUCT = |- !P. P[] /\ (!t. P t ==> (!h. P(CONS h t))) ==> (!l. P l) LENGTH_APPEND = |- !l1 l2. LENGTH(APPEND l1 l2) = (LENGTH l1) + (LENGTH l2) LENGTH_NIL = |- !l. (LENGTH l = 0) = (l = []) LENGTH_CONS = |- !l n. (LENGTH l = SUC n) = (?h l'. (LENGTH l' = n) /\ (l = CONS h l')) ####o_THM = |- !f g x. (f o g)x = f(g x) ####ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) ADD_EQ_0 = |- !m n. (m + n = 0) = (m = 0) /\ (n = 0) #####num_Axiom = |- !e f. ?! fn. (fn 0 = e) /\ (!n. fn(SUC n) = f(fn n)n) INV_SUC_EQ = |- !m n. (SUC m = SUC n) = (m = n) ###INDUCTION = |- !P. P 0 /\ (!n. P n ==> P(SUC n)) ==> (!n. P n) ########### Section INDUCT_THEN begun BETAS = - : (term -> term -> conv) GTAC = - : (term -> tactic) TACF = - : (term -> term -> thm_tactic -> tactic) TACS = - : (term -> term -> thm_tactic -> tactic list) GOALS = - : (* -> ((* # term) -> (** # ***)) list -> term -> (** list # *** list)) GALPH = - : conv GALPHA = - : conv mapshape = - : (int list -> (* list -> **) list -> * list -> ** list) INDUCT_THEN = - : (thm -> thm_tactic -> tactic) - : (thm -> thm_tactic -> tactic) Section INDUCT_THEN ended INDUCT_THEN = - : (thm -> thm_tactic -> tactic) File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/ind.ml loaded () : void ####### Section prove_rec_fn_exists begun derive_existence_thm = - : (thm -> conv) mk_fn = - : ((term # term # term list # term # goal) -> (term # term list # thm)) instantiate_existence_thm = - : (thm -> conv) closeup = - : (term -> term) prove_rec_fn_exists = - : (thm -> conv) - : (thm -> conv) Section prove_rec_fn_exists ended prove_rec_fn_exists = - : (thm -> conv) new_recursive_definition = - : (bool -> thm -> string -> conv) File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/prim_rec.ml loaded () : void #######################tree_INDUCT = - : (thm -> thm) ####################tree_INDUCT_TAC = - : tactic ###LIST_INDUCT_TAC = - : tactic ###INDUCT_TAC = - : tactic ########Size = |- Size = (@fn. !tl. fn(node tl) = SUC(SUM(MAP fn tl))) ###########Size_thm = |- !tl. Size(node tl) = SUC(SUM(MAP Size tl)) #########Is_ltree = |- !t l. Is_ltree(t,l) = (Size t = LENGTH l) ###ty = ":tree # (*)list" : type ######Exists_ltree_REP = |- ?t. Is_ltree t #######ltree_TY_DEF = |- ?rep. TYPE_DEFINITION Is_ltree rep ##########ltree_ISO_DEF = |- (!a. ABS_ltree(REP_ltree a) = a) /\ (!r. Is_ltree r = (REP_ltree(ABS_ltree r) = r)) #######R_11 = |- !a a'. (REP_ltree a = REP_ltree a') = (a = a') R_ONTO = |- !r. Is_ltree r = (?a. r = REP_ltree a) A_11 = |- !r r'. Is_ltree r ==> Is_ltree r' ==> ((ABS_ltree r = ABS_ltree r') = (r = r')) A_ONTO = |- !a. ?r. (a = ABS_ltree r) /\ Is_ltree r A_R = |- !a. ABS_ltree(REP_ltree a) = a R_A = |- !r. Is_ltree r = (REP_ltree(ABS_ltree r) = r) ########Node = |- !v tl. Node v tl = ABS_ltree (node(MAP(FST o REP_ltree)tl),CONS v(FLAT(MAP(SND o REP_ltree)tl))) ######################REP_Node = |- !tl. REP_ltree(Node v tl) = node(MAP(FST o REP_ltree)tl),CONS v(FLAT(MAP(SND o REP_ltree)tl)) ###########Size_LENGTH_lemma = |- !t. Size(FST(REP_ltree t)) = LENGTH(SND(REP_ltree t)) #########MAP_Size_LENGTH = |- !tl. MAP Size(MAP(FST o REP_ltree)tl) = MAP LENGTH(MAP(SND o REP_ltree)tl) ##############AP = |- (!l. AP[]l = []) /\ (!h t l. AP(CONS h t)l = CONS(h(HD l))(AP t(TL l))) ######SPLIT = |- (!l. SPLIT 0 l = [],l) /\ (!n l. SPLIT(SUC n)l = CONS(HD l)(FST(SPLIT n(TL l))),SND(SPLIT n(TL l))) ######PART = |- (!l. PART[]l = []) /\ (!n t l. PART(CONS n t)l = CONS(FST(SPLIT n l))(PART t(SND(SPLIT n l)))) ##########SPLIT_APPEND = |- !l l'. SPLIT(LENGTH l)(APPEND l l') = l,l' ######PART_FLAT = |- !l. PART(MAP LENGTH l)(FLAT l) = l ###############LENGTH_SND_SPLIT = |- !l n m. (LENGTH l = n + m) ==> (LENGTH(SND(SPLIT n l)) = m) ###############LENGTH_FST_SPLIT = |- !l n m. (LENGTH l = n + m) ==> (LENGTH(FST(SPLIT n l)) = n) #################APPEND_SPLIT = |- !l n m. (LENGTH l = n + m) ==> (APPEND(FST(SPLIT n l))(SND(SPLIT n l)) = l) ##################################REP_REC_lemma = |- !f. ?! fn. !tl l. fn(node tl,l) = f (AP(MAP(\t e. fn(t,e))tl)(PART(MAP Size tl)(TL l))) (HD l) (MAP ABS_ltree(AP(MAP $, tl)(PART(MAP Size tl)(TL l)))) ############lemma1 = |- !tl. MAP ABS_ltree (AP (MAP $,(MAP(FST o REP_ltree)tl)) (PART (MAP Size(MAP(FST o REP_ltree)tl)) (FLAT(MAP(SND o REP_ltree)tl)))) = tl ##############lemma2 = |- !tl. AP (MAP(\t e. fn(t,e))(MAP(FST o REP_ltree)tl)) (PART (MAP Size(MAP(FST o REP_ltree)tl)) (FLAT(MAP(SND o REP_ltree)tl))) = MAP(fn o REP_ltree)tl #######################lemma3 = |- !trl l. (LENGTH l = SUM(MAP Size trl)) ==> (FLAT (MAP (SND o REP_ltree) (MAP ABS_ltree(AP(MAP $, trl)(PART(MAP Size trl)l)))) = l) #########################lemma4 = |- !trl l. (LENGTH l = SUM(MAP Size trl)) ==> (node (MAP (FST o REP_ltree) (MAP ABS_ltree(AP(MAP $, trl)(PART(MAP Size trl)l)))) = node trl) ####################lemma5 = |- !trl l. (Size(node trl) = LENGTH l) ==> (ABS_ltree(node trl,l) = Node(HD l)(MAP ABS_ltree(AP(MAP $, trl)(PART(MAP Size trl)(TL l))))) #######################lemma6 = |- !trl l. (Size(node trl) = LENGTH l) ==> ALL_EL (\p. Size(FST p) = LENGTH(SND p)) (AP(MAP $, trl)(PART(MAP Size trl)(TL l))) ##################lemma7 = |- !trl. ALL_EL (\t. !l. (Size t = LENGTH l) ==> (x(ABS_ltree(t,l)) = y(ABS_ltree(t,l)))) trl ==> (!l. ALL_EL(\p. Size(FST p) = LENGTH(SND p))(AP(MAP $, trl)l) ==> (MAP x(MAP ABS_ltree(AP(MAP $, trl)l)) = MAP y(MAP ABS_ltree(AP(MAP $, trl)l)))) ###########################ltree_Axiom = |- !f. ?! fn. !v tl. fn(Node v tl) = f(MAP fn tl)v tl ####unique_lemma = |- !f fn fn'. (!v tl. fn(Node v tl) = f(MAP fn tl)v tl) /\ (!v tl. fn'(Node v tl) = f(MAP fn' tl)v tl) ==> (fn = fn') ##############################ltree_Induct = |- !P. (!t. ALL_EL P t ==> (!h. P(Node h t))) ==> (!l. P l) ###exists_lemma = |- !f. ?fn. !v tl. fn(Node v tl) = f(MAP fn tl)v tl ################Node_11 = |- !v1 v2 trl1 trl2. (Node v1 trl1 = Node v2 trl2) = (v1 = v2) /\ (trl1 = trl2) #######################ltree_INDUCT = - : (thm -> thm) #######################ltree_INDUCT_TAC = - : tactic ########Node_onto = |- !l. ?v trl. l = Node v trl ##() : void ##=======> theory ltree built cd /build/reproducible-path/hol88-2.02.19940316dfsg/theories; rm -f tydefs.th;\ /build/reproducible-path/hol88-2.02.19940316dfsg/basic-hol < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_tydefs.ml;\ cd /build/reproducible-path/hol88-2.02.19940316dfsg BASIC-HOL version 2.02 (GCL) created 25/8/25 ############################() : void ###Theory ltree loaded [()] : void list ###o_THM = |- !f g x. (f o g)x = f(g x) ###list_INDUCT = |- !P. P[] /\ (!t. P t ==> (!h. P(CONS h t))) ==> (!l. P l) #MAP_o = |- !f g. MAP(f o g) = (MAP f) o (MAP g) ####ltree_Axiom = |- !f. ?! fn. !v tl. fn(Node v tl) = f(MAP fn tl)v tl ltree_Induct = |- !P. (!t. ALL_EL P t ==> (!h. P(Node h t))) ==> (!l. P l) ####ALL_EL = |- (!P. ALL_EL P[] = T) /\ (!P x l. ALL_EL P(CONS x l) = P x /\ ALL_EL P l) MAP = |- (!f. MAP f[] = []) /\ (!f h t. MAP f(CONS h t) = CONS(f h)(MAP f t)) ########### Section INDUCT_THEN begun BETAS = - : (term -> term -> conv) GTAC = - : (term -> tactic) TACF = - : (term -> term -> thm_tactic -> tactic) TACS = - : (term -> term -> thm_tactic -> tactic list) GOALS = - : (* -> ((* # term) -> (** # ***)) list -> term -> (** list # *** list)) GALPH = - : conv GALPHA = - : conv mapshape = - : (int list -> (* list -> **) list -> * list -> ** list) INDUCT_THEN = - : (thm -> thm_tactic -> tactic) - : (thm -> thm_tactic -> tactic) Section INDUCT_THEN ended INDUCT_THEN = - : (thm -> thm_tactic -> tactic) File /build/reproducible-path/hol88-2.02.19940316dfsg/ml/ind.ml loaded () : void ###LIST_INDUCT_TAC = - : tactic ########################ltree_INDUCT = - : (thm -> thm) #######################ltree_INDUCT_TAC = - : tactic #######Node_onto = |- !l. ?v trl. l = Node v trl #########ALL_EL_MAP_lemma = |- !l. ALL_EL(\x. x)(MAP P l) = ALL_EL P l ####exists_lemma = |- !f. ?fn. !v tl. fn(Node v tl) = f(MAP fn tl)v tl ###############TRP_thm = |- !P. ?TRP. !v tl. TRP(Node v tl) = P v tl /\ ALL_EL TRP tl ##########lemma1 = |- !l x y. ALL_EL P l /\ ALL_EL(\e. P e ==> (x e = y e))l ==> (MAP x l = MAP y l) ######################TRP_EU = |- !TRP P. (!v tl. TRP(Node v tl) = P v tl /\ ALL_EL TRP tl) ==> (!f. (?fn. !v tl. TRP(Node v tl) ==> (fn(Node v tl) = f(MAP fn tl)v tl)) /\ (!x y. (!v tl. TRP(Node v tl) ==> (x(Node v tl) = f(MAP x tl)v tl)) ==> (!v tl. TRP(Node v tl) ==> (y(Node v tl) = f(MAP y tl)v tl)) ==> (!l. TRP l ==> (x l = y l)))) ######TRP_DEF = |- !P. TRP P = (@trp. !v tl. trp(Node v tl) = P v tl /\ ALL_EL trp tl) ########TRP = |- !P v tl. TRP P(Node v tl) = P v tl /\ ALL_EL(TRP P)tl ##############TRP_EU_thm = |- !P f. (?fn. !v tl. TRP P(Node v tl) ==> (fn(Node v tl) = f(MAP fn tl)v tl)) /\ (!x y. (!v tl. TRP P(Node v tl) ==> (x(Node v tl) = f(MAP x tl)v tl)) ==> (!v tl. TRP P(Node v tl) ==> (y(Node v tl) = f(MAP y tl)v tl)) ==> (!l. TRP P l ==> (x l = y l))) ########AR_lemma1 = |- (!a. ABS(REP a) = a) ==> (!r. TRP P r = (REP(ABS r) = r)) ==> (!tl. ALL_EL(TRP P)(MAP REP tl)) ############AR_lemma2 = |- (!a. ABS(REP a) = a) ==> (!r. TRP P r = (REP(ABS r) = r)) ==> (!tl v. P v(MAP REP tl) ==> (REP(ABS(Node v(MAP REP tl))) = Node v(MAP REP tl))) ############AR_lemma3 = |- (!a. ABS(REP a) = a) ==> (!r. TRP P r = (REP(ABS r) = r)) ==> (!trl. ALL_EL(TRP P)trl ==> (?tl. trl = MAP REP tl)) #######AR_lemma4 = |- (!a. ABS(REP a) = a) ==> (!al. MAP ABS(MAP REP al) = al) #####AR_lemma5 = .. |- !a. ?r. (a = ABS r) /\ TRP P r ###############################################################TY_DEF_THM = |- !REP ABS P. (!a. ABS(REP a) = a) /\ (!r. TRP P r = (REP(ABS r) = r)) ==> (!f. ?! fn. !v tl. P v(MAP REP tl) ==> (fn(ABS(Node v(MAP REP tl))) = f(MAP fn tl)v tl)) ########exists_TRP = |- !P. (?v. P v[]) ==> (?t. TRP P t) ##() : void ##=======> theory tydefs built cd /build/reproducible-path/hol88-2.02.19940316dfsg/theories; rm -f sum.th;\ /build/reproducible-path/hol88-2.02.19940316dfsg/basic-hol < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_sum.ml;\ cd /build/reproducible-path/hol88-2.02.19940316dfsg BASIC-HOL version 2.02 (GCL) created 25/8/25 ############################################() : void ###Theory combin loaded () : void ###o_DEF = |- !f g. f o g = (\x. f(g x)) #o_THM = |- !f g x. (f o g)x = f(g x) ###################IS_SUM_REP = |- !f. IS_SUM_REP f = (?v1 v2. (f = (\b x y. (x = v1) /\ b)) \/ (f = (\b x y. (y = v2) /\ ~b))) ###########EXISTS_SUM_REP = |- ?f. IS_SUM_REP f #########sum_TY_DEF = |- ?rep. TYPE_DEFINITION IS_SUM_REP rep ##########sum_ISO_DEF = |- (!a. ABS_sum(REP_sum a) = a) /\ (!r. IS_SUM_REP r = (REP_sum(ABS_sum r) = r)) ######R_A = |- !r. (REP_sum(ABS_sum r) = r) = IS_SUM_REP r R_11 = |- (a = a') = (REP_sum a = REP_sum a') A_ONTO = |- !a. ?r. (a = ABS_sum r) /\ (?v1 v2. (r = (\b x y. (x = v1) /\ b)) \/ (r = (\b x y. (y = v2) /\ ~b))) ##########INL_DEF = |- !e. INL e = ABS_sum(\b x y. (x = e) /\ b) ######INR_DEF = |- !e. INR e = ABS_sum(\b x y. (y = e) /\ ~b) #######SIMP = - : (thm -> thm) #REWRITE1_TAC = - : thm_tactic #######REP_INL = |- REP_sum(INL v) = (\b x y. (x = v) /\ b) #######REP_INR = |- REP_sum(INR v) = (\b x y. (y = v) /\ ~b) #########INL_11 = |- (INL x = INL y) = (x = y) #########INR_11 = |- (INR x = INR y) = (x = y) ########INR_neq_INL = |- !v1 v2. ~(INR v2 = INL v1) ######EPS_lemma = |- (@x. y = x) = y #############################sum_axiom = |- !f g. ?! h. (h o INL = f) /\ (h o INR = g) ##############sum_Axiom = |- !f g. ?! h. (!x. h(INL x) = f x) /\ (!x. h(INR x) = g x) ################ISL_DEF = |- ?ISL. (!x. ISL(INL x)) /\ (!y. ~ISL(INR y)) ###ISL = |- (!x. ISL(INL x)) /\ (!y. ~ISL(INR y)) ##########ISR_DEF = |- ?ISR. (!x. ISR(INR x)) /\ (!y. ~ISR(INL y)) ###ISR = |- (!x. ISR(INR x)) /\ (!y. ~ISR(INL y)) ##########OUTL_DEF = |- ?OUTL. !x. OUTL(INL x) = x ###OUTL = |- !x. OUTL(INL x) = x ##########OUTR_DEF = |- ?OUTR. !x. OUTR(INR x) = x ###OUTR = |- !x. OUTR(INR x) = x ###() : void ###########################sum_EXISTS = |- !f g. ?h. (!x. h(INL x) = f x) /\ (!x. h(INR x) = g x) sum_UNIQUE = |- !f g h h'. ((!x. h(INL x) = f x) /\ (!x. h(INR x) = g x)) /\ (!x. h'(INL x) = f x) /\ (!x. h'(INR x) = g x) ==> (!s. h s = h' s) ########################sum_lemma = |- !v. (?x. v = INL x) \/ (?x. v = INR x) ########ISL_OR_ISR = |- !x. ISL x \/ ISR x ########INL = |- !x. ISL x ==> (INL(OUTL x) = x) ########INR = |- !x. ISR x ==> (INR(OUTR x) = x) ##=======> theory sum built cd /build/reproducible-path/hol88-2.02.19940316dfsg/theories; rm -f one.th;\ /build/reproducible-path/hol88-2.02.19940316dfsg/basic-hol < /build/reproducible-path/hol88-2.02.19940316dfsg/theories/mk_one.ml;\ cd /build/reproducible-path/hol88-2.02.19940316dfsg BASIC-HOL version 2.02 (GCL) created 25/8/25 ##################################() : void ################EXISTS_ONE_REP = |- ?b. (\b. b)b #######one_TY_DEF = |- ?rep. (!x' x''. (rep x' = rep x'') ==> (x' = x'')) /\ (!x'''. (\b. b)x''' = (?x'. x''' = rep x')) ###one_DEF = |- one = (@x. T) ###() : void ###################one_axiom = |- !f g. f = g ##########one = |- !v. v = one ###########one_Axiom = |- !e. ?! fn. fn one = e ##=======> theory one built cd /build/reproducible-path/hol88-2.02.19940316dfsg/theories; rm -f HOL.th;\ echo 'new_theory `HOL`;;'\ 'map new_parent [`one`;`sum`;`tydefs`];;'\ 'close_theory();;'\ 'quit();;'\ | /build/reproducible-path/hol88-2.02.19940316dfsg/basic-hol;\ cd /build/reproducible-path/hol88-2.02.19940316dfsg BASIC-HOL version 2.02 (GCL) created 25/8/25 #() : void Theory one loaded Theory sum loaded Theory tydefs loaded [(); (); ()] : void list () : void =======> theory HOL built echo 'load_theory `num`;;'\ 'compilet `ml/numconv`;;'\ 'quit();;'\ | basic-hol BASIC-HOL version 2.02 (GCL) created 25/8/25 #Theory num loaded () : void num_CONV = - : conv Calling Lisp compiler File ml/numconv compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `HOL`;;'\ 'compilet `ml/tydefs`;;'\ 'quit();;'\ | basic-hol BASIC-HOL version 2.02 (GCL) created 25/8/25 #() : void Theory HOL loaded () : void ignore = - : (string -> bool) is_sing = - : (string -> bool) getid = - : (string -> string list -> (string # string list)) gettyvid = - : (string -> string list -> (string # string list)) gnt = - : (string list -> ((string + string + string + void) # string list)) isid = - : ((* + **) -> bool) istyvar = - : ((* + ** + ***) -> bool) is = - : ((* + ** + *** + ****) -> *** -> bool) end = - : ((* + ** + *** + ****) -> bool) istyop = - : ((string + *) -> bool) ckrb = - : ((* + ** + string + ***) -> (* + ** + string + ***)) mk_ty = - : ((string # type list) -> type) parse_types = - : (string -> string list -> ((type + void) list # string list)) parse_clause = - : (string -> string -> string list -> string list -> (string # (type + void) list # string list)) parse_clauses = - : (string -> string list -> string list -> (string # (type + void) list) list) parse_input = - : (string -> (string # (string # (type + void) list) list)) pargs = - : ((* + **) list -> (* list # term)) mk_tuple_ty = - : (type list -> type) mk_tuple = - : (term list -> term) mk_sum_ty = - : (type list -> type) inject = - : (type -> term list -> term list) mkvars = - : (type list -> term list) mk_subset_pred = - : ((type + *) list list -> term) splitf = - : ((* -> bool) -> * list -> (* list # * # * list)) prove_existence_thm = - : conv variant_tyvar = - : (type list -> string list -> type) OR_IMP_CONV = - : conv FORALL_IN_CONV = - : conv CONJS_CONV = - : (conv -> conv) EQN_ELIM_CONV = - : conv LENGTH_MAP_CONV = - : (thm -> conv) LENGTH_ELIM_CONV = - : conv MAP_CONV = - : conv ELIM_MAP_CONV = - : conv TRANSFORM = - : (term -> thm -> (term # thm)) part = - : (int -> * list -> (* list # * list)) define_const = - : ((string # (* + **) list # term) -> thm) DEFINE_CONSTRUCTORS = - : (string list -> (* + **) list list -> thm -> thm) mk_tests = - : (* list -> type -> (term # term list)) mk_proj = - : (term -> * list -> type -> term list) extract_list = - : (type -> term -> term -> term list) strip_inj = - : (term -> term) extract_tuple = - : (type -> term -> term -> term list) gen_names = - : ((bool # bool) -> * list list -> string list) mk_fun_ty = - : (term -> type -> type) make_rhs = - : (type -> term -> term -> (bool # term # string # term list) -> (term # term)) make_conditional = - : (term list -> term list -> term) make_function = - : ((* + **) list list -> thm -> goal) PROJ_CONV = - : conv TEST_SIMP_CONV = - : conv LIST_ELS = - : (term -> thm list) GEN_PROJ_CONV = - : conv TUPLE_COMPS = - : (thm -> thm list) SIMP_CONV = - : conv SIMPLIFY = - : (thm -> thm) define_type = - : (string -> string -> thm) - : (string -> string -> thm) define_type = - : (string -> string -> thm) Calling Lisp compiler File ml/tydefs compiled () : void #echo 'compilet `ml/ind`;;'\ 'quit();;'\ | basic-hol BASIC-HOL version 2.02 (GCL) created 25/8/25 # BETAS = - : (term -> term -> conv) GTAC = - : (term -> tactic) TACF = - : (term -> term -> thm_tactic -> tactic) TACS = - : (term -> term -> thm_tactic -> tactic list) GOALS = - : (* -> ((* # term) -> (** # ***)) list -> term -> (** list # *** list)) GALPH = - : conv GALPHA = - : conv mapshape = - : (int list -> (* list -> **) list -> * list -> ** list) INDUCT_THEN = - : (thm -> thm_tactic -> tactic) - : (thm -> thm_tactic -> tactic) INDUCT_THEN = - : (thm -> thm_tactic -> tactic) Calling Lisp compiler File ml/ind compiled () : void #echo 'compilet `ml/prim_rec`;;'\ 'quit();;'\ | basic-hol BASIC-HOL version 2.02 (GCL) created 25/8/25 # derive_existence_thm = - : (thm -> conv) mk_fn = - : ((term # term # term list # term # goal) -> (term # term list # thm)) instantiate_existence_thm = - : (thm -> conv) closeup = - : (term -> term) prove_rec_fn_exists = - : (thm -> conv) - : (thm -> conv) prove_rec_fn_exists = - : (thm -> conv) new_recursive_definition = - : (bool -> thm -> string -> conv) Calling Lisp compiler File ml/prim_rec compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `HOL`;;'\ 'compilet `ml/tyfns`;;'\ 'quit();;'\ | basic-hol BASIC-HOL version 2.02 (GCL) created 25/8/25 #() : void Theory HOL loaded () : void () : void UNIQUENESS = - : (thm -> thm) DEPTH_FORALL_CONV = - : (conv -> conv) CONJS_CONV = - : (conv -> conv) CONJS_SIMP = - : (conv -> conv) T_AND_CONV = - : conv GENL_T = - : (term list -> thm) SIMP_CONV = - : conv HYP_SIMP = - : conv ANTE_ALL_CONV = - : conv CONCL_SIMP = - : conv prove_induction_thm = - : (thm -> thm) - : (thm -> thm) prove_induction_thm = - : (thm -> thm) NOT_ALL_THENC = - : (conv -> conv) BASE_CONV = - : conv STEP_CONV = - : conv NOT_IN_CONV = - : conv STEP_SIMP = - : conv DISJS_CHAIN = - : (conv -> thm -> thm) prove_cases_thm = - : (thm -> thm) - : (thm -> thm) prove_cases_thm = - : (thm -> thm) PAIR_EQ_CONV = - : conv list_variant = - : (term list -> term list -> term list) prove_const_one_one = - : (thm -> conv) prove_constructors_one_one = - : (thm -> thm) - : (thm -> thm) prove_constructors_one_one = - : (thm -> thm) prove_constructors_distinct = - : (thm -> thm) Calling Lisp compiler File ml/tyfns compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `HOL`;;'\ 'compilet `ml/num`;;'\ 'quit();;'\ | basic-hol BASIC-HOL version 2.02 (GCL) created 25/8/25 #() : void Theory HOL loaded () : void () : void INDUCT = - : ((thm # thm) -> thm) INDUCT_TAC = - : tactic new_prim_rec_definition = - : ((string # term) -> thm) new_infix_prim_rec_definition = - : ((string # term) -> thm) ADD_CONV = - : conv num_EQ_CONV = - : conv EXISTS_LEAST_CONV = - : conv EXISTS_GREATEST_CONV = - : conv term_of_int = - : (int -> term) int_of_term = - : (term -> int) Calling Lisp compiler File ml/num compiled () : void #echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `HOL`;;'\ 'compilet `ml/list`;;'\ 'quit();;'\ | basic-hol BASIC-HOL version 2.02 (GCL) created 25/8/25 #() : void Theory HOL loaded () : void () : void LIST_INDUCT = - : ((thm # thm) -> thm) LIST_INDUCT_TAC = - : tactic SNOC_INDUCT_TAC = - : tactic EQ_LENGTH_INDUCT_TAC = - : tactic EQ_LENGTH_SNOC_INDUCT_TAC = - : tactic new_list_rec_definition = - : ((string # term) -> thm) new_infix_list_rec_definition = - : ((string # term) -> thm) LENGTH_CONV = - : conv list_EQ_CONV = - : (conv -> conv) check_const = - : (string -> term -> bool) int_of_term = - : (term -> int) term_of_int = - : (int -> term) APPEND_CONV = - : conv MAP_CONV = - : (conv -> conv) FOLDR_CONV = - : (conv -> conv) FOLDL_CONV = - : (conv -> conv) list_FOLD_CONV = - : (thm -> conv -> conv) SUM_CONV = - : conv FILTER_CONV = - : (conv -> conv) SNOC_CONV = - : conv REVERSE_CONV = - : conv FLAT_CONV = - : conv EL_CONV = - : conv ELL_CONV = - : conv MAP2_CONV = - : (conv -> conv) ALL_EL_CONV = - : (conv -> conv) SOME_EL_CONV = - : (conv -> conv) IS_EL_CONV = - : (conv -> conv) LAST_CONV = - : conv BUTLAST_CONV = - : conv SUC_CONV = - : conv SEG_CONV = - : conv LASTN_CONV = - : conv BUTLASTN_CONV = - : conv BUTFIRSTN_CONV = - : conv FIRSTN_CONV = - : conv SCANL_CONV = - : (conv -> conv) SCANR_CONV = - : (conv -> conv) REPLICATE_CONV = - : conv GENLIST_CONV = - : (conv -> conv) ((-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), -) : (conv # (conv -> conv) # (conv -> conv) # (conv -> conv) # (thm -> conv -> conv) # conv # (conv -> conv) # conv # conv # conv # conv # conv # (conv -> conv) # (conv -> conv) # (conv -> conv) # (conv -> conv) # conv # conv # conv # conv # conv # conv # conv # (conv -> conv) # (conv -> conv) # conv # (conv -> conv)) APPEND_CONV = - : conv MAP_CONV = - : (conv -> conv) FOLDR_CONV = - : (conv -> conv) FOLDL_CONV = - : (conv -> conv) list_FOLD_CONV = - : (thm -> conv -> conv) SUM_CONV = - : conv FILTER_CONV = - : (conv -> conv) SNOC_CONV = - : conv REVERSE_CONV = - : conv FLAT_CONV = - : conv EL_CONV = - : conv ELL_CONV = - : conv MAP2_CONV = - : (conv -> conv) ALL_EL_CONV = - : (conv -> conv) SOME_EL_CONV = - : (conv -> conv) IS_EL_CONV = - : (conv -> conv) LAST_CONV = - : conv BUTLAST_CONV = - : conv SEG_CONV = - : conv LASTN_CONV = - : conv BUTLASTN_CONV = - : conv BUTFIRSTN_CONV = - : conv FIRSTN_CONV = - : conv SCANL_CONV = - : (conv -> conv) SCANR_CONV = - : (conv -> conv) REPLICATE_CONV = - : conv GENLIST_CONV = - : (conv -> conv) Calling Lisp compiler File ml/list compiled () : void #echo 'compilet `ml/lib_loader`;;'\ 'quit();;'\ | basic-hol BASIC-HOL version 2.02 (GCL) created 25/8/25 # define_load_lib_function = - : (string list -> void -> void) library_loader = - : ((string # string list # string list # string list # string # string # string list) -> void) Calling Lisp compiler File ml/lib_loader compiled () : void #if [ cl = cl ]; then\ echo '#+allegro (progn () (set-case-mode :case-insensitive-upper) (setq *cltl1-in-package-compatibility-p* t) (setq comp:*cltl1-compile-file-toplevel-compatibility-p* t) (setq *enable-package-locked-errors* nil))'\ '(load "lisp/f-cl") (compile-file "lisp/banner.l") (quit)'\ | gcl; else\ lisp/banner; fi GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ >;; Loading "lisp/f-cl" ;; start address for /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/f-cl.o 0x2678010 ;; Finished loading "lisp/f-cl" 39407 > ;; Compiling lisp/banner.l. ;; End of Pass 1. ;; End of Pass 2. OPTIMIZE levels: Safety=0 (No runtime error checking), Space=0, Speed=3 ;; Finished compiling /build/reproducible-path/hol88-2.02.19940316dfsg/lisp/banner.o. #P"/build/reproducible-path/hol88-2.02.19940316dfsg/lisp/banner.o" NIL NIL >echo 'set_search_path[``; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'load_theory `HOL`;;'\ 'loadf `ml/load_thms`;;'\ 'loadf `ml/lib_loader`;;'\ 'loadf `ml/numconv`;;'\ 'loadf `ml/tydefs`;;'\ 'loadf `ml/ind`;;'\ 'loadf `ml/prim_rec`;;'\ 'loadf `ml/tyfns`;;'\ 'loadf `ml/num`;;'\ 'loadf `ml/list`;;'\ 'map delete_cache [`arithmetic`;`sum`;`list`];;'\ 'map delete_cache [`tree`;`ltree`;`prim_rec`];;'\ 'lisp `(load "lisp/banner")`;;'\ 'lisp `(setq %system-name "HOL")`;;'\ 'lisp `(setq %hol-dir "/build/reproducible-path/hol88-2.02.19940316dfsg")`;;'\ 'lisp `(setq %lib-dir "/build/reproducible-path/hol88-2.02.19940316dfsg/Library")`;;'\ 'lisp `(setq %liszt "")`;;'\ 'lisp `(setq %version "2.02 (GCL)")`;;'\ 'set_flag(`abort_when_fail`,false);;'\ 'set_search_path[``; `~/`; `/build/reproducible-path/hol88-2.02.19940316dfsg/theories/`];;'\ 'set_help_search_path (words `/build/reproducible-path/hol88-2.02.19940316dfsg/help/ENTRIES/`);;'\ 'set_library_search_path [`/build/reproducible-path/hol88-2.02.19940316dfsg/Library/`];;'\ 'lisp `(setup)`;;' >foo2 echo 'lisp `(throw (quote eof) t)`;; #+native-reloc(progn (with-open-file (s "foo2") (let ((*standard-input* s)) (tml)))(ml-save "hol")) #-native-reloc(let ((si::*collect-binary-modules* t)(si::*binary-modules* (with-open-file (s "bm.l") (read s)))) (with-open-file (s "foo2") (let ((*standard-input* s)) (tml)))(compiler::link (remove-duplicates si::*binary-modules* :test (function equal)) "hol" "(progn (load \"debian/gcl_patch.l\")(load \"foo\")(with-open-file (s \"foo1\") (let ((*standard-input* s)) (tml)))(with-open-file (s \"foo2\") (let ((*standard-input* s)) (tml)))(ml-save \"hol\")(quit))" "" nil)(quit))`;;' | basic-hol BASIC-HOL version 2.02 (GCL) created 25/8/25 #GCL (GNU Common Lisp) 2.7.1 Thu Apr 10 09:38:27 PM EDT 2025 CLtL1 git: Version_2_7_2pre6 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ > BASIC-HOL version 2.02 (GCL) created 25/8/25 #() : void Theory HOL loaded () : void .........() : void #..() : void .() : void .......................................................() : void ...........() : void ........() : void ..............................() : void ...........() : void ...........................................() : void [(); (); ()] : void list [(); (); ()] : void list () : void () : void () : void () : void () : void () : void true : bool () : void () : void () : void () : void #make permissions make[3]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg' find $(ls -1 | grep -v debian) \ \( -type d -exec chmod 775 {} \; \) -o\ \( -type f -exec chmod 664 {} \; \) for f in hol hol-lcf basic-hol Manual/LaTeX/makeindex Manual/LaTeX/makeindex.bin/*/makeindex Manual/Reference/bin/mktex Manual/Reference/bin/typecheck ; do\ ( if [ -f $f ] ; then\ find $f -exec chmod 775 {} \; ;fi) ; \ done make[3]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg' =======> hol88 version 2.02 (GCL) made make[2]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg' date Mon Aug 25 19:24:57 2025 /usr/bin/make library make[2]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg' date Mon Aug 25 19:24:57 2025 (cd /build/reproducible-path/hol88-2.02.19940316dfsg/Library; /usr/bin/make LispType=cl\ Obj=o\ Lisp=gcl\ Liszt=\ LispDir=/build/reproducible-path/hol88-2.02.19940316dfsg/lisp\ Hol=/build/reproducible-path/hol88-2.02.19940316dfsg/hol library; cd ..) make[3]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library' for lib in unwind taut sets reduce arith pred_sets string finite_sets res_quan wellorder abs_theory reals window pair word record_proof parser prettyp trs latex-hol more_arithmetic numeral ind_defs ; \ do (cd $lib; /usr/bin/make LispType=cl\ Obj=o\ Lisp=gcl\ Liszt=\ LispDir=/build/reproducible-path/hol88-2.02.19940316dfsg/lisp\ Hol=/build/reproducible-path/hol88-2.02.19940316dfsg/hol all; cd ..) ; \ done make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind' echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `unwinding`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool DEPTH_FORALL_CONV = - : (conv -> conv) DEPTH_EXISTS_CONV = - : (conv -> conv) FLATTEN_CONJ_CONV = - : conv CONJ_FORALL_ONCE_CONV = - : conv FORALL_CONJ_ONCE_CONV = - : conv CONJ_FORALL_CONV = - : conv FORALL_CONJ_CONV = - : conv CONJ_FORALL_RIGHT_RULE = - : (thm -> thm) FORALL_CONJ_RIGHT_RULE = - : (thm -> thm) UNFOLD_CONV = - : (thm list -> conv) UNFOLD_RIGHT_RULE = - : (thm list -> thm -> thm) line_var = - : (term -> term) line_name = - : (term -> string) UNWIND_ONCE_CONV = - : ((term -> bool) -> conv) UNWIND_CONV = - : ((term -> bool) -> conv) UNWIND_ALL_BUT_CONV = - : (string list -> conv) UNWIND_AUTO_CONV = - : conv UNWIND_ALL_BUT_RIGHT_RULE = - : (string list -> thm -> thm) UNWIND_AUTO_RIGHT_RULE = - : (thm -> thm) EXISTS_DEL1_CONV = - : conv EXISTS_DEL_CONV = - : conv EXISTS_EQN_CONV = - : conv PRUNE_ONCE_CONV = - : conv PRUNE_ONE_CONV = - : (string -> conv) PRUNE_SOME_CONV = - : (string list -> conv) PRUNE_CONV = - : conv PRUNE_SOME_RIGHT_RULE = - : (string list -> thm -> thm) PRUNE_RIGHT_RULE = - : (thm -> thm) EXPAND_ALL_BUT_CONV = - : (string list -> thm list -> conv) EXPAND_AUTO_CONV = - : (thm list -> conv) EXPAND_ALL_BUT_RIGHT_RULE = - : (string list -> thm list -> thm -> thm) EXPAND_AUTO_RIGHT_RULE = - : (thm list -> thm -> thm) Calling Lisp compiler File unwinding compiled () : void #===> library unwind rebuilt make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut' echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `taut_check`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool is_T = - : (term -> bool) is_F = - : (term -> bool) BOOL_CASES_T_F = |- !f. (f T = F) ==> ((!x. f x) = F) BOOL_CASES_F_F = |- !f. (f F = F) ==> ((!x. f x) = F) BOOL_CASES_BOTH_T_RULE = - : ((thm # thm) -> conv) BOOL_CASES_T_F_RULE = - : (thm -> conv) BOOL_CASES_F_F_RULE = - : (thm -> conv) qconv = `QCONV` : string QCONV = - : (conv -> conv) ALL_QCONV = - : conv THENQC = - : (conv -> conv -> conv) ORELSEQC = - : (conv -> conv -> conv) TRY_QCONV = - : (conv -> conv) RAND_QCONV = - : (conv -> conv) RATOR_QCONV = - : (conv -> conv) ABS_QCONV = - : (conv -> conv) T_REFL = |- T = T F_REFL = |- F = F NOT_CONV = - : conv EQ_CONV = - : conv EQ_THEN_NOT_CONV = - : conv AND_CONV = - : conv OR_CONV = - : conv IMP_CONV = - : conv IMP_THEN_NOT_CONV = - : conv IF_CONV = - : conv SIMP_PROP_QCONV = - : conv DEPTH_FORALL_QCONV = - : (conv -> conv) FORALL_T = - : (term list -> thm) FORALL_F = - : (term list -> thm) TAUT_CHECK_CONV = - : conv PTAUT_CONV = - : conv PTAUT_TAC = - : tactic PTAUT_PROVE = - : conv non_prop_terms = - : (term -> term list) TAUT_CONV = - : conv TAUT_TAC = - : tactic TAUT_PROVE = - : conv ((-), (-), (-), (-), (-), -) : (conv # tactic # conv # conv # tactic # conv) PTAUT_CONV = - : conv PTAUT_TAC = - : tactic PTAUT_PROVE = - : conv TAUT_CONV = - : conv TAUT_TAC = - : tactic TAUT_PROVE = - : conv Calling Lisp compiler File taut_check compiled () : void #===> library taut rebuilt make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets' rm -f sets.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `mk_sets`;;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void EXISTENCE_THM = |- ?s. (\p. T)s set_TY_DEF = |- ?rep. TYPE_DEFINITION(\p. T)rep set_ISO_DEF = |- (!a. SPEC(CHF a) = a) /\ (!r. (\p. T)r = (CHF(SPEC r) = r)) CHF_11 = |- !a a'. (CHF a = CHF a') = (a = a') set_ISO_DEF = |- (!a. SPEC(CHF a) = a) /\ (!r. CHF(SPEC r) = r) IN_DEF = |- !x s. x IN s = CHF s x SPECIFICATION = |- !P x. x IN (SPEC P) = P x EXTENSION = |- !s t. (s = t) = (!x. x IN s = x IN t) NOT_EQUAL_SETS = |- !s t. ~(s = t) = (?x. x IN t = ~x IN s) Theorem NOT_LESS autoloading from theory `arithmetic` ... NOT_LESS = |- !m n. ~m < n = n <= m Theorem WOP autoloading from theory `arithmetic` ... WOP = |- !P. (?n. P n) ==> (?n. P n /\ (!m. m < n ==> ~P m)) NUM_SET_WOP = |- !s. (?n. n IN s) = (?n. n IN s /\ (!m. m IN s ==> n <= m)) GSPEC_DEF = |- !f. GSPEC f = SPEC(\y. ?x. y,T = f x) GSPECIFICATION = |- !f v. v IN (GSPEC f) = (?x. v,T = f x) Section SET_SPEC_CONV begun dest_tuple = - : (term -> term list) MK_PAIR = - : (* list -> conv) EXISTS_TUPLE_CONV = - : (term list -> conv) PAIR_EQ_CONV = - : conv ELIM_EXISTS_CONV = - : conv PROVE_EXISTS = - : conv list_variant = - : (term list -> term list -> term list) SET_SPEC_CONV = - : conv - : conv Section SET_SPEC_CONV ended SET_SPEC_CONV = - : conv File gspec.ml loaded () : void () : void true : bool lemma = |- !s x. x IN s ==> (!f. (f x) IN {f x | x IN s}) SET_MINIMUM = |- !s M. (?x. x IN s) = (?x. x IN s /\ (!y. y IN s ==> (M x) <= (M y))) EMPTY_DEF = |- EMPTY = SPEC(\x. F) NOT_IN_EMPTY = |- !x. ~x IN EMPTY MEMBER_NOT_EMPTY = |- !s. (?x. x IN s) = ~(s = EMPTY) UNIV_DEF = |- UNIV = SPEC(\x. T) IN_UNIV = |- !x. x IN UNIV UNIV_NOT_EMPTY = |- ~(UNIV = EMPTY) EMPTY_NOT_UNIV = |- ~(EMPTY = UNIV) EQ_UNIV = |- (!x. x IN s) = (s = UNIV) SUBSET_DEF = |- !s t. s SUBSET t = (!x. x IN s ==> x IN t) SUBSET_TRANS = |- !s t u. s SUBSET t /\ t SUBSET u ==> s SUBSET u SUBSET_REFL = |- !s. s SUBSET s SUBSET_ANTISYM = |- !s t. s SUBSET t /\ t SUBSET s ==> (s = t) EMPTY_SUBSET = |- !s. EMPTY SUBSET s SUBSET_EMPTY = |- !s. s SUBSET EMPTY = (s = EMPTY) SUBSET_UNIV = |- !s. s SUBSET UNIV UNIV_SUBSET = |- !s. UNIV SUBSET s = (s = UNIV) PSUBSET_DEF = |- !s t. s PSUBSET t = s SUBSET t /\ ~(s = t) PSUBSET_TRANS = |- !s t u. s PSUBSET t /\ t PSUBSET u ==> s PSUBSET u PSUBSET_IRREFL = |- !s. ~s PSUBSET s NOT_PSUBSET_EMPTY = |- !s. ~s PSUBSET EMPTY NOT_UNIV_PSUBSET = |- !s. ~UNIV PSUBSET s PSUBSET_UNIV = |- !s. s PSUBSET UNIV = (?x. ~x IN s) UNION_DEF = |- !s t. s UNION t = {x | x IN s \/ x IN t} IN_UNION = |- !s t x. x IN (s UNION t) = x IN s \/ x IN t UNION_ASSOC = |- !s t u. (s UNION t) UNION u = s UNION (t UNION u) UNION_IDEMPOT = |- !s. s UNION s = s UNION_COMM = |- !s t. s UNION t = t UNION s SUBSET_UNION = |- (!s t. s SUBSET (s UNION t)) /\ (!s t. s SUBSET (t UNION s)) SUBSET_UNION_ABSORPTION = |- !s t. s SUBSET t = (s UNION t = t) UNION_EMPTY = |- (!s. EMPTY UNION s = s) /\ (!s. s UNION EMPTY = s) UNION_UNIV = |- (!s. UNIV UNION s = UNIV) /\ (!s. s UNION UNIV = UNIV) EMPTY_UNION = |- !s t. (s UNION t = EMPTY) = (s = EMPTY) /\ (t = EMPTY) INTER_DEF = |- !s t. s INTER t = {x | x IN s /\ x IN t} IN_INTER = |- !s t x. x IN (s INTER t) = x IN s /\ x IN t INTER_ASSOC = |- !s t u. (s INTER t) INTER u = s INTER (t INTER u) INTER_IDEMPOT = |- !s. s INTER s = s INTER_COMM = |- !s t. s INTER t = t INTER s INTER_SUBSET = |- (!s t. (s INTER t) SUBSET s) /\ (!s t. (t INTER s) SUBSET s) SUBSET_INTER_ABSORPTION = |- !s t. s SUBSET t = (s INTER t = s) INTER_EMPTY = |- (!s. EMPTY INTER s = EMPTY) /\ (!s. s INTER EMPTY = EMPTY) INTER_UNIV = |- (!s. UNIV INTER s = s) /\ (!s. s INTER UNIV = s) UNION_OVER_INTER = |- !s t u. s INTER (t UNION u) = (s INTER t) UNION (s INTER u) INTER_OVER_UNION = |- !s t u. s UNION (t INTER u) = (s UNION t) INTER (s UNION u) DISJOINT_DEF = |- !s t. DISJOINT s t = (s INTER t = EMPTY) IN_DISJOINT = |- !s t. DISJOINT s t = ~(?x. x IN s /\ x IN t) DISJOINT_SYM = |- !s t. DISJOINT s t = DISJOINT t s DISJOINT_EMPTY = |- !s. DISJOINT EMPTY s /\ DISJOINT s EMPTY DISJOINT_EMPTY_REFL = |- !s. (s = EMPTY) = DISJOINT s s DISJOINT_UNION = |- !s t u. DISJOINT(s UNION t)u = DISJOINT s u /\ DISJOINT t u DIFF_DEF = |- !s t. s DIFF t = {x | x IN s /\ ~x IN t} IN_DIFF = |- !s t x. x IN (s DIFF t) = x IN s /\ ~x IN t DIFF_EMPTY = |- !s. s DIFF EMPTY = s EMPTY_DIFF = |- !s. EMPTY DIFF s = EMPTY DIFF_UNIV = |- !s. s DIFF UNIV = EMPTY DIFF_DIFF = |- !s t. (s DIFF t) DIFF t = s DIFF t DIFF_EQ_EMPTY = |- !s. s DIFF s = EMPTY INSERT_DEF = |- !x s. x INSERT s = {y | (y = x) \/ y IN s} () : void IN_INSERT = |- !x y s. x IN (y INSERT s) = (x = y) \/ x IN s COMPONENT = |- !x s. x IN (x INSERT s) SET_CASES = |- !s. (s = {}) \/ (?x t. (s = x INSERT t) /\ ~x IN t) DECOMPOSITION = |- !s x. x IN s = (?t. (s = x INSERT t) /\ ~x IN t) ABSORPTION = |- !x s. x IN s = (x INSERT s = s) INSERT_INSERT = |- !x s. x INSERT (x INSERT s) = x INSERT s INSERT_COMM = |- !x y s. x INSERT (y INSERT s) = y INSERT (x INSERT s) INSERT_UNIV = |- !x. x INSERT UNIV = UNIV NOT_INSERT_EMPTY = |- !x s. ~(x INSERT s = {}) NOT_EMPTY_INSERT = |- !x s. ~({} = x INSERT s) INSERT_UNION = |- !x s t. (x INSERT s) UNION t = (x IN t => s UNION t | x INSERT (s UNION t)) INSERT_UNION_EQ = |- !x s t. (x INSERT s) UNION t = x INSERT (s UNION t) INSERT_INTER = |- !x s t. (x INSERT s) INTER t = (x IN t => x INSERT (s INTER t) | s INTER t) DISJOINT_INSERT = |- !x s t. DISJOINT(x INSERT s)t = DISJOINT s t /\ ~x IN t INSERT_SUBSET = |- !x s t. (x INSERT s) SUBSET t = x IN t /\ s SUBSET t SUBSET_INSERT = |- !x s. ~x IN s ==> (!t. s SUBSET (x INSERT t) = s SUBSET t) INSERT_DIFF = |- !s t x. (x INSERT s) DIFF t = (x IN t => s DIFF t | x INSERT (s DIFF t)) DELETE_DEF = |- !s x. s DELETE x = s DIFF {x} IN_DELETE = |- !s x y. x IN (s DELETE y) = x IN s /\ ~(x = y) DELETE_NON_ELEMENT = |- !x s. ~x IN s = (s DELETE x = s) IN_DELETE_EQ = |- !s x x'. (x IN s = x' IN s) = (x IN (s DELETE x') = x' IN (s DELETE x)) EMPTY_DELETE = |- !x. {} DELETE x = {} DELETE_DELETE = |- !x s. (s DELETE x) DELETE x = s DELETE x DELETE_COMM = |- !x y s. (s DELETE x) DELETE y = (s DELETE y) DELETE x DELETE_SUBSET = |- !x s. (s DELETE x) SUBSET s SUBSET_DELETE = |- !x s t. s SUBSET (t DELETE x) = ~x IN s /\ s SUBSET t SUBSET_INSERT_DELETE = |- !x s t. s SUBSET (x INSERT t) = (s DELETE x) SUBSET t DIFF_INSERT = |- !s t x. s DIFF (x INSERT t) = (s DELETE x) DIFF t PSUBSET_INSERT_SUBSET = |- !s t. s PSUBSET t = (?x. ~x IN s /\ (x INSERT s) SUBSET t) lemma = |- ~(a = b) = (b = ~a) PSUBSET_MEMBER = |- !s t. s PSUBSET t = s SUBSET t /\ (?y. y IN t /\ ~y IN s) DELETE_INSERT = |- !x y s. (x INSERT s) DELETE y = ((x = y) => s DELETE y | x INSERT (s DELETE y)) INSERT_DELETE = |- !x s. x IN s ==> (x INSERT (s DELETE x) = s) DELETE_INTER = |- !s t x. (s DELETE x) INTER t = (s INTER t) DELETE x DISJOINT_DELETE_SYM = |- !s t x. DISJOINT(s DELETE x)t = DISJOINT(t DELETE x)s CHOICE_EXISTS = |- ?CHOICE. !s. ~(s = {}) ==> (CHOICE s) IN s CHOICE_DEF = |- !s. ~(s = {}) ==> (CHOICE s) IN s REST_DEF = |- !s. REST s = s DELETE (CHOICE s) CHOICE_NOT_IN_REST = |- !s. ~(CHOICE s) IN (REST s) CHOICE_INSERT_REST = |- !s. ~(s = {}) ==> ((CHOICE s) INSERT (REST s) = s) REST_SUBSET = |- !s. (REST s) SUBSET s lemma = |- (P /\ Q = P) = P ==> Q REST_PSUBSET = |- !s. ~(s = {}) ==> (REST s) PSUBSET s SING_DEF = |- !s. SING s = (?x. s = {x}) SING = |- !x. SING{x} IN_SING = |- !x y. x IN {y} = (x = y) NOT_SING_EMPTY = |- !x. ~({x} = {}) NOT_EMPTY_SING = |- !x. ~({} = {x}) EQUAL_SING = |- !x y. ({x} = {y}) = (x = y) DISJOINT_SING_EMPTY = |- !x. DISJOINT{x}{} INSERT_SING_UNION = |- !s x. x INSERT s = {x} UNION s SING_DELETE = |- !x. {x} DELETE x = {} DELETE_EQ_SING = |- !s x. x IN s ==> ((s DELETE x = {}) = (s = {x})) CHOICE_SING = |- !x. CHOICE{x} = x REST_SING = |- !x. REST{x} = {} SING_IFF_EMPTY_REST = |- !s. SING s = ~(s = {}) /\ (REST s = {}) IMAGE_DEF = |- !f s. IMAGE f s = {f x | x IN s} IN_IMAGE = |- !y s f. y IN (IMAGE f s) = (?x. (y = f x) /\ x IN s) IMAGE_IN = |- !x s. x IN s ==> (!f. (f x) IN (IMAGE f s)) IMAGE_EMPTY = |- !f. IMAGE f{} = {} IMAGE_ID = |- !s. IMAGE(\x. x)s = s Theorem o_THM autoloading from theory `combin` ... o_THM = |- !f g x. (f o g)x = f(g x) IMAGE_COMPOSE = |- !f g s. IMAGE(f o g)s = IMAGE f(IMAGE g s) IMAGE_INSERT = |- !f x s. IMAGE f(x INSERT s) = (f x) INSERT (IMAGE f s) IMAGE_EQ_EMPTY = |- !s f. (IMAGE f s = {}) = (s = {}) IMAGE_DELETE = |- !f x s. ~x IN s ==> (IMAGE f(s DELETE x) = IMAGE f s) IMAGE_UNION = |- !f s t. IMAGE f(s UNION t) = (IMAGE f s) UNION (IMAGE f t) IMAGE_SUBSET = |- !s t. s SUBSET t ==> (!f. (IMAGE f s) SUBSET (IMAGE f t)) IMAGE_INTER = |- !f s t. (IMAGE f(s INTER t)) SUBSET ((IMAGE f s) INTER (IMAGE f t)) INJ_DEF = |- !f s t. INJ f s t = (!x. x IN s ==> (f x) IN t) /\ (!x y. x IN s /\ y IN s ==> (f x = f y) ==> (x = y)) INJ_ID = |- !s. INJ(\x. x)s s INJ_COMPOSE = |- !f g s t u. INJ f s t /\ INJ g t u ==> INJ(g o f)s u INJ_EMPTY = |- !f. (!s. INJ f{}s) /\ (!s. INJ f s{} = (s = {})) SURJ_DEF = |- !f s t. SURJ f s t = (!x. x IN s ==> (f x) IN t) /\ (!x. x IN t ==> (?y. y IN s /\ (f y = x))) SURJ_ID = |- !s. SURJ(\x. x)s s SURJ_COMPOSE = |- !f g s t u. SURJ f s t /\ SURJ g t u ==> SURJ(g o f)s u SURJ_EMPTY = |- !f. (!s. SURJ f{}s = (s = {})) /\ (!s. SURJ f s{} = (s = {})) IMAGE_SURJ = |- !f s t. SURJ f s t = (IMAGE f s = t) BIJ_DEF = |- !f s t. BIJ f s t = INJ f s t /\ SURJ f s t BIJ_ID = |- !s. BIJ(\x. x)s s BIJ_EMPTY = |- !f. (!s. BIJ f{}s = (s = {})) /\ (!s. BIJ f s{} = (s = {})) BIJ_COMPOSE = |- !f g s t u. BIJ f s t /\ BIJ g t u ==> BIJ(g o f)s u lemma1 = |- !f s. (!x y. x IN s /\ y IN s ==> (f x = f y) ==> (x = y)) = (!y. y IN s ==> (!x. x IN s /\ (f x = f y) = y IN s /\ (x = y))) lemma2 = |- !f s. ?g. !t. INJ f s t ==> (!x. x IN s ==> (g(f x) = x)) LINV_DEF = |- !f s t. INJ f s t ==> (!x. x IN s ==> (LINV f s(f x) = x)) lemma3 = |- !f s. ?g. !t. SURJ f s t ==> (!x. x IN t ==> (f(g x) = x)) RINV_DEF = |- !f s t. SURJ f s t ==> (!x. x IN t ==> (f(RINV f s x) = x)) FINITE_DEF = |- !s. FINITE s = (!P. P{} /\ (!s'. P s' ==> (!e. P(e INSERT s'))) ==> P s) FINITE_EMPTY = |- FINITE{} FINITE_INSERT = |- !s. FINITE s ==> (!x. FINITE(x INSERT s)) SIMPLE_FINITE_INDUCT = |- !P. P{} /\ (!s. P s ==> (!e. P(e INSERT s))) ==> (!s. FINITE s ==> P s) lemma = |- P{} /\ (!s. FINITE s /\ P s ==> (!e. FINITE(e INSERT s) /\ P(e INSERT s))) ==> (!s. FINITE s ==> P s) FINITE_INDUCT = |- !P. P{} /\ (!s. FINITE s /\ P s ==> (!e. ~e IN s ==> P(e INSERT s))) ==> (!s. FINITE s ==> P s) SET_INDUCT_TAC = - : tactic File set_ind loaded () : void FINITE_DELETE = |- !s. FINITE s ==> (!x. FINITE(s DELETE x)) INSERT_FINITE = |- !x s. FINITE(x INSERT s) ==> FINITE s FINITE_INSERT = |- !x s. FINITE(x INSERT s) = FINITE s DELETE_FINITE = |- !x s. FINITE(s DELETE x) ==> FINITE s FINITE_DELETE = |- !x s. FINITE(s DELETE x) = FINITE s UNION_FINITE = |- !s. FINITE s ==> (!t. FINITE t ==> FINITE(s UNION t)) FINITE_UNION_LEMMA = |- !s. FINITE s ==> (!t. FINITE(s UNION t) ==> FINITE t) FINITE_UNION = |- !s t. FINITE(s UNION t) ==> FINITE s /\ FINITE t FINITE_UNION = |- !s t. FINITE(s UNION t) = FINITE s /\ FINITE t INTER_FINITE = |- !s. FINITE s ==> (!t. FINITE(s INTER t)) SUBSET_FINITE = |- !s. FINITE s ==> (!t. t SUBSET s ==> FINITE t) PSUBSET_FINITE = |- !s. FINITE s ==> (!t. t PSUBSET s ==> FINITE t) FINITE_DIFF = |- !s. FINITE s ==> (!t. FINITE(s DIFF t)) FINITE_SING = |- !x. FINITE{x} SING_FINITE = |- !s. SING s ==> FINITE s IMAGE_FINITE = |- !s. FINITE s ==> (!f. FINITE(IMAGE f s)) card_rel_def = "(!s. R s 0 = (s = {})) /\ (!s n. R s(SUC n) = (?x. x IN s /\ R(s DELETE x)n))" : term Theorem num_Axiom autoloading from theory `prim_rec` ... num_Axiom = |- !e f. ?! fn. (fn 0 = e) /\ (!n. fn(SUC n) = f(fn n)n) CARD_REL_EXISTS = |- ?R. (!s. R s 0 = (s = {})) /\ (!s n. R s(SUC n) = (?x. x IN s /\ R(s DELETE x)n)) CARD_REL_DEL_LEMMA = .. |- !n s x. x IN s ==> R(s DELETE x)n ==> (!y. y IN s ==> R(s DELETE y)n) Theorem INV_SUC_EQ autoloading from theory `prim_rec` ... INV_SUC_EQ = |- !m n. (SUC m = SUC n) = (m = n) Theorem NOT_SUC autoloading from theory `num` ... NOT_SUC = |- !n. ~(SUC n = 0) CARD_REL_UNIQUE = .. |- !n s. R s n ==> (!m. R s m ==> (n = m)) CARD_REL_EXISTS_LEMMA = .. |- !s. FINITE s ==> (?n. R s n) CARD_REL_THM = .. |- !m s. FINITE s ==> (((@n. R s n) = m) = R s m) CARD_EXISTS = |- ?CARD. (CARD{} = 0) /\ (!s. FINITE s ==> (!x. CARD(x INSERT s) = (x IN s => CARD s | SUC(CARD s)))) CARD_DEF = |- (CARD{} = 0) /\ (!s. FINITE s ==> (!x. CARD(x INSERT s) = (x IN s => CARD s | SUC(CARD s)))) CARD_EMPTY = |- CARD{} = 0 CARD_INSERT = |- !s. FINITE s ==> (!x. CARD(x INSERT s) = (x IN s => CARD s | SUC(CARD s))) CARD_EQ_0 = |- !s. FINITE s ==> ((CARD s = 0) = (s = {})) Theorem num_CASES autoloading from theory `arithmetic` ... num_CASES = |- !m. (m = 0) \/ (?n. m = SUC n) Theorem SUC_SUB1 autoloading from theory `arithmetic` ... SUC_SUB1 = |- !m. (SUC m) - 1 = m CARD_DELETE = |- !s. FINITE s ==> (!x. CARD(s DELETE x) = (x IN s => (CARD s) - 1 | CARD s)) Theorem LESS_MONO_EQ autoloading from theory `arithmetic` ... LESS_MONO_EQ = |- !m n. (SUC m) < (SUC n) = m < n Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) lemma1 = |- !n m. (SUC n) <= (SUC m) = n <= m Theorem LESS_THM autoloading from theory `prim_rec` ... LESS_THM = |- !m n. m < (SUC n) = (m = n) \/ m < n lemma2 = |- !n m. n <= (SUC m) = n <= m \/ (n = SUC m) Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m <= m CARD_INTER_LESS_EQ = |- !s. FINITE s ==> (!t. (CARD(s INTER t)) <= (CARD s)) Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) CARD_UNION = |- !s. FINITE s ==> (!t. FINITE t ==> ((CARD(s UNION t)) + (CARD(s INTER t)) = (CARD s) + (CARD t))) lemma = |- !n m. n <= (SUC m) = n <= m \/ (n = SUC m) Theorem LESS_0 autoloading from theory `prim_rec` ... LESS_0 = |- !n. 0 < (SUC n) CARD_SUBSET = |- !s. FINITE s ==> (!t. t SUBSET s ==> (CARD t) <= (CARD s)) Theorem LESS_EQ autoloading from theory `arithmetic` ... LESS_EQ = |- !m n. m < n = (SUC m) <= n CARD_PSUBSET = |- !s. FINITE s ==> (!t. t PSUBSET s ==> (CARD t) < (CARD s)) CARD_SING = |- !x. CARD{x} = 1 SING_IFF_CARD1 = |- !s. SING s = (CARD s = 1) /\ FINITE s Theorem SUB_PLUS autoloading from theory `arithmetic` ... SUB_PLUS = |- !a b c. a - (b + c) = (a - b) - c Theorem SUB_0 autoloading from theory `arithmetic` ... SUB_0 = |- !m. (0 - m = 0) /\ (m - 0 = m) CARD_DIFF = |- !t. FINITE t ==> (!s. FINITE s ==> (CARD(s DIFF t) = (CARD s) - (CARD(s INTER t)))) Theorem SUB_LESS_0 autoloading from theory `arithmetic` ... SUB_LESS_0 = |- !n m. m < n = 0 < (n - m) LESS_CARD_DIFF = |- !t. FINITE t ==> (!s. FINITE s ==> (CARD t) < (CARD s) ==> 0 < (CARD(s DIFF t))) INFINITE_DEF = |- !s. INFINITE s = ~FINITE s NOT_IN_FINITE = |- INFINITE UNIV = (!s. FINITE s ==> (?x. ~x IN s)) INVERSE_LEMMA = |- !f. (!x y. (f x = f y) ==> (x = y)) ==> ((\x. @y. x = f y) o f = (\x. x)) IMAGE_11_INFINITE = |- !f. (!x y. (f x = f y) ==> (x = y)) ==> (!s. INFINITE s ==> INFINITE(IMAGE f s)) INFINITE_SUBSET = |- !s. INFINITE s ==> (!t. s SUBSET t ==> INFINITE t) IN_INFINITE_NOT_FINITE = |- !s t. INFINITE s /\ FINITE t ==> (?x. x IN s /\ ~x IN t) gdef = ["g 0 = {}"; "!n. g(SUC n) = (@x. ~x IN (g n)) INSERT (g n)"] : term list g_finite = .. |- !n. FINITE(g n) g_subset = . |- !n x. x IN (g n) ==> (!i. x IN (g(n + i))) lemma = |- (A \/ B) /\ ~B = A /\ ~B Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n < (SUC n) g_cases = .. |- (!s. FINITE s ==> (?x. ~x IN s)) ==> (!x. (?n. x IN (g n)) ==> (?m. x IN (g(SUC m)) /\ ~x IN (g m))) z_in_g1 = .. |- (@x. ~x IN {}) IN (g(SUC 0)) Theorem ADD_SYM autoloading from theory `arithmetic` ... ADD_SYM = |- !m n. m + n = n + m Theorem ADD1 autoloading from theory `arithmetic` ... ADD1 = |- !m. SUC m = m + 1 z_in_gn = .. |- !n. (@x. ~x IN {}) IN (g(SUC n)) in_lemma = . |- !n. (@x. ~x IN (g n)) IN (g(SUC n)) not_in_lemma = .. |- (!s. FINITE s ==> (?x. ~x IN s)) ==> (!i n. ~(@x. ~x IN (g(n + i))) IN (g n)) Theorem LESS_NOT_EQ autoloading from theory `prim_rec` ... LESS_NOT_EQ = |- !m n. m < n ==> ~(m = n) Theorem LESS_REFL autoloading from theory `prim_rec` ... LESS_REFL = |- !n. ~n < n less_lemma = |- !m n. ~(m = n) = m < n \/ n < m Theorem LESS_ADD_1 autoloading from theory `arithmetic` ... LESS_ADD_1 = |- !m n. n < m ==> (?p. m = n + (p + 1)) gn_unique = .. |- (!s. FINITE s ==> (?x. ~x IN s)) ==> (!n m. ((@x. ~x IN (g n)) = (@x. ~x IN (g m))) = (n = m)) x_unique = .. |- !n x y. ~x IN (g n) /\ ~y IN (g n) ==> x IN (g(SUC n)) ==> y IN (g(SUC n)) ==> (x = y) fdef = "\x. ((?n. x IN (g n)) => (@y. ~y IN (g(SUC(@n. x IN (g(SUC n)) /\ ~x IN (g n))))) | x)" : term cases = |- !x. (?n. x IN (g n)) \/ (!n. ~x IN (g n)) INF_IMP_INFINITY = |- (!s. FINITE s ==> (?x. ~x IN s)) ==> (?f. (!x y. (f x = f y) ==> (x = y)) /\ (?y. !x. ~(f x = y))) prth = |- ?fn. (!f x. fn f x 0 = x) /\ (!f x n. fn f x(SUC n) = f(fn f x n)) prmth = |- !x f. ?fn. (fn 0 = x) /\ (!n. fn(SUC n) = f(fn n)) num_fn_thm = |- (?f. (!x y. (f x = f y) ==> (x = y)) /\ (?y. !x. ~(f x = y))) ==> (?fn. !n m. (fn n = fn m) ==> (n = m)) Theorem LESS_IMP_LESS_ADD autoloading from theory `arithmetic` ... LESS_IMP_LESS_ADD = |- !n m. n < m ==> (!p. n < (m + p)) Theorem LESS_ADD_SUC autoloading from theory `arithmetic` ... LESS_ADD_SUC = |- !m n. m < (m + (SUC n)) finite_N_bounded = |- !s. FINITE s ==> (?m. !n. n IN s ==> n < m) N_lemma = |- INFINITE UNIV main_lemma = |- !s. FINITE s ==> (!f. (!n m. (f n = f m) ==> (n = m)) ==> (?n. ~(f n) IN s)) INFINITY_IMP_INF = |- (?f. (!x y. (f x = f y) ==> (x = y)) /\ (?y. !x. ~(f x = y))) ==> (!s. FINITE s ==> (?x. ~x IN s)) INFINITE_UNIV = |- INFINITE UNIV = (?f. (!x y. (f x = f y) ==> (x = y)) /\ (?y. !x. ~(f x = y))) FINITE_PSUBSET_INFINITE = |- !s. INFINITE s = (!t. FINITE t ==> t SUBSET s ==> t PSUBSET s) FINITE_PSUBSET_UNIV = |- INFINITE UNIV = (!s. FINITE s ==> s PSUBSET UNIV) INFINITE_DIFF_FINITE = |- !s t. INFINITE s /\ FINITE t ==> ~(s DIFF t = {}) Theorem NOT_LESS_0 autoloading from theory `prim_rec` ... NOT_LESS_0 = |- !n. ~n < 0 FINITE_ISO_NUM = |- !s. FINITE s ==> (?f. (!n m. n < (CARD s) /\ m < (CARD s) ==> (f n = f m) ==> (n = m)) /\ (s = {f n | n < (CARD s)})) echo 'set_flag(`abort_when_fail`,true);;'\ 'load_theory `sets`;;'\ 'compilet `set_ind`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory sets loaded () : void SET_INDUCT_TAC = - : tactic Calling Lisp compiler File set_ind compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'load_theory `sets`;;'\ 'compilet `gspec`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory sets loaded () : void dest_tuple = - : (term -> term list) MK_PAIR = - : (* list -> conv) EXISTS_TUPLE_CONV = - : (term list -> conv) PAIR_EQ_CONV = - : conv ELIM_EXISTS_CONV = - : conv PROVE_EXISTS = - : conv list_variant = - : (term list -> term list -> term list) SET_SPEC_CONV = - : conv - : conv SET_SPEC_CONV = - : conv Calling Lisp compiler File gspec compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'load_theory `sets`;;'\ 'compilet `fset_conv`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory sets loaded () : void FINITE_CONV = - : conv IN_CONV = - : (conv -> conv) DELETE_CONV = - : (conv -> conv) UNION_CONV = - : (conv -> conv) INSERT_CONV = - : (conv -> conv) IMAGE_CONV = - : (conv -> conv -> conv) Calling Lisp compiler File fset_conv compiled () : void #===> library sets rebuilt make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce' \ echo 'set_flag(`abort_when_fail`,true);;' \ 'compilet `arithconv`;;' \ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool dest_op = - : (term -> term -> term list) term_of_int = - : (int -> term) int_of_term = - : (term -> int) provelt = - : (int -> int -> thm) NEQ_CONV = - : conv LT_CONV = - : conv GT_CONV = - : conv LE_CONV = - : conv GE_CONV = - : conv SUC_CONV = - : conv PRE_CONV = - : conv SBC_CONV = - : conv ADD_CONV = - : conv MUL_CONV = - : conv EXP_CONV = - : conv DIV_CONV = - : conv MOD_CONV = - : conv Calling Lisp compiler File arithconv compiled () : void #\ echo 'set_flag(`abort_when_fail`,true);;' \ 'compilet `boolconv`;;' \ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool dest_op = - : (term -> term -> term list) NOT_CONV = - : conv AND_CONV = - : conv OR_CONV = - : conv IMP_CONV = - : conv BEQ_CONV = - : conv COND_CONV = - : conv Calling Lisp compiler File boolconv compiled () : void #\ echo 'set_flag(`abort_when_fail`,true);;' \ 'compilet `reduce`;;' \ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Extending help search path() : void Loading boolean conversions() : void Loading arithmetic conversions() : void Loading general conversions, rule and tactic() : void RED_CONV = - : conv REDUCE_CONV = - : conv REDUCE_RULE = - : (thm -> thm) REDUCE_TAC = - : tactic Calling Lisp compiler File reduce compiled () : void #make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith' echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `int_extra`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool abs = - : (int -> int) () : void mod = - : (int -> int -> int) gcd = - : ((int # int) -> int) lcm = - : ((int # int) -> int) Calling Lisp compiler File int_extra compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `int_extra`;;'\ 'compilet `arith_cons`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool .....() : void mk_arith_op = - : (string -> string -> (term # term) -> term) mk_plus = - : ((term # term) -> term) mk_minus = - : ((term # term) -> term) mk_mult = - : ((term # term) -> term) dest_arith_op = - : (string -> string -> term -> (term # term)) dest_plus = - : (term -> (term # term)) dest_minus = - : (term -> (term # term)) dest_mult = - : (term -> (term # term)) is_plus = - : (term -> bool) is_minus = - : (term -> bool) is_mult = - : (term -> bool) is_arith_op = - : (term -> bool) mk_num_reln = - : (string -> string -> (term # term) -> term) mk_less = - : ((term # term) -> term) mk_leq = - : ((term # term) -> term) mk_great = - : ((term # term) -> term) mk_geq = - : ((term # term) -> term) dest_num_reln = - : (string -> string -> term -> (term # term)) dest_less = - : (term -> (term # term)) dest_leq = - : (term -> (term # term)) dest_great = - : (term -> (term # term)) dest_geq = - : (term -> (term # term)) is_less = - : (term -> bool) is_leq = - : (term -> bool) is_great = - : (term -> bool) is_geq = - : (term -> bool) is_num_reln = - : (term -> bool) mk_suc = - : (term -> term) dest_suc = - : (term -> term) is_suc = - : (term -> bool) is_num_const = - : (term -> bool) is_zero = - : (term -> bool) int_of_term = - : (term -> int) term_of_int = - : (int -> term) mk_num_var = - : (string -> term) arg1 = - : (term -> term) arg2 = - : (term -> term) Calling Lisp compiler File arith_cons compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `string_extra`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool string_less = - : (string -> string -> bool) Calling Lisp compiler File string_extra compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `int_extra`;;'\ 'loadf `arith_cons`;;'\ 'loadf `string_extra`;;'\ 'compilet `term_coeffs`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool .....() : void .....................() : void .() : void negate_coeffs = - : ((int # (* # int) list) -> (int # (* # int) list)) merge_coeffs = - : ((int # (string # int) list) -> (int # (string # int) list) -> (int # (string # int) list)) lhs_coeffs = - : ((int # (* # int) list) -> (int # (* # int) list)) rhs_coeffs = - : ((int # (* # int) list) -> (int # (* # int) list)) diff_of_coeffs = - : (((int # (string # int) list) # int # (string # int) list) -> ((int # (string # int) list) # int # (string # int) list)) vars_of_coeffs = - : ((* # (** # ***) list) list -> ** list) var_of_prod = - : (term -> string) coeffs_of_arith = - : (term -> (int # (string # int) list)) coeffs_of_leq = - : (term -> (int # (string # int) list)) coeffs_of_leq_set = - : (term -> (int # (string # int) list) list) build_arith = - : ((int # (string # int) list) -> term) build_leq = - : ((int # (string # int) list) -> term) Calling Lisp compiler File term_coeffs compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `qconv`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool qconv = `QCONV` : string qfailwith = - : (string -> string -> *) QCONV = - : (conv -> conv) ALL_QCONV = - : conv () : void THENQC = - : (conv -> conv -> conv) () : void ORELSEQC = - : (conv -> conv -> conv) REPEATQC = - : (conv -> conv) CHANGED_QCONV = - : (conv -> conv) TRY_QCONV = - : (conv -> conv) QCONV_RULE = - : (conv -> thm -> thm) RAND_QCONV = - : (conv -> conv) RATOR_QCONV = - : (conv -> conv) ABS_QCONV = - : (conv -> conv) ARGS_QCONV = - : (conv -> conv) Calling Lisp compiler File qconv compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `decls`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ONE_PLUS = |- T ZERO_PLUS = |- T PLUS_ZERO = |- T SUC_ADD1 = |- T SUC_ADD2 = |- T ZERO_MULT = |- T ONE_MULT = |- T MULT_ZERO = |- T MULT_ONE = |- T MULT_SUC = |- T MULT_COMM = |- T SUC_ADD_LESS_EQ_F = |- T MULT_LEQ_SUC = |- T ZERO_LESS_EQ_T = |- T SUC_LESS_EQ_ZERO_F = |- T ZERO_LESS_EQ_ONE_TIMES = |- T LESS_EQ_PLUS = |- T LESS_EQ_TRANSIT = |- T NOT_T_F = |- T NOT_F_T = |- T CONJ_ASSOC_NORM_CONV = - : conv DISJ_ASSOC_NORM_CONV = - : conv EQ_EXPAND_CONV = - : conv IMP_EXPAND_CONV = - : conv IMP_F_EQ_F_CONV = - : conv IMP_IMP_CONJ_IMP_CONV = - : conv LEFT_DIST_NORM_CONV = - : conv NOT_CONJ_NORM_CONV = - : conv NOT_DISJ_NORM_CONV = - : conv NOT_NOT_NORM_CONV = - : conv OR_F_CONV = - : conv RIGHT_DIST_NORM_CONV = - : conv ADD_ASSOC_CONV = - : conv ADD_SYM_CONV = - : conv GATHER_BOTH_CONV = - : conv GATHER_LEFT_CONV = - : conv GATHER_NEITHER_CONV = - : conv GATHER_RIGHT_CONV = - : conv GEQ_NORM_CONV = - : conv GREAT_NORM_CONV = - : conv LEFT_ADD_DISTRIB_CONV = - : conv LESS_NORM_CONV = - : conv MULT_ASSOC_CONV = - : conv MULT_COMM_CONV = - : conv NOT_GEQ_NORM_CONV = - : conv NOT_GREAT_NORM_CONV = - : conv NOT_LEQ_NORM_CONV = - : conv NOT_LESS_NORM_CONV = - : conv NOT_NUM_EQ_NORM_CONV = - : conv NUM_EQ_NORM_CONV = - : conv PLUS_ZERO_CONV = - : conv SYM_ADD_ASSOC_CONV = - : conv SYM_ONE_MULT_CONV = - : conv ZERO_MULT_CONV = - : conv ZERO_MULT_PLUS_CONV = - : conv ZERO_PLUS_CONV = - : conv LEQ_PLUS_CONV = - : conv FORALL_SIMP_CONV = - : conv NUM_COND_RATOR_CONV = - : conv NUM_COND_RAND_CONV = - : conv SUB_NORM_CONV = - : conv COND_RATOR_CONV = - : conv COND_RAND_CONV = - : conv COND_EXPAND_CONV = - : conv Calling Lisp compiler File decls compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `int_extra`;;'\ 'loadf `arith_cons`;;'\ 'loadf `string_extra`;;'\ 'loadf `term_coeffs`;;'\ 'loadf `qconv`;;'\ 'loadf `decls`;;'\ 'compilet `norm_bool`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool .....() : void .....................() : void .() : void ............() : void ................() : void ................................................................() : void EQ_IMP_ELIM_QCONV = - : ((term -> bool) -> conv) MOVE_NOT_DOWN_QCONV = - : ((term -> bool) -> conv -> conv) DISJ_LINEAR_QCONV = - : conv DISJ_NORM_FORM_QCONV = - : conv Calling Lisp compiler File norm_bool compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `int_extra`;;'\ 'loadf `arith_cons`;;'\ 'loadf `string_extra`;;'\ 'loadf `term_coeffs`;;'\ 'loadf `qconv`;;'\ 'loadf `decls`;;'\ 'loadf `norm_bool`;;'\ 'compilet `norm_arith`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool .....() : void .....................() : void .() : void ............() : void ................() : void ................................................................() : void ....() : void COLLECT_NUM_CONSTS_CONV = - : conv NUM_RELN_NORM_QCONV = - : (conv -> conv -> conv) MULT_CONV = - : conv mult_lookup = - : (((int # int) # thm) list -> (int # int) -> thm) multiplication_theorems = [] : ((int # int) # thm) list FAST_MULT_CONV = - : conv reset_multiplication_theorems = - : (void -> ((int # int) # thm) list) multiplication_theorems = - : (void -> ((int # int) # thm) list) SUM_OF_PRODUCTS_SUC_CONV = - : conv SUM_OF_PRODUCTS_MULT_QCONV = - : conv SUM_OF_PRODUCTS_QCONV = - : conv LINEAR_SUM_QCONV = - : conv GATHER_QCONV = - : conv IN_LINE_SUM_QCONV = - : (conv -> conv) ONE_PASS_SORT_QCONV = - : conv SORT_AND_GATHER_QCONV = - : conv SYM_ONE_MULT_VAR_CONV = - : conv NORM_ZERO_AND_ONE_QCONV = - : conv Calling Lisp compiler File norm_arith compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `int_extra`;;'\ 'loadf `arith_cons`;;'\ 'loadf `string_extra`;;'\ 'loadf `term_coeffs`;;'\ 'loadf `qconv`;;'\ 'loadf `decls`;;'\ 'loadf `norm_bool`;;'\ 'loadf `norm_arith`;;'\ 'compilet `norm_ineqs`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool .....() : void .....................() : void .() : void ............() : void ................() : void ................................................................() : void ....() : void ..................() : void ADD_TERM_TO_LEQ_CONV = - : (term -> conv) ADD_COEFFS_TO_LEQ_QCONV = - : ((int # (string # int) list) -> conv) LESS_OR_EQ_GATHER_QCONV = - : conv ARITH_FORM_NORM_QCONV = - : conv Calling Lisp compiler File norm_ineqs compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `int_extra`;;'\ 'loadf `arith_cons`;;'\ 'loadf `string_extra`;;'\ 'loadf `term_coeffs`;;'\ 'loadf `qconv`;;'\ 'loadf `decls`;;'\ 'loadf `norm_bool`;;'\ 'loadf `norm_arith`;;'\ 'loadf `norm_ineqs`;;'\ 'compilet `solve_ineqs`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool .....() : void .....................() : void .() : void ............() : void ................() : void ................................................................() : void ....() : void ..................() : void ....() : void CONST_TIMES_ARITH_QCONV = - : conv MULT_LEQ_BY_CONST_QCONV = - : (term -> conv) LEQ_CONV = - : conv WEIGHTED_SUM = - : (string -> ((int # (string # int) list) # int # (string # int) list) -> ((int # (string # int) list) # (void -> thm))) var_to_elim = - : ((* # (string # int) list) list -> string) VAR_ELIM = - : ((int # (string # int) list) list -> (int list # (void -> thm))) Calling Lisp compiler File solve_ineqs compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `int_extra`;;'\ 'loadf `arith_cons`;;'\ 'loadf `string_extra`;;'\ 'loadf `term_coeffs`;;'\ 'loadf `qconv`;;'\ 'loadf `decls`;;'\ 'loadf `norm_bool`;;'\ 'loadf `norm_arith`;;'\ 'loadf `norm_ineqs`;;'\ 'loadf `solve_ineqs`;;'\ 'compilet `solve`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool .....() : void .....................() : void .() : void ............() : void ................() : void ................................................................() : void ....() : void ..................() : void ....() : void ......() : void INEQS_FALSE_CONV = - : conv DISJ_INEQS_FALSE_QCONV = - : conv NOT_NOT_INTRO_CONV = - : conv is_T = - : (term -> bool) is_F = - : (term -> bool) NEGATE_CONV = - : (conv -> conv) DEPTH_FORALL_QCONV = - : (conv -> conv) FORALL_ARITH_CONV = - : conv Calling Lisp compiler File solve compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `int_extra`;;'\ 'compilet `rationals`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool .....() : void Rat = - : ((int # int) -> rat) Numerator = - : (rat -> int) Denominator = - : (rat -> int) rat_inv = - : (rat -> rat) rat_plus = - : (rat -> rat -> rat) rat_minus = - : (rat -> rat -> rat) rat_mult = - : (rat -> rat -> rat) rat_div = - : (rat -> rat -> rat) print_rat = - : (rat -> void) - : (rat -> void) rat_of_int = - : (int -> rat) lower_int_of_rat = - : (rat -> int) upper_int_of_rat = - : (rat -> int) rat_zero = 0 : rat rat_one = 1 : rat rat_less = - : (rat -> rat -> bool) Calling Lisp compiler File rationals compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `int_extra`;;'\ 'loadf `rationals`;;'\ 'loadf `string_extra`;;'\ 'compilet `sup-inf`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool .....() : void ........() : void .() : void New constructors declared: Bound : ((rat # (string # rat) list) -> bound) Max_bound : (bound list -> bound) Min_bound : (bound list -> bound) Pos_inf : bound Neg_inf : bound New constructors declared: Ibound : (bound -> internal_bound) Mult_ibound : ((rat # internal_bound) -> internal_bound) Plus_ibound : ((internal_bound # internal_bound) -> internal_bound) Max_ibound : (internal_bound list -> internal_bound) Min_ibound : (internal_bound list -> internal_bound) solve_ineqs = - : ((int # (* # int) list) list -> * -> ((rat # (* # rat) list) list # (rat # (* # rat) list) list)) UPPER = - : ((int # (string # int) list) list -> string -> bound) LOWER = - : ((int # (string # int) list) list -> string -> bound) SIMP_mult = - : (rat -> bound -> bound) sum_bindings = - : ((string # rat) list -> (string # rat) list -> (string # rat) list) SIMP_plus = - : (bound -> bound -> bound) SIMP = - : (internal_bound -> bound) SUPP = - : ((string # bound) -> bound) INFF = - : ((string # bound) -> bound) occurs_in_bound = - : (string -> bound -> bool) occurs_in_ibound = - : (string -> internal_bound -> bool) SUP = - : ((int # (string # int) list) list -> (bound # string list) -> internal_bound) INF = - : ((int # (string # int) list) list -> (bound # string list) -> internal_bound) eval_max_bound = - : (bound list -> bound) eval_min_bound = - : (bound list -> bound) eval_bound = - : (bound -> bound) SUP_INF = - : ((int # (string # int) list) list -> (string # bound # bound) list) Calling Lisp compiler File sup-inf compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `streams`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool New constructors declared: Stream : ((* # (void -> * stream)) -> * stream) stream_map = - : ((* -> **) -> (void -> * stream) -> void -> ** stream) stream_append = - : ((void -> * stream) -> (void -> * stream) -> void -> * stream) stream_flat = - : ((void -> (void -> * stream) stream) -> void -> * stream) permutations = - : (* list -> void -> * list stream) Calling Lisp compiler File streams compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `int_extra`;;'\ 'loadf `rationals`;;'\ 'loadf `string_extra`;;'\ 'loadf `sup-inf`;;'\ 'loadf `streams`;;'\ 'compilet `sol_ranges`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool .....() : void ........() : void .() : void ..................() : void .....() : void less_bound = - : (bound -> bound -> bool) is_neg_bound = - : (bound -> bool) is_finite_bound = - : (bound -> bool) rat_of_bound = - : (bound -> rat) is_int_range = - : (rat -> rat -> bool) non_neg_int_between = - : (bound -> bound -> int) inst_var_in_coeffs = - : ((string # int) -> (int # (string # int) list) list -> (int # (string # int) list) list) Shostak = - : ((int # (string # int) list) list -> (string # int) list) Calling Lisp compiler File sol_ranges compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'load_library `reduce`;;'\ 'loadf `int_extra`;;'\ 'loadf `arith_cons`;;'\ 'loadf `string_extra`;;'\ 'loadf `term_coeffs`;;'\ 'loadf `qconv`;;'\ 'loadf `decls`;;'\ 'loadf `norm_bool`;;'\ 'loadf `norm_arith`;;'\ 'loadf `norm_ineqs`;;'\ 'loadf `rationals`;;'\ 'loadf `sup-inf`;;'\ 'loadf `streams`;;'\ 'loadf `sol_ranges`;;'\ 'compilet `exists_arith`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Loading library reduce ... Extending help search path. Loading boolean conversions........ Loading arithmetic conversions.................. Loading general conversions, rule and tactic..... Library reduce loaded. () : void .....() : void .....................() : void .() : void ............() : void ................() : void ................................................................() : void ....() : void ..................() : void ....() : void ........() : void ..................() : void .....() : void ........() : void NUM_REDUCE_QCONV = - : conv INEQ_REDUCE_QCONV = - : conv BOOL_REDUCE_QCONV = - : conv WITNESS = - : ((string # int) list -> conv) witness = - : (term list -> (string # int) list) EXISTS_ARITH_CONV = - : conv Calling Lisp compiler File exists_arith compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `decls`;;'\ 'compilet `sub_and_cond`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ................................................................() : void COND_ABS_CONV = - : conv SUB_AND_COND_ELIM_CONV = - : conv COND_ELIM_CONV = - : conv Calling Lisp compiler File sub_and_cond compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `decls`;;'\ 'compilet `prenex`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ................................................................() : void QUANT_EQ_IMP_CONV = - : conv is_prenex = - : (term -> bool) PRENEX_CONV = - : conv Calling Lisp compiler File prenex compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `instance`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool INSTANCE_T_CONV = - : ((term -> term list) -> conv -> conv) Calling Lisp compiler File instance compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'load_library `reduce`;;'\ 'loadf `int_extra`;;'\ 'loadf `arith_cons`;;'\ 'loadf `string_extra`;;'\ 'loadf `term_coeffs`;;'\ 'loadf `qconv`;;'\ 'loadf `decls`;;'\ 'loadf `norm_bool`;;'\ 'loadf `norm_arith`;;'\ 'loadf `norm_ineqs`;;'\ 'loadf `solve_ineqs`;;'\ 'loadf `solve`;;'\ 'loadf `rationals`;;'\ 'loadf `sup-inf`;;'\ 'loadf `streams`;;'\ 'loadf `sol_ranges`;;'\ 'loadf `exists_arith`;;'\ 'loadf `sub_and_cond`;;'\ 'loadf `prenex`;;'\ 'loadf `instance`;;'\ 'compilet `gen_arith`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Loading library reduce ... Extending help search path. Loading boolean conversions........ Loading arithmetic conversions.................. Loading general conversions, rule and tactic..... Library reduce loaded. () : void .....() : void .....................() : void .() : void ............() : void ................() : void ................................................................() : void ....() : void ..................() : void ....() : void ......() : void .......() : void ........() : void ..................() : void .....() : void ........() : void ......() : void ...() : void ...() : void .() : void contains_var = - : (term -> bool) is_linear_mult = - : (term -> bool) non_presburger_subterms = - : (term -> term list) is_presburger = - : (term -> bool) ARITH_CONV = - : conv Calling Lisp compiler File gen_arith compiled () : void #===> library arith rebuilt make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets' rm -f pred_sets.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `mk_pred_sets`;;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void SPECIFICATION = |- !P x. x IN P = P x EXTENSION = |- !s t. (s = t) = (!x. x IN s = x IN t) NOT_EQUAL_SETS = |- !s t. ~(s = t) = (?x. x IN t = ~x IN s) Theorem NOT_LESS autoloading from theory `arithmetic` ... NOT_LESS = |- !m n. ~m < n = n <= m Theorem WOP autoloading from theory `arithmetic` ... WOP = |- !P. (?n. P n) ==> (?n. P n /\ (!m. m < n ==> ~P m)) NUM_SET_WOP = |- !s. (?n. n IN s) = (?n. n IN s /\ (!m. m IN s ==> n <= m)) GSPEC_DEF_LEMMA = |- ?g. !f v. v IN (g f) = (?x. v,T = f x) GSPECIFICATION = |- !f v. v IN (GSPEC f) = (?x. v,T = f x) Section SET_SPEC_CONV begun dest_tuple = - : (term -> term list) MK_PAIR = - : (* list -> conv) EXISTS_TUPLE_CONV = - : (term list -> conv) PAIR_EQ_CONV = - : conv ELIM_EXISTS_CONV = - : conv PROVE_EXISTS = - : conv list_variant = - : (term list -> term list -> term list) SET_SPEC_CONV = - : conv - : conv Section SET_SPEC_CONV ended SET_SPEC_CONV = - : conv File gspec.ml loaded () : void () : void true : bool lemma = |- !s x. x IN s ==> (!f. (f x) IN {f x | x IN s}) SET_MINIMUM = |- !s M. (?x. x IN s) = (?x. x IN s /\ (!y. y IN s ==> (M x) <= (M y))) EMPTY_DEF = |- EMPTY = (\x. F) NOT_IN_EMPTY = |- !x. ~x IN EMPTY MEMBER_NOT_EMPTY = |- !s. (?x. x IN s) = ~(s = EMPTY) UNIV_DEF = |- UNIV = (\x. T) IN_UNIV = |- !x. x IN UNIV UNIV_NOT_EMPTY = |- ~(UNIV = EMPTY) EMPTY_NOT_UNIV = |- ~(EMPTY = UNIV) EQ_UNIV = |- (!x. x IN s) = (s = UNIV) SUBSET_DEF = |- !s t. s SUBSET t = (!x. x IN s ==> x IN t) SUBSET_TRANS = |- !s t u. s SUBSET t /\ t SUBSET u ==> s SUBSET u SUBSET_REFL = |- !s. s SUBSET s SUBSET_ANTISYM = |- !s t. s SUBSET t /\ t SUBSET s ==> (s = t) EMPTY_SUBSET = |- !s. EMPTY SUBSET s SUBSET_EMPTY = |- !s. s SUBSET EMPTY = (s = EMPTY) SUBSET_UNIV = |- !s. s SUBSET UNIV UNIV_SUBSET = |- !s. UNIV SUBSET s = (s = UNIV) PSUBSET_DEF = |- !s t. s PSUBSET t = s SUBSET t /\ ~(s = t) PSUBSET_TRANS = |- !s t u. s PSUBSET t /\ t PSUBSET u ==> s PSUBSET u PSUBSET_IRREFL = |- !s. ~s PSUBSET s NOT_PSUBSET_EMPTY = |- !s. ~s PSUBSET EMPTY NOT_UNIV_PSUBSET = |- !s. ~UNIV PSUBSET s PSUBSET_UNIV = |- !s. s PSUBSET UNIV = (?x. ~x IN s) UNION_DEF = |- !s t. s UNION t = {x | x IN s \/ x IN t} IN_UNION = |- !s t x. x IN (s UNION t) = x IN s \/ x IN t UNION_ASSOC = |- !s t u. (s UNION t) UNION u = s UNION (t UNION u) UNION_IDEMPOT = |- !s. s UNION s = s UNION_COMM = |- !s t. s UNION t = t UNION s SUBSET_UNION = |- (!s t. s SUBSET (s UNION t)) /\ (!s t. s SUBSET (t UNION s)) SUBSET_UNION_ABSORPTION = |- !s t. s SUBSET t = (s UNION t = t) UNION_EMPTY = |- (!s. EMPTY UNION s = s) /\ (!s. s UNION EMPTY = s) UNION_UNIV = |- (!s. UNIV UNION s = UNIV) /\ (!s. s UNION UNIV = UNIV) EMPTY_UNION = |- !s t. (s UNION t = EMPTY) = (s = EMPTY) /\ (t = EMPTY) INTER_DEF = |- !s t. s INTER t = {x | x IN s /\ x IN t} IN_INTER = |- !s t x. x IN (s INTER t) = x IN s /\ x IN t INTER_ASSOC = |- !s t u. (s INTER t) INTER u = s INTER (t INTER u) INTER_IDEMPOT = |- !s. s INTER s = s INTER_COMM = |- !s t. s INTER t = t INTER s INTER_SUBSET = |- (!s t. (s INTER t) SUBSET s) /\ (!s t. (t INTER s) SUBSET s) SUBSET_INTER_ABSORPTION = |- !s t. s SUBSET t = (s INTER t = s) INTER_EMPTY = |- (!s. EMPTY INTER s = EMPTY) /\ (!s. s INTER EMPTY = EMPTY) INTER_UNIV = |- (!s. UNIV INTER s = s) /\ (!s. s INTER UNIV = s) UNION_OVER_INTER = |- !s t u. s INTER (t UNION u) = (s INTER t) UNION (s INTER u) INTER_OVER_UNION = |- !s t u. s UNION (t INTER u) = (s UNION t) INTER (s UNION u) DISJOINT_DEF = |- !s t. DISJOINT s t = (s INTER t = EMPTY) IN_DISJOINT = |- !s t. DISJOINT s t = ~(?x. x IN s /\ x IN t) DISJOINT_SYM = |- !s t. DISJOINT s t = DISJOINT t s DISJOINT_EMPTY = |- !s. DISJOINT EMPTY s /\ DISJOINT s EMPTY DISJOINT_EMPTY_REFL = |- !s. (s = EMPTY) = DISJOINT s s DISJOINT_UNION = |- !s t u. DISJOINT(s UNION t)u = DISJOINT s u /\ DISJOINT t u DIFF_DEF = |- !s t. s DIFF t = {x | x IN s /\ ~x IN t} IN_DIFF = |- !s t x. x IN (s DIFF t) = x IN s /\ ~x IN t DIFF_EMPTY = |- !s. s DIFF EMPTY = s EMPTY_DIFF = |- !s. EMPTY DIFF s = EMPTY DIFF_UNIV = |- !s. s DIFF UNIV = EMPTY DIFF_DIFF = |- !s t. (s DIFF t) DIFF t = s DIFF t DIFF_EQ_EMPTY = |- !s. s DIFF s = EMPTY INSERT_DEF = |- !x s. x INSERT s = {y | (y = x) \/ y IN s} () : void IN_INSERT = |- !x y s. x IN (y INSERT s) = (x = y) \/ x IN s COMPONENT = |- !x s. x IN (x INSERT s) SET_CASES = |- !s. (s = {}) \/ (?x t. (s = x INSERT t) /\ ~x IN t) DECOMPOSITION = |- !s x. x IN s = (?t. (s = x INSERT t) /\ ~x IN t) ABSORPTION = |- !x s. x IN s = (x INSERT s = s) INSERT_INSERT = |- !x s. x INSERT (x INSERT s) = x INSERT s INSERT_COMM = |- !x y s. x INSERT (y INSERT s) = y INSERT (x INSERT s) INSERT_UNIV = |- !x. x INSERT UNIV = UNIV NOT_INSERT_EMPTY = |- !x s. ~(x INSERT s = {}) NOT_EMPTY_INSERT = |- !x s. ~({} = x INSERT s) INSERT_UNION = |- !x s t. (x INSERT s) UNION t = (x IN t => s UNION t | x INSERT (s UNION t)) INSERT_UNION_EQ = |- !x s t. (x INSERT s) UNION t = x INSERT (s UNION t) INSERT_INTER = |- !x s t. (x INSERT s) INTER t = (x IN t => x INSERT (s INTER t) | s INTER t) DISJOINT_INSERT = |- !x s t. DISJOINT(x INSERT s)t = DISJOINT s t /\ ~x IN t INSERT_SUBSET = |- !x s t. (x INSERT s) SUBSET t = x IN t /\ s SUBSET t SUBSET_INSERT = |- !x s. ~x IN s ==> (!t. s SUBSET (x INSERT t) = s SUBSET t) INSERT_DIFF = |- !s t x. (x INSERT s) DIFF t = (x IN t => s DIFF t | x INSERT (s DIFF t)) DELETE_DEF = |- !s x. s DELETE x = s DIFF {x} IN_DELETE = |- !s x y. x IN (s DELETE y) = x IN s /\ ~(x = y) DELETE_NON_ELEMENT = |- !x s. ~x IN s = (s DELETE x = s) IN_DELETE_EQ = |- !s x x'. (x IN s = x' IN s) = (x IN (s DELETE x') = x' IN (s DELETE x)) EMPTY_DELETE = |- !x. {} DELETE x = {} DELETE_DELETE = |- !x s. (s DELETE x) DELETE x = s DELETE x DELETE_COMM = |- !x y s. (s DELETE x) DELETE y = (s DELETE y) DELETE x DELETE_SUBSET = |- !x s. (s DELETE x) SUBSET s SUBSET_DELETE = |- !x s t. s SUBSET (t DELETE x) = ~x IN s /\ s SUBSET t SUBSET_INSERT_DELETE = |- !x s t. s SUBSET (x INSERT t) = (s DELETE x) SUBSET t DIFF_INSERT = |- !s t x. s DIFF (x INSERT t) = (s DELETE x) DIFF t PSUBSET_INSERT_SUBSET = |- !s t. s PSUBSET t = (?x. ~x IN s /\ (x INSERT s) SUBSET t) lemma = |- ~(a = b) = (b = ~a) PSUBSET_MEMBER = |- !s t. s PSUBSET t = s SUBSET t /\ (?y. y IN t /\ ~y IN s) DELETE_INSERT = |- !x y s. (x INSERT s) DELETE y = ((x = y) => s DELETE y | x INSERT (s DELETE y)) INSERT_DELETE = |- !x s. x IN s ==> (x INSERT (s DELETE x) = s) DELETE_INTER = |- !s t x. (s DELETE x) INTER t = (s INTER t) DELETE x DISJOINT_DELETE_SYM = |- !s t x. DISJOINT(s DELETE x)t = DISJOINT(t DELETE x)s CHOICE_EXISTS = |- ?CHOICE. !s. ~(s = {}) ==> (CHOICE s) IN s CHOICE_DEF = |- !s. ~(s = {}) ==> (CHOICE s) IN s REST_DEF = |- !s. REST s = s DELETE (CHOICE s) CHOICE_NOT_IN_REST = |- !s. ~(CHOICE s) IN (REST s) CHOICE_INSERT_REST = |- !s. ~(s = {}) ==> ((CHOICE s) INSERT (REST s) = s) REST_SUBSET = |- !s. (REST s) SUBSET s lemma = |- (P /\ Q = P) = P ==> Q REST_PSUBSET = |- !s. ~(s = {}) ==> (REST s) PSUBSET s SING_DEF = |- !s. SING s = (?x. s = {x}) SING = |- !x. SING{x} IN_SING = |- !x y. x IN {y} = (x = y) NOT_SING_EMPTY = |- !x. ~({x} = {}) NOT_EMPTY_SING = |- !x. ~({} = {x}) EQUAL_SING = |- !x y. ({x} = {y}) = (x = y) DISJOINT_SING_EMPTY = |- !x. DISJOINT{x}{} INSERT_SING_UNION = |- !s x. x INSERT s = {x} UNION s SING_DELETE = |- !x. {x} DELETE x = {} DELETE_EQ_SING = |- !s x. x IN s ==> ((s DELETE x = {}) = (s = {x})) CHOICE_SING = |- !x. CHOICE{x} = x REST_SING = |- !x. REST{x} = {} SING_IFF_EMPTY_REST = |- !s. SING s = ~(s = {}) /\ (REST s = {}) IMAGE_DEF = |- !f s. IMAGE f s = {f x | x IN s} IN_IMAGE = |- !y s f. y IN (IMAGE f s) = (?x. (y = f x) /\ x IN s) IMAGE_IN = |- !x s. x IN s ==> (!f. (f x) IN (IMAGE f s)) IMAGE_EMPTY = |- !f. IMAGE f{} = {} IMAGE_ID = |- !s. IMAGE(\x. x)s = s Theorem o_THM autoloading from theory `combin` ... o_THM = |- !f g x. (f o g)x = f(g x) IMAGE_COMPOSE = |- !f g s. IMAGE(f o g)s = IMAGE f(IMAGE g s) IMAGE_INSERT = |- !f x s. IMAGE f(x INSERT s) = (f x) INSERT (IMAGE f s) IMAGE_EQ_EMPTY = |- !s f. (IMAGE f s = {}) = (s = {}) IMAGE_DELETE = |- !f x s. ~x IN s ==> (IMAGE f(s DELETE x) = IMAGE f s) IMAGE_UNION = |- !f s t. IMAGE f(s UNION t) = (IMAGE f s) UNION (IMAGE f t) IMAGE_SUBSET = |- !s t. s SUBSET t ==> (!f. (IMAGE f s) SUBSET (IMAGE f t)) IMAGE_INTER = |- !f s t. (IMAGE f(s INTER t)) SUBSET ((IMAGE f s) INTER (IMAGE f t)) INJ_DEF = |- !f s t. INJ f s t = (!x. x IN s ==> (f x) IN t) /\ (!x y. x IN s /\ y IN s ==> (f x = f y) ==> (x = y)) INJ_ID = |- !s. INJ(\x. x)s s INJ_COMPOSE = |- !f g s t u. INJ f s t /\ INJ g t u ==> INJ(g o f)s u INJ_EMPTY = |- !f. (!s. INJ f{}s) /\ (!s. INJ f s{} = (s = {})) SURJ_DEF = |- !f s t. SURJ f s t = (!x. x IN s ==> (f x) IN t) /\ (!x. x IN t ==> (?y. y IN s /\ (f y = x))) SURJ_ID = |- !s. SURJ(\x. x)s s SURJ_COMPOSE = |- !f g s t u. SURJ f s t /\ SURJ g t u ==> SURJ(g o f)s u SURJ_EMPTY = |- !f. (!s. SURJ f{}s = (s = {})) /\ (!s. SURJ f s{} = (s = {})) IMAGE_SURJ = |- !f s t. SURJ f s t = (IMAGE f s = t) BIJ_DEF = |- !f s t. BIJ f s t = INJ f s t /\ SURJ f s t BIJ_ID = |- !s. BIJ(\x. x)s s BIJ_EMPTY = |- !f. (!s. BIJ f{}s = (s = {})) /\ (!s. BIJ f s{} = (s = {})) BIJ_COMPOSE = |- !f g s t u. BIJ f s t /\ BIJ g t u ==> BIJ(g o f)s u lemma1 = |- !f s. (!x y. x IN s /\ y IN s ==> (f x = f y) ==> (x = y)) = (!y. y IN s ==> (!x. x IN s /\ (f x = f y) = y IN s /\ (x = y))) lemma2 = |- !f s. ?g. !t. INJ f s t ==> (!x. x IN s ==> (g(f x) = x)) LINV_DEF = |- !f s t. INJ f s t ==> (!x. x IN s ==> (LINV f s(f x) = x)) lemma3 = |- !f s. ?g. !t. SURJ f s t ==> (!x. x IN t ==> (f(g x) = x)) RINV_DEF = |- !f s t. SURJ f s t ==> (!x. x IN t ==> (f(RINV f s x) = x)) FINITE_DEF = |- !s. FINITE s = (!P. P{} /\ (!s'. P s' ==> (!e. P(e INSERT s'))) ==> P s) FINITE_EMPTY = |- FINITE{} FINITE_INSERT = |- !s. FINITE s ==> (!x. FINITE(x INSERT s)) SIMPLE_FINITE_INDUCT = |- !P. P{} /\ (!s. P s ==> (!e. P(e INSERT s))) ==> (!s. FINITE s ==> P s) lemma = |- P{} /\ (!s. FINITE s /\ P s ==> (!e. FINITE(e INSERT s) /\ P(e INSERT s))) ==> (!s. FINITE s ==> P s) FINITE_INDUCT = |- !P. P{} /\ (!s. FINITE s /\ P s ==> (!e. ~e IN s ==> P(e INSERT s))) ==> (!s. FINITE s ==> P s) SET_INDUCT_TAC = - : tactic File set_ind loaded () : void FINITE_DELETE = |- !s. FINITE s ==> (!x. FINITE(s DELETE x)) INSERT_FINITE = |- !x s. FINITE(x INSERT s) ==> FINITE s FINITE_INSERT = |- !x s. FINITE(x INSERT s) = FINITE s DELETE_FINITE = |- !x s. FINITE(s DELETE x) ==> FINITE s FINITE_DELETE = |- !x s. FINITE(s DELETE x) = FINITE s UNION_FINITE = |- !s. FINITE s ==> (!t. FINITE t ==> FINITE(s UNION t)) FINITE_UNION_LEMMA = |- !s. FINITE s ==> (!t. FINITE(s UNION t) ==> FINITE t) FINITE_UNION = |- !s t. FINITE(s UNION t) ==> FINITE s /\ FINITE t FINITE_UNION = |- !s t. FINITE(s UNION t) = FINITE s /\ FINITE t INTER_FINITE = |- !s. FINITE s ==> (!t. FINITE(s INTER t)) SUBSET_FINITE = |- !s. FINITE s ==> (!t. t SUBSET s ==> FINITE t) PSUBSET_FINITE = |- !s. FINITE s ==> (!t. t PSUBSET s ==> FINITE t) FINITE_DIFF = |- !s. FINITE s ==> (!t. FINITE(s DIFF t)) FINITE_SING = |- !x. FINITE{x} SING_FINITE = |- !s. SING s ==> FINITE s IMAGE_FINITE = |- !s. FINITE s ==> (!f. FINITE(IMAGE f s)) card_rel_def = "(!s. R s 0 = (s = {})) /\ (!s n. R s(SUC n) = (?x. x IN s /\ R(s DELETE x)n))" : term Theorem num_Axiom autoloading from theory `prim_rec` ... num_Axiom = |- !e f. ?! fn. (fn 0 = e) /\ (!n. fn(SUC n) = f(fn n)n) CARD_REL_EXISTS = |- ?R. (!s. R s 0 = (s = {})) /\ (!s n. R s(SUC n) = (?x. x IN s /\ R(s DELETE x)n)) CARD_REL_DEL_LEMMA = .. |- !n s x. x IN s ==> R(s DELETE x)n ==> (!y. y IN s ==> R(s DELETE y)n) Theorem INV_SUC_EQ autoloading from theory `prim_rec` ... INV_SUC_EQ = |- !m n. (SUC m = SUC n) = (m = n) Theorem NOT_SUC autoloading from theory `num` ... NOT_SUC = |- !n. ~(SUC n = 0) CARD_REL_UNIQUE = .. |- !n s. R s n ==> (!m. R s m ==> (n = m)) CARD_REL_EXISTS_LEMMA = .. |- !s. FINITE s ==> (?n. R s n) CARD_REL_THM = .. |- !m s. FINITE s ==> (((@n. R s n) = m) = R s m) CARD_EXISTS = |- ?CARD. (CARD{} = 0) /\ (!s. FINITE s ==> (!x. CARD(x INSERT s) = (x IN s => CARD s | SUC(CARD s)))) CARD_DEF = |- (CARD{} = 0) /\ (!s. FINITE s ==> (!x. CARD(x INSERT s) = (x IN s => CARD s | SUC(CARD s)))) CARD_EMPTY = |- CARD{} = 0 CARD_INSERT = |- !s. FINITE s ==> (!x. CARD(x INSERT s) = (x IN s => CARD s | SUC(CARD s))) CARD_EQ_0 = |- !s. FINITE s ==> ((CARD s = 0) = (s = {})) Theorem num_CASES autoloading from theory `arithmetic` ... num_CASES = |- !m. (m = 0) \/ (?n. m = SUC n) Theorem SUC_SUB1 autoloading from theory `arithmetic` ... SUC_SUB1 = |- !m. (SUC m) - 1 = m CARD_DELETE = |- !s. FINITE s ==> (!x. CARD(s DELETE x) = (x IN s => (CARD s) - 1 | CARD s)) Theorem LESS_MONO_EQ autoloading from theory `arithmetic` ... LESS_MONO_EQ = |- !m n. (SUC m) < (SUC n) = m < n Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) lemma1 = |- !n m. (SUC n) <= (SUC m) = n <= m Theorem LESS_THM autoloading from theory `prim_rec` ... LESS_THM = |- !m n. m < (SUC n) = (m = n) \/ m < n lemma2 = |- !n m. n <= (SUC m) = n <= m \/ (n = SUC m) Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m <= m CARD_INTER_LESS_EQ = |- !s. FINITE s ==> (!t. (CARD(s INTER t)) <= (CARD s)) Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) CARD_UNION = |- !s. FINITE s ==> (!t. FINITE t ==> ((CARD(s UNION t)) + (CARD(s INTER t)) = (CARD s) + (CARD t))) lemma = |- !n m. n <= (SUC m) = n <= m \/ (n = SUC m) Theorem LESS_0 autoloading from theory `prim_rec` ... LESS_0 = |- !n. 0 < (SUC n) CARD_SUBSET = |- !s. FINITE s ==> (!t. t SUBSET s ==> (CARD t) <= (CARD s)) Theorem LESS_EQ autoloading from theory `arithmetic` ... LESS_EQ = |- !m n. m < n = (SUC m) <= n CARD_PSUBSET = |- !s. FINITE s ==> (!t. t PSUBSET s ==> (CARD t) < (CARD s)) CARD_SING = |- !x. CARD{x} = 1 SING_IFF_CARD1 = |- !s. SING s = (CARD s = 1) /\ FINITE s Theorem SUB_PLUS autoloading from theory `arithmetic` ... SUB_PLUS = |- !a b c. a - (b + c) = (a - b) - c Theorem SUB_0 autoloading from theory `arithmetic` ... SUB_0 = |- !m. (0 - m = 0) /\ (m - 0 = m) CARD_DIFF = |- !t. FINITE t ==> (!s. FINITE s ==> (CARD(s DIFF t) = (CARD s) - (CARD(s INTER t)))) Theorem SUB_LESS_0 autoloading from theory `arithmetic` ... SUB_LESS_0 = |- !n m. m < n = 0 < (n - m) LESS_CARD_DIFF = |- !t. FINITE t ==> (!s. FINITE s ==> (CARD t) < (CARD s) ==> 0 < (CARD(s DIFF t))) INFINITE_DEF = |- !s. INFINITE s = ~FINITE s NOT_IN_FINITE = |- INFINITE UNIV = (!s. FINITE s ==> (?x. ~x IN s)) INVERSE_LEMMA = |- !f. (!x y. (f x = f y) ==> (x = y)) ==> ((\x. @y. x = f y) o f = (\x. x)) IMAGE_11_INFINITE = |- !f. (!x y. (f x = f y) ==> (x = y)) ==> (!s. INFINITE s ==> INFINITE(IMAGE f s)) INFINITE_SUBSET = |- !s. INFINITE s ==> (!t. s SUBSET t ==> INFINITE t) IN_INFINITE_NOT_FINITE = |- !s t. INFINITE s /\ FINITE t ==> (?x. x IN s /\ ~x IN t) gdef = ["g 0 = {}"; "!n. g(SUC n) = (@x. ~x IN (g n)) INSERT (g n)"] : term list g_finite = .. |- !n. FINITE(g n) g_subset = . |- !n x. x IN (g n) ==> (!i. x IN (g(n + i))) lemma = |- (A \/ B) /\ ~B = A /\ ~B Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n < (SUC n) g_cases = .. |- (!s. FINITE s ==> (?x. ~x IN s)) ==> (!x. (?n. x IN (g n)) ==> (?m. x IN (g(SUC m)) /\ ~x IN (g m))) z_in_g1 = .. |- (@x. ~x IN {}) IN (g(SUC 0)) Theorem ADD_SYM autoloading from theory `arithmetic` ... ADD_SYM = |- !m n. m + n = n + m Theorem ADD1 autoloading from theory `arithmetic` ... ADD1 = |- !m. SUC m = m + 1 z_in_gn = .. |- !n. (@x. ~x IN {}) IN (g(SUC n)) in_lemma = . |- !n. (@x. ~x IN (g n)) IN (g(SUC n)) not_in_lemma = .. |- (!s. FINITE s ==> (?x. ~x IN s)) ==> (!i n. ~(@x. ~x IN (g(n + i))) IN (g n)) Theorem LESS_NOT_EQ autoloading from theory `prim_rec` ... LESS_NOT_EQ = |- !m n. m < n ==> ~(m = n) Theorem LESS_REFL autoloading from theory `prim_rec` ... LESS_REFL = |- !n. ~n < n less_lemma = |- !m n. ~(m = n) = m < n \/ n < m Theorem LESS_ADD_1 autoloading from theory `arithmetic` ... LESS_ADD_1 = |- !m n. n < m ==> (?p. m = n + (p + 1)) gn_unique = .. |- (!s. FINITE s ==> (?x. ~x IN s)) ==> (!n m. ((@x. ~x IN (g n)) = (@x. ~x IN (g m))) = (n = m)) x_unique = .. |- !n x y. ~x IN (g n) /\ ~y IN (g n) ==> x IN (g(SUC n)) ==> y IN (g(SUC n)) ==> (x = y) fdef = "\x. ((?n. x IN (g n)) => (@y. ~y IN (g(SUC(@n. x IN (g(SUC n)) /\ ~x IN (g n))))) | x)" : term cases = |- !x. (?n. x IN (g n)) \/ (!n. ~x IN (g n)) INF_IMP_INFINITY = |- (!s. FINITE s ==> (?x. ~x IN s)) ==> (?f. (!x y. (f x = f y) ==> (x = y)) /\ (?y. !x. ~(f x = y))) prth = |- ?fn. (!f x. fn f x 0 = x) /\ (!f x n. fn f x(SUC n) = f(fn f x n)) prmth = |- !x f. ?fn. (fn 0 = x) /\ (!n. fn(SUC n) = f(fn n)) num_fn_thm = |- (?f. (!x y. (f x = f y) ==> (x = y)) /\ (?y. !x. ~(f x = y))) ==> (?fn. !n m. (fn n = fn m) ==> (n = m)) Theorem LESS_IMP_LESS_ADD autoloading from theory `arithmetic` ... LESS_IMP_LESS_ADD = |- !n m. n < m ==> (!p. n < (m + p)) Theorem LESS_ADD_SUC autoloading from theory `arithmetic` ... LESS_ADD_SUC = |- !m n. m < (m + (SUC n)) finite_N_bounded = |- !s. FINITE s ==> (?m. !n. n IN s ==> n < m) N_lemma = |- INFINITE UNIV main_lemma = |- !s. FINITE s ==> (!f. (!n m. (f n = f m) ==> (n = m)) ==> (?n. ~(f n) IN s)) INFINITY_IMP_INF = |- (?f. (!x y. (f x = f y) ==> (x = y)) /\ (?y. !x. ~(f x = y))) ==> (!s. FINITE s ==> (?x. ~x IN s)) INFINITE_UNIV = |- INFINITE UNIV = (?f. (!x y. (f x = f y) ==> (x = y)) /\ (?y. !x. ~(f x = y))) FINITE_PSUBSET_INFINITE = |- !s. INFINITE s = (!t. FINITE t ==> t SUBSET s ==> t PSUBSET s) FINITE_PSUBSET_UNIV = |- INFINITE UNIV = (!s. FINITE s ==> s PSUBSET UNIV) INFINITE_DIFF_FINITE = |- !s t. INFINITE s /\ FINITE t ==> ~(s DIFF t = {}) Theorem NOT_LESS_0 autoloading from theory `prim_rec` ... NOT_LESS_0 = |- !n. ~n < 0 FINITE_ISO_NUM = |- !s. FINITE s ==> (?f. (!n m. n < (CARD s) /\ m < (CARD s) ==> (f n = f m) ==> (n = m)) /\ (s = {f n | n < (CARD s)})) echo 'set_flag(`abort_when_fail`,true);;'\ 'load_theory `pred_sets`;;'\ 'compilet `set_ind`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory pred_sets loaded () : void SET_INDUCT_TAC = - : tactic Calling Lisp compiler File set_ind compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'load_theory `pred_sets`;;'\ 'compilet `gspec`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory pred_sets loaded () : void dest_tuple = - : (term -> term list) MK_PAIR = - : (* list -> conv) EXISTS_TUPLE_CONV = - : (term list -> conv) PAIR_EQ_CONV = - : conv ELIM_EXISTS_CONV = - : conv PROVE_EXISTS = - : conv list_variant = - : (term list -> term list -> term list) SET_SPEC_CONV = - : conv - : conv SET_SPEC_CONV = - : conv Calling Lisp compiler File gspec compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'load_theory `pred_sets`;;'\ 'compilet `fset_conv`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory pred_sets loaded () : void FINITE_CONV = - : conv IN_CONV = - : (conv -> conv) DELETE_CONV = - : (conv -> conv) UNION_CONV = - : (conv -> conv) INSERT_CONV = - : (conv -> conv) IMAGE_CONV = - : (conv -> conv -> conv) Calling Lisp compiler File fset_conv compiled () : void #===> library pred_sets rebuilt make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string' rm -f ascii.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `mk_ascii`;;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void ascii_Axiom = |- !f. ?! fn. !b0 b1 b2 b3 b4 b5 b6 b7. fn(ASCII b0 b1 b2 b3 b4 b5 b6 b7) = f b0 b1 b2 b3 b4 b5 b6 b7 ascii_Induct = |- !P. (!b0 b1 b2 b3 b4 b5 b6 b7. P(ASCII b0 b1 b2 b3 b4 b5 b6 b7)) ==> (!a. P a) ascii_CASES = |- !a. ?b0 b1 b2 b3 b4 b5 b6 b7. a = ASCII b0 b1 b2 b3 b4 b5 b6 b7 ASCII_11 = |- !b0 b1 b2 b3 b4 b5 b6 b7 b0' b1' b2' b3' b4' b5' b6' b7'. (ASCII b0 b1 b2 b3 b4 b5 b6 b7 = ASCII b0' b1' b2' b3' b4' b5' b6' b7') = (b0 = b0') /\ (b1 = b1') /\ (b2 = b2') /\ (b3 = b3') /\ (b4 = b4') /\ (b5 = b5') /\ (b6 = b6') /\ (b7 = b7') rm -f string.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `mk_string`;;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void Theory ascii loaded () : void () : void () : void () : void () : void string_Axiom = `string_Axiom` : string spec = `string = `` | STRING ascii string` : string tok = `tok` : string string_Induct = `string_Induct` : string string_CASES = `string_CASES` : string STRING_11 = `STRING_11` : string NOT_STRING_EMPTY = `NOT_STRING_EMPTY` : string NOT_EMPTY_STRING = `NOT_EMPTY_STRING` : string () : void string_Axiom = |- !e f. ?! fn. (fn `` = e) /\ (!a s. fn(STRING a s) = f(fn s)a s) () : void string_Induct = |- !P. P `` /\ (!s. P s ==> (!a. P(STRING a s))) ==> (!s. P s) string_CASES = |- !s. (s = ``) \/ (?s' a. s = STRING a s') STRING_11 = |- !a s a' s'. (STRING a s = STRING a' s') = (a = a') /\ (s = s') NOT_STRING_EMPTY = |- !a s. ~(`` = STRING a s) NOT_EMPTY_STRING = |- !a s. ~(STRING a s = ``) () : void echo 'set_flag(`abort_when_fail`,true);;'\ 'load_theory `ascii`;;'\ 'compilet `ascii`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory ascii loaded () : void ascii_EQ_CONV = - : conv Calling Lisp compiler File ascii compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'load_theory `string`;;'\ 'compilet `stringconv`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory string loaded () : void string_CONV = - : conv Calling Lisp compiler File stringconv compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'load_theory `string`;;'\ 'loadf `stringconv`;;'\ 'loadf `ascii`;;'\ 'compilet `string_rules`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory string loaded () : void .() : void .() : void string_EQ_CONV = - : conv Calling Lisp compiler File string_rules compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'load_theory `string`;;'\ 'compilet `string`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory string loaded () : void Updating search path () : void Updating help search path () : void Theory string loaded () : void () : void () : void Calling Lisp compiler File string compiled () : void #===> library string rebuilt make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets' rm -f finite_sets.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `mk_finite_sets`;;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void IS_SET_REP = "\s. !P. P(\x. F) /\ (!t. P t ==> (!x. P(\y. (y = x) \/ t y))) ==> P s" : term IS_SET_REP_EMPTY = |- (\s. !P. P(\x. F) /\ (!t. P t ==> (!x. P(\y. (y = x) \/ t y))) ==> P s) (\x. F) INSERTION_PRESERVES_IS_SET_REP = |- !s. (\s. !P. P(\x. F) /\ (!t. P t ==> (!x. P(\y. (y = x) \/ t y))) ==> P s) s ==> (!x. (\s. !P. P(\x. F) /\ (!t. P t ==> (!x. P(\y. (y = x) \/ t y))) ==> P s) (\y. (y = x) \/ s y)) REP_INDUCT = |- !P. P(\x. F) /\ (!t. P t ==> (!x. P(\y. (y = x) \/ t y))) ==> (!s. (\s. !P. P(\x. F) /\ (!t. P t ==> (!x. P(\y. (y = x) \/ t y))) ==> P s) s ==> P s) IS_SET_REP_EXISTS = |- ?IS_SET_REP. IS_SET_REP(\x. F) /\ (!s. IS_SET_REP s ==> (!x. IS_SET_REP(\y. (y = x) \/ s y))) /\ (!P. P(\x. F) /\ (!t. P t ==> (!x. P(\y. (y = x) \/ t y))) ==> (!s. IS_SET_REP s ==> P s)) IS_SET_REP = |- IS_SET_REP(\x. F) /\ (!s. IS_SET_REP s ==> (!x. IS_SET_REP(\y. (y = x) \/ s y))) /\ (!P. P(\x. F) /\ (!t. P t ==> (!x. P(\y. (y = x) \/ t y))) ==> (!s. IS_SET_REP s ==> P s)) STRONG_SET_REP_INDUCT = |- !P. P(\x. F) /\ (!t. IS_SET_REP t ==> P t ==> (!x. P(\y. (y = x) \/ t y))) ==> (!s. IS_SET_REP s ==> P s) EXISTENCE_THM = |- ?s. IS_SET_REP s set_TY_DEF = |- ?rep. TYPE_DEFINITION IS_SET_REP rep EXISTENCE_LEMMA = |- ?EMPTY INSERT IN. (!x. ~IN x EMPTY) /\ (!x y s. IN x(INSERT y s) = (x = y) \/ IN x s) /\ (!x s. INSERT x(INSERT x s) = INSERT x s) /\ (!x y s. INSERT x(INSERT y s) = INSERT y(INSERT x s)) /\ (!P. P EMPTY /\ (!s. P s ==> (!e. P(INSERT e s))) ==> (!s. P s)) FINITE_SET_DEF = |- (!x. ~x IN EMPTY) /\ (!x y s. x IN (y INSERT s) = (x = y) \/ x IN s) /\ (!x s. x INSERT (x INSERT s) = x INSERT s) /\ (!x y s. x INSERT (y INSERT s) = y INSERT (x INSERT s)) /\ (!P. P EMPTY /\ (!s. P s ==> (!e. P(e INSERT s))) ==> (!s. P s)) () : void NOT_IN_EMPTY = |- !x. ~x IN {} IN_INSERT = |- !x y s. x IN (y INSERT s) = (x = y) \/ x IN s INSERT_INSERT = |- !x s. x INSERT (x INSERT s) = x INSERT s INSERT_COMM = |- !x y s. x INSERT (y INSERT s) = y INSERT (x INSERT s) |- !x. ~x IN {} |- !x y s. x IN (y INSERT s) = (x = y) \/ x IN s |- !x s. x INSERT (x INSERT s) = x INSERT s |- !x y s. x INSERT (y INSERT s) = y INSERT (x INSERT s) COMPONENT = |- !x s. x IN (x INSERT s) NOT_EMPTY_INSERT = |- !x s. ~({} = x INSERT s) NOT_INSERT_EMPTY = |- !x s. ~(x INSERT s = {}) lemma = |- !x s. x IN s ==> (x INSERT s = s) ABSORPTION = |- !x s. x IN s = (x INSERT s = s) SET_INDUCT = |- !P. P{} /\ (!s. P s ==> (!e. ~e IN s ==> P(e INSERT s))) ==> (!s. P s) SET_INDUCT_TAC = - : tactic File set_ind.ml loaded () : void DECOMPOSITION = |- !s x. x IN s = (?t. (s = x INSERT t) /\ ~x IN t) MEMBER_NOT_EMPTY = |- !s. (?x. x IN s) = ~(s = {}) lemma = |- !s t. (!x. x IN s = x IN t) ==> (s = t) EXTENSION = |- !s t. (s = t) = (!x. x IN s = x IN t) NOT_EQUAL_SETS = |- !s t. ~(s = t) = (?x. x IN t = ~x IN s) Theorem NOT_LESS autoloading from theory `arithmetic` ... NOT_LESS = |- !m n. ~m < n = n <= m Theorem WOP autoloading from theory `arithmetic` ... WOP = |- !P. (?n. P n) ==> (?n. P n /\ (!m. m < n ==> ~P m)) NUM_SET_WOP = |- !s. (?n. n IN s) = (?n. n IN s /\ (!m. m IN s ==> n <= m)) SET_CASES = |- !s. (s = {}) \/ (?x t. (s = x INSERT t) /\ ~x IN t) SUBSET_DEF = |- !s t. s SUBSET t = (!x. x IN s ==> x IN t) SUBSET_TRANS = |- !s t u. s SUBSET t /\ t SUBSET u ==> s SUBSET u SUBSET_REFL = |- !s. s SUBSET s SUBSET_ANTISYM = |- !s t. s SUBSET t /\ t SUBSET s ==> (s = t) EMPTY_SUBSET = |- !s. {} SUBSET s SUBSET_EMPTY = |- !s. s SUBSET {} = (s = {}) INSERT_SUBSET = |- !x s t. (x INSERT s) SUBSET t = x IN t /\ s SUBSET t SUBSET_INSERT = |- !x s. ~x IN s ==> (!t. s SUBSET (x INSERT t) = s SUBSET t) PSUBSET_DEF = |- !s t. s PSUBSET t = s SUBSET t /\ ~(s = t) PSUBSET_TRANS = |- !s t u. s PSUBSET t /\ t PSUBSET u ==> s PSUBSET u PSUBSET_IRREFL = |- !s. ~s PSUBSET s NOT_PSUBSET_EMPTY = |- !s. ~s PSUBSET {} PSUBSET_INSERT_SUBSET = |- !s t. s PSUBSET t = (?x. ~x IN s /\ (x INSERT s) SUBSET t) lemma = |- ~(a = b) = (b = ~a) PSUBSET_MEMBER = |- !s t. s PSUBSET t = s SUBSET t /\ (?y. y IN t /\ ~y IN s) UNION_EXISTS = |- !s t. ?u. !x. x IN u = x IN s \/ x IN t IN_UNION = |- !s t x. x IN (s UNION t) = x IN s \/ x IN t UNION_ASSOC = |- !s t u. (s UNION t) UNION u = s UNION (t UNION u) UNION_IDEMPOT = |- !s. s UNION s = s UNION_COMM = |- !s t. s UNION t = t UNION s SUBSET_UNION = |- (!s t. s SUBSET (s UNION t)) /\ (!s t. s SUBSET (t UNION s)) SUBSET_UNION_ABSORPTION = |- !s t. s SUBSET t = (s UNION t = t) UNION_EMPTY = |- (!s. {} UNION s = s) /\ (!s. s UNION {} = s) EMPTY_UNION = |- !s t. (s UNION t = {}) = (s = {}) /\ (t = {}) INSERT_UNION = |- !x s t. (x INSERT s) UNION t = (x IN t => s UNION t | x INSERT (s UNION t)) INSERT_UNION_EQ = |- !x s t. (x INSERT s) UNION t = x INSERT (s UNION t) INTER_EXISTS = |- !s t. ?i. !x. x IN i = x IN s /\ x IN t IN_INTER = |- !s t x. x IN (s INTER t) = x IN s /\ x IN t INTER_ASSOC = |- !s t u. (s INTER t) INTER u = s INTER (t INTER u) INTER_IDEMPOT = |- !s. s INTER s = s INTER_COMM = |- !s t. s INTER t = t INTER s INTER_SUBSET = |- (!s t. (s INTER t) SUBSET s) /\ (!s t. (t INTER s) SUBSET s) SUBSET_INTER_ABSORPTION = |- !s t. s SUBSET t = (s INTER t = s) INTER_EMPTY = |- (!s. {} INTER s = {}) /\ (!s. s INTER {} = {}) INSERT_INTER = |- !x s t. (x INSERT s) INTER t = (x IN t => x INSERT (s INTER t) | s INTER t) UNION_OVER_INTER = |- !s t u. s INTER (t UNION u) = (s INTER t) UNION (s INTER u) INTER_OVER_UNION = |- !s t u. s UNION (t INTER u) = (s UNION t) INTER (s UNION u) DISJOINT_DEF = |- !s t. DISJOINT s t = (s INTER t = {}) IN_DISJOINT = |- !s t. DISJOINT s t = ~(?x. x IN s /\ x IN t) DISJOINT_SYM = |- !s t. DISJOINT s t = DISJOINT t s DISJOINT_EMPTY = |- !s. DISJOINT{}s /\ DISJOINT s{} DISJOINT_EMPTY_REFL = |- !s. (s = {}) = DISJOINT s s DISJOINT_INSERT = |- !x s t. DISJOINT(x INSERT s)t = DISJOINT s t /\ ~x IN t DISJOINT_UNION = |- !s t u. DISJOINT(s UNION t)u = DISJOINT s u /\ DISJOINT t u DIFF_EXISTS = |- !s t. ?d. !x. x IN d = x IN s /\ ~x IN t IN_DIFF = |- !s t x. x IN (s DIFF t) = x IN s /\ ~x IN t DIFF_EMPTY = |- !s. s DIFF {} = s EMPTY_DIFF = |- !s. {} DIFF s = {} DIFF_DIFF = |- !s t. (s DIFF t) DIFF t = s DIFF t DIFF_EQ_EMPTY = |- !s. s DIFF s = {} DELETE_DEF = |- !s x. s DELETE x = s DIFF {x} IN_DELETE = |- !s x y. x IN (s DELETE y) = x IN s /\ ~(x = y) DELETE_NON_ELEMENT = |- !x s. ~x IN s = (s DELETE x = s) IN_DELETE_EQ = |- !s x x'. (x IN s = x' IN s) = (x IN (s DELETE x') = x' IN (s DELETE x)) EMPTY_DELETE = |- !x. {} DELETE x = {} DELETE_DELETE = |- !x s. (s DELETE x) DELETE x = s DELETE x DELETE_COMM = |- !x y s. (s DELETE x) DELETE y = (s DELETE y) DELETE x DELETE_SUBSET = |- !x s. (s DELETE x) SUBSET s SUBSET_DELETE = |- !x s t. s SUBSET (t DELETE x) = ~x IN s /\ s SUBSET t SUBSET_INSERT_DELETE = |- !x s t. s SUBSET (x INSERT t) = (s DELETE x) SUBSET t DIFF_INSERT = |- !s t x. s DIFF (x INSERT t) = (s DELETE x) DIFF t DELETE_INSERT = |- !x y s. (x INSERT s) DELETE y = ((x = y) => s DELETE y | x INSERT (s DELETE y)) INSERT_DELETE = |- !x s. x IN s ==> (x INSERT (s DELETE x) = s) DELETE_INTER = |- !s t x. (s DELETE x) INTER t = (s INTER t) DELETE x DISJOINT_DELETE_SYM = |- !s t x. DISJOINT(s DELETE x)t = DISJOINT(t DELETE x)s CHOICE_EXISTS = |- ?CHOICE. !s. ~(s = {}) ==> (CHOICE s) IN s CHOICE_DEF = |- !s. ~(s = {}) ==> (CHOICE s) IN s REST_DEF = |- !s. REST s = s DELETE (CHOICE s) CHOICE_NOT_IN_REST = |- !s. ~(CHOICE s) IN (REST s) CHOICE_INSERT_REST = |- !s. ~(s = {}) ==> ((CHOICE s) INSERT (REST s) = s) REST_SUBSET = |- !s. (REST s) SUBSET s lemma = |- (P /\ Q = P) = P ==> Q REST_PSUBSET = |- !s. ~(s = {}) ==> (REST s) PSUBSET s SING_DEF = |- !s. SING s = (?x. s = {x}) SING = |- !x. SING{x} IN_SING = |- !x y. x IN {y} = (x = y) NOT_SING_EMPTY = |- !x. ~({x} = {}) NOT_EMPTY_SING = |- !x. ~({} = {x}) EQUAL_SING = |- !x y. ({x} = {y}) = (x = y) DISJOINT_SING_EMPTY = |- !x. DISJOINT{x}{} INSERT_SING_UNION = |- !s x. x INSERT s = {x} UNION s SING_DELETE = |- !x. {x} DELETE x = {} DELETE_EQ_SING = |- !s x. x IN s ==> ((s DELETE x = {}) = (s = {x})) CHOICE_SING = |- !x. CHOICE{x} = x REST_SING = |- !x. REST{x} = {} SING_IFF_EMPTY_REST = |- !s. SING s = ~(s = {}) /\ (REST s = {}) IMAGE_EXISTS = |- !f s. ?t. !y. y IN t = (?x. (y = f x) /\ x IN s) IN_IMAGE = |- !f s y. y IN (IMAGE f s) = (?x. (y = f x) /\ x IN s) IMAGE_IN = |- !x s. x IN s ==> (!f. (f x) IN (IMAGE f s)) IMAGE_EMPTY = |- !f. IMAGE f{} = {} IMAGE_ID = |- !s. IMAGE(\x. x)s = s Theorem o_THM autoloading from theory `combin` ... o_THM = |- !f g x. (f o g)x = f(g x) IMAGE_COMPOSE = |- !f g s. IMAGE(f o g)s = IMAGE f(IMAGE g s) IMAGE_INSERT = |- !f x s. IMAGE f(x INSERT s) = (f x) INSERT (IMAGE f s) IMAGE_EQ_EMPTY = |- !s f. (IMAGE f s = {}) = (s = {}) IMAGE_DELETE = |- !f x s. ~x IN s ==> (IMAGE f(s DELETE x) = IMAGE f s) IMAGE_UNION = |- !f s t. IMAGE f(s UNION t) = (IMAGE f s) UNION (IMAGE f t) IMAGE_SUBSET = |- !s t. s SUBSET t ==> (!f. (IMAGE f s) SUBSET (IMAGE f t)) IMAGE_INTER = |- !f s t. (IMAGE f(s INTER t)) SUBSET ((IMAGE f s) INTER (IMAGE f t)) lemma = |- !s x. x IN s ==> (!f. (f x) IN (IMAGE f s)) SET_MINIMUM = |- !s M. (?x. x IN s) = (?x. x IN s /\ (!y. y IN s ==> (M x) <= (M y))) INJ_DEF = |- !f s t. INJ f s t = (!x. x IN s ==> (f x) IN t) /\ (!x y. x IN s /\ y IN s ==> (f x = f y) ==> (x = y)) INJ_ID = |- !s. INJ(\x. x)s s INJ_COMPOSE = |- !f g s t u. INJ f s t /\ INJ g t u ==> INJ(g o f)s u INJ_EMPTY = |- !f. (!s. INJ f{}s) /\ (!s. INJ f s{} = (s = {})) SURJ_DEF = |- !f s t. SURJ f s t = (!x. x IN s ==> (f x) IN t) /\ (!x. x IN t ==> (?y. y IN s /\ (f y = x))) SURJ_ID = |- !s. SURJ(\x. x)s s SURJ_COMPOSE = |- !f g s t u. SURJ f s t /\ SURJ g t u ==> SURJ(g o f)s u SURJ_EMPTY = |- !f. (!s. SURJ f{}s = (s = {})) /\ (!s. SURJ f s{} = (s = {})) IMAGE_SURJ = |- !f s t. SURJ f s t = (IMAGE f s = t) BIJ_DEF = |- !f s t. BIJ f s t = INJ f s t /\ SURJ f s t BIJ_ID = |- !s. BIJ(\x. x)s s BIJ_EMPTY = |- !f. (!s. BIJ f{}s = (s = {})) /\ (!s. BIJ f s{} = (s = {})) BIJ_COMPOSE = |- !f g s t u. BIJ f s t /\ BIJ g t u ==> BIJ(g o f)s u lemma1 = |- !f s. (!x y. x IN s /\ y IN s ==> (f x = f y) ==> (x = y)) = (!y. y IN s ==> (!x. x IN s /\ (f x = f y) = y IN s /\ (x = y))) lemma2 = |- !f s. ?g. !t. INJ f s t ==> (!x. x IN s ==> (g(f x) = x)) LINV_DEF = |- !f s t. INJ f s t ==> (!x. x IN s ==> (LINV f s(f x) = x)) lemma3 = |- !f s. ?g. !t. SURJ f s t ==> (!x. x IN t ==> (f(g x) = x)) RINV_DEF = |- !f s t. SURJ f s t ==> (!x. x IN t ==> (f(RINV f s x) = x)) card_rel_def = "(!s. R s 0 = (s = {})) /\ (!s n. R s(SUC n) = (?x. x IN s /\ R(s DELETE x)n))" : term Theorem num_Axiom autoloading from theory `prim_rec` ... num_Axiom = |- !e f. ?! fn. (fn 0 = e) /\ (!n. fn(SUC n) = f(fn n)n) CARD_REL_EXISTS = |- ?R. (!s. R s 0 = (s = {})) /\ (!s n. R s(SUC n) = (?x. x IN s /\ R(s DELETE x)n)) CARD_REL_DEL_LEMMA = .. |- !n s x. x IN s ==> R(s DELETE x)n ==> (!y. y IN s ==> R(s DELETE y)n) Theorem INV_SUC_EQ autoloading from theory `prim_rec` ... INV_SUC_EQ = |- !m n. (SUC m = SUC n) = (m = n) Theorem NOT_SUC autoloading from theory `num` ... NOT_SUC = |- !n. ~(SUC n = 0) CARD_REL_UNIQUE = .. |- !n s. R s n ==> (!m. R s m ==> (n = m)) CARD_REL_EXISTS_LEMMA = .. |- !s. ?n. R s n CARD_REL_THM = .. |- !m s. ((@n. R s n) = m) = R s m CARD_EXISTS = |- ?CARD. (CARD{} = 0) /\ (!s x. CARD(x INSERT s) = (x IN s => CARD s | SUC(CARD s))) CARD_DEF = |- (CARD{} = 0) /\ (!s x. CARD(x INSERT s) = (x IN s => CARD s | SUC(CARD s))) CARD_EMPTY = |- CARD{} = 0 CARD_INSERT = |- !s x. CARD(x INSERT s) = (x IN s => CARD s | SUC(CARD s)) CARD_EQ_0 = |- !s. (CARD s = 0) = (s = {}) Theorem num_CASES autoloading from theory `arithmetic` ... num_CASES = |- !m. (m = 0) \/ (?n. m = SUC n) Theorem SUC_SUB1 autoloading from theory `arithmetic` ... SUC_SUB1 = |- !m. (SUC m) - 1 = m CARD_DELETE = |- !s x. CARD(s DELETE x) = (x IN s => (CARD s) - 1 | CARD s) Theorem LESS_MONO_EQ autoloading from theory `arithmetic` ... LESS_MONO_EQ = |- !m n. (SUC m) < (SUC n) = m < n Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) lemma1 = |- !n m. (SUC n) <= (SUC m) = n <= m Theorem LESS_THM autoloading from theory `prim_rec` ... LESS_THM = |- !m n. m < (SUC n) = (m = n) \/ m < n lemma2 = |- !n m. n <= (SUC m) = n <= m \/ (n = SUC m) Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m <= m CARD_INTER_LESS_EQ = |- !s t. (CARD(s INTER t)) <= (CARD s) Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) CARD_UNION = |- !s t. (CARD(s UNION t)) + (CARD(s INTER t)) = (CARD s) + (CARD t) lemma = |- !n m. n <= (SUC m) = n <= m \/ (n = SUC m) Theorem LESS_0 autoloading from theory `prim_rec` ... LESS_0 = |- !n. 0 < (SUC n) CARD_SUBSET = |- !s t. t SUBSET s ==> (CARD t) <= (CARD s) Theorem LESS_EQ autoloading from theory `arithmetic` ... LESS_EQ = |- !m n. m < n = (SUC m) <= n CARD_PSUBSET = |- !s t. t PSUBSET s ==> (CARD t) < (CARD s) CARD_SING = |- !x. CARD{x} = 1 SING_IFF_CARD1 = |- !s. SING s = (CARD s = 1) Theorem SUB_PLUS autoloading from theory `arithmetic` ... SUB_PLUS = |- !a b c. a - (b + c) = (a - b) - c Theorem SUB_0 autoloading from theory `arithmetic` ... SUB_0 = |- !m. (0 - m = 0) /\ (m - 0 = m) CARD_DIFF = |- !t s. CARD(s DIFF t) = (CARD s) - (CARD(s INTER t)) Theorem SUB_LESS_0 autoloading from theory `arithmetic` ... SUB_LESS_0 = |- !n m. m < n = 0 < (n - m) LESS_CARD_DIFF = |- !t s. (CARD t) < (CARD s) ==> 0 < (CARD(s DIFF t)) echo 'set_flag(`abort_when_fail`,true);;'\ 'load_theory `finite_sets`;;'\ 'compilet `set_ind`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory finite_sets loaded () : void SET_INDUCT_TAC = - : tactic Calling Lisp compiler File set_ind compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'load_theory `finite_sets`;;'\ 'compilet `fset_conv`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory finite_sets loaded () : void IN_CONV = - : (conv -> conv) DELETE_CONV = - : (conv -> conv) UNION_CONV = - : (conv -> conv) INSERT_CONV = - : (conv -> conv) IMAGE_CONV = - : (conv -> conv -> conv) Calling Lisp compiler File fset_conv compiled () : void #===> library finite_sets rebuilt make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan' rm -f res_quan.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `mk_res_quan`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void RESQ_FORALL = |- !P B. RES_FORALL P B = (!x. P x ==> B x) RESQ_EXISTS = |- !P B. RES_EXISTS P B = (?x. P x /\ B x) RESQ_SELECT = |- !P B. RES_SELECT P B = (@x. P x /\ B x) RESQ_ABSTRACT = |- !P B. RES_ABSTRACT P B = (\x. (P x => B x | ARB)) RESQ_FORALL_CONJ_DIST = |- !P Q R. (!i :: P. Q i /\ R i) = (!i :: P. Q i) /\ (!i :: P. R i) RESQ_FORALL_DISJ_DIST = |- !P Q R. (!i :: \i. P i \/ Q i. R i) = (!i :: P. R i) /\ (!i :: Q. R i) RESQ_FORALL_UNIQUE = |- !P j. (!i :: $= j. P i) = P j RESQ_FORALL_FORALL = |- !P R x. (!x. !i :: P. R i x) = (!i :: P. !x. R i x) RESQ_FORALL_REORDER = |- !P Q R. (!i :: P. !j :: Q. R i j) = (!j :: Q. !i :: P. R i j) RESQ_EXISTS_DISJ_DIST = |- !P Q R. (?i :: P. Q i \/ R i) = (?i :: P. Q i) \/ (?i :: P. R i) RESQ_DISJ_EXISTS_DIST = |- !P Q R. (?i :: \i. P i \/ Q i. R i) = (?i :: P. R i) \/ (?i :: Q. R i) RESQ_EXISTS_UNIQUE = |- !P j. (?i :: $= j. P i) = P j RESQ_EXISTS_REORDER = |- !P Q R. (?i :: P. ?j :: Q. R i j) = (?j :: Q. ?i :: P. R i j) () : void File mk_res_quan loaded () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `cond_rewr`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool match_aa = - : (term -> term -> ((term # term) list # (type # type) list) list) match_ok = - : (* list -> ((** # *) list # *** list) list -> bool) match_aal = - : (term list -> term -> term list -> ((term # term) list # term) list) subset = - : (* list -> * list -> bool) match_asm = - : (term list -> term list -> ((term # term) list # term list) -> term list -> ((term # term) list # term list)) var_cap = - : (thm -> term list -> term list -> term list -> (term list # thm)) MATCH_SUBS1 = - : (thm -> term list -> term list -> ((term # term) list # (type # type) list) -> (term list # thm)) MATCH_SUBS = - : (thm -> term list -> term list -> ((term # term) list # (type # type) list) list -> (term list # thm list)) COND_REWR_TAC = - : ((term -> term -> ((term # term) list # (type # type) list) list) -> thm_tactic) - : ((term -> term -> ((term # term) list # (type # type) list) list) -> thm_tactic) COND_REWR_TAC = - : ((term -> term -> ((term # term) list # (type # type) list) list) -> thm_tactic) search_top_down = - : (term -> term -> ((term # term) list # (type # type) list) list) COND_REWR_CANON = - : (thm -> thm) COND_REWRITE1_TAC = - : thm_tactic COND_REWR_CONV = - : ((term -> term -> ((term # term) list # (type # type) list) list) -> thm -> conv) COND_REWRITE1_CONV = - : (thm list -> thm -> conv) Calling Lisp compiler File cond_rewr compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'load_theory `res_quan`;;'\ 'loadf `cond_rewr`;;'\ 'compilet `res_rules`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory res_quan loaded () : void ................() : void rtheory = `res_quan` : string mk_resq_forall = - : ((term # term # term) -> term) mk_resq_exists = - : ((term # term # term) -> term) mk_resq_select = - : ((term # term # term) -> term) mk_resq_abstract = - : ((term # term # term) -> term) list_mk_resq_forall = - : (((term # term) list # term) -> term) list_mk_resq_exists = - : (((term # term) list # term) -> term) dest_resq_forall = - : (term -> (term # term # term)) dest_resq_exists = - : (term -> (term # term # term)) dest_resq_select = - : (term -> (term # term # term)) dest_resq_abstract = - : (term -> (term # term # term)) strip_resq_forall = - : (term -> ((term # term) list # term)) strip_resq_exists = - : (term -> ((term # term) list # term)) is_resq_forall = - : (term -> bool) is_resq_exists = - : (term -> bool) is_resq_select = - : (term -> bool) is_resq_abstract = - : (term -> bool) RESQ_SPEC = - : (term -> thm -> thm) RESQ_SPECL = - : (term list -> thm -> thm) RESQ_SPEC_ALL = - : (thm -> thm) GQSPEC = - : (term -> thm -> thm) GQSPECL = - : (term list -> thm -> thm) GQSPEC_ALL = - : (thm -> thm) RESQ_HALF_SPEC = - : (thm -> thm) RESQ_HALF_EXISTS = - : (thm -> thm) RESQ_GEN = - : ((term # term) -> thm -> thm) RESQ_GENL = - : ((term # term) list -> thm -> thm) RESQ_GEN_ALL = - : (thm -> thm) RESQ_MATCH_MP = - : (thm -> thm -> thm) RESQ_HALF_GEN_TAC = - : tactic RESQ_GEN_TAC = - : tactic GGEN_TAC = - : tactic RESQ_EXISTS_TAC = - : (term -> tactic) MATCH_MP = - : (thm -> thm -> thm) check = - : (string -> * list -> * list) check_res = - : (thm -> thm) RESQ_IMP_RES_THEN = - : thm_tactical RESQ_RES_THEN = - : (thm_tactic -> tactic) ((-), -) : (thm_tactical # (thm_tactic -> tactic)) RESQ_IMP_RES_THEN = - : thm_tactical RESQ_RES_THEN = - : (thm_tactic -> tactic) RESQ_IMP_RES_TAC = - : thm_tactic RESQ_RES_TAC = - : tactic LHS_CONV = - : (conv -> conv) RHS_CONV = - : (conv -> conv) BOTH_CONV = - : (conv -> conv) LEFT_THENC_RIGHT = - : (conv -> conv -> conv) RF_BODY_CONV = - : (conv -> conv) RF_PRED_CONV = - : (conv -> conv) RF_CONV = - : (conv -> conv) PRED_THENC_BODY = - : (conv -> conv -> conv) RESQ_FORALL_CONV = - : conv LIST_RESQ_FORALL_CONV = - : conv IMP_RESQ_FORALL_CONV = - : conv RESQ_FORALL_AND_CONV = - : conv AND_RESQ_FORALL_CONV = - : conv RESQ_FORALL_SWAP_CONV = - : conv RESQ_EXISTS_CONV = - : conv RESQ_REWR_CANON = - : (thm -> thm) RESQ_REWRITE1_TAC = - : thm_tactic RESQ_REWRITE1_CONV = - : (thm list -> thm -> conv) check_varstruct = - : (term -> term list) check_lhs = - : (term -> term list) get_type = - : (term -> type -> type) RESQ_DEF_EXISTS_RULE = - : conv new_gen_resq_definition = - : (string -> (string # term) -> thm) new_resq_definition = - : ((string # term) -> thm) new_infix_resq_definition = - : ((string # term) -> thm) new_binder_resq_definition = - : ((string # term) -> thm) ((-), (-), -) : (((string # term) -> thm) # ((string # term) -> thm) # ((string # term) -> thm)) new_resq_definition = - : ((string # term) -> thm) new_infix_resq_definition = - : ((string # term) -> thm) new_binder_resq_definition = - : ((string # term) -> thm) Calling Lisp compiler File res_rules compiled () : void #===> library res_quan rebuilt make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder' \ echo 'set_flag(`abort_when_fail`,true);;' \ 'loadt `mk_wellorder`;;' \ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool false : bool () : void false : bool Run time: 0.0s ty = ":* # * -> bool" : type Run time: 0.0s set_wo_map = - : (void -> void) unset_wo_map = - : (void -> void) Run time: 0.0s TAUT_CONV = - : conv Run time: 0.0s GEN_PAIR_TAC = - : tactic Run time: 0.0s PBETA_TAC = - : tactic Run time: 0.0s ABBREV_TAC = - : (term -> tactic) Run time: 0.0s EXPAND_TAC = - : (string -> tactic) Run time: 0.0s ANTE_RES_THEN = - : thm_tactical Run time: 0.0s IMP_RES_THEN = - : thm_tactical Run time: 0.0s LAND_CONV = - : (conv -> conv) Run time: 0.0s less = |- !l x y. wo_less l(x,y) = l(x,y) /\ ~(x = y) Run time: 0.0s Intermediate theorems generated: 2 subset = |- !P Q. P wo_subset Q = (!x. P x ==> Q x) Run time: 0.0s Intermediate theorems generated: 2 Union = |- !P. wo_Union P = (\x. ?p. P p /\ p x) Run time: 0.0s Intermediate theorems generated: 2 fl = |- !l x. wo_fl l x = (?y. l(x,y) \/ l(y,x)) Run time: 0.0s Intermediate theorems generated: 2 poset = |- !l. wo_poset l = (!x. wo_fl l x ==> l(x,x)) /\ (!x y z. l(x,y) /\ l(y,z) ==> l(x,z)) /\ (!x y. l(x,y) /\ l(y,x) ==> (x = y)) Run time: 0.0s Intermediate theorems generated: 2 chain = |- !l P. wo_chain l P = (!x y. P x /\ P y ==> l(x,y) \/ l(y,x)) Run time: 0.0s Intermediate theorems generated: 2 woset = |- !l. wo_woset l = (!x. wo_fl l x ==> l(x,x)) /\ (!x y z. l(x,y) /\ l(y,z) ==> l(x,z)) /\ (!x y. l(x,y) /\ l(y,x) ==> (x = y)) /\ (!x y. wo_fl l x /\ wo_fl l y ==> l(x,y) \/ l(y,x)) /\ (!P. (!x. P x ==> wo_fl l x) /\ (?x. P x) ==> (?y. P y /\ (!z. P z ==> l(y,z)))) Run time: 0.0s Intermediate theorems generated: 2 inseg = |- !l m. l wo_inseg m = (!x y. l(x,y) = m(x,y) /\ wo_fl l y) Run time: 0.0s Intermediate theorems generated: 2 linseg = |- !l a. wo_linseg l a = (\(x,y). l(x,y) /\ wo_less l(y,a)) Run time: 0.0s Intermediate theorems generated: 2 ordinal = |- !l. wo_ordinal l = wo_woset l /\ (!x. wo_fl l x ==> (x = (@y. ~wo_less l(y,x)))) Run time: 0.0s Intermediate theorems generated: 2 () : void Run time: 0.0s SUBSET_REFL = |- !P. P subset P Run time: 0.0s Intermediate theorems generated: 22 SUBSET_ANTISYM = |- !P Q. P subset Q /\ Q subset P ==> (P = Q) Run time: 0.0s Intermediate theorems generated: 100 SUBSET_TRANS = |- !P Q R. P subset Q /\ Q subset R ==> P subset R Run time: 0.0s Intermediate theorems generated: 121 POSET_REFL = |- !l. poset l ==> (!x. fl l x ==> l(x,x)) POSET_TRANS = |- !l. poset l ==> (!x y z. l(x,y) /\ l(y,z) ==> l(x,z)) POSET_ANTISYM = |- !l. poset l ==> (!x y. l(x,y) /\ l(y,x) ==> (x = y)) Run time: 0.0s Intermediate theorems generated: 16 POSET_FLEQ = |- !l. poset l ==> (!x. fl l x = l(x,x)) Run time: 0.0s Intermediate theorems generated: 34 CHAIN_SUBSET = |- !l P Q. chain l P /\ Q subset P ==> chain l Q Run time: 0.0s Intermediate theorems generated: 90 WOSET_REFL = |- !l. woset l ==> (!x. fl l x ==> l(x,x)) WOSET_TRANS = |- !l. woset l ==> (!x y z. l(x,y) /\ l(y,z) ==> l(x,z)) WOSET_ANTISYM = |- !l. woset l ==> (!x y. l(x,y) /\ l(y,x) ==> (x = y)) WOSET_TOTAL = |- !l. woset l ==> (!x y. fl l x /\ fl l y ==> l(x,y) \/ l(y,x)) WOSET_WELL = |- !l. woset l ==> (!P. (!x. P x ==> fl l x) /\ (?x. P x) ==> (?y. P y /\ (!z. P z ==> l(y,z)))) Run time: 0.0s Intermediate theorems generated: 24 WOSET_POSET = |- !l. woset l ==> poset l Run time: 0.0s Intermediate theorems generated: 98 WOSET_FLEQ = |- !l. woset l ==> (!x. fl l x = l(x,x)) Run time: 0.0s Intermediate theorems generated: 8 WOSET_TRANS_LESS = |- !l. woset l ==> (!x y z. less l(x,y) /\ l(y,z) ==> less l(x,z)) Run time: 0.0s Intermediate theorems generated: 144 WOSET = |- !l. woset l = (!x y. l(x,y) /\ l(y,x) ==> (x = y)) /\ (!P. (!x. P x ==> fl l x) /\ (?x. P x) ==> (?y. P y /\ (!z. P z ==> l(y,z)))) Run time: 0.1s Intermediate theorems generated: 1294 PAIRED_EXT = |- !l m. (!x y. l(x,y) = m(x,y)) = (l = m) Run time: 0.0s Intermediate theorems generated: 63 WOSET_REFL = |- !l. woset l ==> (!x. fl l x ==> l(x,x)) WOSET_TRANS = |- !l. woset l ==> (!x y z. l(x,y) /\ l(y,z) ==> l(x,z)) WOSET_ANTISYM = |- !l. woset l ==> (!x y. l(x,y) /\ l(y,x) ==> (x = y)) WOSET_TOTAL = |- !l. woset l ==> (!x y. fl l x /\ fl l y ==> l(x,y) \/ l(y,x)) WOSET_WELL = |- !l. woset l ==> (!P. (!x. P x ==> fl l x) /\ (?x. P x) ==> (?y. P y /\ (!z. P z ==> l(y,z)))) Run time: 0.0s Intermediate theorems generated: 24 WOSET_TRANS_LE = |- !l. woset l ==> (!x y z. l(x,y) /\ less l(y,z) ==> less l(x,z)) Run time: 0.0s Intermediate theorems generated: 143 WOSET_WELL_CONTRAPOS = |- !l. woset l ==> (!P. (!x. P x ==> fl l x) /\ (?x. P x) ==> (?y. P y /\ (!z. less l(z,y) ==> ~P z))) Run time: 0.0s Intermediate theorems generated: 109 WOSET_TOTAL_LE = |- !l. woset l ==> (!x y. fl l x /\ fl l y ==> l(x,y) \/ less l(y,x)) Run time: 0.0s Intermediate theorems generated: 138 WOSET_TOTAL_LT = |- !l. woset l ==> (!x y. fl l x /\ fl l y ==> (x = y) \/ less l(x,y) \/ less l(y,x)) Run time: 0.0s Intermediate theorems generated: 172 WO_INDUCT = |- !P l. woset l /\ (!x. fl l x /\ (!y. less l(y,x) ==> P y) ==> P x) ==> (!x. fl l x ==> P x) Run time: 0.0s Intermediate theorems generated: 469 WO_INDUCT_TAC = - : tactic Run time: 0.0s Intermediate theorems generated: 2 AGREE_LEMMA = |- !l h ms m n f g z. woset l /\ (!x. fl l(ms x)) /\ (!f f' x. (!y. less l(ms y,ms x) ==> (f y = f' y)) ==> (h f x = h f' x)) /\ (!x. l(ms x,m) ==> (f x = h f x)) /\ (!x. l(ms x,n) ==> (g x = h g x)) /\ l(ms z,m) /\ l(ms z,n) ==> (f z = g z) Run time: 0.0s Intermediate theorems generated: 1165 WO_RECURSE_LOCAL = |- !l h ms. woset l /\ (!x. fl l(ms x)) /\ (!f f' x. (!y. less l(ms y,ms x) ==> (f y = f' y)) ==> (h f x = h f' x)) ==> (!n. ?f. !x. l(ms x,n) ==> (f x = h f x)) Run time: 0.1s Intermediate theorems generated: 1556 WO_RECURSE_EXISTS = |- !l h ms. woset l /\ (!x. fl l(ms x)) /\ (!f f' x. (!y. less l(ms y,ms x) ==> (f y = f' y)) ==> (h f x = h f' x)) ==> (?f. !x. f x = h f x) Run time: 0.0s Intermediate theorems generated: 444 WO_RECURSE = |- !l h ms. woset l /\ (!x. fl l(ms x)) /\ (!f g x. (!y. less l(ms y,ms x) ==> (f y = g y)) ==> (h f x = h g x)) ==> (?! f. !x. f x = h f x) Run time: 0.0s Intermediate theorems generated: 280 Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m <= m Run time: 0.0s FL_NUM = |- !n. fl(\(m,n). m <= n)n Run time: 0.0s Intermediate theorems generated: 39 Theorem WOP autoloading from theory `arithmetic` ... WOP = |- !P. (?n. P n) ==> (?n. P n /\ (!m. m < n ==> ~P m)) Run time: 0.0s Theorem NOT_LESS_EQUAL autoloading from theory `arithmetic` ... NOT_LESS_EQUAL = |- !m n. ~m <= n = n < m Run time: 0.0s Theorem LESS_EQUAL_ANTISYM autoloading from theory `arithmetic` ... LESS_EQUAL_ANTISYM = |- !n m. n <= m /\ m <= n ==> (n = m) Run time: 0.0s WOSET_NUM = |- woset(\(m,n). m <= n) Run time: 0.0s Intermediate theorems generated: 148 Theorem LESS_NOT_EQ autoloading from theory `prim_rec` ... LESS_NOT_EQ = |- !m n. m < n ==> ~(m = n) Run time: 0.0s Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) Run time: 0.0s Intermediate theorems generated: 1 WO_RECURSE_NUM = |- !h ms. (!f g x. (!y. (ms y) < (ms x) ==> (f y = g y)) ==> (h f x = h g x)) ==> (?! f. !x. f x = h f x) Run time: 0.0s Intermediate theorems generated: 259 UNION_FL = |- !P l. fl(Union P)x = (?l. P l /\ fl l x) Run time: 0.0s Intermediate theorems generated: 170 UNION_INSEG = |- !P l. (!m. P m ==> m inseg l) ==> (Union P) inseg l Run time: 0.0s Intermediate theorems generated: 232 INSEG_SUBSET = |- !l m. m inseg l ==> (!x y. m(x,y) ==> l(x,y)) Run time: 0.0s Intermediate theorems generated: 68 INSEG_SUBSET_FL = |- !l m. m inseg l ==> (!x. fl m x ==> fl l x) Run time: 0.1s Intermediate theorems generated: 187 INSEG_WOSET = |- !l m. m inseg l /\ woset l ==> woset m Run time: 0.0s Intermediate theorems generated: 401 LINSEG_INSEG = |- !l a. woset l ==> (linseg l a) inseg l Run time: 0.0s Intermediate theorems generated: 240 LINSEG_WOSET = |- !l a. woset l ==> woset(linseg l a) Run time: 0.0s Intermediate theorems generated: 39 LINSEG_FL = |- !l a x. woset l ==> (fl(linseg l a)x = less l(x,a)) Run time: 0.0s Intermediate theorems generated: 142 INSEG_PROPER_SUBSET = |- !l m. m inseg l /\ ~(l = m) ==> (?x y. l(x,y) /\ ~m(x,y)) Run time: 0.0s Intermediate theorems generated: 213 INSEG_PROPER_SUBSET_FL = |- !l m. m inseg l /\ ~(l = m) ==> (?a. fl l a /\ ~fl m a) Run time: 0.0s Intermediate theorems generated: 107 INSEG_LINSEG = |- !l m. woset l ==> (m inseg l = (m = l) \/ (?a. fl l a /\ (m = linseg l a))) Run time: 0.0s Intermediate theorems generated: 1172 EXTEND_FL = |- !l x. woset l ==> (fl(\(x,y). l(x,y) /\ l(y,a))x = l(x,a)) Run time: 0.0s Intermediate theorems generated: 143 EXTEND_INSEG = |- !l a. woset l /\ fl l a ==> (\(x,y). l(x,y) /\ l(y,a)) inseg l Run time: 0.0s Intermediate theorems generated: 57 EXTEND_LINSEG = |- !l a. woset l /\ fl l a ==> (\(x,y). linseg l a(x,y) \/ (y = a) /\ (fl(linseg l a)x \/ (x = a))) inseg l Run time: 0.1s Intermediate theorems generated: 489 ORDINAL_CHAINED = |- !l m. ordinal l /\ ordinal m ==> m inseg l \/ l inseg m Run time: 0.0s Intermediate theorems generated: 997 FL_SUC = |- !l a. fl(\(x,y). l(x,y) \/ (y = a) /\ (fl l x \/ (x = a)))x = fl l x \/ (x = a) Run time: 0.0s Intermediate theorems generated: 659 ORDINAL_SUC = |- !l. ordinal l /\ (?x. ~fl l x) ==> ordinal (\(x,y). l(x,y) \/ (y = (@y. ~fl l y)) /\ (fl l x \/ (x = (@y. ~fl l y)))) Run time: 0.1s Intermediate theorems generated: 2338 ORDINAL_UNION = |- !P. (!l. P l ==> ordinal l) ==> ordinal(Union P) Run time: 0.0s Intermediate theorems generated: 2015 ORDINAL_UNION_LEMMA = |- !l x. ordinal l ==> fl l x ==> fl(Union ordinal)x Run time: 0.0s Intermediate theorems generated: 30 ORDINAL_UP = |- !l. ordinal l ==> (!x. fl l x) \/ (?m x. ordinal m /\ fl m x /\ ~fl l x) Run time: 0.0s Intermediate theorems generated: 154 WO_LEMMA = |- ?l. ordinal l /\ (!x. fl l x) Run time: 0.0s Intermediate theorems generated: 135 WO_FL_RESTRICT = |- !l. woset l ==> (!P. fl(\(x,y). P x /\ P y /\ l(x,y))x = P x /\ fl l x) Run time: 0.0s Intermediate theorems generated: 392 WO = |- !P. ?l. woset l /\ (fl l = P) Run time: 0.0s Intermediate theorems generated: 403 HP = |- !l. poset l ==> (?P. chain l P /\ (!Q. chain l Q /\ P subset Q ==> (Q = P))) Run time: 0.1s Intermediate theorems generated: 2506 ZL = |- !l. poset l /\ (!P. chain l P ==> (?y. fl l y /\ (!x. P x ==> l(x,y)))) ==> (?y. fl l y /\ (!x. l(y,x) ==> (y = x))) Run time: 0.0s Intermediate theorems generated: 795 kl_tm = "\(c1,c2). C subset c1 /\ c1 subset c2 /\ chain l c2" : term Run time: 0.0s KL_POSET_LEMMA = |- poset(\(c1,c2). C subset c1 /\ c1 subset c2 /\ chain l c2) Run time: 0.0s Intermediate theorems generated: 386 KL = |- !l. poset l ==> (!C. chain l C ==> (?P. (chain l P /\ C subset P) /\ (!R. chain l R /\ P subset R ==> (R = P)))) Run time: 0.1s Intermediate theorems generated: 1083 () : void Run time: 0.0s Intermediate theorems generated: 1 File mk_wellorder loaded () : void Run time: 0.7s Intermediate theorems generated: 22538 #make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory' Making ../../Library/abs_theory/monoid_def.th... =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool true : bool false : bool false : bool Run time: 0.0s () : void Run time: 0.0s true : bool Run time: 0.0s .loading abs_theory .Extending help search path......................................() : void Run time: 0.0s SYM_RULE = - : (thm -> thm) Run time: 0.0srm: cannot remove 'monoid_def.th': No such file or directory 1 : int Run time: 0.0s () : void Run time: 0.0s Intermediate theorems generated: 1 MONOID = |- !f. ?! fn. !f' x. fn(monoid f' x) = f f' x Run time: 0.0s Intermediate theorems generated: 431 () : void Run time: 0.0s Intermediate theorems generated: 2 "!f. (!a. (op m a f = a) /\ (op m f a = a)) ==> (f = e m)" 3 ["!x y z. op m x(op m y z) = op m(op m x y)z" ] 2 ["!x. op m(e m)x = x" ] 1 ["!x. op m x(e m) = x" ] () : void Run time: 0.0s Intermediate theorems generated: 1 OK.. "f = e m" 4 ["!x y z. op m x(op m y z) = op m(op m x y)z" ] 3 ["!x. op m(e m)x = x" ] 2 ["!x. op m x(e m) = x" ] 1 ["!a. (op m a f = a) /\ (op m f a = a)" ] () : void Run time: 0.0s Intermediate theorems generated: 6 OK.. "f = e m" 5 ["!x y z. op m x(op m y z) = op m(op m x y)z" ] 4 ["!x. op m(e m)x = x" ] 3 ["!x. op m x(e m) = x" ] 2 ["!a. (op m a f = a) /\ (op m f a = a)" ] 1 ["e m = op m(e m)f" ] () : void Run time: 0.0s Intermediate theorems generated: 10 OK.. "f = op m(e m)f" 5 ["!x y z. op m x(op m y z) = op m(op m x y)z" ] 4 ["!x. op m(e m)x = x" ] 3 ["!x. op m x(e m) = x" ] 2 ["!a. (op m a f = a) /\ (op m f a = a)" ] 1 ["e m = op m(e m)f" ] () : void Run time: 0.0s Intermediate theorems generated: 4 OK.. goal proved . |- f = op m(e m)f .. |- f = e m .. |- f = e m . |- !f. (!a. (op m a f = a) /\ (op m f a = a)) ==> (f = e m) Previous subproof: goal proved () : void Run time: 0.0s Intermediate theorems generated: 43 IDENTITY_UNIQUE = . |- !f. (!a. (op m a f = a) /\ (op m f a = a)) ==> (f = e m) Run time: 0.0s Intermediate theorems generated: 36 . |- !f. (!a. (op m a f = a) /\ (op m f a = a)) ==> (f = e m) Run time: 0.0s Intermediate theorems generated: 2 OP_DETERMINES_IDENTITY = .. |- (op m1 = op m2) ==> (e m1 = e m2) Run time: 0.0s Intermediate theorems generated: 73 .. |- (op m1 = op m2) ==> (e m1 = e m2) Run time: 0.0s Intermediate theorems generated: 4 () : void Run time: 0.0s Intermediate theorems generated: 1 File ../../Library/abs_theory/monoid_def.ml loaded () : void Run time: 0.0s Intermediate theorems generated: 614 Making ../../Library/abs_theory/group_def.th... =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool true : bool false : bool false : bool Run time: 0.0s () : void Run time: 0.0s true : bool Run time: 0.0s .loading abs_theory .Extending help search path......................................() : void Run time: 0.0s SYM_RULE = - : (thm -> thm) Run time: 0.0srm: cannot remove 'group_def.th': No such file or directory 1 : int Run time: 0.0s () : void Run time: 0.0s Intermediate theorems generated: 1 Theory monoid_def loaded () : void Run time: 0.0s Intermediate theorems generated: 6 GROUP = |- !f. ?! fn. !f0 x f1. fn(group f0 x f1) = f f0 x f1 Run time: 0.0s Intermediate theorems generated: 601 () : void Run time: 0.0s Intermediate theorems generated: 2 GROUP_EXTENDS_MONOID = ... |- IS_MONOID(monoid(fn g)(id g)) Run time: 0.0s Intermediate theorems generated: 144 IDENTITY_UNIQUE = ... |- !f. (!a. (fn g a f = a) /\ (fn g f a = a)) ==> (f = id g) Run time: 0.0s Intermediate theorems generated: 144 ":(*)group" : type Run time: 0.0s Intermediate theorems generated: 3 ... |- !f. (!a. (fn g a f = a) /\ (fn g f a = a)) ==> (f = id g) Run time: 0.0s Intermediate theorems generated: 6 LEFT_CANCELLATION = ... |- !x y a. (fn g a x = fn g a y) ==> (x = y) Run time: 0.0s Intermediate theorems generated: 67 INVERSE_INVERSE_LEMMA = |- !g. IS_GROUP g ==> (!a. inv g(inv g a) = a) Run time: 0.0s Intermediate theorems generated: 45 ALTERNATE_INVERSE_INVERSE_LEMMA = |- !g. IS_GROUP g ==> (!a. inv g(inv g a) = a) Run time: 0.0s Intermediate theorems generated: 69 () : void Run time: 0.0s Intermediate theorems generated: 1 File ../../Library/abs_theory/group_def.ml loaded () : void Run time: 0.0s Intermediate theorems generated: 1089 Making ../../Library/abs_theory/example.th... =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool true : bool false : bool false : bool Run time: 0.0s () : void Run time: 0.0s true : bool Run time: 0.0s .loading abs_theory .Extending help search path......................................() : void Run time: 0.0srm: cannot remove 'example.th': No such file or directory 1 : int Run time: 0.0s () : void Run time: 0.0s Intermediate theorems generated: 1 Loading library taut ... Updating help search path ........................................ Library taut loaded. () : void Run time: 0.0s Intermediate theorems generated: 153 Theory group_def loaded () : void Run time: 0.0s Intermediate theorems generated: 7 Theorem I_THM autoloading from theory `combin` ... I_THM = |- !x. I x = x Run time: 0.0s GROUP_THOBS = |- IS_GROUP(group(\x y. ~(x = y))F I) Run time: 0.0s Intermediate theorems generated: 378 |- !f. (!a. (~(a = f) = a) /\ (~(f = a) = a)) ==> ~f Run time: 0.0s Intermediate theorems generated: 733 |- !x y a. (~(a = x) = ~(a = y)) ==> (x = y) Run time: 0.1s Intermediate theorems generated: 732 |- !a. I(I a) = a Run time: 0.0s Intermediate theorems generated: 1106 concrete_rep = "group(\x y. x = y)T I" : term Run time: 0.0s GROUP_THOBS = |- IS_GROUP(group(\x y. x = y)T I) Run time: 0.0s Intermediate theorems generated: 356 inst_func = - : (string -> thm) Run time: 0.0s [|- !f. (!a. ((a = f) = a) /\ ((f = a) = a)) ==> f; |- !x y a. ((a = x) = (a = y)) ==> (x = y); |- !a. I(I a) = a] : thm list Run time: 0.0s Intermediate theorems generated: 2546 () : void Run time: 0.0s Intermediate theorems generated: 1 File ../../Library/abs_theory/example.ml loaded () : void Run time: 0.1s Intermediate theorems generated: 6013 ===> abs_theory rebuilt on Mon Aug 25 19:28:00 2025 Making abs_theory.ml =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool true : bool false : bool false : bool Run time: 0.0s () : void Run time: 0.0s () : void loading abs_theory () : void Extending help search path() : void int_to_term = - : (int -> term) term_to_int = - : (term -> int) for = - : (int -> * list -> * list) ol = - : ((* -> *) list -> * -> *) X_SPEC = - : (term -> term -> thm -> thm) CONJ_IMP = - : (thm -> thm) abs_type_info = - : (thm -> type) dest_all_type = - : (type -> (string # type list)) string_from_type = - : (type -> string) ty_str = - : (string -> type list -> string) def_prefix = `abs_def_` : string new_abstract_representation = - : (string -> (string # type) list -> thm) get_abs_defs = - : (string -> thm list) instantiate_abstract_definition = - : (string -> string -> thm -> (term # term) list -> thm) thobs = [] : (type # thm) list thobs_prefix = `thobs_` : string new_theory_obligations = - : ((string # term) -> void) get_thobs = - : (string -> (type # thm) list) orelsef = - : ((* -> **) -> (* -> **) -> * -> **) () : void D = - : (((* -> **) # (* -> ***)) -> * -> (** # ***)) () : void make_abs_goal = - : (goal -> goal) prove_abs_thm = - : ((string # term # tactic) -> thm) ABS_TAC_PROOF = - : ((goal # tactic) -> thm) set_abs_goal = - : (goal -> void) g = - : (term -> void) STRIP_THOBS_THEN = - : (thm_tactic -> tactic) STRIP_THOBS_TAC = - : tactic new_abstract_parent = - : (string -> void) EXPAND_THOBS_TAC = - : (string -> tactic) instantiate_abstract_theorem = - : (string -> string -> (term # term) list -> proof) close_theory_orig = - : (void -> void) close_theory = - : (void -> void) new_theory_orig = - : (string -> void) new_theory = - : (string -> void) ((-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), -) : (((goal # tactic) -> thm) # (string -> tactic) # tactic # (thm_tactic -> tactic) # (thm -> type) # (void -> void) # (term -> void) # (string -> string -> thm -> (term # term) list -> thm) # (string -> string -> (term # term) list -> proof) # (string -> void) # (string -> (string # type) list -> thm) # (string -> void) # ((string # term) -> void) # ((string # term # tactic) -> thm) # (goal -> void)) ABS_TAC_PROOF = - : ((goal # tactic) -> thm) EXPAND_THOBS_TAC = - : (string -> tactic) STRIP_THOBS_TAC = - : tactic STRIP_THOBS_THEN = - : (thm_tactic -> tactic) abs_type_info = - : (thm -> type) close_theory = - : (void -> void) g = - : (term -> void) instantiate_abstract_definition = - : (string -> string -> thm -> (term # term) list -> thm) instantiate_abstract_theorem = - : (string -> string -> (term # term) list -> proof) new_abstract_parent = - : (string -> void) new_abstract_representation = - : (string -> (string # type) list -> thm) new_theory = - : (string -> void) new_theory_obligations = - : ((string # term) -> void) prove_abs_thm = - : ((string # term # tactic) -> thm) set_abs_goal = - : (goal -> void) Calling Lisp compiler File abs_theory compiled () : void Run time: 0.3s make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals' cd theories; make all make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/theories' \ echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `hrat.ml`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool false : bool () : void false : bool Run time: 0.0s LAND_CONV = - : (conv -> conv) Run time: 0.0s TAUT_CONV = - : conv Run time: 0.0s AC = - : ((thm # thm) -> conv) Run time: 0.0s GEN_PAIR_TAC = - : tactic Run time: 0.0s MK_COMB_TAC = - : tactic Run time: 0.0s BINOP_TAC = - : tactic Run time: 0.0s SYM_CANON_CONV = - : (thm -> ((term # term) -> bool) -> conv) Run time: 0.0s IMP_SUBST_TAC = - : thm_tactic Run time: 0.0s ABBREV_TAC = - : (term -> tactic) Run time: 0.0s EXT_CONV = - : conv Run time: 0.0s ABS_TAC = - : tactic Run time: 0.0s EQUAL_TAC = - : tactic Run time: 0.0s X_BETA_CONV = - : (term -> conv) Run time: 0.0s EXACT_CONV = - : (thm list -> conv) Run time: 0.0s HABS_CONV = - : conv Run time: 0.0s autoload_definitions = - : (string -> void) Run time: 0.0s autoload_theorems = - : (string -> void) Run time: 0.0s EXPAND_TAC = - : (string -> tactic) Run time: 0.0s File useful loaded () : void Run time: 0.0s define_equivalence_type = - : (string -> thm -> (term # string # bool) list -> thm list -> thm list -> thm list) Run time: 0.0s File equiv loaded () : void Run time: 0.0s Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) Run time: 0.0s Theorem MULT_CLAUSES autoloading from theory `arithmetic` ... MULT_CLAUSES = |- !m n. (0 * m = 0) /\ (m * 0 = 0) /\ (1 * m = m) /\ (m * 1 = m) /\ ((SUC m) * n = (m * n) + n) /\ (m * (SUC n) = m + (m * n)) Run time: 0.0s Theorem PRE autoloading from theory `prim_rec` ... PRE = |- (PRE 0 = 0) /\ (!m. PRE(SUC m) = m) Run time: 0.0s Theorem NOT_SUC autoloading from theory `num` ... NOT_SUC = |- !n. ~(SUC n = 0) Run time: 0.0s Theorem num_CASES autoloading from theory `arithmetic` ... num_CASES = |- !m. (m = 0) \/ (?n. m = SUC n) Run time: 0.0s UNSUCK_TAC = - : tactic Run time: 0.0s Intermediate theorems generated: 336 trat_1 = |- trat_1 = 0,0 Run time: 0.0s Intermediate theorems generated: 2 trat_inv = |- !x y. trat_inv(x,y) = y,x Run time: 0.0s Intermediate theorems generated: 2 trat_add = |- !x y x' y'. (x,y) trat_add (x',y') = PRE(((SUC x) * (SUC y')) + ((SUC x') * (SUC y))), PRE((SUC y) * (SUC y')) Run time: 0.0s Intermediate theorems generated: 2 trat_mul = |- !x y x' y'. (x,y) trat_mul (x',y') = PRE((SUC x) * (SUC x')),PRE((SUC y) * (SUC y')) Run time: 0.0s Intermediate theorems generated: 2 trat_sucint = |- (trat_sucint 0 = trat_1) /\ (!n. trat_sucint(SUC n) = (trat_sucint n) trat_add trat_1) Run time: 0.0s Intermediate theorems generated: 136 trat_eq = |- !x y x' y'. (x,y) trat_eq (x',y') = ((SUC x) * (SUC y') = (SUC x') * (SUC y)) Run time: 0.0s Intermediate theorems generated: 2 TRAT_EQ_REFL = |- !p. p trat_eq p Run time: 0.0s Intermediate theorems generated: 22 TRAT_EQ_SYM = |- !p q. p trat_eq q = q trat_eq p Run time: 0.0s Intermediate theorems generated: 37 Theorem MULT_ASSOC autoloading from theory `arithmetic` ... MULT_ASSOC = |- !m n p. m * (n * p) = (m * n) * p Run time: 0.0s Theorem MULT_SYM autoloading from theory `arithmetic` ... MULT_SYM = |- !m n. m * n = n * m Run time: 0.0s Theorem MULT_SUC_EQ autoloading from theory `arithmetic` ... MULT_SUC_EQ = |- !p m n. (n * (SUC p) = m * (SUC p)) = (n = m) Run time: 0.0s TRAT_EQ_TRANS = |- !p q r. p trat_eq q /\ q trat_eq r ==> p trat_eq r Run time: 0.0s Intermediate theorems generated: 152 TRAT_EQ_AP = |- !p q. (p = q) ==> p trat_eq q Run time: 0.0s Intermediate theorems generated: 8 Theorem ADD_SYM autoloading from theory `arithmetic` ... ADD_SYM = |- !m n. m + n = n + m Run time: 0.0s TRAT_ADD_SYM_EQ = |- !h i. h trat_add i = i trat_add h Run time: 0.0s Intermediate theorems generated: 62 TRAT_MUL_SYM_EQ = |- !h i. h trat_mul i = i trat_mul h Run time: 0.0s Intermediate theorems generated: 58 TRAT_INV_WELLDEFINED = |- !p q. p trat_eq q ==> (trat_inv p) trat_eq (trat_inv q) Run time: 0.0s Intermediate theorems generated: 61 Theorem RIGHT_ADD_DISTRIB autoloading from theory `arithmetic` ... RIGHT_ADD_DISTRIB = |- !m n p. (m + n) * p = (m * p) + (n * p) Run time: 0.0s TRAT_ADD_WELLDEFINED = |- !p q r. p trat_eq q ==> (p trat_add r) trat_eq (q trat_add r) Run time: 0.0s Intermediate theorems generated: 297 TRAT_ADD_WELLDEFINED2 = |- !p1 p2 q1 q2. p1 trat_eq p2 /\ q1 trat_eq q2 ==> (p1 trat_add q1) trat_eq (p2 trat_add q2) Run time: 0.0s Intermediate theorems generated: 65 TRAT_MUL_WELLDEFINED = |- !p q r. p trat_eq q ==> (p trat_mul r) trat_eq (q trat_mul r) Run time: 0.0s Intermediate theorems generated: 207 TRAT_MUL_WELLDEFINED2 = |- !p1 p2 q1 q2. p1 trat_eq p2 /\ q1 trat_eq q2 ==> (p1 trat_mul q1) trat_eq (p2 trat_mul q2) Run time: 0.0s Intermediate theorems generated: 65 TRAT_ADD_SYM = |- !h i. (h trat_add i) trat_eq (i trat_add h) Run time: 0.0s Intermediate theorems generated: 15 Theorem ADD_ASSOC autoloading from theory `arithmetic` ... ADD_ASSOC = |- !m n p. m + (n + p) = (m + n) + p Run time: 0.0s TRAT_ADD_ASSOC = |- !h i j. (h trat_add (i trat_add j)) trat_eq ((h trat_add i) trat_add j) Run time: 0.0s Intermediate theorems generated: 297 TRAT_MUL_SYM = |- !h i. (h trat_mul i) trat_eq (i trat_mul h) Run time: 0.0s Intermediate theorems generated: 15 TRAT_MUL_ASSOC = |- !h i j. (h trat_mul (i trat_mul j)) trat_eq ((h trat_mul i) trat_mul j) Run time: 0.0s Intermediate theorems generated: 189 Theorem LEFT_ADD_DISTRIB autoloading from theory `arithmetic` ... LEFT_ADD_DISTRIB = |- !m n p. p * (m + n) = (p * m) + (p * n) Run time: 0.0s TRAT_LDISTRIB = |- !h i j. (h trat_mul (i trat_add j)) trat_eq ((h trat_mul i) trat_add (h trat_mul j)) Run time: 0.0s Intermediate theorems generated: 611 TRAT_MUL_LID = |- !h. (trat_1 trat_mul h) trat_eq h Run time: 0.0s Intermediate theorems generated: 127 TRAT_MUL_LINV = |- !h. ((trat_inv h) trat_mul h) trat_eq trat_1 Run time: 0.0s Intermediate theorems generated: 136 Theorem ADD_INV_0_EQ autoloading from theory `arithmetic` ... ADD_INV_0_EQ = |- !m n. (m + n = m) = (n = 0) Run time: 0.0s TRAT_NOZERO = |- !h i. ~(h trat_add i) trat_eq h Run time: 0.0s Intermediate theorems generated: 250 Theorem LESS_ADD_1 autoloading from theory `arithmetic` ... LESS_ADD_1 = |- !m n. n < m ==> (?p. m = n + (p + 1)) Run time: 0.0s Theorem ADD1 autoloading from theory `arithmetic` ... ADD1 = |- !m. SUC m = m + 1 Run time: 0.0s Theorem LESS_LESS_CASES autoloading from theory `arithmetic` ... LESS_LESS_CASES = |- !m n. (m = n) \/ m < n \/ n < m Run time: 0.0s TRAT_ADD_TOTAL = |- !h i. h trat_eq i \/ (?d. h trat_eq (i trat_add d)) \/ (?d. i trat_eq (h trat_add d)) Run time: 0.0s Intermediate theorems generated: 599 TRAT_SUCINT_0 = |- !n. (trat_sucint n) trat_eq (n,0) Run time: 0.0s Intermediate theorems generated: 233 Theorem LESS_ADD_NONZERO autoloading from theory `arithmetic` ... LESS_ADD_NONZERO = |- !m n. ~(n = 0) ==> m < (m + n) Run time: 0.0s Theorem LESS_IMP_LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_IMP_LESS_OR_EQ = |- !m n. m < n ==> m <= n Run time: 0.0s Theorem LESS_MONO_MULT autoloading from theory `arithmetic` ... LESS_MONO_MULT = |- !m n p. m <= n ==> (m * p) <= (n * p) Run time: 0.0s Theorem SUB_ADD autoloading from theory `arithmetic` ... SUB_ADD = |- !m n. n <= m ==> ((m - n) + n = m) Run time: 0.0s Theorem RIGHT_SUB_DISTRIB autoloading from theory `arithmetic` ... RIGHT_SUB_DISTRIB = |- !m n p. (m - n) * p = (m * p) - (n * p) Run time: 0.0s Theorem NOT_LESS autoloading from theory `arithmetic` ... NOT_LESS = |- !m n. ~m < n = n <= m Run time: 0.0s Theorem SUB_EQ_0 autoloading from theory `arithmetic` ... SUB_EQ_0 = |- !m n. (m - n = 0) = m <= n Run time: 0.0s TRAT_ARCH = |- !h. ?n d. (trat_sucint n) trat_eq (h trat_add d) Run time: 0.0s Intermediate theorems generated: 395 TRAT_SUCINT = |- (trat_sucint 0) trat_eq trat_1 /\ (!n. (trat_sucint(SUC n)) trat_eq ((trat_sucint n) trat_add trat_1)) Run time: 0.0s Intermediate theorems generated: 37 TRAT_EQ_EQUIV = |- !p q. p trat_eq q = ($trat_eq p = $trat_eq q) Run time: 0.0s Intermediate theorems generated: 73 HRAT_ADD_SYM = |- !h i. h hrat_add i = i hrat_add h HRAT_ADD_ASSOC = |- !h i j. h hrat_add (i hrat_add j) = (h hrat_add i) hrat_add j HRAT_MUL_SYM = |- !h i. h hrat_mul i = i hrat_mul h HRAT_MUL_ASSOC = |- !h i j. h hrat_mul (i hrat_mul j) = (h hrat_mul i) hrat_mul j HRAT_LDISTRIB = |- !h i j. h hrat_mul (i hrat_add j) = (h hrat_mul i) hrat_add (h hrat_mul j) HRAT_MUL_LID = |- !h. hrat_1 hrat_mul h = h HRAT_MUL_LINV = |- !h. (hrat_inv h) hrat_mul h = hrat_1 HRAT_NOZERO = |- !h i. ~(h hrat_add i = h) HRAT_ADD_TOTAL = |- !h i. (h = i) \/ (?d. h = i hrat_add d) \/ (?d. i = h hrat_add d) HRAT_ARCH = |- !h. ?n d. hrat_sucint n = h hrat_add d HRAT_SUCINT = |- (hrat_sucint 0 = hrat_1) /\ (!n. hrat_sucint(SUC n) = (hrat_sucint n) hrat_add hrat_1) Run time: 0.2s Intermediate theorems generated: 6487 HRAT_ADD_SYM = |- !h i. h hrat_add i = i hrat_add h Run time: 0.0s Intermediate theorems generated: 5 HRAT_ADD_ASSOC = |- !h i j. h hrat_add (i hrat_add j) = (h hrat_add i) hrat_add j Run time: 0.0s Intermediate theorems generated: 7 HRAT_MUL_SYM = |- !h i. h hrat_mul i = i hrat_mul h Run time: 0.0s Intermediate theorems generated: 5 HRAT_MUL_ASSOC = |- !h i j. h hrat_mul (i hrat_mul j) = (h hrat_mul i) hrat_mul j Run time: 0.0s Intermediate theorems generated: 7 HRAT_LDISTRIB = |- !h i j. h hrat_mul (i hrat_add j) = (h hrat_mul i) hrat_add (h hrat_mul j) Run time: 0.0s Intermediate theorems generated: 7 HRAT_MUL_LID = |- !h. hrat_1 hrat_mul h = h Run time: 0.0s Intermediate theorems generated: 3 HRAT_MUL_LINV = |- !h. (hrat_inv h) hrat_mul h = hrat_1 Run time: 0.0s Intermediate theorems generated: 3 HRAT_NOZERO = |- !h i. ~(h hrat_add i = h) Run time: 0.0s Intermediate theorems generated: 5 HRAT_ADD_TOTAL = |- !h i. (h = i) \/ (?d. h = i hrat_add d) \/ (?d. i = h hrat_add d) Run time: 0.0s Intermediate theorems generated: 5 HRAT_ARCH = |- !h. ?n d. hrat_sucint n = h hrat_add d Run time: 0.0s Intermediate theorems generated: 3 HRAT_SUCINT = |- (hrat_sucint 0 = hrat_1) /\ (!n. hrat_sucint(SUC n) = (hrat_sucint n) hrat_add hrat_1) Run time: 0.0s () : void Run time: 0.0s Intermediate theorems generated: 1 File hrat.ml loaded () : void Run time: 0.3s Intermediate theorems generated: 11032 #\ echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `hreal.ml`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool false : bool () : void Theory HRAT loaded () : void false : bool Run time: 0.0s LAND_CONV = - : (conv -> conv) Run time: 0.0s TAUT_CONV = - : conv Run time: 0.0s AC = - : ((thm # thm) -> conv) Run time: 0.0s GEN_PAIR_TAC = - : tactic Run time: 0.0s MK_COMB_TAC = - : tactic Run time: 0.0s BINOP_TAC = - : tactic Run time: 0.0s SYM_CANON_CONV = - : (thm -> ((term # term) -> bool) -> conv) Run time: 0.0s IMP_SUBST_TAC = - : thm_tactic Run time: 0.0s ABBREV_TAC = - : (term -> tactic) Run time: 0.0s EXT_CONV = - : conv Run time: 0.0s ABS_TAC = - : tactic Run time: 0.0s EQUAL_TAC = - : tactic Run time: 0.0s X_BETA_CONV = - : (term -> conv) Run time: 0.0s EXACT_CONV = - : (thm list -> conv) Run time: 0.0s HABS_CONV = - : conv Run time: 0.0s autoload_definitions = - : (string -> void) Run time: 0.0s autoload_theorems = - : (string -> void) Run time: 0.0s EXPAND_TAC = - : (string -> tactic) Run time: 0.0s File useful loaded () : void Run time: 0.0s () : void Run time: 0.0s hrat_lt = |- !x y. x hrat_lt y = (?d. y = x hrat_add d) Run time: 0.0s Intermediate theorems generated: 2 Theorem HRAT_NOZERO autoloading from theory `HRAT` ... HRAT_NOZERO = |- !h i. ~(h hrat_add i = h) Run time: 0.0s HRAT_LT_REFL = |- !x. ~x hrat_lt x Run time: 0.0s Intermediate theorems generated: 41 Theorem HRAT_ADD_ASSOC autoloading from theory `HRAT` ... HRAT_ADD_ASSOC = |- !h i j. h hrat_add (i hrat_add j) = (h hrat_add i) hrat_add j Run time: 0.0s HRAT_LT_TRANS = |- !x y z. x hrat_lt y /\ y hrat_lt z ==> x hrat_lt z Run time: 0.0s Intermediate theorems generated: 63 HRAT_LT_ANTISYM = |- !x y. ~(x hrat_lt y /\ y hrat_lt x) Run time: 0.0s Intermediate theorems generated: 24 Theorem HRAT_ADD_TOTAL autoloading from theory `HRAT` ... HRAT_ADD_TOTAL = |- !h i. (h = i) \/ (?d. h = i hrat_add d) \/ (?d. i = h hrat_add d) Run time: 0.0s HRAT_LT_TOTAL = |- !x y. (x = y) \/ x hrat_lt y \/ y hrat_lt x Run time: 0.0s Intermediate theorems generated: 49 Theorem HRAT_MUL_LID autoloading from theory `HRAT` ... HRAT_MUL_LID = |- !h. hrat_1 hrat_mul h = h Run time: 0.0s Theorem HRAT_MUL_SYM autoloading from theory `HRAT` ... HRAT_MUL_SYM = |- !h i. h hrat_mul i = i hrat_mul h Run time: 0.0s HRAT_MUL_RID = |- !x. x hrat_mul hrat_1 = x Run time: 0.0s Intermediate theorems generated: 14 Theorem HRAT_MUL_LINV autoloading from theory `HRAT` ... HRAT_MUL_LINV = |- !h. (hrat_inv h) hrat_mul h = hrat_1 Run time: 0.0s HRAT_MUL_RINV = |- !x. x hrat_mul (hrat_inv x) = hrat_1 Run time: 0.0s Intermediate theorems generated: 14 Theorem HRAT_LDISTRIB autoloading from theory `HRAT` ... HRAT_LDISTRIB = |- !h i j. h hrat_mul (i hrat_add j) = (h hrat_mul i) hrat_add (h hrat_mul j) Run time: 0.0s HRAT_RDISTRIB = |- !x y z. (x hrat_add y) hrat_mul z = (x hrat_mul z) hrat_add (y hrat_mul z) Run time: 0.0s Intermediate theorems generated: 22 HRAT_LT_ADDL = |- !x y. x hrat_lt (x hrat_add y) Run time: 0.0s Intermediate theorems generated: 13 Theorem HRAT_ADD_SYM autoloading from theory `HRAT` ... HRAT_ADD_SYM = |- !h i. h hrat_add i = i hrat_add h Run time: 0.0s HRAT_LT_ADDR = |- !x y. y hrat_lt (x hrat_add y) Run time: 0.0s Intermediate theorems generated: 19 HRAT_LT_GT = |- !x y. x hrat_lt y ==> ~y hrat_lt x Run time: 0.0s Intermediate theorems generated: 78 HRAT_LT_NE = |- !x y. x hrat_lt y ==> ~(x = y) Run time: 0.0s Intermediate theorems generated: 33 HRAT_EQ_LADD = |- !x y z. (x hrat_add y = x hrat_add z) = (y = z) Run time: 0.0s Intermediate theorems generated: 126 Theorem HRAT_MUL_ASSOC autoloading from theory `HRAT` ... HRAT_MUL_ASSOC = |- !h i j. h hrat_mul (i hrat_mul j) = (h hrat_mul i) hrat_mul j Run time: 0.0s HRAT_EQ_LMUL = |- !x y z. (x hrat_mul y = x hrat_mul z) = (y = z) Run time: 0.0s Intermediate theorems generated: 50 HRAT_LT_ADD2 = |- !u v x y. u hrat_lt x /\ v hrat_lt y ==> (u hrat_add v) hrat_lt (x hrat_add y) Run time: 0.0s Intermediate theorems generated: 79 HRAT_LT_LADD = |- !x y z. (z hrat_add x) hrat_lt (z hrat_add y) = x hrat_lt y Run time: 0.0s Intermediate theorems generated: 77 HRAT_LT_RADD = |- !x y z. (x hrat_add z) hrat_lt (y hrat_add z) = x hrat_lt y Run time: 0.0s Intermediate theorems generated: 21 HRAT_LT_MUL2 = |- !u v x y. u hrat_lt x /\ v hrat_lt y ==> (u hrat_mul v) hrat_lt (x hrat_mul y) Run time: 0.0s Intermediate theorems generated: 100 HRAT_LT_LMUL = |- !x y z. (z hrat_mul x) hrat_lt (z hrat_mul y) = x hrat_lt y Run time: 0.0s Intermediate theorems generated: 149 HRAT_LT_RMUL = |- !x y z. (x hrat_mul z) hrat_lt (y hrat_mul z) = x hrat_lt y Run time: 0.0s Intermediate theorems generated: 21 HRAT_LT_LMUL1 = |- !x y. (x hrat_mul y) hrat_lt y = x hrat_lt hrat_1 Run time: 0.0s Intermediate theorems generated: 21 HRAT_LT_RMUL1 = |- !x y. (x hrat_mul y) hrat_lt x = y hrat_lt hrat_1 Run time: 0.0s Intermediate theorems generated: 18 HRAT_GT_LMUL1 = |- !x y. y hrat_lt (x hrat_mul y) = hrat_1 hrat_lt x Run time: 0.0s Intermediate theorems generated: 22 HRAT_LT_L1 = |- !x y. ((hrat_inv x) hrat_mul y) hrat_lt hrat_1 = y hrat_lt x Run time: 0.0s Intermediate theorems generated: 10 HRAT_LT_R1 = |- !x y. (x hrat_mul (hrat_inv y)) hrat_lt hrat_1 = x hrat_lt y Run time: 0.0s Intermediate theorems generated: 10 HRAT_GT_L1 = |- !x y. hrat_1 hrat_lt ((hrat_inv x) hrat_mul y) = x hrat_lt y Run time: 0.0s Intermediate theorems generated: 10 HRAT_INV_MUL = |- !x y. hrat_inv(x hrat_mul y) = (hrat_inv x) hrat_mul (hrat_inv y) Run time: 0.0s Intermediate theorems generated: 85 HRAT_UP = |- !x. ?y. x hrat_lt y Run time: 0.0s Intermediate theorems generated: 13 HRAT_DOWN = |- !x. ?y. y hrat_lt x Run time: 0.0s Intermediate theorems generated: 45 HRAT_DOWN2 = |- !x y. ?z. z hrat_lt x /\ z hrat_lt y Run time: 0.1s Intermediate theorems generated: 154 HRAT_MEAN = |- !x y. x hrat_lt y ==> (?z. x hrat_lt z /\ z hrat_lt y) Run time: 0.0s Intermediate theorems generated: 133 isacut = |- !C. isacut C = (?x. C x) /\ (?x. ~C x) /\ (!x y. C x /\ y hrat_lt x ==> C y) /\ (!x. C x ==> (?y. C y /\ x hrat_lt y)) Run time: 0.0s Intermediate theorems generated: 2 cut_of_hrat = |- !x. cut_of_hrat x = (\y. y hrat_lt x) Run time: 0.0s Intermediate theorems generated: 2 ISACUT_HRAT = |- !h. isacut(cut_of_hrat h) Run time: 0.0s Intermediate theorems generated: 221 hreal_tydef = |- ?rep. TYPE_DEFINITION isacut rep Run time: 0.0s Intermediate theorems generated: 4 hreal_tybij = |- (!a. hreal(cut a) = a) /\ (!r. isacut r = (cut(hreal r) = r)) Run time: 0.0s Intermediate theorems generated: 4 EQUAL_CUTS = |- !X Y. (cut X = cut Y) ==> (X = Y) Run time: 0.0s Intermediate theorems generated: 24 CUT_ISACUT = |- !X. isacut(cut X) Run time: 0.0s Intermediate theorems generated: 26 CUT_PROPERTIES = |- (?x. cut X x) /\ (?x. ~cut X x) /\ (!x y. cut X x /\ y hrat_lt x ==> cut X y) /\ (!x. cut X x ==> (?y. cut X y /\ x hrat_lt y)) Run time: 0.0s Intermediate theorems generated: 3 CUT_NONEMPTY = |- !X. ?x. cut X x Run time: 0.0s Intermediate theorems generated: 37 CUT_BOUNDED = |- !X. ?x. ~cut X x Run time: 0.0s Intermediate theorems generated: 37 CUT_DOWN = |- !X x y. cut X x /\ y hrat_lt x ==> cut X y Run time: 0.0s Intermediate theorems generated: 49 CUT_UP = |- !X x. cut X x ==> (?y. cut X y /\ x hrat_lt y) Run time: 0.0s Intermediate theorems generated: 42 CUT_UBOUND = |- !X x y. ~cut X x /\ x hrat_lt y ==> ~cut X y Run time: 0.0s Intermediate theorems generated: 102 CUT_STRADDLE = |- !X x y. cut X x /\ ~cut X y ==> x hrat_lt y Run time: 0.0s Intermediate theorems generated: 137 Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n < (SUC n) Run time: 0.0s Theorem NOT_LESS_0 autoloading from theory `prim_rec` ... NOT_LESS_0 = |- !n. ~n < 0 Run time: 0.0s Theorem HRAT_SUCINT autoloading from theory `HRAT` ... HRAT_SUCINT = |- (hrat_sucint 0 = hrat_1) /\ (!n. hrat_sucint(SUC n) = (hrat_sucint n) hrat_add hrat_1) Run time: 0.0s Theorem num_CASES autoloading from theory `arithmetic` ... num_CASES = |- !m. (m = 0) \/ (?n. m = SUC n) Run time: 0.0s Theorem HRAT_ARCH autoloading from theory `HRAT` ... HRAT_ARCH = |- !h. ?n d. hrat_sucint n = h hrat_add d Run time: 0.0s CUT_NEARTOP_ADD = |- !X e. ?x. cut X x /\ ~cut X(x hrat_add e) Run time: 0.0s Intermediate theorems generated: 303 CUT_NEARTOP_MUL = |- !X u. hrat_1 hrat_lt u ==> (?x. cut X x /\ ~cut X(u hrat_mul x)) Run time: 0.0s Intermediate theorems generated: 234 hreal_1 = |- hreal_1 = hreal(cut_of_hrat hrat_1) Run time: 0.0s Intermediate theorems generated: 2 hreal_add = |- !X Y. X hreal_add Y = hreal(\w. ?x y. (w = x hrat_add y) /\ cut X x /\ cut Y y) Run time: 0.0s Intermediate theorems generated: 2 hreal_mul = |- !X Y. X hreal_mul Y = hreal(\w. ?x y. (w = x hrat_mul y) /\ cut X x /\ cut Y y) Run time: 0.0s Intermediate theorems generated: 2 hreal_inv = |- !X. hreal_inv X = hreal (\w. ?d. d hrat_lt hrat_1 /\ (!x. cut X x ==> (w hrat_mul x) hrat_lt d)) Run time: 0.0s Intermediate theorems generated: 2 hreal_sup = |- !P. hreal_sup P = hreal(\w. ?X. P X /\ cut X w) Run time: 0.0s Intermediate theorems generated: 2 hreal_lt = |- !X Y. X hreal_lt Y = ~(X = Y) /\ (!x. cut X x ==> cut Y x) Run time: 0.0s Intermediate theorems generated: 2 HREAL_INV_ISACUT = |- !X. isacut (\w. ?d. d hrat_lt hrat_1 /\ (!x. cut X x ==> (w hrat_mul x) hrat_lt d)) Run time: 0.0s Intermediate theorems generated: 502 HREAL_ADD_ISACUT = |- !X Y. isacut(\w. ?x y. (w = x hrat_add y) /\ cut X x /\ cut Y y) Run time: 0.0s Intermediate theorems generated: 521 HREAL_MUL_ISACUT = |- !X Y. isacut(\w. ?x y. (w = x hrat_mul y) /\ cut X x /\ cut Y y) Run time: 0.0s Intermediate theorems generated: 537 HREAL_ADD_SYM = |- !X Y. X hreal_add Y = Y hreal_add X Run time: 0.0s Intermediate theorems generated: 124 HREAL_MUL_SYM = |- !X Y. X hreal_mul Y = Y hreal_mul X Run time: 0.0s Intermediate theorems generated: 124 HREAL_ADD_ASSOC = |- !X Y Z. X hreal_add (Y hreal_add Z) = (X hreal_add Y) hreal_add Z Run time: 0.0s Intermediate theorems generated: 490 HREAL_MUL_ASSOC = |- !X Y Z. X hreal_mul (Y hreal_mul Z) = (X hreal_mul Y) hreal_mul Z Run time: 0.0s Intermediate theorems generated: 490 HREAL_LDISTRIB = |- !X Y Z. X hreal_mul (Y hreal_add Z) = (X hreal_mul Y) hreal_add (X hreal_mul Z) Run time: 0.0s Intermediate theorems generated: 935 HREAL_MUL_LID = |- !X. hreal_1 hreal_mul X = X Run time: 0.1s Intermediate theorems generated: 278 HREAL_MUL_LINV = |- !X. (hreal_inv X) hreal_mul X = hreal_1 Run time: 0.0s Intermediate theorems generated: 485 HREAL_NOZERO = |- !X Y. ~(X hreal_add Y = X) Run time: 0.0s Intermediate theorems generated: 155 hreal_sub = |- !Y X. Y hreal_sub X = hreal(\w. ?x. ~cut X x /\ cut Y(x hrat_add w)) Run time: 0.0s Intermediate theorems generated: 2 HREAL_LT_LEMMA = |- !X Y. X hreal_lt Y ==> (?x. ~cut X x /\ cut Y x) Run time: 0.0s Intermediate theorems generated: 210 HREAL_SUB_ISACUT = |- !X Y. X hreal_lt Y ==> isacut(\w. ?x. ~cut X x /\ cut Y(x hrat_add w)) Run time: 0.0s Intermediate theorems generated: 400 HREAL_SUB_ADD = |- !X Y. X hreal_lt Y ==> ((Y hreal_sub X) hreal_add X = Y) Run time: 0.0s Intermediate theorems generated: 837 HREAL_LT_TOTAL = |- !X Y. (X = Y) \/ X hreal_lt Y \/ Y hreal_lt X Run time: 0.0s Intermediate theorems generated: 492 HREAL_LT = |- !X Y. X hreal_lt Y = (?D. Y = X hreal_add D) Run time: 0.0s Intermediate theorems generated: 196 HREAL_ADD_TOTAL = |- !X Y. (X = Y) \/ (?D. Y = X hreal_add D) \/ (?D. X = Y hreal_add D) Run time: 0.0s Intermediate theorems generated: 19 HREAL_SUP_ISACUT = |- !P. (?X. P X) /\ (?Y. !X. P X ==> X hreal_lt Y) ==> isacut(\w. ?X. P X /\ cut X w) Run time: 0.0s Intermediate theorems generated: 349 HREAL_SUP = |- !P. (?X. P X) /\ (?Y. !X. P X ==> X hreal_lt Y) ==> (!Y. (?X. P X /\ Y hreal_lt X) = Y hreal_lt (hreal_sup P)) Run time: 0.0s Intermediate theorems generated: 553 () : void Run time: 0.1s Intermediate theorems generated: 1 File hreal.ml loaded () : void Run time: 0.4s Intermediate theorems generated: 10456 #\ echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `realax.ml`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool false : bool () : void Theory HREAL loaded () : void false : bool Run time: 0.0s LAND_CONV = - : (conv -> conv) Run time: 0.0s TAUT_CONV = - : conv Run time: 0.0s AC = - : ((thm # thm) -> conv) Run time: 0.0s GEN_PAIR_TAC = - : tactic Run time: 0.0s MK_COMB_TAC = - : tactic Run time: 0.0s BINOP_TAC = - : tactic Run time: 0.0s SYM_CANON_CONV = - : (thm -> ((term # term) -> bool) -> conv) Run time: 0.0s IMP_SUBST_TAC = - : thm_tactic Run time: 0.0s ABBREV_TAC = - : (term -> tactic) Run time: 0.0s EXT_CONV = - : conv Run time: 0.0s ABS_TAC = - : tactic Run time: 0.0s EQUAL_TAC = - : tactic Run time: 0.0s X_BETA_CONV = - : (term -> conv) Run time: 0.0s EXACT_CONV = - : (thm list -> conv) Run time: 0.0s HABS_CONV = - : conv Run time: 0.0s autoload_definitions = - : (string -> void) Run time: 0.0s autoload_theorems = - : (string -> void) Run time: 0.0s EXPAND_TAC = - : (string -> tactic) Run time: 0.0s File useful loaded () : void Run time: 0.0s () : void Run time: 0.0s Intermediate theorems generated: 12 () : void Run time: 0.0s define_equivalence_type = - : (string -> thm -> (term # string # bool) list -> thm list -> thm list -> thm list) Run time: 0.0s File equiv loaded () : void Run time: 0.0s Theorem HREAL_LDISTRIB autoloading from theory `HREAL` ... HREAL_LDISTRIB = |- !X Y Z. X hreal_mul (Y hreal_add Z) = (X hreal_mul Y) hreal_add (X hreal_mul Z) Run time: 0.0s Theorem HREAL_MUL_SYM autoloading from theory `HREAL` ... HREAL_MUL_SYM = |- !X Y. X hreal_mul Y = Y hreal_mul X Run time: 0.0s HREAL_RDISTRIB = |- !x y z. (x hreal_add y) hreal_mul z = (x hreal_mul z) hreal_add (y hreal_mul z) Run time: 0.0s Intermediate theorems generated: 22 Theorem HREAL_NOZERO autoloading from theory `HREAL` ... HREAL_NOZERO = |- !X Y. ~(X hreal_add Y = X) Run time: 0.0s HREAL_EQ_ADDR = |- !x y. ~(x hreal_add y = x) Run time: 0.0s Intermediate theorems generated: 5 HREAL_EQ_ADDL = |- !x y. ~(x = x hreal_add y) Run time: 0.0s Intermediate theorems generated: 11 Theorem HREAL_ADD_ASSOC autoloading from theory `HREAL` ... HREAL_ADD_ASSOC = |- !X Y Z. X hreal_add (Y hreal_add Z) = (X hreal_add Y) hreal_add Z Run time: 0.0s Theorem HREAL_ADD_TOTAL autoloading from theory `HREAL` ... HREAL_ADD_TOTAL = |- !X Y. (X = Y) \/ (?D. Y = X hreal_add D) \/ (?D. X = Y hreal_add D) Run time: 0.0s HREAL_EQ_LADD = |- !x y z. (x hreal_add y = x hreal_add z) = (y = z) Run time: 0.0s Intermediate theorems generated: 94 Theorem HREAL_LT autoloading from theory `HREAL` ... HREAL_LT = |- !X Y. X hreal_lt Y = (?D. Y = X hreal_add D) Run time: 0.0s HREAL_LT_REFL = |- !x. ~x hreal_lt x Run time: 0.0s Intermediate theorems generated: 33 HREAL_LT_ADDL = |- !x y. x hreal_lt (x hreal_add y) Run time: 0.0s Intermediate theorems generated: 13 HREAL_LT_NE = |- !x y. x hreal_lt y ==> ~(x = y) Run time: 0.0s Intermediate theorems generated: 23 HREAL_LT_ADDR = |- !x y. ~(x hreal_add y) hreal_lt x Run time: 0.0s Intermediate theorems generated: 56 HREAL_LT_GT = |- !x y. x hreal_lt y ==> ~y hreal_lt x Run time: 0.0s Intermediate theorems generated: 66 Theorem HREAL_ADD_SYM autoloading from theory `HREAL` ... HREAL_ADD_SYM = |- !X Y. X hreal_add Y = Y hreal_add X Run time: 0.0s HREAL_LT_ADD2 = |- !x1 x2 y1 y2. x1 hreal_lt y1 /\ x2 hreal_lt y2 ==> (x1 hreal_add x2) hreal_lt (y1 hreal_add y2) Run time: 0.0s Intermediate theorems generated: 79 HREAL_LT_LADD = |- !x y z. (x hreal_add y) hreal_lt (x hreal_add z) = y hreal_lt z Run time: 0.0s Intermediate theorems generated: 77 CANCEL_CONV = - : ((thm # thm # thm list) -> conv) Run time: 0.0s CANCEL_TAC = - : tactic Run time: 0.0s Intermediate theorems generated: 106 treal_0 = |- treal_0 = hreal_1,hreal_1 Run time: 0.0s Intermediate theorems generated: 2 treal_1 = |- treal_1 = hreal_1 hreal_add hreal_1,hreal_1 Run time: 0.0s Intermediate theorems generated: 2 treal_neg = |- !x y. treal_neg(x,y) = y,x Run time: 0.0s Intermediate theorems generated: 2 treal_add = |- !x1 y1 x2 y2. (x1,y1) treal_add (x2,y2) = x1 hreal_add x2,y1 hreal_add y2 Run time: 0.0s Intermediate theorems generated: 2 treal_mul = |- !x1 y1 x2 y2. (x1,y1) treal_mul (x2,y2) = (x1 hreal_mul x2) hreal_add (y1 hreal_mul y2), (x1 hreal_mul y2) hreal_add (y1 hreal_mul x2) Run time: 0.0s Intermediate theorems generated: 2 treal_lt = |- !x1 y1 x2 y2. (x1,y1) treal_lt (x2,y2) = (x1 hreal_add y2) hreal_lt (x2 hreal_add y1) Run time: 0.0s Intermediate theorems generated: 2 treal_inv = |- !x y. treal_inv(x,y) = ((x = y) => treal_0 | (y hreal_lt x => ((hreal_inv(x hreal_sub y)) hreal_add hreal_1,hreal_1) | (hreal_1,(hreal_inv(y hreal_sub x)) hreal_add hreal_1))) Run time: 0.0s Intermediate theorems generated: 2 treal_eq = |- !x1 y1 x2 y2. (x1,y1) treal_eq (x2,y2) = (x1 hreal_add y2 = x2 hreal_add y1) Run time: 0.0s Intermediate theorems generated: 2 TREAL_EQ_REFL = |- !x. x treal_eq x Run time: 0.0s Intermediate theorems generated: 22 TREAL_EQ_SYM = |- !x y. x treal_eq y = y treal_eq x Run time: 0.0s Intermediate theorems generated: 37 TREAL_EQ_TRANS = |- !x y z. x treal_eq y /\ y treal_eq z ==> x treal_eq z Run time: 0.0s Intermediate theorems generated: 1147 TREAL_EQ_EQUIV = |- !p q. p treal_eq q = ($treal_eq p = $treal_eq q) Run time: 0.0s Intermediate theorems generated: 73 TREAL_EQ_AP = |- !p q. (p = q) ==> p treal_eq q Run time: 0.0s Intermediate theorems generated: 8 TREAL_10 = |- ~treal_1 treal_eq treal_0 Run time: 0.0s Intermediate theorems generated: 32 TREAL_ADD_SYM = |- !x y. x treal_add y = y treal_add x Run time: 0.0s Intermediate theorems generated: 44 TREAL_MUL_SYM = |- !x y. x treal_mul y = y treal_mul x Run time: 0.0s Intermediate theorems generated: 75 TREAL_ADD_ASSOC = |- !x y z. x treal_add (y treal_add z) = (x treal_add y) treal_add z Run time: 0.0s Intermediate theorems generated: 63 Theorem HREAL_MUL_ASSOC autoloading from theory `HREAL` ... HREAL_MUL_ASSOC = |- !X Y Z. X hreal_mul (Y hreal_mul Z) = (X hreal_mul Y) hreal_mul Z Run time: 0.0s TREAL_MUL_ASSOC = |- !x y z. x treal_mul (y treal_mul z) = (x treal_mul y) treal_mul z Run time: 0.0s Intermediate theorems generated: 388 TREAL_LDISTRIB = |- !x y z. x treal_mul (y treal_add z) = (x treal_mul y) treal_add (x treal_mul z) Run time: 0.0s Intermediate theorems generated: 345 TREAL_ADD_LID = |- !x. (treal_0 treal_add x) treal_eq x Run time: 0.0s Intermediate theorems generated: 158 Theorem HREAL_MUL_LID autoloading from theory `HREAL` ... HREAL_MUL_LID = |- !X. hreal_1 hreal_mul X = X Run time: 0.0s TREAL_MUL_LID = |- !x. (treal_1 treal_mul x) treal_eq x Run time: 0.0s Intermediate theorems generated: 217 TREAL_ADD_LINV = |- !x. ((treal_neg x) treal_add x) treal_eq treal_0 Run time: 0.0s Intermediate theorems generated: 169 Theorem HREAL_SUB_ADD autoloading from theory `HREAL` ... HREAL_SUB_ADD = |- !X Y. X hreal_lt Y ==> ((Y hreal_sub X) hreal_add X = Y) Run time: 0.0s Theorem HREAL_MUL_LINV autoloading from theory `HREAL` ... HREAL_MUL_LINV = |- !X. (hreal_inv X) hreal_mul X = hreal_1 Run time: 0.0s Theorem HREAL_LT_TOTAL autoloading from theory `HREAL` ... HREAL_LT_TOTAL = |- !X Y. (X = Y) \/ X hreal_lt Y \/ Y hreal_lt X Run time: 0.0s TREAL_MUL_LINV = |- !x. ~x treal_eq treal_0 ==> ((treal_inv x) treal_mul x) treal_eq treal_1 Run time: 0.0s Intermediate theorems generated: 3953 TREAL_LT_TOTAL = |- !x y. x treal_eq y \/ x treal_lt y \/ y treal_lt x Run time: 0.0s Intermediate theorems generated: 48 TREAL_LT_REFL = |- !x. ~x treal_lt x Run time: 0.0s Intermediate theorems generated: 24 TREAL_LT_TRANS = |- !x y z. x treal_lt y /\ y treal_lt z ==> x treal_lt z Run time: 0.0s Intermediate theorems generated: 1063 TREAL_LT_ADD = |- !x y z. y treal_lt z ==> (x treal_add y) treal_lt (x treal_add z) Run time: 0.0s Intermediate theorems generated: 1045 TREAL_LT_MUL = |- !x y. treal_0 treal_lt x /\ treal_0 treal_lt y ==> treal_0 treal_lt (x treal_mul y) Run time: 0.0s Intermediate theorems generated: 866 treal_of_hreal = |- !x. treal_of_hreal x = x hreal_add hreal_1,hreal_1 Run time: 0.0s Intermediate theorems generated: 2 hreal_of_treal = |- !x y. hreal_of_treal(x,y) = (@d. x = y hreal_add d) Run time: 0.0s Intermediate theorems generated: 2 TREAL_BIJ = |- (!h. hreal_of_treal(treal_of_hreal h) = h) /\ (!r. treal_0 treal_lt r = (treal_of_hreal(hreal_of_treal r)) treal_eq r) Run time: 0.0s Intermediate theorems generated: 986 TREAL_ISO = |- !h i. h hreal_lt i ==> (treal_of_hreal h) treal_lt (treal_of_hreal i) Run time: 0.0s Intermediate theorems generated: 450 TREAL_BIJ_WELLDEF = |- !h i. h treal_eq i ==> (hreal_of_treal h = hreal_of_treal i) Run time: 0.0s Intermediate theorems generated: 1446 TREAL_NEG_WELLDEF = |- !x1 x2. x1 treal_eq x2 ==> (treal_neg x1) treal_eq (treal_neg x2) Run time: 0.1s Intermediate theorems generated: 58 TREAL_ADD_WELLDEFR = |- !x1 x2 y. x1 treal_eq x2 ==> (x1 treal_add y) treal_eq (x2 treal_add y) Run time: 0.0s Intermediate theorems generated: 1044 TREAL_ADD_WELLDEF = |- !x1 x2 y1 y2. x1 treal_eq x2 /\ y1 treal_eq y2 ==> (x1 treal_add y1) treal_eq (x2 treal_add y2) Run time: 0.0s Intermediate theorems generated: 65 TREAL_MUL_WELLDEFR = |- !x1 x2 y. x1 treal_eq x2 ==> (x1 treal_mul y) treal_eq (x2 treal_mul y) Run time: 0.0s Intermediate theorems generated: 183 TREAL_MUL_WELLDEF = |- !x1 x2 y1 y2. x1 treal_eq x2 /\ y1 treal_eq y2 ==> (x1 treal_mul y1) treal_eq (x2 treal_mul y2) Run time: 0.0s Intermediate theorems generated: 65 TREAL_LT_WELLDEFR = |- !x1 x2 y. x1 treal_eq x2 ==> (x1 treal_lt y = x2 treal_lt y) Run time: 0.0s Intermediate theorems generated: 519 TREAL_LT_WELLDEFL = |- !x y1 y2. y1 treal_eq y2 ==> (x treal_lt y1 = x treal_lt y2) Run time: 0.0s Intermediate theorems generated: 612 TREAL_LT_WELLDEF = |- !x1 x2 y1 y2. x1 treal_eq x2 /\ y1 treal_eq y2 ==> (x1 treal_lt y1 = x2 treal_lt y2) Run time: 0.0s Intermediate theorems generated: 60 TREAL_INV_WELLDEF = |- !x1 x2. x1 treal_eq x2 ==> (treal_inv x1) treal_eq (treal_inv x2) Run time: 0.0s Intermediate theorems generated: 2545 REAL_10 = |- ~(r1 = r0) REAL_ADD_SYM = |- !x y. x real_add y = y real_add x REAL_MUL_SYM = |- !x y. x real_mul y = y real_mul x REAL_ADD_ASSOC = |- !x y z. x real_add (y real_add z) = (x real_add y) real_add z REAL_MUL_ASSOC = |- !x y z. x real_mul (y real_mul z) = (x real_mul y) real_mul z REAL_LDISTRIB = |- !x y z. x real_mul (y real_add z) = (x real_mul y) real_add (x real_mul z) REAL_ADD_LID = |- !x. r0 real_add x = x REAL_MUL_LID = |- !x. r1 real_mul x = x REAL_ADD_LINV = |- !x. (real_neg x) real_add x = r0 REAL_MUL_LINV = |- !x. ~(x = r0) ==> ((real_inv x) real_mul x = r1) REAL_LT_TOTAL = |- !x y. (x = y) \/ x real_lt y \/ y real_lt x REAL_LT_REFL = |- !x. ~x real_lt x REAL_LT_TRANS = |- !x y z. x real_lt y /\ y real_lt z ==> x real_lt z REAL_LT_IADD = |- !x y z. y real_lt z ==> (x real_add y) real_lt (x real_add z) REAL_LT_MUL = |- !x y. r0 real_lt x /\ r0 real_lt y ==> r0 real_lt (x real_mul y) REAL_BIJ = |- (!h. hreal_of_real(real_of_hreal h) = h) /\ (!r. r0 real_lt r = (real_of_hreal(hreal_of_real r) = r)) REAL_ISO = |- !h i. h hreal_lt i ==> (real_of_hreal h) real_lt (real_of_hreal i) Run time: 0.2s Intermediate theorems generated: 7766 REAL_ISO_EQ = |- !h i. h hreal_lt i = (real_of_hreal h) real_lt (real_of_hreal i) Run time: 0.0s Intermediate theorems generated: 98 REAL_POS = |- !X. r0 real_lt (real_of_hreal X) Run time: 0.0s Intermediate theorems generated: 20 SUP_ALLPOS_LEMMA1 = |- (!x. P x ==> r0 real_lt x) ==> ((?x. P x /\ y real_lt x) = (?X. P(real_of_hreal X) /\ y real_lt (real_of_hreal X))) Run time: 0.0s Intermediate theorems generated: 68 SUP_ALLPOS_LEMMA2 = |- P(real_of_hreal X) = (\h. P(real_of_hreal h))X Run time: 0.0s Intermediate theorems generated: 5 SUP_ALLPOS_LEMMA3 = |- (!x. P x ==> r0 real_lt x) /\ (?x. P x) /\ (?z. !x. P x ==> x real_lt z) ==> (?X. (\h. P(real_of_hreal h))X) /\ (?Y. !X. (\h. P(real_of_hreal h))X ==> X hreal_lt Y) Run time: 0.0s Intermediate theorems generated: 135 SUP_ALLPOS_LEMMA4 = |- !y. ~r0 real_lt y ==> (!x. y real_lt (real_of_hreal x)) Run time: 0.0s Intermediate theorems generated: 75 Theorem HREAL_SUP autoloading from theory `HREAL` ... HREAL_SUP = |- !P. (?X. P X) /\ (?Y. !X. P X ==> X hreal_lt Y) ==> (!Y. (?X. P X /\ Y hreal_lt X) = Y hreal_lt (hreal_sup P)) Run time: 0.0s REAL_SUP_ALLPOS = |- !P. (!x. P x ==> r0 real_lt x) /\ (?x. P x) /\ (?z. !x. P x ==> x real_lt z) ==> (?s. !y. (?x. P x /\ y real_lt x) = y real_lt s) Run time: 0.0s Intermediate theorems generated: 199 [|- ~(r1 = r0); |- !x y. x real_add y = y real_add x; |- !x y. x real_mul y = y real_mul x; |- !x y z. x real_add (y real_add z) = (x real_add y) real_add z; |- !x y z. x real_mul (y real_mul z) = (x real_mul y) real_mul z; |- !x y z. x real_mul (y real_add z) = (x real_mul y) real_add (x real_mul z); |- !x. r0 real_add x = x; |- !x. r1 real_mul x = x; |- !x. (real_neg x) real_add x = r0; |- !x. ~(x = r0) ==> ((real_inv x) real_mul x = r1); |- !x y. (x = y) \/ x real_lt y \/ y real_lt x; |- !x. ~x real_lt x; |- !x y z. x real_lt y /\ y real_lt z ==> x real_lt z; |- !x y z. y real_lt z ==> (x real_add y) real_lt (x real_add z); |- !x y. r0 real_lt x /\ r0 real_lt y ==> r0 real_lt (x real_mul y)] : thm list Run time: 0.0s () : void Run time: 0.1s Intermediate theorems generated: 1 File realax.ml loaded () : void Run time: 0.6s Intermediate theorems generated: 26795 #\ echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `real.ml`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool false : bool () : void Theory REALAX loaded () : void false : bool Run time: 0.0s LAND_CONV = - : (conv -> conv) Run time: 0.0s TAUT_CONV = - : conv Run time: 0.0s AC = - : ((thm # thm) -> conv) Run time: 0.0s GEN_PAIR_TAC = - : tactic Run time: 0.0s MK_COMB_TAC = - : tactic Run time: 0.0s BINOP_TAC = - : tactic Run time: 0.0s SYM_CANON_CONV = - : (thm -> ((term # term) -> bool) -> conv) Run time: 0.0s IMP_SUBST_TAC = - : thm_tactic Run time: 0.0s ABBREV_TAC = - : (term -> tactic) Run time: 0.0s EXT_CONV = - : conv Run time: 0.0s ABS_TAC = - : tactic Run time: 0.0s EQUAL_TAC = - : tactic Run time: 0.0s X_BETA_CONV = - : (term -> conv) Run time: 0.0s EXACT_CONV = - : (thm list -> conv) Run time: 0.0s HABS_CONV = - : conv Run time: 0.0s autoload_definitions = - : (string -> void) Run time: 0.0s autoload_theorems = - : (string -> void) Run time: 0.0s EXPAND_TAC = - : (string -> tactic) Run time: 0.0s File useful loaded () : void Run time: 0.0s () : void Run time: 0.0s real_sub = |- !x y. x real_sub y = x real_add (real_neg y) Run time: 0.0s Intermediate theorems generated: 2 real_le = |- !x y. x real_le y = ~y real_lt x Run time: 0.0s Intermediate theorems generated: 2 real_gt = |- !x y. x real_gt y = y real_lt x Run time: 0.0s Intermediate theorems generated: 2 real_ge = |- !x y. x real_ge y = y real_le x Run time: 0.0s Intermediate theorems generated: 2 real_div = |- !x y. x / y = x real_mul (real_inv y) Run time: 0.0s Intermediate theorems generated: 2 real_of_num = |- (real_of_num 0 = r0) /\ (!n. real_of_num(SUC n) = (real_of_num n) real_add r1) Run time: 0.0s Intermediate theorems generated: 136 REAL_0 = |- r0 = real_of_num 0 Run time: 0.0s Intermediate theorems generated: 11 REAL_1 = |- r1 = real_of_num 1 Run time: 0.0s Intermediate theorems generated: 23 () : void Run time: 0.0s [] : (string # string) list Run time: 0.0s gonk = - : (string list -> thm) Run time: 0.0s reeducate = - : (string -> void) Run time: 0.0s () : void Run time: 0.0s REAL_10 = |- ~(& 1 = & 0) Run time: 0.0s Intermediate theorems generated: 4 REAL_ADD_SYM = |- !x y. x + y = y + x Run time: 0.0s Intermediate theorems generated: 2 REAL_MUL_SYM = |- !x y. x * y = y * x Run time: 0.0s Intermediate theorems generated: 2 REAL_ADD_ASSOC = |- !x y z. x + (y + z) = (x + y) + z Run time: 0.0s Intermediate theorems generated: 2 REAL_MUL_ASSOC = |- !x y z. x * (y * z) = (x * y) * z Run time: 0.0s Intermediate theorems generated: 2 REAL_ADD_LID = |- !x. (& 0) + x = x Run time: 0.0s Intermediate theorems generated: 7 REAL_MUL_LID = |- !x. (& 1) * x = x Run time: 0.0s Intermediate theorems generated: 7 REAL_ADD_LINV = |- !x. (-- x) + x = & 0 Run time: 0.0s Intermediate theorems generated: 4 REAL_MUL_LINV = |- !x. ~(x = & 0) ==> ((inv x) * x = & 1) Run time: 0.0s Intermediate theorems generated: 8 REAL_LDISTRIB = |- !x y z. x * (y + z) = (x * y) + (x * z) Run time: 0.0s Intermediate theorems generated: 2 REAL_LT_TOTAL = |- !x y. (x = y) \/ x < y \/ y < x Run time: 0.0s Intermediate theorems generated: 2 REAL_LT_REFL = |- !x. ~x < x Run time: 0.0s Intermediate theorems generated: 2 REAL_LT_TRANS = |- !x y z. x < y /\ y < z ==> x < z Run time: 0.0s Intermediate theorems generated: 2 REAL_LT_IADD = |- !x y z. y < z ==> (x + y) < (x + z) Run time: 0.0s Intermediate theorems generated: 2 REAL_LT_MUL = |- !x y. (& 0) < x /\ (& 0) < y ==> (& 0) < (x * y) Run time: 0.0s Intermediate theorems generated: 15 REAL_SUP_ALLPOS = |- !P. (!x. P x ==> (& 0) < x) /\ (?x. P x) /\ (?z. !x. P x ==> x < z) ==> (?s. !y. (?x. P x /\ y < x) = y < s) Run time: 0.0s Intermediate theorems generated: 12 REAL_ADD_RID = |- !x. x + (& 0) = x Run time: 0.0s Intermediate theorems generated: 14 REAL_ADD_RINV = |- !x. x + (-- x) = & 0 Run time: 0.0s Intermediate theorems generated: 14 REAL_MUL_RID = |- !x. x * (& 1) = x Run time: 0.0s Intermediate theorems generated: 14 REAL_MUL_RINV = |- !x. ~(x = & 0) ==> (x * (inv x) = & 1) Run time: 0.0s Intermediate theorems generated: 15 REAL_RDISTRIB = |- !x y z. (x + y) * z = (x * z) + (y * z) Run time: 0.0s Intermediate theorems generated: 22 REAL_EQ_LADD = |- !x y z. (x + y = x + z) = (y = z) Run time: 0.0s Intermediate theorems generated: 50 REAL_EQ_RADD = |- !x y z. (x + z = y + z) = (x = y) Run time: 0.0s Intermediate theorems generated: 21 REAL_ADD_LID_UNIQ = |- !x y. (x + y = y) = (x = & 0) Run time: 0.0s Intermediate theorems generated: 21 REAL_ADD_RID_UNIQ = |- !x y. (x + y = x) = (y = & 0) Run time: 0.0s Intermediate theorems generated: 18 REAL_LNEG_UNIQ = |- !x y. (x + y = & 0) = (x = -- y) Run time: 0.0s Intermediate theorems generated: 10 REAL_RNEG_UNIQ = |- !x y. (x + y = & 0) = (y = -- x) Run time: 0.0s Intermediate theorems generated: 18 REAL_NEG_ADD = |- !x y. --(x + y) = (-- x) + (-- y) Run time: 0.0s Intermediate theorems generated: 101 REAL_MUL_LZERO = |- !x. (& 0) * x = & 0 Run time: 0.0s Intermediate theorems generated: 40 REAL_MUL_RZERO = |- !x. x * (& 0) = & 0 Run time: 0.0s Intermediate theorems generated: 14 REAL_NEG_LMUL = |- !x y. --(x * y) = (-- x) * y Run time: 0.0s Intermediate theorems generated: 62 REAL_NEG_RMUL = |- !x y. --(x * y) = x * (-- y) Run time: 0.0s Intermediate theorems generated: 18 REAL_NEGNEG = |- !x. --(-- x) = x Run time: 0.0s Intermediate theorems generated: 33 REAL_NEG_MUL2 = |- !x y. (-- x) * (-- y) = x * y Run time: 0.1s Intermediate theorems generated: 56 REAL_ENTIRE = |- !x y. (x * y = & 0) = (x = & 0) \/ (y = & 0) Run time: 0.0s Intermediate theorems generated: 116 REAL_LT_LADD = |- !x y z. (x + y) < (x + z) = y < z Run time: 0.0s Intermediate theorems generated: 54 REAL_LT_RADD = |- !x y z. (x + z) < (y + z) = x < y Run time: 0.0s Intermediate theorems generated: 21 REAL_NOT_LT = |- !x y. ~x < y = y <= x Run time: 0.0s Intermediate theorems generated: 15 REAL_LT_ANTISYM = |- !x y. ~(x < y /\ y < x) Run time: 0.0s Intermediate theorems generated: 24 REAL_LT_GT = |- !x y. x < y ==> ~y < x Run time: 0.0s Intermediate theorems generated: 26 REAL_NOT_LE = |- !x y. ~x <= y = y < x Run time: 0.0s Intermediate theorems generated: 19 REAL_LE_TOTAL = |- !x y. x <= y \/ y <= x Run time: 0.0s Intermediate theorems generated: 55 REAL_LET_TOTAL = |- !x y. x <= y \/ y < x Run time: 0.0s Intermediate theorems generated: 28 REAL_LTE_TOTAL = |- !x y. x < y \/ y <= x Run time: 0.0s Intermediate theorems generated: 27 REAL_LE_REFL = |- !x. x <= x Run time: 0.0s Intermediate theorems generated: 21 REAL_LE_LT = |- !x y. x <= y = x < y \/ (x = y) Run time: 0.0s Intermediate theorems generated: 93 REAL_LT_LE = |- !x y. x < y = x <= y /\ ~(x = y) Run time: 0.0s Intermediate theorems generated: 125 REAL_LT_IMP_LE = |- !x y. x < y ==> x <= y Run time: 0.0s Intermediate theorems generated: 22 REAL_LTE_TRANS = |- !x y z. x < y /\ y <= z ==> x < z Run time: 0.0s Intermediate theorems generated: 47 REAL_LET_TRANS = |- !x y z. x <= y /\ y < z ==> x < z Run time: 0.0s Intermediate theorems generated: 46 REAL_LE_TRANS = |- !x y z. x <= y /\ y <= z ==> x <= z Run time: 0.0s Intermediate theorems generated: 51 REAL_LE_ANTISYM = |- !x y. x <= y /\ y <= x = (x = y) Run time: 0.0s Intermediate theorems generated: 94 REAL_LET_ANTISYM = |- !x y. ~(x < y /\ y <= x) Run time: 0.0s Intermediate theorems generated: 32 REAL_LTE_ANTSYM = |- !x y. ~(x <= y /\ y < x) Run time: 0.0s Intermediate theorems generated: 15 REAL_NEG_LT0 = |- !x. (-- x) < (& 0) = (& 0) < x Run time: 0.0s Intermediate theorems generated: 24 REAL_NEG_GT0 = |- !x. (& 0) < (-- x) = x < (& 0) Run time: 0.0s Intermediate theorems generated: 25 REAL_NEG_LE0 = |- !x. (-- x) <= (& 0) = (& 0) <= x Run time: 0.0s Intermediate theorems generated: 25 REAL_NEG_GE0 = |- !x. (& 0) <= (-- x) = x <= (& 0) Run time: 0.0s Intermediate theorems generated: 25 REAL_LT_NEGTOTAL = |- !x. (x = & 0) \/ (& 0) < x \/ (& 0) < (-- x) Run time: 0.0s Intermediate theorems generated: 79 REAL_LE_NEGTOTAL = |- !x. (& 0) <= x \/ (& 0) <= (-- x) Run time: 0.0s Intermediate theorems generated: 73 REAL_LE_MUL = |- !x y. (& 0) <= x /\ (& 0) <= y ==> (& 0) <= (x * y) Run time: 0.0s Intermediate theorems generated: 276 REAL_LE_SQUARE = |- !x. (& 0) <= (x * x) Run time: 0.0s Intermediate theorems generated: 68 REAL_LE_01 = |- (& 0) <= (& 1) Run time: 0.1s Intermediate theorems generated: 6 REAL_LT_01 = |- (& 0) < (& 1) Run time: 0.0s Intermediate theorems generated: 29 REAL_LE_LADD = |- !x y z. (x + y) <= (x + z) = y <= z Run time: 0.0s Intermediate theorems generated: 20 REAL_LE_RADD = |- !x y z. (x + z) <= (y + z) = x <= y Run time: 0.0s Intermediate theorems generated: 20 REAL_LT_ADD2 = |- !w x y z. w < x /\ y < z ==> (w + y) < (x + z) Run time: 0.0s Intermediate theorems generated: 55 REAL_LE_ADD2 = |- !w x y z. w <= x /\ y <= z ==> (w + y) <= (x + z) Run time: 0.0s Intermediate theorems generated: 55 REAL_LE_ADD = |- !x y. (& 0) <= x /\ (& 0) <= y ==> (& 0) <= (x + y) Run time: 0.0s Intermediate theorems generated: 22 REAL_LT_ADD = |- !x y. (& 0) < x /\ (& 0) < y ==> (& 0) < (x + y) Run time: 0.0s Intermediate theorems generated: 22 REAL_LT_ADDNEG = |- !x y z. y < (x + (-- z)) = (y + z) < x Run time: 0.0s Intermediate theorems generated: 48 REAL_LT_ADDNEG2 = |- !x y z. (x + (-- y)) < z = x < (z + y) Run time: 0.0s Intermediate theorems generated: 49 REAL_LT_ADD1 = |- !x y. x <= y ==> x < (y + (& 1)) Run time: 0.0s Intermediate theorems generated: 75 REAL_SUB_ADD = |- !x y. (x - y) + y = x Run time: 0.0s Intermediate theorems generated: 50 REAL_SUB_ADD2 = |- !x y. y + (x - y) = x Run time: 0.0s Intermediate theorems generated: 16 REAL_SUB_REFL = |- !x. x - x = & 0 Run time: 0.0s Intermediate theorems generated: 20 REAL_SUB_0 = |- !x y. (x - y = & 0) = (x = y) Run time: 0.0s Intermediate theorems generated: 33 REAL_LE_DOUBLE = |- !x. (& 0) <= (x + x) = (& 0) <= x Run time: 0.0s Intermediate theorems generated: 72 REAL_LE_NEGL = |- !x. (-- x) <= x = (& 0) <= x Run time: 0.0s Intermediate theorems generated: 25 REAL_LE_NEGR = |- !x. x <= (-- x) = x <= (& 0) Run time: 0.0s Intermediate theorems generated: 42 REAL_NEG_EQ0 = |- !x. (-- x = & 0) = (x = & 0) Run time: 0.0s Intermediate theorems generated: 45 REAL_NEG_0 = |- --(& 0) = & 0 Run time: 0.0s Intermediate theorems generated: 9 REAL_NEG_SUB = |- !x y. --(x - y) = y - x Run time: 0.0s Intermediate theorems generated: 32 REAL_SUB_LT = |- !x y. (& 0) < (x - y) = y < x Run time: 0.0s Intermediate theorems generated: 28 REAL_SUB_LE = |- !x y. (& 0) <= (x - y) = y <= x Run time: 0.0s Intermediate theorems generated: 28 REAL_ADD_SUB = |- !x y. (x + y) - x = y Run time: 0.0s Intermediate theorems generated: 61 REAL_EQ_LMUL = |- !x y z. (x * y = x * z) = (x = & 0) \/ (y = z) Run time: 0.0s Intermediate theorems generated: 122 REAL_EQ_RMUL = |- !x y z. (x * z = y * z) = (z = & 0) \/ (x = y) Run time: 0.0s Intermediate theorems generated: 21 REAL_SUB_LDISTRIB = |- !x y z. x * (y - z) = (x * y) - (x * z) Run time: 0.0s Intermediate theorems generated: 39 REAL_SUB_RDISTRIB = |- !x y z. (x - y) * z = (x * z) - (y * z) Run time: 0.0s Intermediate theorems generated: 22 REAL_NEG_EQ = |- !x y. (-- x = y) = (x = -- y) Run time: 0.0s Intermediate theorems generated: 30 REAL_NEG_MINUS1 = |- !x. -- x = (--(& 1)) * x Run time: 0.0s Intermediate theorems generated: 30 REAL_INV_NZ = |- !x. ~(x = & 0) ==> ~(inv x = & 0) Run time: 0.0s Intermediate theorems generated: 35 REAL_INVINV = |- !x. ~(x = & 0) ==> (inv(inv x) = x) Run time: 0.0s Intermediate theorems generated: 114 REAL_LT_IMP_NE = |- !x y. x < y ==> ~(x = y) Run time: 0.0s Intermediate theorems generated: 43 REAL_INV_POS = |- !x. (& 0) < x ==> (& 0) < (inv x) Run time: 0.0s Intermediate theorems generated: 133 REAL_LT_LMUL_0 = |- !x y. (& 0) < x ==> ((& 0) < (x * y) = (& 0) < y) Run time: 0.0s Intermediate theorems generated: 87 REAL_LT_RMUL_0 = |- !x y. (& 0) < y ==> ((& 0) < (x * y) = (& 0) < x) Run time: 0.0s Intermediate theorems generated: 18 REAL_LT_LMUL = |- !x y z. (& 0) < x ==> ((x * y) < (x * z) = y < z) Run time: 0.0s Intermediate theorems generated: 57 REAL_LT_RMUL = |- !x y z. (& 0) < z ==> ((x * z) < (y * z) = x < y) Run time: 0.0s Intermediate theorems generated: 22 REAL_LT_RMUL_IMP = |- !x y z. x < y /\ (& 0) < z ==> (x * z) < (y * z) Run time: 0.0s Intermediate theorems generated: 29 REAL_LT_LMUL_IMP = |- !x y z. y < z /\ (& 0) < x ==> (x * y) < (x * z) Run time: 0.0s Intermediate theorems generated: 29 REAL_LINV_UNIQ = |- !x y. (x * y = & 1) ==> (x = inv y) Run time: 0.0s Intermediate theorems generated: 111 REAL_RINV_UNIQ = |- !x y. (x * y = & 1) ==> (y = inv x) Run time: 0.0s Intermediate theorems generated: 18 REAL_NEG_INV = |- !x. ~(x = & 0) ==> (--(inv x) = inv(-- x)) Run time: 0.0s Intermediate theorems generated: 71 REAL_INV_1OVER = |- !x. inv x = (& 1) / x Run time: 0.1s Intermediate theorems generated: 19 REAL_LE_ADDR = |- !x y. x <= (x + y) = (& 0) <= y Run time: 0.0s Intermediate theorems generated: 20 REAL_LE_ADDL = |- !x y. y <= (x + y) = (& 0) <= x Run time: 0.0s Intermediate theorems generated: 17 REAL_LT_ADDR = |- !x y. x < (x + y) = (& 0) < y Run time: 0.0s Intermediate theorems generated: 20 REAL_LT_ADDL = |- !x y. y < (x + y) = (& 0) < x Run time: 0.0s Intermediate theorems generated: 17 REAL = |- !n. &(SUC n) = (& n) + (& 1) Run time: 0.0s Intermediate theorems generated: 19 REAL_POS = |- !n. (& 0) <= (& n) Run time: 0.0s Intermediate theorems generated: 70 Theorem LESS_0 autoloading from theory `prim_rec` ... LESS_0 = |- !n. 0 num_lt (SUC n) Run time: 0.0s Theorem NOT_LESS autoloading from theory `arithmetic` ... NOT_LESS = |- !m n. ~m num_lt n = n num_le m Run time: 0.0s Theorem LESS_EQ_MONO autoloading from theory `arithmetic` ... LESS_EQ_MONO = |- !n m. (SUC n) num_le (SUC m) = n num_le m Run time: 0.0s Theorem ZERO_LESS_EQ autoloading from theory `arithmetic` ... ZERO_LESS_EQ = |- !n. 0 num_le n Run time: 0.0s REAL_LE = |- !m n. (& m) <= (& n) = m num_le n Run time: 0.0s Intermediate theorems generated: 321 REAL_LT = |- !m n. (& m) < (& n) = m num_lt n Run time: 0.0s Intermediate theorems generated: 48 Theorem LESS_EQUAL_ANTISYM autoloading from theory `arithmetic` ... LESS_EQUAL_ANTISYM = |- !n m. n num_le m /\ m num_le n ==> (n = m) Run time: 0.0s Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m num_le m Run time: 0.0s REAL_INJ = |- !m n. (& m = & n) = (m = n) Run time: 0.0s Intermediate theorems generated: 57 Definition ADD autoloading from theory `arithmetic` ... ADD = |- (!n. 0 num_add n = n) /\ (!m n. (SUC m) num_add n = SUC(m num_add n)) Run time: 0.0s Intermediate theorems generated: 1 REAL_ADD = |- !m n. (& m) + (& n) = &(m num_add n) Run time: 0.0s Intermediate theorems generated: 131 Theorem MULT_CLAUSES autoloading from theory `arithmetic` ... MULT_CLAUSES = |- !m n. (0 num_mul m = 0) /\ (m num_mul 0 = 0) /\ (1 num_mul m = m) /\ (m num_mul 1 = m) /\ ((SUC m) num_mul n = (m num_mul n) num_add n) /\ (m num_mul (SUC n) = m num_add (m num_mul n)) Run time: 0.0s REAL_MUL = |- !m n. (& m) * (& n) = &(m num_mul n) Run time: 0.0s Intermediate theorems generated: 148 REAL_INV1 = |- inv(& 1) = & 1 Run time: 0.0s Intermediate theorems generated: 26 REAL_OVER1 = |- !x. x / (& 1) = x Run time: 0.0s Intermediate theorems generated: 22 REAL_DIV_REFL = |- !x. ~(x = & 0) ==> (x / x = & 1) Run time: 0.0s Intermediate theorems generated: 19 REAL_DIV_LZERO = |- !x. (& 0) / x = & 0 Run time: 0.1s Intermediate theorems generated: 20 REAL_LT_NZ = |- !n. ~(& n = & 0) = (& 0) < (& n) Run time: 0.0s Intermediate theorems generated: 90 REAL_NZ_IMP_LT = |- !n. ~(n = 0) ==> (& 0) < (& n) Run time: 0.0s Intermediate theorems generated: 28 REAL_LT_RDIV_0 = |- !y z. (& 0) < z ==> ((& 0) < (y / z) = (& 0) < y) Run time: 0.0s Intermediate theorems generated: 40 REAL_LT_RDIV = |- !x y z. (& 0) < z ==> ((x / z) < (y / z) = x < y) Run time: 0.0s Intermediate theorems generated: 44 REAL_LT_FRACTION_0 = |- !n d. ~(n = 0) ==> ((& 0) < (d / (& n)) = (& 0) < d) Run time: 0.0s Intermediate theorems generated: 44 Theorem LESS_TRANS autoloading from theory `arithmetic` ... LESS_TRANS = |- !m n p. m num_lt n /\ n num_lt p ==> m num_lt p Run time: 0.0s Theorem NOT_LESS_0 autoloading from theory `prim_rec` ... NOT_LESS_0 = |- !n. ~n num_lt 0 Run time: 0.0s REAL_LT_MULTIPLE = |- !n d. 1 num_lt n ==> (d < ((& n) * d) = (& 0) < d) Run time: 0.0s Intermediate theorems generated: 268 REAL_LT_FRACTION = |- !n d. 1 num_lt n ==> ((d / (& n)) < d = (& 0) < d) Run time: 0.0s Intermediate theorems generated: 184 Theorem NOT_SUC autoloading from theory `num` ... NOT_SUC = |- !n. ~(SUC n = 0) Run time: 0.0s REAL_LT_HALF1 = |- !d. (& 0) < (d / (& 2)) = (& 0) < d Run time: 0.0s Intermediate theorems generated: 27 Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n num_lt (SUC n) Run time: 0.0s REAL_LT_HALF2 = |- !d. (d / (& 2)) < d = (& 0) < d Run time: 0.0s Intermediate theorems generated: 22 REAL_DOUBLE = |- !x. x + x = (& 2) * x Run time: 0.0s Intermediate theorems generated: 37 REAL_DIV_LMUL = |- !x y. ~(y = & 0) ==> (y * (x / y) = x) Run time: 0.0s Intermediate theorems generated: 70 REAL_DIV_RMUL = |- !x y. ~(y = & 0) ==> ((x / y) * y = x) Run time: 0.0s Intermediate theorems generated: 17 REAL_HALF_DOUBLE = |- !x. (x / (& 2)) + (x / (& 2)) = x Run time: 0.0s Intermediate theorems generated: 51 REAL_DOWN = |- !x. (& 0) < x ==> (?y. (& 0) < y /\ y < x) Run time: 0.0s Intermediate theorems generated: 24 REAL_DOWN2 = |- !x y. (& 0) < x /\ (& 0) < y ==> (?z. (& 0) < z /\ z < x /\ z < y) Run time: 0.1s Intermediate theorems generated: 145 REAL_SUB_SUB = |- !x y. (x - y) - x = -- y Run time: 0.0s Intermediate theorems generated: 91 REAL_LT_ADD_SUB = |- !x y z. (x + y) < z = x < (z - y) Run time: 0.0s Intermediate theorems generated: 23 REAL_LT_SUB_RADD = |- !x y z. (x - y) < z = x < (z + y) Run time: 0.0s Intermediate theorems generated: 25 REAL_LT_SUB_LADD = |- !x y z. x < (y - z) = (x + z) < y Run time: 0.0s Intermediate theorems generated: 57 REAL_LE_SUB_LADD = |- !x y z. x <= (y - z) = (x + z) <= y Run time: 0.0s Intermediate theorems generated: 38 REAL_LE_SUB_RADD = |- !x y z. (x - y) <= z = x <= (z + y) Run time: 0.0s Intermediate theorems generated: 38 REAL_LT_NEG = |- !x y. (-- x) < (-- y) = y < x Run time: 0.0s Intermediate theorems generated: 79 REAL_LE_NEG = |- !x y. (-- x) <= (-- y) = y <= x Run time: 0.0s Intermediate theorems generated: 37 REAL_ADD2_SUB2 = |- !a b c d. (a + b) - (c + d) = (a - c) + (b - d) Run time: 0.0s Intermediate theorems generated: 73 REAL_SUB_LZERO = |- !x. (& 0) - x = -- x Run time: 0.0s Intermediate theorems generated: 20 REAL_SUB_RZERO = |- !x. x - (& 0) = x Run time: 0.0s Intermediate theorems generated: 22 REAL_LET_ADD2 = |- !w x y z. w <= x /\ y < z ==> (w + y) < (x + z) Run time: 0.0s Intermediate theorems generated: 58 REAL_LTE_ADD2 = |- !w x y z. w < x /\ y <= z ==> (w + y) < (x + z) Run time: 0.0s Intermediate theorems generated: 33 REAL_LET_ADD = |- !x y. (& 0) <= x /\ (& 0) < y ==> (& 0) < (x + y) Run time: 0.0s Intermediate theorems generated: 33 REAL_LTE_ADD = |- !x y. (& 0) < x /\ (& 0) <= y ==> (& 0) < (x + y) Run time: 0.1s Intermediate theorems generated: 33 REAL_LT_MUL2 = |- !x1 x2 y1 y2. (& 0) <= x1 /\ (& 0) <= y1 /\ x1 < x2 /\ y1 < y2 ==> (x1 * y1) < (x2 * y2) Run time: 0.0s Intermediate theorems generated: 344 REAL_LT_INV = |- !x y. (& 0) < x /\ x < y ==> (inv y) < (inv x) Run time: 0.0s Intermediate theorems generated: 282 REAL_SUB_LNEG = |- !x y. (-- x) - y = --(x + y) Run time: 0.0s Intermediate theorems generated: 23 REAL_SUB_RNEG = |- !x y. x - (-- y) = x + y Run time: 0.0s Intermediate theorems generated: 22 REAL_SUB_NEG2 = |- !x y. (-- x) - (-- y) = y - x Run time: 0.0s Intermediate theorems generated: 40 REAL_SUB_TRIANGLE = |- !a b c. (a - b) + (b - c) = a - c Run time: 0.0s Intermediate theorems generated: 93 REAL_EQ_SUB_LADD = |- !x y z. (x = y - z) = (x + z = y) Run time: 0.0s Intermediate theorems generated: 24 REAL_EQ_SUB_RADD = |- !x y z. (x - y = z) = (x = z + y) Run time: 0.0s Intermediate theorems generated: 17 REAL_INV_MUL = |- !x y. ~(x = & 0) /\ ~(y = & 0) ==> (inv(x * y) = (inv x) * (inv y)) Run time: 0.0s Intermediate theorems generated: 142 REAL_LE_LMUL = |- !x y z. (& 0) < x ==> ((x * y) <= (x * z) = y <= z) Run time: 0.0s Intermediate theorems generated: 43 REAL_LE_RMUL = |- !x y z. (& 0) < z ==> ((x * z) <= (y * z) = x <= y) Run time: 0.1s Intermediate theorems generated: 22 REAL_SUB_INV2 = |- !x y. ~(x = & 0) /\ ~(y = & 0) ==> ((inv x) - (inv y) = (y - x) / (x * y)) Run time: 0.0s Intermediate theorems generated: 153 REAL_SUB_SUB2 = |- !x y. x - (x - y) = y Run time: 0.0s Intermediate theorems generated: 40 REAL_ADD_SUB2 = |- !x y. x - (x + y) = -- y Run time: 0.0s Intermediate theorems generated: 36 REAL_MEAN = |- !x y. x < y ==> (?z. x < z /\ z < y) Run time: 0.0s Intermediate theorems generated: 91 REAL_EQ_LMUL2 = |- !x y z. ~(x = & 0) ==> ((y = z) = (x * y = x * z)) Run time: 0.0s Intermediate theorems generated: 35 REAL_LE_MUL2 = |- !x1 x2 y1 y2. (& 0) <= x1 /\ (& 0) <= y1 /\ x1 <= x2 /\ y1 <= y2 ==> (x1 * y1) <= (x2 * y2) Run time: 0.0s Intermediate theorems generated: 345 REAL_LE_LDIV = |- !x y z. (& 0) < x /\ y <= (z * x) ==> (y / x) <= z Run time: 0.0s Intermediate theorems generated: 102 REAL_LE_RDIV = |- !x y z. (& 0) < x /\ (y * x) <= z ==> y <= (z / x) Run time: 0.0s Intermediate theorems generated: 101 REAL_LT_1 = |- !x y. (& 0) <= x /\ x < y ==> (x / y) < (& 1) Run time: 0.0s Intermediate theorems generated: 120 REAL_LE_LMUL_IMP = |- !x y z. (& 0) <= x /\ y <= z ==> (x * y) <= (x * z) Run time: 0.0s Intermediate theorems generated: 65 REAL_LE_RMUL_IMP = |- !x y z. (& 0) <= x /\ y <= z ==> (y * x) <= (z * x) Run time: 0.0s Intermediate theorems generated: 26 REAL_EQ_IMP_LE = |- !x y. (x = y) ==> x <= y Run time: 0.0s Intermediate theorems generated: 8 REAL_INV_LT1 = |- !x. (& 0) < x /\ x < (& 1) ==> (& 1) < (inv x) Run time: 0.0s Intermediate theorems generated: 290 REAL_POS_NZ = |- !x. (& 0) < x ==> ~(x = & 0) Run time: 0.0s Intermediate theorems generated: 17 REAL_EQ_RMUL_IMP = |- !x y z. ~(z = & 0) /\ (x * z = y * z) ==> (x = y) Run time: 0.0s Intermediate theorems generated: 36 REAL_EQ_LMUL_IMP = |- !x y z. ~(x = & 0) /\ (x * y = x * z) ==> (y = z) Run time: 0.0s Intermediate theorems generated: 28 Theorem FACT_LESS autoloading from theory `arithmetic` ... FACT_LESS = |- !n. 0 num_lt (FACT n) Run time: 0.0s REAL_FACT_NZ = |- !n. ~(&(FACT n) = & 0) Run time: 0.0s Intermediate theorems generated: 25 REAL_DIFFSQ = |- !x y. (x + y) * (x - y) = (x * x) - (y * y) Run time: 0.0s Intermediate theorems generated: 165 REAL_POSSQ = |- !x. (& 0) < (x * x) = ~(x = & 0) Run time: 0.0s Intermediate theorems generated: 68 REAL_SUMSQ = |- !x y. ((x * x) + (y * y) = & 0) = (x = & 0) /\ (y = & 0) Run time: 0.0s Intermediate theorems generated: 163 REAL_EQ_NEG = |- !x y. (-- x = -- y) = (x = y) Run time: 0.0s Intermediate theorems generated: 36 REAL_DIV_MUL2 = |- !x z. ~(x = & 0) /\ ~(z = & 0) ==> (!y. y / z = (x * y) / (x * z)) Run time: 0.0s Intermediate theorems generated: 169 REAL_MIDDLE1 = |- !a b. a <= b ==> a <= ((a + b) / (& 2)) Run time: 0.0s Intermediate theorems generated: 89 REAL_MIDDLE2 = |- !a b. a <= b ==> ((a + b) / (& 2)) <= b Run time: 0.0s Intermediate theorems generated: 87 abs = |- !x. abs x = ((& 0) <= x => x | -- x) Run time: 0.1s Intermediate theorems generated: 2 ABS_ZERO = |- !x. (abs x = & 0) = (x = & 0) Run time: 0.0s Intermediate theorems generated: 52 ABS_0 = |- abs(& 0) = & 0 Run time: 0.0s Intermediate theorems generated: 9 ABS_1 = |- abs(& 1) = & 1 Run time: 0.0s Intermediate theorems generated: 31 ABS_NEG = |- !x. abs(-- x) = abs x Run time: 0.0s Intermediate theorems generated: 178 ABS_TRIANGLE = |- !x y. (abs(x + y)) <= ((abs x) + (abs y)) Run time: 0.0s Intermediate theorems generated: 604 ABS_POS = |- !x. (& 0) <= (abs x) Run time: 0.0s Intermediate theorems generated: 67 ABS_MUL = |- !x y. abs(x * y) = (abs x) * (abs y) Run time: 0.0s Intermediate theorems generated: 385 ABS_LT_MUL2 = |- !w x y z. (abs w) < y /\ (abs x) < z ==> (abs(w * x)) < (y * z) Run time: 0.0s Intermediate theorems generated: 56 ABS_SUB = |- !x y. abs(x - y) = abs(y - x) Run time: 0.0s Intermediate theorems generated: 31 ABS_NZ = |- !x. ~(x = & 0) = (& 0) < (abs x) Run time: 0.0s Intermediate theorems generated: 139 ABS_INV = |- !x. ~(x = & 0) ==> (abs(inv x) = inv(abs x)) Run time: 0.0s Intermediate theorems generated: 105 ABS_ABS = |- !x. abs(abs x) = abs x Run time: 0.0s Intermediate theorems generated: 27 ABS_LE = |- !x. x <= (abs x) Run time: 0.0s Intermediate theorems generated: 75 ABS_REFL = |- !x. (abs x = x) = (& 0) <= x Run time: 0.0s Intermediate theorems generated: 156 ABS_N = |- !n. abs(& n) = & n Run time: 0.0s Intermediate theorems generated: 21 ABS_BETWEEN = |- !x y d. (& 0) < d /\ (x - d) < y /\ y < (x + d) = (abs(y - x)) < d Run time: 0.0s Intermediate theorems generated: 372 ABS_BOUND = |- !x y d. (abs(x - y)) < d ==> y < (x + d) Run time: 0.0s Intermediate theorems generated: 54 ABS_STILLNZ = |- !x y. (abs(x - y)) < (abs y) ==> ~(x = & 0) Run time: 0.0s Intermediate theorems generated: 56 ABS_CASES = |- !x. (x = & 0) \/ (& 0) < (abs x) Run time: 0.0s Intermediate theorems generated: 29 ABS_BETWEEN1 = |- !x y z. x < z /\ (abs(y - x)) < (z - x) ==> y < z Run time: 0.0s Intermediate theorems generated: 102 ABS_SIGN = |- !x y. (abs(x - y)) < y ==> (& 0) < x Run time: 0.0s Intermediate theorems generated: 22 ABS_SIGN2 = |- !x y. (abs(x - y)) < (-- y) ==> x < (& 0) Run time: 0.0s Intermediate theorems generated: 68 ABS_DIV = |- !y. ~(y = & 0) ==> (!x. abs(x / y) = (abs x) / (abs y)) Run time: 0.1s Intermediate theorems generated: 41 ABS_CIRCLE = |- !x y h. (abs h) < ((abs y) - (abs x)) ==> (abs(x + h)) < (abs y) Run time: 0.0s Intermediate theorems generated: 61 REAL_SUB_ABS = |- !x y. ((abs x) - (abs y)) <= (abs(x - y)) Run time: 0.0s Intermediate theorems generated: 94 ABS_SUB_ABS = |- !x y. (abs((abs x) - (abs y))) <= (abs(x - y)) Run time: 0.0s Intermediate theorems generated: 80 ABS_BETWEEN2 = |- !x0 x y0 y. x0 < y0 /\ (abs(x - x0)) < ((y0 - x0) / (& 2)) /\ (abs(y - y0)) < ((y0 - x0) / (& 2)) ==> x < y Run time: 0.0s Intermediate theorems generated: 935 ABS_BOUNDS = |- !x k. (abs x) <= k = (-- k) <= x /\ x <= k Run time: 0.0s Intermediate theorems generated: 250 pow = |- (!x. x pow 0 = & 1) /\ (!x n. x pow (SUC n) = x * (x pow n)) Run time: 0.0s Intermediate theorems generated: 175 POW_0 = |- !n. (& 0) pow (SUC n) = & 0 Run time: 0.0s Intermediate theorems generated: 56 POW_NZ = |- !c n. ~(c = & 0) ==> ~(c pow n = & 0) Run time: 0.1s Intermediate theorems generated: 108 POW_INV = |- !c. ~(c = & 0) ==> (!n. inv(c pow n) = (inv c) pow n) Run time: 0.0s Intermediate theorems generated: 126 POW_ABS = |- !c n. (abs c) pow n = abs(c pow n) Run time: 0.0s Intermediate theorems generated: 83 POW_PLUS1 = |- !e. (& 0) < e ==> (!n. ((& 1) + ((& n) * e)) <= (((& 1) + e) pow n)) Run time: 0.0s Intermediate theorems generated: 298 Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 num_add m = m) /\ (m num_add 0 = m) /\ ((SUC m) num_add n = SUC(m num_add n)) /\ (m num_add (SUC n) = SUC(m num_add n)) Run time: 0.0s POW_ADD = |- !c m n. c pow (m num_add n) = (c pow m) * (c pow n) Run time: 0.0s Intermediate theorems generated: 152 POW_1 = |- !x. x pow 1 = x Run time: 0.0s Intermediate theorems generated: 34 POW_2 = |- !x. x pow 2 = x * x Run time: 0.0s Intermediate theorems generated: 32 POW_POS = |- !x. (& 0) <= x ==> (!n. (& 0) <= (x pow n)) Run time: 0.0s Intermediate theorems generated: 68 POW_LE = |- !n x y. (& 0) <= x /\ x <= y ==> (x pow n) <= (y pow n) Run time: 0.0s Intermediate theorems generated: 160 POW_M1 = |- !n. abs((--(& 1)) pow n) = & 1 Run time: 0.0s Intermediate theorems generated: 80 POW_MUL = |- !n x y. (x * y) pow n = (x pow n) * (y pow n) Run time: 0.1s Intermediate theorems generated: 135 REAL_LE_POW2 = |- !x. (& 0) <= (x pow 2) Run time: 0.0s Intermediate theorems generated: 14 ABS_POW2 = |- !x. abs(x pow 2) = x pow 2 Run time: 0.0s Intermediate theorems generated: 13 REAL_POW2_ABS = |- !x. (abs x) pow 2 = x pow 2 Run time: 0.0s Intermediate theorems generated: 62 REAL_LE1_POW2 = |- !x. (& 1) <= x ==> (& 1) <= (x pow 2) Run time: 0.0s Intermediate theorems generated: 54 REAL_LT1_POW2 = |- !x. (& 1) < x ==> (& 1) < (x pow 2) Run time: 0.0s Intermediate theorems generated: 54 POW_POS_LT = |- !x n. (& 0) < x ==> (& 0) < (x pow (SUC n)) Run time: 0.0s Intermediate theorems generated: 73 Theorem LESS_EQ_SUC_REFL autoloading from theory `arithmetic` ... LESS_EQ_SUC_REFL = |- !m. m num_le (SUC m) Run time: 0.0s POW_2_LE1 = |- !n. (& 1) <= ((& 2) pow n) Run time: 0.0s Intermediate theorems generated: 118 Theorem ADD1 autoloading from theory `arithmetic` ... ADD1 = |- !m. SUC m = m num_add 1 Run time: 0.0s POW_2_LT = |- !n. (& n) < ((& 2) pow n) Run time: 0.0s Intermediate theorems generated: 103 POW_MINUS1 = |- !n. (--(& 1)) pow (2 num_mul n) = & 1 Run time: 0.0s Intermediate theorems generated: 231 REAL_SUP_SOMEPOS = |- !P. (?x. P x /\ (& 0) < x) /\ (?z. !x. P x ==> x < z) ==> (?s. !y. (?x. P x /\ y < x) = y < s) Run time: 0.1s Intermediate theorems generated: 325 SUP_LEMMA1 = |- !d. (!y. (?x. (\x. P(x + d))x /\ y < x) = y < s) ==> (!y. (?x. P x /\ y < x) = y < (s + d)) Run time: 0.0s Intermediate theorems generated: 119 SUP_LEMMA2 = |- (?x. P x) ==> (?d x. (\x. P(x + d))x /\ (& 0) < x) Run time: 0.0s Intermediate theorems generated: 121 SUP_LEMMA3 = |- !d. (?z. !x. P x ==> x < z) ==> (?z. !x. (\x. P(x + d))x ==> x < z) Run time: 0.0s Intermediate theorems generated: 42 REAL_SUP_EXISTS = |- !P. (?x. P x) /\ (?z. !x. P x ==> x < z) ==> (?s. !y. (?x. P x /\ y < x) = y < s) Run time: 0.0s Intermediate theorems generated: 45 sup = |- !P. sup P = (@s. !y. (?x. P x /\ y < x) = y < s) Run time: 0.0s Intermediate theorems generated: 2 REAL_SUP = |- !P. (?x. P x) /\ (?z. !x. P x ==> x < z) ==> (!y. (?x. P x /\ y < x) = y < (sup P)) Run time: 0.0s Intermediate theorems generated: 31 REAL_SUP_UBOUND = |- !P. (?x. P x) /\ (?z. !x. P x ==> x < z) ==> (!y. P y ==> y <= (sup P)) Run time: 0.0s Intermediate theorems generated: 87 SETOK_LE_LT = |- !P. (?x. P x) /\ (?z. !x. P x ==> x <= z) = (?x. P x) /\ (?z. !x. P x ==> x < z) Run time: 0.0s Intermediate theorems generated: 53 REAL_SUP_LE = |- !P. (?x. P x) /\ (?z. !x. P x ==> x <= z) ==> (!y. (?x. P x /\ y < x) = y < (sup P)) Run time: 0.0s Intermediate theorems generated: 15 REAL_SUP_UBOUND_LE = |- !P. (?x. P x) /\ (?z. !x. P x ==> x <= z) ==> (!y. P y ==> y <= (sup P)) Run time: 0.0s Intermediate theorems generated: 15 REAL_ARCH = |- !x. (& 0) < x ==> (!y. ?n. y < ((& n) * x)) Run time: 0.1s Intermediate theorems generated: 342 Theorem PRE autoloading from theory `prim_rec` ... PRE = |- (PRE 0 = 0) /\ (!m. PRE(SUC m) = m) Run time: 0.0s Theorem num_CASES autoloading from theory `arithmetic` ... num_CASES = |- !m. (m = 0) \/ (?n. m = SUC n) Run time: 0.0s REAL_ARCH_LEAST = |- !y. (& 0) < y ==> (!x. (& 0) <= x ==> (?n. ((& n) * y) <= x /\ x < ((&(SUC n)) * y))) Run time: 0.0s Intermediate theorems generated: 222 sum = |- (!n f. sum n 0 f = & 0) /\ (!n m f. sum n(SUC m)f = (sum n m f) + (f(n num_add m))) Run time: 0.0s Intermediate theorems generated: 202 Sum_DEF = |- !m n f. Sum(m,n)f = sum m n f Run time: 0.0s Intermediate theorems generated: 2 Sum = |- (Sum(n,0)f = & 0) /\ (Sum(n,SUC m)f = (Sum(n,m)f) + (f(n num_add m))) Run time: 0.0s Intermediate theorems generated: 51 SUM_TWO = |- !f n p. (Sum(0,n)f) + (Sum(n,p)f) = Sum(0,n num_add p)f Run time: 0.0s Intermediate theorems generated: 109 SUM_DIFF = |- !f m n. Sum(m,n)f = (Sum(0,m num_add n)f) - (Sum(0,m)f) Run time: 0.0s Intermediate theorems generated: 30 ABS_SUM = |- !f m n. (abs(Sum(m,n)f)) <= (Sum(m,n)(\n'. abs(f n'))) Run time: 0.0s Intermediate theorems generated: 103 Theorem LESS_EQ_ADD autoloading from theory `arithmetic` ... LESS_EQ_ADD = |- !m n. m num_le (m num_add n) Run time: 0.0s Theorem ADD_SYM autoloading from theory `arithmetic` ... ADD_SYM = |- !m n. m num_add n = n num_add m Run time: 0.0s SUM_LE = |- !f g m n. (!r. m num_le r /\ r num_lt (n num_add m) ==> (f r) <= (g r)) ==> (Sum(m,n)f) <= (Sum(m,n)g) Run time: 0.0s Intermediate theorems generated: 272 SUM_EQ = |- !f g m n. (!r. m num_le r /\ r num_lt (n num_add m) ==> (f r = g r)) ==> (Sum(m,n)f = Sum(m,n)g) Run time: 0.1s Intermediate theorems generated: 82 SUM_POS = |- !f. (!n. (& 0) <= (f n)) ==> (!m n. (& 0) <= (Sum(m,n)f)) Run time: 0.0s Intermediate theorems generated: 78 SUM_POS_GEN = |- !f m. (!n. m num_le n ==> (& 0) <= (f n)) ==> (!n. (& 0) <= (Sum(m,n)f)) Run time: 0.0s Intermediate theorems generated: 91 SUM_ABS = |- !f m n. abs(Sum(m,n)(\m. abs(f m))) = Sum(m,n)(\m. abs(f m)) Run time: 0.0s Intermediate theorems generated: 42 SUM_ABS_LE = |- !f m n. (abs(Sum(m,n)f)) <= (Sum(m,n)(\n'. abs(f n'))) Run time: 0.0s Intermediate theorems generated: 105 Theorem ADD_ASSOC autoloading from theory `arithmetic` ... ADD_ASSOC = |- !m n p. m num_add (n num_add p) = (m num_add n) num_add p Run time: 0.0s Theorem LESS_EQUAL_ADD autoloading from theory `arithmetic` ... LESS_EQUAL_ADD = |- !m n. m num_le n ==> (?p. n = m num_add p) Run time: 0.0s Theorem GREATER_EQ autoloading from theory `arithmetic` ... GREATER_EQ = |- !n m. n num_ge m = m num_le n Run time: 0.0s SUM_ZERO = |- !f N. (!n. n num_ge N ==> (f n = & 0)) ==> (!m n. m num_ge N ==> (Sum(m,n)f = & 0)) Run time: 0.0s Intermediate theorems generated: 145 SUM_ADD = |- !f g m n. Sum(m,n)(\n'. (f n') + (g n')) = (Sum(m,n)f) + (Sum(m,n)g) Run time: 0.0s Intermediate theorems generated: 133 SUM_CMUL = |- !f c m n. Sum(m,n)(\n'. c * (f n')) = c * (Sum(m,n)f) Run time: 0.0s Intermediate theorems generated: 100 SUM_NEG = |- !f n d. Sum(n,d)(\n'. --(f n')) = --(Sum(n,d)f) Run time: 0.0s Intermediate theorems generated: 89 SUM_SUB = |- !f g m n. Sum(m,n)(\n. (f n) - (g n)) = (Sum(m,n)f) - (Sum(m,n)g) Run time: 0.1s Intermediate theorems generated: 74 Theorem LESS_MONO_ADD autoloading from theory `arithmetic` ... LESS_MONO_ADD = |- !m n p. m num_lt n ==> (m num_add p) num_lt (n num_add p) Run time: 0.0s Theorem LESS_IMP_LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_IMP_LESS_OR_EQ = |- !m n. m num_lt n ==> m num_le n Run time: 0.0s Theorem LESS_EQ_IMP_LESS_SUC autoloading from theory `arithmetic` ... LESS_EQ_IMP_LESS_SUC = |- !n m. n num_le m ==> n num_lt (SUC m) Run time: 0.0s SUM_SUBST = |- !f g m n. (!p. m num_le p /\ p num_lt (m num_add n) ==> (f p = g p)) ==> (Sum(m,n)f = Sum(m,n)g) Run time: 0.0s Intermediate theorems generated: 221 SUM_NSUB = |- !n f c. (Sum(0,n)f) - ((& n) * c) = Sum(0,n)(\p. (f p) - c) Run time: 0.0s Intermediate theorems generated: 239 Theorem LESS_SUC autoloading from theory `prim_rec` ... LESS_SUC = |- !m n. m num_lt n ==> m num_lt (SUC n) Run time: 0.0s SUM_BOUND = |- !f K m n. (!p. m num_le p /\ p num_lt (m num_add n) ==> (f p) <= K) ==> (Sum(m,n)f) <= ((& n) * K) Run time: 0.0s Intermediate theorems generated: 226 SUM_GROUP = |- !n k f. Sum(0,n)(\m. Sum(m num_mul k,k)f) = Sum(0,n num_mul k)f Run time: 0.0s Intermediate theorems generated: 169 SUM_1 = |- !f n. Sum(n,1)f = f n Run time: 0.0s Intermediate theorems generated: 56 SUM_2 = |- !f n. Sum(n,2)f = (f n) + (f(n num_add 1)) Run time: 0.0s Intermediate theorems generated: 81 SUM_OFFSET = |- !f n k. Sum(0,n)(\m. f(m num_add k)) = (Sum(0,n num_add k)f) - (Sum(0,k)f) Run time: 0.1s Intermediate theorems generated: 141 SUM_REINDEX = |- !f m k n. Sum(m num_add k,n)f = Sum(m,n)(\r. f(r num_add k)) Run time: 0.0s Intermediate theorems generated: 117 SUM_0 = |- !m n. Sum(m,n)(\r. & 0) = & 0 Run time: 0.0s Intermediate theorems generated: 72 Theorem ADD_SUC autoloading from theory `arithmetic` ... ADD_SUC = |- !m n. SUC(m num_add n) = m num_add (SUC n) Run time: 0.0s Theorem INV_SUC_EQ autoloading from theory `prim_rec` ... INV_SUC_EQ = |- !m n. (SUC m = SUC n) = (m = n) Run time: 0.0s Theorem LESS_REFL autoloading from theory `prim_rec` ... LESS_REFL = |- !n. ~n num_lt n Run time: 0.0s Theorem LESS_ADD_SUC autoloading from theory `arithmetic` ... LESS_ADD_SUC = |- !m n. m num_lt (m num_add (SUC n)) Run time: 0.0s Theorem LESS_MONO_EQ autoloading from theory `arithmetic` ... LESS_MONO_EQ = |- !m n. (SUC m) num_lt (SUC n) = m num_lt n Run time: 0.0s Theorem SUC_SUB1 autoloading from theory `arithmetic` ... SUC_SUB1 = |- !m. (SUC m) num_sub 1 = m Run time: 0.0s Theorem LESS_ADD_1 autoloading from theory `arithmetic` ... LESS_ADD_1 = |- !m n. n num_lt m ==> (?p. m = n num_add (p num_add 1)) Run time: 0.0s Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m num_le n = m num_lt n \/ (m = n) Run time: 0.0s Intermediate theorems generated: 1 Theorem LESS_EQ autoloading from theory `arithmetic` ... LESS_EQ = |- !m n. m num_lt n = (SUC m) num_le n Run time: 0.0s Theorem LESS_CASES autoloading from theory `arithmetic` ... LESS_CASES = |- !m n. m num_lt n \/ n num_le m Run time: 0.0s SUM_PERMUTE_0 = |- !n p. (!y. y num_lt n ==> (?! x. x num_lt n /\ (p x = y))) ==> (!f. Sum(0,n)(\n'. f(p n')) = Sum(0,n)f) Run time: 0.1s Intermediate theorems generated: 2469 SUM_CANCEL = |- !f n d. Sum(n,d)(\n'. (f(SUC n')) - (f n')) = (f(n num_add d)) - (f n) Run time: 0.0s Intermediate theorems generated: 206 () : void Run time: 0.0s Intermediate theorems generated: 1 File real.ml loaded () : void Run time: 2.0s Intermediate theorems generated: 23746 #\ echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `topology.ml`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool false : bool () : void Theory REAL loaded () : void false : bool Run time: 0.0s LAND_CONV = - : (conv -> conv) Run time: 0.0s TAUT_CONV = - : conv Run time: 0.0s AC = - : ((thm # thm) -> conv) Run time: 0.0s GEN_PAIR_TAC = - : tactic Run time: 0.0s MK_COMB_TAC = - : tactic Run time: 0.0s BINOP_TAC = - : tactic Run time: 0.0s SYM_CANON_CONV = - : (thm -> ((term # term) -> bool) -> conv) Run time: 0.0s IMP_SUBST_TAC = - : thm_tactic Run time: 0.0s ABBREV_TAC = - : (term -> tactic) Run time: 0.0s EXT_CONV = - : conv Run time: 0.0s ABS_TAC = - : tactic Run time: 0.0s EQUAL_TAC = - : tactic Run time: 0.0s X_BETA_CONV = - : (term -> conv) Run time: 0.0s EXACT_CONV = - : (thm list -> conv) Run time: 0.0s HABS_CONV = - : conv Run time: 0.0s autoload_definitions = - : (string -> void) Run time: 0.0s autoload_theorems = - : (string -> void) Run time: 0.0s EXPAND_TAC = - : (string -> tactic) Run time: 0.0s File useful loaded () : void Run time: 0.0s [] : (string # string) list Run time: 0.0s () : void Run time: 0.0s Intermediate theorems generated: 11 () : void Run time: 0.0s () : void Run time: 0.0s re_Union = |- !S. re_Union S = (\x. ?s. S s /\ s x) Run time: 0.0s Intermediate theorems generated: 2 re_union = |- !P Q. P re_union Q = (\x. P x \/ Q x) Run time: 0.0s Intermediate theorems generated: 2 re_intersect = |- !P Q. P re_intersect Q = (\x. P x /\ Q x) Run time: 0.0s Intermediate theorems generated: 2 re_null = |- re_null = (\x. F) Run time: 0.0s Intermediate theorems generated: 2 re_universe = |- re_universe = (\x. T) Run time: 0.0s Intermediate theorems generated: 2 re_subset = |- !P Q. P re_subset Q = (!x. P x ==> Q x) Run time: 0.0s Intermediate theorems generated: 2 re_compl = |- !S. re_compl S = (\x. ~S x) Run time: 0.0s Intermediate theorems generated: 2 SUBSET_REFL = |- !S. S re_subset S Run time: 0.0s Intermediate theorems generated: 16 COMPL_MEM = |- !S x. S x = ~re_compl S x Run time: 0.0s Intermediate theorems generated: 23 SUBSET_ANTISYM = |- !P Q. P re_subset Q /\ Q re_subset P = (P = Q) Run time: 0.0s Intermediate theorems generated: 99 SUBSET_TRANS = |- !P Q R. P re_subset Q /\ Q re_subset R ==> P re_subset R Run time: 0.0s Intermediate theorems generated: 49 istopology = |- !L. istopology L = L re_null /\ L re_universe /\ (!a b. L a /\ L b ==> L(a re_intersect b)) /\ (!P. P re_subset L ==> L(re_Union P)) Run time: 0.0s Intermediate theorems generated: 2 topology_tydef = |- ?rep. TYPE_DEFINITION istopology rep Run time: 0.0s Intermediate theorems generated: 86 topology_tybij = |- (!a. topology(open a) = a) /\ (!r. istopology r = (open(topology r) = r)) Run time: 0.0s Intermediate theorems generated: 4 TOPOLOGY = |- !L. open L re_null /\ open L re_universe /\ (!x y. open L x /\ open L y ==> open L(x re_intersect y)) /\ (!P. P re_subset (open L) ==> open L(re_Union P)) Run time: 0.0s Intermediate theorems generated: 34 TOPOLOGY_UNION = |- !L P. P re_subset (open L) ==> open L(re_Union P) Run time: 0.0s Intermediate theorems generated: 45 neigh = |- !top N x. neigh top(N,x) = (?P. open top P /\ P re_subset N /\ P x) Run time: 0.0s Intermediate theorems generated: 2 OPEN_OWN_NEIGH = |- !S top x. open top S /\ S x ==> neigh top(S,x) Run time: 0.1s Intermediate theorems generated: 40 OPEN_UNOPEN = |- !S top. open top S = (re_Union(\P. open top P /\ P re_subset S) = S) Run time: 0.0s Intermediate theorems generated: 212 OPEN_SUBOPEN = |- !S top. open top S = (!x. S x ==> (?P. P x /\ open top P /\ P re_subset S)) Run time: 0.0s Intermediate theorems generated: 245 OPEN_NEIGH = |- !S top. open top S = (!x. S x ==> (?N. neigh top(N,x) /\ N re_subset S)) Run time: 0.0s Intermediate theorems generated: 170 closed = |- !L S. closed L S = open L(re_compl S) Run time: 0.0s Intermediate theorems generated: 2 limpt = |- !top x S. limpt top x S = (!N. neigh top(N,x) ==> (?y. ~(x = y) /\ S y /\ N y)) Run time: 0.0s Intermediate theorems generated: 2 CLOSED_LIMPT = |- !top S. closed top S = (!x. limpt top x S ==> S x) Run time: 0.0s Intermediate theorems generated: 433 ismet = |- !m. ismet m = (!x y. (m(x,y) = & 0) = (x = y)) /\ (!x y z. (m(y,z)) <= ((m(x,y)) + (m(x,z)))) Run time: 0.0s Intermediate theorems generated: 2 Theorem REAL_LE_ADD2 autoloading from theory `REAL` ... REAL_LE_ADD2 = |- !w x y z. w <= x /\ y <= z ==> (w + y) <= (x + z) Run time: 0.0s Theorem REAL_LE_01 autoloading from theory `REAL` ... REAL_LE_01 = |- (& 0) <= (& 1) Run time: 0.0s Theorem REAL_LE_REFL autoloading from theory `REAL` ... REAL_LE_REFL = |- !x. x <= x Run time: 0.0s Theorem REAL_ADD_RID autoloading from theory `REAL` ... REAL_ADD_RID = |- !x. x + (& 0) = x Run time: 0.0s Theorem REAL_ADD_LID autoloading from theory `REAL` ... REAL_ADD_LID = |- !x. (& 0) + x = x Run time: 0.0s Theorem REAL_10 autoloading from theory `REAL` ... REAL_10 = |- ~(& 1 = & 0) Run time: 0.0s metric_tydef = |- ?rep. TYPE_DEFINITION ismet rep Run time: 0.0s Intermediate theorems generated: 560 metric_tybij = |- (!a. metric(dist a) = a) /\ (!r. ismet r = (dist(metric r) = r)) Run time: 0.0s Intermediate theorems generated: 4 METRIC_ISMET = |- !m. ismet(dist m) Run time: 0.0s Intermediate theorems generated: 20 METRIC_ZERO = |- !m x y. (dist m(x,y) = & 0) = (x = y) Run time: 0.0s Intermediate theorems generated: 41 METRIC_SAME = |- !m x. dist m(x,x) = & 0 Run time: 0.0s Intermediate theorems generated: 16 Theorem REAL_LT_ADD2 autoloading from theory `REAL` ... REAL_LT_ADD2 = |- !w x y z. w < x /\ y < z ==> (w + y) < (x + z) Run time: 0.0s Theorem REAL_NOT_LE autoloading from theory `REAL` ... REAL_NOT_LE = |- !x y. ~x <= y = y < x Run time: 0.0s METRIC_POS = |- !m x y. (& 0) <= (dist m(x,y)) Run time: 0.0s Intermediate theorems generated: 91 Theorem REAL_LE_ANTISYM autoloading from theory `REAL` ... REAL_LE_ANTISYM = |- !x y. x <= y /\ y <= x = (x = y) Run time: 0.0s METRIC_SYM = |- !m x y. dist m(x,y) = dist m(y,x) Run time: 0.0s Intermediate theorems generated: 99 METRIC_TRIANGLE = |- !m x y z. (dist m(x,z)) <= ((dist m(x,y)) + (dist m(y,z))) Run time: 0.0s Intermediate theorems generated: 52 Theorem REAL_LE_LT autoloading from theory `REAL` ... REAL_LE_LT = |- !x y. x <= y = x < y \/ (x = y) Run time: 0.0s METRIC_NZ = |- !m x y. ~(x = y) ==> (& 0) < (dist m(x,y)) Run time: 0.0s Intermediate theorems generated: 78 mtop = |- !m. mtop m = topology (\S. !x. S x ==> (?e. (& 0) < e /\ (!y. (dist m(x,y)) < e ==> S y))) Run time: 0.1s Intermediate theorems generated: 2 Theorem REAL_LT_TRANS autoloading from theory `REAL` ... REAL_LT_TRANS = |- !x y z. x < y /\ y < z ==> x < z Run time: 0.0s Theorem REAL_LT_TOTAL autoloading from theory `REAL` ... REAL_LT_TOTAL = |- !x y. (x = y) \/ x < y \/ y < x Run time: 0.0s Theorem REAL_LT_01 autoloading from theory `REAL` ... REAL_LT_01 = |- (& 0) < (& 1) Run time: 0.0s mtop_istopology = |- !m. istopology (\S. !x. S x ==> (?e. (& 0) < e /\ (!y. (dist m(x,y)) < e ==> S y))) Run time: 0.0s Intermediate theorems generated: 544 MTOP_OPEN = |- !m. open(mtop m)S = (!x. S x ==> (?e. (& 0) < e /\ (!y. (dist m(x,y)) < e ==> S y))) Run time: 0.0s Intermediate theorems generated: 38 ball = |- !m x e. B m(x,e) = (\y. (dist m(x,y)) < e) Run time: 0.0s Intermediate theorems generated: 2 Theorem REAL_LET_TRANS autoloading from theory `REAL` ... REAL_LET_TRANS = |- !x y z. x <= y /\ y < z ==> x < z Run time: 0.0s Theorem REAL_ADD_SYM autoloading from theory `REAL` ... REAL_ADD_SYM = |- !x y. x + y = y + x Run time: 0.0s Theorem REAL_LT_SUB_LADD autoloading from theory `REAL` ... REAL_LT_SUB_LADD = |- !x y z. x < (y - z) = (x + z) < y Run time: 0.0s Theorem REAL_SUB_LT autoloading from theory `REAL` ... REAL_SUB_LT = |- !x y. (& 0) < (x - y) = y < x Run time: 0.0s BALL_OPEN = |- !m x e. (& 0) < e ==> open(mtop m)(B m(x,e)) Run time: 0.0s Intermediate theorems generated: 161 BALL_NEIGH = |- !m x e. (& 0) < e ==> neigh(mtop m)(B m(x,e),x) Run time: 0.0s Intermediate theorems generated: 76 MTOP_LIMPT = |- !m x S. limpt(mtop m)x S = (!e. (& 0) < e ==> (?y. ~(x = y) /\ S y /\ (dist m(x,y)) < e)) Run time: 0.0s Intermediate theorems generated: 298 Theorem REAL_ADD_LINV autoloading from theory `REAL` ... REAL_ADD_LINV = |- !x. (-- x) + x = & 0 Run time: 0.0s Theorem REAL_ADD_ASSOC autoloading from theory `REAL` ... REAL_ADD_ASSOC = |- !x y z. x + (y + z) = (x + y) + z Run time: 0.0s Definition real_sub autoloading from theory `REAL` ... real_sub = |- !x y. x - y = x + (-- y) Run time: 0.0s Intermediate theorems generated: 1 Theorem ABS_TRIANGLE autoloading from theory `REAL` ... ABS_TRIANGLE = |- !x y. (abs(x + y)) <= ((abs x) + (abs y)) Run time: 0.0s Theorem ABS_NEG autoloading from theory `REAL` ... ABS_NEG = |- !x. abs(-- x) = abs x Run time: 0.0s Theorem REAL_NEG_SUB autoloading from theory `REAL` ... REAL_NEG_SUB = |- !x y. --(x - y) = y - x Run time: 0.0s Theorem REAL_SUB_0 autoloading from theory `REAL` ... REAL_SUB_0 = |- !x y. (x - y = & 0) = (x = y) Run time: 0.0s Theorem ABS_ZERO autoloading from theory `REAL` ... ABS_ZERO = |- !x. (abs x = & 0) = (x = & 0) Run time: 0.0s ISMET_R1 = |- ismet(\(x,y). abs(y - x)) Run time: 0.0s Intermediate theorems generated: 204 mr1 = |- mr1 = metric(\(x,y). abs(y - x)) Run time: 0.0s Intermediate theorems generated: 2 MR1_DEF = |- !x y. dist mr1(x,y) = abs(y - x) Run time: 0.0s Intermediate theorems generated: 32 Theorem REAL_ADD_SUB autoloading from theory `REAL` ... REAL_ADD_SUB = |- !x y. (x + y) - x = y Run time: 0.0s MR1_ADD = |- !x d. dist mr1(x,x + d) = abs d Run time: 0.0s Intermediate theorems generated: 25 Theorem REAL_SUB_SUB autoloading from theory `REAL` ... REAL_SUB_SUB = |- !x y. (x - y) - x = -- y Run time: 0.0s MR1_SUB = |- !x d. dist mr1(x,x - d) = abs d Run time: 0.0s Intermediate theorems generated: 30 Definition abs autoloading from theory `REAL` ... abs = |- !x. abs x = ((& 0) <= x => x | -- x) Run time: 0.0s Intermediate theorems generated: 1 MR1_ADD_LE = |- !x d. (& 0) <= d ==> (dist mr1(x,x + d) = d) Run time: 0.0s Intermediate theorems generated: 34 MR1_SUB_LE = |- !x d. (& 0) <= d ==> (dist mr1(x,x - d) = d) Run time: 0.0s Intermediate theorems generated: 34 Theorem REAL_LT_IMP_LE autoloading from theory `REAL` ... REAL_LT_IMP_LE = |- !x y. x < y ==> x <= y Run time: 0.0s MR1_ADD_LT = |- !x d. (& 0) < d ==> (dist mr1(x,x + d) = d) Run time: 0.0s Intermediate theorems generated: 11 MR1_SUB_LT = |- !x d. (& 0) < d ==> (dist mr1(x,x - d) = d) Run time: 0.0s Intermediate theorems generated: 11 Theorem ABS_BETWEEN1 autoloading from theory `REAL` ... ABS_BETWEEN1 = |- !x y z. x < z /\ (abs(y - x)) < (z - x) ==> y < z Run time: 0.0s MR1_BETWEEN1 = |- !x y z. x < z /\ (dist mr1(x,y)) < (z - x) ==> y < z Run time: 0.0s Intermediate theorems generated: 29 Theorem REAL_LT_IMP_NE autoloading from theory `REAL` ... REAL_LT_IMP_NE = |- !x y. x < y ==> ~(x = y) Run time: 0.0s Theorem REAL_ADD_RID_UNIQ autoloading from theory `REAL` ... REAL_ADD_RID_UNIQ = |- !x y. (x + y = x) = (y = & 0) Run time: 0.0s Theorem REAL_LT_HALF2 autoloading from theory `REAL` ... REAL_LT_HALF2 = |- !d. (d / (& 2)) < d = (& 0) < d Run time: 0.0s Theorem REAL_LT_HALF1 autoloading from theory `REAL` ... REAL_LT_HALF1 = |- !d. (& 0) < (d / (& 2)) = (& 0) < d Run time: 0.0s MR1_LIMPT = |- !x. limpt(mtop mr1)x re_universe Run time: 0.0s Intermediate theorems generated: 143 () : void Run time: 0.0s Intermediate theorems generated: 1 File topology.ml loaded () : void Run time: 0.2s Intermediate theorems generated: 4132 #\ echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `nets.ml`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool false : bool () : void Theory TOPOLOGY loaded () : void false : bool Run time: 0.0s LAND_CONV = - : (conv -> conv) Run time: 0.0s TAUT_CONV = - : conv Run time: 0.0s AC = - : ((thm # thm) -> conv) Run time: 0.0s GEN_PAIR_TAC = - : tactic Run time: 0.0s MK_COMB_TAC = - : tactic Run time: 0.0s BINOP_TAC = - : tactic Run time: 0.0s SYM_CANON_CONV = - : (thm -> ((term # term) -> bool) -> conv) Run time: 0.0s IMP_SUBST_TAC = - : thm_tactic Run time: 0.0s ABBREV_TAC = - : (term -> tactic) Run time: 0.0s EXT_CONV = - : conv Run time: 0.0s ABS_TAC = - : tactic Run time: 0.0s EQUAL_TAC = - : tactic Run time: 0.0s X_BETA_CONV = - : (term -> conv) Run time: 0.0s EXACT_CONV = - : (thm list -> conv) Run time: 0.0s HABS_CONV = - : conv Run time: 0.0s autoload_definitions = - : (string -> void) Run time: 0.0s autoload_theorems = - : (string -> void) Run time: 0.0s EXPAND_TAC = - : (string -> tactic) Run time: 0.0s File useful loaded () : void Run time: 0.0s real_interface_map = [(`--`, `real_neg`); (`num_add`, `+`); (`+`, `real_add`); (`num_mul`, `*`); (`*`, `real_mul`); (`num_sub`, `-`); (`-`, `real_sub`); (`num_lt`, `<`); (`<`, `real_lt`); (`num_le`, `<=`); (`<=`, `real_le`); (`num_gt`, `>`); (`>`, `real_gt`); (`num_ge`, `>=`); (`>=`, `real_ge`); (`inv`, `real_inv`); (`&`, `real_of_num`)] : (string # string) list Run time: 0.0s [] : (string # string) list Run time: 0.0s () : void Run time: 0.0s Intermediate theorems generated: 30 () : void Run time: 0.0s () : void Run time: 0.0s dorder = |- !g. dorder g = (!x y. g x x /\ g y y ==> (?z. g z z /\ (!w. g w z ==> g w x /\ g w y))) Run time: 0.0s Intermediate theorems generated: 2 tends = |- !s l top g. (s tends l)(top,g) = (!N. neigh top(N,l) ==> (?n. g n n /\ (!m. g m n ==> N(s m)))) Run time: 0.0s Intermediate theorems generated: 2 bounded = |- !m g f. bounded(m,g)f = (?k x N. g N N /\ (!n. g n N ==> (dist m(f n,x)) < k)) Run time: 0.0s Intermediate theorems generated: 2 tendsto = |- !m x y z. tendsto(m,x)y z = (& 0) < (dist m(x,y)) /\ (dist m(x,y)) <= (dist m(x,z)) Run time: 0.1s Intermediate theorems generated: 2 [(`--`, `real_neg`); (`num_add`, `+`); (`+`, `real_add`); (`num_mul`, `*`); (`*`, `real_mul`); (`num_sub`, `-`); (`-`, `real_sub`); (`num_lt`, `<`); (`<`, `real_lt`); (`num_le`, `<=`); (`<=`, `real_le`); (`num_gt`, `>`); (`>`, `real_gt`); (`num_ge`, `>=`); (`>=`, `real_ge`); (`inv`, `real_inv`); (`&`, `real_of_num`)] : (string # string) list Run time: 0.0s DORDER_LEMMA = |- !g. dorder g ==> (!P Q. (?n. g n n /\ (!m. g m n ==> P m)) /\ (?n. g n n /\ (!m. g m n ==> Q m)) ==> (?n. g n n /\ (!m. g m n ==> P m /\ Q m))) Run time: 0.0s Intermediate theorems generated: 312 DORDER_THEN = - : ((thm -> *) -> thm -> *) Run time: 0.0s Theorem LESS_EQ_TRANS autoloading from theory `arithmetic` ... LESS_EQ_TRANS = |- !m n p. m num_le n /\ n num_le p ==> m num_le p Run time: 0.0s Theorem LESS_EQ_CASES autoloading from theory `arithmetic` ... LESS_EQ_CASES = |- !m n. m num_le n \/ n num_le m Run time: 0.0s Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m num_le m Run time: 0.0s Theorem GREATER_EQ autoloading from theory `arithmetic` ... GREATER_EQ = |- !n m. n num_ge m = m num_le n Run time: 0.0s DORDER_NGE = |- dorder $num_ge Run time: 0.0s Intermediate theorems generated: 136 Theorem REAL_LE_TRANS autoloading from theory `REAL` ... REAL_LE_TRANS = |- !x y z. x <= y /\ y <= z ==> x <= z Run time: 0.0s Theorem REAL_LE_TOTAL autoloading from theory `REAL` ... REAL_LE_TOTAL = |- !x y. x <= y \/ y <= x Run time: 0.0s Theorem REAL_LE_REFL autoloading from theory `REAL` ... REAL_LE_REFL = |- !x. x <= x Run time: 0.0s DORDER_TENDSTO = |- !m x. dorder(tendsto(m,x)) Run time: 0.0s Intermediate theorems generated: 257 Definition re_subset autoloading from theory `TOPOLOGY` ... re_subset = |- !P Q. P re_subset Q = (!x. P x ==> Q x) Run time: 0.0s Intermediate theorems generated: 1 Theorem MTOP_OPEN autoloading from theory `TOPOLOGY` ... MTOP_OPEN = |- !m. open(mtop m)S = (!x. S x ==> (?e. (& 0) < e /\ (!y. (dist m(x,y)) < e ==> S y))) Run time: 0.0s Definition neigh autoloading from theory `TOPOLOGY` ... neigh = |- !top N x. neigh top(N,x) = (?P. open top P /\ P re_subset N /\ P x) Run time: 0.0s Intermediate theorems generated: 1 Theorem METRIC_SYM autoloading from theory `TOPOLOGY` ... METRIC_SYM = |- !m x y. dist m(x,y) = dist m(y,x) Run time: 0.0s Definition ball autoloading from theory `TOPOLOGY` ... ball = |- !m x e. B m(x,e) = (\y. (dist m(x,y)) < e) Run time: 0.0s Intermediate theorems generated: 1 Theorem BALL_NEIGH autoloading from theory `TOPOLOGY` ... BALL_NEIGH = |- !m x e. (& 0) < e ==> neigh(mtop m)(B m(x,e),x) Run time: 0.0s MTOP_TENDS = |- !d g x x0. (x --> x0)(mtop d,g) = (!e. (& 0) < e ==> (?n. g n n /\ (!m. g m n ==> (dist d(x m,x0)) < e))) Run time: 0.0s Intermediate theorems generated: 373 Theorem METRIC_TRIANGLE autoloading from theory `TOPOLOGY` ... METRIC_TRIANGLE = |- !m x y z. (dist m(x,z)) <= ((dist m(x,y)) + (dist m(y,z))) Run time: 0.0s Theorem REAL_NOT_LT autoloading from theory `REAL` ... REAL_NOT_LT = |- !x y. ~x < y = y <= x Run time: 0.0s Theorem REAL_HALF_DOUBLE autoloading from theory `REAL` ... REAL_HALF_DOUBLE = |- !x. (x / (& 2)) + (x / (& 2)) = x Run time: 0.0s Theorem REAL_LT_ADD2 autoloading from theory `REAL` ... REAL_LT_ADD2 = |- !w x y z. w < x /\ y < z ==> (w + y) < (x + z) Run time: 0.0s Theorem METRIC_NZ autoloading from theory `TOPOLOGY` ... METRIC_NZ = |- !m x y. ~(x = y) ==> (& 0) < (dist m(x,y)) Run time: 0.0s Theorem REAL_LT_HALF1 autoloading from theory `REAL` ... REAL_LT_HALF1 = |- !d. (& 0) < (d / (& 2)) = (& 0) < d Run time: 0.0s MTOP_TENDS_UNIQ = |- !g d. dorder g ==> (x --> x0)(mtop d,g) /\ (x --> x1)(mtop d,g) ==> (x0 = x1) Run time: 0.0s Intermediate theorems generated: 313 SEQ_TENDS = |- !d x x0. (x --> x0)(mtop d,$num_ge) = (!e. (& 0) < e ==> (?N. !n. n num_ge N ==> (dist d(x n,x0)) < e)) Run time: 0.0s Intermediate theorems generated: 64 Theorem REAL_LT_IMP_LE autoloading from theory `REAL` ... REAL_LT_IMP_LE = |- !x y. x < y ==> x <= y Run time: 0.0s Definition re_universe autoloading from theory `TOPOLOGY` ... re_universe = |- re_universe = (\x. T) Run time: 0.0s Intermediate theorems generated: 1 Theorem MTOP_LIMPT autoloading from theory `TOPOLOGY` ... MTOP_LIMPT = |- !m x S. limpt(mtop m)x S = (!e. (& 0) < e ==> (?y. ~(x = y) /\ S y /\ (dist m(x,y)) < e)) Run time: 0.0s LIM_TENDS = |- !m1 m2 f x0 y0. limpt(mtop m1)x0 re_universe ==> ((f --> y0)(mtop m2,tendsto(m1,x0)) = (!e. (& 0) < e ==> (?d. (& 0) < d /\ (!x. (& 0) < (dist m1(x,x0)) /\ (dist m1(x,x0)) <= d ==> (dist m2(f x,y0)) < e)))) Run time: 0.0s Intermediate theorems generated: 459 Theorem REAL_LT_HALF2 autoloading from theory `REAL` ... REAL_LT_HALF2 = |- !d. (d / (& 2)) < d = (& 0) < d Run time: 0.0s Theorem REAL_LET_TRANS autoloading from theory `REAL` ... REAL_LET_TRANS = |- !x y z. x <= y /\ y < z ==> x < z Run time: 0.0s LIM_TENDS2 = |- !m1 m2 f x0 y0. limpt(mtop m1)x0 re_universe ==> ((f --> y0)(mtop m2,tendsto(m1,x0)) = (!e. (& 0) < e ==> (?d. (& 0) < d /\ (!x. (& 0) < (dist m1(x,x0)) /\ (dist m1(x,x0)) < d ==> (dist m2(f x,y0)) < e)))) Run time: 0.0s Intermediate theorems generated: 246 Theorem ABS_NEG autoloading from theory `REAL` ... ABS_NEG = |- !x. abs(-- x) = abs x Run time: 0.0s Theorem REAL_SUB_LZERO autoloading from theory `REAL` ... REAL_SUB_LZERO = |- !x. (& 0) - x = -- x Run time: 0.0s Theorem ABS_SUB autoloading from theory `REAL` ... ABS_SUB = |- !x y. abs(x - y) = abs(y - x) Run time: 0.0s Theorem REAL_LT_RADD autoloading from theory `REAL` ... REAL_LT_RADD = |- !x y z. (x + z) < (y + z) = x < y Run time: 0.0s Theorem REAL_ADD_SYM autoloading from theory `REAL` ... REAL_ADD_SYM = |- !x y. x + y = y + x Run time: 0.0s Theorem ABS_TRIANGLE autoloading from theory `REAL` ... ABS_TRIANGLE = |- !x y. (abs(x + y)) <= ((abs x) + (abs y)) Run time: 0.0s Theorem REAL_SUB_ADD autoloading from theory `REAL` ... REAL_SUB_ADD = |- !x y. (x - y) + y = x Run time: 0.0s Theorem MR1_DEF autoloading from theory `TOPOLOGY` ... MR1_DEF = |- !x y. dist mr1(x,y) = abs(y - x) Run time: 0.0s MR1_BOUNDED = |- !g f. bounded(mr1,g)f = (?k N. g N N /\ (!n. g n N ==> (abs(f n)) < k)) Run time: 0.0s Intermediate theorems generated: 331 Theorem REAL_NEG_SUB autoloading from theory `REAL` ... REAL_NEG_SUB = |- !x y. --(x - y) = y - x Run time: 0.0s NET_NULL = |- !g x x0. (x --> x0)(mtop mr1,g) = ((\n. (x n) - x0) --> (& 0))(mtop mr1,g) Run time: 0.0s Intermediate theorems generated: 151 Theorem LESS_0 autoloading from theory `prim_rec` ... LESS_0 = |- !n. 0 num_lt (SUC n) Run time: 0.0s Theorem REAL_LT autoloading from theory `REAL` ... REAL_LT = |- !m n. (& m) < (& n) = m num_lt n Run time: 0.0s NET_CONV_BOUNDED = |- !g x x0. (x --> x0)(mtop mr1,g) ==> bounded(mr1,g)x Run time: 0.0s Intermediate theorems generated: 119 Theorem REAL_LT_REFL autoloading from theory `REAL` ... REAL_LT_REFL = |- !x. ~x < x Run time: 0.0s Theorem REAL_SUB_RZERO autoloading from theory `REAL` ... REAL_SUB_RZERO = |- !x. x - (& 0) = x Run time: 0.0s Theorem ABS_NZ autoloading from theory `REAL` ... ABS_NZ = |- !x. ~(x = & 0) = (& 0) < (abs x) Run time: 0.0s NET_CONV_NZ = |- !g x x0. (x --> x0)(mtop mr1,g) /\ ~(x0 = & 0) ==> (?N. g N N /\ (!n. g n N ==> ~(x n = & 0))) Run time: 0.0s Intermediate theorems generated: 165 Theorem REAL_LT_INV autoloading from theory `REAL` ... REAL_LT_INV = |- !x y. (& 0) < x /\ x < y ==> (inv y) < (inv x) Run time: 0.0s Theorem ABS_INV autoloading from theory `REAL` ... ABS_INV = |- !x. ~(x = & 0) ==> (abs(inv x) = inv(abs x)) Run time: 0.0s Theorem REAL_INJ autoloading from theory `REAL` ... REAL_INJ = |- !m n. (& m = & n) = (m = n) Run time: 0.0s Theorem ABS_ABS autoloading from theory `REAL` ... ABS_ABS = |- !x. abs(abs x) = abs x Run time: 0.0s Theorem REAL_MUL_LID autoloading from theory `REAL` ... REAL_MUL_LID = |- !x. (& 1) * x = x Run time: 0.0s Theorem REAL_MUL_LINV autoloading from theory `REAL` ... REAL_MUL_LINV = |- !x. ~(x = & 0) ==> ((inv x) * x = & 1) Run time: 0.0s Theorem REAL_MUL_SYM autoloading from theory `REAL` ... REAL_MUL_SYM = |- !x y. x * y = y * x Run time: 0.0s Theorem REAL_MUL_ASSOC autoloading from theory `REAL` ... REAL_MUL_ASSOC = |- !x y z. x * (y * z) = (x * y) * z Run time: 0.0s Definition real_div autoloading from theory `REAL` ... real_div = |- !x y. x / y = x * (inv y) Run time: 0.0s Intermediate theorems generated: 1 Theorem REAL_RINV_UNIQ autoloading from theory `REAL` ... REAL_RINV_UNIQ = |- !x y. (x * y = & 1) ==> (y = inv x) Run time: 0.0s Theorem REAL_LT_TRANS autoloading from theory `REAL` ... REAL_LT_TRANS = |- !x y z. x < y /\ y < z ==> x < z Run time: 0.0s Theorem REAL_LT_LADD autoloading from theory `REAL` ... REAL_LT_LADD = |- !x y z. (x + y) < (x + z) = y < z Run time: 0.0s NET_CONV_IBOUNDED = |- !g x x0. (x --> x0)(mtop mr1,g) /\ ~(x0 = & 0) ==> bounded(mr1,g)(\n. inv(x n)) Run time: 0.0s Intermediate theorems generated: 493 NET_NULL_ADD = |- !g. dorder g ==> (!x y. (x --> (& 0))(mtop mr1,g) /\ (y --> (& 0))(mtop mr1,g) ==> ((\n. (x n) + (y n)) --> (& 0))(mtop mr1,g)) Run time: 0.0s Intermediate theorems generated: 324 Theorem REAL_LT_MUL2 autoloading from theory `REAL` ... REAL_LT_MUL2 = |- !x1 x2 y1 y2. (& 0) <= x1 /\ (& 0) <= y1 /\ x1 < x2 /\ y1 < y2 ==> (x1 * y1) < (x2 * y2) Run time: 0.0s Theorem ABS_MUL autoloading from theory `REAL` ... ABS_MUL = |- !x y. abs(x * y) = (abs x) * (abs y) Run time: 0.0s Theorem REAL_DIV_LMUL autoloading from theory `REAL` ... REAL_DIV_LMUL = |- !x y. ~(y = & 0) ==> (y * (x / y) = x) Run time: 0.0s Theorem REAL_LT_RDIV_0 autoloading from theory `REAL` ... REAL_LT_RDIV_0 = |- !y z. (& 0) < z ==> ((& 0) < (y / z) = (& 0) < y) Run time: 0.0s Theorem ABS_POS autoloading from theory `REAL` ... ABS_POS = |- !x. (& 0) <= (abs x) Run time: 0.0s NET_NULL_MUL = |- !g. dorder g ==> (!x y. bounded(mr1,g)x /\ (y --> (& 0))(mtop mr1,g) ==> ((\n. (x n) * (y n)) --> (& 0))(mtop mr1,g)) Run time: 0.0s Intermediate theorems generated: 484 Theorem REAL_LT_LMUL autoloading from theory `REAL` ... REAL_LT_LMUL = |- !x y z. (& 0) < x ==> ((x * y) < (x * z) = y < z) Run time: 0.0s Theorem ABS_ZERO autoloading from theory `REAL` ... ABS_ZERO = |- !x. (abs x = & 0) = (x = & 0) Run time: 0.0s Theorem REAL_INV_POS autoloading from theory `REAL` ... REAL_INV_POS = |- !x. (& 0) < x ==> (& 0) < (inv x) Run time: 0.0s Theorem REAL_LT_MUL autoloading from theory `REAL` ... REAL_LT_MUL = |- !x y. (& 0) < x /\ (& 0) < y ==> (& 0) < (x * y) Run time: 0.0s Definition abs autoloading from theory `REAL` ... abs = |- !x. abs x = ((& 0) <= x => x | -- x) Run time: 0.0s Intermediate theorems generated: 1 Theorem REAL_MUL_LZERO autoloading from theory `REAL` ... REAL_MUL_LZERO = |- !x. (& 0) * x = & 0 Run time: 0.0s Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n num_lt (SUC n) Run time: 0.0s NET_NULL_CMUL = |- !g k x. (x --> (& 0))(mtop mr1,g) ==> ((\n. k * (x n)) --> (& 0))(mtop mr1,g) Run time: 0.0s Intermediate theorems generated: 506 Theorem REAL_ADD_ASSOC autoloading from theory `REAL` ... REAL_ADD_ASSOC = |- !x y z. x + (y + z) = (x + y) + z Run time: 0.0s Theorem REAL_NEG_ADD autoloading from theory `REAL` ... REAL_NEG_ADD = |- !x y. --(x + y) = (-- x) + (-- y) Run time: 0.0s Definition real_sub autoloading from theory `REAL` ... real_sub = |- !x y. x - y = x + (-- y) Run time: 0.0s Intermediate theorems generated: 1 NET_ADD = |- !g. dorder g ==> (!x x0 y y0. (x --> x0)(mtop mr1,g) /\ (y --> y0)(mtop mr1,g) ==> ((\n. (x n) + (y n)) --> (x0 + y0))(mtop mr1,g)) Run time: 0.0s Intermediate theorems generated: 167 Theorem REAL_SUB_NEG2 autoloading from theory `REAL` ... REAL_SUB_NEG2 = |- !x y. (-- x) - (-- y) = y - x Run time: 0.0s NET_NEG = |- !g. dorder g ==> (!x x0. (x --> x0)(mtop mr1,g) = ((\n. --(x n)) --> (-- x0))(mtop mr1,g)) Run time: 0.0s Intermediate theorems generated: 121 NET_SUB = |- !g. dorder g ==> (!x x0 y y0. (x --> x0)(mtop mr1,g) /\ (y --> y0)(mtop mr1,g) ==> ((\n. (x n) - (y n)) --> (x0 - y0))(mtop mr1,g)) Run time: 0.0s Intermediate theorems generated: 95 Theorem REAL_ADD_LID autoloading from theory `REAL` ... REAL_ADD_LID = |- !x. (& 0) + x = x Run time: 0.0s Theorem REAL_ADD_LINV autoloading from theory `REAL` ... REAL_ADD_LINV = |- !x. (-- x) + x = & 0 Run time: 0.0s Theorem REAL_NEG_RMUL autoloading from theory `REAL` ... REAL_NEG_RMUL = |- !x y. --(x * y) = x * (-- y) Run time: 0.0s Theorem REAL_NEG_LMUL autoloading from theory `REAL` ... REAL_NEG_LMUL = |- !x y. --(x * y) = (-- x) * y Run time: 0.0s Theorem REAL_RDISTRIB autoloading from theory `REAL` ... REAL_RDISTRIB = |- !x y z. (x + y) * z = (x * z) + (y * z) Run time: 0.0s Theorem REAL_LDISTRIB autoloading from theory `REAL` ... REAL_LDISTRIB = |- !x y z. x * (y + z) = (x * y) + (x * z) Run time: 0.0s NET_MUL = |- !g. dorder g ==> (!x y x0 y0. (x --> x0)(mtop mr1,g) /\ (y --> y0)(mtop mr1,g) ==> ((\n. (x n) * (y n)) --> (x0 * y0))(mtop mr1,g)) Run time: 0.0s Intermediate theorems generated: 338 Theorem REAL_INV_NZ autoloading from theory `REAL` ... REAL_INV_NZ = |- !x. ~(x = & 0) ==> ~(inv x = & 0) Run time: 0.0s Theorem ABS_LT_MUL2 autoloading from theory `REAL` ... ABS_LT_MUL2 = |- !w x y z. (abs w) < y /\ (abs x) < z ==> (abs(w * x)) < (y * z) Run time: 0.0s Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m num_le n = m num_lt n \/ (m = n) Run time: 0.0s Intermediate theorems generated: 1 Theorem REAL_LE autoloading from theory `REAL` ... REAL_LE = |- !m n. (& m) <= (& n) = m num_le n Run time: 0.0s Theorem REAL_LT_IMP_NE autoloading from theory `REAL` ... REAL_LT_IMP_NE = |- !x y. x < y ==> ~(x = y) Run time: 0.0s Theorem REAL_MUL_RINV autoloading from theory `REAL` ... REAL_MUL_RINV = |- !x. ~(x = & 0) ==> (x * (inv x) = & 1) Run time: 0.0s Theorem REAL_MUL_RID autoloading from theory `REAL` ... REAL_MUL_RID = |- !x. x * (& 1) = x Run time: 0.0s Theorem REAL_SUB_LDISTRIB autoloading from theory `REAL` ... REAL_SUB_LDISTRIB = |- !x y z. x * (y - z) = (x * y) - (x * z) Run time: 0.0s NET_INV = |- !g. dorder g ==> (!x x0. (x --> x0)(mtop mr1,g) /\ ~(x0 = & 0) ==> ((\n. inv(x n)) --> (inv x0))(mtop mr1,g)) Run time: 0.0s Intermediate theorems generated: 1253 NET_DIV = |- !g. dorder g ==> (!x x0 y y0. (x --> x0)(mtop mr1,g) /\ (y --> y0)(mtop mr1,g) /\ ~(y0 = & 0) ==> ((\n. (x n) / (y n)) --> (x0 / y0))(mtop mr1,g)) Run time: 0.0s Intermediate theorems generated: 106 Theorem ABS_SUB_ABS autoloading from theory `REAL` ... ABS_SUB_ABS = |- !x y. (abs((abs x) - (abs y))) <= (abs(x - y)) Run time: 0.0s NET_ABS = |- !x x0. (x --> x0)(mtop mr1,g) ==> ((\n. abs(x n)) --> (abs x0))(mtop mr1,g) Run time: 0.0s Intermediate theorems generated: 128 Theorem ABS_BETWEEN2 autoloading from theory `REAL` ... ABS_BETWEEN2 = |- !x0 x y0 y. x0 < y0 /\ (abs(x - x0)) < ((y0 - x0) / (& 2)) /\ (abs(y - y0)) < ((y0 - x0) / (& 2)) ==> x < y Run time: 0.0s Theorem REAL_SUB_LT autoloading from theory `REAL` ... REAL_SUB_LT = |- !x y. (& 0) < (x - y) = y < x Run time: 0.0s Theorem REAL_NOT_LE autoloading from theory `REAL` ... REAL_NOT_LE = |- !x y. ~x <= y = y < x Run time: 0.0s NET_LE = |- !g. dorder g ==> (!x x0 y y0. (x --> x0)(mtop mr1,g) /\ (y --> y0)(mtop mr1,g) /\ (?N. g N N /\ (!n. g n N ==> (x n) <= (y n))) ==> x0 <= y0) Run time: 0.0s Intermediate theorems generated: 400 () : void Run time: 0.0s Intermediate theorems generated: 1 File nets.ml loaded () : void Run time: 0.6s Intermediate theorems generated: 7389 #\ echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `seq.ml`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool false : bool () : void Theory NETS loaded () : void false : bool Run time: 0.0s LAND_CONV = - : (conv -> conv) Run time: 0.0s TAUT_CONV = - : conv Run time: 0.0s AC = - : ((thm # thm) -> conv) Run time: 0.0s GEN_PAIR_TAC = - : tactic Run time: 0.0s MK_COMB_TAC = - : tactic Run time: 0.0s BINOP_TAC = - : tactic Run time: 0.0s SYM_CANON_CONV = - : (thm -> ((term # term) -> bool) -> conv) Run time: 0.0s IMP_SUBST_TAC = - : thm_tactic Run time: 0.0s ABBREV_TAC = - : (term -> tactic) Run time: 0.0s EXT_CONV = - : conv Run time: 0.0s ABS_TAC = - : tactic Run time: 0.0s EQUAL_TAC = - : tactic Run time: 0.0s X_BETA_CONV = - : (term -> conv) Run time: 0.0s EXACT_CONV = - : (thm list -> conv) Run time: 0.0s HABS_CONV = - : conv Run time: 0.0s autoload_definitions = - : (string -> void) Run time: 0.0s autoload_theorems = - : (string -> void) Run time: 0.0s EXPAND_TAC = - : (string -> tactic) Run time: 0.0s File useful loaded () : void Run time: 0.0s real_interface_map = [(`--`, `real_neg`); (`num_add`, `+`); (`+`, `real_add`); (`num_mul`, `*`); (`*`, `real_mul`); (`num_sub`, `-`); (`-`, `real_sub`); (`num_lt`, `<`); (`<`, `real_lt`); (`num_le`, `<=`); (`<=`, `real_le`); (`num_gt`, `>`); (`>`, `real_gt`); (`num_ge`, `>=`); (`>=`, `real_ge`); (`inv`, `real_inv`); (`&`, `real_of_num`)] : (string # string) list Run time: 0.0s [] : (string # string) list Run time: 0.0s () : void Run time: 0.0s Intermediate theorems generated: 34 () : void Run time: 0.0s [(); ()] : void list Run time: 0.0s tends_num_real = |- !x x0. x tends_num_real x0 = (x tends x0)(mtop mr1,$num_ge) Run time: 0.0s Intermediate theorems generated: 2 [(`--`, `real_neg`); (`num_add`, `+`); (`+`, `real_add`); (`num_mul`, `*`); (`*`, `real_mul`); (`num_sub`, `-`); (`-`, `real_sub`); (`num_lt`, `<`); (`<`, `real_lt`); (`num_le`, `<=`); (`<=`, `real_le`); (`num_gt`, `>`); (`>`, `real_gt`); (`num_ge`, `>=`); (`>=`, `real_ge`); (`inv`, `real_inv`); (`&`, `real_of_num`)] : (string # string) list Run time: 0.0s Theorem ABS_SUB autoloading from theory `REAL` ... ABS_SUB = |- !x y. abs(x - y) = abs(y - x) Run time: 0.0s Theorem MR1_DEF autoloading from theory `TOPOLOGY` ... MR1_DEF = |- !x y. dist mr1(x,y) = abs(y - x) Run time: 0.0s Theorem SEQ_TENDS autoloading from theory `NETS` ... SEQ_TENDS = |- !d x x0. (x tends x0)(mtop d,$num_ge) = (!e. (& 0) < e ==> (?N. !n. n num_ge N ==> (dist d(x n,x0)) < e)) Run time: 0.0s SEQ = |- !x x0. x --> x0 = (!e. (& 0) < e ==> (?N. !n. n num_ge N ==> (abs((x n) - x0)) < e)) Run time: 0.0s Intermediate theorems generated: 64 Theorem ABS_0 autoloading from theory `REAL` ... ABS_0 = |- abs(& 0) = & 0 Run time: 0.0s Theorem REAL_SUB_REFL autoloading from theory `REAL` ... REAL_SUB_REFL = |- !x. x - x = & 0 Run time: 0.0s SEQ_CONST = |- !k. (\x. k) --> k Run time: 0.0s Intermediate theorems generated: 58 Theorem DORDER_NGE autoloading from theory `NETS` ... DORDER_NGE = |- dorder $num_ge Run time: 0.0s Theorem NET_ADD autoloading from theory `NETS` ... NET_ADD = |- !g. dorder g ==> (!x x0 y y0. (x tends x0)(mtop mr1,g) /\ (y tends y0)(mtop mr1,g) ==> ((\n. (x n) + (y n)) tends (x0 + y0))(mtop mr1,g)) Run time: 0.0s SEQ_ADD = |- !x x0 y y0. x --> x0 /\ y --> y0 ==> (\n. (x n) + (y n)) --> (x0 + y0) Run time: 0.0s Intermediate theorems generated: 33 Theorem NET_MUL autoloading from theory `NETS` ... NET_MUL = |- !g. dorder g ==> (!x y x0 y0. (x tends x0)(mtop mr1,g) /\ (y tends y0)(mtop mr1,g) ==> ((\n. (x n) * (y n)) tends (x0 * y0))(mtop mr1,g)) Run time: 0.0s SEQ_MUL = |- !x x0 y y0. x --> x0 /\ y --> y0 ==> (\n. (x n) * (y n)) --> (x0 * y0) Run time: 0.0s Intermediate theorems generated: 33 Theorem NET_NEG autoloading from theory `NETS` ... NET_NEG = |- !g. dorder g ==> (!x x0. (x tends x0)(mtop mr1,g) = ((\n. --(x n)) tends (-- x0))(mtop mr1,g)) Run time: 0.0s SEQ_NEG = |- !x x0. x --> x0 = (\n. --(x n)) --> (-- x0) Run time: 0.0s Intermediate theorems generated: 26 Theorem NET_INV autoloading from theory `NETS` ... NET_INV = |- !g. dorder g ==> (!x x0. (x tends x0)(mtop mr1,g) /\ ~(x0 = & 0) ==> ((\n. inv(x n)) tends (inv x0))(mtop mr1,g)) Run time: 0.0s SEQ_INV = |- !x x0. x --> x0 /\ ~(x0 = & 0) ==> (\n. inv(x n)) --> (inv x0) Run time: 0.0s Intermediate theorems generated: 28 Theorem NET_SUB autoloading from theory `NETS` ... NET_SUB = |- !g. dorder g ==> (!x x0 y y0. (x tends x0)(mtop mr1,g) /\ (y tends y0)(mtop mr1,g) ==> ((\n. (x n) - (y n)) tends (x0 - y0))(mtop mr1,g)) Run time: 0.0s SEQ_SUB = |- !x x0 y y0. x --> x0 /\ y --> y0 ==> (\n. (x n) - (y n)) --> (x0 - y0) Run time: 0.0s Intermediate theorems generated: 33 Theorem NET_DIV autoloading from theory `NETS` ... NET_DIV = |- !g. dorder g ==> (!x x0 y y0. (x tends x0)(mtop mr1,g) /\ (y tends y0)(mtop mr1,g) /\ ~(y0 = & 0) ==> ((\n. (x n) / (y n)) tends (x0 / y0))(mtop mr1,g)) Run time: 0.0s SEQ_DIV = |- !x x0 y y0. x --> x0 /\ y --> y0 /\ ~(y0 = & 0) ==> (\n. (x n) / (y n)) --> (x0 / y0) Run time: 0.0s Intermediate theorems generated: 35 Theorem MTOP_TENDS_UNIQ autoloading from theory `NETS` ... MTOP_TENDS_UNIQ = |- !g d. dorder g ==> (x tends x0)(mtop d,g) /\ (x tends x1)(mtop d,g) ==> (x0 = x1) Run time: 0.0s SEQ_UNIQ = |- !x x1 x2. x --> x1 /\ x --> x2 ==> (x1 = x2) Run time: 0.0s Intermediate theorems generated: 28 convergent = |- !f. convergent f = (?l. f --> l) Run time: 0.0s Intermediate theorems generated: 2 cauchy = |- !f. cauchy f = (!e. (& 0) < e ==> (?N. !m n. m num_ge N /\ n num_ge N ==> (abs((f m) - (f n))) < e)) Run time: 0.0s Intermediate theorems generated: 2 lim = |- !f. lim f = (@l. f --> l) Run time: 0.0s Intermediate theorems generated: 2 SEQ_LIM = |- !f. convergent f = f --> (lim f) Run time: 0.0s Intermediate theorems generated: 36 subseq = |- !f. subseq f = (!m n. m num_lt n ==> (f m) num_lt (f n)) Run time: 0.0s Intermediate theorems generated: 2 Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 num_add m = m) /\ (m num_add 0 = m) /\ ((SUC m) num_add n = SUC(m num_add n)) /\ (m num_add (SUC n) = SUC(m num_add n)) Run time: 0.0s Theorem LESS_TRANS autoloading from theory `arithmetic` ... LESS_TRANS = |- !m n p. m num_lt n /\ n num_lt p ==> m num_lt p Run time: 0.0s Theorem ADD1 autoloading from theory `arithmetic` ... ADD1 = |- !m. SUC m = m num_add 1 Run time: 0.0s Theorem LESS_ADD_1 autoloading from theory `arithmetic` ... LESS_ADD_1 = |- !m n. n num_lt m ==> (?p. m = n num_add (p num_add 1)) Run time: 0.0s Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n num_lt (SUC n) Run time: 0.0s SUBSEQ_SUC = |- !f. subseq f = (!n. (f n) num_lt (f(SUC n))) Run time: 0.0s Intermediate theorems generated: 182 mono = |- !f. mono f = (!m n. m num_le n ==> (f m) <= (f n)) \/ (!m n. m num_le n ==> (f m) >= (f n)) Run time: 0.0s Intermediate theorems generated: 2 Theorem REAL_LE_TRANS autoloading from theory `REAL` ... REAL_LE_TRANS = |- !x y z. x <= y /\ y <= z ==> x <= z Run time: 0.0s Theorem REAL_LE_REFL autoloading from theory `REAL` ... REAL_LE_REFL = |- !x. x <= x Run time: 0.0s Theorem LESS_EQUAL_ADD autoloading from theory `arithmetic` ... LESS_EQUAL_ADD = |- !m n. m num_le n ==> (?p. n = m num_add p) Run time: 0.0s Theorem LESS_EQ_SUC_REFL autoloading from theory `arithmetic` ... LESS_EQ_SUC_REFL = |- !m. m num_le (SUC m) Run time: 0.0s Definition real_ge autoloading from theory `REAL` ... real_ge = |- !x y. x >= y = y <= x Run time: 0.0s Intermediate theorems generated: 1 MONO_SUC = |- !f. mono f = (!n. (f(SUC n)) >= (f n)) \/ (!n. (f(SUC n)) <= (f n)) Run time: 0.0s Intermediate theorems generated: 528 Theorem REAL_LT_IMP_LE autoloading from theory `REAL` ... REAL_LT_IMP_LE = |- !x y. x < y ==> x <= y Run time: 0.0s Theorem REAL_LT_ADD1 autoloading from theory `REAL` ... REAL_LT_ADD1 = |- !x y. x <= y ==> x < (y + (& 1)) Run time: 0.0s Theorem LESS_THM autoloading from theory `prim_rec` ... LESS_THM = |- !m n. m num_lt (SUC n) = (m = n) \/ m num_lt n Run time: 0.0s Theorem REAL_LET_TOTAL autoloading from theory `REAL` ... REAL_LET_TOTAL = |- !x y. x <= y \/ y < x Run time: 0.0s Theorem NOT_LESS_0 autoloading from theory `prim_rec` ... NOT_LESS_0 = |- !n. ~n num_lt 0 Run time: 0.0s MAX_LEMMA = |- !s N. ?k. !n. n num_lt N ==> (abs(s n)) < k Run time: 0.0s Intermediate theorems generated: 241 Theorem REAL_LTE_TRANS autoloading from theory `REAL` ... REAL_LTE_TRANS = |- !x y z. x < y /\ y <= z ==> x < z Run time: 0.0s Theorem LESS_CASES autoloading from theory `arithmetic` ... LESS_CASES = |- !m n. m num_lt n \/ n num_le m Run time: 0.0s Theorem REAL_LE_TOTAL autoloading from theory `REAL` ... REAL_LE_TOTAL = |- !x y. x <= y \/ y <= x Run time: 0.0s Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m num_le m Run time: 0.0s Theorem GREATER_EQ autoloading from theory `arithmetic` ... GREATER_EQ = |- !n m. n num_ge m = m num_le n Run time: 0.0s Theorem MR1_BOUNDED autoloading from theory `NETS` ... MR1_BOUNDED = |- !g f. bounded(mr1,g)f = (?k N. g N N /\ (!n. g n N ==> (abs(f n)) < k)) Run time: 0.0s SEQ_BOUNDED = |- !s. bounded(mr1,$num_ge)s = (?k. !n. (abs(s n)) < k) Run time: 0.0s Intermediate theorems generated: 273 Theorem REAL_LE_NEG autoloading from theory `REAL` ... REAL_LE_NEG = |- !x y. (-- x) <= (-- y) = y <= x Run time: 0.0s Theorem REAL_LE_ADDR autoloading from theory `REAL` ... REAL_LE_ADDR = |- !x y. x <= (x + y) = (& 0) <= y Run time: 0.0s Theorem ABS_LE autoloading from theory `REAL` ... ABS_LE = |- !x. x <= (abs x) Run time: 0.0s Theorem ABS_POS autoloading from theory `REAL` ... ABS_POS = |- !x. (& 0) <= (abs x) Run time: 0.0s Theorem REAL_LE_ADDL autoloading from theory `REAL` ... REAL_LE_ADDL = |- !x y. y <= (x + y) = (& 0) <= x Run time: 0.0s Definition abs autoloading from theory `REAL` ... abs = |- !x. abs x = ((& 0) <= x => x | -- x) Run time: 0.0s Intermediate theorems generated: 1 Theorem REAL_LT_01 autoloading from theory `REAL` ... REAL_LT_01 = |- (& 0) < (& 1) Run time: 0.0s Theorem REAL_LT_ADDR autoloading from theory `REAL` ... REAL_LT_ADDR = |- !x y. x < (x + y) = (& 0) < y Run time: 0.0s Theorem REAL_LET_TRANS autoloading from theory `REAL` ... REAL_LET_TRANS = |- !x y z. x <= y /\ y < z ==> x < z Run time: 0.0s SEQ_BOUNDED_2 = |- !f k K. (!n. k <= (f n) /\ (f n) <= K) ==> bounded(mr1,$num_ge)f Run time: 0.0s Intermediate theorems generated: 334 Definition bounded autoloading from theory `NETS` ... bounded = |- !m g f. bounded(m,g)f = (?k x N. g N N /\ (!n. g n N ==> (dist m(f n,x)) < k)) Run time: 0.0s Intermediate theorems generated: 1 SEQ_CBOUNDED = |- !f. cauchy f ==> bounded(mr1,$num_ge)f Run time: 0.0s Intermediate theorems generated: 110 Theorem REAL_LE_RADD autoloading from theory `REAL` ... REAL_LE_RADD = |- !x y z. (x + z) <= (y + z) = x <= y Run time: 0.0s Theorem REAL_ADD_RINV autoloading from theory `REAL` ... REAL_ADD_RINV = |- !x. x + (-- x) = & 0 Run time: 0.0s Definition real_sub autoloading from theory `REAL` ... real_sub = |- !x y. x - y = x + (-- y) Run time: 0.0s Intermediate theorems generated: 1 Theorem REAL_NEG_SUB autoloading from theory `REAL` ... REAL_NEG_SUB = |- !x y. --(x - y) = y - x Run time: 0.0s Theorem REAL_NOT_LT autoloading from theory `REAL` ... REAL_NOT_LT = |- !x y. ~x < y = y <= x Run time: 0.0s Theorem REAL_LT_REFL autoloading from theory `REAL` ... REAL_LT_REFL = |- !x. ~x < x Run time: 0.0s Theorem REAL_ADD_SYM autoloading from theory `REAL` ... REAL_ADD_SYM = |- !x y. x + y = y + x Run time: 0.0s Theorem REAL_LT_SUB_RADD autoloading from theory `REAL` ... REAL_LT_SUB_RADD = |- !x y z. (x - y) < z = x < (z + y) Run time: 0.0s Theorem REAL_SUP autoloading from theory `REAL` ... REAL_SUP = |- !P. (?x. P x) /\ (?z. !x. P x ==> x < z) ==> (!y. (?x. P x /\ y < x) = y < (sup P)) Run time: 0.0s SEQ_ICONV = |- !f. bounded(mr1,$num_ge)f /\ (!m n. m num_ge n ==> (f m) >= (f n)) ==> convergent f Run time: 0.0s Intermediate theorems generated: 910 Theorem REAL_NEGNEG autoloading from theory `REAL` ... REAL_NEGNEG = |- !x. --(-- x) = x Run time: 0.0s SEQ_NEG_CONV = |- !f. convergent f = convergent(\n. --(f n)) Run time: 0.0s Intermediate theorems generated: 72 Theorem ABS_NEG autoloading from theory `REAL` ... ABS_NEG = |- !x. abs(-- x) = abs x Run time: 0.0s SEQ_NEG_BOUNDED = |- !f. bounded(mr1,$num_ge)(\n. --(f n)) = bounded(mr1,$num_ge)f Run time: 0.0s Intermediate theorems generated: 39 SEQ_BCONV = |- !f. bounded(mr1,$num_ge)f /\ mono f ==> convergent f Run time: 0.0s Intermediate theorems generated: 209 Theorem LESS_EQ_TRANS autoloading from theory `arithmetic` ... LESS_EQ_TRANS = |- !m n p. m num_le n /\ n num_le p ==> m num_le p Run time: 0.0s Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m num_le n = m num_lt n \/ (m = n) Run time: 0.0s Intermediate theorems generated: 1 Theorem LESS_EQ autoloading from theory `arithmetic` ... LESS_EQ = |- !m n. m num_lt n = (SUC m) num_le n Run time: 0.0s Theorem REAL_NOT_LE autoloading from theory `REAL` ... REAL_NOT_LE = |- !x y. ~x <= y = y < x Run time: 0.0s Theorem LESS_IMP_LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_IMP_LESS_OR_EQ = |- !m n. m num_lt n ==> m num_le n Run time: 0.0s Theorem num_CASES autoloading from theory `arithmetic` ... num_CASES = |- !m. (m = 0) \/ (?n. m = SUC n) Run time: 0.0s Definition GREATER autoloading from theory `arithmetic` ... GREATER = |- !m n. m num_gt n = n num_lt m Run time: 0.0s Intermediate theorems generated: 1 Theorem num_Axiom autoloading from theory `prim_rec` ... num_Axiom = |- !e f. ?! fn. (fn 0 = e) /\ (!n. fn(SUC n) = f(fn n)n) Run time: 0.0s SEQ_MONOSUB = |- !s. ?f. subseq f /\ mono(\n. s(f n)) Run time: 0.0s Intermediate theorems generated: 1286 SEQ_SBOUNDED = |- !s f. bounded(mr1,$num_ge)s ==> bounded(mr1,$num_ge)(\n. s(f n)) Run time: 0.0s Intermediate theorems generated: 34 Theorem LESS_EQ_MONO autoloading from theory `arithmetic` ... LESS_EQ_MONO = |- !n m. (SUC n) num_le (SUC m) = n num_le m Run time: 0.0s Theorem NOT_LESS autoloading from theory `arithmetic` ... NOT_LESS = |- !m n. ~m num_lt n = n num_le m Run time: 0.0s SEQ_SUBLE = |- !f. subseq f ==> (!n. n num_le (f n)) Run time: 0.0s Intermediate theorems generated: 116 Theorem LESS_EQ_CASES autoloading from theory `arithmetic` ... LESS_EQ_CASES = |- !m n. m num_le n \/ n num_le m Run time: 0.0s SEQ_DIRECT = |- !f. subseq f ==> (!N1 N2. ?n. n num_ge N1 /\ (f n) num_ge N2) Run time: 0.0s Intermediate theorems generated: 118 Theorem REAL_LT_ADD2 autoloading from theory `REAL` ... REAL_LT_ADD2 = |- !w x y z. w < x /\ y < z ==> (w + y) < (x + z) Run time: 0.0s Theorem REAL_HALF_DOUBLE autoloading from theory `REAL` ... REAL_HALF_DOUBLE = |- !x. (x / (& 2)) + (x / (& 2)) = x Run time: 0.0s Theorem ABS_TRIANGLE autoloading from theory `REAL` ... ABS_TRIANGLE = |- !x y. (abs(x + y)) <= ((abs x) + (abs y)) Run time: 0.0s Theorem REAL_SUB_TRIANGLE autoloading from theory `REAL` ... REAL_SUB_TRIANGLE = |- !a b c. (a - b) + (b - c) = a - c Run time: 0.0s Theorem REAL_LT_HALF1 autoloading from theory `REAL` ... REAL_LT_HALF1 = |- !d. (& 0) < (d / (& 2)) = (& 0) < d Run time: 0.0s SEQ_CAUCHY = |- !f. cauchy f = convergent f Run time: 0.1s Intermediate theorems generated: 665 Theorem NET_LE autoloading from theory `NETS` ... NET_LE = |- !g. dorder g ==> (!x x0 y y0. (x tends x0)(mtop mr1,g) /\ (y tends y0)(mtop mr1,g) /\ (?N. g N N /\ (!n. g n N ==> (x n) <= (y n))) ==> x0 <= y0) Run time: 0.0s SEQ_LE = |- !f g l m. f --> l /\ g --> m /\ (?N. !n. n num_ge N ==> (f n) <= (g n)) ==> l <= m Run time: 0.0s Intermediate theorems generated: 80 Theorem LESS_0 autoloading from theory `prim_rec` ... LESS_0 = |- !n. 0 num_lt (SUC n) Run time: 0.0s SEQ_SUC = |- !f l. f --> l = (\n. f(SUC n)) --> l Run time: 0.0s Intermediate theorems generated: 236 Theorem ABS_ABS autoloading from theory `REAL` ... ABS_ABS = |- !x. abs(abs x) = abs x Run time: 0.0s Theorem REAL_SUB_RZERO autoloading from theory `REAL` ... REAL_SUB_RZERO = |- !x. x - (& 0) = x Run time: 0.0s SEQ_ABS = |- !f. (\n. abs(f n)) --> (& 0) = f --> (& 0) Run time: 0.0s Intermediate theorems generated: 70 Theorem NET_ABS autoloading from theory `NETS` ... NET_ABS = |- !x x0. (x tends x0)(mtop mr1,g) ==> ((\n. abs(x n)) tends (abs x0))(mtop mr1,g) Run time: 0.0s SEQ_ABS_IMP = |- !f l. f --> l ==> (\n. abs(f n)) --> (abs l) Run time: 0.0s Intermediate theorems generated: 20 Theorem REAL_LT_INV autoloading from theory `REAL` ... REAL_LT_INV = |- !x y. (& 0) < x /\ x < y ==> (inv y) < (inv x) Run time: 0.0s Theorem REAL_INVINV autoloading from theory `REAL` ... REAL_INVINV = |- !x. ~(x = & 0) ==> (inv(inv x) = x) Run time: 0.0s Theorem ABS_INV autoloading from theory `REAL` ... ABS_INV = |- !x. ~(x = & 0) ==> (abs(inv x) = inv(abs x)) Run time: 0.0s Theorem REAL_LT_IMP_NE autoloading from theory `REAL` ... REAL_LT_IMP_NE = |- !x y. x < y ==> ~(x = y) Run time: 0.0s Theorem REAL_LT_TRANS autoloading from theory `REAL` ... REAL_LT_TRANS = |- !x y z. x < y /\ y < z ==> x < z Run time: 0.0s Theorem REAL_INV_POS autoloading from theory `REAL` ... REAL_INV_POS = |- !x. (& 0) < x ==> (& 0) < (inv x) Run time: 0.0s Definition real_gt autoloading from theory `REAL` ... real_gt = |- !x y. x > y = y < x Run time: 0.0s Intermediate theorems generated: 1 SEQ_INV0 = |- !f. (!y. ?N. !n. n num_ge N ==> (f n) > y) ==> (\n. inv(f n)) --> (& 0) Run time: 0.0s Intermediate theorems generated: 423 Theorem POW_0 autoloading from theory `REAL` ... POW_0 = |- !n. (& 0) pow (SUC n) = & 0 Run time: 0.0s Theorem REAL_SUB_ADD autoloading from theory `REAL` ... REAL_SUB_ADD = |- !x y. (x - y) + y = x Run time: 0.0s Theorem POW_PLUS1 autoloading from theory `REAL` ... POW_PLUS1 = |- !e. (& 0) < e ==> (!n. ((& 1) + ((& n) * e)) <= (((& 1) + e) pow n)) Run time: 0.0s Theorem REAL_LT_ADDL autoloading from theory `REAL` ... REAL_LT_ADDL = |- !x y. y < (x + y) = (& 0) < x Run time: 0.0s Theorem REAL_LE autoloading from theory `REAL` ... REAL_LE = |- !m n. (& m) <= (& n) = m num_le n Run time: 0.0s Theorem REAL_LE_RMUL autoloading from theory `REAL` ... REAL_LE_RMUL = |- !x y z. (& 0) < z ==> ((x * z) <= (y * z) = x <= y) Run time: 0.0s Theorem REAL_ARCH autoloading from theory `REAL` ... REAL_ARCH = |- !x. (& 0) < x ==> (!y. ?n. y < ((& n) * x)) Run time: 0.0s Theorem REAL_INV1 autoloading from theory `REAL` ... REAL_INV1 = |- inv(& 1) = & 1 Run time: 0.0s Theorem REAL_ADD_LID autoloading from theory `REAL` ... REAL_ADD_LID = |- !x. (& 0) + x = x Run time: 0.0s Theorem REAL_LT_SUB_LADD autoloading from theory `REAL` ... REAL_LT_SUB_LADD = |- !x y z. x < (y - z) = (x + z) < y Run time: 0.0s Theorem POW_INV autoloading from theory `REAL` ... POW_INV = |- !c. ~(c = & 0) ==> (!n. inv(c pow n) = (inv c) pow n) Run time: 0.0s Theorem ABS_NZ autoloading from theory `REAL` ... ABS_NZ = |- !x. ~(x = & 0) = (& 0) < (abs x) Run time: 0.0s Theorem POW_NZ autoloading from theory `REAL` ... POW_NZ = |- !c n. ~(c = & 0) ==> ~(c pow n = & 0) Run time: 0.0s Theorem REAL_LE_LT autoloading from theory `REAL` ... REAL_LE_LT = |- !x y. x <= y = x < y \/ (x = y) Run time: 0.0s SEQ_POWER_ABS = |- !c. (abs c) < (& 1) ==> (\n. (abs c) pow n) --> (& 0) Run time: 0.0s Intermediate theorems generated: 573 Theorem POW_ABS autoloading from theory `REAL` ... POW_ABS = |- !c n. (abs c) pow n = abs(c pow n) Run time: 0.0s SEQ_POWER = |- !c. (abs c) < (& 1) ==> (\n. c pow n) --> (& 0) Run time: 0.0s Intermediate theorems generated: 49 Theorem REAL_LE_LADD autoloading from theory `REAL` ... REAL_LE_LADD = |- !x y z. (x + y) <= (x + z) = y <= z Run time: 0.0s Theorem REAL_SUB_LE autoloading from theory `REAL` ... REAL_SUB_LE = |- !x y. (& 0) <= (x - y) = y <= x Run time: 0.0s Theorem LESS_EQ_ADD autoloading from theory `arithmetic` ... LESS_EQ_ADD = |- !m n. m num_le (m num_add n) Run time: 0.0s Theorem REAL_SUB_LT autoloading from theory `REAL` ... REAL_SUB_LT = |- !x y. (& 0) < (x - y) = y < x Run time: 0.0s NEST_LEMMA = |- !f g. (!n. (f(SUC n)) >= (f n)) /\ (!n. (g(SUC n)) <= (g n)) /\ (!n. (f n) <= (g n)) ==> (?l m. l <= m /\ ((!n. (f n) <= l) /\ f --> l) /\ (!n. m <= (g n)) /\ g --> m) Run time: 0.1s Intermediate theorems generated: 2190 Theorem REAL_SUB_0 autoloading from theory `REAL` ... REAL_SUB_0 = |- !x y. (x - y = & 0) = (x = y) Run time: 0.0s NEST_LEMMA_UNIQ = |- !f g. (!n. (f(SUC n)) >= (f n)) /\ (!n. (g(SUC n)) <= (g n)) /\ (!n. (f n) <= (g n)) /\ (\n. (f n) - (g n)) --> (& 0) ==> (?l. ((!n. (f n) <= l) /\ f --> l) /\ (!n. l <= (g n)) /\ g --> l) Run time: 0.0s Intermediate theorems generated: 295 Theorem ADD_SYM autoloading from theory `arithmetic` ... ADD_SYM = |- !m n. m num_add n = n num_add m Run time: 0.0s Theorem REAL_MUL_LINV autoloading from theory `REAL` ... REAL_MUL_LINV = |- !x. ~(x = & 0) ==> ((inv x) * x = & 1) Run time: 0.0s Theorem REAL_LT autoloading from theory `REAL` ... REAL_LT = |- !m n. (& m) < (& n) = m num_lt n Run time: 0.0s Theorem REAL_LT_RMUL autoloading from theory `REAL` ... REAL_LT_RMUL = |- !x y z. (& 0) < z ==> ((x * z) < (y * z) = x < y) Run time: 0.0s Theorem ABS_N autoloading from theory `REAL` ... ABS_N = |- !n. abs(& n) = & n Run time: 0.0s Theorem REAL_MUL_RZERO autoloading from theory `REAL` ... REAL_MUL_RZERO = |- !x. x * (& 0) = & 0 Run time: 0.0s Theorem REAL_NEG_0 autoloading from theory `REAL` ... REAL_NEG_0 = |- --(& 0) = & 0 Run time: 0.0s Theorem REAL_MUL_RINV autoloading from theory `REAL` ... REAL_MUL_RINV = |- !x. ~(x = & 0) ==> (x * (inv x) = & 1) Run time: 0.0s Theorem REAL_MUL_LID autoloading from theory `REAL` ... REAL_MUL_LID = |- !x. (& 1) * x = x Run time: 0.0s Theorem REAL_INV_MUL autoloading from theory `REAL` ... REAL_INV_MUL = |- !x y. ~(x = & 0) /\ ~(y = & 0) ==> (inv(x * y) = (inv x) * (inv y)) Run time: 0.0s Theorem REAL_MUL_ASSOC autoloading from theory `REAL` ... REAL_MUL_ASSOC = |- !x y z. x * (y * z) = (x * y) * z Run time: 0.0s Theorem REAL_MUL_SYM autoloading from theory `REAL` ... REAL_MUL_SYM = |- !x y. x * y = y * x Run time: 0.0s Theorem REAL_ADD_ASSOC autoloading from theory `REAL` ... REAL_ADD_ASSOC = |- !x y z. x + (y + z) = (x + y) + z Run time: 0.0s Theorem REAL_ADD_LINV autoloading from theory `REAL` ... REAL_ADD_LINV = |- !x. (-- x) + x = & 0 Run time: 0.0s Theorem REAL_ADD_RID autoloading from theory `REAL` ... REAL_ADD_RID = |- !x. x + (& 0) = x Run time: 0.0s Theorem REAL_NEG_ADD autoloading from theory `REAL` ... REAL_NEG_ADD = |- !x y. --(x + y) = (-- x) + (-- y) Run time: 0.0s Theorem REAL_DOUBLE autoloading from theory `REAL` ... REAL_DOUBLE = |- !x. x + x = (& 2) * x Run time: 0.0s Theorem REAL_INJ autoloading from theory `REAL` ... REAL_INJ = |- !m n. (& m = & n) = (m = n) Run time: 0.0s Theorem REAL_DIV_LMUL autoloading from theory `REAL` ... REAL_DIV_LMUL = |- !x y. ~(y = & 0) ==> (y * (x / y) = x) Run time: 0.0s Theorem REAL_SUB_LDISTRIB autoloading from theory `REAL` ... REAL_SUB_LDISTRIB = |- !x y z. x * (y - z) = (x * y) - (x * z) Run time: 0.0s Theorem REAL_EQ_LMUL_IMP autoloading from theory `REAL` ... REAL_EQ_LMUL_IMP = |- !x y z. ~(x = & 0) /\ (x * y = x * z) ==> (y = z) Run time: 0.0s Theorem REAL_MUL_RID autoloading from theory `REAL` ... REAL_MUL_RID = |- !x. x * (& 1) = x Run time: 0.0s Definition real_div autoloading from theory `REAL` ... real_div = |- !x y. x / y = x * (inv y) Run time: 0.0s Intermediate theorems generated: 1 Definition pow autoloading from theory `REAL` ... pow = |- (!x. x pow 0 = & 1) /\ (!x n. x pow (SUC n) = x * (x pow n)) Run time: 0.0s Intermediate theorems generated: 1 Theorem REAL_MIDDLE1 autoloading from theory `REAL` ... REAL_MIDDLE1 = |- !a b. a <= b ==> a <= ((a + b) / (& 2)) Run time: 0.0s Theorem REAL_MIDDLE2 autoloading from theory `REAL` ... REAL_MIDDLE2 = |- !a b. a <= b ==> ((a + b) / (& 2)) <= b Run time: 0.0s BOLZANO_LEMMA = |- !P. (!a b c. a <= b /\ b <= c /\ P(a,b) /\ P(b,c) ==> P(a,c)) /\ (!x. ?d. (& 0) < d /\ (!a b. a <= x /\ x <= b /\ (b - a) < d ==> P(a,b))) ==> (!a b. a <= b ==> P(a,b)) Run time: 0.1s Intermediate theorems generated: 3396 sums = |- !f s. f sums s = (\n. Sum(0,n)f) --> s Run time: 0.0s Intermediate theorems generated: 2 summable = |- !f. summable f = (?s. f sums s) Run time: 0.0s Intermediate theorems generated: 2 suminf = |- !f. suminf f = (@s. f sums s) Run time: 0.0s Intermediate theorems generated: 2 SUM_SUMMABLE = |- !f l. f sums l ==> summable f Run time: 0.0s Intermediate theorems generated: 16 SUMMABLE_SUM = |- !f. summable f ==> f sums (suminf f) Run time: 0.0s Intermediate theorems generated: 30 SUM_UNIQ = |- !f x. f sums x ==> (x = suminf f) Run time: 0.0s Intermediate theorems generated: 69 Theorem SUM_ZERO autoloading from theory `REAL` ... SUM_ZERO = |- !f N. (!n. n num_ge N ==> (f n = & 0)) ==> (!m n. m num_ge N ==> (Sum(m,n)f = & 0)) Run time: 0.0s Theorem REAL_ADD_RID_UNIQ autoloading from theory `REAL` ... REAL_ADD_RID_UNIQ = |- !x y. (x + y = x) = (y = & 0) Run time: 0.0s Theorem SUM_TWO autoloading from theory `REAL` ... SUM_TWO = |- !f n p. (Sum(0,n)f) + (Sum(n,p)f) = Sum(0,n num_add p)f Run time: 0.0s Theorem ABS_ZERO autoloading from theory `REAL` ... ABS_ZERO = |- !x. (abs x = & 0) = (x = & 0) Run time: 0.0s SER_0 = |- !f n. (!m. n num_le m ==> (f m = & 0)) ==> f sums (Sum(0,n)f) Run time: 0.0s Intermediate theorems generated: 175 Theorem SUM_POS_GEN autoloading from theory `REAL` ... SUM_POS_GEN = |- !f m. (!n. m num_le n ==> (& 0) <= (f n)) ==> (!n. (& 0) <= (Sum(m,n)f)) Run time: 0.0s SER_POS_LE = |- !f n. summable f /\ (!m. n num_le m ==> (& 0) <= (f m)) ==> (Sum(0,n)f) <= (suminf f) Run time: 0.0s Intermediate theorems generated: 220 Theorem Sum autoloading from theory `REAL` ... Sum = |- (Sum(n,0)f = & 0) /\ (Sum(n,SUC m)f = (Sum(n,m)f) + (f(n num_add m))) Run time: 0.0s SER_POS_LT = |- !f n. summable f /\ (!m. n num_le m ==> (& 0) < (f m)) ==> (Sum(0,n)f) < (suminf f) Run time: 0.0s Intermediate theorems generated: 209 Theorem LESS_REFL autoloading from theory `prim_rec` ... LESS_REFL = |- !n. ~n num_lt n Run time: 0.0s Theorem LESS_EQ_0 autoloading from theory `arithmetic` ... LESS_EQ_0 = |- !n. n num_le 0 = (n = 0) Run time: 0.0s Theorem MULT_CLAUSES autoloading from theory `arithmetic` ... MULT_CLAUSES = |- !m n. (0 num_mul m = 0) /\ (m num_mul 0 = 0) /\ (1 num_mul m = m) /\ (m num_mul 1 = m) /\ ((SUC m) num_mul n = (m num_mul n) num_add n) /\ (m num_mul (SUC n) = m num_add (m num_mul n)) Run time: 0.0s Theorem SUM_GROUP autoloading from theory `REAL` ... SUM_GROUP = |- !n k f. Sum(0,n)(\m. Sum(m num_mul k,k)f) = Sum(0,n num_mul k)f Run time: 0.0s SER_GROUP = |- !f k. summable f /\ 0 num_lt k ==> (\n. Sum(n num_mul k,k)f) sums (suminf f) Run time: 0.0s Intermediate theorems generated: 258 Theorem MULT_SYM autoloading from theory `arithmetic` ... MULT_SYM = |- !m n. m num_mul n = n num_mul m Run time: 0.0s SER_PAIR = |- !f. summable f ==> (\n. Sum(2 num_mul n,2)f) sums (suminf f) Run time: 0.0s Intermediate theorems generated: 34 Theorem SUM_OFFSET autoloading from theory `REAL` ... SUM_OFFSET = |- !f n k. Sum(0,n)(\m. f(m num_add k)) = (Sum(0,n num_add k)f) - (Sum(0,k)f) Run time: 0.0s SER_OFFSET = |- !f. summable f ==> (!k. (\n. f(n num_add k)) sums ((suminf f) - (Sum(0,k)f))) Run time: 0.0s Intermediate theorems generated: 299 Theorem REAL_EQ_IMP_LE autoloading from theory `REAL` ... REAL_EQ_IMP_LE = |- !x y. (x = y) ==> x <= y Run time: 0.0s Theorem ADD_ASSOC autoloading from theory `arithmetic` ... ADD_ASSOC = |- !m n p. m num_add (n num_add p) = (m num_add n) num_add p Run time: 0.0s SER_POS_LT_PAIR = |- !f n. summable f /\ (!d. (& 0) < ((f(n num_add (2 num_mul d))) + (f(n num_add ((2 num_mul d) num_add 1))))) ==> (Sum(0,n)f) < (suminf f) Run time: 0.1s Intermediate theorems generated: 1204 Theorem SUM_ADD autoloading from theory `REAL` ... SUM_ADD = |- !f g m n. Sum(m,n)(\n'. (f n') + (g n')) = (Sum(m,n)f) + (Sum(m,n)g) Run time: 0.0s SER_ADD = |- !x x0 y y0. x sums x0 /\ y sums y0 ==> (\n. (x n) + (y n)) sums (x0 + y0) Run time: 0.0s Intermediate theorems generated: 62 Theorem SUM_CMUL autoloading from theory `REAL` ... SUM_CMUL = |- !f c m n. Sum(m,n)(\n'. c * (f n')) = c * (Sum(m,n)f) Run time: 0.0s SER_CMUL = |- !x x0 c. x sums x0 ==> (\n. c * (x n)) sums (c * x0) Run time: 0.0s Intermediate theorems generated: 82 Theorem REAL_NEG_MINUS1 autoloading from theory `REAL` ... REAL_NEG_MINUS1 = |- !x. -- x = (--(& 1)) * x Run time: 0.0s SER_NEG = |- !x x0. x sums x0 ==> (\n. --(x n)) sums (-- x0) Run time: 0.0s Intermediate theorems generated: 17 SER_SUB = |- !x x0 y y0. x sums x0 /\ y sums y0 ==> (\n. (x n) - (y n)) sums (x0 - y0) Run time: 0.0s Intermediate theorems generated: 43 SER_CDIV = |- !x x0 c. x sums x0 ==> (\n. (x n) / c) sums (x0 / c) Run time: 0.0s Intermediate theorems generated: 35 Theorem SUM_DIFF autoloading from theory `REAL` ... SUM_DIFF = |- !f m n. Sum(m,n)f = (Sum(0,m num_add n)f) - (Sum(0,m)f) Run time: 0.0s SER_CAUCHY = |- !f. summable f = (!e. (& 0) < e ==> (?N. !m n. m num_ge N ==> (abs(Sum(m,n)f)) < e)) Run time: 0.0s Intermediate theorems generated: 412 SER_ZERO = |- !f. summable f ==> f --> (& 0) Run time: 0.0s Intermediate theorems generated: 121 Theorem SUM_LE autoloading from theory `REAL` ... SUM_LE = |- !f g m n. (!r. m num_le r /\ r num_lt (n num_add m) ==> (f r) <= (g r)) ==> (Sum(m,n)f) <= (Sum(m,n)g) Run time: 0.0s Theorem ABS_SUM autoloading from theory `REAL` ... ABS_SUM = |- !f m n. (abs(Sum(m,n)f)) <= (Sum(m,n)(\n'. abs(f n'))) Run time: 0.0s SER_COMPAR = |- !f g. (?N. !n. n num_ge N ==> (abs(f n)) <= (g n)) /\ summable g ==> summable f Run time: 0.0s Intermediate theorems generated: 395 SER_COMPARA = |- !f g. (?N. !n. n num_ge N ==> (abs(f n)) <= (g n)) /\ summable g ==> summable(\k. abs(f k)) Run time: 0.0s Intermediate theorems generated: 41 Theorem ZERO_LESS_EQ autoloading from theory `arithmetic` ... ZERO_LESS_EQ = |- !n. 0 num_le n Run time: 0.0s SER_LE = |- !f g. (!n. (f n) <= (g n)) /\ summable f /\ summable g ==> (suminf f) <= (suminf g) Run time: 0.0s Intermediate theorems generated: 191 SER_LE2 = |- !f g. (!n. (abs(f n)) <= (g n)) /\ summable g ==> summable f /\ (suminf f) <= (suminf g) Run time: 0.0s Intermediate theorems generated: 136 Theorem SUM_ABS autoloading from theory `REAL` ... SUM_ABS = |- !f m n. abs(Sum(m,n)(\m. abs(f m))) = Sum(m,n)(\m. abs(f m)) Run time: 0.0s SER_ACONV = |- !f. summable(\n. abs(f n)) ==> summable f Run time: 0.0s Intermediate theorems generated: 126 Theorem SUM_ABS_LE autoloading from theory `REAL` ... SUM_ABS_LE = |- !f m n. (abs(Sum(m,n)f)) <= (Sum(m,n)(\n'. abs(f n'))) Run time: 0.0s SER_ABS = |- !f. summable(\n. abs(f n)) ==> (abs(suminf f)) <= (suminf(\n. abs(f n))) Run time: 0.0s Intermediate theorems generated: 92 Theorem REAL_DIV_RMUL autoloading from theory `REAL` ... REAL_DIV_RMUL = |- !x y. ~(y = & 0) ==> ((x / y) * y = x) Run time: 0.0s Theorem REAL_RDISTRIB autoloading from theory `REAL` ... REAL_RDISTRIB = |- !x y z. (x + y) * z = (x * z) + (y * z) Run time: 0.0s Theorem REAL_EQ_RMUL autoloading from theory `REAL` ... REAL_EQ_RMUL = |- !x y z. (x * z = y * z) = (z = & 0) \/ (x = y) Run time: 0.0s Theorem REAL_DIV_LZERO autoloading from theory `REAL` ... REAL_DIV_LZERO = |- !x. (& 0) / x = & 0 Run time: 0.0s GP_FINITE = |- !x. ~(x = & 1) ==> (!n. Sum(0,n)(\n'. x pow n') = ((x pow n) - (& 1)) / (x - (& 1))) Run time: 0.1s Intermediate theorems generated: 411 Theorem REAL_NEG_INV autoloading from theory `REAL` ... REAL_NEG_INV = |- !x. ~(x = & 0) ==> (--(inv x) = inv(-- x)) Run time: 0.0s Theorem REAL_NEG_MUL2 autoloading from theory `REAL` ... REAL_NEG_MUL2 = |- !x y. (-- x) * (-- y) = x * y Run time: 0.0s Theorem REAL_INV_1OVER autoloading from theory `REAL` ... REAL_INV_1OVER = |- !x. inv x = (& 1) / x Run time: 0.0s Theorem ABS_1 autoloading from theory `REAL` ... ABS_1 = |- abs(& 1) = & 1 Run time: 0.0s GP = |- !x. (abs x) < (& 1) ==> (\n. x pow n) sums (inv((& 1) - x)) Run time: 0.0s Intermediate theorems generated: 343 Theorem REAL_NEG_LMUL autoloading from theory `REAL` ... REAL_NEG_LMUL = |- !x y. --(x * y) = (-- x) * y Run time: 0.0s Theorem REAL_LE_MUL autoloading from theory `REAL` ... REAL_LE_MUL = |- !x y. (& 0) <= x /\ (& 0) <= y ==> (& 0) <= (x * y) Run time: 0.0s Theorem REAL_NEG_GE0 autoloading from theory `REAL` ... REAL_NEG_GE0 = |- !x. (& 0) <= (-- x) = x <= (& 0) Run time: 0.0s ABS_NEG_LEMMA = |- !c. c <= (& 0) ==> (!x y. (abs x) <= (c * (abs y)) ==> (x = & 0)) Run time: 0.0s Intermediate theorems generated: 114 Theorem REAL_LE_LMUL autoloading from theory `REAL` ... REAL_LE_LMUL = |- !x y z. (& 0) < x ==> ((x * y) <= (x * z) = y <= z) Run time: 0.0s Theorem POW_ADD autoloading from theory `REAL` ... POW_ADD = |- !c m n. c pow (m num_add n) = (c pow m) * (c pow n) Run time: 0.0s Theorem OR_LESS autoloading from theory `arithmetic` ... OR_LESS = |- !m n. (SUC m) num_le n ==> m num_lt n Run time: 0.0s SER_RATIO = |- !f c N. c < (& 1) /\ (!n. n num_ge N ==> (abs(f(SUC n))) <= (c * (abs(f n)))) ==> summable f Run time: 0.0s Intermediate theorems generated: 683 () : void Run time: 0.0s Intermediate theorems generated: 1 File seq.ml loaded () : void Run time: 0.7s Intermediate theorems generated: 18704 #\ echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `lim.ml`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool false : bool () : void Theory SEQ loaded () : void false : bool Run time: 0.0s LAND_CONV = - : (conv -> conv) Run time: 0.0s TAUT_CONV = - : conv Run time: 0.0s AC = - : ((thm # thm) -> conv) Run time: 0.0s GEN_PAIR_TAC = - : tactic Run time: 0.0s MK_COMB_TAC = - : tactic Run time: 0.0s BINOP_TAC = - : tactic Run time: 0.0s SYM_CANON_CONV = - : (thm -> ((term # term) -> bool) -> conv) Run time: 0.0s IMP_SUBST_TAC = - : thm_tactic Run time: 0.0s ABBREV_TAC = - : (term -> tactic) Run time: 0.0s EXT_CONV = - : conv Run time: 0.0s ABS_TAC = - : tactic Run time: 0.0s EQUAL_TAC = - : tactic Run time: 0.0s X_BETA_CONV = - : (term -> conv) Run time: 0.0s EXACT_CONV = - : (thm list -> conv) Run time: 0.0s HABS_CONV = - : conv Run time: 0.0s autoload_definitions = - : (string -> void) Run time: 0.0s autoload_theorems = - : (string -> void) Run time: 0.0s EXPAND_TAC = - : (string -> tactic) Run time: 0.0s File useful loaded () : void Run time: 0.0s real_interface_map = [(`--`, `real_neg`); (`num_add`, `+`); (`+`, `real_add`); (`num_mul`, `*`); (`*`, `real_mul`); (`num_sub`, `-`); (`-`, `real_sub`); (`num_lt`, `<`); (`<`, `real_lt`); (`num_le`, `<=`); (`<=`, `real_le`); (`num_gt`, `>`); (`>`, `real_gt`); (`num_ge`, `>=`); (`>=`, `real_ge`); (`inv`, `real_inv`); (`&`, `real_of_num`)] : (string # string) list Run time: 0.0s () : void Run time: 0.0s Intermediate theorems generated: 43 () : void Run time: 0.0s () : void Run time: 0.0s tends_real_real = |- !f l x0. (f tends_real_real l)x0 = (f tends l)(mtop mr1,tendsto(mr1,x0)) Run time: 0.0s Intermediate theorems generated: 2 [] : (string # string) list Run time: 0.0s Theorem ABS_SUB autoloading from theory `REAL` ... ABS_SUB = |- !x y. abs(x - y) = abs(y - x) Run time: 0.0s Theorem MR1_DEF autoloading from theory `TOPOLOGY` ... MR1_DEF = |- !x y. dist mr1(x,y) = abs(y - x) Run time: 0.1s Theorem MR1_LIMPT autoloading from theory `TOPOLOGY` ... MR1_LIMPT = |- !x. limpt(mtop mr1)x re_universe Run time: 0.0s Theorem LIM_TENDS2 autoloading from theory `NETS` ... LIM_TENDS2 = |- !m1 m2 f x0 y0. limpt(mtop m1)x0 re_universe ==> ((f tends y0)(mtop m2,tendsto(m1,x0)) = (!e. (& 0) < e ==> (?d. (& 0) < d /\ (!x. (& 0) < (dist m1(x,x0)) /\ (dist m1(x,x0)) < d ==> (dist m2(f x,y0)) < e)))) Run time: 0.0s LIM = |- !f y0 x0. (f --> y0)x0 = (!e. (& 0) < e ==> (?d. (& 0) < d /\ (!x. (& 0) < (abs(x - x0)) /\ (abs(x - x0)) < d ==> (abs((f x) - y0)) < e))) Run time: 0.0s Intermediate theorems generated: 102 Theorem REAL_SUB_0 autoloading from theory `REAL` ... REAL_SUB_0 = |- !x y. (x - y = & 0) = (x = y) Run time: 0.0s Theorem ABS_NZ autoloading from theory `REAL` ... ABS_NZ = |- !x. ~(x = & 0) = (& 0) < (abs x) Run time: 0.0s Theorem MTOP_LIMPT autoloading from theory `TOPOLOGY` ... MTOP_LIMPT = |- !m x S. limpt(mtop m)x S = (!e. (& 0) < e ==> (?y. ~(x = y) /\ S y /\ (dist m(x,y)) < e)) Run time: 0.0s Theorem REAL_LE_REFL autoloading from theory `REAL` ... REAL_LE_REFL = |- !x. x <= x Run time: 0.0s Definition tendsto autoloading from theory `NETS` ... tendsto = |- !m x y z. tendsto(m,x)y z = (& 0) < (dist m(x,y)) /\ (dist m(x,y)) <= (dist m(x,z)) Run time: 0.0s Intermediate theorems generated: 1 Theorem METRIC_SAME autoloading from theory `TOPOLOGY` ... METRIC_SAME = |- !m x. dist m(x,x) = & 0 Run time: 0.0s Theorem MTOP_TENDS autoloading from theory `NETS` ... MTOP_TENDS = |- !d g x x0. (x tends x0)(mtop d,g) = (!e. (& 0) < e ==> (?n. g n n /\ (!m. g m n ==> (dist d(x m,x0)) < e))) Run time: 0.0s LIM_CONST = |- !k x. ((\x. k) --> k)x Run time: 0.0s Intermediate theorems generated: 193 Theorem DORDER_TENDSTO autoloading from theory `NETS` ... DORDER_TENDSTO = |- !m x. dorder(tendsto(m,x)) Run time: 0.0s Theorem NET_ADD autoloading from theory `NETS` ... NET_ADD = |- !g. dorder g ==> (!x x0 y y0. (x tends x0)(mtop mr1,g) /\ (y tends y0)(mtop mr1,g) ==> ((\n. (x n) + (y n)) tends (x0 + y0))(mtop mr1,g)) Run time: 0.0s LIM_ADD = |- !f g l m. (f --> l)x /\ (g --> m)x ==> ((\x. (f x) + (g x)) --> (l + m))x Run time: 0.0s Intermediate theorems generated: 40 Theorem NET_MUL autoloading from theory `NETS` ... NET_MUL = |- !g. dorder g ==> (!x y x0 y0. (x tends x0)(mtop mr1,g) /\ (y tends y0)(mtop mr1,g) ==> ((\n. (x n) * (y n)) tends (x0 * y0))(mtop mr1,g)) Run time: 0.0s LIM_MUL = |- !f g l m. (f --> l)x /\ (g --> m)x ==> ((\x. (f x) * (g x)) --> (l * m))x Run time: 0.0s Intermediate theorems generated: 40 Theorem NET_NEG autoloading from theory `NETS` ... NET_NEG = |- !g. dorder g ==> (!x x0. (x tends x0)(mtop mr1,g) = ((\n. --(x n)) tends (-- x0))(mtop mr1,g)) Run time: 0.0s LIM_NEG = |- !f l. (f --> l)x = ((\x. --(f x)) --> (-- l))x Run time: 0.0s Intermediate theorems generated: 33 Theorem NET_INV autoloading from theory `NETS` ... NET_INV = |- !g. dorder g ==> (!x x0. (x tends x0)(mtop mr1,g) /\ ~(x0 = & 0) ==> ((\n. inv(x n)) tends (inv x0))(mtop mr1,g)) Run time: 0.0s LIM_INV = |- !f l. (f --> l)x /\ ~(l = & 0) ==> ((\x. inv(f x)) --> (inv l))x Run time: 0.0s Intermediate theorems generated: 35 Theorem NET_SUB autoloading from theory `NETS` ... NET_SUB = |- !g. dorder g ==> (!x x0 y y0. (x tends x0)(mtop mr1,g) /\ (y tends y0)(mtop mr1,g) ==> ((\n. (x n) - (y n)) tends (x0 - y0))(mtop mr1,g)) Run time: 0.0s LIM_SUB = |- !f g l m. (f --> l)x /\ (g --> m)x ==> ((\x. (f x) - (g x)) --> (l - m))x Run time: 0.0s Intermediate theorems generated: 40 Theorem NET_DIV autoloading from theory `NETS` ... NET_DIV = |- !g. dorder g ==> (!x x0 y y0. (x tends x0)(mtop mr1,g) /\ (y tends y0)(mtop mr1,g) /\ ~(y0 = & 0) ==> ((\n. (x n) / (y n)) tends (x0 / y0))(mtop mr1,g)) Run time: 0.0s LIM_DIV = |- !f g l m. (f --> l)x /\ (g --> m)x /\ ~(m = & 0) ==> ((\x. (f x) / (g x)) --> (l / m))x Run time: 0.0s Intermediate theorems generated: 42 Theorem NET_NULL autoloading from theory `NETS` ... NET_NULL = |- !g x x0. (x tends x0)(mtop mr1,g) = ((\n. (x n) - x0) tends (& 0))(mtop mr1,g) Run time: 0.0s LIM_NULL = |- !f l x. (f --> l)x = ((\x. (f x) - l) --> (& 0))x Run time: 0.0s Intermediate theorems generated: 23 LIM_X = |- !x0. ((\x. x) --> x0)x0 Run time: 0.0s Intermediate theorems generated: 52 Theorem MTOP_TENDS_UNIQ autoloading from theory `NETS` ... MTOP_TENDS_UNIQ = |- !g d. dorder g ==> (x tends x0)(mtop d,g) /\ (x tends x1)(mtop d,g) ==> (x0 = x1) Run time: 0.0s LIM_UNIQ = |- !f l m x. (f --> l)x /\ (f --> m)x ==> (l = m) Run time: 0.0s Intermediate theorems generated: 36 LIM_EQUAL = |- !f g l x0. (!x. ~(x = x0) ==> (f x = g x)) ==> ((f --> l)x0 = (g --> l)x0) Run time: 0.0s Intermediate theorems generated: 171 Theorem REAL_LT_TRANS autoloading from theory `REAL` ... REAL_LT_TRANS = |- !x y z. x < y /\ y < z ==> x < z Run time: 0.0s Theorem REAL_LT_ADD2 autoloading from theory `REAL` ... REAL_LT_ADD2 = |- !w x y z. w < x /\ y < z ==> (w + y) < (x + z) Run time: 0.0s Theorem ABS_TRIANGLE autoloading from theory `REAL` ... ABS_TRIANGLE = |- !x y. (abs(x + y)) <= ((abs x) + (abs y)) Run time: 0.0s Theorem REAL_SUB_TRIANGLE autoloading from theory `REAL` ... REAL_SUB_TRIANGLE = |- !a b c. (a - b) + (b - c) = a - c Run time: 0.0s Theorem REAL_LET_TRANS autoloading from theory `REAL` ... REAL_LET_TRANS = |- !x y z. x <= y /\ y < z ==> x < z Run time: 0.0s Theorem REAL_HALF_DOUBLE autoloading from theory `REAL` ... REAL_HALF_DOUBLE = |- !x. (x / (& 2)) + (x / (& 2)) = x Run time: 0.0s Theorem REAL_LTE_TRANS autoloading from theory `REAL` ... REAL_LTE_TRANS = |- !x y z. x < y /\ y <= z ==> x < z Run time: 0.0s Theorem REAL_DOWN2 autoloading from theory `REAL` ... REAL_DOWN2 = |- !x y. (& 0) < x /\ (& 0) < y ==> (?z. (& 0) < z /\ z < x /\ z < y) Run time: 0.0s Theorem REAL_SUB_RZERO autoloading from theory `REAL` ... REAL_SUB_RZERO = |- !x. x - (& 0) = x Run time: 0.0s Theorem REAL_LT_HALF1 autoloading from theory `REAL` ... REAL_LT_HALF1 = |- !d. (& 0) < (d / (& 2)) = (& 0) < d Run time: 0.0s LIM_TRANSFORM = |- !f g x0 l. ((\x. (f x) - (g x)) --> (& 0))x0 /\ (g --> l)x0 ==> (f --> l)x0 Run time: 0.0s Intermediate theorems generated: 473 diffl = |- !f l x. (f diffl l)x = ((\h. ((f(x + h)) - (f x)) / h) --> l)(& 0) Run time: 0.0s Intermediate theorems generated: 2 contl = |- !f x. f contl x = ((\h. f(x + h)) --> (f x))(& 0) Run time: 0.0s Intermediate theorems generated: 2 differentiable = |- !f x. f differentiable x = (?l. (f diffl l)x) Run time: 0.0s Intermediate theorems generated: 2 DIFF_UNIQ = |- !f l m x. (f diffl l)x /\ (f diffl m)x ==> (l = m) Run time: 0.0s Intermediate theorems generated: 26 Theorem REAL_MUL_RZERO autoloading from theory `REAL` ... REAL_MUL_RZERO = |- !x. x * (& 0) = & 0 Run time: 0.0s Theorem REAL_DIV_RMUL autoloading from theory `REAL` ... REAL_DIV_RMUL = |- !x y. ~(y = & 0) ==> ((x / y) * y = x) Run time: 0.0s DIFF_CONT = |- !f l x. (f diffl l)x ==> f contl x Run time: 0.0s Intermediate theorems generated: 290 Theorem REAL_ADD_SUB autoloading from theory `REAL` ... REAL_ADD_SUB = |- !x y. (x + y) - x = y Run time: 0.0s Theorem REAL_SUB_ADD2 autoloading from theory `REAL` ... REAL_SUB_ADD2 = |- !x y. y + (x - y) = x Run time: 0.0s CONTL_LIM = |- !f x. f contl x = (f --> (f x))x Run time: 0.1s Intermediate theorems generated: 275 CONT_CONST = |- !x. (\x. k) contl x Run time: 0.0s Intermediate theorems generated: 20 CONT_ADD = |- !x. f contl x /\ g contl x ==> (\x. (f x) + (g x)) contl x Run time: 0.0s Intermediate theorems generated: 29 CONT_MUL = |- !x. f contl x /\ g contl x ==> (\x. (f x) * (g x)) contl x Run time: 0.0s Intermediate theorems generated: 29 CONT_NEG = |- !x. f contl x ==> (\x. --(f x)) contl x Run time: 0.0s Intermediate theorems generated: 43 CONT_INV = |- !x. f contl x /\ ~(f x = & 0) ==> (\x. inv(f x)) contl x Run time: 0.0s Intermediate theorems generated: 26 CONT_SUB = |- !x. f contl x /\ g contl x ==> (\x. (f x) - (g x)) contl x Run time: 0.0s Intermediate theorems generated: 29 CONT_DIV = |- !x. f contl x /\ g contl x /\ ~(g x = & 0) ==> (\x. (f x) / (g x)) contl x Run time: 0.0s Intermediate theorems generated: 31 Theorem REAL_LT_IMP_LE autoloading from theory `REAL` ... REAL_LT_IMP_LE = |- !x y. x < y ==> x <= y Run time: 0.0s Theorem REAL_NOT_LT autoloading from theory `REAL` ... REAL_NOT_LT = |- !x y. ~x < y = y <= x Run time: 0.0s Theorem REAL_SUB_ADD autoloading from theory `REAL` ... REAL_SUB_ADD = |- !x y. (x - y) + y = x Run time: 0.0s Theorem REAL_ADD_SYM autoloading from theory `REAL` ... REAL_ADD_SYM = |- !x y. x + y = y + x Run time: 0.0s Theorem REAL_LE_RADD autoloading from theory `REAL` ... REAL_LE_RADD = |- !x y z. (x + z) <= (y + z) = x <= y Run time: 0.0s Theorem REAL_LE_NEG autoloading from theory `REAL` ... REAL_LE_NEG = |- !x y. (-- x) <= (-- y) = y <= x Run time: 0.0s Theorem REAL_LE_LADD autoloading from theory `REAL` ... REAL_LE_LADD = |- !x y z. (x + y) <= (x + z) = y <= z Run time: 0.0s Definition real_sub autoloading from theory `REAL` ... real_sub = |- !x y. x - y = x + (-- y) Run time: 0.0s Intermediate theorems generated: 1 Theorem REAL_NOT_LE autoloading from theory `REAL` ... REAL_NOT_LE = |- !x y. ~x <= y = y < x Run time: 0.0s Theorem REAL_LT_LE autoloading from theory `REAL` ... REAL_LT_LE = |- !x y. x < y = x <= y /\ ~(x = y) Run time: 0.0s Theorem REAL_SUB_LT autoloading from theory `REAL` ... REAL_SUB_LT = |- !x y. (& 0) < (x - y) = y < x Run time: 0.0s Theorem REAL_SUB_LE autoloading from theory `REAL` ... REAL_SUB_LE = |- !x y. (& 0) <= (x - y) = y <= x Run time: 0.0s Definition abs autoloading from theory `REAL` ... abs = |- !x. abs x = ((& 0) <= x => x | -- x) Run time: 0.0s Intermediate theorems generated: 1 Theorem REAL_LT_TOTAL autoloading from theory `REAL` ... REAL_LT_TOTAL = |- !x y. (x = y) \/ x < y \/ y < x Run time: 0.0s Theorem REAL_LT_01 autoloading from theory `REAL` ... REAL_LT_01 = |- (& 0) < (& 1) Run time: 0.0s Theorem REAL_LE_TRANS autoloading from theory `REAL` ... REAL_LE_TRANS = |- !x y z. x <= y /\ y <= z ==> x <= z Run time: 0.0s Theorem REAL_LE_TOTAL autoloading from theory `REAL` ... REAL_LE_TOTAL = |- !x y. x <= y \/ y <= x Run time: 0.0s Theorem BOLZANO_LEMMA autoloading from theory `SEQ` ... BOLZANO_LEMMA = |- !P. (!a b c. a <= b /\ b <= c /\ P(a,b) /\ P(b,c) ==> P(a,c)) /\ (!x. ?d. (& 0) < d /\ (!a b. a <= x /\ x <= b /\ (b - a) < d ==> P(a,b))) ==> (!a b. a <= b ==> P(a,b)) Run time: 0.0s IVT = |- !f a b y. a <= b /\ ((f a) <= y /\ y <= (f b)) /\ (!x. a <= x /\ x <= b ==> f contl x) ==> (?x. a <= x /\ x <= b /\ (f x = y)) Run time: 0.0s Intermediate theorems generated: 2647 Theorem REAL_NEGNEG autoloading from theory `REAL` ... REAL_NEGNEG = |- !x. --(-- x) = x Run time: 0.0s Theorem REAL_NEG_EQ autoloading from theory `REAL` ... REAL_NEG_EQ = |- !x y. (-- x = y) = (x = -- y) Run time: 0.0s IVT2 = |- !f a b y. a <= b /\ ((f b) <= y /\ y <= (f a)) /\ (!x. a <= x /\ x <= b ==> f contl x) ==> (?x. a <= x /\ x <= b /\ (f x = y)) Run time: 0.0s Intermediate theorems generated: 158 Theorem REAL_MUL_LZERO autoloading from theory `REAL` ... REAL_MUL_LZERO = |- !x. (& 0) * x = & 0 Run time: 0.0s Definition real_div autoloading from theory `REAL` ... real_div = |- !x y. x / y = x * (inv y) Run time: 0.0s Intermediate theorems generated: 1 Theorem REAL_SUB_REFL autoloading from theory `REAL` ... REAL_SUB_REFL = |- !x. x - x = & 0 Run time: 0.0s DIFF_CONST = |- !k x. ((\x. k) diffl (& 0))x Run time: 0.1s Intermediate theorems generated: 59 Theorem REAL_RDISTRIB autoloading from theory `REAL` ... REAL_RDISTRIB = |- !x y z. (x + y) * z = (x * z) + (y * z) Run time: 0.0s Theorem REAL_ADD2_SUB2 autoloading from theory `REAL` ... REAL_ADD2_SUB2 = |- !a b c d. (a + b) - (c + d) = (a - c) + (b - d) Run time: 0.0s DIFF_ADD = |- !f g l m x. (f diffl l)x /\ (g diffl m)x ==> ((\x. (f x) + (g x)) diffl (l + m))x Run time: 0.0s Intermediate theorems generated: 150 Theorem REAL_MUL_SYM autoloading from theory `REAL` ... REAL_MUL_SYM = |- !x y. x * y = y * x Run time: 0.0s Theorem REAL_MUL_ASSOC autoloading from theory `REAL` ... REAL_MUL_ASSOC = |- !x y z. x * (y * z) = (x * y) * z Run time: 0.0s Theorem REAL_SUB_RDISTRIB autoloading from theory `REAL` ... REAL_SUB_RDISTRIB = |- !x y z. (x - y) * z = (x * z) - (y * z) Run time: 0.0s Theorem REAL_SUB_LDISTRIB autoloading from theory `REAL` ... REAL_SUB_LDISTRIB = |- !x y z. x * (y - z) = (x * y) - (x * z) Run time: 0.0s Theorem REAL_ADD_LID autoloading from theory `REAL` ... REAL_ADD_LID = |- !x. (& 0) + x = x Run time: 0.0s Theorem REAL_ADD_LINV autoloading from theory `REAL` ... REAL_ADD_LINV = |- !x. (-- x) + x = & 0 Run time: 0.0s Theorem REAL_ADD_ASSOC autoloading from theory `REAL` ... REAL_ADD_ASSOC = |- !x y z. x + (y + z) = (x + y) + z Run time: 0.0s DIFF_MUL = |- !f g l m x. (f diffl l)x /\ (g diffl m)x ==> ((\x. (f x) * (g x)) diffl ((l * (g x)) + (m * (f x))))x Run time: 0.0s Intermediate theorems generated: 567 DIFF_CMUL = |- !f c l x. (f diffl l)x ==> ((\x. c * (f x)) diffl (c * l))x Run time: 0.0s Intermediate theorems generated: 100 Theorem REAL_NEG_MINUS1 autoloading from theory `REAL` ... REAL_NEG_MINUS1 = |- !x. -- x = (--(& 1)) * x Run time: 0.0s DIFF_NEG = |- !f l x. (f diffl l)x ==> ((\x. --(f x)) diffl (-- l))x Run time: 0.0s Intermediate theorems generated: 20 DIFF_SUB = |- !f g l m x. (f diffl l)x /\ (g diffl m)x ==> ((\x. (f x) - (g x)) diffl (l - m))x Run time: 0.0s Intermediate theorems generated: 50 Theorem NET_NULL_MUL autoloading from theory `NETS` ... NET_NULL_MUL = |- !g. dorder g ==> (!x y. bounded(mr1,g)x /\ (y tends (& 0))(mtop mr1,g) ==> ((\n. (x n) * (y n)) tends (& 0))(mtop mr1,g)) Run time: 0.0s LIM_NULL_MUL = |- !x x0 y. bounded(mr1,tendsto(mr1,x0))x /\ (y --> (& 0))x0 ==> ((\u. (x u) * (y u)) --> (& 0))x0 Run time: 0.0s Intermediate theorems generated: 35 Theorem REAL_LT_HALF2 autoloading from theory `REAL` ... REAL_LT_HALF2 = |- !d. (d / (& 2)) < d = (& 0) < d Run time: 0.0s Theorem ABS_REFL autoloading from theory `REAL` ... ABS_REFL = |- !x. (abs x = x) = (& 0) <= x Run time: 0.0s Theorem ABS_LE autoloading from theory `REAL` ... ABS_LE = |- !x. x <= (abs x) Run time: 0.0s Theorem MR1_BOUNDED autoloading from theory `NETS` ... MR1_BOUNDED = |- !g f. bounded(mr1,g)f = (?k N. g N N /\ (!n. g n N ==> (abs(f n)) < k)) Run time: 0.0s LIM_BOUNDED = |- bounded(mr1,tendsto(mr1,x0))f = (?k d. (& 0) < d /\ (!x. (& 0) < (abs(x - x0)) /\ (abs(x - x0)) < d ==> (abs(f x)) < k)) Run time: 0.0s Intermediate theorems generated: 362 Theorem REAL_MUL_LID autoloading from theory `REAL` ... REAL_MUL_LID = |- !x. (& 1) * x = x Run time: 0.0s Theorem REAL_MUL_LINV autoloading from theory `REAL` ... REAL_MUL_LINV = |- !x. ~(x = & 0) ==> ((inv x) * x = & 1) Run time: 0.0s CHAIN_LEMMA1 = |- !f g x h. ((f(g(x + h))) - (f(g x))) / h = (((f(g(x + h))) - (f(g x))) / ((g(x + h)) - (g x))) * (((g(x + h)) - (g x)) / h) Run time: 0.0s Intermediate theorems generated: 170 Theorem REAL_LT_RADD autoloading from theory `REAL` ... REAL_LT_RADD = |- !x y z. (x + z) < (y + z) = x < y Run time: 0.0s CHAIN_LEMMA2 = |- !x y d. (abs(x - y)) < d ==> (abs x) < ((abs y) + d) Run time: 0.0s Intermediate theorems generated: 65 Theorem ABS_POS autoloading from theory `REAL` ... ABS_POS = |- !x. (& 0) <= (abs x) Run time: 0.0s Theorem REAL_LE_ADDL autoloading from theory `REAL` ... REAL_LE_ADDL = |- !x y. y <= (x + y) = (& 0) <= x Run time: 0.0s Theorem ABS_0 autoloading from theory `REAL` ... ABS_0 = |- abs(& 0) = & 0 Run time: 0.0s Theorem REAL_LT_REFL autoloading from theory `REAL` ... REAL_LT_REFL = |- !x. ~x < x Run time: 0.0s Theorem ABS_NEG autoloading from theory `REAL` ... ABS_NEG = |- !x. abs(-- x) = abs x Run time: 0.0s Theorem REAL_SUB_LZERO autoloading from theory `REAL` ... REAL_SUB_LZERO = |- !x. (& 0) - x = -- x Run time: 0.0s DIFF_CHAIN = |- !f g x. (f diffl l)(g x) /\ (g diffl m)x ==> ((\x. f(g x)) diffl (l * m))x Run time: 0.4s Intermediate theorems generated: 2058 Theorem REAL_DIV_REFL autoloading from theory `REAL` ... REAL_DIV_REFL = |- !x. ~(x = & 0) ==> (x / x = & 1) Run time: 0.0s DIFF_X = |- !x. ((\x. x) diffl (& 1))x Run time: 0.0s Intermediate theorems generated: 148 Theorem REAL_MUL_RID autoloading from theory `REAL` ... REAL_MUL_RID = |- !x. x * (& 1) = x Run time: 0.0s Theorem POW_ADD autoloading from theory `REAL` ... POW_ADD = |- !c m n. c pow (m num_add n) = (c pow m) * (c pow n) Run time: 0.0s Theorem num_CASES autoloading from theory `arithmetic` ... num_CASES = |- !m. (m = 0) \/ (?n. m = SUC n) Run time: 0.0s Theorem ADD_SUB autoloading from theory `arithmetic` ... ADD_SUB = |- !a c. (a num_add c) num_sub c = a Run time: 0.0s Theorem ADD1 autoloading from theory `arithmetic` ... ADD1 = |- !m. SUC m = m num_add 1 Run time: 0.0s Theorem REAL autoloading from theory `REAL` ... REAL = |- !n. &(SUC n) = (& n) + (& 1) Run time: 0.0s Definition pow autoloading from theory `REAL` ... pow = |- (!x. x pow 0 = & 1) /\ (!x n. x pow (SUC n) = x * (x pow n)) Run time: 0.0s Intermediate theorems generated: 1 DIFF_POW = |- !n x. ((\x'. x' pow n) diffl ((& n) * (x pow (n num_sub 1))))x Run time: 0.0s Intermediate theorems generated: 335 Theorem REAL_ADD_RID autoloading from theory `REAL` ... REAL_ADD_RID = |- !x. x + (& 0) = x Run time: 0.0s Theorem POW_2 autoloading from theory `REAL` ... POW_2 = |- !x. x pow 2 = x * x Run time: 0.0s Theorem REAL_NEG_SUB autoloading from theory `REAL` ... REAL_NEG_SUB = |- !x y. --(x - y) = y - x Run time: 0.0s Theorem REAL_NEG_RMUL autoloading from theory `REAL` ... REAL_NEG_RMUL = |- !x y. --(x * y) = x * (-- y) Run time: 0.0s Theorem REAL_NEG_LMUL autoloading from theory `REAL` ... REAL_NEG_LMUL = |- !x y. --(x * y) = (-- x) * y Run time: 0.0s Theorem REAL_ENTIRE autoloading from theory `REAL` ... REAL_ENTIRE = |- !x y. (x * y = & 0) = (x = & 0) \/ (y = & 0) Run time: 0.0s Theorem REAL_EQ_LMUL autoloading from theory `REAL` ... REAL_EQ_LMUL = |- !x y z. (x * y = x * z) = (x = & 0) \/ (y = z) Run time: 0.1s Theorem REAL_LNEG_UNIQ autoloading from theory `REAL` ... REAL_LNEG_UNIQ = |- !x y. (x + y = & 0) = (x = -- y) Run time: 0.0s Theorem ABS_ZERO autoloading from theory `REAL` ... ABS_ZERO = |- !x. (abs x = & 0) = (x = & 0) Run time: 0.0s DIFF_XM1 = |- !x. ~(x = & 0) ==> ((\x. inv x) diffl (--((inv x) pow 2)))x Run time: 0.0s Intermediate theorems generated: 818 Theorem POW_INV autoloading from theory `REAL` ... POW_INV = |- !c. ~(c = & 0) ==> (!n. inv(c pow n) = (inv c) pow n) Run time: 0.0s DIFF_INV = |- !f l x. (f diffl l)x /\ ~(f x = & 0) ==> ((\x. inv(f x)) diffl (--(l / ((f x) pow 2))))x Run time: 0.0s Intermediate theorems generated: 106 Theorem REAL_MUL_RINV autoloading from theory `REAL` ... REAL_MUL_RINV = |- !x. ~(x = & 0) ==> (x * (inv x) = & 1) Run time: 0.0s Theorem REAL_INV_MUL autoloading from theory `REAL` ... REAL_INV_MUL = |- !x y. ~(x = & 0) /\ ~(y = & 0) ==> (inv(x * y) = (inv x) * (inv y)) Run time: 0.0s Theorem REAL_LDISTRIB autoloading from theory `REAL` ... REAL_LDISTRIB = |- !x y z. x * (y + z) = (x * y) + (x * z) Run time: 0.0s DIFF_DIV = |- !f g l m. (f diffl l)x /\ (g diffl m)x /\ ~(g x = & 0) ==> ((\x. (f x) / (g x)) diffl (((l * (g x)) - (m * (f x))) / ((g x) pow 2))) x Run time: 0.0s Intermediate theorems generated: 293 Theorem LESS_EQ_ADD autoloading from theory `arithmetic` ... LESS_EQ_ADD = |- !m n. m num_le (m num_add n) Run time: 0.0s Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n num_lt (SUC n) Run time: 0.0s Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 num_add m = m) /\ (m num_add 0 = m) /\ ((SUC m) num_add n = SUC(m num_add n)) /\ (m num_add (SUC n) = SUC(m num_add n)) Run time: 0.0s Theorem LESS_TRANS autoloading from theory `arithmetic` ... LESS_TRANS = |- !m n p. m num_lt n /\ n num_lt p ==> m num_lt p Run time: 0.0s Theorem Sum autoloading from theory `REAL` ... Sum = |- (Sum(n,0)f = & 0) /\ (Sum(n,SUC m)f = (Sum(n,m)f) + (f(n num_add m))) Run time: 0.0s DIFF_SUM = |- !f f' m n x. (!r. m num_le r /\ r num_lt (m num_add n) ==> ((\x'. f r x') diffl (f' r x))x) ==> ((\x'. Sum(m,n)(\n'. f n' x')) diffl (Sum(m,n)(\r. f' r x)))x Run time: 0.0s Intermediate theorems generated: 301 CONT_BOUNDED = |- !f a b. a <= b /\ (!x. a <= x /\ x <= b ==> f contl x) ==> (?M. !x. a <= x /\ x <= b ==> (f x) <= M) Run time: 0.0s Intermediate theorems generated: 1866 Theorem REAL_LE_LT autoloading from theory `REAL` ... REAL_LE_LT = |- !x y. x <= y = x < y \/ (x = y) Run time: 0.0s Theorem REAL_SUP_LE autoloading from theory `REAL` ... REAL_SUP_LE = |- !P. (?x. P x) /\ (?z. !x. P x ==> x <= z) ==> (!y. (?x. P x /\ y < x) = y < (sup P)) Run time: 0.0s CONT_HASSUP = |- !f a b. a <= b /\ (!x. a <= x /\ x <= b ==> f contl x) ==> (?M. (!x. a <= x /\ x <= b ==> (f x) <= M) /\ (!N. N < M ==> (?x. a <= x /\ x <= b /\ N < (f x)))) Run time: 0.0s Intermediate theorems generated: 412 Theorem REAL_LT_SUB_RADD autoloading from theory `REAL` ... REAL_LT_SUB_RADD = |- !x y z. (x - y) < z = x < (z + y) Run time: 0.0s Theorem REAL_LT_SUB_LADD autoloading from theory `REAL` ... REAL_LT_SUB_LADD = |- !x y z. x < (y - z) = (x + z) < y Run time: 0.0s Theorem REAL_INVINV autoloading from theory `REAL` ... REAL_INVINV = |- !x. ~(x = & 0) ==> (inv(inv x) = x) Run time: 0.0s Theorem REAL_LT_INV autoloading from theory `REAL` ... REAL_LT_INV = |- !x y. (& 0) < x /\ x < y ==> (inv y) < (inv x) Run time: 0.0s Theorem REAL_LT_ADDR autoloading from theory `REAL` ... REAL_LT_ADDR = |- !x y. x < (x + y) = (& 0) < y Run time: 0.0s Theorem REAL_INV_POS autoloading from theory `REAL` ... REAL_INV_POS = |- !x. (& 0) < x ==> (& 0) < (inv x) Run time: 0.0s Theorem REAL_LT_IMP_NE autoloading from theory `REAL` ... REAL_LT_IMP_NE = |- !x y. x < y ==> ~(x = y) Run time: 0.0s CONT_ATTAINS = |- !f a b. a <= b /\ (!x. a <= x /\ x <= b ==> f contl x) ==> (?M. (!x. a <= x /\ x <= b ==> (f x) <= M) /\ (?x. a <= x /\ x <= b /\ (f x = M))) Run time: 0.0s Intermediate theorems generated: 1646 CONT_ATTAINS2 = |- !f a b. a <= b /\ (!x. a <= x /\ x <= b ==> f contl x) ==> (?M. (!x. a <= x /\ x <= b ==> M <= (f x)) /\ (?x. a <= x /\ x <= b /\ (f x = M))) Run time: 0.0s Intermediate theorems generated: 177 Theorem ABS_SIGN autoloading from theory `REAL` ... ABS_SIGN = |- !x y. (abs(x - y)) < y ==> (& 0) < x Run time: 0.0s Theorem REAL_LT_RMUL autoloading from theory `REAL` ... REAL_LT_RMUL = |- !x y z. (& 0) < z ==> ((x * z) < (y * z) = x < y) Run time: 0.0s DIFF_LINC = |- !f x l. (f diffl l)x /\ (& 0) < l ==> (?d. (& 0) < d /\ (!h. (& 0) < h /\ h < d ==> (f x) < (f(x + h)))) Run time: 0.0s Intermediate theorems generated: 270 Theorem REAL_NEG_LE0 autoloading from theory `REAL` ... REAL_NEG_LE0 = |- !x. (-- x) <= (& 0) = (& 0) <= x Run time: 0.0s Theorem ABS_SIGN2 autoloading from theory `REAL` ... ABS_SIGN2 = |- !x y. (abs(x - y)) < (-- y) ==> x < (& 0) Run time: 0.0s Theorem REAL_NEG_INV autoloading from theory `REAL` ... REAL_NEG_INV = |- !x. ~(x = & 0) ==> (--(inv x) = inv(-- x)) Run time: 0.0s Theorem REAL_NEG_LT0 autoloading from theory `REAL` ... REAL_NEG_LT0 = |- !x. (-- x) < (& 0) = (& 0) < x Run time: 0.0s DIFF_LDEC = |- !f x l. (f diffl l)x /\ l < (& 0) ==> (?d. (& 0) < d /\ (!h. (& 0) < h /\ h < d ==> (f x) < (f(x - h)))) Run time: 0.0s Intermediate theorems generated: 469 Theorem REAL_ADD_SUB2 autoloading from theory `REAL` ... REAL_ADD_SUB2 = |- !x y. x - (x + y) = -- y Run time: 0.0s Theorem REAL_SUB_SUB2 autoloading from theory `REAL` ... REAL_SUB_SUB2 = |- !x y. x - (x - y) = y Run time: 0.0s DIFF_LMAX = |- !f x l. (f diffl l)x /\ (?d. (& 0) < d /\ (!y. (abs(x - y)) < d ==> (f y) <= (f x))) ==> (l = & 0) Run time: 0.1s Intermediate theorems generated: 572 Theorem REAL_NEG_EQ0 autoloading from theory `REAL` ... REAL_NEG_EQ0 = |- !x. (-- x = & 0) = (x = & 0) Run time: 0.0s DIFF_LMIN = |- !f x l. (f diffl l)x /\ (?d. (& 0) < d /\ (!y. (abs(x - y)) < d ==> (f x) <= (f y))) ==> (l = & 0) Run time: 0.0s Intermediate theorems generated: 88 DIFF_LCONST = |- !f x l. (f diffl l)x /\ (?d. (& 0) < d /\ (!y. (abs(x - y)) < d ==> (f y = f x))) ==> (l = & 0) Run time: 0.0s Intermediate theorems generated: 96 INTERVAL_LEMMA = |- !a b x. a < x /\ x < b ==> (?d. (& 0) < d /\ (!y. (abs(x - y)) < d ==> a <= y /\ y <= b)) Run time: 0.0s Intermediate theorems generated: 466 Theorem REAL_MEAN autoloading from theory `REAL` ... REAL_MEAN = |- !x y. x < y ==> (?z. x < z /\ z < y) Run time: 0.0s Theorem REAL_LE_ANTISYM autoloading from theory `REAL` ... REAL_LE_ANTISYM = |- !x y. x <= y /\ y <= x = (x = y) Run time: 0.0s ROLLE = |- !f a b. a < b /\ (f a = f b) /\ (!x. a <= x /\ x <= b ==> f contl x) /\ (!x. a < x /\ x < b ==> f differentiable x) ==> (?z. a < z /\ z < b /\ (f diffl (& 0))z) Run time: 0.0s Intermediate theorems generated: 3178 gfn = "\x. (f x) - ((((f b) - (f a)) / (b - a)) * x)" : term Run time: 0.0s Theorem REAL_NEG_ADD autoloading from theory `REAL` ... REAL_NEG_ADD = |- !x y. --(x + y) = (-- x) + (-- y) Run time: 0.0s Theorem REAL_EQ_RMUL autoloading from theory `REAL` ... REAL_EQ_RMUL = |- !x y z. (x * z = y * z) = (z = & 0) \/ (x = y) Run time: 0.0s MVT_LEMMA = |- !f a b. (\x. (f x) - ((((f b) - (f a)) / (b - a)) * x))a = (\x. (f x) - ((((f b) - (f a)) / (b - a)) * x))b Run time: 0.0s Intermediate theorems generated: 443 Theorem REAL_DIV_LMUL autoloading from theory `REAL` ... REAL_DIV_LMUL = |- !x y. ~(y = & 0) ==> (y * (x / y) = x) Run time: 0.0s MVT = |- !f a b. a < b /\ (!x. a <= x /\ x <= b ==> f contl x) /\ (!x. a < x /\ x < b ==> f differentiable x) ==> (?l z. a < z /\ z < b /\ (f diffl l)z /\ ((f b) - (f a) = (b - a) * l)) Run time: 0.0s Intermediate theorems generated: 612 DIFF_ISCONST_END = |- !f a b. a < b /\ (!x. a <= x /\ x <= b ==> f contl x) /\ (!x. a < x /\ x < b ==> (f diffl (& 0))x) ==> (f b = f a) Run time: 0.0s Intermediate theorems generated: 253 DIFF_ISCONST = |- !f a b. a < b /\ (!x. a <= x /\ x <= b ==> f contl x) /\ (!x. a < x /\ x < b ==> (f diffl (& 0))x) ==> (!x. a <= x /\ x <= b ==> (f x = f a)) Run time: 0.0s Intermediate theorems generated: 310 DIFF_ISCONST_ALL = |- !f. (!x. (f diffl (& 0))x) ==> (!x y. f x = f y) Run time: 0.0s Intermediate theorems generated: 172 () : void Run time: 0.0s Intermediate theorems generated: 1 File lim.ml loaded () : void Run time: 1.1s Intermediate theorems generated: 21608 #\ echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `powser.ml`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool false : bool () : void Theory SEQ loaded Theory LIM loaded () : void false : bool Run time: 0.0s LAND_CONV = - : (conv -> conv) Run time: 0.0s TAUT_CONV = - : conv Run time: 0.0s AC = - : ((thm # thm) -> conv) Run time: 0.0s GEN_PAIR_TAC = - : tactic Run time: 0.0s MK_COMB_TAC = - : tactic Run time: 0.0s BINOP_TAC = - : tactic Run time: 0.0s SYM_CANON_CONV = - : (thm -> ((term # term) -> bool) -> conv) Run time: 0.0s IMP_SUBST_TAC = - : thm_tactic Run time: 0.0s ABBREV_TAC = - : (term -> tactic) Run time: 0.0s EXT_CONV = - : conv Run time: 0.0s ABS_TAC = - : tactic Run time: 0.0s EQUAL_TAC = - : tactic Run time: 0.0s X_BETA_CONV = - : (term -> conv) Run time: 0.0s EXACT_CONV = - : (thm list -> conv) Run time: 0.0s HABS_CONV = - : conv Run time: 0.0s autoload_definitions = - : (string -> void) Run time: 0.0s autoload_theorems = - : (string -> void) Run time: 0.0s EXPAND_TAC = - : (string -> tactic) Run time: 0.0s File useful loaded () : void Run time: 0.0s real_interface_map = [(`--`, `real_neg`); (`num_add`, `+`); (`+`, `real_add`); (`num_mul`, `*`); (`*`, `real_mul`); (`num_sub`, `-`); (`-`, `real_sub`); (`num_lt`, `<`); (`<`, `real_lt`); (`num_le`, `<=`); (`<=`, `real_le`); (`num_gt`, `>`); (`>`, `real_gt`); (`num_ge`, `>=`); (`>=`, `real_ge`); (`inv`, `real_inv`); (`&`, `real_of_num`)] : (string # string) list Run time: 0.0s [(); ()] : void list Run time: 0.0s [] : (string # string) list Run time: 0.0s () : void Run time: 0.0s Intermediate theorems generated: 47 () : void Run time: 0.0s Definition pow autoloading from theory `REAL` ... pow = |- (!x. x pow 0 = & 1) /\ (!x n. x pow (SUC n) = x * (x pow n)) Run time: 0.0s Intermediate theorems generated: 1 Definition SUB autoloading from theory `arithmetic` ... SUB = |- (!m. 0 num_sub m = 0) /\ (!m n. (SUC m) num_sub n = (m num_lt n => 0 | SUC(m num_sub n))) Run time: 0.0s Intermediate theorems generated: 1 Theorem LESS_IMP_LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_IMP_LESS_OR_EQ = |- !m n. m num_lt n ==> m num_le n Run time: 0.0s Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m num_le m Run time: 0.0s Theorem LESS_THM autoloading from theory `prim_rec` ... LESS_THM = |- !m n. m num_lt (SUC n) = (m = n) \/ m num_lt n Run time: 0.0s Theorem NOT_LESS autoloading from theory `arithmetic` ... NOT_LESS = |- !m n. ~m num_lt n = n num_le m Run time: 0.0s Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 num_add m = m) /\ (m num_add 0 = m) /\ ((SUC m) num_add n = SUC(m num_add n)) /\ (m num_add (SUC n) = SUC(m num_add n)) Run time: 0.0s Theorem REAL_MUL_ASSOC autoloading from theory `REAL` ... REAL_MUL_ASSOC = |- !x y z. x * (y * z) = (x * y) * z Run time: 0.0s Theorem REAL_MUL_SYM autoloading from theory `REAL` ... REAL_MUL_SYM = |- !x y. x * y = y * x Run time: 0.0s Theorem SUM_SUBST autoloading from theory `REAL` ... SUM_SUBST = |- !f g m n. (!p. m num_le p /\ p num_lt (m num_add n) ==> (f p = g p)) ==> (Sum(m,n)f = Sum(m,n)g) Run time: 0.0s Theorem SUM_CMUL autoloading from theory `REAL` ... SUM_CMUL = |- !f c m n. Sum(m,n)(\n'. c * (f n')) = c * (Sum(m,n)f) Run time: 0.0s POWDIFF_LEMMA = |- !n x y. Sum(0,SUC n)(\p. (x pow p) * (y pow ((SUC n) num_sub p))) = y * (Sum(0,SUC n)(\p. (x pow p) * (y pow (n num_sub p)))) Run time: 0.0s Intermediate theorems generated: 223 Theorem REAL_ADD_LINV autoloading from theory `REAL` ... REAL_ADD_LINV = |- !x. (-- x) + x = & 0 Run time: 0.0s Theorem REAL_ADD_LID_UNIQ autoloading from theory `REAL` ... REAL_ADD_LID_UNIQ = |- !x y. (x + y = y) = (x = & 0) Run time: 0.0s Theorem REAL_ADD_SYM autoloading from theory `REAL` ... REAL_ADD_SYM = |- !x y. x + y = y + x Run time: 0.0s Theorem REAL_ADD_ASSOC autoloading from theory `REAL` ... REAL_ADD_ASSOC = |- !x y z. x + (y + z) = (x + y) + z Run time: 0.0s Definition real_sub autoloading from theory `REAL` ... real_sub = |- !x y. x - y = x + (-- y) Run time: 0.0s Intermediate theorems generated: 1 Theorem REAL_SUB_LDISTRIB autoloading from theory `REAL` ... REAL_SUB_LDISTRIB = |- !x y z. x * (y - z) = (x * y) - (x * z) Run time: 0.0s Theorem SUB_EQUAL_0 autoloading from theory `arithmetic` ... SUB_EQUAL_0 = |- !c. c num_sub c = 0 Run time: 0.0s Theorem REAL_LDISTRIB autoloading from theory `REAL` ... REAL_LDISTRIB = |- !x y z. x * (y + z) = (x * y) + (x * z) Run time: 0.0s Theorem REAL_MUL_RID autoloading from theory `REAL` ... REAL_MUL_RID = |- !x. x * (& 1) = x Run time: 0.0s Theorem SUB_0 autoloading from theory `arithmetic` ... SUB_0 = |- !m. (0 num_sub m = 0) /\ (m num_sub 0 = m) Run time: 0.0s Theorem REAL_ADD_LID autoloading from theory `REAL` ... REAL_ADD_LID = |- !x. (& 0) + x = x Run time: 0.0s Theorem Sum autoloading from theory `REAL` ... Sum = |- (Sum(n,0)f = & 0) /\ (Sum(n,SUC m)f = (Sum(n,m)f) + (f(n num_add m))) Run time: 0.0s POWDIFF = |- !n x y. (x pow (SUC n)) - (y pow (SUC n)) = (x - y) * (Sum(0,SUC n)(\p. (x pow p) * (y pow (n num_sub p)))) Run time: 0.0s Intermediate theorems generated: 485 Theorem REAL_NEG_SUB autoloading from theory `REAL` ... REAL_NEG_SUB = |- !x y. --(x - y) = y - x Run time: 0.0s Theorem REAL_NEG_LMUL autoloading from theory `REAL` ... REAL_NEG_LMUL = |- !x y. --(x * y) = (-- x) * y Run time: 0.0s Theorem REAL_NEGNEG autoloading from theory `REAL` ... REAL_NEGNEG = |- !x. --(-- x) = x Run time: 0.0s Theorem REAL_SUB_0 autoloading from theory `REAL` ... REAL_SUB_0 = |- !x y. (x - y = & 0) = (x = y) Run time: 0.0s Theorem ADD_SYM autoloading from theory `arithmetic` ... ADD_SYM = |- !m n. m num_add n = n num_add m Run time: 0.0s Theorem POW_ADD autoloading from theory `REAL` ... POW_ADD = |- !c m n. c pow (m num_add n) = (c pow m) * (c pow n) Run time: 0.0s Theorem REAL_EQ_LMUL2 autoloading from theory `REAL` ... REAL_EQ_LMUL2 = |- !x y z. ~(x = & 0) ==> ((y = z) = (x * y = x * z)) Run time: 0.0s POWREV = |- !n x y. Sum(0,SUC n)(\p. (x pow p) * (y pow (n num_sub p))) = Sum(0,SUC n)(\p. (x pow (n num_sub p)) * (y pow p)) Run time: 0.0s Intermediate theorems generated: 235 Theorem REAL_LT_IMP_NE autoloading from theory `REAL` ... REAL_LT_IMP_NE = |- !x y. x < y ==> ~(x = y) Run time: 0.0s Theorem POW_INV autoloading from theory `REAL` ... POW_INV = |- !c. ~(c = & 0) ==> (!n. inv(c pow n) = (inv c) pow n) Run time: 0.0s Theorem POW_MUL autoloading from theory `REAL` ... POW_MUL = |- !n x y. (x * y) pow n = (x pow n) * (y pow n) Run time: 0.0s Theorem POW_ABS autoloading from theory `REAL` ... POW_ABS = |- !c n. (abs c) pow n = abs(c pow n) Run time: 0.0s Theorem REAL_LT_1 autoloading from theory `REAL` ... REAL_LT_1 = |- !x y. (& 0) <= x /\ x < y ==> (x / y) < (& 1) Run time: 0.0s Theorem REAL_NOT_LT autoloading from theory `REAL` ... REAL_NOT_LT = |- !x y. ~x < y = y <= x Run time: 0.0s Theorem ABS_INV autoloading from theory `REAL` ... ABS_INV = |- !x. ~(x = & 0) ==> (abs(inv x) = inv(abs x)) Run time: 0.0s Theorem GP autoloading from theory `SEQ` ... GP = |- !x. (abs x) < (& 1) ==> (\n. x pow n) sums (inv((& 1) - x)) Run time: 0.0s Theorem SER_CMUL autoloading from theory `SEQ` ... SER_CMUL = |- !x x0 c. x sums x0 ==> (\n. c * (x n)) sums (c * x0) Run time: 0.0s Definition real_div autoloading from theory `REAL` ... real_div = |- !x y. x / y = x * (inv y) Run time: 0.0s Intermediate theorems generated: 1 Definition summable autoloading from theory `SEQ` ... summable = |- !f. summable f = (?s. f sums s) Run time: 0.0s Intermediate theorems generated: 1 Theorem REAL_LT_IMP_LE autoloading from theory `REAL` ... REAL_LT_IMP_LE = |- !x y. x < y ==> x <= y Run time: 0.0s Theorem REAL_LE_RMUL autoloading from theory `REAL` ... REAL_LE_RMUL = |- !x y z. (& 0) < z ==> ((x * z) <= (y * z) = x <= y) Run time: 0.0s Theorem REAL_LE_REFL autoloading from theory `REAL` ... REAL_LE_REFL = |- !x. x <= x Run time: 0.0s Theorem REAL_MUL_RZERO autoloading from theory `REAL` ... REAL_MUL_RZERO = |- !x. x * (& 0) = & 0 Run time: 0.0s Theorem ABS_0 autoloading from theory `REAL` ... ABS_0 = |- abs(& 0) = & 0 Run time: 0.0s Theorem ABS_CASES autoloading from theory `REAL` ... ABS_CASES = |- !x. (x = & 0) \/ (& 0) < (abs x) Run time: 0.0s Theorem ABS_ABS autoloading from theory `REAL` ... ABS_ABS = |- !x. abs(abs x) = abs x Run time: 0.0s Theorem ABS_MUL autoloading from theory `REAL` ... ABS_MUL = |- !x y. abs(x * y) = (abs x) * (abs y) Run time: 0.0s Theorem ABS_POS autoloading from theory `REAL` ... ABS_POS = |- !x. (& 0) <= (abs x) Run time: 0.0s Theorem REAL_LET_TRANS autoloading from theory `REAL` ... REAL_LET_TRANS = |- !x y z. x <= y /\ y < z ==> x < z Run time: 0.0s Theorem POW_NZ autoloading from theory `REAL` ... POW_NZ = |- !c n. ~(c = & 0) ==> ~(c pow n = & 0) Run time: 0.0s Theorem ABS_NZ autoloading from theory `REAL` ... ABS_NZ = |- !x. ~(x = & 0) = (& 0) < (abs x) Run time: 0.0s Theorem REAL_LE_RDIV autoloading from theory `REAL` ... REAL_LE_RDIV = |- !x y z. (& 0) < x /\ (y * x) <= z ==> y <= (z / x) Run time: 0.0s Theorem SER_COMPAR autoloading from theory `SEQ` ... SER_COMPAR = |- !f g. (?N. !n. n num_ge N ==> (abs(f n)) <= (g n)) /\ summable g ==> summable f Run time: 0.0s Theorem SEQ_BOUNDED autoloading from theory `SEQ` ... SEQ_BOUNDED = |- !s. bounded(mr1,$num_ge)s = (?k. !n. (abs(s n)) < k) Run time: 0.0s Theorem SEQ_CBOUNDED autoloading from theory `SEQ` ... SEQ_CBOUNDED = |- !f. cauchy f ==> bounded(mr1,$num_ge)f Run time: 0.0s Theorem SEQ_CAUCHY autoloading from theory `SEQ` ... SEQ_CAUCHY = |- !f. cauchy f = convergent f Run time: 0.0s Theorem SER_ZERO autoloading from theory `SEQ` ... SER_ZERO = |- !f. summable f ==> f tends_num_real (& 0) Run time: 0.0s Definition convergent autoloading from theory `SEQ` ... convergent = |- !f. convergent f = (?l. f tends_num_real l) Run time: 0.0s Intermediate theorems generated: 1 POWSER_INSIDEA = |- !f x z. summable(\n. (f n) * (x pow n)) /\ (abs z) < (abs x) ==> summable(\n. (abs(f n)) * (z pow n)) Run time: 0.0s Intermediate theorems generated: 753 Theorem SER_ACONV autoloading from theory `SEQ` ... SER_ACONV = |- !f. summable(\n. abs(f n)) ==> summable f Run time: 0.0s POWSER_INSIDE = |- !f x z. summable(\n. (f n) * (x pow n)) /\ (abs z) < (abs x) ==> summable(\n. (f n) * (z pow n)) Run time: 0.0s Intermediate theorems generated: 67 diffs = |- !c. diffs c = (\n. (&(SUC n)) * (c(SUC n))) Run time: 0.0s Intermediate theorems generated: 2 Theorem REAL_NEG_RMUL autoloading from theory `REAL` ... REAL_NEG_RMUL = |- !x y. --(x * y) = x * (-- y) Run time: 0.0s DIFFS_NEG = |- !c. diffs(\n. --(c n)) = (\n. --(diffs c n)) Run time: 0.0s Intermediate theorems generated: 37 Theorem SUC_SUB1 autoloading from theory `arithmetic` ... SUC_SUB1 = |- !m. (SUC m) num_sub 1 = m Run time: 0.0s Theorem REAL_MUL_LZERO autoloading from theory `REAL` ... REAL_MUL_LZERO = |- !x. (& 0) * x = & 0 Run time: 0.0s DIFFS_LEMMA = |- !n c x. Sum(0,n)(\n'. (diffs c n') * (x pow n')) = (Sum(0,n)(\n'. (& n') * ((c n') * (x pow (n' num_sub 1))))) + ((& n) * ((c n) * (x pow (n num_sub 1)))) Run time: 0.0s Intermediate theorems generated: 229 Theorem REAL_EQ_SUB_LADD autoloading from theory `REAL` ... REAL_EQ_SUB_LADD = |- !x y z. (x = y - z) = (x + z = y) Run time: 0.0s DIFFS_LEMMA2 = |- !n c x. Sum(0,n)(\n. (& n) * ((c n) * (x pow (n num_sub 1)))) = (Sum(0,n)(\n. (diffs c n) * (x pow n))) - ((& n) * ((c n) * (x pow (n num_sub 1)))) Run time: 0.0s Intermediate theorems generated: 34 Theorem REAL_SUB_RZERO autoloading from theory `REAL` ... REAL_SUB_RZERO = |- !x. x - (& 0) = x Run time: 0.0s Theorem SEQ_SUB autoloading from theory `SEQ` ... SEQ_SUB = |- !x x0 y y0. x tends_num_real x0 /\ y tends_num_real y0 ==> (\n. (x n) - (y n)) tends_num_real (x0 - y0) Run time: 0.0s Definition sums autoloading from theory `SEQ` ... sums = |- !f s. f sums s = (\n. Sum(0,n)f) tends_num_real s Run time: 0.0s Intermediate theorems generated: 1 Theorem SUMMABLE_SUM autoloading from theory `SEQ` ... SUMMABLE_SUM = |- !f. summable f ==> f sums (suminf f) Run time: 0.0s Theorem SEQ_SUC autoloading from theory `SEQ` ... SEQ_SUC = |- !f l. f tends_num_real l = (\n. f(SUC n)) tends_num_real l Run time: 0.0s DIFFS_EQUIV = |- !c x. summable(\n. (diffs c n) * (x pow n)) ==> (\n. (& n) * ((c n) * (x pow (n num_sub 1)))) sums (suminf(\n. (diffs c n) * (x pow n))) Run time: 0.0s Intermediate theorems generated: 180 Theorem SUB_ADD autoloading from theory `arithmetic` ... SUB_ADD = |- !m n. n num_le m ==> ((m num_sub n) num_add n = m) Run time: 0.0s TERMDIFF_LEMMA1 = |- !m z h. Sum(0,m)(\p. (((z + h) pow (m num_sub p)) * (z pow p)) - (z pow m)) = Sum (0,m) (\p. (z pow p) * (((z + h) pow (m num_sub p)) - (z pow (m num_sub p)))) Run time: 0.0s Intermediate theorems generated: 131 Theorem SUB_MONO_EQ autoloading from theory `arithmetic` ... SUB_MONO_EQ = |- !n m. (SUC n) num_sub (SUC m) = n num_sub m Run time: 0.0s Theorem ADD_SUB autoloading from theory `arithmetic` ... ADD_SUB = |- !a c. (a num_add c) num_sub c = a Run time: 0.0s Theorem ADD1 autoloading from theory `arithmetic` ... ADD1 = |- !m. SUC m = m num_add 1 Run time: 0.0s Theorem LESS_ADD_1 autoloading from theory `arithmetic` ... LESS_ADD_1 = |- !m n. n num_lt m ==> (?p. m = n num_add (p num_add 1)) Run time: 0.0s Theorem SUM_NSUB autoloading from theory `REAL` ... SUM_NSUB = |- !n f c. (Sum(0,n)f) - ((& n) * c) = Sum(0,n)(\p. (f p) - c) Run time: 0.0s Theorem REAL_ADD_RID autoloading from theory `REAL` ... REAL_ADD_RID = |- !x. x + (& 0) = x Run time: 0.0s Theorem REAL_ADD2_SUB2 autoloading from theory `REAL` ... REAL_ADD2_SUB2 = |- !a b c d. (a + b) - (c + d) = (a - c) + (b - d) Run time: 0.0s Theorem REAL_RDISTRIB autoloading from theory `REAL` ... REAL_RDISTRIB = |- !x y z. (x + y) * z = (x * z) + (y * z) Run time: 0.0s Theorem REAL_MUL_LID autoloading from theory `REAL` ... REAL_MUL_LID = |- !x. (& 1) * x = x Run time: 0.0s Theorem REAL autoloading from theory `REAL` ... REAL = |- !n. &(SUC n) = (& n) + (& 1) Run time: 0.0s Theorem REAL_EQ_LMUL autoloading from theory `REAL` ... REAL_EQ_LMUL = |- !x y z. (x * y = x * z) = (x = & 0) \/ (y = z) Run time: 0.0s Theorem REAL_ADD_SUB autoloading from theory `REAL` ... REAL_ADD_SUB = |- !x y. (x + y) - x = y Run time: 0.0s Theorem REAL_SUB_REFL autoloading from theory `REAL` ... REAL_SUB_REFL = |- !x. x - x = & 0 Run time: 0.0s Theorem num_CASES autoloading from theory `arithmetic` ... num_CASES = |- !m. (m = 0) \/ (?n. m = SUC n) Run time: 0.0s Theorem REAL_DIV_LMUL autoloading from theory `REAL` ... REAL_DIV_LMUL = |- !x y. ~(y = & 0) ==> (y * (x / y) = x) Run time: 0.0s TERMDIFF_LEMMA2 = |- !z h. ~(h = & 0) ==> (((((z + h) pow n) - (z pow n)) / h) - ((& n) * (z pow (n num_sub 1))) = h * (Sum (0,n num_sub 1) (\p. (z pow p) * (Sum (0,(n num_sub 1) num_sub p) (\q. ((z + h) pow q) * (z pow (((n num_sub 2) num_sub p) num_sub q))))))) Run time: 0.0s Intermediate theorems generated: 866 Theorem INV_SUC_EQ autoloading from theory `prim_rec` ... INV_SUC_EQ = |- !m n. (SUC m = SUC n) = (m = n) Run time: 0.0s Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n num_lt (SUC n) Run time: 0.0s Theorem LESS_EQ_ADD autoloading from theory `arithmetic` ... LESS_EQ_ADD = |- !m n. m num_le (m num_add n) Run time: 0.0s Theorem LESS_EQ_TRANS autoloading from theory `arithmetic` ... LESS_EQ_TRANS = |- !m n p. m num_le n /\ n num_le p ==> m num_le p Run time: 0.0s Theorem LESS_EQ_MONO autoloading from theory `arithmetic` ... LESS_EQ_MONO = |- !n m. (SUC n) num_le (SUC m) = n num_le m Run time: 0.0s Theorem REAL_LE autoloading from theory `REAL` ... REAL_LE = |- !m n. (& m) <= (& n) = m num_le n Run time: 0.0s Theorem REAL_LE_LT autoloading from theory `REAL` ... REAL_LE_LT = |- !x y. x <= y = x < y \/ (x = y) Run time: 0.0s Theorem POW_POS autoloading from theory `REAL` ... POW_POS = |- !x. (& 0) <= x ==> (!n. (& 0) <= (x pow n)) Run time: 0.0s Theorem POW_LE autoloading from theory `REAL` ... POW_LE = |- !n x y. (& 0) <= x /\ x <= y ==> (x pow n) <= (y pow n) Run time: 0.0s Theorem REAL_LE_MUL2 autoloading from theory `REAL` ... REAL_LE_MUL2 = |- !x1 x2 y1 y2. (& 0) <= x1 /\ (& 0) <= y1 /\ x1 <= x2 /\ y1 <= y2 ==> (x1 * y1) <= (x2 * y2) Run time: 0.0s Theorem SUM_BOUND autoloading from theory `REAL` ... SUM_BOUND = |- !f K m n. (!p. m num_le p /\ p num_lt (m num_add n) ==> (f p) <= K) ==> (Sum(m,n)f) <= ((& n) * K) Run time: 0.0s Theorem REAL_LE_LMUL autoloading from theory `REAL` ... REAL_LE_LMUL = |- !x y z. (& 0) < x ==> ((x * y) <= (x * z) = y <= z) Run time: 0.0s Theorem ABS_SUM autoloading from theory `REAL` ... ABS_SUM = |- !f m n. (abs(Sum(m,n)f)) <= (Sum(m,n)(\n'. abs(f n'))) Run time: 0.0s Theorem REAL_LE_TRANS autoloading from theory `REAL` ... REAL_LE_TRANS = |- !x y z. x <= y /\ y <= z ==> x <= z Run time: 0.0s TERMDIFF_LEMMA3 = |- !z h n K. ~(h = & 0) /\ (abs z) <= K /\ (abs(z + h)) <= K ==> (abs (((((z + h) pow n) - (z pow n)) / h) - ((& n) * (z pow (n num_sub 1))))) <= ((& n) * ((&(n num_sub 1)) * ((K pow (n num_sub 2)) * (abs h)))) Run time: 0.0s Intermediate theorems generated: 1294 Theorem REAL_MUL_LINV autoloading from theory `REAL` ... REAL_MUL_LINV = |- !x. ~(x = & 0) ==> ((inv x) * x = & 1) Run time: 0.0s Theorem REAL_LT_RDIV autoloading from theory `REAL` ... REAL_LT_RDIV = |- !x y z. (& 0) < z ==> ((x / z) < (y / z) = x < y) Run time: 0.0s Theorem REAL_LT_LMUL autoloading from theory `REAL` ... REAL_LT_LMUL = |- !x y z. (& 0) < x ==> ((x * y) < (x * z) = y < z) Run time: 0.0s Theorem REAL_LT_TRANS autoloading from theory `REAL` ... REAL_LT_TRANS = |- !x y z. x < y /\ y < z ==> x < z Run time: 0.0s Theorem REAL_DOWN2 autoloading from theory `REAL` ... REAL_DOWN2 = |- !x y. (& 0) < x /\ (& 0) < y ==> (?z. (& 0) < z /\ z < x /\ z < y) Run time: 0.0s Theorem LESS_0 autoloading from theory `prim_rec` ... LESS_0 = |- !n. 0 num_lt (SUC n) Run time: 0.0s Theorem REAL_LT autoloading from theory `REAL` ... REAL_LT = |- !m n. (& m) < (& n) = m num_lt n Run time: 0.0s Theorem REAL_INV_POS autoloading from theory `REAL` ... REAL_INV_POS = |- !x. (& 0) < x ==> (& 0) < (inv x) Run time: 0.0s Theorem REAL_LT_MUL autoloading from theory `REAL` ... REAL_LT_MUL = |- !x y. (& 0) < x /\ (& 0) < y ==> (& 0) < (x * y) Run time: 0.0s Theorem REAL_LE_ANTISYM autoloading from theory `REAL` ... REAL_LE_ANTISYM = |- !x y. x <= y /\ y <= x = (x = y) Run time: 0.0s Theorem REAL_LT_HALF2 autoloading from theory `REAL` ... REAL_LT_HALF2 = |- !d. (d / (& 2)) < d = (& 0) < d Run time: 0.0s Definition abs autoloading from theory `REAL` ... abs = |- !x. abs x = ((& 0) <= x => x | -- x) Run time: 0.0s Intermediate theorems generated: 1 Theorem REAL_LT_HALF1 autoloading from theory `REAL` ... REAL_LT_HALF1 = |- !d. (& 0) < (d / (& 2)) = (& 0) < d Run time: 0.0s Theorem LIM autoloading from theory `LIM` ... LIM = |- !f y0 x0. (f tends_real_real y0)x0 = (!e. (& 0) < e ==> (?d. (& 0) < d /\ (!x. (& 0) < (abs(x - x0)) /\ (abs(x - x0)) < d ==> (abs((f x) - y0)) < e))) Run time: 0.0s TERMDIFF_LEMMA4 = |- !f K k. (& 0) < k /\ (!h. (& 0) < (abs h) /\ (abs h) < k ==> (abs(f h)) <= (K * (abs h))) ==> (f tends_real_real (& 0))(& 0) Run time: 0.0s Intermediate theorems generated: 917 Theorem SER_LE autoloading from theory `SEQ` ... SER_LE = |- !f g. (!n. (f n) <= (g n)) /\ summable f /\ summable g ==> (suminf f) <= (suminf g) Run time: 0.0s Theorem SER_ABS autoloading from theory `SEQ` ... SER_ABS = |- !f. summable(\n. abs(f n)) ==> (abs(suminf f)) <= (suminf(\n. abs(f n))) Run time: 0.0s Theorem SUM_SUMMABLE autoloading from theory `SEQ` ... SUM_SUMMABLE = |- !f l. f sums l ==> summable f Run time: 0.0s Theorem SUM_UNIQ autoloading from theory `SEQ` ... SUM_UNIQ = |- !f x. f sums x ==> (x = suminf f) Run time: 0.0s TERMDIFF_LEMMA5 = |- !f g k. (& 0) < k /\ summable f /\ (!h. (& 0) < (abs h) /\ (abs h) < k ==> (!n. (abs(g h n)) <= ((f n) * (abs h)))) ==> ((\h. suminf(g h)) tends_real_real (& 0))(& 0) Run time: 0.0s Intermediate theorems generated: 502 Theorem REAL_LT_SUB_LADD autoloading from theory `REAL` ... REAL_LT_SUB_LADD = |- !x y z. x < (y - z) = (x + z) < y Run time: 0.0s Theorem ABS_TRIANGLE autoloading from theory `REAL` ... ABS_TRIANGLE = |- !x y. (abs(x + y)) <= ((abs x) + (abs y)) Run time: 0.0s Theorem REAL_LE_LMUL_IMP autoloading from theory `REAL` ... REAL_LE_LMUL_IMP = |- !x y z. (& 0) <= x /\ y <= z ==> (x * y) <= (x * z) Run time: 0.0s Theorem REAL_MUL_RINV autoloading from theory `REAL` ... REAL_MUL_RINV = |- !x. ~(x = & 0) ==> (x * (inv x) = & 1) Run time: 0.0s Theorem ABS_LE autoloading from theory `REAL` ... ABS_LE = |- !x. x <= (abs x) Run time: 0.0s Theorem REAL_LTE_TRANS autoloading from theory `REAL` ... REAL_LTE_TRANS = |- !x y z. x < y /\ y <= z ==> x < z Run time: 0.0s Theorem POW_1 autoloading from theory `REAL` ... POW_1 = |- !x. x pow 1 = x Run time: 0.0s Theorem ABS_N autoloading from theory `REAL` ... ABS_N = |- !n. abs(& n) = & n Run time: 0.0s Theorem ABS_REFL autoloading from theory `REAL` ... ABS_REFL = |- !x. (abs x = x) = (& 0) <= x Run time: 0.0s Theorem REAL_MEAN autoloading from theory `REAL` ... REAL_MEAN = |- !x y. x < y ==> (?z. x < z /\ z < y) Run time: 0.0s Theorem REAL_SUB_RDISTRIB autoloading from theory `REAL` ... REAL_SUB_RDISTRIB = |- !x y z. (x - y) * z = (x * z) - (y * z) Run time: 0.0s Theorem LIM_NULL autoloading from theory `LIM` ... LIM_NULL = |- !f l x. (f tends_real_real l)x = ((\x. (f x) - l) tends_real_real (& 0))x Run time: 0.0s Theorem SER_CDIV autoloading from theory `SEQ` ... SER_CDIV = |- !x x0 c. x sums x0 ==> (\n. (x n) / c) sums (x0 / c) Run time: 0.0s Theorem SER_SUB autoloading from theory `SEQ` ... SER_SUB = |- !x x0 y y0. x sums x0 /\ y sums y0 ==> (\n. (x n) - (y n)) sums (x0 - y0) Run time: 0.0s Theorem ABS_ZERO autoloading from theory `REAL` ... ABS_ZERO = |- !x. (abs x = & 0) = (x = & 0) Run time: 0.0s Theorem ABS_CIRCLE autoloading from theory `REAL` ... ABS_CIRCLE = |- !x y h. (abs h) < ((abs y) - (abs x)) ==> (abs(x + h)) < (abs y) Run time: 0.0s Theorem REAL_SUB_LT autoloading from theory `REAL` ... REAL_SUB_LT = |- !x y. (& 0) < (x - y) = y < x Run time: 0.0s Theorem LIM_TRANSFORM autoloading from theory `LIM` ... LIM_TRANSFORM = |- !f g x0 l. ((\x. (f x) - (g x)) tends_real_real (& 0))x0 /\ (g tends_real_real l)x0 ==> (f tends_real_real l)x0 Run time: 0.0s Definition diffl autoloading from theory `LIM` ... diffl = |- !f l x. (f diffl l)x = ((\h. ((f(x + h)) - (f x)) / h) tends_real_real l)(& 0) Run time: 0.0s Intermediate theorems generated: 1 TERMDIFF = |- !c K. summable(\n. (c n) * (K pow n)) /\ summable(\n. (diffs c n) * (K pow n)) /\ summable(\n. (diffs(diffs c)n) * (K pow n)) /\ (abs x) < (abs K) ==> ((\x. suminf(\n. (c n) * (x pow n))) diffl (suminf(\n. (diffs c n) * (x pow n)))) x Run time: 0.1s Intermediate theorems generated: 2494 () : void Run time: 0.0s Intermediate theorems generated: 1 File powser.ml loaded () : void Run time: 0.4s Intermediate theorems generated: 8507 #\ echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `transc.ml`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Loading library reduce ... Extending help search path. Loading boolean conversions........ Loading arithmetic conversions.................. Loading general conversions, rule and tactic..... Library reduce loaded. () : void false : bool Run time: 0.0s LAND_CONV = - : (conv -> conv) Run time: 0.0s TAUT_CONV = - : conv Run time: 0.0s AC = - : ((thm # thm) -> conv) Run time: 0.0s GEN_PAIR_TAC = - : tactic Run time: 0.0s MK_COMB_TAC = - : tactic Run time: 0.0s BINOP_TAC = - : tactic Run time: 0.0s SYM_CANON_CONV = - : (thm -> ((term # term) -> bool) -> conv) Run time: 0.0s IMP_SUBST_TAC = - : thm_tactic Run time: 0.0s ABBREV_TAC = - : (term -> tactic) Run time: 0.0s EXT_CONV = - : conv Run time: 0.0s ABS_TAC = - : tactic Run time: 0.0s EQUAL_TAC = - : tactic Run time: 0.0s X_BETA_CONV = - : (term -> conv) Run time: 0.0s EXACT_CONV = - : (thm list -> conv) Run time: 0.0s HABS_CONV = - : conv Run time: 0.0s autoload_definitions = - : (string -> void) Run time: 0.0s autoload_theorems = - : (string -> void) Run time: 0.0s EXPAND_TAC = - : (string -> tactic) Run time: 0.0s File useful loaded () : void Run time: 0.0s false : bool Run time: 0.0s () : void Run time: 0.0s Intermediate theorems generated: 1 Theory POWSER loaded () : void Run time: 0.0s Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) Run time: 0.0s Theorem DIV_MULT autoloading from theory `arithmetic` ... DIV_MULT = |- !n r. r < n ==> (!q. ((q * n) + r) DIV n = q) Run time: 0.0s Theorem MULT_SYM autoloading from theory `arithmetic` ... MULT_SYM = |- !m n. m * n = n * m Run time: 0.0s Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by FUN%8887%168. Segmentation violation: c stack ok:signalling errorERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. Type :H for Help. 1 Return to top level. >> Error:UNBOUND-VARIABLE: NAME QUIT Fast links are on: do (si::use-fast-links nil) for debugging Signalled by FUN%8887%168. UNBOUND-VARIABLE: NAME QUIT Broken at FUN%8887%168. 1 (abort) Return to debug level 1. 2 Return to top level. >>> NIL >>> Error:ERROR: Caught fatal error [memory may be damaged]: can't reopen the console Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". ERROR: Caught fatal error [memory may be damaged]: can't reopen the console Broken at FUN%8887%168. 1 (abort) Return to debug level 2. 2 Return to debug level 1. 3 Return to top level. >>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 3. 2 Return to debug level 2. 3 Return to debug level 1. 4 Return to top level. >>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 4. 2 Return to debug level 3. 3 Return to debug level 2. 4 Return to debug level 1. 5 Return to top level. >>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 5. 2 Return to debug level 4. 3 Return to debug level 3. 4 Return to debug level 2. 5 Return to debug level 1. 6 Return to top level. >>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 6. 2 Return to debug level 5. 3 Return to debug level 4. 4 Return to debug level 3. 5 Return to debug level 2. 6 Return to debug level 1. 7 Return to top level. >>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 7. 2 Return to debug level 6. 3 Return to debug level 5. 4 Return to debug level 4. 5 Return to debug level 3. 6 Return to debug level 2. 7 Return to debug level 1. 8 Return to top level. >>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 8. 2 Return to debug level 7. 3 Return to debug level 6. 4 Return to debug level 5. 5 Return to debug level 4. 6 Return to debug level 3. 7 Return to debug level 2. 8 Return to debug level 1. 9 Return to top level. >>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 9. 2 Return to debug level 8. 3 Return to debug level 7. 4 Return to debug level 6. 5 Return to debug level 5. 6 Return to debug level 4. 7 Return to debug level 3. 8 Return to debug level 2. 9 Return to debug level 1. 10 Return to top level. >>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 10. 2 Return to debug level 9. 3 Return to debug level 8. 4 Return to debug level 7. 5 Return to debug level 6. 6 Return to debug level 5. 7 Return to debug level 4. 8 Return to debug level 3. 9 Return to debug level 2. 10 Return to debug level 1. 11 Return to top level. >>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 11. 2 Return to debug level 10. 3 Return to debug level 9. 4 Return to debug level 8. 5 Return to debug level 7. 6 Return to debug level 6. 7 Return to debug level 5. 8 Return to debug level 4. 9 Return to debug level 3. 10 Return to debug level 2. 11 Return to debug level 1. 12 Return to top level. >>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 12. 2 Return to debug level 11. 3 Return to debug level 10. 4 Return to debug level 9. 5 Return to debug level 8. 6 Return to debug level 7. 7 Return to debug level 6. 8 Return to debug level 5. 9 Return to debug level 4. 10 Return to debug level 3. 11 Return to debug level 2. 12 Return to debug level 1. 13 Return to top level. >>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 13. 2 Return to debug level 12. 3 Return to debug level 11. 4 Return to debug level 10. 5 Return to debug level 9. 6 Return to debug level 8. 7 Return to debug level 7. 8 Return to debug level 6. 9 Return to debug level 5. 10 Return to debug level 4. 11 Return to debug level 3. 12 Return to debug level 2. 13 Return to debug level 1. 14 Return to top level. >>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 14. 2 Return to debug level 13. 3 Return to debug level 12. 4 Return to debug level 11. 5 Return to debug level 10. 6 Return to debug level 9. 7 Return to debug level 8. 8 Return to debug level 7. 9 Return to debug level 6. 10 Return to debug level 5. 11 Return to debug level 4. 12 Return to debug level 3. 13 Return to debug level 2. 14 Return to debug level 1. 15 Return to top level. >>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 15. 2 Return to debug level 14. 3 Return to debug level 13. 4 Return to debug level 12. 5 Return to debug level 11. 6 Return to debug level 10. 7 Return to debug level 9. 8 Return to debug level 8. 9 Return to debug level 7. 10 Return to debug level 6. 11 Return to debug level 5. 12 Return to debug level 4. 13 Return to debug level 3. 14 Return to debug level 2. 15 Return to debug level 1. 16 Return to top level. >>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 16. 2 Return to debug level 15. 3 Return to debug level 14. 4 Return to debug level 13. 5 Return to debug level 12. 6 Return to debug level 11. 7 Return to debug level 10. 8 Return to debug level 9. 9 Return to debug level 8. 10 Return to debug level 7. 11 Return to debug level 6. 12 Return to debug level 5. 13 Return to debug level 4. 14 Return to debug level 3. 15 Return to debug level 2. 16 Return to debug level 1. 17 Return to top level. >>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 17. 2 Return to debug level 16. 3 Return to debug level 15. 4 Return to debug level 14. 5 Return to debug level 13. 6 Return to debug level 12. 7 Return to debug level 11. 8 Return to debug level 10. 9 Return to debug level 9. 10 Return to debug level 8. 11 Return to debug level 7. 12 Return to debug level 6. 13 Return to debug level 5. 14 Return to debug level 4. 15 Return to debug level 3. 16 Return to debug level 2. 17 Return to debug level 1. 18 Return to top level. >>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 18. 2 Return to debug level 17. 3 Return to debug level 16. 4 Return to debug level 15. 5 Return to debug level 14. 6 Return to debug level 13. 7 Return to debug level 12. 8 Return to debug level 11. 9 Return to debug level 10. 10 Return to debug level 9. 11 Return to debug level 8. 12 Return to debug level 7. 13 Return to debug level 6. 14 Return to debug level 5. 15 Return to debug level 4. 16 Return to debug level 3. 17 Return to debug level 2. 18 Return to debug level 1. 19 Return to top level. >>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 19. 2 Return to debug level 18. 3 Return to debug level 17. 4 Return to debug level 16. 5 Return to debug level 15. 6 Return to debug level 14. 7 Return to debug level 13. 8 Return to debug level 12. 9 Return to debug level 11. 10 Return to debug level 10. 11 Return to debug level 9. 12 Return to debug level 8. 13 Return to debug level 7. 14 Return to debug level 6. 15 Return to debug level 5. 16 Return to debug level 4. 17 Return to debug level 3. 18 Return to debug level 2. 19 Return to debug level 1. 20 Return to top level. >>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 20. 2 Return to debug level 19. 3 Return to debug level 18. 4 Return to debug level 17. 5 Return to debug level 16. 6 Return to debug level 15. 7 Return to debug level 14. 8 Return to debug level 13. 9 Return to debug level 12. 10 Return to debug level 11. 11 Return to debug level 10. 12 Return to debug level 9. 13 Return to debug level 8. 14 Return to debug level 7. 15 Return to debug level 6. 16 Return to debug level 5. 17 Return to debug level 4. 18 Return to debug level 3. 19 Return to debug level 2. 20 Return to debug level 1. 21 Return to top level. >>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 21. 2 Return to debug level 20. 3 Return to debug level 19. 4 Return to debug level 18. 5 Return to debug level 17. 6 Return to debug level 16. 7 Return to debug level 15. 8 Return to debug level 14. 9 Return to debug level 13. 10 Return to debug level 12. 11 Return to debug level 11. 12 Return to debug level 10. 13 Return to debug level 9. 14 Return to debug level 8. 15 Return to debug level 7. 16 Return to debug level 6. 17 Return to debug level 5. 18 Return to debug level 4. 19 Return to debug level 3. 20 Return to debug level 2. 21 Return to debug level 1. 22 Return to top level. >>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 22. 2 Return to debug level 21. 3 Return to debug level 20. 4 Return to debug level 19. 5 Return to debug level 18. 6 Return to debug level 17. 7 Return to debug level 16. 8 Return to debug level 15. 9 Return to debug level 14. 10 Return to debug level 13. 11 Return to debug level 12. 12 Return to debug level 11. 13 Return to debug level 10. 14 Return to debug level 9. 15 Return to debug level 8. 16 Return to debug level 7. 17 Return to debug level 6. 18 Return to debug level 5. 19 Return to debug level 4. 20 Return to debug level 3. 21 Return to debug level 2. 22 Return to debug level 1. 23 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 23. 2 Return to debug level 22. 3 Return to debug level 21. 4 Return to debug level 20. 5 Return to debug level 19. 6 Return to debug level 18. 7 Return to debug level 17. 8 Return to debug level 16. 9 Return to debug level 15. 10 Return to debug level 14. 11 Return to debug level 13. 12 Return to debug level 12. 13 Return to debug level 11. 14 Return to debug level 10. 15 Return to debug level 9. 16 Return to debug level 8. 17 Return to debug level 7. 18 Return to debug level 6. 19 Return to debug level 5. 20 Return to debug level 4. 21 Return to debug level 3. 22 Return to debug level 2. 23 Return to debug level 1. 24 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 24. 2 Return to debug level 23. 3 Return to debug level 22. 4 Return to debug level 21. 5 Return to debug level 20. 6 Return to debug level 19. 7 Return to debug level 18. 8 Return to debug level 17. 9 Return to debug level 16. 10 Return to debug level 15. 11 Return to debug level 14. 12 Return to debug level 13. 13 Return to debug level 12. 14 Return to debug level 11. 15 Return to debug level 10. 16 Return to debug level 9. 17 Return to debug level 8. 18 Return to debug level 7. 19 Return to debug level 6. 20 Return to debug level 5. 21 Return to debug level 4. 22 Return to debug level 3. 23 Return to debug level 2. 24 Return to debug level 1. 25 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 25. 2 Return to debug level 24. 3 Return to debug level 23. 4 Return to debug level 22. 5 Return to debug level 21. 6 Return to debug level 20. 7 Return to debug level 19. 8 Return to debug level 18. 9 Return to debug level 17. 10 Return to debug level 16. 11 Return to debug level 15. 12 Return to debug level 14. 13 Return to debug level 13. 14 Return to debug level 12. 15 Return to debug level 11. 16 Return to debug level 10. 17 Return to debug level 9. 18 Return to debug level 8. 19 Return to debug level 7. 20 Return to debug level 6. 21 Return to debug level 5. 22 Return to debug level 4. 23 Return to debug level 3. 24 Return to debug level 2. 25 Return to debug level 1. 26 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 26. 2 Return to debug level 25. 3 Return to debug level 24. 4 Return to debug level 23. 5 Return to debug level 22. 6 Return to debug level 21. 7 Return to debug level 20. 8 Return to debug level 19. 9 Return to debug level 18. 10 Return to debug level 17. 11 Return to debug level 16. 12 Return to debug level 15. 13 Return to debug level 14. 14 Return to debug level 13. 15 Return to debug level 12. 16 Return to debug level 11. 17 Return to debug level 10. 18 Return to debug level 9. 19 Return to debug level 8. 20 Return to debug level 7. 21 Return to debug level 6. 22 Return to debug level 5. 23 Return to debug level 4. 24 Return to debug level 3. 25 Return to debug level 2. 26 Return to debug level 1. 27 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 27. 2 Return to debug level 26. 3 Return to debug level 25. 4 Return to debug level 24. 5 Return to debug level 23. 6 Return to debug level 22. 7 Return to debug level 21. 8 Return to debug level 20. 9 Return to debug level 19. 10 Return to debug level 18. 11 Return to debug level 17. 12 Return to debug level 16. 13 Return to debug level 15. 14 Return to debug level 14. 15 Return to debug level 13. 16 Return to debug level 12. 17 Return to debug level 11. 18 Return to debug level 10. 19 Return to debug level 9. 20 Return to debug level 8. 21 Return to debug level 7. 22 Return to debug level 6. 23 Return to debug level 5. 24 Return to debug level 4. 25 Return to debug level 3. 26 Return to debug level 2. 27 Return to debug level 1. 28 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 28. 2 Return to debug level 27. 3 Return to debug level 26. 4 Return to debug level 25. 5 Return to debug level 24. 6 Return to debug level 23. 7 Return to debug level 22. 8 Return to debug level 21. 9 Return to debug level 20. 10 Return to debug level 19. 11 Return to debug level 18. 12 Return to debug level 17. 13 Return to debug level 16. 14 Return to debug level 15. 15 Return to debug level 14. 16 Return to debug level 13. 17 Return to debug level 12. 18 Return to debug level 11. 19 Return to debug level 10. 20 Return to debug level 9. 21 Return to debug level 8. 22 Return to debug level 7. 23 Return to debug level 6. 24 Return to debug level 5. 25 Return to debug level 4. 26 Return to debug level 3. 27 Return to debug level 2. 28 Return to debug level 1. 29 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 29. 2 Return to debug level 28. 3 Return to debug level 27. 4 Return to debug level 26. 5 Return to debug level 25. 6 Return to debug level 24. 7 Return to debug level 23. 8 Return to debug level 22. 9 Return to debug level 21. 10 Return to debug level 20. 11 Return to debug level 19. 12 Return to debug level 18. 13 Return to debug level 17. 14 Return to debug level 16. 15 Return to debug level 15. 16 Return to debug level 14. 17 Return to debug level 13. 18 Return to debug level 12. 19 Return to debug level 11. 20 Return to debug level 10. 21 Return to debug level 9. 22 Return to debug level 8. 23 Return to debug level 7. 24 Return to debug level 6. 25 Return to debug level 5. 26 Return to debug level 4. 27 Return to debug level 3. 28 Return to debug level 2. 29 Return to debug level 1. 30 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 30. 2 Return to debug level 29. 3 Return to debug level 28. 4 Return to debug level 27. 5 Return to debug level 26. 6 Return to debug level 25. 7 Return to debug level 24. 8 Return to debug level 23. 9 Return to debug level 22. 10 Return to debug level 21. 11 Return to debug level 20. 12 Return to debug level 19. 13 Return to debug level 18. 14 Return to debug level 17. 15 Return to debug level 16. 16 Return to debug level 15. 17 Return to debug level 14. 18 Return to debug level 13. 19 Return to debug level 12. 20 Return to debug level 11. 21 Return to debug level 10. 22 Return to debug level 9. 23 Return to debug level 8. 24 Return to debug level 7. 25 Return to debug level 6. 26 Return to debug level 5. 27 Return to debug level 4. 28 Return to debug level 3. 29 Return to debug level 2. 30 Return to debug level 1. 31 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 31. 2 Return to debug level 30. 3 Return to debug level 29. 4 Return to debug level 28. 5 Return to debug level 27. 6 Return to debug level 26. 7 Return to debug level 25. 8 Return to debug level 24. 9 Return to debug level 23. 10 Return to debug level 22. 11 Return to debug level 21. 12 Return to debug level 20. 13 Return to debug level 19. 14 Return to debug level 18. 15 Return to debug level 17. 16 Return to debug level 16. 17 Return to debug level 15. 18 Return to debug level 14. 19 Return to debug level 13. 20 Return to debug level 12. 21 Return to debug level 11. 22 Return to debug level 10. 23 Return to debug level 9. 24 Return to debug level 8. 25 Return to debug level 7. 26 Return to debug level 6. 27 Return to debug level 5. 28 Return to debug level 4. 29 Return to debug level 3. 30 Return to debug level 2. 31 Return to debug level 1. 32 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 32. 2 Return to debug level 31. 3 Return to debug level 30. 4 Return to debug level 29. 5 Return to debug level 28. 6 Return to debug level 27. 7 Return to debug level 26. 8 Return to debug level 25. 9 Return to debug level 24. 10 Return to debug level 23. 11 Return to debug level 22. 12 Return to debug level 21. 13 Return to debug level 20. 14 Return to debug level 19. 15 Return to debug level 18. 16 Return to debug level 17. 17 Return to debug level 16. 18 Return to debug level 15. 19 Return to debug level 14. 20 Return to debug level 13. 21 Return to debug level 12. 22 Return to debug level 11. 23 Return to debug level 10. 24 Return to debug level 9. 25 Return to debug level 8. 26 Return to debug level 7. 27 Return to debug level 6. 28 Return to debug level 5. 29 Return to debug level 4. 30 Return to debug level 3. 31 Return to debug level 2. 32 Return to debug level 1. 33 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 33. 2 Return to debug level 32. 3 Return to debug level 31. 4 Return to debug level 30. 5 Return to debug level 29. 6 Return to debug level 28. 7 Return to debug level 27. 8 Return to debug level 26. 9 Return to debug level 25. 10 Return to debug level 24. 11 Return to debug level 23. 12 Return to debug level 22. 13 Return to debug level 21. 14 Return to debug level 20. 15 Return to debug level 19. 16 Return to debug level 18. 17 Return to debug level 17. 18 Return to debug level 16. 19 Return to debug level 15. 20 Return to debug level 14. 21 Return to debug level 13. 22 Return to debug level 12. 23 Return to debug level 11. 24 Return to debug level 10. 25 Return to debug level 9. 26 Return to debug level 8. 27 Return to debug level 7. 28 Return to debug level 6. 29 Return to debug level 5. 30 Return to debug level 4. 31 Return to debug level 3. 32 Return to debug level 2. 33 Return to debug level 1. 34 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 34. 2 Return to debug level 33. 3 Return to debug level 32. 4 Return to debug level 31. 5 Return to debug level 30. 6 Return to debug level 29. 7 Return to debug level 28. 8 Return to debug level 27. 9 Return to debug level 26. 10 Return to debug level 25. 11 Return to debug level 24. 12 Return to debug level 23. 13 Return to debug level 22. 14 Return to debug level 21. 15 Return to debug level 20. 16 Return to debug level 19. 17 Return to debug level 18. 18 Return to debug level 17. 19 Return to debug level 16. 20 Return to debug level 15. 21 Return to debug level 14. 22 Return to debug level 13. 23 Return to debug level 12. 24 Return to debug level 11. 25 Return to debug level 10. 26 Return to debug level 9. 27 Return to debug level 8. 28 Return to debug level 7. 29 Return to debug level 6. 30 Return to debug level 5. 31 Return to debug level 4. 32 Return to debug level 3. 33 Return to debug level 2. 34 Return to debug level 1. 35 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 35. 2 Return to debug level 34. 3 Return to debug level 33. 4 Return to debug level 32. 5 Return to debug level 31. 6 Return to debug level 30. 7 Return to debug level 29. 8 Return to debug level 28. 9 Return to debug level 27. 10 Return to debug level 26. 11 Return to debug level 25. 12 Return to debug level 24. 13 Return to debug level 23. 14 Return to debug level 22. 15 Return to debug level 21. 16 Return to debug level 20. 17 Return to debug level 19. 18 Return to debug level 18. 19 Return to debug level 17. 20 Return to debug level 16. 21 Return to debug level 15. 22 Return to debug level 14. 23 Return to debug level 13. 24 Return to debug level 12. 25 Return to debug level 11. 26 Return to debug level 10. 27 Return to debug level 9. 28 Return to debug level 8. 29 Return to debug level 7. 30 Return to debug level 6. 31 Return to debug level 5. 32 Return to debug level 4. 33 Return to debug level 3. 34 Return to debug level 2. 35 Return to debug level 1. 36 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 36. 2 Return to debug level 35. 3 Return to debug level 34. 4 Return to debug level 33. 5 Return to debug level 32. 6 Return to debug level 31. 7 Return to debug level 30. 8 Return to debug level 29. 9 Return to debug level 28. 10 Return to debug level 27. 11 Return to debug level 26. 12 Return to debug level 25. 13 Return to debug level 24. 14 Return to debug level 23. 15 Return to debug level 22. 16 Return to debug level 21. 17 Return to debug level 20. 18 Return to debug level 19. 19 Return to debug level 18. 20 Return to debug level 17. 21 Return to debug level 16. 22 Return to debug level 15. 23 Return to debug level 14. 24 Return to debug level 13. 25 Return to debug level 12. 26 Return to debug level 11. 27 Return to debug level 10. 28 Return to debug level 9. 29 Return to debug level 8. 30 Return to debug level 7. 31 Return to debug level 6. 32 Return to debug level 5. 33 Return to debug level 4. 34 Return to debug level 3. 35 Return to debug level 2. 36 Return to debug level 1. 37 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 37. 2 Return to debug level 36. 3 Return to debug level 35. 4 Return to debug level 34. 5 Return to debug level 33. 6 Return to debug level 32. 7 Return to debug level 31. 8 Return to debug level 30. 9 Return to debug level 29. 10 Return to debug level 28. 11 Return to debug level 27. 12 Return to debug level 26. 13 Return to debug level 25. 14 Return to debug level 24. 15 Return to debug level 23. 16 Return to debug level 22. 17 Return to debug level 21. 18 Return to debug level 20. 19 Return to debug level 19. 20 Return to debug level 18. 21 Return to debug level 17. 22 Return to debug level 16. 23 Return to debug level 15. 24 Return to debug level 14. 25 Return to debug level 13. 26 Return to debug level 12. 27 Return to debug level 11. 28 Return to debug level 10. 29 Return to debug level 9. 30 Return to debug level 8. 31 Return to debug level 7. 32 Return to debug level 6. 33 Return to debug level 5. 34 Return to debug level 4. 35 Return to debug level 3. 36 Return to debug level 2. 37 Return to debug level 1. 38 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 38. 2 Return to debug level 37. 3 Return to debug level 36. 4 Return to debug level 35. 5 Return to debug level 34. 6 Return to debug level 33. 7 Return to debug level 32. 8 Return to debug level 31. 9 Return to debug level 30. 10 Return to debug level 29. 11 Return to debug level 28. 12 Return to debug level 27. 13 Return to debug level 26. 14 Return to debug level 25. 15 Return to debug level 24. 16 Return to debug level 23. 17 Return to debug level 22. 18 Return to debug level 21. 19 Return to debug level 20. 20 Return to debug level 19. 21 Return to debug level 18. 22 Return to debug level 17. 23 Return to debug level 16. 24 Return to debug level 15. 25 Return to debug level 14. 26 Return to debug level 13. 27 Return to debug level 12. 28 Return to debug level 11. 29 Return to debug level 10. 30 Return to debug level 9. 31 Return to debug level 8. 32 Return to debug level 7. 33 Return to debug level 6. 34 Return to debug level 5. 35 Return to debug level 4. 36 Return to debug level 3. 37 Return to debug level 2. 38 Return to debug level 1. 39 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 39. 2 Return to debug level 38. 3 Return to debug level 37. 4 Return to debug level 36. 5 Return to debug level 35. 6 Return to debug level 34. 7 Return to debug level 33. 8 Return to debug level 32. 9 Return to debug level 31. 10 Return to debug level 30. 11 Return to debug level 29. 12 Return to debug level 28. 13 Return to debug level 27. 14 Return to debug level 26. 15 Return to debug level 25. 16 Return to debug level 24. 17 Return to debug level 23. 18 Return to debug level 22. 19 Return to debug level 21. 20 Return to debug level 20. 21 Return to debug level 19. 22 Return to debug level 18. 23 Return to debug level 17. 24 Return to debug level 16. 25 Return to debug level 15. 26 Return to debug level 14. 27 Return to debug level 13. 28 Return to debug level 12. 29 Return to debug level 11. 30 Return to debug level 10. 31 Return to debug level 9. 32 Return to debug level 8. 33 Return to debug level 7. 34 Return to debug level 6. 35 Return to debug level 5. 36 Return to debug level 4. 37 Return to debug level 3. 38 Return to debug level 2. 39 Return to debug level 1. 40 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 40. 2 Return to debug level 39. 3 Return to debug level 38. 4 Return to debug level 37. 5 Return to debug level 36. 6 Return to debug level 35. 7 Return to debug level 34. 8 Return to debug level 33. 9 Return to debug level 32. 10 Return to debug level 31. 11 Return to debug level 30. 12 Return to debug level 29. 13 Return to debug level 28. 14 Return to debug level 27. 15 Return to debug level 26. 16 Return to debug level 25. 17 Return to debug level 24. 18 Return to debug level 23. 19 Return to debug level 22. 20 Return to debug level 21. 21 Return to debug level 20. 22 Return to debug level 19. 23 Return to debug level 18. 24 Return to debug level 17. 25 Return to debug level 16. 26 Return to debug level 15. 27 Return to debug level 14. 28 Return to debug level 13. 29 Return to debug level 12. 30 Return to debug level 11. 31 Return to debug level 10. 32 Return to debug level 9. 33 Return to debug level 8. 34 Return to debug level 7. 35 Return to debug level 6. 36 Return to debug level 5. 37 Return to debug level 4. 38 Return to debug level 3. 39 Return to debug level 2. 40 Return to debug level 1. 41 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 41. 2 Return to debug level 40. 3 Return to debug level 39. 4 Return to debug level 38. 5 Return to debug level 37. 6 Return to debug level 36. 7 Return to debug level 35. 8 Return to debug level 34. 9 Return to debug level 33. 10 Return to debug level 32. 11 Return to debug level 31. 12 Return to debug level 30. 13 Return to debug level 29. 14 Return to debug level 28. 15 Return to debug level 27. 16 Return to debug level 26. 17 Return to debug level 25. 18 Return to debug level 24. 19 Return to debug level 23. 20 Return to debug level 22. 21 Return to debug level 21. 22 Return to debug level 20. 23 Return to debug level 19. 24 Return to debug level 18. 25 Return to debug level 17. 26 Return to debug level 16. 27 Return to debug level 15. 28 Return to debug level 14. 29 Return to debug level 13. 30 Return to debug level 12. 31 Return to debug level 11. 32 Return to debug level 10. 33 Return to debug level 9. 34 Return to debug level 8. 35 Return to debug level 7. 36 Return to debug level 6. 37 Return to debug level 5. 38 Return to debug level 4. 39 Return to debug level 3. 40 Return to debug level 2. 41 Return to debug level 1. 42 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 42. 2 Return to debug level 41. 3 Return to debug level 40. 4 Return to debug level 39. 5 Return to debug level 38. 6 Return to debug level 37. 7 Return to debug level 36. 8 Return to debug level 35. 9 Return to debug level 34. 10 Return to debug level 33. 11 Return to debug level 32. 12 Return to debug level 31. 13 Return to debug level 30. 14 Return to debug level 29. 15 Return to debug level 28. 16 Return to debug level 27. 17 Return to debug level 26. 18 Return to debug level 25. 19 Return to debug level 24. 20 Return to debug level 23. 21 Return to debug level 22. 22 Return to debug level 21. 23 Return to debug level 20. 24 Return to debug level 19. 25 Return to debug level 18. 26 Return to debug level 17. 27 Return to debug level 16. 28 Return to debug level 15. 29 Return to debug level 14. 30 Return to debug level 13. 31 Return to debug level 12. 32 Return to debug level 11. 33 Return to debug level 10. 34 Return to debug level 9. 35 Return to debug level 8. 36 Return to debug level 7. 37 Return to debug level 6. 38 Return to debug level 5. 39 Return to debug level 4. 40 Return to debug level 3. 41 Return to debug level 2. 42 Return to debug level 1. 43 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 43. 2 Return to debug level 42. 3 Return to debug level 41. 4 Return to debug level 40. 5 Return to debug level 39. 6 Return to debug level 38. 7 Return to debug level 37. 8 Return to debug level 36. 9 Return to debug level 35. 10 Return to debug level 34. 11 Return to debug level 33. 12 Return to debug level 32. 13 Return to debug level 31. 14 Return to debug level 30. 15 Return to debug level 29. 16 Return to debug level 28. 17 Return to debug level 27. 18 Return to debug level 26. 19 Return to debug level 25. 20 Return to debug level 24. 21 Return to debug level 23. 22 Return to debug level 22. 23 Return to debug level 21. 24 Return to debug level 20. 25 Return to debug level 19. 26 Return to debug level 18. 27 Return to debug level 17. 28 Return to debug level 16. 29 Return to debug level 15. 30 Return to debug level 14. 31 Return to debug level 13. 32 Return to debug level 12. 33 Return to debug level 11. 34 Return to debug level 10. 35 Return to debug level 9. 36 Return to debug level 8. 37 Return to debug level 7. 38 Return to debug level 6. 39 Return to debug level 5. 40 Return to debug level 4. 41 Return to debug level 3. 42 Return to debug level 2. 43 Return to debug level 1. 44 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 44. 2 Return to debug level 43. 3 Return to debug level 42. 4 Return to debug level 41. 5 Return to debug level 40. 6 Return to debug level 39. 7 Return to debug level 38. 8 Return to debug level 37. 9 Return to debug level 36. 10 Return to debug level 35. 11 Return to debug level 34. 12 Return to debug level 33. 13 Return to debug level 32. 14 Return to debug level 31. 15 Return to debug level 30. 16 Return to debug level 29. 17 Return to debug level 28. 18 Return to debug level 27. 19 Return to debug level 26. 20 Return to debug level 25. 21 Return to debug level 24. 22 Return to debug level 23. 23 Return to debug level 22. 24 Return to debug level 21. 25 Return to debug level 20. 26 Return to debug level 19. 27 Return to debug level 18. 28 Return to debug level 17. 29 Return to debug level 16. 30 Return to debug level 15. 31 Return to debug level 14. 32 Return to debug level 13. 33 Return to debug level 12. 34 Return to debug level 11. 35 Return to debug level 10. 36 Return to debug level 9. 37 Return to debug level 8. 38 Return to debug level 7. 39 Return to debug level 6. 40 Return to debug level 5. 41 Return to debug level 4. 42 Return to debug level 3. 43 Return to debug level 2. 44 Return to debug level 1. 45 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 45. 2 Return to debug level 44. 3 Return to debug level 43. 4 Return to debug level 42. 5 Return to debug level 41. 6 Return to debug level 40. 7 Return to debug level 39. 8 Return to debug level 38. 9 Return to debug level 37. 10 Return to debug level 36. 11 Return to debug level 35. 12 Return to debug level 34. 13 Return to debug level 33. 14 Return to debug level 32. 15 Return to debug level 31. 16 Return to debug level 30. 17 Return to debug level 29. 18 Return to debug level 28. 19 Return to debug level 27. 20 Return to debug level 26. 21 Return to debug level 25. 22 Return to debug level 24. 23 Return to debug level 23. 24 Return to debug level 22. 25 Return to debug level 21. 26 Return to debug level 20. 27 Return to debug level 19. 28 Return to debug level 18. 29 Return to debug level 17. 30 Return to debug level 16. 31 Return to debug level 15. 32 Return to debug level 14. 33 Return to debug level 13. 34 Return to debug level 12. 35 Return to debug level 11. 36 Return to debug level 10. 37 Return to debug level 9. 38 Return to debug level 8. 39 Return to debug level 7. 40 Return to debug level 6. 41 Return to debug level 5. 42 Return to debug level 4. 43 Return to debug level 3. 44 Return to debug level 2. 45 Return to debug level 1. 46 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 46. 2 Return to debug level 45. 3 Return to debug level 44. 4 Return to debug level 43. 5 Return to debug level 42. 6 Return to debug level 41. 7 Return to debug level 40. 8 Return to debug level 39. 9 Return to debug level 38. 10 Return to debug level 37. 11 Return to debug level 36. 12 Return to debug level 35. 13 Return to debug level 34. 14 Return to debug level 33. 15 Return to debug level 32. 16 Return to debug level 31. 17 Return to debug level 30. 18 Return to debug level 29. 19 Return to debug level 28. 20 Return to debug level 27. 21 Return to debug level 26. 22 Return to debug level 25. 23 Return to debug level 24. 24 Return to debug level 23. 25 Return to debug level 22. 26 Return to debug level 21. 27 Return to debug level 20. 28 Return to debug level 19. 29 Return to debug level 18. 30 Return to debug level 17. 31 Return to debug level 16. 32 Return to debug level 15. 33 Return to debug level 14. 34 Return to debug level 13. 35 Return to debug level 12. 36 Return to debug level 11. 37 Return to debug level 10. 38 Return to debug level 9. 39 Return to debug level 8. 40 Return to debug level 7. 41 Return to debug level 6. 42 Return to debug level 5. 43 Return to debug level 4. 44 Return to debug level 3. 45 Return to debug level 2. 46 Return to debug level 1. 47 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 47. 2 Return to debug level 46. 3 Return to debug level 45. 4 Return to debug level 44. 5 Return to debug level 43. 6 Return to debug level 42. 7 Return to debug level 41. 8 Return to debug level 40. 9 Return to debug level 39. 10 Return to debug level 38. 11 Return to debug level 37. 12 Return to debug level 36. 13 Return to debug level 35. 14 Return to debug level 34. 15 Return to debug level 33. 16 Return to debug level 32. 17 Return to debug level 31. 18 Return to debug level 30. 19 Return to debug level 29. 20 Return to debug level 28. 21 Return to debug level 27. 22 Return to debug level 26. 23 Return to debug level 25. 24 Return to debug level 24. 25 Return to debug level 23. 26 Return to debug level 22. 27 Return to debug level 21. 28 Return to debug level 20. 29 Return to debug level 19. 30 Return to debug level 18. 31 Return to debug level 17. 32 Return to debug level 16. 33 Return to debug level 15. 34 Return to debug level 14. 35 Return to debug level 13. 36 Return to debug level 12. 37 Return to debug level 11. 38 Return to debug level 10. 39 Return to debug level 9. 40 Return to debug level 8. 41 Return to debug level 7. 42 Return to debug level 6. 43 Return to debug level 5. 44 Return to debug level 4. 45 Return to debug level 3. 46 Return to debug level 2. 47 Return to debug level 1. 48 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 48. 2 Return to debug level 47. 3 Return to debug level 46. 4 Return to debug level 45. 5 Return to debug level 44. 6 Return to debug level 43. 7 Return to debug level 42. 8 Return to debug level 41. 9 Return to debug level 40. 10 Return to debug level 39. 11 Return to debug level 38. 12 Return to debug level 37. 13 Return to debug level 36. 14 Return to debug level 35. 15 Return to debug level 34. 16 Return to debug level 33. 17 Return to debug level 32. 18 Return to debug level 31. 19 Return to debug level 30. 20 Return to debug level 29. 21 Return to debug level 28. 22 Return to debug level 27. 23 Return to debug level 26. 24 Return to debug level 25. 25 Return to debug level 24. 26 Return to debug level 23. 27 Return to debug level 22. 28 Return to debug level 21. 29 Return to debug level 20. 30 Return to debug level 19. 31 Return to debug level 18. 32 Return to debug level 17. 33 Return to debug level 16. 34 Return to debug level 15. 35 Return to debug level 14. 36 Return to debug level 13. 37 Return to debug level 12. 38 Return to debug level 11. 39 Return to debug level 10. 40 Return to debug level 9. 41 Return to debug level 8. 42 Return to debug level 7. 43 Return to debug level 6. 44 Return to debug level 5. 45 Return to debug level 4. 46 Return to debug level 3. 47 Return to debug level 2. 48 Return to debug level 1. 49 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 49. 2 Return to debug level 48. 3 Return to debug level 47. 4 Return to debug level 46. 5 Return to debug level 45. 6 Return to debug level 44. 7 Return to debug level 43. 8 Return to debug level 42. 9 Return to debug level 41. 10 Return to debug level 40. 11 Return to debug level 39. 12 Return to debug level 38. 13 Return to debug level 37. 14 Return to debug level 36. 15 Return to debug level 35. 16 Return to debug level 34. 17 Return to debug level 33. 18 Return to debug level 32. 19 Return to debug level 31. 20 Return to debug level 30. 21 Return to debug level 29. 22 Return to debug level 28. 23 Return to debug level 27. 24 Return to debug level 26. 25 Return to debug level 25. 26 Return to debug level 24. 27 Return to debug level 23. 28 Return to debug level 22. 29 Return to debug level 21. 30 Return to debug level 20. 31 Return to debug level 19. 32 Return to debug level 18. 33 Return to debug level 17. 34 Return to debug level 16. 35 Return to debug level 15. 36 Return to debug level 14. 37 Return to debug level 13. 38 Return to debug level 12. 39 Return to debug level 11. 40 Return to debug level 10. 41 Return to debug level 9. 42 Return to debug level 8. 43 Return to debug level 7. 44 Return to debug level 6. 45 Return to debug level 5. 46 Return to debug level 4. 47 Return to debug level 3. 48 Return to debug level 2. 49 Return to debug level 1. 50 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 50. 2 Return to debug level 49. 3 Return to debug level 48. 4 Return to debug level 47. 5 Return to debug level 46. 6 Return to debug level 45. 7 Return to debug level 44. 8 Return to debug level 43. 9 Return to debug level 42. 10 Return to debug level 41. 11 Return to debug level 40. 12 Return to debug level 39. 13 Return to debug level 38. 14 Return to debug level 37. 15 Return to debug level 36. 16 Return to debug level 35. 17 Return to debug level 34. 18 Return to debug level 33. 19 Return to debug level 32. 20 Return to debug level 31. 21 Return to debug level 30. 22 Return to debug level 29. 23 Return to debug level 28. 24 Return to debug level 27. 25 Return to debug level 26. 26 Return to debug level 25. 27 Return to debug level 24. 28 Return to debug level 23. 29 Return to debug level 22. 30 Return to debug level 21. 31 Return to debug level 20. 32 Return to debug level 19. 33 Return to debug level 18. 34 Return to debug level 17. 35 Return to debug level 16. 36 Return to debug level 15. 37 Return to debug level 14. 38 Return to debug level 13. 39 Return to debug level 12. 40 Return to debug level 11. 41 Return to debug level 10. 42 Return to debug level 9. 43 Return to debug level 8. 44 Return to debug level 7. 45 Return to debug level 6. 46 Return to debug level 5. 47 Return to debug level 4. 48 Return to debug level 3. 49 Return to debug level 2. 50 Return to debug level 1. 51 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 51. 2 Return to debug level 50. 3 Return to debug level 49. 4 Return to debug level 48. 5 Return to debug level 47. 6 Return to debug level 46. 7 Return to debug level 45. 8 Return to debug level 44. 9 Return to debug level 43. 10 Return to debug level 42. 11 Return to debug level 41. 12 Return to debug level 40. 13 Return to debug level 39. 14 Return to debug level 38. 15 Return to debug level 37. 16 Return to debug level 36. 17 Return to debug level 35. 18 Return to debug level 34. 19 Return to debug level 33. 20 Return to debug level 32. 21 Return to debug level 31. 22 Return to debug level 30. 23 Return to debug level 29. 24 Return to debug level 28. 25 Return to debug level 27. 26 Return to debug level 26. 27 Return to debug level 25. 28 Return to debug level 24. 29 Return to debug level 23. 30 Return to debug level 22. 31 Return to debug level 21. 32 Return to debug level 20. 33 Return to debug level 19. 34 Return to debug level 18. 35 Return to debug level 17. 36 Return to debug level 16. 37 Return to debug level 15. 38 Return to debug level 14. 39 Return to debug level 13. 40 Return to debug level 12. 41 Return to debug level 11. 42 Return to debug level 10. 43 Return to debug level 9. 44 Return to debug level 8. 45 Return to debug level 7. 46 Return to debug level 6. 47 Return to debug level 5. 48 Return to debug level 4. 49 Return to debug level 3. 50 Return to debug level 2. 51 Return to debug level 1. 52 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 52. 2 Return to debug level 51. 3 Return to debug level 50. 4 Return to debug level 49. 5 Return to debug level 48. 6 Return to debug level 47. 7 Return to debug level 46. 8 Return to debug level 45. 9 Return to debug level 44. 10 Return to debug level 43. 11 Return to debug level 42. 12 Return to debug level 41. 13 Return to debug level 40. 14 Return to debug level 39. 15 Return to debug level 38. 16 Return to debug level 37. 17 Return to debug level 36. 18 Return to debug level 35. 19 Return to debug level 34. 20 Return to debug level 33. 21 Return to debug level 32. 22 Return to debug level 31. 23 Return to debug level 30. 24 Return to debug level 29. 25 Return to debug level 28. 26 Return to debug level 27. 27 Return to debug level 26. 28 Return to debug level 25. 29 Return to debug level 24. 30 Return to debug level 23. 31 Return to debug level 22. 32 Return to debug level 21. 33 Return to debug level 20. 34 Return to debug level 19. 35 Return to debug level 18. 36 Return to debug level 17. 37 Return to debug level 16. 38 Return to debug level 15. 39 Return to debug level 14. 40 Return to debug level 13. 41 Return to debug level 12. 42 Return to debug level 11. 43 Return to debug level 10. 44 Return to debug level 9. 45 Return to debug level 8. 46 Return to debug level 7. 47 Return to debug level 6. 48 Return to debug level 5. 49 Return to debug level 4. 50 Return to debug level 3. 51 Return to debug level 2. 52 Return to debug level 1. 53 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 53. 2 Return to debug level 52. 3 Return to debug level 51. 4 Return to debug level 50. 5 Return to debug level 49. 6 Return to debug level 48. 7 Return to debug level 47. 8 Return to debug level 46. 9 Return to debug level 45. 10 Return to debug level 44. 11 Return to debug level 43. 12 Return to debug level 42. 13 Return to debug level 41. 14 Return to debug level 40. 15 Return to debug level 39. 16 Return to debug level 38. 17 Return to debug level 37. 18 Return to debug level 36. 19 Return to debug level 35. 20 Return to debug level 34. 21 Return to debug level 33. 22 Return to debug level 32. 23 Return to debug level 31. 24 Return to debug level 30. 25 Return to debug level 29. 26 Return to debug level 28. 27 Return to debug level 27. 28 Return to debug level 26. 29 Return to debug level 25. 30 Return to debug level 24. 31 Return to debug level 23. 32 Return to debug level 22. 33 Return to debug level 21. 34 Return to debug level 20. 35 Return to debug level 19. 36 Return to debug level 18. 37 Return to debug level 17. 38 Return to debug level 16. 39 Return to debug level 15. 40 Return to debug level 14. 41 Return to debug level 13. 42 Return to debug level 12. 43 Return to debug level 11. 44 Return to debug level 10. 45 Return to debug level 9. 46 Return to debug level 8. 47 Return to debug level 7. 48 Return to debug level 6. 49 Return to debug level 5. 50 Return to debug level 4. 51 Return to debug level 3. 52 Return to debug level 2. 53 Return to debug level 1. 54 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 54. 2 Return to debug level 53. 3 Return to debug level 52. 4 Return to debug level 51. 5 Return to debug level 50. 6 Return to debug level 49. 7 Return to debug level 48. 8 Return to debug level 47. 9 Return to debug level 46. 10 Return to debug level 45. 11 Return to debug level 44. 12 Return to debug level 43. 13 Return to debug level 42. 14 Return to debug level 41. 15 Return to debug level 40. 16 Return to debug level 39. 17 Return to debug level 38. 18 Return to debug level 37. 19 Return to debug level 36. 20 Return to debug level 35. 21 Return to debug level 34. 22 Return to debug level 33. 23 Return to debug level 32. 24 Return to debug level 31. 25 Return to debug level 30. 26 Return to debug level 29. 27 Return to debug level 28. 28 Return to debug level 27. 29 Return to debug level 26. 30 Return to debug level 25. 31 Return to debug level 24. 32 Return to debug level 23. 33 Return to debug level 22. 34 Return to debug level 21. 35 Return to debug level 20. 36 Return to debug level 19. 37 Return to debug level 18. 38 Return to debug level 17. 39 Return to debug level 16. 40 Return to debug level 15. 41 Return to debug level 14. 42 Return to debug level 13. 43 Return to debug level 12. 44 Return to debug level 11. 45 Return to debug level 10. 46 Return to debug level 9. 47 Return to debug level 8. 48 Return to debug level 7. 49 Return to debug level 6. 50 Return to debug level 5. 51 Return to debug level 4. 52 Return to debug level 3. 53 Return to debug level 2. 54 Return to debug level 1. 55 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 55. 2 Return to debug level 54. 3 Return to debug level 53. 4 Return to debug level 52. 5 Return to debug level 51. 6 Return to debug level 50. 7 Return to debug level 49. 8 Return to debug level 48. 9 Return to debug level 47. 10 Return to debug level 46. 11 Return to debug level 45. 12 Return to debug level 44. 13 Return to debug level 43. 14 Return to debug level 42. 15 Return to debug level 41. 16 Return to debug level 40. 17 Return to debug level 39. 18 Return to debug level 38. 19 Return to debug level 37. 20 Return to debug level 36. 21 Return to debug level 35. 22 Return to debug level 34. 23 Return to debug level 33. 24 Return to debug level 32. 25 Return to debug level 31. 26 Return to debug level 30. 27 Return to debug level 29. 28 Return to debug level 28. 29 Return to debug level 27. 30 Return to debug level 26. 31 Return to debug level 25. 32 Return to debug level 24. 33 Return to debug level 23. 34 Return to debug level 22. 35 Return to debug level 21. 36 Return to debug level 20. 37 Return to debug level 19. 38 Return to debug level 18. 39 Return to debug level 17. 40 Return to debug level 16. 41 Return to debug level 15. 42 Return to debug level 14. 43 Return to debug level 13. 44 Return to debug level 12. 45 Return to debug level 11. 46 Return to debug level 10. 47 Return to debug level 9. 48 Return to debug level 8. 49 Return to debug level 7. 50 Return to debug level 6. 51 Return to debug level 5. 52 Return to debug level 4. 53 Return to debug level 3. 54 Return to debug level 2. 55 Return to debug level 1. 56 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 56. 2 Return to debug level 55. 3 Return to debug level 54. 4 Return to debug level 53. 5 Return to debug level 52. 6 Return to debug level 51. 7 Return to debug level 50. 8 Return to debug level 49. 9 Return to debug level 48. 10 Return to debug level 47. 11 Return to debug level 46. 12 Return to debug level 45. 13 Return to debug level 44. 14 Return to debug level 43. 15 Return to debug level 42. 16 Return to debug level 41. 17 Return to debug level 40. 18 Return to debug level 39. 19 Return to debug level 38. 20 Return to debug level 37. 21 Return to debug level 36. 22 Return to debug level 35. 23 Return to debug level 34. 24 Return to debug level 33. 25 Return to debug level 32. 26 Return to debug level 31. 27 Return to debug level 30. 28 Return to debug level 29. 29 Return to debug level 28. 30 Return to debug level 27. 31 Return to debug level 26. 32 Return to debug level 25. 33 Return to debug level 24. 34 Return to debug level 23. 35 Return to debug level 22. 36 Return to debug level 21. 37 Return to debug level 20. 38 Return to debug level 19. 39 Return to debug level 18. 40 Return to debug level 17. 41 Return to debug level 16. 42 Return to debug level 15. 43 Return to debug level 14. 44 Return to debug level 13. 45 Return to debug level 12. 46 Return to debug level 11. 47 Return to debug level 10. 48 Return to debug level 9. 49 Return to debug level 8. 50 Return to debug level 7. 51 Return to debug level 6. 52 Return to debug level 5. 53 Return to debug level 4. 54 Return to debug level 3. 55 Return to debug level 2. 56 Return to debug level 1. 57 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 57. 2 Return to debug level 56. 3 Return to debug level 55. 4 Return to debug level 54. 5 Return to debug level 53. 6 Return to debug level 52. 7 Return to debug level 51. 8 Return to debug level 50. 9 Return to debug level 49. 10 Return to debug level 48. 11 Return to debug level 47. 12 Return to debug level 46. 13 Return to debug level 45. 14 Return to debug level 44. 15 Return to debug level 43. 16 Return to debug level 42. 17 Return to debug level 41. 18 Return to debug level 40. 19 Return to debug level 39. 20 Return to debug level 38. 21 Return to debug level 37. 22 Return to debug level 36. 23 Return to debug level 35. 24 Return to debug level 34. 25 Return to debug level 33. 26 Return to debug level 32. 27 Return to debug level 31. 28 Return to debug level 30. 29 Return to debug level 29. 30 Return to debug level 28. 31 Return to debug level 27. 32 Return to debug level 26. 33 Return to debug level 25. 34 Return to debug level 24. 35 Return to debug level 23. 36 Return to debug level 22. 37 Return to debug level 21. 38 Return to debug level 20. 39 Return to debug level 19. 40 Return to debug level 18. 41 Return to debug level 17. 42 Return to debug level 16. 43 Return to debug level 15. 44 Return to debug level 14. 45 Return to debug level 13. 46 Return to debug level 12. 47 Return to debug level 11. 48 Return to debug level 10. 49 Return to debug level 9. 50 Return to debug level 8. 51 Return to debug level 7. 52 Return to debug level 6. 53 Return to debug level 5. 54 Return to debug level 4. 55 Return to debug level 3. 56 Return to debug level 2. 57 Return to debug level 1. 58 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 58. 2 Return to debug level 57. 3 Return to debug level 56. 4 Return to debug level 55. 5 Return to debug level 54. 6 Return to debug level 53. 7 Return to debug level 52. 8 Return to debug level 51. 9 Return to debug level 50. 10 Return to debug level 49. 11 Return to debug level 48. 12 Return to debug level 47. 13 Return to debug level 46. 14 Return to debug level 45. 15 Return to debug level 44. 16 Return to debug level 43. 17 Return to debug level 42. 18 Return to debug level 41. 19 Return to debug level 40. 20 Return to debug level 39. 21 Return to debug level 38. 22 Return to debug level 37. 23 Return to debug level 36. 24 Return to debug level 35. 25 Return to debug level 34. 26 Return to debug level 33. 27 Return to debug level 32. 28 Return to debug level 31. 29 Return to debug level 30. 30 Return to debug level 29. 31 Return to debug level 28. 32 Return to debug level 27. 33 Return to debug level 26. 34 Return to debug level 25. 35 Return to debug level 24. 36 Return to debug level 23. 37 Return to debug level 22. 38 Return to debug level 21. 39 Return to debug level 20. 40 Return to debug level 19. 41 Return to debug level 18. 42 Return to debug level 17. 43 Return to debug level 16. 44 Return to debug level 15. 45 Return to debug level 14. 46 Return to debug level 13. 47 Return to debug level 12. 48 Return to debug level 11. 49 Return to debug level 10. 50 Return to debug level 9. 51 Return to debug level 8. 52 Return to debug level 7. 53 Return to debug level 6. 54 Return to debug level 5. 55 Return to debug level 4. 56 Return to debug level 3. 57 Return to debug level 2. 58 Return to debug level 1. 59 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 59. 2 Return to debug level 58. 3 Return to debug level 57. 4 Return to debug level 56. 5 Return to debug level 55. 6 Return to debug level 54. 7 Return to debug level 53. 8 Return to debug level 52. 9 Return to debug level 51. 10 Return to debug level 50. 11 Return to debug level 49. 12 Return to debug level 48. 13 Return to debug level 47. 14 Return to debug level 46. 15 Return to debug level 45. 16 Return to debug level 44. 17 Return to debug level 43. 18 Return to debug level 42. 19 Return to debug level 41. 20 Return to debug level 40. 21 Return to debug level 39. 22 Return to debug level 38. 23 Return to debug level 37. 24 Return to debug level 36. 25 Return to debug level 35. 26 Return to debug level 34. 27 Return to debug level 33. 28 Return to debug level 32. 29 Return to debug level 31. 30 Return to debug level 30. 31 Return to debug level 29. 32 Return to debug level 28. 33 Return to debug level 27. 34 Return to debug level 26. 35 Return to debug level 25. 36 Return to debug level 24. 37 Return to debug level 23. 38 Return to debug level 22. 39 Return to debug level 21. 40 Return to debug level 20. 41 Return to debug level 19. 42 Return to debug level 18. 43 Return to debug level 17. 44 Return to debug level 16. 45 Return to debug level 15. 46 Return to debug level 14. 47 Return to debug level 13. 48 Return to debug level 12. 49 Return to debug level 11. 50 Return to debug level 10. 51 Return to debug level 9. 52 Return to debug level 8. 53 Return to debug level 7. 54 Return to debug level 6. 55 Return to debug level 5. 56 Return to debug level 4. 57 Return to debug level 3. 58 Return to debug level 2. 59 Return to debug level 1. 60 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 60. 2 Return to debug level 59. 3 Return to debug level 58. 4 Return to debug level 57. 5 Return to debug level 56. 6 Return to debug level 55. 7 Return to debug level 54. 8 Return to debug level 53. 9 Return to debug level 52. 10 Return to debug level 51. 11 Return to debug level 50. 12 Return to debug level 49. 13 Return to debug level 48. 14 Return to debug level 47. 15 Return to debug level 46. 16 Return to debug level 45. 17 Return to debug level 44. 18 Return to debug level 43. 19 Return to debug level 42. 20 Return to debug level 41. 21 Return to debug level 40. 22 Return to debug level 39. 23 Return to debug level 38. 24 Return to debug level 37. 25 Return to debug level 36. 26 Return to debug level 35. 27 Return to debug level 34. 28 Return to debug level 33. 29 Return to debug level 32. 30 Return to debug level 31. 31 Return to debug level 30. 32 Return to debug level 29. 33 Return to debug level 28. 34 Return to debug level 27. 35 Return to debug level 26. 36 Return to debug level 25. 37 Return to debug level 24. 38 Return to debug level 23. 39 Return to debug level 22. 40 Return to debug level 21. 41 Return to debug level 20. 42 Return to debug level 19. 43 Return to debug level 18. 44 Return to debug level 17. 45 Return to debug level 16. 46 Return to debug level 15. 47 Return to debug level 14. 48 Return to debug level 13. 49 Return to debug level 12. 50 Return to debug level 11. 51 Return to debug level 10. 52 Return to debug level 9. 53 Return to debug level 8. 54 Return to debug level 7. 55 Return to debug level 6. 56 Return to debug level 5. 57 Return to debug level 4. 58 Return to debug level 3. 59 Return to debug level 2. 60 Return to debug level 1. 61 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 61. 2 Return to debug level 60. 3 Return to debug level 59. 4 Return to debug level 58. 5 Return to debug level 57. 6 Return to debug level 56. 7 Return to debug level 55. 8 Return to debug level 54. 9 Return to debug level 53. 10 Return to debug level 52. 11 Return to debug level 51. 12 Return to debug level 50. 13 Return to debug level 49. 14 Return to debug level 48. 15 Return to debug level 47. 16 Return to debug level 46. 17 Return to debug level 45. 18 Return to debug level 44. 19 Return to debug level 43. 20 Return to debug level 42. 21 Return to debug level 41. 22 Return to debug level 40. 23 Return to debug level 39. 24 Return to debug level 38. 25 Return to debug level 37. 26 Return to debug level 36. 27 Return to debug level 35. 28 Return to debug level 34. 29 Return to debug level 33. 30 Return to debug level 32. 31 Return to debug level 31. 32 Return to debug level 30. 33 Return to debug level 29. 34 Return to debug level 28. 35 Return to debug level 27. 36 Return to debug level 26. 37 Return to debug level 25. 38 Return to debug level 24. 39 Return to debug level 23. 40 Return to debug level 22. 41 Return to debug level 21. 42 Return to debug level 20. 43 Return to debug level 19. 44 Return to debug level 18. 45 Return to debug level 17. 46 Return to debug level 16. 47 Return to debug level 15. 48 Return to debug level 14. 49 Return to debug level 13. 50 Return to debug level 12. 51 Return to debug level 11. 52 Return to debug level 10. 53 Return to debug level 9. 54 Return to debug level 8. 55 Return to debug level 7. 56 Return to debug level 6. 57 Return to debug level 5. 58 Return to debug level 4. 59 Return to debug level 3. 60 Return to debug level 2. 61 Return to debug level 1. 62 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 62. 2 Return to debug level 61. 3 Return to debug level 60. 4 Return to debug level 59. 5 Return to debug level 58. 6 Return to debug level 57. 7 Return to debug level 56. 8 Return to debug level 55. 9 Return to debug level 54. 10 Return to debug level 53. 11 Return to debug level 52. 12 Return to debug level 51. 13 Return to debug level 50. 14 Return to debug level 49. 15 Return to debug level 48. 16 Return to debug level 47. 17 Return to debug level 46. 18 Return to debug level 45. 19 Return to debug level 44. 20 Return to debug level 43. 21 Return to debug level 42. 22 Return to debug level 41. 23 Return to debug level 40. 24 Return to debug level 39. 25 Return to debug level 38. 26 Return to debug level 37. 27 Return to debug level 36. 28 Return to debug level 35. 29 Return to debug level 34. 30 Return to debug level 33. 31 Return to debug level 32. 32 Return to debug level 31. 33 Return to debug level 30. 34 Return to debug level 29. 35 Return to debug level 28. 36 Return to debug level 27. 37 Return to debug level 26. 38 Return to debug level 25. 39 Return to debug level 24. 40 Return to debug level 23. 41 Return to debug level 22. 42 Return to debug level 21. 43 Return to debug level 20. 44 Return to debug level 19. 45 Return to debug level 18. 46 Return to debug level 17. 47 Return to debug level 16. 48 Return to debug level 15. 49 Return to debug level 14. 50 Return to debug level 13. 51 Return to debug level 12. 52 Return to debug level 11. 53 Return to debug level 10. 54 Return to debug level 9. 55 Return to debug level 8. 56 Return to debug level 7. 57 Return to debug level 6. 58 Return to debug level 5. 59 Return to debug level 4. 60 Return to debug level 3. 61 Return to debug level 2. 62 Return to debug level 1. 63 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 63. 2 Return to debug level 62. 3 Return to debug level 61. 4 Return to debug level 60. 5 Return to debug level 59. 6 Return to debug level 58. 7 Return to debug level 57. 8 Return to debug level 56. 9 Return to debug level 55. 10 Return to debug level 54. 11 Return to debug level 53. 12 Return to debug level 52. 13 Return to debug level 51. 14 Return to debug level 50. 15 Return to debug level 49. 16 Return to debug level 48. 17 Return to debug level 47. 18 Return to debug level 46. 19 Return to debug level 45. 20 Return to debug level 44. 21 Return to debug level 43. 22 Return to debug level 42. 23 Return to debug level 41. 24 Return to debug level 40. 25 Return to debug level 39. 26 Return to debug level 38. 27 Return to debug level 37. 28 Return to debug level 36. 29 Return to debug level 35. 30 Return to debug level 34. 31 Return to debug level 33. 32 Return to debug level 32. 33 Return to debug level 31. 34 Return to debug level 30. 35 Return to debug level 29. 36 Return to debug level 28. 37 Return to debug level 27. 38 Return to debug level 26. 39 Return to debug level 25. 40 Return to debug level 24. 41 Return to debug level 23. 42 Return to debug level 22. 43 Return to debug level 21. 44 Return to debug level 20. 45 Return to debug level 19. 46 Return to debug level 18. 47 Return to debug level 17. 48 Return to debug level 16. 49 Return to debug level 15. 50 Return to debug level 14. 51 Return to debug level 13. 52 Return to debug level 12. 53 Return to debug level 11. 54 Return to debug level 10. 55 Return to debug level 9. 56 Return to debug level 8. 57 Return to debug level 7. 58 Return to debug level 6. 59 Return to debug level 5. 60 Return to debug level 4. 61 Return to debug level 3. 62 Return to debug level 2. 63 Return to debug level 1. 64 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 64. 2 Return to debug level 63. 3 Return to debug level 62. 4 Return to debug level 61. 5 Return to debug level 60. 6 Return to debug level 59. 7 Return to debug level 58. 8 Return to debug level 57. 9 Return to debug level 56. 10 Return to debug level 55. 11 Return to debug level 54. 12 Return to debug level 53. 13 Return to debug level 52. 14 Return to debug level 51. 15 Return to debug level 50. 16 Return to debug level 49. 17 Return to debug level 48. 18 Return to debug level 47. 19 Return to debug level 46. 20 Return to debug level 45. 21 Return to debug level 44. 22 Return to debug level 43. 23 Return to debug level 42. 24 Return to debug level 41. 25 Return to debug level 40. 26 Return to debug level 39. 27 Return to debug level 38. 28 Return to debug level 37. 29 Return to debug level 36. 30 Return to debug level 35. 31 Return to debug level 34. 32 Return to debug level 33. 33 Return to debug level 32. 34 Return to debug level 31. 35 Return to debug level 30. 36 Return to debug level 29. 37 Return to debug level 28. 38 Return to debug level 27. 39 Return to debug level 26. 40 Return to debug level 25. 41 Return to debug level 24. 42 Return to debug level 23. 43 Return to debug level 22. 44 Return to debug level 21. 45 Return to debug level 20. 46 Return to debug level 19. 47 Return to debug level 18. 48 Return to debug level 17. 49 Return to debug level 16. 50 Return to debug level 15. 51 Return to debug level 14. 52 Return to debug level 13. 53 Return to debug level 12. 54 Return to debug level 11. 55 Return to debug level 10. 56 Return to debug level 9. 57 Return to debug level 8. 58 Return to debug level 7. 59 Return to debug level 6. 60 Return to debug level 5. 61 Return to debug level 4. 62 Return to debug level 3. 63 Return to debug level 2. 64 Return to debug level 1. 65 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 65. 2 Return to debug level 64. 3 Return to debug level 63. 4 Return to debug level 62. 5 Return to debug level 61. 6 Return to debug level 60. 7 Return to debug level 59. 8 Return to debug level 58. 9 Return to debug level 57. 10 Return to debug level 56. 11 Return to debug level 55. 12 Return to debug level 54. 13 Return to debug level 53. 14 Return to debug level 52. 15 Return to debug level 51. 16 Return to debug level 50. 17 Return to debug level 49. 18 Return to debug level 48. 19 Return to debug level 47. 20 Return to debug level 46. 21 Return to debug level 45. 22 Return to debug level 44. 23 Return to debug level 43. 24 Return to debug level 42. 25 Return to debug level 41. 26 Return to debug level 40. 27 Return to debug level 39. 28 Return to debug level 38. 29 Return to debug level 37. 30 Return to debug level 36. 31 Return to debug level 35. 32 Return to debug level 34. 33 Return to debug level 33. 34 Return to debug level 32. 35 Return to debug level 31. 36 Return to debug level 30. 37 Return to debug level 29. 38 Return to debug level 28. 39 Return to debug level 27. 40 Return to debug level 26. 41 Return to debug level 25. 42 Return to debug level 24. 43 Return to debug level 23. 44 Return to debug level 22. 45 Return to debug level 21. 46 Return to debug level 20. 47 Return to debug level 19. 48 Return to debug level 18. 49 Return to debug level 17. 50 Return to debug level 16. 51 Return to debug level 15. 52 Return to debug level 14. 53 Return to debug level 13. 54 Return to debug level 12. 55 Return to debug level 11. 56 Return to debug level 10. 57 Return to debug level 9. 58 Return to debug level 8. 59 Return to debug level 7. 60 Return to debug level 6. 61 Return to debug level 5. 62 Return to debug level 4. 63 Return to debug level 3. 64 Return to debug level 2. 65 Return to debug level 1. 66 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 66. 2 Return to debug level 65. 3 Return to debug level 64. 4 Return to debug level 63. 5 Return to debug level 62. 6 Return to debug level 61. 7 Return to debug level 60. 8 Return to debug level 59. 9 Return to debug level 58. 10 Return to debug level 57. 11 Return to debug level 56. 12 Return to debug level 55. 13 Return to debug level 54. 14 Return to debug level 53. 15 Return to debug level 52. 16 Return to debug level 51. 17 Return to debug level 50. 18 Return to debug level 49. 19 Return to debug level 48. 20 Return to debug level 47. 21 Return to debug level 46. 22 Return to debug level 45. 23 Return to debug level 44. 24 Return to debug level 43. 25 Return to debug level 42. 26 Return to debug level 41. 27 Return to debug level 40. 28 Return to debug level 39. 29 Return to debug level 38. 30 Return to debug level 37. 31 Return to debug level 36. 32 Return to debug level 35. 33 Return to debug level 34. 34 Return to debug level 33. 35 Return to debug level 32. 36 Return to debug level 31. 37 Return to debug level 30. 38 Return to debug level 29. 39 Return to debug level 28. 40 Return to debug level 27. 41 Return to debug level 26. 42 Return to debug level 25. 43 Return to debug level 24. 44 Return to debug level 23. 45 Return to debug level 22. 46 Return to debug level 21. 47 Return to debug level 20. 48 Return to debug level 19. 49 Return to debug level 18. 50 Return to debug level 17. 51 Return to debug level 16. 52 Return to debug level 15. 53 Return to debug level 14. 54 Return to debug level 13. 55 Return to debug level 12. 56 Return to debug level 11. 57 Return to debug level 10. 58 Return to debug level 9. 59 Return to debug level 8. 60 Return to debug level 7. 61 Return to debug level 6. 62 Return to debug level 5. 63 Return to debug level 4. 64 Return to debug level 3. 65 Return to debug level 2. 66 Return to debug level 1. 67 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 67. 2 Return to debug level 66. 3 Return to debug level 65. 4 Return to debug level 64. 5 Return to debug level 63. 6 Return to debug level 62. 7 Return to debug level 61. 8 Return to debug level 60. 9 Return to debug level 59. 10 Return to debug level 58. 11 Return to debug level 57. 12 Return to debug level 56. 13 Return to debug level 55. 14 Return to debug level 54. 15 Return to debug level 53. 16 Return to debug level 52. 17 Return to debug level 51. 18 Return to debug level 50. 19 Return to debug level 49. 20 Return to debug level 48. 21 Return to debug level 47. 22 Return to debug level 46. 23 Return to debug level 45. 24 Return to debug level 44. 25 Return to debug level 43. 26 Return to debug level 42. 27 Return to debug level 41. 28 Return to debug level 40. 29 Return to debug level 39. 30 Return to debug level 38. 31 Return to debug level 37. 32 Return to debug level 36. 33 Return to debug level 35. 34 Return to debug level 34. 35 Return to debug level 33. 36 Return to debug level 32. 37 Return to debug level 31. 38 Return to debug level 30. 39 Return to debug level 29. 40 Return to debug level 28. 41 Return to debug level 27. 42 Return to debug level 26. 43 Return to debug level 25. 44 Return to debug level 24. 45 Return to debug level 23. 46 Return to debug level 22. 47 Return to debug level 21. 48 Return to debug level 20. 49 Return to debug level 19. 50 Return to debug level 18. 51 Return to debug level 17. 52 Return to debug level 16. 53 Return to debug level 15. 54 Return to debug level 14. 55 Return to debug level 13. 56 Return to debug level 12. 57 Return to debug level 11. 58 Return to debug level 10. 59 Return to debug level 9. 60 Return to debug level 8. 61 Return to debug level 7. 62 Return to debug level 6. 63 Return to debug level 5. 64 Return to debug level 4. 65 Return to debug level 3. 66 Return to debug level 2. 67 Return to debug level 1. 68 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 68. 2 Return to debug level 67. 3 Return to debug level 66. 4 Return to debug level 65. 5 Return to debug level 64. 6 Return to debug level 63. 7 Return to debug level 62. 8 Return to debug level 61. 9 Return to debug level 60. 10 Return to debug level 59. 11 Return to debug level 58. 12 Return to debug level 57. 13 Return to debug level 56. 14 Return to debug level 55. 15 Return to debug level 54. 16 Return to debug level 53. 17 Return to debug level 52. 18 Return to debug level 51. 19 Return to debug level 50. 20 Return to debug level 49. 21 Return to debug level 48. 22 Return to debug level 47. 23 Return to debug level 46. 24 Return to debug level 45. 25 Return to debug level 44. 26 Return to debug level 43. 27 Return to debug level 42. 28 Return to debug level 41. 29 Return to debug level 40. 30 Return to debug level 39. 31 Return to debug level 38. 32 Return to debug level 37. 33 Return to debug level 36. 34 Return to debug level 35. 35 Return to debug level 34. 36 Return to debug level 33. 37 Return to debug level 32. 38 Return to debug level 31. 39 Return to debug level 30. 40 Return to debug level 29. 41 Return to debug level 28. 42 Return to debug level 27. 43 Return to debug level 26. 44 Return to debug level 25. 45 Return to debug level 24. 46 Return to debug level 23. 47 Return to debug level 22. 48 Return to debug level 21. 49 Return to debug level 20. 50 Return to debug level 19. 51 Return to debug level 18. 52 Return to debug level 17. 53 Return to debug level 16. 54 Return to debug level 15. 55 Return to debug level 14. 56 Return to debug level 13. 57 Return to debug level 12. 58 Return to debug level 11. 59 Return to debug level 10. 60 Return to debug level 9. 61 Return to debug level 8. 62 Return to debug level 7. 63 Return to debug level 6. 64 Return to debug level 5. 65 Return to debug level 4. 66 Return to debug level 3. 67 Return to debug level 2. 68 Return to debug level 1. 69 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 69. 2 Return to debug level 68. 3 Return to debug level 67. 4 Return to debug level 66. 5 Return to debug level 65. 6 Return to debug level 64. 7 Return to debug level 63. 8 Return to debug level 62. 9 Return to debug level 61. 10 Return to debug level 60. 11 Return to debug level 59. 12 Return to debug level 58. 13 Return to debug level 57. 14 Return to debug level 56. 15 Return to debug level 55. 16 Return to debug level 54. 17 Return to debug level 53. 18 Return to debug level 52. 19 Return to debug level 51. 20 Return to debug level 50. 21 Return to debug level 49. 22 Return to debug level 48. 23 Return to debug level 47. 24 Return to debug level 46. 25 Return to debug level 45. 26 Return to debug level 44. 27 Return to debug level 43. 28 Return to debug level 42. 29 Return to debug level 41. 30 Return to debug level 40. 31 Return to debug level 39. 32 Return to debug level 38. 33 Return to debug level 37. 34 Return to debug level 36. 35 Return to debug level 35. 36 Return to debug level 34. 37 Return to debug level 33. 38 Return to debug level 32. 39 Return to debug level 31. 40 Return to debug level 30. 41 Return to debug level 29. 42 Return to debug level 28. 43 Return to debug level 27. 44 Return to debug level 26. 45 Return to debug level 25. 46 Return to debug level 24. 47 Return to debug level 23. 48 Return to debug level 22. 49 Return to debug level 21. 50 Return to debug level 20. 51 Return to debug level 19. 52 Return to debug level 18. 53 Return to debug level 17. 54 Return to debug level 16. 55 Return to debug level 15. 56 Return to debug level 14. 57 Return to debug level 13. 58 Return to debug level 12. 59 Return to debug level 11. 60 Return to debug level 10. 61 Return to debug level 9. 62 Return to debug level 8. 63 Return to debug level 7. 64 Return to debug level 6. 65 Return to debug level 5. 66 Return to debug level 4. 67 Return to debug level 3. 68 Return to debug level 2. 69 Return to debug level 1. 70 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 70. 2 Return to debug level 69. 3 Return to debug level 68. 4 Return to debug level 67. 5 Return to debug level 66. 6 Return to debug level 65. 7 Return to debug level 64. 8 Return to debug level 63. 9 Return to debug level 62. 10 Return to debug level 61. 11 Return to debug level 60. 12 Return to debug level 59. 13 Return to debug level 58. 14 Return to debug level 57. 15 Return to debug level 56. 16 Return to debug level 55. 17 Return to debug level 54. 18 Return to debug level 53. 19 Return to debug level 52. 20 Return to debug level 51. 21 Return to debug level 50. 22 Return to debug level 49. 23 Return to debug level 48. 24 Return to debug level 47. 25 Return to debug level 46. 26 Return to debug level 45. 27 Return to debug level 44. 28 Return to debug level 43. 29 Return to debug level 42. 30 Return to debug level 41. 31 Return to debug level 40. 32 Return to debug level 39. 33 Return to debug level 38. 34 Return to debug level 37. 35 Return to debug level 36. 36 Return to debug level 35. 37 Return to debug level 34. 38 Return to debug level 33. 39 Return to debug level 32. 40 Return to debug level 31. 41 Return to debug level 30. 42 Return to debug level 29. 43 Return to debug level 28. 44 Return to debug level 27. 45 Return to debug level 26. 46 Return to debug level 25. 47 Return to debug level 24. 48 Return to debug level 23. 49 Return to debug level 22. 50 Return to debug level 21. 51 Return to debug level 20. 52 Return to debug level 19. 53 Return to debug level 18. 54 Return to debug level 17. 55 Return to debug level 16. 56 Return to debug level 15. 57 Return to debug level 14. 58 Return to debug level 13. 59 Return to debug level 12. 60 Return to debug level 11. 61 Return to debug level 10. 62 Return to debug level 9. 63 Return to debug level 8. 64 Return to debug level 7. 65 Return to debug level 6. 66 Return to debug level 5. 67 Return to debug level 4. 68 Return to debug level 3. 69 Return to debug level 2. 70 Return to debug level 1. 71 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 71. 2 Return to debug level 70. 3 Return to debug level 69. 4 Return to debug level 68. 5 Return to debug level 67. 6 Return to debug level 66. 7 Return to debug level 65. 8 Return to debug level 64. 9 Return to debug level 63. 10 Return to debug level 62. 11 Return to debug level 61. 12 Return to debug level 60. 13 Return to debug level 59. 14 Return to debug level 58. 15 Return to debug level 57. 16 Return to debug level 56. 17 Return to debug level 55. 18 Return to debug level 54. 19 Return to debug level 53. 20 Return to debug level 52. 21 Return to debug level 51. 22 Return to debug level 50. 23 Return to debug level 49. 24 Return to debug level 48. 25 Return to debug level 47. 26 Return to debug level 46. 27 Return to debug level 45. 28 Return to debug level 44. 29 Return to debug level 43. 30 Return to debug level 42. 31 Return to debug level 41. 32 Return to debug level 40. 33 Return to debug level 39. 34 Return to debug level 38. 35 Return to debug level 37. 36 Return to debug level 36. 37 Return to debug level 35. 38 Return to debug level 34. 39 Return to debug level 33. 40 Return to debug level 32. 41 Return to debug level 31. 42 Return to debug level 30. 43 Return to debug level 29. 44 Return to debug level 28. 45 Return to debug level 27. 46 Return to debug level 26. 47 Return to debug level 25. 48 Return to debug level 24. 49 Return to debug level 23. 50 Return to debug level 22. 51 Return to debug level 21. 52 Return to debug level 20. 53 Return to debug level 19. 54 Return to debug level 18. 55 Return to debug level 17. 56 Return to debug level 16. 57 Return to debug level 15. 58 Return to debug level 14. 59 Return to debug level 13. 60 Return to debug level 12. 61 Return to debug level 11. 62 Return to debug level 10. 63 Return to debug level 9. 64 Return to debug level 8. 65 Return to debug level 7. 66 Return to debug level 6. 67 Return to debug level 5. 68 Return to debug level 4. 69 Return to debug level 3. 70 Return to debug level 2. 71 Return to debug level 1. 72 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 72. 2 Return to debug level 71. 3 Return to debug level 70. 4 Return to debug level 69. 5 Return to debug level 68. 6 Return to debug level 67. 7 Return to debug level 66. 8 Return to debug level 65. 9 Return to debug level 64. 10 Return to debug level 63. 11 Return to debug level 62. 12 Return to debug level 61. 13 Return to debug level 60. 14 Return to debug level 59. 15 Return to debug level 58. 16 Return to debug level 57. 17 Return to debug level 56. 18 Return to debug level 55. 19 Return to debug level 54. 20 Return to debug level 53. 21 Return to debug level 52. 22 Return to debug level 51. 23 Return to debug level 50. 24 Return to debug level 49. 25 Return to debug level 48. 26 Return to debug level 47. 27 Return to debug level 46. 28 Return to debug level 45. 29 Return to debug level 44. 30 Return to debug level 43. 31 Return to debug level 42. 32 Return to debug level 41. 33 Return to debug level 40. 34 Return to debug level 39. 35 Return to debug level 38. 36 Return to debug level 37. 37 Return to debug level 36. 38 Return to debug level 35. 39 Return to debug level 34. 40 Return to debug level 33. 41 Return to debug level 32. 42 Return to debug level 31. 43 Return to debug level 30. 44 Return to debug level 29. 45 Return to debug level 28. 46 Return to debug level 27. 47 Return to debug level 26. 48 Return to debug level 25. 49 Return to debug level 24. 50 Return to debug level 23. 51 Return to debug level 22. 52 Return to debug level 21. 53 Return to debug level 20. 54 Return to debug level 19. 55 Return to debug level 18. 56 Return to debug level 17. 57 Return to debug level 16. 58 Return to debug level 15. 59 Return to debug level 14. 60 Return to debug level 13. 61 Return to debug level 12. 62 Return to debug level 11. 63 Return to debug level 10. 64 Return to debug level 9. 65 Return to debug level 8. 66 Return to debug level 7. 67 Return to debug level 6. 68 Return to debug level 5. 69 Return to debug level 4. 70 Return to debug level 3. 71 Return to debug level 2. 72 Return to debug level 1. 73 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 73. 2 Return to debug level 72. 3 Return to debug level 71. 4 Return to debug level 70. 5 Return to debug level 69. 6 Return to debug level 68. 7 Return to debug level 67. 8 Return to debug level 66. 9 Return to debug level 65. 10 Return to debug level 64. 11 Return to debug level 63. 12 Return to debug level 62. 13 Return to debug level 61. 14 Return to debug level 60. 15 Return to debug level 59. 16 Return to debug level 58. 17 Return to debug level 57. 18 Return to debug level 56. 19 Return to debug level 55. 20 Return to debug level 54. 21 Return to debug level 53. 22 Return to debug level 52. 23 Return to debug level 51. 24 Return to debug level 50. 25 Return to debug level 49. 26 Return to debug level 48. 27 Return to debug level 47. 28 Return to debug level 46. 29 Return to debug level 45. 30 Return to debug level 44. 31 Return to debug level 43. 32 Return to debug level 42. 33 Return to debug level 41. 34 Return to debug level 40. 35 Return to debug level 39. 36 Return to debug level 38. 37 Return to debug level 37. 38 Return to debug level 36. 39 Return to debug level 35. 40 Return to debug level 34. 41 Return to debug level 33. 42 Return to debug level 32. 43 Return to debug level 31. 44 Return to debug level 30. 45 Return to debug level 29. 46 Return to debug level 28. 47 Return to debug level 27. 48 Return to debug level 26. 49 Return to debug level 25. 50 Return to debug level 24. 51 Return to debug level 23. 52 Return to debug level 22. 53 Return to debug level 21. 54 Return to debug level 20. 55 Return to debug level 19. 56 Return to debug level 18. 57 Return to debug level 17. 58 Return to debug level 16. 59 Return to debug level 15. 60 Return to debug level 14. 61 Return to debug level 13. 62 Return to debug level 12. 63 Return to debug level 11. 64 Return to debug level 10. 65 Return to debug level 9. 66 Return to debug level 8. 67 Return to debug level 7. 68 Return to debug level 6. 69 Return to debug level 5. 70 Return to debug level 4. 71 Return to debug level 3. 72 Return to debug level 2. 73 Return to debug level 1. 74 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 74. 2 Return to debug level 73. 3 Return to debug level 72. 4 Return to debug level 71. 5 Return to debug level 70. 6 Return to debug level 69. 7 Return to debug level 68. 8 Return to debug level 67. 9 Return to debug level 66. 10 Return to debug level 65. 11 Return to debug level 64. 12 Return to debug level 63. 13 Return to debug level 62. 14 Return to debug level 61. 15 Return to debug level 60. 16 Return to debug level 59. 17 Return to debug level 58. 18 Return to debug level 57. 19 Return to debug level 56. 20 Return to debug level 55. 21 Return to debug level 54. 22 Return to debug level 53. 23 Return to debug level 52. 24 Return to debug level 51. 25 Return to debug level 50. 26 Return to debug level 49. 27 Return to debug level 48. 28 Return to debug level 47. 29 Return to debug level 46. 30 Return to debug level 45. 31 Return to debug level 44. 32 Return to debug level 43. 33 Return to debug level 42. 34 Return to debug level 41. 35 Return to debug level 40. 36 Return to debug level 39. 37 Return to debug level 38. 38 Return to debug level 37. 39 Return to debug level 36. 40 Return to debug level 35. 41 Return to debug level 34. 42 Return to debug level 33. 43 Return to debug level 32. 44 Return to debug level 31. 45 Return to debug level 30. 46 Return to debug level 29. 47 Return to debug level 28. 48 Return to debug level 27. 49 Return to debug level 26. 50 Return to debug level 25. 51 Return to debug level 24. 52 Return to debug level 23. 53 Return to debug level 22. 54 Return to debug level 21. 55 Return to debug level 20. 56 Return to debug level 19. 57 Return to debug level 18. 58 Return to debug level 17. 59 Return to debug level 16. 60 Return to debug level 15. 61 Return to debug level 14. 62 Return to debug level 13. 63 Return to debug level 12. 64 Return to debug level 11. 65 Return to debug level 10. 66 Return to debug level 9. 67 Return to debug level 8. 68 Return to debug level 7. 69 Return to debug level 6. 70 Return to debug level 5. 71 Return to debug level 4. 72 Return to debug level 3. 73 Return to debug level 2. 74 Return to debug level 1. 75 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 75. 2 Return to debug level 74. 3 Return to debug level 73. 4 Return to debug level 72. 5 Return to debug level 71. 6 Return to debug level 70. 7 Return to debug level 69. 8 Return to debug level 68. 9 Return to debug level 67. 10 Return to debug level 66. 11 Return to debug level 65. 12 Return to debug level 64. 13 Return to debug level 63. 14 Return to debug level 62. 15 Return to debug level 61. 16 Return to debug level 60. 17 Return to debug level 59. 18 Return to debug level 58. 19 Return to debug level 57. 20 Return to debug level 56. 21 Return to debug level 55. 22 Return to debug level 54. 23 Return to debug level 53. 24 Return to debug level 52. 25 Return to debug level 51. 26 Return to debug level 50. 27 Return to debug level 49. 28 Return to debug level 48. 29 Return to debug level 47. 30 Return to debug level 46. 31 Return to debug level 45. 32 Return to debug level 44. 33 Return to debug level 43. 34 Return to debug level 42. 35 Return to debug level 41. 36 Return to debug level 40. 37 Return to debug level 39. 38 Return to debug level 38. 39 Return to debug level 37. 40 Return to debug level 36. 41 Return to debug level 35. 42 Return to debug level 34. 43 Return to debug level 33. 44 Return to debug level 32. 45 Return to debug level 31. 46 Return to debug level 30. 47 Return to debug level 29. 48 Return to debug level 28. 49 Return to debug level 27. 50 Return to debug level 26. 51 Return to debug level 25. 52 Return to debug level 24. 53 Return to debug level 23. 54 Return to debug level 22. 55 Return to debug level 21. 56 Return to debug level 20. 57 Return to debug level 19. 58 Return to debug level 18. 59 Return to debug level 17. 60 Return to debug level 16. 61 Return to debug level 15. 62 Return to debug level 14. 63 Return to debug level 13. 64 Return to debug level 12. 65 Return to debug level 11. 66 Return to debug level 10. 67 Return to debug level 9. 68 Return to debug level 8. 69 Return to debug level 7. 70 Return to debug level 6. 71 Return to debug level 5. 72 Return to debug level 4. 73 Return to debug level 3. 74 Return to debug level 2. 75 Return to debug level 1. 76 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 76. 2 Return to debug level 75. 3 Return to debug level 74. 4 Return to debug level 73. 5 Return to debug level 72. 6 Return to debug level 71. 7 Return to debug level 70. 8 Return to debug level 69. 9 Return to debug level 68. 10 Return to debug level 67. 11 Return to debug level 66. 12 Return to debug level 65. 13 Return to debug level 64. 14 Return to debug level 63. 15 Return to debug level 62. 16 Return to debug level 61. 17 Return to debug level 60. 18 Return to debug level 59. 19 Return to debug level 58. 20 Return to debug level 57. 21 Return to debug level 56. 22 Return to debug level 55. 23 Return to debug level 54. 24 Return to debug level 53. 25 Return to debug level 52. 26 Return to debug level 51. 27 Return to debug level 50. 28 Return to debug level 49. 29 Return to debug level 48. 30 Return to debug level 47. 31 Return to debug level 46. 32 Return to debug level 45. 33 Return to debug level 44. 34 Return to debug level 43. 35 Return to debug level 42. 36 Return to debug level 41. 37 Return to debug level 40. 38 Return to debug level 39. 39 Return to debug level 38. 40 Return to debug level 37. 41 Return to debug level 36. 42 Return to debug level 35. 43 Return to debug level 34. 44 Return to debug level 33. 45 Return to debug level 32. 46 Return to debug level 31. 47 Return to debug level 30. 48 Return to debug level 29. 49 Return to debug level 28. 50 Return to debug level 27. 51 Return to debug level 26. 52 Return to debug level 25. 53 Return to debug level 24. 54 Return to debug level 23. 55 Return to debug level 22. 56 Return to debug level 21. 57 Return to debug level 20. 58 Return to debug level 19. 59 Return to debug level 18. 60 Return to debug level 17. 61 Return to debug level 16. 62 Return to debug level 15. 63 Return to debug level 14. 64 Return to debug level 13. 65 Return to debug level 12. 66 Return to debug level 11. 67 Return to debug level 10. 68 Return to debug level 9. 69 Return to debug level 8. 70 Return to debug level 7. 71 Return to debug level 6. 72 Return to debug level 5. 73 Return to debug level 4. 74 Return to debug level 3. 75 Return to debug level 2. 76 Return to debug level 1. 77 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 77. 2 Return to debug level 76. 3 Return to debug level 75. 4 Return to debug level 74. 5 Return to debug level 73. 6 Return to debug level 72. 7 Return to debug level 71. 8 Return to debug level 70. 9 Return to debug level 69. 10 Return to debug level 68. 11 Return to debug level 67. 12 Return to debug level 66. 13 Return to debug level 65. 14 Return to debug level 64. 15 Return to debug level 63. 16 Return to debug level 62. 17 Return to debug level 61. 18 Return to debug level 60. 19 Return to debug level 59. 20 Return to debug level 58. 21 Return to debug level 57. 22 Return to debug level 56. 23 Return to debug level 55. 24 Return to debug level 54. 25 Return to debug level 53. 26 Return to debug level 52. 27 Return to debug level 51. 28 Return to debug level 50. 29 Return to debug level 49. 30 Return to debug level 48. 31 Return to debug level 47. 32 Return to debug level 46. 33 Return to debug level 45. 34 Return to debug level 44. 35 Return to debug level 43. 36 Return to debug level 42. 37 Return to debug level 41. 38 Return to debug level 40. 39 Return to debug level 39. 40 Return to debug level 38. 41 Return to debug level 37. 42 Return to debug level 36. 43 Return to debug level 35. 44 Return to debug level 34. 45 Return to debug level 33. 46 Return to debug level 32. 47 Return to debug level 31. 48 Return to debug level 30. 49 Return to debug level 29. 50 Return to debug level 28. 51 Return to debug level 27. 52 Return to debug level 26. 53 Return to debug level 25. 54 Return to debug level 24. 55 Return to debug level 23. 56 Return to debug level 22. 57 Return to debug level 21. 58 Return to debug level 20. 59 Return to debug level 19. 60 Return to debug level 18. 61 Return to debug level 17. 62 Return to debug level 16. 63 Return to debug level 15. 64 Return to debug level 14. 65 Return to debug level 13. 66 Return to debug level 12. 67 Return to debug level 11. 68 Return to debug level 10. 69 Return to debug level 9. 70 Return to debug level 8. 71 Return to debug level 7. 72 Return to debug level 6. 73 Return to debug level 5. 74 Return to debug level 4. 75 Return to debug level 3. 76 Return to debug level 2. 77 Return to debug level 1. 78 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 78. 2 Return to debug level 77. 3 Return to debug level 76. 4 Return to debug level 75. 5 Return to debug level 74. 6 Return to debug level 73. 7 Return to debug level 72. 8 Return to debug level 71. 9 Return to debug level 70. 10 Return to debug level 69. 11 Return to debug level 68. 12 Return to debug level 67. 13 Return to debug level 66. 14 Return to debug level 65. 15 Return to debug level 64. 16 Return to debug level 63. 17 Return to debug level 62. 18 Return to debug level 61. 19 Return to debug level 60. 20 Return to debug level 59. 21 Return to debug level 58. 22 Return to debug level 57. 23 Return to debug level 56. 24 Return to debug level 55. 25 Return to debug level 54. 26 Return to debug level 53. 27 Return to debug level 52. 28 Return to debug level 51. 29 Return to debug level 50. 30 Return to debug level 49. 31 Return to debug level 48. 32 Return to debug level 47. 33 Return to debug level 46. 34 Return to debug level 45. 35 Return to debug level 44. 36 Return to debug level 43. 37 Return to debug level 42. 38 Return to debug level 41. 39 Return to debug level 40. 40 Return to debug level 39. 41 Return to debug level 38. 42 Return to debug level 37. 43 Return to debug level 36. 44 Return to debug level 35. 45 Return to debug level 34. 46 Return to debug level 33. 47 Return to debug level 32. 48 Return to debug level 31. 49 Return to debug level 30. 50 Return to debug level 29. 51 Return to debug level 28. 52 Return to debug level 27. 53 Return to debug level 26. 54 Return to debug level 25. 55 Return to debug level 24. 56 Return to debug level 23. 57 Return to debug level 22. 58 Return to debug level 21. 59 Return to debug level 20. 60 Return to debug level 19. 61 Return to debug level 18. 62 Return to debug level 17. 63 Return to debug level 16. 64 Return to debug level 15. 65 Return to debug level 14. 66 Return to debug level 13. 67 Return to debug level 12. 68 Return to debug level 11. 69 Return to debug level 10. 70 Return to debug level 9. 71 Return to debug level 8. 72 Return to debug level 7. 73 Return to debug level 6. 74 Return to debug level 5. 75 Return to debug level 4. 76 Return to debug level 3. 77 Return to debug level 2. 78 Return to debug level 1. 79 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 79. 2 Return to debug level 78. 3 Return to debug level 77. 4 Return to debug level 76. 5 Return to debug level 75. 6 Return to debug level 74. 7 Return to debug level 73. 8 Return to debug level 72. 9 Return to debug level 71. 10 Return to debug level 70. 11 Return to debug level 69. 12 Return to debug level 68. 13 Return to debug level 67. 14 Return to debug level 66. 15 Return to debug level 65. 16 Return to debug level 64. 17 Return to debug level 63. 18 Return to debug level 62. 19 Return to debug level 61. 20 Return to debug level 60. 21 Return to debug level 59. 22 Return to debug level 58. 23 Return to debug level 57. 24 Return to debug level 56. 25 Return to debug level 55. 26 Return to debug level 54. 27 Return to debug level 53. 28 Return to debug level 52. 29 Return to debug level 51. 30 Return to debug level 50. 31 Return to debug level 49. 32 Return to debug level 48. 33 Return to debug level 47. 34 Return to debug level 46. 35 Return to debug level 45. 36 Return to debug level 44. 37 Return to debug level 43. 38 Return to debug level 42. 39 Return to debug level 41. 40 Return to debug level 40. 41 Return to debug level 39. 42 Return to debug level 38. 43 Return to debug level 37. 44 Return to debug level 36. 45 Return to debug level 35. 46 Return to debug level 34. 47 Return to debug level 33. 48 Return to debug level 32. 49 Return to debug level 31. 50 Return to debug level 30. 51 Return to debug level 29. 52 Return to debug level 28. 53 Return to debug level 27. 54 Return to debug level 26. 55 Return to debug level 25. 56 Return to debug level 24. 57 Return to debug level 23. 58 Return to debug level 22. 59 Return to debug level 21. 60 Return to debug level 20. 61 Return to debug level 19. 62 Return to debug level 18. 63 Return to debug level 17. 64 Return to debug level 16. 65 Return to debug level 15. 66 Return to debug level 14. 67 Return to debug level 13. 68 Return to debug level 12. 69 Return to debug level 11. 70 Return to debug level 10. 71 Return to debug level 9. 72 Return to debug level 8. 73 Return to debug level 7. 74 Return to debug level 6. 75 Return to debug level 5. 76 Return to debug level 4. 77 Return to debug level 3. 78 Return to debug level 2. 79 Return to debug level 1. 80 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 80. 2 Return to debug level 79. 3 Return to debug level 78. 4 Return to debug level 77. 5 Return to debug level 76. 6 Return to debug level 75. 7 Return to debug level 74. 8 Return to debug level 73. 9 Return to debug level 72. 10 Return to debug level 71. 11 Return to debug level 70. 12 Return to debug level 69. 13 Return to debug level 68. 14 Return to debug level 67. 15 Return to debug level 66. 16 Return to debug level 65. 17 Return to debug level 64. 18 Return to debug level 63. 19 Return to debug level 62. 20 Return to debug level 61. 21 Return to debug level 60. 22 Return to debug level 59. 23 Return to debug level 58. 24 Return to debug level 57. 25 Return to debug level 56. 26 Return to debug level 55. 27 Return to debug level 54. 28 Return to debug level 53. 29 Return to debug level 52. 30 Return to debug level 51. 31 Return to debug level 50. 32 Return to debug level 49. 33 Return to debug level 48. 34 Return to debug level 47. 35 Return to debug level 46. 36 Return to debug level 45. 37 Return to debug level 44. 38 Return to debug level 43. 39 Return to debug level 42. 40 Return to debug level 41. 41 Return to debug level 40. 42 Return to debug level 39. 43 Return to debug level 38. 44 Return to debug level 37. 45 Return to debug level 36. 46 Return to debug level 35. 47 Return to debug level 34. 48 Return to debug level 33. 49 Return to debug level 32. 50 Return to debug level 31. 51 Return to debug level 30. 52 Return to debug level 29. 53 Return to debug level 28. 54 Return to debug level 27. 55 Return to debug level 26. 56 Return to debug level 25. 57 Return to debug level 24. 58 Return to debug level 23. 59 Return to debug level 22. 60 Return to debug level 21. 61 Return to debug level 20. 62 Return to debug level 19. 63 Return to debug level 18. 64 Return to debug level 17. 65 Return to debug level 16. 66 Return to debug level 15. 67 Return to debug level 14. 68 Return to debug level 13. 69 Return to debug level 12. 70 Return to debug level 11. 71 Return to debug level 10. 72 Return to debug level 9. 73 Return to debug level 8. 74 Return to debug level 7. 75 Return to debug level 6. 76 Return to debug level 5. 77 Return to debug level 4. 78 Return to debug level 3. 79 Return to debug level 2. 80 Return to debug level 1. 81 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 81. 2 Return to debug level 80. 3 Return to debug level 79. 4 Return to debug level 78. 5 Return to debug level 77. 6 Return to debug level 76. 7 Return to debug level 75. 8 Return to debug level 74. 9 Return to debug level 73. 10 Return to debug level 72. 11 Return to debug level 71. 12 Return to debug level 70. 13 Return to debug level 69. 14 Return to debug level 68. 15 Return to debug level 67. 16 Return to debug level 66. 17 Return to debug level 65. 18 Return to debug level 64. 19 Return to debug level 63. 20 Return to debug level 62. 21 Return to debug level 61. 22 Return to debug level 60. 23 Return to debug level 59. 24 Return to debug level 58. 25 Return to debug level 57. 26 Return to debug level 56. 27 Return to debug level 55. 28 Return to debug level 54. 29 Return to debug level 53. 30 Return to debug level 52. 31 Return to debug level 51. 32 Return to debug level 50. 33 Return to debug level 49. 34 Return to debug level 48. 35 Return to debug level 47. 36 Return to debug level 46. 37 Return to debug level 45. 38 Return to debug level 44. 39 Return to debug level 43. 40 Return to debug level 42. 41 Return to debug level 41. 42 Return to debug level 40. 43 Return to debug level 39. 44 Return to debug level 38. 45 Return to debug level 37. 46 Return to debug level 36. 47 Return to debug level 35. 48 Return to debug level 34. 49 Return to debug level 33. 50 Return to debug level 32. 51 Return to debug level 31. 52 Return to debug level 30. 53 Return to debug level 29. 54 Return to debug level 28. 55 Return to debug level 27. 56 Return to debug level 26. 57 Return to debug level 25. 58 Return to debug level 24. 59 Return to debug level 23. 60 Return to debug level 22. 61 Return to debug level 21. 62 Return to debug level 20. 63 Return to debug level 19. 64 Return to debug level 18. 65 Return to debug level 17. 66 Return to debug level 16. 67 Return to debug level 15. 68 Return to debug level 14. 69 Return to debug level 13. 70 Return to debug level 12. 71 Return to debug level 11. 72 Return to debug level 10. 73 Return to debug level 9. 74 Return to debug level 8. 75 Return to debug level 7. 76 Return to debug level 6. 77 Return to debug level 5. 78 Return to debug level 4. 79 Return to debug level 3. 80 Return to debug level 2. 81 Return to debug level 1. 82 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 82. 2 Return to debug level 81. 3 Return to debug level 80. 4 Return to debug level 79. 5 Return to debug level 78. 6 Return to debug level 77. 7 Return to debug level 76. 8 Return to debug level 75. 9 Return to debug level 74. 10 Return to debug level 73. 11 Return to debug level 72. 12 Return to debug level 71. 13 Return to debug level 70. 14 Return to debug level 69. 15 Return to debug level 68. 16 Return to debug level 67. 17 Return to debug level 66. 18 Return to debug level 65. 19 Return to debug level 64. 20 Return to debug level 63. 21 Return to debug level 62. 22 Return to debug level 61. 23 Return to debug level 60. 24 Return to debug level 59. 25 Return to debug level 58. 26 Return to debug level 57. 27 Return to debug level 56. 28 Return to debug level 55. 29 Return to debug level 54. 30 Return to debug level 53. 31 Return to debug level 52. 32 Return to debug level 51. 33 Return to debug level 50. 34 Return to debug level 49. 35 Return to debug level 48. 36 Return to debug level 47. 37 Return to debug level 46. 38 Return to debug level 45. 39 Return to debug level 44. 40 Return to debug level 43. 41 Return to debug level 42. 42 Return to debug level 41. 43 Return to debug level 40. 44 Return to debug level 39. 45 Return to debug level 38. 46 Return to debug level 37. 47 Return to debug level 36. 48 Return to debug level 35. 49 Return to debug level 34. 50 Return to debug level 33. 51 Return to debug level 32. 52 Return to debug level 31. 53 Return to debug level 30. 54 Return to debug level 29. 55 Return to debug level 28. 56 Return to debug level 27. 57 Return to debug level 26. 58 Return to debug level 25. 59 Return to debug level 24. 60 Return to debug level 23. 61 Return to debug level 22. 62 Return to debug level 21. 63 Return to debug level 20. 64 Return to debug level 19. 65 Return to debug level 18. 66 Return to debug level 17. 67 Return to debug level 16. 68 Return to debug level 15. 69 Return to debug level 14. 70 Return to debug level 13. 71 Return to debug level 12. 72 Return to debug level 11. 73 Return to debug level 10. 74 Return to debug level 9. 75 Return to debug level 8. 76 Return to debug level 7. 77 Return to debug level 6. 78 Return to debug level 5. 79 Return to debug level 4. 80 Return to debug level 3. 81 Return to debug level 2. 82 Return to debug level 1. 83 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 83. 2 Return to debug level 82. 3 Return to debug level 81. 4 Return to debug level 80. 5 Return to debug level 79. 6 Return to debug level 78. 7 Return to debug level 77. 8 Return to debug level 76. 9 Return to debug level 75. 10 Return to debug level 74. 11 Return to debug level 73. 12 Return to debug level 72. 13 Return to debug level 71. 14 Return to debug level 70. 15 Return to debug level 69. 16 Return to debug level 68. 17 Return to debug level 67. 18 Return to debug level 66. 19 Return to debug level 65. 20 Return to debug level 64. 21 Return to debug level 63. 22 Return to debug level 62. 23 Return to debug level 61. 24 Return to debug level 60. 25 Return to debug level 59. 26 Return to debug level 58. 27 Return to debug level 57. 28 Return to debug level 56. 29 Return to debug level 55. 30 Return to debug level 54. 31 Return to debug level 53. 32 Return to debug level 52. 33 Return to debug level 51. 34 Return to debug level 50. 35 Return to debug level 49. 36 Return to debug level 48. 37 Return to debug level 47. 38 Return to debug level 46. 39 Return to debug level 45. 40 Return to debug level 44. 41 Return to debug level 43. 42 Return to debug level 42. 43 Return to debug level 41. 44 Return to debug level 40. 45 Return to debug level 39. 46 Return to debug level 38. 47 Return to debug level 37. 48 Return to debug level 36. 49 Return to debug level 35. 50 Return to debug level 34. 51 Return to debug level 33. 52 Return to debug level 32. 53 Return to debug level 31. 54 Return to debug level 30. 55 Return to debug level 29. 56 Return to debug level 28. 57 Return to debug level 27. 58 Return to debug level 26. 59 Return to debug level 25. 60 Return to debug level 24. 61 Return to debug level 23. 62 Return to debug level 22. 63 Return to debug level 21. 64 Return to debug level 20. 65 Return to debug level 19. 66 Return to debug level 18. 67 Return to debug level 17. 68 Return to debug level 16. 69 Return to debug level 15. 70 Return to debug level 14. 71 Return to debug level 13. 72 Return to debug level 12. 73 Return to debug level 11. 74 Return to debug level 10. 75 Return to debug level 9. 76 Return to debug level 8. 77 Return to debug level 7. 78 Return to debug level 6. 79 Return to debug level 5. 80 Return to debug level 4. 81 Return to debug level 3. 82 Return to debug level 2. 83 Return to debug level 1. 84 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 84. 2 Return to debug level 83. 3 Return to debug level 82. 4 Return to debug level 81. 5 Return to debug level 80. 6 Return to debug level 79. 7 Return to debug level 78. 8 Return to debug level 77. 9 Return to debug level 76. 10 Return to debug level 75. 11 Return to debug level 74. 12 Return to debug level 73. 13 Return to debug level 72. 14 Return to debug level 71. 15 Return to debug level 70. 16 Return to debug level 69. 17 Return to debug level 68. 18 Return to debug level 67. 19 Return to debug level 66. 20 Return to debug level 65. 21 Return to debug level 64. 22 Return to debug level 63. 23 Return to debug level 62. 24 Return to debug level 61. 25 Return to debug level 60. 26 Return to debug level 59. 27 Return to debug level 58. 28 Return to debug level 57. 29 Return to debug level 56. 30 Return to debug level 55. 31 Return to debug level 54. 32 Return to debug level 53. 33 Return to debug level 52. 34 Return to debug level 51. 35 Return to debug level 50. 36 Return to debug level 49. 37 Return to debug level 48. 38 Return to debug level 47. 39 Return to debug level 46. 40 Return to debug level 45. 41 Return to debug level 44. 42 Return to debug level 43. 43 Return to debug level 42. 44 Return to debug level 41. 45 Return to debug level 40. 46 Return to debug level 39. 47 Return to debug level 38. 48 Return to debug level 37. 49 Return to debug level 36. 50 Return to debug level 35. 51 Return to debug level 34. 52 Return to debug level 33. 53 Return to debug level 32. 54 Return to debug level 31. 55 Return to debug level 30. 56 Return to debug level 29. 57 Return to debug level 28. 58 Return to debug level 27. 59 Return to debug level 26. 60 Return to debug level 25. 61 Return to debug level 24. 62 Return to debug level 23. 63 Return to debug level 22. 64 Return to debug level 21. 65 Return to debug level 20. 66 Return to debug level 19. 67 Return to debug level 18. 68 Return to debug level 17. 69 Return to debug level 16. 70 Return to debug level 15. 71 Return to debug level 14. 72 Return to debug level 13. 73 Return to debug level 12. 74 Return to debug level 11. 75 Return to debug level 10. 76 Return to debug level 9. 77 Return to debug level 8. 78 Return to debug level 7. 79 Return to debug level 6. 80 Return to debug level 5. 81 Return to debug level 4. 82 Return to debug level 3. 83 Return to debug level 2. 84 Return to debug level 1. 85 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 85. 2 Return to debug level 84. 3 Return to debug level 83. 4 Return to debug level 82. 5 Return to debug level 81. 6 Return to debug level 80. 7 Return to debug level 79. 8 Return to debug level 78. 9 Return to debug level 77. 10 Return to debug level 76. 11 Return to debug level 75. 12 Return to debug level 74. 13 Return to debug level 73. 14 Return to debug level 72. 15 Return to debug level 71. 16 Return to debug level 70. 17 Return to debug level 69. 18 Return to debug level 68. 19 Return to debug level 67. 20 Return to debug level 66. 21 Return to debug level 65. 22 Return to debug level 64. 23 Return to debug level 63. 24 Return to debug level 62. 25 Return to debug level 61. 26 Return to debug level 60. 27 Return to debug level 59. 28 Return to debug level 58. 29 Return to debug level 57. 30 Return to debug level 56. 31 Return to debug level 55. 32 Return to debug level 54. 33 Return to debug level 53. 34 Return to debug level 52. 35 Return to debug level 51. 36 Return to debug level 50. 37 Return to debug level 49. 38 Return to debug level 48. 39 Return to debug level 47. 40 Return to debug level 46. 41 Return to debug level 45. 42 Return to debug level 44. 43 Return to debug level 43. 44 Return to debug level 42. 45 Return to debug level 41. 46 Return to debug level 40. 47 Return to debug level 39. 48 Return to debug level 38. 49 Return to debug level 37. 50 Return to debug level 36. 51 Return to debug level 35. 52 Return to debug level 34. 53 Return to debug level 33. 54 Return to debug level 32. 55 Return to debug level 31. 56 Return to debug level 30. 57 Return to debug level 29. 58 Return to debug level 28. 59 Return to debug level 27. 60 Return to debug level 26. 61 Return to debug level 25. 62 Return to debug level 24. 63 Return to debug level 23. 64 Return to debug level 22. 65 Return to debug level 21. 66 Return to debug level 20. 67 Return to debug level 19. 68 Return to debug level 18. 69 Return to debug level 17. 70 Return to debug level 16. 71 Return to debug level 15. 72 Return to debug level 14. 73 Return to debug level 13. 74 Return to debug level 12. 75 Return to debug level 11. 76 Return to debug level 10. 77 Return to debug level 9. 78 Return to debug level 8. 79 Return to debug level 7. 80 Return to debug level 6. 81 Return to debug level 5. 82 Return to debug level 4. 83 Return to debug level 3. 84 Return to debug level 2. 85 Return to debug level 1. 86 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 86. 2 Return to debug level 85. 3 Return to debug level 84. 4 Return to debug level 83. 5 Return to debug level 82. 6 Return to debug level 81. 7 Return to debug level 80. 8 Return to debug level 79. 9 Return to debug level 78. 10 Return to debug level 77. 11 Return to debug level 76. 12 Return to debug level 75. 13 Return to debug level 74. 14 Return to debug level 73. 15 Return to debug level 72. 16 Return to debug level 71. 17 Return to debug level 70. 18 Return to debug level 69. 19 Return to debug level 68. 20 Return to debug level 67. 21 Return to debug level 66. 22 Return to debug level 65. 23 Return to debug level 64. 24 Return to debug level 63. 25 Return to debug level 62. 26 Return to debug level 61. 27 Return to debug level 60. 28 Return to debug level 59. 29 Return to debug level 58. 30 Return to debug level 57. 31 Return to debug level 56. 32 Return to debug level 55. 33 Return to debug level 54. 34 Return to debug level 53. 35 Return to debug level 52. 36 Return to debug level 51. 37 Return to debug level 50. 38 Return to debug level 49. 39 Return to debug level 48. 40 Return to debug level 47. 41 Return to debug level 46. 42 Return to debug level 45. 43 Return to debug level 44. 44 Return to debug level 43. 45 Return to debug level 42. 46 Return to debug level 41. 47 Return to debug level 40. 48 Return to debug level 39. 49 Return to debug level 38. 50 Return to debug level 37. 51 Return to debug level 36. 52 Return to debug level 35. 53 Return to debug level 34. 54 Return to debug level 33. 55 Return to debug level 32. 56 Return to debug level 31. 57 Return to debug level 30. 58 Return to debug level 29. 59 Return to debug level 28. 60 Return to debug level 27. 61 Return to debug level 26. 62 Return to debug level 25. 63 Return to debug level 24. 64 Return to debug level 23. 65 Return to debug level 22. 66 Return to debug level 21. 67 Return to debug level 20. 68 Return to debug level 19. 69 Return to debug level 18. 70 Return to debug level 17. 71 Return to debug level 16. 72 Return to debug level 15. 73 Return to debug level 14. 74 Return to debug level 13. 75 Return to debug level 12. 76 Return to debug level 11. 77 Return to debug level 10. 78 Return to debug level 9. 79 Return to debug level 8. 80 Return to debug level 7. 81 Return to debug level 6. 82 Return to debug level 5. 83 Return to debug level 4. 84 Return to debug level 3. 85 Return to debug level 2. 86 Return to debug level 1. 87 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 87. 2 Return to debug level 86. 3 Return to debug level 85. 4 Return to debug level 84. 5 Return to debug level 83. 6 Return to debug level 82. 7 Return to debug level 81. 8 Return to debug level 80. 9 Return to debug level 79. 10 Return to debug level 78. 11 Return to debug level 77. 12 Return to debug level 76. 13 Return to debug level 75. 14 Return to debug level 74. 15 Return to debug level 73. 16 Return to debug level 72. 17 Return to debug level 71. 18 Return to debug level 70. 19 Return to debug level 69. 20 Return to debug level 68. 21 Return to debug level 67. 22 Return to debug level 66. 23 Return to debug level 65. 24 Return to debug level 64. 25 Return to debug level 63. 26 Return to debug level 62. 27 Return to debug level 61. 28 Return to debug level 60. 29 Return to debug level 59. 30 Return to debug level 58. 31 Return to debug level 57. 32 Return to debug level 56. 33 Return to debug level 55. 34 Return to debug level 54. 35 Return to debug level 53. 36 Return to debug level 52. 37 Return to debug level 51. 38 Return to debug level 50. 39 Return to debug level 49. 40 Return to debug level 48. 41 Return to debug level 47. 42 Return to debug level 46. 43 Return to debug level 45. 44 Return to debug level 44. 45 Return to debug level 43. 46 Return to debug level 42. 47 Return to debug level 41. 48 Return to debug level 40. 49 Return to debug level 39. 50 Return to debug level 38. 51 Return to debug level 37. 52 Return to debug level 36. 53 Return to debug level 35. 54 Return to debug level 34. 55 Return to debug level 33. 56 Return to debug level 32. 57 Return to debug level 31. 58 Return to debug level 30. 59 Return to debug level 29. 60 Return to debug level 28. 61 Return to debug level 27. 62 Return to debug level 26. 63 Return to debug level 25. 64 Return to debug level 24. 65 Return to debug level 23. 66 Return to debug level 22. 67 Return to debug level 21. 68 Return to debug level 20. 69 Return to debug level 19. 70 Return to debug level 18. 71 Return to debug level 17. 72 Return to debug level 16. 73 Return to debug level 15. 74 Return to debug level 14. 75 Return to debug level 13. 76 Return to debug level 12. 77 Return to debug level 11. 78 Return to debug level 10. 79 Return to debug level 9. 80 Return to debug level 8. 81 Return to debug level 7. 82 Return to debug level 6. 83 Return to debug level 5. 84 Return to debug level 4. 85 Return to debug level 3. 86 Return to debug level 2. 87 Return to debug level 1. 88 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 88. 2 Return to debug level 87. 3 Return to debug level 86. 4 Return to debug level 85. 5 Return to debug level 84. 6 Return to debug level 83. 7 Return to debug level 82. 8 Return to debug level 81. 9 Return to debug level 80. 10 Return to debug level 79. 11 Return to debug level 78. 12 Return to debug level 77. 13 Return to debug level 76. 14 Return to debug level 75. 15 Return to debug level 74. 16 Return to debug level 73. 17 Return to debug level 72. 18 Return to debug level 71. 19 Return to debug level 70. 20 Return to debug level 69. 21 Return to debug level 68. 22 Return to debug level 67. 23 Return to debug level 66. 24 Return to debug level 65. 25 Return to debug level 64. 26 Return to debug level 63. 27 Return to debug level 62. 28 Return to debug level 61. 29 Return to debug level 60. 30 Return to debug level 59. 31 Return to debug level 58. 32 Return to debug level 57. 33 Return to debug level 56. 34 Return to debug level 55. 35 Return to debug level 54. 36 Return to debug level 53. 37 Return to debug level 52. 38 Return to debug level 51. 39 Return to debug level 50. 40 Return to debug level 49. 41 Return to debug level 48. 42 Return to debug level 47. 43 Return to debug level 46. 44 Return to debug level 45. 45 Return to debug level 44. 46 Return to debug level 43. 47 Return to debug level 42. 48 Return to debug level 41. 49 Return to debug level 40. 50 Return to debug level 39. 51 Return to debug level 38. 52 Return to debug level 37. 53 Return to debug level 36. 54 Return to debug level 35. 55 Return to debug level 34. 56 Return to debug level 33. 57 Return to debug level 32. 58 Return to debug level 31. 59 Return to debug level 30. 60 Return to debug level 29. 61 Return to debug level 28. 62 Return to debug level 27. 63 Return to debug level 26. 64 Return to debug level 25. 65 Return to debug level 24. 66 Return to debug level 23. 67 Return to debug level 22. 68 Return to debug level 21. 69 Return to debug level 20. 70 Return to debug level 19. 71 Return to debug level 18. 72 Return to debug level 17. 73 Return to debug level 16. 74 Return to debug level 15. 75 Return to debug level 14. 76 Return to debug level 13. 77 Return to debug level 12. 78 Return to debug level 11. 79 Return to debug level 10. 80 Return to debug level 9. 81 Return to debug level 8. 82 Return to debug level 7. 83 Return to debug level 6. 84 Return to debug level 5. 85 Return to debug level 4. 86 Return to debug level 3. 87 Return to debug level 2. 88 Return to debug level 1. 89 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 89. 2 Return to debug level 88. 3 Return to debug level 87. 4 Return to debug level 86. 5 Return to debug level 85. 6 Return to debug level 84. 7 Return to debug level 83. 8 Return to debug level 82. 9 Return to debug level 81. 10 Return to debug level 80. 11 Return to debug level 79. 12 Return to debug level 78. 13 Return to debug level 77. 14 Return to debug level 76. 15 Return to debug level 75. 16 Return to debug level 74. 17 Return to debug level 73. 18 Return to debug level 72. 19 Return to debug level 71. 20 Return to debug level 70. 21 Return to debug level 69. 22 Return to debug level 68. 23 Return to debug level 67. 24 Return to debug level 66. 25 Return to debug level 65. 26 Return to debug level 64. 27 Return to debug level 63. 28 Return to debug level 62. 29 Return to debug level 61. 30 Return to debug level 60. 31 Return to debug level 59. 32 Return to debug level 58. 33 Return to debug level 57. 34 Return to debug level 56. 35 Return to debug level 55. 36 Return to debug level 54. 37 Return to debug level 53. 38 Return to debug level 52. 39 Return to debug level 51. 40 Return to debug level 50. 41 Return to debug level 49. 42 Return to debug level 48. 43 Return to debug level 47. 44 Return to debug level 46. 45 Return to debug level 45. 46 Return to debug level 44. 47 Return to debug level 43. 48 Return to debug level 42. 49 Return to debug level 41. 50 Return to debug level 40. 51 Return to debug level 39. 52 Return to debug level 38. 53 Return to debug level 37. 54 Return to debug level 36. 55 Return to debug level 35. 56 Return to debug level 34. 57 Return to debug level 33. 58 Return to debug level 32. 59 Return to debug level 31. 60 Return to debug level 30. 61 Return to debug level 29. 62 Return to debug level 28. 63 Return to debug level 27. 64 Return to debug level 26. 65 Return to debug level 25. 66 Return to debug level 24. 67 Return to debug level 23. 68 Return to debug level 22. 69 Return to debug level 21. 70 Return to debug level 20. 71 Return to debug level 19. 72 Return to debug level 18. 73 Return to debug level 17. 74 Return to debug level 16. 75 Return to debug level 15. 76 Return to debug level 14. 77 Return to debug level 13. 78 Return to debug level 12. 79 Return to debug level 11. 80 Return to debug level 10. 81 Return to debug level 9. 82 Return to debug level 8. 83 Return to debug level 7. 84 Return to debug level 6. 85 Return to debug level 5. 86 Return to debug level 4. 87 Return to debug level 3. 88 Return to debug level 2. 89 Return to debug level 1. 90 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 90. 2 Return to debug level 89. 3 Return to debug level 88. 4 Return to debug level 87. 5 Return to debug level 86. 6 Return to debug level 85. 7 Return to debug level 84. 8 Return to debug level 83. 9 Return to debug level 82. 10 Return to debug level 81. 11 Return to debug level 80. 12 Return to debug level 79. 13 Return to debug level 78. 14 Return to debug level 77. 15 Return to debug level 76. 16 Return to debug level 75. 17 Return to debug level 74. 18 Return to debug level 73. 19 Return to debug level 72. 20 Return to debug level 71. 21 Return to debug level 70. 22 Return to debug level 69. 23 Return to debug level 68. 24 Return to debug level 67. 25 Return to debug level 66. 26 Return to debug level 65. 27 Return to debug level 64. 28 Return to debug level 63. 29 Return to debug level 62. 30 Return to debug level 61. 31 Return to debug level 60. 32 Return to debug level 59. 33 Return to debug level 58. 34 Return to debug level 57. 35 Return to debug level 56. 36 Return to debug level 55. 37 Return to debug level 54. 38 Return to debug level 53. 39 Return to debug level 52. 40 Return to debug level 51. 41 Return to debug level 50. 42 Return to debug level 49. 43 Return to debug level 48. 44 Return to debug level 47. 45 Return to debug level 46. 46 Return to debug level 45. 47 Return to debug level 44. 48 Return to debug level 43. 49 Return to debug level 42. 50 Return to debug level 41. 51 Return to debug level 40. 52 Return to debug level 39. 53 Return to debug level 38. 54 Return to debug level 37. 55 Return to debug level 36. 56 Return to debug level 35. 57 Return to debug level 34. 58 Return to debug level 33. 59 Return to debug level 32. 60 Return to debug level 31. 61 Return to debug level 30. 62 Return to debug level 29. 63 Return to debug level 28. 64 Return to debug level 27. 65 Return to debug level 26. 66 Return to debug level 25. 67 Return to debug level 24. 68 Return to debug level 23. 69 Return to debug level 22. 70 Return to debug level 21. 71 Return to debug level 20. 72 Return to debug level 19. 73 Return to debug level 18. 74 Return to debug level 17. 75 Return to debug level 16. 76 Return to debug level 15. 77 Return to debug level 14. 78 Return to debug level 13. 79 Return to debug level 12. 80 Return to debug level 11. 81 Return to debug level 10. 82 Return to debug level 9. 83 Return to debug level 8. 84 Return to debug level 7. 85 Return to debug level 6. 86 Return to debug level 5. 87 Return to debug level 4. 88 Return to debug level 3. 89 Return to debug level 2. 90 Return to debug level 1. 91 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 91. 2 Return to debug level 90. 3 Return to debug level 89. 4 Return to debug level 88. 5 Return to debug level 87. 6 Return to debug level 86. 7 Return to debug level 85. 8 Return to debug level 84. 9 Return to debug level 83. 10 Return to debug level 82. 11 Return to debug level 81. 12 Return to debug level 80. 13 Return to debug level 79. 14 Return to debug level 78. 15 Return to debug level 77. 16 Return to debug level 76. 17 Return to debug level 75. 18 Return to debug level 74. 19 Return to debug level 73. 20 Return to debug level 72. 21 Return to debug level 71. 22 Return to debug level 70. 23 Return to debug level 69. 24 Return to debug level 68. 25 Return to debug level 67. 26 Return to debug level 66. 27 Return to debug level 65. 28 Return to debug level 64. 29 Return to debug level 63. 30 Return to debug level 62. 31 Return to debug level 61. 32 Return to debug level 60. 33 Return to debug level 59. 34 Return to debug level 58. 35 Return to debug level 57. 36 Return to debug level 56. 37 Return to debug level 55. 38 Return to debug level 54. 39 Return to debug level 53. 40 Return to debug level 52. 41 Return to debug level 51. 42 Return to debug level 50. 43 Return to debug level 49. 44 Return to debug level 48. 45 Return to debug level 47. 46 Return to debug level 46. 47 Return to debug level 45. 48 Return to debug level 44. 49 Return to debug level 43. 50 Return to debug level 42. 51 Return to debug level 41. 52 Return to debug level 40. 53 Return to debug level 39. 54 Return to debug level 38. 55 Return to debug level 37. 56 Return to debug level 36. 57 Return to debug level 35. 58 Return to debug level 34. 59 Return to debug level 33. 60 Return to debug level 32. 61 Return to debug level 31. 62 Return to debug level 30. 63 Return to debug level 29. 64 Return to debug level 28. 65 Return to debug level 27. 66 Return to debug level 26. 67 Return to debug level 25. 68 Return to debug level 24. 69 Return to debug level 23. 70 Return to debug level 22. 71 Return to debug level 21. 72 Return to debug level 20. 73 Return to debug level 19. 74 Return to debug level 18. 75 Return to debug level 17. 76 Return to debug level 16. 77 Return to debug level 15. 78 Return to debug level 14. 79 Return to debug level 13. 80 Return to debug level 12. 81 Return to debug level 11. 82 Return to debug level 10. 83 Return to debug level 9. 84 Return to debug level 8. 85 Return to debug level 7. 86 Return to debug level 6. 87 Return to debug level 5. 88 Return to debug level 4. 89 Return to debug level 3. 90 Return to debug level 2. 91 Return to debug level 1. 92 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 92. 2 Return to debug level 91. 3 Return to debug level 90. 4 Return to debug level 89. 5 Return to debug level 88. 6 Return to debug level 87. 7 Return to debug level 86. 8 Return to debug level 85. 9 Return to debug level 84. 10 Return to debug level 83. 11 Return to debug level 82. 12 Return to debug level 81. 13 Return to debug level 80. 14 Return to debug level 79. 15 Return to debug level 78. 16 Return to debug level 77. 17 Return to debug level 76. 18 Return to debug level 75. 19 Return to debug level 74. 20 Return to debug level 73. 21 Return to debug level 72. 22 Return to debug level 71. 23 Return to debug level 70. 24 Return to debug level 69. 25 Return to debug level 68. 26 Return to debug level 67. 27 Return to debug level 66. 28 Return to debug level 65. 29 Return to debug level 64. 30 Return to debug level 63. 31 Return to debug level 62. 32 Return to debug level 61. 33 Return to debug level 60. 34 Return to debug level 59. 35 Return to debug level 58. 36 Return to debug level 57. 37 Return to debug level 56. 38 Return to debug level 55. 39 Return to debug level 54. 40 Return to debug level 53. 41 Return to debug level 52. 42 Return to debug level 51. 43 Return to debug level 50. 44 Return to debug level 49. 45 Return to debug level 48. 46 Return to debug level 47. 47 Return to debug level 46. 48 Return to debug level 45. 49 Return to debug level 44. 50 Return to debug level 43. 51 Return to debug level 42. 52 Return to debug level 41. 53 Return to debug level 40. 54 Return to debug level 39. 55 Return to debug level 38. 56 Return to debug level 37. 57 Return to debug level 36. 58 Return to debug level 35. 59 Return to debug level 34. 60 Return to debug level 33. 61 Return to debug level 32. 62 Return to debug level 31. 63 Return to debug level 30. 64 Return to debug level 29. 65 Return to debug level 28. 66 Return to debug level 27. 67 Return to debug level 26. 68 Return to debug level 25. 69 Return to debug level 24. 70 Return to debug level 23. 71 Return to debug level 22. 72 Return to debug level 21. 73 Return to debug level 20. 74 Return to debug level 19. 75 Return to debug level 18. 76 Return to debug level 17. 77 Return to debug level 16. 78 Return to debug level 15. 79 Return to debug level 14. 80 Return to debug level 13. 81 Return to debug level 12. 82 Return to debug level 11. 83 Return to debug level 10. 84 Return to debug level 9. 85 Return to debug level 8. 86 Return to debug level 7. 87 Return to debug level 6. 88 Return to debug level 5. 89 Return to debug level 4. 90 Return to debug level 3. 91 Return to debug level 2. 92 Return to debug level 1. 93 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 93. 2 Return to debug level 92. 3 Return to debug level 91. 4 Return to debug level 90. 5 Return to debug level 89. 6 Return to debug level 88. 7 Return to debug level 87. 8 Return to debug level 86. 9 Return to debug level 85. 10 Return to debug level 84. 11 Return to debug level 83. 12 Return to debug level 82. 13 Return to debug level 81. 14 Return to debug level 80. 15 Return to debug level 79. 16 Return to debug level 78. 17 Return to debug level 77. 18 Return to debug level 76. 19 Return to debug level 75. 20 Return to debug level 74. 21 Return to debug level 73. 22 Return to debug level 72. 23 Return to debug level 71. 24 Return to debug level 70. 25 Return to debug level 69. 26 Return to debug level 68. 27 Return to debug level 67. 28 Return to debug level 66. 29 Return to debug level 65. 30 Return to debug level 64. 31 Return to debug level 63. 32 Return to debug level 62. 33 Return to debug level 61. 34 Return to debug level 60. 35 Return to debug level 59. 36 Return to debug level 58. 37 Return to debug level 57. 38 Return to debug level 56. 39 Return to debug level 55. 40 Return to debug level 54. 41 Return to debug level 53. 42 Return to debug level 52. 43 Return to debug level 51. 44 Return to debug level 50. 45 Return to debug level 49. 46 Return to debug level 48. 47 Return to debug level 47. 48 Return to debug level 46. 49 Return to debug level 45. 50 Return to debug level 44. 51 Return to debug level 43. 52 Return to debug level 42. 53 Return to debug level 41. 54 Return to debug level 40. 55 Return to debug level 39. 56 Return to debug level 38. 57 Return to debug level 37. 58 Return to debug level 36. 59 Return to debug level 35. 60 Return to debug level 34. 61 Return to debug level 33. 62 Return to debug level 32. 63 Return to debug level 31. 64 Return to debug level 30. 65 Return to debug level 29. 66 Return to debug level 28. 67 Return to debug level 27. 68 Return to debug level 26. 69 Return to debug level 25. 70 Return to debug level 24. 71 Return to debug level 23. 72 Return to debug level 22. 73 Return to debug level 21. 74 Return to debug level 20. 75 Return to debug level 19. 76 Return to debug level 18. 77 Return to debug level 17. 78 Return to debug level 16. 79 Return to debug level 15. 80 Return to debug level 14. 81 Return to debug level 13. 82 Return to debug level 12. 83 Return to debug level 11. 84 Return to debug level 10. 85 Return to debug level 9. 86 Return to debug level 8. 87 Return to debug level 7. 88 Return to debug level 6. 89 Return to debug level 5. 90 Return to debug level 4. 91 Return to debug level 3. 92 Return to debug level 2. 93 Return to debug level 1. 94 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 94. 2 Return to debug level 93. 3 Return to debug level 92. 4 Return to debug level 91. 5 Return to debug level 90. 6 Return to debug level 89. 7 Return to debug level 88. 8 Return to debug level 87. 9 Return to debug level 86. 10 Return to debug level 85. 11 Return to debug level 84. 12 Return to debug level 83. 13 Return to debug level 82. 14 Return to debug level 81. 15 Return to debug level 80. 16 Return to debug level 79. 17 Return to debug level 78. 18 Return to debug level 77. 19 Return to debug level 76. 20 Return to debug level 75. 21 Return to debug level 74. 22 Return to debug level 73. 23 Return to debug level 72. 24 Return to debug level 71. 25 Return to debug level 70. 26 Return to debug level 69. 27 Return to debug level 68. 28 Return to debug level 67. 29 Return to debug level 66. 30 Return to debug level 65. 31 Return to debug level 64. 32 Return to debug level 63. 33 Return to debug level 62. 34 Return to debug level 61. 35 Return to debug level 60. 36 Return to debug level 59. 37 Return to debug level 58. 38 Return to debug level 57. 39 Return to debug level 56. 40 Return to debug level 55. 41 Return to debug level 54. 42 Return to debug level 53. 43 Return to debug level 52. 44 Return to debug level 51. 45 Return to debug level 50. 46 Return to debug level 49. 47 Return to debug level 48. 48 Return to debug level 47. 49 Return to debug level 46. 50 Return to debug level 45. 51 Return to debug level 44. 52 Return to debug level 43. 53 Return to debug level 42. 54 Return to debug level 41. 55 Return to debug level 40. 56 Return to debug level 39. 57 Return to debug level 38. 58 Return to debug level 37. 59 Return to debug level 36. 60 Return to debug level 35. 61 Return to debug level 34. 62 Return to debug level 33. 63 Return to debug level 32. 64 Return to debug level 31. 65 Return to debug level 30. 66 Return to debug level 29. 67 Return to debug level 28. 68 Return to debug level 27. 69 Return to debug level 26. 70 Return to debug level 25. 71 Return to debug level 24. 72 Return to debug level 23. 73 Return to debug level 22. 74 Return to debug level 21. 75 Return to debug level 20. 76 Return to debug level 19. 77 Return to debug level 18. 78 Return to debug level 17. 79 Return to debug level 16. 80 Return to debug level 15. 81 Return to debug level 14. 82 Return to debug level 13. 83 Return to debug level 12. 84 Return to debug level 11. 85 Return to debug level 10. 86 Return to debug level 9. 87 Return to debug level 8. 88 Return to debug level 7. 89 Return to debug level 6. 90 Return to debug level 5. 91 Return to debug level 4. 92 Return to debug level 3. 93 Return to debug level 2. 94 Return to debug level 1. 95 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 95. 2 Return to debug level 94. 3 Return to debug level 93. 4 Return to debug level 92. 5 Return to debug level 91. 6 Return to debug level 90. 7 Return to debug level 89. 8 Return to debug level 88. 9 Return to debug level 87. 10 Return to debug level 86. 11 Return to debug level 85. 12 Return to debug level 84. 13 Return to debug level 83. 14 Return to debug level 82. 15 Return to debug level 81. 16 Return to debug level 80. 17 Return to debug level 79. 18 Return to debug level 78. 19 Return to debug level 77. 20 Return to debug level 76. 21 Return to debug level 75. 22 Return to debug level 74. 23 Return to debug level 73. 24 Return to debug level 72. 25 Return to debug level 71. 26 Return to debug level 70. 27 Return to debug level 69. 28 Return to debug level 68. 29 Return to debug level 67. 30 Return to debug level 66. 31 Return to debug level 65. 32 Return to debug level 64. 33 Return to debug level 63. 34 Return to debug level 62. 35 Return to debug level 61. 36 Return to debug level 60. 37 Return to debug level 59. 38 Return to debug level 58. 39 Return to debug level 57. 40 Return to debug level 56. 41 Return to debug level 55. 42 Return to debug level 54. 43 Return to debug level 53. 44 Return to debug level 52. 45 Return to debug level 51. 46 Return to debug level 50. 47 Return to debug level 49. 48 Return to debug level 48. 49 Return to debug level 47. 50 Return to debug level 46. 51 Return to debug level 45. 52 Return to debug level 44. 53 Return to debug level 43. 54 Return to debug level 42. 55 Return to debug level 41. 56 Return to debug level 40. 57 Return to debug level 39. 58 Return to debug level 38. 59 Return to debug level 37. 60 Return to debug level 36. 61 Return to debug level 35. 62 Return to debug level 34. 63 Return to debug level 33. 64 Return to debug level 32. 65 Return to debug level 31. 66 Return to debug level 30. 67 Return to debug level 29. 68 Return to debug level 28. 69 Return to debug level 27. 70 Return to debug level 26. 71 Return to debug level 25. 72 Return to debug level 24. 73 Return to debug level 23. 74 Return to debug level 22. 75 Return to debug level 21. 76 Return to debug level 20. 77 Return to debug level 19. 78 Return to debug level 18. 79 Return to debug level 17. 80 Return to debug level 16. 81 Return to debug level 15. 82 Return to debug level 14. 83 Return to debug level 13. 84 Return to debug level 12. 85 Return to debug level 11. 86 Return to debug level 10. 87 Return to debug level 9. 88 Return to debug level 8. 89 Return to debug level 7. 90 Return to debug level 6. 91 Return to debug level 5. 92 Return to debug level 4. 93 Return to debug level 3. 94 Return to debug level 2. 95 Return to debug level 1. 96 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 96. 2 Return to debug level 95. 3 Return to debug level 94. 4 Return to debug level 93. 5 Return to debug level 92. 6 Return to debug level 91. 7 Return to debug level 90. 8 Return to debug level 89. 9 Return to debug level 88. 10 Return to debug level 87. 11 Return to debug level 86. 12 Return to debug level 85. 13 Return to debug level 84. 14 Return to debug level 83. 15 Return to debug level 82. 16 Return to debug level 81. 17 Return to debug level 80. 18 Return to debug level 79. 19 Return to debug level 78. 20 Return to debug level 77. 21 Return to debug level 76. 22 Return to debug level 75. 23 Return to debug level 74. 24 Return to debug level 73. 25 Return to debug level 72. 26 Return to debug level 71. 27 Return to debug level 70. 28 Return to debug level 69. 29 Return to debug level 68. 30 Return to debug level 67. 31 Return to debug level 66. 32 Return to debug level 65. 33 Return to debug level 64. 34 Return to debug level 63. 35 Return to debug level 62. 36 Return to debug level 61. 37 Return to debug level 60. 38 Return to debug level 59. 39 Return to debug level 58. 40 Return to debug level 57. 41 Return to debug level 56. 42 Return to debug level 55. 43 Return to debug level 54. 44 Return to debug level 53. 45 Return to debug level 52. 46 Return to debug level 51. 47 Return to debug level 50. 48 Return to debug level 49. 49 Return to debug level 48. 50 Return to debug level 47. 51 Return to debug level 46. 52 Return to debug level 45. 53 Return to debug level 44. 54 Return to debug level 43. 55 Return to debug level 42. 56 Return to debug level 41. 57 Return to debug level 40. 58 Return to debug level 39. 59 Return to debug level 38. 60 Return to debug level 37. 61 Return to debug level 36. 62 Return to debug level 35. 63 Return to debug level 34. 64 Return to debug level 33. 65 Return to debug level 32. 66 Return to debug level 31. 67 Return to debug level 30. 68 Return to debug level 29. 69 Return to debug level 28. 70 Return to debug level 27. 71 Return to debug level 26. 72 Return to debug level 25. 73 Return to debug level 24. 74 Return to debug level 23. 75 Return to debug level 22. 76 Return to debug level 21. 77 Return to debug level 20. 78 Return to debug level 19. 79 Return to debug level 18. 80 Return to debug level 17. 81 Return to debug level 16. 82 Return to debug level 15. 83 Return to debug level 14. 84 Return to debug level 13. 85 Return to debug level 12. 86 Return to debug level 11. 87 Return to debug level 10. 88 Return to debug level 9. 89 Return to debug level 8. 90 Return to debug level 7. 91 Return to debug level 6. 92 Return to debug level 5. 93 Return to debug level 4. 94 Return to debug level 3. 95 Return to debug level 2. 96 Return to debug level 1. 97 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 97. 2 Return to debug level 96. 3 Return to debug level 95. 4 Return to debug level 94. 5 Return to debug level 93. 6 Return to debug level 92. 7 Return to debug level 91. 8 Return to debug level 90. 9 Return to debug level 89. 10 Return to debug level 88. 11 Return to debug level 87. 12 Return to debug level 86. 13 Return to debug level 85. 14 Return to debug level 84. 15 Return to debug level 83. 16 Return to debug level 82. 17 Return to debug level 81. 18 Return to debug level 80. 19 Return to debug level 79. 20 Return to debug level 78. 21 Return to debug level 77. 22 Return to debug level 76. 23 Return to debug level 75. 24 Return to debug level 74. 25 Return to debug level 73. 26 Return to debug level 72. 27 Return to debug level 71. 28 Return to debug level 70. 29 Return to debug level 69. 30 Return to debug level 68. 31 Return to debug level 67. 32 Return to debug level 66. 33 Return to debug level 65. 34 Return to debug level 64. 35 Return to debug level 63. 36 Return to debug level 62. 37 Return to debug level 61. 38 Return to debug level 60. 39 Return to debug level 59. 40 Return to debug level 58. 41 Return to debug level 57. 42 Return to debug level 56. 43 Return to debug level 55. 44 Return to debug level 54. 45 Return to debug level 53. 46 Return to debug level 52. 47 Return to debug level 51. 48 Return to debug level 50. 49 Return to debug level 49. 50 Return to debug level 48. 51 Return to debug level 47. 52 Return to debug level 46. 53 Return to debug level 45. 54 Return to debug level 44. 55 Return to debug level 43. 56 Return to debug level 42. 57 Return to debug level 41. 58 Return to debug level 40. 59 Return to debug level 39. 60 Return to debug level 38. 61 Return to debug level 37. 62 Return to debug level 36. 63 Return to debug level 35. 64 Return to debug level 34. 65 Return to debug level 33. 66 Return to debug level 32. 67 Return to debug level 31. 68 Return to debug level 30. 69 Return to debug level 29. 70 Return to debug level 28. 71 Return to debug level 27. 72 Return to debug level 26. 73 Return to debug level 25. 74 Return to debug level 24. 75 Return to debug level 23. 76 Return to debug level 22. 77 Return to debug level 21. 78 Return to debug level 20. 79 Return to debug level 19. 80 Return to debug level 18. 81 Return to debug level 17. 82 Return to debug level 16. 83 Return to debug level 15. 84 Return to debug level 14. 85 Return to debug level 13. 86 Return to debug level 12. 87 Return to debug level 11. 88 Return to debug level 10. 89 Return to debug level 9. 90 Return to debug level 8. 91 Return to debug level 7. 92 Return to debug level 6. 93 Return to debug level 5. 94 Return to debug level 4. 95 Return to debug level 3. 96 Return to debug level 2. 97 Return to debug level 1. 98 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 98. 2 Return to debug level 97. 3 Return to debug level 96. 4 Return to debug level 95. 5 Return to debug level 94. 6 Return to debug level 93. 7 Return to debug level 92. 8 Return to debug level 91. 9 Return to debug level 90. 10 Return to debug level 89. 11 Return to debug level 88. 12 Return to debug level 87. 13 Return to debug level 86. 14 Return to debug level 85. 15 Return to debug level 84. 16 Return to debug level 83. 17 Return to debug level 82. 18 Return to debug level 81. 19 Return to debug level 80. 20 Return to debug level 79. 21 Return to debug level 78. 22 Return to debug level 77. 23 Return to debug level 76. 24 Return to debug level 75. 25 Return to debug level 74. 26 Return to debug level 73. 27 Return to debug level 72. 28 Return to debug level 71. 29 Return to debug level 70. 30 Return to debug level 69. 31 Return to debug level 68. 32 Return to debug level 67. 33 Return to debug level 66. 34 Return to debug level 65. 35 Return to debug level 64. 36 Return to debug level 63. 37 Return to debug level 62. 38 Return to debug level 61. 39 Return to debug level 60. 40 Return to debug level 59. 41 Return to debug level 58. 42 Return to debug level 57. 43 Return to debug level 56. 44 Return to debug level 55. 45 Return to debug level 54. 46 Return to debug level 53. 47 Return to debug level 52. 48 Return to debug level 51. 49 Return to debug level 50. 50 Return to debug level 49. 51 Return to debug level 48. 52 Return to debug level 47. 53 Return to debug level 46. 54 Return to debug level 45. 55 Return to debug level 44. 56 Return to debug level 43. 57 Return to debug level 42. 58 Return to debug level 41. 59 Return to debug level 40. 60 Return to debug level 39. 61 Return to debug level 38. 62 Return to debug level 37. 63 Return to debug level 36. 64 Return to debug level 35. 65 Return to debug level 34. 66 Return to debug level 33. 67 Return to debug level 32. 68 Return to debug level 31. 69 Return to debug level 30. 70 Return to debug level 29. 71 Return to debug level 28. 72 Return to debug level 27. 73 Return to debug level 26. 74 Return to debug level 25. 75 Return to debug level 24. 76 Return to debug level 23. 77 Return to debug level 22. 78 Return to debug level 21. 79 Return to debug level 20. 80 Return to debug level 19. 81 Return to debug level 18. 82 Return to debug level 17. 83 Return to debug level 16. 84 Return to debug level 15. 85 Return to debug level 14. 86 Return to debug level 13. 87 Return to debug level 12. 88 Return to debug level 11. 89 Return to debug level 10. 90 Return to debug level 9. 91 Return to debug level 8. 92 Return to debug level 7. 93 Return to debug level 6. 94 Return to debug level 5. 95 Return to debug level 4. 96 Return to debug level 3. 97 Return to debug level 2. 98 Return to debug level 1. 99 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 99. 2 Return to debug level 98. 3 Return to debug level 97. 4 Return to debug level 96. 5 Return to debug level 95. 6 Return to debug level 94. 7 Return to debug level 93. 8 Return to debug level 92. 9 Return to debug level 91. 10 Return to debug level 90. 11 Return to debug level 89. 12 Return to debug level 88. 13 Return to debug level 87. 14 Return to debug level 86. 15 Return to debug level 85. 16 Return to debug level 84. 17 Return to debug level 83. 18 Return to debug level 82. 19 Return to debug level 81. 20 Return to debug level 80. 21 Return to debug level 79. 22 Return to debug level 78. 23 Return to debug level 77. 24 Return to debug level 76. 25 Return to debug level 75. 26 Return to debug level 74. 27 Return to debug level 73. 28 Return to debug level 72. 29 Return to debug level 71. 30 Return to debug level 70. 31 Return to debug level 69. 32 Return to debug level 68. 33 Return to debug level 67. 34 Return to debug level 66. 35 Return to debug level 65. 36 Return to debug level 64. 37 Return to debug level 63. 38 Return to debug level 62. 39 Return to debug level 61. 40 Return to debug level 60. 41 Return to debug level 59. 42 Return to debug level 58. 43 Return to debug level 57. 44 Return to debug level 56. 45 Return to debug level 55. 46 Return to debug level 54. 47 Return to debug level 53. 48 Return to debug level 52. 49 Return to debug level 51. 50 Return to debug level 50. 51 Return to debug level 49. 52 Return to debug level 48. 53 Return to debug level 47. 54 Return to debug level 46. 55 Return to debug level 45. 56 Return to debug level 44. 57 Return to debug level 43. 58 Return to debug level 42. 59 Return to debug level 41. 60 Return to debug level 40. 61 Return to debug level 39. 62 Return to debug level 38. 63 Return to debug level 37. 64 Return to debug level 36. 65 Return to debug level 35. 66 Return to debug level 34. 67 Return to debug level 33. 68 Return to debug level 32. 69 Return to debug level 31. 70 Return to debug level 30. 71 Return to debug level 29. 72 Return to debug level 28. 73 Return to debug level 27. 74 Return to debug level 26. 75 Return to debug level 25. 76 Return to debug level 24. 77 Return to debug level 23. 78 Return to debug level 22. 79 Return to debug level 21. 80 Return to debug level 20. 81 Return to debug level 19. 82 Return to debug level 18. 83 Return to debug level 17. 84 Return to debug level 16. 85 Return to debug level 15. 86 Return to debug level 14. 87 Return to debug level 13. 88 Return to debug level 12. 89 Return to debug level 11. 90 Return to debug level 10. 91 Return to debug level 9. 92 Return to debug level 8. 93 Return to debug level 7. 94 Return to debug level 6. 95 Return to debug level 5. 96 Return to debug level 4. 97 Return to debug level 3. 98 Return to debug level 2. 99 Return to debug level 1. 100 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 100. 2 Return to debug level 99. 3 Return to debug level 98. 4 Return to debug level 97. 5 Return to debug level 96. 6 Return to debug level 95. 7 Return to debug level 94. 8 Return to debug level 93. 9 Return to debug level 92. 10 Return to debug level 91. 11 Return to debug level 90. 12 Return to debug level 89. 13 Return to debug level 88. 14 Return to debug level 87. 15 Return to debug level 86. 16 Return to debug level 85. 17 Return to debug level 84. 18 Return to debug level 83. 19 Return to debug level 82. 20 Return to debug level 81. 21 Return to debug level 80. 22 Return to debug level 79. 23 Return to debug level 78. 24 Return to debug level 77. 25 Return to debug level 76. 26 Return to debug level 75. 27 Return to debug level 74. 28 Return to debug level 73. 29 Return to debug level 72. 30 Return to debug level 71. 31 Return to debug level 70. 32 Return to debug level 69. 33 Return to debug level 68. 34 Return to debug level 67. 35 Return to debug level 66. 36 Return to debug level 65. 37 Return to debug level 64. 38 Return to debug level 63. 39 Return to debug level 62. 40 Return to debug level 61. 41 Return to debug level 60. 42 Return to debug level 59. 43 Return to debug level 58. 44 Return to debug level 57. 45 Return to debug level 56. 46 Return to debug level 55. 47 Return to debug level 54. 48 Return to debug level 53. 49 Return to debug level 52. 50 Return to debug level 51. 51 Return to debug level 50. 52 Return to debug level 49. 53 Return to debug level 48. 54 Return to debug level 47. 55 Return to debug level 46. 56 Return to debug level 45. 57 Return to debug level 44. 58 Return to debug level 43. 59 Return to debug level 42. 60 Return to debug level 41. 61 Return to debug level 40. 62 Return to debug level 39. 63 Return to debug level 38. 64 Return to debug level 37. 65 Return to debug level 36. 66 Return to debug level 35. 67 Return to debug level 34. 68 Return to debug level 33. 69 Return to debug level 32. 70 Return to debug level 31. 71 Return to debug level 30. 72 Return to debug level 29. 73 Return to debug level 28. 74 Return to debug level 27. 75 Return to debug level 26. 76 Return to debug level 25. 77 Return to debug level 24. 78 Return to debug level 23. 79 Return to debug level 22. 80 Return to debug level 21. 81 Return to debug level 20. 82 Return to debug level 19. 83 Return to debug level 18. 84 Return to debug level 17. 85 Return to debug level 16. 86 Return to debug level 15. 87 Return to debug level 14. 88 Return to debug level 13. 89 Return to debug level 12. 90 Return to debug level 11. 91 Return to debug level 10. 92 Return to debug level 9. 93 Return to debug level 8. 94 Return to debug level 7. 95 Return to debug level 6. 96 Return to debug level 5. 97 Return to debug level 4. 98 Return to debug level 3. 99 Return to debug level 2. 100 Return to debug level 1. 101 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 101. 2 Return to debug level 100. 3 Return to debug level 99. 4 Return to debug level 98. 5 Return to debug level 97. 6 Return to debug level 96. 7 Return to debug level 95. 8 Return to debug level 94. 9 Return to debug level 93. 10 Return to debug level 92. 11 Return to debug level 91. 12 Return to debug level 90. 13 Return to debug level 89. 14 Return to debug level 88. 15 Return to debug level 87. 16 Return to debug level 86. 17 Return to debug level 85. 18 Return to debug level 84. 19 Return to debug level 83. 20 Return to debug level 82. 21 Return to debug level 81. 22 Return to debug level 80. 23 Return to debug level 79. 24 Return to debug level 78. 25 Return to debug level 77. 26 Return to debug level 76. 27 Return to debug level 75. 28 Return to debug level 74. 29 Return to debug level 73. 30 Return to debug level 72. 31 Return to debug level 71. 32 Return to debug level 70. 33 Return to debug level 69. 34 Return to debug level 68. 35 Return to debug level 67. 36 Return to debug level 66. 37 Return to debug level 65. 38 Return to debug level 64. 39 Return to debug level 63. 40 Return to debug level 62. 41 Return to debug level 61. 42 Return to debug level 60. 43 Return to debug level 59. 44 Return to debug level 58. 45 Return to debug level 57. 46 Return to debug level 56. 47 Return to debug level 55. 48 Return to debug level 54. 49 Return to debug level 53. 50 Return to debug level 52. 51 Return to debug level 51. 52 Return to debug level 50. 53 Return to debug level 49. 54 Return to debug level 48. 55 Return to debug level 47. 56 Return to debug level 46. 57 Return to debug level 45. 58 Return to debug level 44. 59 Return to debug level 43. 60 Return to debug level 42. 61 Return to debug level 41. 62 Return to debug level 40. 63 Return to debug level 39. 64 Return to debug level 38. 65 Return to debug level 37. 66 Return to debug level 36. 67 Return to debug level 35. 68 Return to debug level 34. 69 Return to debug level 33. 70 Return to debug level 32. 71 Return to debug level 31. 72 Return to debug level 30. 73 Return to debug level 29. 74 Return to debug level 28. 75 Return to debug level 27. 76 Return to debug level 26. 77 Return to debug level 25. 78 Return to debug level 24. 79 Return to debug level 23. 80 Return to debug level 22. 81 Return to debug level 21. 82 Return to debug level 20. 83 Return to debug level 19. 84 Return to debug level 18. 85 Return to debug level 17. 86 Return to debug level 16. 87 Return to debug level 15. 88 Return to debug level 14. 89 Return to debug level 13. 90 Return to debug level 12. 91 Return to debug level 11. 92 Return to debug level 10. 93 Return to debug level 9. 94 Return to debug level 8. 95 Return to debug level 7. 96 Return to debug level 6. 97 Return to debug level 5. 98 Return to debug level 4. 99 Return to debug level 3. 100 Return to debug level 2. 101 Return to debug level 1. 102 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 102. 2 Return to debug level 101. 3 Return to debug level 100. 4 Return to debug level 99. 5 Return to debug level 98. 6 Return to debug level 97. 7 Return to debug level 96. 8 Return to debug level 95. 9 Return to debug level 94. 10 Return to debug level 93. 11 Return to debug level 92. 12 Return to debug level 91. 13 Return to debug level 90. 14 Return to debug level 89. 15 Return to debug level 88. 16 Return to debug level 87. 17 Return to debug level 86. 18 Return to debug level 85. 19 Return to debug level 84. 20 Return to debug level 83. 21 Return to debug level 82. 22 Return to debug level 81. 23 Return to debug level 80. 24 Return to debug level 79. 25 Return to debug level 78. 26 Return to debug level 77. 27 Return to debug level 76. 28 Return to debug level 75. 29 Return to debug level 74. 30 Return to debug level 73. 31 Return to debug level 72. 32 Return to debug level 71. 33 Return to debug level 70. 34 Return to debug level 69. 35 Return to debug level 68. 36 Return to debug level 67. 37 Return to debug level 66. 38 Return to debug level 65. 39 Return to debug level 64. 40 Return to debug level 63. 41 Return to debug level 62. 42 Return to debug level 61. 43 Return to debug level 60. 44 Return to debug level 59. 45 Return to debug level 58. 46 Return to debug level 57. 47 Return to debug level 56. 48 Return to debug level 55. 49 Return to debug level 54. 50 Return to debug level 53. 51 Return to debug level 52. 52 Return to debug level 51. 53 Return to debug level 50. 54 Return to debug level 49. 55 Return to debug level 48. 56 Return to debug level 47. 57 Return to debug level 46. 58 Return to debug level 45. 59 Return to debug level 44. 60 Return to debug level 43. 61 Return to debug level 42. 62 Return to debug level 41. 63 Return to debug level 40. 64 Return to debug level 39. 65 Return to debug level 38. 66 Return to debug level 37. 67 Return to debug level 36. 68 Return to debug level 35. 69 Return to debug level 34. 70 Return to debug level 33. 71 Return to debug level 32. 72 Return to debug level 31. 73 Return to debug level 30. 74 Return to debug level 29. 75 Return to debug level 28. 76 Return to debug level 27. 77 Return to debug level 26. 78 Return to debug level 25. 79 Return to debug level 24. 80 Return to debug level 23. 81 Return to debug level 22. 82 Return to debug level 21. 83 Return to debug level 20. 84 Return to debug level 19. 85 Return to debug level 18. 86 Return to debug level 17. 87 Return to debug level 16. 88 Return to debug level 15. 89 Return to debug level 14. 90 Return to debug level 13. 91 Return to debug level 12. 92 Return to debug level 11. 93 Return to debug level 10. 94 Return to debug level 9. 95 Return to debug level 8. 96 Return to debug level 7. 97 Return to debug level 6. 98 Return to debug level 5. 99 Return to debug level 4. 100 Return to debug level 3. 101 Return to debug level 2. 102 Return to debug level 1. 103 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 103. 2 Return to debug level 102. 3 Return to debug level 101. 4 Return to debug level 100. 5 Return to debug level 99. 6 Return to debug level 98. 7 Return to debug level 97. 8 Return to debug level 96. 9 Return to debug level 95. 10 Return to debug level 94. 11 Return to debug level 93. 12 Return to debug level 92. 13 Return to debug level 91. 14 Return to debug level 90. 15 Return to debug level 89. 16 Return to debug level 88. 17 Return to debug level 87. 18 Return to debug level 86. 19 Return to debug level 85. 20 Return to debug level 84. 21 Return to debug level 83. 22 Return to debug level 82. 23 Return to debug level 81. 24 Return to debug level 80. 25 Return to debug level 79. 26 Return to debug level 78. 27 Return to debug level 77. 28 Return to debug level 76. 29 Return to debug level 75. 30 Return to debug level 74. 31 Return to debug level 73. 32 Return to debug level 72. 33 Return to debug level 71. 34 Return to debug level 70. 35 Return to debug level 69. 36 Return to debug level 68. 37 Return to debug level 67. 38 Return to debug level 66. 39 Return to debug level 65. 40 Return to debug level 64. 41 Return to debug level 63. 42 Return to debug level 62. 43 Return to debug level 61. 44 Return to debug level 60. 45 Return to debug level 59. 46 Return to debug level 58. 47 Return to debug level 57. 48 Return to debug level 56. 49 Return to debug level 55. 50 Return to debug level 54. 51 Return to debug level 53. 52 Return to debug level 52. 53 Return to debug level 51. 54 Return to debug level 50. 55 Return to debug level 49. 56 Return to debug level 48. 57 Return to debug level 47. 58 Return to debug level 46. 59 Return to debug level 45. 60 Return to debug level 44. 61 Return to debug level 43. 62 Return to debug level 42. 63 Return to debug level 41. 64 Return to debug level 40. 65 Return to debug level 39. 66 Return to debug level 38. 67 Return to debug level 37. 68 Return to debug level 36. 69 Return to debug level 35. 70 Return to debug level 34. 71 Return to debug level 33. 72 Return to debug level 32. 73 Return to debug level 31. 74 Return to debug level 30. 75 Return to debug level 29. 76 Return to debug level 28. 77 Return to debug level 27. 78 Return to debug level 26. 79 Return to debug level 25. 80 Return to debug level 24. 81 Return to debug level 23. 82 Return to debug level 22. 83 Return to debug level 21. 84 Return to debug level 20. 85 Return to debug level 19. 86 Return to debug level 18. 87 Return to debug level 17. 88 Return to debug level 16. 89 Return to debug level 15. 90 Return to debug level 14. 91 Return to debug level 13. 92 Return to debug level 12. 93 Return to debug level 11. 94 Return to debug level 10. 95 Return to debug level 9. 96 Return to debug level 8. 97 Return to debug level 7. 98 Return to debug level 6. 99 Return to debug level 5. 100 Return to debug level 4. 101 Return to debug level 3. 102 Return to debug level 2. 103 Return to debug level 1. 104 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 104. 2 Return to debug level 103. 3 Return to debug level 102. 4 Return to debug level 101. 5 Return to debug level 100. 6 Return to debug level 99. 7 Return to debug level 98. 8 Return to debug level 97. 9 Return to debug level 96. 10 Return to debug level 95. 11 Return to debug level 94. 12 Return to debug level 93. 13 Return to debug level 92. 14 Return to debug level 91. 15 Return to debug level 90. 16 Return to debug level 89. 17 Return to debug level 88. 18 Return to debug level 87. 19 Return to debug level 86. 20 Return to debug level 85. 21 Return to debug level 84. 22 Return to debug level 83. 23 Return to debug level 82. 24 Return to debug level 81. 25 Return to debug level 80. 26 Return to debug level 79. 27 Return to debug level 78. 28 Return to debug level 77. 29 Return to debug level 76. 30 Return to debug level 75. 31 Return to debug level 74. 32 Return to debug level 73. 33 Return to debug level 72. 34 Return to debug level 71. 35 Return to debug level 70. 36 Return to debug level 69. 37 Return to debug level 68. 38 Return to debug level 67. 39 Return to debug level 66. 40 Return to debug level 65. 41 Return to debug level 64. 42 Return to debug level 63. 43 Return to debug level 62. 44 Return to debug level 61. 45 Return to debug level 60. 46 Return to debug level 59. 47 Return to debug level 58. 48 Return to debug level 57. 49 Return to debug level 56. 50 Return to debug level 55. 51 Return to debug level 54. 52 Return to debug level 53. 53 Return to debug level 52. 54 Return to debug level 51. 55 Return to debug level 50. 56 Return to debug level 49. 57 Return to debug level 48. 58 Return to debug level 47. 59 Return to debug level 46. 60 Return to debug level 45. 61 Return to debug level 44. 62 Return to debug level 43. 63 Return to debug level 42. 64 Return to debug level 41. 65 Return to debug level 40. 66 Return to debug level 39. 67 Return to debug level 38. 68 Return to debug level 37. 69 Return to debug level 36. 70 Return to debug level 35. 71 Return to debug level 34. 72 Return to debug level 33. 73 Return to debug level 32. 74 Return to debug level 31. 75 Return to debug level 30. 76 Return to debug level 29. 77 Return to debug level 28. 78 Return to debug level 27. 79 Return to debug level 26. 80 Return to debug level 25. 81 Return to debug level 24. 82 Return to debug level 23. 83 Return to debug level 22. 84 Return to debug level 21. 85 Return to debug level 20. 86 Return to debug level 19. 87 Return to debug level 18. 88 Return to debug level 17. 89 Return to debug level 16. 90 Return to debug level 15. 91 Return to debug level 14. 92 Return to debug level 13. 93 Return to debug level 12. 94 Return to debug level 11. 95 Return to debug level 10. 96 Return to debug level 9. 97 Return to debug level 8. 98 Return to debug level 7. 99 Return to debug level 6. 100 Return to debug level 5. 101 Return to debug level 4. 102 Return to debug level 3. 103 Return to debug level 2. 104 Return to debug level 1. 105 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 105. 2 Return to debug level 104. 3 Return to debug level 103. 4 Return to debug level 102. 5 Return to debug level 101. 6 Return to debug level 100. 7 Return to debug level 99. 8 Return to debug level 98. 9 Return to debug level 97. 10 Return to debug level 96. 11 Return to debug level 95. 12 Return to debug level 94. 13 Return to debug level 93. 14 Return to debug level 92. 15 Return to debug level 91. 16 Return to debug level 90. 17 Return to debug level 89. 18 Return to debug level 88. 19 Return to debug level 87. 20 Return to debug level 86. 21 Return to debug level 85. 22 Return to debug level 84. 23 Return to debug level 83. 24 Return to debug level 82. 25 Return to debug level 81. 26 Return to debug level 80. 27 Return to debug level 79. 28 Return to debug level 78. 29 Return to debug level 77. 30 Return to debug level 76. 31 Return to debug level 75. 32 Return to debug level 74. 33 Return to debug level 73. 34 Return to debug level 72. 35 Return to debug level 71. 36 Return to debug level 70. 37 Return to debug level 69. 38 Return to debug level 68. 39 Return to debug level 67. 40 Return to debug level 66. 41 Return to debug level 65. 42 Return to debug level 64. 43 Return to debug level 63. 44 Return to debug level 62. 45 Return to debug level 61. 46 Return to debug level 60. 47 Return to debug level 59. 48 Return to debug level 58. 49 Return to debug level 57. 50 Return to debug level 56. 51 Return to debug level 55. 52 Return to debug level 54. 53 Return to debug level 53. 54 Return to debug level 52. 55 Return to debug level 51. 56 Return to debug level 50. 57 Return to debug level 49. 58 Return to debug level 48. 59 Return to debug level 47. 60 Return to debug level 46. 61 Return to debug level 45. 62 Return to debug level 44. 63 Return to debug level 43. 64 Return to debug level 42. 65 Return to debug level 41. 66 Return to debug level 40. 67 Return to debug level 39. 68 Return to debug level 38. 69 Return to debug level 37. 70 Return to debug level 36. 71 Return to debug level 35. 72 Return to debug level 34. 73 Return to debug level 33. 74 Return to debug level 32. 75 Return to debug level 31. 76 Return to debug level 30. 77 Return to debug level 29. 78 Return to debug level 28. 79 Return to debug level 27. 80 Return to debug level 26. 81 Return to debug level 25. 82 Return to debug level 24. 83 Return to debug level 23. 84 Return to debug level 22. 85 Return to debug level 21. 86 Return to debug level 20. 87 Return to debug level 19. 88 Return to debug level 18. 89 Return to debug level 17. 90 Return to debug level 16. 91 Return to debug level 15. 92 Return to debug level 14. 93 Return to debug level 13. 94 Return to debug level 12. 95 Return to debug level 11. 96 Return to debug level 10. 97 Return to debug level 9. 98 Return to debug level 8. 99 Return to debug level 7. 100 Return to debug level 6. 101 Return to debug level 5. 102 Return to debug level 4. 103 Return to debug level 3. 104 Return to debug level 2. 105 Return to debug level 1. 106 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 106. 2 Return to debug level 105. 3 Return to debug level 104. 4 Return to debug level 103. 5 Return to debug level 102. 6 Return to debug level 101. 7 Return to debug level 100. 8 Return to debug level 99. 9 Return to debug level 98. 10 Return to debug level 97. 11 Return to debug level 96. 12 Return to debug level 95. 13 Return to debug level 94. 14 Return to debug level 93. 15 Return to debug level 92. 16 Return to debug level 91. 17 Return to debug level 90. 18 Return to debug level 89. 19 Return to debug level 88. 20 Return to debug level 87. 21 Return to debug level 86. 22 Return to debug level 85. 23 Return to debug level 84. 24 Return to debug level 83. 25 Return to debug level 82. 26 Return to debug level 81. 27 Return to debug level 80. 28 Return to debug level 79. 29 Return to debug level 78. 30 Return to debug level 77. 31 Return to debug level 76. 32 Return to debug level 75. 33 Return to debug level 74. 34 Return to debug level 73. 35 Return to debug level 72. 36 Return to debug level 71. 37 Return to debug level 70. 38 Return to debug level 69. 39 Return to debug level 68. 40 Return to debug level 67. 41 Return to debug level 66. 42 Return to debug level 65. 43 Return to debug level 64. 44 Return to debug level 63. 45 Return to debug level 62. 46 Return to debug level 61. 47 Return to debug level 60. 48 Return to debug level 59. 49 Return to debug level 58. 50 Return to debug level 57. 51 Return to debug level 56. 52 Return to debug level 55. 53 Return to debug level 54. 54 Return to debug level 53. 55 Return to debug level 52. 56 Return to debug level 51. 57 Return to debug level 50. 58 Return to debug level 49. 59 Return to debug level 48. 60 Return to debug level 47. 61 Return to debug level 46. 62 Return to debug level 45. 63 Return to debug level 44. 64 Return to debug level 43. 65 Return to debug level 42. 66 Return to debug level 41. 67 Return to debug level 40. 68 Return to debug level 39. 69 Return to debug level 38. 70 Return to debug level 37. 71 Return to debug level 36. 72 Return to debug level 35. 73 Return to debug level 34. 74 Return to debug level 33. 75 Return to debug level 32. 76 Return to debug level 31. 77 Return to debug level 30. 78 Return to debug level 29. 79 Return to debug level 28. 80 Return to debug level 27. 81 Return to debug level 26. 82 Return to debug level 25. 83 Return to debug level 24. 84 Return to debug level 23. 85 Return to debug level 22. 86 Return to debug level 21. 87 Return to debug level 20. 88 Return to debug level 19. 89 Return to debug level 18. 90 Return to debug level 17. 91 Return to debug level 16. 92 Return to debug level 15. 93 Return to debug level 14. 94 Return to debug level 13. 95 Return to debug level 12. 96 Return to debug level 11. 97 Return to debug level 10. 98 Return to debug level 9. 99 Return to debug level 8. 100 Return to debug level 7. 101 Return to debug level 6. 102 Return to debug level 5. 103 Return to debug level 4. 104 Return to debug level 3. 105 Return to debug level 2. 106 Return to debug level 1. 107 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 107. 2 Return to debug level 106. 3 Return to debug level 105. 4 Return to debug level 104. 5 Return to debug level 103. 6 Return to debug level 102. 7 Return to debug level 101. 8 Return to debug level 100. 9 Return to debug level 99. 10 Return to debug level 98. 11 Return to debug level 97. 12 Return to debug level 96. 13 Return to debug level 95. 14 Return to debug level 94. 15 Return to debug level 93. 16 Return to debug level 92. 17 Return to debug level 91. 18 Return to debug level 90. 19 Return to debug level 89. 20 Return to debug level 88. 21 Return to debug level 87. 22 Return to debug level 86. 23 Return to debug level 85. 24 Return to debug level 84. 25 Return to debug level 83. 26 Return to debug level 82. 27 Return to debug level 81. 28 Return to debug level 80. 29 Return to debug level 79. 30 Return to debug level 78. 31 Return to debug level 77. 32 Return to debug level 76. 33 Return to debug level 75. 34 Return to debug level 74. 35 Return to debug level 73. 36 Return to debug level 72. 37 Return to debug level 71. 38 Return to debug level 70. 39 Return to debug level 69. 40 Return to debug level 68. 41 Return to debug level 67. 42 Return to debug level 66. 43 Return to debug level 65. 44 Return to debug level 64. 45 Return to debug level 63. 46 Return to debug level 62. 47 Return to debug level 61. 48 Return to debug level 60. 49 Return to debug level 59. 50 Return to debug level 58. 51 Return to debug level 57. 52 Return to debug level 56. 53 Return to debug level 55. 54 Return to debug level 54. 55 Return to debug level 53. 56 Return to debug level 52. 57 Return to debug level 51. 58 Return to debug level 50. 59 Return to debug level 49. 60 Return to debug level 48. 61 Return to debug level 47. 62 Return to debug level 46. 63 Return to debug level 45. 64 Return to debug level 44. 65 Return to debug level 43. 66 Return to debug level 42. 67 Return to debug level 41. 68 Return to debug level 40. 69 Return to debug level 39. 70 Return to debug level 38. 71 Return to debug level 37. 72 Return to debug level 36. 73 Return to debug level 35. 74 Return to debug level 34. 75 Return to debug level 33. 76 Return to debug level 32. 77 Return to debug level 31. 78 Return to debug level 30. 79 Return to debug level 29. 80 Return to debug level 28. 81 Return to debug level 27. 82 Return to debug level 26. 83 Return to debug level 25. 84 Return to debug level 24. 85 Return to debug level 23. 86 Return to debug level 22. 87 Return to debug level 21. 88 Return to debug level 20. 89 Return to debug level 19. 90 Return to debug level 18. 91 Return to debug level 17. 92 Return to debug level 16. 93 Return to debug level 15. 94 Return to debug level 14. 95 Return to debug level 13. 96 Return to debug level 12. 97 Return to debug level 11. 98 Return to debug level 10. 99 Return to debug level 9. 100 Return to debug level 8. 101 Return to debug level 7. 102 Return to debug level 6. 103 Return to debug level 5. 104 Return to debug level 4. 105 Return to debug level 3. 106 Return to debug level 2. 107 Return to debug level 1. 108 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 108. 2 Return to debug level 107. 3 Return to debug level 106. 4 Return to debug level 105. 5 Return to debug level 104. 6 Return to debug level 103. 7 Return to debug level 102. 8 Return to debug level 101. 9 Return to debug level 100. 10 Return to debug level 99. 11 Return to debug level 98. 12 Return to debug level 97. 13 Return to debug level 96. 14 Return to debug level 95. 15 Return to debug level 94. 16 Return to debug level 93. 17 Return to debug level 92. 18 Return to debug level 91. 19 Return to debug level 90. 20 Return to debug level 89. 21 Return to debug level 88. 22 Return to debug level 87. 23 Return to debug level 86. 24 Return to debug level 85. 25 Return to debug level 84. 26 Return to debug level 83. 27 Return to debug level 82. 28 Return to debug level 81. 29 Return to debug level 80. 30 Return to debug level 79. 31 Return to debug level 78. 32 Return to debug level 77. 33 Return to debug level 76. 34 Return to debug level 75. 35 Return to debug level 74. 36 Return to debug level 73. 37 Return to debug level 72. 38 Return to debug level 71. 39 Return to debug level 70. 40 Return to debug level 69. 41 Return to debug level 68. 42 Return to debug level 67. 43 Return to debug level 66. 44 Return to debug level 65. 45 Return to debug level 64. 46 Return to debug level 63. 47 Return to debug level 62. 48 Return to debug level 61. 49 Return to debug level 60. 50 Return to debug level 59. 51 Return to debug level 58. 52 Return to debug level 57. 53 Return to debug level 56. 54 Return to debug level 55. 55 Return to debug level 54. 56 Return to debug level 53. 57 Return to debug level 52. 58 Return to debug level 51. 59 Return to debug level 50. 60 Return to debug level 49. 61 Return to debug level 48. 62 Return to debug level 47. 63 Return to debug level 46. 64 Return to debug level 45. 65 Return to debug level 44. 66 Return to debug level 43. 67 Return to debug level 42. 68 Return to debug level 41. 69 Return to debug level 40. 70 Return to debug level 39. 71 Return to debug level 38. 72 Return to debug level 37. 73 Return to debug level 36. 74 Return to debug level 35. 75 Return to debug level 34. 76 Return to debug level 33. 77 Return to debug level 32. 78 Return to debug level 31. 79 Return to debug level 30. 80 Return to debug level 29. 81 Return to debug level 28. 82 Return to debug level 27. 83 Return to debug level 26. 84 Return to debug level 25. 85 Return to debug level 24. 86 Return to debug level 23. 87 Return to debug level 22. 88 Return to debug level 21. 89 Return to debug level 20. 90 Return to debug level 19. 91 Return to debug level 18. 92 Return to debug level 17. 93 Return to debug level 16. 94 Return to debug level 15. 95 Return to debug level 14. 96 Return to debug level 13. 97 Return to debug level 12. 98 Return to debug level 11. 99 Return to debug level 10. 100 Return to debug level 9. 101 Return to debug level 8. 102 Return to debug level 7. 103 Return to debug level 6. 104 Return to debug level 5. 105 Return to debug level 4. 106 Return to debug level 3. 107 Return to debug level 2. 108 Return to debug level 1. 109 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 109. 2 Return to debug level 108. 3 Return to debug level 107. 4 Return to debug level 106. 5 Return to debug level 105. 6 Return to debug level 104. 7 Return to debug level 103. 8 Return to debug level 102. 9 Return to debug level 101. 10 Return to debug level 100. 11 Return to debug level 99. 12 Return to debug level 98. 13 Return to debug level 97. 14 Return to debug level 96. 15 Return to debug level 95. 16 Return to debug level 94. 17 Return to debug level 93. 18 Return to debug level 92. 19 Return to debug level 91. 20 Return to debug level 90. 21 Return to debug level 89. 22 Return to debug level 88. 23 Return to debug level 87. 24 Return to debug level 86. 25 Return to debug level 85. 26 Return to debug level 84. 27 Return to debug level 83. 28 Return to debug level 82. 29 Return to debug level 81. 30 Return to debug level 80. 31 Return to debug level 79. 32 Return to debug level 78. 33 Return to debug level 77. 34 Return to debug level 76. 35 Return to debug level 75. 36 Return to debug level 74. 37 Return to debug level 73. 38 Return to debug level 72. 39 Return to debug level 71. 40 Return to debug level 70. 41 Return to debug level 69. 42 Return to debug level 68. 43 Return to debug level 67. 44 Return to debug level 66. 45 Return to debug level 65. 46 Return to debug level 64. 47 Return to debug level 63. 48 Return to debug level 62. 49 Return to debug level 61. 50 Return to debug level 60. 51 Return to debug level 59. 52 Return to debug level 58. 53 Return to debug level 57. 54 Return to debug level 56. 55 Return to debug level 55. 56 Return to debug level 54. 57 Return to debug level 53. 58 Return to debug level 52. 59 Return to debug level 51. 60 Return to debug level 50. 61 Return to debug level 49. 62 Return to debug level 48. 63 Return to debug level 47. 64 Return to debug level 46. 65 Return to debug level 45. 66 Return to debug level 44. 67 Return to debug level 43. 68 Return to debug level 42. 69 Return to debug level 41. 70 Return to debug level 40. 71 Return to debug level 39. 72 Return to debug level 38. 73 Return to debug level 37. 74 Return to debug level 36. 75 Return to debug level 35. 76 Return to debug level 34. 77 Return to debug level 33. 78 Return to debug level 32. 79 Return to debug level 31. 80 Return to debug level 30. 81 Return to debug level 29. 82 Return to debug level 28. 83 Return to debug level 27. 84 Return to debug level 26. 85 Return to debug level 25. 86 Return to debug level 24. 87 Return to debug level 23. 88 Return to debug level 22. 89 Return to debug level 21. 90 Return to debug level 20. 91 Return to debug level 19. 92 Return to debug level 18. 93 Return to debug level 17. 94 Return to debug level 16. 95 Return to debug level 15. 96 Return to debug level 14. 97 Return to debug level 13. 98 Return to debug level 12. 99 Return to debug level 11. 100 Return to debug level 10. 101 Return to debug level 9. 102 Return to debug level 8. 103 Return to debug level 7. 104 Return to debug level 6. 105 Return to debug level 5. 106 Return to debug level 4. 107 Return to debug level 3. 108 Return to debug level 2. 109 Return to debug level 1. 110 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 110. 2 Return to debug level 109. 3 Return to debug level 108. 4 Return to debug level 107. 5 Return to debug level 106. 6 Return to debug level 105. 7 Return to debug level 104. 8 Return to debug level 103. 9 Return to debug level 102. 10 Return to debug level 101. 11 Return to debug level 100. 12 Return to debug level 99. 13 Return to debug level 98. 14 Return to debug level 97. 15 Return to debug level 96. 16 Return to debug level 95. 17 Return to debug level 94. 18 Return to debug level 93. 19 Return to debug level 92. 20 Return to debug level 91. 21 Return to debug level 90. 22 Return to debug level 89. 23 Return to debug level 88. 24 Return to debug level 87. 25 Return to debug level 86. 26 Return to debug level 85. 27 Return to debug level 84. 28 Return to debug level 83. 29 Return to debug level 82. 30 Return to debug level 81. 31 Return to debug level 80. 32 Return to debug level 79. 33 Return to debug level 78. 34 Return to debug level 77. 35 Return to debug level 76. 36 Return to debug level 75. 37 Return to debug level 74. 38 Return to debug level 73. 39 Return to debug level 72. 40 Return to debug level 71. 41 Return to debug level 70. 42 Return to debug level 69. 43 Return to debug level 68. 44 Return to debug level 67. 45 Return to debug level 66. 46 Return to debug level 65. 47 Return to debug level 64. 48 Return to debug level 63. 49 Return to debug level 62. 50 Return to debug level 61. 51 Return to debug level 60. 52 Return to debug level 59. 53 Return to debug level 58. 54 Return to debug level 57. 55 Return to debug level 56. 56 Return to debug level 55. 57 Return to debug level 54. 58 Return to debug level 53. 59 Return to debug level 52. 60 Return to debug level 51. 61 Return to debug level 50. 62 Return to debug level 49. 63 Return to debug level 48. 64 Return to debug level 47. 65 Return to debug level 46. 66 Return to debug level 45. 67 Return to debug level 44. 68 Return to debug level 43. 69 Return to debug level 42. 70 Return to debug level 41. 71 Return to debug level 40. 72 Return to debug level 39. 73 Return to debug level 38. 74 Return to debug level 37. 75 Return to debug level 36. 76 Return to debug level 35. 77 Return to debug level 34. 78 Return to debug level 33. 79 Return to debug level 32. 80 Return to debug level 31. 81 Return to debug level 30. 82 Return to debug level 29. 83 Return to debug level 28. 84 Return to debug level 27. 85 Return to debug level 26. 86 Return to debug level 25. 87 Return to debug level 24. 88 Return to debug level 23. 89 Return to debug level 22. 90 Return to debug level 21. 91 Return to debug level 20. 92 Return to debug level 19. 93 Return to debug level 18. 94 Return to debug level 17. 95 Return to debug level 16. 96 Return to debug level 15. 97 Return to debug level 14. 98 Return to debug level 13. 99 Return to debug level 12. 100 Return to debug level 11. 101 Return to debug level 10. 102 Return to debug level 9. 103 Return to debug level 8. 104 Return to debug level 7. 105 Return to debug level 6. 106 Return to debug level 5. 107 Return to debug level 4. 108 Return to debug level 3. 109 Return to debug level 2. 110 Return to debug level 1. 111 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 111. 2 Return to debug level 110. 3 Return to debug level 109. 4 Return to debug level 108. 5 Return to debug level 107. 6 Return to debug level 106. 7 Return to debug level 105. 8 Return to debug level 104. 9 Return to debug level 103. 10 Return to debug level 102. 11 Return to debug level 101. 12 Return to debug level 100. 13 Return to debug level 99. 14 Return to debug level 98. 15 Return to debug level 97. 16 Return to debug level 96. 17 Return to debug level 95. 18 Return to debug level 94. 19 Return to debug level 93. 20 Return to debug level 92. 21 Return to debug level 91. 22 Return to debug level 90. 23 Return to debug level 89. 24 Return to debug level 88. 25 Return to debug level 87. 26 Return to debug level 86. 27 Return to debug level 85. 28 Return to debug level 84. 29 Return to debug level 83. 30 Return to debug level 82. 31 Return to debug level 81. 32 Return to debug level 80. 33 Return to debug level 79. 34 Return to debug level 78. 35 Return to debug level 77. 36 Return to debug level 76. 37 Return to debug level 75. 38 Return to debug level 74. 39 Return to debug level 73. 40 Return to debug level 72. 41 Return to debug level 71. 42 Return to debug level 70. 43 Return to debug level 69. 44 Return to debug level 68. 45 Return to debug level 67. 46 Return to debug level 66. 47 Return to debug level 65. 48 Return to debug level 64. 49 Return to debug level 63. 50 Return to debug level 62. 51 Return to debug level 61. 52 Return to debug level 60. 53 Return to debug level 59. 54 Return to debug level 58. 55 Return to debug level 57. 56 Return to debug level 56. 57 Return to debug level 55. 58 Return to debug level 54. 59 Return to debug level 53. 60 Return to debug level 52. 61 Return to debug level 51. 62 Return to debug level 50. 63 Return to debug level 49. 64 Return to debug level 48. 65 Return to debug level 47. 66 Return to debug level 46. 67 Return to debug level 45. 68 Return to debug level 44. 69 Return to debug level 43. 70 Return to debug level 42. 71 Return to debug level 41. 72 Return to debug level 40. 73 Return to debug level 39. 74 Return to debug level 38. 75 Return to debug level 37. 76 Return to debug level 36. 77 Return to debug level 35. 78 Return to debug level 34. 79 Return to debug level 33. 80 Return to debug level 32. 81 Return to debug level 31. 82 Return to debug level 30. 83 Return to debug level 29. 84 Return to debug level 28. 85 Return to debug level 27. 86 Return to debug level 26. 87 Return to debug level 25. 88 Return to debug level 24. 89 Return to debug level 23. 90 Return to debug level 22. 91 Return to debug level 21. 92 Return to debug level 20. 93 Return to debug level 19. 94 Return to debug level 18. 95 Return to debug level 17. 96 Return to debug level 16. 97 Return to debug level 15. 98 Return to debug level 14. 99 Return to debug level 13. 100 Return to debug level 12. 101 Return to debug level 11. 102 Return to debug level 10. 103 Return to debug level 9. 104 Return to debug level 8. 105 Return to debug level 7. 106 Return to debug level 6. 107 Return to debug level 5. 108 Return to debug level 4. 109 Return to debug level 3. 110 Return to debug level 2. 111 Return to debug level 1. 112 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 112. 2 Return to debug level 111. 3 Return to debug level 110. 4 Return to debug level 109. 5 Return to debug level 108. 6 Return to debug level 107. 7 Return to debug level 106. 8 Return to debug level 105. 9 Return to debug level 104. 10 Return to debug level 103. 11 Return to debug level 102. 12 Return to debug level 101. 13 Return to debug level 100. 14 Return to debug level 99. 15 Return to debug level 98. 16 Return to debug level 97. 17 Return to debug level 96. 18 Return to debug level 95. 19 Return to debug level 94. 20 Return to debug level 93. 21 Return to debug level 92. 22 Return to debug level 91. 23 Return to debug level 90. 24 Return to debug level 89. 25 Return to debug level 88. 26 Return to debug level 87. 27 Return to debug level 86. 28 Return to debug level 85. 29 Return to debug level 84. 30 Return to debug level 83. 31 Return to debug level 82. 32 Return to debug level 81. 33 Return to debug level 80. 34 Return to debug level 79. 35 Return to debug level 78. 36 Return to debug level 77. 37 Return to debug level 76. 38 Return to debug level 75. 39 Return to debug level 74. 40 Return to debug level 73. 41 Return to debug level 72. 42 Return to debug level 71. 43 Return to debug level 70. 44 Return to debug level 69. 45 Return to debug level 68. 46 Return to debug level 67. 47 Return to debug level 66. 48 Return to debug level 65. 49 Return to debug level 64. 50 Return to debug level 63. 51 Return to debug level 62. 52 Return to debug level 61. 53 Return to debug level 60. 54 Return to debug level 59. 55 Return to debug level 58. 56 Return to debug level 57. 57 Return to debug level 56. 58 Return to debug level 55. 59 Return to debug level 54. 60 Return to debug level 53. 61 Return to debug level 52. 62 Return to debug level 51. 63 Return to debug level 50. 64 Return to debug level 49. 65 Return to debug level 48. 66 Return to debug level 47. 67 Return to debug level 46. 68 Return to debug level 45. 69 Return to debug level 44. 70 Return to debug level 43. 71 Return to debug level 42. 72 Return to debug level 41. 73 Return to debug level 40. 74 Return to debug level 39. 75 Return to debug level 38. 76 Return to debug level 37. 77 Return to debug level 36. 78 Return to debug level 35. 79 Return to debug level 34. 80 Return to debug level 33. 81 Return to debug level 32. 82 Return to debug level 31. 83 Return to debug level 30. 84 Return to debug level 29. 85 Return to debug level 28. 86 Return to debug level 27. 87 Return to debug level 26. 88 Return to debug level 25. 89 Return to debug level 24. 90 Return to debug level 23. 91 Return to debug level 22. 92 Return to debug level 21. 93 Return to debug level 20. 94 Return to debug level 19. 95 Return to debug level 18. 96 Return to debug level 17. 97 Return to debug level 16. 98 Return to debug level 15. 99 Return to debug level 14. 100 Return to debug level 13. 101 Return to debug level 12. 102 Return to debug level 11. 103 Return to debug level 10. 104 Return to debug level 9. 105 Return to debug level 8. 106 Return to debug level 7. 107 Return to debug level 6. 108 Return to debug level 5. 109 Return to debug level 4. 110 Return to debug level 3. 111 Return to debug level 2. 112 Return to debug level 1. 113 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 113. 2 Return to debug level 112. 3 Return to debug level 111. 4 Return to debug level 110. 5 Return to debug level 109. 6 Return to debug level 108. 7 Return to debug level 107. 8 Return to debug level 106. 9 Return to debug level 105. 10 Return to debug level 104. 11 Return to debug level 103. 12 Return to debug level 102. 13 Return to debug level 101. 14 Return to debug level 100. 15 Return to debug level 99. 16 Return to debug level 98. 17 Return to debug level 97. 18 Return to debug level 96. 19 Return to debug level 95. 20 Return to debug level 94. 21 Return to debug level 93. 22 Return to debug level 92. 23 Return to debug level 91. 24 Return to debug level 90. 25 Return to debug level 89. 26 Return to debug level 88. 27 Return to debug level 87. 28 Return to debug level 86. 29 Return to debug level 85. 30 Return to debug level 84. 31 Return to debug level 83. 32 Return to debug level 82. 33 Return to debug level 81. 34 Return to debug level 80. 35 Return to debug level 79. 36 Return to debug level 78. 37 Return to debug level 77. 38 Return to debug level 76. 39 Return to debug level 75. 40 Return to debug level 74. 41 Return to debug level 73. 42 Return to debug level 72. 43 Return to debug level 71. 44 Return to debug level 70. 45 Return to debug level 69. 46 Return to debug level 68. 47 Return to debug level 67. 48 Return to debug level 66. 49 Return to debug level 65. 50 Return to debug level 64. 51 Return to debug level 63. 52 Return to debug level 62. 53 Return to debug level 61. 54 Return to debug level 60. 55 Return to debug level 59. 56 Return to debug level 58. 57 Return to debug level 57. 58 Return to debug level 56. 59 Return to debug level 55. 60 Return to debug level 54. 61 Return to debug level 53. 62 Return to debug level 52. 63 Return to debug level 51. 64 Return to debug level 50. 65 Return to debug level 49. 66 Return to debug level 48. 67 Return to debug level 47. 68 Return to debug level 46. 69 Return to debug level 45. 70 Return to debug level 44. 71 Return to debug level 43. 72 Return to debug level 42. 73 Return to debug level 41. 74 Return to debug level 40. 75 Return to debug level 39. 76 Return to debug level 38. 77 Return to debug level 37. 78 Return to debug level 36. 79 Return to debug level 35. 80 Return to debug level 34. 81 Return to debug level 33. 82 Return to debug level 32. 83 Return to debug level 31. 84 Return to debug level 30. 85 Return to debug level 29. 86 Return to debug level 28. 87 Return to debug level 27. 88 Return to debug level 26. 89 Return to debug level 25. 90 Return to debug level 24. 91 Return to debug level 23. 92 Return to debug level 22. 93 Return to debug level 21. 94 Return to debug level 20. 95 Return to debug level 19. 96 Return to debug level 18. 97 Return to debug level 17. 98 Return to debug level 16. 99 Return to debug level 15. 100 Return to debug level 14. 101 Return to debug level 13. 102 Return to debug level 12. 103 Return to debug level 11. 104 Return to debug level 10. 105 Return to debug level 9. 106 Return to debug level 8. 107 Return to debug level 7. 108 Return to debug level 6. 109 Return to debug level 5. 110 Return to debug level 4. 111 Return to debug level 3. 112 Return to debug level 2. 113 Return to debug level 1. 114 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 114. 2 Return to debug level 113. 3 Return to debug level 112. 4 Return to debug level 111. 5 Return to debug level 110. 6 Return to debug level 109. 7 Return to debug level 108. 8 Return to debug level 107. 9 Return to debug level 106. 10 Return to debug level 105. 11 Return to debug level 104. 12 Return to debug level 103. 13 Return to debug level 102. 14 Return to debug level 101. 15 Return to debug level 100. 16 Return to debug level 99. 17 Return to debug level 98. 18 Return to debug level 97. 19 Return to debug level 96. 20 Return to debug level 95. 21 Return to debug level 94. 22 Return to debug level 93. 23 Return to debug level 92. 24 Return to debug level 91. 25 Return to debug level 90. 26 Return to debug level 89. 27 Return to debug level 88. 28 Return to debug level 87. 29 Return to debug level 86. 30 Return to debug level 85. 31 Return to debug level 84. 32 Return to debug level 83. 33 Return to debug level 82. 34 Return to debug level 81. 35 Return to debug level 80. 36 Return to debug level 79. 37 Return to debug level 78. 38 Return to debug level 77. 39 Return to debug level 76. 40 Return to debug level 75. 41 Return to debug level 74. 42 Return to debug level 73. 43 Return to debug level 72. 44 Return to debug level 71. 45 Return to debug level 70. 46 Return to debug level 69. 47 Return to debug level 68. 48 Return to debug level 67. 49 Return to debug level 66. 50 Return to debug level 65. 51 Return to debug level 64. 52 Return to debug level 63. 53 Return to debug level 62. 54 Return to debug level 61. 55 Return to debug level 60. 56 Return to debug level 59. 57 Return to debug level 58. 58 Return to debug level 57. 59 Return to debug level 56. 60 Return to debug level 55. 61 Return to debug level 54. 62 Return to debug level 53. 63 Return to debug level 52. 64 Return to debug level 51. 65 Return to debug level 50. 66 Return to debug level 49. 67 Return to debug level 48. 68 Return to debug level 47. 69 Return to debug level 46. 70 Return to debug level 45. 71 Return to debug level 44. 72 Return to debug level 43. 73 Return to debug level 42. 74 Return to debug level 41. 75 Return to debug level 40. 76 Return to debug level 39. 77 Return to debug level 38. 78 Return to debug level 37. 79 Return to debug level 36. 80 Return to debug level 35. 81 Return to debug level 34. 82 Return to debug level 33. 83 Return to debug level 32. 84 Return to debug level 31. 85 Return to debug level 30. 86 Return to debug level 29. 87 Return to debug level 28. 88 Return to debug level 27. 89 Return to debug level 26. 90 Return to debug level 25. 91 Return to debug level 24. 92 Return to debug level 23. 93 Return to debug level 22. 94 Return to debug level 21. 95 Return to debug level 20. 96 Return to debug level 19. 97 Return to debug level 18. 98 Return to debug level 17. 99 Return to debug level 16. 100 Return to debug level 15. 101 Return to debug level 14. 102 Return to debug level 13. 103 Return to debug level 12. 104 Return to debug level 11. 105 Return to debug level 10. 106 Return to debug level 9. 107 Return to debug level 8. 108 Return to debug level 7. 109 Return to debug level 6. 110 Return to debug level 5. 111 Return to debug level 4. 112 Return to debug level 3. 113 Return to debug level 2. 114 Return to debug level 1. 115 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 115. 2 Return to debug level 114. 3 Return to debug level 113. 4 Return to debug level 112. 5 Return to debug level 111. 6 Return to debug level 110. 7 Return to debug level 109. 8 Return to debug level 108. 9 Return to debug level 107. 10 Return to debug level 106. 11 Return to debug level 105. 12 Return to debug level 104. 13 Return to debug level 103. 14 Return to debug level 102. 15 Return to debug level 101. 16 Return to debug level 100. 17 Return to debug level 99. 18 Return to debug level 98. 19 Return to debug level 97. 20 Return to debug level 96. 21 Return to debug level 95. 22 Return to debug level 94. 23 Return to debug level 93. 24 Return to debug level 92. 25 Return to debug level 91. 26 Return to debug level 90. 27 Return to debug level 89. 28 Return to debug level 88. 29 Return to debug level 87. 30 Return to debug level 86. 31 Return to debug level 85. 32 Return to debug level 84. 33 Return to debug level 83. 34 Return to debug level 82. 35 Return to debug level 81. 36 Return to debug level 80. 37 Return to debug level 79. 38 Return to debug level 78. 39 Return to debug level 77. 40 Return to debug level 76. 41 Return to debug level 75. 42 Return to debug level 74. 43 Return to debug level 73. 44 Return to debug level 72. 45 Return to debug level 71. 46 Return to debug level 70. 47 Return to debug level 69. 48 Return to debug level 68. 49 Return to debug level 67. 50 Return to debug level 66. 51 Return to debug level 65. 52 Return to debug level 64. 53 Return to debug level 63. 54 Return to debug level 62. 55 Return to debug level 61. 56 Return to debug level 60. 57 Return to debug level 59. 58 Return to debug level 58. 59 Return to debug level 57. 60 Return to debug level 56. 61 Return to debug level 55. 62 Return to debug level 54. 63 Return to debug level 53. 64 Return to debug level 52. 65 Return to debug level 51. 66 Return to debug level 50. 67 Return to debug level 49. 68 Return to debug level 48. 69 Return to debug level 47. 70 Return to debug level 46. 71 Return to debug level 45. 72 Return to debug level 44. 73 Return to debug level 43. 74 Return to debug level 42. 75 Return to debug level 41. 76 Return to debug level 40. 77 Return to debug level 39. 78 Return to debug level 38. 79 Return to debug level 37. 80 Return to debug level 36. 81 Return to debug level 35. 82 Return to debug level 34. 83 Return to debug level 33. 84 Return to debug level 32. 85 Return to debug level 31. 86 Return to debug level 30. 87 Return to debug level 29. 88 Return to debug level 28. 89 Return to debug level 27. 90 Return to debug level 26. 91 Return to debug level 25. 92 Return to debug level 24. 93 Return to debug level 23. 94 Return to debug level 22. 95 Return to debug level 21. 96 Return to debug level 20. 97 Return to debug level 19. 98 Return to debug level 18. 99 Return to debug level 17. 100 Return to debug level 16. 101 Return to debug level 15. 102 Return to debug level 14. 103 Return to debug level 13. 104 Return to debug level 12. 105 Return to debug level 11. 106 Return to debug level 10. 107 Return to debug level 9. 108 Return to debug level 8. 109 Return to debug level 7. 110 Return to debug level 6. 111 Return to debug level 5. 112 Return to debug level 4. 113 Return to debug level 3. 114 Return to debug level 2. 115 Return to debug level 1. 116 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 116. 2 Return to debug level 115. 3 Return to debug level 114. 4 Return to debug level 113. 5 Return to debug level 112. 6 Return to debug level 111. 7 Return to debug level 110. 8 Return to debug level 109. 9 Return to debug level 108. 10 Return to debug level 107. 11 Return to debug level 106. 12 Return to debug level 105. 13 Return to debug level 104. 14 Return to debug level 103. 15 Return to debug level 102. 16 Return to debug level 101. 17 Return to debug level 100. 18 Return to debug level 99. 19 Return to debug level 98. 20 Return to debug level 97. 21 Return to debug level 96. 22 Return to debug level 95. 23 Return to debug level 94. 24 Return to debug level 93. 25 Return to debug level 92. 26 Return to debug level 91. 27 Return to debug level 90. 28 Return to debug level 89. 29 Return to debug level 88. 30 Return to debug level 87. 31 Return to debug level 86. 32 Return to debug level 85. 33 Return to debug level 84. 34 Return to debug level 83. 35 Return to debug level 82. 36 Return to debug level 81. 37 Return to debug level 80. 38 Return to debug level 79. 39 Return to debug level 78. 40 Return to debug level 77. 41 Return to debug level 76. 42 Return to debug level 75. 43 Return to debug level 74. 44 Return to debug level 73. 45 Return to debug level 72. 46 Return to debug level 71. 47 Return to debug level 70. 48 Return to debug level 69. 49 Return to debug level 68. 50 Return to debug level 67. 51 Return to debug level 66. 52 Return to debug level 65. 53 Return to debug level 64. 54 Return to debug level 63. 55 Return to debug level 62. 56 Return to debug level 61. 57 Return to debug level 60. 58 Return to debug level 59. 59 Return to debug level 58. 60 Return to debug level 57. 61 Return to debug level 56. 62 Return to debug level 55. 63 Return to debug level 54. 64 Return to debug level 53. 65 Return to debug level 52. 66 Return to debug level 51. 67 Return to debug level 50. 68 Return to debug level 49. 69 Return to debug level 48. 70 Return to debug level 47. 71 Return to debug level 46. 72 Return to debug level 45. 73 Return to debug level 44. 74 Return to debug level 43. 75 Return to debug level 42. 76 Return to debug level 41. 77 Return to debug level 40. 78 Return to debug level 39. 79 Return to debug level 38. 80 Return to debug level 37. 81 Return to debug level 36. 82 Return to debug level 35. 83 Return to debug level 34. 84 Return to debug level 33. 85 Return to debug level 32. 86 Return to debug level 31. 87 Return to debug level 30. 88 Return to debug level 29. 89 Return to debug level 28. 90 Return to debug level 27. 91 Return to debug level 26. 92 Return to debug level 25. 93 Return to debug level 24. 94 Return to debug level 23. 95 Return to debug level 22. 96 Return to debug level 21. 97 Return to debug level 20. 98 Return to debug level 19. 99 Return to debug level 18. 100 Return to debug level 17. 101 Return to debug level 16. 102 Return to debug level 15. 103 Return to debug level 14. 104 Return to debug level 13. 105 Return to debug level 12. 106 Return to debug level 11. 107 Return to debug level 10. 108 Return to debug level 9. 109 Return to debug level 8. 110 Return to debug level 7. 111 Return to debug level 6. 112 Return to debug level 5. 113 Return to debug level 4. 114 Return to debug level 3. 115 Return to debug level 2. 116 Return to debug level 1. 117 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 117. 2 Return to debug level 116. 3 Return to debug level 115. 4 Return to debug level 114. 5 Return to debug level 113. 6 Return to debug level 112. 7 Return to debug level 111. 8 Return to debug level 110. 9 Return to debug level 109. 10 Return to debug level 108. 11 Return to debug level 107. 12 Return to debug level 106. 13 Return to debug level 105. 14 Return to debug level 104. 15 Return to debug level 103. 16 Return to debug level 102. 17 Return to debug level 101. 18 Return to debug level 100. 19 Return to debug level 99. 20 Return to debug level 98. 21 Return to debug level 97. 22 Return to debug level 96. 23 Return to debug level 95. 24 Return to debug level 94. 25 Return to debug level 93. 26 Return to debug level 92. 27 Return to debug level 91. 28 Return to debug level 90. 29 Return to debug level 89. 30 Return to debug level 88. 31 Return to debug level 87. 32 Return to debug level 86. 33 Return to debug level 85. 34 Return to debug level 84. 35 Return to debug level 83. 36 Return to debug level 82. 37 Return to debug level 81. 38 Return to debug level 80. 39 Return to debug level 79. 40 Return to debug level 78. 41 Return to debug level 77. 42 Return to debug level 76. 43 Return to debug level 75. 44 Return to debug level 74. 45 Return to debug level 73. 46 Return to debug level 72. 47 Return to debug level 71. 48 Return to debug level 70. 49 Return to debug level 69. 50 Return to debug level 68. 51 Return to debug level 67. 52 Return to debug level 66. 53 Return to debug level 65. 54 Return to debug level 64. 55 Return to debug level 63. 56 Return to debug level 62. 57 Return to debug level 61. 58 Return to debug level 60. 59 Return to debug level 59. 60 Return to debug level 58. 61 Return to debug level 57. 62 Return to debug level 56. 63 Return to debug level 55. 64 Return to debug level 54. 65 Return to debug level 53. 66 Return to debug level 52. 67 Return to debug level 51. 68 Return to debug level 50. 69 Return to debug level 49. 70 Return to debug level 48. 71 Return to debug level 47. 72 Return to debug level 46. 73 Return to debug level 45. 74 Return to debug level 44. 75 Return to debug level 43. 76 Return to debug level 42. 77 Return to debug level 41. 78 Return to debug level 40. 79 Return to debug level 39. 80 Return to debug level 38. 81 Return to debug level 37. 82 Return to debug level 36. 83 Return to debug level 35. 84 Return to debug level 34. 85 Return to debug level 33. 86 Return to debug level 32. 87 Return to debug level 31. 88 Return to debug level 30. 89 Return to debug level 29. 90 Return to debug level 28. 91 Return to debug level 27. 92 Return to debug level 26. 93 Return to debug level 25. 94 Return to debug level 24. 95 Return to debug level 23. 96 Return to debug level 22. 97 Return to debug level 21. 98 Return to debug level 20. 99 Return to debug level 19. 100 Return to debug level 18. 101 Return to debug level 17. 102 Return to debug level 16. 103 Return to debug level 15. 104 Return to debug level 14. 105 Return to debug level 13. 106 Return to debug level 12. 107 Return to debug level 11. 108 Return to debug level 10. 109 Return to debug level 9. 110 Return to debug level 8. 111 Return to debug level 7. 112 Return to debug level 6. 113 Return to debug level 5. 114 Return to debug level 4. 115 Return to debug level 3. 116 Return to debug level 2. 117 Return to debug level 1. 118 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 118. 2 Return to debug level 117. 3 Return to debug level 116. 4 Return to debug level 115. 5 Return to debug level 114. 6 Return to debug level 113. 7 Return to debug level 112. 8 Return to debug level 111. 9 Return to debug level 110. 10 Return to debug level 109. 11 Return to debug level 108. 12 Return to debug level 107. 13 Return to debug level 106. 14 Return to debug level 105. 15 Return to debug level 104. 16 Return to debug level 103. 17 Return to debug level 102. 18 Return to debug level 101. 19 Return to debug level 100. 20 Return to debug level 99. 21 Return to debug level 98. 22 Return to debug level 97. 23 Return to debug level 96. 24 Return to debug level 95. 25 Return to debug level 94. 26 Return to debug level 93. 27 Return to debug level 92. 28 Return to debug level 91. 29 Return to debug level 90. 30 Return to debug level 89. 31 Return to debug level 88. 32 Return to debug level 87. 33 Return to debug level 86. 34 Return to debug level 85. 35 Return to debug level 84. 36 Return to debug level 83. 37 Return to debug level 82. 38 Return to debug level 81. 39 Return to debug level 80. 40 Return to debug level 79. 41 Return to debug level 78. 42 Return to debug level 77. 43 Return to debug level 76. 44 Return to debug level 75. 45 Return to debug level 74. 46 Return to debug level 73. 47 Return to debug level 72. 48 Return to debug level 71. 49 Return to debug level 70. 50 Return to debug level 69. 51 Return to debug level 68. 52 Return to debug level 67. 53 Return to debug level 66. 54 Return to debug level 65. 55 Return to debug level 64. 56 Return to debug level 63. 57 Return to debug level 62. 58 Return to debug level 61. 59 Return to debug level 60. 60 Return to debug level 59. 61 Return to debug level 58. 62 Return to debug level 57. 63 Return to debug level 56. 64 Return to debug level 55. 65 Return to debug level 54. 66 Return to debug level 53. 67 Return to debug level 52. 68 Return to debug level 51. 69 Return to debug level 50. 70 Return to debug level 49. 71 Return to debug level 48. 72 Return to debug level 47. 73 Return to debug level 46. 74 Return to debug level 45. 75 Return to debug level 44. 76 Return to debug level 43. 77 Return to debug level 42. 78 Return to debug level 41. 79 Return to debug level 40. 80 Return to debug level 39. 81 Return to debug level 38. 82 Return to debug level 37. 83 Return to debug level 36. 84 Return to debug level 35. 85 Return to debug level 34. 86 Return to debug level 33. 87 Return to debug level 32. 88 Return to debug level 31. 89 Return to debug level 30. 90 Return to debug level 29. 91 Return to debug level 28. 92 Return to debug level 27. 93 Return to debug level 26. 94 Return to debug level 25. 95 Return to debug level 24. 96 Return to debug level 23. 97 Return to debug level 22. 98 Return to debug level 21. 99 Return to debug level 20. 100 Return to debug level 19. 101 Return to debug level 18. 102 Return to debug level 17. 103 Return to debug level 16. 104 Return to debug level 15. 105 Return to debug level 14. 106 Return to debug level 13. 107 Return to debug level 12. 108 Return to debug level 11. 109 Return to debug level 10. 110 Return to debug level 9. 111 Return to debug level 8. 112 Return to debug level 7. 113 Return to debug level 6. 114 Return to debug level 5. 115 Return to debug level 4. 116 Return to debug level 3. 117 Return to debug level 2. 118 Return to debug level 1. 119 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 119. 2 Return to debug level 118. 3 Return to debug level 117. 4 Return to debug level 116. 5 Return to debug level 115. 6 Return to debug level 114. 7 Return to debug level 113. 8 Return to debug level 112. 9 Return to debug level 111. 10 Return to debug level 110. 11 Return to debug level 109. 12 Return to debug level 108. 13 Return to debug level 107. 14 Return to debug level 106. 15 Return to debug level 105. 16 Return to debug level 104. 17 Return to debug level 103. 18 Return to debug level 102. 19 Return to debug level 101. 20 Return to debug level 100. 21 Return to debug level 99. 22 Return to debug level 98. 23 Return to debug level 97. 24 Return to debug level 96. 25 Return to debug level 95. 26 Return to debug level 94. 27 Return to debug level 93. 28 Return to debug level 92. 29 Return to debug level 91. 30 Return to debug level 90. 31 Return to debug level 89. 32 Return to debug level 88. 33 Return to debug level 87. 34 Return to debug level 86. 35 Return to debug level 85. 36 Return to debug level 84. 37 Return to debug level 83. 38 Return to debug level 82. 39 Return to debug level 81. 40 Return to debug level 80. 41 Return to debug level 79. 42 Return to debug level 78. 43 Return to debug level 77. 44 Return to debug level 76. 45 Return to debug level 75. 46 Return to debug level 74. 47 Return to debug level 73. 48 Return to debug level 72. 49 Return to debug level 71. 50 Return to debug level 70. 51 Return to debug level 69. 52 Return to debug level 68. 53 Return to debug level 67. 54 Return to debug level 66. 55 Return to debug level 65. 56 Return to debug level 64. 57 Return to debug level 63. 58 Return to debug level 62. 59 Return to debug level 61. 60 Return to debug level 60. 61 Return to debug level 59. 62 Return to debug level 58. 63 Return to debug level 57. 64 Return to debug level 56. 65 Return to debug level 55. 66 Return to debug level 54. 67 Return to debug level 53. 68 Return to debug level 52. 69 Return to debug level 51. 70 Return to debug level 50. 71 Return to debug level 49. 72 Return to debug level 48. 73 Return to debug level 47. 74 Return to debug level 46. 75 Return to debug level 45. 76 Return to debug level 44. 77 Return to debug level 43. 78 Return to debug level 42. 79 Return to debug level 41. 80 Return to debug level 40. 81 Return to debug level 39. 82 Return to debug level 38. 83 Return to debug level 37. 84 Return to debug level 36. 85 Return to debug level 35. 86 Return to debug level 34. 87 Return to debug level 33. 88 Return to debug level 32. 89 Return to debug level 31. 90 Return to debug level 30. 91 Return to debug level 29. 92 Return to debug level 28. 93 Return to debug level 27. 94 Return to debug level 26. 95 Return to debug level 25. 96 Return to debug level 24. 97 Return to debug level 23. 98 Return to debug level 22. 99 Return to debug level 21. 100 Return to debug level 20. 101 Return to debug level 19. 102 Return to debug level 18. 103 Return to debug level 17. 104 Return to debug level 16. 105 Return to debug level 15. 106 Return to debug level 14. 107 Return to debug level 13. 108 Return to debug level 12. 109 Return to debug level 11. 110 Return to debug level 10. 111 Return to debug level 9. 112 Return to debug level 8. 113 Return to debug level 7. 114 Return to debug level 6. 115 Return to debug level 5. 116 Return to debug level 4. 117 Return to debug level 3. 118 Return to debug level 2. 119 Return to debug level 1. 120 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 120. 2 Return to debug level 119. 3 Return to debug level 118. 4 Return to debug level 117. 5 Return to debug level 116. 6 Return to debug level 115. 7 Return to debug level 114. 8 Return to debug level 113. 9 Return to debug level 112. 10 Return to debug level 111. 11 Return to debug level 110. 12 Return to debug level 109. 13 Return to debug level 108. 14 Return to debug level 107. 15 Return to debug level 106. 16 Return to debug level 105. 17 Return to debug level 104. 18 Return to debug level 103. 19 Return to debug level 102. 20 Return to debug level 101. 21 Return to debug level 100. 22 Return to debug level 99. 23 Return to debug level 98. 24 Return to debug level 97. 25 Return to debug level 96. 26 Return to debug level 95. 27 Return to debug level 94. 28 Return to debug level 93. 29 Return to debug level 92. 30 Return to debug level 91. 31 Return to debug level 90. 32 Return to debug level 89. 33 Return to debug level 88. 34 Return to debug level 87. 35 Return to debug level 86. 36 Return to debug level 85. 37 Return to debug level 84. 38 Return to debug level 83. 39 Return to debug level 82. 40 Return to debug level 81. 41 Return to debug level 80. 42 Return to debug level 79. 43 Return to debug level 78. 44 Return to debug level 77. 45 Return to debug level 76. 46 Return to debug level 75. 47 Return to debug level 74. 48 Return to debug level 73. 49 Return to debug level 72. 50 Return to debug level 71. 51 Return to debug level 70. 52 Return to debug level 69. 53 Return to debug level 68. 54 Return to debug level 67. 55 Return to debug level 66. 56 Return to debug level 65. 57 Return to debug level 64. 58 Return to debug level 63. 59 Return to debug level 62. 60 Return to debug level 61. 61 Return to debug level 60. 62 Return to debug level 59. 63 Return to debug level 58. 64 Return to debug level 57. 65 Return to debug level 56. 66 Return to debug level 55. 67 Return to debug level 54. 68 Return to debug level 53. 69 Return to debug level 52. 70 Return to debug level 51. 71 Return to debug level 50. 72 Return to debug level 49. 73 Return to debug level 48. 74 Return to debug level 47. 75 Return to debug level 46. 76 Return to debug level 45. 77 Return to debug level 44. 78 Return to debug level 43. 79 Return to debug level 42. 80 Return to debug level 41. 81 Return to debug level 40. 82 Return to debug level 39. 83 Return to debug level 38. 84 Return to debug level 37. 85 Return to debug level 36. 86 Return to debug level 35. 87 Return to debug level 34. 88 Return to debug level 33. 89 Return to debug level 32. 90 Return to debug level 31. 91 Return to debug level 30. 92 Return to debug level 29. 93 Return to debug level 28. 94 Return to debug level 27. 95 Return to debug level 26. 96 Return to debug level 25. 97 Return to debug level 24. 98 Return to debug level 23. 99 Return to debug level 22. 100 Return to debug level 21. 101 Return to debug level 20. 102 Return to debug level 19. 103 Return to debug level 18. 104 Return to debug level 17. 105 Return to debug level 16. 106 Return to debug level 15. 107 Return to debug level 14. 108 Return to debug level 13. 109 Return to debug level 12. 110 Return to debug level 11. 111 Return to debug level 10. 112 Return to debug level 9. 113 Return to debug level 8. 114 Return to debug level 7. 115 Return to debug level 6. 116 Return to debug level 5. 117 Return to debug level 4. 118 Return to debug level 3. 119 Return to debug level 2. 120 Return to debug level 1. 121 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 121. 2 Return to debug level 120. 3 Return to debug level 119. 4 Return to debug level 118. 5 Return to debug level 117. 6 Return to debug level 116. 7 Return to debug level 115. 8 Return to debug level 114. 9 Return to debug level 113. 10 Return to debug level 112. 11 Return to debug level 111. 12 Return to debug level 110. 13 Return to debug level 109. 14 Return to debug level 108. 15 Return to debug level 107. 16 Return to debug level 106. 17 Return to debug level 105. 18 Return to debug level 104. 19 Return to debug level 103. 20 Return to debug level 102. 21 Return to debug level 101. 22 Return to debug level 100. 23 Return to debug level 99. 24 Return to debug level 98. 25 Return to debug level 97. 26 Return to debug level 96. 27 Return to debug level 95. 28 Return to debug level 94. 29 Return to debug level 93. 30 Return to debug level 92. 31 Return to debug level 91. 32 Return to debug level 90. 33 Return to debug level 89. 34 Return to debug level 88. 35 Return to debug level 87. 36 Return to debug level 86. 37 Return to debug level 85. 38 Return to debug level 84. 39 Return to debug level 83. 40 Return to debug level 82. 41 Return to debug level 81. 42 Return to debug level 80. 43 Return to debug level 79. 44 Return to debug level 78. 45 Return to debug level 77. 46 Return to debug level 76. 47 Return to debug level 75. 48 Return to debug level 74. 49 Return to debug level 73. 50 Return to debug level 72. 51 Return to debug level 71. 52 Return to debug level 70. 53 Return to debug level 69. 54 Return to debug level 68. 55 Return to debug level 67. 56 Return to debug level 66. 57 Return to debug level 65. 58 Return to debug level 64. 59 Return to debug level 63. 60 Return to debug level 62. 61 Return to debug level 61. 62 Return to debug level 60. 63 Return to debug level 59. 64 Return to debug level 58. 65 Return to debug level 57. 66 Return to debug level 56. 67 Return to debug level 55. 68 Return to debug level 54. 69 Return to debug level 53. 70 Return to debug level 52. 71 Return to debug level 51. 72 Return to debug level 50. 73 Return to debug level 49. 74 Return to debug level 48. 75 Return to debug level 47. 76 Return to debug level 46. 77 Return to debug level 45. 78 Return to debug level 44. 79 Return to debug level 43. 80 Return to debug level 42. 81 Return to debug level 41. 82 Return to debug level 40. 83 Return to debug level 39. 84 Return to debug level 38. 85 Return to debug level 37. 86 Return to debug level 36. 87 Return to debug level 35. 88 Return to debug level 34. 89 Return to debug level 33. 90 Return to debug level 32. 91 Return to debug level 31. 92 Return to debug level 30. 93 Return to debug level 29. 94 Return to debug level 28. 95 Return to debug level 27. 96 Return to debug level 26. 97 Return to debug level 25. 98 Return to debug level 24. 99 Return to debug level 23. 100 Return to debug level 22. 101 Return to debug level 21. 102 Return to debug level 20. 103 Return to debug level 19. 104 Return to debug level 18. 105 Return to debug level 17. 106 Return to debug level 16. 107 Return to debug level 15. 108 Return to debug level 14. 109 Return to debug level 13. 110 Return to debug level 12. 111 Return to debug level 11. 112 Return to debug level 10. 113 Return to debug level 9. 114 Return to debug level 8. 115 Return to debug level 7. 116 Return to debug level 6. 117 Return to debug level 5. 118 Return to debug level 4. 119 Return to debug level 3. 120 Return to debug level 2. 121 Return to debug level 1. 122 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 122. 2 Return to debug level 121. 3 Return to debug level 120. 4 Return to debug level 119. 5 Return to debug level 118. 6 Return to debug level 117. 7 Return to debug level 116. 8 Return to debug level 115. 9 Return to debug level 114. 10 Return to debug level 113. 11 Return to debug level 112. 12 Return to debug level 111. 13 Return to debug level 110. 14 Return to debug level 109. 15 Return to debug level 108. 16 Return to debug level 107. 17 Return to debug level 106. 18 Return to debug level 105. 19 Return to debug level 104. 20 Return to debug level 103. 21 Return to debug level 102. 22 Return to debug level 101. 23 Return to debug level 100. 24 Return to debug level 99. 25 Return to debug level 98. 26 Return to debug level 97. 27 Return to debug level 96. 28 Return to debug level 95. 29 Return to debug level 94. 30 Return to debug level 93. 31 Return to debug level 92. 32 Return to debug level 91. 33 Return to debug level 90. 34 Return to debug level 89. 35 Return to debug level 88. 36 Return to debug level 87. 37 Return to debug level 86. 38 Return to debug level 85. 39 Return to debug level 84. 40 Return to debug level 83. 41 Return to debug level 82. 42 Return to debug level 81. 43 Return to debug level 80. 44 Return to debug level 79. 45 Return to debug level 78. 46 Return to debug level 77. 47 Return to debug level 76. 48 Return to debug level 75. 49 Return to debug level 74. 50 Return to debug level 73. 51 Return to debug level 72. 52 Return to debug level 71. 53 Return to debug level 70. 54 Return to debug level 69. 55 Return to debug level 68. 56 Return to debug level 67. 57 Return to debug level 66. 58 Return to debug level 65. 59 Return to debug level 64. 60 Return to debug level 63. 61 Return to debug level 62. 62 Return to debug level 61. 63 Return to debug level 60. 64 Return to debug level 59. 65 Return to debug level 58. 66 Return to debug level 57. 67 Return to debug level 56. 68 Return to debug level 55. 69 Return to debug level 54. 70 Return to debug level 53. 71 Return to debug level 52. 72 Return to debug level 51. 73 Return to debug level 50. 74 Return to debug level 49. 75 Return to debug level 48. 76 Return to debug level 47. 77 Return to debug level 46. 78 Return to debug level 45. 79 Return to debug level 44. 80 Return to debug level 43. 81 Return to debug level 42. 82 Return to debug level 41. 83 Return to debug level 40. 84 Return to debug level 39. 85 Return to debug level 38. 86 Return to debug level 37. 87 Return to debug level 36. 88 Return to debug level 35. 89 Return to debug level 34. 90 Return to debug level 33. 91 Return to debug level 32. 92 Return to debug level 31. 93 Return to debug level 30. 94 Return to debug level 29. 95 Return to debug level 28. 96 Return to debug level 27. 97 Return to debug level 26. 98 Return to debug level 25. 99 Return to debug level 24. 100 Return to debug level 23. 101 Return to debug level 22. 102 Return to debug level 21. 103 Return to debug level 20. 104 Return to debug level 19. 105 Return to debug level 18. 106 Return to debug level 17. 107 Return to debug level 16. 108 Return to debug level 15. 109 Return to debug level 14. 110 Return to debug level 13. 111 Return to debug level 12. 112 Return to debug level 11. 113 Return to debug level 10. 114 Return to debug level 9. 115 Return to debug level 8. 116 Return to debug level 7. 117 Return to debug level 6. 118 Return to debug level 5. 119 Return to debug level 4. 120 Return to debug level 3. 121 Return to debug level 2. 122 Return to debug level 1. 123 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 123. 2 Return to debug level 122. 3 Return to debug level 121. 4 Return to debug level 120. 5 Return to debug level 119. 6 Return to debug level 118. 7 Return to debug level 117. 8 Return to debug level 116. 9 Return to debug level 115. 10 Return to debug level 114. 11 Return to debug level 113. 12 Return to debug level 112. 13 Return to debug level 111. 14 Return to debug level 110. 15 Return to debug level 109. 16 Return to debug level 108. 17 Return to debug level 107. 18 Return to debug level 106. 19 Return to debug level 105. 20 Return to debug level 104. 21 Return to debug level 103. 22 Return to debug level 102. 23 Return to debug level 101. 24 Return to debug level 100. 25 Return to debug level 99. 26 Return to debug level 98. 27 Return to debug level 97. 28 Return to debug level 96. 29 Return to debug level 95. 30 Return to debug level 94. 31 Return to debug level 93. 32 Return to debug level 92. 33 Return to debug level 91. 34 Return to debug level 90. 35 Return to debug level 89. 36 Return to debug level 88. 37 Return to debug level 87. 38 Return to debug level 86. 39 Return to debug level 85. 40 Return to debug level 84. 41 Return to debug level 83. 42 Return to debug level 82. 43 Return to debug level 81. 44 Return to debug level 80. 45 Return to debug level 79. 46 Return to debug level 78. 47 Return to debug level 77. 48 Return to debug level 76. 49 Return to debug level 75. 50 Return to debug level 74. 51 Return to debug level 73. 52 Return to debug level 72. 53 Return to debug level 71. 54 Return to debug level 70. 55 Return to debug level 69. 56 Return to debug level 68. 57 Return to debug level 67. 58 Return to debug level 66. 59 Return to debug level 65. 60 Return to debug level 64. 61 Return to debug level 63. 62 Return to debug level 62. 63 Return to debug level 61. 64 Return to debug level 60. 65 Return to debug level 59. 66 Return to debug level 58. 67 Return to debug level 57. 68 Return to debug level 56. 69 Return to debug level 55. 70 Return to debug level 54. 71 Return to debug level 53. 72 Return to debug level 52. 73 Return to debug level 51. 74 Return to debug level 50. 75 Return to debug level 49. 76 Return to debug level 48. 77 Return to debug level 47. 78 Return to debug level 46. 79 Return to debug level 45. 80 Return to debug level 44. 81 Return to debug level 43. 82 Return to debug level 42. 83 Return to debug level 41. 84 Return to debug level 40. 85 Return to debug level 39. 86 Return to debug level 38. 87 Return to debug level 37. 88 Return to debug level 36. 89 Return to debug level 35. 90 Return to debug level 34. 91 Return to debug level 33. 92 Return to debug level 32. 93 Return to debug level 31. 94 Return to debug level 30. 95 Return to debug level 29. 96 Return to debug level 28. 97 Return to debug level 27. 98 Return to debug level 26. 99 Return to debug level 25. 100 Return to debug level 24. 101 Return to debug level 23. 102 Return to debug level 22. 103 Return to debug level 21. 104 Return to debug level 20. 105 Return to debug level 19. 106 Return to debug level 18. 107 Return to debug level 17. 108 Return to debug level 16. 109 Return to debug level 15. 110 Return to debug level 14. 111 Return to debug level 13. 112 Return to debug level 12. 113 Return to debug level 11. 114 Return to debug level 10. 115 Return to debug level 9. 116 Return to debug level 8. 117 Return to debug level 7. 118 Return to debug level 6. 119 Return to debug level 5. 120 Return to debug level 4. 121 Return to debug level 3. 122 Return to debug level 2. 123 Return to debug level 1. 124 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 124. 2 Return to debug level 123. 3 Return to debug level 122. 4 Return to debug level 121. 5 Return to debug level 120. 6 Return to debug level 119. 7 Return to debug level 118. 8 Return to debug level 117. 9 Return to debug level 116. 10 Return to debug level 115. 11 Return to debug level 114. 12 Return to debug level 113. 13 Return to debug level 112. 14 Return to debug level 111. 15 Return to debug level 110. 16 Return to debug level 109. 17 Return to debug level 108. 18 Return to debug level 107. 19 Return to debug level 106. 20 Return to debug level 105. 21 Return to debug level 104. 22 Return to debug level 103. 23 Return to debug level 102. 24 Return to debug level 101. 25 Return to debug level 100. 26 Return to debug level 99. 27 Return to debug level 98. 28 Return to debug level 97. 29 Return to debug level 96. 30 Return to debug level 95. 31 Return to debug level 94. 32 Return to debug level 93. 33 Return to debug level 92. 34 Return to debug level 91. 35 Return to debug level 90. 36 Return to debug level 89. 37 Return to debug level 88. 38 Return to debug level 87. 39 Return to debug level 86. 40 Return to debug level 85. 41 Return to debug level 84. 42 Return to debug level 83. 43 Return to debug level 82. 44 Return to debug level 81. 45 Return to debug level 80. 46 Return to debug level 79. 47 Return to debug level 78. 48 Return to debug level 77. 49 Return to debug level 76. 50 Return to debug level 75. 51 Return to debug level 74. 52 Return to debug level 73. 53 Return to debug level 72. 54 Return to debug level 71. 55 Return to debug level 70. 56 Return to debug level 69. 57 Return to debug level 68. 58 Return to debug level 67. 59 Return to debug level 66. 60 Return to debug level 65. 61 Return to debug level 64. 62 Return to debug level 63. 63 Return to debug level 62. 64 Return to debug level 61. 65 Return to debug level 60. 66 Return to debug level 59. 67 Return to debug level 58. 68 Return to debug level 57. 69 Return to debug level 56. 70 Return to debug level 55. 71 Return to debug level 54. 72 Return to debug level 53. 73 Return to debug level 52. 74 Return to debug level 51. 75 Return to debug level 50. 76 Return to debug level 49. 77 Return to debug level 48. 78 Return to debug level 47. 79 Return to debug level 46. 80 Return to debug level 45. 81 Return to debug level 44. 82 Return to debug level 43. 83 Return to debug level 42. 84 Return to debug level 41. 85 Return to debug level 40. 86 Return to debug level 39. 87 Return to debug level 38. 88 Return to debug level 37. 89 Return to debug level 36. 90 Return to debug level 35. 91 Return to debug level 34. 92 Return to debug level 33. 93 Return to debug level 32. 94 Return to debug level 31. 95 Return to debug level 30. 96 Return to debug level 29. 97 Return to debug level 28. 98 Return to debug level 27. 99 Return to debug level 26. 100 Return to debug level 25. 101 Return to debug level 24. 102 Return to debug level 23. 103 Return to debug level 22. 104 Return to debug level 21. 105 Return to debug level 20. 106 Return to debug level 19. 107 Return to debug level 18. 108 Return to debug level 17. 109 Return to debug level 16. 110 Return to debug level 15. 111 Return to debug level 14. 112 Return to debug level 13. 113 Return to debug level 12. 114 Return to debug level 11. 115 Return to debug level 10. 116 Return to debug level 9. 117 Return to debug level 8. 118 Return to debug level 7. 119 Return to debug level 6. 120 Return to debug level 5. 121 Return to debug level 4. 122 Return to debug level 3. 123 Return to debug level 2. 124 Return to debug level 1. 125 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 125. 2 Return to debug level 124. 3 Return to debug level 123. 4 Return to debug level 122. 5 Return to debug level 121. 6 Return to debug level 120. 7 Return to debug level 119. 8 Return to debug level 118. 9 Return to debug level 117. 10 Return to debug level 116. 11 Return to debug level 115. 12 Return to debug level 114. 13 Return to debug level 113. 14 Return to debug level 112. 15 Return to debug level 111. 16 Return to debug level 110. 17 Return to debug level 109. 18 Return to debug level 108. 19 Return to debug level 107. 20 Return to debug level 106. 21 Return to debug level 105. 22 Return to debug level 104. 23 Return to debug level 103. 24 Return to debug level 102. 25 Return to debug level 101. 26 Return to debug level 100. 27 Return to debug level 99. 28 Return to debug level 98. 29 Return to debug level 97. 30 Return to debug level 96. 31 Return to debug level 95. 32 Return to debug level 94. 33 Return to debug level 93. 34 Return to debug level 92. 35 Return to debug level 91. 36 Return to debug level 90. 37 Return to debug level 89. 38 Return to debug level 88. 39 Return to debug level 87. 40 Return to debug level 86. 41 Return to debug level 85. 42 Return to debug level 84. 43 Return to debug level 83. 44 Return to debug level 82. 45 Return to debug level 81. 46 Return to debug level 80. 47 Return to debug level 79. 48 Return to debug level 78. 49 Return to debug level 77. 50 Return to debug level 76. 51 Return to debug level 75. 52 Return to debug level 74. 53 Return to debug level 73. 54 Return to debug level 72. 55 Return to debug level 71. 56 Return to debug level 70. 57 Return to debug level 69. 58 Return to debug level 68. 59 Return to debug level 67. 60 Return to debug level 66. 61 Return to debug level 65. 62 Return to debug level 64. 63 Return to debug level 63. 64 Return to debug level 62. 65 Return to debug level 61. 66 Return to debug level 60. 67 Return to debug level 59. 68 Return to debug level 58. 69 Return to debug level 57. 70 Return to debug level 56. 71 Return to debug level 55. 72 Return to debug level 54. 73 Return to debug level 53. 74 Return to debug level 52. 75 Return to debug level 51. 76 Return to debug level 50. 77 Return to debug level 49. 78 Return to debug level 48. 79 Return to debug level 47. 80 Return to debug level 46. 81 Return to debug level 45. 82 Return to debug level 44. 83 Return to debug level 43. 84 Return to debug level 42. 85 Return to debug level 41. 86 Return to debug level 40. 87 Return to debug level 39. 88 Return to debug level 38. 89 Return to debug level 37. 90 Return to debug level 36. 91 Return to debug level 35. 92 Return to debug level 34. 93 Return to debug level 33. 94 Return to debug level 32. 95 Return to debug level 31. 96 Return to debug level 30. 97 Return to debug level 29. 98 Return to debug level 28. 99 Return to debug level 27. 100 Return to debug level 26. 101 Return to debug level 25. 102 Return to debug level 24. 103 Return to debug level 23. 104 Return to debug level 22. 105 Return to debug level 21. 106 Return to debug level 20. 107 Return to debug level 19. 108 Return to debug level 18. 109 Return to debug level 17. 110 Return to debug level 16. 111 Return to debug level 15. 112 Return to debug level 14. 113 Return to debug level 13. 114 Return to debug level 12. 115 Return to debug level 11. 116 Return to debug level 10. 117 Return to debug level 9. 118 Return to debug level 8. 119 Return to debug level 7. 120 Return to debug level 6. 121 Return to debug level 5. 122 Return to debug level 4. 123 Return to debug level 3. 124 Return to debug level 2. 125 Return to debug level 1. 126 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 126. 2 Return to debug level 125. 3 Return to debug level 124. 4 Return to debug level 123. 5 Return to debug level 122. 6 Return to debug level 121. 7 Return to debug level 120. 8 Return to debug level 119. 9 Return to debug level 118. 10 Return to debug level 117. 11 Return to debug level 116. 12 Return to debug level 115. 13 Return to debug level 114. 14 Return to debug level 113. 15 Return to debug level 112. 16 Return to debug level 111. 17 Return to debug level 110. 18 Return to debug level 109. 19 Return to debug level 108. 20 Return to debug level 107. 21 Return to debug level 106. 22 Return to debug level 105. 23 Return to debug level 104. 24 Return to debug level 103. 25 Return to debug level 102. 26 Return to debug level 101. 27 Return to debug level 100. 28 Return to debug level 99. 29 Return to debug level 98. 30 Return to debug level 97. 31 Return to debug level 96. 32 Return to debug level 95. 33 Return to debug level 94. 34 Return to debug level 93. 35 Return to debug level 92. 36 Return to debug level 91. 37 Return to debug level 90. 38 Return to debug level 89. 39 Return to debug level 88. 40 Return to debug level 87. 41 Return to debug level 86. 42 Return to debug level 85. 43 Return to debug level 84. 44 Return to debug level 83. 45 Return to debug level 82. 46 Return to debug level 81. 47 Return to debug level 80. 48 Return to debug level 79. 49 Return to debug level 78. 50 Return to debug level 77. 51 Return to debug level 76. 52 Return to debug level 75. 53 Return to debug level 74. 54 Return to debug level 73. 55 Return to debug level 72. 56 Return to debug level 71. 57 Return to debug level 70. 58 Return to debug level 69. 59 Return to debug level 68. 60 Return to debug level 67. 61 Return to debug level 66. 62 Return to debug level 65. 63 Return to debug level 64. 64 Return to debug level 63. 65 Return to debug level 62. 66 Return to debug level 61. 67 Return to debug level 60. 68 Return to debug level 59. 69 Return to debug level 58. 70 Return to debug level 57. 71 Return to debug level 56. 72 Return to debug level 55. 73 Return to debug level 54. 74 Return to debug level 53. 75 Return to debug level 52. 76 Return to debug level 51. 77 Return to debug level 50. 78 Return to debug level 49. 79 Return to debug level 48. 80 Return to debug level 47. 81 Return to debug level 46. 82 Return to debug level 45. 83 Return to debug level 44. 84 Return to debug level 43. 85 Return to debug level 42. 86 Return to debug level 41. 87 Return to debug level 40. 88 Return to debug level 39. 89 Return to debug level 38. 90 Return to debug level 37. 91 Return to debug level 36. 92 Return to debug level 35. 93 Return to debug level 34. 94 Return to debug level 33. 95 Return to debug level 32. 96 Return to debug level 31. 97 Return to debug level 30. 98 Return to debug level 29. 99 Return to debug level 28. 100 Return to debug level 27. 101 Return to debug level 26. 102 Return to debug level 25. 103 Return to debug level 24. 104 Return to debug level 23. 105 Return to debug level 22. 106 Return to debug level 21. 107 Return to debug level 20. 108 Return to debug level 19. 109 Return to debug level 18. 110 Return to debug level 17. 111 Return to debug level 16. 112 Return to debug level 15. 113 Return to debug level 14. 114 Return to debug level 13. 115 Return to debug level 12. 116 Return to debug level 11. 117 Return to debug level 10. 118 Return to debug level 9. 119 Return to debug level 8. 120 Return to debug level 7. 121 Return to debug level 6. 122 Return to debug level 5. 123 Return to debug level 4. 124 Return to debug level 3. 125 Return to debug level 2. 126 Return to debug level 1. 127 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 127. 2 Return to debug level 126. 3 Return to debug level 125. 4 Return to debug level 124. 5 Return to debug level 123. 6 Return to debug level 122. 7 Return to debug level 121. 8 Return to debug level 120. 9 Return to debug level 119. 10 Return to debug level 118. 11 Return to debug level 117. 12 Return to debug level 116. 13 Return to debug level 115. 14 Return to debug level 114. 15 Return to debug level 113. 16 Return to debug level 112. 17 Return to debug level 111. 18 Return to debug level 110. 19 Return to debug level 109. 20 Return to debug level 108. 21 Return to debug level 107. 22 Return to debug level 106. 23 Return to debug level 105. 24 Return to debug level 104. 25 Return to debug level 103. 26 Return to debug level 102. 27 Return to debug level 101. 28 Return to debug level 100. 29 Return to debug level 99. 30 Return to debug level 98. 31 Return to debug level 97. 32 Return to debug level 96. 33 Return to debug level 95. 34 Return to debug level 94. 35 Return to debug level 93. 36 Return to debug level 92. 37 Return to debug level 91. 38 Return to debug level 90. 39 Return to debug level 89. 40 Return to debug level 88. 41 Return to debug level 87. 42 Return to debug level 86. 43 Return to debug level 85. 44 Return to debug level 84. 45 Return to debug level 83. 46 Return to debug level 82. 47 Return to debug level 81. 48 Return to debug level 80. 49 Return to debug level 79. 50 Return to debug level 78. 51 Return to debug level 77. 52 Return to debug level 76. 53 Return to debug level 75. 54 Return to debug level 74. 55 Return to debug level 73. 56 Return to debug level 72. 57 Return to debug level 71. 58 Return to debug level 70. 59 Return to debug level 69. 60 Return to debug level 68. 61 Return to debug level 67. 62 Return to debug level 66. 63 Return to debug level 65. 64 Return to debug level 64. 65 Return to debug level 63. 66 Return to debug level 62. 67 Return to debug level 61. 68 Return to debug level 60. 69 Return to debug level 59. 70 Return to debug level 58. 71 Return to debug level 57. 72 Return to debug level 56. 73 Return to debug level 55. 74 Return to debug level 54. 75 Return to debug level 53. 76 Return to debug level 52. 77 Return to debug level 51. 78 Return to debug level 50. 79 Return to debug level 49. 80 Return to debug level 48. 81 Return to debug level 47. 82 Return to debug level 46. 83 Return to debug level 45. 84 Return to debug level 44. 85 Return to debug level 43. 86 Return to debug level 42. 87 Return to debug level 41. 88 Return to debug level 40. 89 Return to debug level 39. 90 Return to debug level 38. 91 Return to debug level 37. 92 Return to debug level 36. 93 Return to debug level 35. 94 Return to debug level 34. 95 Return to debug level 33. 96 Return to debug level 32. 97 Return to debug level 31. 98 Return to debug level 30. 99 Return to debug level 29. 100 Return to debug level 28. 101 Return to debug level 27. 102 Return to debug level 26. 103 Return to debug level 25. 104 Return to debug level 24. 105 Return to debug level 23. 106 Return to debug level 22. 107 Return to debug level 21. 108 Return to debug level 20. 109 Return to debug level 19. 110 Return to debug level 18. 111 Return to debug level 17. 112 Return to debug level 16. 113 Return to debug level 15. 114 Return to debug level 14. 115 Return to debug level 13. 116 Return to debug level 12. 117 Return to debug level 11. 118 Return to debug level 10. 119 Return to debug level 9. 120 Return to debug level 8. 121 Return to debug level 7. 122 Return to debug level 6. 123 Return to debug level 5. 124 Return to debug level 4. 125 Return to debug level 3. 126 Return to debug level 2. 127 Return to debug level 1. 128 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 128. 2 Return to debug level 127. 3 Return to debug level 126. 4 Return to debug level 125. 5 Return to debug level 124. 6 Return to debug level 123. 7 Return to debug level 122. 8 Return to debug level 121. 9 Return to debug level 120. 10 Return to debug level 119. 11 Return to debug level 118. 12 Return to debug level 117. 13 Return to debug level 116. 14 Return to debug level 115. 15 Return to debug level 114. 16 Return to debug level 113. 17 Return to debug level 112. 18 Return to debug level 111. 19 Return to debug level 110. 20 Return to debug level 109. 21 Return to debug level 108. 22 Return to debug level 107. 23 Return to debug level 106. 24 Return to debug level 105. 25 Return to debug level 104. 26 Return to debug level 103. 27 Return to debug level 102. 28 Return to debug level 101. 29 Return to debug level 100. 30 Return to debug level 99. 31 Return to debug level 98. 32 Return to debug level 97. 33 Return to debug level 96. 34 Return to debug level 95. 35 Return to debug level 94. 36 Return to debug level 93. 37 Return to debug level 92. 38 Return to debug level 91. 39 Return to debug level 90. 40 Return to debug level 89. 41 Return to debug level 88. 42 Return to debug level 87. 43 Return to debug level 86. 44 Return to debug level 85. 45 Return to debug level 84. 46 Return to debug level 83. 47 Return to debug level 82. 48 Return to debug level 81. 49 Return to debug level 80. 50 Return to debug level 79. 51 Return to debug level 78. 52 Return to debug level 77. 53 Return to debug level 76. 54 Return to debug level 75. 55 Return to debug level 74. 56 Return to debug level 73. 57 Return to debug level 72. 58 Return to debug level 71. 59 Return to debug level 70. 60 Return to debug level 69. 61 Return to debug level 68. 62 Return to debug level 67. 63 Return to debug level 66. 64 Return to debug level 65. 65 Return to debug level 64. 66 Return to debug level 63. 67 Return to debug level 62. 68 Return to debug level 61. 69 Return to debug level 60. 70 Return to debug level 59. 71 Return to debug level 58. 72 Return to debug level 57. 73 Return to debug level 56. 74 Return to debug level 55. 75 Return to debug level 54. 76 Return to debug level 53. 77 Return to debug level 52. 78 Return to debug level 51. 79 Return to debug level 50. 80 Return to debug level 49. 81 Return to debug level 48. 82 Return to debug level 47. 83 Return to debug level 46. 84 Return to debug level 45. 85 Return to debug level 44. 86 Return to debug level 43. 87 Return to debug level 42. 88 Return to debug level 41. 89 Return to debug level 40. 90 Return to debug level 39. 91 Return to debug level 38. 92 Return to debug level 37. 93 Return to debug level 36. 94 Return to debug level 35. 95 Return to debug level 34. 96 Return to debug level 33. 97 Return to debug level 32. 98 Return to debug level 31. 99 Return to debug level 30. 100 Return to debug level 29. 101 Return to debug level 28. 102 Return to debug level 27. 103 Return to debug level 26. 104 Return to debug level 25. 105 Return to debug level 24. 106 Return to debug level 23. 107 Return to debug level 22. 108 Return to debug level 21. 109 Return to debug level 20. 110 Return to debug level 19. 111 Return to debug level 18. 112 Return to debug level 17. 113 Return to debug level 16. 114 Return to debug level 15. 115 Return to debug level 14. 116 Return to debug level 13. 117 Return to debug level 12. 118 Return to debug level 11. 119 Return to debug level 10. 120 Return to debug level 9. 121 Return to debug level 8. 122 Return to debug level 7. 123 Return to debug level 6. 124 Return to debug level 5. 125 Return to debug level 4. 126 Return to debug level 3. 127 Return to debug level 2. 128 Return to debug level 1. 129 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 129. 2 Return to debug level 128. 3 Return to debug level 127. 4 Return to debug level 126. 5 Return to debug level 125. 6 Return to debug level 124. 7 Return to debug level 123. 8 Return to debug level 122. 9 Return to debug level 121. 10 Return to debug level 120. 11 Return to debug level 119. 12 Return to debug level 118. 13 Return to debug level 117. 14 Return to debug level 116. 15 Return to debug level 115. 16 Return to debug level 114. 17 Return to debug level 113. 18 Return to debug level 112. 19 Return to debug level 111. 20 Return to debug level 110. 21 Return to debug level 109. 22 Return to debug level 108. 23 Return to debug level 107. 24 Return to debug level 106. 25 Return to debug level 105. 26 Return to debug level 104. 27 Return to debug level 103. 28 Return to debug level 102. 29 Return to debug level 101. 30 Return to debug level 100. 31 Return to debug level 99. 32 Return to debug level 98. 33 Return to debug level 97. 34 Return to debug level 96. 35 Return to debug level 95. 36 Return to debug level 94. 37 Return to debug level 93. 38 Return to debug level 92. 39 Return to debug level 91. 40 Return to debug level 90. 41 Return to debug level 89. 42 Return to debug level 88. 43 Return to debug level 87. 44 Return to debug level 86. 45 Return to debug level 85. 46 Return to debug level 84. 47 Return to debug level 83. 48 Return to debug level 82. 49 Return to debug level 81. 50 Return to debug level 80. 51 Return to debug level 79. 52 Return to debug level 78. 53 Return to debug level 77. 54 Return to debug level 76. 55 Return to debug level 75. 56 Return to debug level 74. 57 Return to debug level 73. 58 Return to debug level 72. 59 Return to debug level 71. 60 Return to debug level 70. 61 Return to debug level 69. 62 Return to debug level 68. 63 Return to debug level 67. 64 Return to debug level 66. 65 Return to debug level 65. 66 Return to debug level 64. 67 Return to debug level 63. 68 Return to debug level 62. 69 Return to debug level 61. 70 Return to debug level 60. 71 Return to debug level 59. 72 Return to debug level 58. 73 Return to debug level 57. 74 Return to debug level 56. 75 Return to debug level 55. 76 Return to debug level 54. 77 Return to debug level 53. 78 Return to debug level 52. 79 Return to debug level 51. 80 Return to debug level 50. 81 Return to debug level 49. 82 Return to debug level 48. 83 Return to debug level 47. 84 Return to debug level 46. 85 Return to debug level 45. 86 Return to debug level 44. 87 Return to debug level 43. 88 Return to debug level 42. 89 Return to debug level 41. 90 Return to debug level 40. 91 Return to debug level 39. 92 Return to debug level 38. 93 Return to debug level 37. 94 Return to debug level 36. 95 Return to debug level 35. 96 Return to debug level 34. 97 Return to debug level 33. 98 Return to debug level 32. 99 Return to debug level 31. 100 Return to debug level 30. 101 Return to debug level 29. 102 Return to debug level 28. 103 Return to debug level 27. 104 Return to debug level 26. 105 Return to debug level 25. 106 Return to debug level 24. 107 Return to debug level 23. 108 Return to debug level 22. 109 Return to debug level 21. 110 Return to debug level 20. 111 Return to debug level 19. 112 Return to debug level 18. 113 Return to debug level 17. 114 Return to debug level 16. 115 Return to debug level 15. 116 Return to debug level 14. 117 Return to debug level 13. 118 Return to debug level 12. 119 Return to debug level 11. 120 Return to debug level 10. 121 Return to debug level 9. 122 Return to debug level 8. 123 Return to debug level 7. 124 Return to debug level 6. 125 Return to debug level 5. 126 Return to debug level 4. 127 Return to debug level 3. 128 Return to debug level 2. 129 Return to debug level 1. 130 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 130. 2 Return to debug level 129. 3 Return to debug level 128. 4 Return to debug level 127. 5 Return to debug level 126. 6 Return to debug level 125. 7 Return to debug level 124. 8 Return to debug level 123. 9 Return to debug level 122. 10 Return to debug level 121. 11 Return to debug level 120. 12 Return to debug level 119. 13 Return to debug level 118. 14 Return to debug level 117. 15 Return to debug level 116. 16 Return to debug level 115. 17 Return to debug level 114. 18 Return to debug level 113. 19 Return to debug level 112. 20 Return to debug level 111. 21 Return to debug level 110. 22 Return to debug level 109. 23 Return to debug level 108. 24 Return to debug level 107. 25 Return to debug level 106. 26 Return to debug level 105. 27 Return to debug level 104. 28 Return to debug level 103. 29 Return to debug level 102. 30 Return to debug level 101. 31 Return to debug level 100. 32 Return to debug level 99. 33 Return to debug level 98. 34 Return to debug level 97. 35 Return to debug level 96. 36 Return to debug level 95. 37 Return to debug level 94. 38 Return to debug level 93. 39 Return to debug level 92. 40 Return to debug level 91. 41 Return to debug level 90. 42 Return to debug level 89. 43 Return to debug level 88. 44 Return to debug level 87. 45 Return to debug level 86. 46 Return to debug level 85. 47 Return to debug level 84. 48 Return to debug level 83. 49 Return to debug level 82. 50 Return to debug level 81. 51 Return to debug level 80. 52 Return to debug level 79. 53 Return to debug level 78. 54 Return to debug level 77. 55 Return to debug level 76. 56 Return to debug level 75. 57 Return to debug level 74. 58 Return to debug level 73. 59 Return to debug level 72. 60 Return to debug level 71. 61 Return to debug level 70. 62 Return to debug level 69. 63 Return to debug level 68. 64 Return to debug level 67. 65 Return to debug level 66. 66 Return to debug level 65. 67 Return to debug level 64. 68 Return to debug level 63. 69 Return to debug level 62. 70 Return to debug level 61. 71 Return to debug level 60. 72 Return to debug level 59. 73 Return to debug level 58. 74 Return to debug level 57. 75 Return to debug level 56. 76 Return to debug level 55. 77 Return to debug level 54. 78 Return to debug level 53. 79 Return to debug level 52. 80 Return to debug level 51. 81 Return to debug level 50. 82 Return to debug level 49. 83 Return to debug level 48. 84 Return to debug level 47. 85 Return to debug level 46. 86 Return to debug level 45. 87 Return to debug level 44. 88 Return to debug level 43. 89 Return to debug level 42. 90 Return to debug level 41. 91 Return to debug level 40. 92 Return to debug level 39. 93 Return to debug level 38. 94 Return to debug level 37. 95 Return to debug level 36. 96 Return to debug level 35. 97 Return to debug level 34. 98 Return to debug level 33. 99 Return to debug level 32. 100 Return to debug level 31. 101 Return to debug level 30. 102 Return to debug level 29. 103 Return to debug level 28. 104 Return to debug level 27. 105 Return to debug level 26. 106 Return to debug level 25. 107 Return to debug level 24. 108 Return to debug level 23. 109 Return to debug level 22. 110 Return to debug level 21. 111 Return to debug level 20. 112 Return to debug level 19. 113 Return to debug level 18. 114 Return to debug level 17. 115 Return to debug level 16. 116 Return to debug level 15. 117 Return to debug level 14. 118 Return to debug level 13. 119 Return to debug level 12. 120 Return to debug level 11. 121 Return to debug level 10. 122 Return to debug level 9. 123 Return to debug level 8. 124 Return to debug level 7. 125 Return to debug level 6. 126 Return to debug level 5. 127 Return to debug level 4. 128 Return to debug level 3. 129 Return to debug level 2. 130 Return to debug level 1. 131 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 131. 2 Return to debug level 130. 3 Return to debug level 129. 4 Return to debug level 128. 5 Return to debug level 127. 6 Return to debug level 126. 7 Return to debug level 125. 8 Return to debug level 124. 9 Return to debug level 123. 10 Return to debug level 122. 11 Return to debug level 121. 12 Return to debug level 120. 13 Return to debug level 119. 14 Return to debug level 118. 15 Return to debug level 117. 16 Return to debug level 116. 17 Return to debug level 115. 18 Return to debug level 114. 19 Return to debug level 113. 20 Return to debug level 112. 21 Return to debug level 111. 22 Return to debug level 110. 23 Return to debug level 109. 24 Return to debug level 108. 25 Return to debug level 107. 26 Return to debug level 106. 27 Return to debug level 105. 28 Return to debug level 104. 29 Return to debug level 103. 30 Return to debug level 102. 31 Return to debug level 101. 32 Return to debug level 100. 33 Return to debug level 99. 34 Return to debug level 98. 35 Return to debug level 97. 36 Return to debug level 96. 37 Return to debug level 95. 38 Return to debug level 94. 39 Return to debug level 93. 40 Return to debug level 92. 41 Return to debug level 91. 42 Return to debug level 90. 43 Return to debug level 89. 44 Return to debug level 88. 45 Return to debug level 87. 46 Return to debug level 86. 47 Return to debug level 85. 48 Return to debug level 84. 49 Return to debug level 83. 50 Return to debug level 82. 51 Return to debug level 81. 52 Return to debug level 80. 53 Return to debug level 79. 54 Return to debug level 78. 55 Return to debug level 77. 56 Return to debug level 76. 57 Return to debug level 75. 58 Return to debug level 74. 59 Return to debug level 73. 60 Return to debug level 72. 61 Return to debug level 71. 62 Return to debug level 70. 63 Return to debug level 69. 64 Return to debug level 68. 65 Return to debug level 67. 66 Return to debug level 66. 67 Return to debug level 65. 68 Return to debug level 64. 69 Return to debug level 63. 70 Return to debug level 62. 71 Return to debug level 61. 72 Return to debug level 60. 73 Return to debug level 59. 74 Return to debug level 58. 75 Return to debug level 57. 76 Return to debug level 56. 77 Return to debug level 55. 78 Return to debug level 54. 79 Return to debug level 53. 80 Return to debug level 52. 81 Return to debug level 51. 82 Return to debug level 50. 83 Return to debug level 49. 84 Return to debug level 48. 85 Return to debug level 47. 86 Return to debug level 46. 87 Return to debug level 45. 88 Return to debug level 44. 89 Return to debug level 43. 90 Return to debug level 42. 91 Return to debug level 41. 92 Return to debug level 40. 93 Return to debug level 39. 94 Return to debug level 38. 95 Return to debug level 37. 96 Return to debug level 36. 97 Return to debug level 35. 98 Return to debug level 34. 99 Return to debug level 33. 100 Return to debug level 32. 101 Return to debug level 31. 102 Return to debug level 30. 103 Return to debug level 29. 104 Return to debug level 28. 105 Return to debug level 27. 106 Return to debug level 26. 107 Return to debug level 25. 108 Return to debug level 24. 109 Return to debug level 23. 110 Return to debug level 22. 111 Return to debug level 21. 112 Return to debug level 20. 113 Return to debug level 19. 114 Return to debug level 18. 115 Return to debug level 17. 116 Return to debug level 16. 117 Return to debug level 15. 118 Return to debug level 14. 119 Return to debug level 13. 120 Return to debug level 12. 121 Return to debug level 11. 122 Return to debug level 10. 123 Return to debug level 9. 124 Return to debug level 8. 125 Return to debug level 7. 126 Return to debug level 6. 127 Return to debug level 5. 128 Return to debug level 4. 129 Return to debug level 3. 130 Return to debug level 2. 131 Return to debug level 1. 132 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 132. 2 Return to debug level 131. 3 Return to debug level 130. 4 Return to debug level 129. 5 Return to debug level 128. 6 Return to debug level 127. 7 Return to debug level 126. 8 Return to debug level 125. 9 Return to debug level 124. 10 Return to debug level 123. 11 Return to debug level 122. 12 Return to debug level 121. 13 Return to debug level 120. 14 Return to debug level 119. 15 Return to debug level 118. 16 Return to debug level 117. 17 Return to debug level 116. 18 Return to debug level 115. 19 Return to debug level 114. 20 Return to debug level 113. 21 Return to debug level 112. 22 Return to debug level 111. 23 Return to debug level 110. 24 Return to debug level 109. 25 Return to debug level 108. 26 Return to debug level 107. 27 Return to debug level 106. 28 Return to debug level 105. 29 Return to debug level 104. 30 Return to debug level 103. 31 Return to debug level 102. 32 Return to debug level 101. 33 Return to debug level 100. 34 Return to debug level 99. 35 Return to debug level 98. 36 Return to debug level 97. 37 Return to debug level 96. 38 Return to debug level 95. 39 Return to debug level 94. 40 Return to debug level 93. 41 Return to debug level 92. 42 Return to debug level 91. 43 Return to debug level 90. 44 Return to debug level 89. 45 Return to debug level 88. 46 Return to debug level 87. 47 Return to debug level 86. 48 Return to debug level 85. 49 Return to debug level 84. 50 Return to debug level 83. 51 Return to debug level 82. 52 Return to debug level 81. 53 Return to debug level 80. 54 Return to debug level 79. 55 Return to debug level 78. 56 Return to debug level 77. 57 Return to debug level 76. 58 Return to debug level 75. 59 Return to debug level 74. 60 Return to debug level 73. 61 Return to debug level 72. 62 Return to debug level 71. 63 Return to debug level 70. 64 Return to debug level 69. 65 Return to debug level 68. 66 Return to debug level 67. 67 Return to debug level 66. 68 Return to debug level 65. 69 Return to debug level 64. 70 Return to debug level 63. 71 Return to debug level 62. 72 Return to debug level 61. 73 Return to debug level 60. 74 Return to debug level 59. 75 Return to debug level 58. 76 Return to debug level 57. 77 Return to debug level 56. 78 Return to debug level 55. 79 Return to debug level 54. 80 Return to debug level 53. 81 Return to debug level 52. 82 Return to debug level 51. 83 Return to debug level 50. 84 Return to debug level 49. 85 Return to debug level 48. 86 Return to debug level 47. 87 Return to debug level 46. 88 Return to debug level 45. 89 Return to debug level 44. 90 Return to debug level 43. 91 Return to debug level 42. 92 Return to debug level 41. 93 Return to debug level 40. 94 Return to debug level 39. 95 Return to debug level 38. 96 Return to debug level 37. 97 Return to debug level 36. 98 Return to debug level 35. 99 Return to debug level 34. 100 Return to debug level 33. 101 Return to debug level 32. 102 Return to debug level 31. 103 Return to debug level 30. 104 Return to debug level 29. 105 Return to debug level 28. 106 Return to debug level 27. 107 Return to debug level 26. 108 Return to debug level 25. 109 Return to debug level 24. 110 Return to debug level 23. 111 Return to debug level 22. 112 Return to debug level 21. 113 Return to debug level 20. 114 Return to debug level 19. 115 Return to debug level 18. 116 Return to debug level 17. 117 Return to debug level 16. 118 Return to debug level 15. 119 Return to debug level 14. 120 Return to debug level 13. 121 Return to debug level 12. 122 Return to debug level 11. 123 Return to debug level 10. 124 Return to debug level 9. 125 Return to debug level 8. 126 Return to debug level 7. 127 Return to debug level 6. 128 Return to debug level 5. 129 Return to debug level 4. 130 Return to debug level 3. 131 Return to debug level 2. 132 Return to debug level 1. 133 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 133. 2 Return to debug level 132. 3 Return to debug level 131. 4 Return to debug level 130. 5 Return to debug level 129. 6 Return to debug level 128. 7 Return to debug level 127. 8 Return to debug level 126. 9 Return to debug level 125. 10 Return to debug level 124. 11 Return to debug level 123. 12 Return to debug level 122. 13 Return to debug level 121. 14 Return to debug level 120. 15 Return to debug level 119. 16 Return to debug level 118. 17 Return to debug level 117. 18 Return to debug level 116. 19 Return to debug level 115. 20 Return to debug level 114. 21 Return to debug level 113. 22 Return to debug level 112. 23 Return to debug level 111. 24 Return to debug level 110. 25 Return to debug level 109. 26 Return to debug level 108. 27 Return to debug level 107. 28 Return to debug level 106. 29 Return to debug level 105. 30 Return to debug level 104. 31 Return to debug level 103. 32 Return to debug level 102. 33 Return to debug level 101. 34 Return to debug level 100. 35 Return to debug level 99. 36 Return to debug level 98. 37 Return to debug level 97. 38 Return to debug level 96. 39 Return to debug level 95. 40 Return to debug level 94. 41 Return to debug level 93. 42 Return to debug level 92. 43 Return to debug level 91. 44 Return to debug level 90. 45 Return to debug level 89. 46 Return to debug level 88. 47 Return to debug level 87. 48 Return to debug level 86. 49 Return to debug level 85. 50 Return to debug level 84. 51 Return to debug level 83. 52 Return to debug level 82. 53 Return to debug level 81. 54 Return to debug level 80. 55 Return to debug level 79. 56 Return to debug level 78. 57 Return to debug level 77. 58 Return to debug level 76. 59 Return to debug level 75. 60 Return to debug level 74. 61 Return to debug level 73. 62 Return to debug level 72. 63 Return to debug level 71. 64 Return to debug level 70. 65 Return to debug level 69. 66 Return to debug level 68. 67 Return to debug level 67. 68 Return to debug level 66. 69 Return to debug level 65. 70 Return to debug level 64. 71 Return to debug level 63. 72 Return to debug level 62. 73 Return to debug level 61. 74 Return to debug level 60. 75 Return to debug level 59. 76 Return to debug level 58. 77 Return to debug level 57. 78 Return to debug level 56. 79 Return to debug level 55. 80 Return to debug level 54. 81 Return to debug level 53. 82 Return to debug level 52. 83 Return to debug level 51. 84 Return to debug level 50. 85 Return to debug level 49. 86 Return to debug level 48. 87 Return to debug level 47. 88 Return to debug level 46. 89 Return to debug level 45. 90 Return to debug level 44. 91 Return to debug level 43. 92 Return to debug level 42. 93 Return to debug level 41. 94 Return to debug level 40. 95 Return to debug level 39. 96 Return to debug level 38. 97 Return to debug level 37. 98 Return to debug level 36. 99 Return to debug level 35. 100 Return to debug level 34. 101 Return to debug level 33. 102 Return to debug level 32. 103 Return to debug level 31. 104 Return to debug level 30. 105 Return to debug level 29. 106 Return to debug level 28. 107 Return to debug level 27. 108 Return to debug level 26. 109 Return to debug level 25. 110 Return to debug level 24. 111 Return to debug level 23. 112 Return to debug level 22. 113 Return to debug level 21. 114 Return to debug level 20. 115 Return to debug level 19. 116 Return to debug level 18. 117 Return to debug level 17. 118 Return to debug level 16. 119 Return to debug level 15. 120 Return to debug level 14. 121 Return to debug level 13. 122 Return to debug level 12. 123 Return to debug level 11. 124 Return to debug level 10. 125 Return to debug level 9. 126 Return to debug level 8. 127 Return to debug level 7. 128 Return to debug level 6. 129 Return to debug level 5. 130 Return to debug level 4. 131 Return to debug level 3. 132 Return to debug level 2. 133 Return to debug level 1. 134 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 134. 2 Return to debug level 133. 3 Return to debug level 132. 4 Return to debug level 131. 5 Return to debug level 130. 6 Return to debug level 129. 7 Return to debug level 128. 8 Return to debug level 127. 9 Return to debug level 126. 10 Return to debug level 125. 11 Return to debug level 124. 12 Return to debug level 123. 13 Return to debug level 122. 14 Return to debug level 121. 15 Return to debug level 120. 16 Return to debug level 119. 17 Return to debug level 118. 18 Return to debug level 117. 19 Return to debug level 116. 20 Return to debug level 115. 21 Return to debug level 114. 22 Return to debug level 113. 23 Return to debug level 112. 24 Return to debug level 111. 25 Return to debug level 110. 26 Return to debug level 109. 27 Return to debug level 108. 28 Return to debug level 107. 29 Return to debug level 106. 30 Return to debug level 105. 31 Return to debug level 104. 32 Return to debug level 103. 33 Return to debug level 102. 34 Return to debug level 101. 35 Return to debug level 100. 36 Return to debug level 99. 37 Return to debug level 98. 38 Return to debug level 97. 39 Return to debug level 96. 40 Return to debug level 95. 41 Return to debug level 94. 42 Return to debug level 93. 43 Return to debug level 92. 44 Return to debug level 91. 45 Return to debug level 90. 46 Return to debug level 89. 47 Return to debug level 88. 48 Return to debug level 87. 49 Return to debug level 86. 50 Return to debug level 85. 51 Return to debug level 84. 52 Return to debug level 83. 53 Return to debug level 82. 54 Return to debug level 81. 55 Return to debug level 80. 56 Return to debug level 79. 57 Return to debug level 78. 58 Return to debug level 77. 59 Return to debug level 76. 60 Return to debug level 75. 61 Return to debug level 74. 62 Return to debug level 73. 63 Return to debug level 72. 64 Return to debug level 71. 65 Return to debug level 70. 66 Return to debug level 69. 67 Return to debug level 68. 68 Return to debug level 67. 69 Return to debug level 66. 70 Return to debug level 65. 71 Return to debug level 64. 72 Return to debug level 63. 73 Return to debug level 62. 74 Return to debug level 61. 75 Return to debug level 60. 76 Return to debug level 59. 77 Return to debug level 58. 78 Return to debug level 57. 79 Return to debug level 56. 80 Return to debug level 55. 81 Return to debug level 54. 82 Return to debug level 53. 83 Return to debug level 52. 84 Return to debug level 51. 85 Return to debug level 50. 86 Return to debug level 49. 87 Return to debug level 48. 88 Return to debug level 47. 89 Return to debug level 46. 90 Return to debug level 45. 91 Return to debug level 44. 92 Return to debug level 43. 93 Return to debug level 42. 94 Return to debug level 41. 95 Return to debug level 40. 96 Return to debug level 39. 97 Return to debug level 38. 98 Return to debug level 37. 99 Return to debug level 36. 100 Return to debug level 35. 101 Return to debug level 34. 102 Return to debug level 33. 103 Return to debug level 32. 104 Return to debug level 31. 105 Return to debug level 30. 106 Return to debug level 29. 107 Return to debug level 28. 108 Return to debug level 27. 109 Return to debug level 26. 110 Return to debug level 25. 111 Return to debug level 24. 112 Return to debug level 23. 113 Return to debug level 22. 114 Return to debug level 21. 115 Return to debug level 20. 116 Return to debug level 19. 117 Return to debug level 18. 118 Return to debug level 17. 119 Return to debug level 16. 120 Return to debug level 15. 121 Return to debug level 14. 122 Return to debug level 13. 123 Return to debug level 12. 124 Return to debug level 11. 125 Return to debug level 10. 126 Return to debug level 9. 127 Return to debug level 8. 128 Return to debug level 7. 129 Return to debug level 6. 130 Return to debug level 5. 131 Return to debug level 4. 132 Return to debug level 3. 133 Return to debug level 2. 134 Return to debug level 1. 135 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 135. 2 Return to debug level 134. 3 Return to debug level 133. 4 Return to debug level 132. 5 Return to debug level 131. 6 Return to debug level 130. 7 Return to debug level 129. 8 Return to debug level 128. 9 Return to debug level 127. 10 Return to debug level 126. 11 Return to debug level 125. 12 Return to debug level 124. 13 Return to debug level 123. 14 Return to debug level 122. 15 Return to debug level 121. 16 Return to debug level 120. 17 Return to debug level 119. 18 Return to debug level 118. 19 Return to debug level 117. 20 Return to debug level 116. 21 Return to debug level 115. 22 Return to debug level 114. 23 Return to debug level 113. 24 Return to debug level 112. 25 Return to debug level 111. 26 Return to debug level 110. 27 Return to debug level 109. 28 Return to debug level 108. 29 Return to debug level 107. 30 Return to debug level 106. 31 Return to debug level 105. 32 Return to debug level 104. 33 Return to debug level 103. 34 Return to debug level 102. 35 Return to debug level 101. 36 Return to debug level 100. 37 Return to debug level 99. 38 Return to debug level 98. 39 Return to debug level 97. 40 Return to debug level 96. 41 Return to debug level 95. 42 Return to debug level 94. 43 Return to debug level 93. 44 Return to debug level 92. 45 Return to debug level 91. 46 Return to debug level 90. 47 Return to debug level 89. 48 Return to debug level 88. 49 Return to debug level 87. 50 Return to debug level 86. 51 Return to debug level 85. 52 Return to debug level 84. 53 Return to debug level 83. 54 Return to debug level 82. 55 Return to debug level 81. 56 Return to debug level 80. 57 Return to debug level 79. 58 Return to debug level 78. 59 Return to debug level 77. 60 Return to debug level 76. 61 Return to debug level 75. 62 Return to debug level 74. 63 Return to debug level 73. 64 Return to debug level 72. 65 Return to debug level 71. 66 Return to debug level 70. 67 Return to debug level 69. 68 Return to debug level 68. 69 Return to debug level 67. 70 Return to debug level 66. 71 Return to debug level 65. 72 Return to debug level 64. 73 Return to debug level 63. 74 Return to debug level 62. 75 Return to debug level 61. 76 Return to debug level 60. 77 Return to debug level 59. 78 Return to debug level 58. 79 Return to debug level 57. 80 Return to debug level 56. 81 Return to debug level 55. 82 Return to debug level 54. 83 Return to debug level 53. 84 Return to debug level 52. 85 Return to debug level 51. 86 Return to debug level 50. 87 Return to debug level 49. 88 Return to debug level 48. 89 Return to debug level 47. 90 Return to debug level 46. 91 Return to debug level 45. 92 Return to debug level 44. 93 Return to debug level 43. 94 Return to debug level 42. 95 Return to debug level 41. 96 Return to debug level 40. 97 Return to debug level 39. 98 Return to debug level 38. 99 Return to debug level 37. 100 Return to debug level 36. 101 Return to debug level 35. 102 Return to debug level 34. 103 Return to debug level 33. 104 Return to debug level 32. 105 Return to debug level 31. 106 Return to debug level 30. 107 Return to debug level 29. 108 Return to debug level 28. 109 Return to debug level 27. 110 Return to debug level 26. 111 Return to debug level 25. 112 Return to debug level 24. 113 Return to debug level 23. 114 Return to debug level 22. 115 Return to debug level 21. 116 Return to debug level 20. 117 Return to debug level 19. 118 Return to debug level 18. 119 Return to debug level 17. 120 Return to debug level 16. 121 Return to debug level 15. 122 Return to debug level 14. 123 Return to debug level 13. 124 Return to debug level 12. 125 Return to debug level 11. 126 Return to debug level 10. 127 Return to debug level 9. 128 Return to debug level 8. 129 Return to debug level 7. 130 Return to debug level 6. 131 Return to debug level 5. 132 Return to debug level 4. 133 Return to debug level 3. 134 Return to debug level 2. 135 Return to debug level 1. 136 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 136. 2 Return to debug level 135. 3 Return to debug level 134. 4 Return to debug level 133. 5 Return to debug level 132. 6 Return to debug level 131. 7 Return to debug level 130. 8 Return to debug level 129. 9 Return to debug level 128. 10 Return to debug level 127. 11 Return to debug level 126. 12 Return to debug level 125. 13 Return to debug level 124. 14 Return to debug level 123. 15 Return to debug level 122. 16 Return to debug level 121. 17 Return to debug level 120. 18 Return to debug level 119. 19 Return to debug level 118. 20 Return to debug level 117. 21 Return to debug level 116. 22 Return to debug level 115. 23 Return to debug level 114. 24 Return to debug level 113. 25 Return to debug level 112. 26 Return to debug level 111. 27 Return to debug level 110. 28 Return to debug level 109. 29 Return to debug level 108. 30 Return to debug level 107. 31 Return to debug level 106. 32 Return to debug level 105. 33 Return to debug level 104. 34 Return to debug level 103. 35 Return to debug level 102. 36 Return to debug level 101. 37 Return to debug level 100. 38 Return to debug level 99. 39 Return to debug level 98. 40 Return to debug level 97. 41 Return to debug level 96. 42 Return to debug level 95. 43 Return to debug level 94. 44 Return to debug level 93. 45 Return to debug level 92. 46 Return to debug level 91. 47 Return to debug level 90. 48 Return to debug level 89. 49 Return to debug level 88. 50 Return to debug level 87. 51 Return to debug level 86. 52 Return to debug level 85. 53 Return to debug level 84. 54 Return to debug level 83. 55 Return to debug level 82. 56 Return to debug level 81. 57 Return to debug level 80. 58 Return to debug level 79. 59 Return to debug level 78. 60 Return to debug level 77. 61 Return to debug level 76. 62 Return to debug level 75. 63 Return to debug level 74. 64 Return to debug level 73. 65 Return to debug level 72. 66 Return to debug level 71. 67 Return to debug level 70. 68 Return to debug level 69. 69 Return to debug level 68. 70 Return to debug level 67. 71 Return to debug level 66. 72 Return to debug level 65. 73 Return to debug level 64. 74 Return to debug level 63. 75 Return to debug level 62. 76 Return to debug level 61. 77 Return to debug level 60. 78 Return to debug level 59. 79 Return to debug level 58. 80 Return to debug level 57. 81 Return to debug level 56. 82 Return to debug level 55. 83 Return to debug level 54. 84 Return to debug level 53. 85 Return to debug level 52. 86 Return to debug level 51. 87 Return to debug level 50. 88 Return to debug level 49. 89 Return to debug level 48. 90 Return to debug level 47. 91 Return to debug level 46. 92 Return to debug level 45. 93 Return to debug level 44. 94 Return to debug level 43. 95 Return to debug level 42. 96 Return to debug level 41. 97 Return to debug level 40. 98 Return to debug level 39. 99 Return to debug level 38. 100 Return to debug level 37. 101 Return to debug level 36. 102 Return to debug level 35. 103 Return to debug level 34. 104 Return to debug level 33. 105 Return to debug level 32. 106 Return to debug level 31. 107 Return to debug level 30. 108 Return to debug level 29. 109 Return to debug level 28. 110 Return to debug level 27. 111 Return to debug level 26. 112 Return to debug level 25. 113 Return to debug level 24. 114 Return to debug level 23. 115 Return to debug level 22. 116 Return to debug level 21. 117 Return to debug level 20. 118 Return to debug level 19. 119 Return to debug level 18. 120 Return to debug level 17. 121 Return to debug level 16. 122 Return to debug level 15. 123 Return to debug level 14. 124 Return to debug level 13. 125 Return to debug level 12. 126 Return to debug level 11. 127 Return to debug level 10. 128 Return to debug level 9. 129 Return to debug level 8. 130 Return to debug level 7. 131 Return to debug level 6. 132 Return to debug level 5. 133 Return to debug level 4. 134 Return to debug level 3. 135 Return to debug level 2. 136 Return to debug level 1. 137 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 137. 2 Return to debug level 136. 3 Return to debug level 135. 4 Return to debug level 134. 5 Return to debug level 133. 6 Return to debug level 132. 7 Return to debug level 131. 8 Return to debug level 130. 9 Return to debug level 129. 10 Return to debug level 128. 11 Return to debug level 127. 12 Return to debug level 126. 13 Return to debug level 125. 14 Return to debug level 124. 15 Return to debug level 123. 16 Return to debug level 122. 17 Return to debug level 121. 18 Return to debug level 120. 19 Return to debug level 119. 20 Return to debug level 118. 21 Return to debug level 117. 22 Return to debug level 116. 23 Return to debug level 115. 24 Return to debug level 114. 25 Return to debug level 113. 26 Return to debug level 112. 27 Return to debug level 111. 28 Return to debug level 110. 29 Return to debug level 109. 30 Return to debug level 108. 31 Return to debug level 107. 32 Return to debug level 106. 33 Return to debug level 105. 34 Return to debug level 104. 35 Return to debug level 103. 36 Return to debug level 102. 37 Return to debug level 101. 38 Return to debug level 100. 39 Return to debug level 99. 40 Return to debug level 98. 41 Return to debug level 97. 42 Return to debug level 96. 43 Return to debug level 95. 44 Return to debug level 94. 45 Return to debug level 93. 46 Return to debug level 92. 47 Return to debug level 91. 48 Return to debug level 90. 49 Return to debug level 89. 50 Return to debug level 88. 51 Return to debug level 87. 52 Return to debug level 86. 53 Return to debug level 85. 54 Return to debug level 84. 55 Return to debug level 83. 56 Return to debug level 82. 57 Return to debug level 81. 58 Return to debug level 80. 59 Return to debug level 79. 60 Return to debug level 78. 61 Return to debug level 77. 62 Return to debug level 76. 63 Return to debug level 75. 64 Return to debug level 74. 65 Return to debug level 73. 66 Return to debug level 72. 67 Return to debug level 71. 68 Return to debug level 70. 69 Return to debug level 69. 70 Return to debug level 68. 71 Return to debug level 67. 72 Return to debug level 66. 73 Return to debug level 65. 74 Return to debug level 64. 75 Return to debug level 63. 76 Return to debug level 62. 77 Return to debug level 61. 78 Return to debug level 60. 79 Return to debug level 59. 80 Return to debug level 58. 81 Return to debug level 57. 82 Return to debug level 56. 83 Return to debug level 55. 84 Return to debug level 54. 85 Return to debug level 53. 86 Return to debug level 52. 87 Return to debug level 51. 88 Return to debug level 50. 89 Return to debug level 49. 90 Return to debug level 48. 91 Return to debug level 47. 92 Return to debug level 46. 93 Return to debug level 45. 94 Return to debug level 44. 95 Return to debug level 43. 96 Return to debug level 42. 97 Return to debug level 41. 98 Return to debug level 40. 99 Return to debug level 39. 100 Return to debug level 38. 101 Return to debug level 37. 102 Return to debug level 36. 103 Return to debug level 35. 104 Return to debug level 34. 105 Return to debug level 33. 106 Return to debug level 32. 107 Return to debug level 31. 108 Return to debug level 30. 109 Return to debug level 29. 110 Return to debug level 28. 111 Return to debug level 27. 112 Return to debug level 26. 113 Return to debug level 25. 114 Return to debug level 24. 115 Return to debug level 23. 116 Return to debug level 22. 117 Return to debug level 21. 118 Return to debug level 20. 119 Return to debug level 19. 120 Return to debug level 18. 121 Return to debug level 17. 122 Return to debug level 16. 123 Return to debug level 15. 124 Return to debug level 14. 125 Return to debug level 13. 126 Return to debug level 12. 127 Return to debug level 11. 128 Return to debug level 10. 129 Return to debug level 9. 130 Return to debug level 8. 131 Return to debug level 7. 132 Return to debug level 6. 133 Return to debug level 5. 134 Return to debug level 4. 135 Return to debug level 3. 136 Return to debug level 2. 137 Return to debug level 1. 138 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 138. 2 Return to debug level 137. 3 Return to debug level 136. 4 Return to debug level 135. 5 Return to debug level 134. 6 Return to debug level 133. 7 Return to debug level 132. 8 Return to debug level 131. 9 Return to debug level 130. 10 Return to debug level 129. 11 Return to debug level 128. 12 Return to debug level 127. 13 Return to debug level 126. 14 Return to debug level 125. 15 Return to debug level 124. 16 Return to debug level 123. 17 Return to debug level 122. 18 Return to debug level 121. 19 Return to debug level 120. 20 Return to debug level 119. 21 Return to debug level 118. 22 Return to debug level 117. 23 Return to debug level 116. 24 Return to debug level 115. 25 Return to debug level 114. 26 Return to debug level 113. 27 Return to debug level 112. 28 Return to debug level 111. 29 Return to debug level 110. 30 Return to debug level 109. 31 Return to debug level 108. 32 Return to debug level 107. 33 Return to debug level 106. 34 Return to debug level 105. 35 Return to debug level 104. 36 Return to debug level 103. 37 Return to debug level 102. 38 Return to debug level 101. 39 Return to debug level 100. 40 Return to debug level 99. 41 Return to debug level 98. 42 Return to debug level 97. 43 Return to debug level 96. 44 Return to debug level 95. 45 Return to debug level 94. 46 Return to debug level 93. 47 Return to debug level 92. 48 Return to debug level 91. 49 Return to debug level 90. 50 Return to debug level 89. 51 Return to debug level 88. 52 Return to debug level 87. 53 Return to debug level 86. 54 Return to debug level 85. 55 Return to debug level 84. 56 Return to debug level 83. 57 Return to debug level 82. 58 Return to debug level 81. 59 Return to debug level 80. 60 Return to debug level 79. 61 Return to debug level 78. 62 Return to debug level 77. 63 Return to debug level 76. 64 Return to debug level 75. 65 Return to debug level 74. 66 Return to debug level 73. 67 Return to debug level 72. 68 Return to debug level 71. 69 Return to debug level 70. 70 Return to debug level 69. 71 Return to debug level 68. 72 Return to debug level 67. 73 Return to debug level 66. 74 Return to debug level 65. 75 Return to debug level 64. 76 Return to debug level 63. 77 Return to debug level 62. 78 Return to debug level 61. 79 Return to debug level 60. 80 Return to debug level 59. 81 Return to debug level 58. 82 Return to debug level 57. 83 Return to debug level 56. 84 Return to debug level 55. 85 Return to debug level 54. 86 Return to debug level 53. 87 Return to debug level 52. 88 Return to debug level 51. 89 Return to debug level 50. 90 Return to debug level 49. 91 Return to debug level 48. 92 Return to debug level 47. 93 Return to debug level 46. 94 Return to debug level 45. 95 Return to debug level 44. 96 Return to debug level 43. 97 Return to debug level 42. 98 Return to debug level 41. 99 Return to debug level 40. 100 Return to debug level 39. 101 Return to debug level 38. 102 Return to debug level 37. 103 Return to debug level 36. 104 Return to debug level 35. 105 Return to debug level 34. 106 Return to debug level 33. 107 Return to debug level 32. 108 Return to debug level 31. 109 Return to debug level 30. 110 Return to debug level 29. 111 Return to debug level 28. 112 Return to debug level 27. 113 Return to debug level 26. 114 Return to debug level 25. 115 Return to debug level 24. 116 Return to debug level 23. 117 Return to debug level 22. 118 Return to debug level 21. 119 Return to debug level 20. 120 Return to debug level 19. 121 Return to debug level 18. 122 Return to debug level 17. 123 Return to debug level 16. 124 Return to debug level 15. 125 Return to debug level 14. 126 Return to debug level 13. 127 Return to debug level 12. 128 Return to debug level 11. 129 Return to debug level 10. 130 Return to debug level 9. 131 Return to debug level 8. 132 Return to debug level 7. 133 Return to debug level 6. 134 Return to debug level 5. 135 Return to debug level 4. 136 Return to debug level 3. 137 Return to debug level 2. 138 Return to debug level 1. 139 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 139. 2 Return to debug level 138. 3 Return to debug level 137. 4 Return to debug level 136. 5 Return to debug level 135. 6 Return to debug level 134. 7 Return to debug level 133. 8 Return to debug level 132. 9 Return to debug level 131. 10 Return to debug level 130. 11 Return to debug level 129. 12 Return to debug level 128. 13 Return to debug level 127. 14 Return to debug level 126. 15 Return to debug level 125. 16 Return to debug level 124. 17 Return to debug level 123. 18 Return to debug level 122. 19 Return to debug level 121. 20 Return to debug level 120. 21 Return to debug level 119. 22 Return to debug level 118. 23 Return to debug level 117. 24 Return to debug level 116. 25 Return to debug level 115. 26 Return to debug level 114. 27 Return to debug level 113. 28 Return to debug level 112. 29 Return to debug level 111. 30 Return to debug level 110. 31 Return to debug level 109. 32 Return to debug level 108. 33 Return to debug level 107. 34 Return to debug level 106. 35 Return to debug level 105. 36 Return to debug level 104. 37 Return to debug level 103. 38 Return to debug level 102. 39 Return to debug level 101. 40 Return to debug level 100. 41 Return to debug level 99. 42 Return to debug level 98. 43 Return to debug level 97. 44 Return to debug level 96. 45 Return to debug level 95. 46 Return to debug level 94. 47 Return to debug level 93. 48 Return to debug level 92. 49 Return to debug level 91. 50 Return to debug level 90. 51 Return to debug level 89. 52 Return to debug level 88. 53 Return to debug level 87. 54 Return to debug level 86. 55 Return to debug level 85. 56 Return to debug level 84. 57 Return to debug level 83. 58 Return to debug level 82. 59 Return to debug level 81. 60 Return to debug level 80. 61 Return to debug level 79. 62 Return to debug level 78. 63 Return to debug level 77. 64 Return to debug level 76. 65 Return to debug level 75. 66 Return to debug level 74. 67 Return to debug level 73. 68 Return to debug level 72. 69 Return to debug level 71. 70 Return to debug level 70. 71 Return to debug level 69. 72 Return to debug level 68. 73 Return to debug level 67. 74 Return to debug level 66. 75 Return to debug level 65. 76 Return to debug level 64. 77 Return to debug level 63. 78 Return to debug level 62. 79 Return to debug level 61. 80 Return to debug level 60. 81 Return to debug level 59. 82 Return to debug level 58. 83 Return to debug level 57. 84 Return to debug level 56. 85 Return to debug level 55. 86 Return to debug level 54. 87 Return to debug level 53. 88 Return to debug level 52. 89 Return to debug level 51. 90 Return to debug level 50. 91 Return to debug level 49. 92 Return to debug level 48. 93 Return to debug level 47. 94 Return to debug level 46. 95 Return to debug level 45. 96 Return to debug level 44. 97 Return to debug level 43. 98 Return to debug level 42. 99 Return to debug level 41. 100 Return to debug level 40. 101 Return to debug level 39. 102 Return to debug level 38. 103 Return to debug level 37. 104 Return to debug level 36. 105 Return to debug level 35. 106 Return to debug level 34. 107 Return to debug level 33. 108 Return to debug level 32. 109 Return to debug level 31. 110 Return to debug level 30. 111 Return to debug level 29. 112 Return to debug level 28. 113 Return to debug level 27. 114 Return to debug level 26. 115 Return to debug level 25. 116 Return to debug level 24. 117 Return to debug level 23. 118 Return to debug level 22. 119 Return to debug level 21. 120 Return to debug level 20. 121 Return to debug level 19. 122 Return to debug level 18. 123 Return to debug level 17. 124 Return to debug level 16. 125 Return to debug level 15. 126 Return to debug level 14. 127 Return to debug level 13. 128 Return to debug level 12. 129 Return to debug level 11. 130 Return to debug level 10. 131 Return to debug level 9. 132 Return to debug level 8. 133 Return to debug level 7. 134 Return to debug level 6. 135 Return to debug level 5. 136 Return to debug level 4. 137 Return to debug level 3. 138 Return to debug level 2. 139 Return to debug level 1. 140 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 140. 2 Return to debug level 139. 3 Return to debug level 138. 4 Return to debug level 137. 5 Return to debug level 136. 6 Return to debug level 135. 7 Return to debug level 134. 8 Return to debug level 133. 9 Return to debug level 132. 10 Return to debug level 131. 11 Return to debug level 130. 12 Return to debug level 129. 13 Return to debug level 128. 14 Return to debug level 127. 15 Return to debug level 126. 16 Return to debug level 125. 17 Return to debug level 124. 18 Return to debug level 123. 19 Return to debug level 122. 20 Return to debug level 121. 21 Return to debug level 120. 22 Return to debug level 119. 23 Return to debug level 118. 24 Return to debug level 117. 25 Return to debug level 116. 26 Return to debug level 115. 27 Return to debug level 114. 28 Return to debug level 113. 29 Return to debug level 112. 30 Return to debug level 111. 31 Return to debug level 110. 32 Return to debug level 109. 33 Return to debug level 108. 34 Return to debug level 107. 35 Return to debug level 106. 36 Return to debug level 105. 37 Return to debug level 104. 38 Return to debug level 103. 39 Return to debug level 102. 40 Return to debug level 101. 41 Return to debug level 100. 42 Return to debug level 99. 43 Return to debug level 98. 44 Return to debug level 97. 45 Return to debug level 96. 46 Return to debug level 95. 47 Return to debug level 94. 48 Return to debug level 93. 49 Return to debug level 92. 50 Return to debug level 91. 51 Return to debug level 90. 52 Return to debug level 89. 53 Return to debug level 88. 54 Return to debug level 87. 55 Return to debug level 86. 56 Return to debug level 85. 57 Return to debug level 84. 58 Return to debug level 83. 59 Return to debug level 82. 60 Return to debug level 81. 61 Return to debug level 80. 62 Return to debug level 79. 63 Return to debug level 78. 64 Return to debug level 77. 65 Return to debug level 76. 66 Return to debug level 75. 67 Return to debug level 74. 68 Return to debug level 73. 69 Return to debug level 72. 70 Return to debug level 71. 71 Return to debug level 70. 72 Return to debug level 69. 73 Return to debug level 68. 74 Return to debug level 67. 75 Return to debug level 66. 76 Return to debug level 65. 77 Return to debug level 64. 78 Return to debug level 63. 79 Return to debug level 62. 80 Return to debug level 61. 81 Return to debug level 60. 82 Return to debug level 59. 83 Return to debug level 58. 84 Return to debug level 57. 85 Return to debug level 56. 86 Return to debug level 55. 87 Return to debug level 54. 88 Return to debug level 53. 89 Return to debug level 52. 90 Return to debug level 51. 91 Return to debug level 50. 92 Return to debug level 49. 93 Return to debug level 48. 94 Return to debug level 47. 95 Return to debug level 46. 96 Return to debug level 45. 97 Return to debug level 44. 98 Return to debug level 43. 99 Return to debug level 42. 100 Return to debug level 41. 101 Return to debug level 40. 102 Return to debug level 39. 103 Return to debug level 38. 104 Return to debug level 37. 105 Return to debug level 36. 106 Return to debug level 35. 107 Return to debug level 34. 108 Return to debug level 33. 109 Return to debug level 32. 110 Return to debug level 31. 111 Return to debug level 30. 112 Return to debug level 29. 113 Return to debug level 28. 114 Return to debug level 27. 115 Return to debug level 26. 116 Return to debug level 25. 117 Return to debug level 24. 118 Return to debug level 23. 119 Return to debug level 22. 120 Return to debug level 21. 121 Return to debug level 20. 122 Return to debug level 19. 123 Return to debug level 18. 124 Return to debug level 17. 125 Return to debug level 16. 126 Return to debug level 15. 127 Return to debug level 14. 128 Return to debug level 13. 129 Return to debug level 12. 130 Return to debug level 11. 131 Return to debug level 10. 132 Return to debug level 9. 133 Return to debug level 8. 134 Return to debug level 7. 135 Return to debug level 6. 136 Return to debug level 5. 137 Return to debug level 4. 138 Return to debug level 3. 139 Return to debug level 2. 140 Return to debug level 1. 141 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 141. 2 Return to debug level 140. 3 Return to debug level 139. 4 Return to debug level 138. 5 Return to debug level 137. 6 Return to debug level 136. 7 Return to debug level 135. 8 Return to debug level 134. 9 Return to debug level 133. 10 Return to debug level 132. 11 Return to debug level 131. 12 Return to debug level 130. 13 Return to debug level 129. 14 Return to debug level 128. 15 Return to debug level 127. 16 Return to debug level 126. 17 Return to debug level 125. 18 Return to debug level 124. 19 Return to debug level 123. 20 Return to debug level 122. 21 Return to debug level 121. 22 Return to debug level 120. 23 Return to debug level 119. 24 Return to debug level 118. 25 Return to debug level 117. 26 Return to debug level 116. 27 Return to debug level 115. 28 Return to debug level 114. 29 Return to debug level 113. 30 Return to debug level 112. 31 Return to debug level 111. 32 Return to debug level 110. 33 Return to debug level 109. 34 Return to debug level 108. 35 Return to debug level 107. 36 Return to debug level 106. 37 Return to debug level 105. 38 Return to debug level 104. 39 Return to debug level 103. 40 Return to debug level 102. 41 Return to debug level 101. 42 Return to debug level 100. 43 Return to debug level 99. 44 Return to debug level 98. 45 Return to debug level 97. 46 Return to debug level 96. 47 Return to debug level 95. 48 Return to debug level 94. 49 Return to debug level 93. 50 Return to debug level 92. 51 Return to debug level 91. 52 Return to debug level 90. 53 Return to debug level 89. 54 Return to debug level 88. 55 Return to debug level 87. 56 Return to debug level 86. 57 Return to debug level 85. 58 Return to debug level 84. 59 Return to debug level 83. 60 Return to debug level 82. 61 Return to debug level 81. 62 Return to debug level 80. 63 Return to debug level 79. 64 Return to debug level 78. 65 Return to debug level 77. 66 Return to debug level 76. 67 Return to debug level 75. 68 Return to debug level 74. 69 Return to debug level 73. 70 Return to debug level 72. 71 Return to debug level 71. 72 Return to debug level 70. 73 Return to debug level 69. 74 Return to debug level 68. 75 Return to debug level 67. 76 Return to debug level 66. 77 Return to debug level 65. 78 Return to debug level 64. 79 Return to debug level 63. 80 Return to debug level 62. 81 Return to debug level 61. 82 Return to debug level 60. 83 Return to debug level 59. 84 Return to debug level 58. 85 Return to debug level 57. 86 Return to debug level 56. 87 Return to debug level 55. 88 Return to debug level 54. 89 Return to debug level 53. 90 Return to debug level 52. 91 Return to debug level 51. 92 Return to debug level 50. 93 Return to debug level 49. 94 Return to debug level 48. 95 Return to debug level 47. 96 Return to debug level 46. 97 Return to debug level 45. 98 Return to debug level 44. 99 Return to debug level 43. 100 Return to debug level 42. 101 Return to debug level 41. 102 Return to debug level 40. 103 Return to debug level 39. 104 Return to debug level 38. 105 Return to debug level 37. 106 Return to debug level 36. 107 Return to debug level 35. 108 Return to debug level 34. 109 Return to debug level 33. 110 Return to debug level 32. 111 Return to debug level 31. 112 Return to debug level 30. 113 Return to debug level 29. 114 Return to debug level 28. 115 Return to debug level 27. 116 Return to debug level 26. 117 Return to debug level 25. 118 Return to debug level 24. 119 Return to debug level 23. 120 Return to debug level 22. 121 Return to debug level 21. 122 Return to debug level 20. 123 Return to debug level 19. 124 Return to debug level 18. 125 Return to debug level 17. 126 Return to debug level 16. 127 Return to debug level 15. 128 Return to debug level 14. 129 Return to debug level 13. 130 Return to debug level 12. 131 Return to debug level 11. 132 Return to debug level 10. 133 Return to debug level 9. 134 Return to debug level 8. 135 Return to debug level 7. 136 Return to debug level 6. 137 Return to debug level 5. 138 Return to debug level 4. 139 Return to debug level 3. 140 Return to debug level 2. 141 Return to debug level 1. 142 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 142. 2 Return to debug level 141. 3 Return to debug level 140. 4 Return to debug level 139. 5 Return to debug level 138. 6 Return to debug level 137. 7 Return to debug level 136. 8 Return to debug level 135. 9 Return to debug level 134. 10 Return to debug level 133. 11 Return to debug level 132. 12 Return to debug level 131. 13 Return to debug level 130. 14 Return to debug level 129. 15 Return to debug level 128. 16 Return to debug level 127. 17 Return to debug level 126. 18 Return to debug level 125. 19 Return to debug level 124. 20 Return to debug level 123. 21 Return to debug level 122. 22 Return to debug level 121. 23 Return to debug level 120. 24 Return to debug level 119. 25 Return to debug level 118. 26 Return to debug level 117. 27 Return to debug level 116. 28 Return to debug level 115. 29 Return to debug level 114. 30 Return to debug level 113. 31 Return to debug level 112. 32 Return to debug level 111. 33 Return to debug level 110. 34 Return to debug level 109. 35 Return to debug level 108. 36 Return to debug level 107. 37 Return to debug level 106. 38 Return to debug level 105. 39 Return to debug level 104. 40 Return to debug level 103. 41 Return to debug level 102. 42 Return to debug level 101. 43 Return to debug level 100. 44 Return to debug level 99. 45 Return to debug level 98. 46 Return to debug level 97. 47 Return to debug level 96. 48 Return to debug level 95. 49 Return to debug level 94. 50 Return to debug level 93. 51 Return to debug level 92. 52 Return to debug level 91. 53 Return to debug level 90. 54 Return to debug level 89. 55 Return to debug level 88. 56 Return to debug level 87. 57 Return to debug level 86. 58 Return to debug level 85. 59 Return to debug level 84. 60 Return to debug level 83. 61 Return to debug level 82. 62 Return to debug level 81. 63 Return to debug level 80. 64 Return to debug level 79. 65 Return to debug level 78. 66 Return to debug level 77. 67 Return to debug level 76. 68 Return to debug level 75. 69 Return to debug level 74. 70 Return to debug level 73. 71 Return to debug level 72. 72 Return to debug level 71. 73 Return to debug level 70. 74 Return to debug level 69. 75 Return to debug level 68. 76 Return to debug level 67. 77 Return to debug level 66. 78 Return to debug level 65. 79 Return to debug level 64. 80 Return to debug level 63. 81 Return to debug level 62. 82 Return to debug level 61. 83 Return to debug level 60. 84 Return to debug level 59. 85 Return to debug level 58. 86 Return to debug level 57. 87 Return to debug level 56. 88 Return to debug level 55. 89 Return to debug level 54. 90 Return to debug level 53. 91 Return to debug level 52. 92 Return to debug level 51. 93 Return to debug level 50. 94 Return to debug level 49. 95 Return to debug level 48. 96 Return to debug level 47. 97 Return to debug level 46. 98 Return to debug level 45. 99 Return to debug level 44. 100 Return to debug level 43. 101 Return to debug level 42. 102 Return to debug level 41. 103 Return to debug level 40. 104 Return to debug level 39. 105 Return to debug level 38. 106 Return to debug level 37. 107 Return to debug level 36. 108 Return to debug level 35. 109 Return to debug level 34. 110 Return to debug level 33. 111 Return to debug level 32. 112 Return to debug level 31. 113 Return to debug level 30. 114 Return to debug level 29. 115 Return to debug level 28. 116 Return to debug level 27. 117 Return to debug level 26. 118 Return to debug level 25. 119 Return to debug level 24. 120 Return to debug level 23. 121 Return to debug level 22. 122 Return to debug level 21. 123 Return to debug level 20. 124 Return to debug level 19. 125 Return to debug level 18. 126 Return to debug level 17. 127 Return to debug level 16. 128 Return to debug level 15. 129 Return to debug level 14. 130 Return to debug level 13. 131 Return to debug level 12. 132 Return to debug level 11. 133 Return to debug level 10. 134 Return to debug level 9. 135 Return to debug level 8. 136 Return to debug level 7. 137 Return to debug level 6. 138 Return to debug level 5. 139 Return to debug level 4. 140 Return to debug level 3. 141 Return to debug level 2. 142 Return to debug level 1. 143 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 143. 2 Return to debug level 142. 3 Return to debug level 141. 4 Return to debug level 140. 5 Return to debug level 139. 6 Return to debug level 138. 7 Return to debug level 137. 8 Return to debug level 136. 9 Return to debug level 135. 10 Return to debug level 134. 11 Return to debug level 133. 12 Return to debug level 132. 13 Return to debug level 131. 14 Return to debug level 130. 15 Return to debug level 129. 16 Return to debug level 128. 17 Return to debug level 127. 18 Return to debug level 126. 19 Return to debug level 125. 20 Return to debug level 124. 21 Return to debug level 123. 22 Return to debug level 122. 23 Return to debug level 121. 24 Return to debug level 120. 25 Return to debug level 119. 26 Return to debug level 118. 27 Return to debug level 117. 28 Return to debug level 116. 29 Return to debug level 115. 30 Return to debug level 114. 31 Return to debug level 113. 32 Return to debug level 112. 33 Return to debug level 111. 34 Return to debug level 110. 35 Return to debug level 109. 36 Return to debug level 108. 37 Return to debug level 107. 38 Return to debug level 106. 39 Return to debug level 105. 40 Return to debug level 104. 41 Return to debug level 103. 42 Return to debug level 102. 43 Return to debug level 101. 44 Return to debug level 100. 45 Return to debug level 99. 46 Return to debug level 98. 47 Return to debug level 97. 48 Return to debug level 96. 49 Return to debug level 95. 50 Return to debug level 94. 51 Return to debug level 93. 52 Return to debug level 92. 53 Return to debug level 91. 54 Return to debug level 90. 55 Return to debug level 89. 56 Return to debug level 88. 57 Return to debug level 87. 58 Return to debug level 86. 59 Return to debug level 85. 60 Return to debug level 84. 61 Return to debug level 83. 62 Return to debug level 82. 63 Return to debug level 81. 64 Return to debug level 80. 65 Return to debug level 79. 66 Return to debug level 78. 67 Return to debug level 77. 68 Return to debug level 76. 69 Return to debug level 75. 70 Return to debug level 74. 71 Return to debug level 73. 72 Return to debug level 72. 73 Return to debug level 71. 74 Return to debug level 70. 75 Return to debug level 69. 76 Return to debug level 68. 77 Return to debug level 67. 78 Return to debug level 66. 79 Return to debug level 65. 80 Return to debug level 64. 81 Return to debug level 63. 82 Return to debug level 62. 83 Return to debug level 61. 84 Return to debug level 60. 85 Return to debug level 59. 86 Return to debug level 58. 87 Return to debug level 57. 88 Return to debug level 56. 89 Return to debug level 55. 90 Return to debug level 54. 91 Return to debug level 53. 92 Return to debug level 52. 93 Return to debug level 51. 94 Return to debug level 50. 95 Return to debug level 49. 96 Return to debug level 48. 97 Return to debug level 47. 98 Return to debug level 46. 99 Return to debug level 45. 100 Return to debug level 44. 101 Return to debug level 43. 102 Return to debug level 42. 103 Return to debug level 41. 104 Return to debug level 40. 105 Return to debug level 39. 106 Return to debug level 38. 107 Return to debug level 37. 108 Return to debug level 36. 109 Return to debug level 35. 110 Return to debug level 34. 111 Return to debug level 33. 112 Return to debug level 32. 113 Return to debug level 31. 114 Return to debug level 30. 115 Return to debug level 29. 116 Return to debug level 28. 117 Return to debug level 27. 118 Return to debug level 26. 119 Return to debug level 25. 120 Return to debug level 24. 121 Return to debug level 23. 122 Return to debug level 22. 123 Return to debug level 21. 124 Return to debug level 20. 125 Return to debug level 19. 126 Return to debug level 18. 127 Return to debug level 17. 128 Return to debug level 16. 129 Return to debug level 15. 130 Return to debug level 14. 131 Return to debug level 13. 132 Return to debug level 12. 133 Return to debug level 11. 134 Return to debug level 10. 135 Return to debug level 9. 136 Return to debug level 8. 137 Return to debug level 7. 138 Return to debug level 6. 139 Return to debug level 5. 140 Return to debug level 4. 141 Return to debug level 3. 142 Return to debug level 2. 143 Return to debug level 1. 144 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 144. 2 Return to debug level 143. 3 Return to debug level 142. 4 Return to debug level 141. 5 Return to debug level 140. 6 Return to debug level 139. 7 Return to debug level 138. 8 Return to debug level 137. 9 Return to debug level 136. 10 Return to debug level 135. 11 Return to debug level 134. 12 Return to debug level 133. 13 Return to debug level 132. 14 Return to debug level 131. 15 Return to debug level 130. 16 Return to debug level 129. 17 Return to debug level 128. 18 Return to debug level 127. 19 Return to debug level 126. 20 Return to debug level 125. 21 Return to debug level 124. 22 Return to debug level 123. 23 Return to debug level 122. 24 Return to debug level 121. 25 Return to debug level 120. 26 Return to debug level 119. 27 Return to debug level 118. 28 Return to debug level 117. 29 Return to debug level 116. 30 Return to debug level 115. 31 Return to debug level 114. 32 Return to debug level 113. 33 Return to debug level 112. 34 Return to debug level 111. 35 Return to debug level 110. 36 Return to debug level 109. 37 Return to debug level 108. 38 Return to debug level 107. 39 Return to debug level 106. 40 Return to debug level 105. 41 Return to debug level 104. 42 Return to debug level 103. 43 Return to debug level 102. 44 Return to debug level 101. 45 Return to debug level 100. 46 Return to debug level 99. 47 Return to debug level 98. 48 Return to debug level 97. 49 Return to debug level 96. 50 Return to debug level 95. 51 Return to debug level 94. 52 Return to debug level 93. 53 Return to debug level 92. 54 Return to debug level 91. 55 Return to debug level 90. 56 Return to debug level 89. 57 Return to debug level 88. 58 Return to debug level 87. 59 Return to debug level 86. 60 Return to debug level 85. 61 Return to debug level 84. 62 Return to debug level 83. 63 Return to debug level 82. 64 Return to debug level 81. 65 Return to debug level 80. 66 Return to debug level 79. 67 Return to debug level 78. 68 Return to debug level 77. 69 Return to debug level 76. 70 Return to debug level 75. 71 Return to debug level 74. 72 Return to debug level 73. 73 Return to debug level 72. 74 Return to debug level 71. 75 Return to debug level 70. 76 Return to debug level 69. 77 Return to debug level 68. 78 Return to debug level 67. 79 Return to debug level 66. 80 Return to debug level 65. 81 Return to debug level 64. 82 Return to debug level 63. 83 Return to debug level 62. 84 Return to debug level 61. 85 Return to debug level 60. 86 Return to debug level 59. 87 Return to debug level 58. 88 Return to debug level 57. 89 Return to debug level 56. 90 Return to debug level 55. 91 Return to debug level 54. 92 Return to debug level 53. 93 Return to debug level 52. 94 Return to debug level 51. 95 Return to debug level 50. 96 Return to debug level 49. 97 Return to debug level 48. 98 Return to debug level 47. 99 Return to debug level 46. 100 Return to debug level 45. 101 Return to debug level 44. 102 Return to debug level 43. 103 Return to debug level 42. 104 Return to debug level 41. 105 Return to debug level 40. 106 Return to debug level 39. 107 Return to debug level 38. 108 Return to debug level 37. 109 Return to debug level 36. 110 Return to debug level 35. 111 Return to debug level 34. 112 Return to debug level 33. 113 Return to debug level 32. 114 Return to debug level 31. 115 Return to debug level 30. 116 Return to debug level 29. 117 Return to debug level 28. 118 Return to debug level 27. 119 Return to debug level 26. 120 Return to debug level 25. 121 Return to debug level 24. 122 Return to debug level 23. 123 Return to debug level 22. 124 Return to debug level 21. 125 Return to debug level 20. 126 Return to debug level 19. 127 Return to debug level 18. 128 Return to debug level 17. 129 Return to debug level 16. 130 Return to debug level 15. 131 Return to debug level 14. 132 Return to debug level 13. 133 Return to debug level 12. 134 Return to debug level 11. 135 Return to debug level 10. 136 Return to debug level 9. 137 Return to debug level 8. 138 Return to debug level 7. 139 Return to debug level 6. 140 Return to debug level 5. 141 Return to debug level 4. 142 Return to debug level 3. 143 Return to debug level 2. 144 Return to debug level 1. 145 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 145. 2 Return to debug level 144. 3 Return to debug level 143. 4 Return to debug level 142. 5 Return to debug level 141. 6 Return to debug level 140. 7 Return to debug level 139. 8 Return to debug level 138. 9 Return to debug level 137. 10 Return to debug level 136. 11 Return to debug level 135. 12 Return to debug level 134. 13 Return to debug level 133. 14 Return to debug level 132. 15 Return to debug level 131. 16 Return to debug level 130. 17 Return to debug level 129. 18 Return to debug level 128. 19 Return to debug level 127. 20 Return to debug level 126. 21 Return to debug level 125. 22 Return to debug level 124. 23 Return to debug level 123. 24 Return to debug level 122. 25 Return to debug level 121. 26 Return to debug level 120. 27 Return to debug level 119. 28 Return to debug level 118. 29 Return to debug level 117. 30 Return to debug level 116. 31 Return to debug level 115. 32 Return to debug level 114. 33 Return to debug level 113. 34 Return to debug level 112. 35 Return to debug level 111. 36 Return to debug level 110. 37 Return to debug level 109. 38 Return to debug level 108. 39 Return to debug level 107. 40 Return to debug level 106. 41 Return to debug level 105. 42 Return to debug level 104. 43 Return to debug level 103. 44 Return to debug level 102. 45 Return to debug level 101. 46 Return to debug level 100. 47 Return to debug level 99. 48 Return to debug level 98. 49 Return to debug level 97. 50 Return to debug level 96. 51 Return to debug level 95. 52 Return to debug level 94. 53 Return to debug level 93. 54 Return to debug level 92. 55 Return to debug level 91. 56 Return to debug level 90. 57 Return to debug level 89. 58 Return to debug level 88. 59 Return to debug level 87. 60 Return to debug level 86. 61 Return to debug level 85. 62 Return to debug level 84. 63 Return to debug level 83. 64 Return to debug level 82. 65 Return to debug level 81. 66 Return to debug level 80. 67 Return to debug level 79. 68 Return to debug level 78. 69 Return to debug level 77. 70 Return to debug level 76. 71 Return to debug level 75. 72 Return to debug level 74. 73 Return to debug level 73. 74 Return to debug level 72. 75 Return to debug level 71. 76 Return to debug level 70. 77 Return to debug level 69. 78 Return to debug level 68. 79 Return to debug level 67. 80 Return to debug level 66. 81 Return to debug level 65. 82 Return to debug level 64. 83 Return to debug level 63. 84 Return to debug level 62. 85 Return to debug level 61. 86 Return to debug level 60. 87 Return to debug level 59. 88 Return to debug level 58. 89 Return to debug level 57. 90 Return to debug level 56. 91 Return to debug level 55. 92 Return to debug level 54. 93 Return to debug level 53. 94 Return to debug level 52. 95 Return to debug level 51. 96 Return to debug level 50. 97 Return to debug level 49. 98 Return to debug level 48. 99 Return to debug level 47. 100 Return to debug level 46. 101 Return to debug level 45. 102 Return to debug level 44. 103 Return to debug level 43. 104 Return to debug level 42. 105 Return to debug level 41. 106 Return to debug level 40. 107 Return to debug level 39. 108 Return to debug level 38. 109 Return to debug level 37. 110 Return to debug level 36. 111 Return to debug level 35. 112 Return to debug level 34. 113 Return to debug level 33. 114 Return to debug level 32. 115 Return to debug level 31. 116 Return to debug level 30. 117 Return to debug level 29. 118 Return to debug level 28. 119 Return to debug level 27. 120 Return to debug level 26. 121 Return to debug level 25. 122 Return to debug level 24. 123 Return to debug level 23. 124 Return to debug level 22. 125 Return to debug level 21. 126 Return to debug level 20. 127 Return to debug level 19. 128 Return to debug level 18. 129 Return to debug level 17. 130 Return to debug level 16. 131 Return to debug level 15. 132 Return to debug level 14. 133 Return to debug level 13. 134 Return to debug level 12. 135 Return to debug level 11. 136 Return to debug level 10. 137 Return to debug level 9. 138 Return to debug level 8. 139 Return to debug level 7. 140 Return to debug level 6. 141 Return to debug level 5. 142 Return to debug level 4. 143 Return to debug level 3. 144 Return to debug level 2. 145 Return to debug level 1. 146 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 146. 2 Return to debug level 145. 3 Return to debug level 144. 4 Return to debug level 143. 5 Return to debug level 142. 6 Return to debug level 141. 7 Return to debug level 140. 8 Return to debug level 139. 9 Return to debug level 138. 10 Return to debug level 137. 11 Return to debug level 136. 12 Return to debug level 135. 13 Return to debug level 134. 14 Return to debug level 133. 15 Return to debug level 132. 16 Return to debug level 131. 17 Return to debug level 130. 18 Return to debug level 129. 19 Return to debug level 128. 20 Return to debug level 127. 21 Return to debug level 126. 22 Return to debug level 125. 23 Return to debug level 124. 24 Return to debug level 123. 25 Return to debug level 122. 26 Return to debug level 121. 27 Return to debug level 120. 28 Return to debug level 119. 29 Return to debug level 118. 30 Return to debug level 117. 31 Return to debug level 116. 32 Return to debug level 115. 33 Return to debug level 114. 34 Return to debug level 113. 35 Return to debug level 112. 36 Return to debug level 111. 37 Return to debug level 110. 38 Return to debug level 109. 39 Return to debug level 108. 40 Return to debug level 107. 41 Return to debug level 106. 42 Return to debug level 105. 43 Return to debug level 104. 44 Return to debug level 103. 45 Return to debug level 102. 46 Return to debug level 101. 47 Return to debug level 100. 48 Return to debug level 99. 49 Return to debug level 98. 50 Return to debug level 97. 51 Return to debug level 96. 52 Return to debug level 95. 53 Return to debug level 94. 54 Return to debug level 93. 55 Return to debug level 92. 56 Return to debug level 91. 57 Return to debug level 90. 58 Return to debug level 89. 59 Return to debug level 88. 60 Return to debug level 87. 61 Return to debug level 86. 62 Return to debug level 85. 63 Return to debug level 84. 64 Return to debug level 83. 65 Return to debug level 82. 66 Return to debug level 81. 67 Return to debug level 80. 68 Return to debug level 79. 69 Return to debug level 78. 70 Return to debug level 77. 71 Return to debug level 76. 72 Return to debug level 75. 73 Return to debug level 74. 74 Return to debug level 73. 75 Return to debug level 72. 76 Return to debug level 71. 77 Return to debug level 70. 78 Return to debug level 69. 79 Return to debug level 68. 80 Return to debug level 67. 81 Return to debug level 66. 82 Return to debug level 65. 83 Return to debug level 64. 84 Return to debug level 63. 85 Return to debug level 62. 86 Return to debug level 61. 87 Return to debug level 60. 88 Return to debug level 59. 89 Return to debug level 58. 90 Return to debug level 57. 91 Return to debug level 56. 92 Return to debug level 55. 93 Return to debug level 54. 94 Return to debug level 53. 95 Return to debug level 52. 96 Return to debug level 51. 97 Return to debug level 50. 98 Return to debug level 49. 99 Return to debug level 48. 100 Return to debug level 47. 101 Return to debug level 46. 102 Return to debug level 45. 103 Return to debug level 44. 104 Return to debug level 43. 105 Return to debug level 42. 106 Return to debug level 41. 107 Return to debug level 40. 108 Return to debug level 39. 109 Return to debug level 38. 110 Return to debug level 37. 111 Return to debug level 36. 112 Return to debug level 35. 113 Return to debug level 34. 114 Return to debug level 33. 115 Return to debug level 32. 116 Return to debug level 31. 117 Return to debug level 30. 118 Return to debug level 29. 119 Return to debug level 28. 120 Return to debug level 27. 121 Return to debug level 26. 122 Return to debug level 25. 123 Return to debug level 24. 124 Return to debug level 23. 125 Return to debug level 22. 126 Return to debug level 21. 127 Return to debug level 20. 128 Return to debug level 19. 129 Return to debug level 18. 130 Return to debug level 17. 131 Return to debug level 16. 132 Return to debug level 15. 133 Return to debug level 14. 134 Return to debug level 13. 135 Return to debug level 12. 136 Return to debug level 11. 137 Return to debug level 10. 138 Return to debug level 9. 139 Return to debug level 8. 140 Return to debug level 7. 141 Return to debug level 6. 142 Return to debug level 5. 143 Return to debug level 4. 144 Return to debug level 3. 145 Return to debug level 2. 146 Return to debug level 1. 147 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 147. 2 Return to debug level 146. 3 Return to debug level 145. 4 Return to debug level 144. 5 Return to debug level 143. 6 Return to debug level 142. 7 Return to debug level 141. 8 Return to debug level 140. 9 Return to debug level 139. 10 Return to debug level 138. 11 Return to debug level 137. 12 Return to debug level 136. 13 Return to debug level 135. 14 Return to debug level 134. 15 Return to debug level 133. 16 Return to debug level 132. 17 Return to debug level 131. 18 Return to debug level 130. 19 Return to debug level 129. 20 Return to debug level 128. 21 Return to debug level 127. 22 Return to debug level 126. 23 Return to debug level 125. 24 Return to debug level 124. 25 Return to debug level 123. 26 Return to debug level 122. 27 Return to debug level 121. 28 Return to debug level 120. 29 Return to debug level 119. 30 Return to debug level 118. 31 Return to debug level 117. 32 Return to debug level 116. 33 Return to debug level 115. 34 Return to debug level 114. 35 Return to debug level 113. 36 Return to debug level 112. 37 Return to debug level 111. 38 Return to debug level 110. 39 Return to debug level 109. 40 Return to debug level 108. 41 Return to debug level 107. 42 Return to debug level 106. 43 Return to debug level 105. 44 Return to debug level 104. 45 Return to debug level 103. 46 Return to debug level 102. 47 Return to debug level 101. 48 Return to debug level 100. 49 Return to debug level 99. 50 Return to debug level 98. 51 Return to debug level 97. 52 Return to debug level 96. 53 Return to debug level 95. 54 Return to debug level 94. 55 Return to debug level 93. 56 Return to debug level 92. 57 Return to debug level 91. 58 Return to debug level 90. 59 Return to debug level 89. 60 Return to debug level 88. 61 Return to debug level 87. 62 Return to debug level 86. 63 Return to debug level 85. 64 Return to debug level 84. 65 Return to debug level 83. 66 Return to debug level 82. 67 Return to debug level 81. 68 Return to debug level 80. 69 Return to debug level 79. 70 Return to debug level 78. 71 Return to debug level 77. 72 Return to debug level 76. 73 Return to debug level 75. 74 Return to debug level 74. 75 Return to debug level 73. 76 Return to debug level 72. 77 Return to debug level 71. 78 Return to debug level 70. 79 Return to debug level 69. 80 Return to debug level 68. 81 Return to debug level 67. 82 Return to debug level 66. 83 Return to debug level 65. 84 Return to debug level 64. 85 Return to debug level 63. 86 Return to debug level 62. 87 Return to debug level 61. 88 Return to debug level 60. 89 Return to debug level 59. 90 Return to debug level 58. 91 Return to debug level 57. 92 Return to debug level 56. 93 Return to debug level 55. 94 Return to debug level 54. 95 Return to debug level 53. 96 Return to debug level 52. 97 Return to debug level 51. 98 Return to debug level 50. 99 Return to debug level 49. 100 Return to debug level 48. 101 Return to debug level 47. 102 Return to debug level 46. 103 Return to debug level 45. 104 Return to debug level 44. 105 Return to debug level 43. 106 Return to debug level 42. 107 Return to debug level 41. 108 Return to debug level 40. 109 Return to debug level 39. 110 Return to debug level 38. 111 Return to debug level 37. 112 Return to debug level 36. 113 Return to debug level 35. 114 Return to debug level 34. 115 Return to debug level 33. 116 Return to debug level 32. 117 Return to debug level 31. 118 Return to debug level 30. 119 Return to debug level 29. 120 Return to debug level 28. 121 Return to debug level 27. 122 Return to debug level 26. 123 Return to debug level 25. 124 Return to debug level 24. 125 Return to debug level 23. 126 Return to debug level 22. 127 Return to debug level 21. 128 Return to debug level 20. 129 Return to debug level 19. 130 Return to debug level 18. 131 Return to debug level 17. 132 Return to debug level 16. 133 Return to debug level 15. 134 Return to debug level 14. 135 Return to debug level 13. 136 Return to debug level 12. 137 Return to debug level 11. 138 Return to debug level 10. 139 Return to debug level 9. 140 Return to debug level 8. 141 Return to debug level 7. 142 Return to debug level 6. 143 Return to debug level 5. 144 Return to debug level 4. 145 Return to debug level 3. 146 Return to debug level 2. 147 Return to debug level 1. 148 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 148. 2 Return to debug level 147. 3 Return to debug level 146. 4 Return to debug level 145. 5 Return to debug level 144. 6 Return to debug level 143. 7 Return to debug level 142. 8 Return to debug level 141. 9 Return to debug level 140. 10 Return to debug level 139. 11 Return to debug level 138. 12 Return to debug level 137. 13 Return to debug level 136. 14 Return to debug level 135. 15 Return to debug level 134. 16 Return to debug level 133. 17 Return to debug level 132. 18 Return to debug level 131. 19 Return to debug level 130. 20 Return to debug level 129. 21 Return to debug level 128. 22 Return to debug level 127. 23 Return to debug level 126. 24 Return to debug level 125. 25 Return to debug level 124. 26 Return to debug level 123. 27 Return to debug level 122. 28 Return to debug level 121. 29 Return to debug level 120. 30 Return to debug level 119. 31 Return to debug level 118. 32 Return to debug level 117. 33 Return to debug level 116. 34 Return to debug level 115. 35 Return to debug level 114. 36 Return to debug level 113. 37 Return to debug level 112. 38 Return to debug level 111. 39 Return to debug level 110. 40 Return to debug level 109. 41 Return to debug level 108. 42 Return to debug level 107. 43 Return to debug level 106. 44 Return to debug level 105. 45 Return to debug level 104. 46 Return to debug level 103. 47 Return to debug level 102. 48 Return to debug level 101. 49 Return to debug level 100. 50 Return to debug level 99. 51 Return to debug level 98. 52 Return to debug level 97. 53 Return to debug level 96. 54 Return to debug level 95. 55 Return to debug level 94. 56 Return to debug level 93. 57 Return to debug level 92. 58 Return to debug level 91. 59 Return to debug level 90. 60 Return to debug level 89. 61 Return to debug level 88. 62 Return to debug level 87. 63 Return to debug level 86. 64 Return to debug level 85. 65 Return to debug level 84. 66 Return to debug level 83. 67 Return to debug level 82. 68 Return to debug level 81. 69 Return to debug level 80. 70 Return to debug level 79. 71 Return to debug level 78. 72 Return to debug level 77. 73 Return to debug level 76. 74 Return to debug level 75. 75 Return to debug level 74. 76 Return to debug level 73. 77 Return to debug level 72. 78 Return to debug level 71. 79 Return to debug level 70. 80 Return to debug level 69. 81 Return to debug level 68. 82 Return to debug level 67. 83 Return to debug level 66. 84 Return to debug level 65. 85 Return to debug level 64. 86 Return to debug level 63. 87 Return to debug level 62. 88 Return to debug level 61. 89 Return to debug level 60. 90 Return to debug level 59. 91 Return to debug level 58. 92 Return to debug level 57. 93 Return to debug level 56. 94 Return to debug level 55. 95 Return to debug level 54. 96 Return to debug level 53. 97 Return to debug level 52. 98 Return to debug level 51. 99 Return to debug level 50. 100 Return to debug level 49. 101 Return to debug level 48. 102 Return to debug level 47. 103 Return to debug level 46. 104 Return to debug level 45. 105 Return to debug level 44. 106 Return to debug level 43. 107 Return to debug level 42. 108 Return to debug level 41. 109 Return to debug level 40. 110 Return to debug level 39. 111 Return to debug level 38. 112 Return to debug level 37. 113 Return to debug level 36. 114 Return to debug level 35. 115 Return to debug level 34. 116 Return to debug level 33. 117 Return to debug level 32. 118 Return to debug level 31. 119 Return to debug level 30. 120 Return to debug level 29. 121 Return to debug level 28. 122 Return to debug level 27. 123 Return to debug level 26. 124 Return to debug level 25. 125 Return to debug level 24. 126 Return to debug level 23. 127 Return to debug level 22. 128 Return to debug level 21. 129 Return to debug level 20. 130 Return to debug level 19. 131 Return to debug level 18. 132 Return to debug level 17. 133 Return to debug level 16. 134 Return to debug level 15. 135 Return to debug level 14. 136 Return to debug level 13. 137 Return to debug level 12. 138 Return to debug level 11. 139 Return to debug level 10. 140 Return to debug level 9. 141 Return to debug level 8. 142 Return to debug level 7. 143 Return to debug level 6. 144 Return to debug level 5. 145 Return to debug level 4. 146 Return to debug level 3. 147 Return to debug level 2. 148 Return to debug level 1. 149 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 149. 2 Return to debug level 148. 3 Return to debug level 147. 4 Return to debug level 146. 5 Return to debug level 145. 6 Return to debug level 144. 7 Return to debug level 143. 8 Return to debug level 142. 9 Return to debug level 141. 10 Return to debug level 140. 11 Return to debug level 139. 12 Return to debug level 138. 13 Return to debug level 137. 14 Return to debug level 136. 15 Return to debug level 135. 16 Return to debug level 134. 17 Return to debug level 133. 18 Return to debug level 132. 19 Return to debug level 131. 20 Return to debug level 130. 21 Return to debug level 129. 22 Return to debug level 128. 23 Return to debug level 127. 24 Return to debug level 126. 25 Return to debug level 125. 26 Return to debug level 124. 27 Return to debug level 123. 28 Return to debug level 122. 29 Return to debug level 121. 30 Return to debug level 120. 31 Return to debug level 119. 32 Return to debug level 118. 33 Return to debug level 117. 34 Return to debug level 116. 35 Return to debug level 115. 36 Return to debug level 114. 37 Return to debug level 113. 38 Return to debug level 112. 39 Return to debug level 111. 40 Return to debug level 110. 41 Return to debug level 109. 42 Return to debug level 108. 43 Return to debug level 107. 44 Return to debug level 106. 45 Return to debug level 105. 46 Return to debug level 104. 47 Return to debug level 103. 48 Return to debug level 102. 49 Return to debug level 101. 50 Return to debug level 100. 51 Return to debug level 99. 52 Return to debug level 98. 53 Return to debug level 97. 54 Return to debug level 96. 55 Return to debug level 95. 56 Return to debug level 94. 57 Return to debug level 93. 58 Return to debug level 92. 59 Return to debug level 91. 60 Return to debug level 90. 61 Return to debug level 89. 62 Return to debug level 88. 63 Return to debug level 87. 64 Return to debug level 86. 65 Return to debug level 85. 66 Return to debug level 84. 67 Return to debug level 83. 68 Return to debug level 82. 69 Return to debug level 81. 70 Return to debug level 80. 71 Return to debug level 79. 72 Return to debug level 78. 73 Return to debug level 77. 74 Return to debug level 76. 75 Return to debug level 75. 76 Return to debug level 74. 77 Return to debug level 73. 78 Return to debug level 72. 79 Return to debug level 71. 80 Return to debug level 70. 81 Return to debug level 69. 82 Return to debug level 68. 83 Return to debug level 67. 84 Return to debug level 66. 85 Return to debug level 65. 86 Return to debug level 64. 87 Return to debug level 63. 88 Return to debug level 62. 89 Return to debug level 61. 90 Return to debug level 60. 91 Return to debug level 59. 92 Return to debug level 58. 93 Return to debug level 57. 94 Return to debug level 56. 95 Return to debug level 55. 96 Return to debug level 54. 97 Return to debug level 53. 98 Return to debug level 52. 99 Return to debug level 51. 100 Return to debug level 50. 101 Return to debug level 49. 102 Return to debug level 48. 103 Return to debug level 47. 104 Return to debug level 46. 105 Return to debug level 45. 106 Return to debug level 44. 107 Return to debug level 43. 108 Return to debug level 42. 109 Return to debug level 41. 110 Return to debug level 40. 111 Return to debug level 39. 112 Return to debug level 38. 113 Return to debug level 37. 114 Return to debug level 36. 115 Return to debug level 35. 116 Return to debug level 34. 117 Return to debug level 33. 118 Return to debug level 32. 119 Return to debug level 31. 120 Return to debug level 30. 121 Return to debug level 29. 122 Return to debug level 28. 123 Return to debug level 27. 124 Return to debug level 26. 125 Return to debug level 25. 126 Return to debug level 24. 127 Return to debug level 23. 128 Return to debug level 22. 129 Return to debug level 21. 130 Return to debug level 20. 131 Return to debug level 19. 132 Return to debug level 18. 133 Return to debug level 17. 134 Return to debug level 16. 135 Return to debug level 15. 136 Return to debug level 14. 137 Return to debug level 13. 138 Return to debug level 12. 139 Return to debug level 11. 140 Return to debug level 10. 141 Return to debug level 9. 142 Return to debug level 8. 143 Return to debug level 7. 144 Return to debug level 6. 145 Return to debug level 5. 146 Return to debug level 4. 147 Return to debug level 3. 148 Return to debug level 2. 149 Return to debug level 1. 150 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 150. 2 Return to debug level 149. 3 Return to debug level 148. 4 Return to debug level 147. 5 Return to debug level 146. 6 Return to debug level 145. 7 Return to debug level 144. 8 Return to debug level 143. 9 Return to debug level 142. 10 Return to debug level 141. 11 Return to debug level 140. 12 Return to debug level 139. 13 Return to debug level 138. 14 Return to debug level 137. 15 Return to debug level 136. 16 Return to debug level 135. 17 Return to debug level 134. 18 Return to debug level 133. 19 Return to debug level 132. 20 Return to debug level 131. 21 Return to debug level 130. 22 Return to debug level 129. 23 Return to debug level 128. 24 Return to debug level 127. 25 Return to debug level 126. 26 Return to debug level 125. 27 Return to debug level 124. 28 Return to debug level 123. 29 Return to debug level 122. 30 Return to debug level 121. 31 Return to debug level 120. 32 Return to debug level 119. 33 Return to debug level 118. 34 Return to debug level 117. 35 Return to debug level 116. 36 Return to debug level 115. 37 Return to debug level 114. 38 Return to debug level 113. 39 Return to debug level 112. 40 Return to debug level 111. 41 Return to debug level 110. 42 Return to debug level 109. 43 Return to debug level 108. 44 Return to debug level 107. 45 Return to debug level 106. 46 Return to debug level 105. 47 Return to debug level 104. 48 Return to debug level 103. 49 Return to debug level 102. 50 Return to debug level 101. 51 Return to debug level 100. 52 Return to debug level 99. 53 Return to debug level 98. 54 Return to debug level 97. 55 Return to debug level 96. 56 Return to debug level 95. 57 Return to debug level 94. 58 Return to debug level 93. 59 Return to debug level 92. 60 Return to debug level 91. 61 Return to debug level 90. 62 Return to debug level 89. 63 Return to debug level 88. 64 Return to debug level 87. 65 Return to debug level 86. 66 Return to debug level 85. 67 Return to debug level 84. 68 Return to debug level 83. 69 Return to debug level 82. 70 Return to debug level 81. 71 Return to debug level 80. 72 Return to debug level 79. 73 Return to debug level 78. 74 Return to debug level 77. 75 Return to debug level 76. 76 Return to debug level 75. 77 Return to debug level 74. 78 Return to debug level 73. 79 Return to debug level 72. 80 Return to debug level 71. 81 Return to debug level 70. 82 Return to debug level 69. 83 Return to debug level 68. 84 Return to debug level 67. 85 Return to debug level 66. 86 Return to debug level 65. 87 Return to debug level 64. 88 Return to debug level 63. 89 Return to debug level 62. 90 Return to debug level 61. 91 Return to debug level 60. 92 Return to debug level 59. 93 Return to debug level 58. 94 Return to debug level 57. 95 Return to debug level 56. 96 Return to debug level 55. 97 Return to debug level 54. 98 Return to debug level 53. 99 Return to debug level 52. 100 Return to debug level 51. 101 Return to debug level 50. 102 Return to debug level 49. 103 Return to debug level 48. 104 Return to debug level 47. 105 Return to debug level 46. 106 Return to debug level 45. 107 Return to debug level 44. 108 Return to debug level 43. 109 Return to debug level 42. 110 Return to debug level 41. 111 Return to debug level 40. 112 Return to debug level 39. 113 Return to debug level 38. 114 Return to debug level 37. 115 Return to debug level 36. 116 Return to debug level 35. 117 Return to debug level 34. 118 Return to debug level 33. 119 Return to debug level 32. 120 Return to debug level 31. 121 Return to debug level 30. 122 Return to debug level 29. 123 Return to debug level 28. 124 Return to debug level 27. 125 Return to debug level 26. 126 Return to debug level 25. 127 Return to debug level 24. 128 Return to debug level 23. 129 Return to debug level 22. 130 Return to debug level 21. 131 Return to debug level 20. 132 Return to debug level 19. 133 Return to debug level 18. 134 Return to debug level 17. 135 Return to debug level 16. 136 Return to debug level 15. 137 Return to debug level 14. 138 Return to debug level 13. 139 Return to debug level 12. 140 Return to debug level 11. 141 Return to debug level 10. 142 Return to debug level 9. 143 Return to debug level 8. 144 Return to debug level 7. 145 Return to debug level 6. 146 Return to debug level 5. 147 Return to debug level 4. 148 Return to debug level 3. 149 Return to debug level 2. 150 Return to debug level 1. 151 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 151. 2 Return to debug level 150. 3 Return to debug level 149. 4 Return to debug level 148. 5 Return to debug level 147. 6 Return to debug level 146. 7 Return to debug level 145. 8 Return to debug level 144. 9 Return to debug level 143. 10 Return to debug level 142. 11 Return to debug level 141. 12 Return to debug level 140. 13 Return to debug level 139. 14 Return to debug level 138. 15 Return to debug level 137. 16 Return to debug level 136. 17 Return to debug level 135. 18 Return to debug level 134. 19 Return to debug level 133. 20 Return to debug level 132. 21 Return to debug level 131. 22 Return to debug level 130. 23 Return to debug level 129. 24 Return to debug level 128. 25 Return to debug level 127. 26 Return to debug level 126. 27 Return to debug level 125. 28 Return to debug level 124. 29 Return to debug level 123. 30 Return to debug level 122. 31 Return to debug level 121. 32 Return to debug level 120. 33 Return to debug level 119. 34 Return to debug level 118. 35 Return to debug level 117. 36 Return to debug level 116. 37 Return to debug level 115. 38 Return to debug level 114. 39 Return to debug level 113. 40 Return to debug level 112. 41 Return to debug level 111. 42 Return to debug level 110. 43 Return to debug level 109. 44 Return to debug level 108. 45 Return to debug level 107. 46 Return to debug level 106. 47 Return to debug level 105. 48 Return to debug level 104. 49 Return to debug level 103. 50 Return to debug level 102. 51 Return to debug level 101. 52 Return to debug level 100. 53 Return to debug level 99. 54 Return to debug level 98. 55 Return to debug level 97. 56 Return to debug level 96. 57 Return to debug level 95. 58 Return to debug level 94. 59 Return to debug level 93. 60 Return to debug level 92. 61 Return to debug level 91. 62 Return to debug level 90. 63 Return to debug level 89. 64 Return to debug level 88. 65 Return to debug level 87. 66 Return to debug level 86. 67 Return to debug level 85. 68 Return to debug level 84. 69 Return to debug level 83. 70 Return to debug level 82. 71 Return to debug level 81. 72 Return to debug level 80. 73 Return to debug level 79. 74 Return to debug level 78. 75 Return to debug level 77. 76 Return to debug level 76. 77 Return to debug level 75. 78 Return to debug level 74. 79 Return to debug level 73. 80 Return to debug level 72. 81 Return to debug level 71. 82 Return to debug level 70. 83 Return to debug level 69. 84 Return to debug level 68. 85 Return to debug level 67. 86 Return to debug level 66. 87 Return to debug level 65. 88 Return to debug level 64. 89 Return to debug level 63. 90 Return to debug level 62. 91 Return to debug level 61. 92 Return to debug level 60. 93 Return to debug level 59. 94 Return to debug level 58. 95 Return to debug level 57. 96 Return to debug level 56. 97 Return to debug level 55. 98 Return to debug level 54. 99 Return to debug level 53. 100 Return to debug level 52. 101 Return to debug level 51. 102 Return to debug level 50. 103 Return to debug level 49. 104 Return to debug level 48. 105 Return to debug level 47. 106 Return to debug level 46. 107 Return to debug level 45. 108 Return to debug level 44. 109 Return to debug level 43. 110 Return to debug level 42. 111 Return to debug level 41. 112 Return to debug level 40. 113 Return to debug level 39. 114 Return to debug level 38. 115 Return to debug level 37. 116 Return to debug level 36. 117 Return to debug level 35. 118 Return to debug level 34. 119 Return to debug level 33. 120 Return to debug level 32. 121 Return to debug level 31. 122 Return to debug level 30. 123 Return to debug level 29. 124 Return to debug level 28. 125 Return to debug level 27. 126 Return to debug level 26. 127 Return to debug level 25. 128 Return to debug level 24. 129 Return to debug level 23. 130 Return to debug level 22. 131 Return to debug level 21. 132 Return to debug level 20. 133 Return to debug level 19. 134 Return to debug level 18. 135 Return to debug level 17. 136 Return to debug level 16. 137 Return to debug level 15. 138 Return to debug level 14. 139 Return to debug level 13. 140 Return to debug level 12. 141 Return to debug level 11. 142 Return to debug level 10. 143 Return to debug level 9. 144 Return to debug level 8. 145 Return to debug level 7. 146 Return to debug level 6. 147 Return to debug level 5. 148 Return to debug level 4. 149 Return to debug level 3. 150 Return to debug level 2. 151 Return to debug level 1. 152 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 152. 2 Return to debug level 151. 3 Return to debug level 150. 4 Return to debug level 149. 5 Return to debug level 148. 6 Return to debug level 147. 7 Return to debug level 146. 8 Return to debug level 145. 9 Return to debug level 144. 10 Return to debug level 143. 11 Return to debug level 142. 12 Return to debug level 141. 13 Return to debug level 140. 14 Return to debug level 139. 15 Return to debug level 138. 16 Return to debug level 137. 17 Return to debug level 136. 18 Return to debug level 135. 19 Return to debug level 134. 20 Return to debug level 133. 21 Return to debug level 132. 22 Return to debug level 131. 23 Return to debug level 130. 24 Return to debug level 129. 25 Return to debug level 128. 26 Return to debug level 127. 27 Return to debug level 126. 28 Return to debug level 125. 29 Return to debug level 124. 30 Return to debug level 123. 31 Return to debug level 122. 32 Return to debug level 121. 33 Return to debug level 120. 34 Return to debug level 119. 35 Return to debug level 118. 36 Return to debug level 117. 37 Return to debug level 116. 38 Return to debug level 115. 39 Return to debug level 114. 40 Return to debug level 113. 41 Return to debug level 112. 42 Return to debug level 111. 43 Return to debug level 110. 44 Return to debug level 109. 45 Return to debug level 108. 46 Return to debug level 107. 47 Return to debug level 106. 48 Return to debug level 105. 49 Return to debug level 104. 50 Return to debug level 103. 51 Return to debug level 102. 52 Return to debug level 101. 53 Return to debug level 100. 54 Return to debug level 99. 55 Return to debug level 98. 56 Return to debug level 97. 57 Return to debug level 96. 58 Return to debug level 95. 59 Return to debug level 94. 60 Return to debug level 93. 61 Return to debug level 92. 62 Return to debug level 91. 63 Return to debug level 90. 64 Return to debug level 89. 65 Return to debug level 88. 66 Return to debug level 87. 67 Return to debug level 86. 68 Return to debug level 85. 69 Return to debug level 84. 70 Return to debug level 83. 71 Return to debug level 82. 72 Return to debug level 81. 73 Return to debug level 80. 74 Return to debug level 79. 75 Return to debug level 78. 76 Return to debug level 77. 77 Return to debug level 76. 78 Return to debug level 75. 79 Return to debug level 74. 80 Return to debug level 73. 81 Return to debug level 72. 82 Return to debug level 71. 83 Return to debug level 70. 84 Return to debug level 69. 85 Return to debug level 68. 86 Return to debug level 67. 87 Return to debug level 66. 88 Return to debug level 65. 89 Return to debug level 64. 90 Return to debug level 63. 91 Return to debug level 62. 92 Return to debug level 61. 93 Return to debug level 60. 94 Return to debug level 59. 95 Return to debug level 58. 96 Return to debug level 57. 97 Return to debug level 56. 98 Return to debug level 55. 99 Return to debug level 54. 100 Return to debug level 53. 101 Return to debug level 52. 102 Return to debug level 51. 103 Return to debug level 50. 104 Return to debug level 49. 105 Return to debug level 48. 106 Return to debug level 47. 107 Return to debug level 46. 108 Return to debug level 45. 109 Return to debug level 44. 110 Return to debug level 43. 111 Return to debug level 42. 112 Return to debug level 41. 113 Return to debug level 40. 114 Return to debug level 39. 115 Return to debug level 38. 116 Return to debug level 37. 117 Return to debug level 36. 118 Return to debug level 35. 119 Return to debug level 34. 120 Return to debug level 33. 121 Return to debug level 32. 122 Return to debug level 31. 123 Return to debug level 30. 124 Return to debug level 29. 125 Return to debug level 28. 126 Return to debug level 27. 127 Return to debug level 26. 128 Return to debug level 25. 129 Return to debug level 24. 130 Return to debug level 23. 131 Return to debug level 22. 132 Return to debug level 21. 133 Return to debug level 20. 134 Return to debug level 19. 135 Return to debug level 18. 136 Return to debug level 17. 137 Return to debug level 16. 138 Return to debug level 15. 139 Return to debug level 14. 140 Return to debug level 13. 141 Return to debug level 12. 142 Return to debug level 11. 143 Return to debug level 10. 144 Return to debug level 9. 145 Return to debug level 8. 146 Return to debug level 7. 147 Return to debug level 6. 148 Return to debug level 5. 149 Return to debug level 4. 150 Return to debug level 3. 151 Return to debug level 2. 152 Return to debug level 1. 153 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 153. 2 Return to debug level 152. 3 Return to debug level 151. 4 Return to debug level 150. 5 Return to debug level 149. 6 Return to debug level 148. 7 Return to debug level 147. 8 Return to debug level 146. 9 Return to debug level 145. 10 Return to debug level 144. 11 Return to debug level 143. 12 Return to debug level 142. 13 Return to debug level 141. 14 Return to debug level 140. 15 Return to debug level 139. 16 Return to debug level 138. 17 Return to debug level 137. 18 Return to debug level 136. 19 Return to debug level 135. 20 Return to debug level 134. 21 Return to debug level 133. 22 Return to debug level 132. 23 Return to debug level 131. 24 Return to debug level 130. 25 Return to debug level 129. 26 Return to debug level 128. 27 Return to debug level 127. 28 Return to debug level 126. 29 Return to debug level 125. 30 Return to debug level 124. 31 Return to debug level 123. 32 Return to debug level 122. 33 Return to debug level 121. 34 Return to debug level 120. 35 Return to debug level 119. 36 Return to debug level 118. 37 Return to debug level 117. 38 Return to debug level 116. 39 Return to debug level 115. 40 Return to debug level 114. 41 Return to debug level 113. 42 Return to debug level 112. 43 Return to debug level 111. 44 Return to debug level 110. 45 Return to debug level 109. 46 Return to debug level 108. 47 Return to debug level 107. 48 Return to debug level 106. 49 Return to debug level 105. 50 Return to debug level 104. 51 Return to debug level 103. 52 Return to debug level 102. 53 Return to debug level 101. 54 Return to debug level 100. 55 Return to debug level 99. 56 Return to debug level 98. 57 Return to debug level 97. 58 Return to debug level 96. 59 Return to debug level 95. 60 Return to debug level 94. 61 Return to debug level 93. 62 Return to debug level 92. 63 Return to debug level 91. 64 Return to debug level 90. 65 Return to debug level 89. 66 Return to debug level 88. 67 Return to debug level 87. 68 Return to debug level 86. 69 Return to debug level 85. 70 Return to debug level 84. 71 Return to debug level 83. 72 Return to debug level 82. 73 Return to debug level 81. 74 Return to debug level 80. 75 Return to debug level 79. 76 Return to debug level 78. 77 Return to debug level 77. 78 Return to debug level 76. 79 Return to debug level 75. 80 Return to debug level 74. 81 Return to debug level 73. 82 Return to debug level 72. 83 Return to debug level 71. 84 Return to debug level 70. 85 Return to debug level 69. 86 Return to debug level 68. 87 Return to debug level 67. 88 Return to debug level 66. 89 Return to debug level 65. 90 Return to debug level 64. 91 Return to debug level 63. 92 Return to debug level 62. 93 Return to debug level 61. 94 Return to debug level 60. 95 Return to debug level 59. 96 Return to debug level 58. 97 Return to debug level 57. 98 Return to debug level 56. 99 Return to debug level 55. 100 Return to debug level 54. 101 Return to debug level 53. 102 Return to debug level 52. 103 Return to debug level 51. 104 Return to debug level 50. 105 Return to debug level 49. 106 Return to debug level 48. 107 Return to debug level 47. 108 Return to debug level 46. 109 Return to debug level 45. 110 Return to debug level 44. 111 Return to debug level 43. 112 Return to debug level 42. 113 Return to debug level 41. 114 Return to debug level 40. 115 Return to debug level 39. 116 Return to debug level 38. 117 Return to debug level 37. 118 Return to debug level 36. 119 Return to debug level 35. 120 Return to debug level 34. 121 Return to debug level 33. 122 Return to debug level 32. 123 Return to debug level 31. 124 Return to debug level 30. 125 Return to debug level 29. 126 Return to debug level 28. 127 Return to debug level 27. 128 Return to debug level 26. 129 Return to debug level 25. 130 Return to debug level 24. 131 Return to debug level 23. 132 Return to debug level 22. 133 Return to debug level 21. 134 Return to debug level 20. 135 Return to debug level 19. 136 Return to debug level 18. 137 Return to debug level 17. 138 Return to debug level 16. 139 Return to debug level 15. 140 Return to debug level 14. 141 Return to debug level 13. 142 Return to debug level 12. 143 Return to debug level 11. 144 Return to debug level 10. 145 Return to debug level 9. 146 Return to debug level 8. 147 Return to debug level 7. 148 Return to debug level 6. 149 Return to debug level 5. 150 Return to debug level 4. 151 Return to debug level 3. 152 Return to debug level 2. 153 Return to debug level 1. 154 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 154. 2 Return to debug level 153. 3 Return to debug level 152. 4 Return to debug level 151. 5 Return to debug level 150. 6 Return to debug level 149. 7 Return to debug level 148. 8 Return to debug level 147. 9 Return to debug level 146. 10 Return to debug level 145. 11 Return to debug level 144. 12 Return to debug level 143. 13 Return to debug level 142. 14 Return to debug level 141. 15 Return to debug level 140. 16 Return to debug level 139. 17 Return to debug level 138. 18 Return to debug level 137. 19 Return to debug level 136. 20 Return to debug level 135. 21 Return to debug level 134. 22 Return to debug level 133. 23 Return to debug level 132. 24 Return to debug level 131. 25 Return to debug level 130. 26 Return to debug level 129. 27 Return to debug level 128. 28 Return to debug level 127. 29 Return to debug level 126. 30 Return to debug level 125. 31 Return to debug level 124. 32 Return to debug level 123. 33 Return to debug level 122. 34 Return to debug level 121. 35 Return to debug level 120. 36 Return to debug level 119. 37 Return to debug level 118. 38 Return to debug level 117. 39 Return to debug level 116. 40 Return to debug level 115. 41 Return to debug level 114. 42 Return to debug level 113. 43 Return to debug level 112. 44 Return to debug level 111. 45 Return to debug level 110. 46 Return to debug level 109. 47 Return to debug level 108. 48 Return to debug level 107. 49 Return to debug level 106. 50 Return to debug level 105. 51 Return to debug level 104. 52 Return to debug level 103. 53 Return to debug level 102. 54 Return to debug level 101. 55 Return to debug level 100. 56 Return to debug level 99. 57 Return to debug level 98. 58 Return to debug level 97. 59 Return to debug level 96. 60 Return to debug level 95. 61 Return to debug level 94. 62 Return to debug level 93. 63 Return to debug level 92. 64 Return to debug level 91. 65 Return to debug level 90. 66 Return to debug level 89. 67 Return to debug level 88. 68 Return to debug level 87. 69 Return to debug level 86. 70 Return to debug level 85. 71 Return to debug level 84. 72 Return to debug level 83. 73 Return to debug level 82. 74 Return to debug level 81. 75 Return to debug level 80. 76 Return to debug level 79. 77 Return to debug level 78. 78 Return to debug level 77. 79 Return to debug level 76. 80 Return to debug level 75. 81 Return to debug level 74. 82 Return to debug level 73. 83 Return to debug level 72. 84 Return to debug level 71. 85 Return to debug level 70. 86 Return to debug level 69. 87 Return to debug level 68. 88 Return to debug level 67. 89 Return to debug level 66. 90 Return to debug level 65. 91 Return to debug level 64. 92 Return to debug level 63. 93 Return to debug level 62. 94 Return to debug level 61. 95 Return to debug level 60. 96 Return to debug level 59. 97 Return to debug level 58. 98 Return to debug level 57. 99 Return to debug level 56. 100 Return to debug level 55. 101 Return to debug level 54. 102 Return to debug level 53. 103 Return to debug level 52. 104 Return to debug level 51. 105 Return to debug level 50. 106 Return to debug level 49. 107 Return to debug level 48. 108 Return to debug level 47. 109 Return to debug level 46. 110 Return to debug level 45. 111 Return to debug level 44. 112 Return to debug level 43. 113 Return to debug level 42. 114 Return to debug level 41. 115 Return to debug level 40. 116 Return to debug level 39. 117 Return to debug level 38. 118 Return to debug level 37. 119 Return to debug level 36. 120 Return to debug level 35. 121 Return to debug level 34. 122 Return to debug level 33. 123 Return to debug level 32. 124 Return to debug level 31. 125 Return to debug level 30. 126 Return to debug level 29. 127 Return to debug level 28. 128 Return to debug level 27. 129 Return to debug level 26. 130 Return to debug level 25. 131 Return to debug level 24. 132 Return to debug level 23. 133 Return to debug level 22. 134 Return to debug level 21. 135 Return to debug level 20. 136 Return to debug level 19. 137 Return to debug level 18. 138 Return to debug level 17. 139 Return to debug level 16. 140 Return to debug level 15. 141 Return to debug level 14. 142 Return to debug level 13. 143 Return to debug level 12. 144 Return to debug level 11. 145 Return to debug level 10. 146 Return to debug level 9. 147 Return to debug level 8. 148 Return to debug level 7. 149 Return to debug level 6. 150 Return to debug level 5. 151 Return to debug level 4. 152 Return to debug level 3. 153 Return to debug level 2. 154 Return to debug level 1. 155 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 155. 2 Return to debug level 154. 3 Return to debug level 153. 4 Return to debug level 152. 5 Return to debug level 151. 6 Return to debug level 150. 7 Return to debug level 149. 8 Return to debug level 148. 9 Return to debug level 147. 10 Return to debug level 146. 11 Return to debug level 145. 12 Return to debug level 144. 13 Return to debug level 143. 14 Return to debug level 142. 15 Return to debug level 141. 16 Return to debug level 140. 17 Return to debug level 139. 18 Return to debug level 138. 19 Return to debug level 137. 20 Return to debug level 136. 21 Return to debug level 135. 22 Return to debug level 134. 23 Return to debug level 133. 24 Return to debug level 132. 25 Return to debug level 131. 26 Return to debug level 130. 27 Return to debug level 129. 28 Return to debug level 128. 29 Return to debug level 127. 30 Return to debug level 126. 31 Return to debug level 125. 32 Return to debug level 124. 33 Return to debug level 123. 34 Return to debug level 122. 35 Return to debug level 121. 36 Return to debug level 120. 37 Return to debug level 119. 38 Return to debug level 118. 39 Return to debug level 117. 40 Return to debug level 116. 41 Return to debug level 115. 42 Return to debug level 114. 43 Return to debug level 113. 44 Return to debug level 112. 45 Return to debug level 111. 46 Return to debug level 110. 47 Return to debug level 109. 48 Return to debug level 108. 49 Return to debug level 107. 50 Return to debug level 106. 51 Return to debug level 105. 52 Return to debug level 104. 53 Return to debug level 103. 54 Return to debug level 102. 55 Return to debug level 101. 56 Return to debug level 100. 57 Return to debug level 99. 58 Return to debug level 98. 59 Return to debug level 97. 60 Return to debug level 96. 61 Return to debug level 95. 62 Return to debug level 94. 63 Return to debug level 93. 64 Return to debug level 92. 65 Return to debug level 91. 66 Return to debug level 90. 67 Return to debug level 89. 68 Return to debug level 88. 69 Return to debug level 87. 70 Return to debug level 86. 71 Return to debug level 85. 72 Return to debug level 84. 73 Return to debug level 83. 74 Return to debug level 82. 75 Return to debug level 81. 76 Return to debug level 80. 77 Return to debug level 79. 78 Return to debug level 78. 79 Return to debug level 77. 80 Return to debug level 76. 81 Return to debug level 75. 82 Return to debug level 74. 83 Return to debug level 73. 84 Return to debug level 72. 85 Return to debug level 71. 86 Return to debug level 70. 87 Return to debug level 69. 88 Return to debug level 68. 89 Return to debug level 67. 90 Return to debug level 66. 91 Return to debug level 65. 92 Return to debug level 64. 93 Return to debug level 63. 94 Return to debug level 62. 95 Return to debug level 61. 96 Return to debug level 60. 97 Return to debug level 59. 98 Return to debug level 58. 99 Return to debug level 57. 100 Return to debug level 56. 101 Return to debug level 55. 102 Return to debug level 54. 103 Return to debug level 53. 104 Return to debug level 52. 105 Return to debug level 51. 106 Return to debug level 50. 107 Return to debug level 49. 108 Return to debug level 48. 109 Return to debug level 47. 110 Return to debug level 46. 111 Return to debug level 45. 112 Return to debug level 44. 113 Return to debug level 43. 114 Return to debug level 42. 115 Return to debug level 41. 116 Return to debug level 40. 117 Return to debug level 39. 118 Return to debug level 38. 119 Return to debug level 37. 120 Return to debug level 36. 121 Return to debug level 35. 122 Return to debug level 34. 123 Return to debug level 33. 124 Return to debug level 32. 125 Return to debug level 31. 126 Return to debug level 30. 127 Return to debug level 29. 128 Return to debug level 28. 129 Return to debug level 27. 130 Return to debug level 26. 131 Return to debug level 25. 132 Return to debug level 24. 133 Return to debug level 23. 134 Return to debug level 22. 135 Return to debug level 21. 136 Return to debug level 20. 137 Return to debug level 19. 138 Return to debug level 18. 139 Return to debug level 17. 140 Return to debug level 16. 141 Return to debug level 15. 142 Return to debug level 14. 143 Return to debug level 13. 144 Return to debug level 12. 145 Return to debug level 11. 146 Return to debug level 10. 147 Return to debug level 9. 148 Return to debug level 8. 149 Return to debug level 7. 150 Return to debug level 6. 151 Return to debug level 5. 152 Return to debug level 4. 153 Return to debug level 3. 154 Return to debug level 2. 155 Return to debug level 1. 156 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 156. 2 Return to debug level 155. 3 Return to debug level 154. 4 Return to debug level 153. 5 Return to debug level 152. 6 Return to debug level 151. 7 Return to debug level 150. 8 Return to debug level 149. 9 Return to debug level 148. 10 Return to debug level 147. 11 Return to debug level 146. 12 Return to debug level 145. 13 Return to debug level 144. 14 Return to debug level 143. 15 Return to debug level 142. 16 Return to debug level 141. 17 Return to debug level 140. 18 Return to debug level 139. 19 Return to debug level 138. 20 Return to debug level 137. 21 Return to debug level 136. 22 Return to debug level 135. 23 Return to debug level 134. 24 Return to debug level 133. 25 Return to debug level 132. 26 Return to debug level 131. 27 Return to debug level 130. 28 Return to debug level 129. 29 Return to debug level 128. 30 Return to debug level 127. 31 Return to debug level 126. 32 Return to debug level 125. 33 Return to debug level 124. 34 Return to debug level 123. 35 Return to debug level 122. 36 Return to debug level 121. 37 Return to debug level 120. 38 Return to debug level 119. 39 Return to debug level 118. 40 Return to debug level 117. 41 Return to debug level 116. 42 Return to debug level 115. 43 Return to debug level 114. 44 Return to debug level 113. 45 Return to debug level 112. 46 Return to debug level 111. 47 Return to debug level 110. 48 Return to debug level 109. 49 Return to debug level 108. 50 Return to debug level 107. 51 Return to debug level 106. 52 Return to debug level 105. 53 Return to debug level 104. 54 Return to debug level 103. 55 Return to debug level 102. 56 Return to debug level 101. 57 Return to debug level 100. 58 Return to debug level 99. 59 Return to debug level 98. 60 Return to debug level 97. 61 Return to debug level 96. 62 Return to debug level 95. 63 Return to debug level 94. 64 Return to debug level 93. 65 Return to debug level 92. 66 Return to debug level 91. 67 Return to debug level 90. 68 Return to debug level 89. 69 Return to debug level 88. 70 Return to debug level 87. 71 Return to debug level 86. 72 Return to debug level 85. 73 Return to debug level 84. 74 Return to debug level 83. 75 Return to debug level 82. 76 Return to debug level 81. 77 Return to debug level 80. 78 Return to debug level 79. 79 Return to debug level 78. 80 Return to debug level 77. 81 Return to debug level 76. 82 Return to debug level 75. 83 Return to debug level 74. 84 Return to debug level 73. 85 Return to debug level 72. 86 Return to debug level 71. 87 Return to debug level 70. 88 Return to debug level 69. 89 Return to debug level 68. 90 Return to debug level 67. 91 Return to debug level 66. 92 Return to debug level 65. 93 Return to debug level 64. 94 Return to debug level 63. 95 Return to debug level 62. 96 Return to debug level 61. 97 Return to debug level 60. 98 Return to debug level 59. 99 Return to debug level 58. 100 Return to debug level 57. 101 Return to debug level 56. 102 Return to debug level 55. 103 Return to debug level 54. 104 Return to debug level 53. 105 Return to debug level 52. 106 Return to debug level 51. 107 Return to debug level 50. 108 Return to debug level 49. 109 Return to debug level 48. 110 Return to debug level 47. 111 Return to debug level 46. 112 Return to debug level 45. 113 Return to debug level 44. 114 Return to debug level 43. 115 Return to debug level 42. 116 Return to debug level 41. 117 Return to debug level 40. 118 Return to debug level 39. 119 Return to debug level 38. 120 Return to debug level 37. 121 Return to debug level 36. 122 Return to debug level 35. 123 Return to debug level 34. 124 Return to debug level 33. 125 Return to debug level 32. 126 Return to debug level 31. 127 Return to debug level 30. 128 Return to debug level 29. 129 Return to debug level 28. 130 Return to debug level 27. 131 Return to debug level 26. 132 Return to debug level 25. 133 Return to debug level 24. 134 Return to debug level 23. 135 Return to debug level 22. 136 Return to debug level 21. 137 Return to debug level 20. 138 Return to debug level 19. 139 Return to debug level 18. 140 Return to debug level 17. 141 Return to debug level 16. 142 Return to debug level 15. 143 Return to debug level 14. 144 Return to debug level 13. 145 Return to debug level 12. 146 Return to debug level 11. 147 Return to debug level 10. 148 Return to debug level 9. 149 Return to debug level 8. 150 Return to debug level 7. 151 Return to debug level 6. 152 Return to debug level 5. 153 Return to debug level 4. 154 Return to debug level 3. 155 Return to debug level 2. 156 Return to debug level 1. 157 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 157. 2 Return to debug level 156. 3 Return to debug level 155. 4 Return to debug level 154. 5 Return to debug level 153. 6 Return to debug level 152. 7 Return to debug level 151. 8 Return to debug level 150. 9 Return to debug level 149. 10 Return to debug level 148. 11 Return to debug level 147. 12 Return to debug level 146. 13 Return to debug level 145. 14 Return to debug level 144. 15 Return to debug level 143. 16 Return to debug level 142. 17 Return to debug level 141. 18 Return to debug level 140. 19 Return to debug level 139. 20 Return to debug level 138. 21 Return to debug level 137. 22 Return to debug level 136. 23 Return to debug level 135. 24 Return to debug level 134. 25 Return to debug level 133. 26 Return to debug level 132. 27 Return to debug level 131. 28 Return to debug level 130. 29 Return to debug level 129. 30 Return to debug level 128. 31 Return to debug level 127. 32 Return to debug level 126. 33 Return to debug level 125. 34 Return to debug level 124. 35 Return to debug level 123. 36 Return to debug level 122. 37 Return to debug level 121. 38 Return to debug level 120. 39 Return to debug level 119. 40 Return to debug level 118. 41 Return to debug level 117. 42 Return to debug level 116. 43 Return to debug level 115. 44 Return to debug level 114. 45 Return to debug level 113. 46 Return to debug level 112. 47 Return to debug level 111. 48 Return to debug level 110. 49 Return to debug level 109. 50 Return to debug level 108. 51 Return to debug level 107. 52 Return to debug level 106. 53 Return to debug level 105. 54 Return to debug level 104. 55 Return to debug level 103. 56 Return to debug level 102. 57 Return to debug level 101. 58 Return to debug level 100. 59 Return to debug level 99. 60 Return to debug level 98. 61 Return to debug level 97. 62 Return to debug level 96. 63 Return to debug level 95. 64 Return to debug level 94. 65 Return to debug level 93. 66 Return to debug level 92. 67 Return to debug level 91. 68 Return to debug level 90. 69 Return to debug level 89. 70 Return to debug level 88. 71 Return to debug level 87. 72 Return to debug level 86. 73 Return to debug level 85. 74 Return to debug level 84. 75 Return to debug level 83. 76 Return to debug level 82. 77 Return to debug level 81. 78 Return to debug level 80. 79 Return to debug level 79. 80 Return to debug level 78. 81 Return to debug level 77. 82 Return to debug level 76. 83 Return to debug level 75. 84 Return to debug level 74. 85 Return to debug level 73. 86 Return to debug level 72. 87 Return to debug level 71. 88 Return to debug level 70. 89 Return to debug level 69. 90 Return to debug level 68. 91 Return to debug level 67. 92 Return to debug level 66. 93 Return to debug level 65. 94 Return to debug level 64. 95 Return to debug level 63. 96 Return to debug level 62. 97 Return to debug level 61. 98 Return to debug level 60. 99 Return to debug level 59. 100 Return to debug level 58. 101 Return to debug level 57. 102 Return to debug level 56. 103 Return to debug level 55. 104 Return to debug level 54. 105 Return to debug level 53. 106 Return to debug level 52. 107 Return to debug level 51. 108 Return to debug level 50. 109 Return to debug level 49. 110 Return to debug level 48. 111 Return to debug level 47. 112 Return to debug level 46. 113 Return to debug level 45. 114 Return to debug level 44. 115 Return to debug level 43. 116 Return to debug level 42. 117 Return to debug level 41. 118 Return to debug level 40. 119 Return to debug level 39. 120 Return to debug level 38. 121 Return to debug level 37. 122 Return to debug level 36. 123 Return to debug level 35. 124 Return to debug level 34. 125 Return to debug level 33. 126 Return to debug level 32. 127 Return to debug level 31. 128 Return to debug level 30. 129 Return to debug level 29. 130 Return to debug level 28. 131 Return to debug level 27. 132 Return to debug level 26. 133 Return to debug level 25. 134 Return to debug level 24. 135 Return to debug level 23. 136 Return to debug level 22. 137 Return to debug level 21. 138 Return to debug level 20. 139 Return to debug level 19. 140 Return to debug level 18. 141 Return to debug level 17. 142 Return to debug level 16. 143 Return to debug level 15. 144 Return to debug level 14. 145 Return to debug level 13. 146 Return to debug level 12. 147 Return to debug level 11. 148 Return to debug level 10. 149 Return to debug level 9. 150 Return to debug level 8. 151 Return to debug level 7. 152 Return to debug level 6. 153 Return to debug level 5. 154 Return to debug level 4. 155 Return to debug level 3. 156 Return to debug level 2. 157 Return to debug level 1. 158 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 158. 2 Return to debug level 157. 3 Return to debug level 156. 4 Return to debug level 155. 5 Return to debug level 154. 6 Return to debug level 153. 7 Return to debug level 152. 8 Return to debug level 151. 9 Return to debug level 150. 10 Return to debug level 149. 11 Return to debug level 148. 12 Return to debug level 147. 13 Return to debug level 146. 14 Return to debug level 145. 15 Return to debug level 144. 16 Return to debug level 143. 17 Return to debug level 142. 18 Return to debug level 141. 19 Return to debug level 140. 20 Return to debug level 139. 21 Return to debug level 138. 22 Return to debug level 137. 23 Return to debug level 136. 24 Return to debug level 135. 25 Return to debug level 134. 26 Return to debug level 133. 27 Return to debug level 132. 28 Return to debug level 131. 29 Return to debug level 130. 30 Return to debug level 129. 31 Return to debug level 128. 32 Return to debug level 127. 33 Return to debug level 126. 34 Return to debug level 125. 35 Return to debug level 124. 36 Return to debug level 123. 37 Return to debug level 122. 38 Return to debug level 121. 39 Return to debug level 120. 40 Return to debug level 119. 41 Return to debug level 118. 42 Return to debug level 117. 43 Return to debug level 116. 44 Return to debug level 115. 45 Return to debug level 114. 46 Return to debug level 113. 47 Return to debug level 112. 48 Return to debug level 111. 49 Return to debug level 110. 50 Return to debug level 109. 51 Return to debug level 108. 52 Return to debug level 107. 53 Return to debug level 106. 54 Return to debug level 105. 55 Return to debug level 104. 56 Return to debug level 103. 57 Return to debug level 102. 58 Return to debug level 101. 59 Return to debug level 100. 60 Return to debug level 99. 61 Return to debug level 98. 62 Return to debug level 97. 63 Return to debug level 96. 64 Return to debug level 95. 65 Return to debug level 94. 66 Return to debug level 93. 67 Return to debug level 92. 68 Return to debug level 91. 69 Return to debug level 90. 70 Return to debug level 89. 71 Return to debug level 88. 72 Return to debug level 87. 73 Return to debug level 86. 74 Return to debug level 85. 75 Return to debug level 84. 76 Return to debug level 83. 77 Return to debug level 82. 78 Return to debug level 81. 79 Return to debug level 80. 80 Return to debug level 79. 81 Return to debug level 78. 82 Return to debug level 77. 83 Return to debug level 76. 84 Return to debug level 75. 85 Return to debug level 74. 86 Return to debug level 73. 87 Return to debug level 72. 88 Return to debug level 71. 89 Return to debug level 70. 90 Return to debug level 69. 91 Return to debug level 68. 92 Return to debug level 67. 93 Return to debug level 66. 94 Return to debug level 65. 95 Return to debug level 64. 96 Return to debug level 63. 97 Return to debug level 62. 98 Return to debug level 61. 99 Return to debug level 60. 100 Return to debug level 59. 101 Return to debug level 58. 102 Return to debug level 57. 103 Return to debug level 56. 104 Return to debug level 55. 105 Return to debug level 54. 106 Return to debug level 53. 107 Return to debug level 52. 108 Return to debug level 51. 109 Return to debug level 50. 110 Return to debug level 49. 111 Return to debug level 48. 112 Return to debug level 47. 113 Return to debug level 46. 114 Return to debug level 45. 115 Return to debug level 44. 116 Return to debug level 43. 117 Return to debug level 42. 118 Return to debug level 41. 119 Return to debug level 40. 120 Return to debug level 39. 121 Return to debug level 38. 122 Return to debug level 37. 123 Return to debug level 36. 124 Return to debug level 35. 125 Return to debug level 34. 126 Return to debug level 33. 127 Return to debug level 32. 128 Return to debug level 31. 129 Return to debug level 30. 130 Return to debug level 29. 131 Return to debug level 28. 132 Return to debug level 27. 133 Return to debug level 26. 134 Return to debug level 25. 135 Return to debug level 24. 136 Return to debug level 23. 137 Return to debug level 22. 138 Return to debug level 21. 139 Return to debug level 20. 140 Return to debug level 19. 141 Return to debug level 18. 142 Return to debug level 17. 143 Return to debug level 16. 144 Return to debug level 15. 145 Return to debug level 14. 146 Return to debug level 13. 147 Return to debug level 12. 148 Return to debug level 11. 149 Return to debug level 10. 150 Return to debug level 9. 151 Return to debug level 8. 152 Return to debug level 7. 153 Return to debug level 6. 154 Return to debug level 5. 155 Return to debug level 4. 156 Return to debug level 3. 157 Return to debug level 2. 158 Return to debug level 1. 159 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 159. 2 Return to debug level 158. 3 Return to debug level 157. 4 Return to debug level 156. 5 Return to debug level 155. 6 Return to debug level 154. 7 Return to debug level 153. 8 Return to debug level 152. 9 Return to debug level 151. 10 Return to debug level 150. 11 Return to debug level 149. 12 Return to debug level 148. 13 Return to debug level 147. 14 Return to debug level 146. 15 Return to debug level 145. 16 Return to debug level 144. 17 Return to debug level 143. 18 Return to debug level 142. 19 Return to debug level 141. 20 Return to debug level 140. 21 Return to debug level 139. 22 Return to debug level 138. 23 Return to debug level 137. 24 Return to debug level 136. 25 Return to debug level 135. 26 Return to debug level 134. 27 Return to debug level 133. 28 Return to debug level 132. 29 Return to debug level 131. 30 Return to debug level 130. 31 Return to debug level 129. 32 Return to debug level 128. 33 Return to debug level 127. 34 Return to debug level 126. 35 Return to debug level 125. 36 Return to debug level 124. 37 Return to debug level 123. 38 Return to debug level 122. 39 Return to debug level 121. 40 Return to debug level 120. 41 Return to debug level 119. 42 Return to debug level 118. 43 Return to debug level 117. 44 Return to debug level 116. 45 Return to debug level 115. 46 Return to debug level 114. 47 Return to debug level 113. 48 Return to debug level 112. 49 Return to debug level 111. 50 Return to debug level 110. 51 Return to debug level 109. 52 Return to debug level 108. 53 Return to debug level 107. 54 Return to debug level 106. 55 Return to debug level 105. 56 Return to debug level 104. 57 Return to debug level 103. 58 Return to debug level 102. 59 Return to debug level 101. 60 Return to debug level 100. 61 Return to debug level 99. 62 Return to debug level 98. 63 Return to debug level 97. 64 Return to debug level 96. 65 Return to debug level 95. 66 Return to debug level 94. 67 Return to debug level 93. 68 Return to debug level 92. 69 Return to debug level 91. 70 Return to debug level 90. 71 Return to debug level 89. 72 Return to debug level 88. 73 Return to debug level 87. 74 Return to debug level 86. 75 Return to debug level 85. 76 Return to debug level 84. 77 Return to debug level 83. 78 Return to debug level 82. 79 Return to debug level 81. 80 Return to debug level 80. 81 Return to debug level 79. 82 Return to debug level 78. 83 Return to debug level 77. 84 Return to debug level 76. 85 Return to debug level 75. 86 Return to debug level 74. 87 Return to debug level 73. 88 Return to debug level 72. 89 Return to debug level 71. 90 Return to debug level 70. 91 Return to debug level 69. 92 Return to debug level 68. 93 Return to debug level 67. 94 Return to debug level 66. 95 Return to debug level 65. 96 Return to debug level 64. 97 Return to debug level 63. 98 Return to debug level 62. 99 Return to debug level 61. 100 Return to debug level 60. 101 Return to debug level 59. 102 Return to debug level 58. 103 Return to debug level 57. 104 Return to debug level 56. 105 Return to debug level 55. 106 Return to debug level 54. 107 Return to debug level 53. 108 Return to debug level 52. 109 Return to debug level 51. 110 Return to debug level 50. 111 Return to debug level 49. 112 Return to debug level 48. 113 Return to debug level 47. 114 Return to debug level 46. 115 Return to debug level 45. 116 Return to debug level 44. 117 Return to debug level 43. 118 Return to debug level 42. 119 Return to debug level 41. 120 Return to debug level 40. 121 Return to debug level 39. 122 Return to debug level 38. 123 Return to debug level 37. 124 Return to debug level 36. 125 Return to debug level 35. 126 Return to debug level 34. 127 Return to debug level 33. 128 Return to debug level 32. 129 Return to debug level 31. 130 Return to debug level 30. 131 Return to debug level 29. 132 Return to debug level 28. 133 Return to debug level 27. 134 Return to debug level 26. 135 Return to debug level 25. 136 Return to debug level 24. 137 Return to debug level 23. 138 Return to debug level 22. 139 Return to debug level 21. 140 Return to debug level 20. 141 Return to debug level 19. 142 Return to debug level 18. 143 Return to debug level 17. 144 Return to debug level 16. 145 Return to debug level 15. 146 Return to debug level 14. 147 Return to debug level 13. 148 Return to debug level 12. 149 Return to debug level 11. 150 Return to debug level 10. 151 Return to debug level 9. 152 Return to debug level 8. 153 Return to debug level 7. 154 Return to debug level 6. 155 Return to debug level 5. 156 Return to debug level 4. 157 Return to debug level 3. 158 Return to debug level 2. 159 Return to debug level 1. 160 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 160. 2 Return to debug level 159. 3 Return to debug level 158. 4 Return to debug level 157. 5 Return to debug level 156. 6 Return to debug level 155. 7 Return to debug level 154. 8 Return to debug level 153. 9 Return to debug level 152. 10 Return to debug level 151. 11 Return to debug level 150. 12 Return to debug level 149. 13 Return to debug level 148. 14 Return to debug level 147. 15 Return to debug level 146. 16 Return to debug level 145. 17 Return to debug level 144. 18 Return to debug level 143. 19 Return to debug level 142. 20 Return to debug level 141. 21 Return to debug level 140. 22 Return to debug level 139. 23 Return to debug level 138. 24 Return to debug level 137. 25 Return to debug level 136. 26 Return to debug level 135. 27 Return to debug level 134. 28 Return to debug level 133. 29 Return to debug level 132. 30 Return to debug level 131. 31 Return to debug level 130. 32 Return to debug level 129. 33 Return to debug level 128. 34 Return to debug level 127. 35 Return to debug level 126. 36 Return to debug level 125. 37 Return to debug level 124. 38 Return to debug level 123. 39 Return to debug level 122. 40 Return to debug level 121. 41 Return to debug level 120. 42 Return to debug level 119. 43 Return to debug level 118. 44 Return to debug level 117. 45 Return to debug level 116. 46 Return to debug level 115. 47 Return to debug level 114. 48 Return to debug level 113. 49 Return to debug level 112. 50 Return to debug level 111. 51 Return to debug level 110. 52 Return to debug level 109. 53 Return to debug level 108. 54 Return to debug level 107. 55 Return to debug level 106. 56 Return to debug level 105. 57 Return to debug level 104. 58 Return to debug level 103. 59 Return to debug level 102. 60 Return to debug level 101. 61 Return to debug level 100. 62 Return to debug level 99. 63 Return to debug level 98. 64 Return to debug level 97. 65 Return to debug level 96. 66 Return to debug level 95. 67 Return to debug level 94. 68 Return to debug level 93. 69 Return to debug level 92. 70 Return to debug level 91. 71 Return to debug level 90. 72 Return to debug level 89. 73 Return to debug level 88. 74 Return to debug level 87. 75 Return to debug level 86. 76 Return to debug level 85. 77 Return to debug level 84. 78 Return to debug level 83. 79 Return to debug level 82. 80 Return to debug level 81. 81 Return to debug level 80. 82 Return to debug level 79. 83 Return to debug level 78. 84 Return to debug level 77. 85 Return to debug level 76. 86 Return to debug level 75. 87 Return to debug level 74. 88 Return to debug level 73. 89 Return to debug level 72. 90 Return to debug level 71. 91 Return to debug level 70. 92 Return to debug level 69. 93 Return to debug level 68. 94 Return to debug level 67. 95 Return to debug level 66. 96 Return to debug level 65. 97 Return to debug level 64. 98 Return to debug level 63. 99 Return to debug level 62. 100 Return to debug level 61. 101 Return to debug level 60. 102 Return to debug level 59. 103 Return to debug level 58. 104 Return to debug level 57. 105 Return to debug level 56. 106 Return to debug level 55. 107 Return to debug level 54. 108 Return to debug level 53. 109 Return to debug level 52. 110 Return to debug level 51. 111 Return to debug level 50. 112 Return to debug level 49. 113 Return to debug level 48. 114 Return to debug level 47. 115 Return to debug level 46. 116 Return to debug level 45. 117 Return to debug level 44. 118 Return to debug level 43. 119 Return to debug level 42. 120 Return to debug level 41. 121 Return to debug level 40. 122 Return to debug level 39. 123 Return to debug level 38. 124 Return to debug level 37. 125 Return to debug level 36. 126 Return to debug level 35. 127 Return to debug level 34. 128 Return to debug level 33. 129 Return to debug level 32. 130 Return to debug level 31. 131 Return to debug level 30. 132 Return to debug level 29. 133 Return to debug level 28. 134 Return to debug level 27. 135 Return to debug level 26. 136 Return to debug level 25. 137 Return to debug level 24. 138 Return to debug level 23. 139 Return to debug level 22. 140 Return to debug level 21. 141 Return to debug level 20. 142 Return to debug level 19. 143 Return to debug level 18. 144 Return to debug level 17. 145 Return to debug level 16. 146 Return to debug level 15. 147 Return to debug level 14. 148 Return to debug level 13. 149 Return to debug level 12. 150 Return to debug level 11. 151 Return to debug level 10. 152 Return to debug level 9. 153 Return to debug level 8. 154 Return to debug level 7. 155 Return to debug level 6. 156 Return to debug level 5. 157 Return to debug level 4. 158 Return to debug level 3. 159 Return to debug level 2. 160 Return to debug level 1. 161 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 161. 2 Return to debug level 160. 3 Return to debug level 159. 4 Return to debug level 158. 5 Return to debug level 157. 6 Return to debug level 156. 7 Return to debug level 155. 8 Return to debug level 154. 9 Return to debug level 153. 10 Return to debug level 152. 11 Return to debug level 151. 12 Return to debug level 150. 13 Return to debug level 149. 14 Return to debug level 148. 15 Return to debug level 147. 16 Return to debug level 146. 17 Return to debug level 145. 18 Return to debug level 144. 19 Return to debug level 143. 20 Return to debug level 142. 21 Return to debug level 141. 22 Return to debug level 140. 23 Return to debug level 139. 24 Return to debug level 138. 25 Return to debug level 137. 26 Return to debug level 136. 27 Return to debug level 135. 28 Return to debug level 134. 29 Return to debug level 133. 30 Return to debug level 132. 31 Return to debug level 131. 32 Return to debug level 130. 33 Return to debug level 129. 34 Return to debug level 128. 35 Return to debug level 127. 36 Return to debug level 126. 37 Return to debug level 125. 38 Return to debug level 124. 39 Return to debug level 123. 40 Return to debug level 122. 41 Return to debug level 121. 42 Return to debug level 120. 43 Return to debug level 119. 44 Return to debug level 118. 45 Return to debug level 117. 46 Return to debug level 116. 47 Return to debug level 115. 48 Return to debug level 114. 49 Return to debug level 113. 50 Return to debug level 112. 51 Return to debug level 111. 52 Return to debug level 110. 53 Return to debug level 109. 54 Return to debug level 108. 55 Return to debug level 107. 56 Return to debug level 106. 57 Return to debug level 105. 58 Return to debug level 104. 59 Return to debug level 103. 60 Return to debug level 102. 61 Return to debug level 101. 62 Return to debug level 100. 63 Return to debug level 99. 64 Return to debug level 98. 65 Return to debug level 97. 66 Return to debug level 96. 67 Return to debug level 95. 68 Return to debug level 94. 69 Return to debug level 93. 70 Return to debug level 92. 71 Return to debug level 91. 72 Return to debug level 90. 73 Return to debug level 89. 74 Return to debug level 88. 75 Return to debug level 87. 76 Return to debug level 86. 77 Return to debug level 85. 78 Return to debug level 84. 79 Return to debug level 83. 80 Return to debug level 82. 81 Return to debug level 81. 82 Return to debug level 80. 83 Return to debug level 79. 84 Return to debug level 78. 85 Return to debug level 77. 86 Return to debug level 76. 87 Return to debug level 75. 88 Return to debug level 74. 89 Return to debug level 73. 90 Return to debug level 72. 91 Return to debug level 71. 92 Return to debug level 70. 93 Return to debug level 69. 94 Return to debug level 68. 95 Return to debug level 67. 96 Return to debug level 66. 97 Return to debug level 65. 98 Return to debug level 64. 99 Return to debug level 63. 100 Return to debug level 62. 101 Return to debug level 61. 102 Return to debug level 60. 103 Return to debug level 59. 104 Return to debug level 58. 105 Return to debug level 57. 106 Return to debug level 56. 107 Return to debug level 55. 108 Return to debug level 54. 109 Return to debug level 53. 110 Return to debug level 52. 111 Return to debug level 51. 112 Return to debug level 50. 113 Return to debug level 49. 114 Return to debug level 48. 115 Return to debug level 47. 116 Return to debug level 46. 117 Return to debug level 45. 118 Return to debug level 44. 119 Return to debug level 43. 120 Return to debug level 42. 121 Return to debug level 41. 122 Return to debug level 40. 123 Return to debug level 39. 124 Return to debug level 38. 125 Return to debug level 37. 126 Return to debug level 36. 127 Return to debug level 35. 128 Return to debug level 34. 129 Return to debug level 33. 130 Return to debug level 32. 131 Return to debug level 31. 132 Return to debug level 30. 133 Return to debug level 29. 134 Return to debug level 28. 135 Return to debug level 27. 136 Return to debug level 26. 137 Return to debug level 25. 138 Return to debug level 24. 139 Return to debug level 23. 140 Return to debug level 22. 141 Return to debug level 21. 142 Return to debug level 20. 143 Return to debug level 19. 144 Return to debug level 18. 145 Return to debug level 17. 146 Return to debug level 16. 147 Return to debug level 15. 148 Return to debug level 14. 149 Return to debug level 13. 150 Return to debug level 12. 151 Return to debug level 11. 152 Return to debug level 10. 153 Return to debug level 9. 154 Return to debug level 8. 155 Return to debug level 7. 156 Return to debug level 6. 157 Return to debug level 5. 158 Return to debug level 4. 159 Return to debug level 3. 160 Return to debug level 2. 161 Return to debug level 1. 162 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 162. 2 Return to debug level 161. 3 Return to debug level 160. 4 Return to debug level 159. 5 Return to debug level 158. 6 Return to debug level 157. 7 Return to debug level 156. 8 Return to debug level 155. 9 Return to debug level 154. 10 Return to debug level 153. 11 Return to debug level 152. 12 Return to debug level 151. 13 Return to debug level 150. 14 Return to debug level 149. 15 Return to debug level 148. 16 Return to debug level 147. 17 Return to debug level 146. 18 Return to debug level 145. 19 Return to debug level 144. 20 Return to debug level 143. 21 Return to debug level 142. 22 Return to debug level 141. 23 Return to debug level 140. 24 Return to debug level 139. 25 Return to debug level 138. 26 Return to debug level 137. 27 Return to debug level 136. 28 Return to debug level 135. 29 Return to debug level 134. 30 Return to debug level 133. 31 Return to debug level 132. 32 Return to debug level 131. 33 Return to debug level 130. 34 Return to debug level 129. 35 Return to debug level 128. 36 Return to debug level 127. 37 Return to debug level 126. 38 Return to debug level 125. 39 Return to debug level 124. 40 Return to debug level 123. 41 Return to debug level 122. 42 Return to debug level 121. 43 Return to debug level 120. 44 Return to debug level 119. 45 Return to debug level 118. 46 Return to debug level 117. 47 Return to debug level 116. 48 Return to debug level 115. 49 Return to debug level 114. 50 Return to debug level 113. 51 Return to debug level 112. 52 Return to debug level 111. 53 Return to debug level 110. 54 Return to debug level 109. 55 Return to debug level 108. 56 Return to debug level 107. 57 Return to debug level 106. 58 Return to debug level 105. 59 Return to debug level 104. 60 Return to debug level 103. 61 Return to debug level 102. 62 Return to debug level 101. 63 Return to debug level 100. 64 Return to debug level 99. 65 Return to debug level 98. 66 Return to debug level 97. 67 Return to debug level 96. 68 Return to debug level 95. 69 Return to debug level 94. 70 Return to debug level 93. 71 Return to debug level 92. 72 Return to debug level 91. 73 Return to debug level 90. 74 Return to debug level 89. 75 Return to debug level 88. 76 Return to debug level 87. 77 Return to debug level 86. 78 Return to debug level 85. 79 Return to debug level 84. 80 Return to debug level 83. 81 Return to debug level 82. 82 Return to debug level 81. 83 Return to debug level 80. 84 Return to debug level 79. 85 Return to debug level 78. 86 Return to debug level 77. 87 Return to debug level 76. 88 Return to debug level 75. 89 Return to debug level 74. 90 Return to debug level 73. 91 Return to debug level 72. 92 Return to debug level 71. 93 Return to debug level 70. 94 Return to debug level 69. 95 Return to debug level 68. 96 Return to debug level 67. 97 Return to debug level 66. 98 Return to debug level 65. 99 Return to debug level 64. 100 Return to debug level 63. 101 Return to debug level 62. 102 Return to debug level 61. 103 Return to debug level 60. 104 Return to debug level 59. 105 Return to debug level 58. 106 Return to debug level 57. 107 Return to debug level 56. 108 Return to debug level 55. 109 Return to debug level 54. 110 Return to debug level 53. 111 Return to debug level 52. 112 Return to debug level 51. 113 Return to debug level 50. 114 Return to debug level 49. 115 Return to debug level 48. 116 Return to debug level 47. 117 Return to debug level 46. 118 Return to debug level 45. 119 Return to debug level 44. 120 Return to debug level 43. 121 Return to debug level 42. 122 Return to debug level 41. 123 Return to debug level 40. 124 Return to debug level 39. 125 Return to debug level 38. 126 Return to debug level 37. 127 Return to debug level 36. 128 Return to debug level 35. 129 Return to debug level 34. 130 Return to debug level 33. 131 Return to debug level 32. 132 Return to debug level 31. 133 Return to debug level 30. 134 Return to debug level 29. 135 Return to debug level 28. 136 Return to debug level 27. 137 Return to debug level 26. 138 Return to debug level 25. 139 Return to debug level 24. 140 Return to debug level 23. 141 Return to debug level 22. 142 Return to debug level 21. 143 Return to debug level 20. 144 Return to debug level 19. 145 Return to debug level 18. 146 Return to debug level 17. 147 Return to debug level 16. 148 Return to debug level 15. 149 Return to debug level 14. 150 Return to debug level 13. 151 Return to debug level 12. 152 Return to debug level 11. 153 Return to debug level 10. 154 Return to debug level 9. 155 Return to debug level 8. 156 Return to debug level 7. 157 Return to debug level 6. 158 Return to debug level 5. 159 Return to debug level 4. 160 Return to debug level 3. 161 Return to debug level 2. 162 Return to debug level 1. 163 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 163. 2 Return to debug level 162. 3 Return to debug level 161. 4 Return to debug level 160. 5 Return to debug level 159. 6 Return to debug level 158. 7 Return to debug level 157. 8 Return to debug level 156. 9 Return to debug level 155. 10 Return to debug level 154. 11 Return to debug level 153. 12 Return to debug level 152. 13 Return to debug level 151. 14 Return to debug level 150. 15 Return to debug level 149. 16 Return to debug level 148. 17 Return to debug level 147. 18 Return to debug level 146. 19 Return to debug level 145. 20 Return to debug level 144. 21 Return to debug level 143. 22 Return to debug level 142. 23 Return to debug level 141. 24 Return to debug level 140. 25 Return to debug level 139. 26 Return to debug level 138. 27 Return to debug level 137. 28 Return to debug level 136. 29 Return to debug level 135. 30 Return to debug level 134. 31 Return to debug level 133. 32 Return to debug level 132. 33 Return to debug level 131. 34 Return to debug level 130. 35 Return to debug level 129. 36 Return to debug level 128. 37 Return to debug level 127. 38 Return to debug level 126. 39 Return to debug level 125. 40 Return to debug level 124. 41 Return to debug level 123. 42 Return to debug level 122. 43 Return to debug level 121. 44 Return to debug level 120. 45 Return to debug level 119. 46 Return to debug level 118. 47 Return to debug level 117. 48 Return to debug level 116. 49 Return to debug level 115. 50 Return to debug level 114. 51 Return to debug level 113. 52 Return to debug level 112. 53 Return to debug level 111. 54 Return to debug level 110. 55 Return to debug level 109. 56 Return to debug level 108. 57 Return to debug level 107. 58 Return to debug level 106. 59 Return to debug level 105. 60 Return to debug level 104. 61 Return to debug level 103. 62 Return to debug level 102. 63 Return to debug level 101. 64 Return to debug level 100. 65 Return to debug level 99. 66 Return to debug level 98. 67 Return to debug level 97. 68 Return to debug level 96. 69 Return to debug level 95. 70 Return to debug level 94. 71 Return to debug level 93. 72 Return to debug level 92. 73 Return to debug level 91. 74 Return to debug level 90. 75 Return to debug level 89. 76 Return to debug level 88. 77 Return to debug level 87. 78 Return to debug level 86. 79 Return to debug level 85. 80 Return to debug level 84. 81 Return to debug level 83. 82 Return to debug level 82. 83 Return to debug level 81. 84 Return to debug level 80. 85 Return to debug level 79. 86 Return to debug level 78. 87 Return to debug level 77. 88 Return to debug level 76. 89 Return to debug level 75. 90 Return to debug level 74. 91 Return to debug level 73. 92 Return to debug level 72. 93 Return to debug level 71. 94 Return to debug level 70. 95 Return to debug level 69. 96 Return to debug level 68. 97 Return to debug level 67. 98 Return to debug level 66. 99 Return to debug level 65. 100 Return to debug level 64. 101 Return to debug level 63. 102 Return to debug level 62. 103 Return to debug level 61. 104 Return to debug level 60. 105 Return to debug level 59. 106 Return to debug level 58. 107 Return to debug level 57. 108 Return to debug level 56. 109 Return to debug level 55. 110 Return to debug level 54. 111 Return to debug level 53. 112 Return to debug level 52. 113 Return to debug level 51. 114 Return to debug level 50. 115 Return to debug level 49. 116 Return to debug level 48. 117 Return to debug level 47. 118 Return to debug level 46. 119 Return to debug level 45. 120 Return to debug level 44. 121 Return to debug level 43. 122 Return to debug level 42. 123 Return to debug level 41. 124 Return to debug level 40. 125 Return to debug level 39. 126 Return to debug level 38. 127 Return to debug level 37. 128 Return to debug level 36. 129 Return to debug level 35. 130 Return to debug level 34. 131 Return to debug level 33. 132 Return to debug level 32. 133 Return to debug level 31. 134 Return to debug level 30. 135 Return to debug level 29. 136 Return to debug level 28. 137 Return to debug level 27. 138 Return to debug level 26. 139 Return to debug level 25. 140 Return to debug level 24. 141 Return to debug level 23. 142 Return to debug level 22. 143 Return to debug level 21. 144 Return to debug level 20. 145 Return to debug level 19. 146 Return to debug level 18. 147 Return to debug level 17. 148 Return to debug level 16. 149 Return to debug level 15. 150 Return to debug level 14. 151 Return to debug level 13. 152 Return to debug level 12. 153 Return to debug level 11. 154 Return to debug level 10. 155 Return to debug level 9. 156 Return to debug level 8. 157 Return to debug level 7. 158 Return to debug level 6. 159 Return to debug level 5. 160 Return to debug level 4. 161 Return to debug level 3. 162 Return to debug level 2. 163 Return to debug level 1. 164 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 164. 2 Return to debug level 163. 3 Return to debug level 162. 4 Return to debug level 161. 5 Return to debug level 160. 6 Return to debug level 159. 7 Return to debug level 158. 8 Return to debug level 157. 9 Return to debug level 156. 10 Return to debug level 155. 11 Return to debug level 154. 12 Return to debug level 153. 13 Return to debug level 152. 14 Return to debug level 151. 15 Return to debug level 150. 16 Return to debug level 149. 17 Return to debug level 148. 18 Return to debug level 147. 19 Return to debug level 146. 20 Return to debug level 145. 21 Return to debug level 144. 22 Return to debug level 143. 23 Return to debug level 142. 24 Return to debug level 141. 25 Return to debug level 140. 26 Return to debug level 139. 27 Return to debug level 138. 28 Return to debug level 137. 29 Return to debug level 136. 30 Return to debug level 135. 31 Return to debug level 134. 32 Return to debug level 133. 33 Return to debug level 132. 34 Return to debug level 131. 35 Return to debug level 130. 36 Return to debug level 129. 37 Return to debug level 128. 38 Return to debug level 127. 39 Return to debug level 126. 40 Return to debug level 125. 41 Return to debug level 124. 42 Return to debug level 123. 43 Return to debug level 122. 44 Return to debug level 121. 45 Return to debug level 120. 46 Return to debug level 119. 47 Return to debug level 118. 48 Return to debug level 117. 49 Return to debug level 116. 50 Return to debug level 115. 51 Return to debug level 114. 52 Return to debug level 113. 53 Return to debug level 112. 54 Return to debug level 111. 55 Return to debug level 110. 56 Return to debug level 109. 57 Return to debug level 108. 58 Return to debug level 107. 59 Return to debug level 106. 60 Return to debug level 105. 61 Return to debug level 104. 62 Return to debug level 103. 63 Return to debug level 102. 64 Return to debug level 101. 65 Return to debug level 100. 66 Return to debug level 99. 67 Return to debug level 98. 68 Return to debug level 97. 69 Return to debug level 96. 70 Return to debug level 95. 71 Return to debug level 94. 72 Return to debug level 93. 73 Return to debug level 92. 74 Return to debug level 91. 75 Return to debug level 90. 76 Return to debug level 89. 77 Return to debug level 88. 78 Return to debug level 87. 79 Return to debug level 86. 80 Return to debug level 85. 81 Return to debug level 84. 82 Return to debug level 83. 83 Return to debug level 82. 84 Return to debug level 81. 85 Return to debug level 80. 86 Return to debug level 79. 87 Return to debug level 78. 88 Return to debug level 77. 89 Return to debug level 76. 90 Return to debug level 75. 91 Return to debug level 74. 92 Return to debug level 73. 93 Return to debug level 72. 94 Return to debug level 71. 95 Return to debug level 70. 96 Return to debug level 69. 97 Return to debug level 68. 98 Return to debug level 67. 99 Return to debug level 66. 100 Return to debug level 65. 101 Return to debug level 64. 102 Return to debug level 63. 103 Return to debug level 62. 104 Return to debug level 61. 105 Return to debug level 60. 106 Return to debug level 59. 107 Return to debug level 58. 108 Return to debug level 57. 109 Return to debug level 56. 110 Return to debug level 55. 111 Return to debug level 54. 112 Return to debug level 53. 113 Return to debug level 52. 114 Return to debug level 51. 115 Return to debug level 50. 116 Return to debug level 49. 117 Return to debug level 48. 118 Return to debug level 47. 119 Return to debug level 46. 120 Return to debug level 45. 121 Return to debug level 44. 122 Return to debug level 43. 123 Return to debug level 42. 124 Return to debug level 41. 125 Return to debug level 40. 126 Return to debug level 39. 127 Return to debug level 38. 128 Return to debug level 37. 129 Return to debug level 36. 130 Return to debug level 35. 131 Return to debug level 34. 132 Return to debug level 33. 133 Return to debug level 32. 134 Return to debug level 31. 135 Return to debug level 30. 136 Return to debug level 29. 137 Return to debug level 28. 138 Return to debug level 27. 139 Return to debug level 26. 140 Return to debug level 25. 141 Return to debug level 24. 142 Return to debug level 23. 143 Return to debug level 22. 144 Return to debug level 21. 145 Return to debug level 20. 146 Return to debug level 19. 147 Return to debug level 18. 148 Return to debug level 17. 149 Return to debug level 16. 150 Return to debug level 15. 151 Return to debug level 14. 152 Return to debug level 13. 153 Return to debug level 12. 154 Return to debug level 11. 155 Return to debug level 10. 156 Return to debug level 9. 157 Return to debug level 8. 158 Return to debug level 7. 159 Return to debug level 6. 160 Return to debug level 5. 161 Return to debug level 4. 162 Return to debug level 3. 163 Return to debug level 2. 164 Return to debug level 1. 165 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 165. 2 Return to debug level 164. 3 Return to debug level 163. 4 Return to debug level 162. 5 Return to debug level 161. 6 Return to debug level 160. 7 Return to debug level 159. 8 Return to debug level 158. 9 Return to debug level 157. 10 Return to debug level 156. 11 Return to debug level 155. 12 Return to debug level 154. 13 Return to debug level 153. 14 Return to debug level 152. 15 Return to debug level 151. 16 Return to debug level 150. 17 Return to debug level 149. 18 Return to debug level 148. 19 Return to debug level 147. 20 Return to debug level 146. 21 Return to debug level 145. 22 Return to debug level 144. 23 Return to debug level 143. 24 Return to debug level 142. 25 Return to debug level 141. 26 Return to debug level 140. 27 Return to debug level 139. 28 Return to debug level 138. 29 Return to debug level 137. 30 Return to debug level 136. 31 Return to debug level 135. 32 Return to debug level 134. 33 Return to debug level 133. 34 Return to debug level 132. 35 Return to debug level 131. 36 Return to debug level 130. 37 Return to debug level 129. 38 Return to debug level 128. 39 Return to debug level 127. 40 Return to debug level 126. 41 Return to debug level 125. 42 Return to debug level 124. 43 Return to debug level 123. 44 Return to debug level 122. 45 Return to debug level 121. 46 Return to debug level 120. 47 Return to debug level 119. 48 Return to debug level 118. 49 Return to debug level 117. 50 Return to debug level 116. 51 Return to debug level 115. 52 Return to debug level 114. 53 Return to debug level 113. 54 Return to debug level 112. 55 Return to debug level 111. 56 Return to debug level 110. 57 Return to debug level 109. 58 Return to debug level 108. 59 Return to debug level 107. 60 Return to debug level 106. 61 Return to debug level 105. 62 Return to debug level 104. 63 Return to debug level 103. 64 Return to debug level 102. 65 Return to debug level 101. 66 Return to debug level 100. 67 Return to debug level 99. 68 Return to debug level 98. 69 Return to debug level 97. 70 Return to debug level 96. 71 Return to debug level 95. 72 Return to debug level 94. 73 Return to debug level 93. 74 Return to debug level 92. 75 Return to debug level 91. 76 Return to debug level 90. 77 Return to debug level 89. 78 Return to debug level 88. 79 Return to debug level 87. 80 Return to debug level 86. 81 Return to debug level 85. 82 Return to debug level 84. 83 Return to debug level 83. 84 Return to debug level 82. 85 Return to debug level 81. 86 Return to debug level 80. 87 Return to debug level 79. 88 Return to debug level 78. 89 Return to debug level 77. 90 Return to debug level 76. 91 Return to debug level 75. 92 Return to debug level 74. 93 Return to debug level 73. 94 Return to debug level 72. 95 Return to debug level 71. 96 Return to debug level 70. 97 Return to debug level 69. 98 Return to debug level 68. 99 Return to debug level 67. 100 Return to debug level 66. 101 Return to debug level 65. 102 Return to debug level 64. 103 Return to debug level 63. 104 Return to debug level 62. 105 Return to debug level 61. 106 Return to debug level 60. 107 Return to debug level 59. 108 Return to debug level 58. 109 Return to debug level 57. 110 Return to debug level 56. 111 Return to debug level 55. 112 Return to debug level 54. 113 Return to debug level 53. 114 Return to debug level 52. 115 Return to debug level 51. 116 Return to debug level 50. 117 Return to debug level 49. 118 Return to debug level 48. 119 Return to debug level 47. 120 Return to debug level 46. 121 Return to debug level 45. 122 Return to debug level 44. 123 Return to debug level 43. 124 Return to debug level 42. 125 Return to debug level 41. 126 Return to debug level 40. 127 Return to debug level 39. 128 Return to debug level 38. 129 Return to debug level 37. 130 Return to debug level 36. 131 Return to debug level 35. 132 Return to debug level 34. 133 Return to debug level 33. 134 Return to debug level 32. 135 Return to debug level 31. 136 Return to debug level 30. 137 Return to debug level 29. 138 Return to debug level 28. 139 Return to debug level 27. 140 Return to debug level 26. 141 Return to debug level 25. 142 Return to debug level 24. 143 Return to debug level 23. 144 Return to debug level 22. 145 Return to debug level 21. 146 Return to debug level 20. 147 Return to debug level 19. 148 Return to debug level 18. 149 Return to debug level 17. 150 Return to debug level 16. 151 Return to debug level 15. 152 Return to debug level 14. 153 Return to debug level 13. 154 Return to debug level 12. 155 Return to debug level 11. 156 Return to debug level 10. 157 Return to debug level 9. 158 Return to debug level 8. 159 Return to debug level 7. 160 Return to debug level 6. 161 Return to debug level 5. 162 Return to debug level 4. 163 Return to debug level 3. 164 Return to debug level 2. 165 Return to debug level 1. 166 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 166. 2 Return to debug level 165. 3 Return to debug level 164. 4 Return to debug level 163. 5 Return to debug level 162. 6 Return to debug level 161. 7 Return to debug level 160. 8 Return to debug level 159. 9 Return to debug level 158. 10 Return to debug level 157. 11 Return to debug level 156. 12 Return to debug level 155. 13 Return to debug level 154. 14 Return to debug level 153. 15 Return to debug level 152. 16 Return to debug level 151. 17 Return to debug level 150. 18 Return to debug level 149. 19 Return to debug level 148. 20 Return to debug level 147. 21 Return to debug level 146. 22 Return to debug level 145. 23 Return to debug level 144. 24 Return to debug level 143. 25 Return to debug level 142. 26 Return to debug level 141. 27 Return to debug level 140. 28 Return to debug level 139. 29 Return to debug level 138. 30 Return to debug level 137. 31 Return to debug level 136. 32 Return to debug level 135. 33 Return to debug level 134. 34 Return to debug level 133. 35 Return to debug level 132. 36 Return to debug level 131. 37 Return to debug level 130. 38 Return to debug level 129. 39 Return to debug level 128. 40 Return to debug level 127. 41 Return to debug level 126. 42 Return to debug level 125. 43 Return to debug level 124. 44 Return to debug level 123. 45 Return to debug level 122. 46 Return to debug level 121. 47 Return to debug level 120. 48 Return to debug level 119. 49 Return to debug level 118. 50 Return to debug level 117. 51 Return to debug level 116. 52 Return to debug level 115. 53 Return to debug level 114. 54 Return to debug level 113. 55 Return to debug level 112. 56 Return to debug level 111. 57 Return to debug level 110. 58 Return to debug level 109. 59 Return to debug level 108. 60 Return to debug level 107. 61 Return to debug level 106. 62 Return to debug level 105. 63 Return to debug level 104. 64 Return to debug level 103. 65 Return to debug level 102. 66 Return to debug level 101. 67 Return to debug level 100. 68 Return to debug level 99. 69 Return to debug level 98. 70 Return to debug level 97. 71 Return to debug level 96. 72 Return to debug level 95. 73 Return to debug level 94. 74 Return to debug level 93. 75 Return to debug level 92. 76 Return to debug level 91. 77 Return to debug level 90. 78 Return to debug level 89. 79 Return to debug level 88. 80 Return to debug level 87. 81 Return to debug level 86. 82 Return to debug level 85. 83 Return to debug level 84. 84 Return to debug level 83. 85 Return to debug level 82. 86 Return to debug level 81. 87 Return to debug level 80. 88 Return to debug level 79. 89 Return to debug level 78. 90 Return to debug level 77. 91 Return to debug level 76. 92 Return to debug level 75. 93 Return to debug level 74. 94 Return to debug level 73. 95 Return to debug level 72. 96 Return to debug level 71. 97 Return to debug level 70. 98 Return to debug level 69. 99 Return to debug level 68. 100 Return to debug level 67. 101 Return to debug level 66. 102 Return to debug level 65. 103 Return to debug level 64. 104 Return to debug level 63. 105 Return to debug level 62. 106 Return to debug level 61. 107 Return to debug level 60. 108 Return to debug level 59. 109 Return to debug level 58. 110 Return to debug level 57. 111 Return to debug level 56. 112 Return to debug level 55. 113 Return to debug level 54. 114 Return to debug level 53. 115 Return to debug level 52. 116 Return to debug level 51. 117 Return to debug level 50. 118 Return to debug level 49. 119 Return to debug level 48. 120 Return to debug level 47. 121 Return to debug level 46. 122 Return to debug level 45. 123 Return to debug level 44. 124 Return to debug level 43. 125 Return to debug level 42. 126 Return to debug level 41. 127 Return to debug level 40. 128 Return to debug level 39. 129 Return to debug level 38. 130 Return to debug level 37. 131 Return to debug level 36. 132 Return to debug level 35. 133 Return to debug level 34. 134 Return to debug level 33. 135 Return to debug level 32. 136 Return to debug level 31. 137 Return to debug level 30. 138 Return to debug level 29. 139 Return to debug level 28. 140 Return to debug level 27. 141 Return to debug level 26. 142 Return to debug level 25. 143 Return to debug level 24. 144 Return to debug level 23. 145 Return to debug level 22. 146 Return to debug level 21. 147 Return to debug level 20. 148 Return to debug level 19. 149 Return to debug level 18. 150 Return to debug level 17. 151 Return to debug level 16. 152 Return to debug level 15. 153 Return to debug level 14. 154 Return to debug level 13. 155 Return to debug level 12. 156 Return to debug level 11. 157 Return to debug level 10. 158 Return to debug level 9. 159 Return to debug level 8. 160 Return to debug level 7. 161 Return to debug level 6. 162 Return to debug level 5. 163 Return to debug level 4. 164 Return to debug level 3. 165 Return to debug level 2. 166 Return to debug level 1. 167 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 167. 2 Return to debug level 166. 3 Return to debug level 165. 4 Return to debug level 164. 5 Return to debug level 163. 6 Return to debug level 162. 7 Return to debug level 161. 8 Return to debug level 160. 9 Return to debug level 159. 10 Return to debug level 158. 11 Return to debug level 157. 12 Return to debug level 156. 13 Return to debug level 155. 14 Return to debug level 154. 15 Return to debug level 153. 16 Return to debug level 152. 17 Return to debug level 151. 18 Return to debug level 150. 19 Return to debug level 149. 20 Return to debug level 148. 21 Return to debug level 147. 22 Return to debug level 146. 23 Return to debug level 145. 24 Return to debug level 144. 25 Return to debug level 143. 26 Return to debug level 142. 27 Return to debug level 141. 28 Return to debug level 140. 29 Return to debug level 139. 30 Return to debug level 138. 31 Return to debug level 137. 32 Return to debug level 136. 33 Return to debug level 135. 34 Return to debug level 134. 35 Return to debug level 133. 36 Return to debug level 132. 37 Return to debug level 131. 38 Return to debug level 130. 39 Return to debug level 129. 40 Return to debug level 128. 41 Return to debug level 127. 42 Return to debug level 126. 43 Return to debug level 125. 44 Return to debug level 124. 45 Return to debug level 123. 46 Return to debug level 122. 47 Return to debug level 121. 48 Return to debug level 120. 49 Return to debug level 119. 50 Return to debug level 118. 51 Return to debug level 117. 52 Return to debug level 116. 53 Return to debug level 115. 54 Return to debug level 114. 55 Return to debug level 113. 56 Return to debug level 112. 57 Return to debug level 111. 58 Return to debug level 110. 59 Return to debug level 109. 60 Return to debug level 108. 61 Return to debug level 107. 62 Return to debug level 106. 63 Return to debug level 105. 64 Return to debug level 104. 65 Return to debug level 103. 66 Return to debug level 102. 67 Return to debug level 101. 68 Return to debug level 100. 69 Return to debug level 99. 70 Return to debug level 98. 71 Return to debug level 97. 72 Return to debug level 96. 73 Return to debug level 95. 74 Return to debug level 94. 75 Return to debug level 93. 76 Return to debug level 92. 77 Return to debug level 91. 78 Return to debug level 90. 79 Return to debug level 89. 80 Return to debug level 88. 81 Return to debug level 87. 82 Return to debug level 86. 83 Return to debug level 85. 84 Return to debug level 84. 85 Return to debug level 83. 86 Return to debug level 82. 87 Return to debug level 81. 88 Return to debug level 80. 89 Return to debug level 79. 90 Return to debug level 78. 91 Return to debug level 77. 92 Return to debug level 76. 93 Return to debug level 75. 94 Return to debug level 74. 95 Return to debug level 73. 96 Return to debug level 72. 97 Return to debug level 71. 98 Return to debug level 70. 99 Return to debug level 69. 100 Return to debug level 68. 101 Return to debug level 67. 102 Return to debug level 66. 103 Return to debug level 65. 104 Return to debug level 64. 105 Return to debug level 63. 106 Return to debug level 62. 107 Return to debug level 61. 108 Return to debug level 60. 109 Return to debug level 59. 110 Return to debug level 58. 111 Return to debug level 57. 112 Return to debug level 56. 113 Return to debug level 55. 114 Return to debug level 54. 115 Return to debug level 53. 116 Return to debug level 52. 117 Return to debug level 51. 118 Return to debug level 50. 119 Return to debug level 49. 120 Return to debug level 48. 121 Return to debug level 47. 122 Return to debug level 46. 123 Return to debug level 45. 124 Return to debug level 44. 125 Return to debug level 43. 126 Return to debug level 42. 127 Return to debug level 41. 128 Return to debug level 40. 129 Return to debug level 39. 130 Return to debug level 38. 131 Return to debug level 37. 132 Return to debug level 36. 133 Return to debug level 35. 134 Return to debug level 34. 135 Return to debug level 33. 136 Return to debug level 32. 137 Return to debug level 31. 138 Return to debug level 30. 139 Return to debug level 29. 140 Return to debug level 28. 141 Return to debug level 27. 142 Return to debug level 26. 143 Return to debug level 25. 144 Return to debug level 24. 145 Return to debug level 23. 146 Return to debug level 22. 147 Return to debug level 21. 148 Return to debug level 20. 149 Return to debug level 19. 150 Return to debug level 18. 151 Return to debug level 17. 152 Return to debug level 16. 153 Return to debug level 15. 154 Return to debug level 14. 155 Return to debug level 13. 156 Return to debug level 12. 157 Return to debug level 11. 158 Return to debug level 10. 159 Return to debug level 9. 160 Return to debug level 8. 161 Return to debug level 7. 162 Return to debug level 6. 163 Return to debug level 5. 164 Return to debug level 4. 165 Return to debug level 3. 166 Return to debug level 2. 167 Return to debug level 1. 168 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 168. 2 Return to debug level 167. 3 Return to debug level 166. 4 Return to debug level 165. 5 Return to debug level 164. 6 Return to debug level 163. 7 Return to debug level 162. 8 Return to debug level 161. 9 Return to debug level 160. 10 Return to debug level 159. 11 Return to debug level 158. 12 Return to debug level 157. 13 Return to debug level 156. 14 Return to debug level 155. 15 Return to debug level 154. 16 Return to debug level 153. 17 Return to debug level 152. 18 Return to debug level 151. 19 Return to debug level 150. 20 Return to debug level 149. 21 Return to debug level 148. 22 Return to debug level 147. 23 Return to debug level 146. 24 Return to debug level 145. 25 Return to debug level 144. 26 Return to debug level 143. 27 Return to debug level 142. 28 Return to debug level 141. 29 Return to debug level 140. 30 Return to debug level 139. 31 Return to debug level 138. 32 Return to debug level 137. 33 Return to debug level 136. 34 Return to debug level 135. 35 Return to debug level 134. 36 Return to debug level 133. 37 Return to debug level 132. 38 Return to debug level 131. 39 Return to debug level 130. 40 Return to debug level 129. 41 Return to debug level 128. 42 Return to debug level 127. 43 Return to debug level 126. 44 Return to debug level 125. 45 Return to debug level 124. 46 Return to debug level 123. 47 Return to debug level 122. 48 Return to debug level 121. 49 Return to debug level 120. 50 Return to debug level 119. 51 Return to debug level 118. 52 Return to debug level 117. 53 Return to debug level 116. 54 Return to debug level 115. 55 Return to debug level 114. 56 Return to debug level 113. 57 Return to debug level 112. 58 Return to debug level 111. 59 Return to debug level 110. 60 Return to debug level 109. 61 Return to debug level 108. 62 Return to debug level 107. 63 Return to debug level 106. 64 Return to debug level 105. 65 Return to debug level 104. 66 Return to debug level 103. 67 Return to debug level 102. 68 Return to debug level 101. 69 Return to debug level 100. 70 Return to debug level 99. 71 Return to debug level 98. 72 Return to debug level 97. 73 Return to debug level 96. 74 Return to debug level 95. 75 Return to debug level 94. 76 Return to debug level 93. 77 Return to debug level 92. 78 Return to debug level 91. 79 Return to debug level 90. 80 Return to debug level 89. 81 Return to debug level 88. 82 Return to debug level 87. 83 Return to debug level 86. 84 Return to debug level 85. 85 Return to debug level 84. 86 Return to debug level 83. 87 Return to debug level 82. 88 Return to debug level 81. 89 Return to debug level 80. 90 Return to debug level 79. 91 Return to debug level 78. 92 Return to debug level 77. 93 Return to debug level 76. 94 Return to debug level 75. 95 Return to debug level 74. 96 Return to debug level 73. 97 Return to debug level 72. 98 Return to debug level 71. 99 Return to debug level 70. 100 Return to debug level 69. 101 Return to debug level 68. 102 Return to debug level 67. 103 Return to debug level 66. 104 Return to debug level 65. 105 Return to debug level 64. 106 Return to debug level 63. 107 Return to debug level 62. 108 Return to debug level 61. 109 Return to debug level 60. 110 Return to debug level 59. 111 Return to debug level 58. 112 Return to debug level 57. 113 Return to debug level 56. 114 Return to debug level 55. 115 Return to debug level 54. 116 Return to debug level 53. 117 Return to debug level 52. 118 Return to debug level 51. 119 Return to debug level 50. 120 Return to debug level 49. 121 Return to debug level 48. 122 Return to debug level 47. 123 Return to debug level 46. 124 Return to debug level 45. 125 Return to debug level 44. 126 Return to debug level 43. 127 Return to debug level 42. 128 Return to debug level 41. 129 Return to debug level 40. 130 Return to debug level 39. 131 Return to debug level 38. 132 Return to debug level 37. 133 Return to debug level 36. 134 Return to debug level 35. 135 Return to debug level 34. 136 Return to debug level 33. 137 Return to debug level 32. 138 Return to debug level 31. 139 Return to debug level 30. 140 Return to debug level 29. 141 Return to debug level 28. 142 Return to debug level 27. 143 Return to debug level 26. 144 Return to debug level 25. 145 Return to debug level 24. 146 Return to debug level 23. 147 Return to debug level 22. 148 Return to debug level 21. 149 Return to debug level 20. 150 Return to debug level 19. 151 Return to debug level 18. 152 Return to debug level 17. 153 Return to debug level 16. 154 Return to debug level 15. 155 Return to debug level 14. 156 Return to debug level 13. 157 Return to debug level 12. 158 Return to debug level 11. 159 Return to debug level 10. 160 Return to debug level 9. 161 Return to debug level 8. 162 Return to debug level 7. 163 Return to debug level 6. 164 Return to debug level 5. 165 Return to debug level 4. 166 Return to debug level 3. 167 Return to debug level 2. 168 Return to debug level 1. 169 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 169. 2 Return to debug level 168. 3 Return to debug level 167. 4 Return to debug level 166. 5 Return to debug level 165. 6 Return to debug level 164. 7 Return to debug level 163. 8 Return to debug level 162. 9 Return to debug level 161. 10 Return to debug level 160. 11 Return to debug level 159. 12 Return to debug level 158. 13 Return to debug level 157. 14 Return to debug level 156. 15 Return to debug level 155. 16 Return to debug level 154. 17 Return to debug level 153. 18 Return to debug level 152. 19 Return to debug level 151. 20 Return to debug level 150. 21 Return to debug level 149. 22 Return to debug level 148. 23 Return to debug level 147. 24 Return to debug level 146. 25 Return to debug level 145. 26 Return to debug level 144. 27 Return to debug level 143. 28 Return to debug level 142. 29 Return to debug level 141. 30 Return to debug level 140. 31 Return to debug level 139. 32 Return to debug level 138. 33 Return to debug level 137. 34 Return to debug level 136. 35 Return to debug level 135. 36 Return to debug level 134. 37 Return to debug level 133. 38 Return to debug level 132. 39 Return to debug level 131. 40 Return to debug level 130. 41 Return to debug level 129. 42 Return to debug level 128. 43 Return to debug level 127. 44 Return to debug level 126. 45 Return to debug level 125. 46 Return to debug level 124. 47 Return to debug level 123. 48 Return to debug level 122. 49 Return to debug level 121. 50 Return to debug level 120. 51 Return to debug level 119. 52 Return to debug level 118. 53 Return to debug level 117. 54 Return to debug level 116. 55 Return to debug level 115. 56 Return to debug level 114. 57 Return to debug level 113. 58 Return to debug level 112. 59 Return to debug level 111. 60 Return to debug level 110. 61 Return to debug level 109. 62 Return to debug level 108. 63 Return to debug level 107. 64 Return to debug level 106. 65 Return to debug level 105. 66 Return to debug level 104. 67 Return to debug level 103. 68 Return to debug level 102. 69 Return to debug level 101. 70 Return to debug level 100. 71 Return to debug level 99. 72 Return to debug level 98. 73 Return to debug level 97. 74 Return to debug level 96. 75 Return to debug level 95. 76 Return to debug level 94. 77 Return to debug level 93. 78 Return to debug level 92. 79 Return to debug level 91. 80 Return to debug level 90. 81 Return to debug level 89. 82 Return to debug level 88. 83 Return to debug level 87. 84 Return to debug level 86. 85 Return to debug level 85. 86 Return to debug level 84. 87 Return to debug level 83. 88 Return to debug level 82. 89 Return to debug level 81. 90 Return to debug level 80. 91 Return to debug level 79. 92 Return to debug level 78. 93 Return to debug level 77. 94 Return to debug level 76. 95 Return to debug level 75. 96 Return to debug level 74. 97 Return to debug level 73. 98 Return to debug level 72. 99 Return to debug level 71. 100 Return to debug level 70. 101 Return to debug level 69. 102 Return to debug level 68. 103 Return to debug level 67. 104 Return to debug level 66. 105 Return to debug level 65. 106 Return to debug level 64. 107 Return to debug level 63. 108 Return to debug level 62. 109 Return to debug level 61. 110 Return to debug level 60. 111 Return to debug level 59. 112 Return to debug level 58. 113 Return to debug level 57. 114 Return to debug level 56. 115 Return to debug level 55. 116 Return to debug level 54. 117 Return to debug level 53. 118 Return to debug level 52. 119 Return to debug level 51. 120 Return to debug level 50. 121 Return to debug level 49. 122 Return to debug level 48. 123 Return to debug level 47. 124 Return to debug level 46. 125 Return to debug level 45. 126 Return to debug level 44. 127 Return to debug level 43. 128 Return to debug level 42. 129 Return to debug level 41. 130 Return to debug level 40. 131 Return to debug level 39. 132 Return to debug level 38. 133 Return to debug level 37. 134 Return to debug level 36. 135 Return to debug level 35. 136 Return to debug level 34. 137 Return to debug level 33. 138 Return to debug level 32. 139 Return to debug level 31. 140 Return to debug level 30. 141 Return to debug level 29. 142 Return to debug level 28. 143 Return to debug level 27. 144 Return to debug level 26. 145 Return to debug level 25. 146 Return to debug level 24. 147 Return to debug level 23. 148 Return to debug level 22. 149 Return to debug level 21. 150 Return to debug level 20. 151 Return to debug level 19. 152 Return to debug level 18. 153 Return to debug level 17. 154 Return to debug level 16. 155 Return to debug level 15. 156 Return to debug level 14. 157 Return to debug level 13. 158 Return to debug level 12. 159 Return to debug level 11. 160 Return to debug level 10. 161 Return to debug level 9. 162 Return to debug level 8. 163 Return to debug level 7. 164 Return to debug level 6. 165 Return to debug level 5. 166 Return to debug level 4. 167 Return to debug level 3. 168 Return to debug level 2. 169 Return to debug level 1. 170 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 170. 2 Return to debug level 169. 3 Return to debug level 168. 4 Return to debug level 167. 5 Return to debug level 166. 6 Return to debug level 165. 7 Return to debug level 164. 8 Return to debug level 163. 9 Return to debug level 162. 10 Return to debug level 161. 11 Return to debug level 160. 12 Return to debug level 159. 13 Return to debug level 158. 14 Return to debug level 157. 15 Return to debug level 156. 16 Return to debug level 155. 17 Return to debug level 154. 18 Return to debug level 153. 19 Return to debug level 152. 20 Return to debug level 151. 21 Return to debug level 150. 22 Return to debug level 149. 23 Return to debug level 148. 24 Return to debug level 147. 25 Return to debug level 146. 26 Return to debug level 145. 27 Return to debug level 144. 28 Return to debug level 143. 29 Return to debug level 142. 30 Return to debug level 141. 31 Return to debug level 140. 32 Return to debug level 139. 33 Return to debug level 138. 34 Return to debug level 137. 35 Return to debug level 136. 36 Return to debug level 135. 37 Return to debug level 134. 38 Return to debug level 133. 39 Return to debug level 132. 40 Return to debug level 131. 41 Return to debug level 130. 42 Return to debug level 129. 43 Return to debug level 128. 44 Return to debug level 127. 45 Return to debug level 126. 46 Return to debug level 125. 47 Return to debug level 124. 48 Return to debug level 123. 49 Return to debug level 122. 50 Return to debug level 121. 51 Return to debug level 120. 52 Return to debug level 119. 53 Return to debug level 118. 54 Return to debug level 117. 55 Return to debug level 116. 56 Return to debug level 115. 57 Return to debug level 114. 58 Return to debug level 113. 59 Return to debug level 112. 60 Return to debug level 111. 61 Return to debug level 110. 62 Return to debug level 109. 63 Return to debug level 108. 64 Return to debug level 107. 65 Return to debug level 106. 66 Return to debug level 105. 67 Return to debug level 104. 68 Return to debug level 103. 69 Return to debug level 102. 70 Return to debug level 101. 71 Return to debug level 100. 72 Return to debug level 99. 73 Return to debug level 98. 74 Return to debug level 97. 75 Return to debug level 96. 76 Return to debug level 95. 77 Return to debug level 94. 78 Return to debug level 93. 79 Return to debug level 92. 80 Return to debug level 91. 81 Return to debug level 90. 82 Return to debug level 89. 83 Return to debug level 88. 84 Return to debug level 87. 85 Return to debug level 86. 86 Return to debug level 85. 87 Return to debug level 84. 88 Return to debug level 83. 89 Return to debug level 82. 90 Return to debug level 81. 91 Return to debug level 80. 92 Return to debug level 79. 93 Return to debug level 78. 94 Return to debug level 77. 95 Return to debug level 76. 96 Return to debug level 75. 97 Return to debug level 74. 98 Return to debug level 73. 99 Return to debug level 72. 100 Return to debug level 71. 101 Return to debug level 70. 102 Return to debug level 69. 103 Return to debug level 68. 104 Return to debug level 67. 105 Return to debug level 66. 106 Return to debug level 65. 107 Return to debug level 64. 108 Return to debug level 63. 109 Return to debug level 62. 110 Return to debug level 61. 111 Return to debug level 60. 112 Return to debug level 59. 113 Return to debug level 58. 114 Return to debug level 57. 115 Return to debug level 56. 116 Return to debug level 55. 117 Return to debug level 54. 118 Return to debug level 53. 119 Return to debug level 52. 120 Return to debug level 51. 121 Return to debug level 50. 122 Return to debug level 49. 123 Return to debug level 48. 124 Return to debug level 47. 125 Return to debug level 46. 126 Return to debug level 45. 127 Return to debug level 44. 128 Return to debug level 43. 129 Return to debug level 42. 130 Return to debug level 41. 131 Return to debug level 40. 132 Return to debug level 39. 133 Return to debug level 38. 134 Return to debug level 37. 135 Return to debug level 36. 136 Return to debug level 35. 137 Return to debug level 34. 138 Return to debug level 33. 139 Return to debug level 32. 140 Return to debug level 31. 141 Return to debug level 30. 142 Return to debug level 29. 143 Return to debug level 28. 144 Return to debug level 27. 145 Return to debug level 26. 146 Return to debug level 25. 147 Return to debug level 24. 148 Return to debug level 23. 149 Return to debug level 22. 150 Return to debug level 21. 151 Return to debug level 20. 152 Return to debug level 19. 153 Return to debug level 18. 154 Return to debug level 17. 155 Return to debug level 16. 156 Return to debug level 15. 157 Return to debug level 14. 158 Return to debug level 13. 159 Return to debug level 12. 160 Return to debug level 11. 161 Return to debug level 10. 162 Return to debug level 9. 163 Return to debug level 8. 164 Return to debug level 7. 165 Return to debug level 6. 166 Return to debug level 5. 167 Return to debug level 4. 168 Return to debug level 3. 169 Return to debug level 2. 170 Return to debug level 1. 171 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 171. 2 Return to debug level 170. 3 Return to debug level 169. 4 Return to debug level 168. 5 Return to debug level 167. 6 Return to debug level 166. 7 Return to debug level 165. 8 Return to debug level 164. 9 Return to debug level 163. 10 Return to debug level 162. 11 Return to debug level 161. 12 Return to debug level 160. 13 Return to debug level 159. 14 Return to debug level 158. 15 Return to debug level 157. 16 Return to debug level 156. 17 Return to debug level 155. 18 Return to debug level 154. 19 Return to debug level 153. 20 Return to debug level 152. 21 Return to debug level 151. 22 Return to debug level 150. 23 Return to debug level 149. 24 Return to debug level 148. 25 Return to debug level 147. 26 Return to debug level 146. 27 Return to debug level 145. 28 Return to debug level 144. 29 Return to debug level 143. 30 Return to debug level 142. 31 Return to debug level 141. 32 Return to debug level 140. 33 Return to debug level 139. 34 Return to debug level 138. 35 Return to debug level 137. 36 Return to debug level 136. 37 Return to debug level 135. 38 Return to debug level 134. 39 Return to debug level 133. 40 Return to debug level 132. 41 Return to debug level 131. 42 Return to debug level 130. 43 Return to debug level 129. 44 Return to debug level 128. 45 Return to debug level 127. 46 Return to debug level 126. 47 Return to debug level 125. 48 Return to debug level 124. 49 Return to debug level 123. 50 Return to debug level 122. 51 Return to debug level 121. 52 Return to debug level 120. 53 Return to debug level 119. 54 Return to debug level 118. 55 Return to debug level 117. 56 Return to debug level 116. 57 Return to debug level 115. 58 Return to debug level 114. 59 Return to debug level 113. 60 Return to debug level 112. 61 Return to debug level 111. 62 Return to debug level 110. 63 Return to debug level 109. 64 Return to debug level 108. 65 Return to debug level 107. 66 Return to debug level 106. 67 Return to debug level 105. 68 Return to debug level 104. 69 Return to debug level 103. 70 Return to debug level 102. 71 Return to debug level 101. 72 Return to debug level 100. 73 Return to debug level 99. 74 Return to debug level 98. 75 Return to debug level 97. 76 Return to debug level 96. 77 Return to debug level 95. 78 Return to debug level 94. 79 Return to debug level 93. 80 Return to debug level 92. 81 Return to debug level 91. 82 Return to debug level 90. 83 Return to debug level 89. 84 Return to debug level 88. 85 Return to debug level 87. 86 Return to debug level 86. 87 Return to debug level 85. 88 Return to debug level 84. 89 Return to debug level 83. 90 Return to debug level 82. 91 Return to debug level 81. 92 Return to debug level 80. 93 Return to debug level 79. 94 Return to debug level 78. 95 Return to debug level 77. 96 Return to debug level 76. 97 Return to debug level 75. 98 Return to debug level 74. 99 Return to debug level 73. 100 Return to debug level 72. 101 Return to debug level 71. 102 Return to debug level 70. 103 Return to debug level 69. 104 Return to debug level 68. 105 Return to debug level 67. 106 Return to debug level 66. 107 Return to debug level 65. 108 Return to debug level 64. 109 Return to debug level 63. 110 Return to debug level 62. 111 Return to debug level 61. 112 Return to debug level 60. 113 Return to debug level 59. 114 Return to debug level 58. 115 Return to debug level 57. 116 Return to debug level 56. 117 Return to debug level 55. 118 Return to debug level 54. 119 Return to debug level 53. 120 Return to debug level 52. 121 Return to debug level 51. 122 Return to debug level 50. 123 Return to debug level 49. 124 Return to debug level 48. 125 Return to debug level 47. 126 Return to debug level 46. 127 Return to debug level 45. 128 Return to debug level 44. 129 Return to debug level 43. 130 Return to debug level 42. 131 Return to debug level 41. 132 Return to debug level 40. 133 Return to debug level 39. 134 Return to debug level 38. 135 Return to debug level 37. 136 Return to debug level 36. 137 Return to debug level 35. 138 Return to debug level 34. 139 Return to debug level 33. 140 Return to debug level 32. 141 Return to debug level 31. 142 Return to debug level 30. 143 Return to debug level 29. 144 Return to debug level 28. 145 Return to debug level 27. 146 Return to debug level 26. 147 Return to debug level 25. 148 Return to debug level 24. 149 Return to debug level 23. 150 Return to debug level 22. 151 Return to debug level 21. 152 Return to debug level 20. 153 Return to debug level 19. 154 Return to debug level 18. 155 Return to debug level 17. 156 Return to debug level 16. 157 Return to debug level 15. 158 Return to debug level 14. 159 Return to debug level 13. 160 Return to debug level 12. 161 Return to debug level 11. 162 Return to debug level 10. 163 Return to debug level 9. 164 Return to debug level 8. 165 Return to debug level 7. 166 Return to debug level 6. 167 Return to debug level 5. 168 Return to debug level 4. 169 Return to debug level 3. 170 Return to debug level 2. 171 Return to debug level 1. 172 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 172. 2 Return to debug level 171. 3 Return to debug level 170. 4 Return to debug level 169. 5 Return to debug level 168. 6 Return to debug level 167. 7 Return to debug level 166. 8 Return to debug level 165. 9 Return to debug level 164. 10 Return to debug level 163. 11 Return to debug level 162. 12 Return to debug level 161. 13 Return to debug level 160. 14 Return to debug level 159. 15 Return to debug level 158. 16 Return to debug level 157. 17 Return to debug level 156. 18 Return to debug level 155. 19 Return to debug level 154. 20 Return to debug level 153. 21 Return to debug level 152. 22 Return to debug level 151. 23 Return to debug level 150. 24 Return to debug level 149. 25 Return to debug level 148. 26 Return to debug level 147. 27 Return to debug level 146. 28 Return to debug level 145. 29 Return to debug level 144. 30 Return to debug level 143. 31 Return to debug level 142. 32 Return to debug level 141. 33 Return to debug level 140. 34 Return to debug level 139. 35 Return to debug level 138. 36 Return to debug level 137. 37 Return to debug level 136. 38 Return to debug level 135. 39 Return to debug level 134. 40 Return to debug level 133. 41 Return to debug level 132. 42 Return to debug level 131. 43 Return to debug level 130. 44 Return to debug level 129. 45 Return to debug level 128. 46 Return to debug level 127. 47 Return to debug level 126. 48 Return to debug level 125. 49 Return to debug level 124. 50 Return to debug level 123. 51 Return to debug level 122. 52 Return to debug level 121. 53 Return to debug level 120. 54 Return to debug level 119. 55 Return to debug level 118. 56 Return to debug level 117. 57 Return to debug level 116. 58 Return to debug level 115. 59 Return to debug level 114. 60 Return to debug level 113. 61 Return to debug level 112. 62 Return to debug level 111. 63 Return to debug level 110. 64 Return to debug level 109. 65 Return to debug level 108. 66 Return to debug level 107. 67 Return to debug level 106. 68 Return to debug level 105. 69 Return to debug level 104. 70 Return to debug level 103. 71 Return to debug level 102. 72 Return to debug level 101. 73 Return to debug level 100. 74 Return to debug level 99. 75 Return to debug level 98. 76 Return to debug level 97. 77 Return to debug level 96. 78 Return to debug level 95. 79 Return to debug level 94. 80 Return to debug level 93. 81 Return to debug level 92. 82 Return to debug level 91. 83 Return to debug level 90. 84 Return to debug level 89. 85 Return to debug level 88. 86 Return to debug level 87. 87 Return to debug level 86. 88 Return to debug level 85. 89 Return to debug level 84. 90 Return to debug level 83. 91 Return to debug level 82. 92 Return to debug level 81. 93 Return to debug level 80. 94 Return to debug level 79. 95 Return to debug level 78. 96 Return to debug level 77. 97 Return to debug level 76. 98 Return to debug level 75. 99 Return to debug level 74. 100 Return to debug level 73. 101 Return to debug level 72. 102 Return to debug level 71. 103 Return to debug level 70. 104 Return to debug level 69. 105 Return to debug level 68. 106 Return to debug level 67. 107 Return to debug level 66. 108 Return to debug level 65. 109 Return to debug level 64. 110 Return to debug level 63. 111 Return to debug level 62. 112 Return to debug level 61. 113 Return to debug level 60. 114 Return to debug level 59. 115 Return to debug level 58. 116 Return to debug level 57. 117 Return to debug level 56. 118 Return to debug level 55. 119 Return to debug level 54. 120 Return to debug level 53. 121 Return to debug level 52. 122 Return to debug level 51. 123 Return to debug level 50. 124 Return to debug level 49. 125 Return to debug level 48. 126 Return to debug level 47. 127 Return to debug level 46. 128 Return to debug level 45. 129 Return to debug level 44. 130 Return to debug level 43. 131 Return to debug level 42. 132 Return to debug level 41. 133 Return to debug level 40. 134 Return to debug level 39. 135 Return to debug level 38. 136 Return to debug level 37. 137 Return to debug level 36. 138 Return to debug level 35. 139 Return to debug level 34. 140 Return to debug level 33. 141 Return to debug level 32. 142 Return to debug level 31. 143 Return to debug level 30. 144 Return to debug level 29. 145 Return to debug level 28. 146 Return to debug level 27. 147 Return to debug level 26. 148 Return to debug level 25. 149 Return to debug level 24. 150 Return to debug level 23. 151 Return to debug level 22. 152 Return to debug level 21. 153 Return to debug level 20. 154 Return to debug level 19. 155 Return to debug level 18. 156 Return to debug level 17. 157 Return to debug level 16. 158 Return to debug level 15. 159 Return to debug level 14. 160 Return to debug level 13. 161 Return to debug level 12. 162 Return to debug level 11. 163 Return to debug level 10. 164 Return to debug level 9. 165 Return to debug level 8. 166 Return to debug level 7. 167 Return to debug level 6. 168 Return to debug level 5. 169 Return to debug level 4. 170 Return to debug level 3. 171 Return to debug level 2. 172 Return to debug level 1. 173 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 173. 2 Return to debug level 172. 3 Return to debug level 171. 4 Return to debug level 170. 5 Return to debug level 169. 6 Return to debug level 168. 7 Return to debug level 167. 8 Return to debug level 166. 9 Return to debug level 165. 10 Return to debug level 164. 11 Return to debug level 163. 12 Return to debug level 162. 13 Return to debug level 161. 14 Return to debug level 160. 15 Return to debug level 159. 16 Return to debug level 158. 17 Return to debug level 157. 18 Return to debug level 156. 19 Return to debug level 155. 20 Return to debug level 154. 21 Return to debug level 153. 22 Return to debug level 152. 23 Return to debug level 151. 24 Return to debug level 150. 25 Return to debug level 149. 26 Return to debug level 148. 27 Return to debug level 147. 28 Return to debug level 146. 29 Return to debug level 145. 30 Return to debug level 144. 31 Return to debug level 143. 32 Return to debug level 142. 33 Return to debug level 141. 34 Return to debug level 140. 35 Return to debug level 139. 36 Return to debug level 138. 37 Return to debug level 137. 38 Return to debug level 136. 39 Return to debug level 135. 40 Return to debug level 134. 41 Return to debug level 133. 42 Return to debug level 132. 43 Return to debug level 131. 44 Return to debug level 130. 45 Return to debug level 129. 46 Return to debug level 128. 47 Return to debug level 127. 48 Return to debug level 126. 49 Return to debug level 125. 50 Return to debug level 124. 51 Return to debug level 123. 52 Return to debug level 122. 53 Return to debug level 121. 54 Return to debug level 120. 55 Return to debug level 119. 56 Return to debug level 118. 57 Return to debug level 117. 58 Return to debug level 116. 59 Return to debug level 115. 60 Return to debug level 114. 61 Return to debug level 113. 62 Return to debug level 112. 63 Return to debug level 111. 64 Return to debug level 110. 65 Return to debug level 109. 66 Return to debug level 108. 67 Return to debug level 107. 68 Return to debug level 106. 69 Return to debug level 105. 70 Return to debug level 104. 71 Return to debug level 103. 72 Return to debug level 102. 73 Return to debug level 101. 74 Return to debug level 100. 75 Return to debug level 99. 76 Return to debug level 98. 77 Return to debug level 97. 78 Return to debug level 96. 79 Return to debug level 95. 80 Return to debug level 94. 81 Return to debug level 93. 82 Return to debug level 92. 83 Return to debug level 91. 84 Return to debug level 90. 85 Return to debug level 89. 86 Return to debug level 88. 87 Return to debug level 87. 88 Return to debug level 86. 89 Return to debug level 85. 90 Return to debug level 84. 91 Return to debug level 83. 92 Return to debug level 82. 93 Return to debug level 81. 94 Return to debug level 80. 95 Return to debug level 79. 96 Return to debug level 78. 97 Return to debug level 77. 98 Return to debug level 76. 99 Return to debug level 75. 100 Return to debug level 74. 101 Return to debug level 73. 102 Return to debug level 72. 103 Return to debug level 71. 104 Return to debug level 70. 105 Return to debug level 69. 106 Return to debug level 68. 107 Return to debug level 67. 108 Return to debug level 66. 109 Return to debug level 65. 110 Return to debug level 64. 111 Return to debug level 63. 112 Return to debug level 62. 113 Return to debug level 61. 114 Return to debug level 60. 115 Return to debug level 59. 116 Return to debug level 58. 117 Return to debug level 57. 118 Return to debug level 56. 119 Return to debug level 55. 120 Return to debug level 54. 121 Return to debug level 53. 122 Return to debug level 52. 123 Return to debug level 51. 124 Return to debug level 50. 125 Return to debug level 49. 126 Return to debug level 48. 127 Return to debug level 47. 128 Return to debug level 46. 129 Return to debug level 45. 130 Return to debug level 44. 131 Return to debug level 43. 132 Return to debug level 42. 133 Return to debug level 41. 134 Return to debug level 40. 135 Return to debug level 39. 136 Return to debug level 38. 137 Return to debug level 37. 138 Return to debug level 36. 139 Return to debug level 35. 140 Return to debug level 34. 141 Return to debug level 33. 142 Return to debug level 32. 143 Return to debug level 31. 144 Return to debug level 30. 145 Return to debug level 29. 146 Return to debug level 28. 147 Return to debug level 27. 148 Return to debug level 26. 149 Return to debug level 25. 150 Return to debug level 24. 151 Return to debug level 23. 152 Return to debug level 22. 153 Return to debug level 21. 154 Return to debug level 20. 155 Return to debug level 19. 156 Return to debug level 18. 157 Return to debug level 17. 158 Return to debug level 16. 159 Return to debug level 15. 160 Return to debug level 14. 161 Return to debug level 13. 162 Return to debug level 12. 163 Return to debug level 11. 164 Return to debug level 10. 165 Return to debug level 9. 166 Return to debug level 8. 167 Return to debug level 7. 168 Return to debug level 6. 169 Return to debug level 5. 170 Return to debug level 4. 171 Return to debug level 3. 172 Return to debug level 2. 173 Return to debug level 1. 174 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 174. 2 Return to debug level 173. 3 Return to debug level 172. 4 Return to debug level 171. 5 Return to debug level 170. 6 Return to debug level 169. 7 Return to debug level 168. 8 Return to debug level 167. 9 Return to debug level 166. 10 Return to debug level 165. 11 Return to debug level 164. 12 Return to debug level 163. 13 Return to debug level 162. 14 Return to debug level 161. 15 Return to debug level 160. 16 Return to debug level 159. 17 Return to debug level 158. 18 Return to debug level 157. 19 Return to debug level 156. 20 Return to debug level 155. 21 Return to debug level 154. 22 Return to debug level 153. 23 Return to debug level 152. 24 Return to debug level 151. 25 Return to debug level 150. 26 Return to debug level 149. 27 Return to debug level 148. 28 Return to debug level 147. 29 Return to debug level 146. 30 Return to debug level 145. 31 Return to debug level 144. 32 Return to debug level 143. 33 Return to debug level 142. 34 Return to debug level 141. 35 Return to debug level 140. 36 Return to debug level 139. 37 Return to debug level 138. 38 Return to debug level 137. 39 Return to debug level 136. 40 Return to debug level 135. 41 Return to debug level 134. 42 Return to debug level 133. 43 Return to debug level 132. 44 Return to debug level 131. 45 Return to debug level 130. 46 Return to debug level 129. 47 Return to debug level 128. 48 Return to debug level 127. 49 Return to debug level 126. 50 Return to debug level 125. 51 Return to debug level 124. 52 Return to debug level 123. 53 Return to debug level 122. 54 Return to debug level 121. 55 Return to debug level 120. 56 Return to debug level 119. 57 Return to debug level 118. 58 Return to debug level 117. 59 Return to debug level 116. 60 Return to debug level 115. 61 Return to debug level 114. 62 Return to debug level 113. 63 Return to debug level 112. 64 Return to debug level 111. 65 Return to debug level 110. 66 Return to debug level 109. 67 Return to debug level 108. 68 Return to debug level 107. 69 Return to debug level 106. 70 Return to debug level 105. 71 Return to debug level 104. 72 Return to debug level 103. 73 Return to debug level 102. 74 Return to debug level 101. 75 Return to debug level 100. 76 Return to debug level 99. 77 Return to debug level 98. 78 Return to debug level 97. 79 Return to debug level 96. 80 Return to debug level 95. 81 Return to debug level 94. 82 Return to debug level 93. 83 Return to debug level 92. 84 Return to debug level 91. 85 Return to debug level 90. 86 Return to debug level 89. 87 Return to debug level 88. 88 Return to debug level 87. 89 Return to debug level 86. 90 Return to debug level 85. 91 Return to debug level 84. 92 Return to debug level 83. 93 Return to debug level 82. 94 Return to debug level 81. 95 Return to debug level 80. 96 Return to debug level 79. 97 Return to debug level 78. 98 Return to debug level 77. 99 Return to debug level 76. 100 Return to debug level 75. 101 Return to debug level 74. 102 Return to debug level 73. 103 Return to debug level 72. 104 Return to debug level 71. 105 Return to debug level 70. 106 Return to debug level 69. 107 Return to debug level 68. 108 Return to debug level 67. 109 Return to debug level 66. 110 Return to debug level 65. 111 Return to debug level 64. 112 Return to debug level 63. 113 Return to debug level 62. 114 Return to debug level 61. 115 Return to debug level 60. 116 Return to debug level 59. 117 Return to debug level 58. 118 Return to debug level 57. 119 Return to debug level 56. 120 Return to debug level 55. 121 Return to debug level 54. 122 Return to debug level 53. 123 Return to debug level 52. 124 Return to debug level 51. 125 Return to debug level 50. 126 Return to debug level 49. 127 Return to debug level 48. 128 Return to debug level 47. 129 Return to debug level 46. 130 Return to debug level 45. 131 Return to debug level 44. 132 Return to debug level 43. 133 Return to debug level 42. 134 Return to debug level 41. 135 Return to debug level 40. 136 Return to debug level 39. 137 Return to debug level 38. 138 Return to debug level 37. 139 Return to debug level 36. 140 Return to debug level 35. 141 Return to debug level 34. 142 Return to debug level 33. 143 Return to debug level 32. 144 Return to debug level 31. 145 Return to debug level 30. 146 Return to debug level 29. 147 Return to debug level 28. 148 Return to debug level 27. 149 Return to debug level 26. 150 Return to debug level 25. 151 Return to debug level 24. 152 Return to debug level 23. 153 Return to debug level 22. 154 Return to debug level 21. 155 Return to debug level 20. 156 Return to debug level 19. 157 Return to debug level 18. 158 Return to debug level 17. 159 Return to debug level 16. 160 Return to debug level 15. 161 Return to debug level 14. 162 Return to debug level 13. 163 Return to debug level 12. 164 Return to debug level 11. 165 Return to debug level 10. 166 Return to debug level 9. 167 Return to debug level 8. 168 Return to debug level 7. 169 Return to debug level 6. 170 Return to debug level 5. 171 Return to debug level 4. 172 Return to debug level 3. 173 Return to debug level 2. 174 Return to debug level 1. 175 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 175. 2 Return to debug level 174. 3 Return to debug level 173. 4 Return to debug level 172. 5 Return to debug level 171. 6 Return to debug level 170. 7 Return to debug level 169. 8 Return to debug level 168. 9 Return to debug level 167. 10 Return to debug level 166. 11 Return to debug level 165. 12 Return to debug level 164. 13 Return to debug level 163. 14 Return to debug level 162. 15 Return to debug level 161. 16 Return to debug level 160. 17 Return to debug level 159. 18 Return to debug level 158. 19 Return to debug level 157. 20 Return to debug level 156. 21 Return to debug level 155. 22 Return to debug level 154. 23 Return to debug level 153. 24 Return to debug level 152. 25 Return to debug level 151. 26 Return to debug level 150. 27 Return to debug level 149. 28 Return to debug level 148. 29 Return to debug level 147. 30 Return to debug level 146. 31 Return to debug level 145. 32 Return to debug level 144. 33 Return to debug level 143. 34 Return to debug level 142. 35 Return to debug level 141. 36 Return to debug level 140. 37 Return to debug level 139. 38 Return to debug level 138. 39 Return to debug level 137. 40 Return to debug level 136. 41 Return to debug level 135. 42 Return to debug level 134. 43 Return to debug level 133. 44 Return to debug level 132. 45 Return to debug level 131. 46 Return to debug level 130. 47 Return to debug level 129. 48 Return to debug level 128. 49 Return to debug level 127. 50 Return to debug level 126. 51 Return to debug level 125. 52 Return to debug level 124. 53 Return to debug level 123. 54 Return to debug level 122. 55 Return to debug level 121. 56 Return to debug level 120. 57 Return to debug level 119. 58 Return to debug level 118. 59 Return to debug level 117. 60 Return to debug level 116. 61 Return to debug level 115. 62 Return to debug level 114. 63 Return to debug level 113. 64 Return to debug level 112. 65 Return to debug level 111. 66 Return to debug level 110. 67 Return to debug level 109. 68 Return to debug level 108. 69 Return to debug level 107. 70 Return to debug level 106. 71 Return to debug level 105. 72 Return to debug level 104. 73 Return to debug level 103. 74 Return to debug level 102. 75 Return to debug level 101. 76 Return to debug level 100. 77 Return to debug level 99. 78 Return to debug level 98. 79 Return to debug level 97. 80 Return to debug level 96. 81 Return to debug level 95. 82 Return to debug level 94. 83 Return to debug level 93. 84 Return to debug level 92. 85 Return to debug level 91. 86 Return to debug level 90. 87 Return to debug level 89. 88 Return to debug level 88. 89 Return to debug level 87. 90 Return to debug level 86. 91 Return to debug level 85. 92 Return to debug level 84. 93 Return to debug level 83. 94 Return to debug level 82. 95 Return to debug level 81. 96 Return to debug level 80. 97 Return to debug level 79. 98 Return to debug level 78. 99 Return to debug level 77. 100 Return to debug level 76. 101 Return to debug level 75. 102 Return to debug level 74. 103 Return to debug level 73. 104 Return to debug level 72. 105 Return to debug level 71. 106 Return to debug level 70. 107 Return to debug level 69. 108 Return to debug level 68. 109 Return to debug level 67. 110 Return to debug level 66. 111 Return to debug level 65. 112 Return to debug level 64. 113 Return to debug level 63. 114 Return to debug level 62. 115 Return to debug level 61. 116 Return to debug level 60. 117 Return to debug level 59. 118 Return to debug level 58. 119 Return to debug level 57. 120 Return to debug level 56. 121 Return to debug level 55. 122 Return to debug level 54. 123 Return to debug level 53. 124 Return to debug level 52. 125 Return to debug level 51. 126 Return to debug level 50. 127 Return to debug level 49. 128 Return to debug level 48. 129 Return to debug level 47. 130 Return to debug level 46. 131 Return to debug level 45. 132 Return to debug level 44. 133 Return to debug level 43. 134 Return to debug level 42. 135 Return to debug level 41. 136 Return to debug level 40. 137 Return to debug level 39. 138 Return to debug level 38. 139 Return to debug level 37. 140 Return to debug level 36. 141 Return to debug level 35. 142 Return to debug level 34. 143 Return to debug level 33. 144 Return to debug level 32. 145 Return to debug level 31. 146 Return to debug level 30. 147 Return to debug level 29. 148 Return to debug level 28. 149 Return to debug level 27. 150 Return to debug level 26. 151 Return to debug level 25. 152 Return to debug level 24. 153 Return to debug level 23. 154 Return to debug level 22. 155 Return to debug level 21. 156 Return to debug level 20. 157 Return to debug level 19. 158 Return to debug level 18. 159 Return to debug level 17. 160 Return to debug level 16. 161 Return to debug level 15. 162 Return to debug level 14. 163 Return to debug level 13. 164 Return to debug level 12. 165 Return to debug level 11. 166 Return to debug level 10. 167 Return to debug level 9. 168 Return to debug level 8. 169 Return to debug level 7. 170 Return to debug level 6. 171 Return to debug level 5. 172 Return to debug level 4. 173 Return to debug level 3. 174 Return to debug level 2. 175 Return to debug level 1. 176 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 176. 2 Return to debug level 175. 3 Return to debug level 174. 4 Return to debug level 173. 5 Return to debug level 172. 6 Return to debug level 171. 7 Return to debug level 170. 8 Return to debug level 169. 9 Return to debug level 168. 10 Return to debug level 167. 11 Return to debug level 166. 12 Return to debug level 165. 13 Return to debug level 164. 14 Return to debug level 163. 15 Return to debug level 162. 16 Return to debug level 161. 17 Return to debug level 160. 18 Return to debug level 159. 19 Return to debug level 158. 20 Return to debug level 157. 21 Return to debug level 156. 22 Return to debug level 155. 23 Return to debug level 154. 24 Return to debug level 153. 25 Return to debug level 152. 26 Return to debug level 151. 27 Return to debug level 150. 28 Return to debug level 149. 29 Return to debug level 148. 30 Return to debug level 147. 31 Return to debug level 146. 32 Return to debug level 145. 33 Return to debug level 144. 34 Return to debug level 143. 35 Return to debug level 142. 36 Return to debug level 141. 37 Return to debug level 140. 38 Return to debug level 139. 39 Return to debug level 138. 40 Return to debug level 137. 41 Return to debug level 136. 42 Return to debug level 135. 43 Return to debug level 134. 44 Return to debug level 133. 45 Return to debug level 132. 46 Return to debug level 131. 47 Return to debug level 130. 48 Return to debug level 129. 49 Return to debug level 128. 50 Return to debug level 127. 51 Return to debug level 126. 52 Return to debug level 125. 53 Return to debug level 124. 54 Return to debug level 123. 55 Return to debug level 122. 56 Return to debug level 121. 57 Return to debug level 120. 58 Return to debug level 119. 59 Return to debug level 118. 60 Return to debug level 117. 61 Return to debug level 116. 62 Return to debug level 115. 63 Return to debug level 114. 64 Return to debug level 113. 65 Return to debug level 112. 66 Return to debug level 111. 67 Return to debug level 110. 68 Return to debug level 109. 69 Return to debug level 108. 70 Return to debug level 107. 71 Return to debug level 106. 72 Return to debug level 105. 73 Return to debug level 104. 74 Return to debug level 103. 75 Return to debug level 102. 76 Return to debug level 101. 77 Return to debug level 100. 78 Return to debug level 99. 79 Return to debug level 98. 80 Return to debug level 97. 81 Return to debug level 96. 82 Return to debug level 95. 83 Return to debug level 94. 84 Return to debug level 93. 85 Return to debug level 92. 86 Return to debug level 91. 87 Return to debug level 90. 88 Return to debug level 89. 89 Return to debug level 88. 90 Return to debug level 87. 91 Return to debug level 86. 92 Return to debug level 85. 93 Return to debug level 84. 94 Return to debug level 83. 95 Return to debug level 82. 96 Return to debug level 81. 97 Return to debug level 80. 98 Return to debug level 79. 99 Return to debug level 78. 100 Return to debug level 77. 101 Return to debug level 76. 102 Return to debug level 75. 103 Return to debug level 74. 104 Return to debug level 73. 105 Return to debug level 72. 106 Return to debug level 71. 107 Return to debug level 70. 108 Return to debug level 69. 109 Return to debug level 68. 110 Return to debug level 67. 111 Return to debug level 66. 112 Return to debug level 65. 113 Return to debug level 64. 114 Return to debug level 63. 115 Return to debug level 62. 116 Return to debug level 61. 117 Return to debug level 60. 118 Return to debug level 59. 119 Return to debug level 58. 120 Return to debug level 57. 121 Return to debug level 56. 122 Return to debug level 55. 123 Return to debug level 54. 124 Return to debug level 53. 125 Return to debug level 52. 126 Return to debug level 51. 127 Return to debug level 50. 128 Return to debug level 49. 129 Return to debug level 48. 130 Return to debug level 47. 131 Return to debug level 46. 132 Return to debug level 45. 133 Return to debug level 44. 134 Return to debug level 43. 135 Return to debug level 42. 136 Return to debug level 41. 137 Return to debug level 40. 138 Return to debug level 39. 139 Return to debug level 38. 140 Return to debug level 37. 141 Return to debug level 36. 142 Return to debug level 35. 143 Return to debug level 34. 144 Return to debug level 33. 145 Return to debug level 32. 146 Return to debug level 31. 147 Return to debug level 30. 148 Return to debug level 29. 149 Return to debug level 28. 150 Return to debug level 27. 151 Return to debug level 26. 152 Return to debug level 25. 153 Return to debug level 24. 154 Return to debug level 23. 155 Return to debug level 22. 156 Return to debug level 21. 157 Return to debug level 20. 158 Return to debug level 19. 159 Return to debug level 18. 160 Return to debug level 17. 161 Return to debug level 16. 162 Return to debug level 15. 163 Return to debug level 14. 164 Return to debug level 13. 165 Return to debug level 12. 166 Return to debug level 11. 167 Return to debug level 10. 168 Return to debug level 9. 169 Return to debug level 8. 170 Return to debug level 7. 171 Return to debug level 6. 172 Return to debug level 5. 173 Return to debug level 4. 174 Return to debug level 3. 175 Return to debug level 2. 176 Return to debug level 1. 177 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 177. 2 Return to debug level 176. 3 Return to debug level 175. 4 Return to debug level 174. 5 Return to debug level 173. 6 Return to debug level 172. 7 Return to debug level 171. 8 Return to debug level 170. 9 Return to debug level 169. 10 Return to debug level 168. 11 Return to debug level 167. 12 Return to debug level 166. 13 Return to debug level 165. 14 Return to debug level 164. 15 Return to debug level 163. 16 Return to debug level 162. 17 Return to debug level 161. 18 Return to debug level 160. 19 Return to debug level 159. 20 Return to debug level 158. 21 Return to debug level 157. 22 Return to debug level 156. 23 Return to debug level 155. 24 Return to debug level 154. 25 Return to debug level 153. 26 Return to debug level 152. 27 Return to debug level 151. 28 Return to debug level 150. 29 Return to debug level 149. 30 Return to debug level 148. 31 Return to debug level 147. 32 Return to debug level 146. 33 Return to debug level 145. 34 Return to debug level 144. 35 Return to debug level 143. 36 Return to debug level 142. 37 Return to debug level 141. 38 Return to debug level 140. 39 Return to debug level 139. 40 Return to debug level 138. 41 Return to debug level 137. 42 Return to debug level 136. 43 Return to debug level 135. 44 Return to debug level 134. 45 Return to debug level 133. 46 Return to debug level 132. 47 Return to debug level 131. 48 Return to debug level 130. 49 Return to debug level 129. 50 Return to debug level 128. 51 Return to debug level 127. 52 Return to debug level 126. 53 Return to debug level 125. 54 Return to debug level 124. 55 Return to debug level 123. 56 Return to debug level 122. 57 Return to debug level 121. 58 Return to debug level 120. 59 Return to debug level 119. 60 Return to debug level 118. 61 Return to debug level 117. 62 Return to debug level 116. 63 Return to debug level 115. 64 Return to debug level 114. 65 Return to debug level 113. 66 Return to debug level 112. 67 Return to debug level 111. 68 Return to debug level 110. 69 Return to debug level 109. 70 Return to debug level 108. 71 Return to debug level 107. 72 Return to debug level 106. 73 Return to debug level 105. 74 Return to debug level 104. 75 Return to debug level 103. 76 Return to debug level 102. 77 Return to debug level 101. 78 Return to debug level 100. 79 Return to debug level 99. 80 Return to debug level 98. 81 Return to debug level 97. 82 Return to debug level 96. 83 Return to debug level 95. 84 Return to debug level 94. 85 Return to debug level 93. 86 Return to debug level 92. 87 Return to debug level 91. 88 Return to debug level 90. 89 Return to debug level 89. 90 Return to debug level 88. 91 Return to debug level 87. 92 Return to debug level 86. 93 Return to debug level 85. 94 Return to debug level 84. 95 Return to debug level 83. 96 Return to debug level 82. 97 Return to debug level 81. 98 Return to debug level 80. 99 Return to debug level 79. 100 Return to debug level 78. 101 Return to debug level 77. 102 Return to debug level 76. 103 Return to debug level 75. 104 Return to debug level 74. 105 Return to debug level 73. 106 Return to debug level 72. 107 Return to debug level 71. 108 Return to debug level 70. 109 Return to debug level 69. 110 Return to debug level 68. 111 Return to debug level 67. 112 Return to debug level 66. 113 Return to debug level 65. 114 Return to debug level 64. 115 Return to debug level 63. 116 Return to debug level 62. 117 Return to debug level 61. 118 Return to debug level 60. 119 Return to debug level 59. 120 Return to debug level 58. 121 Return to debug level 57. 122 Return to debug level 56. 123 Return to debug level 55. 124 Return to debug level 54. 125 Return to debug level 53. 126 Return to debug level 52. 127 Return to debug level 51. 128 Return to debug level 50. 129 Return to debug level 49. 130 Return to debug level 48. 131 Return to debug level 47. 132 Return to debug level 46. 133 Return to debug level 45. 134 Return to debug level 44. 135 Return to debug level 43. 136 Return to debug level 42. 137 Return to debug level 41. 138 Return to debug level 40. 139 Return to debug level 39. 140 Return to debug level 38. 141 Return to debug level 37. 142 Return to debug level 36. 143 Return to debug level 35. 144 Return to debug level 34. 145 Return to debug level 33. 146 Return to debug level 32. 147 Return to debug level 31. 148 Return to debug level 30. 149 Return to debug level 29. 150 Return to debug level 28. 151 Return to debug level 27. 152 Return to debug level 26. 153 Return to debug level 25. 154 Return to debug level 24. 155 Return to debug level 23. 156 Return to debug level 22. 157 Return to debug level 21. 158 Return to debug level 20. 159 Return to debug level 19. 160 Return to debug level 18. 161 Return to debug level 17. 162 Return to debug level 16. 163 Return to debug level 15. 164 Return to debug level 14. 165 Return to debug level 13. 166 Return to debug level 12. 167 Return to debug level 11. 168 Return to debug level 10. 169 Return to debug level 9. 170 Return to debug level 8. 171 Return to debug level 7. 172 Return to debug level 6. 173 Return to debug level 5. 174 Return to debug level 4. 175 Return to debug level 3. 176 Return to debug level 2. 177 Return to debug level 1. 178 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 178. 2 Return to debug level 177. 3 Return to debug level 176. 4 Return to debug level 175. 5 Return to debug level 174. 6 Return to debug level 173. 7 Return to debug level 172. 8 Return to debug level 171. 9 Return to debug level 170. 10 Return to debug level 169. 11 Return to debug level 168. 12 Return to debug level 167. 13 Return to debug level 166. 14 Return to debug level 165. 15 Return to debug level 164. 16 Return to debug level 163. 17 Return to debug level 162. 18 Return to debug level 161. 19 Return to debug level 160. 20 Return to debug level 159. 21 Return to debug level 158. 22 Return to debug level 157. 23 Return to debug level 156. 24 Return to debug level 155. 25 Return to debug level 154. 26 Return to debug level 153. 27 Return to debug level 152. 28 Return to debug level 151. 29 Return to debug level 150. 30 Return to debug level 149. 31 Return to debug level 148. 32 Return to debug level 147. 33 Return to debug level 146. 34 Return to debug level 145. 35 Return to debug level 144. 36 Return to debug level 143. 37 Return to debug level 142. 38 Return to debug level 141. 39 Return to debug level 140. 40 Return to debug level 139. 41 Return to debug level 138. 42 Return to debug level 137. 43 Return to debug level 136. 44 Return to debug level 135. 45 Return to debug level 134. 46 Return to debug level 133. 47 Return to debug level 132. 48 Return to debug level 131. 49 Return to debug level 130. 50 Return to debug level 129. 51 Return to debug level 128. 52 Return to debug level 127. 53 Return to debug level 126. 54 Return to debug level 125. 55 Return to debug level 124. 56 Return to debug level 123. 57 Return to debug level 122. 58 Return to debug level 121. 59 Return to debug level 120. 60 Return to debug level 119. 61 Return to debug level 118. 62 Return to debug level 117. 63 Return to debug level 116. 64 Return to debug level 115. 65 Return to debug level 114. 66 Return to debug level 113. 67 Return to debug level 112. 68 Return to debug level 111. 69 Return to debug level 110. 70 Return to debug level 109. 71 Return to debug level 108. 72 Return to debug level 107. 73 Return to debug level 106. 74 Return to debug level 105. 75 Return to debug level 104. 76 Return to debug level 103. 77 Return to debug level 102. 78 Return to debug level 101. 79 Return to debug level 100. 80 Return to debug level 99. 81 Return to debug level 98. 82 Return to debug level 97. 83 Return to debug level 96. 84 Return to debug level 95. 85 Return to debug level 94. 86 Return to debug level 93. 87 Return to debug level 92. 88 Return to debug level 91. 89 Return to debug level 90. 90 Return to debug level 89. 91 Return to debug level 88. 92 Return to debug level 87. 93 Return to debug level 86. 94 Return to debug level 85. 95 Return to debug level 84. 96 Return to debug level 83. 97 Return to debug level 82. 98 Return to debug level 81. 99 Return to debug level 80. 100 Return to debug level 79. 101 Return to debug level 78. 102 Return to debug level 77. 103 Return to debug level 76. 104 Return to debug level 75. 105 Return to debug level 74. 106 Return to debug level 73. 107 Return to debug level 72. 108 Return to debug level 71. 109 Return to debug level 70. 110 Return to debug level 69. 111 Return to debug level 68. 112 Return to debug level 67. 113 Return to debug level 66. 114 Return to debug level 65. 115 Return to debug level 64. 116 Return to debug level 63. 117 Return to debug level 62. 118 Return to debug level 61. 119 Return to debug level 60. 120 Return to debug level 59. 121 Return to debug level 58. 122 Return to debug level 57. 123 Return to debug level 56. 124 Return to debug level 55. 125 Return to debug level 54. 126 Return to debug level 53. 127 Return to debug level 52. 128 Return to debug level 51. 129 Return to debug level 50. 130 Return to debug level 49. 131 Return to debug level 48. 132 Return to debug level 47. 133 Return to debug level 46. 134 Return to debug level 45. 135 Return to debug level 44. 136 Return to debug level 43. 137 Return to debug level 42. 138 Return to debug level 41. 139 Return to debug level 40. 140 Return to debug level 39. 141 Return to debug level 38. 142 Return to debug level 37. 143 Return to debug level 36. 144 Return to debug level 35. 145 Return to debug level 34. 146 Return to debug level 33. 147 Return to debug level 32. 148 Return to debug level 31. 149 Return to debug level 30. 150 Return to debug level 29. 151 Return to debug level 28. 152 Return to debug level 27. 153 Return to debug level 26. 154 Return to debug level 25. 155 Return to debug level 24. 156 Return to debug level 23. 157 Return to debug level 22. 158 Return to debug level 21. 159 Return to debug level 20. 160 Return to debug level 19. 161 Return to debug level 18. 162 Return to debug level 17. 163 Return to debug level 16. 164 Return to debug level 15. 165 Return to debug level 14. 166 Return to debug level 13. 167 Return to debug level 12. 168 Return to debug level 11. 169 Return to debug level 10. 170 Return to debug level 9. 171 Return to debug level 8. 172 Return to debug level 7. 173 Return to debug level 6. 174 Return to debug level 5. 175 Return to debug level 4. 176 Return to debug level 3. 177 Return to debug level 2. 178 Return to debug level 1. 179 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 179. 2 Return to debug level 178. 3 Return to debug level 177. 4 Return to debug level 176. 5 Return to debug level 175. 6 Return to debug level 174. 7 Return to debug level 173. 8 Return to debug level 172. 9 Return to debug level 171. 10 Return to debug level 170. 11 Return to debug level 169. 12 Return to debug level 168. 13 Return to debug level 167. 14 Return to debug level 166. 15 Return to debug level 165. 16 Return to debug level 164. 17 Return to debug level 163. 18 Return to debug level 162. 19 Return to debug level 161. 20 Return to debug level 160. 21 Return to debug level 159. 22 Return to debug level 158. 23 Return to debug level 157. 24 Return to debug level 156. 25 Return to debug level 155. 26 Return to debug level 154. 27 Return to debug level 153. 28 Return to debug level 152. 29 Return to debug level 151. 30 Return to debug level 150. 31 Return to debug level 149. 32 Return to debug level 148. 33 Return to debug level 147. 34 Return to debug level 146. 35 Return to debug level 145. 36 Return to debug level 144. 37 Return to debug level 143. 38 Return to debug level 142. 39 Return to debug level 141. 40 Return to debug level 140. 41 Return to debug level 139. 42 Return to debug level 138. 43 Return to debug level 137. 44 Return to debug level 136. 45 Return to debug level 135. 46 Return to debug level 134. 47 Return to debug level 133. 48 Return to debug level 132. 49 Return to debug level 131. 50 Return to debug level 130. 51 Return to debug level 129. 52 Return to debug level 128. 53 Return to debug level 127. 54 Return to debug level 126. 55 Return to debug level 125. 56 Return to debug level 124. 57 Return to debug level 123. 58 Return to debug level 122. 59 Return to debug level 121. 60 Return to debug level 120. 61 Return to debug level 119. 62 Return to debug level 118. 63 Return to debug level 117. 64 Return to debug level 116. 65 Return to debug level 115. 66 Return to debug level 114. 67 Return to debug level 113. 68 Return to debug level 112. 69 Return to debug level 111. 70 Return to debug level 110. 71 Return to debug level 109. 72 Return to debug level 108. 73 Return to debug level 107. 74 Return to debug level 106. 75 Return to debug level 105. 76 Return to debug level 104. 77 Return to debug level 103. 78 Return to debug level 102. 79 Return to debug level 101. 80 Return to debug level 100. 81 Return to debug level 99. 82 Return to debug level 98. 83 Return to debug level 97. 84 Return to debug level 96. 85 Return to debug level 95. 86 Return to debug level 94. 87 Return to debug level 93. 88 Return to debug level 92. 89 Return to debug level 91. 90 Return to debug level 90. 91 Return to debug level 89. 92 Return to debug level 88. 93 Return to debug level 87. 94 Return to debug level 86. 95 Return to debug level 85. 96 Return to debug level 84. 97 Return to debug level 83. 98 Return to debug level 82. 99 Return to debug level 81. 100 Return to debug level 80. 101 Return to debug level 79. 102 Return to debug level 78. 103 Return to debug level 77. 104 Return to debug level 76. 105 Return to debug level 75. 106 Return to debug level 74. 107 Return to debug level 73. 108 Return to debug level 72. 109 Return to debug level 71. 110 Return to debug level 70. 111 Return to debug level 69. 112 Return to debug level 68. 113 Return to debug level 67. 114 Return to debug level 66. 115 Return to debug level 65. 116 Return to debug level 64. 117 Return to debug level 63. 118 Return to debug level 62. 119 Return to debug level 61. 120 Return to debug level 60. 121 Return to debug level 59. 122 Return to debug level 58. 123 Return to debug level 57. 124 Return to debug level 56. 125 Return to debug level 55. 126 Return to debug level 54. 127 Return to debug level 53. 128 Return to debug level 52. 129 Return to debug level 51. 130 Return to debug level 50. 131 Return to debug level 49. 132 Return to debug level 48. 133 Return to debug level 47. 134 Return to debug level 46. 135 Return to debug level 45. 136 Return to debug level 44. 137 Return to debug level 43. 138 Return to debug level 42. 139 Return to debug level 41. 140 Return to debug level 40. 141 Return to debug level 39. 142 Return to debug level 38. 143 Return to debug level 37. 144 Return to debug level 36. 145 Return to debug level 35. 146 Return to debug level 34. 147 Return to debug level 33. 148 Return to debug level 32. 149 Return to debug level 31. 150 Return to debug level 30. 151 Return to debug level 29. 152 Return to debug level 28. 153 Return to debug level 27. 154 Return to debug level 26. 155 Return to debug level 25. 156 Return to debug level 24. 157 Return to debug level 23. 158 Return to debug level 22. 159 Return to debug level 21. 160 Return to debug level 20. 161 Return to debug level 19. 162 Return to debug level 18. 163 Return to debug level 17. 164 Return to debug level 16. 165 Return to debug level 15. 166 Return to debug level 14. 167 Return to debug level 13. 168 Return to debug level 12. 169 Return to debug level 11. 170 Return to debug level 10. 171 Return to debug level 9. 172 Return to debug level 8. 173 Return to debug level 7. 174 Return to debug level 6. 175 Return to debug level 5. 176 Return to debug level 4. 177 Return to debug level 3. 178 Return to debug level 2. 179 Return to debug level 1. 180 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 180. 2 Return to debug level 179. 3 Return to debug level 178. 4 Return to debug level 177. 5 Return to debug level 176. 6 Return to debug level 175. 7 Return to debug level 174. 8 Return to debug level 173. 9 Return to debug level 172. 10 Return to debug level 171. 11 Return to debug level 170. 12 Return to debug level 169. 13 Return to debug level 168. 14 Return to debug level 167. 15 Return to debug level 166. 16 Return to debug level 165. 17 Return to debug level 164. 18 Return to debug level 163. 19 Return to debug level 162. 20 Return to debug level 161. 21 Return to debug level 160. 22 Return to debug level 159. 23 Return to debug level 158. 24 Return to debug level 157. 25 Return to debug level 156. 26 Return to debug level 155. 27 Return to debug level 154. 28 Return to debug level 153. 29 Return to debug level 152. 30 Return to debug level 151. 31 Return to debug level 150. 32 Return to debug level 149. 33 Return to debug level 148. 34 Return to debug level 147. 35 Return to debug level 146. 36 Return to debug level 145. 37 Return to debug level 144. 38 Return to debug level 143. 39 Return to debug level 142. 40 Return to debug level 141. 41 Return to debug level 140. 42 Return to debug level 139. 43 Return to debug level 138. 44 Return to debug level 137. 45 Return to debug level 136. 46 Return to debug level 135. 47 Return to debug level 134. 48 Return to debug level 133. 49 Return to debug level 132. 50 Return to debug level 131. 51 Return to debug level 130. 52 Return to debug level 129. 53 Return to debug level 128. 54 Return to debug level 127. 55 Return to debug level 126. 56 Return to debug level 125. 57 Return to debug level 124. 58 Return to debug level 123. 59 Return to debug level 122. 60 Return to debug level 121. 61 Return to debug level 120. 62 Return to debug level 119. 63 Return to debug level 118. 64 Return to debug level 117. 65 Return to debug level 116. 66 Return to debug level 115. 67 Return to debug level 114. 68 Return to debug level 113. 69 Return to debug level 112. 70 Return to debug level 111. 71 Return to debug level 110. 72 Return to debug level 109. 73 Return to debug level 108. 74 Return to debug level 107. 75 Return to debug level 106. 76 Return to debug level 105. 77 Return to debug level 104. 78 Return to debug level 103. 79 Return to debug level 102. 80 Return to debug level 101. 81 Return to debug level 100. 82 Return to debug level 99. 83 Return to debug level 98. 84 Return to debug level 97. 85 Return to debug level 96. 86 Return to debug level 95. 87 Return to debug level 94. 88 Return to debug level 93. 89 Return to debug level 92. 90 Return to debug level 91. 91 Return to debug level 90. 92 Return to debug level 89. 93 Return to debug level 88. 94 Return to debug level 87. 95 Return to debug level 86. 96 Return to debug level 85. 97 Return to debug level 84. 98 Return to debug level 83. 99 Return to debug level 82. 100 Return to debug level 81. 101 Return to debug level 80. 102 Return to debug level 79. 103 Return to debug level 78. 104 Return to debug level 77. 105 Return to debug level 76. 106 Return to debug level 75. 107 Return to debug level 74. 108 Return to debug level 73. 109 Return to debug level 72. 110 Return to debug level 71. 111 Return to debug level 70. 112 Return to debug level 69. 113 Return to debug level 68. 114 Return to debug level 67. 115 Return to debug level 66. 116 Return to debug level 65. 117 Return to debug level 64. 118 Return to debug level 63. 119 Return to debug level 62. 120 Return to debug level 61. 121 Return to debug level 60. 122 Return to debug level 59. 123 Return to debug level 58. 124 Return to debug level 57. 125 Return to debug level 56. 126 Return to debug level 55. 127 Return to debug level 54. 128 Return to debug level 53. 129 Return to debug level 52. 130 Return to debug level 51. 131 Return to debug level 50. 132 Return to debug level 49. 133 Return to debug level 48. 134 Return to debug level 47. 135 Return to debug level 46. 136 Return to debug level 45. 137 Return to debug level 44. 138 Return to debug level 43. 139 Return to debug level 42. 140 Return to debug level 41. 141 Return to debug level 40. 142 Return to debug level 39. 143 Return to debug level 38. 144 Return to debug level 37. 145 Return to debug level 36. 146 Return to debug level 35. 147 Return to debug level 34. 148 Return to debug level 33. 149 Return to debug level 32. 150 Return to debug level 31. 151 Return to debug level 30. 152 Return to debug level 29. 153 Return to debug level 28. 154 Return to debug level 27. 155 Return to debug level 26. 156 Return to debug level 25. 157 Return to debug level 24. 158 Return to debug level 23. 159 Return to debug level 22. 160 Return to debug level 21. 161 Return to debug level 20. 162 Return to debug level 19. 163 Return to debug level 18. 164 Return to debug level 17. 165 Return to debug level 16. 166 Return to debug level 15. 167 Return to debug level 14. 168 Return to debug level 13. 169 Return to debug level 12. 170 Return to debug level 11. 171 Return to debug level 10. 172 Return to debug level 9. 173 Return to debug level 8. 174 Return to debug level 7. 175 Return to debug level 6. 176 Return to debug level 5. 177 Return to debug level 4. 178 Return to debug level 3. 179 Return to debug level 2. 180 Return to debug level 1. 181 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 181. 2 Return to debug level 180. 3 Return to debug level 179. 4 Return to debug level 178. 5 Return to debug level 177. 6 Return to debug level 176. 7 Return to debug level 175. 8 Return to debug level 174. 9 Return to debug level 173. 10 Return to debug level 172. 11 Return to debug level 171. 12 Return to debug level 170. 13 Return to debug level 169. 14 Return to debug level 168. 15 Return to debug level 167. 16 Return to debug level 166. 17 Return to debug level 165. 18 Return to debug level 164. 19 Return to debug level 163. 20 Return to debug level 162. 21 Return to debug level 161. 22 Return to debug level 160. 23 Return to debug level 159. 24 Return to debug level 158. 25 Return to debug level 157. 26 Return to debug level 156. 27 Return to debug level 155. 28 Return to debug level 154. 29 Return to debug level 153. 30 Return to debug level 152. 31 Return to debug level 151. 32 Return to debug level 150. 33 Return to debug level 149. 34 Return to debug level 148. 35 Return to debug level 147. 36 Return to debug level 146. 37 Return to debug level 145. 38 Return to debug level 144. 39 Return to debug level 143. 40 Return to debug level 142. 41 Return to debug level 141. 42 Return to debug level 140. 43 Return to debug level 139. 44 Return to debug level 138. 45 Return to debug level 137. 46 Return to debug level 136. 47 Return to debug level 135. 48 Return to debug level 134. 49 Return to debug level 133. 50 Return to debug level 132. 51 Return to debug level 131. 52 Return to debug level 130. 53 Return to debug level 129. 54 Return to debug level 128. 55 Return to debug level 127. 56 Return to debug level 126. 57 Return to debug level 125. 58 Return to debug level 124. 59 Return to debug level 123. 60 Return to debug level 122. 61 Return to debug level 121. 62 Return to debug level 120. 63 Return to debug level 119. 64 Return to debug level 118. 65 Return to debug level 117. 66 Return to debug level 116. 67 Return to debug level 115. 68 Return to debug level 114. 69 Return to debug level 113. 70 Return to debug level 112. 71 Return to debug level 111. 72 Return to debug level 110. 73 Return to debug level 109. 74 Return to debug level 108. 75 Return to debug level 107. 76 Return to debug level 106. 77 Return to debug level 105. 78 Return to debug level 104. 79 Return to debug level 103. 80 Return to debug level 102. 81 Return to debug level 101. 82 Return to debug level 100. 83 Return to debug level 99. 84 Return to debug level 98. 85 Return to debug level 97. 86 Return to debug level 96. 87 Return to debug level 95. 88 Return to debug level 94. 89 Return to debug level 93. 90 Return to debug level 92. 91 Return to debug level 91. 92 Return to debug level 90. 93 Return to debug level 89. 94 Return to debug level 88. 95 Return to debug level 87. 96 Return to debug level 86. 97 Return to debug level 85. 98 Return to debug level 84. 99 Return to debug level 83. 100 Return to debug level 82. 101 Return to debug level 81. 102 Return to debug level 80. 103 Return to debug level 79. 104 Return to debug level 78. 105 Return to debug level 77. 106 Return to debug level 76. 107 Return to debug level 75. 108 Return to debug level 74. 109 Return to debug level 73. 110 Return to debug level 72. 111 Return to debug level 71. 112 Return to debug level 70. 113 Return to debug level 69. 114 Return to debug level 68. 115 Return to debug level 67. 116 Return to debug level 66. 117 Return to debug level 65. 118 Return to debug level 64. 119 Return to debug level 63. 120 Return to debug level 62. 121 Return to debug level 61. 122 Return to debug level 60. 123 Return to debug level 59. 124 Return to debug level 58. 125 Return to debug level 57. 126 Return to debug level 56. 127 Return to debug level 55. 128 Return to debug level 54. 129 Return to debug level 53. 130 Return to debug level 52. 131 Return to debug level 51. 132 Return to debug level 50. 133 Return to debug level 49. 134 Return to debug level 48. 135 Return to debug level 47. 136 Return to debug level 46. 137 Return to debug level 45. 138 Return to debug level 44. 139 Return to debug level 43. 140 Return to debug level 42. 141 Return to debug level 41. 142 Return to debug level 40. 143 Return to debug level 39. 144 Return to debug level 38. 145 Return to debug level 37. 146 Return to debug level 36. 147 Return to debug level 35. 148 Return to debug level 34. 149 Return to debug level 33. 150 Return to debug level 32. 151 Return to debug level 31. 152 Return to debug level 30. 153 Return to debug level 29. 154 Return to debug level 28. 155 Return to debug level 27. 156 Return to debug level 26. 157 Return to debug level 25. 158 Return to debug level 24. 159 Return to debug level 23. 160 Return to debug level 22. 161 Return to debug level 21. 162 Return to debug level 20. 163 Return to debug level 19. 164 Return to debug level 18. 165 Return to debug level 17. 166 Return to debug level 16. 167 Return to debug level 15. 168 Return to debug level 14. 169 Return to debug level 13. 170 Return to debug level 12. 171 Return to debug level 11. 172 Return to debug level 10. 173 Return to debug level 9. 174 Return to debug level 8. 175 Return to debug level 7. 176 Return to debug level 6. 177 Return to debug level 5. 178 Return to debug level 4. 179 Return to debug level 3. 180 Return to debug level 2. 181 Return to debug level 1. 182 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 182. 2 Return to debug level 181. 3 Return to debug level 180. 4 Return to debug level 179. 5 Return to debug level 178. 6 Return to debug level 177. 7 Return to debug level 176. 8 Return to debug level 175. 9 Return to debug level 174. 10 Return to debug level 173. 11 Return to debug level 172. 12 Return to debug level 171. 13 Return to debug level 170. 14 Return to debug level 169. 15 Return to debug level 168. 16 Return to debug level 167. 17 Return to debug level 166. 18 Return to debug level 165. 19 Return to debug level 164. 20 Return to debug level 163. 21 Return to debug level 162. 22 Return to debug level 161. 23 Return to debug level 160. 24 Return to debug level 159. 25 Return to debug level 158. 26 Return to debug level 157. 27 Return to debug level 156. 28 Return to debug level 155. 29 Return to debug level 154. 30 Return to debug level 153. 31 Return to debug level 152. 32 Return to debug level 151. 33 Return to debug level 150. 34 Return to debug level 149. 35 Return to debug level 148. 36 Return to debug level 147. 37 Return to debug level 146. 38 Return to debug level 145. 39 Return to debug level 144. 40 Return to debug level 143. 41 Return to debug level 142. 42 Return to debug level 141. 43 Return to debug level 140. 44 Return to debug level 139. 45 Return to debug level 138. 46 Return to debug level 137. 47 Return to debug level 136. 48 Return to debug level 135. 49 Return to debug level 134. 50 Return to debug level 133. 51 Return to debug level 132. 52 Return to debug level 131. 53 Return to debug level 130. 54 Return to debug level 129. 55 Return to debug level 128. 56 Return to debug level 127. 57 Return to debug level 126. 58 Return to debug level 125. 59 Return to debug level 124. 60 Return to debug level 123. 61 Return to debug level 122. 62 Return to debug level 121. 63 Return to debug level 120. 64 Return to debug level 119. 65 Return to debug level 118. 66 Return to debug level 117. 67 Return to debug level 116. 68 Return to debug level 115. 69 Return to debug level 114. 70 Return to debug level 113. 71 Return to debug level 112. 72 Return to debug level 111. 73 Return to debug level 110. 74 Return to debug level 109. 75 Return to debug level 108. 76 Return to debug level 107. 77 Return to debug level 106. 78 Return to debug level 105. 79 Return to debug level 104. 80 Return to debug level 103. 81 Return to debug level 102. 82 Return to debug level 101. 83 Return to debug level 100. 84 Return to debug level 99. 85 Return to debug level 98. 86 Return to debug level 97. 87 Return to debug level 96. 88 Return to debug level 95. 89 Return to debug level 94. 90 Return to debug level 93. 91 Return to debug level 92. 92 Return to debug level 91. 93 Return to debug level 90. 94 Return to debug level 89. 95 Return to debug level 88. 96 Return to debug level 87. 97 Return to debug level 86. 98 Return to debug level 85. 99 Return to debug level 84. 100 Return to debug level 83. 101 Return to debug level 82. 102 Return to debug level 81. 103 Return to debug level 80. 104 Return to debug level 79. 105 Return to debug level 78. 106 Return to debug level 77. 107 Return to debug level 76. 108 Return to debug level 75. 109 Return to debug level 74. 110 Return to debug level 73. 111 Return to debug level 72. 112 Return to debug level 71. 113 Return to debug level 70. 114 Return to debug level 69. 115 Return to debug level 68. 116 Return to debug level 67. 117 Return to debug level 66. 118 Return to debug level 65. 119 Return to debug level 64. 120 Return to debug level 63. 121 Return to debug level 62. 122 Return to debug level 61. 123 Return to debug level 60. 124 Return to debug level 59. 125 Return to debug level 58. 126 Return to debug level 57. 127 Return to debug level 56. 128 Return to debug level 55. 129 Return to debug level 54. 130 Return to debug level 53. 131 Return to debug level 52. 132 Return to debug level 51. 133 Return to debug level 50. 134 Return to debug level 49. 135 Return to debug level 48. 136 Return to debug level 47. 137 Return to debug level 46. 138 Return to debug level 45. 139 Return to debug level 44. 140 Return to debug level 43. 141 Return to debug level 42. 142 Return to debug level 41. 143 Return to debug level 40. 144 Return to debug level 39. 145 Return to debug level 38. 146 Return to debug level 37. 147 Return to debug level 36. 148 Return to debug level 35. 149 Return to debug level 34. 150 Return to debug level 33. 151 Return to debug level 32. 152 Return to debug level 31. 153 Return to debug level 30. 154 Return to debug level 29. 155 Return to debug level 28. 156 Return to debug level 27. 157 Return to debug level 26. 158 Return to debug level 25. 159 Return to debug level 24. 160 Return to debug level 23. 161 Return to debug level 22. 162 Return to debug level 21. 163 Return to debug level 20. 164 Return to debug level 19. 165 Return to debug level 18. 166 Return to debug level 17. 167 Return to debug level 16. 168 Return to debug level 15. 169 Return to debug level 14. 170 Return to debug level 13. 171 Return to debug level 12. 172 Return to debug level 11. 173 Return to debug level 10. 174 Return to debug level 9. 175 Return to debug level 8. 176 Return to debug level 7. 177 Return to debug level 6. 178 Return to debug level 5. 179 Return to debug level 4. 180 Return to debug level 3. 181 Return to debug level 2. 182 Return to debug level 1. 183 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 183. 2 Return to debug level 182. 3 Return to debug level 181. 4 Return to debug level 180. 5 Return to debug level 179. 6 Return to debug level 178. 7 Return to debug level 177. 8 Return to debug level 176. 9 Return to debug level 175. 10 Return to debug level 174. 11 Return to debug level 173. 12 Return to debug level 172. 13 Return to debug level 171. 14 Return to debug level 170. 15 Return to debug level 169. 16 Return to debug level 168. 17 Return to debug level 167. 18 Return to debug level 166. 19 Return to debug level 165. 20 Return to debug level 164. 21 Return to debug level 163. 22 Return to debug level 162. 23 Return to debug level 161. 24 Return to debug level 160. 25 Return to debug level 159. 26 Return to debug level 158. 27 Return to debug level 157. 28 Return to debug level 156. 29 Return to debug level 155. 30 Return to debug level 154. 31 Return to debug level 153. 32 Return to debug level 152. 33 Return to debug level 151. 34 Return to debug level 150. 35 Return to debug level 149. 36 Return to debug level 148. 37 Return to debug level 147. 38 Return to debug level 146. 39 Return to debug level 145. 40 Return to debug level 144. 41 Return to debug level 143. 42 Return to debug level 142. 43 Return to debug level 141. 44 Return to debug level 140. 45 Return to debug level 139. 46 Return to debug level 138. 47 Return to debug level 137. 48 Return to debug level 136. 49 Return to debug level 135. 50 Return to debug level 134. 51 Return to debug level 133. 52 Return to debug level 132. 53 Return to debug level 131. 54 Return to debug level 130. 55 Return to debug level 129. 56 Return to debug level 128. 57 Return to debug level 127. 58 Return to debug level 126. 59 Return to debug level 125. 60 Return to debug level 124. 61 Return to debug level 123. 62 Return to debug level 122. 63 Return to debug level 121. 64 Return to debug level 120. 65 Return to debug level 119. 66 Return to debug level 118. 67 Return to debug level 117. 68 Return to debug level 116. 69 Return to debug level 115. 70 Return to debug level 114. 71 Return to debug level 113. 72 Return to debug level 112. 73 Return to debug level 111. 74 Return to debug level 110. 75 Return to debug level 109. 76 Return to debug level 108. 77 Return to debug level 107. 78 Return to debug level 106. 79 Return to debug level 105. 80 Return to debug level 104. 81 Return to debug level 103. 82 Return to debug level 102. 83 Return to debug level 101. 84 Return to debug level 100. 85 Return to debug level 99. 86 Return to debug level 98. 87 Return to debug level 97. 88 Return to debug level 96. 89 Return to debug level 95. 90 Return to debug level 94. 91 Return to debug level 93. 92 Return to debug level 92. 93 Return to debug level 91. 94 Return to debug level 90. 95 Return to debug level 89. 96 Return to debug level 88. 97 Return to debug level 87. 98 Return to debug level 86. 99 Return to debug level 85. 100 Return to debug level 84. 101 Return to debug level 83. 102 Return to debug level 82. 103 Return to debug level 81. 104 Return to debug level 80. 105 Return to debug level 79. 106 Return to debug level 78. 107 Return to debug level 77. 108 Return to debug level 76. 109 Return to debug level 75. 110 Return to debug level 74. 111 Return to debug level 73. 112 Return to debug level 72. 113 Return to debug level 71. 114 Return to debug level 70. 115 Return to debug level 69. 116 Return to debug level 68. 117 Return to debug level 67. 118 Return to debug level 66. 119 Return to debug level 65. 120 Return to debug level 64. 121 Return to debug level 63. 122 Return to debug level 62. 123 Return to debug level 61. 124 Return to debug level 60. 125 Return to debug level 59. 126 Return to debug level 58. 127 Return to debug level 57. 128 Return to debug level 56. 129 Return to debug level 55. 130 Return to debug level 54. 131 Return to debug level 53. 132 Return to debug level 52. 133 Return to debug level 51. 134 Return to debug level 50. 135 Return to debug level 49. 136 Return to debug level 48. 137 Return to debug level 47. 138 Return to debug level 46. 139 Return to debug level 45. 140 Return to debug level 44. 141 Return to debug level 43. 142 Return to debug level 42. 143 Return to debug level 41. 144 Return to debug level 40. 145 Return to debug level 39. 146 Return to debug level 38. 147 Return to debug level 37. 148 Return to debug level 36. 149 Return to debug level 35. 150 Return to debug level 34. 151 Return to debug level 33. 152 Return to debug level 32. 153 Return to debug level 31. 154 Return to debug level 30. 155 Return to debug level 29. 156 Return to debug level 28. 157 Return to debug level 27. 158 Return to debug level 26. 159 Return to debug level 25. 160 Return to debug level 24. 161 Return to debug level 23. 162 Return to debug level 22. 163 Return to debug level 21. 164 Return to debug level 20. 165 Return to debug level 19. 166 Return to debug level 18. 167 Return to debug level 17. 168 Return to debug level 16. 169 Return to debug level 15. 170 Return to debug level 14. 171 Return to debug level 13. 172 Return to debug level 12. 173 Return to debug level 11. 174 Return to debug level 10. 175 Return to debug level 9. 176 Return to debug level 8. 177 Return to debug level 7. 178 Return to debug level 6. 179 Return to debug level 5. 180 Return to debug level 4. 181 Return to debug level 3. 182 Return to debug level 2. 183 Return to debug level 1. 184 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 184. 2 Return to debug level 183. 3 Return to debug level 182. 4 Return to debug level 181. 5 Return to debug level 180. 6 Return to debug level 179. 7 Return to debug level 178. 8 Return to debug level 177. 9 Return to debug level 176. 10 Return to debug level 175. 11 Return to debug level 174. 12 Return to debug level 173. 13 Return to debug level 172. 14 Return to debug level 171. 15 Return to debug level 170. 16 Return to debug level 169. 17 Return to debug level 168. 18 Return to debug level 167. 19 Return to debug level 166. 20 Return to debug level 165. 21 Return to debug level 164. 22 Return to debug level 163. 23 Return to debug level 162. 24 Return to debug level 161. 25 Return to debug level 160. 26 Return to debug level 159. 27 Return to debug level 158. 28 Return to debug level 157. 29 Return to debug level 156. 30 Return to debug level 155. 31 Return to debug level 154. 32 Return to debug level 153. 33 Return to debug level 152. 34 Return to debug level 151. 35 Return to debug level 150. 36 Return to debug level 149. 37 Return to debug level 148. 38 Return to debug level 147. 39 Return to debug level 146. 40 Return to debug level 145. 41 Return to debug level 144. 42 Return to debug level 143. 43 Return to debug level 142. 44 Return to debug level 141. 45 Return to debug level 140. 46 Return to debug level 139. 47 Return to debug level 138. 48 Return to debug level 137. 49 Return to debug level 136. 50 Return to debug level 135. 51 Return to debug level 134. 52 Return to debug level 133. 53 Return to debug level 132. 54 Return to debug level 131. 55 Return to debug level 130. 56 Return to debug level 129. 57 Return to debug level 128. 58 Return to debug level 127. 59 Return to debug level 126. 60 Return to debug level 125. 61 Return to debug level 124. 62 Return to debug level 123. 63 Return to debug level 122. 64 Return to debug level 121. 65 Return to debug level 120. 66 Return to debug level 119. 67 Return to debug level 118. 68 Return to debug level 117. 69 Return to debug level 116. 70 Return to debug level 115. 71 Return to debug level 114. 72 Return to debug level 113. 73 Return to debug level 112. 74 Return to debug level 111. 75 Return to debug level 110. 76 Return to debug level 109. 77 Return to debug level 108. 78 Return to debug level 107. 79 Return to debug level 106. 80 Return to debug level 105. 81 Return to debug level 104. 82 Return to debug level 103. 83 Return to debug level 102. 84 Return to debug level 101. 85 Return to debug level 100. 86 Return to debug level 99. 87 Return to debug level 98. 88 Return to debug level 97. 89 Return to debug level 96. 90 Return to debug level 95. 91 Return to debug level 94. 92 Return to debug level 93. 93 Return to debug level 92. 94 Return to debug level 91. 95 Return to debug level 90. 96 Return to debug level 89. 97 Return to debug level 88. 98 Return to debug level 87. 99 Return to debug level 86. 100 Return to debug level 85. 101 Return to debug level 84. 102 Return to debug level 83. 103 Return to debug level 82. 104 Return to debug level 81. 105 Return to debug level 80. 106 Return to debug level 79. 107 Return to debug level 78. 108 Return to debug level 77. 109 Return to debug level 76. 110 Return to debug level 75. 111 Return to debug level 74. 112 Return to debug level 73. 113 Return to debug level 72. 114 Return to debug level 71. 115 Return to debug level 70. 116 Return to debug level 69. 117 Return to debug level 68. 118 Return to debug level 67. 119 Return to debug level 66. 120 Return to debug level 65. 121 Return to debug level 64. 122 Return to debug level 63. 123 Return to debug level 62. 124 Return to debug level 61. 125 Return to debug level 60. 126 Return to debug level 59. 127 Return to debug level 58. 128 Return to debug level 57. 129 Return to debug level 56. 130 Return to debug level 55. 131 Return to debug level 54. 132 Return to debug level 53. 133 Return to debug level 52. 134 Return to debug level 51. 135 Return to debug level 50. 136 Return to debug level 49. 137 Return to debug level 48. 138 Return to debug level 47. 139 Return to debug level 46. 140 Return to debug level 45. 141 Return to debug level 44. 142 Return to debug level 43. 143 Return to debug level 42. 144 Return to debug level 41. 145 Return to debug level 40. 146 Return to debug level 39. 147 Return to debug level 38. 148 Return to debug level 37. 149 Return to debug level 36. 150 Return to debug level 35. 151 Return to debug level 34. 152 Return to debug level 33. 153 Return to debug level 32. 154 Return to debug level 31. 155 Return to debug level 30. 156 Return to debug level 29. 157 Return to debug level 28. 158 Return to debug level 27. 159 Return to debug level 26. 160 Return to debug level 25. 161 Return to debug level 24. 162 Return to debug level 23. 163 Return to debug level 22. 164 Return to debug level 21. 165 Return to debug level 20. 166 Return to debug level 19. 167 Return to debug level 18. 168 Return to debug level 17. 169 Return to debug level 16. 170 Return to debug level 15. 171 Return to debug level 14. 172 Return to debug level 13. 173 Return to debug level 12. 174 Return to debug level 11. 175 Return to debug level 10. 176 Return to debug level 9. 177 Return to debug level 8. 178 Return to debug level 7. 179 Return to debug level 6. 180 Return to debug level 5. 181 Return to debug level 4. 182 Return to debug level 3. 183 Return to debug level 2. 184 Return to debug level 1. 185 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 185. 2 Return to debug level 184. 3 Return to debug level 183. 4 Return to debug level 182. 5 Return to debug level 181. 6 Return to debug level 180. 7 Return to debug level 179. 8 Return to debug level 178. 9 Return to debug level 177. 10 Return to debug level 176. 11 Return to debug level 175. 12 Return to debug level 174. 13 Return to debug level 173. 14 Return to debug level 172. 15 Return to debug level 171. 16 Return to debug level 170. 17 Return to debug level 169. 18 Return to debug level 168. 19 Return to debug level 167. 20 Return to debug level 166. 21 Return to debug level 165. 22 Return to debug level 164. 23 Return to debug level 163. 24 Return to debug level 162. 25 Return to debug level 161. 26 Return to debug level 160. 27 Return to debug level 159. 28 Return to debug level 158. 29 Return to debug level 157. 30 Return to debug level 156. 31 Return to debug level 155. 32 Return to debug level 154. 33 Return to debug level 153. 34 Return to debug level 152. 35 Return to debug level 151. 36 Return to debug level 150. 37 Return to debug level 149. 38 Return to debug level 148. 39 Return to debug level 147. 40 Return to debug level 146. 41 Return to debug level 145. 42 Return to debug level 144. 43 Return to debug level 143. 44 Return to debug level 142. 45 Return to debug level 141. 46 Return to debug level 140. 47 Return to debug level 139. 48 Return to debug level 138. 49 Return to debug level 137. 50 Return to debug level 136. 51 Return to debug level 135. 52 Return to debug level 134. 53 Return to debug level 133. 54 Return to debug level 132. 55 Return to debug level 131. 56 Return to debug level 130. 57 Return to debug level 129. 58 Return to debug level 128. 59 Return to debug level 127. 60 Return to debug level 126. 61 Return to debug level 125. 62 Return to debug level 124. 63 Return to debug level 123. 64 Return to debug level 122. 65 Return to debug level 121. 66 Return to debug level 120. 67 Return to debug level 119. 68 Return to debug level 118. 69 Return to debug level 117. 70 Return to debug level 116. 71 Return to debug level 115. 72 Return to debug level 114. 73 Return to debug level 113. 74 Return to debug level 112. 75 Return to debug level 111. 76 Return to debug level 110. 77 Return to debug level 109. 78 Return to debug level 108. 79 Return to debug level 107. 80 Return to debug level 106. 81 Return to debug level 105. 82 Return to debug level 104. 83 Return to debug level 103. 84 Return to debug level 102. 85 Return to debug level 101. 86 Return to debug level 100. 87 Return to debug level 99. 88 Return to debug level 98. 89 Return to debug level 97. 90 Return to debug level 96. 91 Return to debug level 95. 92 Return to debug level 94. 93 Return to debug level 93. 94 Return to debug level 92. 95 Return to debug level 91. 96 Return to debug level 90. 97 Return to debug level 89. 98 Return to debug level 88. 99 Return to debug level 87. 100 Return to debug level 86. 101 Return to debug level 85. 102 Return to debug level 84. 103 Return to debug level 83. 104 Return to debug level 82. 105 Return to debug level 81. 106 Return to debug level 80. 107 Return to debug level 79. 108 Return to debug level 78. 109 Return to debug level 77. 110 Return to debug level 76. 111 Return to debug level 75. 112 Return to debug level 74. 113 Return to debug level 73. 114 Return to debug level 72. 115 Return to debug level 71. 116 Return to debug level 70. 117 Return to debug level 69. 118 Return to debug level 68. 119 Return to debug level 67. 120 Return to debug level 66. 121 Return to debug level 65. 122 Return to debug level 64. 123 Return to debug level 63. 124 Return to debug level 62. 125 Return to debug level 61. 126 Return to debug level 60. 127 Return to debug level 59. 128 Return to debug level 58. 129 Return to debug level 57. 130 Return to debug level 56. 131 Return to debug level 55. 132 Return to debug level 54. 133 Return to debug level 53. 134 Return to debug level 52. 135 Return to debug level 51. 136 Return to debug level 50. 137 Return to debug level 49. 138 Return to debug level 48. 139 Return to debug level 47. 140 Return to debug level 46. 141 Return to debug level 45. 142 Return to debug level 44. 143 Return to debug level 43. 144 Return to debug level 42. 145 Return to debug level 41. 146 Return to debug level 40. 147 Return to debug level 39. 148 Return to debug level 38. 149 Return to debug level 37. 150 Return to debug level 36. 151 Return to debug level 35. 152 Return to debug level 34. 153 Return to debug level 33. 154 Return to debug level 32. 155 Return to debug level 31. 156 Return to debug level 30. 157 Return to debug level 29. 158 Return to debug level 28. 159 Return to debug level 27. 160 Return to debug level 26. 161 Return to debug level 25. 162 Return to debug level 24. 163 Return to debug level 23. 164 Return to debug level 22. 165 Return to debug level 21. 166 Return to debug level 20. 167 Return to debug level 19. 168 Return to debug level 18. 169 Return to debug level 17. 170 Return to debug level 16. 171 Return to debug level 15. 172 Return to debug level 14. 173 Return to debug level 13. 174 Return to debug level 12. 175 Return to debug level 11. 176 Return to debug level 10. 177 Return to debug level 9. 178 Return to debug level 8. 179 Return to debug level 7. 180 Return to debug level 6. 181 Return to debug level 5. 182 Return to debug level 4. 183 Return to debug level 3. 184 Return to debug level 2. 185 Return to debug level 1. 186 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 186. 2 Return to debug level 185. 3 Return to debug level 184. 4 Return to debug level 183. 5 Return to debug level 182. 6 Return to debug level 181. 7 Return to debug level 180. 8 Return to debug level 179. 9 Return to debug level 178. 10 Return to debug level 177. 11 Return to debug level 176. 12 Return to debug level 175. 13 Return to debug level 174. 14 Return to debug level 173. 15 Return to debug level 172. 16 Return to debug level 171. 17 Return to debug level 170. 18 Return to debug level 169. 19 Return to debug level 168. 20 Return to debug level 167. 21 Return to debug level 166. 22 Return to debug level 165. 23 Return to debug level 164. 24 Return to debug level 163. 25 Return to debug level 162. 26 Return to debug level 161. 27 Return to debug level 160. 28 Return to debug level 159. 29 Return to debug level 158. 30 Return to debug level 157. 31 Return to debug level 156. 32 Return to debug level 155. 33 Return to debug level 154. 34 Return to debug level 153. 35 Return to debug level 152. 36 Return to debug level 151. 37 Return to debug level 150. 38 Return to debug level 149. 39 Return to debug level 148. 40 Return to debug level 147. 41 Return to debug level 146. 42 Return to debug level 145. 43 Return to debug level 144. 44 Return to debug level 143. 45 Return to debug level 142. 46 Return to debug level 141. 47 Return to debug level 140. 48 Return to debug level 139. 49 Return to debug level 138. 50 Return to debug level 137. 51 Return to debug level 136. 52 Return to debug level 135. 53 Return to debug level 134. 54 Return to debug level 133. 55 Return to debug level 132. 56 Return to debug level 131. 57 Return to debug level 130. 58 Return to debug level 129. 59 Return to debug level 128. 60 Return to debug level 127. 61 Return to debug level 126. 62 Return to debug level 125. 63 Return to debug level 124. 64 Return to debug level 123. 65 Return to debug level 122. 66 Return to debug level 121. 67 Return to debug level 120. 68 Return to debug level 119. 69 Return to debug level 118. 70 Return to debug level 117. 71 Return to debug level 116. 72 Return to debug level 115. 73 Return to debug level 114. 74 Return to debug level 113. 75 Return to debug level 112. 76 Return to debug level 111. 77 Return to debug level 110. 78 Return to debug level 109. 79 Return to debug level 108. 80 Return to debug level 107. 81 Return to debug level 106. 82 Return to debug level 105. 83 Return to debug level 104. 84 Return to debug level 103. 85 Return to debug level 102. 86 Return to debug level 101. 87 Return to debug level 100. 88 Return to debug level 99. 89 Return to debug level 98. 90 Return to debug level 97. 91 Return to debug level 96. 92 Return to debug level 95. 93 Return to debug level 94. 94 Return to debug level 93. 95 Return to debug level 92. 96 Return to debug level 91. 97 Return to debug level 90. 98 Return to debug level 89. 99 Return to debug level 88. 100 Return to debug level 87. 101 Return to debug level 86. 102 Return to debug level 85. 103 Return to debug level 84. 104 Return to debug level 83. 105 Return to debug level 82. 106 Return to debug level 81. 107 Return to debug level 80. 108 Return to debug level 79. 109 Return to debug level 78. 110 Return to debug level 77. 111 Return to debug level 76. 112 Return to debug level 75. 113 Return to debug level 74. 114 Return to debug level 73. 115 Return to debug level 72. 116 Return to debug level 71. 117 Return to debug level 70. 118 Return to debug level 69. 119 Return to debug level 68. 120 Return to debug level 67. 121 Return to debug level 66. 122 Return to debug level 65. 123 Return to debug level 64. 124 Return to debug level 63. 125 Return to debug level 62. 126 Return to debug level 61. 127 Return to debug level 60. 128 Return to debug level 59. 129 Return to debug level 58. 130 Return to debug level 57. 131 Return to debug level 56. 132 Return to debug level 55. 133 Return to debug level 54. 134 Return to debug level 53. 135 Return to debug level 52. 136 Return to debug level 51. 137 Return to debug level 50. 138 Return to debug level 49. 139 Return to debug level 48. 140 Return to debug level 47. 141 Return to debug level 46. 142 Return to debug level 45. 143 Return to debug level 44. 144 Return to debug level 43. 145 Return to debug level 42. 146 Return to debug level 41. 147 Return to debug level 40. 148 Return to debug level 39. 149 Return to debug level 38. 150 Return to debug level 37. 151 Return to debug level 36. 152 Return to debug level 35. 153 Return to debug level 34. 154 Return to debug level 33. 155 Return to debug level 32. 156 Return to debug level 31. 157 Return to debug level 30. 158 Return to debug level 29. 159 Return to debug level 28. 160 Return to debug level 27. 161 Return to debug level 26. 162 Return to debug level 25. 163 Return to debug level 24. 164 Return to debug level 23. 165 Return to debug level 22. 166 Return to debug level 21. 167 Return to debug level 20. 168 Return to debug level 19. 169 Return to debug level 18. 170 Return to debug level 17. 171 Return to debug level 16. 172 Return to debug level 15. 173 Return to debug level 14. 174 Return to debug level 13. 175 Return to debug level 12. 176 Return to debug level 11. 177 Return to debug level 10. 178 Return to debug level 9. 179 Return to debug level 8. 180 Return to debug level 7. 181 Return to debug level 6. 182 Return to debug level 5. 183 Return to debug level 4. 184 Return to debug level 3. 185 Return to debug level 2. 186 Return to debug level 1. 187 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 187. 2 Return to debug level 186. 3 Return to debug level 185. 4 Return to debug level 184. 5 Return to debug level 183. 6 Return to debug level 182. 7 Return to debug level 181. 8 Return to debug level 180. 9 Return to debug level 179. 10 Return to debug level 178. 11 Return to debug level 177. 12 Return to debug level 176. 13 Return to debug level 175. 14 Return to debug level 174. 15 Return to debug level 173. 16 Return to debug level 172. 17 Return to debug level 171. 18 Return to debug level 170. 19 Return to debug level 169. 20 Return to debug level 168. 21 Return to debug level 167. 22 Return to debug level 166. 23 Return to debug level 165. 24 Return to debug level 164. 25 Return to debug level 163. 26 Return to debug level 162. 27 Return to debug level 161. 28 Return to debug level 160. 29 Return to debug level 159. 30 Return to debug level 158. 31 Return to debug level 157. 32 Return to debug level 156. 33 Return to debug level 155. 34 Return to debug level 154. 35 Return to debug level 153. 36 Return to debug level 152. 37 Return to debug level 151. 38 Return to debug level 150. 39 Return to debug level 149. 40 Return to debug level 148. 41 Return to debug level 147. 42 Return to debug level 146. 43 Return to debug level 145. 44 Return to debug level 144. 45 Return to debug level 143. 46 Return to debug level 142. 47 Return to debug level 141. 48 Return to debug level 140. 49 Return to debug level 139. 50 Return to debug level 138. 51 Return to debug level 137. 52 Return to debug level 136. 53 Return to debug level 135. 54 Return to debug level 134. 55 Return to debug level 133. 56 Return to debug level 132. 57 Return to debug level 131. 58 Return to debug level 130. 59 Return to debug level 129. 60 Return to debug level 128. 61 Return to debug level 127. 62 Return to debug level 126. 63 Return to debug level 125. 64 Return to debug level 124. 65 Return to debug level 123. 66 Return to debug level 122. 67 Return to debug level 121. 68 Return to debug level 120. 69 Return to debug level 119. 70 Return to debug level 118. 71 Return to debug level 117. 72 Return to debug level 116. 73 Return to debug level 115. 74 Return to debug level 114. 75 Return to debug level 113. 76 Return to debug level 112. 77 Return to debug level 111. 78 Return to debug level 110. 79 Return to debug level 109. 80 Return to debug level 108. 81 Return to debug level 107. 82 Return to debug level 106. 83 Return to debug level 105. 84 Return to debug level 104. 85 Return to debug level 103. 86 Return to debug level 102. 87 Return to debug level 101. 88 Return to debug level 100. 89 Return to debug level 99. 90 Return to debug level 98. 91 Return to debug level 97. 92 Return to debug level 96. 93 Return to debug level 95. 94 Return to debug level 94. 95 Return to debug level 93. 96 Return to debug level 92. 97 Return to debug level 91. 98 Return to debug level 90. 99 Return to debug level 89. 100 Return to debug level 88. 101 Return to debug level 87. 102 Return to debug level 86. 103 Return to debug level 85. 104 Return to debug level 84. 105 Return to debug level 83. 106 Return to debug level 82. 107 Return to debug level 81. 108 Return to debug level 80. 109 Return to debug level 79. 110 Return to debug level 78. 111 Return to debug level 77. 112 Return to debug level 76. 113 Return to debug level 75. 114 Return to debug level 74. 115 Return to debug level 73. 116 Return to debug level 72. 117 Return to debug level 71. 118 Return to debug level 70. 119 Return to debug level 69. 120 Return to debug level 68. 121 Return to debug level 67. 122 Return to debug level 66. 123 Return to debug level 65. 124 Return to debug level 64. 125 Return to debug level 63. 126 Return to debug level 62. 127 Return to debug level 61. 128 Return to debug level 60. 129 Return to debug level 59. 130 Return to debug level 58. 131 Return to debug level 57. 132 Return to debug level 56. 133 Return to debug level 55. 134 Return to debug level 54. 135 Return to debug level 53. 136 Return to debug level 52. 137 Return to debug level 51. 138 Return to debug level 50. 139 Return to debug level 49. 140 Return to debug level 48. 141 Return to debug level 47. 142 Return to debug level 46. 143 Return to debug level 45. 144 Return to debug level 44. 145 Return to debug level 43. 146 Return to debug level 42. 147 Return to debug level 41. 148 Return to debug level 40. 149 Return to debug level 39. 150 Return to debug level 38. 151 Return to debug level 37. 152 Return to debug level 36. 153 Return to debug level 35. 154 Return to debug level 34. 155 Return to debug level 33. 156 Return to debug level 32. 157 Return to debug level 31. 158 Return to debug level 30. 159 Return to debug level 29. 160 Return to debug level 28. 161 Return to debug level 27. 162 Return to debug level 26. 163 Return to debug level 25. 164 Return to debug level 24. 165 Return to debug level 23. 166 Return to debug level 22. 167 Return to debug level 21. 168 Return to debug level 20. 169 Return to debug level 19. 170 Return to debug level 18. 171 Return to debug level 17. 172 Return to debug level 16. 173 Return to debug level 15. 174 Return to debug level 14. 175 Return to debug level 13. 176 Return to debug level 12. 177 Return to debug level 11. 178 Return to debug level 10. 179 Return to debug level 9. 180 Return to debug level 8. 181 Return to debug level 7. 182 Return to debug level 6. 183 Return to debug level 5. 184 Return to debug level 4. 185 Return to debug level 3. 186 Return to debug level 2. 187 Return to debug level 1. 188 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 188. 2 Return to debug level 187. 3 Return to debug level 186. 4 Return to debug level 185. 5 Return to debug level 184. 6 Return to debug level 183. 7 Return to debug level 182. 8 Return to debug level 181. 9 Return to debug level 180. 10 Return to debug level 179. 11 Return to debug level 178. 12 Return to debug level 177. 13 Return to debug level 176. 14 Return to debug level 175. 15 Return to debug level 174. 16 Return to debug level 173. 17 Return to debug level 172. 18 Return to debug level 171. 19 Return to debug level 170. 20 Return to debug level 169. 21 Return to debug level 168. 22 Return to debug level 167. 23 Return to debug level 166. 24 Return to debug level 165. 25 Return to debug level 164. 26 Return to debug level 163. 27 Return to debug level 162. 28 Return to debug level 161. 29 Return to debug level 160. 30 Return to debug level 159. 31 Return to debug level 158. 32 Return to debug level 157. 33 Return to debug level 156. 34 Return to debug level 155. 35 Return to debug level 154. 36 Return to debug level 153. 37 Return to debug level 152. 38 Return to debug level 151. 39 Return to debug level 150. 40 Return to debug level 149. 41 Return to debug level 148. 42 Return to debug level 147. 43 Return to debug level 146. 44 Return to debug level 145. 45 Return to debug level 144. 46 Return to debug level 143. 47 Return to debug level 142. 48 Return to debug level 141. 49 Return to debug level 140. 50 Return to debug level 139. 51 Return to debug level 138. 52 Return to debug level 137. 53 Return to debug level 136. 54 Return to debug level 135. 55 Return to debug level 134. 56 Return to debug level 133. 57 Return to debug level 132. 58 Return to debug level 131. 59 Return to debug level 130. 60 Return to debug level 129. 61 Return to debug level 128. 62 Return to debug level 127. 63 Return to debug level 126. 64 Return to debug level 125. 65 Return to debug level 124. 66 Return to debug level 123. 67 Return to debug level 122. 68 Return to debug level 121. 69 Return to debug level 120. 70 Return to debug level 119. 71 Return to debug level 118. 72 Return to debug level 117. 73 Return to debug level 116. 74 Return to debug level 115. 75 Return to debug level 114. 76 Return to debug level 113. 77 Return to debug level 112. 78 Return to debug level 111. 79 Return to debug level 110. 80 Return to debug level 109. 81 Return to debug level 108. 82 Return to debug level 107. 83 Return to debug level 106. 84 Return to debug level 105. 85 Return to debug level 104. 86 Return to debug level 103. 87 Return to debug level 102. 88 Return to debug level 101. 89 Return to debug level 100. 90 Return to debug level 99. 91 Return to debug level 98. 92 Return to debug level 97. 93 Return to debug level 96. 94 Return to debug level 95. 95 Return to debug level 94. 96 Return to debug level 93. 97 Return to debug level 92. 98 Return to debug level 91. 99 Return to debug level 90. 100 Return to debug level 89. 101 Return to debug level 88. 102 Return to debug level 87. 103 Return to debug level 86. 104 Return to debug level 85. 105 Return to debug level 84. 106 Return to debug level 83. 107 Return to debug level 82. 108 Return to debug level 81. 109 Return to debug level 80. 110 Return to debug level 79. 111 Return to debug level 78. 112 Return to debug level 77. 113 Return to debug level 76. 114 Return to debug level 75. 115 Return to debug level 74. 116 Return to debug level 73. 117 Return to debug level 72. 118 Return to debug level 71. 119 Return to debug level 70. 120 Return to debug level 69. 121 Return to debug level 68. 122 Return to debug level 67. 123 Return to debug level 66. 124 Return to debug level 65. 125 Return to debug level 64. 126 Return to debug level 63. 127 Return to debug level 62. 128 Return to debug level 61. 129 Return to debug level 60. 130 Return to debug level 59. 131 Return to debug level 58. 132 Return to debug level 57. 133 Return to debug level 56. 134 Return to debug level 55. 135 Return to debug level 54. 136 Return to debug level 53. 137 Return to debug level 52. 138 Return to debug level 51. 139 Return to debug level 50. 140 Return to debug level 49. 141 Return to debug level 48. 142 Return to debug level 47. 143 Return to debug level 46. 144 Return to debug level 45. 145 Return to debug level 44. 146 Return to debug level 43. 147 Return to debug level 42. 148 Return to debug level 41. 149 Return to debug level 40. 150 Return to debug level 39. 151 Return to debug level 38. 152 Return to debug level 37. 153 Return to debug level 36. 154 Return to debug level 35. 155 Return to debug level 34. 156 Return to debug level 33. 157 Return to debug level 32. 158 Return to debug level 31. 159 Return to debug level 30. 160 Return to debug level 29. 161 Return to debug level 28. 162 Return to debug level 27. 163 Return to debug level 26. 164 Return to debug level 25. 165 Return to debug level 24. 166 Return to debug level 23. 167 Return to debug level 22. 168 Return to debug level 21. 169 Return to debug level 20. 170 Return to debug level 19. 171 Return to debug level 18. 172 Return to debug level 17. 173 Return to debug level 16. 174 Return to debug level 15. 175 Return to debug level 14. 176 Return to debug level 13. 177 Return to debug level 12. 178 Return to debug level 11. 179 Return to debug level 10. 180 Return to debug level 9. 181 Return to debug level 8. 182 Return to debug level 7. 183 Return to debug level 6. 184 Return to debug level 5. 185 Return to debug level 4. 186 Return to debug level 3. 187 Return to debug level 2. 188 Return to debug level 1. 189 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 189. 2 Return to debug level 188. 3 Return to debug level 187. 4 Return to debug level 186. 5 Return to debug level 185. 6 Return to debug level 184. 7 Return to debug level 183. 8 Return to debug level 182. 9 Return to debug level 181. 10 Return to debug level 180. 11 Return to debug level 179. 12 Return to debug level 178. 13 Return to debug level 177. 14 Return to debug level 176. 15 Return to debug level 175. 16 Return to debug level 174. 17 Return to debug level 173. 18 Return to debug level 172. 19 Return to debug level 171. 20 Return to debug level 170. 21 Return to debug level 169. 22 Return to debug level 168. 23 Return to debug level 167. 24 Return to debug level 166. 25 Return to debug level 165. 26 Return to debug level 164. 27 Return to debug level 163. 28 Return to debug level 162. 29 Return to debug level 161. 30 Return to debug level 160. 31 Return to debug level 159. 32 Return to debug level 158. 33 Return to debug level 157. 34 Return to debug level 156. 35 Return to debug level 155. 36 Return to debug level 154. 37 Return to debug level 153. 38 Return to debug level 152. 39 Return to debug level 151. 40 Return to debug level 150. 41 Return to debug level 149. 42 Return to debug level 148. 43 Return to debug level 147. 44 Return to debug level 146. 45 Return to debug level 145. 46 Return to debug level 144. 47 Return to debug level 143. 48 Return to debug level 142. 49 Return to debug level 141. 50 Return to debug level 140. 51 Return to debug level 139. 52 Return to debug level 138. 53 Return to debug level 137. 54 Return to debug level 136. 55 Return to debug level 135. 56 Return to debug level 134. 57 Return to debug level 133. 58 Return to debug level 132. 59 Return to debug level 131. 60 Return to debug level 130. 61 Return to debug level 129. 62 Return to debug level 128. 63 Return to debug level 127. 64 Return to debug level 126. 65 Return to debug level 125. 66 Return to debug level 124. 67 Return to debug level 123. 68 Return to debug level 122. 69 Return to debug level 121. 70 Return to debug level 120. 71 Return to debug level 119. 72 Return to debug level 118. 73 Return to debug level 117. 74 Return to debug level 116. 75 Return to debug level 115. 76 Return to debug level 114. 77 Return to debug level 113. 78 Return to debug level 112. 79 Return to debug level 111. 80 Return to debug level 110. 81 Return to debug level 109. 82 Return to debug level 108. 83 Return to debug level 107. 84 Return to debug level 106. 85 Return to debug level 105. 86 Return to debug level 104. 87 Return to debug level 103. 88 Return to debug level 102. 89 Return to debug level 101. 90 Return to debug level 100. 91 Return to debug level 99. 92 Return to debug level 98. 93 Return to debug level 97. 94 Return to debug level 96. 95 Return to debug level 95. 96 Return to debug level 94. 97 Return to debug level 93. 98 Return to debug level 92. 99 Return to debug level 91. 100 Return to debug level 90. 101 Return to debug level 89. 102 Return to debug level 88. 103 Return to debug level 87. 104 Return to debug level 86. 105 Return to debug level 85. 106 Return to debug level 84. 107 Return to debug level 83. 108 Return to debug level 82. 109 Return to debug level 81. 110 Return to debug level 80. 111 Return to debug level 79. 112 Return to debug level 78. 113 Return to debug level 77. 114 Return to debug level 76. 115 Return to debug level 75. 116 Return to debug level 74. 117 Return to debug level 73. 118 Return to debug level 72. 119 Return to debug level 71. 120 Return to debug level 70. 121 Return to debug level 69. 122 Return to debug level 68. 123 Return to debug level 67. 124 Return to debug level 66. 125 Return to debug level 65. 126 Return to debug level 64. 127 Return to debug level 63. 128 Return to debug level 62. 129 Return to debug level 61. 130 Return to debug level 60. 131 Return to debug level 59. 132 Return to debug level 58. 133 Return to debug level 57. 134 Return to debug level 56. 135 Return to debug level 55. 136 Return to debug level 54. 137 Return to debug level 53. 138 Return to debug level 52. 139 Return to debug level 51. 140 Return to debug level 50. 141 Return to debug level 49. 142 Return to debug level 48. 143 Return to debug level 47. 144 Return to debug level 46. 145 Return to debug level 45. 146 Return to debug level 44. 147 Return to debug level 43. 148 Return to debug level 42. 149 Return to debug level 41. 150 Return to debug level 40. 151 Return to debug level 39. 152 Return to debug level 38. 153 Return to debug level 37. 154 Return to debug level 36. 155 Return to debug level 35. 156 Return to debug level 34. 157 Return to debug level 33. 158 Return to debug level 32. 159 Return to debug level 31. 160 Return to debug level 30. 161 Return to debug level 29. 162 Return to debug level 28. 163 Return to debug level 27. 164 Return to debug level 26. 165 Return to debug level 25. 166 Return to debug level 24. 167 Return to debug level 23. 168 Return to debug level 22. 169 Return to debug level 21. 170 Return to debug level 20. 171 Return to debug level 19. 172 Return to debug level 18. 173 Return to debug level 17. 174 Return to debug level 16. 175 Return to debug level 15. 176 Return to debug level 14. 177 Return to debug level 13. 178 Return to debug level 12. 179 Return to debug level 11. 180 Return to debug level 10. 181 Return to debug level 9. 182 Return to debug level 8. 183 Return to debug level 7. 184 Return to debug level 6. 185 Return to debug level 5. 186 Return to debug level 4. 187 Return to debug level 3. 188 Return to debug level 2. 189 Return to debug level 1. 190 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 190. 2 Return to debug level 189. 3 Return to debug level 188. 4 Return to debug level 187. 5 Return to debug level 186. 6 Return to debug level 185. 7 Return to debug level 184. 8 Return to debug level 183. 9 Return to debug level 182. 10 Return to debug level 181. 11 Return to debug level 180. 12 Return to debug level 179. 13 Return to debug level 178. 14 Return to debug level 177. 15 Return to debug level 176. 16 Return to debug level 175. 17 Return to debug level 174. 18 Return to debug level 173. 19 Return to debug level 172. 20 Return to debug level 171. 21 Return to debug level 170. 22 Return to debug level 169. 23 Return to debug level 168. 24 Return to debug level 167. 25 Return to debug level 166. 26 Return to debug level 165. 27 Return to debug level 164. 28 Return to debug level 163. 29 Return to debug level 162. 30 Return to debug level 161. 31 Return to debug level 160. 32 Return to debug level 159. 33 Return to debug level 158. 34 Return to debug level 157. 35 Return to debug level 156. 36 Return to debug level 155. 37 Return to debug level 154. 38 Return to debug level 153. 39 Return to debug level 152. 40 Return to debug level 151. 41 Return to debug level 150. 42 Return to debug level 149. 43 Return to debug level 148. 44 Return to debug level 147. 45 Return to debug level 146. 46 Return to debug level 145. 47 Return to debug level 144. 48 Return to debug level 143. 49 Return to debug level 142. 50 Return to debug level 141. 51 Return to debug level 140. 52 Return to debug level 139. 53 Return to debug level 138. 54 Return to debug level 137. 55 Return to debug level 136. 56 Return to debug level 135. 57 Return to debug level 134. 58 Return to debug level 133. 59 Return to debug level 132. 60 Return to debug level 131. 61 Return to debug level 130. 62 Return to debug level 129. 63 Return to debug level 128. 64 Return to debug level 127. 65 Return to debug level 126. 66 Return to debug level 125. 67 Return to debug level 124. 68 Return to debug level 123. 69 Return to debug level 122. 70 Return to debug level 121. 71 Return to debug level 120. 72 Return to debug level 119. 73 Return to debug level 118. 74 Return to debug level 117. 75 Return to debug level 116. 76 Return to debug level 115. 77 Return to debug level 114. 78 Return to debug level 113. 79 Return to debug level 112. 80 Return to debug level 111. 81 Return to debug level 110. 82 Return to debug level 109. 83 Return to debug level 108. 84 Return to debug level 107. 85 Return to debug level 106. 86 Return to debug level 105. 87 Return to debug level 104. 88 Return to debug level 103. 89 Return to debug level 102. 90 Return to debug level 101. 91 Return to debug level 100. 92 Return to debug level 99. 93 Return to debug level 98. 94 Return to debug level 97. 95 Return to debug level 96. 96 Return to debug level 95. 97 Return to debug level 94. 98 Return to debug level 93. 99 Return to debug level 92. 100 Return to debug level 91. 101 Return to debug level 90. 102 Return to debug level 89. 103 Return to debug level 88. 104 Return to debug level 87. 105 Return to debug level 86. 106 Return to debug level 85. 107 Return to debug level 84. 108 Return to debug level 83. 109 Return to debug level 82. 110 Return to debug level 81. 111 Return to debug level 80. 112 Return to debug level 79. 113 Return to debug level 78. 114 Return to debug level 77. 115 Return to debug level 76. 116 Return to debug level 75. 117 Return to debug level 74. 118 Return to debug level 73. 119 Return to debug level 72. 120 Return to debug level 71. 121 Return to debug level 70. 122 Return to debug level 69. 123 Return to debug level 68. 124 Return to debug level 67. 125 Return to debug level 66. 126 Return to debug level 65. 127 Return to debug level 64. 128 Return to debug level 63. 129 Return to debug level 62. 130 Return to debug level 61. 131 Return to debug level 60. 132 Return to debug level 59. 133 Return to debug level 58. 134 Return to debug level 57. 135 Return to debug level 56. 136 Return to debug level 55. 137 Return to debug level 54. 138 Return to debug level 53. 139 Return to debug level 52. 140 Return to debug level 51. 141 Return to debug level 50. 142 Return to debug level 49. 143 Return to debug level 48. 144 Return to debug level 47. 145 Return to debug level 46. 146 Return to debug level 45. 147 Return to debug level 44. 148 Return to debug level 43. 149 Return to debug level 42. 150 Return to debug level 41. 151 Return to debug level 40. 152 Return to debug level 39. 153 Return to debug level 38. 154 Return to debug level 37. 155 Return to debug level 36. 156 Return to debug level 35. 157 Return to debug level 34. 158 Return to debug level 33. 159 Return to debug level 32. 160 Return to debug level 31. 161 Return to debug level 30. 162 Return to debug level 29. 163 Return to debug level 28. 164 Return to debug level 27. 165 Return to debug level 26. 166 Return to debug level 25. 167 Return to debug level 24. 168 Return to debug level 23. 169 Return to debug level 22. 170 Return to debug level 21. 171 Return to debug level 20. 172 Return to debug level 19. 173 Return to debug level 18. 174 Return to debug level 17. 175 Return to debug level 16. 176 Return to debug level 15. 177 Return to debug level 14. 178 Return to debug level 13. 179 Return to debug level 12. 180 Return to debug level 11. 181 Return to debug level 10. 182 Return to debug level 9. 183 Return to debug level 8. 184 Return to debug level 7. 185 Return to debug level 6. 186 Return to debug level 5. 187 Return to debug level 4. 188 Return to debug level 3. 189 Return to debug level 2. 190 Return to debug level 1. 191 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 191. 2 Return to debug level 190. 3 Return to debug level 189. 4 Return to debug level 188. 5 Return to debug level 187. 6 Return to debug level 186. 7 Return to debug level 185. 8 Return to debug level 184. 9 Return to debug level 183. 10 Return to debug level 182. 11 Return to debug level 181. 12 Return to debug level 180. 13 Return to debug level 179. 14 Return to debug level 178. 15 Return to debug level 177. 16 Return to debug level 176. 17 Return to debug level 175. 18 Return to debug level 174. 19 Return to debug level 173. 20 Return to debug level 172. 21 Return to debug level 171. 22 Return to debug level 170. 23 Return to debug level 169. 24 Return to debug level 168. 25 Return to debug level 167. 26 Return to debug level 166. 27 Return to debug level 165. 28 Return to debug level 164. 29 Return to debug level 163. 30 Return to debug level 162. 31 Return to debug level 161. 32 Return to debug level 160. 33 Return to debug level 159. 34 Return to debug level 158. 35 Return to debug level 157. 36 Return to debug level 156. 37 Return to debug level 155. 38 Return to debug level 154. 39 Return to debug level 153. 40 Return to debug level 152. 41 Return to debug level 151. 42 Return to debug level 150. 43 Return to debug level 149. 44 Return to debug level 148. 45 Return to debug level 147. 46 Return to debug level 146. 47 Return to debug level 145. 48 Return to debug level 144. 49 Return to debug level 143. 50 Return to debug level 142. 51 Return to debug level 141. 52 Return to debug level 140. 53 Return to debug level 139. 54 Return to debug level 138. 55 Return to debug level 137. 56 Return to debug level 136. 57 Return to debug level 135. 58 Return to debug level 134. 59 Return to debug level 133. 60 Return to debug level 132. 61 Return to debug level 131. 62 Return to debug level 130. 63 Return to debug level 129. 64 Return to debug level 128. 65 Return to debug level 127. 66 Return to debug level 126. 67 Return to debug level 125. 68 Return to debug level 124. 69 Return to debug level 123. 70 Return to debug level 122. 71 Return to debug level 121. 72 Return to debug level 120. 73 Return to debug level 119. 74 Return to debug level 118. 75 Return to debug level 117. 76 Return to debug level 116. 77 Return to debug level 115. 78 Return to debug level 114. 79 Return to debug level 113. 80 Return to debug level 112. 81 Return to debug level 111. 82 Return to debug level 110. 83 Return to debug level 109. 84 Return to debug level 108. 85 Return to debug level 107. 86 Return to debug level 106. 87 Return to debug level 105. 88 Return to debug level 104. 89 Return to debug level 103. 90 Return to debug level 102. 91 Return to debug level 101. 92 Return to debug level 100. 93 Return to debug level 99. 94 Return to debug level 98. 95 Return to debug level 97. 96 Return to debug level 96. 97 Return to debug level 95. 98 Return to debug level 94. 99 Return to debug level 93. 100 Return to debug level 92. 101 Return to debug level 91. 102 Return to debug level 90. 103 Return to debug level 89. 104 Return to debug level 88. 105 Return to debug level 87. 106 Return to debug level 86. 107 Return to debug level 85. 108 Return to debug level 84. 109 Return to debug level 83. 110 Return to debug level 82. 111 Return to debug level 81. 112 Return to debug level 80. 113 Return to debug level 79. 114 Return to debug level 78. 115 Return to debug level 77. 116 Return to debug level 76. 117 Return to debug level 75. 118 Return to debug level 74. 119 Return to debug level 73. 120 Return to debug level 72. 121 Return to debug level 71. 122 Return to debug level 70. 123 Return to debug level 69. 124 Return to debug level 68. 125 Return to debug level 67. 126 Return to debug level 66. 127 Return to debug level 65. 128 Return to debug level 64. 129 Return to debug level 63. 130 Return to debug level 62. 131 Return to debug level 61. 132 Return to debug level 60. 133 Return to debug level 59. 134 Return to debug level 58. 135 Return to debug level 57. 136 Return to debug level 56. 137 Return to debug level 55. 138 Return to debug level 54. 139 Return to debug level 53. 140 Return to debug level 52. 141 Return to debug level 51. 142 Return to debug level 50. 143 Return to debug level 49. 144 Return to debug level 48. 145 Return to debug level 47. 146 Return to debug level 46. 147 Return to debug level 45. 148 Return to debug level 44. 149 Return to debug level 43. 150 Return to debug level 42. 151 Return to debug level 41. 152 Return to debug level 40. 153 Return to debug level 39. 154 Return to debug level 38. 155 Return to debug level 37. 156 Return to debug level 36. 157 Return to debug level 35. 158 Return to debug level 34. 159 Return to debug level 33. 160 Return to debug level 32. 161 Return to debug level 31. 162 Return to debug level 30. 163 Return to debug level 29. 164 Return to debug level 28. 165 Return to debug level 27. 166 Return to debug level 26. 167 Return to debug level 25. 168 Return to debug level 24. 169 Return to debug level 23. 170 Return to debug level 22. 171 Return to debug level 21. 172 Return to debug level 20. 173 Return to debug level 19. 174 Return to debug level 18. 175 Return to debug level 17. 176 Return to debug level 16. 177 Return to debug level 15. 178 Return to debug level 14. 179 Return to debug level 13. 180 Return to debug level 12. 181 Return to debug level 11. 182 Return to debug level 10. 183 Return to debug level 9. 184 Return to debug level 8. 185 Return to debug level 7. 186 Return to debug level 6. 187 Return to debug level 5. 188 Return to debug level 4. 189 Return to debug level 3. 190 Return to debug level 2. 191 Return to debug level 1. 192 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 192. 2 Return to debug level 191. 3 Return to debug level 190. 4 Return to debug level 189. 5 Return to debug level 188. 6 Return to debug level 187. 7 Return to debug level 186. 8 Return to debug level 185. 9 Return to debug level 184. 10 Return to debug level 183. 11 Return to debug level 182. 12 Return to debug level 181. 13 Return to debug level 180. 14 Return to debug level 179. 15 Return to debug level 178. 16 Return to debug level 177. 17 Return to debug level 176. 18 Return to debug level 175. 19 Return to debug level 174. 20 Return to debug level 173. 21 Return to debug level 172. 22 Return to debug level 171. 23 Return to debug level 170. 24 Return to debug level 169. 25 Return to debug level 168. 26 Return to debug level 167. 27 Return to debug level 166. 28 Return to debug level 165. 29 Return to debug level 164. 30 Return to debug level 163. 31 Return to debug level 162. 32 Return to debug level 161. 33 Return to debug level 160. 34 Return to debug level 159. 35 Return to debug level 158. 36 Return to debug level 157. 37 Return to debug level 156. 38 Return to debug level 155. 39 Return to debug level 154. 40 Return to debug level 153. 41 Return to debug level 152. 42 Return to debug level 151. 43 Return to debug level 150. 44 Return to debug level 149. 45 Return to debug level 148. 46 Return to debug level 147. 47 Return to debug level 146. 48 Return to debug level 145. 49 Return to debug level 144. 50 Return to debug level 143. 51 Return to debug level 142. 52 Return to debug level 141. 53 Return to debug level 140. 54 Return to debug level 139. 55 Return to debug level 138. 56 Return to debug level 137. 57 Return to debug level 136. 58 Return to debug level 135. 59 Return to debug level 134. 60 Return to debug level 133. 61 Return to debug level 132. 62 Return to debug level 131. 63 Return to debug level 130. 64 Return to debug level 129. 65 Return to debug level 128. 66 Return to debug level 127. 67 Return to debug level 126. 68 Return to debug level 125. 69 Return to debug level 124. 70 Return to debug level 123. 71 Return to debug level 122. 72 Return to debug level 121. 73 Return to debug level 120. 74 Return to debug level 119. 75 Return to debug level 118. 76 Return to debug level 117. 77 Return to debug level 116. 78 Return to debug level 115. 79 Return to debug level 114. 80 Return to debug level 113. 81 Return to debug level 112. 82 Return to debug level 111. 83 Return to debug level 110. 84 Return to debug level 109. 85 Return to debug level 108. 86 Return to debug level 107. 87 Return to debug level 106. 88 Return to debug level 105. 89 Return to debug level 104. 90 Return to debug level 103. 91 Return to debug level 102. 92 Return to debug level 101. 93 Return to debug level 100. 94 Return to debug level 99. 95 Return to debug level 98. 96 Return to debug level 97. 97 Return to debug level 96. 98 Return to debug level 95. 99 Return to debug level 94. 100 Return to debug level 93. 101 Return to debug level 92. 102 Return to debug level 91. 103 Return to debug level 90. 104 Return to debug level 89. 105 Return to debug level 88. 106 Return to debug level 87. 107 Return to debug level 86. 108 Return to debug level 85. 109 Return to debug level 84. 110 Return to debug level 83. 111 Return to debug level 82. 112 Return to debug level 81. 113 Return to debug level 80. 114 Return to debug level 79. 115 Return to debug level 78. 116 Return to debug level 77. 117 Return to debug level 76. 118 Return to debug level 75. 119 Return to debug level 74. 120 Return to debug level 73. 121 Return to debug level 72. 122 Return to debug level 71. 123 Return to debug level 70. 124 Return to debug level 69. 125 Return to debug level 68. 126 Return to debug level 67. 127 Return to debug level 66. 128 Return to debug level 65. 129 Return to debug level 64. 130 Return to debug level 63. 131 Return to debug level 62. 132 Return to debug level 61. 133 Return to debug level 60. 134 Return to debug level 59. 135 Return to debug level 58. 136 Return to debug level 57. 137 Return to debug level 56. 138 Return to debug level 55. 139 Return to debug level 54. 140 Return to debug level 53. 141 Return to debug level 52. 142 Return to debug level 51. 143 Return to debug level 50. 144 Return to debug level 49. 145 Return to debug level 48. 146 Return to debug level 47. 147 Return to debug level 46. 148 Return to debug level 45. 149 Return to debug level 44. 150 Return to debug level 43. 151 Return to debug level 42. 152 Return to debug level 41. 153 Return to debug level 40. 154 Return to debug level 39. 155 Return to debug level 38. 156 Return to debug level 37. 157 Return to debug level 36. 158 Return to debug level 35. 159 Return to debug level 34. 160 Return to debug level 33. 161 Return to debug level 32. 162 Return to debug level 31. 163 Return to debug level 30. 164 Return to debug level 29. 165 Return to debug level 28. 166 Return to debug level 27. 167 Return to debug level 26. 168 Return to debug level 25. 169 Return to debug level 24. 170 Return to debug level 23. 171 Return to debug level 22. 172 Return to debug level 21. 173 Return to debug level 20. 174 Return to debug level 19. 175 Return to debug level 18. 176 Return to debug level 17. 177 Return to debug level 16. 178 Return to debug level 15. 179 Return to debug level 14. 180 Return to debug level 13. 181 Return to debug level 12. 182 Return to debug level 11. 183 Return to debug level 10. 184 Return to debug level 9. 185 Return to debug level 8. 186 Return to debug level 7. 187 Return to debug level 6. 188 Return to debug level 5. 189 Return to debug level 4. 190 Return to debug level 3. 191 Return to debug level 2. 192 Return to debug level 1. 193 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 193. 2 Return to debug level 192. 3 Return to debug level 191. 4 Return to debug level 190. 5 Return to debug level 189. 6 Return to debug level 188. 7 Return to debug level 187. 8 Return to debug level 186. 9 Return to debug level 185. 10 Return to debug level 184. 11 Return to debug level 183. 12 Return to debug level 182. 13 Return to debug level 181. 14 Return to debug level 180. 15 Return to debug level 179. 16 Return to debug level 178. 17 Return to debug level 177. 18 Return to debug level 176. 19 Return to debug level 175. 20 Return to debug level 174. 21 Return to debug level 173. 22 Return to debug level 172. 23 Return to debug level 171. 24 Return to debug level 170. 25 Return to debug level 169. 26 Return to debug level 168. 27 Return to debug level 167. 28 Return to debug level 166. 29 Return to debug level 165. 30 Return to debug level 164. 31 Return to debug level 163. 32 Return to debug level 162. 33 Return to debug level 161. 34 Return to debug level 160. 35 Return to debug level 159. 36 Return to debug level 158. 37 Return to debug level 157. 38 Return to debug level 156. 39 Return to debug level 155. 40 Return to debug level 154. 41 Return to debug level 153. 42 Return to debug level 152. 43 Return to debug level 151. 44 Return to debug level 150. 45 Return to debug level 149. 46 Return to debug level 148. 47 Return to debug level 147. 48 Return to debug level 146. 49 Return to debug level 145. 50 Return to debug level 144. 51 Return to debug level 143. 52 Return to debug level 142. 53 Return to debug level 141. 54 Return to debug level 140. 55 Return to debug level 139. 56 Return to debug level 138. 57 Return to debug level 137. 58 Return to debug level 136. 59 Return to debug level 135. 60 Return to debug level 134. 61 Return to debug level 133. 62 Return to debug level 132. 63 Return to debug level 131. 64 Return to debug level 130. 65 Return to debug level 129. 66 Return to debug level 128. 67 Return to debug level 127. 68 Return to debug level 126. 69 Return to debug level 125. 70 Return to debug level 124. 71 Return to debug level 123. 72 Return to debug level 122. 73 Return to debug level 121. 74 Return to debug level 120. 75 Return to debug level 119. 76 Return to debug level 118. 77 Return to debug level 117. 78 Return to debug level 116. 79 Return to debug level 115. 80 Return to debug level 114. 81 Return to debug level 113. 82 Return to debug level 112. 83 Return to debug level 111. 84 Return to debug level 110. 85 Return to debug level 109. 86 Return to debug level 108. 87 Return to debug level 107. 88 Return to debug level 106. 89 Return to debug level 105. 90 Return to debug level 104. 91 Return to debug level 103. 92 Return to debug level 102. 93 Return to debug level 101. 94 Return to debug level 100. 95 Return to debug level 99. 96 Return to debug level 98. 97 Return to debug level 97. 98 Return to debug level 96. 99 Return to debug level 95. 100 Return to debug level 94. 101 Return to debug level 93. 102 Return to debug level 92. 103 Return to debug level 91. 104 Return to debug level 90. 105 Return to debug level 89. 106 Return to debug level 88. 107 Return to debug level 87. 108 Return to debug level 86. 109 Return to debug level 85. 110 Return to debug level 84. 111 Return to debug level 83. 112 Return to debug level 82. 113 Return to debug level 81. 114 Return to debug level 80. 115 Return to debug level 79. 116 Return to debug level 78. 117 Return to debug level 77. 118 Return to debug level 76. 119 Return to debug level 75. 120 Return to debug level 74. 121 Return to debug level 73. 122 Return to debug level 72. 123 Return to debug level 71. 124 Return to debug level 70. 125 Return to debug level 69. 126 Return to debug level 68. 127 Return to debug level 67. 128 Return to debug level 66. 129 Return to debug level 65. 130 Return to debug level 64. 131 Return to debug level 63. 132 Return to debug level 62. 133 Return to debug level 61. 134 Return to debug level 60. 135 Return to debug level 59. 136 Return to debug level 58. 137 Return to debug level 57. 138 Return to debug level 56. 139 Return to debug level 55. 140 Return to debug level 54. 141 Return to debug level 53. 142 Return to debug level 52. 143 Return to debug level 51. 144 Return to debug level 50. 145 Return to debug level 49. 146 Return to debug level 48. 147 Return to debug level 47. 148 Return to debug level 46. 149 Return to debug level 45. 150 Return to debug level 44. 151 Return to debug level 43. 152 Return to debug level 42. 153 Return to debug level 41. 154 Return to debug level 40. 155 Return to debug level 39. 156 Return to debug level 38. 157 Return to debug level 37. 158 Return to debug level 36. 159 Return to debug level 35. 160 Return to debug level 34. 161 Return to debug level 33. 162 Return to debug level 32. 163 Return to debug level 31. 164 Return to debug level 30. 165 Return to debug level 29. 166 Return to debug level 28. 167 Return to debug level 27. 168 Return to debug level 26. 169 Return to debug level 25. 170 Return to debug level 24. 171 Return to debug level 23. 172 Return to debug level 22. 173 Return to debug level 21. 174 Return to debug level 20. 175 Return to debug level 19. 176 Return to debug level 18. 177 Return to debug level 17. 178 Return to debug level 16. 179 Return to debug level 15. 180 Return to debug level 14. 181 Return to debug level 13. 182 Return to debug level 12. 183 Return to debug level 11. 184 Return to debug level 10. 185 Return to debug level 9. 186 Return to debug level 8. 187 Return to debug level 7. 188 Return to debug level 6. 189 Return to debug level 5. 190 Return to debug level 4. 191 Return to debug level 3. 192 Return to debug level 2. 193 Return to debug level 1. 194 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 194. 2 Return to debug level 193. 3 Return to debug level 192. 4 Return to debug level 191. 5 Return to debug level 190. 6 Return to debug level 189. 7 Return to debug level 188. 8 Return to debug level 187. 9 Return to debug level 186. 10 Return to debug level 185. 11 Return to debug level 184. 12 Return to debug level 183. 13 Return to debug level 182. 14 Return to debug level 181. 15 Return to debug level 180. 16 Return to debug level 179. 17 Return to debug level 178. 18 Return to debug level 177. 19 Return to debug level 176. 20 Return to debug level 175. 21 Return to debug level 174. 22 Return to debug level 173. 23 Return to debug level 172. 24 Return to debug level 171. 25 Return to debug level 170. 26 Return to debug level 169. 27 Return to debug level 168. 28 Return to debug level 167. 29 Return to debug level 166. 30 Return to debug level 165. 31 Return to debug level 164. 32 Return to debug level 163. 33 Return to debug level 162. 34 Return to debug level 161. 35 Return to debug level 160. 36 Return to debug level 159. 37 Return to debug level 158. 38 Return to debug level 157. 39 Return to debug level 156. 40 Return to debug level 155. 41 Return to debug level 154. 42 Return to debug level 153. 43 Return to debug level 152. 44 Return to debug level 151. 45 Return to debug level 150. 46 Return to debug level 149. 47 Return to debug level 148. 48 Return to debug level 147. 49 Return to debug level 146. 50 Return to debug level 145. 51 Return to debug level 144. 52 Return to debug level 143. 53 Return to debug level 142. 54 Return to debug level 141. 55 Return to debug level 140. 56 Return to debug level 139. 57 Return to debug level 138. 58 Return to debug level 137. 59 Return to debug level 136. 60 Return to debug level 135. 61 Return to debug level 134. 62 Return to debug level 133. 63 Return to debug level 132. 64 Return to debug level 131. 65 Return to debug level 130. 66 Return to debug level 129. 67 Return to debug level 128. 68 Return to debug level 127. 69 Return to debug level 126. 70 Return to debug level 125. 71 Return to debug level 124. 72 Return to debug level 123. 73 Return to debug level 122. 74 Return to debug level 121. 75 Return to debug level 120. 76 Return to debug level 119. 77 Return to debug level 118. 78 Return to debug level 117. 79 Return to debug level 116. 80 Return to debug level 115. 81 Return to debug level 114. 82 Return to debug level 113. 83 Return to debug level 112. 84 Return to debug level 111. 85 Return to debug level 110. 86 Return to debug level 109. 87 Return to debug level 108. 88 Return to debug level 107. 89 Return to debug level 106. 90 Return to debug level 105. 91 Return to debug level 104. 92 Return to debug level 103. 93 Return to debug level 102. 94 Return to debug level 101. 95 Return to debug level 100. 96 Return to debug level 99. 97 Return to debug level 98. 98 Return to debug level 97. 99 Return to debug level 96. 100 Return to debug level 95. 101 Return to debug level 94. 102 Return to debug level 93. 103 Return to debug level 92. 104 Return to debug level 91. 105 Return to debug level 90. 106 Return to debug level 89. 107 Return to debug level 88. 108 Return to debug level 87. 109 Return to debug level 86. 110 Return to debug level 85. 111 Return to debug level 84. 112 Return to debug level 83. 113 Return to debug level 82. 114 Return to debug level 81. 115 Return to debug level 80. 116 Return to debug level 79. 117 Return to debug level 78. 118 Return to debug level 77. 119 Return to debug level 76. 120 Return to debug level 75. 121 Return to debug level 74. 122 Return to debug level 73. 123 Return to debug level 72. 124 Return to debug level 71. 125 Return to debug level 70. 126 Return to debug level 69. 127 Return to debug level 68. 128 Return to debug level 67. 129 Return to debug level 66. 130 Return to debug level 65. 131 Return to debug level 64. 132 Return to debug level 63. 133 Return to debug level 62. 134 Return to debug level 61. 135 Return to debug level 60. 136 Return to debug level 59. 137 Return to debug level 58. 138 Return to debug level 57. 139 Return to debug level 56. 140 Return to debug level 55. 141 Return to debug level 54. 142 Return to debug level 53. 143 Return to debug level 52. 144 Return to debug level 51. 145 Return to debug level 50. 146 Return to debug level 49. 147 Return to debug level 48. 148 Return to debug level 47. 149 Return to debug level 46. 150 Return to debug level 45. 151 Return to debug level 44. 152 Return to debug level 43. 153 Return to debug level 42. 154 Return to debug level 41. 155 Return to debug level 40. 156 Return to debug level 39. 157 Return to debug level 38. 158 Return to debug level 37. 159 Return to debug level 36. 160 Return to debug level 35. 161 Return to debug level 34. 162 Return to debug level 33. 163 Return to debug level 32. 164 Return to debug level 31. 165 Return to debug level 30. 166 Return to debug level 29. 167 Return to debug level 28. 168 Return to debug level 27. 169 Return to debug level 26. 170 Return to debug level 25. 171 Return to debug level 24. 172 Return to debug level 23. 173 Return to debug level 22. 174 Return to debug level 21. 175 Return to debug level 20. 176 Return to debug level 19. 177 Return to debug level 18. 178 Return to debug level 17. 179 Return to debug level 16. 180 Return to debug level 15. 181 Return to debug level 14. 182 Return to debug level 13. 183 Return to debug level 12. 184 Return to debug level 11. 185 Return to debug level 10. 186 Return to debug level 9. 187 Return to debug level 8. 188 Return to debug level 7. 189 Return to debug level 6. 190 Return to debug level 5. 191 Return to debug level 4. 192 Return to debug level 3. 193 Return to debug level 2. 194 Return to debug level 1. 195 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 195. 2 Return to debug level 194. 3 Return to debug level 193. 4 Return to debug level 192. 5 Return to debug level 191. 6 Return to debug level 190. 7 Return to debug level 189. 8 Return to debug level 188. 9 Return to debug level 187. 10 Return to debug level 186. 11 Return to debug level 185. 12 Return to debug level 184. 13 Return to debug level 183. 14 Return to debug level 182. 15 Return to debug level 181. 16 Return to debug level 180. 17 Return to debug level 179. 18 Return to debug level 178. 19 Return to debug level 177. 20 Return to debug level 176. 21 Return to debug level 175. 22 Return to debug level 174. 23 Return to debug level 173. 24 Return to debug level 172. 25 Return to debug level 171. 26 Return to debug level 170. 27 Return to debug level 169. 28 Return to debug level 168. 29 Return to debug level 167. 30 Return to debug level 166. 31 Return to debug level 165. 32 Return to debug level 164. 33 Return to debug level 163. 34 Return to debug level 162. 35 Return to debug level 161. 36 Return to debug level 160. 37 Return to debug level 159. 38 Return to debug level 158. 39 Return to debug level 157. 40 Return to debug level 156. 41 Return to debug level 155. 42 Return to debug level 154. 43 Return to debug level 153. 44 Return to debug level 152. 45 Return to debug level 151. 46 Return to debug level 150. 47 Return to debug level 149. 48 Return to debug level 148. 49 Return to debug level 147. 50 Return to debug level 146. 51 Return to debug level 145. 52 Return to debug level 144. 53 Return to debug level 143. 54 Return to debug level 142. 55 Return to debug level 141. 56 Return to debug level 140. 57 Return to debug level 139. 58 Return to debug level 138. 59 Return to debug level 137. 60 Return to debug level 136. 61 Return to debug level 135. 62 Return to debug level 134. 63 Return to debug level 133. 64 Return to debug level 132. 65 Return to debug level 131. 66 Return to debug level 130. 67 Return to debug level 129. 68 Return to debug level 128. 69 Return to debug level 127. 70 Return to debug level 126. 71 Return to debug level 125. 72 Return to debug level 124. 73 Return to debug level 123. 74 Return to debug level 122. 75 Return to debug level 121. 76 Return to debug level 120. 77 Return to debug level 119. 78 Return to debug level 118. 79 Return to debug level 117. 80 Return to debug level 116. 81 Return to debug level 115. 82 Return to debug level 114. 83 Return to debug level 113. 84 Return to debug level 112. 85 Return to debug level 111. 86 Return to debug level 110. 87 Return to debug level 109. 88 Return to debug level 108. 89 Return to debug level 107. 90 Return to debug level 106. 91 Return to debug level 105. 92 Return to debug level 104. 93 Return to debug level 103. 94 Return to debug level 102. 95 Return to debug level 101. 96 Return to debug level 100. 97 Return to debug level 99. 98 Return to debug level 98. 99 Return to debug level 97. 100 Return to debug level 96. 101 Return to debug level 95. 102 Return to debug level 94. 103 Return to debug level 93. 104 Return to debug level 92. 105 Return to debug level 91. 106 Return to debug level 90. 107 Return to debug level 89. 108 Return to debug level 88. 109 Return to debug level 87. 110 Return to debug level 86. 111 Return to debug level 85. 112 Return to debug level 84. 113 Return to debug level 83. 114 Return to debug level 82. 115 Return to debug level 81. 116 Return to debug level 80. 117 Return to debug level 79. 118 Return to debug level 78. 119 Return to debug level 77. 120 Return to debug level 76. 121 Return to debug level 75. 122 Return to debug level 74. 123 Return to debug level 73. 124 Return to debug level 72. 125 Return to debug level 71. 126 Return to debug level 70. 127 Return to debug level 69. 128 Return to debug level 68. 129 Return to debug level 67. 130 Return to debug level 66. 131 Return to debug level 65. 132 Return to debug level 64. 133 Return to debug level 63. 134 Return to debug level 62. 135 Return to debug level 61. 136 Return to debug level 60. 137 Return to debug level 59. 138 Return to debug level 58. 139 Return to debug level 57. 140 Return to debug level 56. 141 Return to debug level 55. 142 Return to debug level 54. 143 Return to debug level 53. 144 Return to debug level 52. 145 Return to debug level 51. 146 Return to debug level 50. 147 Return to debug level 49. 148 Return to debug level 48. 149 Return to debug level 47. 150 Return to debug level 46. 151 Return to debug level 45. 152 Return to debug level 44. 153 Return to debug level 43. 154 Return to debug level 42. 155 Return to debug level 41. 156 Return to debug level 40. 157 Return to debug level 39. 158 Return to debug level 38. 159 Return to debug level 37. 160 Return to debug level 36. 161 Return to debug level 35. 162 Return to debug level 34. 163 Return to debug level 33. 164 Return to debug level 32. 165 Return to debug level 31. 166 Return to debug level 30. 167 Return to debug level 29. 168 Return to debug level 28. 169 Return to debug level 27. 170 Return to debug level 26. 171 Return to debug level 25. 172 Return to debug level 24. 173 Return to debug level 23. 174 Return to debug level 22. 175 Return to debug level 21. 176 Return to debug level 20. 177 Return to debug level 19. 178 Return to debug level 18. 179 Return to debug level 17. 180 Return to debug level 16. 181 Return to debug level 15. 182 Return to debug level 14. 183 Return to debug level 13. 184 Return to debug level 12. 185 Return to debug level 11. 186 Return to debug level 10. 187 Return to debug level 9. 188 Return to debug level 8. 189 Return to debug level 7. 190 Return to debug level 6. 191 Return to debug level 5. 192 Return to debug level 4. 193 Return to debug level 3. 194 Return to debug level 2. 195 Return to debug level 1. 196 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 196. 2 Return to debug level 195. 3 Return to debug level 194. 4 Return to debug level 193. 5 Return to debug level 192. 6 Return to debug level 191. 7 Return to debug level 190. 8 Return to debug level 189. 9 Return to debug level 188. 10 Return to debug level 187. 11 Return to debug level 186. 12 Return to debug level 185. 13 Return to debug level 184. 14 Return to debug level 183. 15 Return to debug level 182. 16 Return to debug level 181. 17 Return to debug level 180. 18 Return to debug level 179. 19 Return to debug level 178. 20 Return to debug level 177. 21 Return to debug level 176. 22 Return to debug level 175. 23 Return to debug level 174. 24 Return to debug level 173. 25 Return to debug level 172. 26 Return to debug level 171. 27 Return to debug level 170. 28 Return to debug level 169. 29 Return to debug level 168. 30 Return to debug level 167. 31 Return to debug level 166. 32 Return to debug level 165. 33 Return to debug level 164. 34 Return to debug level 163. 35 Return to debug level 162. 36 Return to debug level 161. 37 Return to debug level 160. 38 Return to debug level 159. 39 Return to debug level 158. 40 Return to debug level 157. 41 Return to debug level 156. 42 Return to debug level 155. 43 Return to debug level 154. 44 Return to debug level 153. 45 Return to debug level 152. 46 Return to debug level 151. 47 Return to debug level 150. 48 Return to debug level 149. 49 Return to debug level 148. 50 Return to debug level 147. 51 Return to debug level 146. 52 Return to debug level 145. 53 Return to debug level 144. 54 Return to debug level 143. 55 Return to debug level 142. 56 Return to debug level 141. 57 Return to debug level 140. 58 Return to debug level 139. 59 Return to debug level 138. 60 Return to debug level 137. 61 Return to debug level 136. 62 Return to debug level 135. 63 Return to debug level 134. 64 Return to debug level 133. 65 Return to debug level 132. 66 Return to debug level 131. 67 Return to debug level 130. 68 Return to debug level 129. 69 Return to debug level 128. 70 Return to debug level 127. 71 Return to debug level 126. 72 Return to debug level 125. 73 Return to debug level 124. 74 Return to debug level 123. 75 Return to debug level 122. 76 Return to debug level 121. 77 Return to debug level 120. 78 Return to debug level 119. 79 Return to debug level 118. 80 Return to debug level 117. 81 Return to debug level 116. 82 Return to debug level 115. 83 Return to debug level 114. 84 Return to debug level 113. 85 Return to debug level 112. 86 Return to debug level 111. 87 Return to debug level 110. 88 Return to debug level 109. 89 Return to debug level 108. 90 Return to debug level 107. 91 Return to debug level 106. 92 Return to debug level 105. 93 Return to debug level 104. 94 Return to debug level 103. 95 Return to debug level 102. 96 Return to debug level 101. 97 Return to debug level 100. 98 Return to debug level 99. 99 Return to debug level 98. 100 Return to debug level 97. 101 Return to debug level 96. 102 Return to debug level 95. 103 Return to debug level 94. 104 Return to debug level 93. 105 Return to debug level 92. 106 Return to debug level 91. 107 Return to debug level 90. 108 Return to debug level 89. 109 Return to debug level 88. 110 Return to debug level 87. 111 Return to debug level 86. 112 Return to debug level 85. 113 Return to debug level 84. 114 Return to debug level 83. 115 Return to debug level 82. 116 Return to debug level 81. 117 Return to debug level 80. 118 Return to debug level 79. 119 Return to debug level 78. 120 Return to debug level 77. 121 Return to debug level 76. 122 Return to debug level 75. 123 Return to debug level 74. 124 Return to debug level 73. 125 Return to debug level 72. 126 Return to debug level 71. 127 Return to debug level 70. 128 Return to debug level 69. 129 Return to debug level 68. 130 Return to debug level 67. 131 Return to debug level 66. 132 Return to debug level 65. 133 Return to debug level 64. 134 Return to debug level 63. 135 Return to debug level 62. 136 Return to debug level 61. 137 Return to debug level 60. 138 Return to debug level 59. 139 Return to debug level 58. 140 Return to debug level 57. 141 Return to debug level 56. 142 Return to debug level 55. 143 Return to debug level 54. 144 Return to debug level 53. 145 Return to debug level 52. 146 Return to debug level 51. 147 Return to debug level 50. 148 Return to debug level 49. 149 Return to debug level 48. 150 Return to debug level 47. 151 Return to debug level 46. 152 Return to debug level 45. 153 Return to debug level 44. 154 Return to debug level 43. 155 Return to debug level 42. 156 Return to debug level 41. 157 Return to debug level 40. 158 Return to debug level 39. 159 Return to debug level 38. 160 Return to debug level 37. 161 Return to debug level 36. 162 Return to debug level 35. 163 Return to debug level 34. 164 Return to debug level 33. 165 Return to debug level 32. 166 Return to debug level 31. 167 Return to debug level 30. 168 Return to debug level 29. 169 Return to debug level 28. 170 Return to debug level 27. 171 Return to debug level 26. 172 Return to debug level 25. 173 Return to debug level 24. 174 Return to debug level 23. 175 Return to debug level 22. 176 Return to debug level 21. 177 Return to debug level 20. 178 Return to debug level 19. 179 Return to debug level 18. 180 Return to debug level 17. 181 Return to debug level 16. 182 Return to debug level 15. 183 Return to debug level 14. 184 Return to debug level 13. 185 Return to debug level 12. 186 Return to debug level 11. 187 Return to debug level 10. 188 Return to debug level 9. 189 Return to debug level 8. 190 Return to debug level 7. 191 Return to debug level 6. 192 Return to debug level 5. 193 Return to debug level 4. 194 Return to debug level 3. 195 Return to debug level 2. 196 Return to debug level 1. 197 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 197. 2 Return to debug level 196. 3 Return to debug level 195. 4 Return to debug level 194. 5 Return to debug level 193. 6 Return to debug level 192. 7 Return to debug level 191. 8 Return to debug level 190. 9 Return to debug level 189. 10 Return to debug level 188. 11 Return to debug level 187. 12 Return to debug level 186. 13 Return to debug level 185. 14 Return to debug level 184. 15 Return to debug level 183. 16 Return to debug level 182. 17 Return to debug level 181. 18 Return to debug level 180. 19 Return to debug level 179. 20 Return to debug level 178. 21 Return to debug level 177. 22 Return to debug level 176. 23 Return to debug level 175. 24 Return to debug level 174. 25 Return to debug level 173. 26 Return to debug level 172. 27 Return to debug level 171. 28 Return to debug level 170. 29 Return to debug level 169. 30 Return to debug level 168. 31 Return to debug level 167. 32 Return to debug level 166. 33 Return to debug level 165. 34 Return to debug level 164. 35 Return to debug level 163. 36 Return to debug level 162. 37 Return to debug level 161. 38 Return to debug level 160. 39 Return to debug level 159. 40 Return to debug level 158. 41 Return to debug level 157. 42 Return to debug level 156. 43 Return to debug level 155. 44 Return to debug level 154. 45 Return to debug level 153. 46 Return to debug level 152. 47 Return to debug level 151. 48 Return to debug level 150. 49 Return to debug level 149. 50 Return to debug level 148. 51 Return to debug level 147. 52 Return to debug level 146. 53 Return to debug level 145. 54 Return to debug level 144. 55 Return to debug level 143. 56 Return to debug level 142. 57 Return to debug level 141. 58 Return to debug level 140. 59 Return to debug level 139. 60 Return to debug level 138. 61 Return to debug level 137. 62 Return to debug level 136. 63 Return to debug level 135. 64 Return to debug level 134. 65 Return to debug level 133. 66 Return to debug level 132. 67 Return to debug level 131. 68 Return to debug level 130. 69 Return to debug level 129. 70 Return to debug level 128. 71 Return to debug level 127. 72 Return to debug level 126. 73 Return to debug level 125. 74 Return to debug level 124. 75 Return to debug level 123. 76 Return to debug level 122. 77 Return to debug level 121. 78 Return to debug level 120. 79 Return to debug level 119. 80 Return to debug level 118. 81 Return to debug level 117. 82 Return to debug level 116. 83 Return to debug level 115. 84 Return to debug level 114. 85 Return to debug level 113. 86 Return to debug level 112. 87 Return to debug level 111. 88 Return to debug level 110. 89 Return to debug level 109. 90 Return to debug level 108. 91 Return to debug level 107. 92 Return to debug level 106. 93 Return to debug level 105. 94 Return to debug level 104. 95 Return to debug level 103. 96 Return to debug level 102. 97 Return to debug level 101. 98 Return to debug level 100. 99 Return to debug level 99. 100 Return to debug level 98. 101 Return to debug level 97. 102 Return to debug level 96. 103 Return to debug level 95. 104 Return to debug level 94. 105 Return to debug level 93. 106 Return to debug level 92. 107 Return to debug level 91. 108 Return to debug level 90. 109 Return to debug level 89. 110 Return to debug level 88. 111 Return to debug level 87. 112 Return to debug level 86. 113 Return to debug level 85. 114 Return to debug level 84. 115 Return to debug level 83. 116 Return to debug level 82. 117 Return to debug level 81. 118 Return to debug level 80. 119 Return to debug level 79. 120 Return to debug level 78. 121 Return to debug level 77. 122 Return to debug level 76. 123 Return to debug level 75. 124 Return to debug level 74. 125 Return to debug level 73. 126 Return to debug level 72. 127 Return to debug level 71. 128 Return to debug level 70. 129 Return to debug level 69. 130 Return to debug level 68. 131 Return to debug level 67. 132 Return to debug level 66. 133 Return to debug level 65. 134 Return to debug level 64. 135 Return to debug level 63. 136 Return to debug level 62. 137 Return to debug level 61. 138 Return to debug level 60. 139 Return to debug level 59. 140 Return to debug level 58. 141 Return to debug level 57. 142 Return to debug level 56. 143 Return to debug level 55. 144 Return to debug level 54. 145 Return to debug level 53. 146 Return to debug level 52. 147 Return to debug level 51. 148 Return to debug level 50. 149 Return to debug level 49. 150 Return to debug level 48. 151 Return to debug level 47. 152 Return to debug level 46. 153 Return to debug level 45. 154 Return to debug level 44. 155 Return to debug level 43. 156 Return to debug level 42. 157 Return to debug level 41. 158 Return to debug level 40. 159 Return to debug level 39. 160 Return to debug level 38. 161 Return to debug level 37. 162 Return to debug level 36. 163 Return to debug level 35. 164 Return to debug level 34. 165 Return to debug level 33. 166 Return to debug level 32. 167 Return to debug level 31. 168 Return to debug level 30. 169 Return to debug level 29. 170 Return to debug level 28. 171 Return to debug level 27. 172 Return to debug level 26. 173 Return to debug level 25. 174 Return to debug level 24. 175 Return to debug level 23. 176 Return to debug level 22. 177 Return to debug level 21. 178 Return to debug level 20. 179 Return to debug level 19. 180 Return to debug level 18. 181 Return to debug level 17. 182 Return to debug level 16. 183 Return to debug level 15. 184 Return to debug level 14. 185 Return to debug level 13. 186 Return to debug level 12. 187 Return to debug level 11. 188 Return to debug level 10. 189 Return to debug level 9. 190 Return to debug level 8. 191 Return to debug level 7. 192 Return to debug level 6. 193 Return to debug level 5. 194 Return to debug level 4. 195 Return to debug level 3. 196 Return to debug level 2. 197 Return to debug level 1. 198 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 198. 2 Return to debug level 197. 3 Return to debug level 196. 4 Return to debug level 195. 5 Return to debug level 194. 6 Return to debug level 193. 7 Return to debug level 192. 8 Return to debug level 191. 9 Return to debug level 190. 10 Return to debug level 189. 11 Return to debug level 188. 12 Return to debug level 187. 13 Return to debug level 186. 14 Return to debug level 185. 15 Return to debug level 184. 16 Return to debug level 183. 17 Return to debug level 182. 18 Return to debug level 181. 19 Return to debug level 180. 20 Return to debug level 179. 21 Return to debug level 178. 22 Return to debug level 177. 23 Return to debug level 176. 24 Return to debug level 175. 25 Return to debug level 174. 26 Return to debug level 173. 27 Return to debug level 172. 28 Return to debug level 171. 29 Return to debug level 170. 30 Return to debug level 169. 31 Return to debug level 168. 32 Return to debug level 167. 33 Return to debug level 166. 34 Return to debug level 165. 35 Return to debug level 164. 36 Return to debug level 163. 37 Return to debug level 162. 38 Return to debug level 161. 39 Return to debug level 160. 40 Return to debug level 159. 41 Return to debug level 158. 42 Return to debug level 157. 43 Return to debug level 156. 44 Return to debug level 155. 45 Return to debug level 154. 46 Return to debug level 153. 47 Return to debug level 152. 48 Return to debug level 151. 49 Return to debug level 150. 50 Return to debug level 149. 51 Return to debug level 148. 52 Return to debug level 147. 53 Return to debug level 146. 54 Return to debug level 145. 55 Return to debug level 144. 56 Return to debug level 143. 57 Return to debug level 142. 58 Return to debug level 141. 59 Return to debug level 140. 60 Return to debug level 139. 61 Return to debug level 138. 62 Return to debug level 137. 63 Return to debug level 136. 64 Return to debug level 135. 65 Return to debug level 134. 66 Return to debug level 133. 67 Return to debug level 132. 68 Return to debug level 131. 69 Return to debug level 130. 70 Return to debug level 129. 71 Return to debug level 128. 72 Return to debug level 127. 73 Return to debug level 126. 74 Return to debug level 125. 75 Return to debug level 124. 76 Return to debug level 123. 77 Return to debug level 122. 78 Return to debug level 121. 79 Return to debug level 120. 80 Return to debug level 119. 81 Return to debug level 118. 82 Return to debug level 117. 83 Return to debug level 116. 84 Return to debug level 115. 85 Return to debug level 114. 86 Return to debug level 113. 87 Return to debug level 112. 88 Return to debug level 111. 89 Return to debug level 110. 90 Return to debug level 109. 91 Return to debug level 108. 92 Return to debug level 107. 93 Return to debug level 106. 94 Return to debug level 105. 95 Return to debug level 104. 96 Return to debug level 103. 97 Return to debug level 102. 98 Return to debug level 101. 99 Return to debug level 100. 100 Return to debug level 99. 101 Return to debug level 98. 102 Return to debug level 97. 103 Return to debug level 96. 104 Return to debug level 95. 105 Return to debug level 94. 106 Return to debug level 93. 107 Return to debug level 92. 108 Return to debug level 91. 109 Return to debug level 90. 110 Return to debug level 89. 111 Return to debug level 88. 112 Return to debug level 87. 113 Return to debug level 86. 114 Return to debug level 85. 115 Return to debug level 84. 116 Return to debug level 83. 117 Return to debug level 82. 118 Return to debug level 81. 119 Return to debug level 80. 120 Return to debug level 79. 121 Return to debug level 78. 122 Return to debug level 77. 123 Return to debug level 76. 124 Return to debug level 75. 125 Return to debug level 74. 126 Return to debug level 73. 127 Return to debug level 72. 128 Return to debug level 71. 129 Return to debug level 70. 130 Return to debug level 69. 131 Return to debug level 68. 132 Return to debug level 67. 133 Return to debug level 66. 134 Return to debug level 65. 135 Return to debug level 64. 136 Return to debug level 63. 137 Return to debug level 62. 138 Return to debug level 61. 139 Return to debug level 60. 140 Return to debug level 59. 141 Return to debug level 58. 142 Return to debug level 57. 143 Return to debug level 56. 144 Return to debug level 55. 145 Return to debug level 54. 146 Return to debug level 53. 147 Return to debug level 52. 148 Return to debug level 51. 149 Return to debug level 50. 150 Return to debug level 49. 151 Return to debug level 48. 152 Return to debug level 47. 153 Return to debug level 46. 154 Return to debug level 45. 155 Return to debug level 44. 156 Return to debug level 43. 157 Return to debug level 42. 158 Return to debug level 41. 159 Return to debug level 40. 160 Return to debug level 39. 161 Return to debug level 38. 162 Return to debug level 37. 163 Return to debug level 36. 164 Return to debug level 35. 165 Return to debug level 34. 166 Return to debug level 33. 167 Return to debug level 32. 168 Return to debug level 31. 169 Return to debug level 30. 170 Return to debug level 29. 171 Return to debug level 28. 172 Return to debug level 27. 173 Return to debug level 26. 174 Return to debug level 25. 175 Return to debug level 24. 176 Return to debug level 23. 177 Return to debug level 22. 178 Return to debug level 21. 179 Return to debug level 20. 180 Return to debug level 19. 181 Return to debug level 18. 182 Return to debug level 17. 183 Return to debug level 16. 184 Return to debug level 15. 185 Return to debug level 14. 186 Return to debug level 13. 187 Return to debug level 12. 188 Return to debug level 11. 189 Return to debug level 10. 190 Return to debug level 9. 191 Return to debug level 8. 192 Return to debug level 7. 193 Return to debug level 6. 194 Return to debug level 5. 195 Return to debug level 4. 196 Return to debug level 3. 197 Return to debug level 2. 198 Return to debug level 1. 199 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 199. 2 Return to debug level 198. 3 Return to debug level 197. 4 Return to debug level 196. 5 Return to debug level 195. 6 Return to debug level 194. 7 Return to debug level 193. 8 Return to debug level 192. 9 Return to debug level 191. 10 Return to debug level 190. 11 Return to debug level 189. 12 Return to debug level 188. 13 Return to debug level 187. 14 Return to debug level 186. 15 Return to debug level 185. 16 Return to debug level 184. 17 Return to debug level 183. 18 Return to debug level 182. 19 Return to debug level 181. 20 Return to debug level 180. 21 Return to debug level 179. 22 Return to debug level 178. 23 Return to debug level 177. 24 Return to debug level 176. 25 Return to debug level 175. 26 Return to debug level 174. 27 Return to debug level 173. 28 Return to debug level 172. 29 Return to debug level 171. 30 Return to debug level 170. 31 Return to debug level 169. 32 Return to debug level 168. 33 Return to debug level 167. 34 Return to debug level 166. 35 Return to debug level 165. 36 Return to debug level 164. 37 Return to debug level 163. 38 Return to debug level 162. 39 Return to debug level 161. 40 Return to debug level 160. 41 Return to debug level 159. 42 Return to debug level 158. 43 Return to debug level 157. 44 Return to debug level 156. 45 Return to debug level 155. 46 Return to debug level 154. 47 Return to debug level 153. 48 Return to debug level 152. 49 Return to debug level 151. 50 Return to debug level 150. 51 Return to debug level 149. 52 Return to debug level 148. 53 Return to debug level 147. 54 Return to debug level 146. 55 Return to debug level 145. 56 Return to debug level 144. 57 Return to debug level 143. 58 Return to debug level 142. 59 Return to debug level 141. 60 Return to debug level 140. 61 Return to debug level 139. 62 Return to debug level 138. 63 Return to debug level 137. 64 Return to debug level 136. 65 Return to debug level 135. 66 Return to debug level 134. 67 Return to debug level 133. 68 Return to debug level 132. 69 Return to debug level 131. 70 Return to debug level 130. 71 Return to debug level 129. 72 Return to debug level 128. 73 Return to debug level 127. 74 Return to debug level 126. 75 Return to debug level 125. 76 Return to debug level 124. 77 Return to debug level 123. 78 Return to debug level 122. 79 Return to debug level 121. 80 Return to debug level 120. 81 Return to debug level 119. 82 Return to debug level 118. 83 Return to debug level 117. 84 Return to debug level 116. 85 Return to debug level 115. 86 Return to debug level 114. 87 Return to debug level 113. 88 Return to debug level 112. 89 Return to debug level 111. 90 Return to debug level 110. 91 Return to debug level 109. 92 Return to debug level 108. 93 Return to debug level 107. 94 Return to debug level 106. 95 Return to debug level 105. 96 Return to debug level 104. 97 Return to debug level 103. 98 Return to debug level 102. 99 Return to debug level 101. 100 Return to debug level 100. 101 Return to debug level 99. 102 Return to debug level 98. 103 Return to debug level 97. 104 Return to debug level 96. 105 Return to debug level 95. 106 Return to debug level 94. 107 Return to debug level 93. 108 Return to debug level 92. 109 Return to debug level 91. 110 Return to debug level 90. 111 Return to debug level 89. 112 Return to debug level 88. 113 Return to debug level 87. 114 Return to debug level 86. 115 Return to debug level 85. 116 Return to debug level 84. 117 Return to debug level 83. 118 Return to debug level 82. 119 Return to debug level 81. 120 Return to debug level 80. 121 Return to debug level 79. 122 Return to debug level 78. 123 Return to debug level 77. 124 Return to debug level 76. 125 Return to debug level 75. 126 Return to debug level 74. 127 Return to debug level 73. 128 Return to debug level 72. 129 Return to debug level 71. 130 Return to debug level 70. 131 Return to debug level 69. 132 Return to debug level 68. 133 Return to debug level 67. 134 Return to debug level 66. 135 Return to debug level 65. 136 Return to debug level 64. 137 Return to debug level 63. 138 Return to debug level 62. 139 Return to debug level 61. 140 Return to debug level 60. 141 Return to debug level 59. 142 Return to debug level 58. 143 Return to debug level 57. 144 Return to debug level 56. 145 Return to debug level 55. 146 Return to debug level 54. 147 Return to debug level 53. 148 Return to debug level 52. 149 Return to debug level 51. 150 Return to debug level 50. 151 Return to debug level 49. 152 Return to debug level 48. 153 Return to debug level 47. 154 Return to debug level 46. 155 Return to debug level 45. 156 Return to debug level 44. 157 Return to debug level 43. 158 Return to debug level 42. 159 Return to debug level 41. 160 Return to debug level 40. 161 Return to debug level 39. 162 Return to debug level 38. 163 Return to debug level 37. 164 Return to debug level 36. 165 Return to debug level 35. 166 Return to debug level 34. 167 Return to debug level 33. 168 Return to debug level 32. 169 Return to debug level 31. 170 Return to debug level 30. 171 Return to debug level 29. 172 Return to debug level 28. 173 Return to debug level 27. 174 Return to debug level 26. 175 Return to debug level 25. 176 Return to debug level 24. 177 Return to debug level 23. 178 Return to debug level 22. 179 Return to debug level 21. 180 Return to debug level 20. 181 Return to debug level 19. 182 Return to debug level 18. 183 Return to debug level 17. 184 Return to debug level 16. 185 Return to debug level 15. 186 Return to debug level 14. 187 Return to debug level 13. 188 Return to debug level 12. 189 Return to debug level 11. 190 Return to debug level 10. 191 Return to debug level 9. 192 Return to debug level 8. 193 Return to debug level 7. 194 Return to debug level 6. 195 Return to debug level 5. 196 Return to debug level 4. 197 Return to debug level 3. 198 Return to debug level 2. 199 Return to debug level 1. 200 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 200. 2 Return to debug level 199. 3 Return to debug level 198. 4 Return to debug level 197. 5 Return to debug level 196. 6 Return to debug level 195. 7 Return to debug level 194. 8 Return to debug level 193. 9 Return to debug level 192. 10 Return to debug level 191. 11 Return to debug level 190. 12 Return to debug level 189. 13 Return to debug level 188. 14 Return to debug level 187. 15 Return to debug level 186. 16 Return to debug level 185. 17 Return to debug level 184. 18 Return to debug level 183. 19 Return to debug level 182. 20 Return to debug level 181. 21 Return to debug level 180. 22 Return to debug level 179. 23 Return to debug level 178. 24 Return to debug level 177. 25 Return to debug level 176. 26 Return to debug level 175. 27 Return to debug level 174. 28 Return to debug level 173. 29 Return to debug level 172. 30 Return to debug level 171. 31 Return to debug level 170. 32 Return to debug level 169. 33 Return to debug level 168. 34 Return to debug level 167. 35 Return to debug level 166. 36 Return to debug level 165. 37 Return to debug level 164. 38 Return to debug level 163. 39 Return to debug level 162. 40 Return to debug level 161. 41 Return to debug level 160. 42 Return to debug level 159. 43 Return to debug level 158. 44 Return to debug level 157. 45 Return to debug level 156. 46 Return to debug level 155. 47 Return to debug level 154. 48 Return to debug level 153. 49 Return to debug level 152. 50 Return to debug level 151. 51 Return to debug level 150. 52 Return to debug level 149. 53 Return to debug level 148. 54 Return to debug level 147. 55 Return to debug level 146. 56 Return to debug level 145. 57 Return to debug level 144. 58 Return to debug level 143. 59 Return to debug level 142. 60 Return to debug level 141. 61 Return to debug level 140. 62 Return to debug level 139. 63 Return to debug level 138. 64 Return to debug level 137. 65 Return to debug level 136. 66 Return to debug level 135. 67 Return to debug level 134. 68 Return to debug level 133. 69 Return to debug level 132. 70 Return to debug level 131. 71 Return to debug level 130. 72 Return to debug level 129. 73 Return to debug level 128. 74 Return to debug level 127. 75 Return to debug level 126. 76 Return to debug level 125. 77 Return to debug level 124. 78 Return to debug level 123. 79 Return to debug level 122. 80 Return to debug level 121. 81 Return to debug level 120. 82 Return to debug level 119. 83 Return to debug level 118. 84 Return to debug level 117. 85 Return to debug level 116. 86 Return to debug level 115. 87 Return to debug level 114. 88 Return to debug level 113. 89 Return to debug level 112. 90 Return to debug level 111. 91 Return to debug level 110. 92 Return to debug level 109. 93 Return to debug level 108. 94 Return to debug level 107. 95 Return to debug level 106. 96 Return to debug level 105. 97 Return to debug level 104. 98 Return to debug level 103. 99 Return to debug level 102. 100 Return to debug level 101. 101 Return to debug level 100. 102 Return to debug level 99. 103 Return to debug level 98. 104 Return to debug level 97. 105 Return to debug level 96. 106 Return to debug level 95. 107 Return to debug level 94. 108 Return to debug level 93. 109 Return to debug level 92. 110 Return to debug level 91. 111 Return to debug level 90. 112 Return to debug level 89. 113 Return to debug level 88. 114 Return to debug level 87. 115 Return to debug level 86. 116 Return to debug level 85. 117 Return to debug level 84. 118 Return to debug level 83. 119 Return to debug level 82. 120 Return to debug level 81. 121 Return to debug level 80. 122 Return to debug level 79. 123 Return to debug level 78. 124 Return to debug level 77. 125 Return to debug level 76. 126 Return to debug level 75. 127 Return to debug level 74. 128 Return to debug level 73. 129 Return to debug level 72. 130 Return to debug level 71. 131 Return to debug level 70. 132 Return to debug level 69. 133 Return to debug level 68. 134 Return to debug level 67. 135 Return to debug level 66. 136 Return to debug level 65. 137 Return to debug level 64. 138 Return to debug level 63. 139 Return to debug level 62. 140 Return to debug level 61. 141 Return to debug level 60. 142 Return to debug level 59. 143 Return to debug level 58. 144 Return to debug level 57. 145 Return to debug level 56. 146 Return to debug level 55. 147 Return to debug level 54. 148 Return to debug level 53. 149 Return to debug level 52. 150 Return to debug level 51. 151 Return to debug level 50. 152 Return to debug level 49. 153 Return to debug level 48. 154 Return to debug level 47. 155 Return to debug level 46. 156 Return to debug level 45. 157 Return to debug level 44. 158 Return to debug level 43. 159 Return to debug level 42. 160 Return to debug level 41. 161 Return to debug level 40. 162 Return to debug level 39. 163 Return to debug level 38. 164 Return to debug level 37. 165 Return to debug level 36. 166 Return to debug level 35. 167 Return to debug level 34. 168 Return to debug level 33. 169 Return to debug level 32. 170 Return to debug level 31. 171 Return to debug level 30. 172 Return to debug level 29. 173 Return to debug level 28. 174 Return to debug level 27. 175 Return to debug level 26. 176 Return to debug level 25. 177 Return to debug level 24. 178 Return to debug level 23. 179 Return to debug level 22. 180 Return to debug level 21. 181 Return to debug level 20. 182 Return to debug level 19. 183 Return to debug level 18. 184 Return to debug level 17. 185 Return to debug level 16. 186 Return to debug level 15. 187 Return to debug level 14. 188 Return to debug level 13. 189 Return to debug level 12. 190 Return to debug level 11. 191 Return to debug level 10. 192 Return to debug level 9. 193 Return to debug level 8. 194 Return to debug level 7. 195 Return to debug level 6. 196 Return to debug level 5. 197 Return to debug level 4. 198 Return to debug level 3. 199 Return to debug level 2. 200 Return to debug level 1. 201 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 201. 2 Return to debug level 200. 3 Return to debug level 199. 4 Return to debug level 198. 5 Return to debug level 197. 6 Return to debug level 196. 7 Return to debug level 195. 8 Return to debug level 194. 9 Return to debug level 193. 10 Return to debug level 192. 11 Return to debug level 191. 12 Return to debug level 190. 13 Return to debug level 189. 14 Return to debug level 188. 15 Return to debug level 187. 16 Return to debug level 186. 17 Return to debug level 185. 18 Return to debug level 184. 19 Return to debug level 183. 20 Return to debug level 182. 21 Return to debug level 181. 22 Return to debug level 180. 23 Return to debug level 179. 24 Return to debug level 178. 25 Return to debug level 177. 26 Return to debug level 176. 27 Return to debug level 175. 28 Return to debug level 174. 29 Return to debug level 173. 30 Return to debug level 172. 31 Return to debug level 171. 32 Return to debug level 170. 33 Return to debug level 169. 34 Return to debug level 168. 35 Return to debug level 167. 36 Return to debug level 166. 37 Return to debug level 165. 38 Return to debug level 164. 39 Return to debug level 163. 40 Return to debug level 162. 41 Return to debug level 161. 42 Return to debug level 160. 43 Return to debug level 159. 44 Return to debug level 158. 45 Return to debug level 157. 46 Return to debug level 156. 47 Return to debug level 155. 48 Return to debug level 154. 49 Return to debug level 153. 50 Return to debug level 152. 51 Return to debug level 151. 52 Return to debug level 150. 53 Return to debug level 149. 54 Return to debug level 148. 55 Return to debug level 147. 56 Return to debug level 146. 57 Return to debug level 145. 58 Return to debug level 144. 59 Return to debug level 143. 60 Return to debug level 142. 61 Return to debug level 141. 62 Return to debug level 140. 63 Return to debug level 139. 64 Return to debug level 138. 65 Return to debug level 137. 66 Return to debug level 136. 67 Return to debug level 135. 68 Return to debug level 134. 69 Return to debug level 133. 70 Return to debug level 132. 71 Return to debug level 131. 72 Return to debug level 130. 73 Return to debug level 129. 74 Return to debug level 128. 75 Return to debug level 127. 76 Return to debug level 126. 77 Return to debug level 125. 78 Return to debug level 124. 79 Return to debug level 123. 80 Return to debug level 122. 81 Return to debug level 121. 82 Return to debug level 120. 83 Return to debug level 119. 84 Return to debug level 118. 85 Return to debug level 117. 86 Return to debug level 116. 87 Return to debug level 115. 88 Return to debug level 114. 89 Return to debug level 113. 90 Return to debug level 112. 91 Return to debug level 111. 92 Return to debug level 110. 93 Return to debug level 109. 94 Return to debug level 108. 95 Return to debug level 107. 96 Return to debug level 106. 97 Return to debug level 105. 98 Return to debug level 104. 99 Return to debug level 103. 100 Return to debug level 102. 101 Return to debug level 101. 102 Return to debug level 100. 103 Return to debug level 99. 104 Return to debug level 98. 105 Return to debug level 97. 106 Return to debug level 96. 107 Return to debug level 95. 108 Return to debug level 94. 109 Return to debug level 93. 110 Return to debug level 92. 111 Return to debug level 91. 112 Return to debug level 90. 113 Return to debug level 89. 114 Return to debug level 88. 115 Return to debug level 87. 116 Return to debug level 86. 117 Return to debug level 85. 118 Return to debug level 84. 119 Return to debug level 83. 120 Return to debug level 82. 121 Return to debug level 81. 122 Return to debug level 80. 123 Return to debug level 79. 124 Return to debug level 78. 125 Return to debug level 77. 126 Return to debug level 76. 127 Return to debug level 75. 128 Return to debug level 74. 129 Return to debug level 73. 130 Return to debug level 72. 131 Return to debug level 71. 132 Return to debug level 70. 133 Return to debug level 69. 134 Return to debug level 68. 135 Return to debug level 67. 136 Return to debug level 66. 137 Return to debug level 65. 138 Return to debug level 64. 139 Return to debug level 63. 140 Return to debug level 62. 141 Return to debug level 61. 142 Return to debug level 60. 143 Return to debug level 59. 144 Return to debug level 58. 145 Return to debug level 57. 146 Return to debug level 56. 147 Return to debug level 55. 148 Return to debug level 54. 149 Return to debug level 53. 150 Return to debug level 52. 151 Return to debug level 51. 152 Return to debug level 50. 153 Return to debug level 49. 154 Return to debug level 48. 155 Return to debug level 47. 156 Return to debug level 46. 157 Return to debug level 45. 158 Return to debug level 44. 159 Return to debug level 43. 160 Return to debug level 42. 161 Return to debug level 41. 162 Return to debug level 40. 163 Return to debug level 39. 164 Return to debug level 38. 165 Return to debug level 37. 166 Return to debug level 36. 167 Return to debug level 35. 168 Return to debug level 34. 169 Return to debug level 33. 170 Return to debug level 32. 171 Return to debug level 31. 172 Return to debug level 30. 173 Return to debug level 29. 174 Return to debug level 28. 175 Return to debug level 27. 176 Return to debug level 26. 177 Return to debug level 25. 178 Return to debug level 24. 179 Return to debug level 23. 180 Return to debug level 22. 181 Return to debug level 21. 182 Return to debug level 20. 183 Return to debug level 19. 184 Return to debug level 18. 185 Return to debug level 17. 186 Return to debug level 16. 187 Return to debug level 15. 188 Return to debug level 14. 189 Return to debug level 13. 190 Return to debug level 12. 191 Return to debug level 11. 192 Return to debug level 10. 193 Return to debug level 9. 194 Return to debug level 8. 195 Return to debug level 7. 196 Return to debug level 6. 197 Return to debug level 5. 198 Return to debug level 4. 199 Return to debug level 3. 200 Return to debug level 2. 201 Return to debug level 1. 202 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 202. 2 Return to debug level 201. 3 Return to debug level 200. 4 Return to debug level 199. 5 Return to debug level 198. 6 Return to debug level 197. 7 Return to debug level 196. 8 Return to debug level 195. 9 Return to debug level 194. 10 Return to debug level 193. 11 Return to debug level 192. 12 Return to debug level 191. 13 Return to debug level 190. 14 Return to debug level 189. 15 Return to debug level 188. 16 Return to debug level 187. 17 Return to debug level 186. 18 Return to debug level 185. 19 Return to debug level 184. 20 Return to debug level 183. 21 Return to debug level 182. 22 Return to debug level 181. 23 Return to debug level 180. 24 Return to debug level 179. 25 Return to debug level 178. 26 Return to debug level 177. 27 Return to debug level 176. 28 Return to debug level 175. 29 Return to debug level 174. 30 Return to debug level 173. 31 Return to debug level 172. 32 Return to debug level 171. 33 Return to debug level 170. 34 Return to debug level 169. 35 Return to debug level 168. 36 Return to debug level 167. 37 Return to debug level 166. 38 Return to debug level 165. 39 Return to debug level 164. 40 Return to debug level 163. 41 Return to debug level 162. 42 Return to debug level 161. 43 Return to debug level 160. 44 Return to debug level 159. 45 Return to debug level 158. 46 Return to debug level 157. 47 Return to debug level 156. 48 Return to debug level 155. 49 Return to debug level 154. 50 Return to debug level 153. 51 Return to debug level 152. 52 Return to debug level 151. 53 Return to debug level 150. 54 Return to debug level 149. 55 Return to debug level 148. 56 Return to debug level 147. 57 Return to debug level 146. 58 Return to debug level 145. 59 Return to debug level 144. 60 Return to debug level 143. 61 Return to debug level 142. 62 Return to debug level 141. 63 Return to debug level 140. 64 Return to debug level 139. 65 Return to debug level 138. 66 Return to debug level 137. 67 Return to debug level 136. 68 Return to debug level 135. 69 Return to debug level 134. 70 Return to debug level 133. 71 Return to debug level 132. 72 Return to debug level 131. 73 Return to debug level 130. 74 Return to debug level 129. 75 Return to debug level 128. 76 Return to debug level 127. 77 Return to debug level 126. 78 Return to debug level 125. 79 Return to debug level 124. 80 Return to debug level 123. 81 Return to debug level 122. 82 Return to debug level 121. 83 Return to debug level 120. 84 Return to debug level 119. 85 Return to debug level 118. 86 Return to debug level 117. 87 Return to debug level 116. 88 Return to debug level 115. 89 Return to debug level 114. 90 Return to debug level 113. 91 Return to debug level 112. 92 Return to debug level 111. 93 Return to debug level 110. 94 Return to debug level 109. 95 Return to debug level 108. 96 Return to debug level 107. 97 Return to debug level 106. 98 Return to debug level 105. 99 Return to debug level 104. 100 Return to debug level 103. 101 Return to debug level 102. 102 Return to debug level 101. 103 Return to debug level 100. 104 Return to debug level 99. 105 Return to debug level 98. 106 Return to debug level 97. 107 Return to debug level 96. 108 Return to debug level 95. 109 Return to debug level 94. 110 Return to debug level 93. 111 Return to debug level 92. 112 Return to debug level 91. 113 Return to debug level 90. 114 Return to debug level 89. 115 Return to debug level 88. 116 Return to debug level 87. 117 Return to debug level 86. 118 Return to debug level 85. 119 Return to debug level 84. 120 Return to debug level 83. 121 Return to debug level 82. 122 Return to debug level 81. 123 Return to debug level 80. 124 Return to debug level 79. 125 Return to debug level 78. 126 Return to debug level 77. 127 Return to debug level 76. 128 Return to debug level 75. 129 Return to debug level 74. 130 Return to debug level 73. 131 Return to debug level 72. 132 Return to debug level 71. 133 Return to debug level 70. 134 Return to debug level 69. 135 Return to debug level 68. 136 Return to debug level 67. 137 Return to debug level 66. 138 Return to debug level 65. 139 Return to debug level 64. 140 Return to debug level 63. 141 Return to debug level 62. 142 Return to debug level 61. 143 Return to debug level 60. 144 Return to debug level 59. 145 Return to debug level 58. 146 Return to debug level 57. 147 Return to debug level 56. 148 Return to debug level 55. 149 Return to debug level 54. 150 Return to debug level 53. 151 Return to debug level 52. 152 Return to debug level 51. 153 Return to debug level 50. 154 Return to debug level 49. 155 Return to debug level 48. 156 Return to debug level 47. 157 Return to debug level 46. 158 Return to debug level 45. 159 Return to debug level 44. 160 Return to debug level 43. 161 Return to debug level 42. 162 Return to debug level 41. 163 Return to debug level 40. 164 Return to debug level 39. 165 Return to debug level 38. 166 Return to debug level 37. 167 Return to debug level 36. 168 Return to debug level 35. 169 Return to debug level 34. 170 Return to debug level 33. 171 Return to debug level 32. 172 Return to debug level 31. 173 Return to debug level 30. 174 Return to debug level 29. 175 Return to debug level 28. 176 Return to debug level 27. 177 Return to debug level 26. 178 Return to debug level 25. 179 Return to debug level 24. 180 Return to debug level 23. 181 Return to debug level 22. 182 Return to debug level 21. 183 Return to debug level 20. 184 Return to debug level 19. 185 Return to debug level 18. 186 Return to debug level 17. 187 Return to debug level 16. 188 Return to debug level 15. 189 Return to debug level 14. 190 Return to debug level 13. 191 Return to debug level 12. 192 Return to debug level 11. 193 Return to debug level 10. 194 Return to debug level 9. 195 Return to debug level 8. 196 Return to debug level 7. 197 Return to debug level 6. 198 Return to debug level 5. 199 Return to debug level 4. 200 Return to debug level 3. 201 Return to debug level 2. 202 Return to debug level 1. 203 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 203. 2 Return to debug level 202. 3 Return to debug level 201. 4 Return to debug level 200. 5 Return to debug level 199. 6 Return to debug level 198. 7 Return to debug level 197. 8 Return to debug level 196. 9 Return to debug level 195. 10 Return to debug level 194. 11 Return to debug level 193. 12 Return to debug level 192. 13 Return to debug level 191. 14 Return to debug level 190. 15 Return to debug level 189. 16 Return to debug level 188. 17 Return to debug level 187. 18 Return to debug level 186. 19 Return to debug level 185. 20 Return to debug level 184. 21 Return to debug level 183. 22 Return to debug level 182. 23 Return to debug level 181. 24 Return to debug level 180. 25 Return to debug level 179. 26 Return to debug level 178. 27 Return to debug level 177. 28 Return to debug level 176. 29 Return to debug level 175. 30 Return to debug level 174. 31 Return to debug level 173. 32 Return to debug level 172. 33 Return to debug level 171. 34 Return to debug level 170. 35 Return to debug level 169. 36 Return to debug level 168. 37 Return to debug level 167. 38 Return to debug level 166. 39 Return to debug level 165. 40 Return to debug level 164. 41 Return to debug level 163. 42 Return to debug level 162. 43 Return to debug level 161. 44 Return to debug level 160. 45 Return to debug level 159. 46 Return to debug level 158. 47 Return to debug level 157. 48 Return to debug level 156. 49 Return to debug level 155. 50 Return to debug level 154. 51 Return to debug level 153. 52 Return to debug level 152. 53 Return to debug level 151. 54 Return to debug level 150. 55 Return to debug level 149. 56 Return to debug level 148. 57 Return to debug level 147. 58 Return to debug level 146. 59 Return to debug level 145. 60 Return to debug level 144. 61 Return to debug level 143. 62 Return to debug level 142. 63 Return to debug level 141. 64 Return to debug level 140. 65 Return to debug level 139. 66 Return to debug level 138. 67 Return to debug level 137. 68 Return to debug level 136. 69 Return to debug level 135. 70 Return to debug level 134. 71 Return to debug level 133. 72 Return to debug level 132. 73 Return to debug level 131. 74 Return to debug level 130. 75 Return to debug level 129. 76 Return to debug level 128. 77 Return to debug level 127. 78 Return to debug level 126. 79 Return to debug level 125. 80 Return to debug level 124. 81 Return to debug level 123. 82 Return to debug level 122. 83 Return to debug level 121. 84 Return to debug level 120. 85 Return to debug level 119. 86 Return to debug level 118. 87 Return to debug level 117. 88 Return to debug level 116. 89 Return to debug level 115. 90 Return to debug level 114. 91 Return to debug level 113. 92 Return to debug level 112. 93 Return to debug level 111. 94 Return to debug level 110. 95 Return to debug level 109. 96 Return to debug level 108. 97 Return to debug level 107. 98 Return to debug level 106. 99 Return to debug level 105. 100 Return to debug level 104. 101 Return to debug level 103. 102 Return to debug level 102. 103 Return to debug level 101. 104 Return to debug level 100. 105 Return to debug level 99. 106 Return to debug level 98. 107 Return to debug level 97. 108 Return to debug level 96. 109 Return to debug level 95. 110 Return to debug level 94. 111 Return to debug level 93. 112 Return to debug level 92. 113 Return to debug level 91. 114 Return to debug level 90. 115 Return to debug level 89. 116 Return to debug level 88. 117 Return to debug level 87. 118 Return to debug level 86. 119 Return to debug level 85. 120 Return to debug level 84. 121 Return to debug level 83. 122 Return to debug level 82. 123 Return to debug level 81. 124 Return to debug level 80. 125 Return to debug level 79. 126 Return to debug level 78. 127 Return to debug level 77. 128 Return to debug level 76. 129 Return to debug level 75. 130 Return to debug level 74. 131 Return to debug level 73. 132 Return to debug level 72. 133 Return to debug level 71. 134 Return to debug level 70. 135 Return to debug level 69. 136 Return to debug level 68. 137 Return to debug level 67. 138 Return to debug level 66. 139 Return to debug level 65. 140 Return to debug level 64. 141 Return to debug level 63. 142 Return to debug level 62. 143 Return to debug level 61. 144 Return to debug level 60. 145 Return to debug level 59. 146 Return to debug level 58. 147 Return to debug level 57. 148 Return to debug level 56. 149 Return to debug level 55. 150 Return to debug level 54. 151 Return to debug level 53. 152 Return to debug level 52. 153 Return to debug level 51. 154 Return to debug level 50. 155 Return to debug level 49. 156 Return to debug level 48. 157 Return to debug level 47. 158 Return to debug level 46. 159 Return to debug level 45. 160 Return to debug level 44. 161 Return to debug level 43. 162 Return to debug level 42. 163 Return to debug level 41. 164 Return to debug level 40. 165 Return to debug level 39. 166 Return to debug level 38. 167 Return to debug level 37. 168 Return to debug level 36. 169 Return to debug level 35. 170 Return to debug level 34. 171 Return to debug level 33. 172 Return to debug level 32. 173 Return to debug level 31. 174 Return to debug level 30. 175 Return to debug level 29. 176 Return to debug level 28. 177 Return to debug level 27. 178 Return to debug level 26. 179 Return to debug level 25. 180 Return to debug level 24. 181 Return to debug level 23. 182 Return to debug level 22. 183 Return to debug level 21. 184 Return to debug level 20. 185 Return to debug level 19. 186 Return to debug level 18. 187 Return to debug level 17. 188 Return to debug level 16. 189 Return to debug level 15. 190 Return to debug level 14. 191 Return to debug level 13. 192 Return to debug level 12. 193 Return to debug level 11. 194 Return to debug level 10. 195 Return to debug level 9. 196 Return to debug level 8. 197 Return to debug level 7. 198 Return to debug level 6. 199 Return to debug level 5. 200 Return to debug level 4. 201 Return to debug level 3. 202 Return to debug level 2. 203 Return to debug level 1. 204 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 204. 2 Return to debug level 203. 3 Return to debug level 202. 4 Return to debug level 201. 5 Return to debug level 200. 6 Return to debug level 199. 7 Return to debug level 198. 8 Return to debug level 197. 9 Return to debug level 196. 10 Return to debug level 195. 11 Return to debug level 194. 12 Return to debug level 193. 13 Return to debug level 192. 14 Return to debug level 191. 15 Return to debug level 190. 16 Return to debug level 189. 17 Return to debug level 188. 18 Return to debug level 187. 19 Return to debug level 186. 20 Return to debug level 185. 21 Return to debug level 184. 22 Return to debug level 183. 23 Return to debug level 182. 24 Return to debug level 181. 25 Return to debug level 180. 26 Return to debug level 179. 27 Return to debug level 178. 28 Return to debug level 177. 29 Return to debug level 176. 30 Return to debug level 175. 31 Return to debug level 174. 32 Return to debug level 173. 33 Return to debug level 172. 34 Return to debug level 171. 35 Return to debug level 170. 36 Return to debug level 169. 37 Return to debug level 168. 38 Return to debug level 167. 39 Return to debug level 166. 40 Return to debug level 165. 41 Return to debug level 164. 42 Return to debug level 163. 43 Return to debug level 162. 44 Return to debug level 161. 45 Return to debug level 160. 46 Return to debug level 159. 47 Return to debug level 158. 48 Return to debug level 157. 49 Return to debug level 156. 50 Return to debug level 155. 51 Return to debug level 154. 52 Return to debug level 153. 53 Return to debug level 152. 54 Return to debug level 151. 55 Return to debug level 150. 56 Return to debug level 149. 57 Return to debug level 148. 58 Return to debug level 147. 59 Return to debug level 146. 60 Return to debug level 145. 61 Return to debug level 144. 62 Return to debug level 143. 63 Return to debug level 142. 64 Return to debug level 141. 65 Return to debug level 140. 66 Return to debug level 139. 67 Return to debug level 138. 68 Return to debug level 137. 69 Return to debug level 136. 70 Return to debug level 135. 71 Return to debug level 134. 72 Return to debug level 133. 73 Return to debug level 132. 74 Return to debug level 131. 75 Return to debug level 130. 76 Return to debug level 129. 77 Return to debug level 128. 78 Return to debug level 127. 79 Return to debug level 126. 80 Return to debug level 125. 81 Return to debug level 124. 82 Return to debug level 123. 83 Return to debug level 122. 84 Return to debug level 121. 85 Return to debug level 120. 86 Return to debug level 119. 87 Return to debug level 118. 88 Return to debug level 117. 89 Return to debug level 116. 90 Return to debug level 115. 91 Return to debug level 114. 92 Return to debug level 113. 93 Return to debug level 112. 94 Return to debug level 111. 95 Return to debug level 110. 96 Return to debug level 109. 97 Return to debug level 108. 98 Return to debug level 107. 99 Return to debug level 106. 100 Return to debug level 105. 101 Return to debug level 104. 102 Return to debug level 103. 103 Return to debug level 102. 104 Return to debug level 101. 105 Return to debug level 100. 106 Return to debug level 99. 107 Return to debug level 98. 108 Return to debug level 97. 109 Return to debug level 96. 110 Return to debug level 95. 111 Return to debug level 94. 112 Return to debug level 93. 113 Return to debug level 92. 114 Return to debug level 91. 115 Return to debug level 90. 116 Return to debug level 89. 117 Return to debug level 88. 118 Return to debug level 87. 119 Return to debug level 86. 120 Return to debug level 85. 121 Return to debug level 84. 122 Return to debug level 83. 123 Return to debug level 82. 124 Return to debug level 81. 125 Return to debug level 80. 126 Return to debug level 79. 127 Return to debug level 78. 128 Return to debug level 77. 129 Return to debug level 76. 130 Return to debug level 75. 131 Return to debug level 74. 132 Return to debug level 73. 133 Return to debug level 72. 134 Return to debug level 71. 135 Return to debug level 70. 136 Return to debug level 69. 137 Return to debug level 68. 138 Return to debug level 67. 139 Return to debug level 66. 140 Return to debug level 65. 141 Return to debug level 64. 142 Return to debug level 63. 143 Return to debug level 62. 144 Return to debug level 61. 145 Return to debug level 60. 146 Return to debug level 59. 147 Return to debug level 58. 148 Return to debug level 57. 149 Return to debug level 56. 150 Return to debug level 55. 151 Return to debug level 54. 152 Return to debug level 53. 153 Return to debug level 52. 154 Return to debug level 51. 155 Return to debug level 50. 156 Return to debug level 49. 157 Return to debug level 48. 158 Return to debug level 47. 159 Return to debug level 46. 160 Return to debug level 45. 161 Return to debug level 44. 162 Return to debug level 43. 163 Return to debug level 42. 164 Return to debug level 41. 165 Return to debug level 40. 166 Return to debug level 39. 167 Return to debug level 38. 168 Return to debug level 37. 169 Return to debug level 36. 170 Return to debug level 35. 171 Return to debug level 34. 172 Return to debug level 33. 173 Return to debug level 32. 174 Return to debug level 31. 175 Return to debug level 30. 176 Return to debug level 29. 177 Return to debug level 28. 178 Return to debug level 27. 179 Return to debug level 26. 180 Return to debug level 25. 181 Return to debug level 24. 182 Return to debug level 23. 183 Return to debug level 22. 184 Return to debug level 21. 185 Return to debug level 20. 186 Return to debug level 19. 187 Return to debug level 18. 188 Return to debug level 17. 189 Return to debug level 16. 190 Return to debug level 15. 191 Return to debug level 14. 192 Return to debug level 13. 193 Return to debug level 12. 194 Return to debug level 11. 195 Return to debug level 10. 196 Return to debug level 9. 197 Return to debug level 8. 198 Return to debug level 7. 199 Return to debug level 6. 200 Return to debug level 5. 201 Return to debug level 4. 202 Return to debug level 3. 203 Return to debug level 2. 204 Return to debug level 1. 205 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 205. 2 Return to debug level 204. 3 Return to debug level 203. 4 Return to debug level 202. 5 Return to debug level 201. 6 Return to debug level 200. 7 Return to debug level 199. 8 Return to debug level 198. 9 Return to debug level 197. 10 Return to debug level 196. 11 Return to debug level 195. 12 Return to debug level 194. 13 Return to debug level 193. 14 Return to debug level 192. 15 Return to debug level 191. 16 Return to debug level 190. 17 Return to debug level 189. 18 Return to debug level 188. 19 Return to debug level 187. 20 Return to debug level 186. 21 Return to debug level 185. 22 Return to debug level 184. 23 Return to debug level 183. 24 Return to debug level 182. 25 Return to debug level 181. 26 Return to debug level 180. 27 Return to debug level 179. 28 Return to debug level 178. 29 Return to debug level 177. 30 Return to debug level 176. 31 Return to debug level 175. 32 Return to debug level 174. 33 Return to debug level 173. 34 Return to debug level 172. 35 Return to debug level 171. 36 Return to debug level 170. 37 Return to debug level 169. 38 Return to debug level 168. 39 Return to debug level 167. 40 Return to debug level 166. 41 Return to debug level 165. 42 Return to debug level 164. 43 Return to debug level 163. 44 Return to debug level 162. 45 Return to debug level 161. 46 Return to debug level 160. 47 Return to debug level 159. 48 Return to debug level 158. 49 Return to debug level 157. 50 Return to debug level 156. 51 Return to debug level 155. 52 Return to debug level 154. 53 Return to debug level 153. 54 Return to debug level 152. 55 Return to debug level 151. 56 Return to debug level 150. 57 Return to debug level 149. 58 Return to debug level 148. 59 Return to debug level 147. 60 Return to debug level 146. 61 Return to debug level 145. 62 Return to debug level 144. 63 Return to debug level 143. 64 Return to debug level 142. 65 Return to debug level 141. 66 Return to debug level 140. 67 Return to debug level 139. 68 Return to debug level 138. 69 Return to debug level 137. 70 Return to debug level 136. 71 Return to debug level 135. 72 Return to debug level 134. 73 Return to debug level 133. 74 Return to debug level 132. 75 Return to debug level 131. 76 Return to debug level 130. 77 Return to debug level 129. 78 Return to debug level 128. 79 Return to debug level 127. 80 Return to debug level 126. 81 Return to debug level 125. 82 Return to debug level 124. 83 Return to debug level 123. 84 Return to debug level 122. 85 Return to debug level 121. 86 Return to debug level 120. 87 Return to debug level 119. 88 Return to debug level 118. 89 Return to debug level 117. 90 Return to debug level 116. 91 Return to debug level 115. 92 Return to debug level 114. 93 Return to debug level 113. 94 Return to debug level 112. 95 Return to debug level 111. 96 Return to debug level 110. 97 Return to debug level 109. 98 Return to debug level 108. 99 Return to debug level 107. 100 Return to debug level 106. 101 Return to debug level 105. 102 Return to debug level 104. 103 Return to debug level 103. 104 Return to debug level 102. 105 Return to debug level 101. 106 Return to debug level 100. 107 Return to debug level 99. 108 Return to debug level 98. 109 Return to debug level 97. 110 Return to debug level 96. 111 Return to debug level 95. 112 Return to debug level 94. 113 Return to debug level 93. 114 Return to debug level 92. 115 Return to debug level 91. 116 Return to debug level 90. 117 Return to debug level 89. 118 Return to debug level 88. 119 Return to debug level 87. 120 Return to debug level 86. 121 Return to debug level 85. 122 Return to debug level 84. 123 Return to debug level 83. 124 Return to debug level 82. 125 Return to debug level 81. 126 Return to debug level 80. 127 Return to debug level 79. 128 Return to debug level 78. 129 Return to debug level 77. 130 Return to debug level 76. 131 Return to debug level 75. 132 Return to debug level 74. 133 Return to debug level 73. 134 Return to debug level 72. 135 Return to debug level 71. 136 Return to debug level 70. 137 Return to debug level 69. 138 Return to debug level 68. 139 Return to debug level 67. 140 Return to debug level 66. 141 Return to debug level 65. 142 Return to debug level 64. 143 Return to debug level 63. 144 Return to debug level 62. 145 Return to debug level 61. 146 Return to debug level 60. 147 Return to debug level 59. 148 Return to debug level 58. 149 Return to debug level 57. 150 Return to debug level 56. 151 Return to debug level 55. 152 Return to debug level 54. 153 Return to debug level 53. 154 Return to debug level 52. 155 Return to debug level 51. 156 Return to debug level 50. 157 Return to debug level 49. 158 Return to debug level 48. 159 Return to debug level 47. 160 Return to debug level 46. 161 Return to debug level 45. 162 Return to debug level 44. 163 Return to debug level 43. 164 Return to debug level 42. 165 Return to debug level 41. 166 Return to debug level 40. 167 Return to debug level 39. 168 Return to debug level 38. 169 Return to debug level 37. 170 Return to debug level 36. 171 Return to debug level 35. 172 Return to debug level 34. 173 Return to debug level 33. 174 Return to debug level 32. 175 Return to debug level 31. 176 Return to debug level 30. 177 Return to debug level 29. 178 Return to debug level 28. 179 Return to debug level 27. 180 Return to debug level 26. 181 Return to debug level 25. 182 Return to debug level 24. 183 Return to debug level 23. 184 Return to debug level 22. 185 Return to debug level 21. 186 Return to debug level 20. 187 Return to debug level 19. 188 Return to debug level 18. 189 Return to debug level 17. 190 Return to debug level 16. 191 Return to debug level 15. 192 Return to debug level 14. 193 Return to debug level 13. 194 Return to debug level 12. 195 Return to debug level 11. 196 Return to debug level 10. 197 Return to debug level 9. 198 Return to debug level 8. 199 Return to debug level 7. 200 Return to debug level 6. 201 Return to debug level 5. 202 Return to debug level 4. 203 Return to debug level 3. 204 Return to debug level 2. 205 Return to debug level 1. 206 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 206. 2 Return to debug level 205. 3 Return to debug level 204. 4 Return to debug level 203. 5 Return to debug level 202. 6 Return to debug level 201. 7 Return to debug level 200. 8 Return to debug level 199. 9 Return to debug level 198. 10 Return to debug level 197. 11 Return to debug level 196. 12 Return to debug level 195. 13 Return to debug level 194. 14 Return to debug level 193. 15 Return to debug level 192. 16 Return to debug level 191. 17 Return to debug level 190. 18 Return to debug level 189. 19 Return to debug level 188. 20 Return to debug level 187. 21 Return to debug level 186. 22 Return to debug level 185. 23 Return to debug level 184. 24 Return to debug level 183. 25 Return to debug level 182. 26 Return to debug level 181. 27 Return to debug level 180. 28 Return to debug level 179. 29 Return to debug level 178. 30 Return to debug level 177. 31 Return to debug level 176. 32 Return to debug level 175. 33 Return to debug level 174. 34 Return to debug level 173. 35 Return to debug level 172. 36 Return to debug level 171. 37 Return to debug level 170. 38 Return to debug level 169. 39 Return to debug level 168. 40 Return to debug level 167. 41 Return to debug level 166. 42 Return to debug level 165. 43 Return to debug level 164. 44 Return to debug level 163. 45 Return to debug level 162. 46 Return to debug level 161. 47 Return to debug level 160. 48 Return to debug level 159. 49 Return to debug level 158. 50 Return to debug level 157. 51 Return to debug level 156. 52 Return to debug level 155. 53 Return to debug level 154. 54 Return to debug level 153. 55 Return to debug level 152. 56 Return to debug level 151. 57 Return to debug level 150. 58 Return to debug level 149. 59 Return to debug level 148. 60 Return to debug level 147. 61 Return to debug level 146. 62 Return to debug level 145. 63 Return to debug level 144. 64 Return to debug level 143. 65 Return to debug level 142. 66 Return to debug level 141. 67 Return to debug level 140. 68 Return to debug level 139. 69 Return to debug level 138. 70 Return to debug level 137. 71 Return to debug level 136. 72 Return to debug level 135. 73 Return to debug level 134. 74 Return to debug level 133. 75 Return to debug level 132. 76 Return to debug level 131. 77 Return to debug level 130. 78 Return to debug level 129. 79 Return to debug level 128. 80 Return to debug level 127. 81 Return to debug level 126. 82 Return to debug level 125. 83 Return to debug level 124. 84 Return to debug level 123. 85 Return to debug level 122. 86 Return to debug level 121. 87 Return to debug level 120. 88 Return to debug level 119. 89 Return to debug level 118. 90 Return to debug level 117. 91 Return to debug level 116. 92 Return to debug level 115. 93 Return to debug level 114. 94 Return to debug level 113. 95 Return to debug level 112. 96 Return to debug level 111. 97 Return to debug level 110. 98 Return to debug level 109. 99 Return to debug level 108. 100 Return to debug level 107. 101 Return to debug level 106. 102 Return to debug level 105. 103 Return to debug level 104. 104 Return to debug level 103. 105 Return to debug level 102. 106 Return to debug level 101. 107 Return to debug level 100. 108 Return to debug level 99. 109 Return to debug level 98. 110 Return to debug level 97. 111 Return to debug level 96. 112 Return to debug level 95. 113 Return to debug level 94. 114 Return to debug level 93. 115 Return to debug level 92. 116 Return to debug level 91. 117 Return to debug level 90. 118 Return to debug level 89. 119 Return to debug level 88. 120 Return to debug level 87. 121 Return to debug level 86. 122 Return to debug level 85. 123 Return to debug level 84. 124 Return to debug level 83. 125 Return to debug level 82. 126 Return to debug level 81. 127 Return to debug level 80. 128 Return to debug level 79. 129 Return to debug level 78. 130 Return to debug level 77. 131 Return to debug level 76. 132 Return to debug level 75. 133 Return to debug level 74. 134 Return to debug level 73. 135 Return to debug level 72. 136 Return to debug level 71. 137 Return to debug level 70. 138 Return to debug level 69. 139 Return to debug level 68. 140 Return to debug level 67. 141 Return to debug level 66. 142 Return to debug level 65. 143 Return to debug level 64. 144 Return to debug level 63. 145 Return to debug level 62. 146 Return to debug level 61. 147 Return to debug level 60. 148 Return to debug level 59. 149 Return to debug level 58. 150 Return to debug level 57. 151 Return to debug level 56. 152 Return to debug level 55. 153 Return to debug level 54. 154 Return to debug level 53. 155 Return to debug level 52. 156 Return to debug level 51. 157 Return to debug level 50. 158 Return to debug level 49. 159 Return to debug level 48. 160 Return to debug level 47. 161 Return to debug level 46. 162 Return to debug level 45. 163 Return to debug level 44. 164 Return to debug level 43. 165 Return to debug level 42. 166 Return to debug level 41. 167 Return to debug level 40. 168 Return to debug level 39. 169 Return to debug level 38. 170 Return to debug level 37. 171 Return to debug level 36. 172 Return to debug level 35. 173 Return to debug level 34. 174 Return to debug level 33. 175 Return to debug level 32. 176 Return to debug level 31. 177 Return to debug level 30. 178 Return to debug level 29. 179 Return to debug level 28. 180 Return to debug level 27. 181 Return to debug level 26. 182 Return to debug level 25. 183 Return to debug level 24. 184 Return to debug level 23. 185 Return to debug level 22. 186 Return to debug level 21. 187 Return to debug level 20. 188 Return to debug level 19. 189 Return to debug level 18. 190 Return to debug level 17. 191 Return to debug level 16. 192 Return to debug level 15. 193 Return to debug level 14. 194 Return to debug level 13. 195 Return to debug level 12. 196 Return to debug level 11. 197 Return to debug level 10. 198 Return to debug level 9. 199 Return to debug level 8. 200 Return to debug level 7. 201 Return to debug level 6. 202 Return to debug level 5. 203 Return to debug level 4. 204 Return to debug level 3. 205 Return to debug level 2. 206 Return to debug level 1. 207 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 207. 2 Return to debug level 206. 3 Return to debug level 205. 4 Return to debug level 204. 5 Return to debug level 203. 6 Return to debug level 202. 7 Return to debug level 201. 8 Return to debug level 200. 9 Return to debug level 199. 10 Return to debug level 198. 11 Return to debug level 197. 12 Return to debug level 196. 13 Return to debug level 195. 14 Return to debug level 194. 15 Return to debug level 193. 16 Return to debug level 192. 17 Return to debug level 191. 18 Return to debug level 190. 19 Return to debug level 189. 20 Return to debug level 188. 21 Return to debug level 187. 22 Return to debug level 186. 23 Return to debug level 185. 24 Return to debug level 184. 25 Return to debug level 183. 26 Return to debug level 182. 27 Return to debug level 181. 28 Return to debug level 180. 29 Return to debug level 179. 30 Return to debug level 178. 31 Return to debug level 177. 32 Return to debug level 176. 33 Return to debug level 175. 34 Return to debug level 174. 35 Return to debug level 173. 36 Return to debug level 172. 37 Return to debug level 171. 38 Return to debug level 170. 39 Return to debug level 169. 40 Return to debug level 168. 41 Return to debug level 167. 42 Return to debug level 166. 43 Return to debug level 165. 44 Return to debug level 164. 45 Return to debug level 163. 46 Return to debug level 162. 47 Return to debug level 161. 48 Return to debug level 160. 49 Return to debug level 159. 50 Return to debug level 158. 51 Return to debug level 157. 52 Return to debug level 156. 53 Return to debug level 155. 54 Return to debug level 154. 55 Return to debug level 153. 56 Return to debug level 152. 57 Return to debug level 151. 58 Return to debug level 150. 59 Return to debug level 149. 60 Return to debug level 148. 61 Return to debug level 147. 62 Return to debug level 146. 63 Return to debug level 145. 64 Return to debug level 144. 65 Return to debug level 143. 66 Return to debug level 142. 67 Return to debug level 141. 68 Return to debug level 140. 69 Return to debug level 139. 70 Return to debug level 138. 71 Return to debug level 137. 72 Return to debug level 136. 73 Return to debug level 135. 74 Return to debug level 134. 75 Return to debug level 133. 76 Return to debug level 132. 77 Return to debug level 131. 78 Return to debug level 130. 79 Return to debug level 129. 80 Return to debug level 128. 81 Return to debug level 127. 82 Return to debug level 126. 83 Return to debug level 125. 84 Return to debug level 124. 85 Return to debug level 123. 86 Return to debug level 122. 87 Return to debug level 121. 88 Return to debug level 120. 89 Return to debug level 119. 90 Return to debug level 118. 91 Return to debug level 117. 92 Return to debug level 116. 93 Return to debug level 115. 94 Return to debug level 114. 95 Return to debug level 113. 96 Return to debug level 112. 97 Return to debug level 111. 98 Return to debug level 110. 99 Return to debug level 109. 100 Return to debug level 108. 101 Return to debug level 107. 102 Return to debug level 106. 103 Return to debug level 105. 104 Return to debug level 104. 105 Return to debug level 103. 106 Return to debug level 102. 107 Return to debug level 101. 108 Return to debug level 100. 109 Return to debug level 99. 110 Return to debug level 98. 111 Return to debug level 97. 112 Return to debug level 96. 113 Return to debug level 95. 114 Return to debug level 94. 115 Return to debug level 93. 116 Return to debug level 92. 117 Return to debug level 91. 118 Return to debug level 90. 119 Return to debug level 89. 120 Return to debug level 88. 121 Return to debug level 87. 122 Return to debug level 86. 123 Return to debug level 85. 124 Return to debug level 84. 125 Return to debug level 83. 126 Return to debug level 82. 127 Return to debug level 81. 128 Return to debug level 80. 129 Return to debug level 79. 130 Return to debug level 78. 131 Return to debug level 77. 132 Return to debug level 76. 133 Return to debug level 75. 134 Return to debug level 74. 135 Return to debug level 73. 136 Return to debug level 72. 137 Return to debug level 71. 138 Return to debug level 70. 139 Return to debug level 69. 140 Return to debug level 68. 141 Return to debug level 67. 142 Return to debug level 66. 143 Return to debug level 65. 144 Return to debug level 64. 145 Return to debug level 63. 146 Return to debug level 62. 147 Return to debug level 61. 148 Return to debug level 60. 149 Return to debug level 59. 150 Return to debug level 58. 151 Return to debug level 57. 152 Return to debug level 56. 153 Return to debug level 55. 154 Return to debug level 54. 155 Return to debug level 53. 156 Return to debug level 52. 157 Return to debug level 51. 158 Return to debug level 50. 159 Return to debug level 49. 160 Return to debug level 48. 161 Return to debug level 47. 162 Return to debug level 46. 163 Return to debug level 45. 164 Return to debug level 44. 165 Return to debug level 43. 166 Return to debug level 42. 167 Return to debug level 41. 168 Return to debug level 40. 169 Return to debug level 39. 170 Return to debug level 38. 171 Return to debug level 37. 172 Return to debug level 36. 173 Return to debug level 35. 174 Return to debug level 34. 175 Return to debug level 33. 176 Return to debug level 32. 177 Return to debug level 31. 178 Return to debug level 30. 179 Return to debug level 29. 180 Return to debug level 28. 181 Return to debug level 27. 182 Return to debug level 26. 183 Return to debug level 25. 184 Return to debug level 24. 185 Return to debug level 23. 186 Return to debug level 22. 187 Return to debug level 21. 188 Return to debug level 20. 189 Return to debug level 19. 190 Return to debug level 18. 191 Return to debug level 17. 192 Return to debug level 16. 193 Return to debug level 15. 194 Return to debug level 14. 195 Return to debug level 13. 196 Return to debug level 12. 197 Return to debug level 11. 198 Return to debug level 10. 199 Return to debug level 9. 200 Return to debug level 8. 201 Return to debug level 7. 202 Return to debug level 6. 203 Return to debug level 5. 204 Return to debug level 4. 205 Return to debug level 3. 206 Return to debug level 2. 207 Return to debug level 1. 208 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 208. 2 Return to debug level 207. 3 Return to debug level 206. 4 Return to debug level 205. 5 Return to debug level 204. 6 Return to debug level 203. 7 Return to debug level 202. 8 Return to debug level 201. 9 Return to debug level 200. 10 Return to debug level 199. 11 Return to debug level 198. 12 Return to debug level 197. 13 Return to debug level 196. 14 Return to debug level 195. 15 Return to debug level 194. 16 Return to debug level 193. 17 Return to debug level 192. 18 Return to debug level 191. 19 Return to debug level 190. 20 Return to debug level 189. 21 Return to debug level 188. 22 Return to debug level 187. 23 Return to debug level 186. 24 Return to debug level 185. 25 Return to debug level 184. 26 Return to debug level 183. 27 Return to debug level 182. 28 Return to debug level 181. 29 Return to debug level 180. 30 Return to debug level 179. 31 Return to debug level 178. 32 Return to debug level 177. 33 Return to debug level 176. 34 Return to debug level 175. 35 Return to debug level 174. 36 Return to debug level 173. 37 Return to debug level 172. 38 Return to debug level 171. 39 Return to debug level 170. 40 Return to debug level 169. 41 Return to debug level 168. 42 Return to debug level 167. 43 Return to debug level 166. 44 Return to debug level 165. 45 Return to debug level 164. 46 Return to debug level 163. 47 Return to debug level 162. 48 Return to debug level 161. 49 Return to debug level 160. 50 Return to debug level 159. 51 Return to debug level 158. 52 Return to debug level 157. 53 Return to debug level 156. 54 Return to debug level 155. 55 Return to debug level 154. 56 Return to debug level 153. 57 Return to debug level 152. 58 Return to debug level 151. 59 Return to debug level 150. 60 Return to debug level 149. 61 Return to debug level 148. 62 Return to debug level 147. 63 Return to debug level 146. 64 Return to debug level 145. 65 Return to debug level 144. 66 Return to debug level 143. 67 Return to debug level 142. 68 Return to debug level 141. 69 Return to debug level 140. 70 Return to debug level 139. 71 Return to debug level 138. 72 Return to debug level 137. 73 Return to debug level 136. 74 Return to debug level 135. 75 Return to debug level 134. 76 Return to debug level 133. 77 Return to debug level 132. 78 Return to debug level 131. 79 Return to debug level 130. 80 Return to debug level 129. 81 Return to debug level 128. 82 Return to debug level 127. 83 Return to debug level 126. 84 Return to debug level 125. 85 Return to debug level 124. 86 Return to debug level 123. 87 Return to debug level 122. 88 Return to debug level 121. 89 Return to debug level 120. 90 Return to debug level 119. 91 Return to debug level 118. 92 Return to debug level 117. 93 Return to debug level 116. 94 Return to debug level 115. 95 Return to debug level 114. 96 Return to debug level 113. 97 Return to debug level 112. 98 Return to debug level 111. 99 Return to debug level 110. 100 Return to debug level 109. 101 Return to debug level 108. 102 Return to debug level 107. 103 Return to debug level 106. 104 Return to debug level 105. 105 Return to debug level 104. 106 Return to debug level 103. 107 Return to debug level 102. 108 Return to debug level 101. 109 Return to debug level 100. 110 Return to debug level 99. 111 Return to debug level 98. 112 Return to debug level 97. 113 Return to debug level 96. 114 Return to debug level 95. 115 Return to debug level 94. 116 Return to debug level 93. 117 Return to debug level 92. 118 Return to debug level 91. 119 Return to debug level 90. 120 Return to debug level 89. 121 Return to debug level 88. 122 Return to debug level 87. 123 Return to debug level 86. 124 Return to debug level 85. 125 Return to debug level 84. 126 Return to debug level 83. 127 Return to debug level 82. 128 Return to debug level 81. 129 Return to debug level 80. 130 Return to debug level 79. 131 Return to debug level 78. 132 Return to debug level 77. 133 Return to debug level 76. 134 Return to debug level 75. 135 Return to debug level 74. 136 Return to debug level 73. 137 Return to debug level 72. 138 Return to debug level 71. 139 Return to debug level 70. 140 Return to debug level 69. 141 Return to debug level 68. 142 Return to debug level 67. 143 Return to debug level 66. 144 Return to debug level 65. 145 Return to debug level 64. 146 Return to debug level 63. 147 Return to debug level 62. 148 Return to debug level 61. 149 Return to debug level 60. 150 Return to debug level 59. 151 Return to debug level 58. 152 Return to debug level 57. 153 Return to debug level 56. 154 Return to debug level 55. 155 Return to debug level 54. 156 Return to debug level 53. 157 Return to debug level 52. 158 Return to debug level 51. 159 Return to debug level 50. 160 Return to debug level 49. 161 Return to debug level 48. 162 Return to debug level 47. 163 Return to debug level 46. 164 Return to debug level 45. 165 Return to debug level 44. 166 Return to debug level 43. 167 Return to debug level 42. 168 Return to debug level 41. 169 Return to debug level 40. 170 Return to debug level 39. 171 Return to debug level 38. 172 Return to debug level 37. 173 Return to debug level 36. 174 Return to debug level 35. 175 Return to debug level 34. 176 Return to debug level 33. 177 Return to debug level 32. 178 Return to debug level 31. 179 Return to debug level 30. 180 Return to debug level 29. 181 Return to debug level 28. 182 Return to debug level 27. 183 Return to debug level 26. 184 Return to debug level 25. 185 Return to debug level 24. 186 Return to debug level 23. 187 Return to debug level 22. 188 Return to debug level 21. 189 Return to debug level 20. 190 Return to debug level 19. 191 Return to debug level 18. 192 Return to debug level 17. 193 Return to debug level 16. 194 Return to debug level 15. 195 Return to debug level 14. 196 Return to debug level 13. 197 Return to debug level 12. 198 Return to debug level 11. 199 Return to debug level 10. 200 Return to debug level 9. 201 Return to debug level 8. 202 Return to debug level 7. 203 Return to debug level 6. 204 Return to debug level 5. 205 Return to debug level 4. 206 Return to debug level 3. 207 Return to debug level 2. 208 Return to debug level 1. 209 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 209. 2 Return to debug level 208. 3 Return to debug level 207. 4 Return to debug level 206. 5 Return to debug level 205. 6 Return to debug level 204. 7 Return to debug level 203. 8 Return to debug level 202. 9 Return to debug level 201. 10 Return to debug level 200. 11 Return to debug level 199. 12 Return to debug level 198. 13 Return to debug level 197. 14 Return to debug level 196. 15 Return to debug level 195. 16 Return to debug level 194. 17 Return to debug level 193. 18 Return to debug level 192. 19 Return to debug level 191. 20 Return to debug level 190. 21 Return to debug level 189. 22 Return to debug level 188. 23 Return to debug level 187. 24 Return to debug level 186. 25 Return to debug level 185. 26 Return to debug level 184. 27 Return to debug level 183. 28 Return to debug level 182. 29 Return to debug level 181. 30 Return to debug level 180. 31 Return to debug level 179. 32 Return to debug level 178. 33 Return to debug level 177. 34 Return to debug level 176. 35 Return to debug level 175. 36 Return to debug level 174. 37 Return to debug level 173. 38 Return to debug level 172. 39 Return to debug level 171. 40 Return to debug level 170. 41 Return to debug level 169. 42 Return to debug level 168. 43 Return to debug level 167. 44 Return to debug level 166. 45 Return to debug level 165. 46 Return to debug level 164. 47 Return to debug level 163. 48 Return to debug level 162. 49 Return to debug level 161. 50 Return to debug level 160. 51 Return to debug level 159. 52 Return to debug level 158. 53 Return to debug level 157. 54 Return to debug level 156. 55 Return to debug level 155. 56 Return to debug level 154. 57 Return to debug level 153. 58 Return to debug level 152. 59 Return to debug level 151. 60 Return to debug level 150. 61 Return to debug level 149. 62 Return to debug level 148. 63 Return to debug level 147. 64 Return to debug level 146. 65 Return to debug level 145. 66 Return to debug level 144. 67 Return to debug level 143. 68 Return to debug level 142. 69 Return to debug level 141. 70 Return to debug level 140. 71 Return to debug level 139. 72 Return to debug level 138. 73 Return to debug level 137. 74 Return to debug level 136. 75 Return to debug level 135. 76 Return to debug level 134. 77 Return to debug level 133. 78 Return to debug level 132. 79 Return to debug level 131. 80 Return to debug level 130. 81 Return to debug level 129. 82 Return to debug level 128. 83 Return to debug level 127. 84 Return to debug level 126. 85 Return to debug level 125. 86 Return to debug level 124. 87 Return to debug level 123. 88 Return to debug level 122. 89 Return to debug level 121. 90 Return to debug level 120. 91 Return to debug level 119. 92 Return to debug level 118. 93 Return to debug level 117. 94 Return to debug level 116. 95 Return to debug level 115. 96 Return to debug level 114. 97 Return to debug level 113. 98 Return to debug level 112. 99 Return to debug level 111. 100 Return to debug level 110. 101 Return to debug level 109. 102 Return to debug level 108. 103 Return to debug level 107. 104 Return to debug level 106. 105 Return to debug level 105. 106 Return to debug level 104. 107 Return to debug level 103. 108 Return to debug level 102. 109 Return to debug level 101. 110 Return to debug level 100. 111 Return to debug level 99. 112 Return to debug level 98. 113 Return to debug level 97. 114 Return to debug level 96. 115 Return to debug level 95. 116 Return to debug level 94. 117 Return to debug level 93. 118 Return to debug level 92. 119 Return to debug level 91. 120 Return to debug level 90. 121 Return to debug level 89. 122 Return to debug level 88. 123 Return to debug level 87. 124 Return to debug level 86. 125 Return to debug level 85. 126 Return to debug level 84. 127 Return to debug level 83. 128 Return to debug level 82. 129 Return to debug level 81. 130 Return to debug level 80. 131 Return to debug level 79. 132 Return to debug level 78. 133 Return to debug level 77. 134 Return to debug level 76. 135 Return to debug level 75. 136 Return to debug level 74. 137 Return to debug level 73. 138 Return to debug level 72. 139 Return to debug level 71. 140 Return to debug level 70. 141 Return to debug level 69. 142 Return to debug level 68. 143 Return to debug level 67. 144 Return to debug level 66. 145 Return to debug level 65. 146 Return to debug level 64. 147 Return to debug level 63. 148 Return to debug level 62. 149 Return to debug level 61. 150 Return to debug level 60. 151 Return to debug level 59. 152 Return to debug level 58. 153 Return to debug level 57. 154 Return to debug level 56. 155 Return to debug level 55. 156 Return to debug level 54. 157 Return to debug level 53. 158 Return to debug level 52. 159 Return to debug level 51. 160 Return to debug level 50. 161 Return to debug level 49. 162 Return to debug level 48. 163 Return to debug level 47. 164 Return to debug level 46. 165 Return to debug level 45. 166 Return to debug level 44. 167 Return to debug level 43. 168 Return to debug level 42. 169 Return to debug level 41. 170 Return to debug level 40. 171 Return to debug level 39. 172 Return to debug level 38. 173 Return to debug level 37. 174 Return to debug level 36. 175 Return to debug level 35. 176 Return to debug level 34. 177 Return to debug level 33. 178 Return to debug level 32. 179 Return to debug level 31. 180 Return to debug level 30. 181 Return to debug level 29. 182 Return to debug level 28. 183 Return to debug level 27. 184 Return to debug level 26. 185 Return to debug level 25. 186 Return to debug level 24. 187 Return to debug level 23. 188 Return to debug level 22. 189 Return to debug level 21. 190 Return to debug level 20. 191 Return to debug level 19. 192 Return to debug level 18. 193 Return to debug level 17. 194 Return to debug level 16. 195 Return to debug level 15. 196 Return to debug level 14. 197 Return to debug level 13. 198 Return to debug level 12. 199 Return to debug level 11. 200 Return to debug level 10. 201 Return to debug level 9. 202 Return to debug level 8. 203 Return to debug level 7. 204 Return to debug level 6. 205 Return to debug level 5. 206 Return to debug level 4. 207 Return to debug level 3. 208 Return to debug level 2. 209 Return to debug level 1. 210 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 210. 2 Return to debug level 209. 3 Return to debug level 208. 4 Return to debug level 207. 5 Return to debug level 206. 6 Return to debug level 205. 7 Return to debug level 204. 8 Return to debug level 203. 9 Return to debug level 202. 10 Return to debug level 201. 11 Return to debug level 200. 12 Return to debug level 199. 13 Return to debug level 198. 14 Return to debug level 197. 15 Return to debug level 196. 16 Return to debug level 195. 17 Return to debug level 194. 18 Return to debug level 193. 19 Return to debug level 192. 20 Return to debug level 191. 21 Return to debug level 190. 22 Return to debug level 189. 23 Return to debug level 188. 24 Return to debug level 187. 25 Return to debug level 186. 26 Return to debug level 185. 27 Return to debug level 184. 28 Return to debug level 183. 29 Return to debug level 182. 30 Return to debug level 181. 31 Return to debug level 180. 32 Return to debug level 179. 33 Return to debug level 178. 34 Return to debug level 177. 35 Return to debug level 176. 36 Return to debug level 175. 37 Return to debug level 174. 38 Return to debug level 173. 39 Return to debug level 172. 40 Return to debug level 171. 41 Return to debug level 170. 42 Return to debug level 169. 43 Return to debug level 168. 44 Return to debug level 167. 45 Return to debug level 166. 46 Return to debug level 165. 47 Return to debug level 164. 48 Return to debug level 163. 49 Return to debug level 162. 50 Return to debug level 161. 51 Return to debug level 160. 52 Return to debug level 159. 53 Return to debug level 158. 54 Return to debug level 157. 55 Return to debug level 156. 56 Return to debug level 155. 57 Return to debug level 154. 58 Return to debug level 153. 59 Return to debug level 152. 60 Return to debug level 151. 61 Return to debug level 150. 62 Return to debug level 149. 63 Return to debug level 148. 64 Return to debug level 147. 65 Return to debug level 146. 66 Return to debug level 145. 67 Return to debug level 144. 68 Return to debug level 143. 69 Return to debug level 142. 70 Return to debug level 141. 71 Return to debug level 140. 72 Return to debug level 139. 73 Return to debug level 138. 74 Return to debug level 137. 75 Return to debug level 136. 76 Return to debug level 135. 77 Return to debug level 134. 78 Return to debug level 133. 79 Return to debug level 132. 80 Return to debug level 131. 81 Return to debug level 130. 82 Return to debug level 129. 83 Return to debug level 128. 84 Return to debug level 127. 85 Return to debug level 126. 86 Return to debug level 125. 87 Return to debug level 124. 88 Return to debug level 123. 89 Return to debug level 122. 90 Return to debug level 121. 91 Return to debug level 120. 92 Return to debug level 119. 93 Return to debug level 118. 94 Return to debug level 117. 95 Return to debug level 116. 96 Return to debug level 115. 97 Return to debug level 114. 98 Return to debug level 113. 99 Return to debug level 112. 100 Return to debug level 111. 101 Return to debug level 110. 102 Return to debug level 109. 103 Return to debug level 108. 104 Return to debug level 107. 105 Return to debug level 106. 106 Return to debug level 105. 107 Return to debug level 104. 108 Return to debug level 103. 109 Return to debug level 102. 110 Return to debug level 101. 111 Return to debug level 100. 112 Return to debug level 99. 113 Return to debug level 98. 114 Return to debug level 97. 115 Return to debug level 96. 116 Return to debug level 95. 117 Return to debug level 94. 118 Return to debug level 93. 119 Return to debug level 92. 120 Return to debug level 91. 121 Return to debug level 90. 122 Return to debug level 89. 123 Return to debug level 88. 124 Return to debug level 87. 125 Return to debug level 86. 126 Return to debug level 85. 127 Return to debug level 84. 128 Return to debug level 83. 129 Return to debug level 82. 130 Return to debug level 81. 131 Return to debug level 80. 132 Return to debug level 79. 133 Return to debug level 78. 134 Return to debug level 77. 135 Return to debug level 76. 136 Return to debug level 75. 137 Return to debug level 74. 138 Return to debug level 73. 139 Return to debug level 72. 140 Return to debug level 71. 141 Return to debug level 70. 142 Return to debug level 69. 143 Return to debug level 68. 144 Return to debug level 67. 145 Return to debug level 66. 146 Return to debug level 65. 147 Return to debug level 64. 148 Return to debug level 63. 149 Return to debug level 62. 150 Return to debug level 61. 151 Return to debug level 60. 152 Return to debug level 59. 153 Return to debug level 58. 154 Return to debug level 57. 155 Return to debug level 56. 156 Return to debug level 55. 157 Return to debug level 54. 158 Return to debug level 53. 159 Return to debug level 52. 160 Return to debug level 51. 161 Return to debug level 50. 162 Return to debug level 49. 163 Return to debug level 48. 164 Return to debug level 47. 165 Return to debug level 46. 166 Return to debug level 45. 167 Return to debug level 44. 168 Return to debug level 43. 169 Return to debug level 42. 170 Return to debug level 41. 171 Return to debug level 40. 172 Return to debug level 39. 173 Return to debug level 38. 174 Return to debug level 37. 175 Return to debug level 36. 176 Return to debug level 35. 177 Return to debug level 34. 178 Return to debug level 33. 179 Return to debug level 32. 180 Return to debug level 31. 181 Return to debug level 30. 182 Return to debug level 29. 183 Return to debug level 28. 184 Return to debug level 27. 185 Return to debug level 26. 186 Return to debug level 25. 187 Return to debug level 24. 188 Return to debug level 23. 189 Return to debug level 22. 190 Return to debug level 21. 191 Return to debug level 20. 192 Return to debug level 19. 193 Return to debug level 18. 194 Return to debug level 17. 195 Return to debug level 16. 196 Return to debug level 15. 197 Return to debug level 14. 198 Return to debug level 13. 199 Return to debug level 12. 200 Return to debug level 11. 201 Return to debug level 10. 202 Return to debug level 9. 203 Return to debug level 8. 204 Return to debug level 7. 205 Return to debug level 6. 206 Return to debug level 5. 207 Return to debug level 4. 208 Return to debug level 3. 209 Return to debug level 2. 210 Return to debug level 1. 211 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 211. 2 Return to debug level 210. 3 Return to debug level 209. 4 Return to debug level 208. 5 Return to debug level 207. 6 Return to debug level 206. 7 Return to debug level 205. 8 Return to debug level 204. 9 Return to debug level 203. 10 Return to debug level 202. 11 Return to debug level 201. 12 Return to debug level 200. 13 Return to debug level 199. 14 Return to debug level 198. 15 Return to debug level 197. 16 Return to debug level 196. 17 Return to debug level 195. 18 Return to debug level 194. 19 Return to debug level 193. 20 Return to debug level 192. 21 Return to debug level 191. 22 Return to debug level 190. 23 Return to debug level 189. 24 Return to debug level 188. 25 Return to debug level 187. 26 Return to debug level 186. 27 Return to debug level 185. 28 Return to debug level 184. 29 Return to debug level 183. 30 Return to debug level 182. 31 Return to debug level 181. 32 Return to debug level 180. 33 Return to debug level 179. 34 Return to debug level 178. 35 Return to debug level 177. 36 Return to debug level 176. 37 Return to debug level 175. 38 Return to debug level 174. 39 Return to debug level 173. 40 Return to debug level 172. 41 Return to debug level 171. 42 Return to debug level 170. 43 Return to debug level 169. 44 Return to debug level 168. 45 Return to debug level 167. 46 Return to debug level 166. 47 Return to debug level 165. 48 Return to debug level 164. 49 Return to debug level 163. 50 Return to debug level 162. 51 Return to debug level 161. 52 Return to debug level 160. 53 Return to debug level 159. 54 Return to debug level 158. 55 Return to debug level 157. 56 Return to debug level 156. 57 Return to debug level 155. 58 Return to debug level 154. 59 Return to debug level 153. 60 Return to debug level 152. 61 Return to debug level 151. 62 Return to debug level 150. 63 Return to debug level 149. 64 Return to debug level 148. 65 Return to debug level 147. 66 Return to debug level 146. 67 Return to debug level 145. 68 Return to debug level 144. 69 Return to debug level 143. 70 Return to debug level 142. 71 Return to debug level 141. 72 Return to debug level 140. 73 Return to debug level 139. 74 Return to debug level 138. 75 Return to debug level 137. 76 Return to debug level 136. 77 Return to debug level 135. 78 Return to debug level 134. 79 Return to debug level 133. 80 Return to debug level 132. 81 Return to debug level 131. 82 Return to debug level 130. 83 Return to debug level 129. 84 Return to debug level 128. 85 Return to debug level 127. 86 Return to debug level 126. 87 Return to debug level 125. 88 Return to debug level 124. 89 Return to debug level 123. 90 Return to debug level 122. 91 Return to debug level 121. 92 Return to debug level 120. 93 Return to debug level 119. 94 Return to debug level 118. 95 Return to debug level 117. 96 Return to debug level 116. 97 Return to debug level 115. 98 Return to debug level 114. 99 Return to debug level 113. 100 Return to debug level 112. 101 Return to debug level 111. 102 Return to debug level 110. 103 Return to debug level 109. 104 Return to debug level 108. 105 Return to debug level 107. 106 Return to debug level 106. 107 Return to debug level 105. 108 Return to debug level 104. 109 Return to debug level 103. 110 Return to debug level 102. 111 Return to debug level 101. 112 Return to debug level 100. 113 Return to debug level 99. 114 Return to debug level 98. 115 Return to debug level 97. 116 Return to debug level 96. 117 Return to debug level 95. 118 Return to debug level 94. 119 Return to debug level 93. 120 Return to debug level 92. 121 Return to debug level 91. 122 Return to debug level 90. 123 Return to debug level 89. 124 Return to debug level 88. 125 Return to debug level 87. 126 Return to debug level 86. 127 Return to debug level 85. 128 Return to debug level 84. 129 Return to debug level 83. 130 Return to debug level 82. 131 Return to debug level 81. 132 Return to debug level 80. 133 Return to debug level 79. 134 Return to debug level 78. 135 Return to debug level 77. 136 Return to debug level 76. 137 Return to debug level 75. 138 Return to debug level 74. 139 Return to debug level 73. 140 Return to debug level 72. 141 Return to debug level 71. 142 Return to debug level 70. 143 Return to debug level 69. 144 Return to debug level 68. 145 Return to debug level 67. 146 Return to debug level 66. 147 Return to debug level 65. 148 Return to debug level 64. 149 Return to debug level 63. 150 Return to debug level 62. 151 Return to debug level 61. 152 Return to debug level 60. 153 Return to debug level 59. 154 Return to debug level 58. 155 Return to debug level 57. 156 Return to debug level 56. 157 Return to debug level 55. 158 Return to debug level 54. 159 Return to debug level 53. 160 Return to debug level 52. 161 Return to debug level 51. 162 Return to debug level 50. 163 Return to debug level 49. 164 Return to debug level 48. 165 Return to debug level 47. 166 Return to debug level 46. 167 Return to debug level 45. 168 Return to debug level 44. 169 Return to debug level 43. 170 Return to debug level 42. 171 Return to debug level 41. 172 Return to debug level 40. 173 Return to debug level 39. 174 Return to debug level 38. 175 Return to debug level 37. 176 Return to debug level 36. 177 Return to debug level 35. 178 Return to debug level 34. 179 Return to debug level 33. 180 Return to debug level 32. 181 Return to debug level 31. 182 Return to debug level 30. 183 Return to debug level 29. 184 Return to debug level 28. 185 Return to debug level 27. 186 Return to debug level 26. 187 Return to debug level 25. 188 Return to debug level 24. 189 Return to debug level 23. 190 Return to debug level 22. 191 Return to debug level 21. 192 Return to debug level 20. 193 Return to debug level 19. 194 Return to debug level 18. 195 Return to debug level 17. 196 Return to debug level 16. 197 Return to debug level 15. 198 Return to debug level 14. 199 Return to debug level 13. 200 Return to debug level 12. 201 Return to debug level 11. 202 Return to debug level 10. 203 Return to debug level 9. 204 Return to debug level 8. 205 Return to debug level 7. 206 Return to debug level 6. 207 Return to debug level 5. 208 Return to debug level 4. 209 Return to debug level 3. 210 Return to debug level 2. 211 Return to debug level 1. 212 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 212. 2 Return to debug level 211. 3 Return to debug level 210. 4 Return to debug level 209. 5 Return to debug level 208. 6 Return to debug level 207. 7 Return to debug level 206. 8 Return to debug level 205. 9 Return to debug level 204. 10 Return to debug level 203. 11 Return to debug level 202. 12 Return to debug level 201. 13 Return to debug level 200. 14 Return to debug level 199. 15 Return to debug level 198. 16 Return to debug level 197. 17 Return to debug level 196. 18 Return to debug level 195. 19 Return to debug level 194. 20 Return to debug level 193. 21 Return to debug level 192. 22 Return to debug level 191. 23 Return to debug level 190. 24 Return to debug level 189. 25 Return to debug level 188. 26 Return to debug level 187. 27 Return to debug level 186. 28 Return to debug level 185. 29 Return to debug level 184. 30 Return to debug level 183. 31 Return to debug level 182. 32 Return to debug level 181. 33 Return to debug level 180. 34 Return to debug level 179. 35 Return to debug level 178. 36 Return to debug level 177. 37 Return to debug level 176. 38 Return to debug level 175. 39 Return to debug level 174. 40 Return to debug level 173. 41 Return to debug level 172. 42 Return to debug level 171. 43 Return to debug level 170. 44 Return to debug level 169. 45 Return to debug level 168. 46 Return to debug level 167. 47 Return to debug level 166. 48 Return to debug level 165. 49 Return to debug level 164. 50 Return to debug level 163. 51 Return to debug level 162. 52 Return to debug level 161. 53 Return to debug level 160. 54 Return to debug level 159. 55 Return to debug level 158. 56 Return to debug level 157. 57 Return to debug level 156. 58 Return to debug level 155. 59 Return to debug level 154. 60 Return to debug level 153. 61 Return to debug level 152. 62 Return to debug level 151. 63 Return to debug level 150. 64 Return to debug level 149. 65 Return to debug level 148. 66 Return to debug level 147. 67 Return to debug level 146. 68 Return to debug level 145. 69 Return to debug level 144. 70 Return to debug level 143. 71 Return to debug level 142. 72 Return to debug level 141. 73 Return to debug level 140. 74 Return to debug level 139. 75 Return to debug level 138. 76 Return to debug level 137. 77 Return to debug level 136. 78 Return to debug level 135. 79 Return to debug level 134. 80 Return to debug level 133. 81 Return to debug level 132. 82 Return to debug level 131. 83 Return to debug level 130. 84 Return to debug level 129. 85 Return to debug level 128. 86 Return to debug level 127. 87 Return to debug level 126. 88 Return to debug level 125. 89 Return to debug level 124. 90 Return to debug level 123. 91 Return to debug level 122. 92 Return to debug level 121. 93 Return to debug level 120. 94 Return to debug level 119. 95 Return to debug level 118. 96 Return to debug level 117. 97 Return to debug level 116. 98 Return to debug level 115. 99 Return to debug level 114. 100 Return to debug level 113. 101 Return to debug level 112. 102 Return to debug level 111. 103 Return to debug level 110. 104 Return to debug level 109. 105 Return to debug level 108. 106 Return to debug level 107. 107 Return to debug level 106. 108 Return to debug level 105. 109 Return to debug level 104. 110 Return to debug level 103. 111 Return to debug level 102. 112 Return to debug level 101. 113 Return to debug level 100. 114 Return to debug level 99. 115 Return to debug level 98. 116 Return to debug level 97. 117 Return to debug level 96. 118 Return to debug level 95. 119 Return to debug level 94. 120 Return to debug level 93. 121 Return to debug level 92. 122 Return to debug level 91. 123 Return to debug level 90. 124 Return to debug level 89. 125 Return to debug level 88. 126 Return to debug level 87. 127 Return to debug level 86. 128 Return to debug level 85. 129 Return to debug level 84. 130 Return to debug level 83. 131 Return to debug level 82. 132 Return to debug level 81. 133 Return to debug level 80. 134 Return to debug level 79. 135 Return to debug level 78. 136 Return to debug level 77. 137 Return to debug level 76. 138 Return to debug level 75. 139 Return to debug level 74. 140 Return to debug level 73. 141 Return to debug level 72. 142 Return to debug level 71. 143 Return to debug level 70. 144 Return to debug level 69. 145 Return to debug level 68. 146 Return to debug level 67. 147 Return to debug level 66. 148 Return to debug level 65. 149 Return to debug level 64. 150 Return to debug level 63. 151 Return to debug level 62. 152 Return to debug level 61. 153 Return to debug level 60. 154 Return to debug level 59. 155 Return to debug level 58. 156 Return to debug level 57. 157 Return to debug level 56. 158 Return to debug level 55. 159 Return to debug level 54. 160 Return to debug level 53. 161 Return to debug level 52. 162 Return to debug level 51. 163 Return to debug level 50. 164 Return to debug level 49. 165 Return to debug level 48. 166 Return to debug level 47. 167 Return to debug level 46. 168 Return to debug level 45. 169 Return to debug level 44. 170 Return to debug level 43. 171 Return to debug level 42. 172 Return to debug level 41. 173 Return to debug level 40. 174 Return to debug level 39. 175 Return to debug level 38. 176 Return to debug level 37. 177 Return to debug level 36. 178 Return to debug level 35. 179 Return to debug level 34. 180 Return to debug level 33. 181 Return to debug level 32. 182 Return to debug level 31. 183 Return to debug level 30. 184 Return to debug level 29. 185 Return to debug level 28. 186 Return to debug level 27. 187 Return to debug level 26. 188 Return to debug level 25. 189 Return to debug level 24. 190 Return to debug level 23. 191 Return to debug level 22. 192 Return to debug level 21. 193 Return to debug level 20. 194 Return to debug level 19. 195 Return to debug level 18. 196 Return to debug level 17. 197 Return to debug level 16. 198 Return to debug level 15. 199 Return to debug level 14. 200 Return to debug level 13. 201 Return to debug level 12. 202 Return to debug level 11. 203 Return to debug level 10. 204 Return to debug level 9. 205 Return to debug level 8. 206 Return to debug level 7. 207 Return to debug level 6. 208 Return to debug level 5. 209 Return to debug level 4. 210 Return to debug level 3. 211 Return to debug level 2. 212 Return to debug level 1. 213 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 213. 2 Return to debug level 212. 3 Return to debug level 211. 4 Return to debug level 210. 5 Return to debug level 209. 6 Return to debug level 208. 7 Return to debug level 207. 8 Return to debug level 206. 9 Return to debug level 205. 10 Return to debug level 204. 11 Return to debug level 203. 12 Return to debug level 202. 13 Return to debug level 201. 14 Return to debug level 200. 15 Return to debug level 199. 16 Return to debug level 198. 17 Return to debug level 197. 18 Return to debug level 196. 19 Return to debug level 195. 20 Return to debug level 194. 21 Return to debug level 193. 22 Return to debug level 192. 23 Return to debug level 191. 24 Return to debug level 190. 25 Return to debug level 189. 26 Return to debug level 188. 27 Return to debug level 187. 28 Return to debug level 186. 29 Return to debug level 185. 30 Return to debug level 184. 31 Return to debug level 183. 32 Return to debug level 182. 33 Return to debug level 181. 34 Return to debug level 180. 35 Return to debug level 179. 36 Return to debug level 178. 37 Return to debug level 177. 38 Return to debug level 176. 39 Return to debug level 175. 40 Return to debug level 174. 41 Return to debug level 173. 42 Return to debug level 172. 43 Return to debug level 171. 44 Return to debug level 170. 45 Return to debug level 169. 46 Return to debug level 168. 47 Return to debug level 167. 48 Return to debug level 166. 49 Return to debug level 165. 50 Return to debug level 164. 51 Return to debug level 163. 52 Return to debug level 162. 53 Return to debug level 161. 54 Return to debug level 160. 55 Return to debug level 159. 56 Return to debug level 158. 57 Return to debug level 157. 58 Return to debug level 156. 59 Return to debug level 155. 60 Return to debug level 154. 61 Return to debug level 153. 62 Return to debug level 152. 63 Return to debug level 151. 64 Return to debug level 150. 65 Return to debug level 149. 66 Return to debug level 148. 67 Return to debug level 147. 68 Return to debug level 146. 69 Return to debug level 145. 70 Return to debug level 144. 71 Return to debug level 143. 72 Return to debug level 142. 73 Return to debug level 141. 74 Return to debug level 140. 75 Return to debug level 139. 76 Return to debug level 138. 77 Return to debug level 137. 78 Return to debug level 136. 79 Return to debug level 135. 80 Return to debug level 134. 81 Return to debug level 133. 82 Return to debug level 132. 83 Return to debug level 131. 84 Return to debug level 130. 85 Return to debug level 129. 86 Return to debug level 128. 87 Return to debug level 127. 88 Return to debug level 126. 89 Return to debug level 125. 90 Return to debug level 124. 91 Return to debug level 123. 92 Return to debug level 122. 93 Return to debug level 121. 94 Return to debug level 120. 95 Return to debug level 119. 96 Return to debug level 118. 97 Return to debug level 117. 98 Return to debug level 116. 99 Return to debug level 115. 100 Return to debug level 114. 101 Return to debug level 113. 102 Return to debug level 112. 103 Return to debug level 111. 104 Return to debug level 110. 105 Return to debug level 109. 106 Return to debug level 108. 107 Return to debug level 107. 108 Return to debug level 106. 109 Return to debug level 105. 110 Return to debug level 104. 111 Return to debug level 103. 112 Return to debug level 102. 113 Return to debug level 101. 114 Return to debug level 100. 115 Return to debug level 99. 116 Return to debug level 98. 117 Return to debug level 97. 118 Return to debug level 96. 119 Return to debug level 95. 120 Return to debug level 94. 121 Return to debug level 93. 122 Return to debug level 92. 123 Return to debug level 91. 124 Return to debug level 90. 125 Return to debug level 89. 126 Return to debug level 88. 127 Return to debug level 87. 128 Return to debug level 86. 129 Return to debug level 85. 130 Return to debug level 84. 131 Return to debug level 83. 132 Return to debug level 82. 133 Return to debug level 81. 134 Return to debug level 80. 135 Return to debug level 79. 136 Return to debug level 78. 137 Return to debug level 77. 138 Return to debug level 76. 139 Return to debug level 75. 140 Return to debug level 74. 141 Return to debug level 73. 142 Return to debug level 72. 143 Return to debug level 71. 144 Return to debug level 70. 145 Return to debug level 69. 146 Return to debug level 68. 147 Return to debug level 67. 148 Return to debug level 66. 149 Return to debug level 65. 150 Return to debug level 64. 151 Return to debug level 63. 152 Return to debug level 62. 153 Return to debug level 61. 154 Return to debug level 60. 155 Return to debug level 59. 156 Return to debug level 58. 157 Return to debug level 57. 158 Return to debug level 56. 159 Return to debug level 55. 160 Return to debug level 54. 161 Return to debug level 53. 162 Return to debug level 52. 163 Return to debug level 51. 164 Return to debug level 50. 165 Return to debug level 49. 166 Return to debug level 48. 167 Return to debug level 47. 168 Return to debug level 46. 169 Return to debug level 45. 170 Return to debug level 44. 171 Return to debug level 43. 172 Return to debug level 42. 173 Return to debug level 41. 174 Return to debug level 40. 175 Return to debug level 39. 176 Return to debug level 38. 177 Return to debug level 37. 178 Return to debug level 36. 179 Return to debug level 35. 180 Return to debug level 34. 181 Return to debug level 33. 182 Return to debug level 32. 183 Return to debug level 31. 184 Return to debug level 30. 185 Return to debug level 29. 186 Return to debug level 28. 187 Return to debug level 27. 188 Return to debug level 26. 189 Return to debug level 25. 190 Return to debug level 24. 191 Return to debug level 23. 192 Return to debug level 22. 193 Return to debug level 21. 194 Return to debug level 20. 195 Return to debug level 19. 196 Return to debug level 18. 197 Return to debug level 17. 198 Return to debug level 16. 199 Return to debug level 15. 200 Return to debug level 14. 201 Return to debug level 13. 202 Return to debug level 12. 203 Return to debug level 11. 204 Return to debug level 10. 205 Return to debug level 9. 206 Return to debug level 8. 207 Return to debug level 7. 208 Return to debug level 6. 209 Return to debug level 5. 210 Return to debug level 4. 211 Return to debug level 3. 212 Return to debug level 2. 213 Return to debug level 1. 214 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 214. 2 Return to debug level 213. 3 Return to debug level 212. 4 Return to debug level 211. 5 Return to debug level 210. 6 Return to debug level 209. 7 Return to debug level 208. 8 Return to debug level 207. 9 Return to debug level 206. 10 Return to debug level 205. 11 Return to debug level 204. 12 Return to debug level 203. 13 Return to debug level 202. 14 Return to debug level 201. 15 Return to debug level 200. 16 Return to debug level 199. 17 Return to debug level 198. 18 Return to debug level 197. 19 Return to debug level 196. 20 Return to debug level 195. 21 Return to debug level 194. 22 Return to debug level 193. 23 Return to debug level 192. 24 Return to debug level 191. 25 Return to debug level 190. 26 Return to debug level 189. 27 Return to debug level 188. 28 Return to debug level 187. 29 Return to debug level 186. 30 Return to debug level 185. 31 Return to debug level 184. 32 Return to debug level 183. 33 Return to debug level 182. 34 Return to debug level 181. 35 Return to debug level 180. 36 Return to debug level 179. 37 Return to debug level 178. 38 Return to debug level 177. 39 Return to debug level 176. 40 Return to debug level 175. 41 Return to debug level 174. 42 Return to debug level 173. 43 Return to debug level 172. 44 Return to debug level 171. 45 Return to debug level 170. 46 Return to debug level 169. 47 Return to debug level 168. 48 Return to debug level 167. 49 Return to debug level 166. 50 Return to debug level 165. 51 Return to debug level 164. 52 Return to debug level 163. 53 Return to debug level 162. 54 Return to debug level 161. 55 Return to debug level 160. 56 Return to debug level 159. 57 Return to debug level 158. 58 Return to debug level 157. 59 Return to debug level 156. 60 Return to debug level 155. 61 Return to debug level 154. 62 Return to debug level 153. 63 Return to debug level 152. 64 Return to debug level 151. 65 Return to debug level 150. 66 Return to debug level 149. 67 Return to debug level 148. 68 Return to debug level 147. 69 Return to debug level 146. 70 Return to debug level 145. 71 Return to debug level 144. 72 Return to debug level 143. 73 Return to debug level 142. 74 Return to debug level 141. 75 Return to debug level 140. 76 Return to debug level 139. 77 Return to debug level 138. 78 Return to debug level 137. 79 Return to debug level 136. 80 Return to debug level 135. 81 Return to debug level 134. 82 Return to debug level 133. 83 Return to debug level 132. 84 Return to debug level 131. 85 Return to debug level 130. 86 Return to debug level 129. 87 Return to debug level 128. 88 Return to debug level 127. 89 Return to debug level 126. 90 Return to debug level 125. 91 Return to debug level 124. 92 Return to debug level 123. 93 Return to debug level 122. 94 Return to debug level 121. 95 Return to debug level 120. 96 Return to debug level 119. 97 Return to debug level 118. 98 Return to debug level 117. 99 Return to debug level 116. 100 Return to debug level 115. 101 Return to debug level 114. 102 Return to debug level 113. 103 Return to debug level 112. 104 Return to debug level 111. 105 Return to debug level 110. 106 Return to debug level 109. 107 Return to debug level 108. 108 Return to debug level 107. 109 Return to debug level 106. 110 Return to debug level 105. 111 Return to debug level 104. 112 Return to debug level 103. 113 Return to debug level 102. 114 Return to debug level 101. 115 Return to debug level 100. 116 Return to debug level 99. 117 Return to debug level 98. 118 Return to debug level 97. 119 Return to debug level 96. 120 Return to debug level 95. 121 Return to debug level 94. 122 Return to debug level 93. 123 Return to debug level 92. 124 Return to debug level 91. 125 Return to debug level 90. 126 Return to debug level 89. 127 Return to debug level 88. 128 Return to debug level 87. 129 Return to debug level 86. 130 Return to debug level 85. 131 Return to debug level 84. 132 Return to debug level 83. 133 Return to debug level 82. 134 Return to debug level 81. 135 Return to debug level 80. 136 Return to debug level 79. 137 Return to debug level 78. 138 Return to debug level 77. 139 Return to debug level 76. 140 Return to debug level 75. 141 Return to debug level 74. 142 Return to debug level 73. 143 Return to debug level 72. 144 Return to debug level 71. 145 Return to debug level 70. 146 Return to debug level 69. 147 Return to debug level 68. 148 Return to debug level 67. 149 Return to debug level 66. 150 Return to debug level 65. 151 Return to debug level 64. 152 Return to debug level 63. 153 Return to debug level 62. 154 Return to debug level 61. 155 Return to debug level 60. 156 Return to debug level 59. 157 Return to debug level 58. 158 Return to debug level 57. 159 Return to debug level 56. 160 Return to debug level 55. 161 Return to debug level 54. 162 Return to debug level 53. 163 Return to debug level 52. 164 Return to debug level 51. 165 Return to debug level 50. 166 Return to debug level 49. 167 Return to debug level 48. 168 Return to debug level 47. 169 Return to debug level 46. 170 Return to debug level 45. 171 Return to debug level 44. 172 Return to debug level 43. 173 Return to debug level 42. 174 Return to debug level 41. 175 Return to debug level 40. 176 Return to debug level 39. 177 Return to debug level 38. 178 Return to debug level 37. 179 Return to debug level 36. 180 Return to debug level 35. 181 Return to debug level 34. 182 Return to debug level 33. 183 Return to debug level 32. 184 Return to debug level 31. 185 Return to debug level 30. 186 Return to debug level 29. 187 Return to debug level 28. 188 Return to debug level 27. 189 Return to debug level 26. 190 Return to debug level 25. 191 Return to debug level 24. 192 Return to debug level 23. 193 Return to debug level 22. 194 Return to debug level 21. 195 Return to debug level 20. 196 Return to debug level 19. 197 Return to debug level 18. 198 Return to debug level 17. 199 Return to debug level 16. 200 Return to debug level 15. 201 Return to debug level 14. 202 Return to debug level 13. 203 Return to debug level 12. 204 Return to debug level 11. 205 Return to debug level 10. 206 Return to debug level 9. 207 Return to debug level 8. 208 Return to debug level 7. 209 Return to debug level 6. 210 Return to debug level 5. 211 Return to debug level 4. 212 Return to debug level 3. 213 Return to debug level 2. 214 Return to debug level 1. 215 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 215. 2 Return to debug level 214. 3 Return to debug level 213. 4 Return to debug level 212. 5 Return to debug level 211. 6 Return to debug level 210. 7 Return to debug level 209. 8 Return to debug level 208. 9 Return to debug level 207. 10 Return to debug level 206. 11 Return to debug level 205. 12 Return to debug level 204. 13 Return to debug level 203. 14 Return to debug level 202. 15 Return to debug level 201. 16 Return to debug level 200. 17 Return to debug level 199. 18 Return to debug level 198. 19 Return to debug level 197. 20 Return to debug level 196. 21 Return to debug level 195. 22 Return to debug level 194. 23 Return to debug level 193. 24 Return to debug level 192. 25 Return to debug level 191. 26 Return to debug level 190. 27 Return to debug level 189. 28 Return to debug level 188. 29 Return to debug level 187. 30 Return to debug level 186. 31 Return to debug level 185. 32 Return to debug level 184. 33 Return to debug level 183. 34 Return to debug level 182. 35 Return to debug level 181. 36 Return to debug level 180. 37 Return to debug level 179. 38 Return to debug level 178. 39 Return to debug level 177. 40 Return to debug level 176. 41 Return to debug level 175. 42 Return to debug level 174. 43 Return to debug level 173. 44 Return to debug level 172. 45 Return to debug level 171. 46 Return to debug level 170. 47 Return to debug level 169. 48 Return to debug level 168. 49 Return to debug level 167. 50 Return to debug level 166. 51 Return to debug level 165. 52 Return to debug level 164. 53 Return to debug level 163. 54 Return to debug level 162. 55 Return to debug level 161. 56 Return to debug level 160. 57 Return to debug level 159. 58 Return to debug level 158. 59 Return to debug level 157. 60 Return to debug level 156. 61 Return to debug level 155. 62 Return to debug level 154. 63 Return to debug level 153. 64 Return to debug level 152. 65 Return to debug level 151. 66 Return to debug level 150. 67 Return to debug level 149. 68 Return to debug level 148. 69 Return to debug level 147. 70 Return to debug level 146. 71 Return to debug level 145. 72 Return to debug level 144. 73 Return to debug level 143. 74 Return to debug level 142. 75 Return to debug level 141. 76 Return to debug level 140. 77 Return to debug level 139. 78 Return to debug level 138. 79 Return to debug level 137. 80 Return to debug level 136. 81 Return to debug level 135. 82 Return to debug level 134. 83 Return to debug level 133. 84 Return to debug level 132. 85 Return to debug level 131. 86 Return to debug level 130. 87 Return to debug level 129. 88 Return to debug level 128. 89 Return to debug level 127. 90 Return to debug level 126. 91 Return to debug level 125. 92 Return to debug level 124. 93 Return to debug level 123. 94 Return to debug level 122. 95 Return to debug level 121. 96 Return to debug level 120. 97 Return to debug level 119. 98 Return to debug level 118. 99 Return to debug level 117. 100 Return to debug level 116. 101 Return to debug level 115. 102 Return to debug level 114. 103 Return to debug level 113. 104 Return to debug level 112. 105 Return to debug level 111. 106 Return to debug level 110. 107 Return to debug level 109. 108 Return to debug level 108. 109 Return to debug level 107. 110 Return to debug level 106. 111 Return to debug level 105. 112 Return to debug level 104. 113 Return to debug level 103. 114 Return to debug level 102. 115 Return to debug level 101. 116 Return to debug level 100. 117 Return to debug level 99. 118 Return to debug level 98. 119 Return to debug level 97. 120 Return to debug level 96. 121 Return to debug level 95. 122 Return to debug level 94. 123 Return to debug level 93. 124 Return to debug level 92. 125 Return to debug level 91. 126 Return to debug level 90. 127 Return to debug level 89. 128 Return to debug level 88. 129 Return to debug level 87. 130 Return to debug level 86. 131 Return to debug level 85. 132 Return to debug level 84. 133 Return to debug level 83. 134 Return to debug level 82. 135 Return to debug level 81. 136 Return to debug level 80. 137 Return to debug level 79. 138 Return to debug level 78. 139 Return to debug level 77. 140 Return to debug level 76. 141 Return to debug level 75. 142 Return to debug level 74. 143 Return to debug level 73. 144 Return to debug level 72. 145 Return to debug level 71. 146 Return to debug level 70. 147 Return to debug level 69. 148 Return to debug level 68. 149 Return to debug level 67. 150 Return to debug level 66. 151 Return to debug level 65. 152 Return to debug level 64. 153 Return to debug level 63. 154 Return to debug level 62. 155 Return to debug level 61. 156 Return to debug level 60. 157 Return to debug level 59. 158 Return to debug level 58. 159 Return to debug level 57. 160 Return to debug level 56. 161 Return to debug level 55. 162 Return to debug level 54. 163 Return to debug level 53. 164 Return to debug level 52. 165 Return to debug level 51. 166 Return to debug level 50. 167 Return to debug level 49. 168 Return to debug level 48. 169 Return to debug level 47. 170 Return to debug level 46. 171 Return to debug level 45. 172 Return to debug level 44. 173 Return to debug level 43. 174 Return to debug level 42. 175 Return to debug level 41. 176 Return to debug level 40. 177 Return to debug level 39. 178 Return to debug level 38. 179 Return to debug level 37. 180 Return to debug level 36. 181 Return to debug level 35. 182 Return to debug level 34. 183 Return to debug level 33. 184 Return to debug level 32. 185 Return to debug level 31. 186 Return to debug level 30. 187 Return to debug level 29. 188 Return to debug level 28. 189 Return to debug level 27. 190 Return to debug level 26. 191 Return to debug level 25. 192 Return to debug level 24. 193 Return to debug level 23. 194 Return to debug level 22. 195 Return to debug level 21. 196 Return to debug level 20. 197 Return to debug level 19. 198 Return to debug level 18. 199 Return to debug level 17. 200 Return to debug level 16. 201 Return to debug level 15. 202 Return to debug level 14. 203 Return to debug level 13. 204 Return to debug level 12. 205 Return to debug level 11. 206 Return to debug level 10. 207 Return to debug level 9. 208 Return to debug level 8. 209 Return to debug level 7. 210 Return to debug level 6. 211 Return to debug level 5. 212 Return to debug level 4. 213 Return to debug level 3. 214 Return to debug level 2. 215 Return to debug level 1. 216 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 216. 2 Return to debug level 215. 3 Return to debug level 214. 4 Return to debug level 213. 5 Return to debug level 212. 6 Return to debug level 211. 7 Return to debug level 210. 8 Return to debug level 209. 9 Return to debug level 208. 10 Return to debug level 207. 11 Return to debug level 206. 12 Return to debug level 205. 13 Return to debug level 204. 14 Return to debug level 203. 15 Return to debug level 202. 16 Return to debug level 201. 17 Return to debug level 200. 18 Return to debug level 199. 19 Return to debug level 198. 20 Return to debug level 197. 21 Return to debug level 196. 22 Return to debug level 195. 23 Return to debug level 194. 24 Return to debug level 193. 25 Return to debug level 192. 26 Return to debug level 191. 27 Return to debug level 190. 28 Return to debug level 189. 29 Return to debug level 188. 30 Return to debug level 187. 31 Return to debug level 186. 32 Return to debug level 185. 33 Return to debug level 184. 34 Return to debug level 183. 35 Return to debug level 182. 36 Return to debug level 181. 37 Return to debug level 180. 38 Return to debug level 179. 39 Return to debug level 178. 40 Return to debug level 177. 41 Return to debug level 176. 42 Return to debug level 175. 43 Return to debug level 174. 44 Return to debug level 173. 45 Return to debug level 172. 46 Return to debug level 171. 47 Return to debug level 170. 48 Return to debug level 169. 49 Return to debug level 168. 50 Return to debug level 167. 51 Return to debug level 166. 52 Return to debug level 165. 53 Return to debug level 164. 54 Return to debug level 163. 55 Return to debug level 162. 56 Return to debug level 161. 57 Return to debug level 160. 58 Return to debug level 159. 59 Return to debug level 158. 60 Return to debug level 157. 61 Return to debug level 156. 62 Return to debug level 155. 63 Return to debug level 154. 64 Return to debug level 153. 65 Return to debug level 152. 66 Return to debug level 151. 67 Return to debug level 150. 68 Return to debug level 149. 69 Return to debug level 148. 70 Return to debug level 147. 71 Return to debug level 146. 72 Return to debug level 145. 73 Return to debug level 144. 74 Return to debug level 143. 75 Return to debug level 142. 76 Return to debug level 141. 77 Return to debug level 140. 78 Return to debug level 139. 79 Return to debug level 138. 80 Return to debug level 137. 81 Return to debug level 136. 82 Return to debug level 135. 83 Return to debug level 134. 84 Return to debug level 133. 85 Return to debug level 132. 86 Return to debug level 131. 87 Return to debug level 130. 88 Return to debug level 129. 89 Return to debug level 128. 90 Return to debug level 127. 91 Return to debug level 126. 92 Return to debug level 125. 93 Return to debug level 124. 94 Return to debug level 123. 95 Return to debug level 122. 96 Return to debug level 121. 97 Return to debug level 120. 98 Return to debug level 119. 99 Return to debug level 118. 100 Return to debug level 117. 101 Return to debug level 116. 102 Return to debug level 115. 103 Return to debug level 114. 104 Return to debug level 113. 105 Return to debug level 112. 106 Return to debug level 111. 107 Return to debug level 110. 108 Return to debug level 109. 109 Return to debug level 108. 110 Return to debug level 107. 111 Return to debug level 106. 112 Return to debug level 105. 113 Return to debug level 104. 114 Return to debug level 103. 115 Return to debug level 102. 116 Return to debug level 101. 117 Return to debug level 100. 118 Return to debug level 99. 119 Return to debug level 98. 120 Return to debug level 97. 121 Return to debug level 96. 122 Return to debug level 95. 123 Return to debug level 94. 124 Return to debug level 93. 125 Return to debug level 92. 126 Return to debug level 91. 127 Return to debug level 90. 128 Return to debug level 89. 129 Return to debug level 88. 130 Return to debug level 87. 131 Return to debug level 86. 132 Return to debug level 85. 133 Return to debug level 84. 134 Return to debug level 83. 135 Return to debug level 82. 136 Return to debug level 81. 137 Return to debug level 80. 138 Return to debug level 79. 139 Return to debug level 78. 140 Return to debug level 77. 141 Return to debug level 76. 142 Return to debug level 75. 143 Return to debug level 74. 144 Return to debug level 73. 145 Return to debug level 72. 146 Return to debug level 71. 147 Return to debug level 70. 148 Return to debug level 69. 149 Return to debug level 68. 150 Return to debug level 67. 151 Return to debug level 66. 152 Return to debug level 65. 153 Return to debug level 64. 154 Return to debug level 63. 155 Return to debug level 62. 156 Return to debug level 61. 157 Return to debug level 60. 158 Return to debug level 59. 159 Return to debug level 58. 160 Return to debug level 57. 161 Return to debug level 56. 162 Return to debug level 55. 163 Return to debug level 54. 164 Return to debug level 53. 165 Return to debug level 52. 166 Return to debug level 51. 167 Return to debug level 50. 168 Return to debug level 49. 169 Return to debug level 48. 170 Return to debug level 47. 171 Return to debug level 46. 172 Return to debug level 45. 173 Return to debug level 44. 174 Return to debug level 43. 175 Return to debug level 42. 176 Return to debug level 41. 177 Return to debug level 40. 178 Return to debug level 39. 179 Return to debug level 38. 180 Return to debug level 37. 181 Return to debug level 36. 182 Return to debug level 35. 183 Return to debug level 34. 184 Return to debug level 33. 185 Return to debug level 32. 186 Return to debug level 31. 187 Return to debug level 30. 188 Return to debug level 29. 189 Return to debug level 28. 190 Return to debug level 27. 191 Return to debug level 26. 192 Return to debug level 25. 193 Return to debug level 24. 194 Return to debug level 23. 195 Return to debug level 22. 196 Return to debug level 21. 197 Return to debug level 20. 198 Return to debug level 19. 199 Return to debug level 18. 200 Return to debug level 17. 201 Return to debug level 16. 202 Return to debug level 15. 203 Return to debug level 14. 204 Return to debug level 13. 205 Return to debug level 12. 206 Return to debug level 11. 207 Return to debug level 10. 208 Return to debug level 9. 209 Return to debug level 8. 210 Return to debug level 7. 211 Return to debug level 6. 212 Return to debug level 5. 213 Return to debug level 4. 214 Return to debug level 3. 215 Return to debug level 2. 216 Return to debug level 1. 217 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 217. 2 Return to debug level 216. 3 Return to debug level 215. 4 Return to debug level 214. 5 Return to debug level 213. 6 Return to debug level 212. 7 Return to debug level 211. 8 Return to debug level 210. 9 Return to debug level 209. 10 Return to debug level 208. 11 Return to debug level 207. 12 Return to debug level 206. 13 Return to debug level 205. 14 Return to debug level 204. 15 Return to debug level 203. 16 Return to debug level 202. 17 Return to debug level 201. 18 Return to debug level 200. 19 Return to debug level 199. 20 Return to debug level 198. 21 Return to debug level 197. 22 Return to debug level 196. 23 Return to debug level 195. 24 Return to debug level 194. 25 Return to debug level 193. 26 Return to debug level 192. 27 Return to debug level 191. 28 Return to debug level 190. 29 Return to debug level 189. 30 Return to debug level 188. 31 Return to debug level 187. 32 Return to debug level 186. 33 Return to debug level 185. 34 Return to debug level 184. 35 Return to debug level 183. 36 Return to debug level 182. 37 Return to debug level 181. 38 Return to debug level 180. 39 Return to debug level 179. 40 Return to debug level 178. 41 Return to debug level 177. 42 Return to debug level 176. 43 Return to debug level 175. 44 Return to debug level 174. 45 Return to debug level 173. 46 Return to debug level 172. 47 Return to debug level 171. 48 Return to debug level 170. 49 Return to debug level 169. 50 Return to debug level 168. 51 Return to debug level 167. 52 Return to debug level 166. 53 Return to debug level 165. 54 Return to debug level 164. 55 Return to debug level 163. 56 Return to debug level 162. 57 Return to debug level 161. 58 Return to debug level 160. 59 Return to debug level 159. 60 Return to debug level 158. 61 Return to debug level 157. 62 Return to debug level 156. 63 Return to debug level 155. 64 Return to debug level 154. 65 Return to debug level 153. 66 Return to debug level 152. 67 Return to debug level 151. 68 Return to debug level 150. 69 Return to debug level 149. 70 Return to debug level 148. 71 Return to debug level 147. 72 Return to debug level 146. 73 Return to debug level 145. 74 Return to debug level 144. 75 Return to debug level 143. 76 Return to debug level 142. 77 Return to debug level 141. 78 Return to debug level 140. 79 Return to debug level 139. 80 Return to debug level 138. 81 Return to debug level 137. 82 Return to debug level 136. 83 Return to debug level 135. 84 Return to debug level 134. 85 Return to debug level 133. 86 Return to debug level 132. 87 Return to debug level 131. 88 Return to debug level 130. 89 Return to debug level 129. 90 Return to debug level 128. 91 Return to debug level 127. 92 Return to debug level 126. 93 Return to debug level 125. 94 Return to debug level 124. 95 Return to debug level 123. 96 Return to debug level 122. 97 Return to debug level 121. 98 Return to debug level 120. 99 Return to debug level 119. 100 Return to debug level 118. 101 Return to debug level 117. 102 Return to debug level 116. 103 Return to debug level 115. 104 Return to debug level 114. 105 Return to debug level 113. 106 Return to debug level 112. 107 Return to debug level 111. 108 Return to debug level 110. 109 Return to debug level 109. 110 Return to debug level 108. 111 Return to debug level 107. 112 Return to debug level 106. 113 Return to debug level 105. 114 Return to debug level 104. 115 Return to debug level 103. 116 Return to debug level 102. 117 Return to debug level 101. 118 Return to debug level 100. 119 Return to debug level 99. 120 Return to debug level 98. 121 Return to debug level 97. 122 Return to debug level 96. 123 Return to debug level 95. 124 Return to debug level 94. 125 Return to debug level 93. 126 Return to debug level 92. 127 Return to debug level 91. 128 Return to debug level 90. 129 Return to debug level 89. 130 Return to debug level 88. 131 Return to debug level 87. 132 Return to debug level 86. 133 Return to debug level 85. 134 Return to debug level 84. 135 Return to debug level 83. 136 Return to debug level 82. 137 Return to debug level 81. 138 Return to debug level 80. 139 Return to debug level 79. 140 Return to debug level 78. 141 Return to debug level 77. 142 Return to debug level 76. 143 Return to debug level 75. 144 Return to debug level 74. 145 Return to debug level 73. 146 Return to debug level 72. 147 Return to debug level 71. 148 Return to debug level 70. 149 Return to debug level 69. 150 Return to debug level 68. 151 Return to debug level 67. 152 Return to debug level 66. 153 Return to debug level 65. 154 Return to debug level 64. 155 Return to debug level 63. 156 Return to debug level 62. 157 Return to debug level 61. 158 Return to debug level 60. 159 Return to debug level 59. 160 Return to debug level 58. 161 Return to debug level 57. 162 Return to debug level 56. 163 Return to debug level 55. 164 Return to debug level 54. 165 Return to debug level 53. 166 Return to debug level 52. 167 Return to debug level 51. 168 Return to debug level 50. 169 Return to debug level 49. 170 Return to debug level 48. 171 Return to debug level 47. 172 Return to debug level 46. 173 Return to debug level 45. 174 Return to debug level 44. 175 Return to debug level 43. 176 Return to debug level 42. 177 Return to debug level 41. 178 Return to debug level 40. 179 Return to debug level 39. 180 Return to debug level 38. 181 Return to debug level 37. 182 Return to debug level 36. 183 Return to debug level 35. 184 Return to debug level 34. 185 Return to debug level 33. 186 Return to debug level 32. 187 Return to debug level 31. 188 Return to debug level 30. 189 Return to debug level 29. 190 Return to debug level 28. 191 Return to debug level 27. 192 Return to debug level 26. 193 Return to debug level 25. 194 Return to debug level 24. 195 Return to debug level 23. 196 Return to debug level 22. 197 Return to debug level 21. 198 Return to debug level 20. 199 Return to debug level 19. 200 Return to debug level 18. 201 Return to debug level 17. 202 Return to debug level 16. 203 Return to debug level 15. 204 Return to debug level 14. 205 Return to debug level 13. 206 Return to debug level 12. 207 Return to debug level 11. 208 Return to debug level 10. 209 Return to debug level 9. 210 Return to debug level 8. 211 Return to debug level 7. 212 Return to debug level 6. 213 Return to debug level 5. 214 Return to debug level 4. 215 Return to debug level 3. 216 Return to debug level 2. 217 Return to debug level 1. 218 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 218. 2 Return to debug level 217. 3 Return to debug level 216. 4 Return to debug level 215. 5 Return to debug level 214. 6 Return to debug level 213. 7 Return to debug level 212. 8 Return to debug level 211. 9 Return to debug level 210. 10 Return to debug level 209. 11 Return to debug level 208. 12 Return to debug level 207. 13 Return to debug level 206. 14 Return to debug level 205. 15 Return to debug level 204. 16 Return to debug level 203. 17 Return to debug level 202. 18 Return to debug level 201. 19 Return to debug level 200. 20 Return to debug level 199. 21 Return to debug level 198. 22 Return to debug level 197. 23 Return to debug level 196. 24 Return to debug level 195. 25 Return to debug level 194. 26 Return to debug level 193. 27 Return to debug level 192. 28 Return to debug level 191. 29 Return to debug level 190. 30 Return to debug level 189. 31 Return to debug level 188. 32 Return to debug level 187. 33 Return to debug level 186. 34 Return to debug level 185. 35 Return to debug level 184. 36 Return to debug level 183. 37 Return to debug level 182. 38 Return to debug level 181. 39 Return to debug level 180. 40 Return to debug level 179. 41 Return to debug level 178. 42 Return to debug level 177. 43 Return to debug level 176. 44 Return to debug level 175. 45 Return to debug level 174. 46 Return to debug level 173. 47 Return to debug level 172. 48 Return to debug level 171. 49 Return to debug level 170. 50 Return to debug level 169. 51 Return to debug level 168. 52 Return to debug level 167. 53 Return to debug level 166. 54 Return to debug level 165. 55 Return to debug level 164. 56 Return to debug level 163. 57 Return to debug level 162. 58 Return to debug level 161. 59 Return to debug level 160. 60 Return to debug level 159. 61 Return to debug level 158. 62 Return to debug level 157. 63 Return to debug level 156. 64 Return to debug level 155. 65 Return to debug level 154. 66 Return to debug level 153. 67 Return to debug level 152. 68 Return to debug level 151. 69 Return to debug level 150. 70 Return to debug level 149. 71 Return to debug level 148. 72 Return to debug level 147. 73 Return to debug level 146. 74 Return to debug level 145. 75 Return to debug level 144. 76 Return to debug level 143. 77 Return to debug level 142. 78 Return to debug level 141. 79 Return to debug level 140. 80 Return to debug level 139. 81 Return to debug level 138. 82 Return to debug level 137. 83 Return to debug level 136. 84 Return to debug level 135. 85 Return to debug level 134. 86 Return to debug level 133. 87 Return to debug level 132. 88 Return to debug level 131. 89 Return to debug level 130. 90 Return to debug level 129. 91 Return to debug level 128. 92 Return to debug level 127. 93 Return to debug level 126. 94 Return to debug level 125. 95 Return to debug level 124. 96 Return to debug level 123. 97 Return to debug level 122. 98 Return to debug level 121. 99 Return to debug level 120. 100 Return to debug level 119. 101 Return to debug level 118. 102 Return to debug level 117. 103 Return to debug level 116. 104 Return to debug level 115. 105 Return to debug level 114. 106 Return to debug level 113. 107 Return to debug level 112. 108 Return to debug level 111. 109 Return to debug level 110. 110 Return to debug level 109. 111 Return to debug level 108. 112 Return to debug level 107. 113 Return to debug level 106. 114 Return to debug level 105. 115 Return to debug level 104. 116 Return to debug level 103. 117 Return to debug level 102. 118 Return to debug level 101. 119 Return to debug level 100. 120 Return to debug level 99. 121 Return to debug level 98. 122 Return to debug level 97. 123 Return to debug level 96. 124 Return to debug level 95. 125 Return to debug level 94. 126 Return to debug level 93. 127 Return to debug level 92. 128 Return to debug level 91. 129 Return to debug level 90. 130 Return to debug level 89. 131 Return to debug level 88. 132 Return to debug level 87. 133 Return to debug level 86. 134 Return to debug level 85. 135 Return to debug level 84. 136 Return to debug level 83. 137 Return to debug level 82. 138 Return to debug level 81. 139 Return to debug level 80. 140 Return to debug level 79. 141 Return to debug level 78. 142 Return to debug level 77. 143 Return to debug level 76. 144 Return to debug level 75. 145 Return to debug level 74. 146 Return to debug level 73. 147 Return to debug level 72. 148 Return to debug level 71. 149 Return to debug level 70. 150 Return to debug level 69. 151 Return to debug level 68. 152 Return to debug level 67. 153 Return to debug level 66. 154 Return to debug level 65. 155 Return to debug level 64. 156 Return to debug level 63. 157 Return to debug level 62. 158 Return to debug level 61. 159 Return to debug level 60. 160 Return to debug level 59. 161 Return to debug level 58. 162 Return to debug level 57. 163 Return to debug level 56. 164 Return to debug level 55. 165 Return to debug level 54. 166 Return to debug level 53. 167 Return to debug level 52. 168 Return to debug level 51. 169 Return to debug level 50. 170 Return to debug level 49. 171 Return to debug level 48. 172 Return to debug level 47. 173 Return to debug level 46. 174 Return to debug level 45. 175 Return to debug level 44. 176 Return to debug level 43. 177 Return to debug level 42. 178 Return to debug level 41. 179 Return to debug level 40. 180 Return to debug level 39. 181 Return to debug level 38. 182 Return to debug level 37. 183 Return to debug level 36. 184 Return to debug level 35. 185 Return to debug level 34. 186 Return to debug level 33. 187 Return to debug level 32. 188 Return to debug level 31. 189 Return to debug level 30. 190 Return to debug level 29. 191 Return to debug level 28. 192 Return to debug level 27. 193 Return to debug level 26. 194 Return to debug level 25. 195 Return to debug level 24. 196 Return to debug level 23. 197 Return to debug level 22. 198 Return to debug level 21. 199 Return to debug level 20. 200 Return to debug level 19. 201 Return to debug level 18. 202 Return to debug level 17. 203 Return to debug level 16. 204 Return to debug level 15. 205 Return to debug level 14. 206 Return to debug level 13. 207 Return to debug level 12. 208 Return to debug level 11. 209 Return to debug level 10. 210 Return to debug level 9. 211 Return to debug level 8. 212 Return to debug level 7. 213 Return to debug level 6. 214 Return to debug level 5. 215 Return to debug level 4. 216 Return to debug level 3. 217 Return to debug level 2. 218 Return to debug level 1. 219 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 219. 2 Return to debug level 218. 3 Return to debug level 217. 4 Return to debug level 216. 5 Return to debug level 215. 6 Return to debug level 214. 7 Return to debug level 213. 8 Return to debug level 212. 9 Return to debug level 211. 10 Return to debug level 210. 11 Return to debug level 209. 12 Return to debug level 208. 13 Return to debug level 207. 14 Return to debug level 206. 15 Return to debug level 205. 16 Return to debug level 204. 17 Return to debug level 203. 18 Return to debug level 202. 19 Return to debug level 201. 20 Return to debug level 200. 21 Return to debug level 199. 22 Return to debug level 198. 23 Return to debug level 197. 24 Return to debug level 196. 25 Return to debug level 195. 26 Return to debug level 194. 27 Return to debug level 193. 28 Return to debug level 192. 29 Return to debug level 191. 30 Return to debug level 190. 31 Return to debug level 189. 32 Return to debug level 188. 33 Return to debug level 187. 34 Return to debug level 186. 35 Return to debug level 185. 36 Return to debug level 184. 37 Return to debug level 183. 38 Return to debug level 182. 39 Return to debug level 181. 40 Return to debug level 180. 41 Return to debug level 179. 42 Return to debug level 178. 43 Return to debug level 177. 44 Return to debug level 176. 45 Return to debug level 175. 46 Return to debug level 174. 47 Return to debug level 173. 48 Return to debug level 172. 49 Return to debug level 171. 50 Return to debug level 170. 51 Return to debug level 169. 52 Return to debug level 168. 53 Return to debug level 167. 54 Return to debug level 166. 55 Return to debug level 165. 56 Return to debug level 164. 57 Return to debug level 163. 58 Return to debug level 162. 59 Return to debug level 161. 60 Return to debug level 160. 61 Return to debug level 159. 62 Return to debug level 158. 63 Return to debug level 157. 64 Return to debug level 156. 65 Return to debug level 155. 66 Return to debug level 154. 67 Return to debug level 153. 68 Return to debug level 152. 69 Return to debug level 151. 70 Return to debug level 150. 71 Return to debug level 149. 72 Return to debug level 148. 73 Return to debug level 147. 74 Return to debug level 146. 75 Return to debug level 145. 76 Return to debug level 144. 77 Return to debug level 143. 78 Return to debug level 142. 79 Return to debug level 141. 80 Return to debug level 140. 81 Return to debug level 139. 82 Return to debug level 138. 83 Return to debug level 137. 84 Return to debug level 136. 85 Return to debug level 135. 86 Return to debug level 134. 87 Return to debug level 133. 88 Return to debug level 132. 89 Return to debug level 131. 90 Return to debug level 130. 91 Return to debug level 129. 92 Return to debug level 128. 93 Return to debug level 127. 94 Return to debug level 126. 95 Return to debug level 125. 96 Return to debug level 124. 97 Return to debug level 123. 98 Return to debug level 122. 99 Return to debug level 121. 100 Return to debug level 120. 101 Return to debug level 119. 102 Return to debug level 118. 103 Return to debug level 117. 104 Return to debug level 116. 105 Return to debug level 115. 106 Return to debug level 114. 107 Return to debug level 113. 108 Return to debug level 112. 109 Return to debug level 111. 110 Return to debug level 110. 111 Return to debug level 109. 112 Return to debug level 108. 113 Return to debug level 107. 114 Return to debug level 106. 115 Return to debug level 105. 116 Return to debug level 104. 117 Return to debug level 103. 118 Return to debug level 102. 119 Return to debug level 101. 120 Return to debug level 100. 121 Return to debug level 99. 122 Return to debug level 98. 123 Return to debug level 97. 124 Return to debug level 96. 125 Return to debug level 95. 126 Return to debug level 94. 127 Return to debug level 93. 128 Return to debug level 92. 129 Return to debug level 91. 130 Return to debug level 90. 131 Return to debug level 89. 132 Return to debug level 88. 133 Return to debug level 87. 134 Return to debug level 86. 135 Return to debug level 85. 136 Return to debug level 84. 137 Return to debug level 83. 138 Return to debug level 82. 139 Return to debug level 81. 140 Return to debug level 80. 141 Return to debug level 79. 142 Return to debug level 78. 143 Return to debug level 77. 144 Return to debug level 76. 145 Return to debug level 75. 146 Return to debug level 74. 147 Return to debug level 73. 148 Return to debug level 72. 149 Return to debug level 71. 150 Return to debug level 70. 151 Return to debug level 69. 152 Return to debug level 68. 153 Return to debug level 67. 154 Return to debug level 66. 155 Return to debug level 65. 156 Return to debug level 64. 157 Return to debug level 63. 158 Return to debug level 62. 159 Return to debug level 61. 160 Return to debug level 60. 161 Return to debug level 59. 162 Return to debug level 58. 163 Return to debug level 57. 164 Return to debug level 56. 165 Return to debug level 55. 166 Return to debug level 54. 167 Return to debug level 53. 168 Return to debug level 52. 169 Return to debug level 51. 170 Return to debug level 50. 171 Return to debug level 49. 172 Return to debug level 48. 173 Return to debug level 47. 174 Return to debug level 46. 175 Return to debug level 45. 176 Return to debug level 44. 177 Return to debug level 43. 178 Return to debug level 42. 179 Return to debug level 41. 180 Return to debug level 40. 181 Return to debug level 39. 182 Return to debug level 38. 183 Return to debug level 37. 184 Return to debug level 36. 185 Return to debug level 35. 186 Return to debug level 34. 187 Return to debug level 33. 188 Return to debug level 32. 189 Return to debug level 31. 190 Return to debug level 30. 191 Return to debug level 29. 192 Return to debug level 28. 193 Return to debug level 27. 194 Return to debug level 26. 195 Return to debug level 25. 196 Return to debug level 24. 197 Return to debug level 23. 198 Return to debug level 22. 199 Return to debug level 21. 200 Return to debug level 20. 201 Return to debug level 19. 202 Return to debug level 18. 203 Return to debug level 17. 204 Return to debug level 16. 205 Return to debug level 15. 206 Return to debug level 14. 207 Return to debug level 13. 208 Return to debug level 12. 209 Return to debug level 11. 210 Return to debug level 10. 211 Return to debug level 9. 212 Return to debug level 8. 213 Return to debug level 7. 214 Return to debug level 6. 215 Return to debug level 5. 216 Return to debug level 4. 217 Return to debug level 3. 218 Return to debug level 2. 219 Return to debug level 1. 220 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 220. 2 Return to debug level 219. 3 Return to debug level 218. 4 Return to debug level 217. 5 Return to debug level 216. 6 Return to debug level 215. 7 Return to debug level 214. 8 Return to debug level 213. 9 Return to debug level 212. 10 Return to debug level 211. 11 Return to debug level 210. 12 Return to debug level 209. 13 Return to debug level 208. 14 Return to debug level 207. 15 Return to debug level 206. 16 Return to debug level 205. 17 Return to debug level 204. 18 Return to debug level 203. 19 Return to debug level 202. 20 Return to debug level 201. 21 Return to debug level 200. 22 Return to debug level 199. 23 Return to debug level 198. 24 Return to debug level 197. 25 Return to debug level 196. 26 Return to debug level 195. 27 Return to debug level 194. 28 Return to debug level 193. 29 Return to debug level 192. 30 Return to debug level 191. 31 Return to debug level 190. 32 Return to debug level 189. 33 Return to debug level 188. 34 Return to debug level 187. 35 Return to debug level 186. 36 Return to debug level 185. 37 Return to debug level 184. 38 Return to debug level 183. 39 Return to debug level 182. 40 Return to debug level 181. 41 Return to debug level 180. 42 Return to debug level 179. 43 Return to debug level 178. 44 Return to debug level 177. 45 Return to debug level 176. 46 Return to debug level 175. 47 Return to debug level 174. 48 Return to debug level 173. 49 Return to debug level 172. 50 Return to debug level 171. 51 Return to debug level 170. 52 Return to debug level 169. 53 Return to debug level 168. 54 Return to debug level 167. 55 Return to debug level 166. 56 Return to debug level 165. 57 Return to debug level 164. 58 Return to debug level 163. 59 Return to debug level 162. 60 Return to debug level 161. 61 Return to debug level 160. 62 Return to debug level 159. 63 Return to debug level 158. 64 Return to debug level 157. 65 Return to debug level 156. 66 Return to debug level 155. 67 Return to debug level 154. 68 Return to debug level 153. 69 Return to debug level 152. 70 Return to debug level 151. 71 Return to debug level 150. 72 Return to debug level 149. 73 Return to debug level 148. 74 Return to debug level 147. 75 Return to debug level 146. 76 Return to debug level 145. 77 Return to debug level 144. 78 Return to debug level 143. 79 Return to debug level 142. 80 Return to debug level 141. 81 Return to debug level 140. 82 Return to debug level 139. 83 Return to debug level 138. 84 Return to debug level 137. 85 Return to debug level 136. 86 Return to debug level 135. 87 Return to debug level 134. 88 Return to debug level 133. 89 Return to debug level 132. 90 Return to debug level 131. 91 Return to debug level 130. 92 Return to debug level 129. 93 Return to debug level 128. 94 Return to debug level 127. 95 Return to debug level 126. 96 Return to debug level 125. 97 Return to debug level 124. 98 Return to debug level 123. 99 Return to debug level 122. 100 Return to debug level 121. 101 Return to debug level 120. 102 Return to debug level 119. 103 Return to debug level 118. 104 Return to debug level 117. 105 Return to debug level 116. 106 Return to debug level 115. 107 Return to debug level 114. 108 Return to debug level 113. 109 Return to debug level 112. 110 Return to debug level 111. 111 Return to debug level 110. 112 Return to debug level 109. 113 Return to debug level 108. 114 Return to debug level 107. 115 Return to debug level 106. 116 Return to debug level 105. 117 Return to debug level 104. 118 Return to debug level 103. 119 Return to debug level 102. 120 Return to debug level 101. 121 Return to debug level 100. 122 Return to debug level 99. 123 Return to debug level 98. 124 Return to debug level 97. 125 Return to debug level 96. 126 Return to debug level 95. 127 Return to debug level 94. 128 Return to debug level 93. 129 Return to debug level 92. 130 Return to debug level 91. 131 Return to debug level 90. 132 Return to debug level 89. 133 Return to debug level 88. 134 Return to debug level 87. 135 Return to debug level 86. 136 Return to debug level 85. 137 Return to debug level 84. 138 Return to debug level 83. 139 Return to debug level 82. 140 Return to debug level 81. 141 Return to debug level 80. 142 Return to debug level 79. 143 Return to debug level 78. 144 Return to debug level 77. 145 Return to debug level 76. 146 Return to debug level 75. 147 Return to debug level 74. 148 Return to debug level 73. 149 Return to debug level 72. 150 Return to debug level 71. 151 Return to debug level 70. 152 Return to debug level 69. 153 Return to debug level 68. 154 Return to debug level 67. 155 Return to debug level 66. 156 Return to debug level 65. 157 Return to debug level 64. 158 Return to debug level 63. 159 Return to debug level 62. 160 Return to debug level 61. 161 Return to debug level 60. 162 Return to debug level 59. 163 Return to debug level 58. 164 Return to debug level 57. 165 Return to debug level 56. 166 Return to debug level 55. 167 Return to debug level 54. 168 Return to debug level 53. 169 Return to debug level 52. 170 Return to debug level 51. 171 Return to debug level 50. 172 Return to debug level 49. 173 Return to debug level 48. 174 Return to debug level 47. 175 Return to debug level 46. 176 Return to debug level 45. 177 Return to debug level 44. 178 Return to debug level 43. 179 Return to debug level 42. 180 Return to debug level 41. 181 Return to debug level 40. 182 Return to debug level 39. 183 Return to debug level 38. 184 Return to debug level 37. 185 Return to debug level 36. 186 Return to debug level 35. 187 Return to debug level 34. 188 Return to debug level 33. 189 Return to debug level 32. 190 Return to debug level 31. 191 Return to debug level 30. 192 Return to debug level 29. 193 Return to debug level 28. 194 Return to debug level 27. 195 Return to debug level 26. 196 Return to debug level 25. 197 Return to debug level 24. 198 Return to debug level 23. 199 Return to debug level 22. 200 Return to debug level 21. 201 Return to debug level 20. 202 Return to debug level 19. 203 Return to debug level 18. 204 Return to debug level 17. 205 Return to debug level 16. 206 Return to debug level 15. 207 Return to debug level 14. 208 Return to debug level 13. 209 Return to debug level 12. 210 Return to debug level 11. 211 Return to debug level 10. 212 Return to debug level 9. 213 Return to debug level 8. 214 Return to debug level 7. 215 Return to debug level 6. 216 Return to debug level 5. 217 Return to debug level 4. 218 Return to debug level 3. 219 Return to debug level 2. 220 Return to debug level 1. 221 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 221. 2 Return to debug level 220. 3 Return to debug level 219. 4 Return to debug level 218. 5 Return to debug level 217. 6 Return to debug level 216. 7 Return to debug level 215. 8 Return to debug level 214. 9 Return to debug level 213. 10 Return to debug level 212. 11 Return to debug level 211. 12 Return to debug level 210. 13 Return to debug level 209. 14 Return to debug level 208. 15 Return to debug level 207. 16 Return to debug level 206. 17 Return to debug level 205. 18 Return to debug level 204. 19 Return to debug level 203. 20 Return to debug level 202. 21 Return to debug level 201. 22 Return to debug level 200. 23 Return to debug level 199. 24 Return to debug level 198. 25 Return to debug level 197. 26 Return to debug level 196. 27 Return to debug level 195. 28 Return to debug level 194. 29 Return to debug level 193. 30 Return to debug level 192. 31 Return to debug level 191. 32 Return to debug level 190. 33 Return to debug level 189. 34 Return to debug level 188. 35 Return to debug level 187. 36 Return to debug level 186. 37 Return to debug level 185. 38 Return to debug level 184. 39 Return to debug level 183. 40 Return to debug level 182. 41 Return to debug level 181. 42 Return to debug level 180. 43 Return to debug level 179. 44 Return to debug level 178. 45 Return to debug level 177. 46 Return to debug level 176. 47 Return to debug level 175. 48 Return to debug level 174. 49 Return to debug level 173. 50 Return to debug level 172. 51 Return to debug level 171. 52 Return to debug level 170. 53 Return to debug level 169. 54 Return to debug level 168. 55 Return to debug level 167. 56 Return to debug level 166. 57 Return to debug level 165. 58 Return to debug level 164. 59 Return to debug level 163. 60 Return to debug level 162. 61 Return to debug level 161. 62 Return to debug level 160. 63 Return to debug level 159. 64 Return to debug level 158. 65 Return to debug level 157. 66 Return to debug level 156. 67 Return to debug level 155. 68 Return to debug level 154. 69 Return to debug level 153. 70 Return to debug level 152. 71 Return to debug level 151. 72 Return to debug level 150. 73 Return to debug level 149. 74 Return to debug level 148. 75 Return to debug level 147. 76 Return to debug level 146. 77 Return to debug level 145. 78 Return to debug level 144. 79 Return to debug level 143. 80 Return to debug level 142. 81 Return to debug level 141. 82 Return to debug level 140. 83 Return to debug level 139. 84 Return to debug level 138. 85 Return to debug level 137. 86 Return to debug level 136. 87 Return to debug level 135. 88 Return to debug level 134. 89 Return to debug level 133. 90 Return to debug level 132. 91 Return to debug level 131. 92 Return to debug level 130. 93 Return to debug level 129. 94 Return to debug level 128. 95 Return to debug level 127. 96 Return to debug level 126. 97 Return to debug level 125. 98 Return to debug level 124. 99 Return to debug level 123. 100 Return to debug level 122. 101 Return to debug level 121. 102 Return to debug level 120. 103 Return to debug level 119. 104 Return to debug level 118. 105 Return to debug level 117. 106 Return to debug level 116. 107 Return to debug level 115. 108 Return to debug level 114. 109 Return to debug level 113. 110 Return to debug level 112. 111 Return to debug level 111. 112 Return to debug level 110. 113 Return to debug level 109. 114 Return to debug level 108. 115 Return to debug level 107. 116 Return to debug level 106. 117 Return to debug level 105. 118 Return to debug level 104. 119 Return to debug level 103. 120 Return to debug level 102. 121 Return to debug level 101. 122 Return to debug level 100. 123 Return to debug level 99. 124 Return to debug level 98. 125 Return to debug level 97. 126 Return to debug level 96. 127 Return to debug level 95. 128 Return to debug level 94. 129 Return to debug level 93. 130 Return to debug level 92. 131 Return to debug level 91. 132 Return to debug level 90. 133 Return to debug level 89. 134 Return to debug level 88. 135 Return to debug level 87. 136 Return to debug level 86. 137 Return to debug level 85. 138 Return to debug level 84. 139 Return to debug level 83. 140 Return to debug level 82. 141 Return to debug level 81. 142 Return to debug level 80. 143 Return to debug level 79. 144 Return to debug level 78. 145 Return to debug level 77. 146 Return to debug level 76. 147 Return to debug level 75. 148 Return to debug level 74. 149 Return to debug level 73. 150 Return to debug level 72. 151 Return to debug level 71. 152 Return to debug level 70. 153 Return to debug level 69. 154 Return to debug level 68. 155 Return to debug level 67. 156 Return to debug level 66. 157 Return to debug level 65. 158 Return to debug level 64. 159 Return to debug level 63. 160 Return to debug level 62. 161 Return to debug level 61. 162 Return to debug level 60. 163 Return to debug level 59. 164 Return to debug level 58. 165 Return to debug level 57. 166 Return to debug level 56. 167 Return to debug level 55. 168 Return to debug level 54. 169 Return to debug level 53. 170 Return to debug level 52. 171 Return to debug level 51. 172 Return to debug level 50. 173 Return to debug level 49. 174 Return to debug level 48. 175 Return to debug level 47. 176 Return to debug level 46. 177 Return to debug level 45. 178 Return to debug level 44. 179 Return to debug level 43. 180 Return to debug level 42. 181 Return to debug level 41. 182 Return to debug level 40. 183 Return to debug level 39. 184 Return to debug level 38. 185 Return to debug level 37. 186 Return to debug level 36. 187 Return to debug level 35. 188 Return to debug level 34. 189 Return to debug level 33. 190 Return to debug level 32. 191 Return to debug level 31. 192 Return to debug level 30. 193 Return to debug level 29. 194 Return to debug level 28. 195 Return to debug level 27. 196 Return to debug level 26. 197 Return to debug level 25. 198 Return to debug level 24. 199 Return to debug level 23. 200 Return to debug level 22. 201 Return to debug level 21. 202 Return to debug level 20. 203 Return to debug level 19. 204 Return to debug level 18. 205 Return to debug level 17. 206 Return to debug level 16. 207 Return to debug level 15. 208 Return to debug level 14. 209 Return to debug level 13. 210 Return to debug level 12. 211 Return to debug level 11. 212 Return to debug level 10. 213 Return to debug level 9. 214 Return to debug level 8. 215 Return to debug level 7. 216 Return to debug level 6. 217 Return to debug level 5. 218 Return to debug level 4. 219 Return to debug level 3. 220 Return to debug level 2. 221 Return to debug level 1. 222 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 222. 2 Return to debug level 221. 3 Return to debug level 220. 4 Return to debug level 219. 5 Return to debug level 218. 6 Return to debug level 217. 7 Return to debug level 216. 8 Return to debug level 215. 9 Return to debug level 214. 10 Return to debug level 213. 11 Return to debug level 212. 12 Return to debug level 211. 13 Return to debug level 210. 14 Return to debug level 209. 15 Return to debug level 208. 16 Return to debug level 207. 17 Return to debug level 206. 18 Return to debug level 205. 19 Return to debug level 204. 20 Return to debug level 203. 21 Return to debug level 202. 22 Return to debug level 201. 23 Return to debug level 200. 24 Return to debug level 199. 25 Return to debug level 198. 26 Return to debug level 197. 27 Return to debug level 196. 28 Return to debug level 195. 29 Return to debug level 194. 30 Return to debug level 193. 31 Return to debug level 192. 32 Return to debug level 191. 33 Return to debug level 190. 34 Return to debug level 189. 35 Return to debug level 188. 36 Return to debug level 187. 37 Return to debug level 186. 38 Return to debug level 185. 39 Return to debug level 184. 40 Return to debug level 183. 41 Return to debug level 182. 42 Return to debug level 181. 43 Return to debug level 180. 44 Return to debug level 179. 45 Return to debug level 178. 46 Return to debug level 177. 47 Return to debug level 176. 48 Return to debug level 175. 49 Return to debug level 174. 50 Return to debug level 173. 51 Return to debug level 172. 52 Return to debug level 171. 53 Return to debug level 170. 54 Return to debug level 169. 55 Return to debug level 168. 56 Return to debug level 167. 57 Return to debug level 166. 58 Return to debug level 165. 59 Return to debug level 164. 60 Return to debug level 163. 61 Return to debug level 162. 62 Return to debug level 161. 63 Return to debug level 160. 64 Return to debug level 159. 65 Return to debug level 158. 66 Return to debug level 157. 67 Return to debug level 156. 68 Return to debug level 155. 69 Return to debug level 154. 70 Return to debug level 153. 71 Return to debug level 152. 72 Return to debug level 151. 73 Return to debug level 150. 74 Return to debug level 149. 75 Return to debug level 148. 76 Return to debug level 147. 77 Return to debug level 146. 78 Return to debug level 145. 79 Return to debug level 144. 80 Return to debug level 143. 81 Return to debug level 142. 82 Return to debug level 141. 83 Return to debug level 140. 84 Return to debug level 139. 85 Return to debug level 138. 86 Return to debug level 137. 87 Return to debug level 136. 88 Return to debug level 135. 89 Return to debug level 134. 90 Return to debug level 133. 91 Return to debug level 132. 92 Return to debug level 131. 93 Return to debug level 130. 94 Return to debug level 129. 95 Return to debug level 128. 96 Return to debug level 127. 97 Return to debug level 126. 98 Return to debug level 125. 99 Return to debug level 124. 100 Return to debug level 123. 101 Return to debug level 122. 102 Return to debug level 121. 103 Return to debug level 120. 104 Return to debug level 119. 105 Return to debug level 118. 106 Return to debug level 117. 107 Return to debug level 116. 108 Return to debug level 115. 109 Return to debug level 114. 110 Return to debug level 113. 111 Return to debug level 112. 112 Return to debug level 111. 113 Return to debug level 110. 114 Return to debug level 109. 115 Return to debug level 108. 116 Return to debug level 107. 117 Return to debug level 106. 118 Return to debug level 105. 119 Return to debug level 104. 120 Return to debug level 103. 121 Return to debug level 102. 122 Return to debug level 101. 123 Return to debug level 100. 124 Return to debug level 99. 125 Return to debug level 98. 126 Return to debug level 97. 127 Return to debug level 96. 128 Return to debug level 95. 129 Return to debug level 94. 130 Return to debug level 93. 131 Return to debug level 92. 132 Return to debug level 91. 133 Return to debug level 90. 134 Return to debug level 89. 135 Return to debug level 88. 136 Return to debug level 87. 137 Return to debug level 86. 138 Return to debug level 85. 139 Return to debug level 84. 140 Return to debug level 83. 141 Return to debug level 82. 142 Return to debug level 81. 143 Return to debug level 80. 144 Return to debug level 79. 145 Return to debug level 78. 146 Return to debug level 77. 147 Return to debug level 76. 148 Return to debug level 75. 149 Return to debug level 74. 150 Return to debug level 73. 151 Return to debug level 72. 152 Return to debug level 71. 153 Return to debug level 70. 154 Return to debug level 69. 155 Return to debug level 68. 156 Return to debug level 67. 157 Return to debug level 66. 158 Return to debug level 65. 159 Return to debug level 64. 160 Return to debug level 63. 161 Return to debug level 62. 162 Return to debug level 61. 163 Return to debug level 60. 164 Return to debug level 59. 165 Return to debug level 58. 166 Return to debug level 57. 167 Return to debug level 56. 168 Return to debug level 55. 169 Return to debug level 54. 170 Return to debug level 53. 171 Return to debug level 52. 172 Return to debug level 51. 173 Return to debug level 50. 174 Return to debug level 49. 175 Return to debug level 48. 176 Return to debug level 47. 177 Return to debug level 46. 178 Return to debug level 45. 179 Return to debug level 44. 180 Return to debug level 43. 181 Return to debug level 42. 182 Return to debug level 41. 183 Return to debug level 40. 184 Return to debug level 39. 185 Return to debug level 38. 186 Return to debug level 37. 187 Return to debug level 36. 188 Return to debug level 35. 189 Return to debug level 34. 190 Return to debug level 33. 191 Return to debug level 32. 192 Return to debug level 31. 193 Return to debug level 30. 194 Return to debug level 29. 195 Return to debug level 28. 196 Return to debug level 27. 197 Return to debug level 26. 198 Return to debug level 25. 199 Return to debug level 24. 200 Return to debug level 23. 201 Return to debug level 22. 202 Return to debug level 21. 203 Return to debug level 20. 204 Return to debug level 19. 205 Return to debug level 18. 206 Return to debug level 17. 207 Return to debug level 16. 208 Return to debug level 15. 209 Return to debug level 14. 210 Return to debug level 13. 211 Return to debug level 12. 212 Return to debug level 11. 213 Return to debug level 10. 214 Return to debug level 9. 215 Return to debug level 8. 216 Return to debug level 7. 217 Return to debug level 6. 218 Return to debug level 5. 219 Return to debug level 4. 220 Return to debug level 3. 221 Return to debug level 2. 222 Return to debug level 1. 223 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 223. 2 Return to debug level 222. 3 Return to debug level 221. 4 Return to debug level 220. 5 Return to debug level 219. 6 Return to debug level 218. 7 Return to debug level 217. 8 Return to debug level 216. 9 Return to debug level 215. 10 Return to debug level 214. 11 Return to debug level 213. 12 Return to debug level 212. 13 Return to debug level 211. 14 Return to debug level 210. 15 Return to debug level 209. 16 Return to debug level 208. 17 Return to debug level 207. 18 Return to debug level 206. 19 Return to debug level 205. 20 Return to debug level 204. 21 Return to debug level 203. 22 Return to debug level 202. 23 Return to debug level 201. 24 Return to debug level 200. 25 Return to debug level 199. 26 Return to debug level 198. 27 Return to debug level 197. 28 Return to debug level 196. 29 Return to debug level 195. 30 Return to debug level 194. 31 Return to debug level 193. 32 Return to debug level 192. 33 Return to debug level 191. 34 Return to debug level 190. 35 Return to debug level 189. 36 Return to debug level 188. 37 Return to debug level 187. 38 Return to debug level 186. 39 Return to debug level 185. 40 Return to debug level 184. 41 Return to debug level 183. 42 Return to debug level 182. 43 Return to debug level 181. 44 Return to debug level 180. 45 Return to debug level 179. 46 Return to debug level 178. 47 Return to debug level 177. 48 Return to debug level 176. 49 Return to debug level 175. 50 Return to debug level 174. 51 Return to debug level 173. 52 Return to debug level 172. 53 Return to debug level 171. 54 Return to debug level 170. 55 Return to debug level 169. 56 Return to debug level 168. 57 Return to debug level 167. 58 Return to debug level 166. 59 Return to debug level 165. 60 Return to debug level 164. 61 Return to debug level 163. 62 Return to debug level 162. 63 Return to debug level 161. 64 Return to debug level 160. 65 Return to debug level 159. 66 Return to debug level 158. 67 Return to debug level 157. 68 Return to debug level 156. 69 Return to debug level 155. 70 Return to debug level 154. 71 Return to debug level 153. 72 Return to debug level 152. 73 Return to debug level 151. 74 Return to debug level 150. 75 Return to debug level 149. 76 Return to debug level 148. 77 Return to debug level 147. 78 Return to debug level 146. 79 Return to debug level 145. 80 Return to debug level 144. 81 Return to debug level 143. 82 Return to debug level 142. 83 Return to debug level 141. 84 Return to debug level 140. 85 Return to debug level 139. 86 Return to debug level 138. 87 Return to debug level 137. 88 Return to debug level 136. 89 Return to debug level 135. 90 Return to debug level 134. 91 Return to debug level 133. 92 Return to debug level 132. 93 Return to debug level 131. 94 Return to debug level 130. 95 Return to debug level 129. 96 Return to debug level 128. 97 Return to debug level 127. 98 Return to debug level 126. 99 Return to debug level 125. 100 Return to debug level 124. 101 Return to debug level 123. 102 Return to debug level 122. 103 Return to debug level 121. 104 Return to debug level 120. 105 Return to debug level 119. 106 Return to debug level 118. 107 Return to debug level 117. 108 Return to debug level 116. 109 Return to debug level 115. 110 Return to debug level 114. 111 Return to debug level 113. 112 Return to debug level 112. 113 Return to debug level 111. 114 Return to debug level 110. 115 Return to debug level 109. 116 Return to debug level 108. 117 Return to debug level 107. 118 Return to debug level 106. 119 Return to debug level 105. 120 Return to debug level 104. 121 Return to debug level 103. 122 Return to debug level 102. 123 Return to debug level 101. 124 Return to debug level 100. 125 Return to debug level 99. 126 Return to debug level 98. 127 Return to debug level 97. 128 Return to debug level 96. 129 Return to debug level 95. 130 Return to debug level 94. 131 Return to debug level 93. 132 Return to debug level 92. 133 Return to debug level 91. 134 Return to debug level 90. 135 Return to debug level 89. 136 Return to debug level 88. 137 Return to debug level 87. 138 Return to debug level 86. 139 Return to debug level 85. 140 Return to debug level 84. 141 Return to debug level 83. 142 Return to debug level 82. 143 Return to debug level 81. 144 Return to debug level 80. 145 Return to debug level 79. 146 Return to debug level 78. 147 Return to debug level 77. 148 Return to debug level 76. 149 Return to debug level 75. 150 Return to debug level 74. 151 Return to debug level 73. 152 Return to debug level 72. 153 Return to debug level 71. 154 Return to debug level 70. 155 Return to debug level 69. 156 Return to debug level 68. 157 Return to debug level 67. 158 Return to debug level 66. 159 Return to debug level 65. 160 Return to debug level 64. 161 Return to debug level 63. 162 Return to debug level 62. 163 Return to debug level 61. 164 Return to debug level 60. 165 Return to debug level 59. 166 Return to debug level 58. 167 Return to debug level 57. 168 Return to debug level 56. 169 Return to debug level 55. 170 Return to debug level 54. 171 Return to debug level 53. 172 Return to debug level 52. 173 Return to debug level 51. 174 Return to debug level 50. 175 Return to debug level 49. 176 Return to debug level 48. 177 Return to debug level 47. 178 Return to debug level 46. 179 Return to debug level 45. 180 Return to debug level 44. 181 Return to debug level 43. 182 Return to debug level 42. 183 Return to debug level 41. 184 Return to debug level 40. 185 Return to debug level 39. 186 Return to debug level 38. 187 Return to debug level 37. 188 Return to debug level 36. 189 Return to debug level 35. 190 Return to debug level 34. 191 Return to debug level 33. 192 Return to debug level 32. 193 Return to debug level 31. 194 Return to debug level 30. 195 Return to debug level 29. 196 Return to debug level 28. 197 Return to debug level 27. 198 Return to debug level 26. 199 Return to debug level 25. 200 Return to debug level 24. 201 Return to debug level 23. 202 Return to debug level 22. 203 Return to debug level 21. 204 Return to debug level 20. 205 Return to debug level 19. 206 Return to debug level 18. 207 Return to debug level 17. 208 Return to debug level 16. 209 Return to debug level 15. 210 Return to debug level 14. 211 Return to debug level 13. 212 Return to debug level 12. 213 Return to debug level 11. 214 Return to debug level 10. 215 Return to debug level 9. 216 Return to debug level 8. 217 Return to debug level 7. 218 Return to debug level 6. 219 Return to debug level 5. 220 Return to debug level 4. 221 Return to debug level 3. 222 Return to debug level 2. 223 Return to debug level 1. 224 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 224. 2 Return to debug level 223. 3 Return to debug level 222. 4 Return to debug level 221. 5 Return to debug level 220. 6 Return to debug level 219. 7 Return to debug level 218. 8 Return to debug level 217. 9 Return to debug level 216. 10 Return to debug level 215. 11 Return to debug level 214. 12 Return to debug level 213. 13 Return to debug level 212. 14 Return to debug level 211. 15 Return to debug level 210. 16 Return to debug level 209. 17 Return to debug level 208. 18 Return to debug level 207. 19 Return to debug level 206. 20 Return to debug level 205. 21 Return to debug level 204. 22 Return to debug level 203. 23 Return to debug level 202. 24 Return to debug level 201. 25 Return to debug level 200. 26 Return to debug level 199. 27 Return to debug level 198. 28 Return to debug level 197. 29 Return to debug level 196. 30 Return to debug level 195. 31 Return to debug level 194. 32 Return to debug level 193. 33 Return to debug level 192. 34 Return to debug level 191. 35 Return to debug level 190. 36 Return to debug level 189. 37 Return to debug level 188. 38 Return to debug level 187. 39 Return to debug level 186. 40 Return to debug level 185. 41 Return to debug level 184. 42 Return to debug level 183. 43 Return to debug level 182. 44 Return to debug level 181. 45 Return to debug level 180. 46 Return to debug level 179. 47 Return to debug level 178. 48 Return to debug level 177. 49 Return to debug level 176. 50 Return to debug level 175. 51 Return to debug level 174. 52 Return to debug level 173. 53 Return to debug level 172. 54 Return to debug level 171. 55 Return to debug level 170. 56 Return to debug level 169. 57 Return to debug level 168. 58 Return to debug level 167. 59 Return to debug level 166. 60 Return to debug level 165. 61 Return to debug level 164. 62 Return to debug level 163. 63 Return to debug level 162. 64 Return to debug level 161. 65 Return to debug level 160. 66 Return to debug level 159. 67 Return to debug level 158. 68 Return to debug level 157. 69 Return to debug level 156. 70 Return to debug level 155. 71 Return to debug level 154. 72 Return to debug level 153. 73 Return to debug level 152. 74 Return to debug level 151. 75 Return to debug level 150. 76 Return to debug level 149. 77 Return to debug level 148. 78 Return to debug level 147. 79 Return to debug level 146. 80 Return to debug level 145. 81 Return to debug level 144. 82 Return to debug level 143. 83 Return to debug level 142. 84 Return to debug level 141. 85 Return to debug level 140. 86 Return to debug level 139. 87 Return to debug level 138. 88 Return to debug level 137. 89 Return to debug level 136. 90 Return to debug level 135. 91 Return to debug level 134. 92 Return to debug level 133. 93 Return to debug level 132. 94 Return to debug level 131. 95 Return to debug level 130. 96 Return to debug level 129. 97 Return to debug level 128. 98 Return to debug level 127. 99 Return to debug level 126. 100 Return to debug level 125. 101 Return to debug level 124. 102 Return to debug level 123. 103 Return to debug level 122. 104 Return to debug level 121. 105 Return to debug level 120. 106 Return to debug level 119. 107 Return to debug level 118. 108 Return to debug level 117. 109 Return to debug level 116. 110 Return to debug level 115. 111 Return to debug level 114. 112 Return to debug level 113. 113 Return to debug level 112. 114 Return to debug level 111. 115 Return to debug level 110. 116 Return to debug level 109. 117 Return to debug level 108. 118 Return to debug level 107. 119 Return to debug level 106. 120 Return to debug level 105. 121 Return to debug level 104. 122 Return to debug level 103. 123 Return to debug level 102. 124 Return to debug level 101. 125 Return to debug level 100. 126 Return to debug level 99. 127 Return to debug level 98. 128 Return to debug level 97. 129 Return to debug level 96. 130 Return to debug level 95. 131 Return to debug level 94. 132 Return to debug level 93. 133 Return to debug level 92. 134 Return to debug level 91. 135 Return to debug level 90. 136 Return to debug level 89. 137 Return to debug level 88. 138 Return to debug level 87. 139 Return to debug level 86. 140 Return to debug level 85. 141 Return to debug level 84. 142 Return to debug level 83. 143 Return to debug level 82. 144 Return to debug level 81. 145 Return to debug level 80. 146 Return to debug level 79. 147 Return to debug level 78. 148 Return to debug level 77. 149 Return to debug level 76. 150 Return to debug level 75. 151 Return to debug level 74. 152 Return to debug level 73. 153 Return to debug level 72. 154 Return to debug level 71. 155 Return to debug level 70. 156 Return to debug level 69. 157 Return to debug level 68. 158 Return to debug level 67. 159 Return to debug level 66. 160 Return to debug level 65. 161 Return to debug level 64. 162 Return to debug level 63. 163 Return to debug level 62. 164 Return to debug level 61. 165 Return to debug level 60. 166 Return to debug level 59. 167 Return to debug level 58. 168 Return to debug level 57. 169 Return to debug level 56. 170 Return to debug level 55. 171 Return to debug level 54. 172 Return to debug level 53. 173 Return to debug level 52. 174 Return to debug level 51. 175 Return to debug level 50. 176 Return to debug level 49. 177 Return to debug level 48. 178 Return to debug level 47. 179 Return to debug level 46. 180 Return to debug level 45. 181 Return to debug level 44. 182 Return to debug level 43. 183 Return to debug level 42. 184 Return to debug level 41. 185 Return to debug level 40. 186 Return to debug level 39. 187 Return to debug level 38. 188 Return to debug level 37. 189 Return to debug level 36. 190 Return to debug level 35. 191 Return to debug level 34. 192 Return to debug level 33. 193 Return to debug level 32. 194 Return to debug level 31. 195 Return to debug level 30. 196 Return to debug level 29. 197 Return to debug level 28. 198 Return to debug level 27. 199 Return to debug level 26. 200 Return to debug level 25. 201 Return to debug level 24. 202 Return to debug level 23. 203 Return to debug level 22. 204 Return to debug level 21. 205 Return to debug level 20. 206 Return to debug level 19. 207 Return to debug level 18. 208 Return to debug level 17. 209 Return to debug level 16. 210 Return to debug level 15. 211 Return to debug level 14. 212 Return to debug level 13. 213 Return to debug level 12. 214 Return to debug level 11. 215 Return to debug level 10. 216 Return to debug level 9. 217 Return to debug level 8. 218 Return to debug level 7. 219 Return to debug level 6. 220 Return to debug level 5. 221 Return to debug level 4. 222 Return to debug level 3. 223 Return to debug level 2. 224 Return to debug level 1. 225 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 225. 2 Return to debug level 224. 3 Return to debug level 223. 4 Return to debug level 222. 5 Return to debug level 221. 6 Return to debug level 220. 7 Return to debug level 219. 8 Return to debug level 218. 9 Return to debug level 217. 10 Return to debug level 216. 11 Return to debug level 215. 12 Return to debug level 214. 13 Return to debug level 213. 14 Return to debug level 212. 15 Return to debug level 211. 16 Return to debug level 210. 17 Return to debug level 209. 18 Return to debug level 208. 19 Return to debug level 207. 20 Return to debug level 206. 21 Return to debug level 205. 22 Return to debug level 204. 23 Return to debug level 203. 24 Return to debug level 202. 25 Return to debug level 201. 26 Return to debug level 200. 27 Return to debug level 199. 28 Return to debug level 198. 29 Return to debug level 197. 30 Return to debug level 196. 31 Return to debug level 195. 32 Return to debug level 194. 33 Return to debug level 193. 34 Return to debug level 192. 35 Return to debug level 191. 36 Return to debug level 190. 37 Return to debug level 189. 38 Return to debug level 188. 39 Return to debug level 187. 40 Return to debug level 186. 41 Return to debug level 185. 42 Return to debug level 184. 43 Return to debug level 183. 44 Return to debug level 182. 45 Return to debug level 181. 46 Return to debug level 180. 47 Return to debug level 179. 48 Return to debug level 178. 49 Return to debug level 177. 50 Return to debug level 176. 51 Return to debug level 175. 52 Return to debug level 174. 53 Return to debug level 173. 54 Return to debug level 172. 55 Return to debug level 171. 56 Return to debug level 170. 57 Return to debug level 169. 58 Return to debug level 168. 59 Return to debug level 167. 60 Return to debug level 166. 61 Return to debug level 165. 62 Return to debug level 164. 63 Return to debug level 163. 64 Return to debug level 162. 65 Return to debug level 161. 66 Return to debug level 160. 67 Return to debug level 159. 68 Return to debug level 158. 69 Return to debug level 157. 70 Return to debug level 156. 71 Return to debug level 155. 72 Return to debug level 154. 73 Return to debug level 153. 74 Return to debug level 152. 75 Return to debug level 151. 76 Return to debug level 150. 77 Return to debug level 149. 78 Return to debug level 148. 79 Return to debug level 147. 80 Return to debug level 146. 81 Return to debug level 145. 82 Return to debug level 144. 83 Return to debug level 143. 84 Return to debug level 142. 85 Return to debug level 141. 86 Return to debug level 140. 87 Return to debug level 139. 88 Return to debug level 138. 89 Return to debug level 137. 90 Return to debug level 136. 91 Return to debug level 135. 92 Return to debug level 134. 93 Return to debug level 133. 94 Return to debug level 132. 95 Return to debug level 131. 96 Return to debug level 130. 97 Return to debug level 129. 98 Return to debug level 128. 99 Return to debug level 127. 100 Return to debug level 126. 101 Return to debug level 125. 102 Return to debug level 124. 103 Return to debug level 123. 104 Return to debug level 122. 105 Return to debug level 121. 106 Return to debug level 120. 107 Return to debug level 119. 108 Return to debug level 118. 109 Return to debug level 117. 110 Return to debug level 116. 111 Return to debug level 115. 112 Return to debug level 114. 113 Return to debug level 113. 114 Return to debug level 112. 115 Return to debug level 111. 116 Return to debug level 110. 117 Return to debug level 109. 118 Return to debug level 108. 119 Return to debug level 107. 120 Return to debug level 106. 121 Return to debug level 105. 122 Return to debug level 104. 123 Return to debug level 103. 124 Return to debug level 102. 125 Return to debug level 101. 126 Return to debug level 100. 127 Return to debug level 99. 128 Return to debug level 98. 129 Return to debug level 97. 130 Return to debug level 96. 131 Return to debug level 95. 132 Return to debug level 94. 133 Return to debug level 93. 134 Return to debug level 92. 135 Return to debug level 91. 136 Return to debug level 90. 137 Return to debug level 89. 138 Return to debug level 88. 139 Return to debug level 87. 140 Return to debug level 86. 141 Return to debug level 85. 142 Return to debug level 84. 143 Return to debug level 83. 144 Return to debug level 82. 145 Return to debug level 81. 146 Return to debug level 80. 147 Return to debug level 79. 148 Return to debug level 78. 149 Return to debug level 77. 150 Return to debug level 76. 151 Return to debug level 75. 152 Return to debug level 74. 153 Return to debug level 73. 154 Return to debug level 72. 155 Return to debug level 71. 156 Return to debug level 70. 157 Return to debug level 69. 158 Return to debug level 68. 159 Return to debug level 67. 160 Return to debug level 66. 161 Return to debug level 65. 162 Return to debug level 64. 163 Return to debug level 63. 164 Return to debug level 62. 165 Return to debug level 61. 166 Return to debug level 60. 167 Return to debug level 59. 168 Return to debug level 58. 169 Return to debug level 57. 170 Return to debug level 56. 171 Return to debug level 55. 172 Return to debug level 54. 173 Return to debug level 53. 174 Return to debug level 52. 175 Return to debug level 51. 176 Return to debug level 50. 177 Return to debug level 49. 178 Return to debug level 48. 179 Return to debug level 47. 180 Return to debug level 46. 181 Return to debug level 45. 182 Return to debug level 44. 183 Return to debug level 43. 184 Return to debug level 42. 185 Return to debug level 41. 186 Return to debug level 40. 187 Return to debug level 39. 188 Return to debug level 38. 189 Return to debug level 37. 190 Return to debug level 36. 191 Return to debug level 35. 192 Return to debug level 34. 193 Return to debug level 33. 194 Return to debug level 32. 195 Return to debug level 31. 196 Return to debug level 30. 197 Return to debug level 29. 198 Return to debug level 28. 199 Return to debug level 27. 200 Return to debug level 26. 201 Return to debug level 25. 202 Return to debug level 24. 203 Return to debug level 23. 204 Return to debug level 22. 205 Return to debug level 21. 206 Return to debug level 20. 207 Return to debug level 19. 208 Return to debug level 18. 209 Return to debug level 17. 210 Return to debug level 16. 211 Return to debug level 15. 212 Return to debug level 14. 213 Return to debug level 13. 214 Return to debug level 12. 215 Return to debug level 11. 216 Return to debug level 10. 217 Return to debug level 9. 218 Return to debug level 8. 219 Return to debug level 7. 220 Return to debug level 6. 221 Return to debug level 5. 222 Return to debug level 4. 223 Return to debug level 3. 224 Return to debug level 2. 225 Return to debug level 1. 226 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 226. 2 Return to debug level 225. 3 Return to debug level 224. 4 Return to debug level 223. 5 Return to debug level 222. 6 Return to debug level 221. 7 Return to debug level 220. 8 Return to debug level 219. 9 Return to debug level 218. 10 Return to debug level 217. 11 Return to debug level 216. 12 Return to debug level 215. 13 Return to debug level 214. 14 Return to debug level 213. 15 Return to debug level 212. 16 Return to debug level 211. 17 Return to debug level 210. 18 Return to debug level 209. 19 Return to debug level 208. 20 Return to debug level 207. 21 Return to debug level 206. 22 Return to debug level 205. 23 Return to debug level 204. 24 Return to debug level 203. 25 Return to debug level 202. 26 Return to debug level 201. 27 Return to debug level 200. 28 Return to debug level 199. 29 Return to debug level 198. 30 Return to debug level 197. 31 Return to debug level 196. 32 Return to debug level 195. 33 Return to debug level 194. 34 Return to debug level 193. 35 Return to debug level 192. 36 Return to debug level 191. 37 Return to debug level 190. 38 Return to debug level 189. 39 Return to debug level 188. 40 Return to debug level 187. 41 Return to debug level 186. 42 Return to debug level 185. 43 Return to debug level 184. 44 Return to debug level 183. 45 Return to debug level 182. 46 Return to debug level 181. 47 Return to debug level 180. 48 Return to debug level 179. 49 Return to debug level 178. 50 Return to debug level 177. 51 Return to debug level 176. 52 Return to debug level 175. 53 Return to debug level 174. 54 Return to debug level 173. 55 Return to debug level 172. 56 Return to debug level 171. 57 Return to debug level 170. 58 Return to debug level 169. 59 Return to debug level 168. 60 Return to debug level 167. 61 Return to debug level 166. 62 Return to debug level 165. 63 Return to debug level 164. 64 Return to debug level 163. 65 Return to debug level 162. 66 Return to debug level 161. 67 Return to debug level 160. 68 Return to debug level 159. 69 Return to debug level 158. 70 Return to debug level 157. 71 Return to debug level 156. 72 Return to debug level 155. 73 Return to debug level 154. 74 Return to debug level 153. 75 Return to debug level 152. 76 Return to debug level 151. 77 Return to debug level 150. 78 Return to debug level 149. 79 Return to debug level 148. 80 Return to debug level 147. 81 Return to debug level 146. 82 Return to debug level 145. 83 Return to debug level 144. 84 Return to debug level 143. 85 Return to debug level 142. 86 Return to debug level 141. 87 Return to debug level 140. 88 Return to debug level 139. 89 Return to debug level 138. 90 Return to debug level 137. 91 Return to debug level 136. 92 Return to debug level 135. 93 Return to debug level 134. 94 Return to debug level 133. 95 Return to debug level 132. 96 Return to debug level 131. 97 Return to debug level 130. 98 Return to debug level 129. 99 Return to debug level 128. 100 Return to debug level 127. 101 Return to debug level 126. 102 Return to debug level 125. 103 Return to debug level 124. 104 Return to debug level 123. 105 Return to debug level 122. 106 Return to debug level 121. 107 Return to debug level 120. 108 Return to debug level 119. 109 Return to debug level 118. 110 Return to debug level 117. 111 Return to debug level 116. 112 Return to debug level 115. 113 Return to debug level 114. 114 Return to debug level 113. 115 Return to debug level 112. 116 Return to debug level 111. 117 Return to debug level 110. 118 Return to debug level 109. 119 Return to debug level 108. 120 Return to debug level 107. 121 Return to debug level 106. 122 Return to debug level 105. 123 Return to debug level 104. 124 Return to debug level 103. 125 Return to debug level 102. 126 Return to debug level 101. 127 Return to debug level 100. 128 Return to debug level 99. 129 Return to debug level 98. 130 Return to debug level 97. 131 Return to debug level 96. 132 Return to debug level 95. 133 Return to debug level 94. 134 Return to debug level 93. 135 Return to debug level 92. 136 Return to debug level 91. 137 Return to debug level 90. 138 Return to debug level 89. 139 Return to debug level 88. 140 Return to debug level 87. 141 Return to debug level 86. 142 Return to debug level 85. 143 Return to debug level 84. 144 Return to debug level 83. 145 Return to debug level 82. 146 Return to debug level 81. 147 Return to debug level 80. 148 Return to debug level 79. 149 Return to debug level 78. 150 Return to debug level 77. 151 Return to debug level 76. 152 Return to debug level 75. 153 Return to debug level 74. 154 Return to debug level 73. 155 Return to debug level 72. 156 Return to debug level 71. 157 Return to debug level 70. 158 Return to debug level 69. 159 Return to debug level 68. 160 Return to debug level 67. 161 Return to debug level 66. 162 Return to debug level 65. 163 Return to debug level 64. 164 Return to debug level 63. 165 Return to debug level 62. 166 Return to debug level 61. 167 Return to debug level 60. 168 Return to debug level 59. 169 Return to debug level 58. 170 Return to debug level 57. 171 Return to debug level 56. 172 Return to debug level 55. 173 Return to debug level 54. 174 Return to debug level 53. 175 Return to debug level 52. 176 Return to debug level 51. 177 Return to debug level 50. 178 Return to debug level 49. 179 Return to debug level 48. 180 Return to debug level 47. 181 Return to debug level 46. 182 Return to debug level 45. 183 Return to debug level 44. 184 Return to debug level 43. 185 Return to debug level 42. 186 Return to debug level 41. 187 Return to debug level 40. 188 Return to debug level 39. 189 Return to debug level 38. 190 Return to debug level 37. 191 Return to debug level 36. 192 Return to debug level 35. 193 Return to debug level 34. 194 Return to debug level 33. 195 Return to debug level 32. 196 Return to debug level 31. 197 Return to debug level 30. 198 Return to debug level 29. 199 Return to debug level 28. 200 Return to debug level 27. 201 Return to debug level 26. 202 Return to debug level 25. 203 Return to debug level 24. 204 Return to debug level 23. 205 Return to debug level 22. 206 Return to debug level 21. 207 Return to debug level 20. 208 Return to debug level 19. 209 Return to debug level 18. 210 Return to debug level 17. 211 Return to debug level 16. 212 Return to debug level 15. 213 Return to debug level 14. 214 Return to debug level 13. 215 Return to debug level 12. 216 Return to debug level 11. 217 Return to debug level 10. 218 Return to debug level 9. 219 Return to debug level 8. 220 Return to debug level 7. 221 Return to debug level 6. 222 Return to debug level 5. 223 Return to debug level 4. 224 Return to debug level 3. 225 Return to debug level 2. 226 Return to debug level 1. 227 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 227. 2 Return to debug level 226. 3 Return to debug level 225. 4 Return to debug level 224. 5 Return to debug level 223. 6 Return to debug level 222. 7 Return to debug level 221. 8 Return to debug level 220. 9 Return to debug level 219. 10 Return to debug level 218. 11 Return to debug level 217. 12 Return to debug level 216. 13 Return to debug level 215. 14 Return to debug level 214. 15 Return to debug level 213. 16 Return to debug level 212. 17 Return to debug level 211. 18 Return to debug level 210. 19 Return to debug level 209. 20 Return to debug level 208. 21 Return to debug level 207. 22 Return to debug level 206. 23 Return to debug level 205. 24 Return to debug level 204. 25 Return to debug level 203. 26 Return to debug level 202. 27 Return to debug level 201. 28 Return to debug level 200. 29 Return to debug level 199. 30 Return to debug level 198. 31 Return to debug level 197. 32 Return to debug level 196. 33 Return to debug level 195. 34 Return to debug level 194. 35 Return to debug level 193. 36 Return to debug level 192. 37 Return to debug level 191. 38 Return to debug level 190. 39 Return to debug level 189. 40 Return to debug level 188. 41 Return to debug level 187. 42 Return to debug level 186. 43 Return to debug level 185. 44 Return to debug level 184. 45 Return to debug level 183. 46 Return to debug level 182. 47 Return to debug level 181. 48 Return to debug level 180. 49 Return to debug level 179. 50 Return to debug level 178. 51 Return to debug level 177. 52 Return to debug level 176. 53 Return to debug level 175. 54 Return to debug level 174. 55 Return to debug level 173. 56 Return to debug level 172. 57 Return to debug level 171. 58 Return to debug level 170. 59 Return to debug level 169. 60 Return to debug level 168. 61 Return to debug level 167. 62 Return to debug level 166. 63 Return to debug level 165. 64 Return to debug level 164. 65 Return to debug level 163. 66 Return to debug level 162. 67 Return to debug level 161. 68 Return to debug level 160. 69 Return to debug level 159. 70 Return to debug level 158. 71 Return to debug level 157. 72 Return to debug level 156. 73 Return to debug level 155. 74 Return to debug level 154. 75 Return to debug level 153. 76 Return to debug level 152. 77 Return to debug level 151. 78 Return to debug level 150. 79 Return to debug level 149. 80 Return to debug level 148. 81 Return to debug level 147. 82 Return to debug level 146. 83 Return to debug level 145. 84 Return to debug level 144. 85 Return to debug level 143. 86 Return to debug level 142. 87 Return to debug level 141. 88 Return to debug level 140. 89 Return to debug level 139. 90 Return to debug level 138. 91 Return to debug level 137. 92 Return to debug level 136. 93 Return to debug level 135. 94 Return to debug level 134. 95 Return to debug level 133. 96 Return to debug level 132. 97 Return to debug level 131. 98 Return to debug level 130. 99 Return to debug level 129. 100 Return to debug level 128. 101 Return to debug level 127. 102 Return to debug level 126. 103 Return to debug level 125. 104 Return to debug level 124. 105 Return to debug level 123. 106 Return to debug level 122. 107 Return to debug level 121. 108 Return to debug level 120. 109 Return to debug level 119. 110 Return to debug level 118. 111 Return to debug level 117. 112 Return to debug level 116. 113 Return to debug level 115. 114 Return to debug level 114. 115 Return to debug level 113. 116 Return to debug level 112. 117 Return to debug level 111. 118 Return to debug level 110. 119 Return to debug level 109. 120 Return to debug level 108. 121 Return to debug level 107. 122 Return to debug level 106. 123 Return to debug level 105. 124 Return to debug level 104. 125 Return to debug level 103. 126 Return to debug level 102. 127 Return to debug level 101. 128 Return to debug level 100. 129 Return to debug level 99. 130 Return to debug level 98. 131 Return to debug level 97. 132 Return to debug level 96. 133 Return to debug level 95. 134 Return to debug level 94. 135 Return to debug level 93. 136 Return to debug level 92. 137 Return to debug level 91. 138 Return to debug level 90. 139 Return to debug level 89. 140 Return to debug level 88. 141 Return to debug level 87. 142 Return to debug level 86. 143 Return to debug level 85. 144 Return to debug level 84. 145 Return to debug level 83. 146 Return to debug level 82. 147 Return to debug level 81. 148 Return to debug level 80. 149 Return to debug level 79. 150 Return to debug level 78. 151 Return to debug level 77. 152 Return to debug level 76. 153 Return to debug level 75. 154 Return to debug level 74. 155 Return to debug level 73. 156 Return to debug level 72. 157 Return to debug level 71. 158 Return to debug level 70. 159 Return to debug level 69. 160 Return to debug level 68. 161 Return to debug level 67. 162 Return to debug level 66. 163 Return to debug level 65. 164 Return to debug level 64. 165 Return to debug level 63. 166 Return to debug level 62. 167 Return to debug level 61. 168 Return to debug level 60. 169 Return to debug level 59. 170 Return to debug level 58. 171 Return to debug level 57. 172 Return to debug level 56. 173 Return to debug level 55. 174 Return to debug level 54. 175 Return to debug level 53. 176 Return to debug level 52. 177 Return to debug level 51. 178 Return to debug level 50. 179 Return to debug level 49. 180 Return to debug level 48. 181 Return to debug level 47. 182 Return to debug level 46. 183 Return to debug level 45. 184 Return to debug level 44. 185 Return to debug level 43. 186 Return to debug level 42. 187 Return to debug level 41. 188 Return to debug level 40. 189 Return to debug level 39. 190 Return to debug level 38. 191 Return to debug level 37. 192 Return to debug level 36. 193 Return to debug level 35. 194 Return to debug level 34. 195 Return to debug level 33. 196 Return to debug level 32. 197 Return to debug level 31. 198 Return to debug level 30. 199 Return to debug level 29. 200 Return to debug level 28. 201 Return to debug level 27. 202 Return to debug level 26. 203 Return to debug level 25. 204 Return to debug level 24. 205 Return to debug level 23. 206 Return to debug level 22. 207 Return to debug level 21. 208 Return to debug level 20. 209 Return to debug level 19. 210 Return to debug level 18. 211 Return to debug level 17. 212 Return to debug level 16. 213 Return to debug level 15. 214 Return to debug level 14. 215 Return to debug level 13. 216 Return to debug level 12. 217 Return to debug level 11. 218 Return to debug level 10. 219 Return to debug level 9. 220 Return to debug level 8. 221 Return to debug level 7. 222 Return to debug level 6. 223 Return to debug level 5. 224 Return to debug level 4. 225 Return to debug level 3. 226 Return to debug level 2. 227 Return to debug level 1. 228 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 228. 2 Return to debug level 227. 3 Return to debug level 226. 4 Return to debug level 225. 5 Return to debug level 224. 6 Return to debug level 223. 7 Return to debug level 222. 8 Return to debug level 221. 9 Return to debug level 220. 10 Return to debug level 219. 11 Return to debug level 218. 12 Return to debug level 217. 13 Return to debug level 216. 14 Return to debug level 215. 15 Return to debug level 214. 16 Return to debug level 213. 17 Return to debug level 212. 18 Return to debug level 211. 19 Return to debug level 210. 20 Return to debug level 209. 21 Return to debug level 208. 22 Return to debug level 207. 23 Return to debug level 206. 24 Return to debug level 205. 25 Return to debug level 204. 26 Return to debug level 203. 27 Return to debug level 202. 28 Return to debug level 201. 29 Return to debug level 200. 30 Return to debug level 199. 31 Return to debug level 198. 32 Return to debug level 197. 33 Return to debug level 196. 34 Return to debug level 195. 35 Return to debug level 194. 36 Return to debug level 193. 37 Return to debug level 192. 38 Return to debug level 191. 39 Return to debug level 190. 40 Return to debug level 189. 41 Return to debug level 188. 42 Return to debug level 187. 43 Return to debug level 186. 44 Return to debug level 185. 45 Return to debug level 184. 46 Return to debug level 183. 47 Return to debug level 182. 48 Return to debug level 181. 49 Return to debug level 180. 50 Return to debug level 179. 51 Return to debug level 178. 52 Return to debug level 177. 53 Return to debug level 176. 54 Return to debug level 175. 55 Return to debug level 174. 56 Return to debug level 173. 57 Return to debug level 172. 58 Return to debug level 171. 59 Return to debug level 170. 60 Return to debug level 169. 61 Return to debug level 168. 62 Return to debug level 167. 63 Return to debug level 166. 64 Return to debug level 165. 65 Return to debug level 164. 66 Return to debug level 163. 67 Return to debug level 162. 68 Return to debug level 161. 69 Return to debug level 160. 70 Return to debug level 159. 71 Return to debug level 158. 72 Return to debug level 157. 73 Return to debug level 156. 74 Return to debug level 155. 75 Return to debug level 154. 76 Return to debug level 153. 77 Return to debug level 152. 78 Return to debug level 151. 79 Return to debug level 150. 80 Return to debug level 149. 81 Return to debug level 148. 82 Return to debug level 147. 83 Return to debug level 146. 84 Return to debug level 145. 85 Return to debug level 144. 86 Return to debug level 143. 87 Return to debug level 142. 88 Return to debug level 141. 89 Return to debug level 140. 90 Return to debug level 139. 91 Return to debug level 138. 92 Return to debug level 137. 93 Return to debug level 136. 94 Return to debug level 135. 95 Return to debug level 134. 96 Return to debug level 133. 97 Return to debug level 132. 98 Return to debug level 131. 99 Return to debug level 130. 100 Return to debug level 129. 101 Return to debug level 128. 102 Return to debug level 127. 103 Return to debug level 126. 104 Return to debug level 125. 105 Return to debug level 124. 106 Return to debug level 123. 107 Return to debug level 122. 108 Return to debug level 121. 109 Return to debug level 120. 110 Return to debug level 119. 111 Return to debug level 118. 112 Return to debug level 117. 113 Return to debug level 116. 114 Return to debug level 115. 115 Return to debug level 114. 116 Return to debug level 113. 117 Return to debug level 112. 118 Return to debug level 111. 119 Return to debug level 110. 120 Return to debug level 109. 121 Return to debug level 108. 122 Return to debug level 107. 123 Return to debug level 106. 124 Return to debug level 105. 125 Return to debug level 104. 126 Return to debug level 103. 127 Return to debug level 102. 128 Return to debug level 101. 129 Return to debug level 100. 130 Return to debug level 99. 131 Return to debug level 98. 132 Return to debug level 97. 133 Return to debug level 96. 134 Return to debug level 95. 135 Return to debug level 94. 136 Return to debug level 93. 137 Return to debug level 92. 138 Return to debug level 91. 139 Return to debug level 90. 140 Return to debug level 89. 141 Return to debug level 88. 142 Return to debug level 87. 143 Return to debug level 86. 144 Return to debug level 85. 145 Return to debug level 84. 146 Return to debug level 83. 147 Return to debug level 82. 148 Return to debug level 81. 149 Return to debug level 80. 150 Return to debug level 79. 151 Return to debug level 78. 152 Return to debug level 77. 153 Return to debug level 76. 154 Return to debug level 75. 155 Return to debug level 74. 156 Return to debug level 73. 157 Return to debug level 72. 158 Return to debug level 71. 159 Return to debug level 70. 160 Return to debug level 69. 161 Return to debug level 68. 162 Return to debug level 67. 163 Return to debug level 66. 164 Return to debug level 65. 165 Return to debug level 64. 166 Return to debug level 63. 167 Return to debug level 62. 168 Return to debug level 61. 169 Return to debug level 60. 170 Return to debug level 59. 171 Return to debug level 58. 172 Return to debug level 57. 173 Return to debug level 56. 174 Return to debug level 55. 175 Return to debug level 54. 176 Return to debug level 53. 177 Return to debug level 52. 178 Return to debug level 51. 179 Return to debug level 50. 180 Return to debug level 49. 181 Return to debug level 48. 182 Return to debug level 47. 183 Return to debug level 46. 184 Return to debug level 45. 185 Return to debug level 44. 186 Return to debug level 43. 187 Return to debug level 42. 188 Return to debug level 41. 189 Return to debug level 40. 190 Return to debug level 39. 191 Return to debug level 38. 192 Return to debug level 37. 193 Return to debug level 36. 194 Return to debug level 35. 195 Return to debug level 34. 196 Return to debug level 33. 197 Return to debug level 32. 198 Return to debug level 31. 199 Return to debug level 30. 200 Return to debug level 29. 201 Return to debug level 28. 202 Return to debug level 27. 203 Return to debug level 26. 204 Return to debug level 25. 205 Return to debug level 24. 206 Return to debug level 23. 207 Return to debug level 22. 208 Return to debug level 21. 209 Return to debug level 20. 210 Return to debug level 19. 211 Return to debug level 18. 212 Return to debug level 17. 213 Return to debug level 16. 214 Return to debug level 15. 215 Return to debug level 14. 216 Return to debug level 13. 217 Return to debug level 12. 218 Return to debug level 11. 219 Return to debug level 10. 220 Return to debug level 9. 221 Return to debug level 8. 222 Return to debug level 7. 223 Return to debug level 6. 224 Return to debug level 5. 225 Return to debug level 4. 226 Return to debug level 3. 227 Return to debug level 2. 228 Return to debug level 1. 229 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 229. 2 Return to debug level 228. 3 Return to debug level 227. 4 Return to debug level 226. 5 Return to debug level 225. 6 Return to debug level 224. 7 Return to debug level 223. 8 Return to debug level 222. 9 Return to debug level 221. 10 Return to debug level 220. 11 Return to debug level 219. 12 Return to debug level 218. 13 Return to debug level 217. 14 Return to debug level 216. 15 Return to debug level 215. 16 Return to debug level 214. 17 Return to debug level 213. 18 Return to debug level 212. 19 Return to debug level 211. 20 Return to debug level 210. 21 Return to debug level 209. 22 Return to debug level 208. 23 Return to debug level 207. 24 Return to debug level 206. 25 Return to debug level 205. 26 Return to debug level 204. 27 Return to debug level 203. 28 Return to debug level 202. 29 Return to debug level 201. 30 Return to debug level 200. 31 Return to debug level 199. 32 Return to debug level 198. 33 Return to debug level 197. 34 Return to debug level 196. 35 Return to debug level 195. 36 Return to debug level 194. 37 Return to debug level 193. 38 Return to debug level 192. 39 Return to debug level 191. 40 Return to debug level 190. 41 Return to debug level 189. 42 Return to debug level 188. 43 Return to debug level 187. 44 Return to debug level 186. 45 Return to debug level 185. 46 Return to debug level 184. 47 Return to debug level 183. 48 Return to debug level 182. 49 Return to debug level 181. 50 Return to debug level 180. 51 Return to debug level 179. 52 Return to debug level 178. 53 Return to debug level 177. 54 Return to debug level 176. 55 Return to debug level 175. 56 Return to debug level 174. 57 Return to debug level 173. 58 Return to debug level 172. 59 Return to debug level 171. 60 Return to debug level 170. 61 Return to debug level 169. 62 Return to debug level 168. 63 Return to debug level 167. 64 Return to debug level 166. 65 Return to debug level 165. 66 Return to debug level 164. 67 Return to debug level 163. 68 Return to debug level 162. 69 Return to debug level 161. 70 Return to debug level 160. 71 Return to debug level 159. 72 Return to debug level 158. 73 Return to debug level 157. 74 Return to debug level 156. 75 Return to debug level 155. 76 Return to debug level 154. 77 Return to debug level 153. 78 Return to debug level 152. 79 Return to debug level 151. 80 Return to debug level 150. 81 Return to debug level 149. 82 Return to debug level 148. 83 Return to debug level 147. 84 Return to debug level 146. 85 Return to debug level 145. 86 Return to debug level 144. 87 Return to debug level 143. 88 Return to debug level 142. 89 Return to debug level 141. 90 Return to debug level 140. 91 Return to debug level 139. 92 Return to debug level 138. 93 Return to debug level 137. 94 Return to debug level 136. 95 Return to debug level 135. 96 Return to debug level 134. 97 Return to debug level 133. 98 Return to debug level 132. 99 Return to debug level 131. 100 Return to debug level 130. 101 Return to debug level 129. 102 Return to debug level 128. 103 Return to debug level 127. 104 Return to debug level 126. 105 Return to debug level 125. 106 Return to debug level 124. 107 Return to debug level 123. 108 Return to debug level 122. 109 Return to debug level 121. 110 Return to debug level 120. 111 Return to debug level 119. 112 Return to debug level 118. 113 Return to debug level 117. 114 Return to debug level 116. 115 Return to debug level 115. 116 Return to debug level 114. 117 Return to debug level 113. 118 Return to debug level 112. 119 Return to debug level 111. 120 Return to debug level 110. 121 Return to debug level 109. 122 Return to debug level 108. 123 Return to debug level 107. 124 Return to debug level 106. 125 Return to debug level 105. 126 Return to debug level 104. 127 Return to debug level 103. 128 Return to debug level 102. 129 Return to debug level 101. 130 Return to debug level 100. 131 Return to debug level 99. 132 Return to debug level 98. 133 Return to debug level 97. 134 Return to debug level 96. 135 Return to debug level 95. 136 Return to debug level 94. 137 Return to debug level 93. 138 Return to debug level 92. 139 Return to debug level 91. 140 Return to debug level 90. 141 Return to debug level 89. 142 Return to debug level 88. 143 Return to debug level 87. 144 Return to debug level 86. 145 Return to debug level 85. 146 Return to debug level 84. 147 Return to debug level 83. 148 Return to debug level 82. 149 Return to debug level 81. 150 Return to debug level 80. 151 Return to debug level 79. 152 Return to debug level 78. 153 Return to debug level 77. 154 Return to debug level 76. 155 Return to debug level 75. 156 Return to debug level 74. 157 Return to debug level 73. 158 Return to debug level 72. 159 Return to debug level 71. 160 Return to debug level 70. 161 Return to debug level 69. 162 Return to debug level 68. 163 Return to debug level 67. 164 Return to debug level 66. 165 Return to debug level 65. 166 Return to debug level 64. 167 Return to debug level 63. 168 Return to debug level 62. 169 Return to debug level 61. 170 Return to debug level 60. 171 Return to debug level 59. 172 Return to debug level 58. 173 Return to debug level 57. 174 Return to debug level 56. 175 Return to debug level 55. 176 Return to debug level 54. 177 Return to debug level 53. 178 Return to debug level 52. 179 Return to debug level 51. 180 Return to debug level 50. 181 Return to debug level 49. 182 Return to debug level 48. 183 Return to debug level 47. 184 Return to debug level 46. 185 Return to debug level 45. 186 Return to debug level 44. 187 Return to debug level 43. 188 Return to debug level 42. 189 Return to debug level 41. 190 Return to debug level 40. 191 Return to debug level 39. 192 Return to debug level 38. 193 Return to debug level 37. 194 Return to debug level 36. 195 Return to debug level 35. 196 Return to debug level 34. 197 Return to debug level 33. 198 Return to debug level 32. 199 Return to debug level 31. 200 Return to debug level 30. 201 Return to debug level 29. 202 Return to debug level 28. 203 Return to debug level 27. 204 Return to debug level 26. 205 Return to debug level 25. 206 Return to debug level 24. 207 Return to debug level 23. 208 Return to debug level 22. 209 Return to debug level 21. 210 Return to debug level 20. 211 Return to debug level 19. 212 Return to debug level 18. 213 Return to debug level 17. 214 Return to debug level 16. 215 Return to debug level 15. 216 Return to debug level 14. 217 Return to debug level 13. 218 Return to debug level 12. 219 Return to debug level 11. 220 Return to debug level 10. 221 Return to debug level 9. 222 Return to debug level 8. 223 Return to debug level 7. 224 Return to debug level 6. 225 Return to debug level 5. 226 Return to debug level 4. 227 Return to debug level 3. 228 Return to debug level 2. 229 Return to debug level 1. 230 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 230. 2 Return to debug level 229. 3 Return to debug level 228. 4 Return to debug level 227. 5 Return to debug level 226. 6 Return to debug level 225. 7 Return to debug level 224. 8 Return to debug level 223. 9 Return to debug level 222. 10 Return to debug level 221. 11 Return to debug level 220. 12 Return to debug level 219. 13 Return to debug level 218. 14 Return to debug level 217. 15 Return to debug level 216. 16 Return to debug level 215. 17 Return to debug level 214. 18 Return to debug level 213. 19 Return to debug level 212. 20 Return to debug level 211. 21 Return to debug level 210. 22 Return to debug level 209. 23 Return to debug level 208. 24 Return to debug level 207. 25 Return to debug level 206. 26 Return to debug level 205. 27 Return to debug level 204. 28 Return to debug level 203. 29 Return to debug level 202. 30 Return to debug level 201. 31 Return to debug level 200. 32 Return to debug level 199. 33 Return to debug level 198. 34 Return to debug level 197. 35 Return to debug level 196. 36 Return to debug level 195. 37 Return to debug level 194. 38 Return to debug level 193. 39 Return to debug level 192. 40 Return to debug level 191. 41 Return to debug level 190. 42 Return to debug level 189. 43 Return to debug level 188. 44 Return to debug level 187. 45 Return to debug level 186. 46 Return to debug level 185. 47 Return to debug level 184. 48 Return to debug level 183. 49 Return to debug level 182. 50 Return to debug level 181. 51 Return to debug level 180. 52 Return to debug level 179. 53 Return to debug level 178. 54 Return to debug level 177. 55 Return to debug level 176. 56 Return to debug level 175. 57 Return to debug level 174. 58 Return to debug level 173. 59 Return to debug level 172. 60 Return to debug level 171. 61 Return to debug level 170. 62 Return to debug level 169. 63 Return to debug level 168. 64 Return to debug level 167. 65 Return to debug level 166. 66 Return to debug level 165. 67 Return to debug level 164. 68 Return to debug level 163. 69 Return to debug level 162. 70 Return to debug level 161. 71 Return to debug level 160. 72 Return to debug level 159. 73 Return to debug level 158. 74 Return to debug level 157. 75 Return to debug level 156. 76 Return to debug level 155. 77 Return to debug level 154. 78 Return to debug level 153. 79 Return to debug level 152. 80 Return to debug level 151. 81 Return to debug level 150. 82 Return to debug level 149. 83 Return to debug level 148. 84 Return to debug level 147. 85 Return to debug level 146. 86 Return to debug level 145. 87 Return to debug level 144. 88 Return to debug level 143. 89 Return to debug level 142. 90 Return to debug level 141. 91 Return to debug level 140. 92 Return to debug level 139. 93 Return to debug level 138. 94 Return to debug level 137. 95 Return to debug level 136. 96 Return to debug level 135. 97 Return to debug level 134. 98 Return to debug level 133. 99 Return to debug level 132. 100 Return to debug level 131. 101 Return to debug level 130. 102 Return to debug level 129. 103 Return to debug level 128. 104 Return to debug level 127. 105 Return to debug level 126. 106 Return to debug level 125. 107 Return to debug level 124. 108 Return to debug level 123. 109 Return to debug level 122. 110 Return to debug level 121. 111 Return to debug level 120. 112 Return to debug level 119. 113 Return to debug level 118. 114 Return to debug level 117. 115 Return to debug level 116. 116 Return to debug level 115. 117 Return to debug level 114. 118 Return to debug level 113. 119 Return to debug level 112. 120 Return to debug level 111. 121 Return to debug level 110. 122 Return to debug level 109. 123 Return to debug level 108. 124 Return to debug level 107. 125 Return to debug level 106. 126 Return to debug level 105. 127 Return to debug level 104. 128 Return to debug level 103. 129 Return to debug level 102. 130 Return to debug level 101. 131 Return to debug level 100. 132 Return to debug level 99. 133 Return to debug level 98. 134 Return to debug level 97. 135 Return to debug level 96. 136 Return to debug level 95. 137 Return to debug level 94. 138 Return to debug level 93. 139 Return to debug level 92. 140 Return to debug level 91. 141 Return to debug level 90. 142 Return to debug level 89. 143 Return to debug level 88. 144 Return to debug level 87. 145 Return to debug level 86. 146 Return to debug level 85. 147 Return to debug level 84. 148 Return to debug level 83. 149 Return to debug level 82. 150 Return to debug level 81. 151 Return to debug level 80. 152 Return to debug level 79. 153 Return to debug level 78. 154 Return to debug level 77. 155 Return to debug level 76. 156 Return to debug level 75. 157 Return to debug level 74. 158 Return to debug level 73. 159 Return to debug level 72. 160 Return to debug level 71. 161 Return to debug level 70. 162 Return to debug level 69. 163 Return to debug level 68. 164 Return to debug level 67. 165 Return to debug level 66. 166 Return to debug level 65. 167 Return to debug level 64. 168 Return to debug level 63. 169 Return to debug level 62. 170 Return to debug level 61. 171 Return to debug level 60. 172 Return to debug level 59. 173 Return to debug level 58. 174 Return to debug level 57. 175 Return to debug level 56. 176 Return to debug level 55. 177 Return to debug level 54. 178 Return to debug level 53. 179 Return to debug level 52. 180 Return to debug level 51. 181 Return to debug level 50. 182 Return to debug level 49. 183 Return to debug level 48. 184 Return to debug level 47. 185 Return to debug level 46. 186 Return to debug level 45. 187 Return to debug level 44. 188 Return to debug level 43. 189 Return to debug level 42. 190 Return to debug level 41. 191 Return to debug level 40. 192 Return to debug level 39. 193 Return to debug level 38. 194 Return to debug level 37. 195 Return to debug level 36. 196 Return to debug level 35. 197 Return to debug level 34. 198 Return to debug level 33. 199 Return to debug level 32. 200 Return to debug level 31. 201 Return to debug level 30. 202 Return to debug level 29. 203 Return to debug level 28. 204 Return to debug level 27. 205 Return to debug level 26. 206 Return to debug level 25. 207 Return to debug level 24. 208 Return to debug level 23. 209 Return to debug level 22. 210 Return to debug level 21. 211 Return to debug level 20. 212 Return to debug level 19. 213 Return to debug level 18. 214 Return to debug level 17. 215 Return to debug level 16. 216 Return to debug level 15. 217 Return to debug level 14. 218 Return to debug level 13. 219 Return to debug level 12. 220 Return to debug level 11. 221 Return to debug level 10. 222 Return to debug level 9. 223 Return to debug level 8. 224 Return to debug level 7. 225 Return to debug level 6. 226 Return to debug level 5. 227 Return to debug level 4. 228 Return to debug level 3. 229 Return to debug level 2. 230 Return to debug level 1. 231 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 231. 2 Return to debug level 230. 3 Return to debug level 229. 4 Return to debug level 228. 5 Return to debug level 227. 6 Return to debug level 226. 7 Return to debug level 225. 8 Return to debug level 224. 9 Return to debug level 223. 10 Return to debug level 222. 11 Return to debug level 221. 12 Return to debug level 220. 13 Return to debug level 219. 14 Return to debug level 218. 15 Return to debug level 217. 16 Return to debug level 216. 17 Return to debug level 215. 18 Return to debug level 214. 19 Return to debug level 213. 20 Return to debug level 212. 21 Return to debug level 211. 22 Return to debug level 210. 23 Return to debug level 209. 24 Return to debug level 208. 25 Return to debug level 207. 26 Return to debug level 206. 27 Return to debug level 205. 28 Return to debug level 204. 29 Return to debug level 203. 30 Return to debug level 202. 31 Return to debug level 201. 32 Return to debug level 200. 33 Return to debug level 199. 34 Return to debug level 198. 35 Return to debug level 197. 36 Return to debug level 196. 37 Return to debug level 195. 38 Return to debug level 194. 39 Return to debug level 193. 40 Return to debug level 192. 41 Return to debug level 191. 42 Return to debug level 190. 43 Return to debug level 189. 44 Return to debug level 188. 45 Return to debug level 187. 46 Return to debug level 186. 47 Return to debug level 185. 48 Return to debug level 184. 49 Return to debug level 183. 50 Return to debug level 182. 51 Return to debug level 181. 52 Return to debug level 180. 53 Return to debug level 179. 54 Return to debug level 178. 55 Return to debug level 177. 56 Return to debug level 176. 57 Return to debug level 175. 58 Return to debug level 174. 59 Return to debug level 173. 60 Return to debug level 172. 61 Return to debug level 171. 62 Return to debug level 170. 63 Return to debug level 169. 64 Return to debug level 168. 65 Return to debug level 167. 66 Return to debug level 166. 67 Return to debug level 165. 68 Return to debug level 164. 69 Return to debug level 163. 70 Return to debug level 162. 71 Return to debug level 161. 72 Return to debug level 160. 73 Return to debug level 159. 74 Return to debug level 158. 75 Return to debug level 157. 76 Return to debug level 156. 77 Return to debug level 155. 78 Return to debug level 154. 79 Return to debug level 153. 80 Return to debug level 152. 81 Return to debug level 151. 82 Return to debug level 150. 83 Return to debug level 149. 84 Return to debug level 148. 85 Return to debug level 147. 86 Return to debug level 146. 87 Return to debug level 145. 88 Return to debug level 144. 89 Return to debug level 143. 90 Return to debug level 142. 91 Return to debug level 141. 92 Return to debug level 140. 93 Return to debug level 139. 94 Return to debug level 138. 95 Return to debug level 137. 96 Return to debug level 136. 97 Return to debug level 135. 98 Return to debug level 134. 99 Return to debug level 133. 100 Return to debug level 132. 101 Return to debug level 131. 102 Return to debug level 130. 103 Return to debug level 129. 104 Return to debug level 128. 105 Return to debug level 127. 106 Return to debug level 126. 107 Return to debug level 125. 108 Return to debug level 124. 109 Return to debug level 123. 110 Return to debug level 122. 111 Return to debug level 121. 112 Return to debug level 120. 113 Return to debug level 119. 114 Return to debug level 118. 115 Return to debug level 117. 116 Return to debug level 116. 117 Return to debug level 115. 118 Return to debug level 114. 119 Return to debug level 113. 120 Return to debug level 112. 121 Return to debug level 111. 122 Return to debug level 110. 123 Return to debug level 109. 124 Return to debug level 108. 125 Return to debug level 107. 126 Return to debug level 106. 127 Return to debug level 105. 128 Return to debug level 104. 129 Return to debug level 103. 130 Return to debug level 102. 131 Return to debug level 101. 132 Return to debug level 100. 133 Return to debug level 99. 134 Return to debug level 98. 135 Return to debug level 97. 136 Return to debug level 96. 137 Return to debug level 95. 138 Return to debug level 94. 139 Return to debug level 93. 140 Return to debug level 92. 141 Return to debug level 91. 142 Return to debug level 90. 143 Return to debug level 89. 144 Return to debug level 88. 145 Return to debug level 87. 146 Return to debug level 86. 147 Return to debug level 85. 148 Return to debug level 84. 149 Return to debug level 83. 150 Return to debug level 82. 151 Return to debug level 81. 152 Return to debug level 80. 153 Return to debug level 79. 154 Return to debug level 78. 155 Return to debug level 77. 156 Return to debug level 76. 157 Return to debug level 75. 158 Return to debug level 74. 159 Return to debug level 73. 160 Return to debug level 72. 161 Return to debug level 71. 162 Return to debug level 70. 163 Return to debug level 69. 164 Return to debug level 68. 165 Return to debug level 67. 166 Return to debug level 66. 167 Return to debug level 65. 168 Return to debug level 64. 169 Return to debug level 63. 170 Return to debug level 62. 171 Return to debug level 61. 172 Return to debug level 60. 173 Return to debug level 59. 174 Return to debug level 58. 175 Return to debug level 57. 176 Return to debug level 56. 177 Return to debug level 55. 178 Return to debug level 54. 179 Return to debug level 53. 180 Return to debug level 52. 181 Return to debug level 51. 182 Return to debug level 50. 183 Return to debug level 49. 184 Return to debug level 48. 185 Return to debug level 47. 186 Return to debug level 46. 187 Return to debug level 45. 188 Return to debug level 44. 189 Return to debug level 43. 190 Return to debug level 42. 191 Return to debug level 41. 192 Return to debug level 40. 193 Return to debug level 39. 194 Return to debug level 38. 195 Return to debug level 37. 196 Return to debug level 36. 197 Return to debug level 35. 198 Return to debug level 34. 199 Return to debug level 33. 200 Return to debug level 32. 201 Return to debug level 31. 202 Return to debug level 30. 203 Return to debug level 29. 204 Return to debug level 28. 205 Return to debug level 27. 206 Return to debug level 26. 207 Return to debug level 25. 208 Return to debug level 24. 209 Return to debug level 23. 210 Return to debug level 22. 211 Return to debug level 21. 212 Return to debug level 20. 213 Return to debug level 19. 214 Return to debug level 18. 215 Return to debug level 17. 216 Return to debug level 16. 217 Return to debug level 15. 218 Return to debug level 14. 219 Return to debug level 13. 220 Return to debug level 12. 221 Return to debug level 11. 222 Return to debug level 10. 223 Return to debug level 9. 224 Return to debug level 8. 225 Return to debug level 7. 226 Return to debug level 6. 227 Return to debug level 5. 228 Return to debug level 4. 229 Return to debug level 3. 230 Return to debug level 2. 231 Return to debug level 1. 232 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 232. 2 Return to debug level 231. 3 Return to debug level 230. 4 Return to debug level 229. 5 Return to debug level 228. 6 Return to debug level 227. 7 Return to debug level 226. 8 Return to debug level 225. 9 Return to debug level 224. 10 Return to debug level 223. 11 Return to debug level 222. 12 Return to debug level 221. 13 Return to debug level 220. 14 Return to debug level 219. 15 Return to debug level 218. 16 Return to debug level 217. 17 Return to debug level 216. 18 Return to debug level 215. 19 Return to debug level 214. 20 Return to debug level 213. 21 Return to debug level 212. 22 Return to debug level 211. 23 Return to debug level 210. 24 Return to debug level 209. 25 Return to debug level 208. 26 Return to debug level 207. 27 Return to debug level 206. 28 Return to debug level 205. 29 Return to debug level 204. 30 Return to debug level 203. 31 Return to debug level 202. 32 Return to debug level 201. 33 Return to debug level 200. 34 Return to debug level 199. 35 Return to debug level 198. 36 Return to debug level 197. 37 Return to debug level 196. 38 Return to debug level 195. 39 Return to debug level 194. 40 Return to debug level 193. 41 Return to debug level 192. 42 Return to debug level 191. 43 Return to debug level 190. 44 Return to debug level 189. 45 Return to debug level 188. 46 Return to debug level 187. 47 Return to debug level 186. 48 Return to debug level 185. 49 Return to debug level 184. 50 Return to debug level 183. 51 Return to debug level 182. 52 Return to debug level 181. 53 Return to debug level 180. 54 Return to debug level 179. 55 Return to debug level 178. 56 Return to debug level 177. 57 Return to debug level 176. 58 Return to debug level 175. 59 Return to debug level 174. 60 Return to debug level 173. 61 Return to debug level 172. 62 Return to debug level 171. 63 Return to debug level 170. 64 Return to debug level 169. 65 Return to debug level 168. 66 Return to debug level 167. 67 Return to debug level 166. 68 Return to debug level 165. 69 Return to debug level 164. 70 Return to debug level 163. 71 Return to debug level 162. 72 Return to debug level 161. 73 Return to debug level 160. 74 Return to debug level 159. 75 Return to debug level 158. 76 Return to debug level 157. 77 Return to debug level 156. 78 Return to debug level 155. 79 Return to debug level 154. 80 Return to debug level 153. 81 Return to debug level 152. 82 Return to debug level 151. 83 Return to debug level 150. 84 Return to debug level 149. 85 Return to debug level 148. 86 Return to debug level 147. 87 Return to debug level 146. 88 Return to debug level 145. 89 Return to debug level 144. 90 Return to debug level 143. 91 Return to debug level 142. 92 Return to debug level 141. 93 Return to debug level 140. 94 Return to debug level 139. 95 Return to debug level 138. 96 Return to debug level 137. 97 Return to debug level 136. 98 Return to debug level 135. 99 Return to debug level 134. 100 Return to debug level 133. 101 Return to debug level 132. 102 Return to debug level 131. 103 Return to debug level 130. 104 Return to debug level 129. 105 Return to debug level 128. 106 Return to debug level 127. 107 Return to debug level 126. 108 Return to debug level 125. 109 Return to debug level 124. 110 Return to debug level 123. 111 Return to debug level 122. 112 Return to debug level 121. 113 Return to debug level 120. 114 Return to debug level 119. 115 Return to debug level 118. 116 Return to debug level 117. 117 Return to debug level 116. 118 Return to debug level 115. 119 Return to debug level 114. 120 Return to debug level 113. 121 Return to debug level 112. 122 Return to debug level 111. 123 Return to debug level 110. 124 Return to debug level 109. 125 Return to debug level 108. 126 Return to debug level 107. 127 Return to debug level 106. 128 Return to debug level 105. 129 Return to debug level 104. 130 Return to debug level 103. 131 Return to debug level 102. 132 Return to debug level 101. 133 Return to debug level 100. 134 Return to debug level 99. 135 Return to debug level 98. 136 Return to debug level 97. 137 Return to debug level 96. 138 Return to debug level 95. 139 Return to debug level 94. 140 Return to debug level 93. 141 Return to debug level 92. 142 Return to debug level 91. 143 Return to debug level 90. 144 Return to debug level 89. 145 Return to debug level 88. 146 Return to debug level 87. 147 Return to debug level 86. 148 Return to debug level 85. 149 Return to debug level 84. 150 Return to debug level 83. 151 Return to debug level 82. 152 Return to debug level 81. 153 Return to debug level 80. 154 Return to debug level 79. 155 Return to debug level 78. 156 Return to debug level 77. 157 Return to debug level 76. 158 Return to debug level 75. 159 Return to debug level 74. 160 Return to debug level 73. 161 Return to debug level 72. 162 Return to debug level 71. 163 Return to debug level 70. 164 Return to debug level 69. 165 Return to debug level 68. 166 Return to debug level 67. 167 Return to debug level 66. 168 Return to debug level 65. 169 Return to debug level 64. 170 Return to debug level 63. 171 Return to debug level 62. 172 Return to debug level 61. 173 Return to debug level 60. 174 Return to debug level 59. 175 Return to debug level 58. 176 Return to debug level 57. 177 Return to debug level 56. 178 Return to debug level 55. 179 Return to debug level 54. 180 Return to debug level 53. 181 Return to debug level 52. 182 Return to debug level 51. 183 Return to debug level 50. 184 Return to debug level 49. 185 Return to debug level 48. 186 Return to debug level 47. 187 Return to debug level 46. 188 Return to debug level 45. 189 Return to debug level 44. 190 Return to debug level 43. 191 Return to debug level 42. 192 Return to debug level 41. 193 Return to debug level 40. 194 Return to debug level 39. 195 Return to debug level 38. 196 Return to debug level 37. 197 Return to debug level 36. 198 Return to debug level 35. 199 Return to debug level 34. 200 Return to debug level 33. 201 Return to debug level 32. 202 Return to debug level 31. 203 Return to debug level 30. 204 Return to debug level 29. 205 Return to debug level 28. 206 Return to debug level 27. 207 Return to debug level 26. 208 Return to debug level 25. 209 Return to debug level 24. 210 Return to debug level 23. 211 Return to debug level 22. 212 Return to debug level 21. 213 Return to debug level 20. 214 Return to debug level 19. 215 Return to debug level 18. 216 Return to debug level 17. 217 Return to debug level 16. 218 Return to debug level 15. 219 Return to debug level 14. 220 Return to debug level 13. 221 Return to debug level 12. 222 Return to debug level 11. 223 Return to debug level 10. 224 Return to debug level 9. 225 Return to debug level 8. 226 Return to debug level 7. 227 Return to debug level 6. 228 Return to debug level 5. 229 Return to debug level 4. 230 Return to debug level 3. 231 Return to debug level 2. 232 Return to debug level 1. 233 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 233. 2 Return to debug level 232. 3 Return to debug level 231. 4 Return to debug level 230. 5 Return to debug level 229. 6 Return to debug level 228. 7 Return to debug level 227. 8 Return to debug level 226. 9 Return to debug level 225. 10 Return to debug level 224. 11 Return to debug level 223. 12 Return to debug level 222. 13 Return to debug level 221. 14 Return to debug level 220. 15 Return to debug level 219. 16 Return to debug level 218. 17 Return to debug level 217. 18 Return to debug level 216. 19 Return to debug level 215. 20 Return to debug level 214. 21 Return to debug level 213. 22 Return to debug level 212. 23 Return to debug level 211. 24 Return to debug level 210. 25 Return to debug level 209. 26 Return to debug level 208. 27 Return to debug level 207. 28 Return to debug level 206. 29 Return to debug level 205. 30 Return to debug level 204. 31 Return to debug level 203. 32 Return to debug level 202. 33 Return to debug level 201. 34 Return to debug level 200. 35 Return to debug level 199. 36 Return to debug level 198. 37 Return to debug level 197. 38 Return to debug level 196. 39 Return to debug level 195. 40 Return to debug level 194. 41 Return to debug level 193. 42 Return to debug level 192. 43 Return to debug level 191. 44 Return to debug level 190. 45 Return to debug level 189. 46 Return to debug level 188. 47 Return to debug level 187. 48 Return to debug level 186. 49 Return to debug level 185. 50 Return to debug level 184. 51 Return to debug level 183. 52 Return to debug level 182. 53 Return to debug level 181. 54 Return to debug level 180. 55 Return to debug level 179. 56 Return to debug level 178. 57 Return to debug level 177. 58 Return to debug level 176. 59 Return to debug level 175. 60 Return to debug level 174. 61 Return to debug level 173. 62 Return to debug level 172. 63 Return to debug level 171. 64 Return to debug level 170. 65 Return to debug level 169. 66 Return to debug level 168. 67 Return to debug level 167. 68 Return to debug level 166. 69 Return to debug level 165. 70 Return to debug level 164. 71 Return to debug level 163. 72 Return to debug level 162. 73 Return to debug level 161. 74 Return to debug level 160. 75 Return to debug level 159. 76 Return to debug level 158. 77 Return to debug level 157. 78 Return to debug level 156. 79 Return to debug level 155. 80 Return to debug level 154. 81 Return to debug level 153. 82 Return to debug level 152. 83 Return to debug level 151. 84 Return to debug level 150. 85 Return to debug level 149. 86 Return to debug level 148. 87 Return to debug level 147. 88 Return to debug level 146. 89 Return to debug level 145. 90 Return to debug level 144. 91 Return to debug level 143. 92 Return to debug level 142. 93 Return to debug level 141. 94 Return to debug level 140. 95 Return to debug level 139. 96 Return to debug level 138. 97 Return to debug level 137. 98 Return to debug level 136. 99 Return to debug level 135. 100 Return to debug level 134. 101 Return to debug level 133. 102 Return to debug level 132. 103 Return to debug level 131. 104 Return to debug level 130. 105 Return to debug level 129. 106 Return to debug level 128. 107 Return to debug level 127. 108 Return to debug level 126. 109 Return to debug level 125. 110 Return to debug level 124. 111 Return to debug level 123. 112 Return to debug level 122. 113 Return to debug level 121. 114 Return to debug level 120. 115 Return to debug level 119. 116 Return to debug level 118. 117 Return to debug level 117. 118 Return to debug level 116. 119 Return to debug level 115. 120 Return to debug level 114. 121 Return to debug level 113. 122 Return to debug level 112. 123 Return to debug level 111. 124 Return to debug level 110. 125 Return to debug level 109. 126 Return to debug level 108. 127 Return to debug level 107. 128 Return to debug level 106. 129 Return to debug level 105. 130 Return to debug level 104. 131 Return to debug level 103. 132 Return to debug level 102. 133 Return to debug level 101. 134 Return to debug level 100. 135 Return to debug level 99. 136 Return to debug level 98. 137 Return to debug level 97. 138 Return to debug level 96. 139 Return to debug level 95. 140 Return to debug level 94. 141 Return to debug level 93. 142 Return to debug level 92. 143 Return to debug level 91. 144 Return to debug level 90. 145 Return to debug level 89. 146 Return to debug level 88. 147 Return to debug level 87. 148 Return to debug level 86. 149 Return to debug level 85. 150 Return to debug level 84. 151 Return to debug level 83. 152 Return to debug level 82. 153 Return to debug level 81. 154 Return to debug level 80. 155 Return to debug level 79. 156 Return to debug level 78. 157 Return to debug level 77. 158 Return to debug level 76. 159 Return to debug level 75. 160 Return to debug level 74. 161 Return to debug level 73. 162 Return to debug level 72. 163 Return to debug level 71. 164 Return to debug level 70. 165 Return to debug level 69. 166 Return to debug level 68. 167 Return to debug level 67. 168 Return to debug level 66. 169 Return to debug level 65. 170 Return to debug level 64. 171 Return to debug level 63. 172 Return to debug level 62. 173 Return to debug level 61. 174 Return to debug level 60. 175 Return to debug level 59. 176 Return to debug level 58. 177 Return to debug level 57. 178 Return to debug level 56. 179 Return to debug level 55. 180 Return to debug level 54. 181 Return to debug level 53. 182 Return to debug level 52. 183 Return to debug level 51. 184 Return to debug level 50. 185 Return to debug level 49. 186 Return to debug level 48. 187 Return to debug level 47. 188 Return to debug level 46. 189 Return to debug level 45. 190 Return to debug level 44. 191 Return to debug level 43. 192 Return to debug level 42. 193 Return to debug level 41. 194 Return to debug level 40. 195 Return to debug level 39. 196 Return to debug level 38. 197 Return to debug level 37. 198 Return to debug level 36. 199 Return to debug level 35. 200 Return to debug level 34. 201 Return to debug level 33. 202 Return to debug level 32. 203 Return to debug level 31. 204 Return to debug level 30. 205 Return to debug level 29. 206 Return to debug level 28. 207 Return to debug level 27. 208 Return to debug level 26. 209 Return to debug level 25. 210 Return to debug level 24. 211 Return to debug level 23. 212 Return to debug level 22. 213 Return to debug level 21. 214 Return to debug level 20. 215 Return to debug level 19. 216 Return to debug level 18. 217 Return to debug level 17. 218 Return to debug level 16. 219 Return to debug level 15. 220 Return to debug level 14. 221 Return to debug level 13. 222 Return to debug level 12. 223 Return to debug level 11. 224 Return to debug level 10. 225 Return to debug level 9. 226 Return to debug level 8. 227 Return to debug level 7. 228 Return to debug level 6. 229 Return to debug level 5. 230 Return to debug level 4. 231 Return to debug level 3. 232 Return to debug level 2. 233 Return to debug level 1. 234 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 234. 2 Return to debug level 233. 3 Return to debug level 232. 4 Return to debug level 231. 5 Return to debug level 230. 6 Return to debug level 229. 7 Return to debug level 228. 8 Return to debug level 227. 9 Return to debug level 226. 10 Return to debug level 225. 11 Return to debug level 224. 12 Return to debug level 223. 13 Return to debug level 222. 14 Return to debug level 221. 15 Return to debug level 220. 16 Return to debug level 219. 17 Return to debug level 218. 18 Return to debug level 217. 19 Return to debug level 216. 20 Return to debug level 215. 21 Return to debug level 214. 22 Return to debug level 213. 23 Return to debug level 212. 24 Return to debug level 211. 25 Return to debug level 210. 26 Return to debug level 209. 27 Return to debug level 208. 28 Return to debug level 207. 29 Return to debug level 206. 30 Return to debug level 205. 31 Return to debug level 204. 32 Return to debug level 203. 33 Return to debug level 202. 34 Return to debug level 201. 35 Return to debug level 200. 36 Return to debug level 199. 37 Return to debug level 198. 38 Return to debug level 197. 39 Return to debug level 196. 40 Return to debug level 195. 41 Return to debug level 194. 42 Return to debug level 193. 43 Return to debug level 192. 44 Return to debug level 191. 45 Return to debug level 190. 46 Return to debug level 189. 47 Return to debug level 188. 48 Return to debug level 187. 49 Return to debug level 186. 50 Return to debug level 185. 51 Return to debug level 184. 52 Return to debug level 183. 53 Return to debug level 182. 54 Return to debug level 181. 55 Return to debug level 180. 56 Return to debug level 179. 57 Return to debug level 178. 58 Return to debug level 177. 59 Return to debug level 176. 60 Return to debug level 175. 61 Return to debug level 174. 62 Return to debug level 173. 63 Return to debug level 172. 64 Return to debug level 171. 65 Return to debug level 170. 66 Return to debug level 169. 67 Return to debug level 168. 68 Return to debug level 167. 69 Return to debug level 166. 70 Return to debug level 165. 71 Return to debug level 164. 72 Return to debug level 163. 73 Return to debug level 162. 74 Return to debug level 161. 75 Return to debug level 160. 76 Return to debug level 159. 77 Return to debug level 158. 78 Return to debug level 157. 79 Return to debug level 156. 80 Return to debug level 155. 81 Return to debug level 154. 82 Return to debug level 153. 83 Return to debug level 152. 84 Return to debug level 151. 85 Return to debug level 150. 86 Return to debug level 149. 87 Return to debug level 148. 88 Return to debug level 147. 89 Return to debug level 146. 90 Return to debug level 145. 91 Return to debug level 144. 92 Return to debug level 143. 93 Return to debug level 142. 94 Return to debug level 141. 95 Return to debug level 140. 96 Return to debug level 139. 97 Return to debug level 138. 98 Return to debug level 137. 99 Return to debug level 136. 100 Return to debug level 135. 101 Return to debug level 134. 102 Return to debug level 133. 103 Return to debug level 132. 104 Return to debug level 131. 105 Return to debug level 130. 106 Return to debug level 129. 107 Return to debug level 128. 108 Return to debug level 127. 109 Return to debug level 126. 110 Return to debug level 125. 111 Return to debug level 124. 112 Return to debug level 123. 113 Return to debug level 122. 114 Return to debug level 121. 115 Return to debug level 120. 116 Return to debug level 119. 117 Return to debug level 118. 118 Return to debug level 117. 119 Return to debug level 116. 120 Return to debug level 115. 121 Return to debug level 114. 122 Return to debug level 113. 123 Return to debug level 112. 124 Return to debug level 111. 125 Return to debug level 110. 126 Return to debug level 109. 127 Return to debug level 108. 128 Return to debug level 107. 129 Return to debug level 106. 130 Return to debug level 105. 131 Return to debug level 104. 132 Return to debug level 103. 133 Return to debug level 102. 134 Return to debug level 101. 135 Return to debug level 100. 136 Return to debug level 99. 137 Return to debug level 98. 138 Return to debug level 97. 139 Return to debug level 96. 140 Return to debug level 95. 141 Return to debug level 94. 142 Return to debug level 93. 143 Return to debug level 92. 144 Return to debug level 91. 145 Return to debug level 90. 146 Return to debug level 89. 147 Return to debug level 88. 148 Return to debug level 87. 149 Return to debug level 86. 150 Return to debug level 85. 151 Return to debug level 84. 152 Return to debug level 83. 153 Return to debug level 82. 154 Return to debug level 81. 155 Return to debug level 80. 156 Return to debug level 79. 157 Return to debug level 78. 158 Return to debug level 77. 159 Return to debug level 76. 160 Return to debug level 75. 161 Return to debug level 74. 162 Return to debug level 73. 163 Return to debug level 72. 164 Return to debug level 71. 165 Return to debug level 70. 166 Return to debug level 69. 167 Return to debug level 68. 168 Return to debug level 67. 169 Return to debug level 66. 170 Return to debug level 65. 171 Return to debug level 64. 172 Return to debug level 63. 173 Return to debug level 62. 174 Return to debug level 61. 175 Return to debug level 60. 176 Return to debug level 59. 177 Return to debug level 58. 178 Return to debug level 57. 179 Return to debug level 56. 180 Return to debug level 55. 181 Return to debug level 54. 182 Return to debug level 53. 183 Return to debug level 52. 184 Return to debug level 51. 185 Return to debug level 50. 186 Return to debug level 49. 187 Return to debug level 48. 188 Return to debug level 47. 189 Return to debug level 46. 190 Return to debug level 45. 191 Return to debug level 44. 192 Return to debug level 43. 193 Return to debug level 42. 194 Return to debug level 41. 195 Return to debug level 40. 196 Return to debug level 39. 197 Return to debug level 38. 198 Return to debug level 37. 199 Return to debug level 36. 200 Return to debug level 35. 201 Return to debug level 34. 202 Return to debug level 33. 203 Return to debug level 32. 204 Return to debug level 31. 205 Return to debug level 30. 206 Return to debug level 29. 207 Return to debug level 28. 208 Return to debug level 27. 209 Return to debug level 26. 210 Return to debug level 25. 211 Return to debug level 24. 212 Return to debug level 23. 213 Return to debug level 22. 214 Return to debug level 21. 215 Return to debug level 20. 216 Return to debug level 19. 217 Return to debug level 18. 218 Return to debug level 17. 219 Return to debug level 16. 220 Return to debug level 15. 221 Return to debug level 14. 222 Return to debug level 13. 223 Return to debug level 12. 224 Return to debug level 11. 225 Return to debug level 10. 226 Return to debug level 9. 227 Return to debug level 8. 228 Return to debug level 7. 229 Return to debug level 6. 230 Return to debug level 5. 231 Return to debug level 4. 232 Return to debug level 3. 233 Return to debug level 2. 234 Return to debug level 1. 235 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 235. 2 Return to debug level 234. 3 Return to debug level 233. 4 Return to debug level 232. 5 Return to debug level 231. 6 Return to debug level 230. 7 Return to debug level 229. 8 Return to debug level 228. 9 Return to debug level 227. 10 Return to debug level 226. 11 Return to debug level 225. 12 Return to debug level 224. 13 Return to debug level 223. 14 Return to debug level 222. 15 Return to debug level 221. 16 Return to debug level 220. 17 Return to debug level 219. 18 Return to debug level 218. 19 Return to debug level 217. 20 Return to debug level 216. 21 Return to debug level 215. 22 Return to debug level 214. 23 Return to debug level 213. 24 Return to debug level 212. 25 Return to debug level 211. 26 Return to debug level 210. 27 Return to debug level 209. 28 Return to debug level 208. 29 Return to debug level 207. 30 Return to debug level 206. 31 Return to debug level 205. 32 Return to debug level 204. 33 Return to debug level 203. 34 Return to debug level 202. 35 Return to debug level 201. 36 Return to debug level 200. 37 Return to debug level 199. 38 Return to debug level 198. 39 Return to debug level 197. 40 Return to debug level 196. 41 Return to debug level 195. 42 Return to debug level 194. 43 Return to debug level 193. 44 Return to debug level 192. 45 Return to debug level 191. 46 Return to debug level 190. 47 Return to debug level 189. 48 Return to debug level 188. 49 Return to debug level 187. 50 Return to debug level 186. 51 Return to debug level 185. 52 Return to debug level 184. 53 Return to debug level 183. 54 Return to debug level 182. 55 Return to debug level 181. 56 Return to debug level 180. 57 Return to debug level 179. 58 Return to debug level 178. 59 Return to debug level 177. 60 Return to debug level 176. 61 Return to debug level 175. 62 Return to debug level 174. 63 Return to debug level 173. 64 Return to debug level 172. 65 Return to debug level 171. 66 Return to debug level 170. 67 Return to debug level 169. 68 Return to debug level 168. 69 Return to debug level 167. 70 Return to debug level 166. 71 Return to debug level 165. 72 Return to debug level 164. 73 Return to debug level 163. 74 Return to debug level 162. 75 Return to debug level 161. 76 Return to debug level 160. 77 Return to debug level 159. 78 Return to debug level 158. 79 Return to debug level 157. 80 Return to debug level 156. 81 Return to debug level 155. 82 Return to debug level 154. 83 Return to debug level 153. 84 Return to debug level 152. 85 Return to debug level 151. 86 Return to debug level 150. 87 Return to debug level 149. 88 Return to debug level 148. 89 Return to debug level 147. 90 Return to debug level 146. 91 Return to debug level 145. 92 Return to debug level 144. 93 Return to debug level 143. 94 Return to debug level 142. 95 Return to debug level 141. 96 Return to debug level 140. 97 Return to debug level 139. 98 Return to debug level 138. 99 Return to debug level 137. 100 Return to debug level 136. 101 Return to debug level 135. 102 Return to debug level 134. 103 Return to debug level 133. 104 Return to debug level 132. 105 Return to debug level 131. 106 Return to debug level 130. 107 Return to debug level 129. 108 Return to debug level 128. 109 Return to debug level 127. 110 Return to debug level 126. 111 Return to debug level 125. 112 Return to debug level 124. 113 Return to debug level 123. 114 Return to debug level 122. 115 Return to debug level 121. 116 Return to debug level 120. 117 Return to debug level 119. 118 Return to debug level 118. 119 Return to debug level 117. 120 Return to debug level 116. 121 Return to debug level 115. 122 Return to debug level 114. 123 Return to debug level 113. 124 Return to debug level 112. 125 Return to debug level 111. 126 Return to debug level 110. 127 Return to debug level 109. 128 Return to debug level 108. 129 Return to debug level 107. 130 Return to debug level 106. 131 Return to debug level 105. 132 Return to debug level 104. 133 Return to debug level 103. 134 Return to debug level 102. 135 Return to debug level 101. 136 Return to debug level 100. 137 Return to debug level 99. 138 Return to debug level 98. 139 Return to debug level 97. 140 Return to debug level 96. 141 Return to debug level 95. 142 Return to debug level 94. 143 Return to debug level 93. 144 Return to debug level 92. 145 Return to debug level 91. 146 Return to debug level 90. 147 Return to debug level 89. 148 Return to debug level 88. 149 Return to debug level 87. 150 Return to debug level 86. 151 Return to debug level 85. 152 Return to debug level 84. 153 Return to debug level 83. 154 Return to debug level 82. 155 Return to debug level 81. 156 Return to debug level 80. 157 Return to debug level 79. 158 Return to debug level 78. 159 Return to debug level 77. 160 Return to debug level 76. 161 Return to debug level 75. 162 Return to debug level 74. 163 Return to debug level 73. 164 Return to debug level 72. 165 Return to debug level 71. 166 Return to debug level 70. 167 Return to debug level 69. 168 Return to debug level 68. 169 Return to debug level 67. 170 Return to debug level 66. 171 Return to debug level 65. 172 Return to debug level 64. 173 Return to debug level 63. 174 Return to debug level 62. 175 Return to debug level 61. 176 Return to debug level 60. 177 Return to debug level 59. 178 Return to debug level 58. 179 Return to debug level 57. 180 Return to debug level 56. 181 Return to debug level 55. 182 Return to debug level 54. 183 Return to debug level 53. 184 Return to debug level 52. 185 Return to debug level 51. 186 Return to debug level 50. 187 Return to debug level 49. 188 Return to debug level 48. 189 Return to debug level 47. 190 Return to debug level 46. 191 Return to debug level 45. 192 Return to debug level 44. 193 Return to debug level 43. 194 Return to debug level 42. 195 Return to debug level 41. 196 Return to debug level 40. 197 Return to debug level 39. 198 Return to debug level 38. 199 Return to debug level 37. 200 Return to debug level 36. 201 Return to debug level 35. 202 Return to debug level 34. 203 Return to debug level 33. 204 Return to debug level 32. 205 Return to debug level 31. 206 Return to debug level 30. 207 Return to debug level 29. 208 Return to debug level 28. 209 Return to debug level 27. 210 Return to debug level 26. 211 Return to debug level 25. 212 Return to debug level 24. 213 Return to debug level 23. 214 Return to debug level 22. 215 Return to debug level 21. 216 Return to debug level 20. 217 Return to debug level 19. 218 Return to debug level 18. 219 Return to debug level 17. 220 Return to debug level 16. 221 Return to debug level 15. 222 Return to debug level 14. 223 Return to debug level 13. 224 Return to debug level 12. 225 Return to debug level 11. 226 Return to debug level 10. 227 Return to debug level 9. 228 Return to debug level 8. 229 Return to debug level 7. 230 Return to debug level 6. 231 Return to debug level 5. 232 Return to debug level 4. 233 Return to debug level 3. 234 Return to debug level 2. 235 Return to debug level 1. 236 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 236. 2 Return to debug level 235. 3 Return to debug level 234. 4 Return to debug level 233. 5 Return to debug level 232. 6 Return to debug level 231. 7 Return to debug level 230. 8 Return to debug level 229. 9 Return to debug level 228. 10 Return to debug level 227. 11 Return to debug level 226. 12 Return to debug level 225. 13 Return to debug level 224. 14 Return to debug level 223. 15 Return to debug level 222. 16 Return to debug level 221. 17 Return to debug level 220. 18 Return to debug level 219. 19 Return to debug level 218. 20 Return to debug level 217. 21 Return to debug level 216. 22 Return to debug level 215. 23 Return to debug level 214. 24 Return to debug level 213. 25 Return to debug level 212. 26 Return to debug level 211. 27 Return to debug level 210. 28 Return to debug level 209. 29 Return to debug level 208. 30 Return to debug level 207. 31 Return to debug level 206. 32 Return to debug level 205. 33 Return to debug level 204. 34 Return to debug level 203. 35 Return to debug level 202. 36 Return to debug level 201. 37 Return to debug level 200. 38 Return to debug level 199. 39 Return to debug level 198. 40 Return to debug level 197. 41 Return to debug level 196. 42 Return to debug level 195. 43 Return to debug level 194. 44 Return to debug level 193. 45 Return to debug level 192. 46 Return to debug level 191. 47 Return to debug level 190. 48 Return to debug level 189. 49 Return to debug level 188. 50 Return to debug level 187. 51 Return to debug level 186. 52 Return to debug level 185. 53 Return to debug level 184. 54 Return to debug level 183. 55 Return to debug level 182. 56 Return to debug level 181. 57 Return to debug level 180. 58 Return to debug level 179. 59 Return to debug level 178. 60 Return to debug level 177. 61 Return to debug level 176. 62 Return to debug level 175. 63 Return to debug level 174. 64 Return to debug level 173. 65 Return to debug level 172. 66 Return to debug level 171. 67 Return to debug level 170. 68 Return to debug level 169. 69 Return to debug level 168. 70 Return to debug level 167. 71 Return to debug level 166. 72 Return to debug level 165. 73 Return to debug level 164. 74 Return to debug level 163. 75 Return to debug level 162. 76 Return to debug level 161. 77 Return to debug level 160. 78 Return to debug level 159. 79 Return to debug level 158. 80 Return to debug level 157. 81 Return to debug level 156. 82 Return to debug level 155. 83 Return to debug level 154. 84 Return to debug level 153. 85 Return to debug level 152. 86 Return to debug level 151. 87 Return to debug level 150. 88 Return to debug level 149. 89 Return to debug level 148. 90 Return to debug level 147. 91 Return to debug level 146. 92 Return to debug level 145. 93 Return to debug level 144. 94 Return to debug level 143. 95 Return to debug level 142. 96 Return to debug level 141. 97 Return to debug level 140. 98 Return to debug level 139. 99 Return to debug level 138. 100 Return to debug level 137. 101 Return to debug level 136. 102 Return to debug level 135. 103 Return to debug level 134. 104 Return to debug level 133. 105 Return to debug level 132. 106 Return to debug level 131. 107 Return to debug level 130. 108 Return to debug level 129. 109 Return to debug level 128. 110 Return to debug level 127. 111 Return to debug level 126. 112 Return to debug level 125. 113 Return to debug level 124. 114 Return to debug level 123. 115 Return to debug level 122. 116 Return to debug level 121. 117 Return to debug level 120. 118 Return to debug level 119. 119 Return to debug level 118. 120 Return to debug level 117. 121 Return to debug level 116. 122 Return to debug level 115. 123 Return to debug level 114. 124 Return to debug level 113. 125 Return to debug level 112. 126 Return to debug level 111. 127 Return to debug level 110. 128 Return to debug level 109. 129 Return to debug level 108. 130 Return to debug level 107. 131 Return to debug level 106. 132 Return to debug level 105. 133 Return to debug level 104. 134 Return to debug level 103. 135 Return to debug level 102. 136 Return to debug level 101. 137 Return to debug level 100. 138 Return to debug level 99. 139 Return to debug level 98. 140 Return to debug level 97. 141 Return to debug level 96. 142 Return to debug level 95. 143 Return to debug level 94. 144 Return to debug level 93. 145 Return to debug level 92. 146 Return to debug level 91. 147 Return to debug level 90. 148 Return to debug level 89. 149 Return to debug level 88. 150 Return to debug level 87. 151 Return to debug level 86. 152 Return to debug level 85. 153 Return to debug level 84. 154 Return to debug level 83. 155 Return to debug level 82. 156 Return to debug level 81. 157 Return to debug level 80. 158 Return to debug level 79. 159 Return to debug level 78. 160 Return to debug level 77. 161 Return to debug level 76. 162 Return to debug level 75. 163 Return to debug level 74. 164 Return to debug level 73. 165 Return to debug level 72. 166 Return to debug level 71. 167 Return to debug level 70. 168 Return to debug level 69. 169 Return to debug level 68. 170 Return to debug level 67. 171 Return to debug level 66. 172 Return to debug level 65. 173 Return to debug level 64. 174 Return to debug level 63. 175 Return to debug level 62. 176 Return to debug level 61. 177 Return to debug level 60. 178 Return to debug level 59. 179 Return to debug level 58. 180 Return to debug level 57. 181 Return to debug level 56. 182 Return to debug level 55. 183 Return to debug level 54. 184 Return to debug level 53. 185 Return to debug level 52. 186 Return to debug level 51. 187 Return to debug level 50. 188 Return to debug level 49. 189 Return to debug level 48. 190 Return to debug level 47. 191 Return to debug level 46. 192 Return to debug level 45. 193 Return to debug level 44. 194 Return to debug level 43. 195 Return to debug level 42. 196 Return to debug level 41. 197 Return to debug level 40. 198 Return to debug level 39. 199 Return to debug level 38. 200 Return to debug level 37. 201 Return to debug level 36. 202 Return to debug level 35. 203 Return to debug level 34. 204 Return to debug level 33. 205 Return to debug level 32. 206 Return to debug level 31. 207 Return to debug level 30. 208 Return to debug level 29. 209 Return to debug level 28. 210 Return to debug level 27. 211 Return to debug level 26. 212 Return to debug level 25. 213 Return to debug level 24. 214 Return to debug level 23. 215 Return to debug level 22. 216 Return to debug level 21. 217 Return to debug level 20. 218 Return to debug level 19. 219 Return to debug level 18. 220 Return to debug level 17. 221 Return to debug level 16. 222 Return to debug level 15. 223 Return to debug level 14. 224 Return to debug level 13. 225 Return to debug level 12. 226 Return to debug level 11. 227 Return to debug level 10. 228 Return to debug level 9. 229 Return to debug level 8. 230 Return to debug level 7. 231 Return to debug level 6. 232 Return to debug level 5. 233 Return to debug level 4. 234 Return to debug level 3. 235 Return to debug level 2. 236 Return to debug level 1. 237 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 237. 2 Return to debug level 236. 3 Return to debug level 235. 4 Return to debug level 234. 5 Return to debug level 233. 6 Return to debug level 232. 7 Return to debug level 231. 8 Return to debug level 230. 9 Return to debug level 229. 10 Return to debug level 228. 11 Return to debug level 227. 12 Return to debug level 226. 13 Return to debug level 225. 14 Return to debug level 224. 15 Return to debug level 223. 16 Return to debug level 222. 17 Return to debug level 221. 18 Return to debug level 220. 19 Return to debug level 219. 20 Return to debug level 218. 21 Return to debug level 217. 22 Return to debug level 216. 23 Return to debug level 215. 24 Return to debug level 214. 25 Return to debug level 213. 26 Return to debug level 212. 27 Return to debug level 211. 28 Return to debug level 210. 29 Return to debug level 209. 30 Return to debug level 208. 31 Return to debug level 207. 32 Return to debug level 206. 33 Return to debug level 205. 34 Return to debug level 204. 35 Return to debug level 203. 36 Return to debug level 202. 37 Return to debug level 201. 38 Return to debug level 200. 39 Return to debug level 199. 40 Return to debug level 198. 41 Return to debug level 197. 42 Return to debug level 196. 43 Return to debug level 195. 44 Return to debug level 194. 45 Return to debug level 193. 46 Return to debug level 192. 47 Return to debug level 191. 48 Return to debug level 190. 49 Return to debug level 189. 50 Return to debug level 188. 51 Return to debug level 187. 52 Return to debug level 186. 53 Return to debug level 185. 54 Return to debug level 184. 55 Return to debug level 183. 56 Return to debug level 182. 57 Return to debug level 181. 58 Return to debug level 180. 59 Return to debug level 179. 60 Return to debug level 178. 61 Return to debug level 177. 62 Return to debug level 176. 63 Return to debug level 175. 64 Return to debug level 174. 65 Return to debug level 173. 66 Return to debug level 172. 67 Return to debug level 171. 68 Return to debug level 170. 69 Return to debug level 169. 70 Return to debug level 168. 71 Return to debug level 167. 72 Return to debug level 166. 73 Return to debug level 165. 74 Return to debug level 164. 75 Return to debug level 163. 76 Return to debug level 162. 77 Return to debug level 161. 78 Return to debug level 160. 79 Return to debug level 159. 80 Return to debug level 158. 81 Return to debug level 157. 82 Return to debug level 156. 83 Return to debug level 155. 84 Return to debug level 154. 85 Return to debug level 153. 86 Return to debug level 152. 87 Return to debug level 151. 88 Return to debug level 150. 89 Return to debug level 149. 90 Return to debug level 148. 91 Return to debug level 147. 92 Return to debug level 146. 93 Return to debug level 145. 94 Return to debug level 144. 95 Return to debug level 143. 96 Return to debug level 142. 97 Return to debug level 141. 98 Return to debug level 140. 99 Return to debug level 139. 100 Return to debug level 138. 101 Return to debug level 137. 102 Return to debug level 136. 103 Return to debug level 135. 104 Return to debug level 134. 105 Return to debug level 133. 106 Return to debug level 132. 107 Return to debug level 131. 108 Return to debug level 130. 109 Return to debug level 129. 110 Return to debug level 128. 111 Return to debug level 127. 112 Return to debug level 126. 113 Return to debug level 125. 114 Return to debug level 124. 115 Return to debug level 123. 116 Return to debug level 122. 117 Return to debug level 121. 118 Return to debug level 120. 119 Return to debug level 119. 120 Return to debug level 118. 121 Return to debug level 117. 122 Return to debug level 116. 123 Return to debug level 115. 124 Return to debug level 114. 125 Return to debug level 113. 126 Return to debug level 112. 127 Return to debug level 111. 128 Return to debug level 110. 129 Return to debug level 109. 130 Return to debug level 108. 131 Return to debug level 107. 132 Return to debug level 106. 133 Return to debug level 105. 134 Return to debug level 104. 135 Return to debug level 103. 136 Return to debug level 102. 137 Return to debug level 101. 138 Return to debug level 100. 139 Return to debug level 99. 140 Return to debug level 98. 141 Return to debug level 97. 142 Return to debug level 96. 143 Return to debug level 95. 144 Return to debug level 94. 145 Return to debug level 93. 146 Return to debug level 92. 147 Return to debug level 91. 148 Return to debug level 90. 149 Return to debug level 89. 150 Return to debug level 88. 151 Return to debug level 87. 152 Return to debug level 86. 153 Return to debug level 85. 154 Return to debug level 84. 155 Return to debug level 83. 156 Return to debug level 82. 157 Return to debug level 81. 158 Return to debug level 80. 159 Return to debug level 79. 160 Return to debug level 78. 161 Return to debug level 77. 162 Return to debug level 76. 163 Return to debug level 75. 164 Return to debug level 74. 165 Return to debug level 73. 166 Return to debug level 72. 167 Return to debug level 71. 168 Return to debug level 70. 169 Return to debug level 69. 170 Return to debug level 68. 171 Return to debug level 67. 172 Return to debug level 66. 173 Return to debug level 65. 174 Return to debug level 64. 175 Return to debug level 63. 176 Return to debug level 62. 177 Return to debug level 61. 178 Return to debug level 60. 179 Return to debug level 59. 180 Return to debug level 58. 181 Return to debug level 57. 182 Return to debug level 56. 183 Return to debug level 55. 184 Return to debug level 54. 185 Return to debug level 53. 186 Return to debug level 52. 187 Return to debug level 51. 188 Return to debug level 50. 189 Return to debug level 49. 190 Return to debug level 48. 191 Return to debug level 47. 192 Return to debug level 46. 193 Return to debug level 45. 194 Return to debug level 44. 195 Return to debug level 43. 196 Return to debug level 42. 197 Return to debug level 41. 198 Return to debug level 40. 199 Return to debug level 39. 200 Return to debug level 38. 201 Return to debug level 37. 202 Return to debug level 36. 203 Return to debug level 35. 204 Return to debug level 34. 205 Return to debug level 33. 206 Return to debug level 32. 207 Return to debug level 31. 208 Return to debug level 30. 209 Return to debug level 29. 210 Return to debug level 28. 211 Return to debug level 27. 212 Return to debug level 26. 213 Return to debug level 25. 214 Return to debug level 24. 215 Return to debug level 23. 216 Return to debug level 22. 217 Return to debug level 21. 218 Return to debug level 20. 219 Return to debug level 19. 220 Return to debug level 18. 221 Return to debug level 17. 222 Return to debug level 16. 223 Return to debug level 15. 224 Return to debug level 14. 225 Return to debug level 13. 226 Return to debug level 12. 227 Return to debug level 11. 228 Return to debug level 10. 229 Return to debug level 9. 230 Return to debug level 8. 231 Return to debug level 7. 232 Return to debug level 6. 233 Return to debug level 5. 234 Return to debug level 4. 235 Return to debug level 3. 236 Return to debug level 2. 237 Return to debug level 1. 238 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 238. 2 Return to debug level 237. 3 Return to debug level 236. 4 Return to debug level 235. 5 Return to debug level 234. 6 Return to debug level 233. 7 Return to debug level 232. 8 Return to debug level 231. 9 Return to debug level 230. 10 Return to debug level 229. 11 Return to debug level 228. 12 Return to debug level 227. 13 Return to debug level 226. 14 Return to debug level 225. 15 Return to debug level 224. 16 Return to debug level 223. 17 Return to debug level 222. 18 Return to debug level 221. 19 Return to debug level 220. 20 Return to debug level 219. 21 Return to debug level 218. 22 Return to debug level 217. 23 Return to debug level 216. 24 Return to debug level 215. 25 Return to debug level 214. 26 Return to debug level 213. 27 Return to debug level 212. 28 Return to debug level 211. 29 Return to debug level 210. 30 Return to debug level 209. 31 Return to debug level 208. 32 Return to debug level 207. 33 Return to debug level 206. 34 Return to debug level 205. 35 Return to debug level 204. 36 Return to debug level 203. 37 Return to debug level 202. 38 Return to debug level 201. 39 Return to debug level 200. 40 Return to debug level 199. 41 Return to debug level 198. 42 Return to debug level 197. 43 Return to debug level 196. 44 Return to debug level 195. 45 Return to debug level 194. 46 Return to debug level 193. 47 Return to debug level 192. 48 Return to debug level 191. 49 Return to debug level 190. 50 Return to debug level 189. 51 Return to debug level 188. 52 Return to debug level 187. 53 Return to debug level 186. 54 Return to debug level 185. 55 Return to debug level 184. 56 Return to debug level 183. 57 Return to debug level 182. 58 Return to debug level 181. 59 Return to debug level 180. 60 Return to debug level 179. 61 Return to debug level 178. 62 Return to debug level 177. 63 Return to debug level 176. 64 Return to debug level 175. 65 Return to debug level 174. 66 Return to debug level 173. 67 Return to debug level 172. 68 Return to debug level 171. 69 Return to debug level 170. 70 Return to debug level 169. 71 Return to debug level 168. 72 Return to debug level 167. 73 Return to debug level 166. 74 Return to debug level 165. 75 Return to debug level 164. 76 Return to debug level 163. 77 Return to debug level 162. 78 Return to debug level 161. 79 Return to debug level 160. 80 Return to debug level 159. 81 Return to debug level 158. 82 Return to debug level 157. 83 Return to debug level 156. 84 Return to debug level 155. 85 Return to debug level 154. 86 Return to debug level 153. 87 Return to debug level 152. 88 Return to debug level 151. 89 Return to debug level 150. 90 Return to debug level 149. 91 Return to debug level 148. 92 Return to debug level 147. 93 Return to debug level 146. 94 Return to debug level 145. 95 Return to debug level 144. 96 Return to debug level 143. 97 Return to debug level 142. 98 Return to debug level 141. 99 Return to debug level 140. 100 Return to debug level 139. 101 Return to debug level 138. 102 Return to debug level 137. 103 Return to debug level 136. 104 Return to debug level 135. 105 Return to debug level 134. 106 Return to debug level 133. 107 Return to debug level 132. 108 Return to debug level 131. 109 Return to debug level 130. 110 Return to debug level 129. 111 Return to debug level 128. 112 Return to debug level 127. 113 Return to debug level 126. 114 Return to debug level 125. 115 Return to debug level 124. 116 Return to debug level 123. 117 Return to debug level 122. 118 Return to debug level 121. 119 Return to debug level 120. 120 Return to debug level 119. 121 Return to debug level 118. 122 Return to debug level 117. 123 Return to debug level 116. 124 Return to debug level 115. 125 Return to debug level 114. 126 Return to debug level 113. 127 Return to debug level 112. 128 Return to debug level 111. 129 Return to debug level 110. 130 Return to debug level 109. 131 Return to debug level 108. 132 Return to debug level 107. 133 Return to debug level 106. 134 Return to debug level 105. 135 Return to debug level 104. 136 Return to debug level 103. 137 Return to debug level 102. 138 Return to debug level 101. 139 Return to debug level 100. 140 Return to debug level 99. 141 Return to debug level 98. 142 Return to debug level 97. 143 Return to debug level 96. 144 Return to debug level 95. 145 Return to debug level 94. 146 Return to debug level 93. 147 Return to debug level 92. 148 Return to debug level 91. 149 Return to debug level 90. 150 Return to debug level 89. 151 Return to debug level 88. 152 Return to debug level 87. 153 Return to debug level 86. 154 Return to debug level 85. 155 Return to debug level 84. 156 Return to debug level 83. 157 Return to debug level 82. 158 Return to debug level 81. 159 Return to debug level 80. 160 Return to debug level 79. 161 Return to debug level 78. 162 Return to debug level 77. 163 Return to debug level 76. 164 Return to debug level 75. 165 Return to debug level 74. 166 Return to debug level 73. 167 Return to debug level 72. 168 Return to debug level 71. 169 Return to debug level 70. 170 Return to debug level 69. 171 Return to debug level 68. 172 Return to debug level 67. 173 Return to debug level 66. 174 Return to debug level 65. 175 Return to debug level 64. 176 Return to debug level 63. 177 Return to debug level 62. 178 Return to debug level 61. 179 Return to debug level 60. 180 Return to debug level 59. 181 Return to debug level 58. 182 Return to debug level 57. 183 Return to debug level 56. 184 Return to debug level 55. 185 Return to debug level 54. 186 Return to debug level 53. 187 Return to debug level 52. 188 Return to debug level 51. 189 Return to debug level 50. 190 Return to debug level 49. 191 Return to debug level 48. 192 Return to debug level 47. 193 Return to debug level 46. 194 Return to debug level 45. 195 Return to debug level 44. 196 Return to debug level 43. 197 Return to debug level 42. 198 Return to debug level 41. 199 Return to debug level 40. 200 Return to debug level 39. 201 Return to debug level 38. 202 Return to debug level 37. 203 Return to debug level 36. 204 Return to debug level 35. 205 Return to debug level 34. 206 Return to debug level 33. 207 Return to debug level 32. 208 Return to debug level 31. 209 Return to debug level 30. 210 Return to debug level 29. 211 Return to debug level 28. 212 Return to debug level 27. 213 Return to debug level 26. 214 Return to debug level 25. 215 Return to debug level 24. 216 Return to debug level 23. 217 Return to debug level 22. 218 Return to debug level 21. 219 Return to debug level 20. 220 Return to debug level 19. 221 Return to debug level 18. 222 Return to debug level 17. 223 Return to debug level 16. 224 Return to debug level 15. 225 Return to debug level 14. 226 Return to debug level 13. 227 Return to debug level 12. 228 Return to debug level 11. 229 Return to debug level 10. 230 Return to debug level 9. 231 Return to debug level 8. 232 Return to debug level 7. 233 Return to debug level 6. 234 Return to debug level 5. 235 Return to debug level 4. 236 Return to debug level 3. 237 Return to debug level 2. 238 Return to debug level 1. 239 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Error:ERROR: Bind stack overflow. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Bind stack overflow. Broken at FUN%8887%168. 1 (abort) Return to debug level 240. 2 Return to debug level 239. 3 Return to debug level 238. 4 Return to debug level 237. 5 Return to debug level 236. 6 Return to debug level 235. 7 Return to debug level 234. 8 Return to debug level 233. 9 Return to debug level 232. 10 Return to debug level 231. 11 Return to debug level 230. 12 Return to debug level 229. 13 Return to debug level 228. 14 Return to debug level 227. 15 Return to debug level 226. 16 Return to debug level 225. 17 Return to debug level 224. 18 Return to debug level 223. 19 Return to debug level 222. 20 Return to debug level 221. 21 Return to debug level 220. 22 Return to debug level 219. 23 Return to debug level 218. 24 Return to debug level 217. 25 Return to debug level 216. 26 Return to debug level 215. 27 Return to debug level 214. 28 Return to debug level 213. 29 Return to debug level 212. 30 Return to debug level 211. 31 Return to debug level 210. 32 Return to debug level 209. 33 Return to debug level 208. 34 Return to debug level 207. 35 Return to debug level 206. 36 Return to debug level 205. 37 Return to debug level 204. 38 Return to debug level 203. 39 Return to debug level 202. 40 Return to debug level 201. 41 Return to debug level 200. 42 Return to debug level 199. 43 Return to debug level 198. 44 Return to debug level 197. 45 Return to debug level 196. 46 Return to debug level 195. 47 Return to debug level 194. 48 Return to debug level 193. 49 Return to debug level 192. 50 Return to debug level 191. 51 Return to debug level 190. 52 Return to debug level 189. 53 Return to debug level 188. 54 Return to debug level 187. 55 Return to debug level 186. 56 Return to debug level 185. 57 Return to debug level 184. 58 Return to debug level 183. 59 Return to debug level 182. 60 Return to debug level 181. 61 Return to debug level 180. 62 Return to debug level 179. 63 Return to debug level 178. 64 Return to debug level 177. 65 Return to debug level 176. 66 Return to debug level 175. 67 Return to debug level 174. 68 Return to debug level 173. 69 Return to debug level 172. 70 Return to debug level 171. 71 Return to debug level 170. 72 Return to debug level 169. 73 Return to debug level 168. 74 Return to debug level 167. 75 Return to debug level 166. 76 Return to debug level 165. 77 Return to debug level 164. 78 Return to debug level 163. 79 Return to debug level 162. 80 Return to debug level 161. 81 Return to debug level 160. 82 Return to debug level 159. 83 Return to debug level 158. 84 Return to debug level 157. 85 Return to debug level 156. 86 Return to debug level 155. 87 Return to debug level 154. 88 Return to debug level 153. 89 Return to debug level 152. 90 Return to debug level 151. 91 Return to debug level 150. 92 Return to debug level 149. 93 Return to debug level 148. 94 Return to debug level 147. 95 Return to debug level 146. 96 Return to debug level 145. 97 Return to debug level 144. 98 Return to debug level 143. 99 Return to debug level 142. 100 Return to debug level 141. 101 Return to debug level 140. 102 Return to debug level 139. 103 Return to debug level 138. 104 Return to debug level 137. 105 Return to debug level 136. 106 Return to debug level 135. 107 Return to debug level 134. 108 Return to debug level 133. 109 Return to debug level 132. 110 Return to debug level 131. 111 Return to debug level 130. 112 Return to debug level 129. 113 Return to debug level 128. 114 Return to debug level 127. 115 Return to debug level 126. 116 Return to debug level 125. 117 Return to debug level 124. 118 Return to debug level 123. 119 Return to debug level 122. 120 Return to debug level 121. 121 Return to debug level 120. 122 Return to debug level 119. 123 Return to debug level 118. 124 Return to debug level 117. 125 Return to debug level 116. 126 Return to debug level 115. 127 Return to debug level 114. 128 Return to debug level 113. 129 Return to debug level 112. 130 Return to debug level 111. 131 Return to debug level 110. 132 Return to debug level 109. 133 Return to debug level 108. 134 Return to debug level 107. 135 Return to debug level 106. 136 Return to debug level 105. 137 Return to debug level 104. 138 Return to debug level 103. 139 Return to debug level 102. 140 Return to debug level 101. 141 Return to debug level 100. 142 Return to debug level 99. 143 Return to debug level 98. 144 Return to debug level 97. 145 Return to debug level 96. 146 Return to debug level 95. 147 Return to debug level 94. 148 Return to debug level 93. 149 Return to debug level 92. 150 Return to debug level 91. 151 Return to debug level 90. 152 Return to debug level 89. 153 Return to debug level 88. 154 Return to debug level 87. 155 Return to debug level 86. 156 Return to debug level 85. 157 Return to debug level 84. 158 Return to debug level 83. 159 Return to debug level 82. 160 Return to debug level 81. 161 Return to debug level 80. 162 Return to debug level 79. 163 Return to debug level 78. 164 Return to debug level 77. 165 Return to debug level 76. 166 Return to debug level 75. 167 Return to debug level 74. 168 Return to debug level 73. 169 Return to debug level 72. 170 Return to debug level 71. 171 Return to debug level 70. 172 Return to debug level 69. 173 Return to debug level 68. 174 Return to debug level 67. 175 Return to debug level 66. 176 Return to debug level 65. 177 Return to debug level 64. 178 Return to debug level 63. 179 Return to debug level 62. 180 Return to debug level 61. 181 Return to debug level 60. 182 Return to debug level 59. 183 Return to debug level 58. 184 Return to debug level 57. 185 Return to debug level 56. 186 Return to debug level 55. 187 Return to debug level 54. 188 Return to debug level 53. 189 Return to debug level 52. 190 Return to debug level 51. 191 Return to debug level 50. 192 Return to debug level 49. 193 Return to debug level 48. 194 Return to debug level 47. 195 Return to debug level 46. 196 Return to debug level 45. 197 Return to debug level 44. 198 Return to debug level 43. 199 Return to debug level 42. 200 Return to debug level 41. 201 Return to debug level 40. 202 Return to debug level 39. 203 Return to debug level 38. 204 Return to debug level 37. 205 Return to debug level 36. 206 Return to debug level 35. 207 Return to debug level 34. 208 Return to debug level 33. 209 Return to debug level 32. 210 Return to debug level 31. 211 Return to debug level 30. 212 Return to debug level 29. 213 Return to debug level 28. 214 Return to debug level 27. 215 Return to debug level 26. 216 Return to debug level 25. 217 Return to debug level 24. 218 Return to debug level 23. 219 Return to debug level 22. 220 Return to debug level 21. 221 Return to debug level 20. 222 Return to debug level 19. 223 Return to debug level 18. 224 Return to debug level 17. 225 Return to debug level 16. 226 Return to debug level 15. 227 Return to debug level 14. 228 Return to debug level 13. 229 Return to debug level 12. 230 Return to debug level 11. 231 Return to debug level 10. 232 Return to debug level 9. 233 Return to debug level 8. 234 Return to debug level 7. 235 Return to debug level 6. 236 Return to debug level 5. 237 Return to debug level 4. 238 Return to debug level 3. 239 Return to debug level 2. 240 Return to debug level 1. 241 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 241. 2 Return to debug level 240. 3 Return to debug level 239. 4 Return to debug level 238. 5 Return to debug level 237. 6 Return to debug level 236. 7 Return to debug level 235. 8 Return to debug level 234. 9 Return to debug level 233. 10 Return to debug level 232. 11 Return to debug level 231. 12 Return to debug level 230. 13 Return to debug level 229. 14 Return to debug level 228. 15 Return to debug level 227. 16 Return to debug level 226. 17 Return to debug level 225. 18 Return to debug level 224. 19 Return to debug level 223. 20 Return to debug level 222. 21 Return to debug level 221. 22 Return to debug level 220. 23 Return to debug level 219. 24 Return to debug level 218. 25 Return to debug level 217. 26 Return to debug level 216. 27 Return to debug level 215. 28 Return to debug level 214. 29 Return to debug level 213. 30 Return to debug level 212. 31 Return to debug level 211. 32 Return to debug level 210. 33 Return to debug level 209. 34 Return to debug level 208. 35 Return to debug level 207. 36 Return to debug level 206. 37 Return to debug level 205. 38 Return to debug level 204. 39 Return to debug level 203. 40 Return to debug level 202. 41 Return to debug level 201. 42 Return to debug level 200. 43 Return to debug level 199. 44 Return to debug level 198. 45 Return to debug level 197. 46 Return to debug level 196. 47 Return to debug level 195. 48 Return to debug level 194. 49 Return to debug level 193. 50 Return to debug level 192. 51 Return to debug level 191. 52 Return to debug level 190. 53 Return to debug level 189. 54 Return to debug level 188. 55 Return to debug level 187. 56 Return to debug level 186. 57 Return to debug level 185. 58 Return to debug level 184. 59 Return to debug level 183. 60 Return to debug level 182. 61 Return to debug level 181. 62 Return to debug level 180. 63 Return to debug level 179. 64 Return to debug level 178. 65 Return to debug level 177. 66 Return to debug level 176. 67 Return to debug level 175. 68 Return to debug level 174. 69 Return to debug level 173. 70 Return to debug level 172. 71 Return to debug level 171. 72 Return to debug level 170. 73 Return to debug level 169. 74 Return to debug level 168. 75 Return to debug level 167. 76 Return to debug level 166. 77 Return to debug level 165. 78 Return to debug level 164. 79 Return to debug level 163. 80 Return to debug level 162. 81 Return to debug level 161. 82 Return to debug level 160. 83 Return to debug level 159. 84 Return to debug level 158. 85 Return to debug level 157. 86 Return to debug level 156. 87 Return to debug level 155. 88 Return to debug level 154. 89 Return to debug level 153. 90 Return to debug level 152. 91 Return to debug level 151. 92 Return to debug level 150. 93 Return to debug level 149. 94 Return to debug level 148. 95 Return to debug level 147. 96 Return to debug level 146. 97 Return to debug level 145. 98 Return to debug level 144. 99 Return to debug level 143. 100 Return to debug level 142. 101 Return to debug level 141. 102 Return to debug level 140. 103 Return to debug level 139. 104 Return to debug level 138. 105 Return to debug level 137. 106 Return to debug level 136. 107 Return to debug level 135. 108 Return to debug level 134. 109 Return to debug level 133. 110 Return to debug level 132. 111 Return to debug level 131. 112 Return to debug level 130. 113 Return to debug level 129. 114 Return to debug level 128. 115 Return to debug level 127. 116 Return to debug level 126. 117 Return to debug level 125. 118 Return to debug level 124. 119 Return to debug level 123. 120 Return to debug level 122. 121 Return to debug level 121. 122 Return to debug level 120. 123 Return to debug level 119. 124 Return to debug level 118. 125 Return to debug level 117. 126 Return to debug level 116. 127 Return to debug level 115. 128 Return to debug level 114. 129 Return to debug level 113. 130 Return to debug level 112. 131 Return to debug level 111. 132 Return to debug level 110. 133 Return to debug level 109. 134 Return to debug level 108. 135 Return to debug level 107. 136 Return to debug level 106. 137 Return to debug level 105. 138 Return to debug level 104. 139 Return to debug level 103. 140 Return to debug level 102. 141 Return to debug level 101. 142 Return to debug level 100. 143 Return to debug level 99. 144 Return to debug level 98. 145 Return to debug level 97. 146 Return to debug level 96. 147 Return to debug level 95. 148 Return to debug level 94. 149 Return to debug level 93. 150 Return to debug level 92. 151 Return to debug level 91. 152 Return to debug level 90. 153 Return to debug level 89. 154 Return to debug level 88. 155 Return to debug level 87. 156 Return to debug level 86. 157 Return to debug level 85. 158 Return to debug level 84. 159 Return to debug level 83. 160 Return to debug level 82. 161 Return to debug level 81. 162 Return to debug level 80. 163 Return to debug level 79. 164 Return to debug level 78. 165 Return to debug level 77. 166 Return to debug level 76. 167 Return to debug level 75. 168 Return to debug level 74. 169 Return to debug level 73. 170 Return to debug level 72. 171 Return to debug level 71. 172 Return to debug level 70. 173 Return to debug level 69. 174 Return to debug level 68. 175 Return to debug level 67. 176 Return to debug level 66. 177 Return to debug level 65. 178 Return to debug level 64. 179 Return to debug level 63. 180 Return to debug level 62. 181 Return to debug level 61. 182 Return to debug level 60. 183 Return to debug level 59. 184 Return to debug level 58. 185 Return to debug level 57. 186 Return to debug level 56. 187 Return to debug level 55. 188 Return to debug level 54. 189 Return to debug level 53. 190 Return to debug level 52. 191 Return to debug level 51. 192 Return to debug level 50. 193 Return to debug level 49. 194 Return to debug level 48. 195 Return to debug level 47. 196 Return to debug level 46. 197 Return to debug level 45. 198 Return to debug level 44. 199 Return to debug level 43. 200 Return to debug level 42. 201 Return to debug level 41. 202 Return to debug level 40. 203 Return to debug level 39. 204 Return to debug level 38. 205 Return to debug level 37. 206 Return to debug level 36. 207 Return to debug level 35. 208 Return to debug level 34. 209 Return to debug level 33. 210 Return to debug level 32. 211 Return to debug level 31. 212 Return to debug level 30. 213 Return to debug level 29. 214 Return to debug level 28. 215 Return to debug level 27. 216 Return to debug level 26. 217 Return to debug level 25. 218 Return to debug level 24. 219 Return to debug level 23. 220 Return to debug level 22. 221 Return to debug level 21. 222 Return to debug level 20. 223 Return to debug level 19. 224 Return to debug level 18. 225 Return to debug level 17. 226 Return to debug level 16. 227 Return to debug level 15. 228 Return to debug level 14. 229 Return to debug level 13. 230 Return to debug level 12. 231 Return to debug level 11. 232 Return to debug level 10. 233 Return to debug level 9. 234 Return to debug level 8. 235 Return to debug level 7. 236 Return to debug level 6. 237 Return to debug level 5. 238 Return to debug level 4. 239 Return to debug level 3. 240 Return to debug level 2. 241 Return to debug level 1. 242 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 242. 2 Return to debug level 241. 3 Return to debug level 240. 4 Return to debug level 239. 5 Return to debug level 238. 6 Return to debug level 237. 7 Return to debug level 236. 8 Return to debug level 235. 9 Return to debug level 234. 10 Return to debug level 233. 11 Return to debug level 232. 12 Return to debug level 231. 13 Return to debug level 230. 14 Return to debug level 229. 15 Return to debug level 228. 16 Return to debug level 227. 17 Return to debug level 226. 18 Return to debug level 225. 19 Return to debug level 224. 20 Return to debug level 223. 21 Return to debug level 222. 22 Return to debug level 221. 23 Return to debug level 220. 24 Return to debug level 219. 25 Return to debug level 218. 26 Return to debug level 217. 27 Return to debug level 216. 28 Return to debug level 215. 29 Return to debug level 214. 30 Return to debug level 213. 31 Return to debug level 212. 32 Return to debug level 211. 33 Return to debug level 210. 34 Return to debug level 209. 35 Return to debug level 208. 36 Return to debug level 207. 37 Return to debug level 206. 38 Return to debug level 205. 39 Return to debug level 204. 40 Return to debug level 203. 41 Return to debug level 202. 42 Return to debug level 201. 43 Return to debug level 200. 44 Return to debug level 199. 45 Return to debug level 198. 46 Return to debug level 197. 47 Return to debug level 196. 48 Return to debug level 195. 49 Return to debug level 194. 50 Return to debug level 193. 51 Return to debug level 192. 52 Return to debug level 191. 53 Return to debug level 190. 54 Return to debug level 189. 55 Return to debug level 188. 56 Return to debug level 187. 57 Return to debug level 186. 58 Return to debug level 185. 59 Return to debug level 184. 60 Return to debug level 183. 61 Return to debug level 182. 62 Return to debug level 181. 63 Return to debug level 180. 64 Return to debug level 179. 65 Return to debug level 178. 66 Return to debug level 177. 67 Return to debug level 176. 68 Return to debug level 175. 69 Return to debug level 174. 70 Return to debug level 173. 71 Return to debug level 172. 72 Return to debug level 171. 73 Return to debug level 170. 74 Return to debug level 169. 75 Return to debug level 168. 76 Return to debug level 167. 77 Return to debug level 166. 78 Return to debug level 165. 79 Return to debug level 164. 80 Return to debug level 163. 81 Return to debug level 162. 82 Return to debug level 161. 83 Return to debug level 160. 84 Return to debug level 159. 85 Return to debug level 158. 86 Return to debug level 157. 87 Return to debug level 156. 88 Return to debug level 155. 89 Return to debug level 154. 90 Return to debug level 153. 91 Return to debug level 152. 92 Return to debug level 151. 93 Return to debug level 150. 94 Return to debug level 149. 95 Return to debug level 148. 96 Return to debug level 147. 97 Return to debug level 146. 98 Return to debug level 145. 99 Return to debug level 144. 100 Return to debug level 143. 101 Return to debug level 142. 102 Return to debug level 141. 103 Return to debug level 140. 104 Return to debug level 139. 105 Return to debug level 138. 106 Return to debug level 137. 107 Return to debug level 136. 108 Return to debug level 135. 109 Return to debug level 134. 110 Return to debug level 133. 111 Return to debug level 132. 112 Return to debug level 131. 113 Return to debug level 130. 114 Return to debug level 129. 115 Return to debug level 128. 116 Return to debug level 127. 117 Return to debug level 126. 118 Return to debug level 125. 119 Return to debug level 124. 120 Return to debug level 123. 121 Return to debug level 122. 122 Return to debug level 121. 123 Return to debug level 120. 124 Return to debug level 119. 125 Return to debug level 118. 126 Return to debug level 117. 127 Return to debug level 116. 128 Return to debug level 115. 129 Return to debug level 114. 130 Return to debug level 113. 131 Return to debug level 112. 132 Return to debug level 111. 133 Return to debug level 110. 134 Return to debug level 109. 135 Return to debug level 108. 136 Return to debug level 107. 137 Return to debug level 106. 138 Return to debug level 105. 139 Return to debug level 104. 140 Return to debug level 103. 141 Return to debug level 102. 142 Return to debug level 101. 143 Return to debug level 100. 144 Return to debug level 99. 145 Return to debug level 98. 146 Return to debug level 97. 147 Return to debug level 96. 148 Return to debug level 95. 149 Return to debug level 94. 150 Return to debug level 93. 151 Return to debug level 92. 152 Return to debug level 91. 153 Return to debug level 90. 154 Return to debug level 89. 155 Return to debug level 88. 156 Return to debug level 87. 157 Return to debug level 86. 158 Return to debug level 85. 159 Return to debug level 84. 160 Return to debug level 83. 161 Return to debug level 82. 162 Return to debug level 81. 163 Return to debug level 80. 164 Return to debug level 79. 165 Return to debug level 78. 166 Return to debug level 77. 167 Return to debug level 76. 168 Return to debug level 75. 169 Return to debug level 74. 170 Return to debug level 73. 171 Return to debug level 72. 172 Return to debug level 71. 173 Return to debug level 70. 174 Return to debug level 69. 175 Return to debug level 68. 176 Return to debug level 67. 177 Return to debug level 66. 178 Return to debug level 65. 179 Return to debug level 64. 180 Return to debug level 63. 181 Return to debug level 62. 182 Return to debug level 61. 183 Return to debug level 60. 184 Return to debug level 59. 185 Return to debug level 58. 186 Return to debug level 57. 187 Return to debug level 56. 188 Return to debug level 55. 189 Return to debug level 54. 190 Return to debug level 53. 191 Return to debug level 52. 192 Return to debug level 51. 193 Return to debug level 50. 194 Return to debug level 49. 195 Return to debug level 48. 196 Return to debug level 47. 197 Return to debug level 46. 198 Return to debug level 45. 199 Return to debug level 44. 200 Return to debug level 43. 201 Return to debug level 42. 202 Return to debug level 41. 203 Return to debug level 40. 204 Return to debug level 39. 205 Return to debug level 38. 206 Return to debug level 37. 207 Return to debug level 36. 208 Return to debug level 35. 209 Return to debug level 34. 210 Return to debug level 33. 211 Return to debug level 32. 212 Return to debug level 31. 213 Return to debug level 30. 214 Return to debug level 29. 215 Return to debug level 28. 216 Return to debug level 27. 217 Return to debug level 26. 218 Return to debug level 25. 219 Return to debug level 24. 220 Return to debug level 23. 221 Return to debug level 22. 222 Return to debug level 21. 223 Return to debug level 20. 224 Return to debug level 19. 225 Return to debug level 18. 226 Return to debug level 17. 227 Return to debug level 16. 228 Return to debug level 15. 229 Return to debug level 14. 230 Return to debug level 13. 231 Return to debug level 12. 232 Return to debug level 11. 233 Return to debug level 10. 234 Return to debug level 9. 235 Return to debug level 8. 236 Return to debug level 7. 237 Return to debug level 6. 238 Return to debug level 5. 239 Return to debug level 4. 240 Return to debug level 3. 241 Return to debug level 2. 242 Return to debug level 1. 243 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 243. 2 Return to debug level 242. 3 Return to debug level 241. 4 Return to debug level 240. 5 Return to debug level 239. 6 Return to debug level 238. 7 Return to debug level 237. 8 Return to debug level 236. 9 Return to debug level 235. 10 Return to debug level 234. 11 Return to debug level 233. 12 Return to debug level 232. 13 Return to debug level 231. 14 Return to debug level 230. 15 Return to debug level 229. 16 Return to debug level 228. 17 Return to debug level 227. 18 Return to debug level 226. 19 Return to debug level 225. 20 Return to debug level 224. 21 Return to debug level 223. 22 Return to debug level 222. 23 Return to debug level 221. 24 Return to debug level 220. 25 Return to debug level 219. 26 Return to debug level 218. 27 Return to debug level 217. 28 Return to debug level 216. 29 Return to debug level 215. 30 Return to debug level 214. 31 Return to debug level 213. 32 Return to debug level 212. 33 Return to debug level 211. 34 Return to debug level 210. 35 Return to debug level 209. 36 Return to debug level 208. 37 Return to debug level 207. 38 Return to debug level 206. 39 Return to debug level 205. 40 Return to debug level 204. 41 Return to debug level 203. 42 Return to debug level 202. 43 Return to debug level 201. 44 Return to debug level 200. 45 Return to debug level 199. 46 Return to debug level 198. 47 Return to debug level 197. 48 Return to debug level 196. 49 Return to debug level 195. 50 Return to debug level 194. 51 Return to debug level 193. 52 Return to debug level 192. 53 Return to debug level 191. 54 Return to debug level 190. 55 Return to debug level 189. 56 Return to debug level 188. 57 Return to debug level 187. 58 Return to debug level 186. 59 Return to debug level 185. 60 Return to debug level 184. 61 Return to debug level 183. 62 Return to debug level 182. 63 Return to debug level 181. 64 Return to debug level 180. 65 Return to debug level 179. 66 Return to debug level 178. 67 Return to debug level 177. 68 Return to debug level 176. 69 Return to debug level 175. 70 Return to debug level 174. 71 Return to debug level 173. 72 Return to debug level 172. 73 Return to debug level 171. 74 Return to debug level 170. 75 Return to debug level 169. 76 Return to debug level 168. 77 Return to debug level 167. 78 Return to debug level 166. 79 Return to debug level 165. 80 Return to debug level 164. 81 Return to debug level 163. 82 Return to debug level 162. 83 Return to debug level 161. 84 Return to debug level 160. 85 Return to debug level 159. 86 Return to debug level 158. 87 Return to debug level 157. 88 Return to debug level 156. 89 Return to debug level 155. 90 Return to debug level 154. 91 Return to debug level 153. 92 Return to debug level 152. 93 Return to debug level 151. 94 Return to debug level 150. 95 Return to debug level 149. 96 Return to debug level 148. 97 Return to debug level 147. 98 Return to debug level 146. 99 Return to debug level 145. 100 Return to debug level 144. 101 Return to debug level 143. 102 Return to debug level 142. 103 Return to debug level 141. 104 Return to debug level 140. 105 Return to debug level 139. 106 Return to debug level 138. 107 Return to debug level 137. 108 Return to debug level 136. 109 Return to debug level 135. 110 Return to debug level 134. 111 Return to debug level 133. 112 Return to debug level 132. 113 Return to debug level 131. 114 Return to debug level 130. 115 Return to debug level 129. 116 Return to debug level 128. 117 Return to debug level 127. 118 Return to debug level 126. 119 Return to debug level 125. 120 Return to debug level 124. 121 Return to debug level 123. 122 Return to debug level 122. 123 Return to debug level 121. 124 Return to debug level 120. 125 Return to debug level 119. 126 Return to debug level 118. 127 Return to debug level 117. 128 Return to debug level 116. 129 Return to debug level 115. 130 Return to debug level 114. 131 Return to debug level 113. 132 Return to debug level 112. 133 Return to debug level 111. 134 Return to debug level 110. 135 Return to debug level 109. 136 Return to debug level 108. 137 Return to debug level 107. 138 Return to debug level 106. 139 Return to debug level 105. 140 Return to debug level 104. 141 Return to debug level 103. 142 Return to debug level 102. 143 Return to debug level 101. 144 Return to debug level 100. 145 Return to debug level 99. 146 Return to debug level 98. 147 Return to debug level 97. 148 Return to debug level 96. 149 Return to debug level 95. 150 Return to debug level 94. 151 Return to debug level 93. 152 Return to debug level 92. 153 Return to debug level 91. 154 Return to debug level 90. 155 Return to debug level 89. 156 Return to debug level 88. 157 Return to debug level 87. 158 Return to debug level 86. 159 Return to debug level 85. 160 Return to debug level 84. 161 Return to debug level 83. 162 Return to debug level 82. 163 Return to debug level 81. 164 Return to debug level 80. 165 Return to debug level 79. 166 Return to debug level 78. 167 Return to debug level 77. 168 Return to debug level 76. 169 Return to debug level 75. 170 Return to debug level 74. 171 Return to debug level 73. 172 Return to debug level 72. 173 Return to debug level 71. 174 Return to debug level 70. 175 Return to debug level 69. 176 Return to debug level 68. 177 Return to debug level 67. 178 Return to debug level 66. 179 Return to debug level 65. 180 Return to debug level 64. 181 Return to debug level 63. 182 Return to debug level 62. 183 Return to debug level 61. 184 Return to debug level 60. 185 Return to debug level 59. 186 Return to debug level 58. 187 Return to debug level 57. 188 Return to debug level 56. 189 Return to debug level 55. 190 Return to debug level 54. 191 Return to debug level 53. 192 Return to debug level 52. 193 Return to debug level 51. 194 Return to debug level 50. 195 Return to debug level 49. 196 Return to debug level 48. 197 Return to debug level 47. 198 Return to debug level 46. 199 Return to debug level 45. 200 Return to debug level 44. 201 Return to debug level 43. 202 Return to debug level 42. 203 Return to debug level 41. 204 Return to debug level 40. 205 Return to debug level 39. 206 Return to debug level 38. 207 Return to debug level 37. 208 Return to debug level 36. 209 Return to debug level 35. 210 Return to debug level 34. 211 Return to debug level 33. 212 Return to debug level 32. 213 Return to debug level 31. 214 Return to debug level 30. 215 Return to debug level 29. 216 Return to debug level 28. 217 Return to debug level 27. 218 Return to debug level 26. 219 Return to debug level 25. 220 Return to debug level 24. 221 Return to debug level 23. 222 Return to debug level 22. 223 Return to debug level 21. 224 Return to debug level 20. 225 Return to debug level 19. 226 Return to debug level 18. 227 Return to debug level 17. 228 Return to debug level 16. 229 Return to debug level 15. 230 Return to debug level 14. 231 Return to debug level 13. 232 Return to debug level 12. 233 Return to debug level 11. 234 Return to debug level 10. 235 Return to debug level 9. 236 Return to debug level 8. 237 Return to debug level 7. 238 Return to debug level 6. 239 Return to debug level 5. 240 Return to debug level 4. 241 Return to debug level 3. 242 Return to debug level 2. 243 Return to debug level 1. 244 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Broken at FUN%8887%168. 1 (abort) Return to debug level 244. 2 Return to debug level 243. 3 Return to debug level 242. 4 Return to debug level 241. 5 Return to debug level 240. 6 Return to debug level 239. 7 Return to debug level 238. 8 Return to debug level 237. 9 Return to debug level 236. 10 Return to debug level 235. 11 Return to debug level 234. 12 Return to debug level 233. 13 Return to debug level 232. 14 Return to debug level 231. 15 Return to debug level 230. 16 Return to debug level 229. 17 Return to debug level 228. 18 Return to debug level 227. 19 Return to debug level 226. 20 Return to debug level 225. 21 Return to debug level 224. 22 Return to debug level 223. 23 Return to debug level 222. 24 Return to debug level 221. 25 Return to debug level 220. 26 Return to debug level 219. 27 Return to debug level 218. 28 Return to debug level 217. 29 Return to debug level 216. 30 Return to debug level 215. 31 Return to debug level 214. 32 Return to debug level 213. 33 Return to debug level 212. 34 Return to debug level 211. 35 Return to debug level 210. 36 Return to debug level 209. 37 Return to debug level 208. 38 Return to debug level 207. 39 Return to debug level 206. 40 Return to debug level 205. 41 Return to debug level 204. 42 Return to debug level 203. 43 Return to debug level 202. 44 Return to debug level 201. 45 Return to debug level 200. 46 Return to debug level 199. 47 Return to debug level 198. 48 Return to debug level 197. 49 Return to debug level 196. 50 Return to debug level 195. 51 Return to debug level 194. 52 Return to debug level 193. 53 Return to debug level 192. 54 Return to debug level 191. 55 Return to debug level 190. 56 Return to debug level 189. 57 Return to debug level 188. 58 Return to debug level 187. 59 Return to debug level 186. 60 Return to debug level 185. 61 Return to debug level 184. 62 Return to debug level 183. 63 Return to debug level 182. 64 Return to debug level 181. 65 Return to debug level 180. 66 Return to debug level 179. 67 Return to debug level 178. 68 Return to debug level 177. 69 Return to debug level 176. 70 Return to debug level 175. 71 Return to debug level 174. 72 Return to debug level 173. 73 Return to debug level 172. 74 Return to debug level 171. 75 Return to debug level 170. 76 Return to debug level 169. 77 Return to debug level 168. 78 Return to debug level 167. 79 Return to debug level 166. 80 Return to debug level 165. 81 Return to debug level 164. 82 Return to debug level 163. 83 Return to debug level 162. 84 Return to debug level 161. 85 Return to debug level 160. 86 Return to debug level 159. 87 Return to debug level 158. 88 Return to debug level 157. 89 Return to debug level 156. 90 Return to debug level 155. 91 Return to debug level 154. 92 Return to debug level 153. 93 Return to debug level 152. 94 Return to debug level 151. 95 Return to debug level 150. 96 Return to debug level 149. 97 Return to debug level 148. 98 Return to debug level 147. 99 Return to debug level 146. 100 Return to debug level 145. 101 Return to debug level 144. 102 Return to debug level 143. 103 Return to debug level 142. 104 Return to debug level 141. 105 Return to debug level 140. 106 Return to debug level 139. 107 Return to debug level 138. 108 Return to debug level 137. 109 Return to debug level 136. 110 Return to debug level 135. 111 Return to debug level 134. 112 Return to debug level 133. 113 Return to debug level 132. 114 Return to debug level 131. 115 Return to debug level 130. 116 Return to debug level 129. 117 Return to debug level 128. 118 Return to debug level 127. 119 Return to debug level 126. 120 Return to debug level 125. 121 Return to debug level 124. 122 Return to debug level 123. 123 Return to debug level 122. 124 Return to debug level 121. 125 Return to debug level 120. 126 Return to debug level 119. 127 Return to debug level 118. 128 Return to debug level 117. 129 Return to debug level 116. 130 Return to debug level 115. 131 Return to debug level 114. 132 Return to debug level 113. 133 Return to debug level 112. 134 Return to debug level 111. 135 Return to debug level 110. 136 Return to debug level 109. 137 Return to debug level 108. 138 Return to debug level 107. 139 Return to debug level 106. 140 Return to debug level 105. 141 Return to debug level 104. 142 Return to debug level 103. 143 Return to debug level 102. 144 Return to debug level 101. 145 Return to debug level 100. 146 Return to debug level 99. 147 Return to debug level 98. 148 Return to debug level 97. 149 Return to debug level 96. 150 Return to debug level 95. 151 Return to debug level 94. 152 Return to debug level 93. 153 Return to debug level 92. 154 Return to debug level 91. 155 Return to debug level 90. 156 Return to debug level 89. 157 Return to debug level 88. 158 Return to debug level 87. 159 Return to debug level 86. 160 Return to debug level 85. 161 Return to debug level 84. 162 Return to debug level 83. 163 Return to debug level 82. 164 Return to debug level 81. 165 Return to debug level 80. 166 Return to debug level 79. 167 Return to debug level 78. 168 Return to debug level 77. 169 Return to debug level 76. 170 Return to debug level 75. 171 Return to debug level 74. 172 Return to debug level 73. 173 Return to debug level 72. 174 Return to debug level 71. 175 Return to debug level 70. 176 Return to debug level 69. 177 Return to debug level 68. 178 Return to debug level 67. 179 Return to debug level 66. 180 Return to debug level 65. 181 Return to debug level 64. 182 Return to debug level 63. 183 Return to debug level 62. 184 Return to debug level 61. 185 Return to debug level 60. 186 Return to debug level 59. 187 Return to debug level 58. 188 Return to debug level 57. 189 Return to debug level 56. 190 Return to debug level 55. 191 Return to debug level 54. 192 Return to debug level 53. 193 Return to debug level 52. 194 Return to debug level 51. 195 Return to debug level 50. 196 Return to debug level 49. 197 Return to debug level 48. 198 Return to debug level 47. 199 Return to debug level 46. 200 Return to debug level 45. 201 Return to debug level 44. 202 Return to debug level 43. 203 Return to debug level 42. 204 Return to debug level 41. 205 Return to debug level 40. 206 Return to debug level 39. 207 Return to debug level 38. 208 Return to debug level 37. 209 Return to debug level 36. 210 Return to debug level 35. 211 Return to debug level 34. 212 Return to debug level 33. 213 Return to debug level 32. 214 Return to debug level 31. 215 Return to debug level 30. 216 Return to debug level 29. 217 Return to debug level 28. 218 Return to debug level 27. 219 Return to debug level 26. 220 Return to debug level 25. 221 Return to debug level 24. 222 Return to debug level 23. 223 Return to debug level 22. 224 Return to debug level 21. 225 Return to debug level 20. 226 Return to debug level 19. 227 Return to debug level 18. 228 Return to debug level 17. 229 Return to debug level 16. 230 Return to debug level 15. 231 Return to debug level 14. 232 Return to debug level 13. 233 Return to debug level 12. 234 Return to debug level 11. 235 Return to debug level 10. 236 Return to debug level 9. 237 Return to debug level 8. 238 Return to debug level 7. 239 Return to debug level 6. 240 Return to debug level 5. 241 Return to debug level 4. 242 Return to debug level 3. 243 Return to debug level 2. 244 Return to debug level 1. 245 Return to top level. >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Error:ERROR: Caught fatal error [memory may be damaged]: Segmentation violation. Fast links are on: do (si::use-fast-links nil) for debugging Signalled by "AN ANONYMOUS FUNCTION". Segmentation violation: c stack ok:signalling error Unrecoverable error: bind stack overflow. evaluation failed lisp error evaluation failed load -- transc.ml make[5]: *** [Makefile:9: TRANSC.th] Error 1 make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/theories' make[4]: *** [Makefile:24: all] Error 2 make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window' rm -f win.th echo 'set_flag(`abort_when_fail`,true);;' \ 'loadt `mk_win_th`;;' \ 'quit ();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void |- !a b. a <== b = b ==> a () : void File mk_win_th loaded () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'compilet `ml_ext`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void le = - : (int -> int -> bool) () : void ge = - : (int -> int -> bool) prefix = - : (* list -> * list -> bool) suffix = - : (* list -> * list -> bool) after = - : (* list -> * list -> * list) before = - : (* list -> * list -> * list) index = - : ((* -> bool) -> * list -> int) merge = - : (((* # *) -> bool) -> * list -> * list -> * list) best = - : (((* # *) -> bool) -> * list -> *) first = - : (int -> * list -> * list) last = - : (int -> * list -> * list) New constructors declared: POINTER : (((void -> *) # (* -> void) # (void -> void)) -> * pointer) value = - : (* pointer -> *) store = - : (* pointer -> * -> void) dispose = - : (* pointer -> void) is_nil = - : (* pointer -> bool) ptrtype = - : (string -> string -> void) New constructors declared: SIGNAL : (((* -> void) # (void -> void) # ((* -> void) -> void)) -> * signal) signal = - : (* signal -> * -> void) clear = - : (* signal -> void) handle = - : (* signal -> (* -> void) -> void) sigtype = - : (string -> string -> void) Calling Lisp compiler File ml_ext compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'load_theory `win`;;' \ 'compilet `thms`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory win loaded () : void PMI_DEF = |- !a b. a <== b = b ==> a IMP_REFL_THM = |- !x. x ==> x IMP_TRANS_THM = |- !x y z. (x ==> y) /\ (y ==> z) ==> x ==> z PMI_REFL_THM = |- !x. x <== x PMI_TRANS_THM = |- !x y z. x <== y /\ y <== z ==> x <== z Calling Lisp compiler File thms compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'load_theory `win`;;' \ 'loadf `thms`;;' \ 'compilet `hol_ext`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory win loaded () : void .....() : void goal_frees = - : (goal -> term list) term_mem = - : (term -> term list -> bool) term_subset = - : (term list -> term list -> bool) term_setify = - : (term list -> term list) term_intersect = - : (term list -> term list -> term list) term_union = - : (term list -> term list -> term list) better_thm = - : (thm -> thm -> bool) better_goal = - : (goal -> goal -> bool) thm_subset = - : (thm list -> thm list -> bool) thm_set_equal = - : (thm list -> thm list -> bool) goal_subset = - : (goal list -> goal list -> bool) goal_set_equal = - : (goal list -> goal list -> bool) thm_setify = - : (thm list -> thm list) goal_setify = - : (goal list -> goal list) is_fun = - : (term -> bool) dom = - : (term -> type) ran = - : (term -> type) is_trueimp = - : (term -> bool) is_pmi = - : (term -> bool) dest_pmi = - : (term -> (term # term)) IMP_PMI_CONV = - : conv IMP_PMI = - : (thm -> thm) PMI_IMP_CONV = - : conv PMI_IMP = - : (thm -> thm) IMP_REFL = - : conv PMI_REFL = - : conv PMI_TRANS = - : (thm -> thm -> thm) EXISTS_PMI = - : (term -> thm -> thm) DNEG_THM = |- !t. ~~t = t NOT_DISJ_THM = |- !t1 t2. ~(t1 \/ t2) = ~t1 /\ ~t2 NOT_IMP_THM = |- !t1 t2. ~(t1 ==> t2) = t1 /\ ~t2 NOT_PMI_THM = |- !t1 t2. ~t1 <== t2 = ~t1 /\ t2 COND_F_THM = |- !t1 t2. (t1 => t2 | F) = t1 /\ t2 SMASH = - : (thm -> thm list) - : (thm -> thm list) SMASH = - : (thm -> thm list) smash = - : (term -> term list) prove_hyp = - : (goal -> goal -> goal) true_tm = "T" : term false_tm = "F" : term imp_tm = "$==>" : term pmi_tm = "$<==" : term equiv_tm = "$=" : term Calling Lisp compiler File hol_ext compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'load_theory `win`;;' \ 'loadf `thms`;;' \ 'loadf `hol_ext`;;' \ 'compilet `tables`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory win loaded () : void .....() : void .......................................() : void FAST_MATCH_MP = - : (thm -> thm -> thm) refl_ptr = - : conv add_refl = - : (thm -> void) reflexive = - : conv trans_ptr = - : (thm -> thm) add_trans = - : (thm -> void) transitive = - : (thm -> thm) known_relation = - : (term -> bool) weakenings = [] : thm list weak_table = [] : (term # term list) list check_weak_thm = - : (thm -> (term # term)) MATCH_IMP_TRANS = - : (thm -> thm -> thm) stronger = - : ((term # term) -> bool) weaker = - : ((term # term) -> bool) match_type = - : (term -> term -> (type # type) list) rel_str = - : (term -> term list) add_weak = - : (thm -> void) weaken = - : (term -> thm -> thm) relative_strengths = - : (term -> term list) add_relation = - : ((thm # thm) -> void) () : void () : void () : void ((-), (-), (-), (-), (-), -) : (((thm # thm) -> void) # conv # (thm -> thm) # (thm -> void) # (term -> thm -> thm) # (term -> term list)) add_relation = - : ((thm # thm) -> void) reflexive = - : conv transitive = - : (thm -> thm) add_weak = - : (thm -> void) weaken = - : (term -> thm -> thm) relative_strengths = - : (term -> term list) New constructors declared: RATOR : path_elt RAND : path_elt BODY : path_elt type path defined traverse = - : (path -> term -> term) New constructors declared: FOCUS_PATH : (path -> win_path) CONTEXT_PATH : ((term # path) -> win_path) type window_rule defined New constructors declared: TREE : ((((* list # **) -> void) # (* list -> (* list # **) list) # (void -> void)) -> (*,**) tree) plant = - : ((*,**) tree -> (* list # **) -> void) harvest = - : ((*,**) tree -> * list -> (* list # **) list) purge = - : ((*,**) tree -> void -> void) newtree = - : (void -> (path_elt,((term -> bool) # (term -> term -> term) # (term -> term -> term) # (term -> thm list -> thm list) # (term -> term list) # (term -> thm -> thm))) tree) rule_tree = TREE((-), (-), -) : (path_elt,((term -> bool) # (term -> term -> term) # (term -> term -> term) # (term -> thm list -> thm list) # (term -> term list) # (term -> thm -> thm))) tree store_rule = - : (window_rule -> void) search_rule = - : (path -> window_rule list) empty_rules = - : (void -> void) ((-), (-), -) : ((window_rule -> void) # (path -> window_rule list) # (void -> void)) store_rule = - : (window_rule -> void) search_rule = - : (path -> window_rule list) empty_rules = - : (void -> void) Calling Lisp compiler File tables compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'load_theory `win`;;' \ 'loadf `thms`;;' \ 'loadf `hol_ext`;;' \ 'loadf `tables`;;' \ 'compilet `basic_close`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory win loaded () : void .....() : void .......................................() : void .....................................() : void RATOR_CLOSE = - : (term -> thm -> thm) RAND_CLOSE = - : (term -> thm -> thm) BODY_CLOSE = - : (term -> thm -> thm) COND1_THM = |- !R A B C D. (!x. R x x) ==> (A ==> R D B) ==> R(A => D | C)(A => B | C) COND1_CLOSE = - : (term -> thm -> thm) COND2_THM = |- !R A B C D. (!x. R x x) ==> (~A ==> R D C) ==> R(A => B | D)(A => B | C) COND2_CLOSE = - : (term -> thm -> thm) BODY2_THM = |- !c f g r. (!v. (v = c) ==> r(f v)(g v)) ==> r(f c)(g c) BODY2_CLOSE = - : (term -> thm -> thm) LET_THM = |- !c f g r. (!v. (v = c) ==> r(f v)(g v)) ==> r(LET f c)(LET g c) LET_CLOSE = - : (term -> thm -> thm) () : void () : void () : void () : void () : void () : void () : void Section basic_close ended Calling Lisp compiler File basic_close compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'load_theory `win`;;' \ 'loadf `thms`;;' \ 'loadf `hol_ext`;;' \ 'loadf `tables`;;' \ 'compilet `eq_close`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory win loaded () : void .....() : void .......................................() : void .....................................() : void CONJ1_THM = |- !A B C. (B ==> (C = A)) ==> (C /\ B = A /\ B) CONJ1_CLOSE = - : (term -> thm -> thm) CONJ2_THM = |- !A B C. (A ==> (C = B)) ==> (A /\ C = A /\ B) CONJ2_CLOSE = - : (term -> thm -> thm) IMP1_THM = |- !A B C. (~B ==> (C = A)) ==> (C ==> B = A ==> B) IMP1_CLOSE = - : (term -> thm -> thm) IMP2_THM = |- !A B C. (A ==> (C = B)) ==> (A ==> C = A ==> B) IMP2_CLOSE = - : (term -> thm -> thm) PMI1_THM = |- !A B C. (B ==> (C = A)) ==> (C <== B = A <== B) PMI1_CLOSE = - : (term -> thm -> thm) PMI2_THM = |- !A B C. (~A ==> (C = B)) ==> (A <== C = A <== B) PMI2_CLOSE = - : (term -> thm -> thm) DISJ1_THM = |- !A B C. (~B ==> (C = A)) ==> (C \/ B = A \/ B) DISJ1_CLOSE = - : (term -> thm -> thm) DISJ2_THM = |- !A B C. (~A ==> (C = B)) ==> (A \/ C = A \/ B) DISJ2_CLOSE = - : (term -> thm -> thm) () : void () : void () : void () : void () : void () : void () : void () : void Section eq_close ended Calling Lisp compiler File eq_close compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'load_theory `win`;;' \ 'loadf `thms`;;' \ 'loadf `hol_ext`;;' \ 'loadf `tables`;;' \ 'compilet `imp_close`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory win loaded () : void .....() : void .......................................() : void .....................................() : void IMP_CONJ1_THM = |- !A B C. (B ==> C ==> A) ==> C /\ B ==> A /\ B IMP_CONJ1_CLOSE = - : (term -> thm -> thm) IMP_CONJ2_THM = |- !A B C. (A ==> C ==> B) ==> A /\ C ==> A /\ B IMP_CONJ2_CLOSE = - : (term -> thm -> thm) IMP_IMP1_THM = |- !A B C. (~B ==> C <== A) ==> (C ==> B) ==> A ==> B IMP_IMP1_CLOSE = - : (term -> thm -> thm) IMP_IMP2_THM = |- !A B C. (A ==> C ==> B) ==> (A ==> C) ==> A ==> B IMP_IMP2_CLOSE = - : (term -> thm -> thm) IMP_PMI1_THM = |- !A B C. (B ==> C ==> A) ==> C <== B ==> A <== B IMP_PMI1_CLOSE = - : (term -> thm -> thm) IMP_PMI2_THM = |- !A B C. (~A ==> C <== B) ==> A <== C ==> A <== B IMP_PMI2_CLOSE = - : (term -> thm -> thm) IMP_DISJ1_THM = |- !A B C. (~B ==> C ==> A) ==> C \/ B ==> A \/ B IMP_DISJ1_CLOSE = - : (term -> thm -> thm) IMP_DISJ2_THM = |- !A B C. (~A ==> C ==> B) ==> A \/ C ==> A \/ B IMP_DISJ2_CLOSE = - : (term -> thm -> thm) IMP_NEG_THM = |- !A B. B <== A ==> ~B ==> ~A IMP_NEG_CLOSE = - : (term -> thm -> thm) IMP_ALL_CLOSE = - : (term -> thm -> thm) IMP_EXISTS_CLOSE = - : (term -> thm -> thm) PMI_CONJ1_THM = |- !A B C. (B ==> C <== A) ==> (C /\ B) <== (A /\ B) PMI_CONJ1_CLOSE = - : (term -> thm -> thm) PMI_CONJ2_THM = |- !A B C. (A ==> C <== B) ==> (A /\ C) <== (A /\ B) PMI_CONJ2_CLOSE = - : (term -> thm -> thm) PMI_IMP1_THM = |- !A B C. (~B ==> C ==> A) ==> (C ==> B) <== (A ==> B) PMI_IMP1_CLOSE = - : (term -> thm -> thm) PMI_IMP2_THM = |- !A B C. (A ==> C <== B) ==> (A ==> C) <== (A ==> B) PMI_IMP2_CLOSE = - : (term -> thm -> thm) PMI_PMI1_THM = |- !A B C. (B ==> C <== A) ==> (C <== B) <== (A <== B) PMI_PMI1_CLOSE = - : (term -> thm -> thm) PMI_PMI2_THM = |- !A B C. (~A ==> C ==> B) ==> (A <== C) <== (A <== B) PMI_PMI2_CLOSE = - : (term -> thm -> thm) PMI_DISJ1_THM = |- !A B C. (~B ==> C <== A) ==> (C \/ B) <== (A \/ B) PMI_DISJ1_CLOSE = - : (term -> thm -> thm) PMI_DISJ2_THM = |- !A B C. (~A ==> C <== B) ==> (A \/ C) <== (A \/ B) PMI_DISJ2_CLOSE = - : (term -> thm -> thm) PMI_NEG_THM = |- !A B. (B ==> A) ==> (~B) <== (~A) PMI_NEG_CLOSE = - : (term -> thm -> thm) PMI_ALL_CLOSE = - : (term -> thm -> thm) PMI_EXISTS_CLOSE = - : (term -> thm -> thm) () : void () : void () : void () : void () : void () : void () : void () : void () : void () : void () : void () : void () : void () : void () : void () : void () : void () : void () : void () : void () : void () : void Calling Lisp compiler File imp_close compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'loadf `ml_ext`;;' \ 'load_theory `win`;;' \ 'loadf `thms`;;' \ 'loadf `hol_ext`;;' \ 'loadf `tables`;;' \ 'compilet `win`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ...................() : void Theory win loaded () : void .....() : void .......................................() : void .....................................() : void type window defined win_thm = - : (window -> thm) relation = - : (window -> term) focus = - : (window -> term) origin = - : (window -> term) bound = - : (window -> term list) hyp_thms = - : (window -> thm list) hypotheses = - : (window -> term list) disp_hypotheses = - : (window -> term list) all_hypotheses = - : (window -> term list) used_hypotheses = - : (window -> term list) lemma_thms = - : (window -> thm list) suppositions = - : (window -> goal list) conjectures = - : (window -> term list) used_conjectures = - : (window -> term list) lemmas = - : (window -> term list) context = - : (window -> term list) make_win = - : (term -> goal list -> term list -> thm list -> thm list -> window) create_win = - : (term -> term list -> thm list -> window) transform = - : (term -> term list -> thm list -> (window -> window) -> thm) get_thm = - : (term -> window -> thm) add_suppose = - : (goal -> window -> window) conjecture = - : (term -> window -> window) add_theorem = - : (thm -> window -> window) transform_win = - : (thm -> window -> window) match_transform_win = - : (thm -> window -> window) convert_win = - : (conv -> window -> window) rule_win = - : ((thm -> thm) -> window -> window) thm_rule_win = - : ((thm -> thm) -> window -> window) foc_rule_win = - : (conv -> window -> window) tactic_win = - : (tactic -> window -> window) gen_rewrite_win = - : ((conv -> conv) -> thm list -> thm list -> window -> window) pure_rewrite_win = - : (thm list -> window -> window) rewrite_win = - : (thm list -> window -> window) pure_once_rewrite_win = - : (thm list -> window -> window) once_rewrite_win = - : (thm list -> window -> window) pure_asm_rewrite_win = - : (thm list -> window -> window) asm_rewrite_win = - : (thm list -> window -> window) pure_once_asm_rewrite_win = - : (thm list -> window -> window) once_asm_rewrite_win = - : (thm list -> window -> window) filter_pure_asm_rewrite_win = - : ((term -> bool) -> thm list -> window -> window) filter_asm_rewrite_win = - : ((term -> bool) -> thm list -> window -> window) filter_pure_once_asm_rewrite_win = - : ((term -> bool) -> thm list -> window -> window) filter_once_asm_rewrite_win = - : ((term -> bool) -> thm list -> window -> window) transfer_sups_thms = - : (window -> window -> window) open_win_basis = - : (win_path -> window -> (window # (window -> window -> window))) open_context_basis = - : (win_path -> window -> (window # (window -> window -> window))) gen_open_basis = - : (win_path -> window -> (window # (window -> window -> window))) establish_basis = - : (win_path -> window -> (window # (window -> window -> window))) open_win = - : (path -> (window -> window) -> window -> window) open_context = - : (term -> path -> (window -> window) -> window -> window) gen_open_win = - : (win_path -> (window -> window) -> window -> window) establish = - : (term -> (window -> window) -> window -> window) Calling Lisp compiler File win compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'loadf `ml_ext`;;' \ 'load_theory `win`;;' \ 'loadf `thms`;;' \ 'loadf `hol_ext`;;' \ 'loadf `tables`;;' \ 'loadf `win`;;' \ 'compilet `inter`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ...................() : void Theory win loaded () : void .....() : void .......................................() : void .....................................() : void ............................................() : void epoch = - : (int -> * -> * history) present = - : (* history -> *) dodo = - : ((* -> *) -> * history -> * history) undo = - : (* history -> * history) redo = - : (* history -> * history) set_max_hist = - : (int -> * history -> * history) get_max_hist = - : (* history -> int) create_stack = - : (window -> window_stack) change_window = - : ((window -> window) -> window_stack -> window_stack) open_window = - : (win_path -> (win_path -> window -> (window # (window -> window -> window))) -> window_stack -> window_stack) pop_window = - : (window_stack -> window_stack) close_window = - : (window_stack -> window_stack) depth_stack = - : (window_stack -> int) top_window = - : (window_stack -> window) top_path = - : (window_stack -> win_path) bad_conjectures = - : (window_stack -> term list) print_stack = - : (window_stack -> void) () : void - : (string signal -> void) newsig_stk_sig = - : (void -> string signal) () : void - : (void signal -> void) newsig_win_sig = - : (void -> void signal) beg_stack_sig = (-) : string signal end_stack_sig = (-) : string signal set_stack_sig = (-) : string signal psh_win_sig = (-) : void signal pop_win_sig = (-) : void signal cng_win_sig = (-) : void signal () : void - : (window_stack history pointer -> void) new_wshp = - : (void -> window_stack history pointer) stack_table = [] : (string # window_stack history pointer) list cur_nam_st_hist = inr () : ((string # window_stack history pointer) + void) CURRENT_STACK = - : (void -> window_stack) CURRENT_NAME = - : (void -> string) CURRENT_SHP = - : (void -> window_stack history pointer) history_size = 20 : int EPOCH = - : (window_stack -> void) DO = - : ((window_stack -> window_stack) -> void) UNDO = - : (void -> void) REDO = - : (void -> void) SET_MAX_HIST = - : (int -> void list) GET_MAX_HIST = - : (void -> int) BEGIN_STACK = - : (string -> term -> term list -> thm list -> void) END_STACK = - : (string -> void) SET_STACK = - : (string -> void) GET_STACK = - : (string -> window_stack) ALL_STACKS = - : (void -> string list) ((-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), -) : ((void -> window_stack) # (void -> string) # ((window_stack -> window_stack) -> void) # (void -> void) # (void -> void) # (int -> void list) # (void -> int) # (string -> term -> term list -> thm list -> void) # (string -> void) # (string -> void) # (string -> window_stack) # (void -> string list)) CURRENT_STACK = - : (void -> window_stack) CURRENT_NAME = - : (void -> string) DO = - : ((window_stack -> window_stack) -> void) UNDO = - : (void -> void) REDO = - : (void -> void) SET_MAX_HIST = - : (int -> void list) GET_MAX_HIST = - : (void -> int) BEGIN_STACK = - : (string -> term -> term list -> thm list -> void) END_STACK = - : (string -> void) SET_STACK = - : (string -> void) GET_STACK = - : (string -> window_stack) ALL_STACKS = - : (void -> string list) APPLY_OPEN = - : (win_path -> (win_path -> window -> (window # (window -> window -> window))) -> void) APPLY_TRANSFORM = - : ((window -> window) -> void) CLOSE_WIN = - : (void -> void) UNDO_WIN = - : (void -> void) GEN_OPEN_WIN = - : (win_path -> void) OPEN_WIN = - : (path -> void) OPEN_CONTEXT = - : (term -> path -> void) ESTABLISH = - : (term -> void) TOP_WIN = - : (void -> window) BAD_CONJECTURES = - : (void -> term list) TRANSFORM_WIN = - : (thm -> void) MATCH_TRANSFORM_WIN = - : (thm -> void) CONVERT_WIN = - : (conv -> void) RULE_WIN = - : ((thm -> thm) -> void) THM_RULE_WIN = - : ((thm -> thm) -> void) FOC_RULE_WIN = - : (conv -> void) TACTIC_WIN = - : (tactic -> void) ADD_THEOREM = - : (thm -> void) ADD_SUPPOSE = - : (goal -> void) CONJECTURE = - : (term -> void) FOCUS = - : (void -> term) LEMMA_THMS = - : (void -> thm list) WIN_THM = - : (void -> thm) GEN_REWRITE_WIN = - : ((conv -> conv) -> thm list -> thm list -> void) PURE_REWRITE_WIN = - : (thm list -> void) REWRITE_WIN = - : (thm list -> void) PURE_ONCE_REWRITE_WIN = - : (thm list -> void) ONCE_REWRITE_WIN = - : (thm list -> void) PURE_ASM_REWRITE_WIN = - : (thm list -> void) ASM_REWRITE_WIN = - : (thm list -> void) PURE_ONCE_ASM_REWRITE_WIN = - : (thm list -> void) ONCE_ASM_REWRITE_WIN = - : (thm list -> void) FILTER_PURE_ASM_REWRITE_WIN = - : ((term -> bool) -> thm list -> void) FILTER_ASM_REWRITE_WIN = - : ((term -> bool) -> thm list -> void) FILTER_PURE_ONCE_ASM_REWRITE_WIN = - : ((term -> bool) -> thm list -> void) FILTER_ONCE_ASM_REWRITE_WIN = - : ((term -> bool) -> thm list -> void) SAVE_WIN_THM = - : (void -> thm) PRINT_STACK = - : (void -> void) () : void () : void () : void () : void () : void Calling Lisp compiler File inter compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'load_theory `win`;;' \ 'compilet `load_code`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theory win loaded () : void () : void Calling Lisp compiler File load_code compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'compilet `load_window`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool load_window = - : (void -> void) Calling Lisp compiler File load_window compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'compilet `window`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Extending help search path () : void Extending search path () : void Theory win loaded () : void () : void window_version = `Revision: 3.1` : string window Library (Revision: 3.1) loaded. Copyright (c) Jim Grundy 1992 () : void All rights reserved () : void Calling Lisp compiler File window compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'loadf `ml_ext`;;' \ 'load_theory `win`;;' \ 'loadf `thms`;;' \ 'loadf `hol_ext`;;' \ 'loadf `tables`;;' \ 'loadf `win`;;' \ 'loadf `inter`;;' \ 'compilet `xlabel`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ...................() : void Theory win loaded () : void .....() : void .......................................() : void .....................................() : void ............................................() : void ......................................................() : void () : void - : (string pointer -> void) new_strptr = - : (void -> string pointer) set_title = - : (string -> void) label = (-) : string pointer xset_stack = - : (string -> void) xbeg_stack = - : (string -> void) xend_stack = - : (string -> void) () : void () : void () : void () : void Calling Lisp compiler File xlabel compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'loadf `ml_ext`;;' \ 'load_theory `win`;;' \ 'loadf `thms`;;' \ 'loadf `hol_ext`;;' \ 'loadf `tables`;;' \ 'loadf `win`;;' \ 'loadf `inter`;;' \ 'compilet `tactic`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ...................() : void Theory win loaded () : void .....() : void .......................................() : void .....................................() : void ............................................() : void ......................................................() : void open_TAC = - : (path -> thm list -> (window -> window) -> tactic) close_table = [] : (string # window # (window -> window -> window)) list BEGIN_STACK_TAC = - : (string -> path -> thm list -> tactic) END_STACK_TAC = - : (string -> tactic) ((-), -) : ((string -> path -> thm list -> tactic) # (string -> tactic)) BEGIN_STACK_TAC = - : (string -> path -> thm list -> tactic) END_STACK_TAC = - : (string -> tactic) Calling Lisp compiler File tactic compiled () : void #===> library window built make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair' echo 'set_flag(`abort_when_fail`,true);;' \ 'compilet `syn`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool mk_pabs = - : ((term # term) -> term) mk_pforall = - : ((term # term) -> term) mk_pexists = - : ((term # term) -> term) mk_pselect = - : ((term # term) -> term) dest_pabs = - : (term -> (term # term)) dest_pforall = - : (term -> (term # term)) dest_pexists = - : (term -> (term # term)) dest_pselect = - : (term -> (term # term)) is_pabs = - : (term -> bool) is_pforall = - : (term -> bool) is_pexists = - : (term -> bool) is_pselect = - : (term -> bool) rip_pair = - : (term -> term list) is_pvar = - : (term -> bool) pvariant = - : (term list -> term -> term) genlike = - : (term -> term) list_mk_pabs = - : (goal -> term) list_mk_pforall = - : (goal -> term) list_mk_pexists = - : (goal -> term) strip_pabs = - : (term -> goal) strip_pforall = - : (term -> goal) strip_pexists = - : (term -> goal) bndpair = - : (term -> term) pbody = - : (term -> term) occs_in = - : (term -> term -> bool) is_prod = - : (type -> bool) dest_prod = - : (type -> (type # type)) mk_prod = - : ((type # type) -> type) Calling Lisp compiler File syn compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'loadf `syn`;;' \ 'compilet `basic`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ........................() : void MK_PAIR = - : ((thm # thm) -> thm) PABS = - : (term -> thm -> thm) PABS_CONV = - : (conv -> conv) PSUB_CONV = - : (conv -> conv) CURRY_CONV = - : conv UNCURRY_CONV = - : conv PBETA_CONV = - : conv PBETA_RULE = - : (thm -> thm) PBETA_TAC = - : tactic RIGHT_PBETA = - : (thm -> thm) LIST_PBETA_CONV = - : conv RIGHT_LIST_PBETA = - : (thm -> thm) LEFT_PBETA = - : (thm -> thm) LEFT_LIST_PBETA = - : (thm -> thm) UNPBETA_CONV = - : (term -> conv) CURRY_UNCURRY_THM = |- !f. CURRY(UNCURRY f) = f UNCURRY_CURRY_THM = |- !f. UNCURRY(CURRY f) = f PETA_CONV = - : conv PALPHA_CONV = - : (term -> conv) GEN_PALPHA_CONV = - : (term -> conv) PALPHA = - : (term -> conv) paconv = - : (term -> term -> bool) PAIR_CONV = - : (conv -> conv) CURRY_ONE_ONE_THM = |- (CURRY f = CURRY g) = (f = g) UNCURRY_ONE_ONE_THM = |- (UNCURRY f = UNCURRY g) = (f = g) Calling Lisp compiler File basic compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'loadf `syn`;;' \ 'loadf `basic`;;' \ 'compilet `both1`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ........................() : void ........................() : void PFORALL_THM = |- !f. (!x y. f x y) = (!(x,y). f x y) PEXISTS_THM = |- !f. (?x y. f x y) = (?(x,y). f x y) CURRY_FORALL_CONV = - : conv CURRY_EXISTS_CONV = - : conv UNCURRY_FORALL_CONV = - : conv UNCURRY_EXISTS_CONV = - : conv Calling Lisp compiler File both1 compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'loadf `syn`;;' \ 'loadf `basic`;;' \ 'loadf `both1`;;' \ 'compilet `all`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ........................() : void ........................() : void ......() : void PSPEC = - : (term -> thm -> thm) PSPECL = - : (term list -> thm -> thm) IPSPEC = - : (term -> thm -> thm) IPSPECL = - : (term list -> thm -> thm) PSPEC_PAIR = - : (thm -> (term # thm)) PSPEC_ALL = - : (thm -> thm) GPSPEC = - : (thm -> thm) PSPEC_TAC = - : ((term # term) -> tactic) PGEN = - : (term -> thm -> thm) PGENL = - : (term list -> thm -> thm) P_PGEN_TAC = - : (term -> tactic) PGEN_TAC = - : tactic FILTER_PGEN_TAC = - : (term -> tactic) Calling Lisp compiler File all compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'loadf `syn`;;' \ 'loadf `basic`;;' \ 'loadf `both1`;;' \ 'loadf `all`;;' \ 'compilet `exi`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ........................() : void ........................() : void ......() : void .............() : void PEXISTS_CONV = - : conv PSELECT_RULE = - : (thm -> thm) PSELECT_CONV = - : conv PEXISTS_RULE = - : (thm -> thm) PSELECT_INTRO = - : (thm -> thm) PSELECT_ELIM = - : (thm -> (term # thm) -> thm) PEXISTS = - : ((term # term) -> thm -> thm) PCHOOSE = - : ((term # thm) -> thm -> thm) P_PCHOOSE_THEN = - : (term -> thm_tactical) PCHOOSE_THEN = - : thm_tactical P_PCHOOSE_TAC = - : (term -> thm_tactic) PCHOOSE_TAC = - : thm_tactic PEXISTS_TAC = - : (term -> tactic) PEXISTENCE = - : (thm -> thm) PEXISTS_UNIQUE_CONV = - : conv BABY_P_PSKOLEM_CONV = - : (term -> conv) P_PSKOLEM_CONV = - : (term -> conv) - : (term -> conv) P_PSKOLEM_CONV = - : (term -> conv) PSKOLEM_CONV = - : conv Calling Lisp compiler File exi compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'loadf `syn`;;' \ 'loadf `basic`;;' \ 'loadf `both1`;;' \ 'loadf `all`;;' \ 'loadf `exi`;;' \ 'compilet `both2`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ........................() : void ........................() : void ......() : void .............() : void ....................() : void PSTRIP_THM_THEN = - : thm_tactical PSTRIP_ASSUME_TAC = - : thm_tactic PSTRUCT_CASES_TAC = - : thm_tactic PSTRIP_GOAL_THEN = - : (thm_tactic -> tactic) FILTER_PSTRIP_THEN = - : (thm_tactic -> term -> tactic) PSTRIP_TAC = - : tactic FILTER_PSTRIP_TAC = - : (term -> tactic) PEXT = - : (thm -> thm) P_FUN_EQ_CONV = - : (term -> conv) MK_PABS = - : (thm -> thm) HALF_MK_PABS = - : (thm -> thm) MK_PFORALL = - : (thm -> thm) MK_PEXISTS = - : (thm -> thm) MK_PEXISTS = - : (thm -> thm) PFORALL_EQ = - : (term -> thm -> thm) PEXISTS_EQ = - : (term -> thm -> thm) PSELECT_EQ = - : (term -> thm -> thm) LIST_MK_PFORALL = - : (term list -> thm -> thm) LIST_MK_PEXISTS = - : (term list -> thm -> thm) PEXISTS_IMP = - : (term -> thm -> thm) SWAP_PFORALL_CONV = - : conv SWAP_PEXISTS_CONV = - : conv PART_PMATCH = - : ((term -> term) -> thm -> conv) PMATCH_MP_TAC = - : thm_tactic PMATCH_MP = - : (thm -> thm -> thm) Calling Lisp compiler File both2 compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'loadf `syn`;;' \ 'loadf `basic`;;' \ 'compilet `conv`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ........................() : void ........................() : void NOT_FORALL_THM = |- !f. ~(!x. f x) = (?x. ~f x) NOT_EXISTS_THM = |- !f. ~(?x. f x) = (!x. ~f x) NOT_PFORALL_CONV = - : conv NOT_PEXISTS_CONV = - : conv PEXISTS_NOT_CONV = - : conv PFORALL_NOT_CONV = - : conv FORALL_AND_THM = |- !f g. (!x. f x /\ g x) = (!x. f x) /\ (!x. g x) PFORALL_AND_CONV = - : conv EXISTS_OR_THM = |- !f g. (?x. f x \/ g x) = (?x. f x) \/ (?x. g x) PEXISTS_OR_CONV = - : conv AND_PFORALL_CONV = - : conv LEFT_AND_FORALL_THM = |- !Q f. (!x. f x) /\ Q = (!x. f x /\ Q) LEFT_AND_PFORALL_CONV = - : conv RIGHT_AND_FORALL_THM = |- !P g. P /\ (!x. g x) = (!x. P /\ g x) RIGHT_AND_PFORALL_CONV = - : conv OR_PEXISTS_CONV = - : conv LEFT_OR_EXISTS_THM = |- !Q f. (?x. f x) \/ Q = (?x. f x \/ Q) LEFT_OR_PEXISTS_CONV = - : conv RIGHT_OR_EXISTS_THM = |- !P g. P \/ (?x. g x) = (?x. P \/ g x) RIGHT_OR_PEXISTS_CONV = - : conv BOTH_EXISTS_AND_THM = |- !P Q. (?x. P /\ Q) = (?x. P) /\ (?x. Q) LEFT_EXISTS_AND_THM = |- !Q f. (?x. f x /\ Q) = (?x. f x) /\ Q RIGHT_EXISTS_AND_THM = |- !P g. (?x. P /\ g x) = P /\ (?x. g x) PEXISTS_AND_CONV = - : conv AND_PEXISTS_CONV = - : conv LEFT_AND_PEXISTS_CONV = - : conv RIGHT_AND_PEXISTS_CONV = - : conv BOTH_FORALL_OR_THM = |- !P Q. (!x. P \/ Q) = (!x. P) \/ (!x. Q) LEFT_FORALL_OR_THM = |- !Q f. (!x. f x \/ Q) = (!x. f x) \/ Q RIGHT_FORALL_OR_THM = |- !P g. (!x. P \/ g x) = P \/ (!x. g x) PFORALL_OR_CONV = - : conv OR_PFORALL_CONV = - : conv LEFT_OR_PFORALL_CONV = - : conv RIGHT_OR_PFORALL_CONV = - : conv BOTH_FORALL_IMP_THM = |- !P Q. (!x. P ==> Q) = (?x. P) ==> (!x. Q) LEFT_FORALL_IMP_THM = |- !Q f. (!x. f x ==> Q) = (?x. f x) ==> Q RIGHT_FORALL_IMP_THM = |- !P g. (!x. P ==> g x) = P ==> (!x. g x) BOTH_EXISTS_IMP_THM = |- !P Q. (?x. P ==> Q) = (!x. P) ==> (?x. Q) LEFT_EXISTS_IMP_THM = |- !Q f. (?x. f x ==> Q) = (!x. f x) ==> Q RIGHT_EXISTS_IMP_THM = |- !P g. (?x. P ==> g x) = P ==> (?x. g x) PFORALL_IMP_CONV = - : conv LEFT_IMP_PEXISTS_CONV = - : conv RIGHT_IMP_PFORALL_CONV = - : conv PEXISTS_IMP_CONV = - : conv LEFT_IMP_PFORALL_CONV = - : conv RIGHT_IMP_PEXISTS_CONV = - : conv ((-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), -) : (conv # conv # conv # conv # conv # conv # conv # conv # conv # conv # conv # conv # conv # conv # conv # conv # conv # conv # conv # conv # conv # conv # conv # conv # conv # conv) NOT_PFORALL_CONV = - : conv NOT_PEXISTS_CONV = - : conv PEXISTS_NOT_CONV = - : conv PFORALL_NOT_CONV = - : conv PFORALL_AND_CONV = - : conv PEXISTS_OR_CONV = - : conv AND_PFORALL_CONV = - : conv LEFT_AND_PFORALL_CONV = - : conv RIGHT_AND_PFORALL_CONV = - : conv OR_PEXISTS_CONV = - : conv LEFT_OR_PEXISTS_CONV = - : conv RIGHT_OR_PEXISTS_CONV = - : conv PEXISTS_AND_CONV = - : conv AND_PEXISTS_CONV = - : conv LEFT_AND_PEXISTS_CONV = - : conv RIGHT_AND_PEXISTS_CONV = - : conv PFORALL_OR_CONV = - : conv OR_PFORALL_CONV = - : conv LEFT_OR_PFORALL_CONV = - : conv RIGHT_OR_PFORALL_CONV = - : conv PFORALL_IMP_CONV = - : conv LEFT_IMP_PEXISTS_CONV = - : conv RIGHT_IMP_PFORALL_CONV = - : conv PEXISTS_IMP_CONV = - : conv LEFT_IMP_PFORALL_CONV = - : conv RIGHT_IMP_PEXISTS_CONV = - : conv Calling Lisp compiler File conv compiled () : void #echo 'set_flag(`abort_when_fail`,true);;' \ 'compilet `pair`;;' \ 'quit();;' | ../../hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Extending help search path () : void () : void pair_version = `Revision: 3.1` : string pair Library (Revision: 3.1) loaded. Copyright (c) Jim Grundy 1992 () : void All rights reserved () : void Calling Lisp compiler File pair compiled () : void #===> library pair built make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word' rm -f word_base.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `mk_word_base`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool autoload_all = - : (string -> void) Loading library arith ... Loading library reduce ... Extending help search path. Loading boolean conversions........ Loading arithmetic conversions.................. Loading general conversions, rule and tactic..... Library reduce loaded. .Updating help search path ....................................................................................................................................................................................................................................................................................... Library arith loaded. () : void Loading library res_quan ... Updating search path Theory res_quan loaded ...............................................................................Updating help search path . Library res_quan loaded. () : void ....() : void File ver_202 loaded () : void Theorem LESS_EQ_ADD autoloading from theory `arithmetic` ... LESS_EQ_ADD = |- !m n. m <= (m + n) Theorem ADD_SYM autoloading from theory `arithmetic` ... ADD_SYM = |- !m n. m + n = n + m Theorem LESS_EQ_TRANS autoloading from theory `arithmetic` ... LESS_EQ_TRANS = |- !m n p. m <= n /\ n <= p ==> m <= p LESS_EQ_SPLIT = |- !m n p. (m + n) <= p ==> n <= p /\ m <= p Theorem SUB_ADD autoloading from theory `arithmetic` ... SUB_ADD = |- !m n. n <= m ==> ((m - n) + n = m) Theorem LESS_EQ_MONO_ADD_EQ autoloading from theory `arithmetic` ... LESS_EQ_MONO_ADD_EQ = |- !m n p. (m + p) <= (n + p) = m <= n Theorem GREATER_EQ autoloading from theory `arithmetic` ... GREATER_EQ = |- !n m. n >= m = m <= n SUB_GREATER_EQ_ADD = |- !p n m. p >= n ==> ((p - n) >= m = p >= (m + n)) ADD_LESS_EQ_SUB = |- !p n m. n <= p ==> ((m + n) <= p = m <= (p - n)) Theorem LESS_EQ_MONO autoloading from theory `arithmetic` ... LESS_EQ_MONO = |- !n m. (SUC n) <= (SUC m) = n <= m Theorem NOT_SUC_LESS_EQ_0 autoloading from theory `arithmetic` ... NOT_SUC_LESS_EQ_0 = |- !n. ~(SUC n) <= 0 Definition ADD autoloading from theory `arithmetic` ... ADD = |- (!n. 0 + n = n) /\ (!m n. (SUC m) + n = SUC(m + n)) ADD_LESS_EQ_TRANS = |- !m n p q. (m + n) <= p /\ q <= n ==> (m + q) <= p Theorem LESS_ANTISYM autoloading from theory `arithmetic` ... LESS_ANTISYM = |- !m n. ~(m < n /\ n < m) Theorem LESS_IMP_LESS_ADD autoloading from theory `arithmetic` ... LESS_IMP_LESS_ADD = |- !n m. n < m ==> (!p. n < (m + p)) Definition SUB autoloading from theory `arithmetic` ... SUB = |- (!m. 0 - m = 0) /\ (!m n. (SUC m) - n = (m < n => 0 | SUC(m - n))) Theorem SUB_MONO_EQ autoloading from theory `arithmetic` ... SUB_MONO_EQ = |- !n m. (SUC n) - (SUC m) = n - m Theorem SUB_0 autoloading from theory `arithmetic` ... SUB_0 = |- !m. (0 - m = 0) /\ (m - 0 = m) Theorem LESS_MONO_EQ autoloading from theory `arithmetic` ... LESS_MONO_EQ = |- !m n. (SUC m) < (SUC n) = m < n Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) Theorem NOT_LESS_0 autoloading from theory `prim_rec` ... NOT_LESS_0 = |- !n. ~n < 0 ADD_SUB_LEM = |- !m n p. p < n ==> ((m + n) - p = m + (n - p)) LESS_EQ_0_EQ = |- !m. m <= 0 ==> (m = 0) Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n < (SUC n) Theorem PRE autoloading from theory `prim_rec` ... PRE = |- (PRE 0 = 0) /\ (!m. PRE(SUC m) = m) Theorem LESS_0 autoloading from theory `prim_rec` ... LESS_0 = |- !n. 0 < (SUC n) Theorem LESS_REFL autoloading from theory `prim_rec` ... LESS_REFL = |- !n. ~n < n Theorem INDUCTION autoloading from theory `num` ... INDUCTION = |- !P. P 0 /\ (!n. P n ==> P(SUC n)) ==> (!n. P n) PRE_LESS_REFL = |- !m. 0 < m ==> (PRE m) < m Theorem DIV_MULT autoloading from theory `arithmetic` ... DIV_MULT = |- !n r. r < n ==> (!q. ((q * n) + r) DIV n = q) Definition MULT autoloading from theory `arithmetic` ... MULT = |- (!n. 0 * n = 0) /\ (!m n. (SUC m) * n = (m * n) + n) LESS_DIV_EQ_ZERO = |- !r n. r < n ==> (r DIV n = 0) Theorem ADD_0 autoloading from theory `arithmetic` ... ADD_0 = |- !m. m + 0 = m MULT_DIV = |- !n q. 0 < n ==> ((q * n) DIV n = q) Theorem RIGHT_ADD_DISTRIB autoloading from theory `arithmetic` ... RIGHT_ADD_DISTRIB = |- !m n p. (m + n) * p = (m * p) + (n * p) Theorem ADD_ASSOC autoloading from theory `arithmetic` ... ADD_ASSOC = |- !m n p. m + (n + p) = (m + n) + p Theorem DA autoloading from theory `arithmetic` ... DA = |- !k n. 0 < n ==> (?r q. (k = (q * n) + r) /\ r < n) ADD_DIV_ADD_DIV = |- !n. 0 < n ==> (!x r. ((x * n) + r) DIV n = x + (r DIV n)) Theorem MULT_CLAUSES autoloading from theory `arithmetic` ... MULT_CLAUSES = |- !m n. (0 * m = 0) /\ (m * 0 = 0) /\ (1 * m = m) /\ (m * 1 = m) /\ ((SUC m) * n = (m * n) + n) /\ (m * (SUC n) = m + (m * n)) NOT_MULT_LESS_0 = |- !m n. 0 < m /\ 0 < n ==> 0 < (m * n) Theorem MOD_TIMES autoloading from theory `arithmetic` ... MOD_TIMES = |- !n. 0 < n ==> (!q r. ((q * n) + r) MOD n = r MOD n) Theorem MULT_ASSOC autoloading from theory `arithmetic` ... MULT_ASSOC = |- !m n p. m * (n * p) = (m * n) * p Theorem MULT_SYM autoloading from theory `arithmetic` ... MULT_SYM = |- !m n. m * n = n * m Theorem MOD_MULT autoloading from theory `arithmetic` ... MOD_MULT = |- !n r. r < n ==> (!q. ((q * n) + r) MOD n = r) MOD_MULT_MOD = |- !m n. 0 < n /\ 0 < m ==> (!x. (x MOD (n * m)) MOD n = x MOD n) MULT_RIGHT_1 = |- !m. m * 1 = m DIV_ONE = |- !q. q DIV (SUC 0) = q Theorem ADD1 autoloading from theory `arithmetic` ... ADD1 = |- !m. SUC m = m + 1 Theorem LESS_THM autoloading from theory `prim_rec` ... LESS_THM = |- !m n. m < (SUC n) = (m = n) \/ m < n Less_lemma = |- !m n. m < n ==> (?p. (n = m + p) /\ 0 < p) Theorem LESS_TRANS autoloading from theory `arithmetic` ... LESS_TRANS = |- !m n p. m < n /\ n < p ==> m < p Theorem LESS_LESS_EQ_TRANS autoloading from theory `arithmetic` ... LESS_LESS_EQ_TRANS = |- !m n p. m < n /\ n <= p ==> m < p Less_MULT_lemma = |- !r m p. 0 < p ==> r < m ==> r < (p * m) Theorem LESS_MONO_ADD_EQ autoloading from theory `arithmetic` ... LESS_MONO_ADD_EQ = |- !m n p. (m + p) < (n + p) = m < n Less_MULT_ADD_lemma = |- !m n r r'. 0 < m /\ 0 < n /\ r < m /\ r' < n ==> ((r' * m) + r) < (n * m) Theorem ADD_INV_0_EQ autoloading from theory `arithmetic` ... ADD_INV_0_EQ = |- !m n. (m + n = m) = (n = 0) DIV_DIV_DIV_MULT = |- !m n. 0 < m /\ 0 < n ==> (!x. (x DIV m) DIV n = x DIV (m * n)) File arith_thms loaded () : void () : void Theorem SUB_LESS_EQ autoloading from theory `arithmetic` ... SUB_LESS_EQ = |- !n m. (n - m) <= n Theorem SUB_LESS_0 autoloading from theory `arithmetic` ... SUB_LESS_0 = |- !n m. m < n = 0 < (n - m) Theorem LESS_OR autoloading from theory `arithmetic` ... LESS_OR = |- !m n. m < n ==> (SUC m) <= n Theorem PRE_SUB1 autoloading from theory `arithmetic` ... PRE_SUB1 = |- !m. PRE m = m - 1 Theorem SEG_SEG autoloading from theory `list` ... SEG_SEG = |- !n1 m1 n2 m2 l. (n1 + m1) <= (LENGTH l) /\ (n2 + m2) <= n1 ==> (SEG n2 m2(SEG n1 m1 l) = SEG n2(m1 + m2)l) Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) Theorem LENGTH_SEG autoloading from theory `list` ... LENGTH_SEG = |- !n k l. (n + k) <= (LENGTH l) ==> (LENGTH(SEG n k l) = n) Theorem ELL_SEG autoloading from theory `list` ... ELL_SEG = |- !n l. n < (LENGTH l) ==> (ELL n l = HD(SEG 1(PRE((LENGTH l) - n))l)) Theorem LASTN_SEG autoloading from theory `list` ... LASTN_SEG = |- !n l. n <= (LENGTH l) ==> (LASTN n l = SEG n((LENGTH l) - n)l) Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m <= m ELL_LASTN = |- !l m j. m <= (LENGTH l) ==> j < m ==> (ELL j(LASTN m l) = ELL j l) Theorem ELL_SUC_SNOC autoloading from theory `list` ... ELL_SUC_SNOC = |- !n x l. ELL(SUC n)(SNOC x l) = ELL n l Definition BUTLASTN autoloading from theory `list` ... BUTLASTN = |- (!l. BUTLASTN 0 l = l) /\ (!n x l. BUTLASTN(SUC n)(SNOC x l) = BUTLASTN n l) Theorem ADD_EQ_0 autoloading from theory `arithmetic` ... ADD_EQ_0 = |- !m n. (m + n = 0) = (m = 0) /\ (n = 0) Theorem LENGTH_SNOC autoloading from theory `list` ... LENGTH_SNOC = |- !x l. LENGTH(SNOC x l) = SUC(LENGTH l) Definition LENGTH autoloading from theory `list` ... LENGTH = |- (LENGTH[] = 0) /\ (!h t. LENGTH(CONS h t) = SUC(LENGTH t)) ELL_BUTLASTN = |- !l k j. (j + k) <= (LENGTH l) ==> (ELL j(BUTLASTN k l) = ELL(j + k)l) Theorem SNOC_11 autoloading from theory `list` ... SNOC_11 = |- !x l x' l'. (SNOC x l = SNOC x' l') = (x = x') /\ (l = l') Theorem APPEND_SNOC autoloading from theory `list` ... APPEND_SNOC = |- !l1 x l2. APPEND l1(SNOC x l2) = SNOC x(APPEND l1 l2) Theorem APPEND_NIL autoloading from theory `list` ... APPEND_NIL = |- (!l. APPEND l[] = l) /\ (!l. APPEND[]l = l) Definition LASTN autoloading from theory `list` ... LASTN = |- (!l. LASTN 0 l = []) /\ (!n x l. LASTN(SUC n)(SNOC x l) = SNOC x(LASTN n l)) APPEND_LASTN_LASTN = |- !l m1 m2. (m1 + m2) <= (LENGTH l) ==> (APPEND(LASTN m2(BUTLASTN m1 l))(LASTN m1 l) = LASTN(m1 + m2)l) Theorem LASTN_BUTLASTN autoloading from theory `list` ... LASTN_BUTLASTN = |- !n m l. (n + m) <= (LENGTH l) ==> (LASTN n(BUTLASTN m l) = BUTLASTN m(LASTN(n + m)l)) Theorem SUB_SUB autoloading from theory `arithmetic` ... SUB_SUB = |- !b c. c <= b ==> (!a. a - (b - c) = (a + c) - b) Theorem SUB_LESS_EQ_ADD autoloading from theory `arithmetic` ... SUB_LESS_EQ_ADD = |- !m p. m <= p ==> (!n. (p - m) <= n = p <= (m + n)) Theorem LENGTH_BUTLASTN autoloading from theory `list` ... LENGTH_BUTLASTN = |- !n l. n <= (LENGTH l) ==> (LENGTH(BUTLASTN n l) = (LENGTH l) - n) Theorem LESS_IMP_LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_IMP_LESS_OR_EQ = |- !m n. m < n ==> m <= n Theorem BUTLASTN_APPEND2 autoloading from theory `list` ... BUTLASTN_APPEND2 = |- !n l1 l2. n <= (LENGTH l2) ==> (BUTLASTN n(APPEND l1 l2) = APPEND l1(BUTLASTN n l2)) Theorem LASTN_APPEND1 autoloading from theory `list` ... LASTN_APPEND1 = |- !l2 n. (LENGTH l2) <= n ==> (!l1. LASTN n(APPEND l1 l2) = APPEND(LASTN(n - (LENGTH l2))l1)l2) Theorem LASTN_LENGTH_ID autoloading from theory `list` ... LASTN_LENGTH_ID = |- !l. LASTN(LENGTH l)l = l Theorem ADD_SUB autoloading from theory `arithmetic` ... ADD_SUB = |- !a c. (a + c) - c = a Theorem SUB_EQUAL_0 autoloading from theory `arithmetic` ... SUB_EQUAL_0 = |- !c. c - c = 0 Theorem LESS_EQUAL_ANTISYM autoloading from theory `arithmetic` ... LESS_EQUAL_ANTISYM = |- !n m. n <= m /\ m <= n ==> (n = m) Definition APPEND autoloading from theory `list` ... APPEND = |- (!l. APPEND[]l = l) /\ (!l1 l2 h. APPEND(CONS h l1)l2 = CONS h(APPEND l1 l2)) LASTN_BUTLASTN_APPEND = |- !l1 l2 m k. (m + k) <= ((LENGTH l1) + (LENGTH l2)) /\ k < (LENGTH l2) /\ (LENGTH l2) <= (m + k) ==> (LASTN m(BUTLASTN k(APPEND l1 l2)) = APPEND (LASTN((m + k) - (LENGTH l2))l1) (LASTN((LENGTH l2) - k)(BUTLASTN k l2))) word_Ax = |- !f. ?! fn. !l. fn(WORD l) = f l WORD_11 = |- !l l'. (WORD l = WORD l') = (l = l') word_induct = |- !P. (!l. P(WORD l)) ==> (!w. P w) word_cases = |- !w. ?l. w = WORD l WORDLEN_DEF = |- !l. WORDLEN(WORD l) = LENGTH l PWORDLEN_DEF = |- !n l. PWORDLEN n(WORD l) = (n = LENGTH l) word_CASES_TAC = - : (term -> tactic) word_INDUCT_TAC = - : tactic RESQ_WORDLEN_TAC = - : tactic File word_funs loaded () : void PWORDLEN = |- !n w. PWORDLEN n w = (WORDLEN w = n) Theorem NOT_SUC autoloading from theory `num` ... NOT_SUC = |- !n. ~(SUC n = 0) PWORDLEN0 = |- !w. PWORDLEN 0 w ==> (w = WORD[]) PWORDLEN1 = |- !x. PWORDLEN 1(WORD[x]) WSEG_DEF = |- !m k l. WSEG m k(WORD l) = WORD(LASTN m(BUTLASTN k l)) WSEG0 = |- !k w. WSEG 0 k w = WORD[] Theorem LENGTH_LASTN autoloading from theory `list` ... LENGTH_LASTN = |- !n l. n <= (LENGTH l) ==> (LENGTH(LASTN n l) = n) WSEG_PWORDLEN = |- !n. !w :: PWORDLEN n. !m k. (m + k) <= n ==> PWORDLEN m(WSEG m k w) WSEG_WORDLEN = |- !n. !w :: PWORDLEN n. !m k. (m + k) <= n ==> (WORDLEN(WSEG m k w) = m) WSEG_WORD_LENGTH = |- !n. !w :: PWORDLEN n. WSEG n 0 w = w BIT_DEF = |- !k l. BIT k(WORD l) = ELL k l Definition SNOC autoloading from theory `list` ... SNOC = |- (!x. SNOC x[] = [x]) /\ (!x x' l. SNOC x(CONS x' l) = CONS x'(SNOC x l)) Theorem LAST autoloading from theory `list` ... LAST = |- !x l. LAST(SNOC x l) = x Definition ELL autoloading from theory `list` ... ELL = |- (!l. ELL 0 l = LAST l) /\ (!n l. ELL(SUC n)l = ELL n(BUTLAST l)) BIT0 = |- !b. BIT 0(WORD[b]) = b Theorem BUTLAST autoloading from theory `list` ... BUTLAST = |- !x l. BUTLAST(SNOC x l) = l WSEG_BIT = |- !n. !w :: PWORDLEN n. !k. k < n ==> (WSEG 1 k w = WORD[BIT k w]) BIT_WSEG = |- !n. !w :: PWORDLEN n. !m k j. (m + k) <= n ==> j < m ==> (BIT j(WSEG m k w) = BIT(j + k)w) MSB_DEF = |- !l. MSB(WORD l) = HD l Theorem ELL_PRE_LENGTH autoloading from theory `list` ... ELL_PRE_LENGTH = |- !l. ~(l = []) ==> (ELL(PRE(LENGTH l))l = HD l) Theorem NULL_EQ_NIL autoloading from theory `list` ... NULL_EQ_NIL = |- !l. NULL l = (l = []) Theorem LENGTH_NOT_NULL autoloading from theory `list` ... LENGTH_NOT_NULL = |- !l. 0 < (LENGTH l) = ~NULL l MSB = |- !n. !w :: PWORDLEN n. 0 < n ==> (MSB w = BIT(PRE n)w) LSB_DEF = |- !l. LSB(WORD l) = LAST l Theorem ELL_LAST autoloading from theory `list` ... ELL_LAST = |- !l. ~NULL l ==> (ELL 0 l = LAST l) LSB = |- !n. !w :: PWORDLEN n. 0 < n ==> (LSB w = BIT 0 w) WSPLIT_DEF = |- !m l. WSPLIT m(WORD l) = WORD(BUTLASTN m l),WORD(LASTN m l) th = |- ?bt. !l. bt(WORD l) = l word_bits = |- ?bt. (!l. bt(WORD l) = l) /\ (!w. WORD(bt w) = w) WCAT_lemma = |- ?WCAT. !l1 l2. WCAT(WORD l1,WORD l2) = WORD(APPEND l1 l2) WCAT_DEF = |- !l1 l2. WCAT(WORD l1,WORD l2) = WORD(APPEND l1 l2) Theorem APPEND_BUTLASTN_LASTN autoloading from theory `list` ... APPEND_BUTLASTN_LASTN = |- !n l. n <= (LENGTH l) ==> (APPEND(BUTLASTN n l)(LASTN n l) = l) WCAT_WSPLIT = |- !n. !w :: PWORDLEN n. !m. m <= n ==> (WCAT(WSPLIT m w) = w) Theorem LASTN_LENGTH_APPEND autoloading from theory `list` ... LASTN_LENGTH_APPEND = |- !l1 l2. LASTN(LENGTH l2)(APPEND l1 l2) = l2 Theorem BUTLASTN_LENGTH_APPEND autoloading from theory `list` ... BUTLASTN_LENGTH_APPEND = |- !l2 l1. BUTLASTN(LENGTH l2)(APPEND l1 l2) = l1 WSPLIT_WCAT = |- !n m. !w1 :: PWORDLEN n. !w2 :: PWORDLEN m. WSPLIT m(WCAT(w1,w2)) = w1,w2 WORD_PARTITION = |- (!n. !w :: PWORDLEN n. !m. m <= n ==> (WCAT(WSPLIT m w) = w)) /\ (!n m. !w1 :: PWORDLEN n. !w2 :: PWORDLEN m. WSPLIT m(WCAT(w1,w2)) = w1,w2) Theorem APPEND_ASSOC autoloading from theory `list` ... APPEND_ASSOC = |- !l1 l2 l3. APPEND l1(APPEND l2 l3) = APPEND(APPEND l1 l2)l3 WCAT_ASSOC = |- !w1 w2 w3. WCAT(w1,WCAT(w2,w3)) = WCAT(WCAT(w1,w2),w3) WCAT0 = |- !w. (WCAT(WORD[],w) = w) /\ (WCAT(w,WORD[]) = w) Theorem APPEND_LENGTH_EQ autoloading from theory `list` ... APPEND_LENGTH_EQ = |- !l1 l1'. (LENGTH l1 = LENGTH l1') ==> (!l2 l2'. (LENGTH l2 = LENGTH l2') ==> ((APPEND l1 l2 = APPEND l1' l2') = (l1 = l1') /\ (l2 = l2'))) WCAT_11 = |- !m n. !wm1 wm2 :: PWORDLEN m. !wn1 wn2 :: PWORDLEN n. (WCAT(wm1,wn1) = WCAT(wm2,wn2)) = (wm1 = wm2) /\ (wn1 = wn2) WSPLIT_PWORDLEN = |- !n. !w :: PWORDLEN n. !m. m <= n ==> PWORDLEN(n - m)(FST(WSPLIT m w)) /\ PWORDLEN m(SND(WSPLIT m w)) Theorem LENGTH_APPEND autoloading from theory `list` ... LENGTH_APPEND = |- !l1 l2. LENGTH(APPEND l1 l2) = (LENGTH l1) + (LENGTH l2) WCAT_PWORDLEN = |- !n1. !w1 :: PWORDLEN n1. !n2. !w2 :: PWORDLEN n2. PWORDLEN(n1 + n2)(WCAT(w1,w2)) Theorem LESS_EQ_SUC_REFL autoloading from theory `arithmetic` ... LESS_EQ_SUC_REFL = |- !m. m <= (SUC m) WORDLEN_SUC_WCAT = |- !n w. PWORDLEN(SUC n)w ==> (?b :: PWORDLEN 1. ?w' :: PWORDLEN n. w = WCAT(b,w')) Theorem LASTN_LASTN autoloading from theory `list` ... LASTN_LASTN = |- !l n m. m <= (LENGTH l) ==> n <= m ==> (LASTN n(LASTN m l) = LASTN n l) Theorem BUTLASTN_BUTLASTN autoloading from theory `list` ... BUTLASTN_BUTLASTN = |- !m n l. (n + m) <= (LENGTH l) ==> (BUTLASTN n(BUTLASTN m l) = BUTLASTN(n + m)l) Theorem BUTLASTN_LASTN autoloading from theory `list` ... BUTLASTN_LASTN = |- !m n l. m <= n /\ n <= (LENGTH l) ==> (BUTLASTN m(LASTN n l) = LASTN(n - m)(BUTLASTN m l)) WSEG_WSEG = |- !n. !w :: PWORDLEN n. !m1 k1 m2 k2. (m1 + k1) <= n /\ (m2 + k2) <= m1 ==> (WSEG m2 k2(WSEG m1 k1 w) = WSEG m2(k1 + k2)w) WSPLIT_WSEG = |- !n. !w :: PWORDLEN n. !k. k <= n ==> (WSPLIT k w = WSEG(n - k)k w,WSEG k 0 w) WSPLIT_WSEG1 = |- !n. !w :: PWORDLEN n. !k. k <= n ==> (FST(WSPLIT k w) = WSEG(n - k)k w) WSPLIT_WSEG2 = |- !n. !w :: PWORDLEN n. !k. k <= n ==> (SND(WSPLIT k w) = WSEG k 0 w) WCAT_WSEG_WSEG = |- !n. !w :: PWORDLEN n. !m1 m2 k. (m1 + (m2 + k)) <= n ==> (WCAT(WSEG m2(m1 + k)w,WSEG m1 k w) = WSEG(m1 + m2)k w) WORD_SPLIT = |- !n1 n2. !w :: PWORDLEN(n1 + n2). w = WCAT(WSEG n1 n2 w,WSEG n2 0 w) WORDLEN_SUC_WCAT_WSEG_WSEG = |- !w :: PWORDLEN(SUC n). w = WCAT(WSEG 1 n w,WSEG n 0 w) WORDLEN_SUC_WCAT_WSEG_WSEG_RIGHT = |- !w :: PWORDLEN(SUC n). w = WCAT(WSEG n 1 w,WSEG 1 0 w) WORDLEN_SUC_WCAT_BIT_WSEG = |- !n. !w :: PWORDLEN(SUC n). w = WCAT(WORD[BIT n w],WSEG n 0 w) WORDLEN_SUC_WCAT_BIT_WSEG_RIGHT = |- !n. !w :: PWORDLEN(SUC n). w = WCAT(WSEG n 1 w,WORD[BIT 0 w]) WSEG_WCAT1 = |- !n1 n2. !w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. WSEG n1 n2(WCAT(w1,w2)) = w1 WSEG_WCAT2 = |- !n1 n2. !w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. WSEG n2 0(WCAT(w1,w2)) = w2 Theorem CONS_APPEND autoloading from theory `list` ... CONS_APPEND = |- !x l. CONS x l = APPEND[x]l WORD_CONS_WCAT = |- !x l. WORD(CONS x l) = WCAT(WORD[x],WORD l) Theorem SNOC_APPEND autoloading from theory `list` ... SNOC_APPEND = |- !x l. SNOC x l = APPEND l[x] WORD_SNOC_WCAT = |- !x l. WORD(SNOC x l) = WCAT(WORD l,WORD[x]) Theorem ELL_APPEND1 autoloading from theory `list` ... ELL_APPEND1 = |- !l2 n. (LENGTH l2) <= n ==> (!l1. ELL n(APPEND l1 l2) = ELL(n - (LENGTH l2))l1) BIT_WCAT_FST = |- !n1 n2. !w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. !k. n2 <= k /\ k < (n1 + n2) ==> (BIT k(WCAT(w1,w2)) = BIT(k - n2)w1) Theorem ELL_APPEND2 autoloading from theory `list` ... ELL_APPEND2 = |- !n l2. n < (LENGTH l2) ==> (!l1. ELL n(APPEND l1 l2) = ELL n l2) BIT_WCAT_SND = |- !n1 n2. !w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. !k. k < n2 ==> (BIT k(WCAT(w1,w2)) = BIT k w2) Theorem ELL_LENGTH_CONS autoloading from theory `list` ... ELL_LENGTH_CONS = |- !l x. ELL(LENGTH l)(CONS x l) = x BIT_WCAT1 = |- !n. !w :: PWORDLEN n. !b. BIT n(WCAT(WORD[b],w)) = b Theorem BUTLASTN_APPEND1 autoloading from theory `list` ... BUTLASTN_APPEND1 = |- !l2 n. (LENGTH l2) <= n ==> (!l1. BUTLASTN n(APPEND l1 l2) = BUTLASTN(n - (LENGTH l2))l1) WSEG_WCAT_WSEG1 = |- !n1 n2. !w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. !m k. m <= n1 /\ n2 <= k ==> (WSEG m k(WCAT(w1,w2)) = WSEG m(k - n2)w1) Theorem LASTN_APPEND2 autoloading from theory `list` ... LASTN_APPEND2 = |- !n l2. n <= (LENGTH l2) ==> (!l1. LASTN n(APPEND l1 l2) = LASTN n l2) WSEG_WCAT_WSEG2 = |- !n1 n2. !w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. !m k. (m + k) <= n2 ==> (WSEG m k(WCAT(w1,w2)) = WSEG m k w2) WSEG_WCAT_WSEG = |- !n1 n2. !w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. !m k. (m + k) <= (n1 + n2) /\ k < n2 /\ n2 <= (m + k) ==> (WSEG m k(WCAT(w1,w2)) = WCAT(WSEG((m + k) - n2)0 w1,WSEG(n2 - k)k w2)) PWORDLEN_BIT1 = |- !x. PWORDLEN 1(WORD[x]) Theorem LESS_SUC autoloading from theory `prim_rec` ... LESS_SUC = |- !m n. m < n ==> m < (SUC n) Theorem CONS_11 autoloading from theory `list` ... CONS_11 = |- !h t h' t'. (CONS h t = CONS h' t') = (h = h') /\ (t = t') BIT_EQ_IMP_WORD_EQ = |- !n. !w1 w2 :: PWORDLEN n. (!k. k < n ==> (BIT k w1 = BIT k w2)) ==> (w1 = w2) () : void File mk_word_base loaded () : void #rm -f word_bitop.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `mk_word_bitop`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool autoload_all = - : (string -> void) Loading library arith ... Loading library reduce ... Extending help search path. Loading boolean conversions........ Loading arithmetic conversions.................. Loading general conversions, rule and tactic..... Library reduce loaded. .Updating help search path ....................................................................................................................................................................................................................................................................................... Library arith loaded. () : void Loading library res_quan ... Updating search path Theory res_quan loaded ...............................................................................Updating help search path . Library res_quan loaded. () : void ....() : void File ver_202 loaded () : void .........................................................() : void Theory word_base loaded () : void () : void () : void ...() : void Theorem SUB_LESS_EQ autoloading from theory `arithmetic` ... SUB_LESS_EQ = |- !n m. (n - m) <= n Theorem SEG_LASTN_BUTLASTN autoloading from theory `list` ... SEG_LASTN_BUTLASTN = |- !n m l. (n + m) <= (LENGTH l) ==> (SEG n m l = LASTN n(BUTLASTN((LENGTH l) - (n + m))l)) LASTN_BUTLASTN_SEG = |- !m k l. (m + k) <= (LENGTH l) ==> (LASTN m(BUTLASTN k l) = SEG m((LENGTH l) - (m + k))l) PBITOP_DEF = |- !op. PBITOP op = (!n. !w :: PWORDLEN n. PWORDLEN n(op w) /\ (!m k. (m + k) <= n ==> (op(WSEG m k w) = WSEG m k(op w)))) PBITOP_PWORDLEN = |- !op :: PBITOP. !n. !w :: PWORDLEN n. PWORDLEN n(op w) PBITOP_WSEG = |- !op :: PBITOP. !n. !w :: PWORDLEN n. !m k. (m + k) <= n ==> (op(WSEG m k w) = WSEG m k(op w)) Theorem LESS_EQ autoloading from theory `arithmetic` ... LESS_EQ = |- !m n. m < n = (SUC m) <= n Theorem WSEG_BIT autoloading from theory `word_base` ... WSEG_BIT = |- !n. !w :: PWORDLEN n. !k. k < n ==> (WSEG 1 k w = WORD[BIT k w]) PBITOP_BIT = |- !op :: PBITOP. !n. !w :: PWORDLEN n. !k. k < n ==> (op(WORD[BIT k w]) = WORD[BIT k(op w)]) Theorem BIT0 autoloading from theory `word_base` ... BIT0 = |- !b. BIT 0(WORD[b]) = b BIT_op_EXISTS = |- !op :: PBITOP. ?op'. !n. !w :: PWORDLEN n. !k. k < n ==> (BIT k(op w) = op'(BIT k w)) PBITBOP_DEF = |- !op. PBITBOP op = (!n. !w1 :: PWORDLEN n. !w2 :: PWORDLEN n. PWORDLEN n(op w1 w2) /\ (!m k. (m + k) <= n ==> (op(WSEG m k w1)(WSEG m k w2) = WSEG m k(op w1 w2)))) PBITBOP_PWORDLEN = |- !op :: PBITBOP. !n. !w1 :: PWORDLEN n. !w2 :: PWORDLEN n. PWORDLEN n(op w1 w2) PBITBOP_WSEG = |- !op :: PBITBOP. !n. !w1 :: PWORDLEN n. !w2 :: PWORDLEN n. !m k. (m + k) <= n ==> (op(WSEG m k w1)(WSEG m k w2) = WSEG m k(op w1 w2)) Theorem word_Ax autoloading from theory `word_base` ... word_Ax = |- !f. ?! fn. !l. fn(WORD l) = f l PBITBOP_EXISTS = |- !f. ?fn. !l1 l2. fn(WORD l1)(WORD l2) = WORD(MAP2 f l1 l2) WMAP_DEF = |- !f l. WMAP f(WORD l) = WORD(MAP f l) Theorem LENGTH_MAP autoloading from theory `list` ... LENGTH_MAP = |- !l f. LENGTH(MAP f l) = LENGTH l Definition PWORDLEN_DEF autoloading from theory `word_base` ... PWORDLEN_DEF = |- !n l. PWORDLEN n(WORD l) = (n = LENGTH l) WMAP_PWORDLEN = |- !w :: PWORDLEN n. !f. PWORDLEN n(WMAP f w) Definition MAP autoloading from theory `list` ... MAP = |- (!f. MAP f[] = []) /\ (!f h t. MAP f(CONS h t) = CONS(f h)(MAP f t)) WMAP0 = |- !f. WMAP f(WORD[]) = WORD[] Theorem ELL_MAP autoloading from theory `list` ... ELL_MAP = |- !n l f. n < (LENGTH l) ==> (ELL n(MAP f l) = f(ELL n l)) Definition BIT_DEF autoloading from theory `word_base` ... BIT_DEF = |- !k l. BIT k(WORD l) = ELL k l WMAP_BIT = |- !n. !w :: PWORDLEN n. !k. k < n ==> (!f. BIT k(WMAP f w) = f(BIT k w)) Theorem LENGTH_BUTLASTN autoloading from theory `list` ... LENGTH_BUTLASTN = |- !n l. n <= (LENGTH l) ==> (LENGTH(BUTLASTN n l) = (LENGTH l) - n) Theorem LASTN_MAP autoloading from theory `list` ... LASTN_MAP = |- !n l. n <= (LENGTH l) ==> (!f. LASTN n(MAP f l) = MAP f(LASTN n l)) Theorem BUTLASTN_MAP autoloading from theory `list` ... BUTLASTN_MAP = |- !n l. n <= (LENGTH l) ==> (!f. BUTLASTN n(MAP f l) = MAP f(BUTLASTN n l)) Theorem WORD_11 autoloading from theory `word_base` ... WORD_11 = |- !l l'. (WORD l = WORD l') = (l = l') Definition WSEG_DEF autoloading from theory `word_base` ... WSEG_DEF = |- !m k l. WSEG m k(WORD l) = WORD(LASTN m(BUTLASTN k l)) WMAP_WSEG = |- !n. !w :: PWORDLEN n. !m k. (m + k) <= n ==> (!f. WMAP f(WSEG m k w) = WSEG m k(WMAP f w)) WMAP_PBITOP = |- !f. PBITOP(WMAP f) Theorem MAP_APPEND autoloading from theory `list` ... MAP_APPEND = |- !f l1 l2. MAP f(APPEND l1 l2) = APPEND(MAP f l1)(MAP f l2) Definition WCAT_DEF autoloading from theory `word_base` ... WCAT_DEF = |- !l1 l2. WCAT(WORD l1,WORD l2) = WORD(APPEND l1 l2) WMAP_WCAT = |- !w1 w2 f. WMAP f(WCAT(w1,w2)) = WCAT(WMAP f w1,WMAP f w2) Theorem MAP_MAP_o autoloading from theory `list` ... MAP_MAP_o = |- !f g l. MAP f(MAP g l) = MAP(f o g)l WMAP_o = |- !w f g. WMAP g(WMAP f w) = WMAP(g o f)w FORALLBITS_DEF = |- !P l. FORALLBITS P(WORD l) = ALL_EL P l Theorem ELL_CONS autoloading from theory `list` ... ELL_CONS = |- !n l. n < (LENGTH l) ==> (!x. ELL n(CONS x l) = ELL n l) Theorem ELL_LENGTH_CONS autoloading from theory `list` ... ELL_LENGTH_CONS = |- !l x. ELL(LENGTH l)(CONS x l) = x Definition ALL_EL autoloading from theory `list` ... ALL_EL = |- (!P. ALL_EL P[] = T) /\ (!P x l. ALL_EL P(CONS x l) = P x /\ ALL_EL P l) Definition LENGTH autoloading from theory `list` ... LENGTH = |- (LENGTH[] = 0) /\ (!h t. LENGTH(CONS h t) = SUC(LENGTH t)) FORALLBITS = |- !n. !w :: PWORDLEN n. !P. FORALLBITS P w = (!k. k < n ==> P(BIT k w)) Theorem ALL_EL_LASTN autoloading from theory `list` ... ALL_EL_LASTN = |- !P l. ALL_EL P l ==> (!m. m <= (LENGTH l) ==> ALL_EL P(LASTN m l)) Theorem ALL_EL_SNOC autoloading from theory `list` ... ALL_EL_SNOC = |- !P x l. ALL_EL P(SNOC x l) = ALL_EL P l /\ P x Theorem LENGTH_SNOC autoloading from theory `list` ... LENGTH_SNOC = |- !x l. LENGTH(SNOC x l) = SUC(LENGTH l) Definition BUTLASTN autoloading from theory `list` ... BUTLASTN = |- (!l. BUTLASTN 0 l = l) /\ (!n x l. BUTLASTN(SUC n)(SNOC x l) = BUTLASTN n l) Definition LASTN autoloading from theory `list` ... LASTN = |- (!l. LASTN 0 l = []) /\ (!n x l. LASTN(SUC n)(SNOC x l) = SNOC x(LASTN n l)) Theorem ADD_EQ_0 autoloading from theory `arithmetic` ... ADD_EQ_0 = |- !m n. (m + n = 0) = (m = 0) /\ (n = 0) FORALLBITS_WSEG = |- !n. !w :: PWORDLEN n. !P. FORALLBITS P w ==> (!m k. (m + k) <= n ==> FORALLBITS P(WSEG m k w)) Theorem ALL_EL_APPEND autoloading from theory `list` ... ALL_EL_APPEND = |- !P l1 l2. ALL_EL P(APPEND l1 l2) = ALL_EL P l1 /\ ALL_EL P l2 FORALLBITS_WCAT = |- !w1 w2 P. FORALLBITS P(WCAT(w1,w2)) = FORALLBITS P w1 /\ FORALLBITS P w2 EXISTSABIT_DEF = |- !P l. EXISTSABIT P(WORD l) = SOME_EL P l Theorem NOT_SOME_EL_ALL_EL autoloading from theory `list` ... NOT_SOME_EL_ALL_EL = |- !P l. ~SOME_EL P l = ALL_EL($~ o P)l NOT_EXISTSABIT = |- !P w. ~EXISTSABIT P w = FORALLBITS($~ o P)w Theorem NOT_ALL_EL_SOME_EL autoloading from theory `list` ... NOT_ALL_EL_SOME_EL = |- !P l. ~ALL_EL P l = SOME_EL($~ o P)l NOT_FORALLBITS = |- !P w. ~FORALLBITS P w = EXISTSABIT($~ o P)w Definition SOME_EL autoloading from theory `list` ... SOME_EL = |- (!P. SOME_EL P[] = F) /\ (!P x l. SOME_EL P(CONS x l) = P x \/ SOME_EL P l) EXISTSABIT_BIT = |- !n. !w :: PWORDLEN n. !P. EXISTSABIT P w = (?k. k < n /\ P(BIT k w)) Theorem SOME_EL_SEG autoloading from theory `list` ... SOME_EL_SEG = |- !m k l. (m + k) <= (LENGTH l) ==> (!P. SOME_EL P(SEG m k l) ==> SOME_EL P l) EXISTSABIT_WSEG = |- !n. !w :: PWORDLEN n. !m k. (m + k) <= n ==> (!P. EXISTSABIT P(WSEG m k w) ==> EXISTSABIT P w) Theorem SOME_EL_APPEND autoloading from theory `list` ... SOME_EL_APPEND = |- !P l1 l2. SOME_EL P(APPEND l1 l2) = SOME_EL P l1 \/ SOME_EL P l2 EXISTSABIT_WCAT = |- !w1 w2 P. EXISTSABIT P(WCAT(w1,w2)) = EXISTSABIT P w1 \/ EXISTSABIT P w2 SHR_DEF = |- !f b w. SHR f b w = WCAT ((f => WSEG 1(PRE(WORDLEN w))w | WORD[b]),WSEG(PRE(WORDLEN w))1 w), BIT 0 w SHL_DEF = |- !f w b. SHL f w b = BIT(PRE(WORDLEN w))w, WCAT(WSEG(PRE(WORDLEN w))0 w,(f => WSEG 1 0 w | WORD[b])) Theorem BIT_WSEG autoloading from theory `word_base` ... BIT_WSEG = |- !n. !w :: PWORDLEN n. !m k j. (m + k) <= n ==> j < m ==> (BIT j(WSEG m k w) = BIT(j + k)w) Theorem WSEG_WSEG autoloading from theory `word_base` ... WSEG_WSEG = |- !n. !w :: PWORDLEN n. !m1 k1 m2 k2. (m1 + k1) <= n /\ (m2 + k2) <= m1 ==> (WSEG m2 k2(WSEG m1 k1 w) = WSEG m2(k1 + k2)w) Theorem PRE_SUB1 autoloading from theory `arithmetic` ... PRE_SUB1 = |- !m. PRE m = m - 1 Theorem WSEG_WORDLEN autoloading from theory `word_base` ... WSEG_WORDLEN = |- !n. !w :: PWORDLEN n. !m k. (m + k) <= n ==> (WORDLEN(WSEG m k w) = m) SHR_WSEG = |- !n. !w :: PWORDLEN n. !m k. (m + k) <= n ==> 0 < m ==> (!f b. SHR f b(WSEG m k w) = (f => WCAT(WSEG 1(k + (m - 1))w,WSEG(m - 1)(k + 1)w) | WCAT(WORD[b],WSEG(m - 1)(k + 1)w)),BIT k w) SHR_WSEG_1F = |- !n. !w :: PWORDLEN n. !m k. (m + k) <= n ==> 0 < m ==> (!b. SHR F b(WSEG m k w) = WCAT(WORD[b],WSEG(m - 1)(k + 1)w),BIT k w) SHR_WSEG_NF_lem1 = |- 0 < m ==> ((m - 1) + 1 = m) SHR_WSEG_NF_lem2 = |- 0 < m ==> ((m - 1) + (k + 1) = m + k) Theorem LESS_OR autoloading from theory `arithmetic` ... LESS_OR = |- !m n. m < n ==> (SUC m) <= n Theorem WCAT_WSEG_WSEG autoloading from theory `word_base` ... WCAT_WSEG_WSEG = |- !n. !w :: PWORDLEN n. !m1 m2 k. (m1 + (m2 + k)) <= n ==> (WCAT(WSEG m2(m1 + k)w,WSEG m1 k w) = WSEG(m1 + m2)k w) Theorem LESS_IMP_LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_IMP_LESS_OR_EQ = |- !m n. m < n ==> m <= n SHR_WSEG_NF = |- !n. !w :: PWORDLEN n. !m k. (m + k) < n ==> 0 < m ==> (SHR F(BIT(m + k)w)(WSEG m k w) = WSEG m(k + 1)w,BIT k w) SHL_WSEG = |- !n. !w :: PWORDLEN n. !m k. (m + k) <= n ==> 0 < m ==> (!f b. SHL f(WSEG m k w)b = BIT(k + (m - 1))w, (f => WCAT(WSEG(m - 1)k w,WSEG 1 k w) | WCAT(WSEG(m - 1)k w,WORD[b]))) SHL_WSEG_1F = |- !n. !w :: PWORDLEN n. !m k. (m + k) <= n ==> 0 < m ==> (!b. SHL F(WSEG m k w)b = BIT(k + (m - 1))w,WCAT(WSEG(m - 1)k w,WORD[b])) SHL_WSEG_NF = |- !n. !w :: PWORDLEN n. !m k. (m + k) <= n ==> 0 < m ==> 0 < k ==> (SHL F(WSEG m k w)(BIT(k - 1)w) = BIT(k + (m - 1))w,WSEG m(k - 1)w) Theorem PWORDLEN1 autoloading from theory `word_base` ... PWORDLEN1 = |- !x. PWORDLEN 1(WORD[x]) Theorem ZERO_LESS_EQ autoloading from theory `arithmetic` ... ZERO_LESS_EQ = |- !n. 0 <= n Theorem LESS_EQ_SUC_REFL autoloading from theory `arithmetic` ... LESS_EQ_SUC_REFL = |- !m. m <= (SUC m) Theorem WSEG_PWORDLEN autoloading from theory `word_base` ... WSEG_PWORDLEN = |- !n. !w :: PWORDLEN n. !m k. (m + k) <= n ==> PWORDLEN m(WSEG m k w) Theorem WSEG_WCAT_WSEG1 autoloading from theory `word_base` ... WSEG_WCAT_WSEG1 = |- !n1 n2. !w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. !m k. m <= n1 /\ n2 <= k ==> (WSEG m k(WCAT(w1,w2)) = WSEG m(k - n2)w1) Theorem PWORDLEN autoloading from theory `word_base` ... PWORDLEN = |- !n w. PWORDLEN n w = (WORDLEN w = n) WSEG_SHL = |- !n. !w :: PWORDLEN(SUC n). !m k. 0 < k /\ (m + k) <= (SUC n) ==> (!b. WSEG m k(SND(SHL f w b)) = WSEG m(k - 1)w) Theorem WSEG_WORD_LENGTH autoloading from theory `word_base` ... WSEG_WORD_LENGTH = |- !n. !w :: PWORDLEN n. WSEG n 0 w = w Theorem WSEG_WCAT_WSEG autoloading from theory `word_base` ... WSEG_WCAT_WSEG = |- !n1 n2. !w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. !m k. (m + k) <= (n1 + n2) /\ k < n2 /\ n2 <= (m + k) ==> (WSEG m k(WCAT(w1,w2)) = WCAT(WSEG((m + k) - n2)0 w1,WSEG(n2 - k)k w2)) WSEG_SHL_0 = |- !n. !w :: PWORDLEN(SUC n). !m b. 0 < m /\ m <= (SUC n) ==> (WSEG m 0(SND(SHL f w b)) = WCAT(WSEG(m - 1)0 w,(f => WSEG 1 0 w | WORD[b]))) () : void File mk_word_bitop loaded () : void #rm -f word_num.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `mk_word_num`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool autoload_all = - : (string -> void) Loading library arith ... Loading library reduce ... Extending help search path. Loading boolean conversions........ Loading arithmetic conversions.................. Loading general conversions, rule and tactic..... Library reduce loaded. .Updating help search path ....................................................................................................................................................................................................................................................................................... Library arith loaded. () : void Loading library res_quan ... Updating search path Theory res_quan loaded ...............................................................................Updating help search path . Library res_quan loaded. () : void ....() : void File ver_202 loaded () : void Theory word_base loaded () : void [()] : void list () : void ...() : void LVAL_DEF = |- !f b l. LVAL f b l = FOLDL(\e x. (b * e) + (f x))0 l Theorem LEFT_ADD_DISTRIB autoloading from theory `arithmetic` ... LEFT_ADD_DISTRIB = |- !m n p. p * (m + n) = (p * m) + (p * n) Theorem ADD_ASSOC autoloading from theory `arithmetic` ... ADD_ASSOC = |- !m n p. m + (n + p) = (m + n) + p Theorem MULT_SYM autoloading from theory `arithmetic` ... MULT_SYM = |- !m n. m * n = n * m Theorem MULT_ASSOC autoloading from theory `arithmetic` ... MULT_ASSOC = |- !m n p. m * (n * p) = (m * n) * p Theorem LENGTH_SNOC autoloading from theory `list` ... LENGTH_SNOC = |- !x l. LENGTH(SNOC x l) = SUC(LENGTH l) Theorem FOLDL_SNOC autoloading from theory `list` ... FOLDL_SNOC = |- !f e x l. FOLDL f e(SNOC x l) = f(FOLDL f e l)x Definition EXP autoloading from theory `arithmetic` ... EXP = |- (!m. m EXP 0 = 1) /\ (!m n. m EXP (SUC n) = m * (m EXP n)) Definition LENGTH autoloading from theory `list` ... LENGTH = |- (LENGTH[] = 0) /\ (!h t. LENGTH(CONS h t) = SUC(LENGTH t)) Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) Theorem MULT_CLAUSES autoloading from theory `arithmetic` ... MULT_CLAUSES = |- !m n. (0 * m = 0) /\ (m * 0 = 0) /\ (1 * m = m) /\ (m * 1 = m) /\ ((SUC m) * n = (m * n) + n) /\ (m * (SUC n) = m + (m * n)) Definition FOLDL autoloading from theory `list` ... FOLDL = |- (!f e. FOLDL f e[] = e) /\ (!f e x l. FOLDL f e(CONS x l) = FOLDL f(f e x)l) LVAL = |- (!f b. LVAL f b[] = 0) /\ (!l f b x. LVAL f b(CONS x l) = ((f x) * (b EXP (LENGTH l))) + (LVAL f b l)) Theorem word_Ax autoloading from theory `word_base` ... word_Ax = |- !f. ?! fn. !l. fn(WORD l) = f l NVAL_DEF = |- !f b l. NVAL f b(WORD l) = LVAL f b l Theorem RIGHT_ADD_DISTRIB autoloading from theory `arithmetic` ... RIGHT_ADD_DISTRIB = |- !m n p. (m + n) * p = (m * p) + (n * p) Definition MULT autoloading from theory `arithmetic` ... MULT = |- (!n. 0 * n = 0) /\ (!m n. (SUC m) * n = (m * n) + n) Definition SNOC autoloading from theory `list` ... SNOC = |- (!x. SNOC x[] = [x]) /\ (!x x' l. SNOC x(CONS x' l) = CONS x'(SNOC x l)) LVAL_SNOC = |- !l h f b. LVAL f b(SNOC h l) = ((LVAL f b l) * b) + (f h) Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) Theorem LESS_THM autoloading from theory `prim_rec` ... LESS_THM = |- !m n. m < (SUC n) = (m = n) \/ m < n LESS_SUC_IMP_LESS_EQ = |- !m n. m < (SUC n) = m <= n Theorem LESS_LESS_EQ_TRANS autoloading from theory `arithmetic` ... LESS_LESS_EQ_TRANS = |- !m n p. m < n /\ n <= p ==> m < p Theorem LESS_MONO_ADD autoloading from theory `arithmetic` ... LESS_MONO_ADD = |- !m n p. m < n ==> (m + p) < (n + p) Theorem ADD_SYM autoloading from theory `arithmetic` ... ADD_SYM = |- !m n. m + n = n + m LVAL_MAX_lem = |- !a b c y. (a + b) < (SUC c) /\ y < b ==> (a + y) < c Theorem LESS_OR autoloading from theory `arithmetic` ... LESS_OR = |- !m n. m < n ==> (SUC m) <= n Theorem LESS_EQ_LESS_EQ_MONO autoloading from theory `arithmetic` ... LESS_EQ_LESS_EQ_MONO = |- !m n p q. m <= p /\ n <= q ==> (m + n) <= (p + q) Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m <= m Theorem INDUCTION autoloading from theory `num` ... INDUCTION = |- !P. P 0 /\ (!n. P n ==> P(SUC n)) ==> (!n. P n) LESS_MULT_PLUS_DIFF = |- !n k l. k < l ==> ((k * n) + n) <= (l * n) Theorem LESS_EQ_IMP_LESS_SUC autoloading from theory `arithmetic` ... LESS_EQ_IMP_LESS_SUC = |- !n m. n <= m ==> n < (SUC m) Theorem LESS_0 autoloading from theory `prim_rec` ... LESS_0 = |- !n. 0 < (SUC n) LVAL_MAX = |- !l f b. (!x. (f x) < b) ==> (LVAL f b l) < (b EXP (LENGTH l)) NVAL_MAX = |- !f b. (!x. (f x) < b) ==> (!n. !w :: PWORDLEN n. (NVAL f b w) < (b EXP n)) NVAL0 = |- !f b. NVAL f b(WORD[]) = 0 NVAL1 = |- !f b x. NVAL f b(WORD[x]) = f x Theorem PWORDLEN0 autoloading from theory `word_base` ... PWORDLEN0 = |- !w. PWORDLEN 0 w ==> (w = WORD[]) NVAL_WORDLEN_0 = |- !w :: PWORDLEN 0. !fv r. NVAL fv r w = 0 Theorem SNOC_APPEND autoloading from theory `list` ... SNOC_APPEND = |- !x l. SNOC x l = APPEND l[x] Definition WCAT_DEF autoloading from theory `word_base` ... WCAT_DEF = |- !l1 l2. WCAT(WORD l1,WORD l2) = WORD(APPEND l1 l2) NVAL_WCAT1 = |- !w f b x. NVAL f b(WCAT(w,WORD[x])) = ((NVAL f b w) * b) + (f x) Theorem CONS_APPEND autoloading from theory `list` ... CONS_APPEND = |- !x l. CONS x l = APPEND[x]l NVAL_WCAT2 = |- !n. !w :: PWORDLEN n. !f b x. NVAL f b(WCAT(WORD[x],w)) = ((f x) * (b EXP n)) + (NVAL f b w) Theorem EXP_ADD autoloading from theory `arithmetic` ... EXP_ADD = |- !p q n. n EXP (p + q) = (n EXP p) * (n EXP q) Theorem EQ_MONO_ADD_EQ autoloading from theory `arithmetic` ... EQ_MONO_ADD_EQ = |- !m n p. (m + p = n + p) = (m = n) Theorem WCAT_PWORDLEN autoloading from theory `word_base` ... WCAT_PWORDLEN = |- !n1. !w1 :: PWORDLEN n1. !n2. !w2 :: PWORDLEN n2. PWORDLEN(n1 + n2)(WCAT(w1,w2)) Theorem WCAT_ASSOC autoloading from theory `word_base` ... WCAT_ASSOC = |- !w1 w2 w3. WCAT(w1,WCAT(w2,w3)) = WCAT(WCAT(w1,w2),w3) Theorem WORDLEN_SUC_WCAT_BIT_WSEG autoloading from theory `word_base` ... WORDLEN_SUC_WCAT_BIT_WSEG = |- !n. !w :: PWORDLEN(SUC n). w = WCAT(WORD[BIT n w],WSEG n 0 w) Definition ADD autoloading from theory `arithmetic` ... ADD = |- (!n. 0 + n = n) /\ (!m n. (SUC m) + n = SUC(m + n)) Theorem WCAT0 autoloading from theory `word_base` ... WCAT0 = |- !w. (WCAT(WORD[],w) = w) /\ (WCAT(w,WORD[]) = w) Theorem WSEG_PWORDLEN autoloading from theory `word_base` ... WSEG_PWORDLEN = |- !n. !w :: PWORDLEN n. !m k. (m + k) <= n ==> PWORDLEN m(WSEG m k w) Theorem LESS_EQ_SUC_REFL autoloading from theory `arithmetic` ... LESS_EQ_SUC_REFL = |- !m. m <= (SUC m) Theorem ADD_0 autoloading from theory `arithmetic` ... ADD_0 = |- !m. m + 0 = m NVAL_WCAT = |- !n m. !w1 :: PWORDLEN n. !w2 :: PWORDLEN m. !f b. NVAL f b(WCAT(w1,w2)) = ((NVAL f b w1) * (b EXP m)) + (NVAL f b w2) NLIST_DEF = |- (!frep b m. NLIST 0 frep b m = []) /\ (!n frep b m. NLIST(SUC n)frep b m = SNOC(frep(m MOD b))(NLIST n frep b(m DIV b))) NWORD_DEF = |- !n frep b m. NWORD n frep b m = WORD(NLIST n frep b m) NLIST_LENGTH = |- !n f b m. LENGTH(NLIST n f b m) = n Definition WORDLEN_DEF autoloading from theory `word_base` ... WORDLEN_DEF = |- !l. WORDLEN(WORD l) = LENGTH l NWORD_LENGTH = |- !n f b m. WORDLEN(NWORD n f b m) = n Definition PWORDLEN_DEF autoloading from theory `word_base` ... PWORDLEN_DEF = |- !n l. PWORDLEN n(WORD l) = (n = LENGTH l) NWORD_PWORDLEN = |- !n f b m. PWORDLEN n(NWORD n f b m) () : void File mk_word_num loaded () : void #rm -f bword_bitop.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `mk_bword_bitop`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool autoload_all = - : (string -> void) Loading library arith ... Loading library reduce ... Extending help search path. Loading boolean conversions........ Loading arithmetic conversions.................. Loading general conversions, rule and tactic..... Library reduce loaded. .Updating help search path ....................................................................................................................................................................................................................................................................................... Library arith loaded. () : void Loading library res_quan ... Updating search path Theory res_quan loaded ...............................................................................Updating help search path . Library res_quan loaded. () : void ....() : void File ver_202 loaded () : void .........................................................() : void Theory word_bitop loaded () : void [(); ()] : void list () : void ...() : void Theorem CONS_11 autoloading from theory `list` ... CONS_11 = |- !h t h' t'. (CONS h t = CONS h' t') = (h = h') /\ (t = t') Theorem INV_SUC_EQ autoloading from theory `prim_rec` ... INV_SUC_EQ = |- !m n. (SUC m = SUC n) = (m = n) Definition LENGTH autoloading from theory `list` ... LENGTH = |- (LENGTH[] = 0) /\ (!h t. LENGTH(CONS h t) = SUC(LENGTH t)) Definition MAP2 autoloading from theory `list` ... MAP2 = |- (!f. MAP2 f[][] = []) /\ (!f h1 t1 h2 t2. MAP2 f(CONS h1 t1)(CONS h2 t2) = CONS(f h1 h2)(MAP2 f t1 t2)) Definition SNOC autoloading from theory `list` ... SNOC = |- (!x. SNOC x[] = [x]) /\ (!x x' l. SNOC x(CONS x' l) = CONS x'(SNOC x l)) MAP2_SNOC = |- !f h1 h2 l1 l2. (LENGTH l1 = LENGTH l2) ==> (MAP2 f(SNOC h1 l1)(SNOC h2 l2) = SNOC(f h1 h2)(MAP2 f l1 l2)) Definition BUTLASTN autoloading from theory `list` ... BUTLASTN = |- (!l. BUTLASTN 0 l = l) /\ (!n x l. BUTLASTN(SUC n)(SNOC x l) = BUTLASTN n l) BUTLASTN_MAP2 = |- !l1 l2. (LENGTH l1 = LENGTH l2) ==> (!n. n <= (LENGTH l1) ==> (!f. BUTLASTN n(MAP2 f l1 l2) = MAP2 f(BUTLASTN n l1)(BUTLASTN n l2))) Theorem SNOC_11 autoloading from theory `list` ... SNOC_11 = |- !x l x' l'. (SNOC x l = SNOC x' l') = (x = x') /\ (l = l') Theorem LENGTH_LASTN autoloading from theory `list` ... LENGTH_LASTN = |- !n l. n <= (LENGTH l) ==> (LENGTH(LASTN n l) = n) Definition LASTN autoloading from theory `list` ... LASTN = |- (!l. LASTN 0 l = []) /\ (!n x l. LASTN(SUC n)(SNOC x l) = SNOC x(LASTN n l)) LASTN_MAP2 = |- !l1 l2. (LENGTH l1 = LENGTH l2) ==> (!n. n <= (LENGTH l1) ==> (!f. LASTN n(MAP2 f l1 l2) = MAP2 f(LASTN n l1)(LASTN n l2))) Theorem word_Ax autoloading from theory `word_base` ... word_Ax = |- !f. ?! fn. !l. fn(WORD l) = f l WNOT_DEF = |- !l. WNOT(WORD l) = WORD(MAP $~ l) Theorem LENGTH_BUTLASTN autoloading from theory `list` ... LENGTH_BUTLASTN = |- !n l. n <= (LENGTH l) ==> (LENGTH(BUTLASTN n l) = (LENGTH l) - n) Theorem LASTN_MAP autoloading from theory `list` ... LASTN_MAP = |- !n l. n <= (LENGTH l) ==> (!f. LASTN n(MAP f l) = MAP f(LASTN n l)) Theorem BUTLASTN_MAP autoloading from theory `list` ... BUTLASTN_MAP = |- !n l. n <= (LENGTH l) ==> (!f. BUTLASTN n(MAP f l) = MAP f(BUTLASTN n l)) Theorem WORD_11 autoloading from theory `word_base` ... WORD_11 = |- !l l'. (WORD l = WORD l') = (l = l') Theorem LENGTH_MAP autoloading from theory `list` ... LENGTH_MAP = |- !l f. LENGTH(MAP f l) = LENGTH l Definition WSEG_DEF autoloading from theory `word_base` ... WSEG_DEF = |- !m k l. WSEG m k(WORD l) = WORD(LASTN m(BUTLASTN k l)) Definition PWORDLEN_DEF autoloading from theory `word_base` ... PWORDLEN_DEF = |- !n l. PWORDLEN n(WORD l) = (n = LENGTH l) BIT_WNOT_SYM_lemma = |- !n. !w :: PWORDLEN n. PWORDLEN n(WNOT w) /\ (!m k. (m + k) <= n ==> (WNOT(WSEG m k w) = WSEG m k(WNOT w))) Definition PBITOP_DEF autoloading from theory `word_bitop` ... PBITOP_DEF = |- !op. PBITOP op = (!n. !w :: PWORDLEN n. PWORDLEN n(op w) /\ (!m k. (m + k) <= n ==> (op(WSEG m k w) = WSEG m k(op w)))) PBITOP_WNOT = |- PBITOP WNOT Definition MAP autoloading from theory `list` ... MAP = |- (!f. MAP f[] = []) /\ (!f h t. MAP f(CONS h t) = CONS(f h)(MAP f t)) WNOT_WNOT = |- !w. WNOT(WNOT w) = w Theorem MAP_APPEND autoloading from theory `list` ... MAP_APPEND = |- !f l1 l2. MAP f(APPEND l1 l2) = APPEND(MAP f l1)(MAP f l2) Definition WCAT_DEF autoloading from theory `word_base` ... WCAT_DEF = |- !l1 l2. WCAT(WORD l1,WORD l2) = WORD(APPEND l1 l2) WCAT_WNOT = |- !n1 n2. !w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. WCAT(WNOT w1,WNOT w2) = WNOT(WCAT(w1,w2)) Theorem LENGTH_MAP2 autoloading from theory `list` ... LENGTH_MAP2 = |- !l1 l2. (LENGTH l1 = LENGTH l2) ==> (!f. (LENGTH(MAP2 f l1 l2) = LENGTH l1) /\ (LENGTH(MAP2 f l1 l2) = LENGTH l2)) LENGTH_MAP22 = |- !l1 l2 f. (LENGTH l1 = LENGTH l2) ==> (LENGTH(MAP2 f l1 l2) = LENGTH l2) Theorem PBITBOP_EXISTS autoloading from theory `word_bitop` ... PBITBOP_EXISTS = |- !f. ?fn. !l1 l2. fn(WORD l1)(WORD l2) = WORD(MAP2 f l1 l2) WAND_DEF = |- !l1 l2. (WORD l1) WAND (WORD l2) = WORD(MAP2 $/\ l1 l2) PBITBOP_WAND_lemma = |- !n. !w1 w2 :: PWORDLEN n. PWORDLEN n(w1 WAND w2) /\ (!m k. (m + k) <= n ==> ((WSEG m k w1) WAND (WSEG m k w2) = WSEG m k(w1 WAND w2))) Definition PBITBOP_DEF autoloading from theory `word_bitop` ... PBITBOP_DEF = |- !op. PBITBOP op = (!n. !w1 :: PWORDLEN n. !w2 :: PWORDLEN n. PWORDLEN n(op w1 w2) /\ (!m k. (m + k) <= n ==> (op(WSEG m k w1)(WSEG m k w2) = WSEG m k(op w1 w2)))) PBITBOP_WAND = |- PBITBOP $WAND WOR_DEF = |- !l1 l2. (WORD l1) WOR (WORD l2) = WORD(MAP2 $\/ l1 l2) PBITBOP_WOR_lemma = |- !n. !w1 w2 :: PWORDLEN n. PWORDLEN n(w1 WOR w2) /\ (!m k. (m + k) <= n ==> ((WSEG m k w1) WOR (WSEG m k w2) = WSEG m k(w1 WOR w2))) PBITBOP_WOR = |- PBITBOP $WOR WXOR_DEF = |- !l1 l2. (WORD l1) WXOR (WORD l2) = WORD(MAP2(\x y. ~(x = y))l1 l2) PBITBOP_WXOR_lemma = |- !n. !w1 w2 :: PWORDLEN n. PWORDLEN n(w1 WXOR w2) /\ (!m k. (m + k) <= n ==> ((WSEG m k w1) WXOR (WSEG m k w2) = WSEG m k(w1 WXOR w2))) PBITBOP_WXOR = |- PBITBOP $WXOR () : void File mk_bword_bitop loaded () : void #rm -f bword_num.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `mk_bword_num`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool autoload_all = - : (string -> void) Loading library arith ... Loading library reduce ... Extending help search path. Loading boolean conversions........ Loading arithmetic conversions.................. Loading general conversions, rule and tactic..... Library reduce loaded. .Updating help search path ....................................................................................................................................................................................................................................................................................... Library arith loaded. () : void Loading library res_quan ... Updating search path Theory res_quan loaded ...............................................................................Updating help search path . Library res_quan loaded. () : void ....() : void File ver_202 loaded () : void .........................................................() : void Theory word_bitop loaded () : void () : void Theory word_num loaded () : void [(); (); ()] : void list ...() : void BV_DEF = |- !b. BV b = (b => SUC 0 | 0) Theorem word_Ax autoloading from theory `word_base` ... word_Ax = |- !f. ?! fn. !l. fn(WORD l) = f l BNVAL_DEF = |- !l. BNVAL(WORD l) = LVAL BV 2 l BV_LESS_2 = |- !x. (BV x) < 2 Definition NVAL_DEF autoloading from theory `word_num` ... NVAL_DEF = |- !f b l. NVAL f b(WORD l) = LVAL f b l BNVAL_NVAL = |- !w. BNVAL w = NVAL BV 2 w Theorem NVAL0 autoloading from theory `word_num` ... NVAL0 = |- !f b. NVAL f b(WORD[]) = 0 BNVAL0 = |- BNVAL(WORD[]) = 0 Theorem SUC_LESS autoloading from theory `prim_rec` ... SUC_LESS = |- !m n. (SUC m) < n ==> m < n Theorem INV_SUC_EQ autoloading from theory `prim_rec` ... INV_SUC_EQ = |- !m n. (SUC m = SUC n) = (m = n) Theorem NOT_SUC autoloading from theory `num` ... NOT_SUC = |- !n. ~(SUC n = 0) Theorem ADD_EQ_0 autoloading from theory `arithmetic` ... ADD_EQ_0 = |- !m n. (m + n = 0) = (m = 0) /\ (n = 0) Theorem LESS_NOT_EQ autoloading from theory `prim_rec` ... LESS_NOT_EQ = |- !m n. m < n ==> ~(m = n) BNVAL_11_lem = |- !m n p. m < p /\ n < p ==> ~(p + m = n) Theorem EQ_MONO_ADD_EQ autoloading from theory `arithmetic` ... EQ_MONO_ADD_EQ = |- !m n p. (m + p = n + p) = (m = n) Theorem CONS_11 autoloading from theory `list` ... CONS_11 = |- !h t h' t'. (CONS h t = CONS h' t') = (h = h') /\ (t = t') Theorem LVAL autoloading from theory `word_num` ... LVAL = |- (!f b. LVAL f b[] = 0) /\ (!l f b x. LVAL f b(CONS x l) = ((f x) * (b EXP (LENGTH l))) + (LVAL f b l)) Theorem WORD_11 autoloading from theory `word_base` ... WORD_11 = |- !l l'. (WORD l = WORD l') = (l = l') Definition WORDLEN_DEF autoloading from theory `word_base` ... WORDLEN_DEF = |- !l. WORDLEN(WORD l) = LENGTH l Theorem LVAL_MAX autoloading from theory `word_num` ... LVAL_MAX = |- !l f b. (!x. (f x) < b) ==> (LVAL f b l) < (b EXP (LENGTH l)) BNVAL_11 = |- !w1 w2. (WORDLEN w1 = WORDLEN w2) ==> (BNVAL w1 = BNVAL w2) ==> (w1 = w2) BNVAL_ONTO = |- !w. ?n. BNVAL w = n BNVAL_MAX = |- !n. !w :: PWORDLEN n. (BNVAL w) < (2 EXP n) Theorem LVAL_SNOC autoloading from theory `word_num` ... LVAL_SNOC = |- !l h f b. LVAL f b(SNOC h l) = ((LVAL f b l) * b) + (f h) Theorem SNOC_APPEND autoloading from theory `list` ... SNOC_APPEND = |- !x l. SNOC x l = APPEND l[x] Definition WCAT_DEF autoloading from theory `word_base` ... WCAT_DEF = |- !l1 l2. WCAT(WORD l1,WORD l2) = WORD(APPEND l1 l2) BNVAL_WCAT1 = |- !n. !w :: PWORDLEN n. !x. BNVAL(WCAT(w,WORD[x])) = ((BNVAL w) * 2) + (BV x) Theorem NVAL_WCAT2 autoloading from theory `word_num` ... NVAL_WCAT2 = |- !n. !w :: PWORDLEN n. !f b x. NVAL f b(WCAT(WORD[x],w)) = ((f x) * (b EXP n)) + (NVAL f b w) BNVAL_WCAT2 = |- !n. !w :: PWORDLEN n. !x. BNVAL(WCAT(WORD[x],w)) = ((BV x) * (2 EXP n)) + (BNVAL w) Theorem NVAL_WCAT autoloading from theory `word_num` ... NVAL_WCAT = |- !n m. !w1 :: PWORDLEN n. !w2 :: PWORDLEN m. !f b. NVAL f b(WCAT(w1,w2)) = ((NVAL f b w1) * (b EXP m)) + (NVAL f b w2) BNVAL_WCAT = |- !n m. !w1 :: PWORDLEN n. !w2 :: PWORDLEN m. BNVAL(WCAT(w1,w2)) = ((BNVAL w1) * (2 EXP m)) + (BNVAL w2) VB_DEF = |- !n. VB n = ~(n MOD 2 = 0) NBWORD_DEF = |- !n m. NBWORD n m = WORD(NLIST n VB 2 m) Definition NLIST_DEF autoloading from theory `word_num` ... NLIST_DEF = |- (!frep b m. NLIST 0 frep b m = []) /\ (!n frep b m. NLIST(SUC n)frep b m = SNOC(frep(m MOD b))(NLIST n frep b(m DIV b))) NBWORD0 = |- !m. NBWORD 0 m = WORD[] Theorem LENGTH_SNOC autoloading from theory `list` ... LENGTH_SNOC = |- !x l. LENGTH(SNOC x l) = SUC(LENGTH l) Definition LENGTH autoloading from theory `list` ... LENGTH = |- (LENGTH[] = 0) /\ (!h t. LENGTH(CONS h t) = SUC(LENGTH t)) NLIST_LENGTH = |- !n f b m. LENGTH(NLIST n f b m) = n WORDLEN_NBWORD = |- !n m. WORDLEN(NBWORD n m) = n Theorem PWORDLEN autoloading from theory `word_base` ... PWORDLEN = |- !n w. PWORDLEN n w = (WORDLEN w = n) PWORDLEN_NBWORD = |- !n m. PWORDLEN n(NBWORD n m) Theorem WORD_SNOC_WCAT autoloading from theory `word_base` ... WORD_SNOC_WCAT = |- !x l. WORD(SNOC x l) = WCAT(WORD l,WORD[x]) NBWORD_SUC = |- !n m. NBWORD(SUC n)m = WCAT(NBWORD n(m DIV 2),WORD[VB(m MOD 2)]) Theorem SUC_ID autoloading from theory `prim_rec` ... SUC_ID = |- !n. ~(SUC n = n) Theorem LESS_MOD autoloading from theory `arithmetic` ... LESS_MOD = |- !n k. k < n ==> (k MOD n = k) VB_BV = |- !x. VB(BV x) = x Theorem ZERO_MOD autoloading from theory `arithmetic` ... ZERO_MOD = |- !n. 0 < n ==> (0 MOD n = 0) Theorem ZERO_DIV autoloading from theory `arithmetic` ... ZERO_DIV = |- !n. 0 < n ==> (0 DIV n = 0) BV_VB = |- !x. x < 2 ==> (BV(VB x) = x) Theorem MOD_EQ_0 autoloading from theory `arithmetic` ... MOD_EQ_0 = |- !n. 0 < n ==> (!k. (k * n) MOD n = 0) Theorem MOD_MOD autoloading from theory `arithmetic` ... MOD_MOD = |- !n. 0 < n ==> (!k. (k MOD n) MOD n = k MOD n) Theorem SNOC_11 autoloading from theory `list` ... SNOC_11 = |- !x l x' l'. (SNOC x l = SNOC x' l') = (x = x') /\ (l = l') NBWORD_BNVAL = |- !n. !w :: PWORDLEN n. NBWORD n(BNVAL w) = w Theorem LESS_MULT_MONO autoloading from theory `arithmetic` ... LESS_MULT_MONO = |- !m i n. ((SUC n) * m) < ((SUC n) * i) = m < i Theorem ZERO_LESS_EXP autoloading from theory `arithmetic` ... ZERO_LESS_EXP = |- !m n. 0 < ((SUC n) EXP m) Definition EXP autoloading from theory `arithmetic` ... EXP = |- (!m. m EXP 0 = 1) /\ (!m n. m EXP (SUC n) = m * (m EXP n)) Definition DIVISION autoloading from theory `arithmetic` ... DIVISION = |- !n. 0 < n ==> (!k. (k = ((k DIV n) * n) + (k MOD n)) /\ (k MOD n) < n) BNVAL_NBWORD = |- !n m. m < (2 EXP n) ==> (BNVAL(NBWORD n m) = m) ZERO_WORD_VAL = |- !n. !w :: PWORDLEN n. (w = NBWORD n 0) = (BNVAL w = 0) Theorem WCAT_ASSOC autoloading from theory `word_base` ... WCAT_ASSOC = |- !w1 w2 w3. WCAT(w1,WCAT(w2,w3)) = WCAT(WCAT(w1,w2),w3) Theorem ADD_SUC autoloading from theory `arithmetic` ... ADD_SUC = |- !m n. SUC(m + n) = m + (SUC n) Theorem WCAT0 autoloading from theory `word_base` ... WCAT0 = |- !w. (WCAT(WORD[],w) = w) /\ (WCAT(w,WORD[]) = w) WCAT_NBWORD_0 = |- !n1 n2. WCAT(NBWORD n1 0,NBWORD n2 0) = NBWORD(n1 + n2)0 WSPLIT_NBWORD_0 = |- !m n. m <= n ==> (WSPLIT m(NBWORD n 0) = NBWORD(n - m)0,NBWORD m 0) Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m <= m Theorem WSEG_PWORDLEN autoloading from theory `word_base` ... WSEG_PWORDLEN = |- !n. !w :: PWORDLEN n. !m k. (m + k) <= n ==> PWORDLEN m(WSEG m k w) Theorem WCAT_11 autoloading from theory `word_base` ... WCAT_11 = |- !m n. !wm1 wm2 :: PWORDLEN m. !wn1 wn2 :: PWORDLEN n. (WCAT(wm1,wn1) = WCAT(wm2,wn2)) = (wm1 = wm2) /\ (wn1 = wn2) Theorem WSPLIT_WSEG autoloading from theory `word_base` ... WSPLIT_WSEG = |- !n. !w :: PWORDLEN n. !k. k <= n ==> (WSPLIT k w = WSEG(n - k)k w,WSEG k 0 w) EQ_NBWORD0_SPLIT = |- !n. !w :: PWORDLEN n. !m. m <= n ==> ((w = NBWORD n 0) = (WSEG(n - m)m w = NBWORD(n - m)0) /\ (WSEG m 0 w = NBWORD m 0)) Theorem MULT_0 autoloading from theory `arithmetic` ... MULT_0 = |- !m. m * 0 = 0 LESS2_DIV2 = |- !r y. 0 < y /\ r < (2 * y) ==> (r DIV 2) < y less2 = |- 0 < 2 MOD_DIV_lemma = |- !x y. 0 < y ==> ((x MOD (2 * y)) DIV 2 = (x DIV 2) MOD y) Definition PWORDLEN_DEF autoloading from theory `word_base` ... PWORDLEN_DEF = |- !n l. PWORDLEN n(WORD l) = (n = LENGTH l) NBWORD_MOD = |- !n m. NBWORD n(m MOD (2 EXP n)) = NBWORD n m Theorem WSEG_WORD_LENGTH autoloading from theory `word_base` ... WSEG_WORD_LENGTH = |- !n. !w :: PWORDLEN n. WSEG n 0 w = w Theorem SUC_SUB1 autoloading from theory `arithmetic` ... SUC_SUB1 = |- !m. (SUC m) - 1 = m Theorem ZERO_LESS_EQ autoloading from theory `arithmetic` ... ZERO_LESS_EQ = |- !n. 0 <= n Theorem LESS_EQ_SUC_REFL autoloading from theory `arithmetic` ... LESS_EQ_SUC_REFL = |- !m. m <= (SUC m) Theorem PWORDLEN1 autoloading from theory `word_base` ... PWORDLEN1 = |- !x. PWORDLEN 1(WORD[x]) Theorem WSEG_WCAT_WSEG autoloading from theory `word_base` ... WSEG_WCAT_WSEG = |- !n1 n2. !w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. !m k. (m + k) <= (n1 + n2) /\ k < n2 /\ n2 <= (m + k) ==> (WSEG m k(WCAT(w1,w2)) = WCAT(WSEG((m + k) - n2)0 w1,WSEG(n2 - k)k w2)) Theorem WSEG0 autoloading from theory `word_base` ... WSEG0 = |- !k w. WSEG 0 k w = WORD[] WSEG_NBWORD_SUC = |- !n m. WSEG n 0(NBWORD(SUC n)m) = NBWORD n m Theorem NVAL_MAX autoloading from theory `word_num` ... NVAL_MAX = |- !f b. (!x. (f x) < b) ==> (!n. !w :: PWORDLEN n. (NVAL f b w) < (b EXP n)) Theorem WORDLEN_SUC_WCAT_BIT_WSEG autoloading from theory `word_base` ... WORDLEN_SUC_WCAT_BIT_WSEG = |- !n. !w :: PWORDLEN(SUC n). w = WCAT(WORD[BIT n w],WSEG n 0 w) NBWORD_SUC_WSEG = |- !n. !w :: PWORDLEN(SUC n). NBWORD n(BNVAL w) = WSEG n 0 w Theorem TIMES2 autoloading from theory `arithmetic` ... TIMES2 = |- !n. 2 * n = n + n Definition SHL_DEF autoloading from theory `word_bitop` ... SHL_DEF = |- !f w b. SHL f w b = BIT(PRE(WORDLEN w))w, WCAT(WSEG(PRE(WORDLEN w))0 w,(f => WSEG 1 0 w | WORD[b])) DOUBLE_EQ_SHL = |- !n. 0 < n ==> (!w :: PWORDLEN n. !b. NBWORD n((BNVAL w) + ((BNVAL w) + (BV b))) = SND(SHL F w b)) Theorem LESS_ADD_SUC autoloading from theory `arithmetic` ... LESS_ADD_SUC = |- !m n. m < (m + (SUC n)) Theorem BIT_WCAT_FST autoloading from theory `word_base` ... BIT_WCAT_FST = |- !n1 n2. !w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. !k. n2 <= k /\ k < (n1 + n2) ==> (BIT k(WCAT(w1,w2)) = BIT(k - n2)w1) Definition SNOC autoloading from theory `list` ... SNOC = |- (!x. SNOC x[] = [x]) /\ (!x x' l. SNOC x(CONS x' l) = CONS x'(SNOC x l)) Theorem BIT0 autoloading from theory `word_base` ... BIT0 = |- !b. BIT 0(WORD[b]) = b MSB_NBWORD = |- !n m. BIT n(NBWORD(SUC n)m) = VB((m DIV (2 EXP n)) MOD 2) ZERO_LESS_TWO_EXP = |- !m. 0 < (2 EXP m) NBWORD_SPLIT = |- !n1 n2 m. NBWORD(n1 + n2)m = WCAT(NBWORD n1(m DIV (2 EXP n2)),NBWORD n2 m) Theorem WSEG_WCAT2 autoloading from theory `word_base` ... WSEG_WCAT2 = |- !n1 n2. !w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. WSEG n2 0(WCAT(w1,w2)) = w2 Theorem SUB_EQUAL_0 autoloading from theory `arithmetic` ... SUB_EQUAL_0 = |- !c. c - c = 0 Theorem WSEG_WCAT_WSEG1 autoloading from theory `word_base` ... WSEG_WCAT_WSEG1 = |- !n1 n2. !w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. !m k. m <= n1 /\ n2 <= k ==> (WSEG m k(WCAT(w1,w2)) = WSEG m(k - n2)w1) WSEG_NBWORD = |- !m k n. (m + k) <= n ==> (!l. WSEG m k(NBWORD n l) = NBWORD m(l DIV (2 EXP k))) NBWORD_SUC_FST = |- !n m. NBWORD(SUC n)m = WCAT(WORD[VB((m DIV (2 EXP n)) MOD 2)],NBWORD n m) Theorem BIT_WSEG autoloading from theory `word_base` ... BIT_WSEG = |- !n. !w :: PWORDLEN n. !m k j. (m + k) <= n ==> j < m ==> (BIT j(WSEG m k w) = BIT(j + k)w) BIT_NBWORD0 = |- !k n. k < n ==> (BIT k(NBWORD n 0) = F) add_lem = |- !m1 m2 n1 n2 p. ((m1 * p) + n1) + ((m2 * p) + n2) = ((m1 * p) + (m2 * p)) + (n1 + n2) ADD_BNVAL_LEFT = |- !n. !w1 w2 :: PWORDLEN(SUC n). (BNVAL w1) + (BNVAL w2) = (((BV(BIT n w1)) + (BV(BIT n w2))) * (2 EXP n)) + ((BNVAL(WSEG n 0 w1)) + (BNVAL(WSEG n 0 w2))) Theorem WORDLEN_SUC_WCAT_BIT_WSEG_RIGHT autoloading from theory `word_base` ... WORDLEN_SUC_WCAT_BIT_WSEG_RIGHT = |- !n. !w :: PWORDLEN(SUC n). w = WCAT(WSEG n 1 w,WORD[BIT 0 w]) ADD_BNVAL_RIGHT = |- !n. !w1 w2 :: PWORDLEN(SUC n). (BNVAL w1) + (BNVAL w2) = (((BNVAL(WSEG n 1 w1)) + (BNVAL(WSEG n 1 w2))) * 2) + ((BV(BIT 0 w1)) + (BV(BIT 0 w2))) Theorem WCAT_WSEG_WSEG autoloading from theory `word_base` ... WCAT_WSEG_WSEG = |- !n. !w :: PWORDLEN n. !m1 m2 k. (m1 + (m2 + k)) <= n ==> (WCAT(WSEG m2(m1 + k)w,WSEG m1 k w) = WSEG(m1 + m2)k w) ADD_BNVAL_SPLIT = |- !n1 n2. !w1 w2 :: PWORDLEN(n1 + n2). (BNVAL w1) + (BNVAL w2) = (((BNVAL(WSEG n1 n2 w1)) + (BNVAL(WSEG n1 n2 w2))) * (2 EXP n2)) + ((BNVAL(WSEG n2 0 w1)) + (BNVAL(WSEG n2 0 w2))) () : void File mk_bword_num loaded () : void #rm -f bword_arith.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `mk_bword_arith`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool autoload_all = - : (string -> void) Loading library arith ... Loading library reduce ... Extending help search path. Loading boolean conversions........ Loading arithmetic conversions.................. Loading general conversions, rule and tactic..... Library reduce loaded. .Updating help search path ....................................................................................................................................................................................................................................................................................... Library arith loaded. () : void Loading library res_quan ... Updating search path Theory res_quan loaded ...............................................................................Updating help search path . Library res_quan loaded. () : void ....() : void File ver_202 loaded () : void .........................................................() : void Theory bword_num loaded () : void [(); (); ()] : void list () : void MULT_LEFT_1 = |- !m. 1 * m = m ADD_DIV_SUC_DIV = |- !n. 0 < n ==> (!r. (n + r) DIV n = SUC(r DIV n)) Theorem LESS_EQ autoloading from theory `arithmetic` ... LESS_EQ = |- !m n. m < n = (SUC m) <= n Theorem ZERO_LESS_EQ autoloading from theory `arithmetic` ... ZERO_LESS_EQ = |- !n. 0 <= n LESS_IMP_LESS_EQ_PRE = |- !m n. 0 < n ==> (m < n = m <= (PRE n)) LESS_MONO_DIV = |- !n. 0 < n ==> (!p q. p < q ==> (p DIV n) <= (q DIV n)) Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m <= m Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) LESS_EQ_MONO_DIV = |- !n. 0 < n ==> (!p q. p <= q ==> (p DIV n) <= (q DIV n)) Theorem PRE_SUC_EQ autoloading from theory `arithmetic` ... PRE_SUC_EQ = |- !m n. 0 < n ==> ((m = PRE n) = (SUC m = n)) SUC_PRE = |- !n. 0 < n ==> (SUC(PRE n) = n) Theorem TIMES2 autoloading from theory `arithmetic` ... TIMES2 = |- !n. 2 * n = n + n Definition EXP autoloading from theory `arithmetic` ... EXP = |- (!m. m EXP 0 = 1) /\ (!m n. m EXP (SUC n) = m * (m EXP n)) ONE_LESS_TWO_EXP_SUC = |- !n. 1 < (2 EXP (SUC n)) ADD_MONO_EQ = |- !m n p. (p + m = p + n) = (m = n) ACARRY_DEF = |- (!w1 w2 cin. ACARRY 0 w1 w2 cin = cin) /\ (!n w1 w2 cin. ACARRY(SUC n)w1 w2 cin = VB (((BV(BIT n w1)) + ((BV(BIT n w2)) + (BV(ACARRY n w1 w2 cin)))) DIV 2)) ICARRY_DEF = |- (!w1 w2 cin. ICARRY 0 w1 w2 cin = cin) /\ (!n w1 w2 cin. ICARRY(SUC n)w1 w2 cin = BIT n w1 /\ BIT n w2 \/ (BIT n w1 \/ BIT n w2) /\ ICARRY n w1 w2 cin) Theorem ZERO_MOD autoloading from theory `arithmetic` ... ZERO_MOD = |- !n. 0 < n ==> (0 MOD n = 0) Theorem ZERO_DIV autoloading from theory `arithmetic` ... ZERO_DIV = |- !n. 0 < n ==> (0 DIV n = 0) div_mod_lemmas = [|- !x. (SUC(SUC x)) DIV 2 = SUC(x DIV 2); |- (SUC 0) DIV 2 = 0; |- 0 DIV 2 = 0; |- (SUC 0) MOD 2 = SUC 0; |- 0 MOD 2 = 0] : thm list Theorem SUC_NOT autoloading from theory `arithmetic` ... SUC_NOT = |- !n. ~(0 = SUC n) Theorem NOT_SUC autoloading from theory `num` ... NOT_SUC = |- !n. ~(SUC n = 0) Definition VB_DEF autoloading from theory `bword_num` ... VB_DEF = |- !n. VB n = ~(n MOD 2 = 0) Definition BV_DEF autoloading from theory `bword_num` ... BV_DEF = |- !b. BV b = (b => SUC 0 | 0) Theorem LESS_IMP_LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_IMP_LESS_OR_EQ = |- !m n. m < n ==> m <= n ACARRY_EQ_ICARRY = |- !n. !w1 w2 :: PWORDLEN n. !cin k. k <= n ==> (ACARRY k w1 w2 cin = ICARRY k w1 w2 cin) Less2 = |- 0 < 2 Less2_SUC0 = |- (SUC 0) < 2 Theorem LESS_EQ_SUC_REFL autoloading from theory `arithmetic` ... LESS_EQ_SUC_REFL = |- !m. m <= (SUC m) BV_LESS_EQ_1 = |- !x. (BV x) <= 1 Theorem LESS_EQ_LESS_EQ_MONO autoloading from theory `arithmetic` ... LESS_EQ_LESS_EQ_MONO = |- !m n p q. m <= p /\ n <= q ==> (m + n) <= (p + q) ADD_BV_LESS_EQ_2 = |- !x1 x2. ((BV x1) + (BV x2)) <= 2 LESS_EQ1_LESS2 = |- n < 2 = n <= 1 Theorem BNVAL_MAX autoloading from theory `bword_num` ... BNVAL_MAX = |- !n. !w :: PWORDLEN n. (BNVAL w) < (2 EXP n) Theorem ZERO_LESS_EXP autoloading from theory `arithmetic` ... ZERO_LESS_EXP = |- !m n. 0 < ((SUC n) EXP m) Theorem PRE_SUB1 autoloading from theory `arithmetic` ... PRE_SUB1 = |- !m. PRE m = m - 1 BNVAL_LESS_EQ = |- !n. !w :: PWORDLEN n. (BNVAL w) <= ((2 EXP n) - 1) Theorem LESS_MONO_MULT autoloading from theory `arithmetic` ... LESS_MONO_MULT = |- !m n p. m <= n ==> (m * p) <= (n * p) Theorem LEFT_SUB_DISTRIB autoloading from theory `arithmetic` ... LEFT_SUB_DISTRIB = |- !m n p. p * (m - n) = (p * m) - (p * n) ADD_BNVAL_LESS_EQ = |- !n. !w1 w2 :: PWORDLEN n. !cin. ((BNVAL w1) + ((BNVAL w2) + (BV cin))) <= ((2 EXP (SUC n)) - 1) ZERO_LESS_TWO_EXP = |- !m. 0 < (2 EXP m) EXP_SUB1_LESS = |- ((2 EXP n) - 1) < (2 EXP n) ADD_BNVAL_LESS_EQ1 = |- !n cin. !w1 w2 :: PWORDLEN n. (((BNVAL w1) + ((BNVAL w2) + (BV cin))) DIV (2 EXP n)) <= (SUC 0) ADD_BV_BNVAL_DIV_LESS_EQ1 = |- !n x1 x2 cin. !w1 w2 :: PWORDLEN n. ((((BV x1) + (BV x2)) + (((BNVAL w1) + ((BNVAL w2) + (BV cin))) DIV (2 EXP n))) DIV 2) <= 1 Theorem SUC_LESS autoloading from theory `prim_rec` ... SUC_LESS = |- !m n. (SUC m) < n ==> m < n ADD_BV_BNVAL_LESS_EQ = |- !n x1 x2 cin. !w1 w2 :: PWORDLEN n. (((BV x1) + (BV x2)) + ((BNVAL w1) + ((BNVAL w2) + (BV cin)))) <= (SUC(2 EXP (SUC n))) ADD_BV_BNVAL_LESS_EQ1 = |- !n x1 x2 cin. !w1 w2 :: PWORDLEN n. ((((BV x1) + (BV x2)) + ((BNVAL w1) + ((BNVAL w2) + (BV cin)))) DIV (2 EXP (n + 1))) <= 1 Theorem WSEG_PWORDLEN autoloading from theory `word_base` ... WSEG_PWORDLEN = |- !n. !w :: PWORDLEN n. !m k. (m + k) <= n ==> PWORDLEN m(WSEG m k w) seg_pw = |- !w. PWORDLEN n w ==> (SUC k) <= n ==> PWORDLEN(SUC k)(WSEG(SUC k)0 w) Theorem BIT_WSEG autoloading from theory `word_base` ... BIT_WSEG = |- !n. !w :: PWORDLEN n. !m k j. (m + k) <= n ==> j < m ==> (BIT j(WSEG m k w) = BIT(j + k)w) bit_thm = |- !w. PWORDLEN n w ==> (SUC k) <= n ==> (BIT k(WSEG(SUC k)0 w) = BIT k w) Theorem WSEG_WSEG autoloading from theory `word_base` ... WSEG_WSEG = |- !n. !w :: PWORDLEN n. !m1 k1 m2 k2. (m1 + k1) <= n /\ (m2 + k2) <= m1 ==> (WSEG m2 k2(WSEG m1 k1 w) = WSEG m2(k1 + k2)w) seg_thm = |- !w. PWORDLEN n w ==> (SUC k) <= n ==> (WSEG k 0(WSEG(SUC k)0 w) = WSEG k 0 w) seg_pw_thm' = |- !w. PWORDLEN n w ==> k <= n ==> PWORDLEN k(WSEG k 0 w) spec_thm = - : (thm -> thm list) Theorem ADD_BNVAL_LEFT autoloading from theory `bword_num` ... ADD_BNVAL_LEFT = |- !n. !w1 w2 :: PWORDLEN(SUC n). (BNVAL w1) + (BNVAL w2) = (((BV(BIT n w1)) + (BV(BIT n w2))) * (2 EXP n)) + ((BNVAL(WSEG n 0 w1)) + (BNVAL(WSEG n 0 w2))) add_left = ... |- (BNVAL(WSEG(SUC k)0 w1)) + (BNVAL(WSEG(SUC k)0 w2)) = (((BV(BIT k w1)) + (BV(BIT k w2))) * (2 EXP k)) + ((BNVAL(WSEG k 0 w1)) + (BNVAL(WSEG k 0 w2))) less1_lem = ... |- ((((BV(BIT k w1)) + (BV(BIT k w2))) + (((BNVAL(WSEG k 0 w1)) + ((BNVAL(WSEG k 0 w2)) + (BV cin))) DIV (2 EXP k))) DIV 2) <= 1 Theorem BV_VB autoloading from theory `bword_num` ... BV_VB = |- !x. x < 2 ==> (BV(VB x) = x) Theorem BNVAL0 autoloading from theory `bword_num` ... BNVAL0 = |- BNVAL(WORD[]) = 0 Theorem WSEG0 autoloading from theory `word_base` ... WSEG0 = |- !k w. WSEG 0 k w = WORD[] ACARRY_EQ_ADD_DIV = |- !n. !w1 w2 :: PWORDLEN n. !k. k < n ==> (BV(ACARRY k w1 w2 cin) = ((BNVAL(WSEG k 0 w1)) + ((BNVAL(WSEG k 0 w2)) + (BV cin))) DIV (2 EXP k)) Theorem NBWORD_MOD autoloading from theory `bword_num` ... NBWORD_MOD = |- !n m. NBWORD n(m MOD (2 EXP n)) = NBWORD n m Theorem LESS_ADD_NONZERO autoloading from theory `arithmetic` ... LESS_ADD_NONZERO = |- !m n. ~(n = 0) ==> m < (m + n) Theorem NBWORD_SPLIT autoloading from theory `bword_num` ... NBWORD_SPLIT = |- !n1 n2 m. NBWORD(n1 + n2)m = WCAT(NBWORD n1(m DIV (2 EXP n2)),NBWORD n2 m) Theorem WSEG_WORD_LENGTH autoloading from theory `word_base` ... WSEG_WORD_LENGTH = |- !n. !w :: PWORDLEN n. WSEG n 0 w = w Theorem WCAT0 autoloading from theory `word_base` ... WCAT0 = |- !w. (WCAT(WORD[],w) = w) /\ (WCAT(w,WORD[]) = w) Theorem NBWORD0 autoloading from theory `bword_num` ... NBWORD0 = |- !m. NBWORD 0 m = WORD[] Theorem PWORDLEN_NBWORD autoloading from theory `bword_num` ... PWORDLEN_NBWORD = |- !n m. PWORDLEN n(NBWORD n m) Theorem WCAT_11 autoloading from theory `word_base` ... WCAT_11 = |- !m n. !wm1 wm2 :: PWORDLEN m. !wn1 wn2 :: PWORDLEN n. (WCAT(wm1,wn1) = WCAT(wm2,wn2)) = (wm1 = wm2) /\ (wn1 = wn2) Theorem ADD_BNVAL_SPLIT autoloading from theory `bword_num` ... ADD_BNVAL_SPLIT = |- !n1 n2. !w1 w2 :: PWORDLEN(n1 + n2). (BNVAL w1) + (BNVAL w2) = (((BNVAL(WSEG n1 n2 w1)) + (BNVAL(WSEG n1 n2 w2))) * (2 EXP n2)) + ((BNVAL(WSEG n2 0 w1)) + (BNVAL(WSEG n2 0 w2))) ADD_WORD_SPLIT = |- !n1 n2. !w1 w2 :: PWORDLEN(n1 + n2). !cin. NBWORD(n1 + n2)((BNVAL w1) + ((BNVAL w2) + (BV cin))) = WCAT (NBWORD n1 ((BNVAL(WSEG n1 n2 w1)) + ((BNVAL(WSEG n1 n2 w2)) + (BV(ACARRY n2 w1 w2 cin)))), NBWORD n2 ((BNVAL(WSEG n2 0 w1)) + ((BNVAL(WSEG n2 0 w2)) + (BV cin)))) Theorem WSEG_WCAT2 autoloading from theory `word_base` ... WSEG_WCAT2 = |- !n1 n2. !w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. WSEG n2 0(WCAT(w1,w2)) = w2 Theorem WSEG_WCAT_WSEG1 autoloading from theory `word_base` ... WSEG_WCAT_WSEG1 = |- !n1 n2. !w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. !m k. m <= n1 /\ n2 <= k ==> (WSEG m k(WCAT(w1,w2)) = WSEG m(k - n2)w1) Theorem SUB_EQUAL_0 autoloading from theory `arithmetic` ... SUB_EQUAL_0 = |- !c. c - c = 0 WSEG_NBWORD_ADD = |- !n. !w1 w2 :: PWORDLEN n. !m k cin. (m + k) <= n ==> (WSEG m k(NBWORD n((BNVAL w1) + ((BNVAL w2) + (BV cin)))) = NBWORD m ((BNVAL(WSEG m k w1)) + ((BNVAL(WSEG m k w2)) + (BV(ACARRY k w1 w2 cin))))) ADD_NBWORD_EQ0_SPLIT = |- !n1 n2. !w1 w2 :: PWORDLEN(n1 + n2). !cin. (NBWORD(n1 + n2)((BNVAL w1) + ((BNVAL w2) + (BV cin))) = NBWORD(n1 + n2)0) = (NBWORD n1 ((BNVAL(WSEG n1 n2 w1)) + ((BNVAL(WSEG n1 n2 w2)) + (BV(ACARRY n2 w1 w2 cin)))) = NBWORD n1 0) /\ (NBWORD n2 ((BNVAL(WSEG n2 0 w1)) + ((BNVAL(WSEG n2 0 w2)) + (BV cin))) = NBWORD n2 0) Theorem MOD_MOD autoloading from theory `arithmetic` ... MOD_MOD = |- !n. 0 < n ==> (!k. (k MOD n) MOD n = k MOD n) VB_MOD_2 = |- !n. VB(n MOD 2) = VB n Theorem NBWORD_SUC_FST autoloading from theory `bword_num` ... NBWORD_SUC_FST = |- !n m. NBWORD(SUC n)m = WCAT(WORD[VB((m DIV (2 EXP n)) MOD 2)],NBWORD n m) Theorem VB_BV autoloading from theory `bword_num` ... VB_BV = |- !x. VB(BV x) = x Theorem BV_LESS_2 autoloading from theory `bword_num` ... BV_LESS_2 = |- !x. (BV x) < 2 Theorem LESS_MOD autoloading from theory `arithmetic` ... LESS_MOD = |- !n k. k < n ==> (k MOD n = k) Theorem NVAL0 autoloading from theory `word_num` ... NVAL0 = |- !f b. NVAL f b(WORD[]) = 0 Theorem NBWORD_SUC autoloading from theory `bword_num` ... NBWORD_SUC = |- !n m. NBWORD(SUC n)m = WCAT(NBWORD n(m DIV 2),WORD[VB(m MOD 2)]) Theorem BNVAL_NVAL autoloading from theory `bword_num` ... BNVAL_NVAL = |- !w. BNVAL w = NVAL BV 2 w Theorem PWORDLEN0 autoloading from theory `word_base` ... PWORDLEN0 = |- !w. PWORDLEN 0 w ==> (w = WORD[]) Theorem BIT_WCAT_FST autoloading from theory `word_base` ... BIT_WCAT_FST = |- !n1 n2. !w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. !k. n2 <= k /\ k < (n1 + n2) ==> (BIT k(WCAT(w1,w2)) = BIT(k - n2)w1) Theorem BIT0 autoloading from theory `word_base` ... BIT0 = |- !b. BIT 0(WORD[b]) = b Theorem LESS_ADD_SUC autoloading from theory `arithmetic` ... LESS_ADD_SUC = |- !m n. m < (m + (SUC n)) Theorem PWORDLEN1 autoloading from theory `word_base` ... PWORDLEN1 = |- !x. PWORDLEN 1(WORD[x]) ACARRY_MSB = |- !n. !w1 w2 :: PWORDLEN n. !cin. ACARRY n w1 w2 cin = BIT n(NBWORD(SUC n)((BNVAL w1) + ((BNVAL w2) + (BV cin)))) Theorem LESS_SUC autoloading from theory `prim_rec` ... LESS_SUC = |- !m n. m < n ==> m < (SUC n) ACARRY_WSEG = |- !n. !w1 w2 :: PWORDLEN n. !cin k m. k < m /\ m <= n ==> (ACARRY k(WSEG m 0 w1)(WSEG m 0 w2)cin = ACARRY k w1 w2 cin) ICARRY_WSEG = |- !n. !w1 w2 :: PWORDLEN n. !cin k m. k < m /\ m <= n ==> (ICARRY k(WSEG m 0 w1)(WSEG m 0 w2)cin = ICARRY k w1 w2 cin) ACARRY_ACARRY_WSEG = |- !n. !w1 w2 :: PWORDLEN n. !cin m k1 k2. k1 < m /\ k2 < n /\ (m + k2) <= n ==> (ACARRY k1(WSEG m k2 w1)(WSEG m k2 w2)(ACARRY k2 w1 w2 cin) = ACARRY(k1 + k2)w1 w2 cin) () : void File mk_bword_arith loaded () : void #rm -f word.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `mk_word`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool autoload_all = - : (string -> void) Loading library arith ... Loading library reduce ... Extending help search path. Loading boolean conversions........ Loading arithmetic conversions.................. Loading general conversions, rule and tactic..... Library reduce loaded. .Updating help search path ....................................................................................................................................................................................................................................................................................... Library arith loaded. () : void Loading library res_quan ... Updating search path Theory res_quan loaded ...............................................................................Updating help search path . Library res_quan loaded. () : void ....() : void File ver_202 loaded () : void () : void Theory bword_bitop loaded Theory bword_num loaded Theory bword_arith loaded [(); (); ()] : void list () : void File mk_word loaded () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'load_library`res_quan`;;'\ 'load_theory `word`;;'\ 'compilet `word_convs`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Loading library res_quan ... Updating search path Theory res_quan loaded ...............................................................................Updating help search path . Library res_quan loaded. () : void #Theory word loaded () : void word_CASES_TAC = - : (term -> tactic) word_INDUCT_TAC = - : tactic RESQ_WORDLEN_TAC = - : tactic BIT_CONV = - : conv WSEG_CONV = - : conv LESS_CONV = - : conv LESS_EQ_CONV = - : conv word_inst_thm = - : ((term # term) -> thm -> thm) WNOT_PWORDLEN = |- !n. !w :: PWORDLEN n. PWORDLEN n(WNOT w) WAND_PWORDLEN = |- !n. !w1 w2 :: PWORDLEN n. PWORDLEN n(w1 WAND w2) WOR_PWORDLEN = |- !n. !w1 w2 :: PWORDLEN n. PWORDLEN n(w1 WOR w2) WXOR_PWORDLEN = |- !n. !w1 w2 :: PWORDLEN n. PWORDLEN n(w1 WXOR w2) pwordlen_bitop_funs = [(`WNOT`, |- !n. !w :: PWORDLEN n. PWORDLEN n(WNOT w)); (`WAND`, |- !n. !w1 w2 :: PWORDLEN n. PWORDLEN n(w1 WAND w2)); (`WOR`, |- !n. !w1 w2 :: PWORDLEN n. PWORDLEN n(w1 WOR w2)); (`WXOR`, |- !n. !w1 w2 :: PWORDLEN n. PWORDLEN n(w1 WXOR w2))] : (string # thm) list pwordlen_funs = [(`WORD`, -); (`WSEG`, -); (`WNOT`, -); (`WAND`, -); (`WOR`, -); (`WXOR`, -); (`WCAT`, -)] : (string # (term list -> term -> term list -> thm)) list check = - : (string -> term -> term) pick_fn = - : (string -> (string # *) list -> term -> *) PWORDLEN_CONV = - : (term list -> conv) PWORDLEN_bitop_CONV = - : conv WSEG_WSEG_CONV = - : (term -> conv) ((-), (-), -) : ((term list -> conv) # conv # (term -> conv)) PWORDLEN_CONV = - : (term list -> conv) PWORDLEN_bitop_CONV = - : conv WSEG_WSEG_CONV = - : (term -> conv) PWORDLEN_TAC = - : (term list -> tactic) Calling Lisp compiler File word_convs compiled () : void #===> library word rebuilt make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof' echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `proof_rec`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool New constructors declared: Hypothesis : justification Assume : (term -> justification) Refl : (term -> justification) Subst : (((int # term) list # term # int) -> justification) BetaConv : (term -> justification) Abs : ((term # int) -> justification) InstType : (((type # type) list # int) -> justification) Disch : ((term # int) -> justification) Mp : ((int # int) -> justification) MkComb : ((int # int) -> justification) MkAbs : (int -> justification) Alpha : ((term # term) -> justification) AddAssum : ((term # int) -> justification) Sym : (int -> justification) Trans : ((int # int) -> justification) ImpTrans : ((int # int) -> justification) ApTerm : ((term # int) -> justification) ApThm : ((int # term) -> justification) EqMp : ((int # int) -> justification) EqImpRuleR : (int -> justification) EqImpRuleL : (int -> justification) Spec : ((term # int) -> justification) EqtIntro : (int -> justification) Gen : ((term # int) -> justification) EtaConv : (term -> justification) Ext : (int -> justification) Exists : (((term # term) # int) -> justification) Choose : (((term # int) # int) -> justification) ImpAntisymRule : ((int # int) -> justification) MkExists : (int -> justification) Subs : ((int list # int) -> justification) SubsOccs : (((int list # int) list # int) -> justification) SubstConv : (((int # term) list # term # term) -> justification) Conj : ((int # int) -> justification) Conjunct1 : (int -> justification) Conjunct2 : (int -> justification) Disj1 : ((int # term) -> justification) Disj2 : ((term # int) -> justification) DisjCases : ((int # int # int) -> justification) NotIntro : (int -> justification) NotElim : (int -> justification) Contr : ((term # int) -> justification) Ccontr : ((term # int) -> justification) Inst : (((term # term) list # int) -> justification) StoreDefinition : ((string # term) -> justification) Definition : ((string # string) -> justification) DefExistsRule : (term -> justification) NewAxiom : ((string # term) -> justification) Axiom : ((string # string) -> justification) Theorem : ((string # string) -> justification) NewConstant : ((string # type) -> justification) NewType : ((int # string) -> justification) NumConv : (term -> justification) New constructors declared: Line : ((int # thm # justification) -> line) MakeProof = - : (step list -> line list) output_strings = - : (string -> string list -> void) write_pair = - : (string -> ((string -> * -> **) # (string -> *** -> ****)) -> (* # ***) -> void) write_list = - : (string -> (string -> * -> **) -> * list -> void) write_type = - : (string -> type -> void) write_term = - : (string -> term -> void) write_thm = - : (string -> thm -> void) write_all_thm = - : (string -> thm -> void) write_int = - : (string -> int -> void) write_just = - : (string -> justification -> void) write_line = - : (string -> line -> void) write_tyconst = - : (string -> (int # string) -> void) write_sig = - : (string -> (string # type) -> void) write_env = - : (string -> void) write_thm_list = - : (string -> thm list -> void) ((-), (-), -) : ((string -> line -> void) # (string -> thm list -> void) # (string -> void)) write_line = - : (string -> line -> void) write_thm_list = - : (string -> thm list -> void) write_env = - : (string -> void) format_version = `(VERSION PRF FORMAT 1.0 EXTENDED) ` : string write_proof_add_to = - : (string -> string -> thm list -> line list -> void) write_proof_to = - : (string -> string -> thm list -> line list -> void) proof_file_name = `` : string proof_file_port = `` : string proof_name = `` : string proof_count = 0 : int current_goals = [] : thm list write_last_proof = - : (string -> thm list -> void) current_proof_file = - : (void -> string) current_proof = - : (void -> string) close_proof_file = - : (void -> void) new_proof_file = - : (string -> void) begin_proof = - : (string -> void) end_proof = - : (* -> void) sanitise = - : (string -> string) TAC_PROOF = - : ((goal # tactic) -> thm) PROVE = - : ((term # tactic) -> thm) prove = - : ((term # tactic) -> thm) prove_thm = - : ((string # term # tactic) -> thm) ((-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), (-), -) : ((string -> string -> thm list -> line list -> void) # (string -> string -> thm list -> line list -> void) # (string -> thm list -> void) # (void -> string) # (void -> string) # (string -> void) # (void -> void) # (string -> void) # (* -> void) # ((goal # tactic) -> thm) # ((term # tactic) -> thm) # ((term # tactic) -> thm) # ((string # term # tactic) -> thm)) write_proof_add_to = - : (string -> string -> thm list -> line list -> void) write_proof_to = - : (string -> string -> thm list -> line list -> void) write_last_proof = - : (string -> thm list -> void) current_proof = - : (void -> string) current_proof_file = - : (void -> string) new_proof_file = - : (string -> void) close_proof_file = - : (void -> void) begin_proof = - : (string -> void) end_proof = - : (* -> void) TAC_PROOF = - : ((goal # tactic) -> thm) PROVE = - : ((term # tactic) -> thm) prove = - : ((term # tactic) -> thm) prove_thm = - : ((string # term # tactic) -> thm) Calling Lisp compiler File proof_rec compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `dummy_funs`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool new_proof_file = - : (string -> void) close_proof_file = - : (void -> void) begin_proof = - : (string -> void) end_proof = - : (void -> void) current_proof = - : (void -> string) current_proof_file = - : (void -> string) write_proof_add_to = - : (string -> string -> thm list -> * list -> void) write_proof_to = - : (string -> string -> thm list -> * list -> void) write_last_proof = - : (string -> thm list -> void) Calling Lisp compiler File dummy_funs compiled () : void #===> library record_proof rebuilt make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser' echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `general`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool FIRST_CHARS = [] : string list CHARS = [] : string list DEBUG = false : bool IGNORE = [] : (string # string) list USEFUL = [] : (string # string) list push = - : (* -> * list -> * list) pop = - : (* list -> (* # * list)) write_string = - : (string -> string -> void) read_char = - : (string -> string) close_file = - : (string -> void) open_file = - : (string -> string -> string) e_w_s = - : (string -> string -> string list -> string) e_w_s_ok = - : (string -> string -> string list -> string) determine_lst = - : (* -> * list -> * list -> bool) get_word2 = - : (string -> string list -> string -> string list -> (string # *) list -> (string # **) list -> (string # ***) list -> (string list # string)) get_word1 = - : (string -> string list -> string -> string list -> string list -> (string list # string)) complete_separator = - : (string -> string -> string list -> (string # string list) list -> (string # *) list -> (string # **) list -> (string # string)) get_word = - : (string -> string list -> string -> (string # string list) list -> string -> (string # *) list -> (string # **) list -> (string # string)) useful_stuff = - : (string -> string -> string -> string list -> (string # string)) ignore_stuff = - : (string -> string -> string -> string list -> string) read_input = - : (string -> string list -> string list -> (string # string list) list -> string -> (string # string) list -> (string # string) list -> string list) gnt = - : (string list -> string -> string -> (string # string list)) eat_terminal = - : (string -> string -> string list -> * -> (string # string list)) chop_off = - : (int -> * list -> * list -> (* list # * list)) debug_return = - : (string -> string -> void) do_return_1 = - : (* list -> ** -> string -> ** -> ** list -> ** -> (* # * list # ** # ** list)) do_return = - : (* list -> string -> string -> string -> string list -> string -> (* # * list # string # string list)) debug_enter = - : ((string # string # string) -> void) debug_on = - : (* -> bool) debug_off = - : (* -> bool) Calling Lisp compiler File general compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `parser`;;' \ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void EXPECTED = [] : string list pg_failwith = - : (string -> string -> string -> *) escaped = - : (string -> string -> string) write_string = - : (string -> string -> void) read_char = - : (string -> string) split_filename = - : (string list -> string list -> bool -> (string # string)) close_file = - : (string -> void) bad_read = - : (string -> *) terminal_read_1 = - : (string -> string list) terminal_read = - : (* -> string) make_Makefile = - : (string -> string -> string -> void) make_makefile = - : (string -> void) open_file = - : (string -> string -> (string # string)) eat_white_space = - : (string -> string -> string) e_w_s = - : (string -> string -> string) e_w_s_ok = - : (string -> string -> string) write_comments = - : (string -> string -> string -> string -> string) get_word1 = - : (string -> string list -> string -> string -> string -> string -> (string list # string)) first_test = - : (string -> string -> bool) get_word = - : (string -> string -> string -> string -> string -> (string # string)) get_inits1 = - : (string -> string list -> string -> (string list # string)) get_inits = - : (string -> string -> string -> string) get_inits1_specials = - : (string -> string list -> string -> (string list # string)) get_inits_specials = - : (string -> string -> string -> string) separator = - : (string -> string) MK_word = - : (string -> string list) MK_start = - : (string -> string list) EOF = - : (string -> string) write_conditional = - : (string -> string list list) write_if = - : (string -> string -> string list list) finish_terminal = - : (string -> string -> * list) epsilon_start = - : (string -> string list list) get_terminal_2 = - : (string -> string -> string -> string list) is_EOF = - : (string -> string) get_terminal_1 = - : (string -> string -> string -> string -> * -> (string list list # string # string # bool)) get_terminal = - : (string -> string -> string -> string -> * -> (string list list # string # string # bool)) system_function_args = - : (string -> bool) prdn_errors_args = - : (string -> string -> void) tmp_var = - : (string -> int -> string) HOL_term = - : (string -> bool) top_or_middle = - : (string -> string list) get_args_prdn = - : (string -> * -> string -> string -> (string # string)) finish_arg = - : (string -> string -> string -> string list) get_argn1 = - : (string -> string -> string -> string -> string -> bool -> string list) get_arg_name = - : (string -> string -> string -> string -> bool -> (string # string)) add_new_calls = - : (* list -> string -> * list -> * list -> (* list # * list)) require_start = - : (string -> string -> string -> (string list # string)) need_to_use_pops = - : (int -> string list) add_EXPECTED = - : (string -> bool -> string list) pop_or_reg = - : (string -> string -> bool -> (string list # string # string # bool)) mk_lets = - : (string -> int -> string -> bool -> (string list # string # int # string # bool)) comma = - : (bool -> string -> string) failed_arg = - : (string -> bool) preprocess_args = - : (string -> string list -> string list -> string list -> string -> string -> int -> string -> string -> bool -> int -> bool -> (string list # string # int # string list # int # string # bool)) get_args_act = - : (string -> string -> string -> string list list -> int -> string -> string -> bool -> (string list list # string list # int # string # string # bool)) write_tabs = - : (int -> string -> void) then_if = - : (int -> string -> int) pop_EXPECTED = - : (* -> string) write_final = - : (string -> string list -> int -> string -> (int # string)) write_final_all = - : (string list list -> string -> int -> string -> void) eat_arrow = - : (string -> string -> string -> int -> string) unwind_parens = - : (int -> string list) finish_arm = - : (* list -> * list -> * -> * list -> * -> * list -> * list) new_letrefs = - : (string -> string -> string -> bool -> string list list) NT_letrefs = - : (string -> string -> string -> string list list) ACTION_letrefs = - : (string -> string -> string -> string list list) MK_failed = - : (bool -> * -> ** -> *** -> string list list) MK_return = - : (string -> bool -> string -> string list) system_function = - : (string -> bool) terminal_errors = - : (string -> string -> string -> void) prdn_errors = - : (string -> string -> void) action_errors = - : (string -> string -> void) final_trap = - : (bool -> * -> string list list) get_rest_of_prdn = - : (string -> string list list -> string list list -> string -> string -> int -> int -> bool -> string -> string -> bool -> string list list) process = - : (string -> string -> string -> string -> string list list) MK_lambda = - : (string -> string list list -> string list list) write_decs = - : (string -> string -> string -> void) make_main_wrapper = - : (string -> void) emit_firsts = - : (string -> string -> string -> void) emit_specials = - : (string -> string -> string -> void) token_failwith = - : (string -> *) make_tokeniser = - : (string -> bool -> bool -> void) decls_fail = - : (string -> *) decls_errors = - : (string -> bool -> bool -> (bool # bool)) make_productions = - : (string -> string -> string -> string -> bool -> bool -> void) get_ty = - : (string list -> bool -> string) parse = - : (* -> void) - : (* -> void) parse = - : (* -> void) Calling Lisp compiler File parser compiled () : void #===> library parser rebuilt make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp' echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `PP_printer/extents`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool max = - : (int list -> int) min = - : (int list -> int) change_assocl = - : ((* # **) list -> (* # **) list -> (* # **) list) Nat = - : (int -> nat) Int = - : (nat -> int) print_nat = - : (nat -> void) - : (nat -> void) get_margin = - : (void -> int) Calling Lisp compiler File PP_printer/extents compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/extents`;;'\ 'compilet `PP_printer/strings`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ......() : void substr = - : (int -> int -> string -> string) strlen = - : (string -> int) num_of_leading_chars = - : (string list -> string -> int) trim_leading_chars = - : (string list -> string -> string) trim_trailing_chars = - : (string list -> string -> string) trim_enclosing_chars = - : (string list -> string -> string) string_contains = - : (string -> string -> bool) strings_contain = - : (string list -> string -> bool) string_copies = - : (string -> int -> string) Calling Lisp compiler File PP_printer/strings compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/extents`;;'\ 'loadf `PP_printer/strings`;;'\ 'compilet `PP_printer/ptree`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ......() : void .........() : void New constructors declared: Print_node : ((string # print_tree list) -> print_tree) print_tree_name = - : (print_tree -> string) print_tree_children = - : (print_tree -> print_tree list) Calling Lisp compiler File PP_printer/ptree compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/extents`;;'\ 'loadf `PP_printer/strings`;;'\ 'loadf `PP_printer/ptree`;;'\ 'compilet `PP_printer/treematch`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ......() : void .........() : void ...() : void New constructors declared: No_address : address Address : (int list -> address) New constructors declared: Bound_name : ((string # address) -> metavar_binding) Bound_names : ((string # address) list -> metavar_binding) Bound_child : ((print_tree # address) -> metavar_binding) Bound_children : ((print_tree # address) list -> metavar_binding) type print_binding defined type print_test defined New constructors declared: Default : loop_limit Val : (nat -> loop_limit) New constructors declared: Const_name : ((string # child_metavar list) -> print_patt_tree) Var_name : ((string # child_metavar list) -> print_patt_tree) Wild_name : (child_metavar list -> print_patt_tree) Var_child : (string -> print_patt_tree) Wild_child : print_patt_tree Link_child : (((loop_limit # loop_limit) # string list) -> print_patt_tree) Print_label : ((string # print_patt_tree) -> print_patt_tree) Print_link : ((((loop_limit # loop_limit) # string list) # print_patt_tree) -> print_patt_tree) Print_loop : ((print_patt_tree # print_patt_tree) -> print_patt_tree) Var_children : (string -> child_metavar) Wild_children : child_metavar Patt_child : (print_patt_tree -> child_metavar) type print_pattern defined New constructors declared: No_link : print_loop_link Link : ((((loop_limit # loop_limit) # string list) # print_tree # int list) -> print_loop_link) lookup_metavar = - : (print_binding -> string -> metavar_binding) eq_metavar_bind = - : (metavar_binding -> metavar_binding -> bool) no_address_meta = - : (metavar_binding -> metavar_binding) replace = - : ((* # **) list -> (* # **) -> (* # **) list) replacel = - : ((* # **) list -> (* # **) list -> (* # **) list) print_merge = - : (print_binding -> print_binding -> print_binding) print_loop_merge = - : (print_binding -> print_binding -> print_binding) raise_binding = - : (print_binding -> print_binding) raise_bindings = - : (print_binding -> print_binding -> print_binding) correspond_bindings = - : (print_binding -> print_binding -> print_binding) raise_bindings_safe = - : (print_binding -> print_binding -> print_binding) extract_info_from_patt = - : (print_patt_tree -> ((string list # string list) # print_loop_link)) extract_info_from_child = - : (child_metavar -> ((string list # string list) # print_loop_link)) zero_loop_info = - : (print_patt_tree -> (print_binding # loop_limit)) new_addresses = - : (int list -> print_tree list -> (print_tree # int list) list) split_list = - : ((int # int) -> * list -> (* list # * list # * list)) print_tree_match' = - : (print_patt_tree -> (print_tree # int list) -> (print_binding # print_loop_link)) children_match = - : (child_metavar list -> (print_tree # int list) list -> (print_binding # print_loop_link)) print_tree_match = - : (print_patt_tree -> print_tree -> (print_binding # print_loop_link)) add_context = - : (string -> (string # int) list -> (string # int) list) print_pattern_match = - : (print_pattern -> string -> (string # int) list -> print_tree -> print_binding) ((-), -) : ((string -> (string # int) list -> (string # int) list) # (print_pattern -> string -> (string # int) list -> print_tree -> print_binding)) add_context = - : (string -> (string # int) list -> (string # int) list) print_pattern_match = - : (print_pattern -> string -> (string # int) list -> print_tree -> print_binding) Calling Lisp compiler File PP_printer/treematch compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/extents`;;'\ 'loadf `PP_printer/strings`;;'\ 'loadf `PP_printer/ptree`;;'\ 'loadf `PP_printer/treematch`;;'\ 'compilet `PP_printer/boxes`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ......() : void .........() : void ...() : void .............................() : void New constructors declared: N_box : * print_box A_box : (((nat # string) # *) -> * print_box) L_box : (((nat # nat # * print_box # * print_box) # *) -> * print_box) C_box : ((((nat # nat # nat) # nat # (int # nat) # * print_box # * print_box) # *) -> * print_box) print_box_io = - : (* print_box -> int) print_box_width = - : (* print_box -> int) print_box_fo = - : (* print_box -> int) print_box_height = - : (* print_box -> int) print_box_sizes = - : (* print_box -> ((int # int # int) # int)) replace_box_label = - : (* -> * print_box -> * print_box) New constructors declared: Abs : (int -> print_indent) Inc : (int -> print_indent) New constructors declared: UB_H : (((int -> int -> * print_box) # (nat # (int -> int -> * print_box)) list) -> * unbuilt_box) UB_V : (((int -> int -> * print_box) # ((print_indent # nat) # (int -> int -> * print_box)) list) -> * unbuilt_box) UB_HV : (((int -> int -> * print_box) # ((nat # print_indent # nat) # (int -> int -> * print_box)) list) -> * unbuilt_box) UB_HoV : (((int -> int -> * print_box) # ((nat # print_indent # nat) # (int -> int -> * print_box)) list) -> * unbuilt_box) join_boxes = - : (int -> int -> * print_box -> * print_box -> * -> * print_box) join_H_boxes = - : (nat -> * print_box -> * print_box -> * -> * print_box) join_V_boxes = - : (int -> nat -> * print_box -> * print_box -> * -> * print_box) build_H_box = - : (int -> int -> * -> (int -> int -> * print_box) -> (nat # (int -> int -> * print_box)) list -> * print_box) build_V_box = - : (int -> int -> * -> (int -> int -> * print_box) -> ((print_indent # nat) # (int -> int -> * print_box)) list -> * print_box) build_HV_box = - : (int -> int -> * -> (int -> int -> * print_box) -> ((nat # print_indent # nat) # (int -> int -> * print_box)) list -> * print_box) build_HoV_box = - : (int -> int -> * -> (int -> int -> * print_box) -> ((nat # print_indent # nat) # (int -> int -> * print_box)) list -> * print_box) build_print_box = - : (int -> int -> * -> * unbuilt_box -> * print_box) - : (int -> int -> * -> * unbuilt_box -> * print_box) build_print_box = - : (int -> int -> * -> * unbuilt_box -> * print_box) Calling Lisp compiler File PP_printer/boxes compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/extents`;;'\ 'loadf `PP_printer/strings`;;'\ 'loadf `PP_printer/ptree`;;'\ 'loadf `PP_printer/treematch`;;'\ 'loadf `PP_printer/boxes`;;'\ 'compilet `PP_printer/treetobox`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ......() : void .........() : void ...() : void .............................() : void ...................() : void type print_special defined type print_int_exp defined New constructors declared: H_box : ((nat # print_object) list -> print_box_spec) V_box : (((print_indent # nat) # print_object) list -> print_box_spec) HV_box : (((nat # print_indent # nat) # print_object) list -> print_box_spec) HoV_box : (((nat # print_indent # nat) # print_object) list -> print_box_spec) PF_empty : print_format PF : (print_box_spec -> print_format) PF_branch : ((print_test # print_format # print_format) -> print_format) PO_constant : (string -> print_object) PO_leaf : ((string # (string -> string)) -> print_object) PO_subcall : (((string # ((print_tree # address) list -> (print_tree # address) list)) # (string # print_int_exp) list) -> print_object) PO_context_subcall : ((string # (string # ((print_tree # address) list -> (print_tree # address) list)) # (string # print_int_exp) list) -> print_object) PO_format : (print_format -> print_object) PO_expand : (print_box_spec -> print_object) PF_H = - : ((nat # print_object) list -> print_format) PF_V = - : (((print_indent # nat) # print_object) list -> print_format) PF_HV = - : (((nat # print_indent # nat) # print_object) list -> print_format) PF_HoV = - : (((nat # print_indent # nat) # print_object) list -> print_format) type print_rule defined type print_rule_function defined print_special_fun = - : (string -> (string # int) list -> print_binding -> print_special list -> print_binding) print_rule_fun = - : (print_rule list -> print_rule_function) () : void then_try = - : (print_rule_function -> print_rule_function -> print_rule_function) raw_tree_rules = [((``, (Var_name(`n`, [Var_children `cl`; Patt_child(Var_child `c`)])), -), [], PF(HV_box[((0, (Abs 0), 0), PO_leaf(`n`, -)); ((0, (Abs 3), 0), PO_format(PF(H_box[(0, PO_constant `(`); (0, PO_format(PF(HoV_box[((0, (Abs 0), 0), PO_expand(H_box[(0, PO_subcall((`cl`, -), [])); (0, PO_constant `,`)])); ((0, (Abs 0), 0), PO_subcall((`c`, -), []))]))); (0, PO_constant `)`)])))])); ((``, (Var_name(`n`, [])), -), [], PF(H_box[(0, PO_leaf(`n`, -))]))] : print_rule list raw_tree_rules_fun = - : print_rule_function expand_binding = - : ((* # metavar_binding) list -> (* # metavar_binding) list list) extract_expanded_from_spec = - : (print_box_spec -> string list) extract_expanded_from_object = - : (print_object -> string list) print_tree_to_box = - : (int -> int -> print_rule_function -> string -> (string # int) list -> print_tree -> address print_box) print_box_spec_fun = - : (int -> int -> print_rule_function -> string -> (string # int) list -> print_binding -> print_binding -> bool -> print_box_spec -> address print_box) print_format_fun = - : (int -> int -> print_rule_function -> string -> (string # int) list -> print_binding -> print_format -> address print_box) print_object_fun = - : (print_rule_function -> string -> (string # int) list -> print_binding -> print_binding -> bool -> print_object -> (int -> int -> address print_box) list) - : (int -> int -> print_rule_function -> string -> (string # int) list -> print_tree -> address print_box) print_tree_to_box = - : (int -> int -> print_rule_function -> string -> (string # int) list -> print_tree -> address print_box) Calling Lisp compiler File PP_printer/treetobox compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/extents`;;'\ 'loadf `PP_printer/strings`;;'\ 'loadf `PP_printer/ptree`;;'\ 'loadf `PP_printer/treematch`;;'\ 'loadf `PP_printer/boxes`;;'\ 'loadf `PP_printer/treetobox`;;'\ 'compilet `PP_printer/boxtostring`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ......() : void .........() : void ...() : void .............................() : void ...................() : void .................() : void join_strings = - : ((string # int) -> (string # int) -> (string # int)) merge_string_lists = - : ((string # int # int) list -> (string # int # int) list -> (string # int # int) list) stringify_print_box = - : (int -> int -> * print_box -> (string # int # int) list) fill_in_strings = - : (bool -> int -> int -> (string # int # int) list -> string list) print_box_to_strings = - : (bool -> int -> * print_box -> string list) - : (bool -> int -> * print_box -> string list) print_box_to_strings = - : (bool -> int -> * print_box -> string list) Calling Lisp compiler File PP_printer/boxtostring compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/extents`;;'\ 'loadf `PP_printer/strings`;;'\ 'loadf `PP_printer/ptree`;;'\ 'loadf `PP_printer/treematch`;;'\ 'loadf `PP_printer/boxes`;;'\ 'loadf `PP_printer/treetobox`;;'\ 'loadf `PP_printer/boxtostring`;;'\ 'compilet `PP_printer/print`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ......() : void .........() : void ...() : void .............................() : void ...................() : void .................() : void .......() : void display_strings = - : (string list -> void) output_strings = - : (string -> string list -> void) insert_strings = - : (string list -> void) pretty_print = - : (int -> int -> print_rule_function -> string -> (string # int) list -> print_tree -> void) pp_write = - : (string -> int -> int -> print_rule_function -> string -> (string # int) list -> print_tree -> void) pp = - : (print_rule_function -> string -> (string # int) list -> print_tree -> void) ((-), (-), -) : ((int -> int -> print_rule_function -> string -> (string # int) list -> print_tree -> void) # (string -> int -> int -> print_rule_function -> string -> (string # int) list -> print_tree -> void) # (print_rule_function -> string -> (string # int) list -> print_tree -> void)) pretty_print = - : (int -> int -> print_rule_function -> string -> (string # int) list -> print_tree -> void) pp_write = - : (string -> int -> int -> print_rule_function -> string -> (string # int) list -> print_tree -> void) pp = - : (print_rule_function -> string -> (string # int) list -> print_tree -> void) Calling Lisp compiler File PP_printer/print compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/extents`;;'\ 'loadf `PP_printer/strings`;;'\ 'loadf `PP_printer/ptree`;;'\ 'loadf `PP_printer/treematch`;;'\ 'loadf `PP_printer/boxes`;;'\ 'loadf `PP_printer/treetobox`;;'\ 'loadf `PP_printer/boxtostring`;;'\ 'loadf `PP_printer/print`;;'\ 'compilet `PP_printer/utils`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ......() : void .........() : void ...() : void .............................() : void ...................() : void .................() : void .......() : void ........() : void () : void is_a_member_of = - : (string -> string list -> print_test) bound_number = - : (string -> print_int_exp) bound_name = - : (string -> (string # int) list -> print_binding -> string) bound_names = - : (string -> (string # int) list -> print_binding -> string list) bound_child = - : (string -> (string # int) list -> print_binding -> print_tree) bound_children = - : (string -> (string # int) list -> print_binding -> print_tree list) bound_context = - : ((string # int) list -> print_binding -> string) apply0 = - : (* -> (string # int) list -> print_binding -> *) apply1 = - : ((* -> **) -> ((string # int) list -> print_binding -> *) -> (string # int) list -> print_binding -> **) apply2 = - : ((* -> ** -> ***) -> ((string # int) list -> print_binding -> *) -> ((string # int) list -> print_binding -> **) -> (string # int) list -> print_binding -> ***) new_name = - : ((string -> string) -> string -> (string # int) list -> print_binding -> metavar_binding) new_names = - : (((string # address) list -> (string # address) list) -> string -> (string # int) list -> print_binding -> metavar_binding) new_child = - : ((print_tree -> print_tree) -> string -> (string # int) list -> print_binding -> metavar_binding) new_children = - : (((print_tree # address) list -> (print_tree # address) list) -> string -> (string # int) list -> print_binding -> metavar_binding) Calling Lisp compiler File PP_printer/utils compiled () : void #(cd PP_parser; cp pp_lang1.build pp_lang1_pp.ml) (cd PP_parser; cp pp_lang2.build pp_lang2_pp.ml) echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'compilet `PP_parser/pp_lang1_pp`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void # pp_lang1_rules = [] : print_rule list pp_lang1_rules_fun = - : print_rule_function Calling Lisp compiler File PP_parser/pp_lang1_pp compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/pp_lang1_pp`;;'\ 'compilet `PP_parser/pp_lang2_pp`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #..() : void pp_lang2_rules = [] : print_rule list pp_lang2_rules_fun = - : print_rule_function Calling Lisp compiler File PP_parser/pp_lang2_pp compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/pp_lang1_pp`;;'\ 'loadf `PP_parser/pp_lang2_pp`;;'\ 'compilet `PP_parser/lex`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #..() : void ..() : void copy_chars = - : (int -> (string -> string) -> string -> (string -> void) -> void) New constructors declared: Lex_spec : (string -> lex_symb) Lex_num : (string -> lex_symb) Lex_id : (string -> lex_symb) Lex_block : (((string # string) # string list) -> lex_symb) is_lex_char = - : ((string # string # string) -> bool) is_lex_ucase = - : (string -> bool) is_lex_lcase = - : (string -> bool) is_lex_letter = - : (string -> bool) is_lex_digit = - : (string -> bool) is_lex_underscore = - : (string -> bool) is_lex_eof = - : (string -> bool) is_lex_eol = - : (string -> bool) is_lex_space = - : (string -> bool) lex_error = - : ((string -> string) -> string -> string -> string -> *) read_char = - : ((* -> string) -> * -> string) read_number = - : ((* -> string) -> * -> string -> (lex_symb # string)) read_identifier = - : ((string -> string) -> string -> string -> (lex_symb # string)) read_block = - : ((string -> string) -> string -> (string # string) -> string -> (lex_symb # string)) read_special = - : ((string -> string) -> string -> string list -> string -> (lex_symb # string)) read_symb = - : ((string -> string) -> string -> (string # string) list -> string list -> string list -> string -> (lex_symb # string)) - : ((string -> string) -> string -> (string # string) list -> string list -> string list -> string -> (lex_symb # string)) read_symb = - : ((string -> string) -> string -> (string # string) list -> string list -> string list -> string -> (lex_symb # string)) Calling Lisp compiler File PP_parser/lex compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/pp_lang1_pp`;;'\ 'loadf `PP_parser/pp_lang2_pp`;;'\ 'loadf `PP_parser/lex`;;'\ 'compilet `PP_parser/syntax`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #..() : void ..() : void ....................() : void PP_quotes = [(`'`, `'`); (`"`, `"`); (`{`, `}`); (`#`, `#`); (`%`, `%`)] : (string # string) list PP_keywords = [`prettyprinter`; `rules`; `declarations`; `abbreviations`; `with`; `end`; `where`; `if`; `then`; `else`; `h`; `v`; `hv`; `hov`] : string list PP_specials = [`+`; `-`; `*`; `**`; `***`; `,`; `;`; `:`; `::`; `=`; `:=`; `->`; `..`; `(`; `)`; `**[`; `[`; `]`; `<`; `>`; `<<`; `>>`; `|`] : string list syntax_error = - : ((string -> string) -> string -> string -> string -> lex_symb -> *) general_error = - : ((string -> string) -> string -> string -> string -> string -> *) read_PP_symb = - : ((string -> string) -> string -> string -> (lex_symb # string)) read_PP_number = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_integer = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_string = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_terminal = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_ML_function = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_identifier = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_name_metavar = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_child_metavar = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_children_metavar = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_metavar_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_min = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_max = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_loop_range = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_loop_link = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_label = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_node_name = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_child = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_child_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_pattern_tree = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_loop = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_test = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_pattern = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_transformation = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_p_special = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_p_special_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_int_expression = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_assignment = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_assignments = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_fun_subcall = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_context_subcall = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_leaf_or_subcall = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_indent = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_h_params = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_v_params = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_hv_params = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_hov_params = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_h_box = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_v_box = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_hv_box = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_hov_box = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_object = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_h_object = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_v_object = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_hv_object = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_hov_object = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_h_object_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_v_object_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_hv_object_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_hov_object_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_box_spec = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_expand = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_format = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_rule = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_rule_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_rules = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_binding = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_binding_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_declarations = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_abbreviations = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_body = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP = - : ((string -> string) -> string -> print_tree) - : ((string -> string) -> string -> print_tree) read_PP = - : ((string -> string) -> string -> print_tree) Calling Lisp compiler File PP_parser/syntax compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/pp_lang1_pp`;;'\ 'loadf `PP_parser/pp_lang2_pp`;;'\ 'loadf `PP_parser/lex`;;'\ 'loadf `PP_parser/syntax`;;'\ 'compilet `PP_parser/convert`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #..() : void ..() : void ....................() : void .......................................................() : void construction_error = - : (print_tree -> string -> *) indirect_string = - : (string -> string) convert_NUM = - : ((print_tree # *) -> (print_tree # ** list)) convert_NEG = - : ((print_tree # *) -> (print_tree # ** list)) convert_ML_FUN = - : ((print_tree # *) -> (print_tree # ** list)) convert_ID_to_VAR = - : ((print_tree # *) -> (print_tree # ** list)) convert_ID_to_TOKCONST = - : ((print_tree # *) -> (print_tree # ** list)) convert_METAVAR = - : ((print_tree # *) -> (print_tree # ** list)) convert_METAVAR_to_TOKCONST = - : ((print_tree # *) -> (print_tree # ** list)) convert_METAVAR_LIST = - : ((print_tree # *) -> (print_tree # ** list)) convert_MIN = - : ((print_tree # *) -> (print_tree # ** list)) convert_MAX = - : ((print_tree # *) -> (print_tree # ** list)) convert_LOOP_RANGE = - : ((print_tree # *) -> (print_tree # ** list)) convert_LOOP_LINK = - : ((print_tree # *) -> (print_tree # ** list)) convert_LABEL = - : ((print_tree # *) -> (print_tree # ** list)) convert_NODE_NAME = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_CHILD = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_CHILD_LIST = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_PATT_TREE = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_LOOP = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_STRING = - : ((print_tree # *) -> (print_tree # ** list)) convert_TEST = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_PATTERN = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_TRANSFORM = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_P_SPECIAL = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_P_SPECIAL_LIST = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_INT_EXP = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_ASSIGN = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_ASSIGNMENTS = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_F_SUBCALL = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_C_SUBCALL = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_LEAF_OR_SUBCALL = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_TERMINAL = - : ((print_tree # *) -> (print_tree # ** list)) convert_INC = - : ((print_tree # *) -> (print_tree # ** list)) convert_H_PARAMS = - : ((print_tree # *) -> (print_tree # ** list)) convert_V_PARAMS = - : ((print_tree # *) -> (print_tree # ** list)) convert_HV_PARAMS = - : ((print_tree # *) -> (print_tree # ** list)) convert_HOV_PARAMS = - : ((print_tree # *) -> (print_tree # ** list)) convert_BOX = - : ((print_tree # *) -> (print_tree # ** list)) convert_OBJECT = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_H_OBJECT = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_V_OBJECT = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_HV_OBJECT = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_HOV_OBJECT = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_H_OBJECT_LIST = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_V_OBJECT_LIST = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_HV_OBJECT_LIST = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_HOV_OBJECT_LIST = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_BOX_SPEC = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_EXPAND = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_FORMAT = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_RULE = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_RULE_LIST = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_RULES = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_BINDING = - : ((print_tree # *) -> (print_tree # ** list)) convert_BINDING_LIST_to_LIST = - : ((print_tree # *) -> (print_tree # ** list)) convert_BINDING_LIST_to_LETREC = - : ((print_tree # *) -> (print_tree # ** list)) convert_DECLARS = - : ((print_tree # *) -> (print_tree # ** list)) convert_ABBREVS = - : ((print_tree # *) -> (print_tree # (string # print_tree) list)) convert_BODY = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_PP = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_PP = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) Calling Lisp compiler File PP_parser/convert compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/pp_lang1_pp`;;'\ 'loadf `PP_parser/pp_lang2_pp`;;'\ 'loadf `PP_parser/lex`;;'\ 'loadf `PP_parser/syntax`;;'\ 'loadf `PP_parser/convert`;;'\ 'compilet `PP_parser/generate`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #..() : void ..() : void ....................() : void .......................................................() : void .................................................() : void PP_to_ML_rules = [((`name`, (Var_name(`n`, [])), -), [], PF(H_box[(0, PO_leaf(`n`, -))])); ((``, (Const_name(`INTCONST`, [Patt_child(Var_name(`n`, []))])), -), [], PF(H_box[(0, PO_leaf(`n`, -))])); ((``, (Const_name(`TOKCONST`, [Patt_child(Var_name(`n`, []))])), -), [], PF(H_box[(0, PO_constant ```); (0, PO_leaf(`n`, -)); (0, PO_constant ```)])); ((``, (Const_name(`VAR`, [Patt_child(Var_name(`n`, []))])), -), [], PF(H_box[(0, PO_leaf(`n`, -))])); ((``, (Const_name(`CON`, [Patt_child(Var_name(`n`, []))])), -), [], PF(H_box[(0, PO_leaf(`n`, -))])); ((``, (Const_name(`CON0`, [Patt_child(Var_name(`n`, []))])), -), [], PF(H_box[(0, PO_leaf(`n`, -))])); ((``, (Const_name(`UNOP`, [Patt_child(Var_name(`n`, [])); Patt_child(Var_child `c`)])), -), [], PF(H_box[(0, PO_constant `(`); (0, PO_format(PF(HV_box[((0, (Abs 0), 0), PO_leaf(`n`, -)); ((0, (Abs 0), 0), PO_subcall((`c`, -), []))]))); (0, PO_constant `)`)])); ((``, (Const_name(`APPN`, [Patt_child(Var_child `c1`); Patt_child(Var_child `c2`)])), -), [], PF(H_box[(0, PO_constant `(`); (0, PO_format(PF(HV_box[((1, (Abs 1), 0), PO_subcall((`c1`, -), [])); ((1, (Abs 1), 0), PO_subcall((`c2`, -), []))]))); (0, PO_constant `)`)])); ((``, (Const_name(`ABSTR`, [Patt_child(Var_child `c1`); Patt_child(Var_child `c2`)])), -), [], PF(H_box[(0, PO_constant `(\`); (0, PO_format(PF(HV_box[((1, (Abs 1), 0), PO_format(PF(H_box[(0, PO_subcall((`c1`, -), [])); (0, PO_constant `.`)]))); ((1, (Abs 1), 0), PO_subcall((`c2`, -), []))]))); (0, PO_constant `)`)])); ((``, (Const_name(`LIST`, [Var_children `cl`; Patt_child(Var_child `c`)])), -), [], PF(H_box[(0, PO_constant `[`); (0, PO_format(PF(HoV_box[((0, (Abs 0), 0), PO_expand(H_box[(0, PO_subcall((`cl`, -), [])); (0, PO_constant `;`)])); ((0, (Abs 0), 0), PO_subcall((`c`, -), []))]))); (0, PO_constant `]`)])); ((``, (Const_name(`LIST`, [])), -), [], PF(H_box[(0, PO_constant `[]`)])); ((``, (Print_loop((Const_name(`DUPL`, [Patt_child(Var_child `cl`); Patt_child(Link_child(((Val 1), Default), []))])), Var_child `c`)), -), [], PF(H_box[(0, PO_constant `(`); (0, PO_format(PF(HV_box[((0, (Abs 0), 0), PO_expand(H_box[(0, PO_subcall((`cl`, -), [])); (0, PO_constant `,`)])); ((0, (Abs 0), 0), PO_subcall((`c`, -), []))]))); (0, PO_constant `)`)])); ((``, (Const_name(`LETREC`, [Patt_child(Const_name(`DUPL`, [Patt_child(Var_child `var1`); Patt_child(Print_loop((Const_name(`DUPL`, [Patt_child(Var_child `varl`); Patt_child(Link_child(((Default), Default), []))])), Var_child `varl`))])); Patt_child(Const_name(`DUPL`, [Patt_child(Var_child `body1`); Patt_child(Print_loop((Const_name(`DUPL`, [Patt_child(Var_child `bodyl`); Patt_child(Link_child(((Default), Default), []))])), Var_child `bodyl`))]))])), -), [], PF(V_box[(((Abs 0), 0), PO_format(PF(HV_box[((1, (Inc 1), 0), PO_constant `letrec`); ((1, (Inc 1), 0), PO_format(PF(H_box[(1, PO_subcall((`var1`, -), [])); (1, PO_constant `=`)]))); ((1, (Inc 1), 0), PO_subcall((`body1`, -), []))]))); (((Abs 0), 0), PO_expand(HV_box[((1, (Inc 1), 0), PO_constant `and`); ((1, (Inc 1), 0), PO_expand(H_box[(1, PO_subcall((`varl`, -), [])); (1, PO_constant `=`)])); ((1, (Inc 1), 0), PO_subcall((`bodyl`, -), []))]))])); ((``, (Const_name(`LETREC`, [Patt_child(Var_child `c1`); Patt_child(Var_child `c2`)])), -), [], PF(HV_box[((1, (Inc 1), 0), PO_constant `letrec`); ((1, (Inc 1), 0), PO_format(PF(H_box[(1, PO_subcall((`c1`, -), [])); (1, PO_constant `=`)]))); ((1, (Inc 1), 0), PO_subcall((`c2`, -), []))])); ((``, (Const_name(`ML_FUN`, [Var_children `cl`])), -), [], PF(H_box[(0, PO_constant `(`); (0, PO_format(PF(V_box[(((Abs 0), 0), PO_context_subcall(`name`, (`cl`, -), []))]))); (0, PO_constant `)`)]))] : print_rule list PP_to_ML_rules_fun = - : print_rule_function write_strings = - : (((* # string) -> **) -> * -> string list -> void) generate_rule = - : (print_tree -> string list) write_rule = - : (((* # string) -> **) -> * -> print_tree -> void) write_rules = - : (((* # string) -> **) -> * -> print_tree list -> void) generate_declarations = - : (print_tree -> string list) write_declarations = - : (((* # string) -> **) -> * -> print_tree -> void) generate_head = - : (string -> string list) write_head = - : (((* # string) -> **) -> * -> string -> void) generate_tail = - : (string -> string list) write_tail = - : (((* # string) -> **) -> * -> string -> void) generate_ML = - : (((string # string) -> void) -> string -> print_tree -> void) - : (((string # string) -> void) -> string -> print_tree -> void) generate_ML = - : (((string # string) -> void) -> string -> print_tree -> void) Calling Lisp compiler File PP_parser/generate compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/pp_lang1_pp`;;'\ 'loadf `PP_parser/pp_lang2_pp`;;'\ 'loadf `PP_parser/lex`;;'\ 'loadf `PP_parser/syntax`;;'\ 'loadf `PP_parser/convert`;;'\ 'loadf `PP_parser/generate`;;'\ 'compilet `PP_parser/PP_to_ML`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #..() : void ..() : void ....................() : void .......................................................() : void .................................................() : void ...............() : void PP_to_ML = - : (bool -> string -> string -> void) Calling Lisp compiler File PP_parser/PP_to_ML compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/pp_lang1_pp`;;'\ 'loadf `PP_parser/pp_lang2_pp`;;'\ 'loadf `PP_parser/lex`;;'\ 'loadf `PP_parser/syntax`;;'\ 'loadf `PP_parser/convert`;;'\ 'loadf `PP_parser/generate`;;'\ 'loadf `PP_parser/PP_to_ML`;;'\ 'PP_to_ML false `PP_parser/pp_lang1` ``;;'\ 'PP_to_ML false `PP_parser/pp_lang2` ``;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #..() : void ..() : void ....................() : void .......................................................() : void .................................................() : void ...............() : void .() : void () : void () : void echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'compilet `PP_parser/pp_lang1_pp`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void # pp_lang1_rules = [((``, (Const_name(`NUM`, [Patt_child(Var_name(`num`, []))])), -), [], PF(H_box[(0, PO_leaf(`num`, -))])); ((``, (Const_name(`NEG`, [Patt_child(Var_child `num`)])), -), [], PF(H_box[(0, PO_constant `-`); (0, PO_subcall((`num`, -), []))])); ((``, (Const_name(`STRING`, [Patt_child(Var_name(`string`, []))])), -), [], PF(H_box[(0, PO_constant `'`); (0, PO_leaf(`string`, -)); (0, PO_constant `'`)])); ((``, (Const_name(`TERMINAL`, [Patt_child(Var_name(`string`, []))])), -), [], PF(H_box[(0, PO_constant `"`); (0, PO_leaf(`string`, -)); (0, PO_constant `"`)])); ((``, (Const_name(`ML_FUN`, [Var_children `strings`])), -), [], PF(H_box[(0, PO_constant `{`); (0, PO_format(PF(V_box[(((Abs 0), 0), PO_subcall((`strings`, -), []))]))); (0, PO_constant `}`)])); ((``, (Const_name(`ID`, [Patt_child(Var_name(`id`, []))])), -), [], PF(H_box[(0, PO_leaf(`id`, -))])); ((``, (Const_name(`NAME_META`, [Var_children `id`])), -), [], PF(H_box[(0, PO_constant `***`); (0, PO_subcall((`id`, -), []))])); ((``, (Const_name(`CHILD_META`, [Var_children `id`])), -), [], PF(H_box[(0, PO_constant `*`); (0, PO_subcall((`id`, -), []))])); ((``, (Const_name(`CHILDREN_META`, [Var_children `id`])), -), [], PF(H_box[(0, PO_constant `**`); (0, PO_subcall((`id`, -), []))])); ((``, (Print_loop((Const_name(`METAVAR_LIST`, [Patt_child(Var_child `metavars`); Patt_child(Link_child(((Default), Default), []))])), Const_name(`METAVAR_LIST`, [Patt_child(Var_child `metavar`)]))), -), [], PF(HV_box[((0, (Abs 3), 0), PO_expand(H_box[(0, PO_subcall((`metavars`, -), [])); (0, PO_constant `;`)])); ((0, (Abs 3), 0), PO_subcall((`metavar`, -), []))])); ((``, (Const_name(`MIN`, [Patt_child(Var_child `num`)])), -), [], PF(H_box[(0, PO_subcall((`num`, -), []))])); ((``, (Const_name(`MAX`, [Patt_child(Var_child `num`)])), -), [], PF(H_box[(0, PO_subcall((`num`, -), []))])); ((``, (Const_name(`LOOP_RANGE`, [Patt_child(Const_name(`MIN`, [Patt_child(Var_child `num`)]))])), -), [], PF(H_box[(0, PO_subcall((`num`, -), [])); (0, PO_constant `..`)])); ((``, (Const_name(`LOOP_RANGE`, [Patt_child(Const_name(`MAX`, [Patt_child(Var_child `num`)]))])), -), [], PF(H_box[(0, PO_constant `..`); (0, PO_subcall((`num`, -), []))])); ((``, (Const_name(`LOOP_RANGE`, [Patt_child(Var_child `min`); Patt_child(Var_child `max`)])), -), [], PF(H_box[(0, PO_subcall((`min`, -), [])); (0, PO_constant `..`); (0, PO_subcall((`max`, -), []))])); ((``, (Const_name(`LOOP_LINK`, [Patt_child(Var_child `loop_range`); Patt_child(Var_child `metavar_list`)])), -), [], PF(H_box[(0, PO_constant `<`); (0, PO_subcall((`loop_range`, -), [])); (0, PO_constant `:`); (1, PO_subcall((`metavar_list`, -), [])); (0, PO_constant `>`)])); ((``, (Const_name(`LOOP_LINK`, [Var_children `metavar_list`])), -), [], PF(H_box[(0, PO_constant `<`); (0, PO_subcall((`metavar_list`, -), [])); (0, PO_constant `>`)])); ((``, (Const_name(`LABEL`, [Patt_child(Var_child `child_meta`)])), -), [], PF(H_box[(0, PO_constant `|`); (0, PO_subcall((`child_meta`, -), [])); (0, PO_constant `|`)])); ((``, (Const_name(`NODE_NAME`, [Patt_child(Var_child `node_name`)])), -), [], PF(H_box[(0, PO_subcall((`node_name`, -), []))])); ((``, (Const_name(`CHILD`, [Patt_child(Var_child `child`)])), -), [], PF(H_box[(0, PO_subcall((`child`, -), []))])); ((``, (Print_loop((Const_name(`CHILD_LIST`, [Patt_child(Var_child `children`); Patt_child(Link_child(((Default), Default), []))])), Const_name(`CHILD_LIST`, [Patt_child(Var_child `child`)]))), -), [], PF(HV_box[((0, (Abs 3), 0), PO_expand(H_box[(0, PO_subcall((`children`, -), [])); (0, PO_constant `,`)])); ((0, (Abs 3), 0), PO_subcall((`child`, -), []))])); ((``, (Const_name(`PATT_TREE`, [Patt_child(Const_name(`NODE_NAME`, [Patt_child(Var_child `node_name`)])); Patt_child(Var_child `child_list`)])), -), [], PF(HV_box[((0, (Abs 3), 0), PO_subcall((`node_name`, -), [])); ((0, (Abs 3), 0), PO_format(PF(H_box[(0, PO_constant `(`); (0, PO_subcall((`child_list`, -), [])); (0, PO_constant `)`)])))])); ((``, (Const_name(`PATT_TREE`, [Patt_child(Const_name(`NODE_NAME`, [Patt_child(Var_child `node_name`)]))])), -), [], PF(H_box[(0, PO_subcall((`node_name`, -), [])); (0, PO_constant `()`)])); ((``, (Const_name(`PATT_TREE`, [Var_children `x`])), -), [], PF(HV_box[((0, (Abs 3), 0), PO_subcall((`x`, -), []))])); ((``, (Const_name(`LOOP`, [Patt_child(Var_child `patt_tree`)])), -), [], PF(H_box[(0, PO_constant `[`); (0, PO_subcall((`patt_tree`, -), [])); (0, PO_constant `]`)])); ((``, (Const_name(`TEST`, [Patt_child(Var_child `test`)])), -), [], PF(H_box[(0, PO_subcall((`test`, -), []))])); ((``, (Const_name(`PATTERN`, [Patt_child(Var_child `string`); Patt_child(Var_child `patt_tree`); Var_children `test`])), -), [], PF(H_box[(0, PO_subcall((`string`, -), [])); (0, PO_constant `::`); (0, PO_format(PF(HV_box[((1, (Abs 3), 0), PO_subcall((`patt_tree`, -), [])); ((1, (Abs 3), 0), PO_expand(HV_box[((1, (Abs 3), 0), PO_constant `where`); ((1, (Abs 3), 0), PO_subcall((`test`, -), []))]))])))])); ((``, (Const_name(`TRANSFORM`, [Patt_child(Var_child `transform`)])), -), [], PF(H_box[(0, PO_subcall((`transform`, -), []))])); ((``, (Const_name(`P_SPECIAL`, [Patt_child(Var_child `metavar`); Patt_child(Var_child `transform`)])), -), [], PF(HV_box[((1, (Abs 3), 0), PO_format(PF(H_box[(1, PO_subcall((`metavar`, -), [])); (1, PO_constant `=`)]))); ((1, (Abs 3), 0), PO_subcall((`transform`, -), []))])); ((``, (Print_loop((Const_name(`P_SPECIAL_LIST`, [Patt_child(Var_child `p_specials`); Patt_child(Link_child(((Default), Default), []))])), Const_name(`P_SPECIAL_LIST`, [Patt_child(Var_child `p_special`)]))), -), [], PF(HoV_box[((1, (Abs 0), 0), PO_expand(H_box[(0, PO_subcall((`p_specials`, -), [])); (0, PO_constant `;`)])); ((1, (Abs 0), 0), PO_subcall((`p_special`, -), []))]))] : print_rule list pp_lang1_rules_fun = - : print_rule_function Calling Lisp compiler File PP_parser/pp_lang1_pp compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/pp_lang1_pp`;;'\ 'compilet `PP_parser/pp_lang2_pp`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #..() : void pp_lang2_rules = [((``, (Const_name(`INT_EXP`, [Patt_child(Var_child `int_exp`)])), -), [], PF(H_box[(0, PO_subcall((`int_exp`, -), []))])); ((``, (Const_name(`ASSIGN`, [Patt_child(Var_child `id`); Patt_child(Var_child `exp`)])), -), [], PF(HV_box[((1, (Abs 3), 0), PO_format(PF(H_box[(1, PO_subcall((`id`, -), [])); (1, PO_constant `:=`)]))); ((1, (Abs 3), 0), PO_subcall((`exp`, -), []))])); ((``, (Print_loop((Const_name(`ASSIGNMENTS`, [Patt_child(Var_child `assigns`); Patt_child(Link_child(((Default), Default), []))])), Const_name(`ASSIGNMENTS`, [Patt_child(Var_child `assign`)]))), -), [], PF(HoV_box[((1, (Abs 0), 0), PO_expand(H_box[(0, PO_subcall((`assigns`, -), [])); (0, PO_constant `;`)])); ((1, (Abs 0), 0), PO_subcall((`assign`, -), []))])); ((``, (Const_name(`F_SUBCALL`, [Patt_child(Var_child `child`)])), -), [], PF(H_box[(0, PO_subcall((`child`, -), []))])); ((``, (Const_name(`F_SUBCALL`, [Patt_child(Var_child `transform`); Patt_child(Var_child `metavar`)])), -), [], PF(HV_box[((0, (Abs 3), 0), PO_subcall((`transform`, -), [])); ((0, (Abs 3), 0), PO_format(PF(H_box[(0, PO_constant `(`); (0, PO_subcall((`metavar`, -), [])); (0, PO_constant `)`)])))])); ((``, (Const_name(`C_SUBCALL`, [Patt_child(Var_child `f_subcall`)])), -), [], PF(H_box[(0, PO_subcall((`f_subcall`, -), []))])); ((``, (Const_name(`C_SUBCALL`, [Patt_child(Var_child `string`); Patt_child(Var_child `f_subcall`)])), -), [], PF(HV_box[((0, (Abs 3), 0), PO_format(PF(H_box[(0, PO_subcall((`string`, -), [])); (0, PO_constant `::`)]))); ((0, (Abs 3), 0), PO_subcall((`f_subcall`, -), []))])); ((``, (Const_name(`LEAF_OR_SUBCALL`, [Patt_child(Var_child `c_subcall`); Var_children `assigns`])), -), [], PF(HV_box[((1, (Abs 3), 0), PO_subcall((`c_subcall`, -), [])); ((1, (Abs 3), 0), PO_expand(V_box[(((Abs 0), 0), PO_constant `with`); (((Abs 3), 0), PO_subcall((`assigns`, -), [])); (((Abs 0), 0), PO_constant `end with`)]))])); ((``, (Const_name(`INC`, [Patt_child(Var_child `num`)])), -), [], PF(H_box[(0, PO_constant `+`); (0, PO_subcall((`num`, -), []))])); ((``, (Const_name(`H_PARAMS`, [Patt_child(Var_child `num`)])), -), [], PF(H_box[(0, PO_subcall((`num`, -), []))])); ((``, (Const_name(`V_PARAMS`, [Patt_child(Var_child `indent`); Patt_child(Var_child `num`)])), -), [], PF(H_box[(0, PO_subcall((`indent`, -), [])); (0, PO_constant `,`); (0, PO_subcall((`num`, -), []))])); ((``, (Const_name(`HV_PARAMS`, [Patt_child(Var_child `num1`); Patt_child(Var_child `indent`); Patt_child(Var_child `num2`)])), -), [], PF(H_box[(0, PO_subcall((`num1`, -), [])); (0, PO_constant `,`); (0, PO_subcall((`indent`, -), [])); (0, PO_constant `,`); (0, PO_subcall((`num2`, -), []))])); ((``, (Const_name(`HOV_PARAMS`, [Patt_child(Var_child `num1`); Patt_child(Var_child `indent`); Patt_child(Var_child `num2`)])), -), [], PF(H_box[(0, PO_subcall((`num1`, -), [])); (0, PO_constant `,`); (0, PO_subcall((`indent`, -), [])); (0, PO_constant `,`); (0, PO_subcall((`num2`, -), []))])); ((``, (Const_name(`H_BOX`, [Patt_child(Var_child `h_params`)])), -), [], PF(H_box[(1, PO_constant `h`); (1, PO_subcall((`h_params`, -), []))])); ((``, (Const_name(`V_BOX`, [Patt_child(Var_child `v_params`)])), -), [], PF(H_box[(1, PO_constant `v`); (1, PO_subcall((`v_params`, -), []))])); ((``, (Const_name(`HV_BOX`, [Patt_child(Var_child `hv_params`)])), -), [], PF(H_box[(1, PO_constant `hv`); (1, PO_subcall((`hv_params`, -), []))])); ((``, (Const_name(`HOV_BOX`, [Patt_child(Var_child `hov_params`)])), -), [], PF(H_box[(1, PO_constant `hov`); (1, PO_subcall((`hov_params`, -), []))])); ((``, (Const_name(`OBJECT`, [Patt_child(Var_child `object`)])), -), [], PF(H_box[(0, PO_subcall((`object`, -), []))])); ((``, (Const_name(`H_OBJECT`, [Var_children `h_params`; Patt_child(Var_child `object`)])), -), [], PF(HV_box[((1, (Abs 3), 0), PO_expand(H_box[(0, PO_constant `<`); (0, PO_subcall((`h_params`, -), [])); (0, PO_constant `>`)])); ((1, (Abs 3), 0), PO_subcall((`object`, -), []))])); ((``, (Const_name(`V_OBJECT`, [Var_children `v_params`; Patt_child(Var_child `object`)])), -), [], PF(HV_box[((1, (Abs 3), 0), PO_expand(H_box[(0, PO_constant `<`); (0, PO_subcall((`v_params`, -), [])); (0, PO_constant `>`)])); ((1, (Abs 3), 0), PO_subcall((`object`, -), []))])); ((``, (Const_name(`HV_OBJECT`, [Var_children `hv_params`; Patt_child(Var_child `object`)])), -), [], PF(HV_box[((1, (Abs 3), 0), PO_expand(H_box[(0, PO_constant `<`); (0, PO_subcall((`hv_params`, -), [])); (0, PO_constant `>`)])); ((1, (Abs 3), 0), PO_subcall((`object`, -), []))])); ((``, (Const_name(`HOV_OBJECT`, [Var_children `hov_params`; Patt_child(Var_child `object`)])), -), [], PF(HV_box[((1, (Abs 3), 0), PO_expand(H_box[(0, PO_constant `<`); (0, PO_subcall((`hov_params`, -), [])); (0, PO_constant `>`)])); ((1, (Abs 3), 0), PO_subcall((`object`, -), []))])); ((``, (Print_loop((Const_name(`H_OBJECT_LIST`, [Patt_child(Var_child `h_objects`); Patt_child(Link_child(((Default), Default), []))])), Const_name(`H_OBJECT_LIST`, [Patt_child(Var_child `h_object`)]))), -), [], PF(HoV_box[((1, (Abs 0), 0), PO_subcall((`h_objects`, -), [])); ((1, (Abs 0), 0), PO_subcall((`h_object`, -), []))])); ((``, (Print_loop((Const_name(`V_OBJECT_LIST`, [Patt_child(Var_child `v_objects`); Patt_child(Link_child(((Default), Default), []))])), Const_name(`V_OBJECT_LIST`, [Patt_child(Var_child `v_object`)]))), -), [], PF(HoV_box[((1, (Abs 0), 0), PO_subcall((`v_objects`, -), [])); ((1, (Abs 0), 0), PO_subcall((`v_object`, -), []))])); ((``, (Print_loop((Const_name(`HV_OBJECT_LIST`, [Patt_child(Var_child `hv_objects`); Patt_child(Link_child(((Default), Default), []))])), Const_name(`HV_OBJECT_LIST`, [Patt_child(Var_child `hv_object`)]))), -), [], PF(HoV_box[((1, (Abs 0), 0), PO_subcall((`hv_objects`, -), [])); ((1, (Abs 0), 0), PO_subcall((`hv_object`, -), []))])); ((``, (Print_loop((Const_name(`HOV_OBJECT_LIST`, [Patt_child(Var_child `hov_objects`); Patt_child(Link_child(((Default), Default), []))])), Const_name(`HOV_OBJECT_LIST`, [Patt_child(Var_child `hov_object`)]))), -), [], PF(HoV_box[((1, (Abs 0), 0), PO_subcall((`hov_objects`, -), [])); ((1, (Abs 0), 0), PO_subcall((`hov_object`, -), []))])); ((``, (Const_name(`BOX_SPEC`, [Patt_child(Var_child `box`); Patt_child(Var_child `object_list`)])), -), [], PF(H_box[(0, PO_constant `<`); (0, PO_subcall((`box`, -), [])); (0, PO_constant `>`); (1, PO_subcall((`object_list`, -), []))])); ((``, (Const_name(`EXPAND`, [Patt_child(Var_child `box_spec`)])), -), [], PF(H_box[(0, PO_constant `**[`); (0, PO_subcall((`box_spec`, -), [])); (0, PO_constant `]`)])); ((``, (Const_name(`FORMAT`, [])), -), [], PF(H_box[(0, PO_constant `[]`)])); ((``, (Const_name(`FORMAT`, [Patt_child(Var_child `box_spec`)])), -), [], PF(H_box[(0, PO_constant `[`); (0, PO_subcall((`box_spec`, -), [])); (0, PO_constant `]`)])); ((``, (Const_name(`FORMAT`, [Patt_child(Var_child `test`); Patt_child(Var_child `format1`); Patt_child(Var_child `format2`)])), -), [], PF(HoV_box[((1, (Abs 0), 0), PO_format(PF(H_box[(1, PO_constant `if`); (1, PO_subcall((`test`, -), []))]))); ((1, (Abs 0), 0), PO_format(PF(H_box[(1, PO_constant `then`); (1, PO_subcall((`format1`, -), []))]))); ((1, (Abs 0), 0), PO_format(PF(H_box[(1, PO_constant `else`); (1, PO_subcall((`format2`, -), []))])))])); ((``, (Const_name(`RULE`, [Patt_child(Const_name(`PATTERN`, [Patt_child(Var_child `string`); Patt_child(Var_child `patt_tree`); Var_children `test`])); Var_children `p_specials`; Patt_child(Var_child `format`)])), -), [], PF(H_box[(0, PO_subcall((`string`, -), [])); (0, PO_constant `::`); (0, PO_format(PF(HoV_box[((1, (Abs 0), 0), PO_format(PF(H_box[(1, PO_format(PF(HV_box[((1, (Abs 3), 0), PO_subcall((`patt_tree`, -), [])); ((1, (Abs 3), 0), PO_expand(HV_box[((1, (Abs 3), 0), PO_constant `where`); ((1, (Abs 3), 0), PO_subcall((`test`, -), []))]))]))); (1, PO_constant `->`)]))); ((1, (Abs 0), 0), PO_expand(H_box[(1, PO_constant `<<`); (1, PO_subcall((`p_specials`, -), [])); (1, PO_constant `>>`)])); ((1, (Abs 0), 0), PO_subcall((`format`, -), []))])))])); ((``, (Print_loop((Const_name(`RULE_LIST`, [Patt_child(Var_child `rules`); Patt_child(Link_child(((Default), Default), []))])), Const_name(`RULE_LIST`, [Patt_child(Var_child `rule`)]))), -), [], PF(V_box[(((Abs 0), 1), PO_expand(H_box[(0, PO_subcall((`rules`, -), [])); (0, PO_constant `;`)])); (((Abs 0), 1), PO_format(PF(H_box[(0, PO_subcall((`rule`, -), [])); (0, PO_constant `;`)])))])); ((``, (Const_name(`RULES`, [Patt_child(Var_child `rule_list`)])), -), [], PF(V_box[(((Abs 3), 0), PO_constant `rules`); (((Abs 3), 0), PO_subcall((`rule_list`, -), [])); (((Abs 0), 1), PO_constant `end rules`)])); ((``, (Const_name(`BINDING`, [Patt_child(Var_child `id`); Patt_child(Var_child `ml_fun`)])), -), [], PF(HV_box[((1, (Abs 3), 0), PO_format(PF(H_box[(1, PO_subcall((`id`, -), [])); (1, PO_constant `=`)]))); ((1, (Abs 3), 0), PO_subcall((`ml_fun`, -), []))])); ((``, (Print_loop((Const_name(`BINDING_LIST`, [Patt_child(Var_child `bindings`); Patt_child(Link_child(((Default), Default), []))])), Const_name(`BINDING_LIST`, [Patt_child(Var_child `binding`)]))), -), [], PF(V_box[(((Abs 0), 1), PO_expand(H_box[(0, PO_subcall((`bindings`, -), [])); (0, PO_constant `;`)])); (((Abs 0), 1), PO_format(PF(H_box[(0, PO_subcall((`binding`, -), [])); (0, PO_constant `;`)])))])); ((``, (Const_name(`DECLARS`, [Patt_child(Var_child `binding_list`)])), -), [], PF(V_box[(((Abs 3), 0), PO_constant `declarations`); (((Abs 3), 0), PO_subcall((`binding_list`, -), [])); (((Abs 0), 1), PO_constant `end declarations`)])); ((``, (Const_name(`ABBREVS`, [Patt_child(Var_child `binding_list`)])), -), [], PF(V_box[(((Abs 3), 0), PO_constant `abbreviations`); (((Abs 3), 0), PO_subcall((`binding_list`, -), [])); (((Abs 0), 1), PO_constant `end abbreviations`)])); ((``, (Const_name(`BODY`, [Var_children `x`])), -), [], PF(V_box[(((Abs 0), 2), PO_subcall((`x`, -), []))])); ((``, (Const_name(`PP`, [Patt_child(Var_child `id`); Patt_child(Var_child `body`)])), -), [], PF(V_box[(((Abs 0), 1), PO_format(PF(H_box[(1, PO_constant `prettyprinter`); (1, PO_subcall((`id`, -), [])); (1, PO_constant `=`)]))); (((Abs 0), 1), PO_subcall((`body`, -), [])); (((Abs 0), 2), PO_constant `end prettyprinter`)]))] : print_rule list pp_lang2_rules_fun = - : print_rule_function Calling Lisp compiler File PP_parser/pp_lang2_pp compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/pp_lang1_pp`;;'\ 'loadf `PP_parser/pp_lang2_pp`;;'\ 'compilet `PP_parser/lex`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #..() : void ..() : void copy_chars = - : (int -> (string -> string) -> string -> (string -> void) -> void) New constructors declared: Lex_spec : (string -> lex_symb) Lex_num : (string -> lex_symb) Lex_id : (string -> lex_symb) Lex_block : (((string # string) # string list) -> lex_symb) is_lex_char = - : ((string # string # string) -> bool) is_lex_ucase = - : (string -> bool) is_lex_lcase = - : (string -> bool) is_lex_letter = - : (string -> bool) is_lex_digit = - : (string -> bool) is_lex_underscore = - : (string -> bool) is_lex_eof = - : (string -> bool) is_lex_eol = - : (string -> bool) is_lex_space = - : (string -> bool) lex_error = - : ((string -> string) -> string -> string -> string -> *) read_char = - : ((* -> string) -> * -> string) read_number = - : ((* -> string) -> * -> string -> (lex_symb # string)) read_identifier = - : ((string -> string) -> string -> string -> (lex_symb # string)) read_block = - : ((string -> string) -> string -> (string # string) -> string -> (lex_symb # string)) read_special = - : ((string -> string) -> string -> string list -> string -> (lex_symb # string)) read_symb = - : ((string -> string) -> string -> (string # string) list -> string list -> string list -> string -> (lex_symb # string)) - : ((string -> string) -> string -> (string # string) list -> string list -> string list -> string -> (lex_symb # string)) read_symb = - : ((string -> string) -> string -> (string # string) list -> string list -> string list -> string -> (lex_symb # string)) Calling Lisp compiler File PP_parser/lex compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/pp_lang1_pp`;;'\ 'loadf `PP_parser/pp_lang2_pp`;;'\ 'loadf `PP_parser/lex`;;'\ 'compilet `PP_parser/syntax`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #..() : void ..() : void ....................() : void PP_quotes = [(`'`, `'`); (`"`, `"`); (`{`, `}`); (`#`, `#`); (`%`, `%`)] : (string # string) list PP_keywords = [`prettyprinter`; `rules`; `declarations`; `abbreviations`; `with`; `end`; `where`; `if`; `then`; `else`; `h`; `v`; `hv`; `hov`] : string list PP_specials = [`+`; `-`; `*`; `**`; `***`; `,`; `;`; `:`; `::`; `=`; `:=`; `->`; `..`; `(`; `)`; `**[`; `[`; `]`; `<`; `>`; `<<`; `>>`; `|`] : string list syntax_error = - : ((string -> string) -> string -> string -> string -> lex_symb -> *) general_error = - : ((string -> string) -> string -> string -> string -> string -> *) read_PP_symb = - : ((string -> string) -> string -> string -> (lex_symb # string)) read_PP_number = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_integer = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_string = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_terminal = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_ML_function = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_identifier = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_name_metavar = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_child_metavar = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_children_metavar = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_metavar_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_min = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_max = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_loop_range = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_loop_link = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_label = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_node_name = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_child = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_child_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_pattern_tree = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_loop = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_test = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_pattern = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_transformation = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_p_special = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_p_special_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_int_expression = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_assignment = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_assignments = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_fun_subcall = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_context_subcall = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_leaf_or_subcall = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_indent = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_h_params = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_v_params = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_hv_params = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_hov_params = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_h_box = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_v_box = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_hv_box = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_hov_box = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_object = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_h_object = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_v_object = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_hv_object = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_hov_object = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_h_object_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_v_object_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_hv_object_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_hov_object_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_box_spec = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_expand = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_format = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_rule = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_rule_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_rules = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_binding = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_binding_list = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_declarations = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_abbreviations = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP_body = - : ((string -> string) -> string -> (lex_symb # string) -> (print_tree # lex_symb # string)) read_PP = - : ((string -> string) -> string -> print_tree) - : ((string -> string) -> string -> print_tree) read_PP = - : ((string -> string) -> string -> print_tree) Calling Lisp compiler File PP_parser/syntax compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/pp_lang1_pp`;;'\ 'loadf `PP_parser/pp_lang2_pp`;;'\ 'loadf `PP_parser/lex`;;'\ 'loadf `PP_parser/syntax`;;'\ 'compilet `PP_parser/convert`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #..() : void ..() : void ....................() : void .......................................................() : void construction_error = - : (print_tree -> string -> *) indirect_string = - : (string -> string) convert_NUM = - : ((print_tree # *) -> (print_tree # ** list)) convert_NEG = - : ((print_tree # *) -> (print_tree # ** list)) convert_ML_FUN = - : ((print_tree # *) -> (print_tree # ** list)) convert_ID_to_VAR = - : ((print_tree # *) -> (print_tree # ** list)) convert_ID_to_TOKCONST = - : ((print_tree # *) -> (print_tree # ** list)) convert_METAVAR = - : ((print_tree # *) -> (print_tree # ** list)) convert_METAVAR_to_TOKCONST = - : ((print_tree # *) -> (print_tree # ** list)) convert_METAVAR_LIST = - : ((print_tree # *) -> (print_tree # ** list)) convert_MIN = - : ((print_tree # *) -> (print_tree # ** list)) convert_MAX = - : ((print_tree # *) -> (print_tree # ** list)) convert_LOOP_RANGE = - : ((print_tree # *) -> (print_tree # ** list)) convert_LOOP_LINK = - : ((print_tree # *) -> (print_tree # ** list)) convert_LABEL = - : ((print_tree # *) -> (print_tree # ** list)) convert_NODE_NAME = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_CHILD = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_CHILD_LIST = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_PATT_TREE = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_LOOP = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_STRING = - : ((print_tree # *) -> (print_tree # ** list)) convert_TEST = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_PATTERN = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_TRANSFORM = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_P_SPECIAL = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_P_SPECIAL_LIST = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_INT_EXP = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_ASSIGN = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_ASSIGNMENTS = - : ((print_tree # (string # print_tree) list) -> (print_tree # * list)) convert_F_SUBCALL = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_C_SUBCALL = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_LEAF_OR_SUBCALL = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_TERMINAL = - : ((print_tree # *) -> (print_tree # ** list)) convert_INC = - : ((print_tree # *) -> (print_tree # ** list)) convert_H_PARAMS = - : ((print_tree # *) -> (print_tree # ** list)) convert_V_PARAMS = - : ((print_tree # *) -> (print_tree # ** list)) convert_HV_PARAMS = - : ((print_tree # *) -> (print_tree # ** list)) convert_HOV_PARAMS = - : ((print_tree # *) -> (print_tree # ** list)) convert_BOX = - : ((print_tree # *) -> (print_tree # ** list)) convert_OBJECT = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_H_OBJECT = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_V_OBJECT = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_HV_OBJECT = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_HOV_OBJECT = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_H_OBJECT_LIST = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_V_OBJECT_LIST = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_HV_OBJECT_LIST = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_HOV_OBJECT_LIST = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_BOX_SPEC = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_EXPAND = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_FORMAT = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_RULE = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_RULE_LIST = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_RULES = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_BINDING = - : ((print_tree # *) -> (print_tree # ** list)) convert_BINDING_LIST_to_LIST = - : ((print_tree # *) -> (print_tree # ** list)) convert_BINDING_LIST_to_LETREC = - : ((print_tree # *) -> (print_tree # ** list)) convert_DECLARS = - : ((print_tree # *) -> (print_tree # ** list)) convert_ABBREVS = - : ((print_tree # *) -> (print_tree # (string # print_tree) list)) convert_BODY = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_PP = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) convert_PP = - : ((print_tree # (string # print_tree) list) -> (print_tree # (string # print_tree) list)) Calling Lisp compiler File PP_parser/convert compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/pp_lang1_pp`;;'\ 'loadf `PP_parser/pp_lang2_pp`;;'\ 'loadf `PP_parser/lex`;;'\ 'loadf `PP_parser/syntax`;;'\ 'loadf `PP_parser/convert`;;'\ 'compilet `PP_parser/generate`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #..() : void ..() : void ....................() : void .......................................................() : void .................................................() : void PP_to_ML_rules = [((`name`, (Var_name(`n`, [])), -), [], PF(H_box[(0, PO_leaf(`n`, -))])); ((``, (Const_name(`INTCONST`, [Patt_child(Var_name(`n`, []))])), -), [], PF(H_box[(0, PO_leaf(`n`, -))])); ((``, (Const_name(`TOKCONST`, [Patt_child(Var_name(`n`, []))])), -), [], PF(H_box[(0, PO_constant ```); (0, PO_leaf(`n`, -)); (0, PO_constant ```)])); ((``, (Const_name(`VAR`, [Patt_child(Var_name(`n`, []))])), -), [], PF(H_box[(0, PO_leaf(`n`, -))])); ((``, (Const_name(`CON`, [Patt_child(Var_name(`n`, []))])), -), [], PF(H_box[(0, PO_leaf(`n`, -))])); ((``, (Const_name(`CON0`, [Patt_child(Var_name(`n`, []))])), -), [], PF(H_box[(0, PO_leaf(`n`, -))])); ((``, (Const_name(`UNOP`, [Patt_child(Var_name(`n`, [])); Patt_child(Var_child `c`)])), -), [], PF(H_box[(0, PO_constant `(`); (0, PO_format(PF(HV_box[((0, (Abs 0), 0), PO_leaf(`n`, -)); ((0, (Abs 0), 0), PO_subcall((`c`, -), []))]))); (0, PO_constant `)`)])); ((``, (Const_name(`APPN`, [Patt_child(Var_child `c1`); Patt_child(Var_child `c2`)])), -), [], PF(H_box[(0, PO_constant `(`); (0, PO_format(PF(HV_box[((1, (Abs 1), 0), PO_subcall((`c1`, -), [])); ((1, (Abs 1), 0), PO_subcall((`c2`, -), []))]))); (0, PO_constant `)`)])); ((``, (Const_name(`ABSTR`, [Patt_child(Var_child `c1`); Patt_child(Var_child `c2`)])), -), [], PF(H_box[(0, PO_constant `(\`); (0, PO_format(PF(HV_box[((1, (Abs 1), 0), PO_format(PF(H_box[(0, PO_subcall((`c1`, -), [])); (0, PO_constant `.`)]))); ((1, (Abs 1), 0), PO_subcall((`c2`, -), []))]))); (0, PO_constant `)`)])); ((``, (Const_name(`LIST`, [Var_children `cl`; Patt_child(Var_child `c`)])), -), [], PF(H_box[(0, PO_constant `[`); (0, PO_format(PF(HoV_box[((0, (Abs 0), 0), PO_expand(H_box[(0, PO_subcall((`cl`, -), [])); (0, PO_constant `;`)])); ((0, (Abs 0), 0), PO_subcall((`c`, -), []))]))); (0, PO_constant `]`)])); ((``, (Const_name(`LIST`, [])), -), [], PF(H_box[(0, PO_constant `[]`)])); ((``, (Print_loop((Const_name(`DUPL`, [Patt_child(Var_child `cl`); Patt_child(Link_child(((Val 1), Default), []))])), Var_child `c`)), -), [], PF(H_box[(0, PO_constant `(`); (0, PO_format(PF(HV_box[((0, (Abs 0), 0), PO_expand(H_box[(0, PO_subcall((`cl`, -), [])); (0, PO_constant `,`)])); ((0, (Abs 0), 0), PO_subcall((`c`, -), []))]))); (0, PO_constant `)`)])); ((``, (Const_name(`LETREC`, [Patt_child(Const_name(`DUPL`, [Patt_child(Var_child `var1`); Patt_child(Print_loop((Const_name(`DUPL`, [Patt_child(Var_child `varl`); Patt_child(Link_child(((Default), Default), []))])), Var_child `varl`))])); Patt_child(Const_name(`DUPL`, [Patt_child(Var_child `body1`); Patt_child(Print_loop((Const_name(`DUPL`, [Patt_child(Var_child `bodyl`); Patt_child(Link_child(((Default), Default), []))])), Var_child `bodyl`))]))])), -), [], PF(V_box[(((Abs 0), 0), PO_format(PF(HV_box[((1, (Inc 1), 0), PO_constant `letrec`); ((1, (Inc 1), 0), PO_format(PF(H_box[(1, PO_subcall((`var1`, -), [])); (1, PO_constant `=`)]))); ((1, (Inc 1), 0), PO_subcall((`body1`, -), []))]))); (((Abs 0), 0), PO_expand(HV_box[((1, (Inc 1), 0), PO_constant `and`); ((1, (Inc 1), 0), PO_expand(H_box[(1, PO_subcall((`varl`, -), [])); (1, PO_constant `=`)])); ((1, (Inc 1), 0), PO_subcall((`bodyl`, -), []))]))])); ((``, (Const_name(`LETREC`, [Patt_child(Var_child `c1`); Patt_child(Var_child `c2`)])), -), [], PF(HV_box[((1, (Inc 1), 0), PO_constant `letrec`); ((1, (Inc 1), 0), PO_format(PF(H_box[(1, PO_subcall((`c1`, -), [])); (1, PO_constant `=`)]))); ((1, (Inc 1), 0), PO_subcall((`c2`, -), []))])); ((``, (Const_name(`ML_FUN`, [Var_children `cl`])), -), [], PF(H_box[(0, PO_constant `(`); (0, PO_format(PF(V_box[(((Abs 0), 0), PO_context_subcall(`name`, (`cl`, -), []))]))); (0, PO_constant `)`)]))] : print_rule list PP_to_ML_rules_fun = - : print_rule_function write_strings = - : (((* # string) -> **) -> * -> string list -> void) generate_rule = - : (print_tree -> string list) write_rule = - : (((* # string) -> **) -> * -> print_tree -> void) write_rules = - : (((* # string) -> **) -> * -> print_tree list -> void) generate_declarations = - : (print_tree -> string list) write_declarations = - : (((* # string) -> **) -> * -> print_tree -> void) generate_head = - : (string -> string list) write_head = - : (((* # string) -> **) -> * -> string -> void) generate_tail = - : (string -> string list) write_tail = - : (((* # string) -> **) -> * -> string -> void) generate_ML = - : (((string # string) -> void) -> string -> print_tree -> void) - : (((string # string) -> void) -> string -> print_tree -> void) generate_ML = - : (((string # string) -> void) -> string -> print_tree -> void) Calling Lisp compiler File PP_parser/generate compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/pp_lang1_pp`;;'\ 'loadf `PP_parser/pp_lang2_pp`;;'\ 'loadf `PP_parser/lex`;;'\ 'loadf `PP_parser/syntax`;;'\ 'loadf `PP_parser/convert`;;'\ 'loadf `PP_parser/generate`;;'\ 'compilet `PP_parser/PP_to_ML`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #..() : void ..() : void ....................() : void .......................................................() : void .................................................() : void ...............() : void PP_to_ML = - : (bool -> string -> string -> void) Calling Lisp compiler File PP_parser/PP_to_ML compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/PP_parser`;;'\ 'compilet `PP_hol/hol_trees`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #.................................................................................................................................................() : void # New constructors declared: No_types : type_selection Hidden_types : type_selection Useful_types : type_selection All_types : type_selection type_to_print_tree = - : (type -> print_tree) term_to_print_tree = - : (bool -> type_selection -> term -> print_tree) thm_to_print_tree = - : (bool -> bool -> type_selection -> thm -> print_tree) Calling Lisp compiler File PP_hol/hol_trees compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/PP_parser`;;'\ 'loadf `PP_hol/hol_trees`;;'\ 'compilet `PP_hol/precedence`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #.................................................................................................................................................() : void #....() : void type_prec = - : (string -> int) min_type_prec = 0 : int max_type_prec = 400 : int term_prec = - : (string -> int) min_term_prec = 0 : int max_term_prec = 1700 : int Calling Lisp compiler File PP_hol/precedence compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/PP_parser`;;'\ 'PP_to_ML false `PP_hol/hol_type` ``;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #.................................................................................................................................................() : void #() : void echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/PP_parser`;;'\ 'loadf `PP_hol/hol_trees`;;'\ 'loadf `PP_hol/precedence`;;'\ 'compilet `PP_hol/hol_type_pp`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #.................................................................................................................................................() : void #....() : void ......() : void hol_type_rules = [((`type`, (Const_name(`VAR`, [Patt_child(Var_name(`op`, []))])), -), [], PF(H_box[(0, PO_leaf(`op`, -))])); ((`type`, (Const_name(`OP`, [Patt_child(Var_name(`op`, []))])), -), [], PF(H_box[(0, PO_leaf(`op`, -))])); ((`type`, (Const_name(`OP`, [Patt_child(Var_name(`op`, [])); Patt_child(Var_child `type1`); Patt_child(Var_child `type2`)])), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HV_box[((1, (Abs 3), 0), PO_format(PF(H_box[(1, PO_subcall((`type1`, -), [(`prec`, -)])); (1, PO_leaf(`op`, -))]))); ((1, (Abs 3), 0), PO_subcall((`type2`, -), [(`prec`, -)]))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`type`, (Const_name(`OP`, [Patt_child(Var_name(`op`, [])); Var_children `types`; Patt_child(Var_child `type`)])), -), [], PF(HV_box[((0, (Abs 3), 0), PO_format(PF(H_box[(0, PO_constant `(`); (0, PO_format(PF(HV_box[((0, (Inc 3), 0), PO_expand(H_box[(0, PO_subcall((`types`, -), [(`prec`, -)])); (0, PO_constant `,`)])); ((0, (Inc 3), 0), PO_subcall((`type`, -), [(`prec`, -)]))]))); (0, PO_constant `)`)]))); ((0, (Abs 3), 0), PO_leaf(`op`, -))])); ((`type`, (Const_name(`type`, [Patt_child(Var_child `type`)])), -), [], PF(H_box[(0, PO_constant `":`); (0, PO_subcall((`type`, -), [(`prec`, -)])); (0, PO_constant `"`)])); ((`term`, (Var_child `type`), -), [], PF(H_box[(0, PO_context_subcall(`type`, (`type`, -), [(`prec`, -)]))]))] : print_rule list hol_type_rules_fun = - : print_rule_function Calling Lisp compiler File PP_hol/hol_type_pp compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/PP_parser`;;'\ 'PP_to_ML false `PP_hol/hol_term` ``;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #.................................................................................................................................................() : void #() : void echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/PP_parser`;;'\ 'loadf `PP_hol/hol_trees`;;'\ 'loadf `PP_hol/precedence`;;'\ 'loadf `PP_hol/hol_type_pp`;;'\ 'compilet `PP_hol/hol_term_pp`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #.................................................................................................................................................() : void #....() : void ......() : void ..() : void hol_term_rules = [((`term`, (Const_name(`CONST`, [Patt_child(Const_name(`NIL`, [])); Wild_children])), -), [], PF(H_box[(0, PO_constant `[]`)])); ((`term`, (Const_name(`VAR`, [Patt_child(Var_name(`var`, []))])), -), [], PF(H_box[(0, PO_leaf(`var`, -))])); ((`term`, (Const_name(`VAR`, [Patt_child(Var_name(`var`, [])); Patt_child(Const_name(`type`, [Patt_child(Var_child `type`)]))])), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HV_box[((0, (Abs 0), 0), PO_leaf(`var`, -)); ((0, (Abs 0), 0), PO_format(PF(H_box[(0, PO_constant `:`); (0, PO_subcall((`type`, -), []))])))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Const_name(`CONST`, [Patt_child(Var_name(`const`, []))])), -), [], PF(H_box[(0, PO_leaf(`const`, -))])); ((`term`, (Const_name(`CONST`, [Patt_child(Var_name(`const`, [])); Patt_child(Const_name(`type`, [Patt_child(Var_child `type`)]))])), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HV_box[((0, (Abs 0), 0), PO_leaf(`const`, -)); ((0, (Abs 0), 0), PO_format(PF(H_box[(0, PO_constant `:`); (0, PO_subcall((`type`, -), []))])))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Print_loop((Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Var_name(`op`, [])); Wild_children])); Patt_child(Var_child `comps`)])); Patt_child(Link_child(((Val 1), Default), [`op`]))])), Var_child `comp`)), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HV_box[((0, (Abs 0), 0), PO_expand(H_box[(0, PO_subcall((`comps`, -), [(`prec`, -)])); (0, PO_leaf(`op`, -))])); ((0, (Abs 0), 0), PO_subcall((`comp`, -), [(`prec`, -)]))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Print_loop((Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Var_name(`op`, [])); Wild_children])); Patt_child(Var_child `args`)])); Patt_child(Link_child(((Val 1), Default), [`op`]))])), Var_child `arg`)), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HoV_box[((1, (Abs 0), 0), PO_expand(HV_box[((1, (Abs 0), 0), PO_subcall((`args`, -), [(`prec`, -)])); ((1, (Abs 0), 0), PO_leaf(`op`, -))])); ((1, (Abs 0), 0), PO_subcall((`arg`, -), [(`prec`, -)]))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Var_name(`op`, [])); Wild_children])); Patt_child(Var_child `arg1`)])); Patt_child(Var_child `arg2`)])), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HV_box[((1, (Abs 3), 0), PO_format(PF(H_box[(1, PO_subcall((`arg1`, -), [(`prec`, -)])); (1, PO_leaf(`op`, -))]))); ((1, (Abs 3), 0), PO_subcall((`arg2`, -), [(`prec`, -)]))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Var_name(`op`, [])); Wild_children])); Patt_child(Var_child `arg`)])), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_leaf(`op`, -)); (0, PO_subcall((`arg`, -), [(`prec`, -)])); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Print_loop((Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Var_name(`op`, [])); Wild_children])); Patt_child(Const_name(`ABS`, [Patt_child(Var_child `bvs`); Patt_child(Link_child(((Val 1), Default), [`op`]))]))])), Var_child `body`)), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HV_box[((1, (Abs 3), 0), PO_format(PF(H_box[(0, PO_leaf(`op`, -)); (0, PO_format(PF(HV_box[((1, (Abs 0), 0), PO_subcall((`bvs`, -), [(`prec`, -)]))]))); (0, PO_constant `.`)]))); ((1, (Abs 3), 0), PO_subcall((`body`, -), [(`prec`, -)]))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Print_loop((Const_name(`ABS`, [Patt_child(Var_child `bvs`); Patt_child(Link_child(((Val 1), Default), []))])), Var_child `body`)), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HV_box[((1, (Abs 3), 0), PO_format(PF(H_box[(0, PO_constant `\`); (0, PO_format(PF(HV_box[((1, (Abs 0), 0), PO_subcall((`bvs`, -), [(`prec`, -)]))]))); (0, PO_constant `.`)]))); ((1, (Abs 3), 0), PO_subcall((`body`, -), [(`prec`, -)]))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`COND`, [])); Wild_children])); Patt_child(Var_child `cond`)])); Patt_child(Var_child `x`)])); Patt_child(Var_child `y`)])), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HoV_box[((1, (Abs 0), 0), PO_format(PF(HV_box[((1, (Abs 0), 0), PO_subcall((`cond`, -), [(`prec`, -)])); ((1, (Abs 0), 0), PO_constant `=>`)]))); ((1, (Abs 0), 0), PO_format(PF(HV_box[((1, (Abs 0), 0), PO_subcall((`x`, -), [(`prec`, -)])); ((1, (Abs 0), 0), PO_constant `|`)]))); ((1, (Abs 0), 0), PO_subcall((`y`, -), [(`prec`, -)]))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term_let`, (Print_loop((Const_name(`ABS`, [Patt_child(Var_child `args`); Patt_child(Link_child(((Default), Default), []))])), Wild_child)), -), [], PF(H_box[(1, PO_context_subcall(`term`, (`args`, -), []))])); ((`term`, (Print_loop((Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`LET`, [])); Wild_children])); Patt_child(Print_link((((Default), Default), []), Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`LET`, [])); Wild_children])); Patt_child (Wild_child)])); Patt_child (Wild_child)])))])); Patt_child(Print_label(`argsl`, Print_loop((Const_name(`ABS`, [Patt_child (Wild_child); Patt_child(Link_child(((Default), Default), []))])), Var_child `letbodyl`)))])), Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`LET`, [])); Wild_children])); Patt_child(Const_name(`ABS`, [Patt_child(Var_child `bv`); Patt_child(Print_loop((Const_name(`ABS`, [Patt_child(Var_child `bvl`); Patt_child(Link_child(((Default), Default), []))])), Var_child `body`))]))])); Patt_child(Print_label(`args`, Print_loop((Const_name(`ABS`, [Patt_child (Wild_child); Patt_child(Link_child(((Default), Default), []))])), Var_child `letbody`)))]))), -), [(`argsl`, -); (`letbodyl`, -)], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HoV_box[((1, (Abs 0), 0), PO_format(PF(HV_box[((1, (Abs 3), 0), PO_format(PF(H_box[(1, PO_constant `let`); (1, PO_subcall((`bv`, -), [(`prec`, -)])); (1, PO_context_subcall(`term_let`, (`args`, -), [(`prec`, -)])); (1, PO_constant `=`)]))); ((1, (Abs 3), 0), PO_subcall((`letbody`, -), [(`prec`, -)]))]))); ((1, (Abs 0), 0), PO_expand(HV_box[((1, (Abs 3), 0), PO_expand(H_box[(1, PO_constant `and`); (1, PO_subcall((`bvl`, -), [(`prec`, -)])); (1, PO_context_subcall(`term_let`, (`argsl`, -), [(`prec`, -)])); (1, PO_constant `=`)])); ((1, (Abs 3), 0), PO_subcall((`letbodyl`, -), [(`prec`, -)]))])); ((1, (Abs 0), 0), PO_format(PF(H_box[(1, PO_constant `in`); (1, PO_subcall((`body`, -), [(`prec`, -)]))])))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Print_loop((Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`CONS`, [])); Wild_children])); Patt_child(Var_child `elems`)])); Patt_child(Print_link((((Default), Default), []), Const_name(`COMB`, [Wild_children])))])), Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`CONS`, [])); Wild_children])); Patt_child(Var_child `elem`)])); Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`NIL`, [])); Wild_children]))]))), -), [], PF(H_box[(0, PO_constant `[`); (0, PO_format(PF(HoV_box[((0, (Abs 0), 0), PO_expand(H_box[(0, PO_subcall((`elems`, -), [(`prec`, -)])); (0, PO_constant `;`)])); ((0, (Abs 0), 0), PO_subcall((`elem`, -), [(`prec`, -)]))]))); (0, PO_constant `]`)])); ((`term`, (Print_loop((Const_name(`COMB`, [Patt_child(Link_child(((Val 1), Default), [])); Patt_child(Var_child `rands`)])), Var_child `rator`)), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HV_box[((1, (Abs 3), 0), PO_subcall((`rator`, -), [(`prec`, -)])); ((1, (Abs 3), 0), PO_subcall((`rands`, -), [(`prec`, -)]))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Const_name(`term`, [Patt_child(Var_child `term`)])), -), [], PF(H_box[(0, PO_constant `"`); (0, PO_subcall((`term`, -), [(`prec`, -)])); (0, PO_constant `"`)])); ((`thm`, (Var_child `term`), -), [], PF(H_box[(0, PO_context_subcall(`term`, (`term`, -), [(`prec`, -)]))]))] : print_rule list hol_term_rules_fun = - : print_rule_function Calling Lisp compiler File PP_hol/hol_term_pp compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/PP_parser`;;'\ 'PP_to_ML false `PP_hol/hol_thm` ``;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #.................................................................................................................................................() : void #() : void echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/PP_parser`;;'\ 'loadf `PP_hol/hol_trees`;;'\ 'loadf `PP_hol/precedence`;;'\ 'loadf `PP_hol/hol_type_pp`;;'\ 'loadf `PP_hol/hol_term_pp`;;'\ 'compilet `PP_hol/hol_thm_pp`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #.................................................................................................................................................() : void #....() : void ......() : void ..() : void ..() : void hol_thm_rules = [((`thm`, (Const_name(`dot`, [])), -), [], PF(H_box[(0, PO_constant `.`)])); ((`thm`, (Const_name(`term`, [Patt_child(Var_child `term`)])), -), [], PF(H_box[(0, PO_subcall((`term`, -), []))])); ((`thm`, (Const_name(`thm`, [Patt_child(Var_child `concl`); Patt_child(Const_name(`dots`, [Var_children `dots`]))])), -), [], PF(H_box[(1, PO_format(PF(H_box[(0, PO_subcall((`dots`, -), []))]))); (1, PO_constant `|-`); (1, PO_subcall((`concl`, -), []))])); ((`thm`, (Const_name(`thm`, [Patt_child(Var_child `concl`); Patt_child(Const_name(`hyp`, [Var_children `hyps`; Patt_child(Var_child `hyp`)]))])), -), [], PF(HoV_box[((1, (Abs 0), 0), PO_expand(H_box[(0, PO_subcall((`hyps`, -), [])); (0, PO_constant `,`)])); ((1, (Abs 0), 0), PO_subcall((`hyp`, -), [])); ((1, (Abs 0), 0), PO_format(PF(H_box[(1, PO_constant `|-`); (1, PO_subcall((`concl`, -), []))])))])); ((`thm`, (Const_name(`thm`, [Patt_child(Var_child `concl`); Patt_child(Const_name(`hyp`, []))])), -), [], PF(H_box[(1, PO_constant `|-`); (1, PO_subcall((`concl`, -), []))]))] : print_rule list hol_thm_rules_fun = - : print_rule_function Calling Lisp compiler File PP_hol/hol_thm_pp compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/PP_parser`;;'\ 'loadf `PP_hol/hol_trees`;;'\ 'loadf `PP_hol/precedence`;;'\ 'loadf `PP_hol/hol_type_pp`;;'\ 'loadf `PP_hol/hol_term_pp`;;'\ 'loadf `PP_hol/hol_thm_pp`;;'\ 'compilet `PP_hol/new_printers`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #.................................................................................................................................................() : void #....() : void ......() : void ..() : void ..() : void ..() : void hol_rules_fun = - : print_rule_function pp_convert_type = - : (type -> print_tree) pp_convert_term = - : (term -> print_tree) pp_convert_thm = - : (thm -> print_tree) pp_convert_all_thm = - : (thm -> print_tree) pp_print_type = - : (type -> void) pp_print_term = - : (term -> void) pp_print_thm = - : (thm -> void) pp_print_all_thm = - : (thm -> void) pp_print_theory = - : (string -> void) Calling Lisp compiler File PP_hol/new_printers compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `PP_printer/PP_printer`;;'\ 'loadf `PP_parser/PP_parser`;;'\ 'loadf `PP_hol/hol_trees`;;'\ 'loadf `PP_hol/precedence`;;'\ 'loadf `PP_hol/hol_type_pp`;;'\ 'loadf `PP_hol/hol_term_pp`;;'\ 'loadf `PP_hol/hol_thm_pp`;;'\ 'loadf `PP_hol/new_printers`;;'\ 'compilet `PP_hol/link_to_hol`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool ..................................................................................................................() : void #.................................................................................................................................................() : void #....() : void ......() : void ..() : void ..() : void ..() : void ..........() : void - : (type -> void) - : (term -> void) - : (thm -> void) - : (term -> void) Calling Lisp compiler File PP_hol/link_to_hol compiled () : void #===> library prettyp rebuilt make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs' echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `extents`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Calling Lisp compiler File extents compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `extents`;;'\ 'compilet `sets`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void no_rep = - : (* list -> bool) remove_rep = - : (* list -> * list) is_subset = - : (* list -> * list -> bool) Calling Lisp compiler File sets compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `extents`;;'\ 'loadf `sets`;;'\ 'compilet `extract`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void ...() : void get_ids = - : (term -> (term list # term list # term list)) get_consts = - : (term -> term list) get_freevars = - : (term -> term list) get_boundvars = - : (term -> term list) get_types = - : (term -> type list) is_primtype = - : (type -> bool) subtypes = - : (type -> type list) prim_subtypes = - : (type -> type list) get_primtypes = - : (term -> type list) get_primvartypes = - : (term -> type list) Calling Lisp compiler File extract compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `extents`;;'\ 'loadf `sets`;;'\ 'loadf `extract`;;'\ 'compilet `struct`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void ...() : void ..........() : void merge = - : ((* # **) list -> (* # **) list -> (* # **) list) join = - : (((term # term) list # (type # type) list) -> ((term # term) list # (type # type) list) -> ((term # term) list # (type # type) list)) remove_bv = - : (term -> ((term # term) list # (type # type) list) -> ((term # term) list # (type # type) list)) match_type = - : (type -> type -> (type # type) list) match_term = - : (term -> term -> ((term # term) list # (type # type) list)) match_internal_term = - : (term -> term -> ((term # term) list # (type # type) list)) show_wildvar = - : (wildvar -> term) make_wildvar = - : (term -> wildvar) wildvarlist = - : (term list -> wildvar list) show_wildtype = - : (wildtype -> type) make_wildtype = - : (type -> wildtype) wildtypelist = - : (type list -> wildtype list) show_termpattern = - : (termpattern -> (term # wildvar list # wildtype list)) make_termpattern = - : ((term # wildvar list # wildtype list) -> termpattern) show_full_termpattern = - : (termpattern -> (term # term list # type list)) make_full_termpattern = - : ((term # term list # type list) -> termpattern) autotermpattern = - : (term -> termpattern) show_matching = - : (matching -> ((wildvar # term) list # (wildtype # type) list)) null_matching = - : matching make_matching = - : (termpattern -> term -> matching) join_matchings = - : (matching -> matching -> matching) show_full_matching = - : (matching -> ((term # term) list # (type # type) list)) match_of_var = - : (matching -> wildvar -> term) match_of_type = - : (matching -> wildtype -> type) New constructors declared: Nomatch : result_of_match Match : ((matching # (void -> result_of_match)) -> result_of_match) Match_null = Match((-), -) : result_of_match approms = - : ((void -> result_of_match) -> (void -> result_of_match) -> void -> result_of_match) bool_to_rom = - : (bool -> result_of_match) rom_to_bool = - : (result_of_match -> bool) type side_condition defined Calling Lisp compiler File struct compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `extents`;;'\ 'loadf `sets`;;'\ 'loadf `extract`;;'\ 'loadf `struct`;;'\ 'compilet `name`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void ...() : void ..........() : void ........................() : void show_wildchar = - : (wildchar -> string) make_wildchar = - : (string -> wildchar) show_namepattern = - : (namepattern -> (string # wildchar # wildchar)) make_namepattern = - : ((string # wildchar # wildchar) -> namepattern) show_full_namepattern = - : (namepattern -> (string # string # string)) make_full_namepattern = - : ((string # string # string) -> namepattern) wildchar1 = `?` : string wildcharn = `*` : string autonamepattern = - : (string -> namepattern) namematch = - : (namepattern -> string -> bool) Calling Lisp compiler File name compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `extents`;;'\ 'loadf `sets`;;'\ 'loadf `extract`;;'\ 'loadf `struct`;;'\ 'loadf `name`;;'\ 'compilet `thmkind`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void ...() : void ..........() : void ........................() : void .......() : void New constructors declared: Axiom : thmkind Definition : thmkind Theorem : thmkind Calling Lisp compiler File thmkind compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `extents`;;'\ 'loadf `sets`;;'\ 'loadf `extract`;;'\ 'loadf `struct`;;'\ 'loadf `name`;;'\ 'loadf `thmkind`;;'\ 'compilet `matching`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void ...() : void ..........() : void ........................() : void .......() : void .() : void type foundthm defined New constructors declared: Kind' : (thmkind -> thmpattern_rep) Thryname' : (namepattern -> thmpattern_rep) Thmname' : (namepattern -> thmpattern_rep) Conc' : (termpattern -> thmpattern_rep) HypP' : (termpattern list -> thmpattern_rep) HypF' : (termpattern list -> thmpattern_rep) Side' : (side_condition -> thmpattern_rep) Andalso' : ((thmpattern_rep # thmpattern_rep) -> thmpattern_rep) Orelse' : ((thmpattern_rep # thmpattern_rep) -> thmpattern_rep) Not' : (thmpattern_rep -> thmpattern_rep) Where' : ((thmpattern_rep # thmpattern_rep) -> thmpattern_rep) show_thmpattern = - : (thmpattern -> thmpattern_rep) Kind = - : (thmkind -> thmpattern) Thryname = - : (namepattern -> thmpattern) Thmname = - : (namepattern -> thmpattern) Conc = - : (termpattern -> thmpattern) HypP = - : (termpattern list -> thmpattern) HypF = - : (termpattern list -> thmpattern) Side = - : (side_condition -> thmpattern) Andalso = - : ((thmpattern # thmpattern) -> thmpattern) Orelse = - : ((thmpattern # thmpattern) -> thmpattern) Not = - : (thmpattern -> thmpattern) Where = - : ((thmpattern # thmpattern) -> thmpattern) thmmatch = - : (thmpattern -> foundthm -> bool) () : void () : void () : void thmfilter = - : (thmpattern -> foundthm list -> foundthm list) Calling Lisp compiler File matching compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `extents`;;'\ 'loadf `sets`;;'\ 'loadf `extract`;;'\ 'loadf `struct`;;'\ 'loadf `name`;;'\ 'loadf `thmkind`;;'\ 'loadf `matching`;;'\ 'compilet `sidecond`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void ...() : void ..........() : void ........................() : void .......() : void .() : void .......() : void containsfn = - : (termpattern -> term -> void -> result_of_match) () : void Contains = - : (wildvar -> termpattern -> thmpattern) () : void contains = - : (term -> term -> thmpattern) () : void Matches = - : (wildvar -> termpattern -> thmpattern) () : void matches = - : (term -> term -> thmpattern) dest_binder = - : (term -> (term # term)) strip_binders = - : (term -> term) () : void Has_body = - : (wildvar -> termpattern -> thmpattern) () : void has_body = - : (term -> term -> thmpattern) Test1term = - : ((term -> bool) -> wildvar -> thmpattern) test1term = - : ((term -> bool) -> term -> thmpattern) Test1type = - : ((type -> bool) -> wildtype -> thmpattern) test1type = - : ((type -> bool) -> type -> thmpattern) Test2terms = - : ((term -> term -> bool) -> wildvar -> wildvar -> thmpattern) test2terms = - : ((term -> term -> bool) -> term -> term -> thmpattern) Test2types = - : ((type -> type -> bool) -> wildtype -> wildtype -> thmpattern) test2types = - : ((type -> type -> bool) -> type -> type -> thmpattern) Calling Lisp compiler File sidecond compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `extents`;;'\ 'loadf `sets`;;'\ 'loadf `extract`;;'\ 'loadf `struct`;;'\ 'loadf `name`;;'\ 'loadf `thmkind`;;'\ 'loadf `matching`;;'\ 'loadf `sidecond`;;'\ 'compilet `search`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void ...() : void ..........() : void ........................() : void .......() : void .() : void .......() : void .......................() : void get_theorems = - : (string -> foundthm list) New constructors declared: Theory : (string -> searchpath) Ancestors : ((string list # string list) -> searchpath) New constructors declared: List : (foundthm list -> source) Paths : (searchpath list -> source) do_once_only = - : (* list -> * list) searchseq = - : (string list -> string list -> string list) flatten_paths = - : (searchpath list -> string list) New constructors declared: Endofsearch : (foundthm list -> searchstep) Step : ((foundthm list # (void -> searchstep)) -> searchstep) find_theorems = - : (thmpattern -> source -> searchstep) show_step = - : (searchstep -> foundthm list) continue_search = - : (searchstep -> searchstep) Calling Lisp compiler File search compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf `extents`;;'\ 'loadf `sets`;;'\ 'loadf `extract`;;'\ 'loadf `struct`;;'\ 'loadf `name`;;'\ 'loadf `thmkind`;;'\ 'loadf `matching`;;'\ 'loadf `sidecond`;;'\ 'loadf `search`;;'\ 'compilet `user`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void ...() : void ..........() : void ........................() : void .......() : void .() : void .......() : void .......................() : void ..........() : void FT = - : (thmpattern -> source -> searchstep) CS = - : (searchstep -> searchstep) run_search = - : (searchstep -> foundthm list) full_search = - : (thmpattern -> source -> foundthm list) search_until_find = - : (searchstep -> searchstep) search_n_theories = - : (int -> searchstep -> searchstep) search_n_until_find = - : (int -> searchstep -> searchstep) ancestors_excluding = - : (string list -> string list -> searchpath) Ancestry = - : (string list -> searchpath) List_from = - : (searchstep -> source) kind = - : (thmkind -> thmpattern) thryname = - : (string -> thmpattern) thmname = - : (string -> thmpattern) conc = - : (term -> thmpattern) hypP = - : (term list -> thmpattern) hypF = - : (term list -> thmpattern) side = - : (side_condition -> thmpattern) BigAnd = - : (thmpattern list -> thmpattern) BigOr = - : (thmpattern list -> thmpattern) Calling Lisp compiler File user compiled () : void #===> library trs rebuilt make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/latex-hol' echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `filters`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool spec_list = [(`_`, `\US `); (`#`, `\SH `); (`&`, `\AM `); (`%`, `\PC `); (`$`, `\DO `); (`\`, `\BS `); (`'`, `\PR `); (`~`, `\TI `); (`*`, `\AS `); (`<`, `\LES `); (`|`, `\BA `); (`>`, `\GRE `); (`[`, `\LB `); (`]`, `\RB `); (`^`, `\CI `); (`{`, `\LC `); (`}`, `\RC `)] : (string # string) list do_char = - : (string -> string) filter_id = - : (string -> string) dovar = - : (string -> string) symb_of = - : (string -> string) doinfix = - : (string -> string) Calling Lisp compiler File filters compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_printer`);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_parser`);;'\ 'compilet `hol_trees`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Updating help search path ....................................................................................................................() : void #Updating help search path ...................................................................................................................................................() : void # New constructors declared: No_types : type_selection Hidden_types : type_selection Useful_types : type_selection All_types : type_selection type_to_print_tree = - : (type -> print_tree) term_to_print_tree = - : (bool -> type_selection -> term -> print_tree) thm_to_print_tree = - : (bool -> bool -> type_selection -> thm -> print_tree) Calling Lisp compiler File hol_trees compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_printer`);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_parser`);;'\ 'loadf `hol_trees`;;'\ 'compilet `precedence`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Updating help search path ....................................................................................................................() : void #Updating help search path ...................................................................................................................................................() : void #....() : void is_res_quan = - : (string -> bool) type_prec = - : (string -> int) min_type_prec = 0 : int max_type_prec = 400 : int term_prec = - : (string -> int) min_term_prec = 0 : int max_term_prec = 1800 : int Calling Lisp compiler File precedence compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_printer`);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_parser`);;'\ 'PP_to_ML false `latex_type` ``;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Updating help search path ....................................................................................................................() : void #Updating help search path ...................................................................................................................................................() : void #() : void echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_printer`);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_parser`);;'\ 'loadf `filters`;;'\ 'loadf `hol_trees`;;'\ 'loadf `precedence`;;'\ 'compilet `latex_type_pp`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Updating help search path ....................................................................................................................() : void #Updating help search path ...................................................................................................................................................() : void #......() : void ....() : void .......() : void latex_type_rules = [((`type`, (Const_name(`VAR`, [Patt_child(Var_name(`op`, []))])), -), [], PF(H_box[(0, PO_leaf(`op`, -))])); ((`type`, (Const_name(`OP`, [Patt_child(Var_name(`op`, []))])), -), [], PF(H_box[(0, PO_leaf(`op`, -))])); ((`type`, (Const_name(`OP`, [Patt_child(Var_name(`op`, [])); Patt_child(Var_child `type1`); Patt_child(Var_child `type2`)])), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HV_box[((1, (Abs 3), 0), PO_format(PF(H_box[(1, PO_subcall((`type1`, -), [(`prec`, -)])); (1, PO_leaf(`op`, -))]))); ((1, (Abs 3), 0), PO_subcall((`type2`, -), [(`prec`, -)]))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`type`, (Const_name(`OP`, [Patt_child(Var_name(`op`, [])); Var_children `types`; Patt_child(Var_child `type`)])), -), [], PF(HV_box[((0, (Abs 3), 0), PO_format(PF(H_box[(0, PO_constant `(`); (0, PO_format(PF(HV_box[((0, (Inc 3), 0), PO_expand(H_box[(0, PO_subcall((`types`, -), [(`prec`, -)])); (0, PO_constant `,`)])); ((0, (Inc 3), 0), PO_subcall((`type`, -), [(`prec`, -)]))]))); (0, PO_constant `)`)]))); ((0, (Abs 3), 0), PO_leaf(`op`, -))])); ((`type`, (Const_name(`type`, [Patt_child(Var_child `type`)])), -), [], PF(H_box[(0, PO_constant `":`); (0, PO_subcall((`type`, -), [(`prec`, -)])); (0, PO_constant `"`)])); ((`term`, (Var_child `type`), -), [], PF(H_box[(0, PO_context_subcall(`type`, (`type`, -), [(`prec`, -)]))]))] : print_rule list latex_type_rules_fun = - : print_rule_function Calling Lisp compiler File latex_type_pp compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_printer`);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_parser`);;'\ 'PP_to_ML false `latex_thm` ``;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Updating help search path ....................................................................................................................() : void #Updating help search path ...................................................................................................................................................() : void #() : void echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_printer`);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_parser`);;'\ 'PP_to_ML false `latex_term` ``;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Updating help search path ....................................................................................................................() : void #Updating help search path ...................................................................................................................................................() : void #() : void echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_printer`);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_parser`);;'\ 'loadf `filters`;;'\ 'loadf `hol_trees`;;'\ 'loadf `precedence`;;'\ 'loadf `latex_type_pp`;;'\ 'compilet `latex_term_pp`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Updating help search path ....................................................................................................................() : void #Updating help search path ...................................................................................................................................................() : void #......() : void ....() : void .......() : void ..() : void latex_term_rules = [((`term`, (Const_name(`CONST`, [Patt_child(Const_name(`NIL`, [])); Wild_children])), -), [], PF(H_box[(0, PO_constant `\NIL `)])); ((`term`, (Const_name(`VAR`, [Patt_child(Var_name(`var`, []))])), -), [], PF(H_box[(0, PO_leaf(`var`, -))])); ((`term`, (Const_name(`VAR`, [Patt_child(Var_name(`var`, [])); Patt_child(Const_name(`type`, [Patt_child(Var_child `type`)]))])), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HV_box[((0, (Abs 0), 0), PO_leaf(`var`, -)); ((0, (Abs 0), 0), PO_format(PF(H_box[(0, PO_constant `:`); (0, PO_subcall((`type`, -), []))])))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Const_name(`CONST`, [Patt_child(Var_name(`const`, []))])), -), [], PF(H_box[(0, PO_leaf(`const`, -))])); ((`term`, (Const_name(`CONST`, [Patt_child(Var_name(`const`, [])); Patt_child(Const_name(`type`, [Patt_child(Var_child `type`)]))])), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HV_box[((0, (Abs 0), 0), PO_leaf(`const`, -)); ((0, (Abs 0), 0), PO_format(PF(H_box[(0, PO_constant `:`); (0, PO_subcall((`type`, -), []))])))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Print_loop((Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Var_name(`op`, [])); Wild_children])); Patt_child(Var_child `comps`)])); Patt_child(Link_child(((Val 1), Default), [`op`]))])), Var_child `comp`)), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HV_box[((0, (Abs 0), 0), PO_expand(H_box[(0, PO_subcall((`comps`, -), [(`prec`, -)])); (0, PO_leaf(`op`, -))])); ((0, (Abs 0), 0), PO_subcall((`comp`, -), [(`prec`, -)]))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Print_loop((Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Var_name(`op`, [])); Wild_children])); Patt_child(Var_child `args`)])); Patt_child(Link_child(((Val 1), Default), [`op`]))])), Var_child `arg`)), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HoV_box[((1, (Abs 0), 0), PO_constant `(`); ((1, (Abs 0), 0), PO_expand(HV_box[((1, (Abs 0), 0), PO_subcall((`args`, -), [(`prec`, -)])); ((1, (Abs 0), 0), PO_constant `)\:\CONST{EXP}\:(`)])); ((1, (Abs 0), 0), PO_subcall((`arg`, -), [(`prec`, -)])); ((1, (Abs 0), 0), PO_constant `)`)]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Print_loop((Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Var_name(`op`, [])); Wild_children])); Patt_child(Var_child `args`)])); Patt_child(Link_child(((Val 1), Default), [`op`]))])), Var_child `arg`)), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HoV_box[((1, (Abs 0), 0), PO_expand(HV_box[((1, (Abs 0), 0), PO_subcall((`args`, -), [(`prec`, -)])); ((1, (Abs 0), 0), PO_leaf(`op`, -))])); ((1, (Abs 0), 0), PO_subcall((`arg`, -), [(`prec`, -)]))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Var_name(`op`, [])); Wild_children])); Patt_child(Var_child `arg1`)])); Patt_child(Var_child `arg2`)])), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HV_box[((1, (Abs 3), 0), PO_format(PF(H_box[(1, PO_subcall((`arg1`, -), [(`prec`, -)])); (1, PO_leaf(`op`, -))]))); ((1, (Abs 3), 0), PO_subcall((`arg2`, -), [(`prec`, -)]))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Var_name(`op`, [])); Wild_children])); Patt_child(Var_child `arg`)])), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_leaf(`op`, -)); (0, PO_subcall((`arg`, -), [(`prec`, -)])); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Print_loop((Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Var_name(`op`, [])); Wild_children])); Patt_child(Var_child `pred`)])); Patt_child(Const_name(`ABS`, [Patt_child(Var_child `bvs`); Patt_child(Link_child(((Val 1), Default), [`op`; `pred`]))]))])), Var_child `body`)), -), [(`bv`, -); (`bvs`, -)], PF(H_box[(0, PO_format(PF_branch((-), (PF(H_box[(0, PO_constant `(`)])), PF_empty))); (0, PO_format(PF(HV_box[((1, (Abs 3), 0), PO_format(PF(H_box[(0, PO_leaf(`op`, -)); (0, PO_format(PF(H_box[(1, PO_subcall((`bv`, -), [])); (1, PO_format(PF_branch((-), (PF_empty), PF(H_box[(1, PO_expand(H_box[(0, PO_constant `\,`); (0, PO_subcall((`bvs`, -), [(`prec`, -)]))]))]))))]))); (0, PO_constant `\RESDOT `); (0, PO_format(PF(H_box[(1, PO_subcall((`pred`, -), [(`prec`, -)]))]))); (0, PO_constant `\DOT`)]))); ((1, (Abs 3), 0), PO_subcall((`body`, -), [(`prec`, -)]))]))); (0, PO_format(PF_branch((-), (PF(H_box[(0, PO_constant `)`)])), PF_empty)))])); ((`term`, (Print_loop((Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Var_name(`op`, [])); Wild_children])); Patt_child(Const_name(`ABS`, [Patt_child(Var_child `bvs`); Patt_child(Link_child(((Val 1), Default), [`op`]))]))])), Var_child `body`)), -), [(`bv`, -); (`bvs`, -)], PF(H_box[(0, PO_format(PF_branch((-), (PF(H_box[(0, PO_constant `(`)])), PF_empty))); (0, PO_format(PF(HV_box[((1, (Abs 3), 0), PO_format(PF(H_box[(0, PO_leaf(`op`, -)); (0, PO_format(PF(H_box[(1, PO_subcall((`bv`, -), [])); (1, PO_format(PF_branch((-), (PF_empty), PF(H_box[(1, PO_expand(H_box[(0, PO_constant `\,`); (0, PO_subcall((`bvs`, -), [(`prec`, -)]))]))]))))]))); (0, PO_constant `\DOT`)]))); ((1, (Abs 3), 0), PO_subcall((`body`, -), [(`prec`, -)]))]))); (0, PO_format(PF_branch((-), (PF(H_box[(0, PO_constant `)`)])), PF_empty)))])); ((`term`, (Print_loop((Const_name(`ABS`, [Patt_child(Var_child `bvs`); Patt_child(Print_link((((Default), Default), []), Const_name(`ABS`, [Wild_children])))])), Const_name(`ABS`, [Patt_child(Var_child `bv`); Patt_child(Var_child `body`)]))), -), [], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HV_box[((1, (Abs 3), 0), PO_format(PF(H_box[(1, PO_constant `\LAMBDA`); (1, PO_format(PF(H_box[(1, PO_expand(H_box[(1, PO_subcall((`bvs`, -), [(`prec`, -)])); (1, PO_constant `\,`)]))]))); (1, PO_subcall((`bv`, -), [])); (1, PO_constant `\DOT`)]))); ((1, (Abs 3), 0), PO_subcall((`body`, -), [(`prec`, -)]))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`COND`, [])); Wild_children])); Patt_child(Var_child `cond`)])); Patt_child(Var_child `x`)])); Patt_child(Var_child `y`)])), -), [], PF(H_box[(0, PO_constant `(`); (0, PO_format(PF(HoV_box[((1, (Abs 0), 0), PO_format(PF(HV_box[((1, (Abs 0), 0), PO_subcall((`cond`, -), [(`prec`, -)])); ((1, (Abs 0), 0), PO_constant `\Rightarrow `)]))); ((1, (Abs 0), 0), PO_format(PF(HV_box[((1, (Abs 0), 0), PO_subcall((`x`, -), [(`prec`, -)])); ((1, (Abs 0), 0), PO_constant `\mid `)]))); ((1, (Abs 0), 0), PO_subcall((`y`, -), [(`prec`, -)]))]))); (0, PO_constant `)`)])); ((`term_let`, (Print_loop((Const_name(`ABS`, [Patt_child(Var_child `args`); Patt_child(Link_child(((Default), Default), []))])), Wild_child)), -), [], PF(H_box[(1, PO_context_subcall(`term`, (`args`, -), []))])); ((`term`, (Print_loop((Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`LET`, [])); Wild_children])); Patt_child(Print_link((((Default), Default), []), Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`LET`, [])); Wild_children])); Patt_child (Wild_child)])); Patt_child (Wild_child)])))])); Patt_child(Print_label(`argsl`, Print_loop((Const_name(`ABS`, [Patt_child (Wild_child); Patt_child(Link_child(((Default), Default), []))])), Var_child `letbodyl`)))])), Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`LET`, [])); Wild_children])); Patt_child(Const_name(`ABS`, [Patt_child(Var_child `bv`); Patt_child(Print_loop((Const_name(`ABS`, [Patt_child(Var_child `bvl`); Patt_child(Link_child(((Default), Default), []))])), Var_child `body`))]))])); Patt_child(Print_label(`args`, Print_loop((Const_name(`ABS`, [Patt_child (Wild_child); Patt_child(Link_child(((Default), Default), []))])), Var_child `letbody`)))]))), -), [(`argsl`, -); (`letbodyl`, -)], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HoV_box[((1, (Abs 0), 0), PO_format(PF(HV_box[((1, (Abs 1), 0), PO_format(PF(H_box[(1, PO_constant `\KEYWD{let}\;`); (1, PO_subcall((`bv`, -), [(`prec`, -)])); (1, PO_context_subcall(`term_let`, (`args`, -), [(`prec`, -)])); (1, PO_constant `=`)]))); ((1, (Abs 1), 0), PO_subcall((`letbody`, -), [(`prec`, -)]))]))); ((1, (Abs 0), 0), PO_expand(HV_box[((1, (Abs 1), 0), PO_expand(HV_box[((1, (Abs 0), 0), PO_constant `\;\KEYWD{and}`); ((1, (Abs 0), 0), PO_subcall((`bvl`, -), [(`prec`, -)])); ((1, (Abs 0), 0), PO_context_subcall(`term_let`, (`argsl`, -), [(`prec`, -)])); ((1, (Abs 0), 0), PO_constant `=`)])); ((1, (Abs 1), 0), PO_subcall((`letbodyl`, -), [(`prec`, -)]))])); ((1, (Abs 0), 0), PO_format(PF(V_box[(((Abs 0), 0), PO_constant `\;\KEYWD{in}`); (((Abs 0), 0), PO_format(PF(HV_box[((1, (Abs 0), 0), PO_subcall((`body`, -), [(`prec`, -)]))])))])))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Print_loop((Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`CONS`, [])); Wild_children])); Patt_child(Var_child `elems`)])); Patt_child(Print_link((((Default), Default), []), Const_name(`COMB`, [Wild_children])))])), Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`CONS`, [])); Wild_children])); Patt_child(Var_child `elem`)])); Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`NIL`, [])); Wild_children]))]))), -), [], PF(H_box[(0, PO_constant `[`); (0, PO_format(PF(HoV_box[((0, (Abs 0), 0), PO_expand(H_box[(0, PO_subcall((`elems`, -), [(`prec`, -)])); (0, PO_constant `;`)])); ((0, (Abs 0), 0), PO_subcall((`elem`, -), [(`prec`, -)]))]))); (0, PO_constant `]`)])); ((`term`, (Print_loop((Const_name(`COMB`, [Patt_child(Link_child(((Val 1), Default), [])); Patt_child(Var_child `rands`)])), Var_child `rator`)), -), [(`rands`, -)], PF(H_box[(0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `(`)])))); (0, PO_format(PF(HV_box[((1, (Abs 3), 0), PO_subcall((`rator`, -), [(`prec`, -)])); ((1, (Abs 3), 0), PO_expand(H_box[(0, PO_constant `\,`); (0, PO_subcall((`rands`, -), [(`prec`, -)]))]))]))); (0, PO_format(PF_branch((-), (PF_empty), PF(H_box[(0, PO_constant `)`)]))))])); ((`term`, (Const_name(`term`, [Patt_child(Var_child `term`)])), -), [], PF(H_box[(0, PO_constant `"`); (0, PO_subcall((`term`, -), [(`prec`, -)])); (0, PO_constant `"`)])); ((`thm`, (Var_child `term`), -), [], PF(H_box[(0, PO_context_subcall(`term`, (`term`, -), [(`prec`, -)]))]))] : print_rule list latex_term_rules_fun = - : print_rule_function Calling Lisp compiler File latex_term_pp compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_printer`);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_parser`);;'\ 'loadf `filters`;;'\ 'loadf `hol_trees`;;'\ 'loadf `precedence`;;'\ 'loadf `latex_type_pp`;;'\ 'loadf `latex_term_pp`;;'\ 'compilet `latex_thm_pp`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Updating help search path ....................................................................................................................() : void #Updating help search path ...................................................................................................................................................() : void #......() : void ....() : void .......() : void ..() : void ..() : void latex_thm_rules = [((`thm`, (Const_name(`dot`, [])), -), [], PF(H_box[(0, PO_constant `.`)])); ((`thm`, (Const_name(`term`, [Patt_child(Var_child `term`)])), -), [], PF(H_box[(0, PO_subcall((`term`, -), []))])); ((`thm`, (Const_name(`thm`, [Patt_child(Var_child `concl`); Patt_child(Const_name(`dots`, [Var_children `dots`]))])), -), [], PF(H_box[(1, PO_format(PF(H_box[(0, PO_subcall((`dots`, -), []))]))); (1, PO_constant `\THM`); (1, PO_subcall((`concl`, -), []))])); ((`thm`, (Const_name(`thm`, [Patt_child(Var_child `concl`); Patt_child(Const_name(`hyp`, [Var_children `hyps`; Patt_child(Var_child `hyp`)]))])), -), [], PF(HoV_box[((1, (Abs 0), 0), PO_expand(H_box[(0, PO_subcall((`hyps`, -), [])); (0, PO_constant `,`)])); ((1, (Abs 0), 0), PO_subcall((`hyp`, -), [])); ((1, (Abs 0), 0), PO_format(PF(H_box[(1, PO_constant `\THM`); (1, PO_subcall((`concl`, -), []))])))])); ((`thm`, (Const_name(`thm`, [Patt_child(Var_child `concl`); Patt_child(Const_name(`hyp`, []))])), -), [], PF(H_box[(1, PO_constant `\THM`); (1, PO_subcall((`concl`, -), []))]))] : print_rule list latex_thm_rules_fun = - : print_rule_function Calling Lisp compiler File latex_thm_pp compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_printer`);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_parser`);;'\ 'PP_to_ML false `latex_sets` ``;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Updating help search path ....................................................................................................................() : void #Updating help search path ...................................................................................................................................................() : void #() : void echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_printer`);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_parser`);;'\ 'loadf `filters`;;'\ 'loadf `hol_trees`;;'\ 'loadf `precedence`;;'\ 'loadf `latex_type_pp`;;'\ 'loadf `latex_term_pp`;;'\ 'loadf `latex_thm_pp`;;'\ 'compilet `latex_sets_pp`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Updating help search path ....................................................................................................................() : void #Updating help search path ...................................................................................................................................................() : void #......() : void ....() : void .......() : void ..() : void ..() : void ..() : void latex_sets_rules = [((`term`, (Const_name(`CONST`, [Patt_child(Const_name(`EMPTY`, [])); Wild_children])), -), [], PF(H_box[(0, PO_constant `\EMPTYSET `)])); ((`term`, (Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`GSPEC`, [])); Wild_children])); Patt_child(Const_name(`ABS`, [Patt_child(Var_child `var`); Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child (Wild_child)])); Patt_child(Var_child `elem`)])); Patt_child(Var_child `spec`)]))]))])), -), [], PF(H_box[(0, PO_constant `\BEGINSET `); (0, PO_format(PF(HV_box[((1, (Abs 1), 0), PO_subcall((`elem`, -), [(`prec`, -)])); ((1, (Abs 1), 0), PO_constant `\SUCHTHAT `); ((1, (Abs 1), 0), PO_subcall((`spec`, -), [(`prec`, -)]))]))); (0, PO_constant `\ENDSET `)])); ((`term`, (Print_loop((Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`INSERT`, [])); Wild_children])); Patt_child(Var_child `elems`)])); Patt_child(Print_link((((Default), Default), []), Const_name(`COMB`, [Wild_children])))])), Const_name(`COMB`, [Patt_child(Const_name(`COMB`, [Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`INSERT`, [])); Wild_children])); Patt_child(Var_child `elem`)])); Patt_child(Const_name(`CONST`, [Patt_child(Const_name(`EMPTY`, [])); Wild_children]))]))), -), [], PF(H_box[(0, PO_constant `\BEGINSET `); (0, PO_format(PF(HV_box[((0, (Abs 0), 0), PO_expand(H_box[(0, PO_subcall((`elems`, -), [(`prec`, -)])); (0, PO_constant `,`)])); ((0, (Abs 0), 0), PO_subcall((`elem`, -), [(`prec`, -)]))]))); (0, PO_constant `\ENDSET `)]))] : print_rule list latex_sets_rules_fun = - : print_rule_function Calling Lisp compiler File latex_sets_pp compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_printer`);;'\ 'loadf(library_pathname() ^ `/prettyp/PP_parser`);;'\ 'loadf `filters`;;'\ 'loadf `hol_trees`;;'\ 'loadf `precedence`;;'\ 'loadf `latex_sets_pp`;;'\ 'loadf `latex_thm_pp`;;'\ 'loadf `latex_term_pp`;;'\ 'loadf `latex_type_pp`;;'\ 'compilet `formaters`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Updating help search path ....................................................................................................................() : void #Updating help search path ...................................................................................................................................................() : void #......() : void ....() : void .......() : void ..() : void ..() : void ..() : void ..() : void output_strings = - : (string -> string list -> void) latex_hol_rules_fun = - : print_rule_function pp_convert_type = - : (type -> print_tree) pp_convert_term = - : (term -> print_tree) pp_convert_thm = - : (thm -> print_tree) pp_convert_all_thm = - : (thm -> print_tree) latex_type = - : (type -> void) latex_term = - : (term -> void) latex_thm = - : (thm -> void) latex_all_thm = - : (thm -> void) latex_type_to = - : (string -> type -> void) latex_type_add_to = - : (string -> type -> void) latex_term_to = - : (string -> term -> void) latex_term_add_to = - : (string -> term -> void) latex_thm_to = - : (string -> thm -> void) latex_thm_add_to = - : (string -> thm -> void) latex_all_thm_to = - : (string -> thm -> void) latex_all_thm_add_to = - : (string -> thm -> void) latex_theory_to = - : (string -> bool -> string -> void) latex_thm_tag = `@t ` : string latex_thm_end = `` : string latex_theorems_to = - : (string -> (string -> thm) -> string list -> void) latex_all_theorems_to = - : (string -> (string -> thm) -> string list -> void) latex_theorems_add_to = - : (string -> (string -> thm) -> string list -> void) Calling Lisp compiler File formaters compiled () : void #===>Library latex-hol rebuilt make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/latex-hol' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic' rm -f ineq.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `ineq`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool 0 : int () : void Loading library taut ... Updating help search path ........................................ Library taut loaded. () : void NOT_EQ = |- !t1 t2. (t1 = t2) = (~t1 = ~t2) Theorem EQ_LESS_EQ autoloading from theory `arithmetic` ... EQ_LESS_EQ = |- !m n. (m = n) = m <= n /\ n <= m Theorem NOT_LESS autoloading from theory `arithmetic` ... NOT_LESS = |- !m n. ~m < n = n <= m NOT_EQ_LESS_EQ = |- !a b. ~(a = b) = a < b \/ b < a Theorem LESS_CASES_IMP autoloading from theory `arithmetic` ... LESS_CASES_IMP = |- !m n. ~m < n /\ ~(m = n) ==> n < m Theorem LESS_NOT_EQ autoloading from theory `prim_rec` ... LESS_NOT_EQ = |- !m n. m < n ==> ~(m = n) Theorem LESS_ANTISYM autoloading from theory `arithmetic` ... LESS_ANTISYM = |- !m n. ~(m < n /\ n < m) Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) LESS_IS_NOT_LESS_OR_EQ = |- !x y. x < y = ~y <= x Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n < (SUC n) Theorem LESS_THM autoloading from theory `prim_rec` ... LESS_THM = |- !m n. m < (SUC n) = (m = n) \/ m < n Theorem NOT_LESS_0 autoloading from theory `prim_rec` ... NOT_LESS_0 = |- !n. ~n < 0 GEN_INDUCTION = |- !P. P 0 /\ (!n. (!m. m < n ==> P m) ==> P n) ==> (!n. P n) Theorem LESS_EQ_ANTISYM autoloading from theory `arithmetic` ... LESS_EQ_ANTISYM = |- !m n. ~(m < n /\ n <= m) Theorem GREATER_EQ autoloading from theory `arithmetic` ... GREATER_EQ = |- !n m. n >= m = m <= n GREATER_EQ_ANTISYM = |- !n m. ~(n >= m /\ n < m) Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m <= m Theorem LESS_EQUAL_ANTISYM autoloading from theory `arithmetic` ... LESS_EQUAL_ANTISYM = |- !n m. n <= m /\ m <= n ==> (n = m) LESS_EQ_LESS_EQ_EQ = |- !m n. m <= n /\ n <= m = (m = n) Theorem LESS_SUC autoloading from theory `prim_rec` ... LESS_SUC = |- !m n. m < n ==> m < (SUC n) NOT_LESS_AND_GREATER = |- !n m. n < m ==> ~m < n () : void File ineq loaded () : void #rm -f pre.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `pre`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool 0 : int () : void Theorem PRE_SUC_EQ autoloading from theory `arithmetic` ... PRE_SUC_EQ = |- !m n. 0 < n ==> ((m = PRE n) = (SUC m = n)) SUC_PRE = |- !n. 0 < n ==> (SUC(PRE n) = n) Theorem LESS_MONO autoloading from theory `prim_rec` ... LESS_MONO = |- !m n. m < n ==> (SUC m) < (SUC n) Theorem LESS_0 autoloading from theory `prim_rec` ... LESS_0 = |- !n. 0 < (SUC n) Theorem NOT_LESS_0 autoloading from theory `prim_rec` ... NOT_LESS_0 = |- !n. ~n < 0 Theorem PRE autoloading from theory `prim_rec` ... PRE = |- (PRE 0 = 0) /\ (!m. PRE(SUC m) = m) PRE_MONO = |- !m n. (PRE m) < (PRE n) ==> m < n Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) Theorem ZERO_LESS_EQ autoloading from theory `arithmetic` ... ZERO_LESS_EQ = |- !n. 0 <= n Theorem LESS_MONO_EQ autoloading from theory `arithmetic` ... LESS_MONO_EQ = |- !m n. (SUC m) < (SUC n) = m < n PRE_MONO_LESS_EQ = |- !m n. m < n ==> (PRE m) <= (PRE n) Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n < (SUC n) PRE_LESS_EQ = |- !n. (PRE n) <= n Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) PRE_ADD = |- !n m. 0 < n ==> (PRE(n + m) = (PRE n) + m) SUC_LESS_PRE = |- !m n. (SUC m) < n ==> m < (PRE n) SUC_LESS_EQ_PRE = |- !m n. 0 < n ==> (SUC m) <= n ==> m <= (PRE n) Theorem LESS_REFL autoloading from theory `prim_rec` ... LESS_REFL = |- !n. ~n < n Theorem INDUCTION autoloading from theory `num` ... INDUCTION = |- !P. P 0 /\ (!n. P n ==> P(SUC n)) ==> (!n. P n) PRE_K_K = |- !k. 0 < k ==> (PRE k) < k Theorem LESS_EQ_ADD autoloading from theory `arithmetic` ... LESS_EQ_ADD = |- !m n. m <= (m + n) Theorem LESS_EQ_MONO_ADD_EQ autoloading from theory `arithmetic` ... LESS_EQ_MONO_ADD_EQ = |- !m n p. (m + p) <= (n + p) = m <= n Theorem NOT_LESS autoloading from theory `arithmetic` ... NOT_LESS = |- !m n. ~m < n = n <= m Theorem SUB_ADD autoloading from theory `arithmetic` ... SUB_ADD = |- !m n. n <= m ==> ((m - n) + n = m) Theorem LESS_IMP_LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_IMP_LESS_OR_EQ = |- !m n. m < n ==> m <= n Theorem NOT_LESS_EQUAL autoloading from theory `arithmetic` ... NOT_LESS_EQUAL = |- !m n. ~m <= n = n < m Theorem SUB_EQ_0 autoloading from theory `arithmetic` ... SUB_EQ_0 = |- !m n. (m - n = 0) = m <= n NOT_LESS_SUB = |- !m n. ~m < (m - n) Theorem PRE_SUB1 autoloading from theory `arithmetic` ... PRE_SUB1 = |- !m. PRE m = m - 1 Theorem LESS_EQ_LESS_TRANS autoloading from theory `arithmetic` ... LESS_EQ_LESS_TRANS = |- !m n p. m <= n /\ n < p ==> m < p PRE_LESS = |- !b. 0 < b /\ b < a ==> (PRE b) < a Theorem LESS_EQ autoloading from theory `arithmetic` ... LESS_EQ = |- !m n. m < n = (SUC m) <= n LESS_IMP_LESS_EQ_PRE = |- !m n. 0 < n ==> (m < n = m <= (PRE n)) () : void File pre loaded () : void #rm -f suc.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `suc`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool 0 : int () : void Theorem NOT_SUC_LESS_EQ_0 autoloading from theory `arithmetic` ... NOT_SUC_LESS_EQ_0 = |- !n. ~(SUC n) <= 0 NOT_FORALL_SUC_LESS_EQ = |- ~(!n m. (SUC m) <= n) Theorem LESS_EQ_ANTISYM autoloading from theory `arithmetic` ... LESS_EQ_ANTISYM = |- !m n. ~(m < n /\ n <= m) Theorem GREATER_EQ autoloading from theory `arithmetic` ... GREATER_EQ = |- !n m. n >= m = m <= n Theorem LESS_0 autoloading from theory `prim_rec` ... LESS_0 = |- !n. 0 < (SUC n) NOT_0_GREATER_EQ_SUC = |- !n. ~0 >= (SUC n) Theorem LESS_EQ_MONO autoloading from theory `arithmetic` ... LESS_EQ_MONO = |- !n m. (SUC n) <= (SUC m) = n <= m SUC_GREATER_EQ_SUC = |- !n m. (SUC m) >= (SUC n) = m >= n LESS_EQ_MONO_EQ = |- !n m. (SUC n) <= (SUC m) = n <= m Theorem LESS_THM autoloading from theory `prim_rec` ... LESS_THM = |- !m n. m < (SUC n) = (m = n) \/ m < n Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n < (SUC n) Theorem LESS_SUC autoloading from theory `prim_rec` ... LESS_SUC = |- !m n. m < n ==> m < (SUC n) Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) LESS_EQ_LESS_SUC = |- !m n. m <= n = m < (SUC n) Theorem LESS_EQ autoloading from theory `arithmetic` ... LESS_EQ = |- !m n. m < n = (SUC m) <= n SUC_LESS_EQ = |- !m n. m <= n /\ ~(m = n) ==> (SUC m) <= n Theorem LESS_EQ_SUC_REFL autoloading from theory `arithmetic` ... LESS_EQ_SUC_REFL = |- !m. m <= (SUC m) Theorem NOT_LESS autoloading from theory `arithmetic` ... NOT_LESS = |- !m n. ~m < n = n <= m Theorem SUC_ID autoloading from theory `prim_rec` ... SUC_ID = |- !n. ~(SUC n = n) NOT_SUC_LESS_EQ_SELF = |- !n. ~(SUC n) <= n Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) Theorem ADD1 autoloading from theory `arithmetic` ... ADD1 = |- !m. SUC m = m + 1 SUC_0 = |- 1 = SUC 0 Theorem SUC_NOT autoloading from theory `arithmetic` ... SUC_NOT = |- !n. ~(0 = SUC n) SUC_NOT_0 = |- !n. ~(SUC n = 0) () : void File suc loaded () : void #rm -f add.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `add`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool 0 : int () : void Theory suc loaded () : void [(); (); (); (); (); (); (); ()] : void list ....() : void Theorem LESS_EQ autoloading from theory `arithmetic` ... LESS_EQ = |- !m n. m < n = (SUC m) <= n Theorem ADD1 autoloading from theory `arithmetic` ... ADD1 = |- !m. SUC m = m + 1 LESS_LESS_EQ = |- !a b. a < b = (a + 1) <= b Theorem ADD_SYM autoloading from theory `arithmetic` ... ADD_SYM = |- !m n. m + n = n + m ADD_SUC_0 = |- !m. SUC m = (SUC 0) + m LESS_EQ_MONO_ADD_EQ0 = |- !m n p. m <= n = (p + m) <= (p + n) Definition ADD autoloading from theory `arithmetic` ... ADD = |- (!n. 0 + n = n) /\ (!m n. (SUC m) + n = SUC(m + n)) LESS_EQ_MONO_ADD_EQ1 = |- !m p. (m + p) <= p = m <= 0 Theorem ZERO_LESS_EQ autoloading from theory `arithmetic` ... ZERO_LESS_EQ = |- !n. 0 <= n LESS_EQ_ADD1 = |- !p n. p <= (n + p) Theorem ADD_ASSOC autoloading from theory `arithmetic` ... ADD_ASSOC = |- !m n p. m + (n + p) = (m + n) + p ADD_SYM_ASSOC = |- !a b c. a + (b + c) = b + (a + c) Theorem LESS_EQ_ADD autoloading from theory `arithmetic` ... LESS_EQ_ADD = |- !m n. m <= (m + n) Theorem LESS_EQ_TRANS autoloading from theory `arithmetic` ... LESS_EQ_TRANS = |- !m n p. m <= n /\ n <= p ==> m <= p LESS_EQ_SPLIT = |- !m n p. (m + n) <= p ==> n <= p /\ m <= p Theorem LESS_SUC autoloading from theory `prim_rec` ... LESS_SUC = |- !m n. m < n ==> m < (SUC n) Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) ADDL_GREATER = |- !m n p. m < n ==> m < (p + n) Theorem NOT_LESS_0 autoloading from theory `prim_rec` ... NOT_LESS_0 = |- !n. ~n < 0 Theorem NOT_LESS autoloading from theory `arithmetic` ... NOT_LESS = |- !m n. ~m < n = n <= m Theorem LESS_EQ_LESS_EQ_MONO autoloading from theory `arithmetic` ... LESS_EQ_LESS_EQ_MONO = |- !m n p q. m <= p /\ n <= q ==> (m + n) <= (p + q) ADDL_GREATER_EQ = |- !m n p. m <= n ==> m <= (p + n) ADDR_GREATER = |- !m n p. m < n ==> m < (n + p) ADDR_GREATER_EQ = |- !m n p. m <= n ==> m <= (n + p) Theorem LESS_TRANS autoloading from theory `arithmetic` ... LESS_TRANS = |- !m n p. m < n /\ n < p ==> m < p LESS_LESS_MONO = |- !m n p q. m < p /\ n < q ==> (m + n) < (p + q) Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) LESS_LESS_EQ_MONO = |- (!m n p q. m < p /\ n <= q ==> (m + n) < (p + q)) /\ (!m n p q. m <= p /\ n < q ==> (m + n) < (p + q)) Theorem LESS_REFL autoloading from theory `prim_rec` ... LESS_REFL = |- !n. ~n < n ADD_EQ_LESS_IMP_LESS = |- !n m k l. (k + m = l + n) /\ k < l ==> n < m LESS_ADD_ASSOC = |- !a b c d. a < (b + c) ==> a < (b + (c + d)) Theorem GREATER_EQ autoloading from theory `arithmetic` ... GREATER_EQ = |- !n m. n >= m = m <= n GREATER_EQ_SPLIT = |- !m n p. p >= (m + n) ==> p >= n /\ p >= m Theorem LESS_MONO_ADD autoloading from theory `arithmetic` ... LESS_MONO_ADD = |- !m n p. m < n ==> (m + p) < (n + p) LESS_TRANS_ADD = |- !m n p q. m < (n + p) /\ p < q ==> m < (n + q) Definition GREATER autoloading from theory `arithmetic` ... GREATER = |- !m n. m > n = n < m Definition GREATER_OR_EQ autoloading from theory `arithmetic` ... GREATER_OR_EQ = |- !m n. m >= n = m > n \/ (m = n) ADD_GREATER_EQ = |- !m n. (m + n) >= m ADD_MONO_LESS = |- !m n p. (m + p) < (m + n) = p < n Theorem LESS_NOT_EQ autoloading from theory `prim_rec` ... LESS_NOT_EQ = |- !m n. m < n ==> ~(m = n) Theorem LESS_0 autoloading from theory `prim_rec` ... LESS_0 = |- !n. 0 < (SUC n) Theorem INV_SUC_EQ autoloading from theory `prim_rec` ... INV_SUC_EQ = |- !m n. (SUC m = SUC n) = (m = n) Theorem SUC_ID autoloading from theory `prim_rec` ... SUC_ID = |- !n. ~(SUC n = n) Theorem SUC_0 autoloading from theory `suc` ... SUC_0 = |- 1 = SUC 0 NOT_1_TWICE = |- !n. ~(1 = n + n) Theorem LESS_EQ_LESS_TRANS autoloading from theory `arithmetic` ... LESS_EQ_LESS_TRANS = |- !m n p. m <= n /\ n < p ==> m < p SUM_LESS = |- !m n p. (m + n) < p ==> m < p /\ n < p Theorem LESS_IMP_LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_IMP_LESS_OR_EQ = |- !m n. m < n ==> m <= n Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n < (SUC n) NOT_LESS_IMP_LESS_EQ_ADD1 = |- !a b. ~a < b ==> b <= (a + 1) NOT_ADD_LESS = |- !m n. ~(m + n) < n ADD_EQ_LESS_EQ = |- !m n p. (m + n = p) ==> m <= p SUC_LESS_N_LESS = |- !m n. (m + 1) < n ==> m < n Theorem LESS_ADD_SUC autoloading from theory `arithmetic` ... LESS_ADD_SUC = |- !m n. m < (m + (SUC n)) LESS_ADD1 = |- !a. a < (a + 1) () : void File add loaded () : void #rm -f zero_ineq.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `zero`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool 0 : int () : void [(); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); ()] : void list Theorem ZERO_LESS_EQ autoloading from theory `arithmetic` ... ZERO_LESS_EQ = |- !n. 0 <= n Theorem LESS_EQ_LESS_TRANS autoloading from theory `arithmetic` ... LESS_EQ_LESS_TRANS = |- !m n p. m <= n /\ n < p ==> m < p M_LESS_0_LESS = |- !m n. m < n ==> 0 < n Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n < (SUC n) Theorem LESS_LEMMA1 autoloading from theory `prim_rec` ... LESS_LEMMA1 = |- !m n. m < (SUC n) ==> (m = n) \/ m < n Theorem NOT_LESS_0 autoloading from theory `prim_rec` ... NOT_LESS_0 = |- !n. ~n < 0 LESS1EQ0 = |- !m. m < 1 = (m = 0) Theorem LESS_EQ_ADD autoloading from theory `arithmetic` ... LESS_EQ_ADD = |- !m n. m <= (m + n) Theorem ADD_SYM autoloading from theory `arithmetic` ... ADD_SYM = |- !m n. m + n = n + m Theorem ADD1 autoloading from theory `arithmetic` ... ADD1 = |- !m. SUC m = m + 1 Theorem GREATER_EQ autoloading from theory `arithmetic` ... GREATER_EQ = |- !n m. n >= m = m <= n Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m <= m NOT_EQ_0 = |- !m. ~(m = 0) ==> m >= 1 Theorem LESS_0_CASES autoloading from theory `arithmetic` ... LESS_0_CASES = |- !m. (0 = m) \/ 0 < m Theorem NOT_LESS_EQUAL autoloading from theory `arithmetic` ... NOT_LESS_EQUAL = |- !m n. ~m <= n = n < m Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) LESS_EQ_0_EQ = |- !m. m <= 0 ==> (m = 0) Theorem LESS_REFL autoloading from theory `prim_rec` ... LESS_REFL = |- !n. ~n < n GREATER_NOT_ZERO = |- !x. 0 < x ==> ~(x = 0) NOT_0_AND_MORE = |- !x. ~((x = 0) /\ 0 < x) () : void File zero loaded () : void #rm -f sub.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `sub`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool 0 : int () : void Theory add loaded () : void Theory zero_ineq loaded () : void Theorem EQ_MONO_ADD_EQ autoloading from theory `arithmetic` ... EQ_MONO_ADD_EQ = |- !m n p. (m + p = n + p) = (m = n) Theorem LESS_MONO_ADD_EQ autoloading from theory `arithmetic` ... LESS_MONO_ADD_EQ = |- !m n p. (m + p) < (n + p) = m < n Theorem LESS_EQ_MONO_ADD_EQ autoloading from theory `arithmetic` ... LESS_EQ_MONO_ADD_EQ = |- !m n p. (m + p) <= (n + p) = m <= n NUM_LESS_EQ_PLUS_CONV = - : (term -> conv) NUM_EQ_PLUS_CONV = - : (term -> conv) NUM_LESS_PLUS_CONV = - : (term -> conv) File num_convs loaded () : void [(); (); (); (); (); ()] : void list Theorem PRE autoloading from theory `prim_rec` ... PRE = |- (PRE 0 = 0) /\ (!m. PRE(SUC m) = m) Theorem SUB_MONO_EQ autoloading from theory `arithmetic` ... SUB_MONO_EQ = |- !n m. (SUC n) - (SUC m) = n - m Theorem NOT_LESS_0 autoloading from theory `prim_rec` ... NOT_LESS_0 = |- !n. ~n < 0 SUB_SUC_PRE_SUB = |- !n m. 0 < n ==> (n - (SUC m) = (PRE n) - m) Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) Theorem ADD_SUC autoloading from theory `arithmetic` ... ADD_SUC = |- !m n. SUC(m + n) = m + (SUC n) ADD_SUC = |- SUC(m + n) = m + (SUC n) Definition SUB autoloading from theory `arithmetic` ... SUB = |- (!m. 0 - m = 0) /\ (!m n. (SUC m) - n = (m < n => 0 | SUC(m - n))) Theorem LESS_SUC_NOT autoloading from theory `arithmetic` ... LESS_SUC_NOT = |- !m n. m < n ==> ~n < (SUC m) SUB_SUC = |- !k m. m < k ==> (k - m = SUC(k - (SUC m))) Theorem SUB_ADD autoloading from theory `arithmetic` ... SUB_ADD = |- !m n. n <= m ==> ((m - n) + n = m) SUB_LESS_TO_LESS_ADDR = |- !m n p. p <= m ==> ((m - p) < n = m < (n + p)) Theorem ADD_SYM autoloading from theory `arithmetic` ... ADD_SYM = |- !m n. m + n = n + m SUB_LESS_TO_LESS_ADDL = |- !m n p. n <= m ==> ((m - n) < p = m < (n + p)) LESS_SUB_TO_ADDR_LESS = |- !m n p. p <= m ==> (n < (m - p) = (n + p) < m) LESS_SUB_TO_ADDL_LESS = |- !m n p. n <= m ==> (p < (m - n) = (n + p) < m) SUC_SUB = |- !m n. (m < n ==> ((SUC m) - n = 0)) /\ (~m < n ==> ((SUC m) - n = SUC(m - n))) Theorem SUB_LESS_EQ autoloading from theory `arithmetic` ... SUB_LESS_EQ = |- !n m. (n - m) <= n LESS_SUB_BOUND = |- !k l. k < l ==> (l - k) <= l Theorem LESS_IMP_LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_IMP_LESS_OR_EQ = |- !m n. m < n ==> m <= n SUB_SUB_ID = |- !k l. l < k ==> (k - (k - l) = l) Theorem SUB_0 autoloading from theory `arithmetic` ... SUB_0 = |- !m. (0 - m = 0) /\ (m - 0 = m) Theorem SUB_EQ_0 autoloading from theory `arithmetic` ... SUB_EQ_0 = |- !m n. (m - n = 0) = m <= n Theorem NOT_LESS autoloading from theory `arithmetic` ... NOT_LESS = |- !m n. ~m < n = n <= m LESS_SUB_IMP_INV = |- !k l. 0 < (k - l) ==> l < k Theorem ADDL_GREATER_EQ autoloading from theory `add` ... ADDL_GREATER_EQ = |- !m n p. m <= n ==> m <= (p + n) Definition ADD autoloading from theory `arithmetic` ... ADD = |- (!n. 0 + n = n) /\ (!m n. (SUC m) + n = SUC(m + n)) LESS_EQ_ADD_SUB1 = |- !m n p. p <= n ==> (m + (n - p) = (m + n) - p) LESS_EQ_SUB_ADD = |- !m n p. p <= m ==> ((m - p) + n = (m + n) - p) Theorem GREATER_EQ autoloading from theory `arithmetic` ... GREATER_EQ = |- !n m. n >= m = m <= n GREATER_EQ_SUB_LESS_TO_ADD = |- !n m p. p >= n ==> ((p - n) < m = p < (n + m)) SUB_GREATER_EQ_ADD = |- !n m p. p >= n ==> ((p - n) >= m = p >= (n + m)) SUB_LE_ADD = |- !n m p. n <= p ==> (m <= (p - n) = (n + m) <= p) Theorem LESS_EQ_ANTISYM autoloading from theory `arithmetic` ... LESS_EQ_ANTISYM = |- !m n. ~(m < n /\ n <= m) NOT_SUB_0 = |- !m n. m < n ==> ~(n - m = 0) NOT_0_SUB = |- !m n. ~(m - n = 0) ==> ~(m = 0) Theorem NOT_EQ_0 autoloading from theory `zero_ineq` ... NOT_EQ_0 = |- !m. ~(m = 0) ==> m >= 1 Theorem ADD1 autoloading from theory `arithmetic` ... ADD1 = |- !m. SUC m = m + 1 SUB_1_LESS = |- !m n. ~(m = 0) /\ m < (SUC n) ==> (m - 1) < n Theorem LESS_THM autoloading from theory `prim_rec` ... LESS_THM = |- !m n. m < (SUC n) = (m = n) \/ m < n Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) Theorem SUC_SUB1 autoloading from theory `arithmetic` ... SUC_SUB1 = |- !m. (SUC m) - 1 = m SUB_1_LESS_EQ = |- !m n. m < n ==> (n - 1) >= m ADD_LESS_EQ_SUB = |- !n m p. n <= p ==> ((n + m) <= p = m <= (p - n)) PRE_SUB_SUC = |- !m n. m < n ==> (PRE(n - m) = n - (SUC m)) Theorem LESS_SUC autoloading from theory `prim_rec` ... LESS_SUC = |- !m n. m < n ==> m < (SUC n) Theorem PRE_SUB1 autoloading from theory `arithmetic` ... PRE_SUB1 = |- !m. PRE m = m - 1 LESS_PRE = |- !i m. i < (m - 1) ==> i < m Theorem LESS_MONO_EQ autoloading from theory `arithmetic` ... LESS_MONO_EQ = |- !m n. (SUC m) < (SUC n) = m < n Theorem LESS_0 autoloading from theory `prim_rec` ... LESS_0 = |- !n. 0 < (SUC n) Theorem LESS_REFL autoloading from theory `prim_rec` ... LESS_REFL = |- !n. ~n < n PRE_LESS_LESS_SUC = |- !i m. i < (m - 1) /\ 0 < m ==> (i + 1) < m Theorem SUC_0 autoloading from theory `suc` ... SUC_0 = |- 1 = SUC 0 Theorem LESS_OR autoloading from theory `arithmetic` ... LESS_OR = |- !m n. m < n ==> (SUC m) <= n Theorem SUB_PLUS autoloading from theory `arithmetic` ... SUB_PLUS = |- !a b c. a - (b + c) = (a - b) - c SUB_PRE_SUB_1 = |- !a b. 0 < b ==> ((a - (PRE b)) - 1 = a - b) LESS_SUB_IMP_SUM_LESS = |- !i m. i < (m - 1) /\ 1 < m ==> (i + 1) < m Theorem SUB_EQUAL_0 autoloading from theory `arithmetic` ... SUB_EQUAL_0 = |- !c. c - c = 0 SUB_SELF = |- !c. c - c = 0 Theorem ADD_SUB autoloading from theory `arithmetic` ... ADD_SUB = |- !a c. (a + c) - c = a ADD_SUB_SYM = |- !a c. (c + a) - c = a SUB_ADD_SELF = |- !m n. ~m < n ==> ((m - n) + n = m) Theorem LESS_ANTISYM autoloading from theory `arithmetic` ... LESS_ANTISYM = |- !m n. ~(m < n /\ n < m) Theorem ADD_MONO_LESS autoloading from theory `add` ... ADD_MONO_LESS = |- !m n p. (m + p) < (m + n) = p < n Theorem LESS_MONO_ADD autoloading from theory `arithmetic` ... LESS_MONO_ADD = |- !m n p. m < n ==> (m + p) < (n + p) Theorem NOT_LESS_EQUAL autoloading from theory `arithmetic` ... NOT_LESS_EQUAL = |- !m n. ~m <= n = n < m Definition GREATER autoloading from theory `arithmetic` ... GREATER = |- !m n. m > n = n < m SMALLER_SUM = |- !m n p. m < p /\ n < p ==> ~((m + n) - p) > m Theorem LESS_EQ_ADD autoloading from theory `arithmetic` ... LESS_EQ_ADD = |- !m n. m <= (m + n) NOT_LESS_SUB = |- !m n. ~m < (m - n) SUB_BOTH_SIDES = |- !m n p. (m = n) ==> (m - p = n - p) Theorem LESS_EQ_LESS_TRANS autoloading from theory `arithmetic` ... LESS_EQ_LESS_TRANS = |- !m n p. m <= n /\ n < p ==> m < p SUB_LESS_BOTH_SIDES = |- !m n p. p <= m /\ m < n ==> (m - p) < (n - p) Theorem LESS_LESS_MONO autoloading from theory `add` ... LESS_LESS_MONO = |- !m n p q. m < p /\ n < q ==> (m + n) < (p + q) LESS_TWICE_IMP_LESS_SUB = |- !a b m. a < m /\ b < m /\ m <= (a + b) ==> ((a + b) - m) < m Theorem SUB_LESS_OR autoloading from theory `arithmetic` ... SUB_LESS_OR = |- !m n. n < m ==> n <= (m - 1) Theorem OR_LESS autoloading from theory `arithmetic` ... OR_LESS = |- !m n. (SUC m) <= n ==> m < n Theorem LESS_EQ_TRANS autoloading from theory `arithmetic` ... LESS_EQ_TRANS = |- !m n p. m <= n /\ n <= p ==> m <= p Theorem ZERO_LESS_EQ autoloading from theory `arithmetic` ... ZERO_LESS_EQ = |- !n. 0 <= n Theorem LESS_EQ_MONO autoloading from theory `arithmetic` ... LESS_EQ_MONO = |- !n m. (SUC n) <= (SUC m) = n <= m SUB_LESS_EQ_SUB_SUC = |- !a b c n. 0 < c /\ a <= (b - n) ==> (a - c) <= (b - (SUC n)) Theorem ADD_ASSOC autoloading from theory `arithmetic` ... ADD_ASSOC = |- !m n p. m + (n + p) = (m + n) + p SUB_EQ_SUB_ADD_SUB = |- !a b c. a <= b /\ b <= c ==> (c - a = (c - b) + (b - a)) Theorem ADD_EQ_SUB autoloading from theory `arithmetic` ... ADD_EQ_SUB = |- !m n p. n <= p ==> ((m + n = p) = (m = p - n)) ADD_EQ_IMP_SUB_EQ = |- !a b c. (a = b + c) ==> (a - b = c) Theorem LESS_0_CASES autoloading from theory `arithmetic` ... LESS_0_CASES = |- !m. (0 = m) \/ 0 < m SUB_GREATER_0 = |- !a b. a < b ==> (b - a) > 0 Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m <= m LESS_EQ_SUB_1 = |- !a b. a <= b ==> (a - 1) <= (b - 1) SUB_LESS_EQ_SUB1 = |- !x. x > 0 ==> (!a. (a - x) <= (a - 1)) () : void File sub loaded () : void #rm -f mult.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `mult`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool 0 : int () : void Theorem LESS_MONO_MULT autoloading from theory `arithmetic` ... LESS_MONO_MULT = |- !m n p. m <= n ==> (m * p) <= (n * p) Theorem MULT_SYM autoloading from theory `arithmetic` ... MULT_SYM = |- !m n. m * n = n * m LESS_MONO_MULT1 = |- !m n p. m <= n ==> (p * m) <= (p * n) Theorem LESS_OR autoloading from theory `arithmetic` ... LESS_OR = |- !m n. m < n ==> (SUC m) <= n Theorem LESS_EQ_LESS_EQ_MONO autoloading from theory `arithmetic` ... LESS_EQ_LESS_EQ_MONO = |- !m n p q. m <= p /\ n <= q ==> (m + n) <= (p + q) Theorem ADD_ASSOC autoloading from theory `arithmetic` ... ADD_ASSOC = |- !m n p. m + (n + p) = (m + n) + p Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m <= m Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) Theorem MULT_CLAUSES autoloading from theory `arithmetic` ... MULT_CLAUSES = |- !m n. (0 * m = 0) /\ (m * 0 = 0) /\ (1 * m = m) /\ (m * 1 = m) /\ ((SUC m) * n = (m * n) + n) /\ (m * (SUC n) = m + (m * n)) Theorem INDUCTION autoloading from theory `num` ... INDUCTION = |- !P. P 0 /\ (!n. P n ==> P(SUC n)) ==> (!n. P n) LESS_MULT_PLUS_DIFF = |- !n k l. k < l ==> ((k * n) + n) <= (l * n) Theorem LESS_LESS_EQ_TRANS autoloading from theory `arithmetic` ... LESS_LESS_EQ_TRANS = |- !m n p. m < n /\ n <= p ==> m < p Theorem LESS_EQ_ADD autoloading from theory `arithmetic` ... LESS_EQ_ADD = |- !m n. m <= (m + n) Theorem TIMES2 autoloading from theory `arithmetic` ... TIMES2 = |- !n. 2 * n = n + n Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n < (SUC n) Definition EXP autoloading from theory `arithmetic` ... EXP = |- (!m. m EXP 0 = 1) /\ (!m n. m EXP (SUC n) = m * (m EXP n)) ONE_LESS_TWO_EXP_SUC = |- !n. 1 < (2 EXP (SUC n)) Theorem LESS_0 autoloading from theory `prim_rec` ... LESS_0 = |- !n. 0 < (SUC n) Theorem NOT_LESS_0 autoloading from theory `prim_rec` ... NOT_LESS_0 = |- !n. ~n < 0 NOT_MULT_LESS_0 = |- !m n. 0 < m /\ 0 < n ==> 0 < (m * n) EXP1 = |- !n. n EXP 1 = n Theorem ZERO_LESS_EXP autoloading from theory `arithmetic` ... ZERO_LESS_EXP = |- !m n. 0 < ((SUC n) EXP m) ZERO_LESS_TWO_EXP = |- !n. 0 < (2 EXP n) Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) ONE_LESS_EQ_TWO_EXP = |- !n. 1 <= (2 EXP n) () : void File mult loaded () : void #rm -f odd_even.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `odd_even`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool 0 : int () : void Definition EVEN autoloading from theory `arithmetic` ... EVEN = |- (EVEN 0 = T) /\ (!n. EVEN(SUC n) = ~EVEN n) Definition ODD autoloading from theory `arithmetic` ... ODD = |- (ODD 0 = F) /\ (!n. ODD(SUC n) = ~ODD n) EVEN_ODD_0 = |- EVEN 0 /\ ~ODD 0 NOT_EVEN_ODD_SUC_EVEN_ODD = |- !n. (~EVEN(SUC n) = EVEN n) /\ (~ODD(SUC n) = ODD n) Theorem EVEN_ODD autoloading from theory `arithmetic` ... EVEN_ODD = |- !n. EVEN n = ~ODD n Theorem ODD_EVEN autoloading from theory `arithmetic` ... ODD_EVEN = |- !n. ODD n = ~EVEN n EVEN_ODD_SUC = |- !n. (EVEN(SUC n) = ODD n) /\ (ODD(SUC n) = EVEN n) Theorem ODD_ADD autoloading from theory `arithmetic` ... ODD_ADD = |- !m n. ODD(m + n) = ~(ODD m = ODD n) Theorem EVEN_ADD autoloading from theory `arithmetic` ... EVEN_ADD = |- !m n. EVEN(m + n) = (EVEN m = EVEN n) EVEN_ODD_PLUS_CASES = |- !n m. (ODD n /\ ODD m ==> EVEN(n + m)) /\ (ODD n /\ EVEN m ==> ODD(n + m)) /\ (EVEN n /\ EVEN m ==> EVEN(n + m)) Theorem EVEN_MULT autoloading from theory `arithmetic` ... EVEN_MULT = |- !m n. EVEN(m * n) = EVEN m \/ EVEN n EVEN_IMPL_MULT = |- !n m. EVEN n \/ EVEN m ==> EVEN(n * m) Theorem ODD_MULT autoloading from theory `arithmetic` ... ODD_MULT = |- !m n. ODD(m * n) = ODD m /\ ODD n ODD_IMPL_MULT = |- !n m. ODD n /\ ODD m ==> ODD(n * m) MULT_ODD = |- !n m. ODD(n * m) ==> ODD n /\ ODD m MULT_EVEN = |- !n m. EVEN(n * m) ==> EVEN n \/ EVEN m () : void File odd_even loaded () : void #rm -f min_max.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `minmax`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool 0 : int () : void MAX_DEF = |- !n p. MAX n p = (n <= p => p | n) Theorem ZERO_LESS_EQ autoloading from theory `arithmetic` ... ZERO_LESS_EQ = |- !n. 0 <= n MAX_0 = |- !n. MAX 0 n = n Theorem NOT_LESS autoloading from theory `arithmetic` ... NOT_LESS = |- !m n. ~m < n = n <= m Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) MAX_SYM = |- !n p. MAX n p = MAX p n MAX_REFL = |- !n. MAX n n = n Theorem LESS_EQ_SUC_REFL autoloading from theory `arithmetic` ... LESS_EQ_SUC_REFL = |- !m. m <= (SUC m) MAX_SUC = |- !n. MAX n(SUC n) = SUC n Theorem LESS_EQ_MONO autoloading from theory `arithmetic` ... LESS_EQ_MONO = |- !n m. (SUC n) <= (SUC m) = n <= m SUC_MAX = |- !n p. MAX(SUC n)(SUC p) = SUC(MAX n p) MIN_DEF = |- !n p. MIN n p = (n <= p => n | p) MIN_0 = |- !n. MIN 0 n = 0 MIN_SYM = |- !n p. MIN n p = MIN p n MIN_REFL = |- !n. MIN n n = n MIN_SUC = |- !n. MIN n(SUC n) = n SUC_MIN = |- !n p. MIN(SUC n)(SUC p) = SUC(MIN n p) () : void File minmax loaded () : void #rm -f div_mod.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `div_mod`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool 0 : int () : void Theorem LESS_MOD autoloading from theory `arithmetic` ... LESS_MOD = |- !n k. k < n ==> (k MOD n = k) Theorem SUC_LESS autoloading from theory `prim_rec` ... SUC_LESS = |- !m n. (SUC m) < n ==> m < n SUC_MOD = |- !n m. (SUC n) < m ==> ((SUC n) MOD m = SUC(n MOD m)) Theorem LESS_0 autoloading from theory `prim_rec` ... LESS_0 = |- !n. 0 < (SUC n) Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) Theorem MULT_CLAUSES autoloading from theory `arithmetic` ... MULT_CLAUSES = |- !m n. (0 * m = 0) /\ (m * 0 = 0) /\ (1 * m = m) /\ (m * 1 = m) /\ ((SUC m) * n = (m * n) + n) /\ (m * (SUC n) = m + (m * n)) Theorem NOT_LESS_0 autoloading from theory `prim_rec` ... NOT_LESS_0 = |- !n. ~n < 0 NOT_MULT_LESS_0 = |- !m n. 0 < m /\ 0 < n ==> 0 < (m * n) Theorem MOD_TIMES autoloading from theory `arithmetic` ... MOD_TIMES = |- !n. 0 < n ==> (!q r. ((q * n) + r) MOD n = r MOD n) Theorem MULT_ASSOC autoloading from theory `arithmetic` ... MULT_ASSOC = |- !m n p. m * (n * p) = (m * n) * p Theorem MULT_SYM autoloading from theory `arithmetic` ... MULT_SYM = |- !m n. m * n = n * m Theorem MOD_MULT autoloading from theory `arithmetic` ... MOD_MULT = |- !n r. r < n ==> (!q. ((q * n) + r) MOD n = r) Theorem DA autoloading from theory `arithmetic` ... DA = |- !k n. 0 < n ==> (?r q. (k = (q * n) + r) /\ r < n) MOD_MULT_MOD = |- !m n. 0 < n /\ 0 < m ==> (!x. (x MOD (n * m)) MOD n = x MOD n) MULT_LEFT_1 = |- !m. 1 * m = m MULT_RIGHT_1 = |- !m. m * 1 = m Theorem DIV_MULT autoloading from theory `arithmetic` ... DIV_MULT = |- !n r. r < n ==> (!q. ((q * n) + r) DIV n = q) Theorem ADD_0 autoloading from theory `arithmetic` ... ADD_0 = |- !m. m + 0 = m MULT_DIV = |- !n q. 0 < n ==> ((q * n) DIV n = q) DIV_ONE = |- !q. q DIV (SUC 0) = q Definition ADD autoloading from theory `arithmetic` ... ADD = |- (!n. 0 + n = n) /\ (!m n. (SUC m) + n = SUC(m + n)) Definition MULT autoloading from theory `arithmetic` ... MULT = |- (!n. 0 * n = 0) /\ (!m n. (SUC m) * n = (m * n) + n) LESS_DIV_EQ_ZERO = |- !r n. r < n ==> (r DIV n = 0) Theorem MOD_EQ_0 autoloading from theory `arithmetic` ... MOD_EQ_0 = |- !n. 0 < n ==> (!k. (k * n) MOD n = 0) SUC_MOD_SELF = |- !n. (SUC n) MOD (SUC n) = 0 Definition DIVISION autoloading from theory `arithmetic` ... DIVISION = |- !n. 0 < n ==> (!k. (k = ((k DIV n) * n) + (k MOD n)) /\ (k MOD n) < n) Theorem MULT_SUC_EQ autoloading from theory `arithmetic` ... MULT_SUC_EQ = |- !p m n. (n * (SUC p) = m * (SUC p)) = (n = m) SUC_DIV_SELF = |- !n. (SUC n) DIV (SUC n) = 1 Theorem ADD_ASSOC autoloading from theory `arithmetic` ... ADD_ASSOC = |- !m n p. m + (n + p) = (m + n) + p Theorem ADD_SYM autoloading from theory `arithmetic` ... ADD_SYM = |- !m n. m + n = n + m ADD_DIV_SUC_DIV = |- !n. 0 < n ==> (!r. (n + r) DIV n = SUC(r DIV n)) Theorem RIGHT_ADD_DISTRIB autoloading from theory `arithmetic` ... RIGHT_ADD_DISTRIB = |- !m n p. (m + n) * p = (m * p) + (n * p) ADD_DIV_ADD_DIV = |- !n. 0 < n ==> (!x r. ((x * n) + r) DIV n = x + (r DIV n)) Theorem ADD1 autoloading from theory `arithmetic` ... ADD1 = |- !m. SUC m = m + 1 Theorem LESS_OR autoloading from theory `arithmetic` ... LESS_OR = |- !m n. m < n ==> (SUC m) <= n Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) SUC_DIV_CASES = |- !n. 0 < n ==> (!x. ((SUC x) DIV n = x DIV n) \/ ((SUC x) DIV n = SUC(x DIV n))) Theorem LESS_THM autoloading from theory `prim_rec` ... LESS_THM = |- !m n. m < (SUC n) = (m = n) \/ m < n Less_lemma = |- !m n. m < n ==> (?p. (n = m + p) /\ 0 < p) Theorem LESS_EQ_ADD autoloading from theory `arithmetic` ... LESS_EQ_ADD = |- !m n. m <= (m + n) LESS_MONO_DIV = |- !n. 0 < n ==> (!p q. p < q ==> (p DIV n) <= (q DIV n)) Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m <= m LESS_EQ_MONO_DIV = |- !n. 0 < n ==> (!p q. p <= q ==> (p DIV n) <= (q DIV n)) Theorem LESS_TRANS autoloading from theory `arithmetic` ... LESS_TRANS = |- !m n p. m < n /\ n < p ==> m < p Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n < (SUC n) Theorem LESS_LESS_EQ_TRANS autoloading from theory `arithmetic` ... LESS_LESS_EQ_TRANS = |- !m n p. m < n /\ n <= p ==> m < p Less_MULT_lemma = |- !r m p. 0 < p ==> r < m ==> r < (p * m) Theorem LESS_MONO_ADD_EQ autoloading from theory `arithmetic` ... LESS_MONO_ADD_EQ = |- !m n p. (m + p) < (n + p) = m < n Less_MULT_ADD_lemma = |- !m n r r'. 0 < m /\ 0 < n /\ r < m /\ r' < n ==> ((r' * m) + r) < (n * m) Theorem ADD_INV_0_EQ autoloading from theory `arithmetic` ... ADD_INV_0_EQ = |- !m n. (m + n = m) = (n = 0) DIV_DIV_DIV_MULT = |- !m n. 0 < m /\ 0 < n ==> (!x. (x DIV m) DIV n = x DIV (m * n)) () : void File div_mod loaded () : void #rm -f more_arithmetic.th echo 'set_flag(`abort_when_fail`,true);;'\ 'loadt `mk_more_arithmetic`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void Theory ineq loaded () : void Theory pre loaded () : void Theory sub loaded () : void Theory mult loaded () : void Theory min_max loaded () : void Theory odd_even loaded () : void Theory div_mod loaded () : void () : void File mk_more_arithmetic loaded () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `num_convs`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool Theorem EQ_MONO_ADD_EQ autoloading from theory `arithmetic` ... EQ_MONO_ADD_EQ = |- !m n p. (m + p = n + p) = (m = n) Theorem LESS_MONO_ADD_EQ autoloading from theory `arithmetic` ... LESS_MONO_ADD_EQ = |- !m n p. (m + p) < (n + p) = m < n Theorem LESS_EQ_MONO_ADD_EQ autoloading from theory `arithmetic` ... LESS_EQ_MONO_ADD_EQ = |- !m n p. (m + p) <= (n + p) = m <= n NUM_LESS_EQ_PLUS_CONV = - : (term -> conv) NUM_EQ_PLUS_CONV = - : (term -> conv) NUM_LESS_PLUS_CONV = - : (term -> conv) Calling Lisp compiler File num_convs compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `num_tac`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void GEN_INDUCT_RULE = - : (thm -> thm -> thm) GEN_INDUCT_TAC = - : tactic Calling Lisp compiler File num_tac compiled () : void #===> library more_arithmetic rebuilt make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral' echo 'set_flag(`abort_when_fail`,true);;' \ 'loadt `numeral_theory`;;' \ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool false : bool () : void def_buffer = "T" : term new_defn = - : (string list -> thm) define = - : (term -> void) File define loaded () : void Theorem LESS_0 autoloading from theory `prim_rec` ... LESS_0 = |- !n. 0 < (SUC n) Theorem NOT_SUC autoloading from theory `num` ... NOT_SUC = |- !n. ~(SUC n = 0) Theorem NOT_LESS_0 autoloading from theory `prim_rec` ... NOT_LESS_0 = |- !n. ~n < 0 NOT_0_IMP_0_LESS = |- !n. ~(n = 0) = 0 < n Theorem LESS_EQ_TRANS autoloading from theory `arithmetic` ... LESS_EQ_TRANS = |- !m n p. m <= n /\ n <= p ==> m <= p Theorem LESS_EQ_ADD autoloading from theory `arithmetic` ... LESS_EQ_ADD = |- !m n. m <= (m + n) LESS_OR_EQ_IMP_LESS_OR_EQ_ADD = |- !m n p. m <= n ==> m <= (n + p) Theorem LESS_EQ_MONO autoloading from theory `arithmetic` ... LESS_EQ_MONO = |- !n m. (SUC n) <= (SUC m) = n <= m Definition ADD autoloading from theory `arithmetic` ... ADD = |- (!n. 0 + n = n) /\ (!m n. (SUC m) + n = SUC(m + n)) Theorem ADD_SYM autoloading from theory `arithmetic` ... ADD_SYM = |- !m n. m + n = n + m Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) Definition MULT autoloading from theory `arithmetic` ... MULT = |- (!n. 0 * n = 0) /\ (!m n. (SUC m) * n = (m * n) + n) Theorem MULT_SYM autoloading from theory `arithmetic` ... MULT_SYM = |- !m n. m * n = n * m MULT_NONNEG_MONO_LESS_OR_EQ = |- !m n. 0 < m ==> n <= (m * n) Theorem LESS_LESS_EQ_TRANS autoloading from theory `arithmetic` ... LESS_LESS_EQ_TRANS = |- !m n p. m < n /\ n <= p ==> m < p ADDR_GREATER = |- !m n p. m < n ==> m < (n + p) ADDL_GREATER = |- !m n p. m < n ==> m < (p + n) Theorem LENGTH_APPEND autoloading from theory `list` ... LENGTH_APPEND = |- !l1 l2. LENGTH(APPEND l1 l2) = (LENGTH l1) + (LENGTH l2) Theorem LENGTH_SNOC autoloading from theory `list` ... LENGTH_SNOC = |- !x l. LENGTH(SNOC x l) = SUC(LENGTH l) Theorem LENGTH_REVERSE autoloading from theory `list` ... LENGTH_REVERSE = |- !l. LENGTH(REVERSE l) = LENGTH l Definition LENGTH autoloading from theory `list` ... LENGTH = |- (LENGTH[] = 0) /\ (!h t. LENGTH(CONS h t) = SUC(LENGTH t)) LENGTH_CLAUSES = |- (LENGTH[] = 0) /\ (!h t. LENGTH(CONS h t) = SUC(LENGTH t)) /\ (!x l. LENGTH(SNOC x l) = SUC(LENGTH l)) /\ (!l1 l2. LENGTH(APPEND l1 l2) = (LENGTH l1) + (LENGTH l2)) /\ (!l. LENGTH(REVERSE l) = LENGTH l) Theorem MULT_CLAUSES autoloading from theory `arithmetic` ... MULT_CLAUSES = |- !m n. (0 * m = 0) /\ (m * 0 = 0) /\ (1 * m = m) /\ (m * 1 = m) /\ ((SUC m) * n = (m * n) + n) /\ (m * (SUC n) = m + (m * n)) Theorem LESS_EQ_MONO_ADD_EQ autoloading from theory `arithmetic` ... LESS_EQ_MONO_ADD_EQ = |- !m n p. (m + p) <= (n + p) = m <= n Theorem RIGHT_ADD_DISTRIB autoloading from theory `arithmetic` ... RIGHT_ADD_DISTRIB = |- !m n p. (m + n) * p = (m * p) + (n * p) Theorem LESS_ADD_1 autoloading from theory `arithmetic` ... LESS_ADD_1 = |- !m n. n < m ==> (?p. m = n + (p + 1)) LESS_MULT_PLUS_DIFF = |- !n k l. k < l ==> ((k * n) + n) <= (l * n) Theorem LAST autoloading from theory `list` ... LAST = |- !x l. LAST(SNOC x l) = x Theorem BUTLAST autoloading from theory `list` ... BUTLAST = |- !x l. BUTLAST(SNOC x l) = l Theorem NULL autoloading from theory `list` ... NULL = |- NULL[] /\ (!h t. ~NULL(CONS h t)) Theorem SNOC_INDUCT autoloading from theory `list` ... SNOC_INDUCT = |- !P. P[] /\ (!l. P l ==> (!x. P(SNOC x l))) ==> (!l. P l) SNOC_BUTLAST = |- !l. ~NULL l ==> (SNOC(LAST l)(BUTLAST l) = l) Theorem LESS_MONO_ADD_EQ autoloading from theory `arithmetic` ... LESS_MONO_ADD_EQ = |- !m n p. (m + p) < (n + p) = m < n Theorem LESS_TRANS autoloading from theory `arithmetic` ... LESS_TRANS = |- !m n p. m < n /\ n < p ==> m < p LESS_LESS_MONO = |- !m n p q. m < p /\ n < q ==> (m + n) < (p + q) Theorem LESS_EQ_REFL autoloading from theory `arithmetic` ... LESS_EQ_REFL = |- !m. m <= m Theorem LESS_EQUAL_ANTISYM autoloading from theory `arithmetic` ... LESS_EQUAL_ANTISYM = |- !n m. n <= m /\ m <= n ==> (n = m) Theorem NOT_LESS autoloading from theory `arithmetic` ... NOT_LESS = |- !m n. ~m < n = n <= m NOT_EQ_LESS_EQ = |- !a b. ~(a = b) = a < b \/ b < a Theorem LESS_REFL autoloading from theory `prim_rec` ... LESS_REFL = |- !n. ~n < n GREATER_NOT_ZERO = |- !x. 0 < x ==> ~(x = 0) Theorem NOT_LESS_EQUAL autoloading from theory `arithmetic` ... NOT_LESS_EQUAL = |- !m n. ~m <= n = n < m LESS_IS_NOT_LESS_OR_EQ = |- !x y. x < y = ~y <= x Theorem INV_SUC_EQ autoloading from theory `prim_rec` ... INV_SUC_EQ = |- !m n. (SUC m = SUC n) = (m = n) Definition REPLICATE autoloading from theory `list` ... REPLICATE = |- (!x. REPLICATE 0 x = []) /\ (!n x. REPLICATE(SUC n)x = CONS x(REPLICATE n x)) Theorem LENGTH_REPLICATE autoloading from theory `list` ... LENGTH_REPLICATE = |- !n x. LENGTH(REPLICATE n x) = n LENGTH_REPLICATE = |- !n e. LENGTH(REPLICATE n e) = n Definition ALL_EL autoloading from theory `list` ... ALL_EL = |- (!P. ALL_EL P[] = T) /\ (!P x l. ALL_EL P(CONS x l) = P x /\ ALL_EL P l) EVERY_REPLICATE = |- !n e. ALL_EL($= e)(REPLICATE n e) () : void IS_NORMALIZED = |- !digits. IS_NORMALIZED digits = (digits = []) \/ 0 < (HD digits) IS_NORMALIZED_NIL = |- IS_NORMALIZED[] Theorem NOT_CONS_NIL autoloading from theory `list` ... NOT_CONS_NIL = |- !h t. ~(CONS h t = []) Definition HD autoloading from theory `list` ... HD = |- !h t. HD(CONS h t) = h IS_NORMALIZED_CONS = |- !e l. IS_NORMALIZED(CONS e l) = 0 < e () : void IS_BASEN = |- !radix digits. IS_BASEN radix digits = ALL_EL($> radix)digits IS_BASEN_NIL = |- !r. IS_BASEN r[] Definition GREATER autoloading from theory `arithmetic` ... GREATER = |- !m n. m > n = n < m IS_BASEN_CONS = |- !r l e. IS_BASEN r(CONS e l) = e < r /\ IS_BASEN r l IS_BASEN_CONS_IMP_LESS = |- !r l e. 1 < r ==> IS_BASEN r(CONS e l) ==> e < r IS_BASEN_CONS_IMP_IS_BASEN = |- !r l e. 1 < r ==> IS_BASEN r(CONS e l) ==> IS_BASEN r l Theorem list_Axiom autoloading from theory `list` ... list_Axiom = |- !x f. ?! fn. (fn[] = x) /\ (!h t. fn(CONS h t) = f(fn t)h t) BASEN = |- (!radix. BASEN radix[] = 0) /\ (!radix digit digits. BASEN radix(CONS digit digits) = (digit * (radix EXP (LENGTH digits))) + (BASEN radix digits)) Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) BASEN_ZEROS = |- !r n. BASEN r(REPLICATE n 0) = 0 Theorem SUC_LESS autoloading from theory `prim_rec` ... SUC_LESS = |- !m n. (SUC m) < n ==> m < n Theorem ZERO_LESS_EXP autoloading from theory `arithmetic` ... ZERO_LESS_EXP = |- !m n. 0 < ((SUC n) EXP m) one_less_exp_lemma = . |- !m. 0 < (r EXP m) BASEN_EMPTY_EQ_0 = |- !r l. 1 < r ==> IS_NORMALIZED l ==> ((BASEN r l = 0) = (l = [])) BASEN_CONS_0 = |- !r l. BASEN r(CONS 0 l) = BASEN r l Theorem MULT_ASSOC autoloading from theory `arithmetic` ... MULT_ASSOC = |- !m n p. m * (n * p) = (m * n) * p Theorem EQ_MONO_ADD_EQ autoloading from theory `arithmetic` ... EQ_MONO_ADD_EQ = |- !m n p. (m + p = n + p) = (m = n) Theorem ADD_ASSOC autoloading from theory `arithmetic` ... ADD_ASSOC = |- !m n p. m + (n + p) = (m + n) + p Definition EXP autoloading from theory `arithmetic` ... EXP = |- (!m. m EXP 0 = 1) /\ (!m n. m EXP (SUC n) = m * (m EXP n)) Definition SNOC autoloading from theory `list` ... SNOC = |- (!x. SNOC x[] = [x]) /\ (!x x' l. SNOC x(CONS x' l) = CONS x'(SNOC x l)) BASEN_SNOC = |- !r e l. BASEN r(SNOC e l) = ((BASEN r l) * r) + e BASEN_DIGIT_EQ_DIGIT = |- !r e. BASEN r[e] = e BASEN_EXP_N = |- !r n. BASEN r(CONS 1(REPLICATE n 0)) = r EXP n BASEN_LESS_EXP_LENGTH = |- !r l. 1 < r ==> IS_BASEN r l ==> (BASEN r l) < (r EXP (LENGTH l)) Theorem SUB_LESS_OR autoloading from theory `arithmetic` ... SUB_LESS_OR = |- !m n. n < m ==> n <= (m - 1) BASEN_LESS_OR_EQ_EXP_LENGTH = |- !r l. 1 < r ==> IS_BASEN r l ==> (BASEN r l) <= ((r EXP (LENGTH l)) - 1) Theorem DIV_MULT autoloading from theory `arithmetic` ... DIV_MULT = |- !n r. r < n ==> (!q. ((q * n) + r) DIV n = q) Theorem MOD_MULT autoloading from theory `arithmetic` ... MOD_MULT = |- !n r. r < n ==> (!q. ((q * n) + r) MOD n = r) numeral_lemma = |- !r' n r q q'. r' < n ==> r < n ==> ((q * n) + r = (q' * n) + r') ==> (r = r') /\ (q = q') basen_and_eq_lemma = ..... |- (BASEN r l1 = BASEN r l2) /\ (h = h') Theorem CONS_11 autoloading from theory `list` ... CONS_11 = |- !h t h' t'. (CONS h t = CONS h' t') = (h = h') /\ (t = t') Theorem SUC_NOT autoloading from theory `arithmetic` ... SUC_NOT = |- !n. ~(0 = SUC n) Theorem list_INDUCT autoloading from theory `list` ... list_INDUCT = |- !P. P[] /\ (!t. P t ==> (!h. P(CONS h t))) ==> (!l. P l) BASEN_11 = |- !r l1 l2. 1 < r ==> IS_BASEN r l1 ==> IS_BASEN r l2 ==> (LENGTH l1 = LENGTH l2) ==> (BASEN r l1 = BASEN r l2) ==> (l1 = l2) Theorem SUB_0 autoloading from theory `arithmetic` ... SUB_0 = |- !m. (0 - m = 0) /\ (m - 0 = m) Theorem SUB_MONO_EQ autoloading from theory `arithmetic` ... SUB_MONO_EQ = |- !n m. (SUC n) - (SUC m) = n - m BASEN_EXP_LESS_OR_EQ = |- !r l. 1 < r ==> ~NULL l ==> IS_NORMALIZED l ==> IS_BASEN r l ==> (r EXP ((LENGTH l) - 1)) <= (BASEN r l) Theorem LESS_EQ autoloading from theory `arithmetic` ... LESS_EQ = |- !m n. m < n = (SUC m) <= n BASEN_EXP_LESS = |- !r l. IS_BASEN r l ==> IS_NORMALIZED l ==> ~NULL l ==> 1 < r ==> ((r EXP ((LENGTH l) - 1)) - 1) < (BASEN r l) BASEN_ONTO = |- !r l. ?n. BASEN r l = n Theorem LEFT_ADD_DISTRIB autoloading from theory `arithmetic` ... LEFT_ADD_DISTRIB = |- !m n p. p * (m + n) = (p * m) + (p * n) Theorem EXP_ADD autoloading from theory `arithmetic` ... EXP_ADD = |- !p q n. n EXP (p + q) = (n EXP p) * (n EXP q) Definition APPEND autoloading from theory `list` ... APPEND = |- (!l. APPEND[]l = l) /\ (!l1 l2 h. APPEND(CONS h l1)l2 = CONS h(APPEND l1 l2)) BASEN_APPEND = |- !r l m. BASEN r(APPEND l m) = ((r EXP (LENGTH m)) * (BASEN r l)) + (BASEN r m) IS_BASEN_APPEND = |- !r l m. IS_BASEN r(APPEND l m) = IS_BASEN r l /\ IS_BASEN r m Theorem LESS_MOD autoloading from theory `arithmetic` ... LESS_MOD = |- !n k. k < n ==> (k MOD n = k) Theorem MOD_TIMES autoloading from theory `arithmetic` ... MOD_TIMES = |- !n. 0 < n ==> (!q r. ((q * n) + r) MOD n = r MOD n) Theorem LESS_MONO_EQ autoloading from theory `arithmetic` ... LESS_MONO_EQ = |- !m n. (SUC m) < (SUC n) = m < n Theorem num_CASES autoloading from theory `arithmetic` ... num_CASES = |- !m. (m = 0) \/ (?n. m = SUC n) Theorem SUC_SUB1 autoloading from theory `arithmetic` ... SUC_SUB1 = |- !m. (SUC m) - 1 = m Definition TL autoloading from theory `list` ... TL = |- !h t. TL(CONS h t) = t Theorem list_CASES autoloading from theory `list` ... list_CASES = |- !l. (l = []) \/ (?t h. l = CONS h t) BASEN_TRAILING = |- !r l. 1 < r ==> IS_BASEN r l ==> ~NULL l ==> (BASEN r(TL l) = (BASEN r l) MOD (r EXP ((LENGTH l) - 1))) Theorem SNOC_APPEND autoloading from theory `list` ... SNOC_APPEND = |- !x l. SNOC x l = APPEND l[x] BASEN_LEADING = |- !r l. 1 < r ==> IS_BASEN r l ==> ~NULL l ==> (BASEN r(BUTLAST l) = (BASEN r l) DIV r) Theorem LESS_EQ_EXISTS autoloading from theory `arithmetic` ... LESS_EQ_EXISTS = |- !m n. m <= n = (?p. n = m + p) Theorem LESS_THM autoloading from theory `prim_rec` ... LESS_THM = |- !m n. m < (SUC n) = (m = n) \/ m < n NORMALIZED_LENGTHS_LEMMA = |- !l1 l2 r. ~(1 < r /\ IS_BASEN r l1 /\ IS_BASEN r l2 /\ IS_NORMALIZED l1 /\ IS_NORMALIZED l2 /\ (BASEN r l1 = BASEN r l2) /\ (LENGTH l1) < (LENGTH l2)) NORMALIZED_LENGTHS = |- !l1 l2 r. 1 < r ==> IS_BASEN r l1 ==> IS_BASEN r l2 ==> IS_NORMALIZED l1 ==> IS_NORMALIZED l2 ==> (BASEN r l1 = BASEN r l2) ==> (LENGTH l1 = LENGTH l2) NORMALIZED_BASEN_11 = |- !l1 l2 r. 1 < r ==> IS_BASEN r l1 ==> IS_BASEN r l2 ==> IS_NORMALIZED l1 ==> IS_NORMALIZED l2 ==> (BASEN r l1 = BASEN r l2) ==> (l1 = l2) Definition DIVISION autoloading from theory `arithmetic` ... DIVISION = |- !n. 0 < n ==> (!k. (k = ((k DIV n) * n) + (k MOD n)) /\ (k MOD n) < n) div_mod_lemma = . |- (n = ((n DIV (r EXP m)) * (r EXP m)) + (n MOD (r EXP m))) /\ (n MOD (r EXP m)) < (r EXP m) BASEN_ONTO_MOD_LEMMA = |- !m n r. ?l. 1 < r ==> n < (r EXP m) ==> (LENGTH l = m) /\ (n = BASEN r l) BASEN_MOD_ONTO_LEMMA = |- !n m r. ?l. 1 < r ==> (LENGTH l = n) /\ (BASEN r l = m MOD (r EXP n)) BASEN_DIGITS_EXISTS = |- ?f. !n m r. 1 < r ==> (LENGTH(f r n m) = n) /\ (BASEN r(f r n m) = m MOD (r EXP n)) BASEN_DIGITS = |- !n m r. 1 < r ==> (LENGTH(BASEN_DIGITS r n m) = n) /\ (BASEN r(BASEN_DIGITS r n m) = m MOD (r EXP n)) SELECT_TAC = - : tactic EXP_1 = |- !r. r EXP 1 = r MULT_POS_MONO = |- !m n. 0 < n ==> m <= (m * n) POS_EXP_POS = |- !r x. 0 < r ==> 0 < x ==> r <= (r EXP x) LESS_LEMMA1 = |- !m n. m < (SUC n) ==> (m = n) \/ m < n LESS_MONO_REV = |- !m n. (SUC m) < (SUC n) ==> m < n Theorem LESS_SUC autoloading from theory `prim_rec` ... LESS_SUC = |- !m n. m < n ==> m < (SUC n) MULT_LESS_MULT = |- !m n p q. m < n ==> p < q ==> (m * p) < (n * q) MULT_POS_STRICT_MONO = |- !m n p. n < p ==> n < ((SUC m) * p) Theorem LESS_EXP_SUC_MONO autoloading from theory `arithmetic` ... LESS_EXP_SUC_MONO = |- !n m. ((SUC(SUC m)) EXP n) < ((SUC(SUC m)) EXP (SUC n)) EXP_LESS_EXP = |- !m n n'. 1 < m ==> n < n' ==> (m EXP n) < (m EXP n') EXP_2_STRICT_MONO = |- !m n. 1 < m ==> 1 < n ==> m < (m EXP n) NUM_CASES_DISJ = |- !n m. m < n \/ (m = n) \/ n < m Theorem LESS_MULT_MONO autoloading from theory `arithmetic` ... LESS_MULT_MONO = |- !m i n. ((SUC n) * m) < ((SUC n) * i) = m < i MULT_POS_STRICT_MONO2 = |- !m n1 n2. 0 < m ==> ((m * n1) < (m * n2) = n1 < n2) () : void LOG = |- !r n. LOG r n = (@x. (r EXP x) <= n /\ n < (r EXP (x + 1))) Theorem LESS_OR autoloading from theory `arithmetic` ... LESS_OR = |- !m n. m < n ==> (SUC m) <= n Theorem LESS_0_CASES autoloading from theory `arithmetic` ... LESS_0_CASES = |- !m. (0 = m) \/ 0 < m LOG_1 = |- !r. 1 < r ==> (LOG r 1 = 0) () : void File numeral_theory loaded () : void #rm -f dummy.th echo 'set_flag(`abort_when_fail`,true);;' \ 'new_theory `dummy`;;' \ 'load_library `reduce`;;' \ 'new_parent `numeral`;;' \ 'let t = `numeral` in do' \ 'map (\s. autoload_theory(`definition`,t,fst s)) (definitions t);' \ 'map (\s. autoload_theory(`theorem`,t,fst s)) (theorems t);;' \ 'compilet `numeral_rules`;;' \ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void Loading library reduce ... Extending help search path. Loading boolean conversions........ Loading arithmetic conversions.................. Loading general conversions, rule and tactic..... Library reduce loaded. () : void Theory numeral loaded () : void [(); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); (); ()] : void list Theorem LESS_EQ_ADD autoloading from theory `arithmetic` ... LESS_EQ_ADD = |- !m n. m <= (m + n) Theorem ADD_ASSOC autoloading from theory `arithmetic` ... ADD_ASSOC = |- !m n p. m + (n + p) = (m + n) + p Theorem LESS_EQ_EXISTS autoloading from theory `arithmetic` ... LESS_EQ_EXISTS = |- !m n. m <= n = (?p. n = m + p) ADDR_GREATER_EQ = |- !m n p. m <= n ==> m <= (n + p) Theorem LESS_ANTISYM autoloading from theory `arithmetic` ... LESS_ANTISYM = |- !m n. ~(m < n /\ n < m) NOT_LESS_AND_GREATER = |- !n m. n < m ==> ~m < n Theorem LESS_MONO_ADD_EQ autoloading from theory `arithmetic` ... LESS_MONO_ADD_EQ = |- !m n p. (m + p) < (n + p) = m < n Theorem ADD_SYM autoloading from theory `arithmetic` ... ADD_SYM = |- !m n. m + n = n + m ADD_MONO_LESS = |- !m n p. (m + p) < (m + n) = p < n Theorem ADD_SUB autoloading from theory `arithmetic` ... ADD_SUB = |- !a c. (a + c) - c = a ADD_EQ_IMP_SUB_EQ = |- !a b c. (a = b + c) ==> (a - b = c) radices = [10; 16] : int list max = - : (int -> int -> int) max_radix = 16 : int () : void upto = - : (int -> int list) zero_upto = - : (int -> int list) lengthen = - : (* -> int -> * list -> * list) listify = - : (* -> * list) firstn = - : (int -> * list -> * list) butfirstn = - : (int -> * list -> * list) absolute_value = - : (int -> int) mk_binary_comb = - : (term -> term -> term -> term) dest_unary_comb = - : (term -> term -> term) dest_binary_comb = - : (term -> term -> (term # term)) mk_term_list = - : ((string # type) -> int -> term list) Definition SNOC autoloading from theory `list` ... SNOC = |- (!x. SNOC x[] = [x]) /\ (!x x' l. SNOC x(CONS x' l) = CONS x'(SNOC x l)) CONS_OF_SNOC_CONV = - : conv SNOC_OF_CONS_CONV = - : conv Definition GREATER autoloading from theory `arithmetic` ... GREATER = |- !m n. m > n = n < m Theorem LESS_SUC autoloading from theory `prim_rec` ... LESS_SUC = |- !m n. m < n ==> m < (SUC n) Theorem LESS_SUC_REFL autoloading from theory `prim_rec` ... LESS_SUC_REFL = |- !n. n < (SUC n) Definition LENGTH autoloading from theory `list` ... LENGTH = |- (LENGTH[] = 0) /\ (!h t. LENGTH(CONS h t) = SUC(LENGTH t)) LENGTH_COMPARE_CONV = - : conv Theorem LESS_NOT_EQ autoloading from theory `prim_rec` ... LESS_NOT_EQ = |- !m n. m < n ==> ~(m = n) COMPARE_EQ_RULE = - : (thm -> thm) COMPARE_LT_RULE = - : (thm -> thm) Theorem NOT_LESS autoloading from theory `arithmetic` ... NOT_LESS = |- !m n. ~m < n = n <= m Definition LESS_OR_EQ autoloading from theory `arithmetic` ... LESS_OR_EQ = |- !m n. m <= n = m < n \/ (m = n) COMPARE_LE_RULE = - : (thm -> thm) Theorem LESS_REFL autoloading from theory `prim_rec` ... LESS_REFL = |- !n. ~n < n COMPARE_GT_RULE = - : (thm -> thm) Theorem GREATER_EQ autoloading from theory `arithmetic` ... GREATER_EQ = |- !n m. n >= m = m <= n Definition GREATER_OR_EQ autoloading from theory `arithmetic` ... GREATER_OR_EQ = |- !m n. m >= n = m > n \/ (m = n) COMPARE_GE_RULE = - : (thm -> thm) LENGTH_EQ_CONV = - : conv is_lt = - : (term -> bool) LENGTH_LT_CONV = - : conv is_le = - : (term -> bool) LENGTH_LE_CONV = - : conv is_gt = - : (term -> bool) LENGTH_GT_CONV = - : conv is_ge = - : (term -> bool) LENGTH_GE_CONV = - : conv fast_num_CONV = - : conv Theorem LESS_TRANS autoloading from theory `arithmetic` ... LESS_TRANS = |- !m n p. m < n /\ n < p ==> m < p Theorem EQ_LESS autoloading from theory `prim_rec` ... EQ_LESS = |- !n. (SUC m = n) ==> m < n fast_GT_CONV = - : conv fast_LT_CONV = - : conv mk_basen = - : (term -> term list -> term) dest_basen = - : (term -> (term # term)) is_basen = - : (term -> bool) dest_unary_basen_comb = - : (term -> (term # term # term # term # term list)) dest_binary_basen_comb = - : (term -> (term # term # term # term # term list # term # term # term list)) numeral_of_int = - : ((int # int) -> int list) basen_of_numeral = - : ((int # int list) -> term) basen_of_int = - : ((int # int) -> term) numeral_of_basen = - : (term -> (int # int list)) int_of_numeral = - : ((int # int list) -> int) int_of_basen = - : (term -> int) Definition ALL_EL autoloading from theory `list` ... ALL_EL = |- (!P. ALL_EL P[] = T) /\ (!P x l. ALL_EL P(CONS x l) = P x /\ ALL_EL P l) Definition IS_BASEN autoloading from theory `numeral` ... IS_BASEN = |- !radix digits. IS_BASEN radix digits = ALL_EL($> radix)digits Theorem IS_BASEN_NIL autoloading from theory `numeral` ... IS_BASEN_NIL = |- !r. IS_BASEN r[] IS_BASEN_CONV = - : conv Theorem IS_NORMALIZED_CONS autoloading from theory `numeral` ... IS_NORMALIZED_CONS = |- !e l. IS_NORMALIZED(CONS e l) = 0 < e Theorem IS_NORMALIZED_NIL autoloading from theory `numeral` ... IS_NORMALIZED_NIL = |- IS_NORMALIZED[] IS_NORMALIZED_CONV = - : conv Theorem BASEN_CONS_0 autoloading from theory `numeral` ... BASEN_CONS_0 = |- !r l. BASEN r(CONS 0 l) = BASEN r l ONCE_BASEN_NORMALIZE_CONV = - : conv BASEN_NORMALIZE_CONV = - : conv ONCE_BASEN_DENORMALIZE_CONV = - : conv BASEN_DENORMALIZE_CONV = - : (int -> conv) Theorem ADD_CLAUSES autoloading from theory `arithmetic` ... ADD_CLAUSES = |- (0 + m = m) /\ (m + 0 = m) /\ ((SUC m) + n = SUC(m + n)) /\ (m + (SUC n) = SUC(m + n)) Theorem MULT_CLAUSES autoloading from theory `arithmetic` ... MULT_CLAUSES = |- !m n. (0 * m = 0) /\ (m * 0 = 0) /\ (1 * m = m) /\ (m * 1 = m) /\ ((SUC m) * n = (m * n) + n) /\ (m * (SUC n) = m + (m * n)) Theorem LESS_MONO_MULT autoloading from theory `arithmetic` ... LESS_MONO_MULT = |- !m n p. m <= n ==> (m * p) <= (n * p) Theorem LESS_EQ autoloading from theory `arithmetic` ... LESS_EQ = |- !m n. m < n = (SUC m) <= n Definition MULT autoloading from theory `arithmetic` ... MULT = |- (!n. 0 * n = 0) /\ (!m n. (SUC m) * n = (m * n) + n) Theorem BASEN_LESS_EXP_LENGTH autoloading from theory `numeral` ... BASEN_LESS_EXP_LENGTH = |- !r l. 1 < r ==> IS_BASEN r l ==> (BASEN r l) < (r EXP (LENGTH l)) Theorem LESS_LESS_EQ_TRANS autoloading from theory `arithmetic` ... LESS_LESS_EQ_TRANS = |- !m n p. m < n /\ n <= p ==> m < p Definition BASEN autoloading from theory `numeral` ... BASEN = |- (!radix. BASEN radix[] = 0) /\ (!radix digit digits. BASEN radix(CONS digit digits) = (digit * (radix EXP (LENGTH digits))) + (BASEN radix digits)) BASEN_COMPARE_CONV = - : conv BASEN_EQ_CONV = - : conv BASEN_LT_CONV = - : conv BASEN_LE_CONV = - : conv BASEN_GT_CONV = - : conv BASEN_GE_CONV = - : conv Theorem ADD_SUC autoloading from theory `arithmetic` ... ADD_SUC = |- !m n. SUC(m + n) = m + (SUC n) fast_add = - : (int -> int -> thm) fast_add_with_carry = - : (int -> int -> int -> thm) fast_mul_with_carry = - : (int -> int -> int -> thm) Theorem MOD_TIMES autoloading from theory `arithmetic` ... MOD_TIMES = |- !n. 0 < n ==> (!q r. ((q * n) + r) MOD n = r MOD n) Definition DIVISION autoloading from theory `arithmetic` ... DIVISION = |- !n. 0 < n ==> (!k. (k = ((k DIV n) * n) + (k MOD n)) /\ (k MOD n) < n) Theorem EQ_MONO_ADD_EQ autoloading from theory `arithmetic` ... EQ_MONO_ADD_EQ = |- !m n p. (m + p = n + p) = (m = n) Theorem RIGHT_ADD_DISTRIB autoloading from theory `arithmetic` ... RIGHT_ADD_DISTRIB = |- !m n p. (m + n) * p = (m * p) + (n * p) Theorem DIV_UNIQUE autoloading from theory `arithmetic` ... DIV_UNIQUE = |- !n k q. (?r. (k = (q * n) + r) /\ r < n) ==> (k DIV n = q) Theorem MOD_MULT autoloading from theory `arithmetic` ... MOD_MULT = |- !n r. r < n ==> (!q. ((q * n) + r) MOD n = r) Theorem DIV_MULT autoloading from theory `arithmetic` ... DIV_MULT = |- !n r. r < n ==> (!q. ((q * n) + r) DIV n = q) fast_div_mod = - : (int -> int -> (thm # thm)) basen_add_basecase = |- !r. ((BASEN r[]) + (BASEN r[]) = BASEN r[0]) /\ (LENGTH[] = LENGTH[]) /\ (LENGTH[] = LENGTH[]) Theorem MULT_ASSOC autoloading from theory `arithmetic` ... MULT_ASSOC = |- !m n p. m * (n * p) = (m * n) * p Definition EXP autoloading from theory `arithmetic` ... EXP = |- (!m. m EXP 0 = 1) /\ (!m n. m EXP (SUC n) = m * (m EXP n)) basen_add_step_lemma = |- !r. 0 < r ==> (!x y xs ys z zs. ((BASEN r xs) + (BASEN r ys) = BASEN r(CONS z zs)) /\ (LENGTH xs = LENGTH ys) /\ (LENGTH xs = LENGTH zs) ==> ((BASEN r(CONS x xs)) + (BASEN r(CONS y ys)) = BASEN r(CONS(((x + y) + z) DIV r)(CONS(((x + y) + z) MOD r)zs))) /\ (LENGTH(CONS x xs) = LENGTH(CONS y ys)) /\ (LENGTH(CONS x xs) = LENGTH(CONS(((x + y) + z) MOD r)zs))) PURE_BASEN_ADD_CONV = - : conv BASEN_ADD_CONV = - : conv Theorem ADD_0 autoloading from theory `arithmetic` ... ADD_0 = |- !m. m + 0 = m Theorem ADD1 autoloading from theory `arithmetic` ... ADD1 = |- !m. SUC m = m + 1 PURE_BASEN_SUC_CONV = - : conv BASEN_SUC_CONV = - : conv Theorem SUB_EQ_0 autoloading from theory `arithmetic` ... SUB_EQ_0 = |- !m n. (m - n = 0) = m <= n Theorem SUB_EQUAL_0 autoloading from theory `arithmetic` ... SUB_EQUAL_0 = |- !c. c - c = 0 BASEN_SUB_CONV = - : conv Theorem PRE_SUB1 autoloading from theory `arithmetic` ... PRE_SUB1 = |- !m. PRE m = m - 1 PURE_BASEN_PRE_CONV = - : conv BASEN_PRE_CONV = - : conv basen_mul_basecase = |- !r n. ((BASEN r[]) * (BASEN r[n]) = BASEN r[0]) /\ (LENGTH[] = LENGTH[]) Theorem MULT_SYM autoloading from theory `arithmetic` ... MULT_SYM = |- !m n. m * n = n * m Theorem BASEN_DIGIT_EQ_DIGIT autoloading from theory `numeral` ... BASEN_DIGIT_EQ_DIGIT = |- !r e. BASEN r[e] = e basen_mul_step_lemma = |- !r. (0 < r = T) ==> (!n x xs y ys. ((BASEN r xs) * (BASEN r[n]) = BASEN r(CONS y ys)) /\ (LENGTH xs = LENGTH ys) ==> ((BASEN r(CONS x xs)) * (BASEN r[n]) = BASEN r(CONS(((n * x) + y) DIV r)(CONS(((n * x) + y) MOD r)ys))) /\ (LENGTH(CONS x xs) = LENGTH(CONS(((n * x) + y) MOD r)ys))) PURE_BASEN_MUL_BY_DIGIT_CONV = - : conv basen_mul_sum_basecase = |- !r x. BASEN r[BASEN r x] = BASEN r x basen_mul_sum_step_lemma = |- !r x1 x2 xs. BASEN r(CONS(BASEN r x1)(CONS(BASEN r x2)xs)) = BASEN r(CONS(((BASEN r x1) * r) + (BASEN r x2))xs) Theorem LEFT_ADD_DISTRIB autoloading from theory `arithmetic` ... LEFT_ADD_DISTRIB = |- !m n p. p * (m + n) = (p * m) + (p * n) Theorem BASEN_SNOC autoloading from theory `numeral` ... BASEN_SNOC = |- !r e l. BASEN r(SNOC e l) = ((BASEN r l) * r) + e basen_extend_mul_lemma = |- !x r y more_zs. (x * (BASEN r[y]) = BASEN r more_zs) ==> (!ys zs. (x * (BASEN r ys) = BASEN r zs) ==> (x * (BASEN r(SNOC y ys)) = BASEN r[BASEN r zs;BASEN r more_zs])) PURE_BASEN_MUL_EXTEND_RULE = - : (term -> thm -> thm) basen_mul_combine_pps_basecase = |- !r y. (BASEN r[BASEN r[];BASEN r[y]] = BASEN r[0;y]) /\ (LENGTH[y] = SUC(LENGTH[])) /\ (LENGTH[y] = SUC(LENGTH[])) basen_mul_combine_pps_step_lemma = |- !r. 0 < r ==> (!x y xs ys z zs. (BASEN r[BASEN r xs;BASEN r ys] = BASEN r(CONS z zs)) /\ (LENGTH ys = SUC(LENGTH xs)) /\ (LENGTH zs = SUC(LENGTH xs)) ==> (BASEN r[BASEN r(CONS x xs);BASEN r(CONS y ys)] = BASEN r(CONS(((x + y) + z) DIV r)(CONS(((x + y) + z) MOD r)zs))) /\ (LENGTH(CONS y ys) = SUC(LENGTH(CONS x xs))) /\ (LENGTH(CONS(((x + y) + z) MOD r)zs) = SUC(LENGTH(CONS x xs)))) PURE_BASEN_MUL_COMBINE_PPS_CONV = - : conv BASEN_MUL_COMBINE_PPS_CONV = - : conv BASEN_MUL_EXTEND_RULE = - : (term -> thm -> thm) basen_mul_basecase = |- !r x. x * (BASEN r[]) = BASEN r[] BASEN_MUL_SNOC_CONV = - : conv STEP_BASEN_MUL_CONV = - : conv Theorem INV_SUC_EQ autoloading from theory `prim_rec` ... INV_SUC_EQ = |- !m n. (SUC m = SUC n) = (m = n) Theorem LENGTH_MAP autoloading from theory `list` ... LENGTH_MAP = |- !l f. LENGTH(MAP f l) = LENGTH l Theorem BASEN_APPEND autoloading from theory `numeral` ... BASEN_APPEND = |- !r l m. BASEN r(APPEND l m) = ((r EXP (LENGTH m)) * (BASEN r l)) + (BASEN r m) Definition MAP autoloading from theory `list` ... MAP = |- (!f. MAP f[] = []) /\ (!f h t. MAP f(CONS h t) = CONS(f h)(MAP f t)) BASEN_MUL_CONV = - : conv LESS_DIV = |- !n k. k < n ==> (k DIV n = 0) Theorem LESS_MOD autoloading from theory `arithmetic` ... LESS_MOD = |- !n k. k < n ==> (k MOD n = k) LESS_DIV_MOD = |- !n k. k < n ==> (k DIV n = 0) /\ (k MOD n = k) less_divmod_thm = |- !dividend divisor r. ((BASEN r[]) * divisor) + dividend = dividend basen_divmod_conv = - : (term -> conv) BASEN_DIV_CONV = - : conv Theorem MOD_UNIQUE autoloading from theory `arithmetic` ... MOD_UNIQUE = |- !n k r. (?q. (k = (q * n) + r) /\ r < n) ==> (k MOD n = r) BASEN_MOD_CONV = - : conv Theorem EXP_ADD autoloading from theory `arithmetic` ... EXP_ADD = |- !p q n. n EXP (p + q) = (n EXP p) * (n EXP q) BASEN_EXP_CONV = - : conv BASEN_CONV = - : conv BASEN_OF_NUM_CONV = - : (term -> conv) NUM_ARITH_CONV = - : conv NUM_ARITH_RULE = - : (thm -> thm) NUM_ARITH_TAC = - : tactic Calling Lisp compiler File numeral_rules compiled () : void #rm -f dummy.th make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/ind_defs' echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `ind-defs`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool mk_predv = - : (term list -> term) checkfilter = - : (* list -> * list -> * list -> * list) checkside = - : (term -> term -> term) mk_mk_pred = - : ((term # term list # term list) -> (term # term # (term -> term))) make_rule = - : ((term # term # term list # (term -> term)) -> goal -> term) make_definition = - : ((term # term list) -> goal list -> term) derive_induction = - : conv usedef = - : ((term list # thm) -> ((thm -> thm) # conv)) eximp = - : (term list -> thm -> (term # thm)) derive_rule = - : (term -> ((thm -> thm) # conv) -> thm -> thm) derive_rules = - : conv prove_inductive_relation_exists = - : ((term # term list) -> goal list -> thm) - : ((term # term list) -> goal list -> thm) prove_inductive_relation_exists = - : ((term # term list) -> goal list -> thm) new_inductive_definition = - : (bool -> string -> (term # term list) -> goal list -> (thm list # thm)) simp_axiom = - : ((thm # term) -> thm) reduce_asm = - : (term -> conv) prove_asm = - : (term -> conv) simp_concl = - : (thm -> conv) simp_rule = - : ((thm # term) -> thm) simp = - : ((thm # term) -> thm) derive_strong_induction = - : ((thm list # thm) -> thm) - : ((thm list # thm) -> thm) derive_strong_induction = - : ((thm list # thm) -> thm) MK_CONJ_THEN = - : (term -> term -> thm_tactic -> thm_tactical) MK_CHOOSE_THEN = - : (term -> * list -> term -> thm_tactic -> thm_tactical) MK_THEN = - : (term -> term -> thm_tactic -> thm_tactical) TACF = - : (term -> term -> thm_tactic -> thm_tactic -> tactic) TACS = - : (term -> term -> thm_tactic -> thm_tactic -> tactic list) mkred = - : (term -> term list -> conv) RED_CASE = - : (term -> term -> conv) APPLY_CASE = - : (conv list -> conv) RED_WHERE = - : (term -> term -> conv) is_param = - : (* list -> (* # *) list -> * -> bool) RULE_INDUCT_THEN = - : (thm -> thm_tactic -> thm_tactic -> tactic) - : (thm -> thm_tactic -> thm_tactic -> tactic) RULE_INDUCT_THEN = - : (thm -> thm_tactic -> thm_tactic -> tactic) axiom_tac = - : thm_tactic prove_conj = - : (thm list -> conv) RULE_TAC = - : thm_tactic - : thm_tactic RULE_TAC = - : thm_tactic reduce = - : (term list -> thm list -> thm list -> (term # term) list -> (thm list # (term # term) list)) REDUCE = - : conv - : conv REDUCE = - : conv MATCH_MP = - : (thm -> thm -> thm) LIST_NOT_FORALL = - : ((thm -> (thm # *)) -> thm -> (thm # *)) simp_axiom = - : ((thm -> thm -> thm) -> term list -> thm -> thm -> (thm # thm)) crul = - : (term -> thm -> thm) CONJ_RUL = - : (term -> thm -> thm) LIST_EXISTS_THEN = - : ((thm -> thm) -> thm -> thm) RULE = - : (thm -> thm -> thm) EXISTS_IMP2 = - : (term -> thm -> thm) efn = - : (term -> thm -> thm) RULE2 = - : (* -> thm -> thm -> thm) NOT_NOT = - : (thm -> thm) simp_rule = - : ((thm -> thm -> thm) -> term -> term list -> thm -> thm -> (thm # thm)) simp = - : (term -> (thm -> thm -> thm) -> thm -> thm -> (thm # thm)) LIST_DE_MORGAN = - : ((* -> thm -> (thm # thm)) -> * list -> thm -> (thm # thm)) derive_cases_thm = - : ((thm list # thm) -> thm) - : ((thm list # thm) -> thm) derive_cases_thm = - : ((thm list # thm) -> thm) Calling Lisp compiler File ind-defs compiled () : void #echo 'set_flag(`abort_when_fail`,true);;'\ 'compilet `ind_defs`;;'\ 'quit();;' | /build/reproducible-path/hol88-2.02.19940316dfsg/hol =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #false : bool () : void Calling Lisp compiler File ind_defs compiled () : void #===> library ind_defs rebuilt make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/ind_defs' =======> library rebuilt make[3]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library' date Mon Aug 25 22:22:17 2025 make[2]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg' date Mon Aug 25 22:22:17 2025 make permissions make[2]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg' find $(ls -1 | grep -v debian) \ \( -type d -exec chmod 775 {} \; \) -o\ \( -type f -exec chmod 664 {} \; \) for f in hol hol-lcf basic-hol Manual/LaTeX/makeindex Manual/LaTeX/makeindex.bin/*/makeindex Manual/Reference/bin/mktex Manual/Reference/bin/typecheck ; do\ ( if [ -f $f ] ; then\ find $f -exec chmod 775 {} \; ;fi) ; \ done make[2]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg' =======> hol Version 2.02 (GCL) and libraries made make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg' find -name "raw_*_map" -exec rm {} \; for i in $(find -maxdepth 1 -name "*hol*"); do \ printf 'install `'/usr/share/hol88-2.02.19940316dfsg'`;;\nlisp `(ml-save "foo")`;;\n' | ./$i &&\ mv foo $i; done HOL-LCF version 2.02 (GCL) created 25/8/25 #HOL installed (`/usr/share/hol88-2.02.19940316dfsg`) () : void # BASIC-HOL version 2.02 (GCL) created 25/8/25 #HOL installed (`/usr/share/hol88-2.02.19940316dfsg`) () : void # =============================================================================== HOL88 Version 2.02 (GCL), built on 25/8/25 =============================================================================== #HOL installed (`/usr/share/hol88-2.02.19940316dfsg`) () : void #touch build-arch-stamp find -maxdepth 1 -name "*hol*" | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/lib/hol88-2.02.19940316dfsg/%s\n",$1,a);}' >>debian/hol88.install echo debian/hol88.sh usr/bin >>debian/hol88.install find Library -name "*.o" | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/lib/hol88-2.02.19940316dfsg/%s\n",$1,a);}' >>debian/hol88-library.install find * -maxdepth 0 -name "*hol*" | awk '{printf("/usr/lib/hol88-2.02.19940316dfsg/%s usr/share/hol88-2.02.19940316dfsg/%s\n",$1,$1);}' >>debian/hol88.links find Library -name "*.o" | awk '{printf("/usr/lib/hol88-2.02.19940316dfsg/%s usr/share/hol88-2.02.19940316dfsg/%s\n",$1,$1);}' >>debian/hol88-library.links echo "#!/bin/bash" >debian/hol88.sh echo >>debian/hol88.sh echo "exec /usr/lib/hol88-2.02.19940316dfsg/hol" >>debian/hol88.sh chmod 755 debian/hol88.sh dh_testdir dh_testroot dh_prep -a -X./ml/site.ml.orig -X./contrib/tooltool/Makefile.orig \ -X./contrib/tooltool/events.c.orig -X./contrib/tooltool/func_fix.c.orig \ -X./contrib/tooltool/lex.c.orig -X./contrib/tooltool/parse.y.orig \ -X./contrib/tooltool/patchlevel.h.orig -X./contrib/tooltool/windows.c.orig \ -X./contrib/Xhelp/hol_apro.orig -X./contrib/Xhelp/hol_ref.orig \ -X./contrib/Xhelp/xholhelp.h.orig -X./contrib/Xhelp/hol_thm.orig dh_installdirs -a dh_install -a mv debian/hol88/usr/bin/hol88.sh debian/hol88/usr/bin/hol88 /usr/bin/make -f debian/rules DH_OPTIONS=-a binary-common make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg' dh_testdir dh_testroot dh_installchangelogs dh_installdocs dh_installexamples dh_installman dh_lintian dh_link dh_strip dh_compress dh_fixperms dh_makeshlibs dh_installdeb dh_shlibdeps dpkg-shlibdeps: warning: diversions involved - output may be incorrect diversion by libtirpc3t64 from: /lib/x86_64-linux-gnu/libtirpc.so.3 dpkg-shlibdeps: warning: diversions involved - output may be incorrect diversion by libtirpc3t64 to: /lib/x86_64-linux-gnu/libtirpc.so.3.usr-is-merged dh_gencontrol dh_md5sums dh_builddeb dpkg-deb: building package 'hol88-library' in '../hol88-library_2.02.19940316dfsg-8_amd64.deb'. dpkg-deb: building package 'hol88' in '../hol88_2.02.19940316dfsg-8_amd64.deb'. make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg' for i in Manual/Tutorial/ack.tex Manual/Reference/ack.tex Manual/Description/ack.tex; do\ ln -snf ../Latex/ack.tex $i ; done for i in $(find Library -name index.tex) Library/pred_sets/Manual/theorems.tex Library/record_proof/Manual/record_proof.ind ; do\ [ -e $i.sve ] || cp $i $i.sve ; done /usr/bin/make -C Manual all make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual' make tutorial;make description; make reference;make libraries;make covers make[2]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual' (cd Tutorial; make all; cd ..) make[3]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Tutorial' make clean; make tutorial; make tutorial make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Tutorial' rm -f *.dvi *.aux *.toc *.log make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Tutorial' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Tutorial' latex tutorial.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./tutorial.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../LaTeX/alltt.sty) (../LaTeX/layout.sty) (../LaTeX/commands.tex) (../LaTeX/pic-macros.tex) (../LaTeX/docmacros.tex) (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file tutorial.aux. (./title.tex (../LaTeX/cover_info.tex The title page being created is a LaTeX approximation of a fancy PostScript cover page. All the fancy cover pages for the HOL Manual may be generated if you have (1) a PostScript printer, (2) the "psfig" TeX macros, and (3) a DVI to PostScript converter that understands these macros. The cover pages may be found in ../LaTeX/Covers, and shoud be made pursuant to the instructions given in ../LaTeX/Covers/READ-ME. ) (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [1] [2]) (./preface.tex LaTeX Warning: Reference `install' on page iii undefined on input line 27. LaTeX Warning: Reference `parity' on page iii undefined on input line 42. [3] LaTeX Warning: Reference `tool' on page iv undefined on input line 50. LaTeX Warning: Reference `binomial' on page iv undefined on input line 55. [4]) [5] No file ack.tex. (./contents.tex [6] No file tutorial.toc. ) [7] (./intro.tex Chapter 1. LaTeX Warning: Reference `performance' on page 1 undefined on input line 11. [1] LaTeX Warning: Reference `ML' on page 2 undefined on input line 105. [2] [3] LaTeX Warning: Reference `build' on page 4 undefined on input line 235. [4] LaTeX Warning: Reference `build' on page 5 undefined on input line 282. [5] [6] [7] [8]) [9] (./ml.tex [10] Chapter 2. Underfull \vbox (badness 1968) has occurred while \output is active [11] LaTeX Warning: Citation `Milner-types' on page 12 undefined on input line 73. LaTeX Warning: Reference `HOLlogic' on page 12 undefined on input line 76. [12] [13]) [14] (./logic.tex Chapter 3. [15] [16] [17] LaTeX Warning: Reference `theories' on page 18 undefined on input line 240. [18] [19] [20] [21] [22] [23] LaTeX Warning: Citation `Principia' on page 24 undefined on input line 644. [24] [25]) [26] (./proof.tex Chapter 4. LaTeX Warning: Reference `forward' on page 27 undefined on input line 49. [27] LaTeX Warning: Reference `tactics' on page 28 undefined on input line 125. LaTeX Warning: Reference `tactics' on page 28 undefined on input line 143. [28] LaTeX Warning: Reference `logic-table' on page 29 undefined on input line 163. [29] [30] [31] [32] LaTeX Warning: Citation `lcp_rewrite' on page 33 undefined on input line 450. [33] LaTeX Warning: Reference `install' on page 34 undefined on input line 520. [34] [35] [36] Chapter 5. [37] [38] [39] LaTeX Warning: Reference `tacticals' on page 40 undefined on input line 881. [40] [41] [42] [43] [44] [45] [46] LaTeX Warning: Citation `lcp_rewrite' on page 47 undefined on input line 1338. [47] [48] [49]) [50] (./parity.tex Chapter 6. LaTeX Warning: Reference `exercises' on page 51 undefined on input line 43. [51] [52] [53] [54] Underfull \vbox (badness 10000) has occurred while \output is active [55] LaTeX Warning: Citation `Why-HOL-paper' on page 56 undefined on input line 378. [56] LaTeX Warning: Citation `Camilleri-et-al' on page 57 undefined on input line 45 5. LaTeX Warning: Citation `Why-HOL-paper' on page 57 undefined on input line 455. [57] [58] [59] [60] [61] [62] LaTeX Warning: Reference `implementation' on page 63 undefined on input line 83 5. LaTeX Warning: Reference `parity-imp' on page 63 undefined on input line 864. [63] LaTeX Warning: Reference `implementation' on page 64 undefined on input line 88 6. ) [64] (./tool.tex Chapter 7. LaTeX Warning: Reference `bogus-optimization' on page 65 undefined on input lin e 25. [65] [66] LaTeX Warning: Citation `lcp_rewrite' on page 67 undefined on input line 125. Overfull \hbox (6.5514pt too wide) in paragraph at lines 143--149 \OT1/cmr/m/n/10.95 This takes an equa-tion []\OT1/cmtt/m/n/10.95 |- $\OML/cmm/m /it/10.95 t[]$[] \OT1/cmtt/m/n/10.95 = $\OML/cmm/m/it/10.95 t[]$ \OT1/cmr/m/n/1 0.95 and gen-er-ates a con-ver-sion ([] ML func-tion of type []\OT1/cmtt/m/n/10 .95 term->thm\OT1/cmr/m/n/10.95 ) [67] [68] [69] [70] [71] LaTeX Warning: Citation `FOL' on page 72 undefined on input line 496. LaTeX Warning: Citation `BoyerMoore' on page 72 undefined on input line 496. LaTeX Warning: Citation `Nuprl' on page 72 undefined on input line 497. [72] [73] [74] LaTeX Warning: Reference `EQTAC' on page 75 undefined on input line 642. LaTeX Warning: Reference `DISCHTAC' on page 75 undefined on input line 659. LaTeX Warning: Reference `CONJTAC' on page 75 undefined on input line 662. LaTeX Warning: Reference `THEN' on page 75 undefined on input line 679. Underfull \vbox (badness 2126) has occurred while \output is active [75] LaTeX Warning: Reference `ACCEPTTAC' on page 76 undefined on input line 739. Overfull \hbox (13.11166pt too wide) in paragraph at lines 738--743 \OT1/cmr/m/n/10.95 Among the in-di-vid-ual con-juncts is the goal, which can th us be solved im-me-di-ately us-ing [] [76] [77] [78] [79] [80] [81] [82] [83] [84]) [85] (./binomial.tex [86] Chapter 8. (./binomial/binomial.tex LaTeX Warning: Citation `knuth73' on page 87 undefined on input line 33. LaTeX Warning: Citation `knuth73' on page 87 undefined on input line 54. LaTeX Warning: Citation `maclane67' on page 87 undefined on input line 56. LaTeX Warning: Citation `mostow63' on page 87 undefined on input line 56. [87] LaTeX Warning: Reference `BinomialCoefficients' on page 88 undefined on input l ine 134. LaTeX Warning: Reference `MonoidsGroupsRings' on page 88 undefined on input lin e 138. LaTeX Warning: Reference `PowersReductionsRangesSums' on page 88 undefined on i nput line 142. [88] LaTeX Warning: Reference `BinomialTheorem' on page 89 undefined on input line 1 49. LaTeX Warning: Reference `BinomialTheoremForIntegers' on page 89 undefined on i nput line 152. LaTeX Warning: Reference `PrincipalLemmas' on page 89 undefined on input line 1 55. [89] Overfull \hbox (10.21169pt too wide) in paragraph at lines 215--220 \OT1/cmr/m/n/10.95 tional op-er-a-tor, which makes rewrit-ing dif-fi-cult. But hav-ing ob-tained the the-o-rem []\OT1/cmtt/m/n/10.95 RAW_CHOOSE_DEF [90] [91] [92] [93] LaTeX Warning: Reference `BinomialTheoremForIntegers' on page 94 undefined on i nput line 553. [94] LaTeX Warning: Reference `PrincipalLemmas' on page 95 undefined on input line 5 95. [95] LaTeX Warning: Reference `PrincipalLemmas' on page 96 undefined on input line 6 82. LaTeX Warning: Reference `BinomialCoefficients' on page 96 undefined on input l ine 700. [96] LaTeX Warning: Reference `PrincipalLemmas' on page 97 undefined on input line 7 27. LaTeX Warning: Reference `PrincipalLemmas' on page 97 undefined on input line 7 60. [97] LaTeX Warning: Reference `PrincipalLemmas' on page 98 undefined on input line 7 71. [98] LaTeX Warning: Reference `PrincipalLemmas' on page 99 undefined on input line 8 48. [99]) (./binomial/appendix.tex Overfull \hbox (41.94073pt too wide) in paragraph at lines 967--3 []\OT1/cmr/m/n/10.95 To see how to do so for Elsa Gunter's the-ory of in-te-ger s, take a look at the file \OT1/cmtt/m/n/10.95 mk[]BINOMIAL[]integer.ml\OT1/cmr /m/n/10.95 , [100] [101] [102])) [103] (./references.tex [104]) [105] (./tutorial.aux (./title.aux) (./preface.aux) (./ack.aux) (./contents.aux ) (./intro.aux) (./ml.aux) (./logic.aux) (./proof.aux) (./parity.aux) (./tool.aux) (./binomial.aux) (./references.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) (\end occurred inside a group at level 1) ### simple group (level 1) entered at line 168 ({) ### bottom level (see the transcript file for additional information) Output written on tutorial.dvi (112 pages, 316556 bytes). Transcript written on tutorial.log. make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Tutorial' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Tutorial' latex tutorial.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./tutorial.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../LaTeX/alltt.sty) (../LaTeX/layout.sty) (../LaTeX/commands.tex) (../LaTeX/pic-macros.tex) (../LaTeX/docmacros.tex) (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./tutorial.aux (./title.aux) (./preface.aux) (./ack.aux) (./contents.aux) (./intro.aux) (./ml.aux) (./logic.aux) (./proof.aux) (./parity.aux) (./tool.aux ) (./binomial.aux) (./references.aux)) (./title.tex (../LaTeX/cover_info.tex The title page being created is a LaTeX approximation of a fancy PostScript cover page. All the fancy cover pages for the HOL Manual may be generated if you have (1) a PostScript printer, (2) the "psfig" TeX macros, and (3) a DVI to PostScript converter that understands these macros. The cover pages may be found in ../LaTeX/Covers, and shoud be made pursuant to the instructions given in ../LaTeX/Covers/READ-ME. ) (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [1] [2]) (./preface.tex [3] [4]) [5] No file ack.tex. (./contents.tex [6] (./tutorial.toc [7] [8])) [9] (./intro.tex Chapter 1. [1] [2] [3] [4] [5] [6] [7] [8]) [9] (./ml.tex [10] Chapter 2. Underfull \vbox (badness 1968) has occurred while \output is active [11] [12] [13]) [14] (./logic.tex Chapter 3. [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25]) [26] (./proof.tex Chapter 4. [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] Chapter 5. [37] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47] [48] [49]) [50] (./parity.tex Chapter 6. [51] [52] [53] [54] Underfull \vbox (badness 10000) has occurred while \output is active [55] [56] [57] [58] [59] [60] [61] [62] [63]) [64] (./tool.tex Chapter 7. [65] [66] Overfull \hbox (6.5514pt too wide) in paragraph at lines 143--149 \OT1/cmr/m/n/10.95 This takes an equa-tion []\OT1/cmtt/m/n/10.95 |- $\OML/cmm/m /it/10.95 t[]$[] \OT1/cmtt/m/n/10.95 = $\OML/cmm/m/it/10.95 t[]$ \OT1/cmr/m/n/1 0.95 and gen-er-ates a con-ver-sion ([] ML func-tion of type []\OT1/cmtt/m/n/10 .95 term->thm\OT1/cmr/m/n/10.95 ) [67] [68] [69] [70] [71] [72] [73] [74] Underfull \vbox (badness 2126) has occurred while \output is active [75] Overfull \hbox (13.11166pt too wide) in paragraph at lines 738--743 \OT1/cmr/m/n/10.95 Among the in-di-vid-ual con-juncts is the goal, which can th us be solved im-me-di-ately us-ing [] [76] [77] [78] [79] [80] [81] [82] [83] [84]) [85] (./binomial.tex [86] Chapter 8. (./binomial/binomial.tex [87] [88] [89] Overfull \hbox (10.21169pt too wide) in paragraph at lines 215--220 \OT1/cmr/m/n/10.95 tional op-er-a-tor, which makes rewrit-ing dif-fi-cult. But hav-ing ob-tained the the-o-rem []\OT1/cmtt/m/n/10.95 RAW_CHOOSE_DEF [90] [91] [92] [93] [94] [95] [96] [97] [98] [99]) (./binomial/appendix.tex Overfull \hbox (41.94073pt too wide) in paragraph at lines 967--3 []\OT1/cmr/m/n/10.95 To see how to do so for Elsa Gunter's the-ory of in-te-ger s, take a look at the file \OT1/cmtt/m/n/10.95 mk[]BINOMIAL[]integer.ml\OT1/cmr /m/n/10.95 , [100] [101] [102])) [103] (./references.tex [104]) [105] (./tutorial.aux (./title.aux) (./preface.aux) (./ack.aux) (./contents.aux ) (./intro.aux) (./ml.aux) (./logic.aux) (./proof.aux) (./parity.aux) (./tool.aux) (./binomial.aux) (./references.aux)) ) (\end occurred inside a group at level 1) ### simple group (level 1) entered at line 168 ({) ### bottom level (see the transcript file for additional information) Output written on tutorial.dvi (114 pages, 338300 bytes). Transcript written on tutorial.log. make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Tutorial' make[3]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Tutorial' ====> TUTORIAL made make[2]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual' make[2]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual' (cd Description; make all; cd ..) make[3]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Description' make clean; make description; make index; make description make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Description' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Description' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Description' latex description.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./description.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (/usr/share/texlive/texmf-dist/tex/latex/base/makeidx.sty) (../LaTeX/alltt.sty) (../LaTeX/layout.sty) (../LaTeX/commands.tex) Writing index file description.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file description.aux. (./title.tex (../LaTeX/cover_info.tex The title page being created is a LaTeX approximation of a fancy PostScript cover page. All the fancy cover pages for the HOL Manual may be generated if you have (1) a PostScript printer, (2) the "psfig" TeX macros, and (3) a DVI to PostScript converter that understands these macros. The cover pages may be found in ../LaTeX/Covers, and shoud be made pursuant to the instructions given in ../LaTeX/Covers/READ-ME. ) (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [1] [2]) (./preface.tex LaTeX Warning: Citation `Church' on page iii undefined on input line 31. LaTeX Warning: Citation `Hanna-Daeche' on page iii undefined on input line 34. LaTeX Warning: Citation `Edinburgh-LCF' on page iii undefined on input line 39. [3] LaTeX Warning: Citation `sml' on page iv undefined on input line 68. LaTeX Warning: Citation `new-LCF-man' on page iv undefined on input line 72. LaTeX Warning: Reference `appendix' on page iv undefined on input line 87. [4]) [5] No file ack.tex. (./contents.tex [6] No file description.toc. ) [7] [1] [2] (./ML.tex (./mlpreface.tex Chapter 1. LaTeX Warning: Citation `Edinburgh-LCF' on page 3 undefined on input line 13. LaTeX Warning: Citation `ml-handbook' on page 3 undefined on input line 24. LaTeX Warning: Citation `new-LCF-man' on page 3 undefined on input line 30. LaTeX Warning: Reference `MLsyntax' on page 3 undefined on input line 53. LaTeX Warning: Reference `MLprims' on page 3 undefined on input line 53. LaTeX Warning: Citation `ml-handbook' on page 3 undefined on input line 54. [3] [4]) (./ml1.tex [5] [6] Chapter 2. LaTeX Warning: Reference `MLsyntax' on page 7 undefined on input line 14. LaTeX Warning: Reference `MLsemantics' on page 7 undefined on input line 14. [7] [8] [9] [10] [11] [12] LaTeX Warning: Reference `ML-types' on page 13 undefined on input line 420. [13] [14] [15] [16] [17] [18] [19] [20] [21]) (./ml2.tex [22] Chapter 3. LaTeX Warning: Reference `MLtypeabbrev' on page 23 undefined on input line 16. LaTeX Warning: Reference `ML-concrete-types' on page 23 undefined on input line 17. LaTeX Warning: Reference `ML-abstract-types' on page 23 undefined on input line 18. LaTeX Warning: Reference `ML-ident' on page 23 undefined on input line 29. LaTeX Warning: Reference `ML-types' on page 23 undefined on input line 30. LaTeX Warning: Reference `MLsemantics' on page 23 undefined on input line 40. [23] [24] [25] [26] LaTeX Warning: Reference `HOL-lex' on page 27 undefined on input line 280. [27] [28] LaTeX Warning: Reference `MLprims' on page 29 undefined on input line 507. LaTeX Warning: Reference `MLinfixfns' on page 29 undefined on input line 514. [29]) (./ml3.tex [30] Chapter 4. LaTeX Warning: Reference `ML-concrete-types' on page 31 undefined on input line 14. LaTeX Warning: Reference `ML-declarations' on page 31 undefined on input line 2 7. LaTeX Warning: Reference `ML-expressions' on page 31 undefined on input line 30 . [31] LaTeX Warning: Reference `ML-types' on page 32 undefined on input line 95. LaTeX Warning: Reference `eval-bindings' on page 32 undefined on input line 147 . [32] [33] LaTeX Warning: Reference `matching-patterns' on page 34 undefined on input line 229. [34] LaTeX Warning: Reference `ML-concrete-types' on page 35 undefined on input line 363. [35] LaTeX Warning: Reference `MLprims' on page 36 undefined on input line 398. LaTeX Warning: Reference `eval-bindings' on page 36 undefined on input line 407 . [36] [37]) (./ml4.tex [38] Chapter 5. LaTeX Warning: Reference `ML-intro' on page 39 undefined on input line 46. [39] LaTeX Warning: Reference `MLtypeabbrev' on page 40 undefined on input line 90. LaTeX Warning: Reference `ML-concrete-types' on page 40 undefined on input line 91. LaTeX Warning: Reference `ML-abstract-types' on page 40 undefined on input line 95. LaTeX Warning: Reference `MLtypeabbrev' on page 40 undefined on input line 117. LaTeX Warning: Reference `ML-concrete-types' on page 40 undefined on input line 122. LaTeX Warning: Reference `ML-abstract-types' on page 40 undefined on input line 127. [40] LaTeX Warning: Reference `MLprims' on page 41 undefined on input line 162. [41] [42] LaTeX Warning: Reference `ML-abstract-types' on page 43 undefined on input line 307. LaTeX Warning: Reference `ML-ty-con-discuss' on page 43 undefined on input line 314. LaTeX Warning: Reference `MLprims' on page 43 undefined on input line 341. [43] [44] LaTeX Warning: Reference `ML-concrete-types' on page 45 undefined on input line 433. LaTeX Warning: Reference `ML-abstract-types' on page 45 undefined on input line 433. [45] [46] LaTeX Warning: Reference `avra_theorems' on page 47 undefined on input line 561 . [47] [48] [49]) (./ml5.tex [50] Chapter 6. LaTeX Warning: Reference `MLfuns' on page 51 undefined on input line 6. [51] [52] [53]) (./ml6.tex [54] Chapter 7. [55] [56] [57] [58] [59] [60] [61] [62] [63] [64] [65] [66]) (./ml7.tex [67] [68] Chapter 8. LaTeX Warning: Reference `avramisc' on page 69 undefined on input line 6. [69] [70] [71] LaTeX Warning: Reference `topprint' on page 72 undefined on input line 300. [72] [73] [74] [75] [76] [77] [78] [79] [80] [81] [82] LaTeX Warning: Reference `HOLsyschapter' on page 83 undefined on input line 106 1. LaTeX Warning: Reference `let-exp' on page 83 undefined on input line 1065. LaTeX Warning: Reference `interface' on page 83 undefined on input line 1072. [83] [84] LaTeX Warning: Reference `flags' on page 85 undefined on input line 1235. LaTeX Warning: Reference `change-lambda' on page 85 undefined on input line 123 7. LaTeX Warning: Reference `turnstile' on page 85 undefined on input line 1238. [85] [86] [87] [88] LaTeX Warning: Reference `MLconexp' on page 89 undefined on input line 1499. [89] [90] [91] [92] [93] [94] Underfull \vbox (badness 10000) has occurred while \output is active [95] Underfull \vbox (badness 10000) has occurred while \output is active [96])) [97] [98] [99] [100] (./logic.tex Chapter 9. LaTeX Warning: Citation `Church' on page 101 undefined on input line 14. LaTeX Warning: Reference `MLpart' on page 101 undefined on input line 22. LaTeX Warning: Reference `MLpart' on page 101 undefined on input line 24. [101] [102] LaTeX Warning: Reference `semantics of types' on page 103 undefined on input li ne 196. [103] [104] [105] [106] [107] LaTeX Warning: Reference `term-substitution' on page 108 undefined on input lin e 588. [108] LaTeX Warning: Reference `terms' on page 109 undefined on input line 626. LaTeX Warning: Reference `semantics of types' on page 109 undefined on input li ne 646. [109] LaTeX Warning: Reference `semantics of types' on page 110 undefined on input li ne 688. LaTeX Warning: Reference `instances-and-substitution' on page 110 undefined on input line 717. LaTeX Warning: Reference `instances-and-substitution' on page 110 undefined on input line 725. [110] LaTeX Warning: Reference `LOG' on page 111 undefined on input line 783. [111] LaTeX Warning: Reference `instances-and-substitution' on page 112 undefined on input line 838. [112] [113] LaTeX Warning: Reference `introduction' on page 114 undefined on input line 970 . LaTeX Warning: Reference `defs' on page 114 undefined on input line 987. LaTeX Warning: Citation `Andrews' on page 114 undefined on input line 991. LaTeX Warning: Reference `derived-terms' on page 114 undefined on input line 10 20. ) [114] (./semantics.tex Chapter 10. [115] [116] LaTeX Warning: Reference `rules' on page 117 undefined on input line 179. [117] [118] LaTeX Warning: Reference `INIT' on page 119 undefined on input line 291. LaTeX Warning: Reference `LOG' on page 119 undefined on input line 293. LaTeX Warning: Reference `sequents' on page 119 undefined on input line 316. LaTeX Warning: Reference `term-substitution' on page 119 undefined on input lin e 326. LaTeX Warning: Reference `standard-signatures' on page 119 undefined on input l ine 332. [119] LaTeX Warning: Reference `soundness' on page 120 undefined on input line 378. [120] LaTeX Warning: Reference `defs' on page 121 undefined on input line 504. LaTeX Warning: Reference `INIT' on page 121 undefined on input line 512. LaTeX Warning: Reference `tydefs' on page 121 undefined on input line 513. [121] LaTeX Warning: Reference `semantics of terms' on page 122 undefined on input li ne 519. [122] LaTeX Warning: Reference `standard-signatures' on page 123 undefined on input l ine 646. [123] LaTeX Warning: Reference `soundness' on page 124 undefined on input line 664. LaTeX Warning: Reference `specs' on page 124 undefined on input line 717. LaTeX Warning: Reference `tyspecs' on page 124 undefined on input line 720. [124] LaTeX Warning: Citation `Z' on page 125 undefined on input line 725. LaTeX Warning: Reference `defs' on page 125 undefined on input line 731. LaTeX Warning: Reference `tydefs' on page 125 undefined on input line 733. LaTeX Warning: Reference `LOG' on page 125 undefined on input line 799. [125] LaTeX Warning: Reference `specs' on page 126 undefined on input line 831. LaTeX Warning: Reference `INIT' on page 126 undefined on input line 834. [126] LaTeX Warning: Reference `constants' on page 127 undefined on input line 902. [127] LaTeX Warning: Reference `soundness' on page 128 undefined on input line 975. LaTeX Warning: Reference `LOG' on page 128 undefined on input line 977. LaTeX Warning: Reference `extensions' on page 128 undefined on input line 1012. LaTeX Warning: Reference `term-substitution' on page 128 undefined on input lin e 1019. [128] LaTeX Warning: Reference `defs' on page 129 undefined on input line 1073. LaTeX Warning: Reference `types' on page 129 undefined on input line 1100. [129] LaTeX Warning: Reference `instances-and-substitution' on page 130 undefined on input line 1112. LaTeX Warning: Reference `defs' on page 130 undefined on input line 1118. LaTeX Warning: Reference `specs' on page 130 undefined on input line 1118. LaTeX Warning: Reference `INIT' on page 130 undefined on input line 1148. LaTeX Warning: Reference `prod' on page 130 undefined on input line 1160. [130] LaTeX Warning: Reference `LOG' on page 131 undefined on input line 1212. [131] [132] [133] [134] LaTeX Warning: Reference `soundness' on page 135 undefined on input line 1472. LaTeX Warning: Reference `LOG' on page 135 undefined on input line 1474. LaTeX Warning: Reference `sequents' on page 135 undefined on input line 1475. LaTeX Warning: Reference `term-substitution' on page 135 undefined on input lin e 1483. LaTeX Warning: Reference `LOG' on page 135 undefined on input line 1512. [135] LaTeX Warning: Reference `tydefs' on page 136 undefined on input line 1562. ) [136] [137] [138] (./system.tex Chapter 11. LaTeX Warning: Reference `avra_terms' on page 139 undefined on input line 5. LaTeX Warning: Reference `quotation' on page 139 undefined on input line 6. LaTeX Warning: Reference `avra_theorems' on page 139 undefined on input line 7. LaTeX Warning: Reference `theoryfns' on page 139 undefined on input line 8. LaTeX Warning: Reference `HOL-theory' on page 139 undefined on input line 9. LaTeX Warning: Reference `rules' on page 139 undefined on input line 9. LaTeX Warning: Reference `HOL-ancestry' on page 139 undefined on input line 10. LaTeX Warning: Reference `types-package' on page 139 undefined on input line 11 . LaTeX Warning: Reference `HOLflags' on page 139 undefined on input line 12. LaTeX Warning: Reference `types' on page 139 undefined on input line 17. LaTeX Warning: Reference `terms' on page 139 undefined on input line 18. LaTeX Warning: Reference `ident' on page 139 undefined on input line 45. LaTeX Warning: Reference `tyvars' on page 139 undefined on input line 53. LaTeX Warning: Reference `MLpart' on page 139 undefined on input line 55. [139] [140] [141] LaTeX Warning: Reference `theoryfns' on page 142 undefined on input line 215. LaTeX Warning: Reference `types' on page 142 undefined on input line 243. LaTeX Warning: Reference `boolthy' on page 142 undefined on input line 260. LaTeX Warning: Reference `quotation' on page 142 undefined on input line 287. LaTeX Warning: Reference `terms' on page 142 undefined on input line 296. LaTeX Warning: Reference `derived-terms' on page 142 undefined on input line 29 8. [142] LaTeX Warning: Reference `theoryfns' on page 143 undefined on input line 301. LaTeX Warning: Reference `theoryfns' on page 143 undefined on input line 332. [143] LaTeX Warning: Reference `quotation' on page 144 undefined on input line 397. [144] LaTeX Warning: Reference `stickytypes' on page 145 undefined on input line 510. [145] [146] LaTeX Warning: Reference `theoryfns' on page 147 undefined on input line 630. LaTeX Warning: Reference `conditionals' on page 147 undefined on input line 723 . LaTeX Warning: Reference `let-exp' on page 147 undefined on input line 723. [147] [148] LaTeX Warning: Reference `hol-init' on page 149 undefined on input line 875. [149] [150] LaTeX Warning: Reference `boolthy' on page 151 undefined on input line 989. [151] LaTeX Warning: Reference `prod' on page 152 undefined on input line 1033. LaTeX Warning: Reference `flags' on page 152 undefined on input line 1072. [152] LaTeX Warning: Reference `genbeta' on page 153 undefined on input line 1131. [153] LaTeX Warning: Reference `let-terms' on page 154 undefined on input line 1211. [154] [155] [156] LaTeX Warning: Reference `logic' on page 157 undefined on input line 1481. [157] LaTeX Warning: Reference `logic' on page 158 undefined on input line 1511. LaTeX Warning: Reference `rules' on page 158 undefined on input line 1566. LaTeX Warning: Reference `derived-rules' on page 158 undefined on input line 15 67. [158] LaTeX Warning: Reference `logic' on page 159 undefined on input line 1569. LaTeX Warning: Reference `boolthy' on page 159 undefined on input line 1575. LaTeX Warning: Reference `ind' on page 159 undefined on input line 1575. LaTeX Warning: Reference `HOL-theory' on page 159 undefined on input line 1578. LaTeX Warning: Reference `logic' on page 159 undefined on input line 1582. LaTeX Warning: Reference `logic' on page 159 undefined on input line 1624. LaTeX Warning: Reference `logic' on page 159 undefined on input line 1638. [159] LaTeX Warning: Reference `typeabbrev' on page 160 undefined on input line 1663. LaTeX Warning: Reference `avra_definitional' on page 160 undefined on input lin e 1664. LaTeX Warning: Reference `extensions' on page 160 undefined on input line 1668. [160] LaTeX Warning: Reference `HOL-theory' on page 161 undefined on input line 1728. [161] [162] LaTeX Warning: Reference `defs' on page 163 undefined on input line 1889. LaTeX Warning: Reference `defs' on page 163 undefined on input line 1910. [163] LaTeX Warning: Reference `specs' on page 164 undefined on input line 1997. [164] [165] LaTeX Warning: Reference `tydefs' on page 166 undefined on input line 2143. [166] [167] [168] LaTeX Warning: Reference `theoryprims' on page 169 undefined on input line 2397 . [169] LaTeX Warning: Reference `HOL-ancestry' on page 170 undefined on input line 247 7. LaTeX Warning: Reference `rules' on page 170 undefined on input line 2488. LaTeX Warning: Citation `Church' on page 170 undefined on input line 2494. LaTeX Warning: Citation `Church' on page 170 undefined on input line 2515. LaTeX Warning: Citation `Leisenring' on page 170 undefined on input line 2516. LaTeX Warning: Citation `Andrews' on page 170 undefined on input line 2517. [170] LaTeX Warning: Reference `ind' on page 171 undefined on input line 2600. LaTeX Warning: Reference `let' on page 171 undefined on input line 2605. [171] LaTeX Warning: Reference `res-quant' on page 172 undefined on input line 2628. LaTeX Warning: Reference `ind' on page 172 undefined on input line 2650. LaTeX Warning: Reference `boolfull' on page 172 undefined on input line 2664. LaTeX Warning: Reference `rules' on page 172 undefined on input line 2674. LaTeX Warning: Reference `HOLrules' on page 172 undefined on input line 2703. LaTeX Warning: Reference `HOLrules' on page 172 undefined on input line 2712. [172] LaTeX Warning: Reference `HOLrules' on page 173 undefined on input line 2730. [173] [174] [175] [176] [177] LaTeX Warning: Reference `boolthy' on page 178 undefined on input line 3177. [178] LaTeX Warning: Reference `conditionals' on page 179 undefined on input line 322 0. LaTeX Warning: Reference `let-exp' on page 179 undefined on input line 3221. LaTeX Warning: Reference `HOL-varstruct' on page 179 undefined on input line 32 23. LaTeX Warning: Reference `res-quant' on page 179 undefined on input line 3229. LaTeX Warning: Reference `type-defs' on page 179 undefined on input line 3231. LaTeX Warning: Reference `prod' on page 179 undefined on input line 3238. [179] LaTeX Warning: Reference `INIT' on page 180 undefined on input line 3400. LaTeX Warning: Reference `type-defs' on page 180 undefined on input line 3404. [180] [181] [182] LaTeX Warning: Reference `conspec' on page 183 undefined on input line 3579. [183] LaTeX Warning: Reference `conspec' on page 184 undefined on input line 3640. [184] LaTeX Warning: Reference `prim-rec-defs' on page 185 undefined on input line 37 20. [185] LaTeX Warning: Citation `HOL-paper' on page 186 undefined on input line 3818. LaTeX Warning: Citation `Melham-banff' on page 186 undefined on input line 3818 . [186] LaTeX Warning: Reference `num-prim-rec' on page 187 undefined on input line 388 2. LaTeX Warning: Reference `num-prim-rec' on page 187 undefined on input line 390 0. [187] [188] LaTeX Warning: Reference `hidden' on page 189 undefined on input line 4045. LaTeX Warning: Reference `types-package' on page 189 undefined on input line 40 61. LaTeX Warning: Citation `Melham-banff' on page 189 undefined on input line 4067 . [189] LaTeX Warning: Reference `types-package' on page 190 undefined on input line 41 82. LaTeX Warning: Citation `Melham-banff' on page 190 undefined on input line 4187 . [190] LaTeX Warning: Citation `Melham-banff' on page 191 undefined on input line 4202 . [191] LaTeX Warning: Reference `tydefs' on page 192 undefined on input line 4308. LaTeX Warning: Reference `type-defs' on page 192 undefined on input line 4308. [192] LaTeX Warning: Citation `Melham-banff' on page 193 undefined on input line 4373 . LaTeX Warning: Citation `sml' on page 193 undefined on input line 4403. [193] [194] LaTeX Warning: Citation `goguen' on page 195 undefined on input line 4503. [195] LaTeX Warning: Reference `prim_rec' on page 196 undefined on input line 4613. [196] LaTeX Warning: Reference `define-type-output' on page 197 undefined on input li ne 4655. LaTeX Warning: Reference `num-prim-rec' on page 197 undefined on input line 466 4. LaTeX Warning: Reference `prim_rec' on page 197 undefined on input line 4678. [197] LaTeX Warning: Reference `conspec' on page 198 undefined on input line 4740. LaTeX Warning: Reference `num-prim-rec' on page 198 undefined on input line 474 8. LaTeX Warning: Reference `define-type-example' on page 198 undefined on input l ine 4771. [198] LaTeX Warning: Reference `types-session' on page 199 undefined on input line 47 78. [199] LaTeX Warning: Reference `types-session' on page 200 undefined on input line 48 57. [200] LaTeX Warning: Reference `types-session' on page 201 undefined on input line 49 19. LaTeX Warning: Reference `tactics-and-tacticals' on page 201 undefined on input line 4961. LaTeX Warning: Reference `tactics' on page 201 undefined on input line 4963. LaTeX Warning: Reference `asm-manip' on page 201 undefined on input line 4964. LaTeX Warning: Reference `avra_manip1' on page 201 undefined on input line 4964 . LaTeX Warning: Reference `avra_builtin' on page 201 undefined on input line 496 5. [201] LaTeX Warning: Reference `tactics-and-tacticals' on page 202 undefined on input line 4983. LaTeX Warning: Reference `tactics-and-tacticals' on page 202 undefined on input line 5057. [202] [203] LaTeX Warning: Reference `sysfuns' on page 204 undefined on input line 5168. [204] LaTeX Warning: Reference `sysfuns' on page 205 undefined on input line 5198. [205] [206] [207] LaTeX Warning: Reference `theoryfns' on page 208 undefined on input line 5498. [208] [209] [210] [211] [212] [213] LaTeX Warning: Reference `pretty-print' on page 214 undefined on input line 590 1. [214] LaTeX Warning: Reference `flags' on page 215 undefined on input line 5941. ) [215] [216] [217] [218] (./drules.tex Chapter 12. LaTeX Warning: Reference `logic' on page 219 undefined on input line 4. LaTeX Warning: Reference `logic' on page 219 undefined on input line 12. LaTeX Warning: Reference `rules' on page 219 undefined on input line 19. LaTeX Warning: Reference `HOL-ancestry' on page 219 undefined on input line 36. [219] LaTeX Warning: Reference `topprint' on page 220 undefined on input line 64. LaTeX Warning: Reference `flags' on page 220 undefined on input line 83. [220] LaTeX Warning: Reference `flags' on page 221 undefined on input line 158. [221] LaTeX Warning: Reference `avra_standard' on page 222 undefined on input line 20 4. LaTeX Warning: Reference `avra_gen' on page 222 undefined on input line 244. LaTeX Warning: Reference `avra_spec' on page 222 undefined on input line 245. LaTeX Warning: Reference `avra_conv' on page 222 undefined on input line 249. [222] LaTeX Warning: Reference `boolthy' on page 223 undefined on input line 330. [223] LaTeX Warning: Reference `avra_T' on page 224 undefined on input line 338. LaTeX Warning: Reference `avra_conv' on page 224 undefined on input line 347. LaTeX Warning: Reference `semantics' on page 224 undefined on input line 371. LaTeX Warning: Reference `avra_conv' on page 224 undefined on input line 376. [224] LaTeX Warning: Reference `avra_conv' on page 225 undefined on input line 437. [225] [226] [227] [228] [229] [230] [231] [232] [233] [234] [235] [236] [237]) [238] (./conv.tex Chapter 13. LaTeX Warning: Reference `avra_standard' on page 239 undefined on input line 53 . LaTeX Warning: Reference `avra1' on page 239 undefined on input line 58. LaTeX Warning: Reference `avra2' on page 239 undefined on input line 58. LaTeX Warning: Citation `lcp_rewrite' on page 239 undefined on input line 60. LaTeX Warning: Citation `new-LCF-man' on page 239 undefined on input line 60. LaTeX Warning: Reference `avra_standard' on page 239 undefined on input line 65 . [239] LaTeX Warning: Reference `avra3' on page 240 undefined on input line 122. LaTeX Warning: Reference `avra_rewrite' on page 240 undefined on input line 123 . LaTeX Warning: Reference `tactics-and-tacticals' on page 240 undefined on input line 124. LaTeX Warning: Reference `avra3' on page 240 undefined on input line 126. [240] [241] LaTeX Warning: Reference `tactics-and-tacticals' on page 242 undefined on input line 222. [242] [243] LaTeX Warning: Reference `avra_eq_mp' on page 244 undefined on input line 390. [244] LaTeX Warning: Reference `avra3' on page 245 undefined on input line 438. [245] [246] [247] [248] [249] [250] [251] [252] LaTeX Warning: Reference `derived-rules' on page 253 undefined on input line 10 74. [253] [254] Overfull \hbox (5.30225pt too wide) in paragraph at lines 1188--1188 [] \OT1/cmtt/m/n/10.95 FILTER_ASM_REWRITE_RULE : (term -> bool) -> thm list -> thm -> thm[] Overfull \hbox (5.30225pt too wide) in paragraph at lines 1188--1188 [] \OT1/cmtt/m/n/10.95 FILTER_PURE_ASM_REWRITE_RULE : (term -> bool) -> thm list -> thm -> thm[] Overfull \hbox (5.30225pt too wide) in paragraph at lines 1188--1188 [] \OT1/cmtt/m/n/10.95 FILTER_ONCE_ASM_REWRITE_RULE : (term -> bool) -> thm list -> thm -> thm[] Overfull \hbox (5.30225pt too wide) in paragraph at lines 1188--1188 [] \OT1/cmtt/m/n/10.95 FILTER_PURE_ONCE_ASM_REWRITE_RULE : (term -> bool) -> thm list -> thm -> thm[] LaTeX Warning: Reference `tactics-and-tacticals' on page 255 undefined on input line 1190. ) [255] (./tactics.tex [256] Chapter 14. LaTeX Warning: Reference `derived-rules' on page 257 undefined on input line 14 . [257] LaTeX Warning: Reference `MLtypeabbrev' on page 258 undefined on input line 147 . LaTeX Warning: Reference `avra_predeclared' on page 258 undefined on input line 152. [258] [259] LaTeX Warning: Reference `tacticals' on page 260 undefined on input line 343. LaTeX Warning: Reference `avra_rewrite' on page 260 undefined on input line 347 . [260] LaTeX Warning: Reference `avra_list' on page 261 undefined on input line 368. [261] LaTeX Warning: Reference `avra_conj' on page 262 undefined on input line 466. LaTeX Warning: Reference `tacticals' on page 262 undefined on input line 475. [262] LaTeX Warning: Reference `theoryprims' on page 263 undefined on input line 529. [263] [264] [265] [266] LaTeX Warning: Reference `avra_thenl' on page 267 undefined on input line 878. [267] [268] LaTeX Warning: Reference `avra_repeat' on page 269 undefined on input line 1021 . [269] [270] [271] LaTeX Warning: Citation `new-LCF-man' on page 272 undefined on input line 1225. LaTeX Warning: Reference `tactics' on page 272 undefined on input line 1247. LaTeX Warning: Reference `tacticals' on page 272 undefined on input line 1253. LaTeX Warning: Reference `avra_thenl' on page 272 undefined on input line 1255. [272] LaTeX Warning: Citation `Stefan' on page 273 undefined on input line 1347. [273] LaTeX Warning: Reference `MLfuns' on page 274 undefined on input line 1461. [274] [275] [276] [277] LaTeX Warning: Citation `lcp_rewrite' on page 278 undefined on input line 1758. LaTeX Warning: Citation `new-LCF-man' on page 278 undefined on input line 1758. LaTeX Warning: Reference `tacont' on page 278 undefined on input line 1772. LaTeX Warning: Reference `avradisch' on page 278 undefined on input line 1811. [278] [279] [280] [281] [282] [283] [284] [285] [286] [287] LaTeX Warning: Reference `avrasi' on page 288 undefined on input line 2450. ) [288] (./see.tex) (./references.tex [289]) [290] (./version2.tex Appendix A. [291] LaTeX Warning: Reference `CONVERSIONS' on page 292 undefined on input line 118. LaTeX Warning: Reference `adddel' on page 292 undefined on input line 121. [292] [293] [294] [295] [296] [297] [298] [299] [300] [301] [302] [303] [304] [305] [306] [307] [308] [309] [310] [311] [312] [313]) [314] (./index.tex Overfull \hbox (11.11429pt too wide) in paragraph at lines 3--4 [][] \OT1/cmr/m/n/12 (ab-bre-vi-a-tion, of \OT1/cmr/m/n/10.95 HOL \OT1/cmr/m/n/ 12 the-ory part names), Overfull \hbox (1.94638pt too wide) in paragraph at lines 29--31 [][]\OT1/cmtt/m/n/10.95 !! \OT1/cmr/m/n/12 (fail-ure trap, it-er-a-tive se-lec- tive, in \OT1/cmr/m/n/10.95 ML\OT1/cmr/m/n/12 ), [315] [316] [317] Overfull \hbox (2.4202pt too wide) in paragraph at lines 293--294 []\OT1/cmr/m/n/12 characteristic func-tion, of type def-i-ni-tions, Overfull \hbox (7.31598pt too wide) in paragraph at lines 294--295 []\OT1/cmr/m/n/12 characteristic pred-i-cate, of type def-i-ni-tions, Overfull \hbox (8.32034pt too wide) in paragraph at lines 297--298 []| \OT1/cmr/m/n/12 for finitely-branching or-dered trees, 190 [318] [319] Overfull \hbox (2.8198pt too wide) in paragraph at lines 387--388 []\OT1/cmr/m/n/12 constant def-i-ni-tion ex-ten-sion, of \OT1/cmr/m/n/10.95 HOL \OT1/cmr/m/n/12 logic Overfull \hbox (2.42813pt too wide) in paragraph at lines 443--444 []\OT1/cmr/m/n/12 customization of \OT1/cmr/m/n/10.95 HOL \OT1/cmr/m/n/12 sys-t em, 83, 85, 211-- [320] Overfull \hbox (6.73682pt too wide) in paragraph at lines 464--465 [][]\OT1/cmr/m/n/12 , \OT1/cmr/bx/n/12 154\OT1/cmr/m/n/12 , 297 [321] Overfull \hbox (5.05649pt too wide) in paragraph at lines 605--606 []| \OT1/cmr/m/n/12 by con-stant spec-i-fi-ca-tion, 127--129, 165 [322] [323] [324] Overfull \hbox (0.1607pt too wide) in paragraph at lines 792--793 []| \OT1/cmr/m/n/12 tim-ing and count-ing in-fer-ences in, 215 [325] [326] Overfull \hbox (6.4021pt too wide) in paragraph at lines 938--939 []\OT1/cmr/m/n/12 justifications, in goal-directed proof search, [327] [328] Overfull \hbox (6.73682pt too wide) in paragraph at lines 1150--1151 [][]\OT1/cmr/m/n/12 , \OT1/cmr/bx/n/12 183\OT1/cmr/m/n/12 , 185 [329] Overfull \hbox (0.1607pt too wide) in paragraph at lines 1188--1189 []| \OT1/cmr/m/n/12 type def-i-ni-tion pack-age ver-sion of, 196 [330] Overfull \hbox (5.19498pt too wide) in paragraph at lines 1308--1309 []| \OT1/cmr/m/n/12 au-to-mated use of, in \OT1/cmr/m/n/10.95 HOL \OT1/cmr/m/n/ 12 sys-tem, 182-- Overfull \hbox (7.71558pt too wide) in paragraph at lines 1312--1313 []\OT1/cmr/m/n/12 primitive re-cur-sive def-i-ni-tions, in \OT1/cmr/m/n/10.95 H OL \OT1/cmr/m/n/12 logic [331] Overfull \hbox (4.24796pt too wide) in paragraph at lines 1383--1384 []\OT1/cmr/m/n/12 proof func-tions (same as jus-ti-fi-ca-tions, val- [332] Overfull \hbox (4.83545pt too wide) in paragraph at lines 1429--1430 []\OT1/cmr/m/n/12 recursive def-i-ni-tions, in clas-si-cal log-ics, 182 Overfull \hbox (1.5968pt too wide) in paragraph at lines 1473--1474 []| \OT1/cmr/m/n/12 main tac-tic for, 260--261, 270--271, 277 [333] [334] [335] Overfull \hbox (1.05731pt too wide) in paragraph at lines 1678--1679 []\OT1/cmr/m/n/12 term con-struc-tors, in \OT1/cmr/m/n/10.95 HOL \OT1/cmr/m/n/1 2 logic, 143, 146-- [336] [337] Overfull \hbox (0.42181pt too wide) in paragraph at lines 1862--1863 []| \OT1/cmr/m/n/12 tools for con-struc-tion of, 186, 193, 197 [338] [339]) (./description.aux (./title.aux) (./preface.aux) (./ack.aux) (./contents.aux) (./ML.aux) (./logic.aux) (./semantics.aux) (./system.aux) (./drules.aux) (./conv.aux) (./tactics.aux) (./see.aux) (./references.aux) (./version2.aux) (./index.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) (see the transcript file for additional information) Output written on description.dvi (346 pages, 1000244 bytes). Transcript written on description.log. make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Description' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Description' ../LaTeX/makeindex ../../ description.idx index.tex makeindex is not built for x86_64. make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Description' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Description' latex description.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./description.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (/usr/share/texlive/texmf-dist/tex/latex/base/makeidx.sty) (../LaTeX/alltt.sty) (../LaTeX/layout.sty) (../LaTeX/commands.tex) Writing index file description.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./description.aux (./title.aux) (./preface.aux) (./ack.aux) (./contents.aux) (./ML.aux) (./logic.aux) (./semantics.aux) (./system.aux) (./drules.aux) (./conv.aux) (./tactics.aux) (./see.aux) (./references.aux) (./version2.aux) (./index.aux)) (./title.tex (../LaTeX/cover_info.tex The title page being created is a LaTeX approximation of a fancy PostScript cover page. All the fancy cover pages for the HOL Manual may be generated if you have (1) a PostScript printer, (2) the "psfig" TeX macros, and (3) a DVI to PostScript converter that understands these macros. The cover pages may be found in ../LaTeX/Covers, and shoud be made pursuant to the instructions given in ../LaTeX/Covers/READ-ME. ) (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [1] [2]) (./preface.tex [3] [4]) [5] No file ack.tex. (./contents.tex [6] (./description.toc [7] [8] [9] [10] Overfull \hbox (4.17778pt too wide) detected at line 200 \OT1/cmr/m/n/12 11.11.10 [11] [12] [13])) [14] [1] [2] (./ML.tex (./mlpreface.tex Chapter 1. [3] [4]) (./ml1.tex [5] [6] Chapter 2. [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21]) (./ml2.tex [22] Chapter 3. [23] [24] [25] [26] [27] [28] [29]) (./ml3.tex [30] Chapter 4. [31] [32] [33] [34] [35] [36] [37]) (./ml4.tex [38] Chapter 5. [39] [40] [41] [42] [43] [44] [45] [46] [47] [48] [49]) (./ml5.tex [50] Chapter 6. [51] [52] [53]) (./ml6.tex [54] Chapter 7. [55] [56] [57] [58] [59] [60] [61] [62] [63] [64] [65] [66]) (./ml7.tex [67] [68] Chapter 8. [69] [70] [71] [72] [73] [74] [75] [76] [77] [78] [79] [80] [81] [82] [83] [84] [85] [86] [87] [88] [89] [90] [91] [92] [93] [94] Underfull \vbox (badness 10000) has occurred while \output is active [95] Underfull \vbox (badness 10000) has occurred while \output is active [96])) [97] [98] [99] [100] (./logic.tex Chapter 9. [101] [102] [103] [104] [105] [106] [107] [108] [109] [110] [111] [112] [113]) [114] (./semantics.tex Chapter 10. [115] [116] [117] [118] [119] [120] [121] [122] [123] [124] [125] [126] [127] [128] [129] [130] [131] [132] [133] [134] [135]) [136] [137] [138] (./system.tex Chapter 11. [139] [140] [141] [142] [143] [144] [145] [146] [147] [148] [149] [150] [151] [152] [153] [154] [155] [156] [157] [158] [159] [160] [161] [162] [163] [164] [165] [166] [167] [168] [169] [170] [171] [172] [173] [174] [175] [176] [177] [178] [179] [180] [181] [182] [183] [184] [185] [186] [187] [188] [189] [190] [191] [192] [193] [194] [195] [196] [197] [198] [199] [200] [201] [202] [203] [204] [205] [206] [207] [208] [209] [210] [211] [212] [213] [214]) [215] [216] [217] [218] (./drules.tex Chapter 12. [219] [220] [221] [222] [223] [224] [225] [226] [227] [228] [229] [230] [231] [232] [233] [234] [235] [236] [237]) [238] (./conv.tex Chapter 13. [239] [240] [241] [242] [243] [244] [245] [246] [247] [248] [249] [250] [251] [252] [253] [254] Overfull \hbox (5.30225pt too wide) in paragraph at lines 1188--1188 [] \OT1/cmtt/m/n/10.95 FILTER_ASM_REWRITE_RULE : (term -> bool) -> thm list -> thm -> thm[] Overfull \hbox (5.30225pt too wide) in paragraph at lines 1188--1188 [] \OT1/cmtt/m/n/10.95 FILTER_PURE_ASM_REWRITE_RULE : (term -> bool) -> thm list -> thm -> thm[] Overfull \hbox (5.30225pt too wide) in paragraph at lines 1188--1188 [] \OT1/cmtt/m/n/10.95 FILTER_ONCE_ASM_REWRITE_RULE : (term -> bool) -> thm list -> thm -> thm[] Overfull \hbox (5.30225pt too wide) in paragraph at lines 1188--1188 [] \OT1/cmtt/m/n/10.95 FILTER_PURE_ONCE_ASM_REWRITE_RULE : (term -> bool) -> thm list -> thm -> thm[] ) [255] (./tactics.tex [256] Chapter 14. [257] [258] [259] [260] [261] [262] [263] [264] [265] [266] [267] [268] [269] [270] [271] [272] [273] [274] [275] [276] [277] [278] [279] [280] [281] [282] [283] [284] [285] [286] [287]) [288] (./see.tex) (./references.tex [289]) [290] (./version2.tex Appendix A. [291] [292] [293] [294] [295] [296] [297] [298] [299] [300] [301] [302] [303] [304] [305] [306] [307] [308] [309] [310] [311] [312] [313]) [314] (./index.tex Overfull \hbox (11.11429pt too wide) in paragraph at lines 3--4 [][] \OT1/cmr/m/n/12 (ab-bre-vi-a-tion, of \OT1/cmr/m/n/10.95 HOL \OT1/cmr/m/n/ 12 the-ory part names), Overfull \hbox (1.94638pt too wide) in paragraph at lines 29--31 [][]\OT1/cmtt/m/n/10.95 !! \OT1/cmr/m/n/12 (fail-ure trap, it-er-a-tive se-lec- tive, in \OT1/cmr/m/n/10.95 ML\OT1/cmr/m/n/12 ), [315] [316] [317] Overfull \hbox (2.4202pt too wide) in paragraph at lines 293--294 []\OT1/cmr/m/n/12 characteristic func-tion, of type def-i-ni-tions, Overfull \hbox (7.31598pt too wide) in paragraph at lines 294--295 []\OT1/cmr/m/n/12 characteristic pred-i-cate, of type def-i-ni-tions, Overfull \hbox (8.32034pt too wide) in paragraph at lines 297--298 []| \OT1/cmr/m/n/12 for finitely-branching or-dered trees, 190 [318] [319] Overfull \hbox (2.8198pt too wide) in paragraph at lines 387--388 []\OT1/cmr/m/n/12 constant def-i-ni-tion ex-ten-sion, of \OT1/cmr/m/n/10.95 HOL \OT1/cmr/m/n/12 logic Overfull \hbox (2.42813pt too wide) in paragraph at lines 443--444 []\OT1/cmr/m/n/12 customization of \OT1/cmr/m/n/10.95 HOL \OT1/cmr/m/n/12 sys-t em, 83, 85, 211-- [320] Overfull \hbox (6.73682pt too wide) in paragraph at lines 464--465 [][]\OT1/cmr/m/n/12 , \OT1/cmr/bx/n/12 154\OT1/cmr/m/n/12 , 297 [321] Overfull \hbox (5.05649pt too wide) in paragraph at lines 605--606 []| \OT1/cmr/m/n/12 by con-stant spec-i-fi-ca-tion, 127--129, 165 [322] [323] [324] Overfull \hbox (0.1607pt too wide) in paragraph at lines 792--793 []| \OT1/cmr/m/n/12 tim-ing and count-ing in-fer-ences in, 215 [325] [326] Overfull \hbox (6.4021pt too wide) in paragraph at lines 938--939 []\OT1/cmr/m/n/12 justifications, in goal-directed proof search, [327] [328] Overfull \hbox (6.73682pt too wide) in paragraph at lines 1150--1151 [][]\OT1/cmr/m/n/12 , \OT1/cmr/bx/n/12 183\OT1/cmr/m/n/12 , 185 [329] Overfull \hbox (0.1607pt too wide) in paragraph at lines 1188--1189 []| \OT1/cmr/m/n/12 type def-i-ni-tion pack-age ver-sion of, 196 [330] Overfull \hbox (5.19498pt too wide) in paragraph at lines 1308--1309 []| \OT1/cmr/m/n/12 au-to-mated use of, in \OT1/cmr/m/n/10.95 HOL \OT1/cmr/m/n/ 12 sys-tem, 182-- Overfull \hbox (7.71558pt too wide) in paragraph at lines 1312--1313 []\OT1/cmr/m/n/12 primitive re-cur-sive def-i-ni-tions, in \OT1/cmr/m/n/10.95 H OL \OT1/cmr/m/n/12 logic [331] Overfull \hbox (4.24796pt too wide) in paragraph at lines 1383--1384 []\OT1/cmr/m/n/12 proof func-tions (same as jus-ti-fi-ca-tions, val- [332] Overfull \hbox (4.83545pt too wide) in paragraph at lines 1429--1430 []\OT1/cmr/m/n/12 recursive def-i-ni-tions, in clas-si-cal log-ics, 182 Overfull \hbox (1.5968pt too wide) in paragraph at lines 1473--1474 []| \OT1/cmr/m/n/12 main tac-tic for, 260--261, 270--271, 277 [333] [334] [335] Overfull \hbox (1.05731pt too wide) in paragraph at lines 1678--1679 []\OT1/cmr/m/n/12 term con-struc-tors, in \OT1/cmr/m/n/10.95 HOL \OT1/cmr/m/n/1 2 logic, 143, 146-- [336] [337] Overfull \hbox (0.42181pt too wide) in paragraph at lines 1862--1863 []| \OT1/cmr/m/n/12 tools for con-struc-tion of, 186, 193, 197 [338] [339]) (./description.aux (./title.aux) (./preface.aux) (./ack.aux) (./contents.aux) (./ML.aux) (./logic.aux) (./semantics.aux) (./system.aux) (./drules.aux) (./conv.aux) (./tactics.aux) (./see.aux) (./references.aux) (./version2.aux) (./index.aux)) ) (see the transcript file for additional information) Output written on description.dvi (353 pages, 1083508 bytes). Transcript written on description.log. make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Description' make[3]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Description' ====> DESCRIPTION made make[2]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual' make[2]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual' (cd Reference; make all; cd ..) make[3]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Reference' make clean; make tex; make reference; make index; make reference make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Reference' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Reference' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Reference' /bin/sh bin/doc-to-tex bin/doc-to-tex.sed ../../help/ENTRIES entries.tex /bin/sh bin/doc-to-tex bin/doc-to-tex.sed ../../help/THEOREMS/basic-logic theorems.tex /bin/sh bin/doc-to-tex bin/doc-to-tex.sed ../../help/THEOREMS/syntax theorems.tex /bin/sh bin/doc-to-tex bin/doc-to-tex.sed ../../help/THEOREMS/axioms theorems.tex /bin/sh bin/doc-to-tex bin/doc-to-tex.sed ../../help/THEOREMS/logic theorems.tex /bin/sh bin/doc-to-tex bin/doc-to-tex.sed ../../help/THEOREMS/functions theorems.tex /bin/sh bin/doc-to-tex bin/doc-to-tex.sed ../../help/THEOREMS/one theorems.tex /bin/sh bin/doc-to-tex bin/doc-to-tex.sed ../../help/THEOREMS/combin theorems.tex /bin/sh bin/doc-to-tex bin/doc-to-tex.sed ../../help/THEOREMS/pairs theorems.tex /bin/sh bin/doc-to-tex bin/doc-to-tex.sed ../../help/THEOREMS/sum theorems.tex /bin/sh bin/doc-to-tex bin/doc-to-tex.sed ../../help/THEOREMS/arith theorems.tex /bin/sh bin/doc-to-tex bin/doc-to-tex.sed ../../help/THEOREMS/list theorems.tex /bin/sh bin/doc-to-tex bin/doc-to-tex.sed ../../help/THEOREMS/tree theorems.tex /bin/sh bin/doc-to-tex bin/doc-to-tex.sed ../../help/THEOREMS/tydefs theorems.tex TeX files made make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Reference' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Reference' latex reference.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./reference.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../LaTeX/alltt.sty) (../LaTeX/layout.sty) (../LaTeX/commands.tex) (../LaTeX/ref-macros.tex) Writing index file reference.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file reference.aux. (./title.tex (../LaTeX/cover_info.tex The title page being created is a LaTeX approximation of a fancy PostScript cover page. All the fancy cover pages for the HOL Manual may be generated if you have (1) a PostScript printer, (2) the "psfig" TeX macros, and (3) a DVI to PostScript converter that understands these macros. The cover pages may be found in ../LaTeX/Covers, and shoud be made pursuant to the instructions given in ../LaTeX/Covers/READ-ME. ) (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [1] [2]) (./preface.tex) [3] No file ack.tex. (./contents.tex [4] No file reference.toc. ) [5] [6] (./entries.tex Chapter 1. (./entries-intro.tex) Typesetting: \# Typesetting: * Typesetting: + [1] Typesetting: - Typesetting: \char '056 Typesetting: / [2] Typesetting: \char '136 Typesetting: < [3] Typesetting: << Typesetting: = [4] Typesetting: > Underfull \vbox (badness 10000) has occurred while \output is active [5] Typesetting: \char '100 [6] Typesetting: ABS Typesetting: ABS_CONV [7] Typesetting: abs_goals [8] Typesetting: ACCEPT_TAC Typesetting: achieves [9] Typesetting: achieve_first Typesetting: aconv Typesetting: activate_binders [10] Typesetting: AC_CONV [11] Typesetting: ADD_ASSUM [12] Typesetting: ADD_CONV Typesetting: allowed_constant [13] Typesetting: ALL_CONV [14] Typesetting: ALL_EL_CONV [15] Typesetting: ALL_TAC [16] Typesetting: ALL_THEN Typesetting: ALPHA [17] Typesetting: ALPHA_CONV Typesetting: ancestors [18] Typesetting: ancestry Typesetting: AND_EXISTS_CONV [19] Typesetting: AND_FORALL_CONV [20] Typesetting: ANTE_CONJ_CONV Typesetting: ANTE_RES_THEN [21] Typesetting: append [22] Typesetting: APPEND_CONV Typesetting: append_openw [23] Typesetting: apply_proof Typesetting: AP_TERM [24] Typesetting: AP_TERM_TAC Typesetting: AP_THM [25] Typesetting: AP_THM_TAC [26] Typesetting: arb_term Typesetting: arity Typesetting: ascii [27] Typesetting: ascii_code Typesetting: ASM_CASES_TAC [28] Typesetting: ASM_REWRITE_RULE [29] Typesetting: ASM_REWRITE_TAC [30] Typesetting: assert Typesetting: assignable_print_term Underfull \vbox (badness 5741) has occurred while \output is active [31] Typesetting: assoc Underfull \vbox (badness 6078) has occurred while \output is active [32] Overfull \vbox (57.81328pt too high) has occurred while \output is active [33] Typesetting: associate_restriction [34] Typesetting: ASSUME Underfull \vbox (badness 10000) has occurred while \output is active [35] [36] Typesetting: ASSUME_TAC [37] Typesetting: ASSUM_LIST [38] Typesetting: attempt_first Typesetting: autoload [39] Typesetting: autoload_theory [40] Typesetting: axiom [41] Typesetting: axioms Typesetting: axiom_lfn [42] Typesetting: axiom_msg_lfn [43] Typesetting: B Typesetting: b [44] Typesetting: backup [45] Underfull \vbox (badness 10000) has occurred while \output is active [46] Typesetting: backup_limit [47] Underfull \vbox (badness 10000) has occurred while \output is active [48] Typesetting: backup_list Underfull \vbox (badness 5548) has occurred while \output is active [49] Typesetting: basic_rewrites [50] Typesetting: BETA_CONV [51] Typesetting: BETA_RULE [52] Typesetting: BETA_TAC [53] Typesetting: binders Typesetting: bndvar [54] Typesetting: body Typesetting: BODY_CONJUNCTS [55] Typesetting: BOOL_CASES_TAC [56] Typesetting: bool_EQ_CONV [57] Typesetting: bool_ty Typesetting: BUTFIRSTN_CONV [58] Typesetting: butlast Typesetting: BUTLASTN_CONV [59] Typesetting: BUTLAST_CONV Typesetting: C [60] Typesetting: cached_theories Typesetting: can Typesetting: CASES_THENL [61] [62] Typesetting: CB Typesetting: CCONTR [63] Typesetting: CHANGED_CONV Typesetting: CHANGED_TAC [64] Typesetting: change_state Typesetting: CHECK_ASSUME_TAC [65] Typesetting: check_lhs Typesetting: check_specification [66] Typesetting: check_valid Typesetting: check_varstruct Typesetting: chktac [67] Typesetting: CHOOSE [68] Typesetting: CHOOSE_TAC Typesetting: CHOOSE_THEN Underfull \vbox (badness 1852) has occurred while \output is active [69] [70] Typesetting: chop_list Typesetting: close [71] Typesetting: close_theory [72] Typesetting: Co Typesetting: com [73] Typesetting: combine Typesetting: compile [74] [75] Typesetting: compilef [76] Typesetting: compilet Typesetting: compiling [77] Typesetting: compiling_stack [78] Typesetting: concat Typesetting: concatl Typesetting: concl [79] Typesetting: COND_CASES_TAC [80] Typesetting: COND_CONV [81] Typesetting: CONJ Typesetting: CONJUNCT1 [82] Typesetting: CONJUNCT2 Typesetting: CONJUNCTS [83] Typesetting: conjuncts [84] Typesetting: CONJUNCTS_CONV [85] Typesetting: CONJUNCTS_THEN [86] Typesetting: CONJUNCTS_THEN2 [87] Typesetting: CONJ_DISCH [88] Typesetting: CONJ_DISCHL Typesetting: CONJ_LIST [89] Typesetting: CONJ_PAIR Underfull \vbox (badness 10000) has occurred while \output is active [90] Typesetting: CONJ_SET_CONV [91] Typesetting: CONJ_TAC [92] Typesetting: constants Typesetting: CONTR [93] Typesetting: CONTRAPOS Typesetting: CONTRAPOS_CONV [94] Typesetting: CONTR_TAC Typesetting: CONV_RULE [95] Typesetting: CONV_TAC [96] Typesetting: current_theory [97] Typesetting: curry Typesetting: define_finite_set_syntax [98] Underfull \vbox (badness 10000) has occurred while \output is active [99] Typesetting: define_load_lib_function [100] Typesetting: define_new_type_bijections [101] Typesetting: define_set_abstraction_syntax [102] Typesetting: define_type [103] [104] Typesetting: definition [105] Typesetting: definitions [106] Typesetting: definition_lfn Typesetting: definition_msg_lfn [107] Typesetting: DEF_EXISTS_RULE [108] Typesetting: delete_cache Typesetting: delete_thm [109] [110] Typesetting: DEPTH_CONV [111] Typesetting: dest_abs Typesetting: dest_comb [112] Typesetting: dest_cond Typesetting: dest_conj [113] Typesetting: dest_cons Typesetting: dest_const [114] Typesetting: dest_definition Typesetting: dest_disj [115] Typesetting: dest_eq Typesetting: dest_exists [116] Typesetting: dest_forall Typesetting: dest_form Typesetting: dest_imp [117] Typesetting: dest_let Typesetting: dest_list [118] Typesetting: dest_neg [119] Typesetting: dest_neg_imp Typesetting: dest_pabs [120] Typesetting: dest_pair Typesetting: dest_pred [121] Typesetting: dest_select Typesetting: dest_thm [122] Typesetting: dest_type Typesetting: dest_var [123] Typesetting: dest_vartype [124] Typesetting: DISCARD_TAC Typesetting: DISCH [125] Typesetting: disch Typesetting: DISCH_ALL [126] Typesetting: DISCH_TAC [127] Typesetting: DISCH_THEN [128] Typesetting: DISJ1 [129] Typesetting: DISJ1_TAC Typesetting: DISJ2 [130] Typesetting: DISJ2_TAC [131] Typesetting: disjuncts Underfull \vbox (badness 1540) has occurred while \output is active [132] Typesetting: DISJ_CASES [133] Typesetting: DISJ_CASES_TAC [134] Typesetting: DISJ_CASES_THEN [135] Typesetting: DISJ_CASES_THEN2 [136] Typesetting: DISJ_CASES_THENL [137] Typesetting: DISJ_CASES_UNION [138] Typesetting: DISJ_IMP [139] Typesetting: distinct Typesetting: do [140] Typesetting: draft_mode [141] Typesetting: dropout [142] Typesetting: e [143] Typesetting: el Typesetting: ELL_CONV [144] Typesetting: EL_CONV [145] Typesetting: end_itlist Typesetting: enter_form_rep [146] Typesetting: enter_term Typesetting: enter_term_rep Typesetting: EQF_ELIM [147] Typesetting: EQF_INTRO Typesetting: EQT_ELIM [148] Typesetting: EQT_INTRO Typesetting: EQ_IMP_RULE [149] Typesetting: EQ_LENGTH_INDUCT_TAC [150] Typesetting: EQ_LENGTH_SNOC_INDUCT_TAC Typesetting: EQ_MP [151] Typesetting: EQ_TAC [152] Typesetting: ETA_CONV Typesetting: EVERY [153] Typesetting: EVERY_ASSUM Typesetting: EVERY_CONV [154] Typesetting: EVERY_TCL [155] Typesetting: EXISTENCE Typesetting: EXISTS [156] Typesetting: exists [157] Typesetting: EXISTS_AND_CONV Typesetting: EXISTS_EQ [158] Typesetting: EXISTS_GREATEST_CONV [159] Typesetting: EXISTS_IMP Typesetting: EXISTS_IMP_CONV [160] Typesetting: EXISTS_LEAST_CONV [161] Typesetting: EXISTS_NOT_CONV Typesetting: EXISTS_OR_CONV [162] Typesetting: EXISTS_TAC Typesetting: EXISTS_UNIQUE_CONV [163] Typesetting: expand [164] Underfull \vbox (badness 10000) has occurred while \output is active [165] Underfull \vbox (badness 10000) has occurred while \output is active [166] Typesetting: expandf [167] [168] Typesetting: explode Typesetting: EXT [169] Typesetting: extend_theory [170] Typesetting: FAIL_TAC [171] Typesetting: falsity Typesetting: fast_arith [172] Typesetting: filter Typesetting: FILTER_ASM_REWRITE_RULE [173] Typesetting: FILTER_ASM_REWRITE_TAC [174] Typesetting: FILTER_CONV [175] Typesetting: FILTER_DISCH_TAC [176] Typesetting: FILTER_DISCH_THEN [177] Typesetting: FILTER_GEN_TAC [178] Typesetting: FILTER_ONCE_ASM_REWRITE_RULE Typesetting: FILTER_ONCE_ASM_REWRITE_TAC [179] Typesetting: FILTER_PURE_ASM_REWRITE_RULE [180] Overfull \hbox (11.18983pt too wide) in paragraph at lines 8120--8124 \OT1/cmr/m/n/12 re-sult in a di-verg-ing se-quence of rewrites. In such cases [ ]\OT1/cmtt/m/n/10.95 FILTER_PURE_ONCE_ASM_REWRITE_RULE Typesetting: FILTER_PURE_ASM_REWRITE_TAC Overfull \hbox (29.59367pt too wide) in paragraph at lines 8155--8162 \OT1/cmr/m/n/12 may re-sult in a di-verg-ing se-quence of rewrites. In such cas es []\OT1/cmtt/m/n/10.95 FILTER_PURE_ONCE_ASM_REWRITE_TAC [181] Typesetting: FILTER_PURE_ONCE_ASM_REWRITE_RULE Overfull \hbox (19.17981pt too wide) in paragraph at lines 8189--8196 \OT1/cmr/m/n/12 avoids the di-ver-gence which can re-sult from the ap-pli-ca-ti on of []\OT1/cmtt/m/n/10.95 FILTER_PURE_ASM_REWRITE_RULE\OT1/cmr/m/n/12 . [182] Typesetting: FILTER_PURE_ONCE_ASM_REWRITE_TAC Typesetting: FILTER_STRIP_TAC [183] [184] Typesetting: FILTER_STRIP_THEN [185] Typesetting: find Typesetting: find_file [186] Typesetting: find_match Typesetting: find_ml_file [187] [188] Typesetting: find_term Typesetting: find_terms [189] Typesetting: find_theory Typesetting: FIRST [190] Typesetting: FIRSTN_CONV [191] Typesetting: FIRST_ASSUM [192] Typesetting: FIRST_CONV Typesetting: FIRST_TCL [193] Typesetting: flags Typesetting: flat [194] Typesetting: FLAT_CONV Typesetting: FOLDL_CONV [195] [196] Typesetting: FOLDR_CONV [197] Typesetting: forall Typesetting: FORALL_AND_CONV [198] Typesetting: FORALL_EQ [199] Typesetting: FORALL_IMP_CONV Typesetting: FORALL_NOT_CONV [200] Typesetting: FORALL_OR_CONV [201] Typesetting: frees Typesetting: freesl [202] Typesetting: FREEZE_THEN [203] Typesetting: free_in [204] Typesetting: FRONT_CONJ_CONV [205] Typesetting: fst Typesetting: funpow [206] Typesetting: FUN_EQ_CONV [207] Typesetting: g [208] Typesetting: GEN Typesetting: GENL [209] Typesetting: genvar [210] Typesetting: GEN_ALL [211] Typesetting: GEN_ALPHA_CONV Overfull \hbox (40.70583pt too wide) in paragraph at lines 9625--9630 []\OT1/cmtt/m/n/10.95 "\y.t" \OT1/cmr/m/n/12 or []\OT1/cmtt/m/n/10.95 "B y.t"\O T1/cmr/m/n/12 , where []\OT1/cmtt/m/n/10.95 B \OT1/cmr/m/n/12 is a binder (that is, []\OT1/cmtt/m/n/10.95 is_binder `B` \OT1/cmr/m/n/12 re-turns []\OT1/cmtt/m /n/10.95 true\OT1/cmr/m/n/12 ). []\OT1/cmtt/m/n/10.95 GEN_ALPHA_CONV x tm [212] Typesetting: GEN_BETA_CONV Typesetting: GEN_REWRITE_CONV [213] [214] Typesetting: GEN_REWRITE_RULE [215] [216] Typesetting: GEN_REWRITE_TAC [217] [218] Typesetting: GEN_TAC Typesetting: getenv [219] Typesetting: get_const_type Typesetting: get_flag_value [220] Typesetting: get_state [221] Typesetting: get_steps [222] Typesetting: get_type [223] Typesetting: goals Typesetting: GSPEC [224] Typesetting: GSUBST_TAC Typesetting: GSYM [225] Typesetting: HALF_MK_ABS [226] Typesetting: hd Typesetting: help [227] Typesetting: help_search_path Typesetting: hide_constant [228] Typesetting: hol_pathname Typesetting: host_name [229] Typesetting: hyp Underfull \vbox (badness 2343) has occurred while \output is active [230] Typesetting: hyp_union [231] Typesetting: I Typesetting: implode [232] Typesetting: IMP_ANTISYM_RULE Typesetting: IMP_CANON [233] Typesetting: IMP_CONJ [234] Typesetting: IMP_ELIM Typesetting: IMP_RES_TAC [235] Typesetting: IMP_RES_THEN [236] [237] Typesetting: IMP_TRANS [238] Typesetting: INDUCT Typesetting: INDUCT_TAC [239] Typesetting: INDUCT_THEN [240] [241] Typesetting: infixes [242] Typesetting: infix_variable Typesetting: inject_input [243] Typesetting: inl [244] Typesetting: inr Typesetting: INST [245] Typesetting: inst [246] Typesetting: install [247] Typesetting: inst_check [248] Typesetting: inst_rename_list [249] Typesetting: INST_TYPE [250] Typesetting: inst_type Typesetting: INST_TY_TERM [251] Typesetting: interface_map [252] Typesetting: intersect Typesetting: int_of_string [253] Typesetting: int_of_term Typesetting: isl [254] Typesetting: ISPEC Typesetting: ISPECL [255] Typesetting: is_abs [256] Typesetting: is_alphanum Typesetting: is_axiom Typesetting: is_binder [257] Typesetting: is_binder_type [258] Typesetting: is_comb [259] Typesetting: is_cond Typesetting: is_conj Typesetting: is_cons [260] Typesetting: is_const Typesetting: is_constant [261] Typesetting: is_definition Typesetting: is_disj [262] Typesetting: IS_EL_CONV Typesetting: is_eq [263] Typesetting: is_exists Typesetting: is_forall [264] Typesetting: is_hidden Typesetting: is_imp [265] Typesetting: is_infix [266] Typesetting: is_infix_type Typesetting: is_let [267] Typesetting: is_letter [268] Typesetting: is_list Typesetting: is_ml_curried_infix [269] Typesetting: is_ml_infix Typesetting: is_ml_paired_infix [270] Typesetting: is_neg Typesetting: is_neg_imp [271] Typesetting: is_pabs Typesetting: is_pair [272] Typesetting: is_pred Typesetting: is_recording_proof [273] Typesetting: is_select [274] Typesetting: is_type Typesetting: is_var Typesetting: is_vartype [275] Typesetting: it [276] Typesetting: itlist Typesetting: itlist2 [277] Typesetting: K Typesetting: KI [278] Typesetting: last Typesetting: LASTN_CONV [279] Typesetting: LAST_CONV Typesetting: LEFT_AND_EXISTS_CONV [280] Typesetting: LEFT_AND_FORALL_CONV [281] Typesetting: LEFT_IMP_EXISTS_CONV Typesetting: LEFT_IMP_FORALL_CONV [282] Typesetting: LEFT_OR_EXISTS_CONV Typesetting: LEFT_OR_FORALL_CONV [283] Typesetting: length Typesetting: LENGTH_CONV [284] Typesetting: let_after [285] Typesetting: let_before [286] Typesetting: let_CONV [287] Underfull \vbox (badness 10000) has occurred while \output is active [288] Typesetting: lhs Typesetting: libraries [289] Typesetting: library_loader [290] [291] Typesetting: library_pathname [292] Typesetting: library_search_path Typesetting: link [293] Typesetting: lisp [294] Typesetting: lisp_dir_pathname [295] Typesetting: LIST_BETA_CONV Typesetting: LIST_CONJ [296] Typesetting: list_EQ_CONV [297] Typesetting: list_FOLD_CONV [298] Typesetting: LIST_INDUCT [299] Typesetting: LIST_INDUCT_TAC [300] Typesetting: list_mk_abs Typesetting: list_mk_comb Typesetting: list_mk_conj [301] Typesetting: list_mk_disj Underfull \vbox (badness 1117) has occurred while \output is active [302] Typesetting: LIST_MK_EXISTS [303] Typesetting: list_mk_exists Typesetting: list_mk_forall [304] Typesetting: list_mk_imp Typesetting: list_mk_pair [305] Typesetting: LIST_MP [306] Typesetting: list_of_binders [307] Typesetting: load Typesetting: loadf [308] Typesetting: loadt Typesetting: load_axiom [309] [310] Typesetting: load_axioms Typesetting: load_definition [311] [312] Typesetting: load_definitions Typesetting: load_library [313] Underfull \vbox (badness 1052) has occurred while \output is active [314] Typesetting: load_theorem [315] Typesetting: load_theorems [316] Typesetting: load_theory [317] Typesetting: lookup_form_rep Typesetting: lookup_term Typesetting: lookup_term_rep Typesetting: lsp [318] Typesetting: map [319] Typesetting: map2 Typesetting: MAP2_CONV [320] Typesetting: mapfilter [321] Typesetting: maptok [322] Typesetting: MAP_CONV [323] Typesetting: MAP_EVERY [324] Typesetting: MAP_FIRST [325] Typesetting: match [326] Typesetting: MATCH_ACCEPT_TAC [327] Typesetting: MATCH_MP [328] Typesetting: MATCH_MP_TAC [329] Typesetting: max_print_depth [330] Typesetting: mem Typesetting: merge_nets_rep Typesetting: merge_term_nets [331] Typesetting: message Typesetting: MK_ABS [332] Typesetting: mk_abs Typesetting: MK_COMB [333] Typesetting: mk_comb Typesetting: mk_cond [334] Typesetting: mk_conj Typesetting: mk_cons [335] Typesetting: mk_const Typesetting: mk_conv_net [336] Typesetting: mk_definition Typesetting: mk_disj [337] Typesetting: mk_eq Typesetting: MK_EXISTS [338] Typesetting: mk_exists Typesetting: mk_forall [339] Typesetting: mk_form Typesetting: mk_imp Typesetting: mk_let [340] Typesetting: mk_list Typesetting: mk_neg [341] Typesetting: mk_pabs Typesetting: mk_pair [342] Typesetting: mk_pp_thm Typesetting: mk_pred Typesetting: mk_primed_var [343] Typesetting: mk_select [344] Typesetting: mk_thm [345] Typesetting: mk_type Typesetting: mk_var [346] Typesetting: mk_vartype [347] Typesetting: ml_curried_infix Typesetting: ml_dir_pathname [348] Typesetting: ML_eval [349] Typesetting: ml_paired_infix Typesetting: MP [350] Typesetting: MP_TAC [351] Typesetting: NEG_DISCH Typesetting: new_alphanum [352] Typesetting: new_axiom [353] Typesetting: new_binder [354] Typesetting: new_binder_definition [355] Underfull \vbox (badness 10000) has occurred while \output is active [356] Typesetting: new_constant [357] Typesetting: new_definition [358] Typesetting: new_flag Typesetting: new_gen_definition [359] [360] Typesetting: new_infix Underfull \vbox (badness 1472) has occurred while \output is active [361] Typesetting: new_infix_definition [362] Typesetting: new_infix_list_rec_definition [363] [364] Typesetting: new_infix_prim_rec_definition [365] Typesetting: new_letter [366] Typesetting: new_list_rec_definition [367] [368] Typesetting: new_open_axiom Typesetting: new_parent [369] Typesetting: new_predicate Typesetting: new_prim_rec_definition [370] [371] Typesetting: new_recursive_definition [372] [373] [374] Typesetting: new_special_symbol [375] Typesetting: new_specification [376] Typesetting: new_stack Typesetting: new_syntax_block [377] Typesetting: new_theory [378] [379] Typesetting: new_type Typesetting: new_type_abbrev [380] Underfull \vbox (badness 1655) has occurred while \output is active [381] Typesetting: new_type_definition [382] Typesetting: nil_term_net Typesetting: not [383] Typesetting: NOT_ELIM Typesetting: NOT_EQ_SYM [384] Typesetting: NOT_EXISTS_CONV Typesetting: NOT_FORALL_CONV [385] Typesetting: NOT_INTRO Typesetting: NOT_MP [386] Typesetting: NO_CONV [387] Typesetting: NO_TAC Typesetting: NO_THEN [388] Typesetting: null Typesetting: num_CONV [389] Typesetting: num_EQ_CONV [390] Typesetting: n_strip_quant Typesetting: o Typesetting: ONCE_ASM_REWRITE_RULE [391] Typesetting: ONCE_ASM_REWRITE_TAC [392] Typesetting: ONCE_DEPTH_CONV [393] Typesetting: ONCE_REWRITE_CONV [394] Typesetting: ONCE_REWRITE_RULE [395] Typesetting: ONCE_REWRITE_TAC Underfull \vbox (badness 1189) has occurred while \output is active [396] Typesetting: ONCE_REW_DEPTH_CONV [397] Overfull \hbox (5.36761pt too wide) in paragraph at lines 18201--18206 \OT1/cmr/m/n/12 The fol-low-ing ex-am-ple il-lus-trates the dif-fer-ence be-twe en the func-tions []\OT1/cmtt/m/n/10.95 ONCE_REW_DEPTH_CONV Typesetting: oo [398] Typesetting: openi Typesetting: openw [399] Typesetting: ORELSE Typesetting: ORELSEC [400] Typesetting: ORELSE_TCL Typesetting: OR_EXISTS_CONV [401] Typesetting: OR_FORALL_CONV Typesetting: outl [402] Typesetting: outr [403] Typesetting: p [404] Typesetting: pair Typesetting: PAIRED_BETA_CONV [405] [406] Typesetting: paired_delete_thm Typesetting: PAIRED_ETA_CONV [407] Typesetting: paired_new_type Typesetting: paired_theorem Typesetting: parents [408] Typesetting: parse_as_binder Underfull \vbox (badness 10000) has occurred while \output is active [409] [410] Typesetting: partition [411] Typesetting: PART_MATCH [412] Typesetting: POP_ASSUM [413] Typesetting: POP_ASSUM_LIST [414] Typesetting: pop_proofs Typesetting: pop_proofs_print [415] Typesetting: pp_axiom Typesetting: preterm_abs [416] Typesetting: preterm_antiquot [417] Typesetting: preterm_comb Typesetting: preterm_const [418] Typesetting: preterm_to_term [419] Typesetting: preterm_typed Underfull \vbox (badness 2253) has occurred while \output is active [420] Typesetting: preterm_var Underfull \vbox (badness 1184) has occurred while \output is active [421] Typesetting: print_all_thm Underfull \vbox (badness 1975) has occurred while \output is active [422] Typesetting: print_begin [423] Typesetting: print_bool [424] Typesetting: print_break [425] Typesetting: print_defined_types [426] Typesetting: print_end Typesetting: print_goal [427] Typesetting: print_hyps [428] Typesetting: print_ibegin Underfull \vbox (badness 6157) has occurred while \output is active [429] Typesetting: print_int [430] Typesetting: print_list Typesetting: print_newline [431] Typesetting: print_stack [432] Typesetting: print_state [433] Typesetting: print_string [434] Typesetting: print_subgoals Typesetting: print_term [435] Typesetting: print_theory Typesetting: print_thm [436] Typesetting: print_tok [437] Typesetting: print_type Typesetting: print_unquoted_term [438] Typesetting: print_unquoted_type [439] Typesetting: print_void Typesetting: prompt [440] Typesetting: PROVE Typesetting: prove [441] Typesetting: prove_abs_fn_one_one [442] Typesetting: prove_abs_fn_onto Typesetting: prove_cases_thm [443] Typesetting: prove_constructors_distinct [444] Typesetting: prove_constructors_one_one [445] Typesetting: PROVE_HYP [446] Typesetting: prove_induction_thm [447] Typesetting: prove_rec_fn_exists Typesetting: prove_rep_fn_one_one [448] Typesetting: prove_rep_fn_onto [449] Typesetting: prove_thm Typesetting: PURE_ASM_REWRITE_RULE [450] Typesetting: PURE_ASM_REWRITE_TAC [451] Typesetting: PURE_ONCE_ASM_REWRITE_RULE Typesetting: PURE_ONCE_ASM_REWRITE_TAC [452] Typesetting: PURE_ONCE_REWRITE_CONV Typesetting: PURE_ONCE_REWRITE_RULE [453] Typesetting: PURE_ONCE_REWRITE_TAC [454] Typesetting: PURE_REWRITE_CONV Typesetting: PURE_REWRITE_RULE [455] Typesetting: PURE_REWRITE_TAC [456] Typesetting: push_fsubgoals Typesetting: push_print Typesetting: push_subgoals [457] Typesetting: quit Typesetting: r Typesetting: rand [458] Typesetting: RAND_CONV Typesetting: rator [459] Typesetting: RATOR_CONV [460] Typesetting: read Typesetting: RecordStep [461] [462] Typesetting: record_proof Overfull \hbox (35.74004pt too wide) in paragraph at lines 21172--21175 []\OT1/cmr/m/n/12 The cur-rent state of the proof recorder can in-ter-ro-gated us-ing the func-tion []\OT1/cmtt/m/n/10.95 is_recording_proof\OT1/cmr/m/n/12 . [463] Typesetting: REDEPTH_CONV [464] Typesetting: REFL [465] Typesetting: REFL_TAC Typesetting: remove [466] Typesetting: remove_sticky_type Typesetting: REPEAT [467] Typesetting: REPEATC Typesetting: REPEAT_GTCL [468] Typesetting: REPEAT_TCL [469] Typesetting: replicate Typesetting: rep_goals Typesetting: resume_recording [470] Overfull \hbox (35.74004pt too wide) in paragraph at lines 21535--21538 []\OT1/cmr/m/n/12 The cur-rent state of the proof recorder can in-ter-ro-gated us-ing the func-tion []\OT1/cmtt/m/n/10.95 is_recording_proof\OT1/cmr/m/n/12 . Typesetting: RES_CANON [471] Underfull \vbox (badness 10000) has occurred while \output is active [472] [473] Typesetting: RES_TAC [474] Typesetting: RES_THEN [475] [476] Typesetting: rev Typesetting: REVERSE_CONV Typesetting: rev_assoc [477] Typesetting: rev_itlist [478] Typesetting: REWRITE_CONV Overfull \hbox (2.5708pt too wide) in paragraph at lines 21939--21942 []\OT1/cmr/m/n/12 Variants of this con-ver-sion al-low changes in the set of eq ua-tions used: []\OT1/cmtt/m/n/10.95 PURE_REWRITE_CONV [479] Typesetting: REWRITE_RULE [480] Typesetting: REWRITE_TAC [481] Typesetting: REWR_CONV [482] [483] [484] Typesetting: REW_DEPTH_CONV [485] [486] Typesetting: rhs Typesetting: RIGHT_AND_EXISTS_CONV Typesetting: RIGHT_AND_FORALL_CONV [487] Typesetting: RIGHT_BETA [488] Typesetting: RIGHT_CONV_RULE Typesetting: RIGHT_IMP_EXISTS_CONV [489] Typesetting: RIGHT_IMP_FORALL_CONV Typesetting: RIGHT_LIST_BETA [490] Typesetting: RIGHT_OR_EXISTS_CONV [491] Typesetting: RIGHT_OR_FORALL_CONV Typesetting: root_goal Typesetting: rotate [492] Underfull \vbox (badness 10000) has occurred while \output is active [493] Typesetting: rotate_goals [494] Typesetting: rotate_top Typesetting: RULE_ASSUM_TAC Typesetting: S [495] Typesetting: save Typesetting: save_thm [496] Typesetting: save_top_thm [497] Typesetting: SCANL_CONV [498] Typesetting: SCANR_CONV [499] [500] Typesetting: search_path [501] Typesetting: SEG_CONV Typesetting: SELECT_CONV [502] Typesetting: SELECT_ELIM [503] [504] Typesetting: SELECT_EQ [505] Typesetting: SELECT_INTRO Typesetting: SELECT_RULE [506] Underfull \vbox (badness 1033) has occurred while \output is active [507] Typesetting: setify Typesetting: set_equal [508] Typesetting: set_fail [509] Typesetting: set_fail_prefix [510] Typesetting: set_flag Typesetting: set_goal [511] [512] Typesetting: set_help Typesetting: set_help_search_path [513] Typesetting: set_interface_map [514] Typesetting: set_lambda [515] Typesetting: set_library_search_path [516] Typesetting: set_margin Typesetting: set_pretty_mode [517] Typesetting: set_prompt Typesetting: set_search_path Underfull \vbox (badness 1259) has occurred while \output is active [518] [519] Typesetting: set_state [520] Typesetting: set_sticky_type Underfull \vbox (badness 1484) has occurred while \output is active [521] Typesetting: set_string_escape Typesetting: set_thm_count [522] Typesetting: set_turnstile Typesetting: show_types [523] Underfull \vbox (badness 3525) has occurred while \output is active [524] Typesetting: SKOLEM_CONV Typesetting: snd [525] Typesetting: SNOC_CONV Typesetting: SNOC_INDUCT_TAC [526] Typesetting: SOME_EL_CONV [527] Typesetting: sort [528] Typesetting: SPEC [529] Typesetting: special_symbols [530] Typesetting: SPECL [531] Typesetting: SPEC_ALL [532] Typesetting: SPEC_TAC [533] Typesetting: SPEC_VAR Typesetting: split [534] Typesetting: splitp Typesetting: sticky_list [535] Typesetting: store_binders Typesetting: store_definition Typesetting: string_of_int [536] Typesetting: strip_abs Typesetting: STRIP_ASSUME_TAC [537] Underfull \vbox (badness 10000) has occurred while \output is active [538] Typesetting: strip_comb Typesetting: strip_exists [539] Typesetting: strip_forall [540] Typesetting: STRIP_GOAL_THEN Underfull \vbox (badness 1859) has occurred while \output is active [541] Typesetting: strip_imp [542] Typesetting: strip_pair Typesetting: STRIP_TAC [543] [544] Typesetting: STRIP_THM_THEN [545] [546] Typesetting: STRUCT_CASES_TAC [547] Typesetting: SUBGOAL_THEN [548] Typesetting: SUBS [549] Typesetting: SUBST [550] [551] Typesetting: subst [552] Typesetting: SUBST1_TAC [553] Typesetting: SUBST_ALL_TAC [554] Typesetting: SUBST_CONV [555] [556] Typesetting: SUBST_MATCH Underfull \vbox (badness 3375) has occurred while \output is active [557] Typesetting: subst_occs Typesetting: SUBST_OCCS_TAC [558] [559] Typesetting: SUBST_TAC [560] Typesetting: SUBS_OCCS [561] Typesetting: subtract [562] Typesetting: SUB_CONV [563] Typesetting: suspend_recording Overfull \hbox (35.74004pt too wide) in paragraph at lines 25918--25921 []\OT1/cmr/m/n/12 The cur-rent state of the proof recorder can in-ter-ro-gated us-ing the func-tion []\OT1/cmtt/m/n/10.95 is_recording_proof\OT1/cmr/m/n/12 . Typesetting: SWAP_EXISTS_CONV [564] Typesetting: SYM Typesetting: SYM_CONV [565] Typesetting: syserror Typesetting: system [566] Typesetting: TAC_PROOF [567] Typesetting: term_of_int Typesetting: THEN [568] Typesetting: THENC Typesetting: THENL [569] Typesetting: THEN_TCL [570] Typesetting: theorem [571] Typesetting: theorems Typesetting: theorem_lfn [572] Typesetting: theorem_msg_lfn [573] Typesetting: thm_count Typesetting: thm_frees [574] Typesetting: timer [575] Typesetting: tl [576] Typesetting: TOP_DEPTH_CONV Typesetting: top_goal [577] Typesetting: top_print [578] Typesetting: top_proof [579] Typesetting: top_thm Typesetting: TRANS [580] Typesetting: TRY Typesetting: tryfind [581] Typesetting: TRY_CONV Typesetting: tty_read [582] Typesetting: tty_write [583] Typesetting: types Underfull \vbox (badness 3039) has occurred while \output is active [584] Typesetting: type_abbrevs Typesetting: type_in [585] Typesetting: type_in_type [586] Typesetting: type_of Typesetting: type_tyvars [587] Typesetting: tyvars [588] Typesetting: tyvarsl [589] Typesetting: uncurry Typesetting: UNDISCH [590] Typesetting: UNDISCH_ALL Typesetting: UNDISCH_TAC [591] Typesetting: undo_autoload Typesetting: unhide_constant [592] Typesetting: union Typesetting: unlink [593] Typesetting: VALID [594] Typesetting: variant [595] Typesetting: vars Typesetting: varsl [596] Typesetting: version [597] Typesetting: W Typesetting: words [598] Typesetting: words2 Typesetting: word_separators [599] Typesetting: write [600] Typesetting: X_CASES_THEN [601] Typesetting: X_CASES_THENL [602] [603] Typesetting: X_CHOOSE_TAC [604] Typesetting: X_CHOOSE_THEN [605] Typesetting: X_FUN_EQ_CONV [606] Typesetting: X_GEN_TAC [607] Typesetting: X_SKOLEM_CONV ) [608] (./theorems.tex Chapter 2. (./theorems-intro.tex) [609] [610] [611] [612] [613] [614] [615] [616] [617] [618] [619] [620] [621] [622] [623] [624] [625] [626] [627] [628] [629] [630] [631] [632] [633] [634] [635] [636] [637] [638] [639] [640] [641] [642] [643] [644] [645] [646] [647] [648] [649] [650] [651] [652] [653] [654] [655] [656] [657] [658] [659] [660]) [661] [662] (./index.tex [663]) (./reference.aux (./title.aux) (./preface.aux) (./ack.aux) (./contents.aux) (./entries.aux) (./theorems.aux) (./index.aux)) ) (see the transcript file for additional information) Output written on reference.dvi (669 pages, 1150912 bytes). Transcript written on reference.log. make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Reference' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Reference' ../LaTeX/makeindex ../../ reference.idx index.tex makeindex is not built for x86_64. make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Reference' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Reference' latex reference.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./reference.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../LaTeX/alltt.sty) (../LaTeX/layout.sty) (../LaTeX/commands.tex) (../LaTeX/ref-macros.tex) Writing index file reference.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./reference.aux (./title.aux) (./preface.aux) (./ack.aux) (./contents.aux) (./entries.aux) (./theorems.aux) (./index.aux)) (./title.tex (../LaTeX/cover_info.tex The title page being created is a LaTeX approximation of a fancy PostScript cover page. All the fancy cover pages for the HOL Manual may be generated if you have (1) a PostScript printer, (2) the "psfig" TeX macros, and (3) a DVI to PostScript converter that understands these macros. The cover pages may be found in ../LaTeX/Covers, and shoud be made pursuant to the instructions given in ../LaTeX/Covers/READ-ME. ) (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [1] [2]) (./preface.tex) [3] No file ack.tex. (./contents.tex [4] (./reference.toc)) [5] [6] (./entries.tex Chapter 1. (./entries-intro.tex) Typesetting: \# Typesetting: * Typesetting: + [1] Typesetting: - Typesetting: \char '056 Typesetting: / [2] Typesetting: \char '136 Typesetting: < [3] Typesetting: << Typesetting: = [4] Typesetting: > Underfull \vbox (badness 10000) has occurred while \output is active [5] Typesetting: \char '100 [6] Typesetting: ABS Typesetting: ABS_CONV [7] Typesetting: abs_goals [8] Typesetting: ACCEPT_TAC Typesetting: achieves [9] Typesetting: achieve_first Typesetting: aconv Typesetting: activate_binders [10] Typesetting: AC_CONV [11] Typesetting: ADD_ASSUM [12] Typesetting: ADD_CONV Typesetting: allowed_constant [13] Typesetting: ALL_CONV [14] Typesetting: ALL_EL_CONV [15] Typesetting: ALL_TAC [16] Typesetting: ALL_THEN Typesetting: ALPHA [17] Typesetting: ALPHA_CONV Typesetting: ancestors [18] Typesetting: ancestry Typesetting: AND_EXISTS_CONV [19] Typesetting: AND_FORALL_CONV [20] Typesetting: ANTE_CONJ_CONV Typesetting: ANTE_RES_THEN [21] Typesetting: append [22] Typesetting: APPEND_CONV Typesetting: append_openw [23] Typesetting: apply_proof Typesetting: AP_TERM [24] Typesetting: AP_TERM_TAC Typesetting: AP_THM [25] Typesetting: AP_THM_TAC [26] Typesetting: arb_term Typesetting: arity Typesetting: ascii [27] Typesetting: ascii_code Typesetting: ASM_CASES_TAC [28] Typesetting: ASM_REWRITE_RULE [29] Typesetting: ASM_REWRITE_TAC [30] Typesetting: assert Typesetting: assignable_print_term Underfull \vbox (badness 5741) has occurred while \output is active [31] Typesetting: assoc Underfull \vbox (badness 6078) has occurred while \output is active [32] Overfull \vbox (57.81328pt too high) has occurred while \output is active [33] Typesetting: associate_restriction [34] Typesetting: ASSUME Underfull \vbox (badness 10000) has occurred while \output is active [35] [36] Typesetting: ASSUME_TAC [37] Typesetting: ASSUM_LIST [38] Typesetting: attempt_first Typesetting: autoload [39] Typesetting: autoload_theory [40] Typesetting: axiom [41] Typesetting: axioms Typesetting: axiom_lfn [42] Typesetting: axiom_msg_lfn [43] Typesetting: B Typesetting: b [44] Typesetting: backup [45] Underfull \vbox (badness 10000) has occurred while \output is active [46] Typesetting: backup_limit [47] Underfull \vbox (badness 10000) has occurred while \output is active [48] Typesetting: backup_list Underfull \vbox (badness 5548) has occurred while \output is active [49] Typesetting: basic_rewrites [50] Typesetting: BETA_CONV [51] Typesetting: BETA_RULE [52] Typesetting: BETA_TAC [53] Typesetting: binders Typesetting: bndvar [54] Typesetting: body Typesetting: BODY_CONJUNCTS [55] Typesetting: BOOL_CASES_TAC [56] Typesetting: bool_EQ_CONV [57] Typesetting: bool_ty Typesetting: BUTFIRSTN_CONV [58] Typesetting: butlast Typesetting: BUTLASTN_CONV [59] Typesetting: BUTLAST_CONV Typesetting: C [60] Typesetting: cached_theories Typesetting: can Typesetting: CASES_THENL [61] [62] Typesetting: CB Typesetting: CCONTR [63] Typesetting: CHANGED_CONV Typesetting: CHANGED_TAC [64] Typesetting: change_state Typesetting: CHECK_ASSUME_TAC [65] Typesetting: check_lhs Typesetting: check_specification [66] Typesetting: check_valid Typesetting: check_varstruct Typesetting: chktac [67] Typesetting: CHOOSE [68] Typesetting: CHOOSE_TAC Typesetting: CHOOSE_THEN Underfull \vbox (badness 1852) has occurred while \output is active [69] [70] Typesetting: chop_list Typesetting: close [71] Typesetting: close_theory [72] Typesetting: Co Typesetting: com [73] Typesetting: combine Typesetting: compile [74] [75] Typesetting: compilef [76] Typesetting: compilet Typesetting: compiling [77] Typesetting: compiling_stack [78] Typesetting: concat Typesetting: concatl Typesetting: concl [79] Typesetting: COND_CASES_TAC [80] Typesetting: COND_CONV [81] Typesetting: CONJ Typesetting: CONJUNCT1 [82] Typesetting: CONJUNCT2 Typesetting: CONJUNCTS [83] Typesetting: conjuncts [84] Typesetting: CONJUNCTS_CONV [85] Typesetting: CONJUNCTS_THEN [86] Typesetting: CONJUNCTS_THEN2 [87] Typesetting: CONJ_DISCH [88] Typesetting: CONJ_DISCHL Typesetting: CONJ_LIST [89] Typesetting: CONJ_PAIR Underfull \vbox (badness 10000) has occurred while \output is active [90] Typesetting: CONJ_SET_CONV [91] Typesetting: CONJ_TAC [92] Typesetting: constants Typesetting: CONTR [93] Typesetting: CONTRAPOS Typesetting: CONTRAPOS_CONV [94] Typesetting: CONTR_TAC Typesetting: CONV_RULE [95] Typesetting: CONV_TAC [96] Typesetting: current_theory [97] Typesetting: curry Typesetting: define_finite_set_syntax [98] Underfull \vbox (badness 10000) has occurred while \output is active [99] Typesetting: define_load_lib_function [100] Typesetting: define_new_type_bijections [101] Typesetting: define_set_abstraction_syntax [102] Typesetting: define_type [103] [104] Typesetting: definition [105] Typesetting: definitions [106] Typesetting: definition_lfn Typesetting: definition_msg_lfn [107] Typesetting: DEF_EXISTS_RULE [108] Typesetting: delete_cache Typesetting: delete_thm [109] [110] Typesetting: DEPTH_CONV [111] Typesetting: dest_abs Typesetting: dest_comb [112] Typesetting: dest_cond Typesetting: dest_conj [113] Typesetting: dest_cons Typesetting: dest_const [114] Typesetting: dest_definition Typesetting: dest_disj [115] Typesetting: dest_eq Typesetting: dest_exists [116] Typesetting: dest_forall Typesetting: dest_form Typesetting: dest_imp [117] Typesetting: dest_let Typesetting: dest_list [118] Typesetting: dest_neg [119] Typesetting: dest_neg_imp Typesetting: dest_pabs [120] Typesetting: dest_pair Typesetting: dest_pred [121] Typesetting: dest_select Typesetting: dest_thm [122] Typesetting: dest_type Typesetting: dest_var [123] Typesetting: dest_vartype [124] Typesetting: DISCARD_TAC Typesetting: DISCH [125] Typesetting: disch Typesetting: DISCH_ALL [126] Typesetting: DISCH_TAC [127] Typesetting: DISCH_THEN [128] Typesetting: DISJ1 [129] Typesetting: DISJ1_TAC Typesetting: DISJ2 [130] Typesetting: DISJ2_TAC [131] Typesetting: disjuncts Underfull \vbox (badness 1540) has occurred while \output is active [132] Typesetting: DISJ_CASES [133] Typesetting: DISJ_CASES_TAC [134] Typesetting: DISJ_CASES_THEN [135] Typesetting: DISJ_CASES_THEN2 [136] Typesetting: DISJ_CASES_THENL [137] Typesetting: DISJ_CASES_UNION [138] Typesetting: DISJ_IMP [139] Typesetting: distinct Typesetting: do [140] Typesetting: draft_mode [141] Typesetting: dropout [142] Typesetting: e [143] Typesetting: el Typesetting: ELL_CONV [144] Typesetting: EL_CONV [145] Typesetting: end_itlist Typesetting: enter_form_rep [146] Typesetting: enter_term Typesetting: enter_term_rep Typesetting: EQF_ELIM [147] Typesetting: EQF_INTRO Typesetting: EQT_ELIM [148] Typesetting: EQT_INTRO Typesetting: EQ_IMP_RULE [149] Typesetting: EQ_LENGTH_INDUCT_TAC [150] Typesetting: EQ_LENGTH_SNOC_INDUCT_TAC Typesetting: EQ_MP [151] Typesetting: EQ_TAC [152] Typesetting: ETA_CONV Typesetting: EVERY [153] Typesetting: EVERY_ASSUM Typesetting: EVERY_CONV [154] Typesetting: EVERY_TCL [155] Typesetting: EXISTENCE Typesetting: EXISTS [156] Typesetting: exists [157] Typesetting: EXISTS_AND_CONV Typesetting: EXISTS_EQ [158] Typesetting: EXISTS_GREATEST_CONV [159] Typesetting: EXISTS_IMP Typesetting: EXISTS_IMP_CONV [160] Typesetting: EXISTS_LEAST_CONV [161] Typesetting: EXISTS_NOT_CONV Typesetting: EXISTS_OR_CONV [162] Typesetting: EXISTS_TAC Typesetting: EXISTS_UNIQUE_CONV [163] Typesetting: expand [164] Underfull \vbox (badness 10000) has occurred while \output is active [165] Underfull \vbox (badness 10000) has occurred while \output is active [166] Typesetting: expandf [167] [168] Typesetting: explode Typesetting: EXT [169] Typesetting: extend_theory [170] Typesetting: FAIL_TAC [171] Typesetting: falsity Typesetting: fast_arith [172] Typesetting: filter Typesetting: FILTER_ASM_REWRITE_RULE [173] Typesetting: FILTER_ASM_REWRITE_TAC [174] Typesetting: FILTER_CONV [175] Typesetting: FILTER_DISCH_TAC [176] Typesetting: FILTER_DISCH_THEN [177] Typesetting: FILTER_GEN_TAC [178] Typesetting: FILTER_ONCE_ASM_REWRITE_RULE Typesetting: FILTER_ONCE_ASM_REWRITE_TAC [179] Typesetting: FILTER_PURE_ASM_REWRITE_RULE [180] Overfull \hbox (11.18983pt too wide) in paragraph at lines 8120--8124 \OT1/cmr/m/n/12 re-sult in a di-verg-ing se-quence of rewrites. In such cases [ ]\OT1/cmtt/m/n/10.95 FILTER_PURE_ONCE_ASM_REWRITE_RULE Typesetting: FILTER_PURE_ASM_REWRITE_TAC Overfull \hbox (29.59367pt too wide) in paragraph at lines 8155--8162 \OT1/cmr/m/n/12 may re-sult in a di-verg-ing se-quence of rewrites. In such cas es []\OT1/cmtt/m/n/10.95 FILTER_PURE_ONCE_ASM_REWRITE_TAC [181] Typesetting: FILTER_PURE_ONCE_ASM_REWRITE_RULE Overfull \hbox (19.17981pt too wide) in paragraph at lines 8189--8196 \OT1/cmr/m/n/12 avoids the di-ver-gence which can re-sult from the ap-pli-ca-ti on of []\OT1/cmtt/m/n/10.95 FILTER_PURE_ASM_REWRITE_RULE\OT1/cmr/m/n/12 . [182] Typesetting: FILTER_PURE_ONCE_ASM_REWRITE_TAC Typesetting: FILTER_STRIP_TAC [183] [184] Typesetting: FILTER_STRIP_THEN [185] Typesetting: find Typesetting: find_file [186] Typesetting: find_match Typesetting: find_ml_file [187] [188] Typesetting: find_term Typesetting: find_terms [189] Typesetting: find_theory Typesetting: FIRST [190] Typesetting: FIRSTN_CONV [191] Typesetting: FIRST_ASSUM [192] Typesetting: FIRST_CONV Typesetting: FIRST_TCL [193] Typesetting: flags Typesetting: flat [194] Typesetting: FLAT_CONV Typesetting: FOLDL_CONV [195] [196] Typesetting: FOLDR_CONV [197] Typesetting: forall Typesetting: FORALL_AND_CONV [198] Typesetting: FORALL_EQ [199] Typesetting: FORALL_IMP_CONV Typesetting: FORALL_NOT_CONV [200] Typesetting: FORALL_OR_CONV [201] Typesetting: frees Typesetting: freesl [202] Typesetting: FREEZE_THEN [203] Typesetting: free_in [204] Typesetting: FRONT_CONJ_CONV [205] Typesetting: fst Typesetting: funpow [206] Typesetting: FUN_EQ_CONV [207] Typesetting: g [208] Typesetting: GEN Typesetting: GENL [209] Typesetting: genvar [210] Typesetting: GEN_ALL [211] Typesetting: GEN_ALPHA_CONV Overfull \hbox (40.70583pt too wide) in paragraph at lines 9625--9630 []\OT1/cmtt/m/n/10.95 "\y.t" \OT1/cmr/m/n/12 or []\OT1/cmtt/m/n/10.95 "B y.t"\O T1/cmr/m/n/12 , where []\OT1/cmtt/m/n/10.95 B \OT1/cmr/m/n/12 is a binder (that is, []\OT1/cmtt/m/n/10.95 is_binder `B` \OT1/cmr/m/n/12 re-turns []\OT1/cmtt/m /n/10.95 true\OT1/cmr/m/n/12 ). []\OT1/cmtt/m/n/10.95 GEN_ALPHA_CONV x tm [212] Typesetting: GEN_BETA_CONV Typesetting: GEN_REWRITE_CONV [213] [214] Typesetting: GEN_REWRITE_RULE [215] [216] Typesetting: GEN_REWRITE_TAC [217] [218] Typesetting: GEN_TAC Typesetting: getenv [219] Typesetting: get_const_type Typesetting: get_flag_value [220] Typesetting: get_state [221] Typesetting: get_steps [222] Typesetting: get_type [223] Typesetting: goals Typesetting: GSPEC [224] Typesetting: GSUBST_TAC Typesetting: GSYM [225] Typesetting: HALF_MK_ABS [226] Typesetting: hd Typesetting: help [227] Typesetting: help_search_path Typesetting: hide_constant [228] Typesetting: hol_pathname Typesetting: host_name [229] Typesetting: hyp Underfull \vbox (badness 2343) has occurred while \output is active [230] Typesetting: hyp_union [231] Typesetting: I Typesetting: implode [232] Typesetting: IMP_ANTISYM_RULE Typesetting: IMP_CANON [233] Typesetting: IMP_CONJ [234] Typesetting: IMP_ELIM Typesetting: IMP_RES_TAC [235] Typesetting: IMP_RES_THEN [236] [237] Typesetting: IMP_TRANS [238] Typesetting: INDUCT Typesetting: INDUCT_TAC [239] Typesetting: INDUCT_THEN [240] [241] Typesetting: infixes [242] Typesetting: infix_variable Typesetting: inject_input [243] Typesetting: inl [244] Typesetting: inr Typesetting: INST [245] Typesetting: inst [246] Typesetting: install [247] Typesetting: inst_check [248] Typesetting: inst_rename_list [249] Typesetting: INST_TYPE [250] Typesetting: inst_type Typesetting: INST_TY_TERM [251] Typesetting: interface_map [252] Typesetting: intersect Typesetting: int_of_string [253] Typesetting: int_of_term Typesetting: isl [254] Typesetting: ISPEC Typesetting: ISPECL [255] Typesetting: is_abs [256] Typesetting: is_alphanum Typesetting: is_axiom Typesetting: is_binder [257] Typesetting: is_binder_type [258] Typesetting: is_comb [259] Typesetting: is_cond Typesetting: is_conj Typesetting: is_cons [260] Typesetting: is_const Typesetting: is_constant [261] Typesetting: is_definition Typesetting: is_disj [262] Typesetting: IS_EL_CONV Typesetting: is_eq [263] Typesetting: is_exists Typesetting: is_forall [264] Typesetting: is_hidden Typesetting: is_imp [265] Typesetting: is_infix [266] Typesetting: is_infix_type Typesetting: is_let [267] Typesetting: is_letter [268] Typesetting: is_list Typesetting: is_ml_curried_infix [269] Typesetting: is_ml_infix Typesetting: is_ml_paired_infix [270] Typesetting: is_neg Typesetting: is_neg_imp [271] Typesetting: is_pabs Typesetting: is_pair [272] Typesetting: is_pred Typesetting: is_recording_proof [273] Typesetting: is_select [274] Typesetting: is_type Typesetting: is_var Typesetting: is_vartype [275] Typesetting: it [276] Typesetting: itlist Typesetting: itlist2 [277] Typesetting: K Typesetting: KI [278] Typesetting: last Typesetting: LASTN_CONV [279] Typesetting: LAST_CONV Typesetting: LEFT_AND_EXISTS_CONV [280] Typesetting: LEFT_AND_FORALL_CONV [281] Typesetting: LEFT_IMP_EXISTS_CONV Typesetting: LEFT_IMP_FORALL_CONV [282] Typesetting: LEFT_OR_EXISTS_CONV Typesetting: LEFT_OR_FORALL_CONV [283] Typesetting: length Typesetting: LENGTH_CONV [284] Typesetting: let_after [285] Typesetting: let_before [286] Typesetting: let_CONV [287] Underfull \vbox (badness 10000) has occurred while \output is active [288] Typesetting: lhs Typesetting: libraries [289] Typesetting: library_loader [290] [291] Typesetting: library_pathname [292] Typesetting: library_search_path Typesetting: link [293] Typesetting: lisp [294] Typesetting: lisp_dir_pathname [295] Typesetting: LIST_BETA_CONV Typesetting: LIST_CONJ [296] Typesetting: list_EQ_CONV [297] Typesetting: list_FOLD_CONV [298] Typesetting: LIST_INDUCT [299] Typesetting: LIST_INDUCT_TAC [300] Typesetting: list_mk_abs Typesetting: list_mk_comb Typesetting: list_mk_conj [301] Typesetting: list_mk_disj Underfull \vbox (badness 1117) has occurred while \output is active [302] Typesetting: LIST_MK_EXISTS [303] Typesetting: list_mk_exists Typesetting: list_mk_forall [304] Typesetting: list_mk_imp Typesetting: list_mk_pair [305] Typesetting: LIST_MP [306] Typesetting: list_of_binders [307] Typesetting: load Typesetting: loadf [308] Typesetting: loadt Typesetting: load_axiom [309] [310] Typesetting: load_axioms Typesetting: load_definition [311] [312] Typesetting: load_definitions Typesetting: load_library [313] Underfull \vbox (badness 1052) has occurred while \output is active [314] Typesetting: load_theorem [315] Typesetting: load_theorems [316] Typesetting: load_theory [317] Typesetting: lookup_form_rep Typesetting: lookup_term Typesetting: lookup_term_rep Typesetting: lsp [318] Typesetting: map [319] Typesetting: map2 Typesetting: MAP2_CONV [320] Typesetting: mapfilter [321] Typesetting: maptok [322] Typesetting: MAP_CONV [323] Typesetting: MAP_EVERY [324] Typesetting: MAP_FIRST [325] Typesetting: match [326] Typesetting: MATCH_ACCEPT_TAC [327] Typesetting: MATCH_MP [328] Typesetting: MATCH_MP_TAC [329] Typesetting: max_print_depth [330] Typesetting: mem Typesetting: merge_nets_rep Typesetting: merge_term_nets [331] Typesetting: message Typesetting: MK_ABS [332] Typesetting: mk_abs Typesetting: MK_COMB [333] Typesetting: mk_comb Typesetting: mk_cond [334] Typesetting: mk_conj Typesetting: mk_cons [335] Typesetting: mk_const Typesetting: mk_conv_net [336] Typesetting: mk_definition Typesetting: mk_disj [337] Typesetting: mk_eq Typesetting: MK_EXISTS [338] Typesetting: mk_exists Typesetting: mk_forall [339] Typesetting: mk_form Typesetting: mk_imp Typesetting: mk_let [340] Typesetting: mk_list Typesetting: mk_neg [341] Typesetting: mk_pabs Typesetting: mk_pair [342] Typesetting: mk_pp_thm Typesetting: mk_pred Typesetting: mk_primed_var [343] Typesetting: mk_select [344] Typesetting: mk_thm [345] Typesetting: mk_type Typesetting: mk_var [346] Typesetting: mk_vartype [347] Typesetting: ml_curried_infix Typesetting: ml_dir_pathname [348] Typesetting: ML_eval [349] Typesetting: ml_paired_infix Typesetting: MP [350] Typesetting: MP_TAC [351] Typesetting: NEG_DISCH Typesetting: new_alphanum [352] Typesetting: new_axiom [353] Typesetting: new_binder [354] Typesetting: new_binder_definition [355] Underfull \vbox (badness 10000) has occurred while \output is active [356] Typesetting: new_constant [357] Typesetting: new_definition [358] Typesetting: new_flag Typesetting: new_gen_definition [359] [360] Typesetting: new_infix Underfull \vbox (badness 1472) has occurred while \output is active [361] Typesetting: new_infix_definition [362] Typesetting: new_infix_list_rec_definition [363] [364] Typesetting: new_infix_prim_rec_definition [365] Typesetting: new_letter [366] Typesetting: new_list_rec_definition [367] [368] Typesetting: new_open_axiom Typesetting: new_parent [369] Typesetting: new_predicate Typesetting: new_prim_rec_definition [370] [371] Typesetting: new_recursive_definition [372] [373] [374] Typesetting: new_special_symbol [375] Typesetting: new_specification [376] Typesetting: new_stack Typesetting: new_syntax_block [377] Typesetting: new_theory [378] [379] Typesetting: new_type Typesetting: new_type_abbrev [380] Underfull \vbox (badness 1655) has occurred while \output is active [381] Typesetting: new_type_definition [382] Typesetting: nil_term_net Typesetting: not [383] Typesetting: NOT_ELIM Typesetting: NOT_EQ_SYM [384] Typesetting: NOT_EXISTS_CONV Typesetting: NOT_FORALL_CONV [385] Typesetting: NOT_INTRO Typesetting: NOT_MP [386] Typesetting: NO_CONV [387] Typesetting: NO_TAC Typesetting: NO_THEN [388] Typesetting: null Typesetting: num_CONV [389] Typesetting: num_EQ_CONV [390] Typesetting: n_strip_quant Typesetting: o Typesetting: ONCE_ASM_REWRITE_RULE [391] Typesetting: ONCE_ASM_REWRITE_TAC [392] Typesetting: ONCE_DEPTH_CONV [393] Typesetting: ONCE_REWRITE_CONV [394] Typesetting: ONCE_REWRITE_RULE [395] Typesetting: ONCE_REWRITE_TAC Underfull \vbox (badness 1189) has occurred while \output is active [396] Typesetting: ONCE_REW_DEPTH_CONV [397] Overfull \hbox (5.36761pt too wide) in paragraph at lines 18201--18206 \OT1/cmr/m/n/12 The fol-low-ing ex-am-ple il-lus-trates the dif-fer-ence be-twe en the func-tions []\OT1/cmtt/m/n/10.95 ONCE_REW_DEPTH_CONV Typesetting: oo [398] Typesetting: openi Typesetting: openw [399] Typesetting: ORELSE Typesetting: ORELSEC [400] Typesetting: ORELSE_TCL Typesetting: OR_EXISTS_CONV [401] Typesetting: OR_FORALL_CONV Typesetting: outl [402] Typesetting: outr [403] Typesetting: p [404] Typesetting: pair Typesetting: PAIRED_BETA_CONV [405] [406] Typesetting: paired_delete_thm Typesetting: PAIRED_ETA_CONV [407] Typesetting: paired_new_type Typesetting: paired_theorem Typesetting: parents [408] Typesetting: parse_as_binder Underfull \vbox (badness 10000) has occurred while \output is active [409] [410] Typesetting: partition [411] Typesetting: PART_MATCH [412] Typesetting: POP_ASSUM [413] Typesetting: POP_ASSUM_LIST [414] Typesetting: pop_proofs Typesetting: pop_proofs_print [415] Typesetting: pp_axiom Typesetting: preterm_abs [416] Typesetting: preterm_antiquot [417] Typesetting: preterm_comb Typesetting: preterm_const [418] Typesetting: preterm_to_term [419] Typesetting: preterm_typed Underfull \vbox (badness 2253) has occurred while \output is active [420] Typesetting: preterm_var Underfull \vbox (badness 1184) has occurred while \output is active [421] Typesetting: print_all_thm Underfull \vbox (badness 1975) has occurred while \output is active [422] Typesetting: print_begin [423] Typesetting: print_bool [424] Typesetting: print_break [425] Typesetting: print_defined_types [426] Typesetting: print_end Typesetting: print_goal [427] Typesetting: print_hyps [428] Typesetting: print_ibegin Underfull \vbox (badness 6157) has occurred while \output is active [429] Typesetting: print_int [430] Typesetting: print_list Typesetting: print_newline [431] Typesetting: print_stack [432] Typesetting: print_state [433] Typesetting: print_string [434] Typesetting: print_subgoals Typesetting: print_term [435] Typesetting: print_theory Typesetting: print_thm [436] Typesetting: print_tok [437] Typesetting: print_type Typesetting: print_unquoted_term [438] Typesetting: print_unquoted_type [439] Typesetting: print_void Typesetting: prompt [440] Typesetting: PROVE Typesetting: prove [441] Typesetting: prove_abs_fn_one_one [442] Typesetting: prove_abs_fn_onto Typesetting: prove_cases_thm [443] Typesetting: prove_constructors_distinct [444] Typesetting: prove_constructors_one_one [445] Typesetting: PROVE_HYP [446] Typesetting: prove_induction_thm [447] Typesetting: prove_rec_fn_exists Typesetting: prove_rep_fn_one_one [448] Typesetting: prove_rep_fn_onto [449] Typesetting: prove_thm Typesetting: PURE_ASM_REWRITE_RULE [450] Typesetting: PURE_ASM_REWRITE_TAC [451] Typesetting: PURE_ONCE_ASM_REWRITE_RULE Typesetting: PURE_ONCE_ASM_REWRITE_TAC [452] Typesetting: PURE_ONCE_REWRITE_CONV Typesetting: PURE_ONCE_REWRITE_RULE [453] Typesetting: PURE_ONCE_REWRITE_TAC [454] Typesetting: PURE_REWRITE_CONV Typesetting: PURE_REWRITE_RULE [455] Typesetting: PURE_REWRITE_TAC [456] Typesetting: push_fsubgoals Typesetting: push_print Typesetting: push_subgoals [457] Typesetting: quit Typesetting: r Typesetting: rand [458] Typesetting: RAND_CONV Typesetting: rator [459] Typesetting: RATOR_CONV [460] Typesetting: read Typesetting: RecordStep [461] [462] Typesetting: record_proof Overfull \hbox (35.74004pt too wide) in paragraph at lines 21172--21175 []\OT1/cmr/m/n/12 The cur-rent state of the proof recorder can in-ter-ro-gated us-ing the func-tion []\OT1/cmtt/m/n/10.95 is_recording_proof\OT1/cmr/m/n/12 . [463] Typesetting: REDEPTH_CONV [464] Typesetting: REFL [465] Typesetting: REFL_TAC Typesetting: remove [466] Typesetting: remove_sticky_type Typesetting: REPEAT [467] Typesetting: REPEATC Typesetting: REPEAT_GTCL [468] Typesetting: REPEAT_TCL [469] Typesetting: replicate Typesetting: rep_goals Typesetting: resume_recording [470] Overfull \hbox (35.74004pt too wide) in paragraph at lines 21535--21538 []\OT1/cmr/m/n/12 The cur-rent state of the proof recorder can in-ter-ro-gated us-ing the func-tion []\OT1/cmtt/m/n/10.95 is_recording_proof\OT1/cmr/m/n/12 . Typesetting: RES_CANON [471] Underfull \vbox (badness 10000) has occurred while \output is active [472] [473] Typesetting: RES_TAC [474] Typesetting: RES_THEN [475] [476] Typesetting: rev Typesetting: REVERSE_CONV Typesetting: rev_assoc [477] Typesetting: rev_itlist [478] Typesetting: REWRITE_CONV Overfull \hbox (2.5708pt too wide) in paragraph at lines 21939--21942 []\OT1/cmr/m/n/12 Variants of this con-ver-sion al-low changes in the set of eq ua-tions used: []\OT1/cmtt/m/n/10.95 PURE_REWRITE_CONV [479] Typesetting: REWRITE_RULE [480] Typesetting: REWRITE_TAC [481] Typesetting: REWR_CONV [482] [483] [484] Typesetting: REW_DEPTH_CONV [485] [486] Typesetting: rhs Typesetting: RIGHT_AND_EXISTS_CONV Typesetting: RIGHT_AND_FORALL_CONV [487] Typesetting: RIGHT_BETA [488] Typesetting: RIGHT_CONV_RULE Typesetting: RIGHT_IMP_EXISTS_CONV [489] Typesetting: RIGHT_IMP_FORALL_CONV Typesetting: RIGHT_LIST_BETA [490] Typesetting: RIGHT_OR_EXISTS_CONV [491] Typesetting: RIGHT_OR_FORALL_CONV Typesetting: root_goal Typesetting: rotate [492] Underfull \vbox (badness 10000) has occurred while \output is active [493] Typesetting: rotate_goals [494] Typesetting: rotate_top Typesetting: RULE_ASSUM_TAC Typesetting: S [495] Typesetting: save Typesetting: save_thm [496] Typesetting: save_top_thm [497] Typesetting: SCANL_CONV [498] Typesetting: SCANR_CONV [499] [500] Typesetting: search_path [501] Typesetting: SEG_CONV Typesetting: SELECT_CONV [502] Typesetting: SELECT_ELIM [503] [504] Typesetting: SELECT_EQ [505] Typesetting: SELECT_INTRO Typesetting: SELECT_RULE [506] Underfull \vbox (badness 1033) has occurred while \output is active [507] Typesetting: setify Typesetting: set_equal [508] Typesetting: set_fail [509] Typesetting: set_fail_prefix [510] Typesetting: set_flag Typesetting: set_goal [511] [512] Typesetting: set_help Typesetting: set_help_search_path [513] Typesetting: set_interface_map [514] Typesetting: set_lambda [515] Typesetting: set_library_search_path [516] Typesetting: set_margin Typesetting: set_pretty_mode [517] Typesetting: set_prompt Typesetting: set_search_path Underfull \vbox (badness 1259) has occurred while \output is active [518] [519] Typesetting: set_state [520] Typesetting: set_sticky_type Underfull \vbox (badness 1484) has occurred while \output is active [521] Typesetting: set_string_escape Typesetting: set_thm_count [522] Typesetting: set_turnstile Typesetting: show_types [523] Underfull \vbox (badness 3525) has occurred while \output is active [524] Typesetting: SKOLEM_CONV Typesetting: snd [525] Typesetting: SNOC_CONV Typesetting: SNOC_INDUCT_TAC [526] Typesetting: SOME_EL_CONV [527] Typesetting: sort [528] Typesetting: SPEC [529] Typesetting: special_symbols [530] Typesetting: SPECL [531] Typesetting: SPEC_ALL [532] Typesetting: SPEC_TAC [533] Typesetting: SPEC_VAR Typesetting: split [534] Typesetting: splitp Typesetting: sticky_list [535] Typesetting: store_binders Typesetting: store_definition Typesetting: string_of_int [536] Typesetting: strip_abs Typesetting: STRIP_ASSUME_TAC [537] Underfull \vbox (badness 10000) has occurred while \output is active [538] Typesetting: strip_comb Typesetting: strip_exists [539] Typesetting: strip_forall [540] Typesetting: STRIP_GOAL_THEN Underfull \vbox (badness 1859) has occurred while \output is active [541] Typesetting: strip_imp [542] Typesetting: strip_pair Typesetting: STRIP_TAC [543] [544] Typesetting: STRIP_THM_THEN [545] [546] Typesetting: STRUCT_CASES_TAC [547] Typesetting: SUBGOAL_THEN [548] Typesetting: SUBS [549] Typesetting: SUBST [550] [551] Typesetting: subst [552] Typesetting: SUBST1_TAC [553] Typesetting: SUBST_ALL_TAC [554] Typesetting: SUBST_CONV [555] [556] Typesetting: SUBST_MATCH Underfull \vbox (badness 3375) has occurred while \output is active [557] Typesetting: subst_occs Typesetting: SUBST_OCCS_TAC [558] [559] Typesetting: SUBST_TAC [560] Typesetting: SUBS_OCCS [561] Typesetting: subtract [562] Typesetting: SUB_CONV [563] Typesetting: suspend_recording Overfull \hbox (35.74004pt too wide) in paragraph at lines 25918--25921 []\OT1/cmr/m/n/12 The cur-rent state of the proof recorder can in-ter-ro-gated us-ing the func-tion []\OT1/cmtt/m/n/10.95 is_recording_proof\OT1/cmr/m/n/12 . Typesetting: SWAP_EXISTS_CONV [564] Typesetting: SYM Typesetting: SYM_CONV [565] Typesetting: syserror Typesetting: system [566] Typesetting: TAC_PROOF [567] Typesetting: term_of_int Typesetting: THEN [568] Typesetting: THENC Typesetting: THENL [569] Typesetting: THEN_TCL [570] Typesetting: theorem [571] Typesetting: theorems Typesetting: theorem_lfn [572] Typesetting: theorem_msg_lfn [573] Typesetting: thm_count Typesetting: thm_frees [574] Typesetting: timer [575] Typesetting: tl [576] Typesetting: TOP_DEPTH_CONV Typesetting: top_goal [577] Typesetting: top_print [578] Typesetting: top_proof [579] Typesetting: top_thm Typesetting: TRANS [580] Typesetting: TRY Typesetting: tryfind [581] Typesetting: TRY_CONV Typesetting: tty_read [582] Typesetting: tty_write [583] Typesetting: types Underfull \vbox (badness 3039) has occurred while \output is active [584] Typesetting: type_abbrevs Typesetting: type_in [585] Typesetting: type_in_type [586] Typesetting: type_of Typesetting: type_tyvars [587] Typesetting: tyvars [588] Typesetting: tyvarsl [589] Typesetting: uncurry Typesetting: UNDISCH [590] Typesetting: UNDISCH_ALL Typesetting: UNDISCH_TAC [591] Typesetting: undo_autoload Typesetting: unhide_constant [592] Typesetting: union Typesetting: unlink [593] Typesetting: VALID [594] Typesetting: variant [595] Typesetting: vars Typesetting: varsl [596] Typesetting: version [597] Typesetting: W Typesetting: words [598] Typesetting: words2 Typesetting: word_separators [599] Typesetting: write [600] Typesetting: X_CASES_THEN [601] Typesetting: X_CASES_THENL [602] [603] Typesetting: X_CHOOSE_TAC [604] Typesetting: X_CHOOSE_THEN [605] Typesetting: X_FUN_EQ_CONV [606] Typesetting: X_GEN_TAC [607] Typesetting: X_SKOLEM_CONV ) [608] (./theorems.tex Chapter 2. (./theorems-intro.tex) [609] [610] [611] [612] [613] [614] [615] [616] [617] [618] [619] [620] [621] [622] [623] [624] [625] [626] [627] [628] [629] [630] [631] [632] [633] [634] [635] [636] [637] [638] [639] [640] [641] [642] [643] [644] [645] [646] [647] [648] [649] [650] [651] [652] [653] [654] [655] [656] [657] [658] [659] [660]) [661] [662] (./index.tex [663]) (./reference.aux (./title.aux) (./preface.aux) (./ack.aux) (./contents.aux) (./entries.aux) (./theorems.aux) (./index.aux)) ) (see the transcript file for additional information) Output written on reference.dvi (669 pages, 1155380 bytes). Transcript written on reference.log. make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Reference' make[3]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Reference' ====> REFERENCE made make[2]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual' make[2]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual' (cd Libraries; make all; cd ..) make[3]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Libraries' make clean; make individual-libraries; make libraries make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Libraries' rm -f *.dvi *.aux *.toc *.log make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Libraries' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Libraries' for lib in abs_theory arith finite_sets more_arithmetic numeral pair parser pred_sets prettyp reals record_proof reduce res_quan sets string taut trs unwind wellorder window word ; \ do (cd ../../Library/$lib/Manual; make all) ; \ done make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory/Manual' make clean; make ids; make abs_theory; make index; make abs_theory make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory/Manual' \ rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex; \ printf '\\begin{theindex}' >index.tex; \ printf '\\mbox{}' >>index.tex; \ printf '\\end{theindex}' >>index.tex make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory/Manual' \ printf '\\chapter{ML Functions in the {\\tt abs\\_theory} Library}' >entries.tex; \ printf '\\input{entries-intro}' >>entries.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory/Manual' \ latex abs_theory.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./abs_theory.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) (./hol_macros.tex) Writing index file abs_theory.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file abs_theory.aux. (./title.tex [1] [2]) No file abs_theory.toc. [1] (./description.tex [2] Chapter 1. LaTeX Warning: Citation `gordon1' on page 3 undefined on input line 24. LaTeX Warning: Citation `windley:abs-old' on page 3 undefined on input line 26. [3] LaTeX Warning: Citation `obj-ref-man' on page 4 undefined on input line 58. LaTeX Warning: Citation `obj-param-prog' on page 4 undefined on input line 62. LaTeX Warning: Citation `ehdm:manual' on page 4 undefined on input line 93. [4] LaTeX Warning: Citation `windley:ah' on page 5 undefined on input line 123. LaTeX Warning: Citation `windley:git' on page 5 undefined on input line 123. [5] [6] (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) Overfull \hbox (6.00002pt too wide) in paragraph at lines 252--256 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 261--268 [] [7] Overfull \hbox (6.00002pt too wide) in paragraph at lines 278--286 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 298--303 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 306--312 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 316--328 [] [8] Overfull \hbox (6.00002pt too wide) in paragraph at lines 334--351 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 354--367 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 370--385 [] [9] Overfull \hbox (6.00002pt too wide) in paragraph at lines 388--406 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 419--435 [] [10] Overfull \hbox (6.00002pt too wide) in paragraph at lines 453--459 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 465--475 [] Underfull \vbox (badness 4072) has occurred while \output is active [11] Overfull \hbox (6.00002pt too wide) in paragraph at lines 485--494 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 501--512 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 521--531 [] [12] Overfull \hbox (19.85928pt too wide) in paragraph at lines 539--542 \OT1/cmr/m/n/12 the fol-low-ing check of the type of the ab-stract rep-re-sen-t a-tion vari-able [] in []: Overfull \hbox (6.00002pt too wide) in paragraph at lines 542--546 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 551--571 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 580--599 [] [13] Overfull \hbox (6.00002pt too wide) in paragraph at lines 609--626 [] Overfull \hbox (22.99396pt too wide) in paragraph at lines 627--632 \OT1/cmr/m/n/12 be used. In this case, we use [] and so the tac-tic [] Underfull \vbox (badness 1616) has occurred while \output is active [14] Overfull \hbox (6.00002pt too wide) in paragraph at lines 638--646 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 650--658 [] Overfull \hbox (25.78333pt too wide) in paragraph at lines 659--661 \OT1/cmr/m/n/12 Note that we have cre-ated our con-crete rep-re-sen-ta-tion us- ing []. Overfull \hbox (6.00002pt too wide) in paragraph at lines 665--689 [] Underfull \vbox (badness 10000) has occurred while \output is active [15] [16]) [17] (./entries.tex [18] Chapter 2. (./entries-intro.tex) [19] [20] [21] Overfull \hbox (39.14307pt too wide) in paragraph at lines 143--144 []\OT1/cmtt/m/n/10.95 instantiate_abstract_definition : string -> string -> thm -> (term # term) list -> thm Overfull \hbox (67.8865pt too wide) in paragraph at lines 169--170 []\OT1/cmtt/m/n/10.95 instantiate_abstract_theorem : string -> string -> (term # term) list -> (thm) list) -> thm [22] [23] [24] [25] [26] [27]) [28] (./index.tex [29]) (./abs_theory.aux (./title.aux) (./description.aux) (./entries.aux) (./index.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) (see the transcript file for additional information) Output written on abs_theory.dvi (31 pages, 65416 bytes). Transcript written on abs_theory.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory/Manual' \ ../../../Manual/LaTeX/makeindex ../../../ abs_theory.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory/Manual' \ latex abs_theory.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./abs_theory.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) (./hol_macros.tex) Writing index file abs_theory.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./abs_theory.aux (./title.aux) (./description.aux) (./entries.aux) (./index.aux)) (./title.tex [1] [2]) (./abs_theory.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd)) [1] (./description.tex [2] Chapter 1. [3] [4] [5] [6] Overfull \hbox (6.00002pt too wide) in paragraph at lines 252--256 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 261--268 [] [7] Overfull \hbox (6.00002pt too wide) in paragraph at lines 278--286 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 298--303 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 306--312 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 316--328 [] [8] Overfull \hbox (6.00002pt too wide) in paragraph at lines 334--351 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 354--367 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 370--385 [] [9] Overfull \hbox (6.00002pt too wide) in paragraph at lines 388--406 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 419--435 [] [10] Overfull \hbox (6.00002pt too wide) in paragraph at lines 453--459 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 465--475 [] Underfull \vbox (badness 4072) has occurred while \output is active [11] Overfull \hbox (6.00002pt too wide) in paragraph at lines 485--494 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 501--512 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 521--531 [] [12] Overfull \hbox (19.85928pt too wide) in paragraph at lines 539--542 \OT1/cmr/m/n/12 the fol-low-ing check of the type of the ab-stract rep-re-sen-t a-tion vari-able [] in []: Overfull \hbox (6.00002pt too wide) in paragraph at lines 542--546 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 551--571 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 580--599 [] [13] Overfull \hbox (6.00002pt too wide) in paragraph at lines 609--626 [] Overfull \hbox (22.99396pt too wide) in paragraph at lines 627--632 \OT1/cmr/m/n/12 be used. In this case, we use [] and so the tac-tic [] Underfull \vbox (badness 1616) has occurred while \output is active [14] Overfull \hbox (6.00002pt too wide) in paragraph at lines 638--646 [] Overfull \hbox (6.00002pt too wide) in paragraph at lines 650--658 [] Overfull \hbox (25.78333pt too wide) in paragraph at lines 659--661 \OT1/cmr/m/n/12 Note that we have cre-ated our con-crete rep-re-sen-ta-tion us- ing []. Overfull \hbox (6.00002pt too wide) in paragraph at lines 665--689 [] Underfull \vbox (badness 10000) has occurred while \output is active [15] [16]) [17] (./entries.tex [18] Chapter 2. (./entries-intro.tex) [19] [20] [21] Overfull \hbox (39.14307pt too wide) in paragraph at lines 143--144 []\OT1/cmtt/m/n/10.95 instantiate_abstract_definition : string -> string -> thm -> (term # term) list -> thm Overfull \hbox (67.8865pt too wide) in paragraph at lines 169--170 []\OT1/cmtt/m/n/10.95 instantiate_abstract_theorem : string -> string -> (term # term) list -> (thm) list) -> thm [22] [23] [24] [25] [26] [27]) [28] (./index.tex [29]) (./abs_theory.aux (./title.aux) (./description.aux) (./entries.aux) (./index.aux)) ) (see the transcript file for additional information) Output written on abs_theory.dvi (31 pages, 68556 bytes). Transcript written on abs_theory.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/abs_theory/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith/Manual' make clean; make tex; make arith; make index; make arith make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith/Manual' /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex TeX files made make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith/Manual' latex arith.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./arith.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file arith.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file arith.aux. (./title.tex [1] [2]) No file arith.toc. [3] [4] (./description.tex Chapter 1. LaTeX Warning: Citation `description' on page 1 undefined on input line 4. (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) LaTeX Warning: Citation `VarElimHodes' on page 1 undefined on input line 49. LaTeX Warning: Citation `SUPINFShostak' on page 1 undefined on input line 55. LaTeX Warning: Citation `SUPINFBledsoe' on page 1 undefined on input line 57. [1] LaTeX Warning: Citation `EfficFullyExpTP' on page 2 undefined on input line 67. LaTeX Warning: Citation `reduce' on page 2 undefined on input line 81. [2] [3]) [4] (./entries.tex Chapter 2. (./entries-intro.tex) [5] [6] Underfull \vbox (badness 1077) has occurred while \output is active [7] Underfull \vbox (badness 1708) has occurred while \output is active [8] [9] [10] [11] [12] [13] [14] [15] [16] [17]) [18] (./references.tex) [19] (./index.tex [20]) (./arith.aux (./title.aux) (./description.aux) (./entries.aux) (./references.aux) (./index.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) (see the transcript file for additional information) Output written on arith.dvi (24 pages, 43920 bytes). Transcript written on arith.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith/Manual' ../../../Manual/LaTeX/makeindex ../../../ arith.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith/Manual' latex arith.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./arith.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file arith.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./arith.aux (./title.aux) (./description.aux) (./entries.aux) (./references.aux) (./index.aux)) (./title.tex [1] [2]) (./arith.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd)) [3] [4] (./description.tex Chapter 1. [1] [2] [3]) [4] (./entries.tex Chapter 2. (./entries-intro.tex) [5] [6] Underfull \vbox (badness 1077) has occurred while \output is active [7] Underfull \vbox (badness 1708) has occurred while \output is active [8] [9] [10] [11] [12] [13] [14] [15] [16] [17]) [18] (./references.tex) [19] (./index.tex [20]) (./arith.aux (./title.aux) (./description.aux) (./entries.aux) (./references.aux) (./index.aux)) ) (see the transcript file for additional information) Output written on arith.dvi (24 pages, 45556 bytes). Transcript written on arith.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/arith/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets/Manual' make clean; make tex; make finite_sets; make index; make finite_sets make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets/Manual' /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/sdef theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/basic theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/subs theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/unin theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/diff theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/del theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/disj theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/chre theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/image theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/fun theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/sing theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/card theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex TeX files made make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets/Manual' latex finite_sets.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./finite_sets.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file finite_sets.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file finite_sets.aux. (./title.tex [1] [2]) No file finite_sets.toc. [3] [4] (./description.tex Chapter 1. LaTeX Warning: Citation `melham' on page 1 undefined on input line 19. LaTeX Warning: Citation `manna' on page 1 undefined on input line 21. [1] (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) LaTeX Warning: Citation `ind-defs' on page 2 undefined on input line 66. [2] LaTeX Warning: Reference `theorems' on page 3 undefined on input line 179. [3] LaTeX Warning: Citation `manna' on page 4 undefined on input line 222. LaTeX Warning: Citation `description' on page 4 undefined on input line 237. [4] [5] LaTeX Warning: Reference `abst' on page 6 undefined on input line 334. LaTeX Warning: Reference `abst' on page 6 undefined on input line 351. LaTeX Warning: Reference `theorems' on page 6 undefined on input line 379. LaTeX Warning: Reference `theorems' on page 6 undefined on input line 395. [6] LaTeX Warning: Reference `theorems' on page 7 undefined on input line 436. [7] LaTeX Warning: Reference `inconv' on page 8 undefined on input line 551. [8] [9] LaTeX Warning: Reference `finite' on page 10 undefined on input line 643. LaTeX Warning: Reference `entries' on page 10 undefined on input line 683. [10] [11] LaTeX Warning: Reference `theorems' on page 12 undefined on input line 804. LaTeX Warning: Reference `theorems' on page 12 undefined on input line 834. [12] LaTeX Warning: Reference `entries' on page 13 undefined on input line 903. [13] LaTeX Warning: Reference `theorems' on page 14 undefined on input line 950. [14] LaTeX Warning: Reference `theorems' on page 15 undefined on input line 1007. LaTeX Warning: Reference `theorems' on page 15 undefined on input line 1035. [15] LaTeX Warning: Reference `theorems' on page 16 undefined on input line 1108. LaTeX Warning: Reference `abst' on page 16 undefined on input line 1129. LaTeX Warning: Reference `finite' on page 16 undefined on input line 1129. [16] [17]) [18] (./entries.tex Chapter 2. (./entries-intro.tex) [19] [20] [21] [22] [23] [24] [25] [26]) [27] (./theorems.tex [28] Chapter 3. (./theorems-intro.tex) [29] [30] [31] [32] [33] [34] [35] [36] [37] [38]) [39] (./references.tex [40]) [41] (./index.tex [42]) (./finite_sets.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./references.aux) (./index.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) Output written on finite_sets.dvi (46 pages, 101536 bytes). Transcript written on finite_sets.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets/Manual' ../../../Manual/LaTeX/makeindex ../../../ finite_sets.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets/Manual' latex finite_sets.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./finite_sets.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file finite_sets.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./finite_sets.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./references.aux) (./index.aux)) (./title.tex [1] [2]) (./finite_sets.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [3]) [4] (./description.tex Chapter 1. [1] [2] [3] [4] [5] LaTeX Warning: Reference `abst' on page 6 undefined on input line 334. LaTeX Warning: Reference `abst' on page 6 undefined on input line 351. [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] LaTeX Warning: Reference `abst' on page 16 undefined on input line 1129. [16] [17]) [18] (./entries.tex Chapter 2. (./entries-intro.tex) [19] [20] [21] [22] [23] [24] [25] [26]) [27] (./theorems.tex [28] Chapter 3. (./theorems-intro.tex) [29] [30] [31] [32] [33] [34] [35] [36] [37] [38]) [39] (./references.tex [40]) [41] (./index.tex [42]) (./finite_sets.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./references.aux) (./index.aux)) LaTeX Warning: There were undefined references. ) Output written on finite_sets.dvi (46 pages, 113540 bytes). Transcript written on finite_sets.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/finite_sets/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic/Manual' make clean; make tex; make more_arithmetic; make index; make more_arithmetic make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic/Manual' /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/ineq theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/zero_ineq theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/suc theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/pre theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/add theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/sub theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/mult theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/div_mod theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/min_max theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/odd_even theorems.tex TeX files made make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic/Manual' latex more_arithmetic.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./more_arithmetic.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (/usr/share/texlive/texmf-dist/tex/latex/base/makeidx.sty) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file more_arithmetic.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file more_arithmetic.aux. (./title.tex [1]) [2] (./ack.tex Underfull \hbox (badness 10000) in paragraph at lines 7--17 [3]) [4] No file more_arithmetic.toc. [1] (./description.tex (./intro.tex [2] Chapter 1. LaTeX Warning: Reference `thms' on page 3 undefined on input line 78. ) (./ineq.tex [3] (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd)) (./zero_ineq.tex) (./suc.tex) (./pre.tex [4]) (./add.tex) (./sub.tex) (./mult.tex [5]) (./div_mod.tex) (./min_max.tex [6]) (./odd_even.tex) (./using.tex [7] [8])) [9] (./entries.tex [10] Chapter 2. (./entries-intro.tex) [11] [12] [13]) [14] (./theorems.tex Chapter 3. (./theorems-intro.tex) [15] [16] [17] [18] [19] [20] [21] [22] [23]) [24] (./index.tex [25]) (./more_arithmetic.aux (./title.aux) (./ack.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./index.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) (see the transcript file for additional information) Output written on more_arithmetic.dvi (29 pages, 41580 bytes). Transcript written on more_arithmetic.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic/Manual' ../../../Manual/LaTeX/makeindex ../../../ more_arithmetic.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic/Manual' latex more_arithmetic.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./more_arithmetic.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (/usr/share/texlive/texmf-dist/tex/latex/base/makeidx.sty) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file more_arithmetic.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./more_arithmetic.aux (./title.aux) (./ack.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./index.aux)) (./title.tex [1]) [2] (./ack.tex Underfull \hbox (badness 10000) in paragraph at lines 7--17 [3]) [4] (./more_arithmetic.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd)) [1] (./description.tex (./intro.tex [2] Chapter 1. ) (./ineq.tex [3]) (./zero_ineq.tex) (./suc.tex) (./pre.tex [4]) (./add.tex) (./sub.tex) (./mult.tex [5]) (./div_mod.tex) (./min_max.tex [6]) (./odd_even.tex) (./using.tex [7] [8])) [9] (./entries.tex [10] Chapter 2. (./entries-intro.tex) [11] [12] [13]) [14] (./theorems.tex Chapter 3. (./theorems-intro.tex) [15] [16] [17] [18] [19] [20] [21] [22] [23]) [24] (./index.tex [25]) (./more_arithmetic.aux (./title.aux) (./ack.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./index.aux)) ) (see the transcript file for additional information) Output written on more_arithmetic.dvi (29 pages, 50408 bytes). Transcript written on more_arithmetic.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/more_arithmetic/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral/Manual' make clean; make thms; make ids; make numeral; make index; make numeral make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral/Manual' \ rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex; \ printf '\\begin{theindex}' >index.tex; \ printf '\\mbox{}' >>index.tex; \ printf '\\end{theindex}' >>index.tex make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral/Manual' \ printf '\\chapter{Pre-proved Theorems}' > theorems.tex; \ printf '\\input{theorems-intro}' >> theorems.tex; \ printf '\\section{Numeral theory}' >> theorems.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/numeral theorems.tex make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral/Manual' \ printf '\\chapter{ML Functions in the numeral Library}' >entries.tex; \ printf '\\input{entries-intro}' >>entries.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral/Manual' \ latex numeral.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./numeral.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file numeral.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file numeral.aux. (./title.tex [1] [2]) No file numeral.toc. [3] [4] (./description.tex Chapter 1. (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [1] [2] [3]) [4] [5] (./entries.tex [6] Chapter 2. (./entries-intro.tex) [7] [8] [9] Overfull \hbox (7.90205pt too wide) in paragraph at lines 173--179 \OT1/cmr/m/n/12 The ar-gu-ment to []\OT1/cmtt/m/n/10.95 BASEN_EXP_CONV \OT1/cmr /m/n/12 must be of the form []\OT1/cmtt/m/n/10.95 "BASEN r [...] EXP BASEN r [. ..]"\OT1/cmr/m/n/12 , [10] [11] [12] [13] [14] [15] [16] Underfull \vbox (badness 1226) has occurred while \output is active [17] Underfull \vbox (badness 1953) has occurred while \output is active [18] Overfull \hbox (61.50963pt too wide) in paragraph at lines 552--555 \OT1/cmr/m/n/12 If []\OT1/cmtt/m/n/10.95 m \OT1/cmr/m/n/12 is a list of dig-its in base []\OT1/cmtt/m/n/10.95 r\OT1/cmr/m/n/12 , and []\OT1/cmtt/m/n/10.95 m \ OT1/cmr/m/n/12 is a list of dig-its in base []\OT1/cmtt/m/n/10.95 r\OT1/cmr/m/n /12 , then []\OT1/cmtt/m/n/10.95 BASEN_PRE_CONV "PRE (BASEN r m)" Underfull \vbox (badness 1354) has occurred while \output is active [19] [20] Overfull \hbox (61.50963pt too wide) in paragraph at lines 636--639 \OT1/cmr/m/n/12 If []\OT1/cmtt/m/n/10.95 m \OT1/cmr/m/n/12 is a list of dig-its in base []\OT1/cmtt/m/n/10.95 r\OT1/cmr/m/n/12 , and []\OT1/cmtt/m/n/10.95 m \ OT1/cmr/m/n/12 is a list of dig-its in base []\OT1/cmtt/m/n/10.95 r\OT1/cmr/m/n /12 , then []\OT1/cmtt/m/n/10.95 BASEN_SUC_CONV "SUC (BASEN r m)" [21] [22] [23] [24] [25] Overfull \hbox (32.0876pt too wide) in paragraph at lines 844--847 \OT1/cmr/m/n/12 If []\OT1/cmtt/m/n/10.95 m \OT1/cmr/m/n/12 is a list of dig-its , and []\OT1/cmtt/m/n/10.95 m \OT1/cmr/m/n/12 is empty or the first digit of [] \OT1/cmtt/m/n/10.95 m \OT1/cmr/m/n/12 is nonzero, then []\OT1/cmtt/m/n/10.95 IS _NORMALIZED_CONV "m" [26] [27] [28]) [29] (./theorems.tex [30] Chapter 3. (./theorems-intro.tex) [31] [32] [33] [34] [35] [36] [37] [38] [39]) [40] (./index.tex [41]) (./numeral.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./index.aux)) LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) (see the transcript file for additional information) Output written on numeral.dvi (45 pages, 67176 bytes). Transcript written on numeral.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral/Manual' \ ../../../Manual/LaTeX/makeindex ../../../ numeral.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral/Manual' \ latex numeral.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./numeral.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file numeral.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./numeral.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./index.aux)) (./title.tex [1] [2]) (./numeral.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd)) [3] [4] (./description.tex Chapter 1. [1] [2] [3]) [4] [5] (./entries.tex [6] Chapter 2. (./entries-intro.tex) [7] [8] [9] Overfull \hbox (7.90205pt too wide) in paragraph at lines 173--179 \OT1/cmr/m/n/12 The ar-gu-ment to []\OT1/cmtt/m/n/10.95 BASEN_EXP_CONV \OT1/cmr /m/n/12 must be of the form []\OT1/cmtt/m/n/10.95 "BASEN r [...] EXP BASEN r [. ..]"\OT1/cmr/m/n/12 , [10] [11] [12] [13] [14] [15] [16] Underfull \vbox (badness 1226) has occurred while \output is active [17] Underfull \vbox (badness 1953) has occurred while \output is active [18] Overfull \hbox (61.50963pt too wide) in paragraph at lines 552--555 \OT1/cmr/m/n/12 If []\OT1/cmtt/m/n/10.95 m \OT1/cmr/m/n/12 is a list of dig-its in base []\OT1/cmtt/m/n/10.95 r\OT1/cmr/m/n/12 , and []\OT1/cmtt/m/n/10.95 m \ OT1/cmr/m/n/12 is a list of dig-its in base []\OT1/cmtt/m/n/10.95 r\OT1/cmr/m/n /12 , then []\OT1/cmtt/m/n/10.95 BASEN_PRE_CONV "PRE (BASEN r m)" Underfull \vbox (badness 1354) has occurred while \output is active [19] [20] Overfull \hbox (61.50963pt too wide) in paragraph at lines 636--639 \OT1/cmr/m/n/12 If []\OT1/cmtt/m/n/10.95 m \OT1/cmr/m/n/12 is a list of dig-its in base []\OT1/cmtt/m/n/10.95 r\OT1/cmr/m/n/12 , and []\OT1/cmtt/m/n/10.95 m \ OT1/cmr/m/n/12 is a list of dig-its in base []\OT1/cmtt/m/n/10.95 r\OT1/cmr/m/n /12 , then []\OT1/cmtt/m/n/10.95 BASEN_SUC_CONV "SUC (BASEN r m)" [21] [22] [23] [24] [25] Overfull \hbox (32.0876pt too wide) in paragraph at lines 844--847 \OT1/cmr/m/n/12 If []\OT1/cmtt/m/n/10.95 m \OT1/cmr/m/n/12 is a list of dig-its , and []\OT1/cmtt/m/n/10.95 m \OT1/cmr/m/n/12 is empty or the first digit of [] \OT1/cmtt/m/n/10.95 m \OT1/cmr/m/n/12 is nonzero, then []\OT1/cmtt/m/n/10.95 IS _NORMALIZED_CONV "m" [26] [27] [28]) [29] (./theorems.tex [30] Chapter 3. (./theorems-intro.tex) [31] [32] [33] [34] [35] [36] [37] [38] [39]) [40] (./index.tex [41]) (./numeral.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./index.aux)) ) (see the transcript file for additional information) Output written on numeral.dvi (45 pages, 69876 bytes). Transcript written on numeral.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/numeral/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair/Manual' make clean; \ make ids; \ make theorems; \ make pair; \ make index; \ make pair make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex theorems.tex; \ printf '\\begin{theindex}' >index.tex; \ printf '\\mbox{}' >>index.tex; \ printf '\\end{theindex}' >>index.tex make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair/Manual' printf '\\chapter{ML Functions in the pair Library}' >entries.tex; \ printf '\\input{entries-intro}' >>entries.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair/Manual' /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms theorems.tex make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair/Manual' make[6]: 'pair' is up to date. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair/Manual' ../../../Manual/LaTeX/makeindex ../../../ index.tex pair makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair/Manual' make[6]: 'pair' is up to date. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pair/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser/Manual' make clean; make tex; make parser; make index; make parser make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser/Manual' /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex TeX files made make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser/Manual' latex parser.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./parser.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file parser.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file parser.aux. (./title.tex [1] [2]) No file parser.toc. [3] [4] (./description.tex Chapter 1. [1] (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) LaTeX Warning: Reference `BNFsec' on page 2 undefined on input line 103. LaTeX Warning: Reference `reserved' on page 2 undefined on input line 104. [2] LaTeX Warning: Reference `Internals' on page 3 undefined on input line 167. Underfull \vbox (badness 10000) has occurred while \output is active [3] LaTeX Warning: Reference `reserved' on page 4 undefined on input line 247. LaTeX Warning: Reference `SEPS' on page 4 undefined on input line 248. [4] [5] [6] LaTeX Warning: Reference `reserved' on page 7 undefined on input line 390. LaTeX Warning: Reference `actions' on page 7 undefined on input line 390. [7] [8] [9] [10] [11] Underfull \vbox (badness 1394) has occurred while \output is active [12] [13] Underfull \vbox (badness 10000) has occurred while \output is active [14] [15] [16] [17]) [18] (./entries.tex Chapter 2. (./entries-intro.tex)) [19] (./theorems.tex [20] Chapter 3. ) [21] (./references.tex [22]) [23] (./index.tex [24]) (./parser.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./references.aux) (./index.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) (see the transcript file for additional information) Output written on parser.dvi (28 pages, 54108 bytes). Transcript written on parser.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser/Manual' ../../../Manual/LaTeX/makeindex ../../../ parser.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser/Manual' latex parser.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./parser.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file parser.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./parser.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux ) (./references.aux) (./index.aux)) (./title.tex [1] [2]) (./parser.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd)) [3] [4] (./description.tex Chapter 1. [1] [2] Underfull \vbox (badness 10000) has occurred while \output is active [3] [4] [5] [6] [7] [8] [9] [10] [11] Underfull \vbox (badness 1394) has occurred while \output is active [12] [13] Underfull \vbox (badness 10000) has occurred while \output is active [14] [15] [16] [17]) [18] (./entries.tex Chapter 2. (./entries-intro.tex)) [19] (./theorems.tex [20] Chapter 3. ) [21] (./references.tex [22]) [23] (./index.tex [24]) (./parser.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./references.aux) (./index.aux)) ) (see the transcript file for additional information) Output written on parser.dvi (28 pages, 59576 bytes). Transcript written on parser.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/parser/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets/Manual' make clean; make tex; make pred_sets; make index; make pred_sets make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets/Manual' /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/mem theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/emuniv theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/subs theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/unin theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/diff theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/disj theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/insdel theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/chre theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/image theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/fun theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/sing theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/fin theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/card theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex TeX files made make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets/Manual' latex pred_sets.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./pred_sets.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file pred_sets.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file pred_sets.aux. (./title.tex [1] [2]) No file pred_sets.toc. [3] [4] (./description.tex Chapter 1. LaTeX Warning: Citation `melham' on page 1 undefined on input line 13. (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [1] LaTeX Warning: Citation `description' on page 2 undefined on input line 134. [2] LaTeX Warning: Reference `using' on page 3 undefined on input line 155. [3] [4] [5] LaTeX Warning: Reference `theorems' on page 6 undefined on input line 364. LaTeX Warning: Reference `abst' on page 6 undefined on input line 427. [6] LaTeX Warning: Reference `abst' on page 7 undefined on input line 444. LaTeX Warning: Reference `theorems' on page 7 undefined on input line 472. LaTeX Warning: Reference `theorems' on page 7 undefined on input line 488. [7] LaTeX Warning: Reference `theorems' on page 8 undefined on input line 529. LaTeX Warning: Citation `description' on page 8 undefined on input line 539. [8] [9] LaTeX Warning: Reference `inconv' on page 10 undefined on input line 687. [10] [11] LaTeX Warning: Reference `finite' on page 12 undefined on input line 779. LaTeX Warning: Reference `entries' on page 12 undefined on input line 819. [12] [13] LaTeX Warning: Reference `theorems' on page 14 undefined on input line 941. LaTeX Warning: Reference `theorems' on page 14 undefined on input line 971. [14] LaTeX Warning: Reference `entries' on page 15 undefined on input line 1041. [15] LaTeX Warning: Reference `theorems' on page 16 undefined on input line 1089. [16] LaTeX Warning: Reference `theorems' on page 17 undefined on input line 1146. LaTeX Warning: Reference `theorems' on page 17 undefined on input line 1174. [17] [18] LaTeX Warning: Reference `theorems' on page 19 undefined on input line 1291. LaTeX Warning: Reference `abst' on page 19 undefined on input line 1312. LaTeX Warning: Reference `finite' on page 19 undefined on input line 1312. [19] [20]) [21] (./entries.tex [22] Chapter 2. (./entries-intro.tex) [23] [24] [25] [26] [27] [28] [29] [30] [31]) [32] (./theorems.tex Chapter 3. (./theorems-intro.tex) [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45]) [46] (./references.tex) [47] (./index.tex [48]) (./pred_sets.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./references.aux) (./index.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) Output written on pred_sets.dvi (52 pages, 115488 bytes). Transcript written on pred_sets.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets/Manual' ../../../Manual/LaTeX/makeindex ../../../ pred_sets.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets/Manual' latex pred_sets.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./pred_sets.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file pred_sets.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./pred_sets.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./references.aux) (./index.aux)) (./title.tex [1] [2]) (./pred_sets.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [3]) [4] (./description.tex Chapter 1. [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20]) [21] (./entries.tex [22] Chapter 2. (./entries-intro.tex) [23] [24] [25] [26] [27] [28] [29] [30] [31]) [32] (./theorems.tex Chapter 3. (./theorems-intro.tex) [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45]) [46] (./references.tex) [47] (./index.tex [48]) (./pred_sets.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./references.aux) (./index.aux)) ) Output written on pred_sets.dvi (52 pages, 128408 bytes). Transcript written on pred_sets.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/pred_sets/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp/Manual' make clean; make tex; make prettyp; make index; make prettyp make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp/Manual' /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex TeX files made make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp/Manual' latex prettyp.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./prettyp.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) (./win-macros.tex) Writing index file prettyp.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file prettyp.aux. (./title.tex [1] [2]) No file prettyp.toc. [3] [4] (./intro.tex Chapter 1. LaTeX Warning: Citation `description' on page 1 undefined on input line 5. LaTeX Warning: Citation `PPML' on page 1 undefined on input line 7. LaTeX Warning: Reference `language' on page 1 undefined on input line 24. LaTeX Warning: Reference `mldatatypes' on page 1 undefined on input line 25. LaTeX Warning: Reference `linking' on page 1 undefined on input line 28. LaTeX Warning: Reference `examples' on page 1 undefined on input line 30. [1] (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [2] [3] [4] [5] [6] [7] Underfull \vbox (badness 1152) has occurred while \output is active [8] [9] [10] [11] [12] [13] [14] [15] LaTeX Warning: Reference `functions' on page 16 undefined on input line 863. [16] [17]) [18] (./language.tex Chapter 2. [19] LaTeX Warning: Reference `declarations' on page 20 undefined on input line 122. [20] LaTeX Warning: Reference `mlfunction' on page 21 undefined on input line 198. LaTeX Warning: Reference `abbreviations' on page 21 undefined on input line 200 . [21] [22] LaTeX Warning: Reference `metavars' on page 23 undefined on input line 305. [23] [24] [25] [26] LaTeX Warning: Reference `patterns' on page 27 undefined on input line 594. LaTeX Warning: Reference `formats' on page 27 undefined on input line 596. LaTeX Warning: Reference `abbreviations' on page 27 undefined on input line 607 . [27] LaTeX Warning: Reference `mlfunction' on page 28 undefined on input line 625. LaTeX Warning: Reference `functions' on page 28 undefined on input line 639. LaTeX Warning: Reference `tests' on page 28 undefined on input line 660. [28] [29] [30] [31] [32] LaTeX Warning: Reference `mlfunction' on page 33 undefined on input line 1011. LaTeX Warning: Reference `abbreviations' on page 33 undefined on input line 101 3. LaTeX Warning: Reference `functions' on page 33 undefined on input line 1033. [33] [34] LaTeX Warning: Reference `patterns' on page 35 undefined on input line 1160. LaTeX Warning: Reference `mlfunction' on page 35 undefined on input line 1171. LaTeX Warning: Reference `abbreviations' on page 35 undefined on input line 117 1. LaTeX Warning: Reference `leafandsubtrans' on page 35 undefined on input line 1 194. [35] [36] LaTeX Warning: Reference `pspecials' on page 37 undefined on input line 1298. [37] [38] [39]) [40] (./functions.tex Chapter 3. [41] [42] [43] [44] [45] LaTeX Warning: Reference `pspecials' on page 46 undefined on input line 372. [46]) [47] (./datatypes.tex [48] Chapter 4. [49] LaTeX Warning: Reference `context' on page 50 undefined on input line 71. ) [50] (./link_to_hol.tex Chapter 5. LaTeX Warning: Reference `mldatatypes' on page 51 undefined on input line 16. LaTeX Warning: Reference `debugging' on page 51 undefined on input line 19. [51] [52] [53] LaTeX Warning: Reference `convterm' on page 54 undefined on input line 245. [54] LaTeX Warning: Reference `convterm' on page 55 undefined on input line 305. [55] LaTeX Warning: Reference `convthm' on page 56 undefined on input line 345. [56] LaTeX Warning: Reference `naming' on page 57 undefined on input line 397. [57] LaTeX Warning: Reference `context' on page 58 undefined on input line 453. LaTeX Warning: Reference `envfuns' on page 58 undefined on input line 454. LaTeX Warning: Reference `compiling' on page 58 undefined on input line 489. [58] LaTeX Warning: Reference `mldatatypes' on page 59 undefined on input line 546. LaTeX Warning: Reference `convhol' on page 59 undefined on input line 549. LaTeX Warning: Reference `otherconv' on page 59 undefined on input line 552. [59] [60]) [61] (./debugging.tex [62] Chapter 6. [63]) [64] (./examples.tex Chapter 7. [65] [66] [67] LaTeX Warning: Reference `language' on page 68 undefined on input line 204. [68] [69] [70] [71] [72] [73] [74] [75] [76] [77] LaTeX Warning: Reference `functions' on page 78 undefined on input line 943. [78] [79] [80]) [81] (./algorithm.tex [82] Chapter 8. (./ppboxmacros.tex) [83] LaTeX Warning: Citation `PPML' on page 84 undefined on input line 68. [84] [85] [86] [87] [88] LaTeX Warning: Reference `hvboxes' on page 89 undefined on input line 448. [89] [90]) [91] (./holppspec.tex [92] Chapter 9. [93] LaTeX Warning: Reference `termprecs' on page 94 undefined on input line 97. [94] [95] [96] [97] LaTeX Warning: Reference `uncurry' on page 98 undefined on input line 359. [98] [99] [100] [101] LaTeX Warning: Reference `abstractions' on page 102 undefined on input line 646 . [102]) [103] (./references.tex [104]) [105] (./syntax.tex [106] Appendix A. [107] [108] [109] [110]) [111] (./types.tex [112] Appendix B. ) [113] (./entries.tex [114] Appendix C. (./entries-intro.tex) Underfull \vbox (badness 10000) has occurred while \output is active [115] [116] [117] [118] [119] [120] [121] [122] [123] [124] [125] [126] [127] [128] [129] [130] [131] [132] [133] [134] [135] [136] [137] [138] [139] [140] [141] [142] [143] [144] [145] [146] [147] [148]) [149] (./index.tex [150]) (./prettyp.aux (./title.aux) (./intro.aux) (./language.aux) (./functions.aux) (./datatypes.aux) (./link_to_hol.aux) (./debugging.aux) (./examples.aux) (./algorithm.aux) (./holppspec.aux) (./references.aux) (./syntax.aux) (./types.aux) (./entries.aux) (./index.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) (see the transcript file for additional information) Output written on prettyp.dvi (154 pages, 351040 bytes). Transcript written on prettyp.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp/Manual' ../../../Manual/LaTeX/makeindex ../../../ prettyp.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp/Manual' latex prettyp.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./prettyp.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) (./win-macros.tex) Writing index file prettyp.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./prettyp.aux (./title.aux) (./intro.aux) (./language.aux) (./functions.aux) (./datatypes.aux) (./link_to_hol.aux) (./debugging.aux) (./examples.aux) (./algorithm.aux) (./holppspec.aux) (./references.aux) (./syntax.aux) (./types.aux) (./entries.aux) (./index.aux)) (./title.tex [1] [2]) (./prettyp.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [3] [4]) [5] [6] (./intro.tex Chapter 1. [1] [2] [3] [4] [5] [6] [7] Underfull \vbox (badness 1152) has occurred while \output is active [8] [9] [10] [11] [12] [13] [14] [15] [16] [17]) [18] (./language.tex Chapter 2. [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39]) [40] (./functions.tex Chapter 3. [41] [42] [43] [44] [45] [46]) [47] (./datatypes.tex [48] Chapter 4. [49]) [50] (./link_to_hol.tex Chapter 5. [51] [52] [53] [54] [55] [56] [57] [58] [59] [60]) [61] (./debugging.tex [62] Chapter 6. [63]) [64] (./examples.tex Chapter 7. [65] [66] [67] [68] [69] [70] [71] [72] [73] [74] [75] [76] [77] [78] [79] [80]) [81] (./algorithm.tex [82] Chapter 8. (./ppboxmacros.tex) [83] [84] [85] [86] [87] [88] [89] [90]) [91] (./holppspec.tex [92] Chapter 9. [93] [94] [95] [96] [97] [98] [99] [100] [101] [102]) [103] (./references.tex [104]) [105] (./syntax.tex [106] Appendix A. [107] [108] [109] [110]) [111] (./types.tex [112] Appendix B. ) [113] (./entries.tex [114] Appendix C. (./entries-intro.tex) Underfull \vbox (badness 10000) has occurred while \output is active [115] [116] [117] [118] [119] [120] [121] [122] [123] [124] [125] [126] [127] [128] [129] [130] [131] [132] [133] [134] [135] [136] [137] [138] [139] [140] [141] [142] [143] [144] [145] [146] [147] [148]) [149] (./index.tex [150]) (./prettyp.aux (./title.aux) (./intro.aux) (./language.aux) (./functions.aux) (./datatypes.aux) (./link_to_hol.aux) (./debugging.aux) (./examples.aux) (./algorithm.aux) (./holppspec.aux) (./references.aux) (./syntax.aux) (./types.aux) (./entries.aux) (./index.aux)) ) (see the transcript file for additional information) Output written on prettyp.dvi (156 pages, 374564 bytes). Transcript written on prettyp.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/prettyp/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/Manual' make clean; make tex; make reals; make index; make reals make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/Manual' \ rm -f *.dvi *.aux *.toc *.log *.idx *.ilg; \ printf '\\begin{theindex}' >index.tex; \ printf '\\mbox{}' >>index.tex; \ printf '\\end{theindex}' >>index.tex make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/Manual' \ printf '\\chapter{Pre-proved Theorems}' >theorems.tex; \ printf '\\input{theorems-intro}' >>theorems.tex; \ printf '\\section{HRAT}' >>theorems.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/HRAT theorems.tex; \ printf '\\section{HREAL}' >>theorems.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/HREAL theorems.tex; \ printf '\\section{REALAX}' >>theorems.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/REALAX theorems.tex; \ printf '\\section{REAL}' >>theorems.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/REAL theorems.tex; \ printf '\\section{TOPOLOGY}' >>theorems.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/TOPOLOGY theorems.tex; \ printf '\\section{NETS}' >>theorems.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/NETS theorems.tex; \ printf '\\section{LIM}' >>theorems.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/LIM theorems.tex; \ printf '\\section{SEQ}' >>theorems.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/SEQ theorems.tex; \ printf '\\section{POWSER}' >>theorems.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/POWSER theorems.tex; \ printf '\\section{TRANSC}' >>theorems.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/TRANSC theorems.tex make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/Manual' \ latex reals.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./reals.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file reals.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file reals.aux. (./title.tex [1] [2]) No file reals.toc. [3] [4] (./description.tex Chapter 1. (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) Overfull \hbox (12.25064pt too wide) in paragraph at lines 16--21 \OT1/cmr/m/n/12 the-o-ries \OT1/cmtt/m/n/12 REAL \OT1/cmr/m/n/12 and \OT1/cmtt/ m/n/12 TRANSC \OT1/cmr/m/n/12 to au-toload, and pro-vides an in-ter-face map in \OT1/cmtt/m/n/12 real[]interface[]map [1] [2]) [3] (./theorems.tex [4] Chapter 2. (./theorems-intro.tex) [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47] [48] [49] [50] [51] [52] [53] [54] [55] [56] [57] [58] [59] [60] [61] [62] [63] [64] [65] [66] [67] [68] [69] [70] [71] [72]) [73] (./references.tex [74]) [75] (./index.tex [76]) (./reals.aux (./title.aux) (./description.aux) (./theorems.aux) (./references.aux) (./index.aux)) LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) (see the transcript file for additional information) Output written on reals.dvi (80 pages, 114276 bytes). Transcript written on reals.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/Manual' \ ../../../Manual/LaTeX/makeindex ../../../ reals.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/Manual' \ latex reals.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./reals.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file reals.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./reals.aux (./title.aux) (./description.aux) (./theorems.aux) (./references.aux) (./index.aux)) (./title.tex [1] [2]) (./reals.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd)) [3] [4] (./description.tex Chapter 1. Overfull \hbox (12.25064pt too wide) in paragraph at lines 16--21 \OT1/cmr/m/n/12 the-o-ries \OT1/cmtt/m/n/12 REAL \OT1/cmr/m/n/12 and \OT1/cmtt/ m/n/12 TRANSC \OT1/cmr/m/n/12 to au-toload, and pro-vides an in-ter-face map in \OT1/cmtt/m/n/12 real[]interface[]map [1] [2]) [3] (./theorems.tex [4] Chapter 2. (./theorems-intro.tex) [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47] [48] [49] [50] [51] [52] [53] [54] [55] [56] [57] [58] [59] [60] [61] [62] [63] [64] [65] [66] [67] [68] [69] [70] [71] [72]) [73] (./references.tex [74]) [75] (./index.tex [76]) (./reals.aux (./title.aux) (./description.aux) (./theorems.aux) (./references.aux) (./index.aux)) ) (see the transcript file for additional information) Output written on reals.dvi (80 pages, 119832 bytes). Transcript written on reals.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reals/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof/Manual' make clean; make tex; make record_proof; make index; make record_proof make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof/Manual' /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help entries.tex TeX files made make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof/Manual' latex record_proof.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./record_proof.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (/usr/share/texlive/texmf-dist/tex/latex/base/makeidx.sty) (/usr/share/texlive/texmf-dist/tex/latex/tools/array.sty) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) (./macros.tex (./holmacs.tex) (./tokmac.tex)) Writing index file record_proof.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file record_proof.aux. (./title.tex [1] [2]) No file record_proof.toc. [3] [4] (./description.tex Chapter 1. (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) LaTeX Warning: Citation `Boulton:HOLeffiency' on page 1 undefined on input line 52. [1] LaTeX Warning: Citation `WW:recordproof' on page 2 undefined on input line 99. [2] Overfull \hbox (0.40001pt too wide) in paragraph at lines 145--172 [] Underfull \vbox (badness 10000) has occurred while \output is active [3] Overfull \hbox (0.40001pt too wide) in paragraph at lines 195--218 [] Underfull \vbox (badness 5756) has occurred while \output is active [4] [5] Overfull \hbox (2.81691pt too wide) in paragraph at lines 300--308 [][][] []\OT1/cmtt/m/n/12 : string -> string -> thm list -> line list -> void [6] LaTeX Warning: Citation `WW:recordproof' on page 7 undefined on input line 321. ) [7] (./entries.tex [8] Chapter 2. (./entries-intro.tex)) [9] (./record_proof.bbl [10]) (./record_proof.ind [11] [12]) (./record_proof.aux (./title.aux) (./description.aux) (./entries.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) (see the transcript file for additional information) Output written on record_proof.dvi (16 pages, 24288 bytes). Transcript written on record_proof.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof/Manual' makeindex record_proof.idx This is makeindex, version 2.17 [TeX Live 2025] (kpathsea + Thai support). Scanning input file record_proof.idx....done (29 entries accepted, 0 rejected). Sorting entries....done (163 comparisons). Generating output file record_proof.ind....done (59 lines written, 0 warnings). Output written in record_proof.ind. Transcript written in record_proof.ilg. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof/Manual' latex record_proof.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./record_proof.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (/usr/share/texlive/texmf-dist/tex/latex/base/makeidx.sty) (/usr/share/texlive/texmf-dist/tex/latex/tools/array.sty) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) (./macros.tex (./holmacs.tex) (./tokmac.tex)) Writing index file record_proof.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./record_proof.aux (./title.aux) (./description.aux) (./entries.aux)) (./title.tex [1] [2]) (./record_proof.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd )) [3] [4] (./description.tex Chapter 1. [1] [2] Overfull \hbox (0.40001pt too wide) in paragraph at lines 145--172 [] Underfull \vbox (badness 10000) has occurred while \output is active [3] Overfull \hbox (0.40001pt too wide) in paragraph at lines 195--218 [] Underfull \vbox (badness 5756) has occurred while \output is active [4] [5] Overfull \hbox (2.81691pt too wide) in paragraph at lines 300--308 [][][] []\OT1/cmtt/m/n/12 : string -> string -> thm list -> line list -> void [6]) [7] (./entries.tex [8] Chapter 2. (./entries-intro.tex)) [9] (./record_proof.bbl [10]) (./record_proof.ind [11] [12]) (./record_proof.aux (./title.aux) (./description.aux) (./entries.aux)) ) (see the transcript file for additional information) Output written on record_proof.dvi (16 pages, 25824 bytes). Transcript written on record_proof.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/record_proof/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce/Manual' make clean; make ids; make reduce; make index; make reduce make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce/Manual' \ rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex; \ printf '\\begin{theindex}' >index.tex; \ printf '\\mbox{}' >>index.tex; \ printf '\\end{theindex}' >>index.tex make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce/Manual' \ printf '\\chapter{ML Functions in the reduce Library}' >entries.tex; \ printf '\\input{entries-intro}' >>entries.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce/Manual' \ latex reduce.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./reduce.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file reduce.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file reduce.aux. (./title.tex [1] [2]) No file reduce.toc. [3] [4] (./description.tex Chapter 1. (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [1] [2]) [3] (./entries.tex [4] Chapter 2. (./entries-intro.tex) [5] [6] [7] Underfull \vbox (badness 4108) has occurred while \output is active [8] [9] [10] Underfull \vbox (badness 1796) has occurred while \output is active [11] Underfull \vbox (badness 1983) has occurred while \output is active [12] Underfull \vbox (badness 1259) has occurred while \output is active [13] Underfull \vbox (badness 1796) has occurred while \output is active [14] Underfull \vbox (badness 4108) has occurred while \output is active [15] [16] Underfull \vbox (badness 1231) has occurred while \output is active [17] [18] [19] [20] [21] [22] [23]) [24] (./index.tex [25]) (./reduce.aux (./title.aux) (./description.aux) (./entries.aux) (./index.aux)) ) (see the transcript file for additional information) Output written on reduce.dvi (29 pages, 33896 bytes). Transcript written on reduce.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce/Manual' \ ../../../Manual/LaTeX/makeindex ../../../ reduce.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce/Manual' \ latex reduce.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./reduce.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file reduce.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./reduce.aux (./title.aux) (./description.aux) (./entries.aux) (./index.aux)) (./title.tex [1] [2]) (./reduce.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd)) [3] [4] (./description.tex Chapter 1. [1] [2]) [3] (./entries.tex [4] Chapter 2. (./entries-intro.tex) [5] [6] [7] Underfull \vbox (badness 4108) has occurred while \output is active [8] [9] [10] Underfull \vbox (badness 1796) has occurred while \output is active [11] Underfull \vbox (badness 1983) has occurred while \output is active [12] Underfull \vbox (badness 1259) has occurred while \output is active [13] Underfull \vbox (badness 1796) has occurred while \output is active [14] Underfull \vbox (badness 4108) has occurred while \output is active [15] [16] Underfull \vbox (badness 1231) has occurred while \output is active [17] [18] [19] [20] [21] [22] [23]) [24] (./index.tex [25]) (./reduce.aux (./title.aux) (./description.aux) (./entries.aux) (./index.aux)) ) (see the transcript file for additional information) Output written on reduce.dvi (29 pages, 35424 bytes). Transcript written on reduce.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/reduce/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan/Manual' make clean; make tex; make res_quan; make index; make res_quan make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan/Manual' /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex TeX files made make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan/Manual' latex res_quan.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./res_quan.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (/usr/share/texlive/texmf-dist/tex/latex/base/makeidx.sty) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file res_quan.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file res_quan.aux. (./title.tex [1] [2]) No file res_quan.toc. [3] [4] (./description.tex Chapter 1. (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [1] [2] Overfull \hbox (1.882pt too wide) in paragraph at lines 149--151 []\OT1/cmr/m/n/12 The the-o-rems [] and [] state the re-order-ing prop- [3] LaTeX Warning: Reference `eq-cond-thm' on page 4 undefined on input line 209. [4] LaTeX Warning: Reference `eq-cond-thm2' on page 5 undefined on input line 232. [5] [6] [7] [8]) [9] (./entries.tex [10] Chapter 2. (./entries-intro.tex) [11] [12] Underfull \vbox (badness 10000) has occurred while \output is active [13] [14] [15] Underfull \vbox (badness 1122) has occurred while \output is active [16] [17] [18] Underfull \vbox (badness 10000) has occurred while \output is active [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] Underfull \vbox (badness 10000) has occurred while \output is active [32] Overfull \hbox (3.43106pt too wide) in paragraph at lines 1019--1028 \OT1/cmr/m/n/12 ment, and a term giv-ing the de-sired def-i-ni-tion. The value re-turned by []\OT1/cmtt/m/n/10.95 new_resq_definition [33] [34] [35] [36] Overfull \hbox (10.91988pt too wide) in paragraph at lines 1198--1201 \OT1/cmr/m/n/12 When ap-plied to a term of the form []\OT1/cmtt/m/n/10.95 !x::P . !y::Q. R\OT1/cmr/m/n/12 , the con-ver-sion []\OT1/cmtt/m/n/10.95 RESQ_FORALL_ SWAP_CONV [37] [38] [39] [40] [41] [42] [43] Overfull \hbox (3.30327pt too wide) in paragraph at lines 1548--1550 []\OT1/cmr/m/n/12 Given a theorem-tactic []\OT1/cmtt/m/n/10.95 ttac\OT1/cmr/m/n /12 , ap-ply-ing the tac-tic []\OT1/cmtt/m/n/10.95 RESQ_RES_THEN ttac \OT1/cmr/ m/n/12 to a goal []\OT1/cmtt/m/n/10.95 (asml,gl) [44] [45] [46] [47] Overfull \hbox (5.19403pt too wide) in paragraph at lines 1747--1751 \OT1/cmr/m/n/12 where the sub-sti-tu-tions are made se-quen-tially left-to-righ t in the same way as for []\OT1/cmtt/m/n/10.95 RESQ_SPEC\OT1/cmr/m/n/12 , [48] Overfull \hbox (8.65239pt too wide) in paragraph at lines 1777--1786 \OT1/cmr/m/n/12 When ap-plied to a the-o-rem []\OT1/cmtt/m/n/10.95 A |- !x1::P1 . ...!xn::Pn. t\OT1/cmr/m/n/12 , the in-fer-ence rule []\OT1/cmtt/m/n/10.95 RES Q_SPEC_ALL [49] [50] [51]) [52] (./theorems.tex Chapter 3. (./theorems-intro.tex)) [53] (./res_quan.ind [54] [55]) (./res_quan.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) (see the transcript file for additional information) Output written on res_quan.dvi (59 pages, 111072 bytes). Transcript written on res_quan.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan/Manual' ../../../Manual/LaTeX/makeindex ../../../ res_quan.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan/Manual' latex res_quan.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./res_quan.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (/usr/share/texlive/texmf-dist/tex/latex/base/makeidx.sty) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file res_quan.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./res_quan.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux)) (./title.tex [1] [2]) (./res_quan.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd)) [3] [4] (./description.tex Chapter 1. [1] [2] Overfull \hbox (1.882pt too wide) in paragraph at lines 149--151 []\OT1/cmr/m/n/12 The the-o-rems [] and [] state the re-order-ing prop- [3] [4] [5] [6] [7] [8]) [9] (./entries.tex [10] Chapter 2. (./entries-intro.tex) [11] [12] Underfull \vbox (badness 10000) has occurred while \output is active [13] [14] [15] Underfull \vbox (badness 1122) has occurred while \output is active [16] [17] [18] Underfull \vbox (badness 10000) has occurred while \output is active [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] Underfull \vbox (badness 10000) has occurred while \output is active [32] Overfull \hbox (3.43106pt too wide) in paragraph at lines 1019--1028 \OT1/cmr/m/n/12 ment, and a term giv-ing the de-sired def-i-ni-tion. The value re-turned by []\OT1/cmtt/m/n/10.95 new_resq_definition [33] [34] [35] [36] Overfull \hbox (10.91988pt too wide) in paragraph at lines 1198--1201 \OT1/cmr/m/n/12 When ap-plied to a term of the form []\OT1/cmtt/m/n/10.95 !x::P . !y::Q. R\OT1/cmr/m/n/12 , the con-ver-sion []\OT1/cmtt/m/n/10.95 RESQ_FORALL_ SWAP_CONV [37] [38] [39] [40] [41] [42] [43] Overfull \hbox (3.30327pt too wide) in paragraph at lines 1548--1550 []\OT1/cmr/m/n/12 Given a theorem-tactic []\OT1/cmtt/m/n/10.95 ttac\OT1/cmr/m/n /12 , ap-ply-ing the tac-tic []\OT1/cmtt/m/n/10.95 RESQ_RES_THEN ttac \OT1/cmr/ m/n/12 to a goal []\OT1/cmtt/m/n/10.95 (asml,gl) [44] [45] [46] [47] Overfull \hbox (5.19403pt too wide) in paragraph at lines 1747--1751 \OT1/cmr/m/n/12 where the sub-sti-tu-tions are made se-quen-tially left-to-righ t in the same way as for []\OT1/cmtt/m/n/10.95 RESQ_SPEC\OT1/cmr/m/n/12 , [48] Overfull \hbox (8.65239pt too wide) in paragraph at lines 1777--1786 \OT1/cmr/m/n/12 When ap-plied to a the-o-rem []\OT1/cmtt/m/n/10.95 A |- !x1::P1 . ...!xn::Pn. t\OT1/cmr/m/n/12 , the in-fer-ence rule []\OT1/cmtt/m/n/10.95 RES Q_SPEC_ALL [49] [50] [51]) [52] (./theorems.tex Chapter 3. (./theorems-intro.tex)) [53] (./res_quan.ind [54] [55]) (./res_quan.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux)) ) (see the transcript file for additional information) Output written on res_quan.dvi (59 pages, 114336 bytes). Transcript written on res_quan.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/res_quan/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets/Manual' make clean; make tex; make sets; make index; make sets make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets/Manual' /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/sdef theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/mem theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/emuniv theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/subs theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/unin theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/diff theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/disj theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/insdel theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/chre theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/image theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/fun theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/sing theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/fin theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/card theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex TeX files made make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets/Manual' latex sets.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./sets.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file sets.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file sets.aux. (./title.tex [1] [2]) No file sets.toc. [3] [4] (./description.tex Chapter 1. (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [1] [2] LaTeX Warning: Citation `description' on page 3 undefined on input line 197. [3] LaTeX Warning: Reference `using' on page 4 undefined on input line 218. [4] [5] LaTeX Warning: Reference `theorems' on page 6 undefined on input line 416. [6] LaTeX Warning: Reference `abst' on page 7 undefined on input line 478. LaTeX Warning: Reference `abst' on page 7 undefined on input line 495. [7] LaTeX Warning: Reference `theorems' on page 8 undefined on input line 523. LaTeX Warning: Reference `theorems' on page 8 undefined on input line 539. LaTeX Warning: Reference `theorems' on page 8 undefined on input line 580. [8] LaTeX Warning: Citation `description' on page 9 undefined on input line 590. [9] [10] LaTeX Warning: Reference `inconv' on page 11 undefined on input line 738. [11] LaTeX Warning: Reference `finite' on page 12 undefined on input line 830. [12] LaTeX Warning: Reference `entries' on page 13 undefined on input line 870. [13] LaTeX Warning: Reference `theorems' on page 14 undefined on input line 991. [14] LaTeX Warning: Reference `theorems' on page 15 undefined on input line 1021. [15] LaTeX Warning: Reference `entries' on page 16 undefined on input line 1090. LaTeX Warning: Reference `theorems' on page 16 undefined on input line 1137. [16] LaTeX Warning: Reference `theorems' on page 17 undefined on input line 1194. [17] LaTeX Warning: Reference `theorems' on page 18 undefined on input line 1222. [18] LaTeX Warning: Reference `theorems' on page 19 undefined on input line 1340. LaTeX Warning: Reference `abst' on page 19 undefined on input line 1361. LaTeX Warning: Reference `finite' on page 19 undefined on input line 1361. [19] [20]) [21] (./entries.tex [22] Chapter 2. (./entries-intro.tex) [23] [24] [25] [26] [27] [28] [29] [30] [31]) [32] (./theorems.tex Chapter 3. (./theorems-intro.tex) [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45] [46]) [47] (./references.tex [48]) [49] (./index.tex [50]) (./sets.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./references.aux) (./index.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) Output written on sets.dvi (54 pages, 113288 bytes). Transcript written on sets.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets/Manual' ../../../Manual/LaTeX/makeindex ../../../ sets.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets/Manual' latex sets.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./sets.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file sets.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./sets.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./references.aux) (./index.aux)) (./title.tex [1] [2]) (./sets.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [3]) [4] (./description.tex Chapter 1. [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20]) [21] (./entries.tex [22] Chapter 2. (./entries-intro.tex) [23] [24] [25] [26] [27] [28] [29] [30] [31]) [32] (./theorems.tex Chapter 3. (./theorems-intro.tex) [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45] [46]) [47] (./references.tex [48]) [49] (./index.tex [50]) (./sets.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./references.aux) (./index.aux)) ) Output written on sets.dvi (54 pages, 127004 bytes). Transcript written on sets.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/sets/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string/Manual' make clean; make tex; make string; make index; make string make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string/Manual' /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/defs theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms theorems.tex TeX files made make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string/Manual' latex string.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./string.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file string.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file string.aux. (./title.tex [1] [2]) No file string.toc. [3] [4] (./description.tex Chapter 1. (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) LaTeX Warning: Citation `description' on page 1 undefined on input line 39. LaTeX Warning: Citation `melham' on page 1 undefined on input line 39. [1] LaTeX Warning: Reference `ascii-eq-conv' on page 2 undefined on input line 99. [2] [3] LaTeX Warning: Reference `string-eq-conv' on page 4 undefined on input line 245 . [4] [5] [6] [7]) [8] (./entries.tex Chapter 2. (./entries-intro.tex) [9] [10]) [11] (./theorems.tex [12] Chapter 3. (./theorems-intro.tex) [13] [14]) [15] (./references.tex [16]) [17] (./index.tex [18]) (./string.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./references.aux) (./index.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) Output written on string.dvi (22 pages, 37580 bytes). Transcript written on string.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string/Manual' ../../../Manual/LaTeX/makeindex ../../../ string.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string/Manual' latex string.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./string.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file string.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./string.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux ) (./references.aux) (./index.aux)) (./title.tex [1] [2]) (./string.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd)) [3] [4] (./description.tex Chapter 1. [1] [2] [3] [4] [5] [6] [7]) [8] (./entries.tex Chapter 2. (./entries-intro.tex) [9] [10]) [11] (./theorems.tex [12] Chapter 3. (./theorems-intro.tex) [13] [14]) [15] (./references.tex [16]) [17] (./index.tex [18]) (./string.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./references.aux) (./index.aux)) ) Output written on string.dvi (22 pages, 42512 bytes). Transcript written on string.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/string/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut/Manual' make clean; make tex; make taut; make index; make taut make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut/Manual' /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex TeX files made make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut/Manual' latex taut.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./taut.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file taut.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file taut.aux. (./title.tex [1] [2]) No file taut.toc. [3] [4] (./description.tex Chapter 1. LaTeX Warning: Citation `description' on page 1 undefined on input line 4. (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [1] [2]) [3] (./entries.tex [4] Chapter 2. (./entries-intro.tex) [5] Underfull \vbox (badness 1810) has occurred while \output is active [6] [7] [8] [9]) [10] (./references.tex) [11] (./index.tex [12]) (./taut.aux (./title.aux) (./description.aux) (./entries.aux) (./references.aux) (./index.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) (see the transcript file for additional information) Output written on taut.dvi (16 pages, 21100 bytes). Transcript written on taut.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut/Manual' ../../../Manual/LaTeX/makeindex ../../../ taut.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut/Manual' latex taut.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./taut.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file taut.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./taut.aux (./title.aux) (./description.aux) (./entries.aux) (./references.aux ) (./index.aux)) (./title.tex [1] [2]) (./taut.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd)) [3] [4] (./description.tex Chapter 1. [1] [2]) [3] (./entries.tex [4] Chapter 2. (./entries-intro.tex) [5] Underfull \vbox (badness 1810) has occurred while \output is active [6] [7] [8] [9]) [10] (./references.tex) [11] (./index.tex [12]) (./taut.aux (./title.aux) (./description.aux) (./entries.aux) (./references.aux) (./index.aux)) ) (see the transcript file for additional information) Output written on taut.dvi (16 pages, 22244 bytes). Transcript written on taut.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/taut/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs/Manual' make clean; make tex; make trs; make index; make trs make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs/Manual' /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex TeX files made make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs/Manual' latex trs.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./trs.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file trs.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file trs.aux. (./title.tex [1] [2]) No file trs.toc. [3] [4] (./description.tex Chapter 1. LaTeX Warning: Citation `description' on page 1 undefined on input line 6. (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [1] [2] [3] [4] Chapter 2. LaTeX Warning: Citation `description' on page 5 undefined on input line 176. (./simple.tex [5] [6]) (./patterns.tex [7] [8] [9] [10]) (./paths.tex [11] [12] [13]) (./sidecond.tex [14] [15] [16] [17]) (./errors.tex [18]) [19] [20] Chapter 3. ) [21] (./entries.tex [22] Chapter 4. (./entries-intro.tex) [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44]) [45] (./references.tex [46]) [47] (./index.tex [48]) (./trs.aux (./title.aux) (./description.aux) (./entries.aux) (./references.aux) (./index.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) Output written on trs.dvi (52 pages, 93324 bytes). Transcript written on trs.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs/Manual' ../../../Manual/LaTeX/makeindex ../../../ trs.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs/Manual' latex trs.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./trs.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file trs.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./trs.aux (./title.aux) (./description.aux) (./entries.aux) (./references.aux) (./index.aux)) (./title.tex [1] [2]) (./trs.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd)) [3] [4] (./description.tex Chapter 1. [1] [2] [3] [4] Chapter 2. (./simple.tex [5] [6]) (./patterns.tex [7] [8] [9] [10]) (./paths.tex [11] [12] [13]) (./sidecond.tex [14] [15] [16] [17]) (./errors.tex [18]) [19] [20] Chapter 3. ) [21] (./entries.tex [22] Chapter 4. (./entries-intro.tex) [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44]) [45] (./references.tex [46]) [47] (./index.tex [48]) (./trs.aux (./title.aux) (./description.aux) (./entries.aux) (./references.aux) (./index.aux)) ) Output written on trs.dvi (52 pages, 96592 bytes). Transcript written on trs.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/trs/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind/Manual' make clean; make tex; make unwind; make index; make unwind make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind/Manual' /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex TeX files made make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind/Manual' latex unwind.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./unwind.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file unwind.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file unwind.aux. (./title.tex [1] [2]) No file unwind.toc. [3] [4] (./description.tex Chapter 1. LaTeX Warning: Citation `description' on page 1 undefined on input line 4. LaTeX Warning: Citation `HVusingHOL' on page 1 undefined on input line 7. (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [1] [2] [3] [4] [5] [6] [7]) [8] [9] (./entries.tex [10] Chapter 2. (./entries-intro.tex) Underfull \vbox (badness 2865) has occurred while \output is active [11] [12] [13] [14] [15] [16] [17] Underfull \vbox (badness 10000) has occurred while \output is active [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38]) [39] (./references.tex [40]) [41] (./index.tex [42]) (./unwind.aux (./title.aux) (./description.aux) (./entries.aux) (./references.aux) (./index.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) (see the transcript file for additional information) Output written on unwind.dvi (46 pages, 74832 bytes). Transcript written on unwind.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind/Manual' ../../../Manual/LaTeX/makeindex ../../../ unwind.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind/Manual' latex unwind.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./unwind.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file unwind.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./unwind.aux (./title.aux) (./description.aux) (./entries.aux) (./references.aux) (./index.aux)) (./title.tex [1] [2]) (./unwind.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd)) [3] [4] (./description.tex Chapter 1. [1] [2] [3] [4] [5] [6] [7]) [8] [9] (./entries.tex [10] Chapter 2. (./entries-intro.tex) Underfull \vbox (badness 2865) has occurred while \output is active [11] [12] [13] [14] [15] [16] [17] Underfull \vbox (badness 10000) has occurred while \output is active [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38]) [39] (./references.tex [40]) [41] (./index.tex [42]) (./unwind.aux (./title.aux) (./description.aux) (./entries.aux) (./references.aux) (./index.aux)) ) (see the transcript file for additional information) Output written on unwind.dvi (46 pages, 76180 bytes). Transcript written on unwind.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/unwind/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder/Manual' make clean; make tex; make wellorder; make index; make wellorder make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder/Manual' \ rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex; \ printf '\\begin{theindex}' >index.tex; \ printf '\\mbox{}' >>index.tex; \ printf '\\end{theindex}' >>index.tex make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder/Manual' \ printf '\\chapter{Pre-proved Theorems}' >theorems.tex; \ printf '\\input{theorems-intro}' >>theorems.tex; \ printf '\\section{Basic definitions}' >>theorems.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/defs theorems.tex; \ printf '\\section{Miscellaneous lemmas}' >>theorems.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/lemmas theorems.tex;\ printf '\\section{Main theorems}' >>theorems.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/main theorems.tex \ printf '\\chapter{ML Functions in the wellorder Library}' >entries.tex;\ printf '\\label{entries}' >>entries.tex; \ printf '\\input{entries-intro}' >>entries.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder/Manual' \ latex wellorder.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./wellorder.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file wellorder.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file wellorder.aux. (./title.tex [1] [2]) No file wellorder.toc. [3] [4] (./description.tex Chapter 1. (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) LaTeX Warning: Citation `moore' on page 1 undefined on input line 47. LaTeX Warning: Citation `dudley' on page 1 undefined on input line 53. LaTeX Warning: Citation `stoll' on page 1 undefined on input line 54. LaTeX Warning: Citation `DP' on page 1 undefined on input line 55. LaTeX Warning: Citation `bourbaki' on page 1 undefined on input line 56. [1] [2] [3] [4] [5] [6]) [7] (./entries.tex [8] Chapter 2. (./entries-intro.tex) [9]) [10] (./theorems.tex Chapter 3. (./theorems-intro.tex) [11] [12] [13] [14] [15] [16]) [17] (./references.tex [18]) [19] (./index.tex [20]) (./wellorder.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./references.aux) (./index.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) Output written on wellorder.dvi (24 pages, 35064 bytes). Transcript written on wellorder.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder/Manual' \ ../../../Manual/LaTeX/makeindex ../../../ wellorder.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder/Manual' \ latex wellorder.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./wellorder.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file wellorder.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./wellorder.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./references.aux) (./index.aux)) (./title.tex [1] [2]) (./wellorder.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd)) [3] [4] (./description.tex Chapter 1. [1] [2] [3] [4] [5] [6]) [7] (./entries.tex [8] Chapter 2. (./entries-intro.tex) [9]) [10] (./theorems.tex Chapter 3. (./theorems-intro.tex) [11] [12] [13] [14] [15] [16]) [17] (./references.tex [18]) [19] (./index.tex [20]) (./wellorder.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./references.aux) (./index.aux)) ) Output written on wellorder.dvi (24 pages, 39748 bytes). Transcript written on wellorder.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/wellorder/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window/Manual' make clean; \ make tex; \ make window; \ make index; \ make window make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex *.bak; \ printf '\\begin{theindex}' >index.tex; \ printf '\\mbox{}' >>index.tex; \ printf '\\end{theindex}' >>index.tex make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window/Manual' printf '\\chapter{ML Functions in the window Library}' >entries.tex; \ printf '\\input{entries-intro}' >>entries.tex; \ /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/defs theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms theorems.tex TeX files makde make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window/Manual' latex window.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./window.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file window.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file window.aux. (./title.tex [1] [2]) No file window.toc. [1] (./description.tex [2] Chapter 1. [3] [4] Chapter 2. (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [5] LaTeX Warning: Reference `sec:lem' on page 6 undefined on input line 164. [6] LaTeX Warning: Reference `sec:rel' on page 7 undefined on input line 188. LaTeX Warning: Reference `sec:rel' on page 7 undefined on input line 215. LaTeX Warning: Reference `chap:ref' on page 7 undefined on input line 227. [7] [8] LaTeX Warning: Reference `sec:win' on page 9 undefined on input line 294. LaTeX Warning: Reference `sec:start' on page 9 undefined on input line 336. [9] [10] [11] [12] [13] LaTeX Warning: Reference `sec:start' on page 14 undefined on input line 590. LaTeX Warning: Reference `sec:start' on page 14 undefined on input line 636. [14] LaTeX Warning: Reference `sec:start' on page 15 undefined on input line 670. [15] [16] [17] [18] [19] [20] [21]) [22] [23] (./entries.tex [24] Chapter 3. (./entries-intro.tex) [25] [26] [27] [28] [29] [30] [31] [32] Underfull \vbox (badness 10000) has occurred while \output is active [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] Underfull \vbox (badness 1043) has occurred while \output is active [44] [45] [46] [47] [48] [49] [50] [51] [52] [53] [54] [55] [56] [57] Underfull \vbox (badness 2564) has occurred while \output is active [58] [59] [60] [61] [62] [63] [64] [65] [66] Underfull \vbox (badness 10000) has occurred while \output is active [67] [68] [69] [70] [71] [72] [73] [74] [75] [76] [77] [78] [79] [80] [81] [82] [83] [84] [85] [86] [87] [88] [89] [90] [91] [92] [93]) [94] (./theorems.tex Chapter 4. (./theorems-intro.tex)) [95] (./index.tex [96]) (./window.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./index.aux)) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) (see the transcript file for additional information) Output written on window.dvi (98 pages, 182212 bytes). Transcript written on window.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window/Manual' ../../../Manual/LaTeX/makeindex ../../../ window.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window/Manual' latex window.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./window.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) Writing index file window.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) (./window.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux ) (./index.aux)) (./title.tex [1] [2]) (./window.toc (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd)) [1] (./description.tex [2] Chapter 1. [3] [4] Chapter 2. [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21]) [22] [23] (./entries.tex [24] Chapter 3. (./entries-intro.tex) [25] [26] [27] [28] [29] [30] [31] [32] Underfull \vbox (badness 10000) has occurred while \output is active [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] Underfull \vbox (badness 1043) has occurred while \output is active [44] [45] [46] [47] [48] [49] [50] [51] [52] [53] [54] [55] [56] [57] Underfull \vbox (badness 2564) has occurred while \output is active [58] [59] [60] [61] [62] [63] [64] [65] [66] Underfull \vbox (badness 10000) has occurred while \output is active [67] [68] [69] [70] [71] [72] [73] [74] [75] [76] [77] [78] [79] [80] [81] [82] [83] [84] [85] [86] [87] [88] [89] [90] [91] [92] [93]) [94] (./theorems.tex Chapter 4. (./theorems-intro.tex)) [95] (./index.tex [96]) (./window.aux (./title.aux) (./description.aux) (./entries.aux) (./theorems.aux) (./index.aux)) ) (see the transcript file for additional information) Output written on window.dvi (98 pages, 188860 bytes). Transcript written on window.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/window/Manual' make[5]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word/Manual' make clean; make tex; make word; make index; make word make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word/Manual' rm -f *.dvi *.aux *.toc *.log *.idx *.ilg make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word/Manual' /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/word_base theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/word_bitop theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/word_num theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/bword_bitop theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/bword_num theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/thms/bword_arith theorems.tex /bin/sh ../../../Manual/Reference/bin/doc-to-tex ../../../Manual/Reference/bin/doc-to-tex.sed ../help/entries entries.tex TeX files made make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word/Manual' latex word.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./word.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (/usr/share/texlive/texmf-dist/tex/latex/base/makeidx.sty) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) (./macros.tex (./holmacs.tex) (./tokmac.tex)) Writing index file word.idx No auxiliary output files. (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file word.aux. (./title.tex [1] [2]) No file word.toc. [3] [4] (./description.tex Chapter 1. (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) (./model_word.tex [1] [2] (./thy_hier.tex) LaTeX Warning: Reference `fig-thy_hier' on page 3 undefined on input line 109. Underfull \vbox (badness 10000) has occurred while \output is active [3] LaTeX Warning: Reference `sec-abs' on page 4 undefined on input line 128. LaTeX Warning: Reference `tab-base-const' on page 4 undefined on input line 133 . LaTeX Warning: Reference `tab-other-const' on page 4 undefined on input line 13 6. [4] [5] [6] LaTeX Warning: Reference `tab-shift' on page 7 undefined on input line 314. Underfull \hbox (badness 10000) in paragraph at lines 318--319 Underfull \hbox (badness 10000) in paragraph at lines 327--328 [7] [8] [9] LaTeX Warning: Reference `sec-word_num' on page 10 undefined on input line 472. Underfull \hbox (badness 5817) in paragraph at lines 485--489 [][] \OML/cmm/m/it/12 n m$ \OT1/cmr/m/n/12 re-turns a $\OML/cmm/m/it/12 n$\OT1/ cmr/m/n/12 -bit word rep-re-sent-ing the value of $\OML/cmm/m/it/12 m$\OT1/cmr/ m/n/12 . [10] [11] [12] Overfull \hbox (1.16455pt too wide) in paragraph at lines 675--681 [][]\OT1/cmtt/m/n/12 :(term list -> tactic) \OT1/cmr/m/n/12 When ap-plied to a goal of the form [][] LaTeX Warning: Reference `sec-bword_num' on page 13 undefined on input line 694 . [13] LaTeX Warning: Citation `WW:res_quan-manual' on page 14 undefined on input line 764. LaTeX Warning: Reference `fig-WSEG_NBWORD_SUC' on page 14 undefined on input li ne 765. )) [14] [15] (./entries.tex [16] Chapter 2. (./entries-intro.tex) [17] [18] Overfull \hbox (11.32455pt too wide) in paragraph at lines 105--109 \OT1/cmr/m/n/12 the words to be con-cate-nated. The as-sump-tion will be []\OT1 /cmtt/m/n/10.95 PWORDLEN n1 tm', PWORDLEN n2 tm''\OT1/cmr/m/n/12 . [19] Overfull \hbox (12.9914pt too wide) in paragraph at lines 204--207 []\OT1/cmtt/m/n/10.95 WSEG_WSEG_CONV tm \OT1/cmr/m/n/12 fails if []\OT1/cmtt/m/ n/10.95 tm \OT1/cmr/m/n/12 is not of the form de-scribed above, or the re-la-ti ons []\OT1/cmtt/m/n/10.95 k1 + m1 <= n ) [20] (./theorems.tex Chapter 3. (./theorems-intro.tex) [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37]) [38] (./word.bbl) (./word.ind [39] [40] [41] [42]) LaTeX Warning: There were undefined references. ) (see the transcript file for additional information) Output written on word.dvi (46 pages, 90264 bytes). Transcript written on word.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word/Manual' ../../../Manual/LaTeX/makeindex ../../../ word.idx index.tex makeindex is not built for x86_64. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word/Manual' make[6]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word/Manual' latex word.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./word.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (/usr/share/texlive/texmf-dist/tex/latex/base/makeidx.sty) (../../../Manual/LaTeX/alltt.sty) (../../../Manual/LaTeX/layout.sty) (../../../Manual/LaTeX/commands.tex) (../../../Manual/LaTeX/ref-macros.tex) (./macros.tex (./holmacs.tex) (./tokmac.tex)) Writing index file word.idx No auxiliary output files. (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file word.aux. (./title.tex [1] [2]) No file word.toc. [3] [4] (./description.tex Chapter 1. (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) (./model_word.tex [1] [2] (./thy_hier.tex) LaTeX Warning: Reference `fig-thy_hier' on page 3 undefined on input line 109. Underfull \vbox (badness 10000) has occurred while \output is active [3] LaTeX Warning: Reference `sec-abs' on page 4 undefined on input line 128. LaTeX Warning: Reference `tab-base-const' on page 4 undefined on input line 133 . LaTeX Warning: Reference `tab-other-const' on page 4 undefined on input line 13 6. [4] [5] [6] LaTeX Warning: Reference `tab-shift' on page 7 undefined on input line 314. Underfull \hbox (badness 10000) in paragraph at lines 318--319 Underfull \hbox (badness 10000) in paragraph at lines 327--328 [7] [8] [9] LaTeX Warning: Reference `sec-word_num' on page 10 undefined on input line 472. Underfull \hbox (badness 5817) in paragraph at lines 485--489 [][] \OML/cmm/m/it/12 n m$ \OT1/cmr/m/n/12 re-turns a $\OML/cmm/m/it/12 n$\OT1/ cmr/m/n/12 -bit word rep-re-sent-ing the value of $\OML/cmm/m/it/12 m$\OT1/cmr/ m/n/12 . [10] [11] [12] Overfull \hbox (1.16455pt too wide) in paragraph at lines 675--681 [][]\OT1/cmtt/m/n/12 :(term list -> tactic) \OT1/cmr/m/n/12 When ap-plied to a goal of the form [][] LaTeX Warning: Reference `sec-bword_num' on page 13 undefined on input line 694 . [13] LaTeX Warning: Citation `WW:res_quan-manual' on page 14 undefined on input line 764. LaTeX Warning: Reference `fig-WSEG_NBWORD_SUC' on page 14 undefined on input li ne 765. )) [14] [15] (./entries.tex [16] Chapter 2. (./entries-intro.tex) [17] [18] Overfull \hbox (11.32455pt too wide) in paragraph at lines 105--109 \OT1/cmr/m/n/12 the words to be con-cate-nated. The as-sump-tion will be []\OT1 /cmtt/m/n/10.95 PWORDLEN n1 tm', PWORDLEN n2 tm''\OT1/cmr/m/n/12 . [19] Overfull \hbox (12.9914pt too wide) in paragraph at lines 204--207 []\OT1/cmtt/m/n/10.95 WSEG_WSEG_CONV tm \OT1/cmr/m/n/12 fails if []\OT1/cmtt/m/ n/10.95 tm \OT1/cmr/m/n/12 is not of the form de-scribed above, or the re-la-ti ons []\OT1/cmtt/m/n/10.95 k1 + m1 <= n ) [20] (./theorems.tex Chapter 3. (./theorems-intro.tex) [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37]) [38] (./word.bbl) (./word.ind [39] [40] [41] [42]) LaTeX Warning: There were undefined references. ) (see the transcript file for additional information) Output written on word.dvi (46 pages, 90264 bytes). Transcript written on word.log. make[6]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word/Manual' make[5]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Library/word/Manual' ===> all library documentation typeset make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Libraries' make[4]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Libraries' latex libraries.tex This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./libraries.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/book.cls Document Class: book 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/fleqn.clo) (/usr/share/texlive/texmf-dist/tex/latex/base/bk12.clo)) (../LaTeX/alltt.sty) (../LaTeX/layout.sty) (../LaTeX/commands.tex) (../LaTeX/ref-macros.tex) Writing index file libraries.idx (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file libraries.aux. (./title.tex (../LaTeX/cover_info.tex The title page being created is a LaTeX approximation of a fancy PostScript cover page. All the fancy cover pages for the HOL Manual may be generated if you have (1) a PostScript printer, (2) the "psfig" TeX macros, and (3) a DVI to PostScript converter that understands these macros. The cover pages may be found in ../LaTeX/Covers, and shoud be made pursuant to the instructions given in ../LaTeX/Covers/READ-ME. ) (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [1] [2]) (./preface.tex) [3] (./libraries.aux (./title.aux) (./preface.aux)) ) Output written on libraries.dvi (3 pages, 2288 bytes). Transcript written on libraries.log. make[4]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Libraries' make[3]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Libraries' ====> LIBRARIES made make[2]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual' make[2]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual' (cd Covers; make all; cd ..) make[3]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Covers' rm -f *.log core *.aux *~ #* LOG ===> Fancy end and title pages cleaned up rm -f endpages.ps titlepages.ps *.dvi ===> Fancy end and title pages clobbered TEXINPUTS=$(pwd)/psfig:$TEXINPUTS latex endpages This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./endpages.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/article.cls Document Class: article 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/size11.clo)) (./endpages.sty) (./warning.tex WARNING: These fancy cover and end pages require that the psfig macros for the inclusion of PostScript in TeX be in the default TeX include search path. ) (/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Covers/psfig/psfig.tex psfig/tex 1.2 ) (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file endpages.aux. (/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd) [1] [2] [3] [4] (./endpages.aux) ) Output written on endpages.dvi (4 pages, 1864 bytes). Transcript written on endpages.log. ===> endpages.dvi created dvips endpages > endpages.ps This is dvips(k) 2025.1 (TeX Live 2025) Copyright 2025 Radical Eye Software (www.radicaleye.com) ' TeX output 2025.08.25:2228' -> endpages.ps . [1 <./LANTERN.ps>] [2<./LANTERN.ps>] [3<./LANTERN.ps>] [4<./LANTERN.ps>] ===> endpages.ps created TEXINPUTS=$(pwd)/psfig:$TEXINPUTS latex titlepages This is pdfTeX, Version 3.141592653-2.6-1.40.28 (TeX Live 2025/Debian) (preloaded format=latex) restricted \write18 enabled. entering extended mode (./titlepages.tex LaTeX2e <2025-06-01> patch level 1 L3 programming layer <2025-07-19> (/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def Entering LaTeX 2.09 COMPATIBILITY MODE ************************************************************* !!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!! This mode attempts to provide an emulation of the LaTeX 2.09 author environment so that OLD documents can be successfully processed. It should NOT be used for NEW documents! New documents should use Standard LaTeX conventions and start with the \documentclass command. Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style files that change any internal macros, especially not with those that change the FONT SELECTION or OUTPUT ROUTINES. Therefore such style files MUST BE UPDATED to use Current Standard LaTeX: LaTeX2e. If you suspect that you may be using such a style file, which is probably very, very old by now, then you should attempt to get it updated by sending a copy of this error message to the author of that file. ************************************************************* (/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty) (/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty)) (/usr/share/texlive/texmf-dist/tex/latex/base/article.cls Document Class: article 2025/01/22 v1.4n Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/size11.clo)) (./titlepages.sty) (./warning.tex WARNING: These fancy cover and end pages require that the psfig macros for the inclusion of PostScript in TeX be in the default TeX include search path. ) (/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Covers/psfig/psfig.tex psfig/tex 1.2 ) (/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def) No file titlepages.aux. [1] [2] [3] [4] [5] [6] [7] [8] (./titlepages.aux) ) Output written on titlepages.dvi (8 pages, 4168 bytes). Transcript written on titlepages.log. ===> titlepages.dvi created dvips titlepages > titlepages.ps This is dvips(k) 2025.1 (TeX Live 2025) Copyright 2025 Radical Eye Software (www.radicaleye.com) ' TeX output 2025.08.25:2228' -> titlepages.ps . [1 <./TUTORIAL.ps><./dsto.ps><./arms.ps><./CRC.ps>] [2<./DESCRIPTION.ps> <./dsto.ps><./arms.ps><./CRC.ps>] [3<./REFERENCE.ps><./dsto.ps><./arms.ps> <./CRC.ps>] [4<./LIBRARIES.ps><./dsto.ps><./arms.ps><./CRC.ps>] [5] [6] [7] [8] ===> titlepages.ps created make[3]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual/Covers' ====> Fancy covers made make[2]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual' =======> MANUAL made make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg/Manual' touch build-indep-stamp find lisp -name "*.l" | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/hol88-2.02.19940316dfsg/%s\n",$1,a);}' >>debian/hol88-source.install find ml -type f -name "*ml" | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/hol88-2.02.19940316dfsg/%s\n",$1,a);}' >>debian/hol88-source.install find theories -type f -name "*ml" | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/hol88-2.02.19940316dfsg/%s\n",$1,a);}' >>debian/hol88-source.install find theories -type f -name "*th" | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/hol88-2.02.19940316dfsg/%s\n",$1,a);}' >>debian/hol88-source.install find help -name "*.doc" | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/hol88-2.02.19940316dfsg/%s\n",$1,a);}' >>debian/hol88-help.install find Library -name "*.ml" | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/hol88-2.02.19940316dfsg/%s\n",$1,a);}' >>debian/hol88-library-source.install find Library -name "*.doc" | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/hol88-2.02.19940316dfsg/%s\n",$1,a);}' >>debian/hol88-library-help.install find contrib -name "*.ml" | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/hol88-2.02.19940316dfsg/%s\n",$1,a);}' >>debian/hol88-contrib-source.install find contrib -name "Makefile" | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/hol88-2.02.19940316dfsg/%s\n",$1,a);}' >>debian/hol88-contrib-source.install find contrib -name "*.doc" | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/hol88-2.02.19940316dfsg/%s\n",$1,a);}' >>debian/hol88-contrib-help.install find Manual -name "*dvi" | grep -v makeindex | grep -v psfig | \ awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/doc/hol88-doc/%s\n",$1,a);}' >>debian/hol88-doc.install find Manual -name "*ps" | grep -v makeindex | grep -v psfig | \ awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/doc/hol88-doc/%s\n",$1,a);}' >>debian/hol88-doc.install dh_testdir dh_testroot dh_prep -i -X./ml/site.ml.orig -X./contrib/tooltool/Makefile.orig \ -X./contrib/tooltool/events.c.orig -X./contrib/tooltool/func_fix.c.orig \ -X./contrib/tooltool/lex.c.orig -X./contrib/tooltool/parse.y.orig \ -X./contrib/tooltool/patchlevel.h.orig -X./contrib/tooltool/windows.c.orig \ -X./contrib/Xhelp/hol_apro.orig -X./contrib/Xhelp/hol_ref.orig \ -X./contrib/Xhelp/xholhelp.h.orig -X./contrib/Xhelp/hol_thm.orig dh_installdirs -i dh_install -i /usr/bin/make -f debian/rules DH_OPTIONS=-i binary-common make[1]: Entering directory '/build/reproducible-path/hol88-2.02.19940316dfsg' dh_testdir dh_testroot dh_installchangelogs dh_installdocs dh_installexamples dh_installman dh_lintian dh_link dh_strip dh_compress dh_fixperms dh_makeshlibs dh_installdeb dh_shlibdeps dh_gencontrol dh_md5sums dh_builddeb dpkg-deb: building package 'hol88-contrib-source' in '../hol88-contrib-source_2.02.19940316dfsg-8_all.deb'. dpkg-deb: building package 'hol88-source' in '../hol88-source_2.02.19940316dfsg-8_all.deb'. dpkg-deb: building package 'hol88-doc' in '../hol88-doc_2.02.19940316dfsg-8_all.deb'. dpkg-deb: building package 'hol88-contrib-help' in '../hol88-contrib-help_2.02.19940316dfsg-8_all.deb'. dpkg-deb: building package 'hol88-help' in '../hol88-help_2.02.19940316dfsg-8_all.deb'. dpkg-deb: building package 'hol88-library-source' in '../hol88-library-source_2.02.19940316dfsg-8_all.deb'. dpkg-deb: building package 'hol88-library-help' in '../hol88-library-help_2.02.19940316dfsg-8_all.deb'. make[1]: Leaving directory '/build/reproducible-path/hol88-2.02.19940316dfsg' dpkg-genbuildinfo --build=binary -O../hol88_2.02.19940316dfsg-8_amd64.buildinfo dpkg-genchanges --build=binary -O../hol88_2.02.19940316dfsg-8_amd64.changes dpkg-genchanges: info: binary-only upload (no source code included) dpkg-source --after-build . dpkg-buildpackage: info: binary-only upload (no source included) dpkg-genchanges: info: not including original source code in upload I: copying local configuration I: unmounting dev/ptmx filesystem I: unmounting dev/pts filesystem I: unmounting dev/shm filesystem I: unmounting proc filesystem I: unmounting sys filesystem I: cleaning the build env I: removing directory /srv/workspace/pbuilder/1425500 and its subdirectories I: Current time: Mon Aug 25 10:29:54 -12 2025 I: pbuilder-time-stamp: 1756160994 Mon Aug 25 22:29:55 UTC 2025 I: 1st build successful. Starting 2nd build on remote node ionos15-amd64.debian.net. Mon Aug 25 22:29:55 UTC 2025 I: Preparing to do remote build '2' on ionos15-amd64.debian.net. Mon Aug 25 22:42:21 UTC 2025 I: Deleting $TMPDIR on ionos15-amd64.debian.net. Mon Aug 25 22:42:21 UTC 2025 I: hol88_2.02.19940316dfsg-8_amd64.changes: Format: 1.8 Date: Wed, 14 May 2025 09:59:29 -0400 Source: hol88 Binary: hol88 hol88-contrib-help hol88-contrib-source hol88-doc hol88-help hol88-library hol88-library-help hol88-library-source hol88-source Architecture: all amd64 Version: 2.02.19940316dfsg-8 Distribution: unstable Urgency: medium Maintainer: Camm Maguire Changed-By: Camm Maguire Description: hol88 - Higher Order Logic, system image hol88-contrib-help - Higher Order Logic, user contributed online help files hol88-contrib-source - Higher Order Logic, user contributed source hol88-doc - Documentation for hol88 hol88-help - Higher Order Logic, online help files hol88-library - Higher Order Logic, binary library modules hol88-library-help - Higher Order Logic, library online help files hol88-library-source - Higher Order Logic, library source files hol88-source - Higher Order Logic, source files Changes: hol88 (2.02.19940316dfsg-8) unstable; urgency=medium . * build-dep latest gcl, select CLtL1 image Checksums-Sha1: 8a46e70138e6e46e2f7235e9ffd60749dfeda9e3 23588 hol88-contrib-help_2.02.19940316dfsg-8_all.deb e24e8e0449cbbb0026297b6b0029f7f52d194c66 725692 hol88-contrib-source_2.02.19940316dfsg-8_all.deb 3441e0ea3f045206fd55f577c08de8cb87e136c5 1064888 hol88-doc_2.02.19940316dfsg-8_all.deb 65b5dae5587cf398b3dd8abe01558f18bb9c6ddb 209424 hol88-help_2.02.19940316dfsg-8_all.deb ddb30830a1d50f88485c33bf66ba5ade5e26fff1 227944 hol88-library-help_2.02.19940316dfsg-8_all.deb a6364a3dab0f5b917a47d2399328ce420140d9e0 417208 hol88-library-source_2.02.19940316dfsg-8_all.deb f0aff750855f6d9e967498c1c49f0fa33e7e9de8 5152304 hol88-library_2.02.19940316dfsg-8_amd64.deb fe8b0dae2edf72475c307d000c14a55d442ac15e 294248 hol88-source_2.02.19940316dfsg-8_all.deb 42fe3b11b059be76586017081cd389604d7fa807 9163 hol88_2.02.19940316dfsg-8_amd64.buildinfo e9029200e9ba04262a918de6edffdaa38826bb8c 11936632 hol88_2.02.19940316dfsg-8_amd64.deb Checksums-Sha256: 1aed648f9d1c2e0e9cbd770a2c0b5aaa9d1cb0ac6556dc7687c06b5f179654f5 23588 hol88-contrib-help_2.02.19940316dfsg-8_all.deb 59fe329f20b9536d704c8176880478425ade94639a9c3e8d69b0e470905d80c2 725692 hol88-contrib-source_2.02.19940316dfsg-8_all.deb dfab71b260c872b2bff4b66e83a5b158570facc3764ae58fc3243d27058b9c4d 1064888 hol88-doc_2.02.19940316dfsg-8_all.deb 4cd74ce129f0542f1f6288afbe0fbcec3ab01437172ab9d846c5ef55ceef8777 209424 hol88-help_2.02.19940316dfsg-8_all.deb f324be311a7215644840ab59984b504d1775aeb6b7050112ed832ca2877e27de 227944 hol88-library-help_2.02.19940316dfsg-8_all.deb 57f2be839c921d142c626675263a918bc22266db221edfac18af5fdc0f3c5514 417208 hol88-library-source_2.02.19940316dfsg-8_all.deb 80345a526c178c8baeaa157d5aecdf17bae9a8cf143a6926dc5e766fdaae0600 5152304 hol88-library_2.02.19940316dfsg-8_amd64.deb c7a0562b9c2a7a6684e4b06da5d6591e42d5e6b158b36f86963a7d737080a4cf 294248 hol88-source_2.02.19940316dfsg-8_all.deb ca3afe7b9192e4d6e9427a6d267f6fb6d012382ac55ea9f80c08cee388da5f4f 9163 hol88_2.02.19940316dfsg-8_amd64.buildinfo 0640f40f469e9bd564d3f201360bede4cca8b1e1970c555a517297c190e07e97 11936632 hol88_2.02.19940316dfsg-8_amd64.deb Files: 939add2704e6939932fc065334fe19e8 23588 math optional hol88-contrib-help_2.02.19940316dfsg-8_all.deb b4132a977092664ef30b30da06918f53 725692 math optional hol88-contrib-source_2.02.19940316dfsg-8_all.deb bb6e9110fbd14b6ba2515c149f4cc89f 1064888 doc optional hol88-doc_2.02.19940316dfsg-8_all.deb 823a6321c1e0904c634ef488cf8c5941 209424 math optional hol88-help_2.02.19940316dfsg-8_all.deb 1a2489c6c545a805fb46e749d5aa9f5d 227944 math optional hol88-library-help_2.02.19940316dfsg-8_all.deb 560a49906a642008edd635dc5b32dd65 417208 math optional hol88-library-source_2.02.19940316dfsg-8_all.deb fe34163da68e8e58cebb14f82f3e191a 5152304 math optional hol88-library_2.02.19940316dfsg-8_amd64.deb 63bc7bb8b06bd78e48448910cfea7122 294248 math optional hol88-source_2.02.19940316dfsg-8_all.deb 878f22ea00457a4d1ba35793652ca79a 9163 math optional hol88_2.02.19940316dfsg-8_amd64.buildinfo 73a9fd0b625678dd85b58509051cb616 11936632 math optional hol88_2.02.19940316dfsg-8_amd64.deb Mon Aug 25 22:42:22 UTC 2025 I: diffoscope 305 will be used to compare the two builds: Running as unit: rb-diffoscope-amd64_3-66243.service; invocation ID: 656ef7e56ef945848420f2ce26960250 # Profiling output for: /usr/bin/diffoscope --timeout 7200 --html /srv/reproducible-results/rbuild-debian/r-b-build.lE5UHU2p/hol88_2.02.19940316dfsg-8.diffoscope.html --text /srv/reproducible-results/rbuild-debian/r-b-build.lE5UHU2p/hol88_2.02.19940316dfsg-8.diffoscope.txt --json /srv/reproducible-results/rbuild-debian/r-b-build.lE5UHU2p/hol88_2.02.19940316dfsg-8.diffoscope.json --profile=- /srv/reproducible-results/rbuild-debian/r-b-build.lE5UHU2p/b1/hol88_2.02.19940316dfsg-8_amd64.changes /srv/reproducible-results/rbuild-debian/r-b-build.lE5UHU2p/b2/hol88_2.02.19940316dfsg-8_amd64.changes ## close_archive (total time: 0.000s) 0.000s 42 calls diffoscope.comparators.xz.XzContainer 0.000s 26 calls diffoscope.comparators.deb.DebContainer 0.000s 34 calls diffoscope.comparators.tar.TarContainer 0.000s 12 calls diffoscope.comparators.gzip.GzipContainer 0.000s 8 calls diffoscope.comparators.deb.DebTarContainer ## command (total time: 1293.051s) 557.235s 1606 calls objdump 523.757s 3986 calls diff 190.244s 40711 calls readelf 17.735s 1265 calls strings 2.536s 80 calls xxd 1.159s 42 calls xz 0.251s 6 calls objcopy 0.065s 12 calls gzip 0.029s 10 calls cmp 0.029s 10 calls cmp (external) 0.010s 184 calls cmp (internal) 0.001s 26 calls ps2ascii ## compare_files (cumulative) (total time: 3895.513s) 677.113s 1 call abc.DotChangesFile 677.065s 4 calls abc.DebFile 676.964s 8 calls abc.XzFile 675.760s 4 calls abc.DebDataTarFile 670.726s 115 calls abc.ElfFile 496.046s 127 calls diffoscope.comparators.elf.ElfCodeSection 10.106s 711 calls diffoscope.comparators.elf.ElfSection 6.007s 419 calls diffoscope.comparators.elf.ElfStringSection 3.243s 6 calls abc.GzipFile 2.242s 4 calls diffoscope.comparators.utils.archive.ArchiveMember 0.138s 17 calls abc.TextFile 0.071s 4 calls abc.TarFile 0.016s 2 calls diffoscope.comparators.utils.libarchive.LibarchiveMember 0.016s 4 calls abc.Md5sumsFile ## container_extract (total time: 2.250s) 1.160s 42 calls diffoscope.comparators.xz.XzContainer 0.913s 518 calls diffoscope.comparators.deb.DebTarContainer 0.095s 50 calls diffoscope.comparators.deb.DebContainer 0.065s 12 calls diffoscope.comparators.gzip.GzipContainer 0.017s 42 calls diffoscope.comparators.tar.TarContainer ## diff (total time: 7.999s) 7.999s 34725 calls linediff ## has_same_content_as (total time: 0.056s) 0.021s 115 calls abc.ElfFile 0.010s 116 calls diffoscope.comparators.utils.libarchive.LibarchiveSymlink 0.008s 4 calls abc.DebDataTarFile 0.007s 9 calls abc.DebFile 0.003s 711 calls diffoscope.comparators.elf.ElfSection 0.002s 24 calls abc.TextFile 0.002s 419 calls diffoscope.comparators.elf.ElfStringSection 0.001s 127 calls diffoscope.comparators.elf.ElfCodeSection 0.001s 8 calls abc.Md5sumsFile 0.000s 6 calls abc.GzipFile 0.000s 8 calls abc.XzFile 0.000s 4 calls abc.TarFile 0.000s 2 calls abc.PsFile 0.000s 4 calls diffoscope.comparators.utils.archive.ArchiveMember 0.000s 1 call abc.DotChangesFile 0.000s 1 call diffoscope.comparators.binary.FilesystemFile 0.000s 2 calls diffoscope.comparators.utils.libarchive.LibarchiveMember ## main (total time: 1174.399s) 1174.393s 2 calls outputs 0.006s 1 call cleanup ## open_archive (total time: 0.000s) 0.000s 34 calls diffoscope.comparators.tar.TarContainer 0.000s 42 calls diffoscope.comparators.xz.XzContainer 0.000s 26 calls diffoscope.comparators.deb.DebContainer 0.000s 8 calls diffoscope.comparators.deb.DebTarContainer 0.000s 12 calls diffoscope.comparators.gzip.GzipContainer ## output (total time: 496.913s) 494.504s 1 call html 1.221s 1 call json 1.188s 1 call text ## recognizes (total time: 0.845s) 0.525s 12516 calls diffoscope.comparators.utils.libarchive.LibarchiveMember 0.137s 12 calls diffoscope.comparators.binary.FilesystemFile 0.125s 3754 calls diffoscope.comparators.utils.archive.ArchiveMember 0.057s 972 calls diffoscope.comparators.debian.DebControlMember ## specialize (total time: 0.923s) 0.923s 1560 calls specialize Finished with result: success Main processes terminated with: code=exited, status=1/FAILURE Service runtime: 19min 34.666s CPU time consumed: 23min 12.896s Memory peak: 4G (swap: 0B) Mon Aug 25 23:02:03 UTC 2025 W: Diffoscope claims the build is reproducible, but there is a diffoscope file. Please investigate. Mon Aug 25 23:02:03 UTC 2025 E: hol88 failed to build reproducibly in unstable on amd64. Mon Aug 25 23:02:55 UTC 2025 I: Removing signed hol88_2.02.19940316dfsg-8_amd64.buildinfo.asc files: removed './b1/hol88_2.02.19940316dfsg-8_amd64.buildinfo.asc' removed './b2/hol88_2.02.19940316dfsg-8_amd64.buildinfo.asc'