Tue Aug 10 14:14:21 UTC 2021 I: starting to build hol-light/bullseye/arm64 on jenkins on '2021-08-10 14:13'
Tue Aug 10 14:14:21 UTC 2021 I: The jenkins build log is/was available at https://jenkins.debian.net/userContent/reproducible/debian/build_service/arm64_8/26542/console.log
Tue Aug 10 14:14:21 UTC 2021 I: Downloading source for bullseye/hol-light=20190729-4
--2021-08-10 14:14:21-- http://cdn-fastly.deb.debian.org/debian/pool/main/h/hol-light/hol-light_20190729-4.dsc
Connecting to 78.137.99.97:3128... connected.
Proxy request sent, awaiting response... 200 OK
Length: 1781 (1.7K)
Saving to: ‘hol-light_20190729-4.dsc’
0K . 100% 328M=0s
2021-08-10 14:14:21 (328 MB/s) - ‘hol-light_20190729-4.dsc’ saved [1781/1781]
Tue Aug 10 14:14:21 UTC 2021 I: hol-light_20190729-4.dsc
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA512
Format: 3.0 (quilt)
Source: hol-light
Binary: hol-light
Architecture: any
Version: 20190729-4
Maintainer: Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
Uploaders: Hendrik Tews <hendrik@askra.de>
Homepage: http://www.cl.cam.ac.uk/~jrh13/hol-light/
Standards-Version: 4.4.1
Vcs-Browser: https://salsa.debian.org/ocaml-team/hol-light
Vcs-Git: https://salsa.debian.org/ocaml-team/hol-light.git
Build-Depends: debhelper-compat (= 12), camlp5 (>= 7.11), ocaml-base-nox, libnum-ocaml-dev, dh-ocaml
Package-List:
hol-light deb math optional arch=any
Checksums-Sha1:
78a00734637a1cb7312c4c3cf71f7efca559dee1 6959546 hol-light_20190729.orig.tar.gz
779019be6fd66b0fd466278fd2ba0283e1b65f11 11064 hol-light_20190729-4.debian.tar.xz
Checksums-Sha256:
88cfcdd1430d963b9fc63960829e1a5f7c08df98ed92b3765cff51691dbfe75a 6959546 hol-light_20190729.orig.tar.gz
53d607dc442fecb99d93726a8eb55320b4664642c97250782442718511da87e6 11064 hol-light_20190729-4.debian.tar.xz
Files:
9a8813a63d883e10c5b52c36b93ee9b0 6959546 hol-light_20190729.orig.tar.gz
54f705b5981178d7b552fa0588e0bd2c 11064 hol-light_20190729-4.debian.tar.xz
Dgit: 965d54501388ff89c35082ffca6a63faada91462 debian archive/debian/20190729-4 https://git.dgit.debian.org/hol-light
-----BEGIN PGP SIGNATURE-----
iQEzBAEBCgAdFiEEbeJOl+yohsxW5iUOIbju8bGJMIEFAl5D9tMACgkQIbju8bGJ
MIF3UAgAlrp4Tcljgm+oFaEgjt5OgH+PYOuEsnWjp3GZC5PMk2QNrjMfFSQ2FgGm
VZCr/h6jgQ01WbUoVy1KMx+0hADI8ZXWgxMXEhhlFvWsXSv6vDazIRR3fDph+R3L
PGkGnBsWBAJByZvL0tzXSJOOqf2uC1ErARGppQi5R3lKIVK6NJwippJ5ia9PrZlj
Jd0Ium9rbh1bvQX99uu6RFte5G7FdnRCDBzM03AvyDobM87zHFZlN29cI2DA0074
9dovjGGTCHPBWMT4mTeDdj6udjUgpTg1McnipqB7czUZpnrvNTV7QHEzSYFapiwx
Ge3B/3sYINbYR5SlCqqkbYdVU6NmDg==
=xul0
-----END PGP SIGNATURE-----
Tue Aug 10 14:14:21 UTC 2021 I: Checking whether the package is not for us
Tue Aug 10 14:14:21 UTC 2021 I: Starting 1st build on remote node codethink10-arm64.debian.net.
Tue Aug 10 14:14:21 UTC 2021 I: Preparing to do remote build '1' on codethink10-arm64.debian.net.
Tue Aug 10 14:21:43 UTC 2021 I: Deleting $TMPDIR on codethink10-arm64.debian.net.
I: pbuilder: network access will be disabled during build
I: Current time: Tue Aug 10 02:14:28 -12 2021
I: pbuilder-time-stamp: 1628604868
I: Building the build Environment
I: extracting base tarball [/var/cache/pbuilder/bullseye-reproducible-base.tgz]
I: copying local configuration
I: mounting /proc filesystem
I: mounting /sys filesystem
I: creating /{dev,run}/shm
I: mounting /dev/pts filesystem
I: redirecting /dev/ptmx to /dev/pts/ptmx
I: policy-rc.d already exists
I: Copying source file
I: copying [hol-light_20190729-4.dsc]
I: copying [./hol-light_20190729.orig.tar.gz]
I: copying [./hol-light_20190729-4.debian.tar.xz]
I: Extracting source
gpgv: unknown type of key resource 'trustedkeys.kbx'
gpgv: keyblock resource '/tmp/dpkg-verify-sig.KQmVPDfD/trustedkeys.kbx': General error
gpgv: Signature made Wed Feb 12 01:00:03 2020 -12
gpgv: using RSA key 6DE24E97ECA886CC56E6250E21B8EEF1B1893081
gpgv: Can't check signature: No public key
dpkg-source: warning: failed to verify signature on ./hol-light_20190729-4.dsc
dpkg-source: info: extracting hol-light in hol-light-20190729
dpkg-source: info: unpacking hol-light_20190729.orig.tar.gz
dpkg-source: info: unpacking hol-light_20190729-4.debian.tar.xz
dpkg-source: info: using patch list from debian/patches/series
dpkg-source: info: applying default-hollight-dir
dpkg-source: info: applying holtest-no-proof-recording.patch
dpkg-source: info: applying cd-holtest-parallel.patch
dpkg-source: info: applying 0004-Fix-compilation-with-camlp5-7.11.patch
I: Not using root during the build.
I: Installing the build-deps
I: user script /srv/workspace/pbuilder/13675/tmp/hooks/D02_print_environment starting
I: set
BUILDDIR='/build'
BUILDUSERGECOS='first user,first room,first work-phone,first home-phone,first other'
BUILDUSERNAME='pbuilder1'
BUILD_ARCH='arm64'
DEBIAN_FRONTEND='noninteractive'
DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all,-fixfilepath parallel=8'
DISTRIBUTION=''
HOME='/var/lib/jenkins'
HOST_ARCH='arm64'
IFS='
'
LANG='C'
LANGUAGE='en_US:en'
LC_ALL='C'
MAIL='/var/mail/root'
OPTIND='1'
PATH='/usr/sbin:/usr/bin:/sbin:/bin:/usr/games'
PBCURRENTCOMMANDLINEOPERATION='build'
PBUILDER_OPERATION='build'
PBUILDER_PKGDATADIR='/usr/share/pbuilder'
PBUILDER_PKGLIBDIR='/usr/lib/pbuilder'
PBUILDER_SYSCONFDIR='/etc'
PPID='13675'
PS1='# '
PS2='> '
PS4='+ '
PWD='/'
SHELL='/bin/bash'
SHLVL='2'
SUDO_COMMAND='/usr/bin/timeout -k 18.1h 18h /usr/bin/ionice -c 3 /usr/bin/nice /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/tmp.DWgS8KhVmH/pbuilderrc_KwUZ --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/bullseye-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/tmp.DWgS8KhVmH/b1 --logfile b1/build.log hol-light_20190729-4.dsc'
SUDO_GID='117'
SUDO_UID='110'
SUDO_USER='jenkins'
TERM='unknown'
TZ='/usr/share/zoneinfo/Etc/GMT+12'
USER='root'
USERNAME='root'
_='/usr/bin/systemd-run'
http_proxy='http://192.168.101.16:3128'
I: uname -a
Linux codethink10-arm64 4.15.0-153-generic #160-Ubuntu SMP Thu Jul 29 07:06:07 UTC 2021 aarch64 GNU/Linux
I: ls -l /bin
total 5252
-rwxr-xr-x 1 root root 1282512 Aug 4 08:25 bash
-rwxr-xr-x 3 root root 34808 Jul 20 2020 bunzip2
-rwxr-xr-x 3 root root 34808 Jul 20 2020 bzcat
lrwxrwxrwx 1 root root 6 Jul 20 2020 bzcmp -> bzdiff
-rwxr-xr-x 1 root root 2225 Jul 20 2020 bzdiff
lrwxrwxrwx 1 root root 6 Jul 20 2020 bzegrep -> bzgrep
-rwxr-xr-x 1 root root 4877 Sep 4 2019 bzexe
lrwxrwxrwx 1 root root 6 Jul 20 2020 bzfgrep -> bzgrep
-rwxr-xr-x 1 root root 3775 Jul 20 2020 bzgrep
-rwxr-xr-x 3 root root 34808 Jul 20 2020 bzip2
-rwxr-xr-x 1 root root 14264 Jul 20 2020 bzip2recover
lrwxrwxrwx 1 root root 6 Jul 20 2020 bzless -> bzmore
-rwxr-xr-x 1 root root 1297 Jul 20 2020 bzmore
-rwxr-xr-x 1 root root 39832 Sep 22 2020 cat
-rwxr-xr-x 1 root root 64512 Sep 22 2020 chgrp
-rwxr-xr-x 1 root root 60368 Sep 22 2020 chmod
-rwxr-xr-x 1 root root 64528 Sep 22 2020 chown
-rwxr-xr-x 1 root root 138896 Sep 22 2020 cp
-rwxr-xr-x 1 root root 129544 Dec 10 2020 dash
-rwxr-xr-x 1 root root 101384 Sep 22 2020 date
-rwxr-xr-x 1 root root 80984 Sep 22 2020 dd
-rwxr-xr-x 1 root root 89824 Sep 22 2020 df
-rwxr-xr-x 1 root root 143088 Sep 22 2020 dir
-rwxr-xr-x 1 root root 76152 Jul 28 07:09 dmesg
lrwxrwxrwx 1 root root 8 Nov 6 2019 dnsdomainname -> hostname
lrwxrwxrwx 1 root root 8 Nov 6 2019 domainname -> hostname
-rwxr-xr-x 1 root root 35632 Sep 22 2020 echo
-rwxr-xr-x 1 root root 28 Nov 9 2020 egrep
-rwxr-xr-x 1 root root 31512 Sep 22 2020 false
-rwxr-xr-x 1 root root 28 Nov 9 2020 fgrep
-rwxr-xr-x 1 root root 64856 Jul 28 07:09 findmnt
-rwsr-xr-x 1 root root 34824 Feb 26 04:12 fusermount
-rwxr-xr-x 1 root root 178400 Nov 9 2020 grep
-rwxr-xr-x 2 root root 2346 Mar 2 11:30 gunzip
-rwxr-xr-x 1 root root 6376 Mar 2 11:30 gzexe
-rwxr-xr-x 1 root root 93744 Mar 2 11:30 gzip
-rwxr-xr-x 1 root root 18440 Nov 6 2019 hostname
-rwxr-xr-x 1 root root 68720 Sep 22 2020 ln
-rwxr-xr-x 1 root root 52720 Feb 7 2020 login
-rwxr-xr-x 1 root root 143088 Sep 22 2020 ls
-rwxr-xr-x 1 root root 161960 Jul 28 07:09 lsblk
-rwxr-xr-x 1 root root 85200 Sep 22 2020 mkdir
-rwxr-xr-x 1 root root 68744 Sep 22 2020 mknod
-rwxr-xr-x 1 root root 43976 Sep 22 2020 mktemp
-rwxr-xr-x 1 root root 51368 Jul 28 07:09 more
-rwsr-xr-x 1 root root 51360 Jul 28 07:09 mount
-rwxr-xr-x 1 root root 14496 Jul 28 07:09 mountpoint
-rwxr-xr-x 1 root root 134808 Sep 22 2020 mv
lrwxrwxrwx 1 root root 8 Nov 6 2019 nisdomainname -> hostname
lrwxrwxrwx 1 root root 14 Apr 18 03:38 pidof -> /sbin/killall5
-rwxr-xr-x 1 root root 35720 Sep 22 2020 pwd
lrwxrwxrwx 1 root root 4 Aug 4 08:25 rbash -> bash
-rwxr-xr-x 1 root root 43872 Sep 22 2020 readlink
-rwxr-xr-x 1 root root 68592 Sep 22 2020 rm
-rwxr-xr-x 1 root root 43880 Sep 22 2020 rmdir
-rwxr-xr-x 1 root root 19208 Sep 27 2020 run-parts
-rwxr-xr-x 1 root root 114016 Dec 22 2018 sed
lrwxrwxrwx 1 root root 4 Aug 8 23:21 sh -> dash
-rwxr-xr-x 1 root root 35656 Sep 22 2020 sleep
-rwxr-xr-x 1 root root 72640 Sep 22 2020 stty
-rwsr-xr-x 1 root root 67776 Jul 28 07:09 su
-rwxr-xr-x 1 root root 35672 Sep 22 2020 sync
-rwxr-xr-x 1 root root 535768 Feb 16 21:55 tar
-rwxr-xr-x 1 root root 10568 Sep 27 2020 tempfile
-rwxr-xr-x 1 root root 89120 Sep 22 2020 touch
-rwxr-xr-x 1 root root 31512 Sep 22 2020 true
-rwxr-xr-x 1 root root 14264 Feb 26 04:12 ulockmgr_server
-rwsr-xr-x 1 root root 30880 Jul 28 07:09 umount
-rwxr-xr-x 1 root root 35640 Sep 22 2020 uname
-rwxr-xr-x 2 root root 2346 Mar 2 11:30 uncompress
-rwxr-xr-x 1 root root 143088 Sep 22 2020 vdir
-rwxr-xr-x 1 root root 59584 Jul 28 07:09 wdctl
lrwxrwxrwx 1 root root 8 Nov 6 2019 ypdomainname -> hostname
-rwxr-xr-x 1 root root 1984 Mar 2 11:30 zcat
-rwxr-xr-x 1 root root 1678 Mar 2 11:30 zcmp
-rwxr-xr-x 1 root root 5880 Mar 2 11:30 zdiff
-rwxr-xr-x 1 root root 29 Mar 2 11:30 zegrep
-rwxr-xr-x 1 root root 29 Mar 2 11:30 zfgrep
-rwxr-xr-x 1 root root 2081 Mar 2 11:30 zforce
-rwxr-xr-x 1 root root 7585 Mar 2 11:30 zgrep
-rwxr-xr-x 1 root root 2206 Mar 2 11:30 zless
-rwxr-xr-x 1 root root 1842 Mar 2 11:30 zmore
-rwxr-xr-x 1 root root 4553 Mar 2 11:30 znew
I: user script /srv/workspace/pbuilder/13675/tmp/hooks/D02_print_environment finished
-> Attempting to satisfy build-dependencies
-> Creating pbuilder-satisfydepends-dummy package
Package: pbuilder-satisfydepends-dummy
Version: 0.invalid.0
Architecture: arm64
Maintainer: Debian Pbuilder Team <pbuilder-maint@lists.alioth.debian.org>
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 (= 12), camlp5 (>= 7.11), ocaml-base-nox, libnum-ocaml-dev, dh-ocaml
dpkg-deb: building package 'pbuilder-satisfydepends-dummy' in '/tmp/satisfydepends-aptitude/pbuilder-satisfydepends-dummy.deb'.
Selecting previously unselected package pbuilder-satisfydepends-dummy.
(Reading database ... 19646 files and directories currently installed.)
Preparing to unpack .../pbuilder-satisfydepends-dummy.deb ...
Unpacking pbuilder-satisfydepends-dummy (0.invalid.0) ...
dpkg: pbuilder-satisfydepends-dummy: dependency problems, but configuring anyway as you requested:
pbuilder-satisfydepends-dummy depends on debhelper-compat (= 12); however:
Package debhelper-compat is not installed.
pbuilder-satisfydepends-dummy depends on camlp5 (>= 7.11); however:
Package camlp5 is not installed.
pbuilder-satisfydepends-dummy depends on ocaml-base-nox; however:
Package ocaml-base-nox is not installed.
pbuilder-satisfydepends-dummy depends on libnum-ocaml-dev; however:
Package libnum-ocaml-dev is not installed.
pbuilder-satisfydepends-dummy depends on dh-ocaml; however:
Package dh-ocaml 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} camlp5{a} debhelper{a} dh-autoreconf{a} dh-ocaml{a} dh-strip-nondeterminism{a} dwz{a} file{a} gettext{a} gettext-base{a} groff-base{a} intltool-debian{a} libarchive-zip-perl{a} libdebhelper-perl{a} libelf1{a} libfile-stripnondeterminism-perl{a} libicu67{a} libmagic-mgc{a} libmagic1{a} libncurses-dev{a} libncurses5-dev{a} libncurses6{a} libnum-ocaml{a} libnum-ocaml-dev{a} libpipeline1{a} libsigsegv2{a} libsub-override-perl{a} libtool{a} libuchardet0{a} libxml2{a} m4{a} man-db{a} ocaml-base-nox{a} ocaml-compiler-libs{a} ocaml-interp{a} ocaml-nox{a} po-debconf{a} sensible-utils{a}
The following packages are RECOMMENDED but will NOT be installed:
curl ledit libarchive-cpio-perl libgpm2 libltdl-dev libmail-sendmail-perl lynx ocaml-findlib ocaml-man rlfe rlwrap wget
0 packages upgraded, 42 newly installed, 0 to remove and 0 not upgraded.
Need to get 132 MB of archives. After unpacking 580 MB will be used.
Writing extended state information...
Get: 1 http://deb.debian.org/debian bullseye/main arm64 bsdextrautils arm64 2.36.1-8 [142 kB]
Get: 2 http://deb.debian.org/debian bullseye/main arm64 libuchardet0 arm64 0.0.7-1 [67.9 kB]
Get: 3 http://deb.debian.org/debian bullseye/main arm64 groff-base arm64 1.22.4-6 [883 kB]
Get: 4 http://deb.debian.org/debian bullseye/main arm64 libpipeline1 arm64 1.5.3-1 [33.0 kB]
Get: 5 http://deb.debian.org/debian bullseye/main arm64 man-db arm64 2.9.4-2 [1336 kB]
Get: 6 http://deb.debian.org/debian bullseye/main arm64 sensible-utils all 0.0.14 [14.8 kB]
Get: 7 http://deb.debian.org/debian bullseye/main arm64 libmagic-mgc arm64 1:5.39-3 [273 kB]
Get: 8 http://deb.debian.org/debian bullseye/main arm64 libmagic1 arm64 1:5.39-3 [121 kB]
Get: 9 http://deb.debian.org/debian bullseye/main arm64 file arm64 1:5.39-3 [69.1 kB]
Get: 10 http://deb.debian.org/debian bullseye/main arm64 gettext-base arm64 0.21-4 [173 kB]
Get: 11 http://deb.debian.org/debian bullseye/main arm64 libsigsegv2 arm64 2.13-1 [34.7 kB]
Get: 12 http://deb.debian.org/debian bullseye/main arm64 m4 arm64 1.4.18-5 [199 kB]
Get: 13 http://deb.debian.org/debian bullseye/main arm64 autoconf all 2.69-14 [313 kB]
Get: 14 http://deb.debian.org/debian bullseye/main arm64 autotools-dev all 20180224.1+nmu1 [77.1 kB]
Get: 15 http://deb.debian.org/debian bullseye/main arm64 automake all 1:1.16.3-2 [814 kB]
Get: 16 http://deb.debian.org/debian bullseye/main arm64 autopoint all 0.21-4 [510 kB]
Get: 17 http://deb.debian.org/debian bullseye/main arm64 ocaml-base-nox arm64 4.11.1-4 [675 kB]
Get: 18 http://deb.debian.org/debian bullseye/main arm64 libncurses6 arm64 6.2+20201114-2 [93.2 kB]
Get: 19 http://deb.debian.org/debian bullseye/main arm64 libncurses-dev arm64 6.2+20201114-2 [335 kB]
Get: 20 http://deb.debian.org/debian bullseye/main arm64 libncurses5-dev arm64 6.2+20201114-2 [936 B]
Get: 21 http://deb.debian.org/debian bullseye/main arm64 ocaml-interp arm64 4.11.1-4 [5862 kB]
Get: 22 http://deb.debian.org/debian bullseye/main arm64 ocaml-nox arm64 4.11.1-4 [72.4 MB]
Get: 23 http://deb.debian.org/debian bullseye/main arm64 ocaml-compiler-libs arm64 4.11.1-4 [29.7 MB]
Get: 24 http://deb.debian.org/debian bullseye/main arm64 camlp5 arm64 7.13-1+b1 [4193 kB]
Get: 25 http://deb.debian.org/debian bullseye/main arm64 libdebhelper-perl all 13.3.4 [189 kB]
Get: 26 http://deb.debian.org/debian bullseye/main arm64 libtool all 2.4.6-15 [513 kB]
Get: 27 http://deb.debian.org/debian bullseye/main arm64 dh-autoreconf all 20 [17.1 kB]
Get: 28 http://deb.debian.org/debian bullseye/main arm64 libarchive-zip-perl all 1.68-1 [104 kB]
Get: 29 http://deb.debian.org/debian bullseye/main arm64 libsub-override-perl all 0.09-2 [10.2 kB]
Get: 30 http://deb.debian.org/debian bullseye/main arm64 libfile-stripnondeterminism-perl all 1.12.0-1 [26.3 kB]
Get: 31 http://deb.debian.org/debian bullseye/main arm64 dh-strip-nondeterminism all 1.12.0-1 [15.4 kB]
Get: 32 http://deb.debian.org/debian bullseye/main arm64 libelf1 arm64 0.183-1 [164 kB]
Get: 33 http://deb.debian.org/debian bullseye/main arm64 dwz arm64 0.13+20210201-1 [155 kB]
Get: 34 http://deb.debian.org/debian bullseye/main arm64 libicu67 arm64 67.1-7 [8467 kB]
Get: 35 http://deb.debian.org/debian bullseye/main arm64 libxml2 arm64 2.9.10+dfsg-6.7 [629 kB]
Get: 36 http://deb.debian.org/debian bullseye/main arm64 gettext arm64 0.21-4 [1261 kB]
Get: 37 http://deb.debian.org/debian bullseye/main arm64 intltool-debian all 0.35.0+20060710.5 [26.8 kB]
Get: 38 http://deb.debian.org/debian bullseye/main arm64 po-debconf all 1.0.21+nmu1 [248 kB]
Get: 39 http://deb.debian.org/debian bullseye/main arm64 debhelper all 13.3.4 [1049 kB]
Get: 40 http://deb.debian.org/debian bullseye/main arm64 dh-ocaml all 1.1.3 [82.9 kB]
Get: 41 http://deb.debian.org/debian bullseye/main arm64 libnum-ocaml arm64 1.4-1 [173 kB]
Get: 42 http://deb.debian.org/debian bullseye/main arm64 libnum-ocaml-dev arm64 1.4-1 [106 kB]
Fetched 132 MB in 3s (52.3 MB/s)
debconf: delaying package configuration, since apt-utils is not installed
Selecting previously unselected package bsdextrautils.
(Reading database ...
(Reading database ... 5%
(Reading database ... 10%
(Reading database ... 15%
(Reading database ... 20%
(Reading database ... 25%
(Reading database ... 30%
(Reading database ... 35%
(Reading database ... 40%
(Reading database ... 45%
(Reading database ... 50%
(Reading database ... 55%
(Reading database ... 60%
(Reading database ... 65%
(Reading database ... 70%
(Reading database ... 75%
(Reading database ... 80%
(Reading database ... 85%
(Reading database ... 90%
(Reading database ... 95%
(Reading database ... 100%
(Reading database ... 19646 files and directories currently installed.)
Preparing to unpack .../00-bsdextrautils_2.36.1-8_arm64.deb ...
Unpacking bsdextrautils (2.36.1-8) ...
Selecting previously unselected package libuchardet0:arm64.
Preparing to unpack .../01-libuchardet0_0.0.7-1_arm64.deb ...
Unpacking libuchardet0:arm64 (0.0.7-1) ...
Selecting previously unselected package groff-base.
Preparing to unpack .../02-groff-base_1.22.4-6_arm64.deb ...
Unpacking groff-base (1.22.4-6) ...
Selecting previously unselected package libpipeline1:arm64.
Preparing to unpack .../03-libpipeline1_1.5.3-1_arm64.deb ...
Unpacking libpipeline1:arm64 (1.5.3-1) ...
Selecting previously unselected package man-db.
Preparing to unpack .../04-man-db_2.9.4-2_arm64.deb ...
Unpacking man-db (2.9.4-2) ...
Selecting previously unselected package sensible-utils.
Preparing to unpack .../05-sensible-utils_0.0.14_all.deb ...
Unpacking sensible-utils (0.0.14) ...
Selecting previously unselected package libmagic-mgc.
Preparing to unpack .../06-libmagic-mgc_1%3a5.39-3_arm64.deb ...
Unpacking libmagic-mgc (1:5.39-3) ...
Selecting previously unselected package libmagic1:arm64.
Preparing to unpack .../07-libmagic1_1%3a5.39-3_arm64.deb ...
Unpacking libmagic1:arm64 (1:5.39-3) ...
Selecting previously unselected package file.
Preparing to unpack .../08-file_1%3a5.39-3_arm64.deb ...
Unpacking file (1:5.39-3) ...
Selecting previously unselected package gettext-base.
Preparing to unpack .../09-gettext-base_0.21-4_arm64.deb ...
Unpacking gettext-base (0.21-4) ...
Selecting previously unselected package libsigsegv2:arm64.
Preparing to unpack .../10-libsigsegv2_2.13-1_arm64.deb ...
Unpacking libsigsegv2:arm64 (2.13-1) ...
Selecting previously unselected package m4.
Preparing to unpack .../11-m4_1.4.18-5_arm64.deb ...
Unpacking m4 (1.4.18-5) ...
Selecting previously unselected package autoconf.
Preparing to unpack .../12-autoconf_2.69-14_all.deb ...
Unpacking autoconf (2.69-14) ...
Selecting previously unselected package autotools-dev.
Preparing to unpack .../13-autotools-dev_20180224.1+nmu1_all.deb ...
Unpacking autotools-dev (20180224.1+nmu1) ...
Selecting previously unselected package automake.
Preparing to unpack .../14-automake_1%3a1.16.3-2_all.deb ...
Unpacking automake (1:1.16.3-2) ...
Selecting previously unselected package autopoint.
Preparing to unpack .../15-autopoint_0.21-4_all.deb ...
Unpacking autopoint (0.21-4) ...
Selecting previously unselected package ocaml-base-nox.
Preparing to unpack .../16-ocaml-base-nox_4.11.1-4_arm64.deb ...
Unpacking ocaml-base-nox (4.11.1-4) ...
Selecting previously unselected package libncurses6:arm64.
Preparing to unpack .../17-libncurses6_6.2+20201114-2_arm64.deb ...
Unpacking libncurses6:arm64 (6.2+20201114-2) ...
Selecting previously unselected package libncurses-dev:arm64.
Preparing to unpack .../18-libncurses-dev_6.2+20201114-2_arm64.deb ...
Unpacking libncurses-dev:arm64 (6.2+20201114-2) ...
Selecting previously unselected package libncurses5-dev:arm64.
Preparing to unpack .../19-libncurses5-dev_6.2+20201114-2_arm64.deb ...
Unpacking libncurses5-dev:arm64 (6.2+20201114-2) ...
Selecting previously unselected package ocaml-interp.
Preparing to unpack .../20-ocaml-interp_4.11.1-4_arm64.deb ...
Unpacking ocaml-interp (4.11.1-4) ...
Selecting previously unselected package ocaml-nox.
Preparing to unpack .../21-ocaml-nox_4.11.1-4_arm64.deb ...
Unpacking ocaml-nox (4.11.1-4) ...
Selecting previously unselected package ocaml-compiler-libs.
Preparing to unpack .../22-ocaml-compiler-libs_4.11.1-4_arm64.deb ...
Unpacking ocaml-compiler-libs (4.11.1-4) ...
Selecting previously unselected package camlp5.
Preparing to unpack .../23-camlp5_7.13-1+b1_arm64.deb ...
Unpacking camlp5 (7.13-1+b1) ...
Selecting previously unselected package libdebhelper-perl.
Preparing to unpack .../24-libdebhelper-perl_13.3.4_all.deb ...
Unpacking libdebhelper-perl (13.3.4) ...
Selecting previously unselected package libtool.
Preparing to unpack .../25-libtool_2.4.6-15_all.deb ...
Unpacking libtool (2.4.6-15) ...
Selecting previously unselected package dh-autoreconf.
Preparing to unpack .../26-dh-autoreconf_20_all.deb ...
Unpacking dh-autoreconf (20) ...
Selecting previously unselected package libarchive-zip-perl.
Preparing to unpack .../27-libarchive-zip-perl_1.68-1_all.deb ...
Unpacking libarchive-zip-perl (1.68-1) ...
Selecting previously unselected package libsub-override-perl.
Preparing to unpack .../28-libsub-override-perl_0.09-2_all.deb ...
Unpacking libsub-override-perl (0.09-2) ...
Selecting previously unselected package libfile-stripnondeterminism-perl.
Preparing to unpack .../29-libfile-stripnondeterminism-perl_1.12.0-1_all.deb ...
Unpacking libfile-stripnondeterminism-perl (1.12.0-1) ...
Selecting previously unselected package dh-strip-nondeterminism.
Preparing to unpack .../30-dh-strip-nondeterminism_1.12.0-1_all.deb ...
Unpacking dh-strip-nondeterminism (1.12.0-1) ...
Selecting previously unselected package libelf1:arm64.
Preparing to unpack .../31-libelf1_0.183-1_arm64.deb ...
Unpacking libelf1:arm64 (0.183-1) ...
Selecting previously unselected package dwz.
Preparing to unpack .../32-dwz_0.13+20210201-1_arm64.deb ...
Unpacking dwz (0.13+20210201-1) ...
Selecting previously unselected package libicu67:arm64.
Preparing to unpack .../33-libicu67_67.1-7_arm64.deb ...
Unpacking libicu67:arm64 (67.1-7) ...
Selecting previously unselected package libxml2:arm64.
Preparing to unpack .../34-libxml2_2.9.10+dfsg-6.7_arm64.deb ...
Unpacking libxml2:arm64 (2.9.10+dfsg-6.7) ...
Selecting previously unselected package gettext.
Preparing to unpack .../35-gettext_0.21-4_arm64.deb ...
Unpacking gettext (0.21-4) ...
Selecting previously unselected package intltool-debian.
Preparing to unpack .../36-intltool-debian_0.35.0+20060710.5_all.deb ...
Unpacking intltool-debian (0.35.0+20060710.5) ...
Selecting previously unselected package po-debconf.
Preparing to unpack .../37-po-debconf_1.0.21+nmu1_all.deb ...
Unpacking po-debconf (1.0.21+nmu1) ...
Selecting previously unselected package debhelper.
Preparing to unpack .../38-debhelper_13.3.4_all.deb ...
Unpacking debhelper (13.3.4) ...
Selecting previously unselected package dh-ocaml.
Preparing to unpack .../39-dh-ocaml_1.1.3_all.deb ...
Unpacking dh-ocaml (1.1.3) ...
Selecting previously unselected package libnum-ocaml.
Preparing to unpack .../40-libnum-ocaml_1.4-1_arm64.deb ...
Unpacking libnum-ocaml (1.4-1) ...
Selecting previously unselected package libnum-ocaml-dev.
Preparing to unpack .../41-libnum-ocaml-dev_1.4-1_arm64.deb ...
Unpacking libnum-ocaml-dev (1.4-1) ...
Setting up libpipeline1:arm64 (1.5.3-1) ...
Setting up bsdextrautils (2.36.1-8) ...
update-alternatives: using /usr/bin/write.ul to provide /usr/bin/write (write) in auto mode
Setting up libicu67:arm64 (67.1-7) ...
Setting up libmagic-mgc (1:5.39-3) ...
Setting up libarchive-zip-perl (1.68-1) ...
Setting up libdebhelper-perl (13.3.4) ...
Setting up dh-ocaml (1.1.3) ...
Setting up libmagic1:arm64 (1:5.39-3) ...
Setting up gettext-base (0.21-4) ...
Setting up file (1:5.39-3) ...
Setting up autotools-dev (20180224.1+nmu1) ...
Setting up libncurses6:arm64 (6.2+20201114-2) ...
Setting up libsigsegv2:arm64 (2.13-1) ...
Setting up autopoint (0.21-4) ...
Setting up sensible-utils (0.0.14) ...
Setting up libuchardet0:arm64 (0.0.7-1) ...
Setting up libsub-override-perl (0.09-2) ...
Setting up ocaml-base-nox (4.11.1-4) ...
Setting up libelf1:arm64 (0.183-1) ...
Setting up libxml2:arm64 (2.9.10+dfsg-6.7) ...
Setting up libfile-stripnondeterminism-perl (1.12.0-1) ...
Setting up libncurses-dev:arm64 (6.2+20201114-2) ...
Setting up gettext (0.21-4) ...
Setting up libtool (2.4.6-15) ...
Setting up m4 (1.4.18-5) ...
Setting up intltool-debian (0.35.0+20060710.5) ...
Setting up autoconf (2.69-14) ...
Setting up dh-strip-nondeterminism (1.12.0-1) ...
Setting up libnum-ocaml (1.4-1) ...
Setting up dwz (0.13+20210201-1) ...
Setting up groff-base (1.22.4-6) ...
Setting up libncurses5-dev:arm64 (6.2+20201114-2) ...
Setting up automake (1:1.16.3-2) ...
update-alternatives: using /usr/bin/automake-1.16 to provide /usr/bin/automake (automake) in auto mode
Setting up po-debconf (1.0.21+nmu1) ...
Setting up man-db (2.9.4-2) ...
Not building database; man-db/auto-update is not 'true'.
Setting up dh-autoreconf (20) ...
Setting up debhelper (13.3.4) ...
Setting up ocaml-compiler-libs (4.11.1-4) ...
Setting up ocaml-interp (4.11.1-4) ...
Setting up ocaml-nox (4.11.1-4) ...
Setting up libnum-ocaml-dev (1.4-1) ...
Setting up camlp5 (7.13-1+b1) ...
Processing triggers for libc-bin (2.31-13) ...
Reading package lists...
Building dependency tree...
Reading state information...
Reading extended state information...
Initializing package states...
Writing extended state information...
Building tag database...
-> Finished parsing the build-deps
I: Building the package
I: Running cd /build/hol-light-20190729/ && 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 > ../hol-light_20190729-4_source.changes
dpkg-buildpackage: info: source package hol-light
dpkg-buildpackage: info: source version 20190729-4
dpkg-buildpackage: info: source distribution unstable
dpkg-buildpackage: info: source changed by Stéphane Glondu <glondu@debian.org>
dpkg-source --before-build .
dpkg-buildpackage: info: host architecture arm64
debian/rules clean
dh clean --with ocaml
debian/rules override_dh_auto_clean
make[1]: Entering directory '/build/hol-light-20190729'
dh_auto_clean
make -j8 clean
make[2]: Entering directory '/build/hol-light-20190729'
rm -f update_database.ml pa_j.ml pa_j.cmi pa_j.cmo hol hol.multivariate hol.sosa hol.card hol.complex;
make[2]: Leaving directory '/build/hol-light-20190729'
make -C Mizarlight clean
make[2]: Entering directory '/build/hol-light-20190729/Mizarlight'
rm -f pa_f.cmi pa_f.cmo
make[2]: Leaving directory '/build/hol-light-20190729/Mizarlight'
make[1]: Leaving directory '/build/hol-light-20190729'
dh_ocamlclean
dh_clean
debian/rules binary
dh binary --with ocaml
dh_update_autotools_config
dh_autoreconf
dh_ocamlinit
dh_auto_configure
dh_auto_build
make -j8 "INSTALL=install --strip-program=true"
make[1]: Entering directory '/build/hol-light-20190729'
cp update_database_`ocamlc -version | cut -c1`.ml update_database.ml
\
if test `ocamlc -version | cut -c1-3` = "3.0" ; \
then cp pa_j_`ocamlc -version | cut -c1-4`.ml pa_j.ml ; \
else if test `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -c1` = "7" ; \
then if test `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "7.01" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "7.02" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "7.03" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "7.04" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "7.05" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "7.06" ; \
then cp pa_j_4.xx_7.06.ml pa_j.ml; \
else cp pa_j_4.xx_7.xx.ml pa_j.ml; \
fi \
else if test `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.02.1" ; \
then cp pa_j_3.1x_6.02.1.ml pa_j.ml; \
else if test `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.02.2" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.02.3" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.03" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.04" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.05" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.06" ; \
then cp pa_j_3.1x_6.02.2.ml pa_j.ml; \
else if test `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.06" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.07" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.08" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.09" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.10" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.11" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.12" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.13" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.14" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.15" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.16" -o `camlp5 -v 2>&1 | cut -f3 -d' ' | cut -f1-3 -d'.' | cut -f1 -d'-' | cut -c1-6` = "6.17" ; \
then cp pa_j_3.1x_6.11.ml pa_j.ml; \
else cp pa_j_3.1x_`camlp5 -v 2>&1 | cut -f3 -d' ' | cut -c1`.xx.ml pa_j.ml; \
fi \
fi \
fi \
fi \
fi
if test `ocamlc -version | cut -c1-3` = "3.0" ; \
then ocamlc -c -pp "camlp4r pa_extend.cmo q_MLast.cmo" -I `camlp4 -where` pa_j.ml ; \
else if test `ocamlc -version | cut -c1-3` = "3.1" -o `ocamlc -version | cut -c1-4` = "4.00" -o `ocamlc -version | cut -c1-4` = "4.01" -o `ocamlc -version | cut -c1-4` = "4.02" -o `ocamlc -version | cut -c1-4` = "4.03" -o `ocamlc -version | cut -c1-4` = "4.04" -o `ocamlc -version | cut -c1-4` = "4.05" ; \
then ocamlc -c -pp "camlp5r pa_lexer.cmo pa_extend.cmo q_MLast.cmo" -I `camlp5 -where` pa_j.ml ; \
else ocamlc -safe-string -c -pp "camlp5r pa_lexer.cmo pa_extend.cmo q_MLast.cmo" -I `camlp5 -where` pa_j.ml ; \
fi \
fi
File "pa_j.ml", line 808, characters 23-39:
808 | value is_uppercase s = String.uppercase s = s;
^^^^^^^^^^^^^^^^
Alert deprecated: Stdlib.String.uppercase
Use String.uppercase_ascii instead.
File "pa_j.ml", line 809, characters 28-44:
809 | value is_only_lowercase s = String.lowercase s = s && not(is_uppercase s);
^^^^^^^^^^^^^^^^
Alert deprecated: Stdlib.String.lowercase
Use String.lowercase_ascii instead.
make[1]: Leaving directory '/build/hol-light-20190729'
debian/rules override_dh_auto_test
make[1]: Entering directory '/build/hol-light-20190729'
debian/test-hol-light
######################## HOL Light test Library/agm.ml ###################
OCaml version 4.11.1
File "/build/hol-light-20190729/lib.ml", line 256, characters 19-37:
256 | | (h::t) -> if Pervasives.compare x h = 0 then n else ind (n + 1) t in
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/lib.ml", line 266, characters 14-32:
266 | | (h::t) -> Pervasives.compare x h = 0 || mem x t;;
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/lib.ml", line 289, characters 19-37:
289 | (x,y)::t -> if Pervasives.compare x a = 0 then y else assoc a t
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/lib.ml", line 294, characters 19-37:
294 | (x,y)::t -> if Pervasives.compare y a = 0 then x else rev_assoc a t
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/lib.ml", line 348, characters 25-43:
348 | if Pervasives.compare x y = 0 then t' else
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/lib.ml", line 356, characters 38-56:
356 | let setify s = uniq (sort (fun x y -> Pervasives.compare x y <= 0) s);;
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/lib.ml", line 468, characters 19-37:
468 | | (x,y)::t -> if Pervasives.compare x a = 0 then y else assocd a t d;;
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/lib.ml", line 473, characters 19-37:
473 | | (x,y)::t -> if Pervasives.compare y a = 0 then x else rev_assocd a t d;;
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/lib.ml", line 510, characters 23-41:
510 | let increasing f x y = Pervasives.compare (f x) (f y) < 0;;
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/lib.ml", line 512, characters 23-41:
512 | let decreasing f x y = Pervasives.compare (f x) (f y) > 0;;
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/lib.ml", line 604, characters 26-44:
604 | (a,b)::t -> let c = Pervasives.compare x a in
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/lib.ml", line 631, characters 18-36:
631 | let c = Pervasives.compare x a in
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/lib.ml", line 672, characters 18-36:
672 | let c = Pervasives.compare x a in
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/lib.ml", line 682, characters 18-36:
682 | let c = Pervasives.compare x1 x2 in
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/lib.ml", line 56, characters 15-33:
56 | let fd = try Pervasives.open_in filename
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/lib.ml", line 60, characters 16-37:
60 | try let l = Pervasives.input_line fd in
^^^^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/lib.ml", line 64, characters 3-22:
64 | (Pervasives.close_in fd; data);;
^^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/lib.ml", line 70, characters 11-30:
70 | let fd = Pervasives.open_out filename in
^^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "lib.ml" already loaded
File "/build/hol-light-20190729/fusion.ml", line 238, characters 19-71:
238 | | Comb(s,_) -> (match type_of s with Tyapp("fun",[dty;rty]) -> rty)
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Tyapp ("fun", _::_::_::_)|Tyapp ("fun", _::[])|Tyapp ("fun", [])|
Tyapp ("", _)|Tyvar _)
File "/build/hol-light-20190729/fusion.ml", lines 235-239, characters 4-53:
235 | ....match tm with
236 | Var(_,ty) -> ty
237 | | Const(_,ty) -> ty
238 | | Comb(s,_) -> (match type_of s with Tyapp("fun",[dty;rty]) -> rty)
239 | | Abs(Var(_,ty),t) -> Tyapp("fun",[ty;type_of t])
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
Abs ((Const (_, _)|Comb (_, _)|Abs (_, _)), _)
File "/build/hol-light-20190729/fusion.ml", line 271, characters 31-49:
271 | Tyapp("fun",[ty;_]) when Pervasives.compare ty (type_of a) = 0
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/fusion.ml", line 323, characters 11-29:
323 | | _ -> Pervasives.compare tm v = 0
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/fusion.ml", lines 330-334, characters 4-65:
330 | ....match tm with
331 | Var(_,ty) -> tyvars ty
332 | | Const(_,ty) -> tyvars ty
333 | | Comb(s,t) -> union (type_vars_in_term s) (type_vars_in_term t)
334 | | Abs(Var(_,ty),t) -> union (tyvars ty) (type_vars_in_term t)
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
Abs ((Const (_, _)|Comb (_, _)|Abs (_, _)), _)
File "/build/hol-light-20190729/fusion.ml", line 367, characters 42-60:
367 | if forall (function (t,Var(_,y)) -> Pervasives.compare (type_of t) y = 0
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/fusion.ml", line 382, characters 26-44:
382 | if Pervasives.compare (rev_assocd tm' env tm) tm = 0
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/fusion.ml", line 434, characters 12-30:
434 | [] -> Pervasives.compare x1 x2
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/fusion.ml", line 435, characters 26-44:
435 | | (t1,t2)::oenv -> if Pervasives.compare x1 t1 = 0
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/fusion.ml", line 436, characters 31-49:
436 | then if Pervasives.compare x2 t2 = 0
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/fusion.ml", line 438, characters 31-49:
438 | else if Pervasives.compare x2 t2 = 0 then 1
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/fusion.ml", line 445, characters 37-55:
445 | | Const(x1,ty1),Const(x2,ty2) -> Pervasives.compare tm1 tm2
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/fusion.ml", line 449, characters 18-36:
449 | let c = Pervasives.compare ty1 ty2 in
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/fusion.ml", lines 443-456, characters 4-22:
443 | ....match (tm1,tm2) with
444 | Var(x1,ty1),Var(x2,ty2) -> ordav env tm1 tm2
445 | | Const(x1,ty1),Const(x2,ty2) -> Pervasives.compare tm1 tm2
446 | | Comb(s1,t1),Comb(s2,t2) ->
447 | let c = orda env s1 s2 in if c <> 0 then c else orda env t1 t2
...
453 | | Var(_,_),_ -> -1
454 | | _,Var(_,_) -> 1
455 | | Comb(_,_),_ -> -1
456 | | _,Comb(_,_) -> 1
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
((Abs (Var (_, _), _), Abs ((Const (_, _)|Comb (_, _)|Abs (_, _)), _))|
(Abs ((Const (_, _)|Comb (_, _)|Abs (_, _)), _), Abs (_, _)))
File "/build/hol-light-20190729/fusion.ml", line 515, characters 36-54:
515 | Tyapp("fun",[ty;_]) when Pervasives.compare ty (type_of r2) = 0
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/fusion.ml", line 533, characters 32-50:
533 | Comb(Abs(v,bod),arg) when Pervasives.compare arg v = 0
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/fusion.ml", line 542, characters 7-25:
542 | if Pervasives.compare (type_of tm) bool_ty = 0 then Sequent([tm],tm)
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/fusion.ml", line 576, characters 7-25:
576 | if Pervasives.compare (type_of tm) bool_ty = 0 then
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "fusion.ml" already loaded
File "/build/hol-light-20190729/basics.ml", line 123, characters 37-55:
123 | let theta = filter (fun (s,t) -> Pervasives.compare s t <> 0) ilist in
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/basics.ml", line 150, characters 18-24:
150 | with Failure "find" -> (cty,vty)::sofar
^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/basics.ml", lines 172-174, characters 2-29:
172 | ..let "fun",[ty;_] = dest_type (type_of tm1) in
173 | let tyins = type_match ty (type_of tm2) [] in
174 | mk_comb(inst tyins tm1,tm2)..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(("fun", _::_::_::_)|("fun", _::[])|("fun", [])|("", _))
File "basics.ml" already loaded
File "/build/hol-light-20190729/nets.ml", line 50, characters 8-26:
50 | try Pervasives.compare x y = 0 with Invalid_argument _ -> false
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/nets.ml", line 52, characters 8-26:
52 | try Pervasives.compare x y < 0 with Invalid_argument _ -> false in
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/nets.ml", line 59, characters 52-61:
59 | let set_insert x l = try sinsert x l with Failure "sinsert" -> l in
^^^^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/nets.ml", line 102, characters 8-26:
102 | try Pervasives.compare x y = 0 with Invalid_argument _ -> false
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/nets.ml", line 104, characters 8-26:
104 | try Pervasives.compare x y < 0 with Invalid_argument _ -> false in
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "nets.ml" already loaded
File "/build/hol-light-20190729/printer.ml", lines 488-493, characters 4-33:
488 | ....match cls with
489 | [c] -> print_clause c
490 | | c::cs -> (print_clause c;
491 | pp_print_break fmt 1 0;
492 | pp_print_string fmt "| ";
493 | print_clauses cs)
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
[]
File "/build/hol-light-20190729/printer.ml", lines 495-503, characters 4-30:
495 | ....match cl with
496 | [p;g;r] -> (print_term 1 p;
497 | pp_print_string fmt " when ";
498 | print_term 1 g;
499 | pp_print_string fmt " -> ";
500 | print_term 1 r)
501 | | [p;r] -> (print_term 1 p;
502 | pp_print_string fmt " -> ";
503 | print_term 1 r)
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_|_::[]|[])
File "printer.ml" already loaded
File "/build/hol-light-20190729/preterm.ml", lines 365-374, characters 4-51:
365 | ....match ptm with
366 | Combp(f,x) -> resolve_interface f (resolve_interface x cont) env
367 | | Absp(v,bod) -> resolve_interface v (resolve_interface bod cont) env
368 | | Varp(_,_) -> cont env
369 | | Constp(s,ty) ->
370 | let maps = filter (fun (s',_) -> s' = s) (!the_interface) in
371 | if maps = [] then cont env else
372 | tryfind (fun (_,(_,ty')) ->
373 | let ty' = pretype_instance ty' in
374 | cont(unify (Some ptm) env ty' ty)) maps
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
Typing (_, _)
File "/build/hol-light-20190729/preterm.ml", lines 382-392, characters 4-41:
382 | ....match ptm with
383 | Varp(s,ty) -> Varp(s,solve env ty)
384 | | Combp(f,x) -> Combp(solve_preterm env f,solve_preterm env x)
385 | | Absp(v,bod) -> Absp(solve_preterm env v,solve_preterm env bod)
386 | | Constp(s,ty) -> let tys = solve env ty in
...
389 | s = s' && can (unify None env (pretype_instance ty')) ty)
390 | (!the_interface) in
391 | pmk_cv(c',tys)
392 | with Failure _ -> Constp(s,tys)
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
Typing (_, _)
File "preterm.ml" already loaded
File "/build/hol-light-20190729/parser.ml", line 288, characters 15-60:
288 | let pdest_eq (Combp(Combp(Varp(("="|"<=>"),_),l),r)) = l,r in
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Combp (Combp (Varp ("", _), _), _)|
Combp (Combp ((Constp (_, _)|Combp (_, _)|Absp (_, _)|Typing (_, _)), _), _)|
Combp ((Varp (_, _)|Constp (_, _)|Absp (_, _)|Typing (_, _)), _)|Varp (_, _)|
Constp (_, _)|Absp (_, _)|Typing (_, _))
File "/build/hol-light-20190729/parser.ml", line 344, characters 10-65:
344 | (fun (Ident op) x y -> Combp(Combp(Varp(op,dpty),x),y))
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
Resword _
File "printer.ml" already loaded
File "/build/hol-light-20190729/equal.ml", line 250, characters 29-47:
250 | Comb(Comb(op',l),r) when Pervasives.compare op' op = 0 ->
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "equal.ml" already loaded
File "bool.ml" already loaded
File "/build/hol-light-20190729/drule.ml", line 169, characters 17-23:
169 | with Failure "find" -> n::l in
^^^^^^
Warning 52:
Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/drule.ml", line 173, characters 11-29:
173 | if Pervasives.compare y z = 0 then l else failwith "safe_insert"
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/drule.ml", line 174, characters 17-23:
174 | with Failure "find" -> n::l in
^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/drule.ml", line 184, characters 15-33:
184 | if Pervasives.compare ctm' ctm = 0 then sofar
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/drule.ml", line 186, characters 21-27:
186 | with Failure "find" ->
^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/drule.ml", line 188, characters 17-35:
188 | if Pervasives.compare ctm vtm = 0 then sofar
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/drule.ml", line 192, characters 11-29:
192 | if Pervasives.compare vname cname = 0 then
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/drule.ml", line 193, characters 13-31:
193 | if Pervasives.compare vty cty = 0 then sofar
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/drule.ml", line 206, characters 13-31:
206 | if Pervasives.compare vty cty = 0 then insts
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/drule.ml", line 233, characters 11-29:
233 | if Pervasives.compare t x' = 0 then fail() else (t,x')) realinsts,
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/drule.ml", line 240, characters 9-27:
240 | if Pervasives.compare ctm vtm = 0
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/drule.ml", line 258, characters 13-31:
258 | if Pervasives.compare cargs pats = 0 then
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/drule.ml", line 259, characters 15-33:
259 | if Pervasives.compare chop vhop = 0
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/drule.ml", line 305, characters 19-25:
305 | with Failure "find" ->
^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/drule.ml", line 310, characters 19-25:
310 | with Failure "find" ->
^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/drule.ml", line 344, characters 19-25:
344 | with Failure "find" ->
^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/drule.ml", line 349, characters 19-25:
349 | with Failure "find" ->
^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/drule.ml", line 387, characters 19-25:
387 | with Failure "find" ->
^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/drule.ml", line 392, characters 19-25:
392 | with Failure "find" ->
^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/drule.ml", line 466, characters 9-27:
466 | if Pervasives.compare tm' tm = 0 then fth else
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/drule.ml", line 484, characters 9-27:
484 | if Pervasives.compare tm' tm = 0 then fth else
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "drule.ml" already loaded
File "/build/hol-light-20190729/tactics.ml", line 134, characters 24-31:
134 | let propagate_empty i [] = []
^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
_::_
File "/build/hol-light-20190729/tactics.ml", line 135, characters 25-50:
135 | and propagate_thm th i [] = INSTANTIATE_ALL i th in
^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
_::_
File "/build/hol-light-20190729/tactics.ml", line 177, characters 31-41:
177 | fun g -> null_meta,[g],fun _ [th] -> th;;
^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", line 246, characters 10-54:
246 | fun i [th] -> PROVE_HYP (INSTANTIATE_ALL i thm) th;;
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", line 323, characters 25-50:
323 | let propagate_thm th i [] = INSTANTIATE_ALL i th in
^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
_::_
File "/build/hol-light-20190729/tactics.ml", line 345, characters 28-68:
345 | null_meta,[asl,r],fun i [th] -> EQ_MP (INSTANTIATE_ALL i th') th;;
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", lines 364-365, characters 14-69:
364 | ..............[th] -> let ath = ABS v th in
365 | EQ_MP (ALPHA (concl ath) (instantiate i w)) ath
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", line 374, characters 14-43:
374 | fun _ [th1;th2] -> MK_COMB(th1,th2)
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_|_::[]|[])
File "/build/hol-light-20190729/tactics.ml", line 423, characters 14-50:
423 | fun i [th] -> DISCH (instantiate i ant) th
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", line 428, characters 14-61:
428 | fun i [th] -> NOT_INTRO(DISCH (instantiate i ant) th)
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", line 434, characters 10-47:
434 | fun i [th] -> MP th (INSTANTIATE_ALL i thm);;
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", line 440, characters 14-52:
440 | fun _ [th1; th2] -> IMP_ANTISYM_RULE th1 th2
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_|_::[]|[])
File "/build/hol-light-20190729/tactics.ml", line 448, characters 13-50:
448 | fun i [th] -> MP th (INSTANTIATE_ALL i thm)
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", line 454, characters 14-47:
454 | fun i [th] -> SPEC (instantiate i t) th
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", line 475, characters 14-37:
475 | fun i [th] -> afn (GEN x' th)
^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", line 488, characters 16-59:
488 | fun i [th] -> CHOOSE(x',INSTANTIATE_ALL i xth) th
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", line 494, characters 10-61:
494 | fun i [th] -> EXISTS (instantiate i w,instantiate i t) th in
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", line 518, characters 39-64:
518 | null_meta,[asl,l; asl,r],fun _ [th1;th2] -> CONJ th1 th2
^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_|_::[]|[])
File "/build/hol-light-20190729/tactics.ml", line 524, characters 32-66:
524 | null_meta,[asl,l],fun i [th] -> DISJ1 th (instantiate i r)
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", line 530, characters 34-68:
530 | null_meta,[asl,r],fun i [th] -> DISJ2 (instantiate i l) th
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", line 541, characters 16-71:
541 | fun i [th1;th2] -> DISJ_CASES (INSTANTIATE_ALL i dth) th1 th2
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_|_::[]|[])
File "/build/hol-light-20190729/tactics.ml", line 545, characters 25-50:
545 | let propagate_thm th i [] = INSTANTIATE_ALL i th in
^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
_::_
File "/build/hol-light-20190729/tactics.ml", line 552, characters 25-50:
552 | let propagate_thm th i [] = INSTANTIATE_ALL i th in
^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
_::_
File "/build/hol-light-20190729/tactics.ml", line 577, characters 29-66:
577 | fun i [th] -> MP (INSTANTIATE_ALL i xth) th
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", line 707, characters 14-65:
707 | fun i [th] -> EXISTS (instantiate i w,instantiate i t) th
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", line 720, characters 10-59:
720 | fun i [th] -> PROVE_HYP (SPEC (instantiate i t) thm) th;;
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", line 849, characters 16-47:
849 | (fun inst [th] -> INSTANTIATE_ALL inst th)
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
File "/build/hol-light-20190729/tactics.ml", lines 912-913, characters 2-7:
912 | ..let (_,((asl,w)::_),_)::_ = !current_goalstack in
913 | asl,w..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(((_, (_, _, _)), [], _)::_|[])
File "/build/hol-light-20190729/tactics.ml", lines 920-921, characters 2-16:
920 | ..let (_,[],f)::_ = !current_goalstack in
921 | f null_inst []..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(((_, (_, _, _)), (_, _)::_, _)::_|[])
File "tactics.ml" already loaded
File "/build/hol-light-20190729/itab.ml", line 20, characters 8-31:
20 | fun i [] -> INSTANTIATE i th';;
^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
_::_
File "itab.ml" already loaded
File "/build/hol-light-20190729/simp.ml", lines 95-117, characters 2-50:
95 | ..match tm with
96 | Comb(Comb(Const("=",_),(Abs(x,Comb(Var(s,ty) as v,x')) as l)),v')
97 | when x' = x && v' = v && not(x = v) ->
98 | let conv tm =
99 | match tm with
...
114 | enter lconsts (l,(3,IMP_REWR_CONV th'))
115 | else if rep && matchable l r && matchable r l then
116 | enter lconsts (l,(3,ORDERED_IMP_REWR_CONV term_order th))
117 | else enter lconsts(l,(3,IMP_REWR_CONV th))..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Comb (Comb (Const ("", _), _), Comb (Comb (Const ("", _), _), _))|
Comb
(Comb (Const ("", _), _),
Comb (Comb ((Var (_, _)|Comb (_, _)|Abs (_, _)), _), _))|
Comb
(Comb (Const ("", _), _), Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _))|
Comb (Comb (Const ("", _), _), (Var (_, _)|Const (_, _)|Abs (_, _)))|
Comb
(Comb ((Var (_, _)|Comb (_, _)|Abs (_, _)), _),
Comb (Comb (Const ("", _), _), _))|
Comb
(Comb ((Var (_, _)|Comb (_, _)|Abs (_, _)), _),
Comb (Comb ((Var (_, _)|Comb (_, _)|Abs (_, _)), _), _))|
Comb
(Comb ((Var (_, _)|Comb (_, _)|Abs (_, _)), _),
Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _))|
Comb
(Comb ((Var (_, _)|Comb (_, _)|Abs (_, _)), _),
(Var (_, _)|Const (_, _)|Abs (_, _)))|
Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _)|Var (_, _)|Const (_, _)|
Abs (_, _))
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Warning: inventing type variables
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 4
File "simp.ml" already loaded
Searching with limit 0
Searching with limit 1
Searching with limit 0
Searching with limit 1
Searching with limit 0
Searching with limit 1
Searching with limit 0
Searching with limit 1
Searching with limit 0
Searching with limit 1
Searching with limit 0
Searching with limit 1
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 0
Searching with limit 1
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 0
Searching with limit 1
Searching with limit 0
Searching with limit 1
Searching with limit 0
Searching with limit 1
Searching with limit 2
Warning: inventing type variables
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 4
Warning: inventing type variables
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 4
Searching with limit 5
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 4
Searching with limit 5
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 4
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 4
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 4
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 4
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 4
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 4
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Warning: inventing type variables
Searching with limit 0
Searching with limit 1
Searching with limit 2
File "theorems.ml" already loaded
File "/build/hol-light-20190729/ind_defs.ml", lines 84-89, characters 6-22:
84 | ......let h::t = plis in
85 | let r = snd h in
86 | if mem r avs then
87 | h::(getequs(avs,filter ((<>) r o snd) t))
88 | else
89 | getequs(avs,t)...
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
[]
File "/build/hol-light-20190729/ind_defs.ml", line 262, characters 32-69:
262 | null_meta,[asl,ant],fun i [t] -> MATCH_MP (INSTANTIATE i th1) t
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_|[])
Searching with limit 0
Searching with limit 1
File "ind_defs.ml" already loaded
Searching with limit 0
Searching with limit 1
Searching with limit 0
Searching with limit 1
Searching with limit 2
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
File "class.ml" already loaded
File "trivia.ml" already loaded
File "/build/hol-light-20190729/canon.ml", line 117, characters 6-51:
117 | and [pth_not_forall; pth_not_exists; pth_not_exu] =
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8:
this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_|_::_::[]|_::[]|[])
Warning: inventing type variables
Warning: inventing type variables
File "canon.ml" already loaded
File "/build/hol-light-20190729/meson.ml", line 234, characters 30-36:
234 | with Failure "find" -> false)
^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/meson.ml", line 246, characters 23-29:
246 | with Failure "find" ->
^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/meson.ml", line 252, characters 23-29:
252 | with Failure "find" ->
^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/meson.ml", line 269, characters 23-29:
269 | with Failure "find" ->
^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/meson.ml", line 274, characters 23-29:
274 | with Failure "find" ->
^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/meson.ml", line 304, characters 17-23:
304 | with Failure "find" -> ancestors
^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/meson.ml", line 329, characters 31-37:
329 | with Failure "find" -> tm)
^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/meson.ml", lines 431-435, characters 16-76:
431 | ................let g::gs = gl in
432 | expand_goal depth (g,tup)
433 | (cacheconts(fun (g',stup) ->
434 | expand_goals depth (gs,stup)
435 | (cacheconts(fun (gs',ftup) -> cont(g'::gs',ftup)))))...
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
[]
File "meson.ml" already loaded
File "firstorder.ml" already loaded
File "/build/hol-light-20190729/metis.ml", line 88, characters 10-24:
88 | let abs = Pervasives.abs;;
^^^^^^^^^^^^^^
Alert deprecated:
module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/metis.ml", line 134, characters 10-24:
134 | let exp = Pervasives.exp;;
^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/metis.ml", line 135, characters 9-23:
135 | let ln = Pervasives.log;;
^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/metis.ml", line 136, characters 11-26:
136 | let sqrt = Pervasives.sqrt;;
^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "metis.ml" already loaded
File "thecops.ml" already loaded
0..0..1..3..7..15..26..54..86..136..solved at 208
0..0..1..solved at 4
0..0..solved at 2
0..0..1..4..solved at 10
0..0..1..4..9..solved at 21
0..0..solved at 2
0..0..1..solved at 4
0..0..1..2..6..11..22..38..70..solved at 116
0..0..solved at 2
0..0..solved at 2
0..0..1..2..6..11..22..41..76..solved at 108
0..0..1..solved at 4
0..0..solved at 2
File "quot.ml" already loaded
File "/build/hol-light-20190729/impconv.ml", line 214, characters 25-43:
214 | let cmp (x:term) y = Pervasives.compare x y
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/impconv.ml", line 215, characters 24-42:
215 | let lt (x:term) y = Pervasives.compare x y < 0
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/impconv.ml", lines 315-318, characters 8-40:
315 | ........match t with
316 | |Abs_(_,b,_) -> find_term p b
317 | |Comb_(u,v,_) -> try find_term p u with Failure _ -> find_term p v
318 | |_ -> failwith "Annot.find_term"
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Var_ (_, _)|Const_ (_, _, _))
File "/build/hol-light-20190729/impconv.ml", line 395, characters 9-27:
395 | if Pervasives.compare tm' tm = 0 then fth else
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/impconv.ml", lines 456-457, characters 18-38:
456 | ..................let ((k,nts')::res') as res = support ts in
457 | (k+1,(t::nts'))::res
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
[]
File "/build/hol-light-20190729/impconv.ml", line 1090, characters 18-34:
1090 | | Failure "SUB_CTXIMPCONV" ->
^^^^^^^^^^^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/impconv.ml", line 1118, characters 18-34:
1118 | | Failure "SUB_CTXIMPCONV" -> apply c Atomic v t
^^^^^^^^^^^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/impconv.ml", line 1598, characters 19-36:
1598 | with Failure "SUB_CTXIMPMCONV" ->
^^^^^^^^^^^^^^^^^
Warning 52: Code should not depend on the actual values of
this constructor's arguments. They are only for information
and may change in future versions. (See manual section 9.5)
File "/build/hol-light-20190729/impconv.ml", lines 1751-1752, characters 4-53:
1751 | ....let h::ps = rev_itlist f i [list_mk_exists(dom,p)] in
1752 | rev_itlist EXISTS (zip ps (rev codom)) (ASSUME h)
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
[]
File "/build/hol-light-20190729/impconv.ml", lines 1780-1786, characters 12-28:
1780 | ............let hs1,h'::hs2 = chop_list n hs in
1781 | let hs_th = CONJ_ACI_RULE (mk_eq(h,list_mk_conj (h'::(hs1@hs2)))) in
1782 | let th1 = CONV_RULE (LAND_CONV (REWR_CONV hs_th)) th' in
1783 | let th2 = UNDISCH (CONV_RULE (REWR_CONV IMP_CONJ) th1) in
1784 | let vs' = subtract vs (map snd s) in
1785 | let f v th = try LEFT_FORALL_IMP (GEN v th) with Failure _ -> th in
1786 | itlist f vs' th2.
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_, [])
File "impconv.ml" already loaded
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..1..solved at 4
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..1..2..solved at 6
Warning: inventing type variables
0..0..1..2..6..11..solved at 22
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
Warning: inventing type variables
0..0..1..5..13..solved at 26
0..0..1..5..13..solved at 26
0..0..solved at 2
Warning: inventing type variables
File "pair.ml" already loaded
File "compute.ml" already loaded
0..0..2..solved at 5
0..0..solved at 2
0..0..1..3..solved at 9
0..0..1..2..5..9..15..29..44..68..142..260..solved at 420
File "/build/hol-light-20190729/nums.ml", line 156, characters 4-39:
156 | let [NOT_SUC; num_INDUCTION; num_Axiom] =
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_|_::_::[]|_::[]|[])
0..0..solved at 3
0..0..solved at 2
File "/build/hol-light-20190729/nums.ml", line 261, characters 8-71:
261 | try itlist (fun t res -> if mem t res then fail() else t::res) l []; true
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 10: this expression should have type unit.
File "nums.ml" already loaded
File "recursion.ml" already loaded
0..0..solved at 2
0..0..1..2..solved at 6
0..0..1..2..7..14..35..62..solved at 73
0..0..solved at 2
0..0..1..2..solved at 6
0..0..1..2..7..14..35..62..solved at 73
0..0..solved at 2
0..0..2..12..solved at 18
0..0..1..5..13..27..solved at 33
0..0..1..5..11..22..49..95..171..305..solved at 319
0..0..1..4..10..20..34..56..88..130..180..238..304..378..468..574..696..850..1032..1258..1520..1834..2228..2782..3536..4510..5728..7250..8852..10582..12504..14450..16716..19194..22436..26450..31796..solved at 33408
0..0..3..13..37..solved at 48
0..0..3..solved at 8
0..0..2..8..solved at 23
0..0..solved at 2
0..0..0..1..3..5..solved at 10
0..0..1..3..solved at 7
0..0..1..2..3..7..13..21..solved at 31
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..2..6..solved at 11
0..0..2..7..19..39..74..156..solved at 223
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 0
Searching with limit 1
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 3
Searching with limit 4
Searching with limit 0
Searching with limit 1
Searching with limit 2
Searching with limit 0
Searching with limit 1
0..0..1..4..solved at 10
0..0..2..8..31..79..254..629..1685..solved at 3183
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..1..4..13..29..74..solved at 99
0..0..1..4..19..49..130..solved at 165
0..0..3..10..29..63..170..solved at 283
0..0..solved at 2
0..0..solved at 5
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 7
0..0..2..4..solved at 10
0..0..solved at 2
0..0..solved at 2
0..0..4..8..solved at 17
0..0..2..4..solved at 11
0..0..solved at 2
0..0..solved at 3
0..0..6..12..solved at 24
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..2..7..16..32..solved at 45
0..0..2..solved at 5
0..0..2..solved at 5
0..0..1..solved at 4
0..0..1..solved at 4
0..0..2..6..15..solved at 21
0..0..2..6..15..57..160..883..4135..solved at 8792
0..0..1..2..7..15..43..86..233..456..solved at 886
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..3..solved at 6
0..0..2..11..38..157..solved at 291
0..0..2..11..solved at 16
0..0..2..10..39..151..solved at 158
0..0..solved at 2
0..0..1..solved at 4
0..0..1..2..5..solved at 11
0..0..1..3..6..13..28..55..102..solved at 169
0..0..1..2..solved at 6
0..0..1..solved at 5
0..0..1..solved at 4
0..0..2..6..14..solved at 19
0..0..2..solved at 5
0..0..2..6..13..45..solved at 52
0..0..2..solved at 5
0..0..2..6..18..42..solved at 52
0..0..1..solved at 4
0..0..2..4..solved at 8
0..0..1..3..5..10..19..31..52..solved at 74
0..0..2..4..10..24..solved at 34
0..0..solved at 2
0..0..solved at 2
0..0..2..7..solved at 11
0..0..1..2..solved at 7
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..1..2..solved at 6
0..0..1..solved at 4
0..0..2..8..solved at 12
0..0..2..6..17..solved at 25
0..0..2..solved at 5
0..0..2..solved at 6
0..0..2..5..11..22..40..solved at 53
0..0..1..solved at 4
0..0..3..6..14..32..57..102..188..solved at 204
0..0..3..6..22..41..72..122..175..248..386..solved at 407
0..0..1..2..6..11..19..32..45..60..solved at 73
0..0..1..2..6..11..19..32..45..60..solved at 73
0..0..1..3..6..15..34..67..132..266..solved at 510
0..0..1..3..6..13..29..59..110..solved at 162
0..0..1..3..6..15..34..68..130..solved at 182
0..0..1..3..6..15..34..67..132..266..solved at 510
0..0..1..solved at 4
0..0..2..solved at 6
0..0..3..10..solved at 15
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 2
0..0..2..solved at 7
0..0..2..5..solved at 17
0..0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..0..1..solved at 9
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 5
0..0..1..5..16..32..solved at 40
0..0..1..5..18..37..solved at 48
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 2
0..0..2..solved at 7
0..0..2..5..solved at 17
0..0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..0..1..solved at 9
0..0..solved at 2
0..0..solved at 2
0..0..2..5..14..66..287..1310..solved at 1325
0..0..solved at 3
0..0..2..5..16..72..302..solved at 311
0..0..1..2..3..7..12..17..23..29..35..solved at 84
0..0..1..2..solved at 6
0..0..solved at 2
0..0..2..4..7..solved at 21
0..0..2..4..solved at 10
0..0..0..0..1..solved at 7
0..0..solved at 2
0..0..solved at 2
0..0..0..0..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..1..2..solved at 6
0..0..solved at 2
0..0..1..2..solved at 6
0..0..solved at 2
0..0..solved at 2
0..0..1..2..5..10..19..32..55..112..263..solved at 489
0..0..0..1..2..3..solved at 8
0..0..0..1..2..3..7..14..22..33..57..84..141..221..305..441..638..849..solved at 1042
0..0..0..1..2..3..4..5..6..11..16..21..40..59..78..103..128..153..192..231..270..358..446..534..650..766..882..1036..1190..1344..solved at 3172
File "arith.ml" already loaded
0..0..solved at 2
0..0..solved at 2
0..0..0..0..2..5..8..25..57..89..solved at 97
0..0..0..1..5..10..solved at 15
0..0..0..0..2..5..8..25..57..89..solved at 97
0..0..solved at 2
0..0..2..10..25..solved at 35
0..0..0..1..4..7..solved at 12
0..0..solved at 2
0..0..0..3..6..9..solved at 16
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..3..solved at 7
0..0..solved at 2
0..0..0..solved at 3
0..0..solved at 3
0..0..2..4..8..solved at 13
0..0..solved at 3
0..0..2..4..8..solved at 13
0..0..solved at 3
0..0..solved at 2
0..0..2..10..25..solved at 35
0..0..solved at 2
0..0..1..3..11..solved at 20
0..0..1..2..4..12..24..45..78..125..solved at 140
0..0..0..2..7..solved at 12
0..0..1..3..13..29..63..128..226..388..642..977..1459..2097..3319..solved at 3649
0..0..solved at 2
0..0..solved at 2
0..0..0..solved at 3
0..0..solved at 2
0..0..1..4..15..41..98..211..420..solved at 656
0..0..1..2..5..9..17..33..55..97..162..262..411..solved at 543
0..0..1..6..23..68..172..410..880..solved at 911
0..0..0..1..4..7..solved at 16
0..0..2..8..24..54..solved at 69
0..0..1..solved at 6
0..0..0..solved at 4
0..0..0..solved at 3
Warning: inventing type variables
Warning: inventing type variables
0..0..2..8..solved at 12
0..0..2..8..solved at 13
0..0..solved at 2
0..0..0..solved at 3
0..0..0..solved at 5
0..0..0..0..solved at 4
0..0..solved at 2
0..0..3..7..20..54..150..solved at 180
0..0..solved at 2
0..0..2..6..solved at 13
0..0..1..3..solved at 7
0..0..1..3..solved at 8
0..0..2..6..solved at 14
0..0..1..3..solved at 8
0..0..2..4..solved at 11
0..0..5..12..39..solved at 71
0..0..4..10..30..solved at 55
0..0..5..13..38..solved at 66
0..0..4..10..31..solved at 57
0..0..3..6..19..35..60..118..solved at 270
Warning: inventing type variables
0..0..solved at 2
0..0..1..2..solved at 6
0..0..1..5..15..51..120..259..solved at 434
0..0..1..5..15..51..120..259..solved at 394
0..0..1..4..13..31..solved at 37
0..0..1..2..solved at 6
0..0..1..5..15..51..120..259..solved at 394
0..0..1..5..15..51..120..259..solved at 434
0..0..1..4..12..28..58..118..solved at 128
0..0..2..9..28..85..206..492..solved at 618
0..0..2..9..28..94..222..491..1165..solved at 1499
0..0..2..9..28..94..223..491..1149..solved at 1472
0..0..2..10..28..82..204..solved at 236
0..0..1..4..11..43..116..246..648..1354..solved at 1611
0..0..solved at 2
0..0..1..5..15..51..120..259..solved at 434
0..0..1..5..15..51..120..259..solved at 394
0..0..1..4..13..31..solved at 37
0..0..2..7..24..55..104..223..440..827..1504..solved at 1616
0..0..2..7..24..65..133..290..574..solved at 904
0..0..2..7..24..65..134..294..583..solved at 913
0..0..2..8..25..52..110..solved at 145
0..0..1..2..7..13..26..50..83..132..216..308..447..705..1020..1530..2268..3184..4455..6310..solved at 8365
0..0..1..3..9..17..43..86..154..300..472..714..1138..1664..2466..4129..6181..solved at 6305
0..0..2..7..20..49..89..185..solved at 215
0..0..1..2..7..17..34..70..132..223..396..solved at 427
0..0..1..2..6..12..23..46..74..119..197..285..418..630..886..solved at 1210
0..0..2..8..24..solved at 32
0..0..2..7..24..61..134..280..548..1144..solved at 1169
0..0..3..solved at 7
Warning: inventing type variables
0..0..1..solved at 4
0..0..1..solved at 4
Warning: inventing type variables
0..0..0..solved at 3
0..0..solved at 2
File "wf.ml" already loaded
File "/build/hol-light-20190729/calc_num.ml", line 209, characters 6-58:
209 | let Comb(NUMERAL_tm,Comb(BIT0_tm,Comb(BIT1_tm,zero_tm))) =
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Comb (_, Comb (_, (Var (_, _)|Const (_, _)|Abs (_, _))))|
Comb (_, (Var (_, _)|Const (_, _)|Abs (_, _)))|Var (_, _)|Const (_, _)|
Abs (_, _))
File "/build/hol-light-20190729/calc_num.ml", lines 246-249, characters 4-28:
246 | ....match tm with
247 | Comb(Const("BIT1",_),t) -> num_2 */ dest_raw_numeral t +/ num_1
248 | | Comb(Const("BIT0",_),t) -> num_2 */ dest_raw_numeral t
249 | | Const("_0",_) -> num_0...
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Comb (Const ("", _), _)|Comb ((Var (_, _)|Comb (_, _)|Abs (_, _)), _)|
Const ("", _)|Var (_, _)|Abs (_, _))
File "/build/hol-light-20190729/calc_num.ml", lines 267-279, characters 6-51:
267 | ......match (mtm,ntm) with
268 | Const("_0",_),Const("_0",_) -> 0
269 | | Const("_0",_),_ ->
270 | if wellformed ntm then -1 else failwith "orderrelation"
271 | | _, Const("_0",_) ->
...
276 | | Comb(Const("BIT0",_),mt),Comb(Const("BIT1",_),nt) ->
277 | if orderrelation mt nt > 0 then 1 else -1
278 | | Comb(Const("BIT1",_),mt),Comb(Const("BIT0",_),nt) ->
279 | if orderrelation mt nt < 0 then -1 else 1...
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
((Comb (Const ("BIT1", _), _), Const ("", _))|
(Comb (Const ("BIT1", _), _), Comb (Const ("", _), _))|
(Comb (Const ("BIT1", _), _), Comb ((Var (_, _)|Comb (_, _)|Abs (_, _)), _))|
(Comb (Const ("BIT1", _), _), (Var (_, _)|Abs (_, _)))|
(Comb (Const ("BIT0", _), _), Const ("", _))|
(Comb (Const ("BIT0", _), _), Comb (Const ("", _), _))|
(Comb (Const ("BIT0", _), _), Comb ((Var (_, _)|Comb (_, _)|Abs (_, _)), _))|
(Comb (Const ("BIT0", _), _), (Var (_, _)|Abs (_, _)))|
(Comb (Const ("", _), _), Const ("", _))|
(Comb (Const ("", _), _), (Var (_, _)|Comb (_, _)|Abs (_, _)))|
(Comb ((Var (_, _)|Comb (_, _)|Abs (_, _)), _), Const ("", _))|
(Comb ((Var (_, _)|Comb (_, _)|Abs (_, _)), _),
(Var (_, _)|Comb (_, _)|Abs (_, _)))|(Const ("", _), Const ("", _))|
(Const ("", _), (Var (_, _)|Comb (_, _)|Abs (_, _)))|
((Var (_, _)|Abs (_, _)), Const ("", _))|
((Var (_, _)|Abs (_, _)), (Var (_, _)|Comb (_, _)|Abs (_, _))))
File "/build/hol-light-20190729/calc_num.ml", lines 386-388, characters 13-28:
386 | .............(match concl th2 with Comb(_,ptm) ->
387 | let th3 = INST [m_hi,m_tm; n_hi,n_tm;ptm,p_tm] th1 in
388 | EQ_MP th3 th2)
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Var (_, _)|Const (_, _)|Abs (_, _))
File "/build/hol-light-20190729/calc_num.ml", lines 390-392, characters 13-28:
390 | .............(match concl th2 with Comb(_,ptm) ->
391 | let th3 = INST [m_hi,m_tm; n_hi,n_tm;ptm,p_tm] th1 in
392 | EQ_MP th3 th2)
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Var (_, _)|Const (_, _)|Abs (_, _))
File "/build/hol-light-20190729/calc_num.ml", lines 382-392, characters 6-28:
382 | ......match fl with
383 | 0 -> INST [m_hi,m_tm] th1
384 | | 1 -> INST [n_hi,n_tm] th1
385 | | 2 -> let th2 = NUM_ADD_RULE m_hi n_hi in
386 | (match concl th2 with Comb(_,ptm) ->
...
389 | | 3 -> let th2 = NUM_ADC_RULE m_hi n_hi in
390 | (match concl th2 with Comb(_,ptm) ->
391 | let th3 = INST [m_hi,m_tm; n_hi,n_tm;ptm,p_tm] th1 in
392 | EQ_MP th3 th2)
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
4
File "/build/hol-light-20190729/calc_num.ml", lines 405-407, characters 13-28:
405 | .............(match concl th2 with Comb(_,ptm) ->
406 | let th3 = INST [m_hi,m_tm; n_hi,n_tm;ptm,p_tm] th1 in
407 | EQ_MP th3 th2)
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Var (_, _)|Const (_, _)|Abs (_, _))
File "/build/hol-light-20190729/calc_num.ml", lines 409-411, characters 13-28:
409 | .............(match concl th2 with Comb(_,ptm) ->
410 | let th3 = INST [m_hi,m_tm; n_hi,n_tm;ptm,p_tm] th1 in
411 | EQ_MP th3 th2)...
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Var (_, _)|Const (_, _)|Abs (_, _))
File "/build/hol-light-20190729/calc_num.ml", lines 401-411, characters 6-28:
401 | ......match fl with
402 | 0 -> INST [m_hi,m_tm] th1
403 | | 1 -> INST [n_hi,n_tm] th1
404 | | 2 -> let th2 = NUM_ADD_RULE m_hi n_hi in
405 | (match concl th2 with Comb(_,ptm) ->
...
408 | | 3 -> let th2 = NUM_ADC_RULE m_hi n_hi in
409 | (match concl th2 with Comb(_,ptm) ->
410 | let th3 = INST [m_hi,m_tm; n_hi,n_tm;ptm,p_tm] th1 in
411 | EQ_MP th3 th2)...
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
4
File "/build/hol-light-20190729/calc_num.ml", lines 560-568, characters 10-32:
560 | ..........(match concl th1 with
561 | Comb(_,Comb(Comb(_,Const("_0",_)),Comb(Comb(_,ptm),btm))) ->
562 | let th2 = Array.get pths_0 i in
563 | let th3 = INST [ntm,n_tm; btm,b_tm; ptm,p_tm] th2 in
564 | EQ_MP th3 th1
565 | | Comb(_,Comb(Comb(_,atm),Comb(Comb(_,ptm),btm))) ->
566 | let th2 = Array.get pths_1 i in
567 | let th3 = INST[ntm,n_tm; atm,a_tm; btm,b_tm; ptm,p_tm] th2 in
568 | EQ_MP th3 th1)
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Comb (_, Comb (Comb (_, _), Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _)))|
Comb (_, Comb (Comb (_, _), (Var (_, _)|Const (_, _)|Abs (_, _))))|
Comb (_, Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _))|
Comb (_, (Var (_, _)|Const (_, _)|Abs (_, _)))|Var (_, _)|Const (_, _)|
Abs (_, _))
File "/build/hol-light-20190729/calc_num.ml", lines 571-576, characters 12-75:
571 | ............(match concl th1 with
572 | Comb(_,Comb(Comb(_,Const("_0",_)),Comb(Comb(_,ptm),btm))) ->
573 | EQ_MP (INST [ntm,n_tm; btm,b_tm; ptm,p_tm] pth_z) th1
574 | | Comb(_,Comb(Comb(_,atm),Comb(Comb(_,ptm),btm))) ->
575 | EQ_MP
576 | (INST[ntm,n_tm; atm,a_tm; btm,b_tm; ptm,p_tm] pth_0) th1)
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Comb (_, Comb (Comb (_, _), Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _)))|
Comb (_, Comb (Comb (_, _), (Var (_, _)|Const (_, _)|Abs (_, _))))|
Comb (_, Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _))|
Comb (_, (Var (_, _)|Const (_, _)|Abs (_, _)))|Var (_, _)|Const (_, _)|
Abs (_, _))
File "/build/hol-light-20190729/calc_num.ml", lines 579-582, characters 12-76:
579 | ............(match concl th1 with
580 | Comb(_,Comb(Comb(_,atm),Comb(Comb(_,ptm),btm))) ->
581 | EQ_MP
582 | (INST [ntm,n_tm; atm,a_tm; btm,b_tm; ptm,p_tm] pth_1) th1)
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Comb (_, Comb (Comb (_, _), Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _)))|
Comb (_, Comb (Comb (_, _), (Var (_, _)|Const (_, _)|Abs (_, _))))|
Comb (_, Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _))|
Comb (_, (Var (_, _)|Const (_, _)|Abs (_, _)))|Var (_, _)|Const (_, _)|
Abs (_, _))
File "/build/hol-light-20190729/calc_num.ml", lines 585-588, characters 12-27:
585 | ............(match concl th1 with
586 | Comb(_,Comb(Comb(_,atm),Comb(Comb(_,ptm),btm))) ->
587 | EQ_MP (INST [atm,a_tm; btm,b_tm; ptm,p_tm] pth_triv)
588 | th1)
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Comb (_, Comb (Comb (_, _), Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _)))|
Comb (_, Comb (Comb (_, _), (Var (_, _)|Const (_, _)|Abs (_, _))))|
Comb (_, Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _))|
Comb (_, (Var (_, _)|Const (_, _)|Abs (_, _)))|Var (_, _)|Const (_, _)|
Abs (_, _))
File "/build/hol-light-20190729/calc_num.ml", lines 686-687, characters 16-48:
686 | ................let Comb(_,Comb(Comb(_,mtm),ntm)) = concl th1 in
687 | TRANS th1 (NUM_ADD_RULE mtm ntm)
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Comb (_, Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _))|
Comb (_, (Var (_, _)|Const (_, _)|Abs (_, _)))|Var (_, _)|Const (_, _)|
Abs (_, _))
File "/build/hol-light-20190729/calc_num.ml", lines 913-916, characters 20-58:
913 | ....................(match concl th2 with
914 | Comb(_,Comb(_,Comb(_,Comb(Comb(_,ptm),qtm)))) ->
915 | let th3 = NUM_ADD_RULE ptm qtm in
916 | TRANS th2 (AP_BIT1 (AP_BIT0 th3)))
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Comb (_, Comb (_, Comb (_, Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _))))|
Comb (_, Comb (_, Comb (_, (Var (_, _)|Const (_, _)|Abs (_, _)))))|
Comb (_, Comb (_, (Var (_, _)|Const (_, _)|Abs (_, _))))|
Comb (_, (Var (_, _)|Const (_, _)|Abs (_, _)))|Var (_, _)|Const (_, _)|
Abs (_, _))
File "/build/hol-light-20190729/calc_num.ml", lines 920-940, characters 14-56:
920 | ..............let Comb(Comb(_,ltm),Comb(Comb(_,ptm),htm)) = rand(concl th1) in
921 | let th2 = NUM_ADD_RULE htm ltm in
922 | let mtm = rand(concl th2) in
923 | let th3 = NUM_SQUARE_RULE htm
924 | and th4 = NUM_SQUARE_RULE ltm
...
937 | let th9 = QUICK_PROVE_HYP (end_itlist CONJ
938 | [th1;th2;th3;th4;th5;th6;th7]) th8 in
939 | CONV_RULE(RAND_CONV(RAND_CONV(RAND_CONV NUM_UNSHIFT_CONV) THENC
940 | NUM_UNSHIFT_CONV)) th9
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Comb (Comb (_, _), Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _))|
Comb (Comb (_, _), (Var (_, _)|Const (_, _)|Abs (_, _)))|
Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _)|Var (_, _)|Const (_, _)|
Abs (_, _))
File "/build/hol-light-20190729/calc_num.ml", lines 964-968, characters 14-60:
964 | ..............let [tm3;tm4;tm5] = conjuncts(rand(rand(lhand(concl th')))) in
965 | let th3 = NUM_SQUARE_RULE (lhand(lhand tm3))
966 | and th4 = NUM_SQUARE_RULE (lhand(lhand tm4))
967 | and th5 = NUM_SQUARE_RULE (lhand(lhand tm5)) in
968 | MP th' (end_itlist CONJ [th1;th2;th3;th4;th5])
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_|_::_::[]|_::[]|[])
File "/build/hol-light-20190729/calc_num.ml", lines 945-968, characters 14-60:
945 | ..............let Comb(Comb(_,ltm),Comb(Comb(_,ptm),
946 | Comb(Comb(_,mtm),Comb(Comb(_,_),htm)))) = rand(concl th0) in
947 | let th1 = NUM_SQUARE_RULE htm
948 | and th2 = NUM_SQUARE_RULE ltm in
949 | let atm = rand(concl th2) and etm = rand(concl th1) in
...
965 | let th3 = NUM_SQUARE_RULE (lhand(lhand tm3))
966 | and th4 = NUM_SQUARE_RULE (lhand(lhand tm4))
967 | and th5 = NUM_SQUARE_RULE (lhand(lhand tm5)) in
968 | MP th' (end_itlist CONJ [th1;th2;th3;th4;th5])
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Comb
(Comb (_, _),
Comb
(Comb (_, _),
Comb (Comb (_, _), Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _))))|
Comb
(Comb (_, _),
Comb
(Comb (_, _), Comb (Comb (_, _), (Var (_, _)|Const (_, _)|Abs (_, _)))))|
Comb
(Comb (_, _),
Comb (Comb (_, _), Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _)))|
Comb (Comb (_, _), Comb (Comb (_, _), (Var (_, _)|Const (_, _)|Abs (_, _))))|
Comb (Comb (_, _), Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _))|
Comb (Comb (_, _), (Var (_, _)|Const (_, _)|Abs (_, _)))|
Comb ((Var (_, _)|Const (_, _)|Abs (_, _)), _)|Var (_, _)|Const (_, _)|
Abs (_, _))
File "/build/hol-light-20190729/calc_num.ml", lines 882-968, characters 6-60:
882 | ......match tm with
883 | Const("_0",_) -> pth_0
884 | | Comb(Const("BIT0",_),mtm) ->
885 | (match mtm with
886 | Comb(Const("BIT0",_),Comb(Const("BIT0",_),ptm)) ->
...
965 | let th3 = NUM_SQUARE_RULE (lhand(lhand tm3))
966 | and th4 = NUM_SQUARE_RULE (lhand(lhand tm4))
967 | and th5 = NUM_SQUARE_RULE (lhand(lhand tm5)) in
968 | MP th' (end_itlist CONJ [th1;th2;th3;th4;th5])
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(Const ("", _)|Comb (Const ("", _), _)|
Comb ((Var (_, _)|Comb (_, _)|Abs (_, _)), _)|Var (_, _)|Abs (_, _))
File "/build/hol-light-20190729/calc_num.ml", line 1117, characters 15-33:
1117 | if Pervasives.compare mtm ntm = 0 then
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
File "/build/hol-light-20190729/calc_num.ml", line 1159, characters 15-33:
1159 | if Pervasives.compare mtm ntm = 0 then
^^^^^^^^^^^^^^^^^^
Alert deprecated: module Stdlib.Pervasives
Use Stdlib instead.
If you need to stay compatible with OCaml < 4.07, you can use the
stdlib-shims library: https://github.com/ocaml/stdlib-shims
0..0..1..2..8..18..solved at 48
0..0..1..2..8..18..solved at 55
0..0..1..2..10..24..118..279..1321..3190..solved at 4661
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..1..2..6..12..28..51..solved at 84
0..0..1..2..6..12..28..57..solved at 90
0..0..1..solved at 4
0..0..1..2..solved at 6
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..1..2..solved at 6
0..0..1..2..8..18..68..147..solved at 443
0..0..1..2..8..18..67..146..solved at 427
0..0..1..2..8..18..solved at 55
0..0..1..2..8..18..solved at 48
0..0..1..2..7..14..solved at 23
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..solved at 2
0..0..1..3..12..31..100..solved at 139
0..0..1..2..solved at 8
0..0..1..2..6..13..29..solved at 39
0..0..1..2..6..12..28..51..solved at 80
0..0..1..2..6..13..29..solved at 39
0..0..1..2..6..12..28..51..solved at 80
0..0..1..2..7..15..35..77..161..solved at 177
0..0..1..2..6..12..28..51..104..192..solved at 349
0..0..1..solved at 4
0..0..1..2..3..solved at 8
0..0..solved at 2
0..0..1..2..3..solved at 8
0..0..1..solved at 4
0..0..2..solved at 5
0..0..2..solved at 6
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..1..solved at 4
0..0..1..solved at 5
0..0..solved at 2
0..0..1..solved at 4
File "calc_num.ml" already loaded
File "/build/hol-light-20190729/normalizer.ml", lines 95-535, characters 4-59:
95 | ....let
96 | [pthm_01; pthm_02; pthm_03; pthm_04; pthm_05; pthm_06; pthm_07; pthm_08;
97 | pthm_09; pthm_10; pthm_11; pthm_12; pthm_13; pthm_14; pthm_15; pthm_16;
98 | pthm_17; pthm_18; pthm_19; pthm_20; pthm_21; pthm_22; pthm_23; pthm_24;
99 | pthm_25; pthm_26; pthm_27; pthm_28; pthm_29; pthm_30; pthm_31; pthm_32;
...
532 | TRANS th1 (fn (rand(concl th1)))
533 | else REFL tm in
534 | POLYNOMIAL_NEG_CONV,POLYNOMIAL_ADD_CONV,POLYNOMIAL_SUB_CONV,
535 | POLYNOMIAL_MUL_CONV,POLYNOMIAL_POW_CONV,POLYNOMIAL_CONV..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::
_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::
_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::
_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::
_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::
_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::
_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::
_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::
_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::
_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::
_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::
_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::
_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::[]|_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::[]|_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::[]|_::_::_::_::_::_::_::[]|_::_::_::_::_::_::[]|
_::_::_::_::_::[]|_::_::_::_::[]|_::_::_::[]|_::_::[]|_::[]|[])
0..0..solved at 2
0..0..1..2..solved at 9
0..0..1..2..9..20..73..154..solved at 284
0..0..1..2..solved at 8
0..0..solved at 2
0..0..1..2..solved at 8
0..0..1..2..9..20..73..154..solved at 229
0..0..1..2..8..18..65..140..472..992..solved at 2047
0..0..0..1..2..3..4..5..6..solved at 20
0..0..1..2..solved at 6
0..0..solved at 2
0..0..solved at 2
File "normalizer.ml" already loaded
File "/build/hol-light-20190729/grobner.ml", lines 521-527, characters 10-25:
521 | ..........let vars,pol::pols =
522 | grobify_equations(list_mk_conj(rand(concl nth)::map concl eths)) in
523 | let deg,l,cert = grobner_strong vars pols pol in
524 | let th1 =
525 | CONV_RULE(RAND_CONV(BINOP_CONV RING_NORMALIZE_CONV)) nth in
526 | let th2 = funpow deg (IDOM_RULE o CONJ th1) NOT_EQ_01 in
527 | vars,l,cert,th2...
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_, [])
0..0..2..4..10..20..52..96..204..356..638..1042..1916..3036..solved at 4498
0..0..1..2..7..16..42..78..161..285..685..solved at 954
0..0..1..2..7..16..42..78..160..281..solved at 672
0..0..2..4..11..21..59..116..239..426..800..1336..solved at 1840
0..0..1..2..7..16..45..86..174..312..724..solved at 772
0..0..1..2..7..16..44..84..168..solved at 185
0..0..2..4..11..21..59..116..239..426..solved at 540
0..0..1..2..7..18..46..solved at 77
0..0..1..2..7..18..47..92..185..solved at 281
0..0..2..4..12..22..solved at 41
0..0..1..2..7..solved at 21
0..0..1..2..7..solved at 18
File "grobner.ml" already loaded
Searching with limit 0
Searching with limit 1
Searching with limit 2
File "/build/hol-light-20190729/ind_types.ml", lines 796-801, characters 8-69:
796 | ........let _,[ty1;ty2] = dest_type ty in
797 | let inls1 = mk_inls ty1
798 | and inls2 = mk_inls ty2 in
799 | let inl = mk_const("INL",[ty1,aty; ty2,bty])
800 | and inr = mk_const("INR",[ty1,aty; ty2,bty]) in
801 | map (curry mk_comb inl) inls1 @ map (curry mk_comb inr) inls2...
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
((_, _::_::_::_)|(_, _::[])|(_, []))
File "/build/hol-light-20190729/ind_types.ml", lines 807-810, characters 8-73:
807 | ........let _,[ty1;ty2] = dest_type ty in
808 | let outl = mk_const("OUTL",[ty1,aty; ty2,bty])
809 | and outr = mk_const("OUTR",[ty1,aty; ty2,bty]) in
810 | mk_inls (mk_comb(outl,sof)) ty1 @ mk_inls (mk_comb(outr,sof)) ty2...
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
((_, _::_::_::_)|(_, _::[])|(_, []))
0..0..1..2..6..13..30..solved at 70
0..0..1..2..6..13..30..solved at 70
Warning: inventing type variables
0..0..solved at 2
0..0..1..2..solved at 6
0..0..1..2..6..11..solved at 22
0..0..solved at 2
0..0..solved at 2
0..0..1..2..solved at 6
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..solved at 5
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..1..solved at 4
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..1..solved at 4
0..0..solved at 2
Warning: inventing type variables
0..0..1..solved at 4
0..0..solved at 2
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..solved at 2
0..0..solved at 2
File "ind_types.ml" already loaded
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..1..2..5..10..19..32..55..112..263..solved at 489
Warning: inventing type variables
0..0..0..0..solved at 4
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..1..2..6..12..solved at 26
Warning: inventing type variables
0..0..2..4..solved at 9
0..0..2..4..solved at 9
0..0..solved at 3
0..0..solved at 3
0..0..1..2..solved at 7
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 2
0..0..2..solved at 6
0..0..1..solved at 4
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
0..0..3..6..solved at 10
0..0..3..6..solved at 13
0..0..solved at 2
0..0..3..6..solved at 10
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..1..solved at 5
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
0..0..3..solved at 7
0..0..3..solved at 7
0..0..solved at 2
0..0..solved at 4
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 5
0..0..solved at 3
0..0..solved at 4
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 4
0..0..solved at 2
0..0..solved at 3
Warning: inventing type variables
Warning: inventing type variables
0..0..0..solved at 4
0..0..0..solved at 3
0..0..solved at 2
0..0..1..solved at 6
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..0..solved at 4
0..0..0..solved at 3
0..0..solved at 3
0..0..3..solved at 9
0..0..1..solved at 7
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
0..0..2..4..10..20..40..solved at 67
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
0..0..1..solved at 4
0..0..1..2..solved at 6
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..3..solved at 6
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..1..solved at 4
0..0..solved at 3
0..0..solved at 3
Warning: inventing type variables
0..0..1..2..solved at 7
0..0..1..5..9..19..44..73..solved at 80
0..0..1..solved at 4
0..0..1..2..3..solved at 8
Warning: inventing type variables
0..0..1..2..3..7..solved at 17
0..0..1..2..solved at 6
0..0..1..2..3..5..7..9..13..solved at 22
0..0..1..2..3..5..7..9..13..solved at 22
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..1..2..6..12..27..solved at 44
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..2..solved at 6
0..0..1..solved at 4
0..0..2..solved at 6
0..0..1..solved at 4
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..1..2..5..9..15..22..29..36..solved at 56
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
Warning: inventing type variables
0..0..2..6..17..43..98..solved at 116
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..3..8..16..solved at 33
0..0..3..8..16..solved at 35
0..0..solved at 2
0..0..3..8..16..solved at 35
0..0..solved at 5
0..0..solved at 5
0..0..solved at 2
0..0..4..10..22..75..155..solved at 209
0..0..solved at 3
0..0..1..solved at 5
0..0..1..solved at 5
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..2..3..solved at 8
0..0..1..solved at 4
0..0..1..3..solved at 9
0..0..1..3..6..22..49..93..169..273..405..601..837..1131..1577..2127..solved at 2538
0..0..solved at 3
0..0..solved at 3
0..0..2..4..6..solved at 25
0..0..2..4..6..solved at 18
0..0..1..2..3..14..solved at 25
0..0..solved at 2
0..0..1..2..solved at 6
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..2..solved at 5
0..0..2..solved at 5
0..0..solved at 2
File "lists.ml" already loaded
File "/build/hol-light-20190729/realax.ml", line 149, characters 6-47:
149 | and [DIST_TRIANGLE; DIST_ADD2; DIST_ADD2_REV] = (CONJUNCTS o prove)
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_|_::_::[]|_::[]|[])
Searching with limit 0
Searching with limit 1
Searching with limit 2
0..0..1..2..3..10..solved at 16
0..0..1..3..6..12..solved at 21
0..0..1..3..6..16..solved at 33
0..0..1..4..10..23..48..94..solved at 172
0..0..1..4..8..solved at 13
0..0..solved at 2
0..0..1..2..solved at 6
0..0..1..2..3..solved at 8
0..0..1..2..5..19..42..solved at 59
0..0..1..3..6..16..37..70..121..205..325..solved at 432
0..0..1..2..solved at 6
Searching with limit 0
Searching with limit 1
Searching with limit 2
0..0..1..4..8..solved at 17
0..0..1..4..solved at 10
0..0..3..6..solved at 10
0..0..3..8..15..solved at 20
0..0..3..12..23..40..63..solved at 72
0..0..3..6..18..34..61..94..145..206..solved at 249
0..0..3..14..36..111..307..901..solved at 935
File "/build/hol-light-20190729/realax.ml", lines 1297-1301, characters 4-68:
1297 | ....[HREAL_OF_NUM_EQ; HREAL_OF_NUM_LE; HREAL_OF_NUM_ADD; HREAL_OF_NUM_MUL;
1298 | HREAL_LE_REFL; HREAL_LE_TRANS; HREAL_LE_ANTISYM; HREAL_LE_TOTAL;
1299 | HREAL_LE_ADD; HREAL_LE_EXISTS; HREAL_ARCH; HREAL_ADD_SYM; HREAL_ADD_ASSOC;
1300 | HREAL_ADD_LID; HREAL_ADD_LCANCEL; HREAL_MUL_SYM; HREAL_MUL_ASSOC;
1301 | HREAL_MUL_LID; HREAL_ADD_LDISTRIB; HREAL_MUL_LINV; HREAL_INV_0]..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::[]|_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::[]|_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::[]|_::_::_::_::_::_::_::[]|_::_::_::_::_::_::[]|
_::_::_::_::_::[]|_::_::_::_::[]|_::_::_::[]|_::_::[]|_::[]|[])
File "/build/hol-light-20190729/realax.ml", lines 1737-1743, characters 4-70:
1737 | ....[REAL_ADD_SYM; REAL_ADD_ASSOC; REAL_ADD_LID; REAL_ADD_LINV;
1738 | REAL_MUL_SYM; REAL_MUL_ASSOC; REAL_MUL_LID;
1739 | REAL_ADD_LDISTRIB;
1740 | REAL_LE_REFL; REAL_LE_ANTISYM; REAL_LE_TRANS; REAL_LE_TOTAL;
1741 | REAL_LE_LADD_IMP; REAL_LE_MUL;
1742 | REAL_INV_0; REAL_MUL_LINV;
1743 | REAL_OF_NUM_EQ; REAL_OF_NUM_LE; REAL_OF_NUM_ADD; REAL_OF_NUM_MUL]..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::_::_::[]|_::_::_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::_::_::[]|_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::[]|_::_::_::_::_::_::_::[]|_::_::_::_::_::_::[]|
_::_::_::_::_::[]|_::_::_::_::[]|_::_::_::[]|_::_::[]|_::[]|[])
File "realax.ml" already loaded
0..0..solved at 2
0..0..1..2..solved at 6
0..0..1..2..7..14..35..62..solved at 73
0..0..1..2..solved at 6
0..0..1..3..8..19..44..solved at 81
0..0..solved at 2
0..0..1..3..9..25..64..166..437..1159..3190..solved at 4411
0..0..1..2..solved at 6
0..0..1..3..8..19..44..112..275..694..solved at 932
0..0..1..3..8..19..40..85..174..348..696..1556..3482..solved at 6840
0..0..1..2..6..12..28..solved at 55
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..1..2..6..11..19..36..53..76..121..solved at 164
0..0..3..solved at 9
File "/build/hol-light-20190729/calc_int.ml", lines 234-246, characters 2-52:
234 | ..let [pth_eq1a; pth_eq1b; pth_eq2a; pth_eq2b] = (CONJUNCTS o prove)
235 | (`((&m = &n) <=> (m = n)) /\
236 | ((--(&m) = --(&n)) <=> (m = n)) /\
237 | ((--(&m) = &n) <=> (m = 0) /\ (n = 0)) /\
238 | ((&m = --(&n)) <=> (m = 0) /\ (n = 0))`,
...
243 | [GEN_REWRITE_CONV I [pth_eq1a; pth_eq1b] THENC NUM_EQ_CONV;
244 | GEN_REWRITE_CONV I [pth_eq2a; pth_eq2b] THENC NUM2_EQ_CONV] in
245 | REAL_INT_LE_CONV,REAL_INT_LT_CONV,
246 | REAL_INT_GE_CONV,REAL_INT_GT_CONV,REAL_INT_EQ_CONV..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_::_|_::_::_::[]|_::_::[]|_::[]|[])
File "/build/hol-light-20190729/calc_int.ml", lines 223-246, characters 2-52:
223 | ..let [pth_gt1; pth_gt2a; pth_gt2b; pth_gt3] = (CONJUNCTS o prove)
224 | (`(--(&m) > &n <=> F) /\
225 | (&m > &n <=> n < m) /\
226 | (--(&m) > --(&n) <=> m < n) /\
227 | (&m > --(&n) <=> ~((m = 0) /\ (n = 0)))`,
...
243 | [GEN_REWRITE_CONV I [pth_eq1a; pth_eq1b] THENC NUM_EQ_CONV;
244 | GEN_REWRITE_CONV I [pth_eq2a; pth_eq2b] THENC NUM2_EQ_CONV] in
245 | REAL_INT_LE_CONV,REAL_INT_LT_CONV,
246 | REAL_INT_GE_CONV,REAL_INT_GT_CONV,REAL_INT_EQ_CONV..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_::_|_::_::_::[]|_::_::[]|_::[]|[])
File "/build/hol-light-20190729/calc_int.ml", lines 212-246, characters 2-52:
212 | ..let [pth_ge1; pth_ge2a; pth_ge2b; pth_ge3] = (CONJUNCTS o prove)
213 | (`(&m >= --(&n) <=> T) /\
214 | (&m >= &n <=> n <= m) /\
215 | (--(&m) >= --(&n) <=> m <= n) /\
216 | (--(&m) >= &n <=> (m = 0) /\ (n = 0))`,
...
243 | [GEN_REWRITE_CONV I [pth_eq1a; pth_eq1b] THENC NUM_EQ_CONV;
244 | GEN_REWRITE_CONV I [pth_eq2a; pth_eq2b] THENC NUM2_EQ_CONV] in
245 | REAL_INT_LE_CONV,REAL_INT_LT_CONV,
246 | REAL_INT_GE_CONV,REAL_INT_GT_CONV,REAL_INT_EQ_CONV..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_::_|_::_::_::[]|_::_::[]|_::[]|[])
File "/build/hol-light-20190729/calc_int.ml", lines 200-246, characters 2-52:
200 | ..let [pth_lt1; pth_lt2a; pth_lt2b; pth_lt3] = (CONJUNCTS o prove)
201 | (`(&m < --(&n) <=> F) /\
202 | (&m < &n <=> m < n) /\
203 | (--(&m) < --(&n) <=> n < m) /\
204 | (--(&m) < &n <=> ~((m = 0) /\ (n = 0)))`,
...
243 | [GEN_REWRITE_CONV I [pth_eq1a; pth_eq1b] THENC NUM_EQ_CONV;
244 | GEN_REWRITE_CONV I [pth_eq2a; pth_eq2b] THENC NUM2_EQ_CONV] in
245 | REAL_INT_LE_CONV,REAL_INT_LT_CONV,
246 | REAL_INT_GE_CONV,REAL_INT_GT_CONV,REAL_INT_EQ_CONV..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_::_|_::_::_::[]|_::_::[]|_::[]|[])
File "/build/hol-light-20190729/calc_int.ml", lines 187-246, characters 2-52:
187 | ..let [pth_le1; pth_le2a; pth_le2b; pth_le3] = (CONJUNCTS o prove)
188 | (`(--(&m) <= &n <=> T) /\
189 | (&m <= &n <=> m <= n) /\
190 | (--(&m) <= --(&n) <=> n <= m) /\
191 | (&m <= --(&n) <=> (m = 0) /\ (n = 0))`,
...
243 | [GEN_REWRITE_CONV I [pth_eq1a; pth_eq1b] THENC NUM_EQ_CONV;
244 | GEN_REWRITE_CONV I [pth_eq2a; pth_eq2b] THENC NUM2_EQ_CONV] in
245 | REAL_INT_LE_CONV,REAL_INT_LT_CONV,
246 | REAL_INT_GE_CONV,REAL_INT_GT_CONV,REAL_INT_EQ_CONV..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_::_|_::_::_::[]|_::_::[]|_::[]|[])
File "/build/hol-light-20190729/calc_int.ml", lines 284-345, characters 2-51:
284 | ..let [pth1; pth2; pth3; pth4; pth5; pth6] = (CONJUNCTS o prove)
285 | (`(--(&m) + --(&n) = --(&(m + n))) /\
286 | (--(&m) + &(m + n) = &n) /\
287 | (--(&(m + n)) + &m = --(&n)) /\
288 | (&(m + n) + --(&m) = &n) /\
...
342 | let tm1 = rand(rand(concl th1)) in
343 | let th2 = AP_TERM amp_tm (NUM_ADD_CONV tm1) in
344 | TRANS th1 th2
345 | with Failure _ -> failwith "REAL_INT_ADD_CONV")..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_::_::_::_|_::_::_::_::_::[]|_::_::_::_::[]|_::_::_::[]|
_::_::[]|_::[]|[])
File "calc_int.ml" already loaded
0..0..1..7..solved at 12
0..0..1..5..12..24..solved at 30
0..0..1..5..12..23..solved at 30
0..0..1..2..5..solved at 10
0..0..1..2..6..17..34..81..solved at 102
0..0..0..solved at 3
0..0..1..2..solved at 6
0..0..2..solved at 7
0..0..1..solved at 4
0..0..1..9..solved at 16
0..0..0..2..solved at 6
0..0..2..6..16..solved at 22
0..0..1..2..5..15..28..59..solved at 68
0..0..1..2..4..10..19..solved at 27
0..0..1..2..5..solved at 10
0..0..1..2..solved at 7
File "/build/hol-light-20190729/realarith.ml", lines 253-255, characters 6-27:
253 | ......[REAL_LT_CONV; REAL_LE_CONV; REAL_GT_CONV; REAL_GE_CONV; REAL_EQ_CONV;
254 | REAL_NOT_LT_CONV; REAL_NOT_LE_CONV; REAL_NOT_GT_CONV;
255 | REAL_NOT_GE_CONV; _]..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_::_::_::_::_::_::_::_|_::_::_::_::_::_::_::_::_::[]|
_::_::_::_::_::_::_::_::[]|_::_::_::_::_::_::_::[]|_::_::_::_::_::_::[]|
_::_::_::_::_::[]|_::_::_::_::[]|_::_::_::[]|_::_::[]|_::[]|[])
0..0..1..2..solved at 6
0..0..1..solved at 4
0..0..1..solved at 4
0..0..2..4..solved at 13
0..0..2..4..11..32..75..solved at 142
0..0..2..4..12..33..75..solved at 143
0..0..2..4..solved at 8
0..0..1..2..solved at 6
0..0..1..2..4..17..34..solved at 61
0..0..1..2..solved at 6
0..0..1..2..5..18..35..solved at 63
0..0..1..2..solved at 6
0..0..2..4..10..18..34..76..138..336..872..2366..solved at 5076
CPU time (user): 1.382802
File "realarith.ml" already loaded
0..0..1..2..7..14..37..72..174..325..solved at 392
0..0..2..solved at 5
0..0..1..2..6..11..21..34..52..73..solved at 103
0..0..1..2..3..11..21..solved at 28
0..0..1..2..3..11..21..solved at 28
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..1..2..6..12..27..solved at 44
0..0..solved at 2
0..0..solved at 3
0..0..2..4..8..17..30..solved at 47
0..0..solved at 3
0..0..2..4..8..solved at 15
0..0..1..2..6..14..39..solved at 73
0..0..solved at 2
0..0..solved at 2
0..0..2..4..solved at 8
0..0..1..3..solved at 8
0..0..1..3..9..solved at 15
0..0..1..2..5..11..20..solved at 29
0..0..1..2..5..15..29..solved at 49
0..0..1..2..7..19..41..79..146..solved at 200
0..0..1..2..7..19..41..solved at 77
0..0..1..2..7..19..41..79..146..solved at 175
0..0..1..2..7..19..41..solved at 68
0..0..1..2..9..23..64..133..315..solved at 511
0..0..1..2..9..23..64..solved at 116
0..0..1..2..9..23..64..133..315..solved at 415
0..0..1..2..9..23..64..solved at 116
0..0..2..9..solved at 14
0..0..2..9..20..40..87..solved at 94
0..0..2..8..18..34..73..solved at 91
0..0..1..5..12..23..solved at 29
0..0..2..4..8..solved at 13
0..0..2..4..8..solved at 13
0..0..2..4..solved at 8
0..0..3..6..solved at 13
0..0..solved at 4
0..0..solved at 3
0..0..1..4..9..17..solved at 23
0..0..1..4..solved at 9
0..0..1..5..10..18..solved at 24
0..0..1..5..solved at 10
0..0..1..2..solved at 6
0..0..2..5..solved at 10
0..0..1..2..7..14..33..62..solved at 116
0..0..1..2..3..7..14..25..47..81..143..solved at 159
0..0..1..2..7..14..33..62..solved at 116
0..0..1..2..3..7..14..25..49..85..149..solved at 165
0..0..1..2..7..14..33..62..solved at 116
0..0..1..2..3..7..14..25..45..77..137..solved at 218
0..0..1..2..7..14..33..62..solved at 116
0..0..1..2..3..7..14..25..47..81..143..solved at 224
0..0..1..2..7..14..33..62..solved at 116
0..0..1..2..3..7..14..25..49..85..149..solved at 230
0..0..1..2..3..7..14..25..51..89..155..solved at 171
0..0..1..2..7..14..33..62..solved at 116
0..0..1..2..3..7..14..25..47..81..143..solved at 224
0..0..1..2..3..7..14..25..49..85..149..solved at 165
0..0..1..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..3..solved at 7
0..0..2..11..34..84..193..424..970..solved at 1151
0..0..1..2..3..8..solved at 14
0..0..1..2..solved at 6
0..0..2..4..solved at 11
0..0..0..3..solved at 8
0..0..1..7..18..45..solved at 68
0..0..1..5..12..31..92..191..solved at 234
0..0..1..2..3..11..21..31..63..101..139..solved at 265
0..0..2..9..20..50..124..264..solved at 287
0..0..solved at 2
0..0..solved at 2
0..0..1..2..6..12..27..48..solved at 81
0..0..1..5..13..27..solved at 33
0..0..1..5..11..22..49..95..171..305..solved at 319
0..0..1..4..10..20..34..56..88..130..180..238..304..378..468..574..696..850..1032..1258..1520..1834..2228..2782..3536..4510..5728..7250..8852..10582..12504..14450..16716..19194..22436..26450..31796..solved at 33408
0..0..1..2..solved at 6
0..0..1..2..7..14..29..solved at 43
0..0..1..2..8..16..37..solved at 58
0..0..1..solved at 4
0..0..solved at 2
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..2..3..8..16..solved at 25
0..0..1..solved at 4
0..0..1..4..9..19..41..75..solved at 84
0..0..1..5..12..solved at 17
0..0..1..solved at 5
0..0..1..4..11..solved at 16
0..0..1..solved at 5
0..0..1..3..8..22..54..118..267..565..1172..solved at 1415
0..0..solved at 2
0..0..1..4..9..21..50..101..195..398..788..1469..solved at 1634
0..0..1..2..3..7..13..21..solved at 29
0..0..1..4..10..25..53..111..256..493..871..1565..2714..4572..7748..12991..solved at 20439
0..0..1..2..3..7..12..17..solved at 25
0..0..1..2..6..11..18..37..59..96..158..229..326..solved at 350
0..0..1..2..5..9..15..30..47..76..solved at 158
0..0..1..2..3..7..13..21..solved at 30
0..0..1..2..4..9..15..21..35..solved at 48
File "real.ml" already loaded
0..0..3..solved at 6
0..0..1..4..12..53..156..809..solved at 3536
0..0..1..2..solved at 6
0..0..1..solved at 4
0..0..solved at 3
0..0..1..solved at 4
0..0..0..2..solved at 6
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
3 basis elements and 0 critical pairs
3 basis elements and 0 critical pairs
3 basis elements and 0 critical pairs
4 basis elements and 4 critical pairs
5 basis elements and 5 critical pairs
5 basis elements and 4 critical pairs
6 basis elements and 5 critical pairs
6 basis elements and 4 critical pairs
7 basis elements and 0 critical pairs
2 basis elements and 0 critical pairs
2 basis elements and 0 critical pairs
3 basis elements and 1 critical pairs
3 basis elements and 0 critical pairs
2 basis elements and 0 critical pairs
Warning: inventing type variables
0..0..1..solved at 4
Warning: inventing type variables
0..0..1..solved at 4
0..0..1..2..solved at 6
Warning: inventing type variables
File "calc_rat.ml" already loaded
0..0..1..3..solved at 7
0..0..1..solved at 5
0..0..1..solved at 4
0..0..1..solved at 5
0..0..solved at 2
0..0..solved at 2
0..0..1..2..5..10..19..32..53..96..175..solved at 250
0..0..1..5..13..27..solved at 33
0..0..1..5..11..22..49..95..171..305..solved at 319
0..0..1..4..10..20..34..56..88..130..180..238..304..378..468..574..696..850..1032..1258..1520..1834..2228..2782..3536..4510..5728..7250..8852..10582..12504..14450..16716..19194..22436..26450..31796..solved at 33408
0..0..0..solved at 3
0..0..0..solved at 3
0..0..1..solved at 4
0..0..1..2..5..solved at 11
0..0..1..2..solved at 6
0..0..1..solved at 4
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..solved at 3
0..0..solved at 2
0..0..1..5..solved at 9
0..0..1..2..5..8..solved at 14
0..0..2..5..11..23..42..71..111..171..262..solved at 304
0..0..2..solved at 6
0..0..2..solved at 5
0..0..2..solved at 5
0..0..2..solved at 5
0..0..1..solved at 4
0..0..1..solved at 4
0..0..2..4..6..14..30..53..152..368..solved at 435
File "/build/hol-light-20190729/int.ml", lines 847-859, characters 2-37:
847 | ..let [pth_eq1a; pth_eq1b; pth_eq2a; pth_eq2b] = (CONJUNCTS o prove)
848 | (`((&m = &n) <=> (m = n)) /\
849 | ((--(&m) = --(&n)) <=> (m = n)) /\
850 | ((--(&m) = &n) <=> (m = 0) /\ (n = 0)) /\
851 | ((&m = --(&n)) <=> (m = 0) /\ (n = 0))`,
...
856 | [GEN_REWRITE_CONV I [pth_eq1a; pth_eq1b] THENC NUM_EQ_CONV;
857 | GEN_REWRITE_CONV I [pth_eq2a; pth_eq2b] THENC NUM2_EQ_CONV] in
858 | INT_LE_CONV,INT_LT_CONV,
859 | INT_GE_CONV,INT_GT_CONV,INT_EQ_CONV..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_::_|_::_::_::[]|_::_::[]|_::[]|[])
File "/build/hol-light-20190729/int.ml", lines 836-859, characters 2-37:
836 | ..let [pth_gt1; pth_gt2a; pth_gt2b; pth_gt3] = (CONJUNCTS o prove)
837 | (`(--(&m) > &n <=> F) /\
838 | (&m > &n <=> n < m) /\
839 | (--(&m) > --(&n) <=> m < n) /\
840 | (&m > --(&n) <=> ~((m = 0) /\ (n = 0)))`,
...
856 | [GEN_REWRITE_CONV I [pth_eq1a; pth_eq1b] THENC NUM_EQ_CONV;
857 | GEN_REWRITE_CONV I [pth_eq2a; pth_eq2b] THENC NUM2_EQ_CONV] in
858 | INT_LE_CONV,INT_LT_CONV,
859 | INT_GE_CONV,INT_GT_CONV,INT_EQ_CONV..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_::_|_::_::_::[]|_::_::[]|_::[]|[])
File "/build/hol-light-20190729/int.ml", lines 825-859, characters 2-37:
825 | ..let [pth_ge1; pth_ge2a; pth_ge2b; pth_ge3] = (CONJUNCTS o prove)
826 | (`(&m >= --(&n) <=> T) /\
827 | (&m >= &n <=> n <= m) /\
828 | (--(&m) >= --(&n) <=> m <= n) /\
829 | (--(&m) >= &n <=> (m = 0) /\ (n = 0))`,
...
856 | [GEN_REWRITE_CONV I [pth_eq1a; pth_eq1b] THENC NUM_EQ_CONV;
857 | GEN_REWRITE_CONV I [pth_eq2a; pth_eq2b] THENC NUM2_EQ_CONV] in
858 | INT_LE_CONV,INT_LT_CONV,
859 | INT_GE_CONV,INT_GT_CONV,INT_EQ_CONV..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_::_|_::_::_::[]|_::_::[]|_::[]|[])
File "/build/hol-light-20190729/int.ml", lines 813-859, characters 2-37:
813 | ..let [pth_lt1; pth_lt2a; pth_lt2b; pth_lt3] = (CONJUNCTS o prove)
814 | (`(&m < --(&n) <=> F) /\
815 | (&m < &n <=> m < n) /\
816 | (--(&m) < --(&n) <=> n < m) /\
817 | (--(&m) < &n <=> ~((m = 0) /\ (n = 0)))`,
...
856 | [GEN_REWRITE_CONV I [pth_eq1a; pth_eq1b] THENC NUM_EQ_CONV;
857 | GEN_REWRITE_CONV I [pth_eq2a; pth_eq2b] THENC NUM2_EQ_CONV] in
858 | INT_LE_CONV,INT_LT_CONV,
859 | INT_GE_CONV,INT_GT_CONV,INT_EQ_CONV..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_::_|_::_::_::[]|_::_::[]|_::[]|[])
File "/build/hol-light-20190729/int.ml", lines 800-859, characters 2-37:
800 | ..let [pth_le1; pth_le2a; pth_le2b; pth_le3] = (CONJUNCTS o prove)
801 | (`(--(&m) <= &n <=> T) /\
802 | (&m <= &n <=> m <= n) /\
803 | (--(&m) <= --(&n) <=> n <= m) /\
804 | (&m <= --(&n) <=> (m = 0) /\ (n = 0))`,
...
856 | [GEN_REWRITE_CONV I [pth_eq1a; pth_eq1b] THENC NUM_EQ_CONV;
857 | GEN_REWRITE_CONV I [pth_eq2a; pth_eq2b] THENC NUM2_EQ_CONV] in
858 | INT_LE_CONV,INT_LT_CONV,
859 | INT_GE_CONV,INT_GT_CONV,INT_EQ_CONV..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_::_|_::_::_::[]|_::_::[]|_::[]|[])
File "/build/hol-light-20190729/int.ml", lines 897-958, characters 2-46:
897 | ..let [pth1; pth2; pth3; pth4; pth5; pth6] = (CONJUNCTS o prove)
898 | (`(--(&m) + --(&n) = --(&(m + n))) /\
899 | (--(&m) + &(m + n) = &n) /\
900 | (--(&(m + n)) + &m = --(&n)) /\
901 | (&(m + n) + --(&m) = &n) /\
...
955 | let tm1 = rand(rand(concl th1)) in
956 | let th2 = AP_TERM amp_tm (NUM_ADD_CONV tm1) in
957 | TRANS th1 th2
958 | with Failure _ -> failwith "INT_ADD_CONV")..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_::_::_::_|_::_::_::_::_::[]|_::_::_::_::[]|_::_::_::[]|
_::_::[]|_::[]|[])
Warning: inventing type variables
4 basis elements and 1 critical pairs
5 basis elements and 0 critical pairs
Translating certificate to HOL inferences
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
3 basis elements and 2 critical pairs
4 basis elements and 3 critical pairs
5 basis elements and 0 critical pairs
Translating certificate to HOL inferences
0..0..1..2..5..solved at 13
0..0..1..2..5..solved at 13
0..0..2..solved at 5
0..0..2..solved at 5
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
2 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
2 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
0..0..1..5..14..48..solved at 54
2 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
3 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
3 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
3 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
0..0..solved at 2
0..0..solved at 2
0..0..2..5..12..37..73..solved at 91
0..0..1..2..5..10..solved at 19
0..0..1..2..5..11..27..50..solved at 62
Warning: inventing type variables
0..0..1..2..5..solved at 13
0..0..1..2..5..solved at 13
0..0..1..4..11..25..54..solved at 82
0..0..1..4..solved at 12
1 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
0..0..0..2..6..solved at 11
0..0..0..2..6..solved at 11
4 basis elements and 1 critical pairs
4 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
4 basis elements and 1 critical pairs
4 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
3 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
4 basis elements and 1 critical pairs
4 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
4 basis elements and 1 critical pairs
4 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
3 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
4 basis elements and 1 critical pairs
4 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
4 basis elements and 1 critical pairs
4 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
3 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
4 basis elements and 1 critical pairs
4 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
4 basis elements and 1 critical pairs
4 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
3 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
2 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
2 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
0..0..0..0..0..solved at 5
0..0..0..0..0..2..7..12..27..solved at 38
5 basis elements and 1 critical pairs
5 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
5 basis elements and 1 critical pairs
5 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
4 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
0..0..solved at 2
0..0..1..solved at 4
0..0..1..2..3..solved at 8
0..0..1..solved at 4
0..0..1..solved at 4
0..0..solved at 2
0..0..1..3..7..12..22..47..79..123..solved at 145
0..0..1..3..7..12..22..47..79..123..solved at 145
0..0..solved at 2
0..0..solved at 2
0..0..1..2..5..10..19..32..55..132..411..solved at 832
0..0..1..solved at 4
0..0..2..5..15..30..69..187..solved at 492
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..2..4..8..16..27..42..58..77..100..128..160..222..solved at 242
0..0..solved at 2
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..1..4..15..solved at 37
0..0..1..2..solved at 6
0..0..0..solved at 3
0..0..0..solved at 3
0..0..2..4..solved at 8
0..0..solved at 2
0..0..solved at 2
File "int.ml" already loaded
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..0..solved at 3
0..0..solved at 2
0..0..0..solved at 3
Warning: inventing type variables
0..0..1..solved at 5
0..0..1..solved at 4
0..0..solved at 2
0..0..1..solved at 4
Warning: inventing type variables
0..0..solved at 2
0..0..1..solved at 5
0..0..0..solved at 4
0..0..0..solved at 3
0..0..1..solved at 5
0..0..1..solved at 4
0..0..1..solved at 5
0..0..1..solved at 4
0..0..0..solved at 4
0..0..0..solved at 3
0..0..0..solved at 4
0..0..0..solved at 3
0..0..solved at 2
0..0..1..solved at 4
0..0..1..solved at 4
0..0..solved at 2
0..0..1..solved at 4
0..0..1..solved at 4
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..1..3..solved at 7
0..0..1..solved at 4
0..0..1..solved at 4
0..0..solved at 2
0..0..1..solved at 4
0..0..1..solved at 4
0..0..solved at 2
0..0..1..solved at 4
0..0..1..solved at 4
Warning: inventing type variables
0..0..1..solved at 4
0..0..solved at 2
Warning: inventing type variables
0..0..3..solved at 8
0..0..2..solved at 6
0..0..3..solved at 10
0..0..2..solved at 7
0..0..3..solved at 8
0..0..2..solved at 6
0..0..3..8..solved at 12
0..0..2..6..solved at 10
0..0..2..solved at 7
0..0..1..solved at 4
0..0..2..5..solved at 9
0..0..1..3..solved at 7
0..0..2..solved at 7
0..0..1..solved at 5
0..0..2..6..solved at 10
0..0..1..3..solved at 7
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..2..solved at 5
0..0..1..solved at 4
0..0..2..solved at 5
0..0..1..solved at 4
0..0..solved at 3
0..0..solved at 2
0..0..2..solved at 5
0..0..1..solved at 4
0..0..solved at 4
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 4
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
Warning: inventing type variables
0..0..1..solved at 5
0..0..1..solved at 4
0..0..1..solved at 5
0..0..1..solved at 4
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..2..solved at 7
0..0..2..solved at 5
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..2..4..solved at 8
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..0..solved at 4
0..0..0..0..solved at 4
Warning: inventing type variables
0..0..solved at 2
0..0..1..2..5..solved at 11
0..0..1..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
Warning: inventing type variables
0..0..1..2..7..12..solved at 26
0..0..1..2..solved at 6
0..0..1..3..9..17..46..solved at 96
0..0..1..solved at 4
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..solved at 5
0..0..0..solved at 3
0..0..0..solved at 5
0..0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
Warning: inventing type variables
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..solved at 4
0..0..0..solved at 3
0..0..0..solved at 4
0..0..0..solved at 3
0..0..0..solved at 3
0..0..solved at 2
0..0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 3
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..1..5..16..36..114..solved at 121
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 4
0..0..solved at 2
0..0..solved at 3
0..0..solved at 4
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 4
0..0..solved at 4
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 4
0..0..solved at 4
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 4
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..0..solved at 3
0..0..0..solved at 4
0..0..solved at 2
0..0..1..solved at 5
0..0..1..solved at 5
0..0..1..solved at 4
0..0..solved at 2
0..0..1..solved at 4
0..0..2..4..12..21..solved at 31
0..0..3..solved at 6
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 4
0..0..solved at 3
0..0..solved at 4
0..0..solved at 2
0..0..solved at 3
0..0..solved at 4
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..0..solved at 3
0..0..1..solved at 4
0..0..2..solved at 5
0..0..solved at 2
0..0..2..4..solved at 8
0..0..2..4..solved at 8
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..1..3..9..18..34..59..100..167..solved at 240
0..0..1..solved at 4
0..0..solved at 2
0..0..2..solved at 5
0..0..1..3..solved at 7
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..1..2..solved at 6
0..0..1..2..solved at 6
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..0..solved at 3
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 2
0..0..0..solved at 5
0..0..0..solved at 3
Warning: inventing type variables
0..0..solved at 2
0..0..1..solved at 5
0..0..0..solved at 4
0..0..0..solved at 3
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..1..2..solved at 6
Warning: inventing type variables
0..0..0..0..solved at 4
0..0..0..0..solved at 4
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..solved at 3
Warning: inventing type variables
0..0..0..0..3..11..solved at 23
0..0..0..2..solved at 7
0..0..1..solved at 4
0..0..0..0..3..11..solved at 23
0..0..1..solved at 5
0..0..0..2..solved at 6
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..1..2..solved at 6
Warning: inventing type variables
0..0..0..1..solved at 5
Warning: inventing type variables
0..0..0..solved at 4
0..0..0..solved at 3
0..0..0..solved at 4
0..0..0..solved at 3
Warning: inventing type variables
0..0..1..solved at 5
0..0..1..solved at 4
0..0..1..solved at 5
0..0..1..solved at 4
Warning: inventing type variables
0..0..0..1..3..5..solved at 11
Warning: inventing type variables
0..0..0..0..3..8..solved at 14
0..0..1..solved at 4
Warning: inventing type variables
0..0..solved at 3
0..0..2..solved at 7
0..0..2..solved at 7
Warning: inventing type variables
0..0..3..solved at 9
0..0..2..4..6..14..26..solved at 42
Warning: inventing type variables
0..0..1..solved at 4
0..0..solved at 2
Warning: inventing type variables
0..0..1..solved at 5
0..0..1..solved at 4
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..1..solved at 5
0..0..1..solved at 4
0..0..solved at 2
0..0..1..solved at 4
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..1..3..7..solved at 13
0..0..1..4..solved at 8
Warning: inventing type variables
0..0..1..3..solved at 7
0..0..1..solved at 4
0..0..1..solved at 4
Warning: inventing type variables
0..0..1..3..7..12..solved at 19
Warning: inventing type variables
0..0..solved at 2
0..0..1..solved at 6
0..0..0..solved at 4
0..0..0..solved at 3
Warning: inventing type variables
0..0..0..solved at 5
0..0..0..solved at 3
0..0..0..solved at 5
0..0..0..solved at 3
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..0..0..solved at 4
0..0..0..solved at 3
Warning: inventing type variables
0..0..0..2..solved at 6
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..0..4..10..16..31..solved at 42
0..0..1..solved at 5
0..0..1..2..5..9..15..22..31..44..62..solved at 80
0..0..0..2..4..solved at 9
0..0..1..solved at 5
0..0..1..2..5..9..15..23..solved at 37
0..0..0..2..4..solved at 9
0..0..1..solved at 5
0..0..1..2..7..13..solved at 19
0..0..1..3..7..solved at 12
0..0..1..solved at 5
0..0..1..2..5..12..22..solved at 33
0..0..1..3..7..solved at 12
Warning: inventing type variables
0..0..0..solved at 3
0..0..solved at 2
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..1..solved at 4
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..0..solved at 4
Warning: inventing type variables
0..0..1..2..3..7..solved at 17
0..0..1..2..solved at 6
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..2..solved at 5
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..solved at 3
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..solved at 3
Warning: inventing type variables
0..0..0..0..solved at 4
0..0..0..0..solved at 4
Warning: inventing type variables
0..0..0..solved at 3
Warning: inventing type variables
0..0..1..solved at 4
0..0..0..1..2..3..5..7..9..15..21..27..solved at 44
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..1..2..3..7..12..17..28..39..50..77..104..131..solved at 160
0..0..0..solved at 3
Warning: inventing type variables
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..1..solved at 4
0..0..1..2..solved at 6
0..0..1..solved at 4
0..0..1..2..solved at 6
0..0..1..solved at 4
0..0..1..2..solved at 6
0..0..1..solved at 4
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..0..solved at 4
0..0..0..solved at 3
0..0..0..0..solved at 4
0..0..0..solved at 3
0..0..0..0..solved at 4
0..0..0..solved at 3
0..0..0..0..solved at 4
0..0..1..2..5..9..15..25..40..66..123..229..496..solved at 530
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..0..solved at 4
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..1..solved at 4
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..0..solved at 4
0..0..0..solved at 3
0..0..0..0..solved at 4
0..0..0..solved at 3
0..0..0..0..solved at 4
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..1..solved at 4
0..0..1..2..solved at 6
0..0..1..solved at 4
0..0..1..2..solved at 6
0..0..1..solved at 4
0..0..solved at 2
0..0..0..solved at 3
0..0..solved at 2
0..0..0..solved at 3
Warning: inventing type variables
0..0..0..2..solved at 6
0..0..0..1..2..3..6..12..19..29..44..60..90..132..174..237..347..461..671..924..1242..1638..2121..2674..3528..4540..5883..7460..9417..solved at 9827
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..solved at 2
0..0..1..solved at 4
Warning: inventing type variables
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..solved at 3
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..1..solved at 5
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..0..solved at 3
0..0..solved at 2
0..0..0..solved at 3
Warning: inventing type variables
0..0..solved at 2
0..0..0..solved at 3
0..0..1..solved at 4
0..0..0..solved at 3
0..0..0..1..2..3..6..9..12..solved at 20
0..0..0..1..2..3..solved at 8
0..0..solved at 2
0..0..1..solved at 4
0..0..1..solved at 5
0..0..1..solved at 4
0..0..1..solved at 4
0..0..solved at 2
0..0..1..solved at 4
0..0..1..solved at 4
0..0..0..1..2..3..16..solved at 25
0..0..0..2..5..solved at 10
0..0..0..2..solved at 6
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..0..4..10..20..36..57..80..solved at 102
0..0..0..0..4..10..20..36..solved at 56
Warning: inventing type variables
0..0..0..2..solved at 6
0..0..0..1..2..3..6..12..20..32..49..67..101..149..197..269..393..521..756..1037..1386..1819..2341..2939..3838..4894..solved at 5394
Warning: inventing type variables
0..0..0..solved at 3
0..0..1..2..solved at 6
0..0..0..0..3..7..13..23..37..56..84..121..167..232..306..397..505..632..811..1028..1316..1696..2170..2748..3498..4387..5428..6873..8564..10748..13749..solved at 17244
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..2..4..14..35..60..99..166..245..378..solved at 392
0..0..4..8..20..44..77..154..265..solved at 316
0..0..4..9..27..63..114..solved at 128
0..0..3..solved at 7
0..0..3..solved at 8
0..0..1..solved at 4
0..0..3..7..15..solved at 21
0..0..3..6..13..30..55..solved at 72
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..0..4..10..22..41..solved at 51
0..0..0..0..4..10..solved at 20
0..0..1..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..1..2..5..solved at 13
0..0..solved at 2
0..0..1..2..5..solved at 13
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 2
0..0..1..solved at 4
Warning: inventing type variables
Warning: inventing type variables
0..0..1..solved at 4
0..0..1..2..solved at 6
Warning: inventing type variables
0..0..1..3..8..21..46..solved at 96
0..0..1..2..5..9..15..22..29..36..solved at 45
Warning: inventing type variables
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..2..5..9..15..29..44..68..108..150..213..348..523..solved at 570
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
0..0..1..solved at 4
0..0..1..2..solved at 6
Warning: inventing type variables
0..0..1..3..8..18..40..86..solved at 175
0..0..1..3..7..15..26..46..68..96..129..166..207..268..333..414..solved at 465
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..1..2..5..solved at 11
0..0..1..2..5..solved at 11
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..1..2..6..11..solved at 22
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..0..1..2..3..4..5..6..solved at 20
0..0..1..2..solved at 6
0..0..0..solved at 3
0..0..1..2..solved at 6
0..0..0..0..0..2..9..20..46..solved at 72
0..0..0..2..6..solved at 11
0..0..1..3..8..17..33..59..98..146..217..solved at 276
Warning: inventing type variables
0..0..1..2..5..9..15..solved at 24
0..0..2..4..solved at 8
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..2..4..12..21..solved at 31
0..0..1..2..solved at 6
0..0..solved at 4
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 4
0..0..1..3..solved at 7
0..0..solved at 3
0..0..solved at 2
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..solved at 2
Warning: inventing type variables
0..0..0..4..solved at 10
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..1..solved at 4
0..0..1..solved at 5
0..0..solved at 2
0..0..solved at 2
0..0..solved at 4
0..0..3..solved at 7
0..0..3..solved at 9
0..0..solved at 2
0..0..1..solved at 6
0..0..0..solved at 3
0..0..0..solved at 4
0..0..0..1..3..7..solved at 14
0..0..0..0..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..0..solved at 3
0..0..0..0..1..4..9..solved at 17
0..0..1..2..3..7..13..21..solved at 34
0..0..1..2..11..25..52..solved at 59
Warning: inventing type variables
0..0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..0..1..2..3..8..solved at 16
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..3..7..15..26..46..77..solved at 96
0..0..solved at 2
0..0..0..0..1..4..9..solved at 22
0..0..1..2..5..9..15..solved at 26
0..0..1..solved at 4
0..0..1..solved at 4
0..0..0..1..2..3..solved at 8
0..0..1..2..solved at 6
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..0..solved at 4
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..1..solved at 4
Warning: inventing type variables
0..0..0..0..0..2..4..6..9..12..15..23..31..39..56..73..90..116..142..168..276..solved at 403
0..0..0..0..0..0..2..4..6..10..14..18..27..36..45..61..77..93..120..147..174..213..252..291..465..651..890..solved at 1040
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..1..2..11..27..56..102..183..274..437..655..987..1746..2662..solved at 2980
0..0..solved at 2
0..0..solved at 2
0..0..1..2..5..solved at 13
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..1..2..5..solved at 13
0..0..solved at 2
0..0..1..2..11..27..57..106..187..276..416..594..882..1624..2521..solved at 2830
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
0..0..0..0..solved at 4
0..0..0..0..1..2..3..solved at 10
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..1..solved at 4
0..0..1..solved at 4
0..0..0..0..solved at 4
0..0..0..0..1..4..9..17..26..35..50..65..105..solved at 128
0..0..0..0..1..4..9..18..28..39..58..77..solved at 90
0..0..1..3..7..solved at 17
0..0..1..3..7..13..20..solved at 35
Warning: inventing type variables
0..0..1..2..solved at 6
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..solved at 2
0..0..solved at 2
0..0..3..6..solved at 10
0..0..3..6..solved at 10
0..0..2..6..11..23..47..91..186..333..537..880..1386..2121..3496..5629..8957..14874..24097..37962..solved at 40441
0..0..2..7..13..27..57..114..242..439..707..1140..1754..2620..4198..6611..10369..17055..27259..42383..solved at 45658
0..0..3..6..13..31..58..118..solved at 181
0..0..solved at 2
0..0..3..solved at 8
0..0..2..solved at 6
0..0..3..solved at 11
0..0..2..solved at 8
0..0..3..solved at 8
0..0..2..solved at 6
0..0..3..10..solved at 14
0..0..2..8..solved at 12
0..0..0..2..solved at 6
0..0..0..1..7..18..40..73..113..191..298..467..830..solved at 1350
0..0..1..solved at 4
0..0..0..2..solved at 6
Warning: inventing type variables
0..0..solved at 3
0..0..2..4..8..16..28..solved at 37
0..0..solved at 2
0..0..1..5..10..15..30..solved at 37
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 6
0..0..solved at 2
0..0..solved at 2
0..0..2..solved at 8
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 3
0..0..2..4..8..16..28..solved at 37
0..0..solved at 2
0..0..solved at 2
0..0..2..solved at 6
0..0..solved at 2
0..0..solved at 2
0..0..2..5..8..11..28..solved at 35
0..0..solved at 2
0..0..solved at 2
0..0..2..solved at 6
0..0..2..solved at 5
0..0..solved at 2
0..0..solved at 2
0..0..2..4..6..8..10..18..38..58..solved at 71
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
0..0..0..0..1..5..11..solved at 19
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..1..2..7..13..23..34..45..56..80..104..141..237..solved at 327
0..0..1..3..7..17..solved at 23
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..1..2..solved at 6
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 3
0..0..2..solved at 5
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
Warning: inventing type variables
0..0..2..solved at 5
0..0..3..solved at 6
0..0..3..solved at 6
Warning: inventing type variables
0..0..solved at 4
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 4
0..0..0..solved at 4
0..0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..1..2..5..9..15..25..35..47..67..87..114..solved at 152
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 3
0..0..1..solved at 4
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..2..4..10..18..30..48..66..88..solved at 99
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..0..0..solved at 4
0..0..0..0..solved at 4
Warning: inventing type variables
0..0..solved at 2
0..0..1..2..solved at 7
0..0..0..0..solved at 5
0..0..0..0..solved at 4
0..0..2..4..7..17..31..66..117..228..383..696..1122..1957..solved at 2075
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
Warning: inventing type variables
0..0..0..2..8..20..49..103..solved at 184
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..0..solved at 3
0..0..1..2..solved at 6
0..0..1..2..3..solved at 8
0..0..1..2..solved at 6
0..0..solved at 3
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
0..0..1..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
0..0..1..2..5..12..22..37..56..solved at 74
Warning: inventing type variables
0..0..1..2..5..solved at 13
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..1..2..7..15..25..40..62..93..159..253..solved at 294
0..0..1..solved at 4
0..0..solved at 2
0..0..2..solved at 5
0..0..1..solved at 4
0..0..1..5..14..solved at 24
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..solved at 3
Warning: inventing type variables
0..0..solved at 2
0..0..1..2..solved at 7
0..0..0..0..solved at 5
0..0..0..0..solved at 4
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
Warning: inventing type variables
0..0..solved at 2
Warning: inventing type variables
0..0..0..solved at 3
0..0..solved at 2
0..0..0..solved at 4
0..0..0..solved at 3
Warning: inventing type variables
0..0..3..6..16..33..60..123..solved at 148
0..0..2..4..10..20..35..77..136..243..470..842..1459..solved at 2793
0..0..3..9..24..59..112..228..solved at 259
0..0..2..solved at 5
0..0..1..2..9..21..47..87..161..241..405..578..951..1711..2759..solved at 3322
0..0..0..1..2..3..8..solved at 16
0..0..1..solved at 4
0..0..1..2..5..9..15..23..solved at 37
0..0..solved at 2
Warning: inventing type variables
0..0..1..2..4..6..8..18..solved at 30
Warning: inventing type variables
0..0..1..2..9..21..47..87..161..241..405..578..951..1711..2759..solved at 3322
0..0..1..2..6..13..24..41..61..90..135..187..273..solved at 328
0..0..2..solved at 7
0..0..solved at 3
0..0..1..solved at 5
0..0..0..solved at 3
0..0..solved at 5
0..0..4..solved at 10
0..0..solved at 4
0..0..3..solved at 8
0..0..solved at 5
0..0..solved at 4
0..0..3..solved at 7
0..0..3..solved at 7
0..0..2..solved at 5
0..0..2..solved at 5
0..0..1..2..3..7..solved at 16
0..0..1..2..solved at 6
0..0..0..1..2..3..solved at 8
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..1..4..14..41..solved at 109
0..0..1..4..14..41..solved at 109
0..0..solved at 4
0..0..solved at 3
0..0..2..solved at 7
0..0..2..solved at 6
0..0..1..solved at 5
0..0..1..solved at 4
0..0..1..solved at 5
0..0..0..solved at 3
0..0..solved at 3
0..0..1..solved at 4
0..0..0..1..2..3..8..13..18..57..118..228..519..solved at 739
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..1..solved at 6
0..0..0..0..solved at 4
0..0..0..0..solved at 5
0..0..1..2..3..7..14..26..47..77..solved at 94
0..0..0..0..solved at 4
0..0..0..solved at 3
0..0..0..1..solved at 6
0..0..0..0..solved at 5
0..0..0..0..solved at 4
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..0..0..solved at 4
0..0..0..0..solved at 4
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..2..solved at 5
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..2..solved at 5
0..0..solved at 3
0..0..2..solved at 6
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..2..solved at 5
0..0..solved at 3
0..0..2..solved at 6
0..0..solved at 3
0..0..2..solved at 5
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..2..solved at 5
0..0..solved at 3
0..0..2..solved at 6
0..0..solved at 3
0..0..2..solved at 5
0..0..solved at 3
0..0..2..solved at 6
0..0..solved at 3
0..0..2..solved at 5
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..2..solved at 5
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..solved at 4
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..solved at 4
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..solved at 4
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..solved at 2
0..0..0..0..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..0..0..solved at 5
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..0..0..0..solved at 5
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..0..solved at 4
0..0..solved at 2
0..0..0..solved at 3
0..0..0..0..solved at 4
0..0..0..solved at 3
0..0..solved at 2
Warning: inventing type variables
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..solved at 2
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..solved at 2
0..0..1..solved at 4
0..0..1..solved at 4
Warning: inventing type variables
0..0..2..5..15..32..67..114..173..245..344..468..solved at 605
0..0..1..solved at 4
0..0..1..solved at 4
0..0..2..5..10..solved at 16
0..0..2..5..10..solved at 16
0..0..2..solved at 6
0..0..0..solved at 3
0..0..1..solved at 4
0..0..0..0..1..solved at 6
0..0..2..5..10..solved at 16
0..0..1..solved at 4
0..0..1..solved at 4
0..0..2..5..10..solved at 16
0..0..2..solved at 5
0..0..1..solved at 4
0..0..1..solved at 4
0..0..2..solved at 5
0..0..1..solved at 4
0..0..2..6..solved at 10
0..0..2..6..solved at 10
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..2..solved at 5
Warning: inventing type variables
0..0..1..solved at 4
0..0..1..solved at 4
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..1..2..5..15..31..56..96..solved at 122
Warning: inventing type variables
0..0..1..solved at 4
0..0..1..solved at 4
0..0..solved at 2
0..0..1..2..5..solved at 10
0..0..solved at 2
0..0..3..solved at 6
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..solved at 2
0..0..1..solved at 4
0..0..1..solved at 4
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 2
0..0..1..solved at 4
0..0..1..3..9..16..36..63..98..178..268..solved at 293
0..0..2..5..10..23..40..solved at 54
0..0..solved at 2
Warning: inventing type variables
0..0..1..solved at 4
0..0..2..solved at 5
0..0..2..solved at 5
0..0..1..solved at 4
Warning: inventing type variables
0..0..1..solved at 4
0..0..1..solved at 4
0..0..solved at 2
0..0..2..solved at 5
0..0..solved at 3
0..0..3..solved at 6
0..0..solved at 3
0..0..3..solved at 6
0..0..solved at 2
0..0..4..solved at 7
Warning: inventing type variables
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..2..5..solved at 10
0..0..solved at 3
0..0..solved at 2
0..0..4..solved at 7
0..0..solved at 2
Warning: inventing type variables
0..0..0..1..2..3..solved at 8
0..0..0..1..2..3..6..9..12..solved at 20
0..0..0..0..1..2..3..4..5..6..9..12..15..23..31..39..solved at 63
0..0..0..1..2..3..6..9..12..solved at 22
0..0..1..2..solved at 6
0..0..solved at 2
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..1..4..9..solved at 14
0..0..1..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
0..0..0..0..0..4..12..20..39..62..89..solved at 132
0..0..0..0..solved at 4
0..0..0..0..solved at 4
0..0..0..0..solved at 6
0..0..0..0..solved at 4
0..0..0..0..solved at 6
0..0..0..0..solved at 4
0..0..0..solved at 3
0..0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..4..8..solved at 12
0..0..2..solved at 6
0..0..2..solved at 5
0..0..solved at 2
0..0..3..solved at 6
0..0..4..solved at 7
0..0..2..6..14..46..85..182..345..630..solved at 708
Warning: inventing type variables
0..0..1..3..7..13..24..63..102..180..268..solved at 277
Warning: inventing type variables
0..0..1..3..5..11..21..32..45..68..91..solved at 100
0..0..1..3..7..13..24..55..86..143..207..solved at 216
0..0..1..3..7..12..20..30..40..71..106..solved at 115
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..3..8..14..solved at 20
0..0..1..3..8..13..solved at 19
0..0..1..solved at 4
0..0..0..solved at 3
Warning: inventing type variables
0..0..2..solved at 6
0..0..solved at 2
0..0..2..solved at 6
0..0..2..4..10..22..42..solved at 53
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..2..4..solved at 8
0..0..0..0..0..solved at 5
0..0..solved at 2
0..0..2..solved at 5
0..0..2..5..12..solved at 17
0..0..2..7..14..32..82..191..466..1144..2508..5758..13277..28479..solved at 31328
0..0..1..4..8..15..solved at 34
0..0..1..6..18..solved at 25
0..0..0..2..6..14..solved at 32
0..0..0..solved at 3
0..0..1..2..solved at 6
Warning: inventing type variables
5 basis elements and 1 critical pairs
5 basis elements and 0 critical pairs
5 basis elements and 3 critical pairs
6 basis elements and 4 critical pairs
6 basis elements and 3 critical pairs
7 basis elements and 4 critical pairs
7 basis elements and 3 critical pairs
8 basis elements and 3 critical pairs
8 basis elements and 2 critical pairs
8 basis elements and 1 critical pairs
8 basis elements and 0 critical pairs
5 basis elements and 2 critical pairs
6 basis elements and 2 critical pairs
6 basis elements and 1 critical pairs
7 basis elements and 1 critical pairs
7 basis elements and 0 critical pairs
5 basis elements and 3 critical pairs
6 basis elements and 4 critical pairs
6 basis elements and 3 critical pairs
7 basis elements and 5 critical pairs
7 basis elements and 4 critical pairs
8 basis elements and 5 critical pairs
9 basis elements and 0 critical pairs
4 basis elements and 1 critical pairs
5 basis elements and 1 critical pairs
5 basis elements and 0 critical pairs
2 basis elements and 0 critical pairs
5 basis elements and 2 critical pairs
6 basis elements and 0 critical pairs
5 basis elements and 3 critical pairs
6 basis elements and 4 critical pairs
6 basis elements and 3 critical pairs
7 basis elements and 0 critical pairs
0..0..1..5..solved at 10
0..0..solved at 2
0..0..1..solved at 5
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..2..6..solved at 19
0..0..3..8..solved at 22
0..0..2..6..solved at 19
0..0..solved at 2
0..0..3..8..solved at 22
0..0..solved at 4
0..0..solved at 3
0..0..solved at 2
0..0..2..6..solved at 22
0..0..solved at 3
0..0..solved at 2
0..0..2..solved at 9
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..3..7..22..54..solved at 65
0..0..0..4..11..21..46..76..solved at 89
0..0..2..4..14..solved at 32
0..0..1..2..8..solved at 17
0..0..solved at 2
0..0..1..2..8..solved at 18
0..0..1..2..5..12..21..solved at 30
0..0..1..2..5..12..23..solved at 35
0..0..1..solved at 4
0..0..1..2..solved at 6
0..0..0..2..14..38..solved at 134
0..0..0..2..14..solved at 42
0..0..0..solved at 3
0..0..0..1..solved at 8
0..0..solved at 2
0..0..3..7..solved at 11
0..0..solved at 2
0..0..3..7..solved at 11
0..0..solved at 2
0..0..2..5..11..26..solved at 51
Warning: inventing type variables
Warning: inventing type variables
0..0..1..solved at 4
Warning: inventing type variables
0..0..1..solved at 4
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 5
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 5
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..1..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..2..4..8..19..40..67..101..solved at 127
Warning: inventing type variables
0..0..2..4..8..18..31..46..solved at 60
Warning: inventing type variables
0..0..2..4..8..solved at 13
0..0..2..4..8..solved at 13
0..0..2..4..8..solved at 19
0..0..2..4..8..solved at 16
Warning: inventing type variables
0..0..2..4..8..28..54..solved at 68
0..0..2..4..8..solved at 13
0..0..2..4..8..solved at 19
0..0..solved at 2
0..0..2..4..solved at 8
0..0..2..4..10..22..solved at 31
0..0..2..4..8..solved at 16
0..0..2..4..solved at 10
0..0..solved at 2
0..0..2..4..solved at 10
0..0..2..4..12..24..solved at 30
0..0..solved at 2
Warning: inventing type variables
0..0..3..7..15..31..53..solved at 71
0..0..2..5..10..22..44..solved at 56
Warning: inventing type variables
0..0..2..4..8..solved at 17
0..0..2..4..8..solved at 19
0..0..3..6..13..32..58..solved at 74
0..0..3..6..13..32..58..solved at 70
0..0..2..4..8..solved at 17
0..0..2..4..8..22..48..87..137..213..310..439..solved at 478
0..0..2..4..8..22..48..87..137..213..310..439..solved at 486
0..0..2..4..8..solved at 16
0..0..2..4..8..16..36..71..114..180..267..433..653..908..1270..solved at 1348
Warning: inventing type variables
0..0..2..5..solved at 9
0..0..1..solved at 4
0..0..0..solved at 3
0..0..1..solved at 4
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..2..solved at 6
0..0..solved at 3
0..0..solved at 2
0..0..0..0..0..solved at 5
0..0..0..0..solved at 4
0..0..1..solved at 6
0..0..1..solved at 5
Warning: inventing type variables
0..0..2..solved at 5
0..0..1..solved at 4
0..0..1..solved at 4
0..0..0..solved at 3
0..0..2..8..solved at 20
0..0..solved at 2
0..0..2..solved at 5
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 2
0..0..3..solved at 6
0..0..2..4..solved at 8
0..0..0..0..2..6..13..25..solved at 34
0..0..0..0..2..6..13..25..solved at 34
Warning: inventing type variables
0..0..1..2..5..12..23..38..64..solved at 78
0..0..1..2..7..14..21..solved at 28
Warning: inventing type variables
0..0..1..2..5..12..23..38..64..solved at 78
0..0..1..2..7..14..21..solved at 28
0..0..0..0..0..1..3..5..12..solved at 21
0..0..solved at 2
0..0..1..solved at 4
0..0..0..0..1..2..3..7..15..23..35..49..63..solved at 77
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..0..solved at 4
0..0..1..2..solved at 6
0..0..0..2..5..8..solved at 14
0..0..0..0..2..5..8..12..16..20..solved at 28
Warning: inventing type variables
Warning: inventing type variables
0..0..1..3..6..9..12..solved at 19
0..0..1..3..5..solved at 10
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..1..3..5..solved at 10
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..0..solved at 4
0..0..1..2..solved at 6
0..0..0..2..5..8..solved at 14
0..0..0..0..2..5..8..12..16..20..solved at 28
Warning: inventing type variables
Warning: inventing type variables
0..0..1..3..6..9..12..solved at 19
0..0..1..3..5..solved at 10
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..1..3..5..solved at 10
Warning: inventing type variables
Warning: inventing type variables
0..0..1..3..7..solved at 13
0..0..3..7..15..solved at 28
0..0..solved at 2
0..0..4..9..18..solved at 35
0..0..2..solved at 7
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..1..2..6..12..22..34..48..69..99..140..211..307..435..642..905..1303..1847..solved at 2499
0..0..1..7..23..57..137..284..501..solved at 666
0..0..0..1..2..3..12..solved at 21
0..0..1..2..5..12..22..36..52..74..106..152..212..321..452..711..1026..1572..2205..3406..5353..8956..solved at 11113
0..0..1..2..5..solved at 13
0..0..2..9..20..43..82..solved at 135
Warning: inventing type variables
0..0..1..2..5..9..15..22..solved at 38
0..0..solved at 3
0..0..solved at 3
0..0..5..10..24..51..solved at 66
0..0..solved at 2
0..0..4..8..19..41..solved at 64
0..0..4..8..19..42..solved at 65
0..0..5..10..24..solved at 32
Warning: inventing type variables
0..0..1..solved at 5
0..0..1..solved at 4
0..0..solved at 2
0..0..1..solved at 4
Warning: inventing type variables
0..0..solved at 2
0..0..1..solved at 5
0..0..0..solved at 4
0..0..0..solved at 3
0..0..1..2..5..8..11..14..17..20..36..56..78..109..148..191..248..317..solved at 371
0..0..1..2..5..8..11..14..17..20..36..56..78..109..148..191..248..317..solved at 375
0..0..1..solved at 4
0..0..solved at 2
0..0..0..1..2..3..5..7..9..solved at 17
0..0..solved at 2
0..0..solved at 2
0..0..0..0..1..2..3..4..5..6..9..12..15..21..27..33..solved at 55
0..0..1..2..5..8..11..14..17..20..28..36..44..55..66..77..solved at 97
0..0..1..2..5..8..11..14..17..20..28..36..44..55..66..77..solved at 97
0..0..solved at 2
0..0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..1..3..solved at 7
0..0..solved at 2
0..0..1..2..5..9..17..26..38..solved at 48
0..0..1..2..7..solved at 12
0..0..1..2..5..9..15..23..34..48..solved at 65
0..0..1..solved at 4
0..0..0..solved at 3
0..0..1..2..5..11..solved at 18
0..0..1..2..5..solved at 13
0..0..1..solved at 4
0..0..1..2..5..10..18..31..46..63..88..solved at 117
0..0..1..solved at 4
0..0..1..solved at 4
0..0..0..1..2..3..8..solved at 16
0..0..1..solved at 4
0..0..1..2..5..9..15..30..47..76..solved at 120
0..0..solved at 2
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..3..8..15..29..60..solved at 90
0..0..1..3..8..15..solved at 21
0..0..2..4..solved at 8
0..0..solved at 2
0..0..2..5..13..34..70..160..300..605..1071..2263..3998..8099..solved at 12555
0..0..3..solved at 6
0..0..3..solved at 6
0..0..3..solved at 8
0..0..2..solved at 6
0..0..3..solved at 10
0..0..2..solved at 7
0..0..3..solved at 8
0..0..2..solved at 6
0..0..3..8..solved at 12
0..0..2..6..solved at 10
0..0..2..solved at 5
0..0..2..5..solved at 10
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..0..1..2..3..solved at 8
0..0..0..1..2..3..6..9..12..21..30..39..58..77..96..solved at 107
Warning: inventing type variables
0..0..0..1..2..3..8..solved at 16
0..0..0..1..2..3..8..solved at 16
Warning: inventing type variables
0..0..2..solved at 5
0..0..2..solved at 5
0..0..2..7..17..36..76..145..262..solved at 474
0..0..1..6..16..31..71..132..229..443..713..1082..1694..2623..4077..6756..11110..18048..29639..47994..76336..solved at 115499
0..0..2..4..8..22..42..66..112..161..223..297..381..481..707..949..1227..1650..2105..2606..3270..3978..4770..5888..7090..8445..10095..11890..14206..solved at 14609
0..0..2..8..16..42..99..163..346..solved at 408
0..0..1..3..10..solved at 15
0..0..2..4..12..30..56..solved at 64
0..0..2..4..11..26..47..solved at 55
0..0..2..5..13..solved at 18
0..0..1..3..10..solved at 15
0..0..2..4..12..27..47..solved at 54
0..0..2..4..11..26..46..solved at 53
0..0..2..5..13..solved at 18
0..0..1..3..8..14..36..77..126..246..516..1204..3264..solved at 3298
0..0..1..solved at 7
0..0..1..7..15..33..83..171..solved at 204
0..0..2..5..10..33..62..93..150..209..272..339..414..499..747..1045..1349..solved at 1473
0..0..solved at 2
0..0..2..solved at 6
0..0..solved at 3
0..0..2..solved at 5
0..0..solved at 2
0..0..1..3..solved at 7
0..0..solved at 2
0..0..2..solved at 5
0..0..1..4..8..12..16..solved at 25
0..0..1..5..14..solved at 20
0..0..2..4..8..16..28..44..solved at 54
0..0..2..solved at 7
0..0..2..solved at 7
0..0..1..solved at 5
0..0..3..10..23..57..122..234..solved at 262
0..0..1..4..12..31..76..162..294..558..959..1533..2548..solved at 2588
0..0..2..4..9..25..48..84..142..210..337..solved at 387
0..0..2..5..11..35..65..100..176..254..338..437..544..687..1040..1443..1912..solved at 2135
0..0..1..5..11..solved at 16
0..0..1..3..7..solved at 17
0..0..3..8..18..53..99..155..287..423..569..733..913..1145..1693..2329..3064..solved at 3378
0..0..3..8..18..53..99..155..287..423..569..733..913..1145..1693..2329..3064..solved at 3370
0..0..3..6..14..41..79..141..244..366..591..solved at 701
0..0..3..6..14..41..79..141..244..366..591..solved at 662
0..0..1..2..3..10..21..32..55..solved at 64
0..0..2..solved at 5
0..0..0..4..solved at 12
0..0..0..4..solved at 8
0..0..2..solved at 8
0..0..2..solved at 5
0..0..2..solved at 9
0..0..3..12..30..77..192..408..957..2317..5293..solved at 9312
0..0..2..8..solved at 14
0..0..2..10..solved at 17
0..0..3..11..28..74..192..410..solved at 619
0..0..2..10..31..89..255..622..1544..3861..9467..solved at 9606
0..0..2..7..17..36..76..145..262..solved at 483
0..0..1..6..16..31..71..132..229..443..713..1082..1694..2617..4067..6744..11120..18071..29739..48196..76749..solved at 117331
0..0..2..4..8..22..42..66..112..161..223..297..381..481..707..949..1227..1650..2105..2606..3270..3978..4770..5891..7096..8454..10131..11953..14289..solved at 14763
0..0..2..8..16..42..99..163..346..solved at 408
0..0..2..4..12..27..48..solved at 56
0..0..2..5..13..solved at 18
0..0..1..3..10..solved at 15
0..0..2..4..11..29..55..solved at 63
0..0..2..4..12..27..47..solved at 54
0..0..2..5..13..solved at 18
0..0..1..3..10..solved at 15
0..0..2..4..11..26..46..solved at 53
0..0..1..3..8..14..36..77..126..246..516..1202..3262..solved at 3309
0..0..1..solved at 7
0..0..1..7..15..33..83..171..solved at 204
0..0..2..5..10..33..62..93..150..209..272..339..414..499..749..1049..1355..solved at 1479
0..0..solved at 2
0..0..2..solved at 6
0..0..solved at 3
0..0..2..solved at 5
0..0..solved at 2
0..0..1..3..solved at 7
0..0..solved at 2
0..0..2..solved at 5
0..0..1..5..14..solved at 20
0..0..1..4..8..12..16..solved at 27
0..0..2..4..8..16..28..45..solved at 55
0..0..2..solved at 7
0..0..1..solved at 5
0..0..2..solved at 7
0..0..2..6..16..41..78..solved at 112
0..0..3..solved at 6
Warning: inventing type variables
0..0..1..solved at 4
0..0..1..2..5..solved at 11
0..0..2..5..11..43..97..169..307..507..781..1260..1924..solved at 2571
0..0..2..5..11..40..91..161..351..626..solved at 723
0..0..1..4..11..30..75..161..294..559..961..1532..2548..solved at 2599
Warning: inventing type variables
0..0..2..4..10..26..49..86..143..211..338..solved at 362
0..0..2..5..11..35..65..100..176..254..338..437..544..687..1042..1447..1918..solved at 2141
0..0..1..5..11..solved at 16
0..0..1..3..7..solved at 17
0..0..3..8..18..53..99..155..287..423..569..733..913..1145..1695..2333..3070..solved at 3384
0..0..3..8..18..53..99..155..287..423..569..733..913..1145..1695..2333..3070..solved at 3376
0..0..3..6..16..43..81..145..246..368..593..solved at 658
0..0..3..6..16..43..81..145..246..368..593..solved at 619
0..0..1..2..3..10..21..32..55..solved at 64
0..0..2..solved at 5
0..0..2..solved at 5
0..0..2..solved at 5
0..0..2..solved at 5
0..0..2..solved at 8
0..0..0..0..4..8..12..32..70..solved at 82
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..solved at 2
0..0..2..solved at 5
0..0..solved at 2
0..0..2..solved at 5
0..0..0..solved at 3
0..0..1..4..solved at 8
0..0..2..5..11..29..63..103..180..solved at 196
0..0..0..solved at 3
0..0..1..4..solved at 8
0..0..2..5..11..29..63..103..180..solved at 196
0..0..1..3..8..18..37..58..91..126..165..204..271..346..451..613..783..1037..1319..1611..1959..2388..2833..3328..solved at 3724
0..0..1..3..8..18..37..58..91..126..165..204..271..346..451..613..783..1037..1319..1611..1959..2387..2831..3323..solved at 3718
0..0..1..2..solved at 6
0..0..0..1..3..5..7..9..11..solved at 18
0..0..1..2..solved at 6
0..0..0..1..3..5..7..9..11..solved at 18
0..0..0..1..2..3..solved at 8
0..0..0..1..2..3..solved at 8
File "sets.ml" already loaded
0..0..1..7..solved at 11
0..0..0..4..13..solved at 25
0..0..2..7..15..39..100..234..587..1410..3140..7378..16891..solved at 18714
0..0..1..2..solved at 6
0..0..1..2..5..9..15..24..33..44..67..90..125..solved at 185
0..0..1..2..5..8..11..solved at 19
0..0..3..6..15..54..118..265..680..1689..5287..solved at 11598
0..0..0..0..2..4..6..10..14..18..30..42..68..114..161..216..305..399..508..670..875..1105..solved at 1498
0..0..1..3..8..solved at 13
0..0..0..0..1..3..5..12..21..41..70..112..159..242..330..451..600..781..1008..1316..1670..solved at 2062
0..0..1..solved at 4
0..0..2..8..19..solved at 25
0..0..2..8..18..solved at 24
0..0..1..solved at 4
0..0..solved at 2
0..0..1..2..5..9..15..27..41..66..107..solved at 125
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..3..6..19..42..78..127..186..270..412..638..solved at 776
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..4..8..23..51..93..156..solved at 192
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..1..2..solved at 9
0..0..2..4..solved at 8
0..0..1..2..solved at 9
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..1..2..solved at 7
0..0..solved at 2
0..0..1..2..solved at 7
0..0..1..2..8..17..53..104..solved at 158
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..1..solved at 4
0..0..1..solved at 4
Warning: inventing type variables
Warning: inventing type variables
0..0..1..2..solved at 6
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..1..2..solved at 6
0..0..1..solved at 5
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..2..4..11..20..34..72..114..190..381..solved at 438
0..0..solved at 2
0..0..2..4..10..solved at 16
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 4
0..0..solved at 2
0..0..solved at 3
0..0..solved at 4
0..0..solved at 2
0..0..0..solved at 5
0..0..0..solved at 3
0..0..solved at 2
0..0..1..solved at 5
Warning: inventing type variables
0..0..1..2..5..9..15..solved at 22
0..0..solved at 2
0..0..3..6..12..25..46..94..155..254..479..solved at 599
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..1..solved at 4
0..0..solved at 2
Warning: inventing type variables
0..0..1..2..5..9..15..22..29..36..53..70..97..132..167..210..282..354..455..576..697..838..1034..1230..1481..solved at 1835
Warning: inventing type variables
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 4
0..0..solved at 3
0..0..solved at 2
Warning: inventing type variables
0..0..2..10..33..89..264..814..2481..solved at 6396
0..0..1..2..6..solved at 11
0..0..1..2..5..9..15..solved at 26
0..0..1..6..22..48..121..253..441..992..1771..3020..5157..8831..solved at 12430
Warning: inventing type variables
Warning: inventing type variables
0..0..3..6..13..solved at 24
0..0..2..4..8..16..28..43..67..95..155..236..348..490..727..solved at 823
0..0..4..8..19..solved at 30
0..0..3..6..solved at 13
0..0..1..9..19..37..76..127..solved at 141
0..0..solved at 2
0..0..1..8..17..34..67..112..solved at 126
0..0..0..1..3..7..20..solved at 34
0..0..1..solved at 4
0..0..1..2..5..9..15..35..solved at 65
Warning: inventing type variables
0..0..0..solved at 3
0..0..0..1..solved at 6
0..0..0..0..solved at 5
0..0..0..0..solved at 4
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..1..2..5..solved at 11
0..0..solved at 2
0..0..1..2..5..10..20..solved at 31
0..0..solved at 2
0..0..1..7..solved at 11
0..0..3..7..solved at 11
0..0..2..4..12..24..44..84..solved at 142
Warning: inventing type variables
0..0..0..1..2..3..8..solved at 16
0..0..1..solved at 4
0..0..1..2..10..22..49..93..171..282..522..811..solved at 842
0..0..1..2..5..9..15..23..solved at 37
0..0..0..1..2..3..solved at 8
0..0..1..2..5..9..15..30..47..76..solved at 121
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..2..solved at 6
0..0..0..2..4..8..solved at 18
0..0..1..2..5..solved at 13
0..0..3..11..31..solved at 42
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
Warning: inventing type variables
0..0..2..4..solved at 9
0..0..solved at 2
0..0..2..4..solved at 8
0..0..solved at 2
0..0..2..solved at 5
0..0..4..8..18..34..solved at 48
0..0..2..4..solved at 8
0..0..4..8..18..34..solved at 48
0..0..2..4..8..16..39..83..147..248..472..749..1436..solved at 2196
0..0..4..8..18..solved at 32
0..0..2..4..8..solved at 14
0..0..1..3..solved at 8
0..0..0..solved at 3
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..1..2..5..11..25..55..100..209..399..solved at 697
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
Warning: inventing type variables
0..0..1..2..5..9..15..solved at 26
0..0..1..solved at 4
Warning: inventing type variables
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
Warning: inventing type variables
0..0..1..2..6..solved at 12
0..0..1..solved at 4
Warning: inventing type variables
0..0..1..2..solved at 8
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
Warning: inventing type variables
0..0..2..6..15..30..73..134..229..368..553..800..1208..1747..2508..3645..5152..7046..solved at 7159
Warning: inventing type variables
Warning: inventing type variables
0..0..3..6..9..solved at 14
0..0..3..6..9..solved at 14
0..0..2..5..8..solved at 18
0..0..2..solved at 6
Warning: inventing type variables
0..0..1..3..7..13..30..solved at 37
0..0..1..solved at 4
0..0..solved at 2
0..0..1..5..15..30..solved at 36
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..2..solved at 5
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..1..5..15..solved at 22
0..0..2..6..22..76..261..solved at 597
0..0..1..2..7..13..26..42..67..97..161..234..375..537..790..1087..1727..2450..solved at 2485
Warning: inventing type variables
0..0..0..solved at 3
Warning: inventing type variables
0..0..2..6..15..30..77..142..261..426..699..1038..1725..2554..4260..6426..11402..17097..solved at 17200
Warning: inventing type variables
0..0..1..2..5..9..15..23..31..39..57..75..103..solved at 139
0..0..1..2..6..11..19..34..49..70..117..164..237..386..553..836..1215..1685..2287..solved at 2748
Warning: inventing type variables
Warning: inventing type variables
0..0..1..solved at 5
0..0..1..2..4..9..15..solved at 21
0..0..solved at 2
0..0..1..2..5..9..15..26..38..52..75..98..130..solved at 171
0..0..solved at 2
0..0..1..2..5..11..19..solved at 26
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..1..3..solved at 7
0..0..solved at 2
0..0..1..4..12..30..solved at 51
0..0..solved at 2
0..0..1..3..7..14..32..solved at 40
0..0..solved at 2
0..0..1..3..7..14..30..solved at 38
Warning: inventing type variables
Warning: inventing type variables
0..0..2..4..10..18..30..solved at 46
0..0..2..4..8..16..28..59..103..173..solved at 212
0..0..2..4..solved at 8
0..0..1..2..7..14..21..solved at 28
0..0..1..4..13..29..64..122..204..solved at 247
0..0..1..7..18..38..78..147..solved at 161
0..0..1..solved at 4
1 basis elements and 0 critical pairs
3 basis elements and 0 critical pairs
1 basis elements and 0 critical pairs
Translating certificate to HOL inferences
Warning: inventing type variables
0..0..2..4..8..27..52..93..143..223..solved at 280
File "/build/hol-light-20190729/iterate.ml", line 1504, characters 6-27:
1504 | let [pth_0; pth_1; pth_2] = (CONJUNCTS o prove)
^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_|_::_::[]|_::[]|[])
Warning: inventing type variables
0..0..1..2..solved at 8
0..0..solved at 2
0..0..solved at 2
0..0..1..2..solved at 8
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
Warning: inventing type variables
0..0..2..6..15..30..73..134..229..368..553..800..1208..1747..2508..3645..5152..7046..solved at 7159
0..0..solved at 2
0..0..1..solved at 4
0..0..0..solved at 3
0..0..solved at 2
0..0..2..8..solved at 12
0..0..1..5..15..31..solved at 37
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..3..solved at 6
0..0..3..solved at 6
0..0..3..6..9..25..47..79..153..solved at 167
0..0..3..6..9..25..48..84..158..solved at 175
0..0..2..5..8..19..37..63..117..solved at 165
0..0..2..solved at 6
Warning: inventing type variables
0..0..1..2..3..4..9..22..35..56..81..solved at 94
0..0..1..solved at 4
0..0..2..9..16..26..59..solved at 68
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..1..5..15..solved at 22
0..0..2..6..22..76..261..solved at 597
0..0..1..2..7..13..26..42..67..97..161..234..375..537..790..1087..1727..2450..solved at 2485
Warning: inventing type variables
0..0..2..5..10..21..39..63..93..149..232..400..714..1313..2437..solved at 3778
0..0..0..solved at 3
Warning: inventing type variables
0..0..2..6..15..30..77..142..253..408..645..946..1535..2256..3565..5301..8800..12859..solved at 12962
0..0..2..5..10..25..47..75..111..180..279..473..834..1570..2960..5933..11269..solved at 19226
Warning: inventing type variables
0..0..1..2..5..9..15..23..31..39..57..75..103..solved at 139
0..0..1..2..6..11..19..34..49..70..117..164..237..386..553..836..1213..1681..2277..solved at 2734
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..1..solved at 5
0..0..1..2..4..9..15..solved at 21
0..0..solved at 2
0..0..1..2..5..9..15..26..38..52..75..98..130..solved at 171
0..0..solved at 2
0..0..1..2..5..11..19..solved at 26
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..1..3..solved at 7
0..0..solved at 2
0..0..1..4..10..25..solved at 41
0..0..1..solved at 4
Warning: inventing type variables
Warning: inventing type variables
0..0..2..4..10..18..30..solved at 46
0..0..2..4..8..16..28..59..103..173..solved at 214
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..2..solved at 6
0..0..0..1..2..3..8..solved at 16
0..0..0..0..solved at 4
0..0..2..4..solved at 8
0..0..1..2..7..14..21..solved at 28
0..0..1..4..13..29..64..122..204..solved at 247
0..0..1..7..18..38..78..147..solved at 161
0..0..1..2..6..12..28..48..72..100..147..195..316..458..652..894..1207..1592..2128..2732..3491..4404..5471..6812..8440..10222..12256..14610..17294..solved at 19757
Warning: inventing type variables
File "/build/hol-light-20190729/iterate.ml", line 2328, characters 6-27:
2328 | let [pth_0; pth_1; pth_2] = (CONJUNCTS o prove)
^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_|_::_::[]|_::[]|[])
Warning: inventing type variables
0..0..1..solved at 5
0..0..1..3..5..10..19..31..60..103..157..249..361..504..748..1123..1718..2921..solved at 3656
Warning: inventing type variables
0..0..1..3..7..16..35..68..116..212..392..759..solved at 1033
0..0..solved at 2
0..0..solved at 2
0..0..1..3..8..19..39..solved at 69
0..0..solved at 2
0..0..1..5..20..solved at 25
0..0..solved at 2
0..0..2..8..27..solved at 33
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
File "iterate.ml" already loaded
0..0..1..2..5..9..15..solved at 32
0..0..2..solved at 6
0..0..1..2..5..11..solved at 17
0..0..2..4..10..19..solved at 25
0..0..1..solved at 4
0..0..2..solved at 6
0..0..0..1..2..3..5..7..9..solved at 16
0..0..1..2..5..9..15..30..47..76..solved at 127
0..0..1..solved at 4
0..0..1..solved at 4
0..0..0..1..4..solved at 9
0..0..1..2..5..9..15..30..47..76..solved at 124
0..0..1..2..5..9..15..22..solved at 36
0..0..solved at 2
0..0..solved at 2
0..0..1..2..6..10..solved at 16
Warning: inventing type variables
0..0..solved at 2
0..0..1..2..6..12..27..solved at 44
0..0..1..2..5..9..15..solved at 30
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..1..2..5..9..solved at 16
0..0..1..2..5..9..solved at 16
Warning: inventing type variables
0..0..0..0..4..9..18..30..solved at 42
0..0..0..0..0..4..10..16..26..36..46..64..82..100..131..162..193..solved at 219
0..0..0..1..2..3..5..7..9..solved at 16
0..0..1..2..5..9..15..40..67..116..solved at 201
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..1..2..6..12..27..48..solved at 81
Warning: inventing type variables
0..0..solved at 2
0..0..1..2..solved at 6
Warning: inventing type variables
0..0..1..2..8..15..solved at 40
0..0..solved at 2
0..0..0..1..2..3..5..7..9..solved at 16
0..0..1..3..5..10..19..32..60..solved at 97
0..0..1..3..5..10..18..28..52..solved at 83
0..0..2..5..8..17..31..47..86..solved at 135
0..0..1..3..5..10..18..28..51..solved at 81
0..0..2..5..8..17..31..47..87..solved at 133
0..0..2..5..8..17..31..49..92..solved at 144
0..0..3..7..11..24..43..62..111..solved at 167
0..0..1..2..5..9..15..40..67..116..solved at 198
0..0..2..4..8..16..29..65..127..215..solved at 297
0..0..2..4..8..16..31..73..144..245..solved at 327
0..0..3..6..11..23..45..104..216..372..solved at 528
0..0..2..4..8..16..29..65..128..217..solved at 299
0..0..3..6..11..23..43..96..200..344..solved at 500
0..0..3..6..11..23..43..90..185..310..solved at 396
0..0..4..8..14..30..57..127..269..465..solved at 707
0..0..2..4..8..16..30..69..136..231..solved at 313
0..0..3..6..11..23..42..92..192..330..solved at 486
0..0..3..6..11..23..44..94..193..324..solved at 410
0..0..4..8..14..30..56..123..261..451..solved at 693
0..0..3..6..11..23..42..86..177..296..solved at 382
0..0..4..8..14..30..54..115..245..423..solved at 665
0..0..4..8..14..30..54..103..214..353..solved at 447
0..0..5..10..17..37..66..138..294..508..solved at 848
0..0..2..4..8..16..30..69..135..229..solved at 311
0..0..3..6..11..23..42..92..189..324..solved at 480
0..0..3..6..11..23..44..94..194..326..solved at 412
0..0..4..8..14..30..56..123..260..449..solved at 691
0..0..3..6..11..23..44..94..194..326..solved at 412
0..0..4..8..14..30..56..123..260..449..solved at 691
0..0..4..8..14..30..56..111..233..387..solved at 481
0..0..5..10..17..37..68..146..311..538..solved at 878
0..0..3..6..11..23..45..98..202..340..solved at 426
0..0..4..8..14..30..55..119..252..435..solved at 677
0..0..4..8..14..30..57..115..241..401..solved at 495
0..0..5..10..17..37..67..142..303..524..solved at 864
0..0..4..8..14..30..57..115..241..401..solved at 495
0..0..5..10..17..37..67..142..303..524..solved at 864
0..0..5..10..17..37..67..124..260..426..solved at 532
0..0..6..12..20..44..77..157..334..577..solved at 1027
0..0..2..4..8..16..29..65..126..213..solved at 295
0..0..3..6..11..23..43..96..198..340..solved at 465
0..0..3..6..11..23..43..90..185..310..solved at 395
0..0..4..8..14..30..57..127..269..465..solved at 673
0..0..3..6..11..23..43..90..185..310..solved at 395
0..0..4..8..14..30..57..127..269..465..solved at 673
0..0..4..8..14..30..55..107..224..371..solved at 463
0..0..5..10..17..37..69..150..320..554..solved at 857
0..0..3..6..11..23..44..94..193..324..solved at 409
0..0..4..8..14..30..56..123..261..451..solved at 659
0..0..4..8..14..30..56..111..232..385..solved at 477
0..0..5..10..17..37..68..146..312..540..solved at 843
0..0..4..8..14..30..56..111..232..385..solved at 477
0..0..5..10..17..37..68..146..312..540..solved at 843
0..0..5..10..17..37..66..120..251..410..solved at 513
0..0..6..12..20..44..78..161..343..593..solved at 1003
0..0..3..6..11..23..42..86..176..294..solved at 379
0..0..4..8..14..30..54..115..242..417..solved at 625
0..0..4..8..14..30..54..103..217..359..solved at 451
0..0..5..10..17..37..66..138..295..510..solved at 813
0..0..4..8..14..30..56..111..233..387..solved at 479
0..0..5..10..17..37..68..146..311..538..solved at 841
0..0..5..10..17..37..66..120..254..416..solved at 519
0..0..6..12..20..44..78..161..344..595..solved at 1005
0..0..4..8..14..30..57..115..241..401..solved at 493
0..0..5..10..17..37..67..142..303..524..solved at 827
0..0..5..10..17..37..67..124..262..430..solved at 533
0..0..6..12..20..44..77..157..336..581..solved at 991
0..0..5..10..17..37..69..132..278..458..solved at 561
0..0..6..12..20..44..79..165..352..609..solved at 1019
0..0..6..12..20..44..77..133..279..451..solved at 569
0..0..7..14..23..51..87..172..365..630..solved at 1159
0..0..1..8..31..110..474..1716..solved at 3337
0..0..0..1..2..3..5..7..9..solved at 16
0..0..1..2..5..9..15..40..67..116..solved at 201
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
File "/build/hol-light-20190729/cart.ml", lines 429-434, characters 6-18:
429 | ......let _,(sty::_) = dest_type uty in
430 | let th = calc_dimindex sty in
431 | let svar = mk_var("s",uty)
432 | and ntm = rand(concl th) in
433 | let pth = INST [tm,svar;ntm,nvar] (INST_TYPE [sty,aty] pth_num) in
434 | EQ_MP pth th
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_, [])
File "/build/hol-light-20190729/cart.ml", lines 405-435, characters 2-34:
405 | ..let [pth_num;pth0;pth1;pth_one] = (CONJUNCTS o prove)
406 | (`(dimindex(:A) = n <=> dimindex(s:A->bool) = NUMERAL n) /\
407 | (dimindex(:A) = n <=> dimindex(:A tybit0) = BIT0 n) /\
408 | (dimindex(:A) = n <=> dimindex(:A tybit1) = BIT1 n) /\
409 | dimindex(:1) = BIT1 _0`,
...
432 | and ntm = rand(concl th) in
433 | let pth = INST [tm,svar;ntm,nvar] (INST_TYPE [sty,aty] pth_num) in
434 | EQ_MP pth th
435 | | _ -> failwith "DIMINDEX_CONV"..
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_::_|_::_::_::[]|_::_::[]|_::[]|[])
0..0..solved at 2
0..0..1..2..5..9..15..solved at 22
0..0..solved at 2
0..0..3..solved at 6
0..0..3..solved at 7
0..0..solved at 3
0..0..solved at 3
0..0..solved at 2
0..0..2..4..7..19..solved at 33
0..0..1..2..3..10..solved at 17
0..0..2..4..7..19..solved at 33
0..0..1..2..3..10..solved at 16
0..0..3..6..17..36..64..solved at 95
0..0..2..4..13..27..47..solved at 60
0..0..1..2..6..12..27..solved at 44
0..0..solved at 2
0..0..1..3..8..14..solved at 20
0..0..1..3..8..13..solved at 19
Warning: inventing type variables
0..0..solved at 2
0..0..0..0..solved at 4
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..0..0..solved at 4
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..1..solved at 4
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..2..solved at 5
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..2..solved at 5
0..0..solved at 3
0..0..2..solved at 6
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 4
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..2..solved at 5
0..0..solved at 3
0..0..2..solved at 6
0..0..solved at 3
0..0..2..solved at 5
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..2..solved at 5
0..0..solved at 3
0..0..2..solved at 6
0..0..solved at 3
0..0..2..solved at 5
0..0..solved at 3
0..0..2..solved at 6
0..0..solved at 3
0..0..2..solved at 5
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..2..solved at 5
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..solved at 4
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..solved at 4
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..solved at 4
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..2..5..8..solved at 16
0..0..0..0..solved at 4
0..0..0..0..solved at 4
0..0..solved at 2
0..0..0..0..solved at 4
0..0..solved at 2
0..0..solved at 2
0..0..0..solved at 3
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..0..0..0..solved at 5
0..0..0..solved at 3
0..0..0..solved at 3
0..0..0..0..solved at 4
0..0..solved at 2
0..0..0..solved at 3
0..0..0..0..solved at 4
0..0..0..solved at 3
0..0..solved at 2
Warning: inventing type variables
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..2..solved at 6
0..0..1..2..solved at 6
0..0..solved at 2
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..1..solved at 4
0..0..solved at 2
0..0..1..solved at 4
0..0..1..solved at 4
File "cart.ml" already loaded
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..0..0..1..9..solved at 20
0..0..0..0..3..12..solved at 27
0..0..1..2..6..16..solved at 31
0..0..solved at 2
0..0..1..2..10..23..45..73..109..150..237..341..solved at 482
0..0..2..7..17..57..111..252..solved at 259
0..0..1..2..5..9..15..24..33..44..67..90..125..186..247..334..524..solved at 604
Warning: inventing type variables
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 3
0..0..solved at 3
0..0..solved at 4
0..0..solved at 5
Warning: inventing type variables
0..0..1..3..solved at 7
0..0..1..2..6..11..19..28..37..46..73..100..145..212..279..368..509..650..841..1124..1407..1782..2305..2828..3499..solved at 4403
0..0..1..2..6..12..25..47..84..141..245..solved at 353
0..0..1..2..3..7..35..80..139..252..387..solved at 519
0..0..1..2..3..7..35..80..139..252..387..solved at 463
0..0..1..2..6..11..19..29..39..50..91..141..235..375..577..845..1399..solved at 1533
Warning: inventing type variables
Warning: inventing type variables
0..0..1..2..6..12..24..45..76..125..208..solved at 288
0..0..2..4..8..16..28..44..69..101..151..223..solved at 286
0..0..2..4..8..16..28..44..69..100..149..220..309..441..solved at 521
0..0..solved at 2
Warning: inventing type variables
0..0..1..2..6..11..19..38..65..106..192..292..436..solved at 553
0..0..2..4..9..18..52..121..210..359..620..solved at 701
0..0..2..4..9..18..52..121..210..359..620..solved at 878
0..0..3..6..12..25..83..212..381..638..1118..1786..2598..solved at 2715
Warning: inventing type variables
0..0..1..2..7..13..27..43..69..98..153..212..305..432..589..787..1065..1365..1753..2218..2731..3327..4085..4879..5831..solved at 6125
0..0..1..2..7..13..27..43..69..98..153..212..305..432..589..787..1063..1361..1745..2206..2715..3307..4060..4849..5795..6839..7919..9094..10526..11984..13723..solved at 14089
0..0..1..2..7..13..27..43..69..98..153..212..305..410..545..699..915..1153..1461..1852..2291..2819..3481..4179..5007..5941..6911..7984..9353..10748..12463..14302..16229..18272..20734..23204..26101..solved at 26928
0..0..1..2..7..13..27..43..69..98..153..212..305..410..545..699..915..1153..1461..1852..2291..2819..3479..4175..4999..5929..6895..7964..9326..10714..12419..14242..16153..18174..20613..23060..25933..29025..32229..35676..39609..43606..48073..solved at 49267
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..1..2..7..19..42..78..137..solved at 187
0..0..1..2..7..19..42..78..137..solved at 187
0..0..1..2..3..7..15..33..92..182..286..491..717..1000..1344..solved at 1660
0..0..1..2..3..7..15..33..92..182..286..491..717..1000..1344..solved at 1547
0..0..1..2..7..13..26..42..66..109..184..282..450..645..906..1214..1585..solved at 1922
0..0..1..2..7..13..26..42..66..109..184..282..450..645..906..1214..1585..solved at 1922
0..0..1..2..6..12..25..41..68..113..197..307..500..726..1041..1410..1881..solved at 2329
0..0..1..2..6..12..25..41..68..113..197..307..500..726..1041..1410..1881..solved at 2329
Warning: inventing type variables
0..0..solved at 2
Warning: inventing type variables
0..0..1..2..7..19..42..78..137..solved at 187
0..0..1..2..3..7..13..23..41..70..112..191..solved at 250
Warning: inventing type variables
0..0..1..2..7..19..42..78..137..solved at 187
0..0..2..4..14..35..68..solved at 84
0..0..2..4..14..35..68..solved at 104
Warning: inventing type variables
0..0..1..2..solved at 6
0..0..1..2..7..19..42..78..140..solved at 193
0..0..2..4..16..39..78..solved at 101
0..0..2..4..16..39..78..solved at 121
0..0..2..4..12..33..80..solved at 109
0..0..1..2..3..7..28..58..93..156..224..320..452..612..798..1098..1416..1822..2337..2900..3583..solved at 4191
0..0..2..4..12..33..80..solved at 89
0..0..1..2..3..7..28..58..93..156..224..320..452..612..798..1098..1416..1822..2337..2900..3583..solved at 4521
0..0..1..2..9..26..54..solved at 83
0..0..1..2..3..7..20..41..67..110..157..227..331..463..620..867..1133..1468..1887..2352..2941..solved at 3821
0..0..1..2..9..26..54..solved at 63
0..0..1..2..3..7..20..41..67..110..157..227..331..463..620..867..1133..1468..1887..2352..2941..solved at 3463
0..0..1..2..solved at 6
0..0..2..4..solved at 9
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 4
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 4
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
0..0..solved at 4
0..0..solved at 3
0..0..solved at 2
0..0..solved at 2
0..0..solved at 6
0..0..solved at 5
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..0..solved at 3
0..0..1..2..6..12..25..solved at 45
0..0..1..2..3..10..solved at 17
0..0..1..2..9..26..53..solved at 82
0..0..solved at 2
0..0..1..2..9..26..53..solved at 62
0..0..solved at 2
0..0..1..2..5..9..15..22..29..36..67..104..175..273..solved at 350
0..0..0..solved at 3
0..0..0..0..solved at 4
0..0..1..2..6..12..25..41..67..solved at 102
0..0..1..2..3..7..17..30..46..70..97..140..solved at 190
0..0..1..2..9..26..53..solved at 82
0..0..0..solved at 3
0..0..1..2..9..26..53..solved at 62
0..0..0..solved at 3
0..0..1..2..5..9..15..22..29..36..53..70..97..161..232..370..554..815..1134..1579..2071..2741..3531..4571..5783..7374..solved at 8357
Warning: inventing type variables
0..0..solved at 2
0..0..1..3..11..33..69..solved at 111
0..0..1..3..11..33..69..solved at 89
0..0..1..4..13..solved at 18
0..0..1..4..13..solved at 19
0..0..1..4..13..solved at 19
0..0..1..2..solved at 6
0..0..1..3..11..31..61..114..201..302..473..solved at 633
0..0..1..3..11..31..61..114..201..302..473..solved at 562
0..0..1..4..12..27..55..116..196..solved at 236
0..0..1..4..12..27..55..108..178..solved at 219
0..0..2..6..19..50..101..solved at 143
0..0..2..6..19..50..101..solved at 121
0..0..2..7..21..solved at 26
0..0..2..7..21..solved at 27
0..0..1..2..5..11..19..32..solved at 51
0..0..2..5..solved at 9
Warning: inventing type variables
0..0..1..6..11..28..59..115..212..391..solved at 471
Warning: inventing type variables
0..0..1..3..solved at 9
0..0..1..solved at 4
0..0..1..3..solved at 12
0..0..solved at 2
0..0..1..solved at 5
0..0..1..3..solved at 7
0..0..1..solved at 4
0..0..1..3..solved at 8
0..0..3..7..solved at 12
0..0..3..7..solved at 14
0..0..3..8..solved at 17
0..0..3..7..solved at 15
0..0..3..solved at 7
0..0..3..solved at 8
0..0..3..solved at 6
0..0..3..solved at 8
0..0..3..7..solved at 12
0..0..3..7..solved at 14
0..0..3..8..solved at 17
0..0..2..5..solved at 14
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
0..0..solved at 3
Warning: inventing type variables
Warning: inventing type variables
0..0..1..2..5..10..17..solved at 26
Warning: inventing type variables
Warning: inventing type variables
File "/build/hol-light-20190729/define.ml", line 500, characters 8-29:
500 | and [simp1; simp2; simp3] = map MATCH_MP (CONJUNCTS
^^^^^^^^^^^^^^^^^^^^^
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
(_::_::_::_::_|_::_::[]|_::[]|[])
File "/build/hol-light-20190729/define.ml", lines 726-728, characters 8-50:
726 | ........match l with
727 | [v] -> REFL t
728 | | v::vs -> rule(BINDER_CONV (depair vs) t)...
Warning 8: this pattern-matching is not exhaustive.
Here is an example of a case that is not matched:
[]
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 2
Warning: inventing type variables
Warning: inventing type variables
0..0..0..solved at 3
File "define.ml" already loaded
File "/build/hol-light-20190729/help.ml", line 67, characters 24-40:
67 | (edit_distance (String.uppercase s) (String.uppercase s')) /.
^^^^^^^^^^^^^^^^
Alert deprecated: Stdlib.String.uppercase
Use String.uppercase_ascii instead.
File "/build/hol-light-20190729/help.ml", line 67, characters 45-61:
67 | (edit_distance (String.uppercase s) (String.uppercase s')) /.
^^^^^^^^^^^^^^^^
Alert deprecated: Stdlib.String.uppercase
Use String.uppercase_ascii instead.
Camlp5 parsing version 7.13
# File "help.ml" already loaded
- : unit = ()
Warning: inventing type variables
val nproduct : thm = |- nproduct = iterate (*)
Warning: inventing type variables
val NPRODUCT_CLAUSES : thm =
|- (!f. nproduct {} f = 1) /\
(!x f s.
FINITE s
==> nproduct (x INSERT s) f =
(if x IN s then nproduct s f else f x * nproduct s f))
Warning: inventing type variables
val NPRODUCT_SUPPORT : thm =
|- !f s. nproduct (support (*) f s) f = nproduct s f
Warning: inventing type variables
val NPRODUCT_UNION : thm =
|- !f s t.
FINITE s /\ FINITE t /\ DISJOINT s t
==> nproduct (s UNION t) f = nproduct s f * nproduct t f
Warning: inventing type variables
val NPRODUCT_IMAGE : thm =
|- !f g s.
(!x y. x IN s /\ y IN s /\ f x = f y ==> x = y)
==> nproduct (IMAGE f s) g = nproduct s (g o f)
val NPRODUCT_ADD_SPLIT : thm =
|- !f m n p.
m <= n + 1
==> nproduct (m..n + p) f =
nproduct (m..n) f * nproduct (n + 1..n + p) f
Warning: inventing type variables
val NPRODUCT_POS_LT : thm =
|- !f s. FINITE s /\ (!x. x IN s ==> 0 < f x) ==> 0 < nproduct s f
val NPRODUCT_POS_LT_NUMSEG : thm =
|- !f m n. (!x. m <= x /\ x <= n ==> 0 < f x) ==> 0 < nproduct (m..n) f
val NPRODUCT_OFFSET : thm =
|- !f m p. nproduct (m + p..n + p) f = nproduct (m..n) (\i. f (i + p))
Warning: inventing type variables
val NPRODUCT_SING : thm = |- !f x. nproduct {x} f = f x
val NPRODUCT_SING_NUMSEG : thm = |- !f n. nproduct (n..n) f = f n
val NPRODUCT_CLAUSES_NUMSEG : thm =
|- (!m. nproduct (m..0) f = (if m = 0 then f 0 else 1)) /\
(!m n.
nproduct (m..SUC n) f =
(if m <= SUC n
then nproduct (m..n) f * f (SUC n)
else nproduct (m..n) f))
Warning: inventing type variables
val NPRODUCT_EQ : thm =
|- !f g s. (!x. x IN s ==> f x = g x) ==> nproduct s f = nproduct s g
0..0..1..4..13..29..64..122..204..solved at 247
val NPRODUCT_EQ_NUMSEG : thm =
|- !f g m n.
(!i. m <= i /\ i <= n ==> f i = g i)
==> nproduct (m..n) f = nproduct (m..n) g
Warning: inventing type variables
0..0..1..solved at 5
0..0..1..solved at 5
0..0..solved at 2
0..0..2..solved at 7
0..0..2..solved at 8
0..0..2..solved at 7
0..0..solved at 2
0..0..3..solved at 9
val NPRODUCT_EQ_0 : thm =
|- !f s. FINITE s ==> (nproduct s f = 0 <=> (?x. x IN s /\ f x = 0))
val NPRODUCT_EQ_0_NUMSEG : thm =
|- !f m n. nproduct (m..n) f = 0 <=> (?x. m <= x /\ x <= n /\ f x = 0)
Warning: inventing type variables
0..0..solved at 2
0..0..3..solved at 6
0..0..2..4..7..solved at 17
val NPRODUCT_LE : thm =
|- !f s.
FINITE s /\ (!x. x IN s ==> 0 <= f x /\ f x <= g x)
==> nproduct s f <= nproduct s g
val NPRODUCT_LE_NUMSEG : thm =
|- !f m n.
(!i. m <= i /\ i <= n ==> 0 <= f i /\ f i <= g i)
==> nproduct (m..n) f <= nproduct (m..n) g
val NPRODUCT_EQ_1 : thm =
|- !f s. (!x. x IN s ==> f x = 1) ==> nproduct s f = 1
val NPRODUCT_EQ_1_NUMSEG : thm =
|- !f m n. (!i. m <= i /\ i <= n ==> f i = 1) ==> nproduct (m..n) f = 1
Warning: inventing type variables
val NPRODUCT_MUL_GEN : thm =
|- !f g s.
FINITE {x | x IN s /\ ~(f x = 1)} /\
FINITE {x | x IN s /\ ~(g x = 1)}
==> nproduct s (\x. f x * g x) = nproduct s f * nproduct s g
Warning: inventing type variables
val NPRODUCT_MUL : thm =
|- !f g s.
FINITE s
==> nproduct s (\x. f x * g x) = nproduct s f * nproduct s g
val NPRODUCT_MUL_NUMSEG : thm =
|- !f g m n.
nproduct (m..n) (\x. f x * g x) =
nproduct (m..n) f * nproduct (m..n) g
Warning: inventing type variables
val NPRODUCT_CONST : thm =
|- !c s. FINITE s ==> nproduct s (\x. c) = c EXP CARD s
val NPRODUCT_CONST_NUMSEG : thm =
|- !c m n. nproduct (m..n) (\x. c) = c EXP ((n + 1) - m)
val NPRODUCT_CONST_NUMSEG_1 : thm =
|- !c n. nproduct (1..n) (\x. c) = c EXP n
Warning: inventing type variables
val NPRODUCT_ONE : thm = |- !s. nproduct s (\n. 1) = 1
val NPRODUCT_CLOSED : thm =
|- !P f s.
P 1 /\ (!x y. P x /\ P y ==> P (x * y)) /\ (!a. a IN s ==> P (f a))
==> P (nproduct s f)
val NPRODUCT_CLAUSES_LEFT : thm =
|- !f m n. m <= n ==> nproduct (m..n) f = f m * nproduct (m + 1..n) f
val NPRODUCT_CLAUSES_RIGHT : thm =
|- !f m n.
0 < n /\ m <= n ==> nproduct (m..n) f = nproduct (m..n - 1) f * f n
val NPRODUCT_SUPERSET : thm =
|- !f u v.
u SUBSET v /\ (!x. x IN v /\ ~(x IN u) ==> f x = 1)
==> nproduct v f = nproduct u f
val NPRODUCT_UNIV : thm =
|- !f s. support (*) f (:A) SUBSET s ==> nproduct s f = nproduct (:A) f
val NPRODUCT_PAIR : thm =
|- !f m n.
nproduct (2 * m..2 * n + 1) f =
nproduct (m..n) (\i. f (2 * i) * f (2 * i + 1))
val NPRODUCT_REFLECT : thm =
|- !x m n.
nproduct (m..n) x =
(if n < m then 1 else nproduct (0..n - m) (\i. x (n - i)))
Warning: inventing type variables
val NPRODUCT_DELETE : thm =
|- !f s a.
FINITE s /\ a IN s ==> f a * nproduct (s DELETE a) f = nproduct s f
val NPRODUCT_FACT : thm = |- !n. nproduct (1..n) (\m. m) = FACT n
Warning: inventing type variables
val NPRODUCT_DELTA : thm =
|- !s a.
nproduct s (\x. if x = a then b else 1) = (if a IN s then b else 1)
Warning: inventing type variables
0..0..solved at 2
0..0..solved at 3
0..0..solved at 2
0..0..2..4..7..19..solved at 33
0..0..1..2..3..10..solved at 17
0..0..2..4..7..19..solved at 33
0..0..1..2..3..10..solved at 16
0..0..3..6..17..36..64..solved at 95
0..0..2..4..13..27..47..solved at 60
0..0..solved at 3
0..0..solved at 2
val HAS_SIZE_CART : thm =
|- !P m.
(!i. 1 <= i /\ i <= dimindex (:N) ==> {x | P i x} HAS_SIZE m i)
==> {v | !i. 1 <= i /\ i <= dimindex (:N) ==> P i (v$i)} HAS_SIZE
nproduct (1..dimindex (:N)) m
Warning: inventing type variables
0..0..1..solved at 4
val CARD_CART : thm =
|- !P. (!i. 1 <= i /\ i <= dimindex (:N) ==> FINITE {x | P i x})
==> CARD {v | !i. 1 <= i /\ i <= dimindex (:N) ==> P i (v$i)} =
nproduct (1..dimindex (:N)) (\i. CARD {x | P i x})
Warning: inventing type variables
- : unit = ()
- : unit = ()
Warning: inventing type variables
val product : thm = |- product = iterate (*)
Warning: inventing type variables
val PRODUCT_CLAUSES : thm =
|- (!f. product {} f = &1) /\
(!x f s.
FINITE s
==> product (x INSERT s) f =
(if x IN s then product s f else f x * product s f))
Warning: inventing type variables
val PRODUCT_SUPPORT : thm =
|- !f s. product (support (*) f s) f = product s f
Warning: inventing type variables
val PRODUCT_UNION : thm =
|- !f s t.
FINITE s /\ FINITE t /\ DISJOINT s t
==> product (s UNION t) f = product s f * product t f
Warning: inventing type variables
val PRODUCT_IMAGE : thm =
|- !f g s.
(!x y. x IN s /\ y IN s /\ f x = f y ==> x = y)
==> product (IMAGE f s) g = product s (g o f)
val PRODUCT_ADD_SPLIT : thm =
|- !f m n p.
m <= n + 1
==> product (m..n + p) f =
product (m..n) f * product (n + 1..n + p) f
Warning: inventing type variables
val PRODUCT_POS_LE : thm =
|- !f s. FINITE s /\ (!x. x IN s ==> &0 <= f x) ==> &0 <= product s f
val PRODUCT_POS_LE_NUMSEG : thm =
|- !f m n. (!x. m <= x /\ x <= n ==> &0 <= f x) ==> &0 <= product (m..n) f
Warning: inventing type variables
val PRODUCT_POS_LT : thm =
|- !f s. FINITE s /\ (!x. x IN s ==> &0 < f x) ==> &0 < product s f
val PRODUCT_POS_LT_NUMSEG : thm =
|- !f m n. (!x. m <= x /\ x <= n ==> &0 < f x) ==> &0 < product (m..n) f
val PRODUCT_OFFSET : thm =
|- !f m p. product (m + p..n + p) f = product (m..n) (\i. f (i + p))
Warning: inventing type variables
val PRODUCT_SING : thm = |- !f x. product {x} f = f x
val PRODUCT_SING_NUMSEG : thm = |- !f n. product (n..n) f = f n
val PRODUCT_CLAUSES_NUMSEG : thm =
|- (!m. product (m..0) f = (if m = 0 then f 0 else &1)) /\
(!m n.
product (m..SUC n) f =
(if m <= SUC n
then product (m..n) f * f (SUC n)
else product (m..n) f))
Warning: inventing type variables
val PRODUCT_EQ : thm =
|- !f g s. (!x. x IN s ==> f x = g x) ==> product s f = product s g
0..0..1..4..13..29..64..122..204..solved at 247
val PRODUCT_EQ_NUMSEG : thm =
|- !f g m n.
(!i. m <= i /\ i <= n ==> f i = g i)
==> product (m..n) f = product (m..n) g
Warning: inventing type variables
0..0..1..solved at 5
0..0..1..solved at 5
0..0..solved at 2
0..0..2..solved at 7
0..0..2..solved at 8
0..0..2..solved at 7
0..0..solved at 2
0..0..3..solved at 9
val PRODUCT_EQ_0 : thm =
|- !f s. FINITE s ==> (product s f = &0 <=> (?x. x IN s /\ f x = &0))
val PRODUCT_EQ_0_NUMSEG : thm =
|- !f m n. product (m..n) f = &0 <=> (?x. m <= x /\ x <= n /\ f x = &0)
Warning: inventing type variables
0..0..3..solved at 6
0..0..3..solved at 6
0..0..2..4..6..14..26..40..57..77..98..142..190..245..338..solved at 450
val PRODUCT_LE : thm =
|- !f s.
FINITE s /\ (!x. x IN s ==> &0 <= f x /\ f x <= g x)
==> product s f <= product s g
val PRODUCT_LE_NUMSEG : thm =
|- !f m n.
(!i. m <= i /\ i <= n ==> &0 <= f i /\ f i <= g i)
==> product (m..n) f <= product (m..n) g
val PRODUCT_EQ_1 : thm =
|- !f s. (!x. x IN s ==> f x = &1) ==> product s f = &1
val PRODUCT_EQ_1_NUMSEG : thm =
|- !f m n. (!i. m <= i /\ i <= n ==> f i = &1) ==> product (m..n) f = &1
Warning: inventing type variables
val PRODUCT_MUL_GEN : thm =
|- !f g s.
FINITE {x | x IN s /\ ~(f x = &1)} /\
FINITE {x | x IN s /\ ~(g x = &1)}
==> product s (\x. f x * g x) = product s f * product s g
Warning: inventing type variables
val PRODUCT_MUL : thm =
|- !f g s.
FINITE s ==> product s (\x. f x * g x) = product s f * product s g
val PRODUCT_MUL_NUMSEG : thm =
|- !f g m n.
product (m..n) (\x. f x * g x) = product (m..n) f * product (m..n) g
Warning: inventing type variables
val PRODUCT_CONST : thm =
|- !c s. FINITE s ==> product s (\x. c) = c pow CARD s
val PRODUCT_CONST_NUMSEG : thm =
|- !c m n. product (m..n) (\x. c) = c pow ((n + 1) - m)
val PRODUCT_CONST_NUMSEG_1 : thm = |- !c n. product (1..n) (\x. c) = c pow n
val PRODUCT_NEG : thm =
|- !f s.
FINITE s ==> product s (\i. --f i) = -- &1 pow CARD s * product s f
val PRODUCT_NEG_NUMSEG : thm =
|- !f m n.
product (m..n) (\i. --f i) =
-- &1 pow ((n + 1) - m) * product (m..n) f
val PRODUCT_NEG_NUMSEG_1 : thm =
|- !f n. product (1..n) (\i. --f i) = -- &1 pow n * product (1..n) f
Warning: inventing type variables
val PRODUCT_INV : thm =
|- !f s. FINITE s ==> product s (\x. inv (f x)) = inv (product s f)
Warning: inventing type variables
val PRODUCT_DIV : thm =
|- !f g s.
FINITE s ==> product s (\x. f x / g x) = product s f / product s g
val PRODUCT_DIV_NUMSEG : thm =
|- !f g m n.
product (m..n) (\x. f x / g x) = product (m..n) f / product (m..n) g
Warning: inventing type variables
val PRODUCT_ONE : thm = |- !s. product s (\n. &1) = &1
Warning: inventing type variables
val PRODUCT_LE_1 : thm =
|- !f s.
FINITE s /\ (!x. x IN s ==> &0 <= f x /\ f x <= &1)
==> product s f <= &1
Warning: inventing type variables
val PRODUCT_ABS : thm =
|- !f s. FINITE s ==> product s (\x. abs (f x)) = abs (product s f)
val PRODUCT_CLOSED : thm =
|- !P f s.
P (&1) /\
(!x y. P x /\ P y ==> P (x * y)) /\
(!a. a IN s ==> P (f a))
==> P (product s f)
val PRODUCT_CLAUSES_LEFT : thm =
|- !f m n. m <= n ==> product (m..n) f = f m * product (m + 1..n) f
val PRODUCT_CLAUSES_RIGHT : thm =
|- !f m n.
0 < n /\ m <= n ==> product (m..n) f = product (m..n - 1) f * f n
val REAL_OF_NUM_NPRODUCT : thm =
|- !f s. FINITE s ==> &(nproduct s f) = product s (\x. &(f x))
val PRODUCT_SUPERSET : thm =
|- !f u v.
u SUBSET v /\ (!x. x IN v /\ ~(x IN u) ==> f x = &1)
==> product v f = product u f
val PRODUCT_UNIV : thm =
|- !f s. support (*) f (:A) SUBSET s ==> product s f = product (:A) f
val PRODUCT_PAIR : thm =
|- !f m n.
product (2 * m..2 * n + 1) f =
product (m..n) (\i. f (2 * i) * f (2 * i + 1))
val PRODUCT_REFLECT : thm =
|- !x m n.
product (m..n) x =
(if n < m then &1 else product (0..n - m) (\i. x (n - i)))
Warning: inventing type variables
val PRODUCT_DELETE : thm =
|- !f s a.
FINITE s /\ a IN s ==> f a * product (s DELETE a) f = product s f
Warning: inventing type variables
val PRODUCT_DELTA : thm =
|- !s a.
product s (\x. if x = a then b else &1) = (if a IN s then b else &1)
val POLYNOMIAL_FUNCTION_PRODUCT : thm =
|- !s p.
FINITE s /\ (!i. i IN s ==> polynomial_function (\x. p x i))
==> polynomial_function (\x. product s (p x))
Warning: inventing type variables
- : unit = ()
- : unit = ()
- : unit = ()
0..0..1..2..6..10..14..solved at 20
0..0..1..2..6..10..14..solved at 22
0..0..1..2..5..10..19..30..45..72..115..188..391..solved at 648
val FORALL_2 : thm = |- !P. (!i. 1 <= i /\ i <= 2 ==> P i) <=> P 1 /\ P 2
val NUMSEG_2 : thm = |- 1..2 = {1, 2}
val AGM_2 : thm = |- !x y. x * y <= ((x + y) / &2) pow 2
val SUM_SPLIT_2 : thm =
|- sum (1..2 * n) f = sum (1..n) f + sum (n + 1..2 * n) f
val PRODUCT_SPLIT_2 : thm =
|- product (1..2 * n) f = product (1..n) f * product (n + 1..2 * n) f
0..0..1..4..11..25..51..106..solved at 153
0..0..1..4..11..solved at 21
0..0..1..5..15..37..85..209..492..solved at 962
0..0..1..4..11..25..55..120..227..404..688..1152..1863..3160..solved at 4748
val CAUCHY_INDUCT : thm =
|- !P. P 2 /\ (!n. P n ==> P (2 * n)) /\ (!n. P (n + 1) ==> P n)
==> (!n. P n)
1 basis elements and 0 critical pairs
3 basis elements and 0 critical pairs
3 basis elements and 0 critical pairs
3 basis elements and 3 critical pairs
4 basis elements and 5 critical pairs
4 basis elements and 4 critical pairs
4 basis elements and 3 critical pairs
5 basis elements and 0 critical pairs
0..0..1..2..5..solved at 10
0..0..1..solved at 4
0..0..1..2..5..solved at 10
0..0..1..2..4..solved at 9
0..0..1..solved at 4
0..0..1..2..4..6..8..11..14..17..solved at 27
val AGM : thm =
|- !n a.
1 <= n /\ (!i. 1 <= i /\ i <= n ==> &0 <= a i)
==> product (1..n) a <= (sum (1..n) a / &n) pow n
val it : unit = ()
#
make[1]: Leaving directory '/build/hol-light-20190729'
create-stamp debian/debhelper-build-stamp
dh_prep
debian/rules override_dh_auto_install
make[1]: Entering directory '/build/hol-light-20190729'
install -d debian/hol-light/usr/share/hol-light
tar --anchored --exclude-from=debian/hol-light-source.exclude -c . | \
tar -C debian/hol-light/usr/share/hol-light -x
chmod -x debian/hol-light/usr/share/hol-light/Help/HYP_TAC.doc
chmod -x debian/hol-light/usr/share/hol-light/RichterHilbertAxiomGeometry/TarskiAxiomGeometry_read.ml
chmod -x debian/hol-light/usr/share/hol-light/Multivariate/cvectors.ml
install -d debian/hol-light/usr/bin
install debian/hol-light.sh debian/hol-light/usr/bin/hol-light
make[1]: Leaving directory '/build/hol-light-20190729'
dh_ocamldoc
dh_installdocs
dh_installchangelogs
dh_installman
dh_installmenu
dh_lintian
dh_perl
dh_link
dh_strip_nondeterminism
dh_compress
dh_fixperms
debian/rules override_dh_missing
make[1]: Entering directory '/build/hol-light-20190729'
dh_missing --fail-missing
make[1]: Leaving directory '/build/hol-light-20190729'
dh_dwz
dh_strip
dh_makeshlibs
dh_shlibdeps
dh_installdeb
debian/rules override_dh_ocaml
make[1]: Entering directory '/build/hol-light-20190729'
dh_ocaml --runtime-map hol-light
W: hol-light v20190729-4 doesn't resolve dependency on unit Parsetree
W: hol-light v20190729-4 doesn't resolve dependency on unit Asttypes
W: hol-light v20190729-4 doesn't resolve dependency on unit Location
W: hol-light v20190729-4 doesn't resolve dependency on unit Warnings
W: hol-light v20190729-4 doesn't resolve dependency on unit Longident
make[1]: Leaving directory '/build/hol-light-20190729'
dh_gencontrol
dpkg-gencontrol: warning: Depends field of package hol-light: substitution variable ${shlibs:Depends} used, but is not defined
dpkg-gencontrol: warning: package hol-light: substitution variable ${ocaml:Provides} unused, but is defined
dpkg-gencontrol: warning: package hol-light: substitution variable ${perl:Depends} unused, but is defined
dh_md5sums
dh_builddeb
dpkg-deb: building package 'hol-light' in '../hol-light_20190729-4_arm64.deb'.
dpkg-genbuildinfo --build=binary
dpkg-genchanges --build=binary >../hol-light_20190729-4_arm64.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/13675 and its subdirectories
I: Current time: Tue Aug 10 02:21:41 -12 2021
I: pbuilder-time-stamp: 1628605301
Tue Aug 10 14:21:43 UTC 2021 I: 1st build successful. Starting 2nd build on remote node codethink15-arm64.debian.net.
Tue Aug 10 14:21:43 UTC 2021 I: Preparing to do remote build '2' on codethink15-arm64.debian.net.
Tue Aug 10 14:30:37 UTC 2021 I: Deleting $TMPDIR on codethink15-arm64.debian.net.
Tue Aug 10 14:30:38 UTC 2021 I: hol-light_20190729-4_arm64.changes:
Format: 1.8
Date: Wed, 12 Feb 2020 05:43:48 +0100
Source: hol-light
Binary: hol-light
Architecture: arm64
Version: 20190729-4
Distribution: unstable
Urgency: medium
Maintainer: Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
Changed-By: Stéphane Glondu <glondu@debian.org>
Description:
hol-light - HOL Light theorem prover
Changes:
hol-light (20190729-4) unstable; urgency=medium
.
* Team upload
* Fix compilation with camlp5 7.11
Checksums-Sha1:
9637e8a892e2ed40839f1acd1dcd4b793437ed8d 4933 hol-light_20190729-4_arm64.buildinfo
f6f7c8f3471986799a8ff58811331ecbaac1c344 4980936 hol-light_20190729-4_arm64.deb
Checksums-Sha256:
d752721e1756ff227fbcd4898c3dc6cb8282b4ba7cec9cabbaa05222fc5577a4 4933 hol-light_20190729-4_arm64.buildinfo
071f4e30608a59f21eb347b629125ba31283b1f4441cc4314d31046448a5de23 4980936 hol-light_20190729-4_arm64.deb
Files:
02ffc6006caf4824c095be3aeffb25f2 4933 math optional hol-light_20190729-4_arm64.buildinfo
9dca646d99dd94bd53854a7d39c28a97 4980936 math optional hol-light_20190729-4_arm64.deb
Tue Aug 10 14:30:40 UTC 2021 I: diffoscope 177 will be used to compare the two builds:
# Profiling output for: /usr/bin/diffoscope --html /srv/reproducible-results/rbuild-debian/tmp.DWgS8KhVmH/hol-light_20190729-4.diffoscope.html --text /srv/reproducible-results/rbuild-debian/tmp.DWgS8KhVmH/hol-light_20190729-4.diffoscope.txt --json /srv/reproducible-results/rbuild-debian/tmp.DWgS8KhVmH/hol-light_20190729-4.diffoscope.json --profile=- /srv/reproducible-results/rbuild-debian/tmp.DWgS8KhVmH/b1/hol-light_20190729-4_arm64.changes /srv/reproducible-results/rbuild-debian/tmp.DWgS8KhVmH/b2/hol-light_20190729-4_arm64.changes
## command (total time: 0.000s)
0.000s 1 call cmp (internal)
## has_same_content_as (total time: 0.000s)
0.000s 1 call abc.DotChangesFile
## main (total time: 0.486s)
0.486s 2 calls outputs
0.000s 1 call cleanup
## recognizes (total time: 0.110s)
0.109s 10 calls diffoscope.comparators.binary.FilesystemFile
0.000s 8 calls abc.DotChangesFile
Tue Aug 10 14:30:43 UTC 2021 I: diffoscope 177 found no differences in the changes files, and a .buildinfo file also exists.
Tue Aug 10 14:30:43 UTC 2021 I: hol-light from bullseye built successfully and reproducibly on arm64.
Tue Aug 10 14:30:44 UTC 2021 I: Submitting .buildinfo files to external archives:
Tue Aug 10 14:30:44 UTC 2021 I: Submitting 8.0K b1/hol-light_20190729-4_arm64.buildinfo.asc
Tue Aug 10 14:30:45 UTC 2021 I: Submitting 8.0K b2/hol-light_20190729-4_arm64.buildinfo.asc
Tue Aug 10 14:30:47 UTC 2021 I: Done submitting .buildinfo files to http://buildinfo.debian.net/api/submit.
Tue Aug 10 14:30:47 UTC 2021 I: Done submitting .buildinfo files.
Tue Aug 10 14:30:47 UTC 2021 I: Removing signed hol-light_20190729-4_arm64.buildinfo.asc files:
removed './b1/hol-light_20190729-4_arm64.buildinfo.asc'
removed './b2/hol-light_20190729-4_arm64.buildinfo.asc'