I: pbuilder: network access will be disabled during build I: Current time: Wed Jun 7 19:15:24 +14 2023 I: pbuilder-time-stamp: 1686114924 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/bookworm-reproducible-base.tgz] I: copying local configuration W: --override-config is not set; not updating apt.conf Read the manpage for details. I: mounting /proc filesystem I: mounting /sys filesystem I: creating /{dev,run}/shm I: mounting /dev/pts filesystem I: redirecting /dev/ptmx to /dev/pts/ptmx I: policy-rc.d already exists I: Copying source file I: copying [coq-elpi_1.16.0-2.dsc] I: copying [./coq-elpi_1.16.0.orig.tar.gz] I: copying [./coq-elpi_1.16.0-2.debian.tar.xz] I: Extracting source gpgv: Signature made Wed Jan 25 20:46:59 2023 +14 gpgv: using RSA key 812EEFD8A3FBA4ACE4DF114B04C53BD7FE030551 gpgv: issuer "jpuydt@debian.org" gpgv: Can't check signature: No public key dpkg-source: warning: cannot verify inline signature for ./coq-elpi_1.16.0-2.dsc: no acceptable signature found dpkg-source: info: extracting coq-elpi in coq-elpi-1.16.0 dpkg-source: info: unpacking coq-elpi_1.16.0.orig.tar.gz dpkg-source: info: unpacking coq-elpi_1.16.0-2.debian.tar.xz dpkg-source: info: using patch list from debian/patches/series dpkg-source: info: applying warning_69.patch dpkg-source: info: applying make_install.patch I: Not using root during the build. I: Installing the build-deps I: user script /srv/workspace/pbuilder/3117304/tmp/hooks/D01_modify_environment starting debug: Running on ionos1-amd64. I: Changing host+domainname to test build reproducibility I: Adding a custom variable just for the fun of it... I: Changing /bin/sh to bash '/bin/sh' -> '/bin/bash' lrwxrwxrwx 1 root root 9 Jun 7 19:15 /bin/sh -> /bin/bash I: Setting pbuilder2's login shell to /bin/bash I: Setting pbuilder2's GECOS to second user,second room,second work-phone,second home-phone,second other I: user script /srv/workspace/pbuilder/3117304/tmp/hooks/D01_modify_environment finished I: user script /srv/workspace/pbuilder/3117304/tmp/hooks/D02_print_environment starting I: set BASH=/bin/sh BASHOPTS=checkwinsize:cmdhist:complete_fullquote:extquote:force_fignore:globasciiranges:globskipdots:hostcomplete:interactive_comments:patsub_replacement:progcomp:promptvars:sourcepath BASH_ALIASES=() BASH_ARGC=() BASH_ARGV=() BASH_CMDS=() BASH_LINENO=([0]="12" [1]="0") BASH_LOADABLES_PATH=/usr/local/lib/bash:/usr/lib/bash:/opt/local/lib/bash:/usr/pkg/lib/bash:/opt/pkg/lib/bash:. BASH_SOURCE=([0]="/tmp/hooks/D02_print_environment" [1]="/tmp/hooks/D02_print_environment") BASH_VERSINFO=([0]="5" [1]="2" [2]="15" [3]="1" [4]="release" [5]="x86_64-pc-linux-gnu") BASH_VERSION='5.2.15(1)-release' BUILDDIR=/build BUILDUSERGECOS='second user,second room,second work-phone,second home-phone,second other' BUILDUSERNAME=pbuilder2 BUILD_ARCH=amd64 DEBIAN_FRONTEND=noninteractive DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=15 ' DIRSTACK=() DISTRIBUTION=bookworm EUID=0 FUNCNAME=([0]="Echo" [1]="main") GROUPS=() HOME=/root HOSTNAME=i-capture-the-hostname HOSTTYPE=x86_64 HOST_ARCH=amd64 IFS=' ' INVOCATION_ID=35c65fe6583f4e78b7246d297148dc99 LANG=C LANGUAGE=et_EE:et LC_ALL=C MACHTYPE=x86_64-pc-linux-gnu MAIL=/var/mail/root OPTERR=1 OPTIND=1 OSTYPE=linux-gnu PATH=/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path PBCURRENTCOMMANDLINEOPERATION=build PBUILDER_OPERATION=build PBUILDER_PKGDATADIR=/usr/share/pbuilder PBUILDER_PKGLIBDIR=/usr/lib/pbuilder PBUILDER_SYSCONFDIR=/etc PIPESTATUS=([0]="0") POSIXLY_CORRECT=y PPID=3117304 PS4='+ ' PWD=/ SHELL=/bin/bash SHELLOPTS=braceexpand:errexit:hashall:interactive-comments:posix SHLVL=3 SUDO_COMMAND='/usr/bin/timeout -k 24.1h 24h /usr/bin/ionice -c 3 /usr/bin/nice -n 11 /usr/bin/unshare --uts -- /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.ioFidaPQ/pbuilderrc_tFcT --distribution bookworm --hookdir /etc/pbuilder/rebuild-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/bookworm-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.ioFidaPQ/b2 --logfile b2/build.log --extrapackages usrmerge coq-elpi_1.16.0-2.dsc' SUDO_GID=110 SUDO_UID=105 SUDO_USER=jenkins TERM=unknown TZ=/usr/share/zoneinfo/Etc/GMT-14 UID=0 USER=root _='I: set' http_proxy=http://78.137.99.97:3128 I: uname -a Linux i-capture-the-hostname 5.10.0-23-amd64 #1 SMP Debian 5.10.179-1 (2023-05-12) x86_64 GNU/Linux I: ls -l /bin total 5632 -rwxr-xr-x 1 root root 1265648 Apr 24 11:23 bash -rwxr-xr-x 3 root root 39224 Sep 19 2022 bunzip2 -rwxr-xr-x 3 root root 39224 Sep 19 2022 bzcat lrwxrwxrwx 1 root root 6 Sep 19 2022 bzcmp -> bzdiff -rwxr-xr-x 1 root root 2225 Sep 19 2022 bzdiff lrwxrwxrwx 1 root root 6 Sep 19 2022 bzegrep -> bzgrep -rwxr-xr-x 1 root root 4893 Nov 28 2021 bzexe lrwxrwxrwx 1 root root 6 Sep 19 2022 bzfgrep -> bzgrep -rwxr-xr-x 1 root root 3775 Sep 19 2022 bzgrep -rwxr-xr-x 3 root root 39224 Sep 19 2022 bzip2 -rwxr-xr-x 1 root root 14568 Sep 19 2022 bzip2recover lrwxrwxrwx 1 root root 6 Sep 19 2022 bzless -> bzmore -rwxr-xr-x 1 root root 1297 Sep 19 2022 bzmore -rwxr-xr-x 1 root root 44016 Sep 21 2022 cat -rwxr-xr-x 1 root root 68656 Sep 21 2022 chgrp -rwxr-xr-x 1 root root 64496 Sep 21 2022 chmod -rwxr-xr-x 1 root root 72752 Sep 21 2022 chown -rwxr-xr-x 1 root root 151152 Sep 21 2022 cp -rwxr-xr-x 1 root root 125640 Jan 6 03:20 dash -rwxr-xr-x 1 root root 121904 Sep 21 2022 date -rwxr-xr-x 1 root root 89240 Sep 21 2022 dd -rwxr-xr-x 1 root root 102200 Sep 21 2022 df -rwxr-xr-x 1 root root 151344 Sep 21 2022 dir -rwxr-xr-x 1 root root 88656 Mar 24 00:02 dmesg lrwxrwxrwx 1 root root 8 Dec 20 03:33 dnsdomainname -> hostname lrwxrwxrwx 1 root root 8 Dec 20 03:33 domainname -> hostname -rwxr-xr-x 1 root root 43856 Sep 21 2022 echo -rwxr-xr-x 1 root root 41 Jan 25 04:43 egrep -rwxr-xr-x 1 root root 35664 Sep 21 2022 false -rwxr-xr-x 1 root root 41 Jan 25 04:43 fgrep -rwxr-xr-x 1 root root 85600 Mar 24 00:02 findmnt -rwsr-xr-x 1 root root 35128 Mar 23 22:35 fusermount -rwxr-xr-x 1 root root 203152 Jan 25 04:43 grep -rwxr-xr-x 2 root root 2346 Apr 10 2022 gunzip -rwxr-xr-x 1 root root 6447 Apr 10 2022 gzexe -rwxr-xr-x 1 root root 98136 Apr 10 2022 gzip -rwxr-xr-x 1 root root 22680 Dec 20 03:33 hostname -rwxr-xr-x 1 root root 72824 Sep 21 2022 ln -rwxr-xr-x 1 root root 53024 Mar 24 02:40 login -rwxr-xr-x 1 root root 151344 Sep 21 2022 ls -rwxr-xr-x 1 root root 207168 Mar 24 00:02 lsblk -rwxr-xr-x 1 root root 97552 Sep 21 2022 mkdir -rwxr-xr-x 1 root root 72912 Sep 21 2022 mknod -rwxr-xr-x 1 root root 43952 Sep 21 2022 mktemp -rwxr-xr-x 1 root root 59712 Mar 24 00:02 more -rwsr-xr-x 1 root root 59704 Mar 24 00:02 mount -rwxr-xr-x 1 root root 18744 Mar 24 00:02 mountpoint -rwxr-xr-x 1 root root 142968 Sep 21 2022 mv lrwxrwxrwx 1 root root 8 Dec 20 03:33 nisdomainname -> hostname lrwxrwxrwx 1 root root 14 Apr 3 20:25 pidof -> /sbin/killall5 -rwxr-xr-x 1 root root 43952 Sep 21 2022 pwd lrwxrwxrwx 1 root root 4 Apr 24 11:23 rbash -> bash -rwxr-xr-x 1 root root 52112 Sep 21 2022 readlink -rwxr-xr-x 1 root root 72752 Sep 21 2022 rm -rwxr-xr-x 1 root root 56240 Sep 21 2022 rmdir -rwxr-xr-x 1 root root 27560 Nov 3 2022 run-parts -rwxr-xr-x 1 root root 126424 Jan 6 09:55 sed lrwxrwxrwx 1 root root 9 Jun 7 19:15 sh -> /bin/bash -rwxr-xr-x 1 root root 43888 Sep 21 2022 sleep -rwxr-xr-x 1 root root 85008 Sep 21 2022 stty -rwsr-xr-x 1 root root 72000 Mar 24 00:02 su -rwxr-xr-x 1 root root 39824 Sep 21 2022 sync -rwxr-xr-x 1 root root 531984 Apr 7 04:25 tar -rwxr-xr-x 1 root root 14520 Nov 3 2022 tempfile -rwxr-xr-x 1 root root 109616 Sep 21 2022 touch -rwxr-xr-x 1 root root 35664 Sep 21 2022 true -rwxr-xr-x 1 root root 14568 Mar 23 22:35 ulockmgr_server -rwsr-xr-x 1 root root 35128 Mar 24 00:02 umount -rwxr-xr-x 1 root root 43888 Sep 21 2022 uname -rwxr-xr-x 2 root root 2346 Apr 10 2022 uncompress -rwxr-xr-x 1 root root 151344 Sep 21 2022 vdir -rwxr-xr-x 1 root root 72024 Mar 24 00:02 wdctl lrwxrwxrwx 1 root root 8 Dec 20 03:33 ypdomainname -> hostname -rwxr-xr-x 1 root root 1984 Apr 10 2022 zcat -rwxr-xr-x 1 root root 1678 Apr 10 2022 zcmp -rwxr-xr-x 1 root root 6460 Apr 10 2022 zdiff -rwxr-xr-x 1 root root 29 Apr 10 2022 zegrep -rwxr-xr-x 1 root root 29 Apr 10 2022 zfgrep -rwxr-xr-x 1 root root 2081 Apr 10 2022 zforce -rwxr-xr-x 1 root root 8103 Apr 10 2022 zgrep -rwxr-xr-x 1 root root 2206 Apr 10 2022 zless -rwxr-xr-x 1 root root 1842 Apr 10 2022 zmore -rwxr-xr-x 1 root root 4577 Apr 10 2022 znew I: user script /srv/workspace/pbuilder/3117304/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy Version: 0.invalid.0 Architecture: amd64 Maintainer: Debian Pbuilder Team Description: Dummy package to satisfy dependencies with aptitude - created by pbuilder This package was created automatically by pbuilder to satisfy the build-dependencies of the package being currently built. Depends: coq, debhelper-compat (= 13), dh-coq, dh-ocaml, libcoq-core-ocaml-dev (>= 8.15), libcoq-stdlib, libelpi-ocaml-dev dpkg-deb: building package 'pbuilder-satisfydepends-dummy' in '/tmp/satisfydepends-aptitude/pbuilder-satisfydepends-dummy.deb'. Selecting previously unselected package pbuilder-satisfydepends-dummy. (Reading database ... 19591 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 coq; however: Package coq is not installed. pbuilder-satisfydepends-dummy depends on debhelper-compat (= 13); however: Package debhelper-compat is not installed. pbuilder-satisfydepends-dummy depends on dh-coq; however: Package dh-coq is not installed. pbuilder-satisfydepends-dummy depends on dh-ocaml; however: Package dh-ocaml is not installed. pbuilder-satisfydepends-dummy depends on libcoq-core-ocaml-dev (>= 8.15); however: Package libcoq-core-ocaml-dev is not installed. pbuilder-satisfydepends-dummy depends on libcoq-stdlib; however: Package libcoq-stdlib is not installed. pbuilder-satisfydepends-dummy depends on libelpi-ocaml-dev; however: Package libelpi-ocaml-dev 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} coq{a} debhelper{a} dh-autoreconf{a} dh-coq{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} libcoq-core-ocaml{a} libcoq-core-ocaml-dev{a} libcoq-stdlib{a} libdebhelper-perl{a} libelf1{a} libelpi-ocaml{a} libelpi-ocaml-dev{a} libexpat1{a} libfile-stripnondeterminism-perl{a} libfindlib-ocaml{a} libfindlib-ocaml-dev{a} libgmp-dev{a} libgmp3-dev{a} libgmpxx4ldbl{a} libicu72{a} libmagic-mgc{a} libmagic1{a} libmenhir-ocaml-dev{a} libncurses-dev{a} libncurses6{a} libocaml-compiler-libs-ocaml-dev{a} libpipeline1{a} libppx-derivers-ocaml-dev{a} libppx-deriving-ocaml{a} libppx-deriving-ocaml-dev{a} libppxlib-ocaml-dev{a} libpython3-stdlib{a} libpython3.11-minimal{a} libpython3.11-stdlib{a} libre-ocaml-dev{a} libreadline8{a} libresult-ocaml{a} libresult-ocaml-dev{a} libsexplib0-ocaml{a} libsexplib0-ocaml-dev{a} libsub-override-perl{a} libtool{a} libuchardet0{a} libxml2{a} libzarith-ocaml{a} libzarith-ocaml-dev{a} m4{a} man-db{a} media-types{a} ocaml{a} ocaml-base{a} ocaml-compiler-libs{a} ocaml-findlib{a} ocaml-interp{a} ocaml-nox{a} po-debconf{a} python3{a} python3-minimal{a} python3.11{a} python3.11-minimal{a} readline-common{a} sensible-utils{a} The following packages are RECOMMENDED but will NOT be installed: ca-certificates curl ledit libarchive-cpio-perl libgpm2 libltdl-dev libmail-sendmail-perl lynx ocaml-man rlfe rlwrap wget 0 packages upgraded, 75 newly installed, 0 to remove and 0 not upgraded. Need to get 353 MB of archives. After unpacking 1518 MB will be used. Writing extended state information... Get: 1 http://deb.debian.org/debian bookworm/main amd64 libpython3.11-minimal amd64 3.11.2-6 [813 kB] Get: 2 http://deb.debian.org/debian bookworm/main amd64 libexpat1 amd64 2.5.0-1 [99.3 kB] Get: 3 http://deb.debian.org/debian bookworm/main amd64 python3.11-minimal amd64 3.11.2-6 [2064 kB] Get: 4 http://deb.debian.org/debian bookworm/main amd64 python3-minimal amd64 3.11.2-1+b1 [26.3 kB] Get: 5 http://deb.debian.org/debian bookworm/main amd64 media-types all 10.0.0 [26.1 kB] Get: 6 http://deb.debian.org/debian bookworm/main amd64 readline-common all 8.2-1.3 [69.0 kB] Get: 7 http://deb.debian.org/debian bookworm/main amd64 libreadline8 amd64 8.2-1.3 [166 kB] Get: 8 http://deb.debian.org/debian bookworm/main amd64 libpython3.11-stdlib amd64 3.11.2-6 [1796 kB] Get: 9 http://deb.debian.org/debian bookworm/main amd64 python3.11 amd64 3.11.2-6 [572 kB] Get: 10 http://deb.debian.org/debian bookworm/main amd64 libpython3-stdlib amd64 3.11.2-1+b1 [9312 B] Get: 11 http://deb.debian.org/debian bookworm/main amd64 python3 amd64 3.11.2-1+b1 [26.3 kB] Get: 12 http://deb.debian.org/debian bookworm/main amd64 sensible-utils all 0.0.17+nmu1 [19.0 kB] Get: 13 http://deb.debian.org/debian bookworm/main amd64 libmagic-mgc amd64 1:5.44-3 [305 kB] Get: 14 http://deb.debian.org/debian bookworm/main amd64 libmagic1 amd64 1:5.44-3 [104 kB] Get: 15 http://deb.debian.org/debian bookworm/main amd64 file amd64 1:5.44-3 [42.5 kB] Get: 16 http://deb.debian.org/debian bookworm/main amd64 gettext-base amd64 0.21-12 [160 kB] Get: 17 http://deb.debian.org/debian bookworm/main amd64 libuchardet0 amd64 0.0.7-1 [67.8 kB] Get: 18 http://deb.debian.org/debian bookworm/main amd64 groff-base amd64 1.22.4-10 [916 kB] Get: 19 http://deb.debian.org/debian bookworm/main amd64 bsdextrautils amd64 2.38.1-5+b1 [86.6 kB] Get: 20 http://deb.debian.org/debian bookworm/main amd64 libpipeline1 amd64 1.5.7-1 [38.5 kB] Get: 21 http://deb.debian.org/debian bookworm/main amd64 man-db amd64 2.11.2-2 [1386 kB] Get: 22 http://deb.debian.org/debian bookworm/main amd64 m4 amd64 1.4.19-3 [287 kB] Get: 23 http://deb.debian.org/debian bookworm/main amd64 autoconf all 2.71-3 [332 kB] Get: 24 http://deb.debian.org/debian bookworm/main amd64 autotools-dev all 20220109.1 [51.6 kB] Get: 25 http://deb.debian.org/debian bookworm/main amd64 automake all 1:1.16.5-1.3 [823 kB] Get: 26 http://deb.debian.org/debian bookworm/main amd64 autopoint all 0.21-12 [495 kB] Get: 27 http://deb.debian.org/debian bookworm/main amd64 libcoq-stdlib amd64 8.16.1+dfsg-1+b2 [21.5 MB] Get: 28 http://deb.debian.org/debian bookworm/main amd64 ocaml-base amd64 4.13.1-4 [668 kB] Get: 29 http://deb.debian.org/debian bookworm/main amd64 libfindlib-ocaml amd64 1.9.6-1+b1 [169 kB] Get: 30 http://deb.debian.org/debian bookworm/main amd64 libzarith-ocaml amd64 1.12-1+b1 [56.5 kB] Get: 31 http://deb.debian.org/debian bookworm/main amd64 libcoq-core-ocaml amd64 8.16.1+dfsg-1+b2 [22.6 MB] Get: 32 http://deb.debian.org/debian bookworm/main amd64 ocaml-compiler-libs amd64 4.13.1-4 [31.0 MB] Get: 33 http://deb.debian.org/debian bookworm/main amd64 ocaml-interp amd64 4.13.1-4 [6158 kB] Get: 34 http://deb.debian.org/debian bookworm/main amd64 libncurses6 amd64 6.4-4 [103 kB] Get: 35 http://deb.debian.org/debian bookworm/main amd64 libncurses-dev amd64 6.4-4 [349 kB] Get: 36 http://deb.debian.org/debian bookworm/main amd64 ocaml amd64 4.13.1-4 [72.1 MB] Get: 37 http://deb.debian.org/debian bookworm/main amd64 ocaml-nox all 4.13.1-4 [161 kB] Get: 38 http://deb.debian.org/debian bookworm/main amd64 ocaml-findlib amd64 1.9.6-1+b1 [481 kB] Get: 39 http://deb.debian.org/debian bookworm/main amd64 coq amd64 8.16.1+dfsg-1+b2 [93.2 MB] Get: 40 http://deb.debian.org/debian bookworm/main amd64 libdebhelper-perl all 13.11.4 [81.2 kB] Get: 41 http://deb.debian.org/debian bookworm/main amd64 libtool all 2.4.7-5 [517 kB] Get: 42 http://deb.debian.org/debian bookworm/main amd64 dh-autoreconf all 20 [17.1 kB] Get: 43 http://deb.debian.org/debian bookworm/main amd64 libarchive-zip-perl all 1.68-1 [104 kB] Get: 44 http://deb.debian.org/debian bookworm/main amd64 libsub-override-perl all 0.09-4 [9304 B] Get: 45 http://deb.debian.org/debian bookworm/main amd64 libfile-stripnondeterminism-perl all 1.13.1-1 [19.4 kB] Get: 46 http://deb.debian.org/debian bookworm/main amd64 dh-strip-nondeterminism all 1.13.1-1 [8620 B] Get: 47 http://deb.debian.org/debian bookworm/main amd64 libelf1 amd64 0.188-2.1 [174 kB] Get: 48 http://deb.debian.org/debian bookworm/main amd64 dwz amd64 0.15-1 [109 kB] Get: 49 http://deb.debian.org/debian bookworm/main amd64 libicu72 amd64 72.1-3 [9376 kB] Get: 50 http://deb.debian.org/debian bookworm/main amd64 libxml2 amd64 2.9.14+dfsg-1.2 [687 kB] Get: 51 http://deb.debian.org/debian bookworm/main amd64 gettext amd64 0.21-12 [1300 kB] Get: 52 http://deb.debian.org/debian bookworm/main amd64 intltool-debian all 0.35.0+20060710.6 [22.9 kB] Get: 53 http://deb.debian.org/debian bookworm/main amd64 po-debconf all 1.0.21+nmu1 [248 kB] Get: 54 http://deb.debian.org/debian bookworm/main amd64 debhelper all 13.11.4 [942 kB] Get: 55 http://deb.debian.org/debian bookworm/main amd64 dh-coq all 0.5 [7460 B] Get: 56 http://deb.debian.org/debian bookworm/main amd64 dh-ocaml all 1.1.3 [82.9 kB] Get: 57 http://deb.debian.org/debian bookworm/main amd64 libfindlib-ocaml-dev amd64 1.9.6-1+b1 [162 kB] Get: 58 http://deb.debian.org/debian bookworm/main amd64 libgmpxx4ldbl amd64 2:6.2.1+dfsg1-1.1 [338 kB] Get: 59 http://deb.debian.org/debian bookworm/main amd64 libgmp-dev amd64 2:6.2.1+dfsg1-1.1 [641 kB] Get: 60 http://deb.debian.org/debian bookworm/main amd64 libgmp3-dev amd64 2:6.2.1+dfsg1-1.1 [331 kB] Get: 61 http://deb.debian.org/debian bookworm/main amd64 libzarith-ocaml-dev amd64 1.12-1+b1 [90.8 kB] Get: 62 http://deb.debian.org/debian bookworm/main amd64 libcoq-core-ocaml-dev amd64 8.16.1+dfsg-1+b2 [42.7 MB] Get: 63 http://deb.debian.org/debian bookworm/main amd64 libresult-ocaml amd64 1.5-1+b2 [7288 B] Get: 64 http://deb.debian.org/debian bookworm/main amd64 libsexplib0-ocaml amd64 0.15.1-1 [87.2 kB] Get: 65 http://deb.debian.org/debian bookworm/main amd64 libppx-deriving-ocaml amd64 5.2.1-1+b3 [3670 kB] Get: 66 http://deb.debian.org/debian bookworm/main amd64 libelpi-ocaml amd64 1.16.8-1+b2 [4896 kB] Get: 67 http://deb.debian.org/debian bookworm/main amd64 libmenhir-ocaml-dev amd64 20220210+ds-2 [533 kB] Get: 68 http://deb.debian.org/debian bookworm/main amd64 libocaml-compiler-libs-ocaml-dev amd64 0.12.4-1+b2 [78.5 kB] Get: 69 http://deb.debian.org/debian bookworm/main amd64 libppx-derivers-ocaml-dev amd64 1.2.1-1+b3 [16.1 kB] Get: 70 http://deb.debian.org/debian bookworm/main amd64 libsexplib0-ocaml-dev amd64 0.15.1-1 [184 kB] Get: 71 http://deb.debian.org/debian bookworm/main amd64 libppxlib-ocaml-dev amd64 0.27.0-2+b1 [14.0 MB] Get: 72 http://deb.debian.org/debian bookworm/main amd64 libresult-ocaml-dev amd64 1.5-1+b2 [10.1 kB] Get: 73 http://deb.debian.org/debian bookworm/main amd64 libppx-deriving-ocaml-dev amd64 5.2.1-1+b3 [786 kB] Get: 74 http://deb.debian.org/debian bookworm/main amd64 libre-ocaml-dev amd64 1.10.4-1 [889 kB] Get: 75 http://deb.debian.org/debian bookworm/main amd64 libelpi-ocaml-dev amd64 1.16.8-1+b2 [10.4 MB] Fetched 353 MB in 7s (54.2 MB/s) debconf: delaying package configuration, since apt-utils is not installed Selecting previously unselected package libpython3.11-minimal:amd64. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 19591 files and directories currently installed.) Preparing to unpack .../libpython3.11-minimal_3.11.2-6_amd64.deb ... Unpacking libpython3.11-minimal:amd64 (3.11.2-6) ... Selecting previously unselected package libexpat1:amd64. Preparing to unpack .../libexpat1_2.5.0-1_amd64.deb ... Unpacking libexpat1:amd64 (2.5.0-1) ... Selecting previously unselected package python3.11-minimal. Preparing to unpack .../python3.11-minimal_3.11.2-6_amd64.deb ... Unpacking python3.11-minimal (3.11.2-6) ... Setting up libpython3.11-minimal:amd64 (3.11.2-6) ... Setting up libexpat1:amd64 (2.5.0-1) ... Setting up python3.11-minimal (3.11.2-6) ... Selecting previously unselected package python3-minimal. (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 ... 19907 files and directories currently installed.) Preparing to unpack .../0-python3-minimal_3.11.2-1+b1_amd64.deb ... Unpacking python3-minimal (3.11.2-1+b1) ... Selecting previously unselected package media-types. Preparing to unpack .../1-media-types_10.0.0_all.deb ... Unpacking media-types (10.0.0) ... Selecting previously unselected package readline-common. Preparing to unpack .../2-readline-common_8.2-1.3_all.deb ... Unpacking readline-common (8.2-1.3) ... Selecting previously unselected package libreadline8:amd64. Preparing to unpack .../3-libreadline8_8.2-1.3_amd64.deb ... Unpacking libreadline8:amd64 (8.2-1.3) ... Selecting previously unselected package libpython3.11-stdlib:amd64. Preparing to unpack .../4-libpython3.11-stdlib_3.11.2-6_amd64.deb ... Unpacking libpython3.11-stdlib:amd64 (3.11.2-6) ... Selecting previously unselected package python3.11. Preparing to unpack .../5-python3.11_3.11.2-6_amd64.deb ... Unpacking python3.11 (3.11.2-6) ... Selecting previously unselected package libpython3-stdlib:amd64. Preparing to unpack .../6-libpython3-stdlib_3.11.2-1+b1_amd64.deb ... Unpacking libpython3-stdlib:amd64 (3.11.2-1+b1) ... Setting up python3-minimal (3.11.2-1+b1) ... Selecting previously unselected package python3. (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 ... 20341 files and directories currently installed.) Preparing to unpack .../00-python3_3.11.2-1+b1_amd64.deb ... Unpacking python3 (3.11.2-1+b1) ... Selecting previously unselected package sensible-utils. Preparing to unpack .../01-sensible-utils_0.0.17+nmu1_all.deb ... Unpacking sensible-utils (0.0.17+nmu1) ... Selecting previously unselected package libmagic-mgc. Preparing to unpack .../02-libmagic-mgc_1%3a5.44-3_amd64.deb ... Unpacking libmagic-mgc (1:5.44-3) ... Selecting previously unselected package libmagic1:amd64. Preparing to unpack .../03-libmagic1_1%3a5.44-3_amd64.deb ... Unpacking libmagic1:amd64 (1:5.44-3) ... Selecting previously unselected package file. Preparing to unpack .../04-file_1%3a5.44-3_amd64.deb ... Unpacking file (1:5.44-3) ... Selecting previously unselected package gettext-base. Preparing to unpack .../05-gettext-base_0.21-12_amd64.deb ... Unpacking gettext-base (0.21-12) ... Selecting previously unselected package libuchardet0:amd64. Preparing to unpack .../06-libuchardet0_0.0.7-1_amd64.deb ... Unpacking libuchardet0:amd64 (0.0.7-1) ... Selecting previously unselected package groff-base. Preparing to unpack .../07-groff-base_1.22.4-10_amd64.deb ... Unpacking groff-base (1.22.4-10) ... Selecting previously unselected package bsdextrautils. Preparing to unpack .../08-bsdextrautils_2.38.1-5+b1_amd64.deb ... Unpacking bsdextrautils (2.38.1-5+b1) ... Selecting previously unselected package libpipeline1:amd64. Preparing to unpack .../09-libpipeline1_1.5.7-1_amd64.deb ... Unpacking libpipeline1:amd64 (1.5.7-1) ... Selecting previously unselected package man-db. Preparing to unpack .../10-man-db_2.11.2-2_amd64.deb ... Unpacking man-db (2.11.2-2) ... Selecting previously unselected package m4. Preparing to unpack .../11-m4_1.4.19-3_amd64.deb ... Unpacking m4 (1.4.19-3) ... Selecting previously unselected package autoconf. Preparing to unpack .../12-autoconf_2.71-3_all.deb ... Unpacking autoconf (2.71-3) ... Selecting previously unselected package autotools-dev. Preparing to unpack .../13-autotools-dev_20220109.1_all.deb ... Unpacking autotools-dev (20220109.1) ... Selecting previously unselected package automake. Preparing to unpack .../14-automake_1%3a1.16.5-1.3_all.deb ... Unpacking automake (1:1.16.5-1.3) ... Selecting previously unselected package autopoint. Preparing to unpack .../15-autopoint_0.21-12_all.deb ... Unpacking autopoint (0.21-12) ... Selecting previously unselected package libcoq-stdlib. Preparing to unpack .../16-libcoq-stdlib_8.16.1+dfsg-1+b2_amd64.deb ... Unpacking libcoq-stdlib (8.16.1+dfsg-1+b2) ... Selecting previously unselected package ocaml-base. Preparing to unpack .../17-ocaml-base_4.13.1-4_amd64.deb ... Unpacking ocaml-base (4.13.1-4) ... Selecting previously unselected package libfindlib-ocaml. Preparing to unpack .../18-libfindlib-ocaml_1.9.6-1+b1_amd64.deb ... Unpacking libfindlib-ocaml (1.9.6-1+b1) ... Selecting previously unselected package libzarith-ocaml. Preparing to unpack .../19-libzarith-ocaml_1.12-1+b1_amd64.deb ... Unpacking libzarith-ocaml (1.12-1+b1) ... Selecting previously unselected package libcoq-core-ocaml. Preparing to unpack .../20-libcoq-core-ocaml_8.16.1+dfsg-1+b2_amd64.deb ... Unpacking libcoq-core-ocaml (8.16.1+dfsg-1+b2) ... Selecting previously unselected package ocaml-compiler-libs. Preparing to unpack .../21-ocaml-compiler-libs_4.13.1-4_amd64.deb ... Unpacking ocaml-compiler-libs (4.13.1-4) ... Selecting previously unselected package ocaml-interp. Preparing to unpack .../22-ocaml-interp_4.13.1-4_amd64.deb ... Unpacking ocaml-interp (4.13.1-4) ... Selecting previously unselected package libncurses6:amd64. Preparing to unpack .../23-libncurses6_6.4-4_amd64.deb ... Unpacking libncurses6:amd64 (6.4-4) ... Selecting previously unselected package libncurses-dev:amd64. Preparing to unpack .../24-libncurses-dev_6.4-4_amd64.deb ... Unpacking libncurses-dev:amd64 (6.4-4) ... Selecting previously unselected package ocaml. Preparing to unpack .../25-ocaml_4.13.1-4_amd64.deb ... Unpacking ocaml (4.13.1-4) ... Selecting previously unselected package ocaml-nox. Preparing to unpack .../26-ocaml-nox_4.13.1-4_all.deb ... Unpacking ocaml-nox (4.13.1-4) ... Selecting previously unselected package ocaml-findlib. Preparing to unpack .../27-ocaml-findlib_1.9.6-1+b1_amd64.deb ... Unpacking ocaml-findlib (1.9.6-1+b1) ... Selecting previously unselected package coq. Preparing to unpack .../28-coq_8.16.1+dfsg-1+b2_amd64.deb ... Unpacking coq (8.16.1+dfsg-1+b2) ... Selecting previously unselected package libdebhelper-perl. Preparing to unpack .../29-libdebhelper-perl_13.11.4_all.deb ... Unpacking libdebhelper-perl (13.11.4) ... Selecting previously unselected package libtool. Preparing to unpack .../30-libtool_2.4.7-5_all.deb ... Unpacking libtool (2.4.7-5) ... Selecting previously unselected package dh-autoreconf. Preparing to unpack .../31-dh-autoreconf_20_all.deb ... Unpacking dh-autoreconf (20) ... Selecting previously unselected package libarchive-zip-perl. Preparing to unpack .../32-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 .../33-libsub-override-perl_0.09-4_all.deb ... Unpacking libsub-override-perl (0.09-4) ... Selecting previously unselected package libfile-stripnondeterminism-perl. Preparing to unpack .../34-libfile-stripnondeterminism-perl_1.13.1-1_all.deb ... Unpacking libfile-stripnondeterminism-perl (1.13.1-1) ... Selecting previously unselected package dh-strip-nondeterminism. Preparing to unpack .../35-dh-strip-nondeterminism_1.13.1-1_all.deb ... Unpacking dh-strip-nondeterminism (1.13.1-1) ... Selecting previously unselected package libelf1:amd64. Preparing to unpack .../36-libelf1_0.188-2.1_amd64.deb ... Unpacking libelf1:amd64 (0.188-2.1) ... Selecting previously unselected package dwz. Preparing to unpack .../37-dwz_0.15-1_amd64.deb ... Unpacking dwz (0.15-1) ... Selecting previously unselected package libicu72:amd64. Preparing to unpack .../38-libicu72_72.1-3_amd64.deb ... Unpacking libicu72:amd64 (72.1-3) ... Selecting previously unselected package libxml2:amd64. Preparing to unpack .../39-libxml2_2.9.14+dfsg-1.2_amd64.deb ... Unpacking libxml2:amd64 (2.9.14+dfsg-1.2) ... Selecting previously unselected package gettext. Preparing to unpack .../40-gettext_0.21-12_amd64.deb ... Unpacking gettext (0.21-12) ... Selecting previously unselected package intltool-debian. Preparing to unpack .../41-intltool-debian_0.35.0+20060710.6_all.deb ... Unpacking intltool-debian (0.35.0+20060710.6) ... Selecting previously unselected package po-debconf. Preparing to unpack .../42-po-debconf_1.0.21+nmu1_all.deb ... Unpacking po-debconf (1.0.21+nmu1) ... Selecting previously unselected package debhelper. Preparing to unpack .../43-debhelper_13.11.4_all.deb ... Unpacking debhelper (13.11.4) ... Selecting previously unselected package dh-coq. Preparing to unpack .../44-dh-coq_0.5_all.deb ... Unpacking dh-coq (0.5) ... Selecting previously unselected package dh-ocaml. Preparing to unpack .../45-dh-ocaml_1.1.3_all.deb ... Unpacking dh-ocaml (1.1.3) ... Selecting previously unselected package libfindlib-ocaml-dev. Preparing to unpack .../46-libfindlib-ocaml-dev_1.9.6-1+b1_amd64.deb ... Unpacking libfindlib-ocaml-dev (1.9.6-1+b1) ... Selecting previously unselected package libgmpxx4ldbl:amd64. Preparing to unpack .../47-libgmpxx4ldbl_2%3a6.2.1+dfsg1-1.1_amd64.deb ... Unpacking libgmpxx4ldbl:amd64 (2:6.2.1+dfsg1-1.1) ... Selecting previously unselected package libgmp-dev:amd64. Preparing to unpack .../48-libgmp-dev_2%3a6.2.1+dfsg1-1.1_amd64.deb ... Unpacking libgmp-dev:amd64 (2:6.2.1+dfsg1-1.1) ... Selecting previously unselected package libgmp3-dev:amd64. Preparing to unpack .../49-libgmp3-dev_2%3a6.2.1+dfsg1-1.1_amd64.deb ... Unpacking libgmp3-dev:amd64 (2:6.2.1+dfsg1-1.1) ... Selecting previously unselected package libzarith-ocaml-dev. Preparing to unpack .../50-libzarith-ocaml-dev_1.12-1+b1_amd64.deb ... Unpacking libzarith-ocaml-dev (1.12-1+b1) ... Selecting previously unselected package libcoq-core-ocaml-dev. Preparing to unpack .../51-libcoq-core-ocaml-dev_8.16.1+dfsg-1+b2_amd64.deb ... Unpacking libcoq-core-ocaml-dev (8.16.1+dfsg-1+b2) ... Selecting previously unselected package libresult-ocaml. Preparing to unpack .../52-libresult-ocaml_1.5-1+b2_amd64.deb ... Unpacking libresult-ocaml (1.5-1+b2) ... Selecting previously unselected package libsexplib0-ocaml. Preparing to unpack .../53-libsexplib0-ocaml_0.15.1-1_amd64.deb ... Unpacking libsexplib0-ocaml (0.15.1-1) ... Selecting previously unselected package libppx-deriving-ocaml. Preparing to unpack .../54-libppx-deriving-ocaml_5.2.1-1+b3_amd64.deb ... Unpacking libppx-deriving-ocaml (5.2.1-1+b3) ... Selecting previously unselected package libelpi-ocaml. Preparing to unpack .../55-libelpi-ocaml_1.16.8-1+b2_amd64.deb ... Unpacking libelpi-ocaml (1.16.8-1+b2) ... Selecting previously unselected package libmenhir-ocaml-dev. Preparing to unpack .../56-libmenhir-ocaml-dev_20220210+ds-2_amd64.deb ... Unpacking libmenhir-ocaml-dev (20220210+ds-2) ... Selecting previously unselected package libocaml-compiler-libs-ocaml-dev. Preparing to unpack .../57-libocaml-compiler-libs-ocaml-dev_0.12.4-1+b2_amd64.deb ... Unpacking libocaml-compiler-libs-ocaml-dev (0.12.4-1+b2) ... Selecting previously unselected package libppx-derivers-ocaml-dev. Preparing to unpack .../58-libppx-derivers-ocaml-dev_1.2.1-1+b3_amd64.deb ... Unpacking libppx-derivers-ocaml-dev (1.2.1-1+b3) ... Selecting previously unselected package libsexplib0-ocaml-dev. Preparing to unpack .../59-libsexplib0-ocaml-dev_0.15.1-1_amd64.deb ... Unpacking libsexplib0-ocaml-dev (0.15.1-1) ... Selecting previously unselected package libppxlib-ocaml-dev. Preparing to unpack .../60-libppxlib-ocaml-dev_0.27.0-2+b1_amd64.deb ... Unpacking libppxlib-ocaml-dev (0.27.0-2+b1) ... Selecting previously unselected package libresult-ocaml-dev. Preparing to unpack .../61-libresult-ocaml-dev_1.5-1+b2_amd64.deb ... Unpacking libresult-ocaml-dev (1.5-1+b2) ... Selecting previously unselected package libppx-deriving-ocaml-dev. Preparing to unpack .../62-libppx-deriving-ocaml-dev_5.2.1-1+b3_amd64.deb ... Unpacking libppx-deriving-ocaml-dev (5.2.1-1+b3) ... Selecting previously unselected package libre-ocaml-dev. Preparing to unpack .../63-libre-ocaml-dev_1.10.4-1_amd64.deb ... Unpacking libre-ocaml-dev (1.10.4-1) ... Selecting previously unselected package libelpi-ocaml-dev. Preparing to unpack .../64-libelpi-ocaml-dev_1.16.8-1+b2_amd64.deb ... Unpacking libelpi-ocaml-dev (1.16.8-1+b2) ... Setting up media-types (10.0.0) ... Setting up libpipeline1:amd64 (1.5.7-1) ... Setting up libicu72:amd64 (72.1-3) ... Setting up bsdextrautils (2.38.1-5+b1) ... Setting up libmagic-mgc (1:5.44-3) ... Setting up dh-coq (0.5) ... Setting up libarchive-zip-perl (1.68-1) ... Setting up libdebhelper-perl (13.11.4) ... Setting up dh-ocaml (1.1.3) ... Setting up libmagic1:amd64 (1:5.44-3) ... Setting up gettext-base (0.21-12) ... Setting up m4 (1.4.19-3) ... Setting up file (1:5.44-3) ... Setting up autotools-dev (20220109.1) ... Setting up libcoq-stdlib (8.16.1+dfsg-1+b2) ... Setting up libgmpxx4ldbl:amd64 (2:6.2.1+dfsg1-1.1) ... Setting up libncurses6:amd64 (6.4-4) ... Setting up autopoint (0.21-12) ... Setting up ocaml-base (4.13.1-4) ... Setting up autoconf (2.71-3) ... Setting up libsexplib0-ocaml (0.15.1-1) ... Setting up sensible-utils (0.0.17+nmu1) ... Setting up libuchardet0:amd64 (0.0.7-1) ... Setting up libsub-override-perl (0.09-4) ... Setting up libresult-ocaml (1.5-1+b2) ... Setting up libelf1:amd64 (0.188-2.1) ... Setting up readline-common (8.2-1.3) ... Setting up libxml2:amd64 (2.9.14+dfsg-1.2) ... Setting up automake (1:1.16.5-1.3) ... update-alternatives: using /usr/bin/automake-1.16 to provide /usr/bin/automake (automake) in auto mode Setting up libfile-stripnondeterminism-perl (1.13.1-1) ... Setting up libppx-deriving-ocaml (5.2.1-1+b3) ... Setting up libncurses-dev:amd64 (6.4-4) ... Setting up gettext (0.21-12) ... Setting up libgmp-dev:amd64 (2:6.2.1+dfsg1-1.1) ... Setting up libtool (2.4.7-5) ... Setting up libreadline8:amd64 (8.2-1.3) ... Setting up libfindlib-ocaml (1.9.6-1+b1) ... Setting up libzarith-ocaml (1.12-1+b1) ... Setting up intltool-debian (0.35.0+20060710.6) ... Setting up dh-autoreconf (20) ... Setting up ocaml-findlib (1.9.6-1+b1) ... Setting up dh-strip-nondeterminism (1.13.1-1) ... Setting up libelpi-ocaml (1.16.8-1+b2) ... Setting up dwz (0.15-1) ... Setting up libcoq-core-ocaml (8.16.1+dfsg-1+b2) ... Setting up groff-base (1.22.4-10) ... Setting up libgmp3-dev:amd64 (2:6.2.1+dfsg1-1.1) ... Setting up po-debconf (1.0.21+nmu1) ... Setting up libpython3.11-stdlib:amd64 (3.11.2-6) ... Setting up man-db (2.11.2-2) ... Not building database; man-db/auto-update is not 'true'. Setting up libpython3-stdlib:amd64 (3.11.2-1+b1) ... Setting up python3.11 (3.11.2-6) ... Setting up debhelper (13.11.4) ... Setting up python3 (3.11.2-1+b1) ... Setting up ocaml-compiler-libs (4.13.1-4) ... Setting up ocaml-interp (4.13.1-4) ... Setting up ocaml (4.13.1-4) ... Setting up libre-ocaml-dev (1.10.4-1) ... Setting up libmenhir-ocaml-dev (20220210+ds-2) ... Setting up libocaml-compiler-libs-ocaml-dev (0.12.4-1+b2) ... Setting up libfindlib-ocaml-dev (1.9.6-1+b1) ... Setting up ocaml-nox (4.13.1-4) ... Setting up libsexplib0-ocaml-dev (0.15.1-1) ... Setting up coq (8.16.1+dfsg-1+b2) ... Setting up libresult-ocaml-dev (1.5-1+b2) ... Setting up libzarith-ocaml-dev (1.12-1+b1) ... Setting up libppx-derivers-ocaml-dev (1.2.1-1+b3) ... Setting up libppxlib-ocaml-dev (0.27.0-2+b1) ... Setting up libcoq-core-ocaml-dev (8.16.1+dfsg-1+b2) ... Setting up libppx-deriving-ocaml-dev (5.2.1-1+b3) ... Setting up libelpi-ocaml-dev (1.16.8-1+b2) ... Processing triggers for libc-bin (2.36-9) ... Reading package lists... Building dependency tree... Reading state information... Reading extended state information... Initializing package states... Writing extended state information... Building tag database... -> Finished parsing the build-deps Reading package lists... Building dependency tree... Reading state information... usrmerge is already the newest version (35). 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. I: Building the package I: user script /srv/workspace/pbuilder/3117304/tmp/hooks/A99_set_merged_usr starting Re-configuring usrmerge... removed '/etc/unsupported-skip-usrmerge-conversion' The system has been successfully converted. I: user script /srv/workspace/pbuilder/3117304/tmp/hooks/A99_set_merged_usr finished hostname: Name or service not known I: Running cd /build/coq-elpi-1.16.0/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path" HOME="/nonexistent/second-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path" HOME="/nonexistent/second-build" dpkg-genchanges -S > ../coq-elpi_1.16.0-2_source.changes dpkg-buildpackage: info: source package coq-elpi dpkg-buildpackage: info: source version 1.16.0-2 dpkg-buildpackage: info: source distribution unstable dpkg-buildpackage: info: source changed by Julien Puydt dpkg-source --before-build . dpkg-buildpackage: info: host architecture amd64 debian/rules clean dh clean --with ocaml,coq debian/rules override_dh_auto_clean make[1]: Entering directory '/build/coq-elpi-1.16.0' Clean target is fragile make[1]: Leaving directory '/build/coq-elpi-1.16.0' dh_ocamlclean dh_clean debian/rules binary dh binary --with ocaml,coq dh_update_autotools_config dh_autoreconf dh_ocamlinit dh_auto_configure debian/rules override_dh_auto_build make[1]: Entering directory '/build/coq-elpi-1.16.0' /usr/bin/make build OCAMLWARN= make[2]: Entering directory '/build/coq-elpi-1.16.0' Using coq found in /usr/bin, from COQBIN or PATH echo "(* Automatically generated from elpi/coq-HOAS.elpi, don't edit *)" > src/coq_elpi_builtins_HOAS.ml echo "let code = {|" >> src/coq_elpi_builtins_HOAS.ml cat elpi/coq-HOAS.elpi >> src/coq_elpi_builtins_HOAS.ml echo "|}" >> src/coq_elpi_builtins_HOAS.ml echo "let elpi_dir = \"/usr/lib/ocaml/elpi\";;" > src/coq_elpi_config.ml COQDEP VFILES COQPP src/coq_elpi_vernacular_syntax.mlg COQPP src/coq_elpi_arg_syntax.mlg CAMLDEP src/coq_elpi_builtins.mli CAMLDEP src/coq_elpi_arg_HOAS.mli CAMLDEP src/coq_elpi_glob_quotation.mli CAMLDEP src/coq_elpi_HOAS.mli CAMLDEP src/coq_elpi_utils.mli CAMLDEP src/coq_elpi_vernacular.mli OCAMLLIBDEP src/elpi_plugin.mlpack CAMLDEP src/coq_elpi_config.ml CAMLDEP src/coq_elpi_builtins.ml CAMLDEP src/coq_elpi_builtins_HOAS.ml CAMLDEP src/coq_elpi_arg_HOAS.ml CAMLDEP src/coq_elpi_glob_quotation.ml CAMLDEP src/coq_elpi_name_quotation.ml CAMLDEP src/coq_elpi_HOAS.ml CAMLDEP src/coq_elpi_utils.ml CAMLDEP src/coq_elpi_vernacular.ml CAMLDEP src/coq_elpi_arg_syntax.ml CAMLDEP src/coq_elpi_vernacular_syntax.ml FILL .merlin echo "S /usr/lib/ocaml/elpi" >> .merlin echo "B /usr/lib/ocaml/elpi" >> .merlin if [ "/usr/lib/ocaml/elpi" != "elpi/findlib/elpi" ]; then\ echo "PKG elpi" >> .merlin;\ fi Using coq found in /usr/bin, from COQBIN or PATH ########################## building plugin ########################## CAMLC -c src/coq_elpi_utils.mli CAMLC -c src/coq_elpi_HOAS.mli CAMLC -c src/coq_elpi_arg_HOAS.mli CAMLC -c src/coq_elpi_vernacular.mli CAMLC -c src/coq_elpi_glob_quotation.mli CAMLC -c src/coq_elpi_arg_syntax.ml CAMLC -c src/coq_elpi_vernacular_syntax.ml CAMLC -c src/coq_elpi_config.ml CAMLC -c src/coq_elpi_builtins.mli CAMLC -c src/coq_elpi_vernacular.ml CAMLC -c src/coq_elpi_utils.ml CAMLC -c src/coq_elpi_HOAS.ml File "src/coq_elpi_HOAS.ml", line 2598, characters 2-22: 2598 | uname : Id.t option; ^^^^^^^^^^^^^^^^^^^^ Warning 69 [unused-field]: record field uname is never read. (However, this field is used to build or mutate values.) File "src/coq_elpi_HOAS.ml", line 2599, characters 2-22: 2599 | uloc : Loc.t option; ^^^^^^^^^^^^^^^^^^^^ Warning 69 [unused-field]: record field uloc is never read. (However, this field is used to build or mutate values.) File "src/coq_elpi_HOAS.ml", line 2606, characters 4-26: 2606 | univ_variables : unit; ^^^^^^^^^^^^^^^^^^^^^^ Warning 69 [unused-field]: unused record field univ_variables. File "src/coq_elpi_HOAS.ml", line 2607, characters 4-26: 2607 | univ_algebraic : unit; ^^^^^^^^^^^^^^^^^^^^^^ Warning 69 [unused-field]: unused record field univ_algebraic. File "src/coq_elpi_HOAS.ml", line 2608, characters 4-21: 2608 | universes : unit; ^^^^^^^^^^^^^^^^^ Warning 69 [unused-field]: unused record field universes. File "src/coq_elpi_HOAS.ml", line 2610, characters 4-29: 2610 | initial_universes : unit; ^^^^^^^^^^^^^^^^^^^^^^^^^ Warning 69 [unused-field]: unused record field initial_universes. File "src/coq_elpi_HOAS.ml", line 2611, characters 4-23: 2611 | minim_extra : unit; ^^^^^^^^^^^^^^^^^^^ Warning 69 [unused-field]: unused record field minim_extra. CAMLC -c src/coq_elpi_name_quotation.ml CAMLC -c src/coq_elpi_glob_quotation.ml CAMLC -c src/coq_elpi_arg_HOAS.ml CAMLC -c src/coq_elpi_builtins_HOAS.ml CAMLC -c src/coq_elpi_builtins.ml CAMLC -pack -o src/elpi_plugin.cmo CAMLC -a -o src/elpi_plugin.cma CAMLOPT -c -for-pack Elpi_plugin src/coq_elpi_config.ml CAMLOPT -c -for-pack Elpi_plugin src/coq_elpi_utils.ml CAMLOPT -c -for-pack Elpi_plugin src/coq_elpi_HOAS.ml File "src/coq_elpi_HOAS.ml", line 2598, characters 2-22: 2598 | uname : Id.t option; ^^^^^^^^^^^^^^^^^^^^ Warning 69 [unused-field]: record field uname is never read. (However, this field is used to build or mutate values.) File "src/coq_elpi_HOAS.ml", line 2599, characters 2-22: 2599 | uloc : Loc.t option; ^^^^^^^^^^^^^^^^^^^^ Warning 69 [unused-field]: record field uloc is never read. (However, this field is used to build or mutate values.) File "src/coq_elpi_HOAS.ml", line 2606, characters 4-26: 2606 | univ_variables : unit; ^^^^^^^^^^^^^^^^^^^^^^ Warning 69 [unused-field]: unused record field univ_variables. File "src/coq_elpi_HOAS.ml", line 2607, characters 4-26: 2607 | univ_algebraic : unit; ^^^^^^^^^^^^^^^^^^^^^^ Warning 69 [unused-field]: unused record field univ_algebraic. File "src/coq_elpi_HOAS.ml", line 2608, characters 4-21: 2608 | universes : unit; ^^^^^^^^^^^^^^^^^ Warning 69 [unused-field]: unused record field universes. File "src/coq_elpi_HOAS.ml", line 2610, characters 4-29: 2610 | initial_universes : unit; ^^^^^^^^^^^^^^^^^^^^^^^^^ Warning 69 [unused-field]: unused record field initial_universes. File "src/coq_elpi_HOAS.ml", line 2611, characters 4-23: 2611 | minim_extra : unit; ^^^^^^^^^^^^^^^^^^^ Warning 69 [unused-field]: unused record field minim_extra. CAMLOPT -c -for-pack Elpi_plugin src/coq_elpi_glob_quotation.ml CAMLOPT -c -for-pack Elpi_plugin src/coq_elpi_name_quotation.ml CAMLOPT -c -for-pack Elpi_plugin src/coq_elpi_arg_HOAS.ml CAMLOPT -c -for-pack Elpi_plugin src/coq_elpi_arg_syntax.ml CAMLOPT -c -for-pack Elpi_plugin src/coq_elpi_builtins_HOAS.ml CAMLOPT -c -for-pack Elpi_plugin src/coq_elpi_builtins.ml CAMLOPT -c -for-pack Elpi_plugin src/coq_elpi_vernacular.ml CAMLOPT -c -for-pack Elpi_plugin src/coq_elpi_vernacular_syntax.ml CAMLOPT -pack -o src/elpi_plugin.cmx CAMLOPT -a -o src/elpi_plugin.cmxa CAMLOPT -shared -o src/elpi_plugin.cmxs COQC theories/elpi.v COQC theories/wip/memoization.v hit app [global (indt «or»), global (indt «False»), global (indt «True»)] hit app [global (indt «or»), global (indt «False»), global (indt «True»)] hit app [global (indt «or»), global (indt «False»), global (indt «True»)] hit app [global (indt «or»), global (indt «False»), global (indt «True»)] hit app [global (indt «or»), global (indt «False»), global (indt «True»)] hit app [global (indt «or»), global (indt «False»), global (indt «True»)] Finished transaction in 0.033 secs (0.015u,0.s) (successful) ########################## building APPS ############################ make[3]: Entering directory '/build/coq-elpi-1.16.0/apps/derive' Using coq found in /usr/bin/, from COQBIN or PATH Warning: ../../theories (used in -R or -Q) is not a subdirectory of the current directory COQDEP VFILES FILL .merlin COQC theories/derive.v COQC theories/derive/map.v COQC theories/derive/lens.v COQC theories/derive/lens_laws.v COQC theories/derive/param1.v COQC theories/derive/param1_congr.v COQC theories/derive/param1_trivial.v COQC theories/derive/param1_functor.v COQC theories/derive/param2.v COQC theories/derive/induction.v COQC theories/derive/tag.v COQC theories/derive/eqType_ast.v COQC theories/derive/fields.v COQC theories/derive/eqb_core_defs.v COQC theories/derive/eqb.v COQC theories/derive/eqbcorrect.v COQC theories/derive/eqbOK.v COQC theories/derive/std.v COQC theories/derive/projK.v COQC theories/derive/isK.v COQC theories/derive/eq.v COQC theories/derive/bcongr.v COQC theories/derive/eqK.v COQC theories/derive/eqcorrect.v COQC theories/derive/eqOK.v COQC theories/derive/legacy.v COQC theories/derive/invert.v COQC theories/derive/idx2inv.v COQC theories/derive/experimental.v COQC theories/derive/cast.v make[3]: Leaving directory '/build/coq-elpi-1.16.0/apps/derive' make[3]: Entering directory '/build/coq-elpi-1.16.0/apps/eltac' Using coq found in /usr/bin/, from COQBIN or PATH Warning: ../../theories (used in -R or -Q) is not a subdirectory of the current directory COQDEP VFILES FILL .merlin COQC theories/assumption.v COQC theories/constructor.v COQC theories/intro.v COQC theories/clear.v COQC theories/fail.v COQC theories/discriminate.v COQC theories/injection.v COQC theories/case.v COQC theories/generalize.v COQC theories/cycle.v COQC theories/tactics.v make[3]: Leaving directory '/build/coq-elpi-1.16.0/apps/eltac' make[3]: Entering directory '/build/coq-elpi-1.16.0/apps/NES' Using coq found in /usr/bin/, from COQBIN or PATH Warning: ../../theories (used in -R or -Q) is not a subdirectory of the current directory COQDEP VFILES FILL .merlin COQC theories/NES.v make[3]: Leaving directory '/build/coq-elpi-1.16.0/apps/NES' make[3]: Entering directory '/build/coq-elpi-1.16.0/apps/locker' Using coq found in /usr/bin/, from COQBIN or PATH Warning: ../../theories (used in -R or -Q) is not a subdirectory of the current directory COQDEP VFILES FILL .merlin COQC theories/locker.v make[3]: Leaving directory '/build/coq-elpi-1.16.0/apps/locker' make[2]: Leaving directory '/build/coq-elpi-1.16.0' make[1]: Leaving directory '/build/coq-elpi-1.16.0' dh_auto_test make -j15 test make[1]: Entering directory '/build/coq-elpi-1.16.0' Using coq found in /usr/bin, from COQBIN or PATH ########################## building plugin ########################## make[2]: Nothing to be done for 'bytefiles'. make[4]: Nothing to be done for 'real-all'. ########################## testing plugin ########################## ########################## building APPS ############################ make[2]: Entering directory '/build/coq-elpi-1.16.0/apps/derive' Using coq found in /usr/bin/, from COQBIN or PATH COQDEP VFILES make[4]: Nothing to be done for 'real-all'. COQC tests/test_API.v COQC tests/test_API_elaborate.v COQC tests/test_API_typecheck.v COQC tests/test_API_env.v make[2]: Leaving directory '/build/coq-elpi-1.16.0/apps/derive' make[2]: Entering directory '/build/coq-elpi-1.16.0/apps/eltac' Using coq found in /usr/bin/, from COQBIN or PATH COQC tests/test_API_module.v COQC tests/test_API_section.v COQC tests/test_API_TC_CS.v COQC tests/test_API_arguments.v COQC tests/test_API_notations.v COQC tests/test_HOAS.v COQC tests/test_arg_HOAS.v COQC tests/test_quotation.v COQC tests/test_vernacular1.v COQC tests/test_tactic.v make[4]: Nothing to be done for 'real-all'. ?r : Reflexive R : Reflexive R where ?r : [ |- Reflexive R] make[2]: Leaving directory '/build/coq-elpi-1.16.0/apps/eltac' make[2]: Entering directory '/build/coq-elpi-1.16.0/apps/NES' Using coq found in /usr/bin/, from COQBIN or PATH test2 test1 str hello test1 too many arguments test1 str hello my str Dear test1 too many arguments Query assignments: I = const «imp» X2.imp : forall (T : Type) (x : T), x = x -> Prop X2.imp is not universe polymorphic Arguments X2.imp T%type_scope x _ Expands to: Constant elpi.tests.test_API_arguments.X2.imp make[4]: Nothing to be done for 'real-all'. make[2]: Leaving directory '/build/coq-elpi-1.16.0/apps/NES' make[2]: Entering directory '/build/coq-elpi-1.16.0/apps/locker' Using coq found in /usr/bin/, from COQBIN or PATH {c0} : decl c0 `x` (global (indt «nat»)) ?- evar (X0 c0) (prod `_` (global (indt «bool»)) c1 \ global (indt «True»)) (X1 c0) /* suspended on X0, X1 */ EVARS: ?X2==[x |- bool -> True] (goal evar) {?Goal} ?X1==[ |- nat -> bool -> True => fun x : nat => ?Goal] (goal evar) SHELF:|| FUTURE GOALS STACK: || Coq-Elpi mapping: RAW: ?X2 <-> c0 \ X0 c0 ELAB: ?X2 <-> X1 {c0} : decl c0 `x` (global (indt «nat»)) ?- evar (X0 c0) (prod `_` (global (indt «bool»)) c1 \ global (indt «True»)) (X1 c0) /* suspended on X0, X1 */ Query assignments: CA = «a» CB = «b» CC = «c» d : nat d is not universe polymorphic Expands to: Variable d eq_refl : e2 = 3 : e2 = 3 Query assignments: Spilled_1 = const «foo» foo 3 : nat make[4]: Nothing to be done for 'real-all'. make[2]: Leaving directory '/build/coq-elpi-1.16.0/apps/locker' ########################## testing APPS ############################ make[2]: Entering directory '/build/coq-elpi-1.16.0/apps/derive' Using coq found in /usr/bin/, from COQBIN or PATH Query assignments: BO = fix `add` 0 (prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat»)) c0 \ fun `n` (global (indt «nat»)) c1 \ fun `m` (global (indt «nat»)) c2 \ match c1 (fun `n` (global (indt «nat»)) c3 \ global (indt «nat»)) [c2, fun `p` (global (indt «nat»)) c3 \ app [global (indc «S»), app [c0, c3, c2]]] GR = «Nat.add» TY = prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat») Warning: ../../theories (used in -R or -Q) is not a subdirectory of the current directory Query assignments: BO = fix `add` 0 (prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat»)) c0 \ fun `n` (global (indt «nat»)) c1 \ fun `m` (global (indt «nat»)) c2 \ match c1 (fun `n` (global (indt «nat»)) c3 \ global (indt «nat»)) [c2, fun `p` (global (indt «nat»)) c3 \ app [global (indc «S»), app [c0, c3, c2]]] GR = «Nat.add» GRNat = indt «nat» GRSucc = indc «S» Nat = global (indt «nat») Succ = global (indc «S») TY = prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat») Query assignments: BO = fix `add` 0 (prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat»)) c0 \ fun `n` (global (indt «nat»)) c1 \ fun `m` (global (indt «nat»)) c2 \ match c1 (fun `n` (global (indt «nat»)) c3 \ global (indt «nat»)) [c2, fun `p` (global (indt «nat»)) c3 \ app [global (indc «S»), app [c0, c3, c2]]] GR = «Nat.add» TY = prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat») COQDEP VFILES Coq version: 8.16.1 = 8 . 16 . 1 Query assignments: MA = 8 MI = 16 P = 1 V = 8.16.1 Query assignments: L = [gref (indt «Empty_set»), gref (const «Empty_set_rect»), gref (const «Empty_set_ind»), gref (const «Empty_set_rec»), gref (const «Empty_set_sind»), gref (indt «unit»), gref (const «unit_rect»), gref (const «unit_ind»), gref (const «unit_rec»), gref (const «unit_sind»), gref (indt «bool»), gref (const «bool_rect»), gref (const «bool_ind»), gref (const «bool_rec»), gref (const «bool_sind»), gref (const «andb»), gref (const «orb»), gref (const «implb»), gref (const «xorb»), gref (const «negb»), gref (const «andb_prop»), gref (const «andb_true_intro»), gref (indt «eq_true»), gref (const «eq_true_rect»), gref (const «eq_true_ind»), gref (const «eq_true_rec»), gref (const «eq_true_sind»), gref (const «is_true»), gref (const «eq_true_ind_r»), gref (const «eq_true_rec_r»), gref (const «eq_true_rect_r»), gref (indt «BoolSpec»), gref (const «BoolSpec_ind»), gref (const «BoolSpec_sind»), gref (indt «nat»), gref (const «nat_rect»), gref (const «nat_ind»), gref (const «nat_rec»), gref (const «nat_sind»), gref (indt «option»), gref (const «option_rect»), gref (const «option_ind»), gref (const «option_rec»), gref (const «option_sind»), gref (const «option_map»), gref (indt «sum»), gref (const «sum_rect»), gref (const «sum_ind»), gref (const «sum_rec»), gref (const «sum_sind»), gref (indt «prod»), gref (const «prod_rect»), gref (const «prod_ind»), gref (const «prod_rec»), gref (const «prod_sind»), gref (const «fst»), gref (const «snd»), gref (const «surjective_pairing»), gref (const «injective_projections»), gref (const «pair_equal_spec»), gref (const «curry»), gref (const «uncurry»), gref (const «prod_uncurry_subdef»), gref (const «prod_curry_subdef»), gref (const «rew_pair»), gref (indt «list»), gref (const «list_rect»), gref (const «list_ind»), gref (const «list_rec»), gref (const «list_sind»), gref (const «length»), gref (const «app»), gref (indt «comparison»), gref (const «comparison_rect»), gref (const «comparison_ind»), gref (const «comparison_rec»), gref (const «comparison_sind»), gref (const «comparison_eq_stable»), gref (const «CompOpp»), gref (const «CompOpp_involutive»), gref (const «CompOpp_inj»), gref (const «CompOpp_iff»), gref (indt «CompareSpec»), gref (const «CompareSpec_ind»), gref (const «CompareSpec_sind»), gref (indt «CompareSpecT»), gref (const «CompareSpecT_rect»), gref (const «CompareSpecT_ind»), gref (const «CompareSpecT_rec»), gref (const «CompareSpecT_sind»), gref (const «CompareSpec2Type»), gref (const «CompSpec»), gref (const «CompSpecT»), gref (const «CompSpec2Type»), gref (const «ID»), gref (const «id»), gref (const «IDProp»), gref (const «idProp»)] MP = «Coq.Init.Datatypes» Query assignments: Spilled_1 = const «f» Spilled_2 = const «f» Spilled_3 = const «f» Spilled_4 = const «f» Spilled_5 = const «f» f : forall [S : Type], S -> Prop f is not universe polymorphic Arguments f [S]%type_scope _ (where some original arguments have been renamed) f is transparent Expands to: Constant elpi.tests.test_API_arguments.f f (S:=bool * bool) : bool * bool -> Prop Query assignments: E = fun `n` (global (indt «nat»)) c0 \ fun `t` (app [global (const «T2»), c0]) c1 \ fun `_` (app [global (const «f3»), c0, app [global (const «h»), c0, c1]]) c2 \ app [global (const «g3»), c0, app [global (const «h»), c0, c1], app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]] TY = prod `n` (global (indt «nat»)) c0 \ prod `t` (app [global (const «T2»), c0]) c1 \ prod `_` (app [global (const «f3»), c0, app [global (const «h»), c0, c1]]) c2 \ global (indt «nat») _uvk_1_ = X0 Universe constraints: UNIVERSES: {elpi.tests.test_API_elaborate.13 elpi.tests.test_API_elaborate.10 elpi.tests.test_API_elaborate.9} |= elpi.tests.test_API_elaborate.13 < elpi.tests.test_API_elaborate.9 Set <= elpi.tests.test_API_elaborate.10 Set <= elpi.tests.test_API_elaborate.13 T2.u0 <= elpi.tests.test_API_elaborate.13 f3.u0 <= elpi.tests.test_API_elaborate.13 ALGEBRAIC UNIVERSES: {elpi.tests.test_API_elaborate.10} UNDEFINED UNIVERSES: elpi.tests.test_API_elaborate.10 WEAK CONSTRAINTS: Query assignments: GR = const «myi» myi : Reflexive R : Reflexive R «elpi.tests.test_API_notations.abbr» Query assignments: A = «elpi.tests.test_API_notations.abbr» _uvk_1_ = X0 _uvk_2_ = X1 _uvk_3_ = X2 Universe constraints: UNIVERSES: {elpi.tests.test_API_notations.3 elpi.tests.test_API_notations.2 elpi.tests.test_API_notations.1} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Notation abbr _elpi_ctx_entry_2_was_x_ _elpi_ctx_entry_1_ := (_elpi_ctx_entry_2_was_x_ = _elpi_ctx_entry_2_was_x_) Expands to: Notation elpi.tests.test_API_notations.abbr 4 = 4 : Prop H [nabla c1 \ seal (goal [decl c1 `H` (prod `b` (prod `b` (global (indt «bool»)) c2 \ app [global (indt «eq»), global (indt «bool»), c2, c2]) c2 \ global (indt «True»))] (X0 c1) (prod `b` (global (indt «bool»)) c2 \ app [global (indt «eq»), global (indt «bool»), c2, c2]) (X1 c1) [])] Query assignments: Spilled_1 = const «f» f : forall [S : Type], S -> Prop f is not universe polymorphic Arguments f [S]%type_scope / _ (where some original arguments have been renamed) The reduction tactics unfold f when applied to 1 argument f is transparent Expands to: Constant elpi.tests.test_API_arguments.f f (S:=bool * bool) : bool * bool -> Prop = fun x : bool => x = x : bool -> Prop Query assignments: X = «x» COQC tests/test_elaborator.v fx : nat -> nat : nat -> nat c2 global (indt «nat») z nat Query assignments: Spilled_1 = c0 \ c1 \ c2 \ nat Spilled_2 = c0 \ c1 \ c2 \ z T = global (indt «nat») COQC tests/test_derive_stdlib.v [attribute elpi.loc (leaf-loc File "./tests/test_vernacular1.v", line 48, column 5, character 947:), attribute foo (leaf-str bar)] [get-option elpi.loc File "./tests/test_vernacular1.v", line 48, column 5, character 947:, get-option foo bar] [attribute elpi.loc (leaf-loc File "./tests/test_vernacular1.v", line 52, column 0, character 981:), attribute foo (leaf-str bar), attribute poly (leaf-str )] [get-option elpi.loc File "./tests/test_vernacular1.v", line 52, column 0, character 981:, get-option foo bar, get-option poly tt] [attribute elpi.loc (leaf-loc File "./tests/test_vernacular1.v", line 53, column 0, character 1009:), attribute foo (leaf-str bar), attribute poly (leaf-str ), attribute suppa (node [attribute duppa (leaf-str )])] [get-option elpi.loc File "./tests/test_vernacular1.v", line 53, column 0, character 1009:, get-option foo bar, get-option poly tt] Query assignments: L = [tc-instance (const «inverse_impl_rewrite_relation») 3, tc-instance (const «impl_rewrite_relation») 3, tc-instance (const «iff_rewrite_relation») 2, tc-instance (const «relation_equivalence_rewrite_relation») 0, tc-instance (const «Equivalence_PER») 10, tc-instance (const «predicate_equivalence_equivalence») 0, tc-instance (const «relation_equivalence_equivalence») 0, tc-instance (const «eq_equivalence») 10, tc-instance (const «iff_equivalence») 0, tc-instance (const «relation_implication_preorder») 0, tc-instance (const «Equivalence_PreOrder») 10, tc-instance (const «predicate_implication_preorder») 0, tc-instance (const «subrelation_partial_order») 0, tc-instance (const «PER_Transitive») 3, tc-instance (const «PreOrder_Transitive») 2, tc-instance (const «iff_Transitive») 0, tc-instance (const «eq_Transitive») 0, tc-instance (const «Equivalence_Transitive») 0, tc-instance (const «impl_Transitive») 0, tc-instance (const «StrictOrder_Transitive») 0, tc-instance (const «StrictOrder_Irreflexive») 0, tc-instance (const «StrictOrder_Asymmetric») 0, tc-instance (const «Equivalence_Reflexive») 0, tc-instance (const «iff_Reflexive») 0, tc-instance (const «impl_Reflexive») 0, tc-instance (const «PreOrder_Reflexive») 2, tc-instance (const «eq_Reflexive») 0, tc-instance (const «myi») 10, tc-instance (const «partial_order_antisym») 0, tc-instance (const «eq_Symmetric») 0, tc-instance (const «Equivalence_Symmetric») 0, tc-instance (const «PER_Symmetric») 3, tc-instance (const «iff_Symmetric») 0] Query assignments: GR = «empty_nat» TY = global (indt «nat») raw: parameter A1 maximal (sort (typ «elpi.tests.test_arg_HOAS.2»)) c0 \ parameter A2 explicit c0 c1 \ inductive foo1 tt (parameter B1 explicit (sort (typ «elpi.tests.test_arg_HOAS.3»)) c2 \ parameter B2 explicit (sort (typ «elpi.tests.test_arg_HOAS.4»)) c3 \ arity (prod `_` (global (indt «nat»)) c4 \ sort (typ «elpi.tests.test_arg_HOAS.7»))) c2 \ [constructor a_k1 (parameter B1 explicit (sort (typ «elpi.tests.test_arg_HOAS.3»)) c3 \ parameter B2 explicit (sort (typ «elpi.tests.test_arg_HOAS.4»)) c4 \ arity (prod `x` (global (indt «nat»)) c5 \ prod `_` (app [c2, app [global (indt «prod»), c3, c3], c4, app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]]) c6 \ app [c2, c3, c4, c5])), constructor a_k2 (parameter B1 explicit (sort (typ «elpi.tests.test_arg_HOAS.3»)) c3 \ parameter B2 explicit (sort (typ «elpi.tests.test_arg_HOAS.4»)) c4 \ arity (prod `_` c0 c5 \ app [c2, c3, c4, app [global (indc «S»), global (indc «O»)]]))] typed: parameter A1 maximal (sort (typ «elpi.tests.test_arg_HOAS.2»)) c0 \ parameter A2 explicit c0 c1 \ inductive foo1 tt (parameter B1 explicit (sort (typ «elpi.tests.test_arg_HOAS.3»)) c2 \ parameter B2 explicit (sort (typ «elpi.tests.test_arg_HOAS.4»)) c3 \ arity (prod `_` (global (indt «nat»)) c4 \ sort (typ «elpi.tests.test_arg_HOAS.7»))) c2 \ [constructor a_k1 (parameter B1 explicit (sort (typ «elpi.tests.test_arg_HOAS.3»)) c3 \ parameter B2 explicit (sort (typ «elpi.tests.test_arg_HOAS.4»)) c4 \ arity (prod `x` (global (indt «nat»)) c5 \ prod `_` (app [c2, app [global (indt «prod»), c3, c3], c4, app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]]) c6 \ app [c2, c3, c4, c5])), constructor a_k2 (parameter B1 explicit (sort (typ «elpi.tests.test_arg_HOAS.3»)) c3 \ parameter B2 explicit (sort (typ «elpi.tests.test_arg_HOAS.4»)) c4 \ arity (prod `_` c0 c5 \ app [c2, c3, c4, app [global (indc «S»), global (indc «O»)]]))] foo1 ?A2 ?B1 ?B2 ?n : Type : Type where ?A1 : [ |- Type] ?A2 : [ |- ?A1] ?B1 : [ |- Type] ?B2 : [ |- Type] ?n : [ |- nat] a_k1 ?A2 ?B1 ?B2 3 ?f : foo1 ?A2 ?B1 ?B2 3 : foo1 ?A2 ?B1 ?B2 3 where ?A1 : [ |- Type] ?A2 : [ |- ?A1] ?B1 : [ |- Type] ?B2 : [ |- Type] ?f : [ |- foo1 ?A2 (?B1 * ?B1) ?B2 3] fix X0 0 (prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat»)) c0 \ fun `n` (global (indt «nat»)) c1 \ fun `m` (global (indt «nat»)) c2 \ match c1 (fun `n` (global (indt «nat»)) c3 \ X1 c2 c3) [c2, fun `p` (X2 c1 c2) c3 \ app [c0, c3, c2]] fix X0 0 (prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat»)) c0 \ fun `n` (global (indt «nat»)) c1 \ fun `m` (global (indt «nat»)) c2 \ match c1 (fun `n` (global (indt «nat»)) c3 \ global (indt «nat»)) [c2, fun `p` (X3 c1 c2) c3 \ app [c0, c3, c2]] Query assignments: BO1 = fix X0 0 (prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat»)) c0 \ fun `n` (global (indt «nat»)) c1 \ fun `m` (global (indt «nat»)) c2 \ match c1 (fun `n` (global (indt «nat»)) c3 \ global (indt «nat»)) [c2, fun `p` (X3 c1 c2) c3 \ app [c0, c3, c2]] GR = «Nat.add» TY = prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat») _uvk_1_ = c0 \ c1 \ global (indt «nat») _uvk_2_ = c0 \ c1 \ X3 c0 c1 Syntactic constraints: {c0 c1} : decl c1 `m` (global (indt «nat»)), decl c0 `n` (global (indt «nat»)) ?- evar (X3 c0 c1) (sort (typ «elpi.tests.test_quotation.2»)) (X3 c0 c1) /* suspended on X3 */ Universe constraints: UNIVERSES: {elpi.tests.test_quotation.3 elpi.tests.test_quotation.2 elpi.tests.test_quotation.1} |= Set <= elpi.tests.test_quotation.3 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: elpi.tests.test_quotation.3 WEAK CONSTRAINTS: raw: parameter A1 maximal X0 c0 \ parameter A2 explicit c0 c1 \ inductive foo1 tt (parameter B1 explicit (sort (typ X1)) c2 \ parameter B2 explicit (sort (typ X2)) c3 \ arity (prod `_` (global (indt «nat»)) c4 \ sort (typ X3))) c2 \ [constructor a_k1 (parameter B1 explicit (sort (typ X4)) c3 \ parameter B2 explicit (sort (typ X5)) c4 \ arity (prod `x` (X6 c0 c1 c2 c3 c4) c5 \ prod `_` (app [c2, app [global (indt «prod»), c3, c3], c4, app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]]) c6 \ app [c2, c3, c4, c5])), constructor a_k2 (parameter B1 explicit (sort (typ X7)) c3 \ parameter B2 explicit (sort (typ X8)) c4 \ arity (prod `_` c0 c5 \ app [c2, c3, c4, app [global (indc «S»), global (indc «O»)]]))] typed: parameter A1 maximal (sort (typ «elpi.tests.test_arg_HOAS.40»)) c0 \ parameter A2 explicit c0 c1 \ inductive foo1 tt (parameter B1 explicit (sort (typ «elpi.tests.test_arg_HOAS.42»)) c2 \ parameter B2 explicit (sort (typ «elpi.tests.test_arg_HOAS.45»)) c3 \ arity (prod `_` (global (indt «nat»)) c4 \ sort (typ «elpi.tests.test_arg_HOAS.48»))) c2 \ [constructor a_k1 (parameter B1 explicit (sort (typ «elpi.tests.test_arg_HOAS.53»)) c3 \ parameter B2 explicit (sort (typ «elpi.tests.test_arg_HOAS.55»)) c4 \ arity (prod `x` (global (indt «nat»)) c5 \ prod `_` (app [c2, app [global (indt «prod»), c3, c3], c4, app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]]) c6 \ app [c2, c3, c4, c5])), constructor a_k2 (parameter B1 explicit (sort (typ «elpi.tests.test_arg_HOAS.62»)) c3 \ parameter B2 explicit (sort (typ «elpi.tests.test_arg_HOAS.64»)) c4 \ arity (prod `_` c0 c5 \ app [c2, c3, c4, app [global (indc «S»), global (indc «O»)]]))] foo1 ?A2 ?B1 ?B2 ?n : Type : Type where ?A1 : [ |- Type] ?A2 : [ |- ?A1] ?B1 : [ |- Type] ?B2 : [ |- Type] ?n : [ |- nat] a_k1 ?A2 ?B1 ?B2 3 ?f : foo1 ?A2 ?B1 ?B2 3 : foo1 ?A2 ?B1 ?B2 3 where ?A1 : [ |- Type] ?A2 : [ |- ?A1] ?B1 : [ |- Type] ?B2 : [ |- Type] ?f : [ |- foo1 ?A2 (?B1 * ?B1) ?B2 3] c2 global (indt «nat») z nat Query assignments: Spilled_1 = c0 \ c1 \ c2 \ nat Spilled_2 = c0 \ c1 \ c2 \ z T = global (indt «nat») Query assignments: _uvk_6_ = X0 _uvk_7_ = X1 _uvk_8_ = X2 Universe constraints: UNIVERSES: {elpi.tests.test_API_notations.6 elpi.tests.test_API_notations.5 elpi.tests.test_API_notations.4} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Notation abbr2 _elpi_ctx_entry_1_was_x_ := (fun H => _elpi_ctx_entry_1_was_x_ = _elpi_ctx_entry_1_was_x_) Expands to: Notation elpi.tests.test_API_notations.abbr2 (fun _ : nat => 2 = 2) 3 : Prop elpi.tests.test_API_module.X.i [elpi, tests, test_API_module, X, Y] [elpi, tests, test_API_module, X, Y] Query assignments: L = [gref (indt «X.i»), gref (const «X.i_rect»), gref (const «X.i_ind»), gref (const «X.i_rec»), gref (const «X.i_sind»), gref (const «X.d»), submodule «elpi.tests.test_API_module.X.Y» [gref (indt «X.Y.i»), gref (const «X.Y.i_rect»), gref (const «X.Y.i_ind»), gref (const «X.Y.i_rec»), gref (const «X.Y.i_sind»), gref (const «X.Y.d»)]] MP = «elpi.tests.test_API_module.X» Spilled_1 = [elpi, tests, test_API_module, X, Y] Spilled_2 = [elpi, tests, test_API_module, X, Y] Spilled_3 = elpi.tests.test_API_module.X.Y.i Spilled_4 = elpi.tests.test_API_module.X.i Spilled_5 = elpi.tests.test_API_module.X.i XYi = «X.Y.i» XYr = «X.Y.i_rect» Xi = «X.i» hello world Query assignments: E = app [global (const «bar»), app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]], global (const «xxx»)] TY = prop _uvk_4_ = X0 _uvk_5_ = X1 [str fun, str in, str as, int 4, str end, str match, str return, str =>, str :, str :=, str {, str }, str ;, str ,, str |, str x, int 1, str H, trm (fun `x` (global (indt «False»)) c0 \ match c0 (fun `y` (global (indt «False»)) c1 \ global (indt «nat»)) [])] Query assignments: GR = indt «RewriteRelation» L = [tc-instance (const «inverse_impl_rewrite_relation») 3, tc-instance (const «impl_rewrite_relation») 3, tc-instance (const «iff_rewrite_relation») 2, tc-instance (const «relation_equivalence_rewrite_relation») 0] Illegal application (Non-functional construction): The expression "Prop" of type "Type" cannot be applied to the term "Prop" : "Type" Query assignments: E = Illegal application (Non-functional construction): The expression "Prop" of type "Type" cannot be applied to the term "Prop" : "Type" opaque_3 : nat opaque_3 is not universe polymorphic opaque_3 is opaque Expands to: Constant elpi.tests.test_API_section.opaque_3 Query assignments: GR1 = indc «Vector.nil» GR2 = indt «nat» GR3 = const «A» Unable to unify "bool" with "nat". Query assignments: Msg = Unable to unify "bool" with "nat". Query assignments: GR = indt «RewriteRelation» Query assignments: D = parameter A explicit (sort (typ «elpi.tests.test_arg_HOAS.79»)) c0 \ inductive t tt (parameter y explicit (global (indt «nat»)) c1 \ arity (sort (typ «elpi.tests.test_arg_HOAS.82»))) c1 \ [constructor K (parameter y explicit (global (indt «nat»)) c2 \ parameter x explicit c0 c3 \ parameter n maximal (global (indt «nat»)) c4 \ arity (prod `_` (app [c1, c4]) c5 \ app [c1, c2]))] I = «t» Universe constraints: UNIVERSES: {elpi.tests.test_arg_HOAS.82} |= Set <= elpi.tests.test_arg_HOAS.82 t.u0 <= elpi.tests.test_arg_HOAS.82 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: raw: record foo (sort (typ «Set»)) Build_foo (field [coercion off, canonical tt] f (prod `_` (global (indt «nat»)) c0 \ global (indt «nat»)) c0 \ field [coercion off, canonical tt] _ (app [global (indt «eq»), global (indt «nat»), app [c0, global (indc «O»)], global (indc «O»)]) c1 \ end-record) typed: record foo (sort (typ «Set»)) Build_foo (field [coercion off, canonical tt] f (prod `_` (global (indt «nat»)) c0 \ global (indt «nat»)) c0 \ field [coercion off, canonical tt] _ (app [global (indt «eq»), global (indt «nat»), app [c0, global (indc «O»)], global (indc «O»)]) c1 \ end-record) raw: record foo (sort (typ X0)) Build_foo (field [coercion off, canonical tt] f (prod `_` (global (indt «nat»)) c0 \ global (indt «nat»)) c0 \ field [coercion off, canonical tt] _ (app [global (indt «eq»), X1 c0, app [c0, global (indc «O»)], global (indc «O»)]) c1 \ end-record) typed: record foo (sort (typ «elpi.tests.test_arg_HOAS.86»)) Build_foo (field [coercion off, canonical tt] f (prod `_` (global (indt «nat»)) c0 \ global (indt «nat»)) c0 \ field [coercion off, canonical tt] _ (app [global (indt «eq»), global (indt «nat»), app [c0, global (indc «O»)], global (indc «O»)]) c1 \ end-record) raw: parameter A explicit (sort (typ «elpi.tests.test_arg_HOAS.88»)) c0 \ parameter B explicit c0 c1 \ record foo (sort (typ «elpi.tests.test_arg_HOAS.88»)) Build_foo (field [coercion off, canonical tt] a (prod `_` c0 c2 \ prod `_` c0 c3 \ c0) c2 \ field [coercion reversible, canonical tt] z (prod `a` c0 c3 \ prod `_` (app [global (indt «eq»), c0, c1, c1]) c4 \ c0) c3 \ field [coercion off, canonical ff] x (let `w` (global (indt «nat»)) (app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]) c4 \ prod `x` c0 c5 \ app [global (indt «eq»), c0, app [c2, c5, c5], c5]) c4 \ end-record) typed: parameter A explicit (sort (typ «elpi.tests.test_arg_HOAS.88»)) c0 \ parameter B explicit c0 c1 \ record foo (sort (typ «elpi.tests.test_arg_HOAS.88»)) Build_foo (field [coercion off, canonical tt] a (prod `_` c0 c2 \ prod `_` c0 c3 \ c0) c2 \ field [coercion reversible, canonical tt] z (prod `a` c0 c3 \ prod `_` (app [global (indt «eq»), c0, c1, c1]) c4 \ c0) c3 \ field [coercion off, canonical ff] x (let `w` (global (indt «nat»)) (app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]) c4 \ prod `x` c0 c5 \ app [global (indt «eq»), c0, app [c2, c5, c5], c5]) c4 \ end-record) fun `H` X0 c0 \ app [global (indt «eq»), X1 c0, fun `x` X2 c1 \ c1, fun `x` X2 c1 \ c1] Query assignments: Spilled_1 = «elpi.tests.test_API_notations.abbr2» T = fun `H` X0 c0 \ app [global (indt «eq»), X1 c0, fun `x` X2 c1 \ c1, fun `x` X2 c1 \ c1] _uvk_11_ = X2 Query assignments: B = fix `add` 0 (prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat»)) c0 \ fun `n` (global (indt «nat»)) c1 \ fun `m` (global (indt «nat»)) c2 \ match c1 (fun `n` (global (indt «nat»)) c3 \ global (indt «nat»)) [c2, fun `p` (global (indt «nat»)) c3 \ app [global (indc «S»), app [c0, c3, c2]]] GR = «Nat.add» RB = fix `add` 0 (prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat»)) c0 \ fun `n` (global (indt «nat»)) c1 \ fun `m` (global (indt «nat»)) c2 \ match c1 (fun `n` (global (indt «nat»)) c3 \ global (indt «nat»)) [c2, fun `p` (global (indt «nat»)) c3 \ app [global (indc «S»), app [c0, c3, c2]]] T = prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat») TY = prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat») Syntactic constraints: {c0 c1 c2 c3} : decl c3 `n` (global (indt «nat»)), decl c2 `m` (global (indt «nat»)), decl c1 `n` (global (indt «nat»)), decl c0 `add` (prod `n` (global (indt «nat»)) c1 \ prod `m` (global (indt «nat»)) c2 \ global (indt «nat»)) ?- evar (X0 c0 c1 c2 c3) (sort (typ «elpi.tests.test_elaborator.17»)) (X1 c0 c1 c2 c3) /* suspended on X0, X1 */ Universe constraints: UNIVERSES: {elpi.tests.test_elaborator.23 elpi.tests.test_elaborator.22 elpi.tests.test_elaborator.21 elpi.tests.test_elaborator.20 elpi.tests.test_elaborator.19 elpi.tests.test_elaborator.18 elpi.tests.test_elaborator.17 elpi.tests.test_elaborator.16 elpi.tests.test_elaborator.15 elpi.tests.test_elaborator.14 elpi.tests.test_elaborator.13 elpi.tests.test_elaborator.12 elpi.tests.test_elaborator.11 elpi.tests.test_elaborator.10 elpi.tests.test_elaborator.9 elpi.tests.test_elaborator.8 elpi.tests.test_elaborator.7 elpi.tests.test_elaborator.6 elpi.tests.test_elaborator.5 elpi.tests.test_elaborator.4 elpi.tests.test_elaborator.3 elpi.tests.test_elaborator.2 elpi.tests.test_elaborator.1} |= Set <= elpi.tests.test_elaborator.1 Set <= elpi.tests.test_elaborator.2 Set <= elpi.tests.test_elaborator.3 Set <= elpi.tests.test_elaborator.8 Set <= elpi.tests.test_elaborator.12 Set <= elpi.tests.test_elaborator.16 Set <= elpi.tests.test_elaborator.20 elpi.tests.test_elaborator.1 <= elpi.tests.test_elaborator.6 elpi.tests.test_elaborator.2 <= elpi.tests.test_elaborator.4 elpi.tests.test_elaborator.3 <= elpi.tests.test_elaborator.4 elpi.tests.test_elaborator.4 <= elpi.tests.test_elaborator.5 elpi.tests.test_elaborator.5 <= elpi.tests.test_elaborator.6 elpi.tests.test_elaborator.6 <= elpi.tests.test_elaborator.7 elpi.tests.test_elaborator.8 <= elpi.tests.test_elaborator.10 elpi.tests.test_elaborator.9 <= elpi.tests.test_elaborator.10 elpi.tests.test_elaborator.10 <= elpi.tests.test_elaborator.11 elpi.tests.test_elaborator.12 <= elpi.tests.test_elaborator.14 elpi.tests.test_elaborator.13 <= elpi.tests.test_elaborator.14 elpi.tests.test_elaborator.14 <= elpi.tests.test_elaborator.15 elpi.tests.test_elaborator.16 <= elpi.tests.test_elaborator.18 elpi.tests.test_elaborator.17 <= elpi.tests.test_elaborator.18 elpi.tests.test_elaborator.18 <= elpi.tests.test_elaborator.19 elpi.tests.test_elaborator.20 <= elpi.tests.test_elaborator.22 elpi.tests.test_elaborator.21 <= elpi.tests.test_elaborator.22 elpi.tests.test_elaborator.22 <= elpi.tests.test_elaborator.23 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: fun `v` (app [global (indt «Vector.t»), global (indt «nat»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]) c0 \ match c0 (fun `_` (X0 c0) c1 \ fun `v` (app [global (indt «Vector.t»), X1 c0 c1, X2 c0 c1]) c2 \ X3 c1 c2) [global (indc «O»), fun `_` (X4 c0) c1 \ fun `_` (X5 c0 c1) c2 \ fun `_` (X6 c0 c1 c2) c3 \ app [global (indc «S»), global (indc «O»)]] fun `v` (app [global (indt «Vector.t»), global (indt «nat»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]) c0 \ match c0 (fun `_` (X7 c0) c1 \ fun `v` (app [global (indt «Vector.t»), global (indt «nat»), X8 c0 c1]) c2 \ global (indt «nat»)) [global (indc «O»), fun `_` (X9 c0) c1 \ fun `_` (X10 c0 c1) c2 \ fun `_` (X11 c0 c1 c2) c3 \ app [global (indc «S»), global (indc «O»)]] Query assignments: T = fun `v` (app [global (indt «Vector.t»), global (indt «nat»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]) c0 \ match c0 (fun `_` (X7 c0) c1 \ fun `v` (app [global (indt «Vector.t»), global (indt «nat»), X8 c0 c1]) c2 \ global (indt «nat»)) [global (indc «O»), fun `_` (X9 c0) c1 \ fun `_` (X10 c0 c1) c2 \ fun `_` (X11 c0 c1 c2) c3 \ app [global (indc «S»), global (indc «O»)]] _uvk_10_ = c0 \ c1 \ global (indt «nat») _uvk_11_ = c0 \ X9 c0 _uvk_12_ = c0 \ c1 \ X10 c0 c1 _uvk_13_ = c0 \ c1 \ c2 \ X11 c0 c1 c2 _uvk_7_ = c0 \ X7 c0 _uvk_8_ = c0 \ c1 \ global (indt «nat») _uvk_9_ = c0 \ c1 \ X8 c0 c1 Syntactic constraints: {c0 c1 c2} : decl c2 `y0` (X10 c0 c1), decl c1 `y` (X9 c0), decl c0 `v` (app [global (indt «Vector.t»), global (indt «nat»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]) ?- evar (X11 c0 c1 c2) (sort (typ «elpi.tests.test_quotation.10»)) (X11 c0 c1 c2) /* suspended on X11 */ {c0 c1} : decl c1 `y` (X9 c0), decl c0 `v` (app [global (indt «Vector.t»), global (indt «nat»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]) ?- evar (X10 c0 c1) (sort (typ «elpi.tests.test_quotation.9»)) (X10 c0 c1) /* suspended on X10 */ {c0} : decl c0 `v` (app [global (indt «Vector.t»), global (indt «nat»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]) ?- evar (X9 c0) (sort (typ «elpi.tests.test_quotation.8»)) (X9 c0) /* suspended on X9 */ {c0 c1} : decl c1 `y` (X7 c0), decl c0 `v` (app [global (indt «Vector.t»), global (indt «nat»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]) ?- evar (X8 c0 c1) (X12 c0 c1) (X8 c0 c1) /* suspended on X8 */ {c0 c1} : decl c1 `y` (X7 c0), decl c0 `v` (app [global (indt «Vector.t»), global (indt «nat»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]) ?- evar (X13 c0 c1) (sort (typ «elpi.tests.test_quotation.6»)) (X12 c0 c1) /* suspended on X13, X12 */ {c0} : decl c0 `v` (app [global (indt «Vector.t»), global (indt «nat»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]) ?- evar (X7 c0) (sort (typ «elpi.tests.test_quotation.4»)) (X7 c0) /* suspended on X7 */ Universe constraints: UNIVERSES: {elpi.tests.test_quotation.12 elpi.tests.test_quotation.11 elpi.tests.test_quotation.10 elpi.tests.test_quotation.9 elpi.tests.test_quotation.8 elpi.tests.test_quotation.7 elpi.tests.test_quotation.6 elpi.tests.test_quotation.5 elpi.tests.test_quotation.4} |= elpi.tests.test_quotation.11 < elpi.tests.test_quotation.5 Set <= Vector.t.u0 Set <= elpi.tests.test_quotation.11 Set <= elpi.tests.test_quotation.12 elpi.tests.test_quotation.11 <= Vector.t.u0 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: elpi.tests.test_quotation.12 WEAK CONSTRAINTS: Query assignments: I = «Y.i» ID = j J = «Y.j» MP = «elpi.tests.test_API_module.Y» P = [elpi, tests, test_API_module, Y] Query assignments: E = app [global (const «op»), global (const «c»), app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]] TY = app [global (const «field»), global (const «c»)] _uvk_6_ = X0 Universe constraints: UNIVERSES: {elpi.tests.test_API_elaborate.19 elpi.tests.test_API_elaborate.18} |= elpi.tests.test_API_elaborate.19 < elpi.tests.test_API_elaborate.18 s.u0 <= elpi.tests.test_API_elaborate.19 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Query assignments: T = sort (typ «elpi.tests.test_HOAS.3») U = «elpi.tests.test_HOAS.3» Query assignments: GR = indt «True» Query assignments: X = 3 app [global (const «Nat.mul»), X0, X1] type COQC tests/test_ltac.v Query assignments: Cons = global (indc «cons») GRCons = indc «cons» GRList = indt «list» GRNat = indt «nat» GRNil = indc «nil» GRZero = indc «O» L = app [global (indc «cons»), global (indt «nat»), global (indc «O»), app [global (indc «nil»), global (indt «nat»)]] LE = app [global (indc «cons»), global (indt «nat»), global (indc «O»), app [global (indc «nil»), global (indt «nat»)]] List = global (indt «list») Nat = global (indt «nat») Nil = global (indc «nil») Zero = global (indc «O») Universe constraints: UNIVERSES: {elpi.tests.test_API_typecheck.4 elpi.tests.test_API_typecheck.3 elpi.tests.test_API_typecheck.2 elpi.tests.test_API_typecheck.1} |= elpi.tests.test_API_typecheck.3 < elpi.tests.test_API_typecheck.2 elpi.tests.test_API_typecheck.4 < elpi.tests.test_API_typecheck.1 Set <= elpi.tests.test_API_typecheck.3 Set <= elpi.tests.test_API_typecheck.4 elpi.tests.test_API_typecheck.3 <= list.u0 elpi.tests.test_API_typecheck.4 <= list.u0 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Query assignments: GRy = EXN PRINTING: Not_found I = EXN PRINTING: Not_found L = [gref (const «A.z»), gref (const «A.i»)] MP = «elpi.tests.test_API_module.A» MP_TA = «elpi.tests.test_API_module.TA» type_1 = «elpi.tests.test_API_module.10» type_2 = «elpi.tests.test_API_module.11» Universe constraints: UNIVERSES: ALGEBRAIC UNIVERSES: {elpi.tests.test_API_module.11 A.i.u0} UNDEFINED UNIVERSES: elpi.tests.test_API_module.11 elpi.tests.test_API_module.10 WEAK CONSTRAINTS: Module A : TA := Struct Definition x Module B Definition z Inductive i1 Definition i1_rect Definition i1_ind Definition i1_rec Definition i1_sind Definition i End A.z : nat A.i : Type *** [ A.i : Type ] COQC tests/test_param2.v 3 Query assignments: X = 3 add_equal Query assignments: BO = fix `add` 0 (prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat»)) c0 \ fun `n` (global (indt «nat»)) c1 \ fun `m` (global (indt «nat»)) c2 \ match c1 (fun `n` (global (indt «nat»)) c3 \ global (indt «nat»)) [c2, fun `p` (global (indt «nat»)) c3 \ app [global (indc «S»), app [c0, c3, c2]]] GR = «Nat.add» NGR = «add_equal» Name = add_equal S = add Spilled_1 = add_equal Spilled_2 = add_equal TY = prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat») add_equal : nat -> nat -> nat add_equal is not universe polymorphic Arguments add_equal (n m)%nat_scope add_equal is opaque Expands to: Constant elpi.tests.test_API_env.add_equal {c0 c1 c2 c3} : decl c3 `w` c0, decl c2 `h` (app [global (indt «eq»), global (indt «nat»), global (const «o»), global (const «m»)]), decl c1 `x` (prod `y` c0 c4 \ sort (typ «elpi.tests.test_tactic.2»)), decl c0 `T` (sort (typ «elpi.tests.test_tactic.1»)) ?- evar (X0 c0 c1 c2 c3) (prod `e` (app [global (indt «eq»), sort (typ «elpi.tests.test_tactic.2»), app [c1, c3], sort (typ «elpi.tests.test_tactic.3»)]) c4 \ prod `j` (app [c1, c3]) c5 \ app [global (indt «ex»), app [c1, c3], fun `a` (app [c1, c3]) c6 \ app [global (indt «eq»), app [c1, c3], c6, c6]]) (X1 c0 c1 c2 c3) /* suspended on X0, X1 */ Goal: [] [decl c3 `w` c0, decl c2 `h` (app [global (indt «eq»), global (indt «nat»), global (const «o»), global (const «m»)]), decl c1 `x` (prod `y` c0 c4 \ sort (typ «elpi.tests.test_tactic.2»)), decl c0 `T` (sort (typ «elpi.tests.test_tactic.1»))] ------------ prod `e` (app [global (indt «eq»), sort (typ «elpi.tests.test_tactic.2»), app [c1, c3], sort (typ «elpi.tests.test_tactic.3»)]) c4 \ prod `j` (app [c1, c3]) c5 \ app [global (indt «ex»), app [c1, c3], fun `a` (app [c1, c3]) c6 \ app [global (indt «eq»), app [c1, c3], c6, c6]] x w = Type -> x w -> exists a : x w, a = a {c0 c1 c2 c3} : decl c3 `w` c0, decl c2 `h` (app [global (indt «eq»), global (indt «nat»), global (const «o»), global (const «m»)]), decl c1 `x` (prod `y` c0 c4 \ sort (typ «elpi.tests.test_tactic.2»)), decl c0 `T` (sort (typ «elpi.tests.test_tactic.1»)) ?- evar (X0 c0 c1 c2 c3) (prod `e` (app [global (indt «eq»), sort (typ «elpi.tests.test_tactic.2»), app [c1, c3], sort (typ «elpi.tests.test_tactic.3»)]) c4 \ prod `j` (app [c1, c3]) c5 \ app [global (indt «ex»), app [c1, c3], fun `a` (app [c1, c3]) c6 \ app [global (indt «eq»), app [c1, c3], c6, c6]]) (X1 c0 c1 c2 c3) /* suspended on X0, X1 */ Goal: [] [decl c3 `w` c0, decl c2 `h` (app [global (indt «eq»), global (indt «nat»), global (const «o»), global (const «m»)]), decl c1 `x` (prod `y` c0 c4 \ sort (typ «elpi.tests.test_tactic.2»)), decl c0 `T` (sort (typ «elpi.tests.test_tactic.1»))] ------------ prod `e` (app [global (indt «eq»), sort (typ «elpi.tests.test_tactic.2»), app [c1, c3], sort (typ «elpi.tests.test_tactic.3»)]) c4 \ prod `j` (app [c1, c3]) c5 \ app [global (indt «ex»), app [c1, c3], fun `a` (app [c1, c3]) c6 \ app [global (indt «eq»), app [c1, c3], c6, c6]] x w = Type -> x w -> exists a : x w, a = a {c0 c1 c2 c3 c4 c5} : decl c5 `j` (app [c1, c3]), decl c4 `e` (app [global (indt «eq»), sort (typ «elpi.tests.test_tactic.2»), app [c1, c3], sort (typ «elpi.tests.test_tactic.3»)]), decl c3 `w` c0, decl c2 `h` (app [global (indt «eq»), global (indt «nat»), global (const «o»), global (const «m»)]), decl c1 `x` (prod `y` c0 c6 \ sort (typ «elpi.tests.test_tactic.2»)), decl c0 `T` (sort (typ «elpi.tests.test_tactic.1»)) ?- evar (X0 c0 c1 c2 c3 c4 c5) (app [c1, c3]) (X1 c0 c1 c2 c3 c4 c5) /* suspended on X0, X1 */ {c0 c1 c2 c3 c4 c5} : decl c5 `j` (app [c1, c3]), decl c4 `e` (app [global (indt «eq»), sort (typ «elpi.tests.test_tactic.2»), app [c1, c3], sort (typ «elpi.tests.test_tactic.3»)]), decl c3 `w` c0, decl c2 `h` (app [global (indt «eq»), global (indt «nat»), global (const «o»), global (const «m»)]), decl c1 `x` (prod `y` c0 c6 \ sort (typ «elpi.tests.test_tactic.2»)), decl c0 `T` (sort (typ «elpi.tests.test_tactic.1»)) ?- evar (X2 c0 c1 c2 c3 c4 c5) (app [global (indt «eq»), app [c1, c3], X1 c0 c1 c2 c3 c4 c5, X1 c0 c1 c2 c3 c4 c5]) (X3 c0 c1 c2 c3 c4 c5) /* suspended on X2, X3 */ Goal: [] [decl c5 `j` (app [c1, c3]), decl c4 `e` (app [global (indt «eq»), sort (typ «elpi.tests.test_tactic.2»), app [c1, c3], sort (typ «elpi.tests.test_tactic.3»)]), decl c3 `w` c0, decl c2 `h` (app [global (indt «eq»), global (indt «nat»), global (const «o»), global (const «m»)]), decl c1 `x` (prod `y` c0 c6 \ sort (typ «elpi.tests.test_tactic.2»)), decl c0 `T` (sort (typ «elpi.tests.test_tactic.1»))] ------------ app [global (indt «eq»), app [c1, c3], X1 c0 c1 c2 c3 c4 c5, X1 c0 c1 c2 c3 c4 c5] ?elpi_evar = ?elpi_evar {c0 c1 c2 c3 c4 c5} : decl c5 `j` (app [c1, c3]), decl c4 `e` (app [global (indt «eq»), sort (typ «elpi.tests.test_tactic.2»), app [c1, c3], sort (typ «elpi.tests.test_tactic.3»)]), decl c3 `w` c0, decl c2 `h` (app [global (indt «eq»), global (indt «nat»), global (const «o»), global (const «m»)]), decl c1 `x` (prod `y` c0 c6 \ sort (typ «elpi.tests.test_tactic.2»)), decl c0 `T` (sort (typ «elpi.tests.test_tactic.1»)) ?- evar (X0 c0 c1 c2 c3 c4 c5) (app [c1, c3]) (X1 c0 c1 c2 c3 c4 c5) /* suspended on X0, X1 */ {c0 c1 c2 c3 c4 c5} : decl c5 `j` (app [c1, c3]), decl c4 `e` (app [global (indt «eq»), sort (typ «elpi.tests.test_tactic.2»), app [c1, c3], sort (typ «elpi.tests.test_tactic.3»)]), decl c3 `w` c0, decl c2 `h` (app [global (indt «eq»), global (indt «nat»), global (const «o»), global (const «m»)]), decl c1 `x` (prod `y` c0 c6 \ sort (typ «elpi.tests.test_tactic.2»)), decl c0 `T` (sort (typ «elpi.tests.test_tactic.1»)) ?- evar (X2 c0 c1 c2 c3 c4 c5) (app [global (indt «eq»), app [c1, c3], X1 c0 c1 c2 c3 c4 c5, X1 c0 c1 c2 c3 c4 c5]) (X3 c0 c1 c2 c3 c4 c5) /* suspended on X2, X3 */ Goal: [] [decl c5 `j` (app [c1, c3]), decl c4 `e` (app [global (indt «eq»), sort (typ «elpi.tests.test_tactic.2»), app [c1, c3], sort (typ «elpi.tests.test_tactic.3»)]), decl c3 `w` c0, decl c2 `h` (app [global (indt «eq»), global (indt «nat»), global (const «o»), global (const «m»)]), decl c1 `x` (prod `y` c0 c6 \ sort (typ «elpi.tests.test_tactic.2»)), decl c0 `T` (sort (typ «elpi.tests.test_tactic.1»))] ------------ app [global (indt «eq»), app [c1, c3], X1 c0 c1 c2 c3 c4 c5, X1 c0 c1 c2 c3 c4 c5] ?elpi_evar0 = ?elpi_evar0 Query assignments: I = «foo» raw: parameter A explicit X0 c0 \ parameter B explicit c0 c1 \ record foo (sort (typ X1)) Build_foo (field [coercion off, canonical tt] a (prod `_` c0 c2 \ prod `_` c0 c3 \ c0) c2 \ field [coercion reversible, canonical tt] z (prod `a` c0 c3 \ prod `_` (app [global (indt «eq»), X2 c0 c1 c3, c1, c1]) c4 \ c0) c3 \ field [coercion off, canonical ff] x (let `w` (X3 c0 c1 c2 c3) (app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]) c4 \ prod `x` (X4 c0 c1 c2 c3 c4) c5 \ app [global (indt «eq»), X5 c0 c1 c2 c3 c4 c5, app [c2, c5, c5], c5]) c4 \ end-record) typed: parameter A explicit (sort (typ «elpi.tests.test_arg_HOAS.94»)) c0 \ parameter B explicit c0 c1 \ record foo (sort (typ «elpi.tests.test_arg_HOAS.96»)) Build_foo (field [coercion off, canonical tt] a (prod `_` c0 c2 \ prod `_` c0 c3 \ c0) c2 \ field [coercion reversible, canonical tt] z (prod `elpi_ctx_entry_4_` c0 c3 \ prod `_` (app [global (indt «eq»), c0, c1, c1]) c4 \ c0) c3 \ field [coercion off, canonical ff] x (let `w` (global (indt «nat»)) (app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]) c4 \ prod `x` c0 c5 \ app [global (indt «eq»), c0, app [c2, c5, c5], c5]) c4 \ end-record) Query assignments: B = fun `n` (global (indt «nat»)) c0 \ app [global (const «nat_ind»), fun `n` (global (indt «nat»)) c1 \ app [global (indt «eq»), global (indt «nat»), c1, app [global (const «Nat.add»), c1, global (indc «O»)]], let `_` (app [global (indt «eq»), global (indt «nat»), global (indc «O»), app [global (const «Nat.add»), global (indc «O»), global (indc «O»)]]) (app [global (indc «eq_refl»), global (indt «nat»), global (indc «O»)]) c1 \ c1, fun `n` (global (indt «nat»)) c1 \ fun `IHn` (app [global (indt «eq»), global (indt «nat»), c1, app [global (const «Nat.add»), c1, global (indc «O»)]]) c2 \ let `_` (app [global (indt «eq»), global (indt «nat»), app [global (indc «S»), c1], app [global (const «Nat.add»), app [global (indc «S»), c1], global (indc «O»)]]) (app [global (const «f_equal_nat»), global (indt «nat»), global (indc «S»), c1, app [global (const «Nat.add»), c1, global (indc «O»)], c2]) c3 \ c3, c0] GR = «plus_n_O» RB = fun `n` (global (indt «nat»)) c0 \ app [global (const «nat_ind»), fun `n` (global (indt «nat»)) c1 \ app [global (indt «eq»), global (indt «nat»), c1, app [global (const «Nat.add»), c1, global (indc «O»)]], let `_` (app [global (indt «eq»), global (indt «nat»), global (indc «O»), app [global (const «Nat.add»), global (indc «O»), global (indc «O»)]]) (app [global (indc «eq_refl»), global (indt «nat»), global (indc «O»)]) c1 \ c1, fun `n` (global (indt «nat»)) c1 \ fun `IHn` (app [global (indt «eq»), global (indt «nat»), c1, app [global (const «Nat.add»), c1, global (indc «O»)]]) c2 \ let `_` (app [global (indt «eq»), global (indt «nat»), app [global (indc «S»), c1], app [global (const «Nat.add»), app [global (indc «S»), c1], global (indc «O»)]]) (app [global (const «f_equal_nat»), global (indt «nat»), global (indc «S»), c1, app [global (const «Nat.add»), c1, global (indc «O»)], c2]) c3 \ c3, c0] TY = prod `n` (global (indt «nat»)) c0 \ app [global (indt «eq»), global (indt «nat»), c0, app [global (const «Nat.add»), c0, global (indc «O»)]] Universe constraints: UNIVERSES: {elpi.tests.test_elaborator.38 elpi.tests.test_elaborator.37 elpi.tests.test_elaborator.36 elpi.tests.test_elaborator.35 elpi.tests.test_elaborator.34 elpi.tests.test_elaborator.33 elpi.tests.test_elaborator.32 elpi.tests.test_elaborator.31 elpi.tests.test_elaborator.30 elpi.tests.test_elaborator.29 elpi.tests.test_elaborator.28 elpi.tests.test_elaborator.27 elpi.tests.test_elaborator.26 elpi.tests.test_elaborator.25 elpi.tests.test_elaborator.24} |= Set <= eq.u0 Set <= Coq.Init.Logic.11 Set <= elpi.tests.test_elaborator.24 Set <= elpi.tests.test_elaborator.28 Set <= elpi.tests.test_elaborator.32 elpi.tests.test_elaborator.24 <= elpi.tests.test_elaborator.26 elpi.tests.test_elaborator.25 <= elpi.tests.test_elaborator.26 elpi.tests.test_elaborator.26 <= elpi.tests.test_elaborator.27 elpi.tests.test_elaborator.28 <= elpi.tests.test_elaborator.30 elpi.tests.test_elaborator.29 <= elpi.tests.test_elaborator.30 elpi.tests.test_elaborator.30 <= elpi.tests.test_elaborator.31 elpi.tests.test_elaborator.32 <= elpi.tests.test_elaborator.34 elpi.tests.test_elaborator.33 <= elpi.tests.test_elaborator.34 elpi.tests.test_elaborator.34 <= elpi.tests.test_elaborator.35 elpi.tests.test_elaborator.36 <= elpi.tests.test_elaborator.37 elpi.tests.test_elaborator.37 <= elpi.tests.test_elaborator.38 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Query assignments: Spilled_1 = «elpi.tests.test_API_notations.abbr2» COQC tests/test_cache_async.v raw: parameter A explicit (global (const «T1»)) c0 \ inductive ind1 tt (parameter B explicit (sort (typ «elpi.tests.test_API_elaborate.20»)) c1 \ arity (sort (typ «elpi.tests.test_API_elaborate.22»))) c1 \ [constructor K1 (parameter B explicit (sort (typ «elpi.tests.test_API_elaborate.20»)) c2 \ arity (prod `_` (app [c1, c2]) c3 \ app [c1, c2])), constructor K2 (parameter B explicit (sort (typ «elpi.tests.test_API_elaborate.20»)) c2 \ arity (prod `_` (app [global (const «f1»), c0]) c3 \ app [c1, c2])), constructor K3 (parameter B explicit (sort (typ «elpi.tests.test_API_elaborate.20»)) c2 \ arity (prod `a` (app [global (const «f1»), c0]) c3 \ app [c1, c2]))] elab1: parameter A explicit (global (const «T1»)) c0 \ inductive ind1 tt (parameter B explicit (sort (typ «elpi.tests.test_API_elaborate.23»)) c1 \ arity (sort (typ «elpi.tests.test_API_elaborate.25»))) c1 \ [constructor K1 (parameter B explicit (sort (typ «elpi.tests.test_API_elaborate.28»)) c2 \ arity (prod `_` (app [c1, c2]) c3 \ app [c1, c2])), constructor K2 (parameter B explicit (sort (typ «elpi.tests.test_API_elaborate.30»)) c2 \ arity (prod `_` (app [global (const «f1»), c0]) c3 \ app [c1, c2])), constructor K3 (parameter B explicit (sort (typ «elpi.tests.test_API_elaborate.33»)) c2 \ arity (prod `_` (app [global (const «f1»), c0]) c3 \ app [c1, c2]))] «myfalse» Query assignments: F = indt «False» GR = «myfalse» elab2: parameter A explicit (global (const «T1»)) c0 \ parameter B explicit (sort (typ «elpi.tests.test_API_elaborate.23»)) c1 \ inductive ind1 tt (arity (sort (typ «elpi.tests.test_API_elaborate.25»))) c2 \ [constructor K1 (arity (prod `_` c2 c3 \ c2)), constructor K2 (arity (prod `_` (app [global (const «f1»), c0]) c3 \ c2)), constructor K3 (arity (prod `_` (app [global (const «f1»), c0]) c3 \ c2))] myfalse : False raw: parameter A explicit (global (const «T1»)) c0 \ record ind2 (sort (typ «elpi.tests.test_API_elaborate.4»)) Build_ind2 (field [coercion off, canonical tt] fld1 (app [global (const «f1»), c0]) c1 \ field [coercion off, canonical tt] fld2 (app [global (indt «eq»), app [global (const «f1»), c0], c1, c1]) c2 \ end-record) elab1: parameter A explicit (global (const «T1»)) c0 \ record ind2 (sort (typ «elpi.tests.test_API_elaborate.38»)) Build_ind2 (field [coercion off, canonical tt] fld1 (app [global (const «f1»), c0]) c1 \ field [coercion off, canonical tt] fld2 (app [global (indt «eq»), app [global (const «f1»), c0], c1, c1]) c2 \ end-record) elab2: parameter A explicit (global (const «T1»)) c0 \ record ind2 (sort (typ «elpi.tests.test_API_elaborate.38»)) Build_ind2 (field [coercion off, canonical tt] fld1 (app [global (const «f1»), c0]) c1 \ field [coercion off, canonical tt] fld2 (app [global (indt «eq»), app [global (const «f1»), c0], c1, c1]) c2 \ end-record) raw: record ind3 (sort (typ «elpi.tests.test_API_elaborate.41»)) Build_ind3 (field [coercion reversible, canonical tt] fld3 (sort (typ «elpi.tests.test_API_elaborate.40»)) c0 \ field [coercion off, canonical tt] fld4 (prod `x` c0 c1 \ app [global (indt «eq»), c0, c1, c1]) c1 \ end-record) elab1: record ind3 (sort (typ «elpi.tests.test_API_elaborate.42»)) Build_ind3 (field [coercion reversible, canonical tt] fld3 (sort (typ «elpi.tests.test_API_elaborate.43»)) c0 \ field [coercion off, canonical tt] fld4 (prod `x` c0 c1 \ app [global (indt «eq»), c0, c1, c1]) c1 \ end-record) elab2: record ind3 (sort (typ «elpi.tests.test_API_elaborate.42»)) Build_ind3 (field [coercion reversible, canonical tt] fld3 (sort (typ «elpi.tests.test_API_elaborate.43»)) c0 \ field [coercion off, canonical tt] fld4 (prod `x` c0 c1 \ app [global (indt «eq»), c0, c1, c1]) c1 \ end-record) forall x : ind3, x -> Prop : Type nth_R = fun (T T0 : Type) (T1 : T -> T0 -> Type) (x0 : T) (x1 : T0) (x2 : T1 x0 x1) => let fix rec (n : nat) (l : list T) {struct n} : T := match l with | nil => x0 | (x :: xs)%list => match n with | 0 => x | S m => rec m xs end end in let fix rec0 (n : nat) (l : list T0) {struct n} : T0 := match l with | nil => x1 | (x :: xs)%list => match n with | 0 => x | S m => rec0 m xs end end in fix rec1 (n n0 : nat) (n1 : nat_R n n0) {struct n1} : forall (l : list T) (l0 : list T0), list_R T T0 T1 l l0 -> T1 (rec n l) (rec0 n0 l0) := match n1 in (nat_R s1 s2) return (forall (l : list T) (l0 : list T0), list_R T T0 T1 l l0 -> T1 (rec s1 l) (rec0 s2 l0)) with | O_R => let K := O_R in (fun (n2 n3 : nat) (n4 : nat_R n2 n3) (l : list T) (l0 : list T0) (l1 : list_R T T0 T1 l l0) => match l1 in (list_R _ _ _ l2 l3) return (T1 match l2 with | nil => x0 | (x :: xs)%list => match n2 with | 0 => x | S m => rec m xs end end match l3 with | nil => x1 | (x :: xs)%list => match n3 with | 0 => x | S m => rec0 m xs end end) with | nil_R _ _ _ => x2 | cons_R _ _ _ x x3 x4 xs xs0 xs1 => match n4 in (nat_R n5 n6) return (T1 match n5 with | 0 => x | S m => rec m xs end match n6 with | 0 => x3 | S m => rec0 m xs0 end) with | O_R => x4 | S_R m m0 m1 => rec1 m m0 m1 xs xs0 xs1 end end) 0 0 K | S_R x x3 x4 => let K := S_R x x3 x4 in (fun (n2 n3 : nat) (n4 : nat_R n2 n3) (l : list T) (l0 : list T0) (l1 : list_R T T0 T1 l l0) => match l1 in (list_R _ _ _ l2 l3) return (T1 match l2 with | nil => x0 | (x5 :: xs)%list => match n2 with | 0 => x5 | S m => rec m xs end end match l3 with | nil => x1 | (x5 :: xs)%list => match n3 with | 0 => x5 | S m => rec0 m xs end end) with | nil_R _ _ _ => x2 | cons_R _ _ _ x5 x6 x7 xs xs0 xs1 => match n4 in (nat_R n5 n6) return (T1 match n5 with | 0 => x5 | S m => rec m xs end match n6 with | 0 => x6 | S m => rec0 m xs0 end) with | O_R => x7 | S_R m m0 m1 => rec1 m m0 m1 xs xs0 xs1 end end) (S x) (S x3) K end : forall (T T0 : Type) (T1 : T -> T0 -> Type) (x0 : T) (x1 : T0), T1 x0 x1 -> forall n n0 : nat, nat_R n n0 -> forall (l : list T) (l0 : list T0), list_R T T0 T1 l l0 -> T1 (nth T x0 n l) (nth T0 x1 n0 l0) Arguments nth_R (T T)%type_scope T%function_scope x0 x0 x0 (n n)%nat_scope n (l l)%list_scope l fun `x` X0 c0 \ app [X1, c0] Query assignments: X = X1 Y = fun `x` X0 c0 \ app [X1, c0] _uvk_34_ = X0 File "coq-builtin.elpi", line 1470, characters 0-93: Warning: constant get-option has no declared type. [elpi.typecheck,elpi] Query assignments: MP_TA = «elpi.tests.test_API_module.TA» MP_TF = «elpi.tests.test_API_module.TF» Spilled_1 = «elpi.tests.test_API_module.a» Spilled_2 = const const EXN PRINTING: Not_found Module F : Funsig (a:TA) Funsig (b:TA) TF := Functor (a:TA) Functor (b:TA) Struct Definition w : nat. End Module B : Sig Parameter w : nat. End := (F A A) *** [ B.w : nat ] COQC tests/test_COQ_ELPI_ATTRIBUTES.v Query assignments: I = «foo» z : nat x1 : forall P : Type, P -> nat -> nat : forall P : Type, P -> nat -> nat eq_refl : x1 = (fun (P : Type) (_ : P) (n : nat) => n + 1) : x1 = (fun (P : Type) (_ : P) (n : nat) => n + 1) fun `r` (global (indt «nat»)) c0 \ fun `p` (prod `y` (global (indt «nat»)) c1 \ app [global (indt «eq»), global (indt «nat»), c1, global (indc «O»)]) c1 \ fun `q` (global (indt «bool»)) c2 \ prod `y` (global (indt «nat»)) c3 \ app [global (indt «eq»), global (indt «nat»), c3, global (indc «O»)] Query assignments: Spilled_1 = c0 \ c1 \ c2 \ prod `y` (global (indt «nat»)) c3 \ app [global (indt «eq»), global (indt «nat»), c3, global (indc «O»)] X = fun `r` (global (indt «nat»)) c0 \ fun `p` (prod `y` (global (indt «nat»)) c1 \ app [global (indt «eq»), global (indt «nat»), c1, global (indc «O»)]) c1 \ fun `q` (global (indt «bool»)) c2 \ prod `y` (global (indt «nat»)) c3 \ app [global (indt «eq»), global (indt «nat»), c3, global (indc «O»)] y : nat -> Type : nat -> Type COQC tests/perf_calls.v x1 : forall P : Type, P -> nat -> nat : forall P : Type, P -> nat -> nat eq_refl : x1 = (fun (P : Type) (_ : P) (n : nat) => n + 1) : x1 = (fun (P : Type) (_ : P) (n : nat) => n + 1) Query assignments: E = app [global (const «op»), global (const «c»), app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]] TY = app [global (const «field»), global (const «c»)] Universe constraints: UNIVERSES: {elpi.tests.test_API_elaborate.50 elpi.tests.test_API_elaborate.49} |= elpi.tests.test_API_elaborate.50 < elpi.tests.test_API_elaborate.49 s.u0 <= elpi.tests.test_API_elaborate.50 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Query assignments: U = «elpi.tests.test_HOAS.5» fun u : nat => {| val := oval u; Sub := Ord u; Sub_rect := inlined_sub_rect |} : forall u : nat, is_SUB nat (fun x : nat => leq x u) (ord u) y : nat -> Type : nat -> Type unknown_gref CHR: Uniqueness of typing of frozen--985 + [] <-> [] 1 |> [decl c0 `x` (uvar frozen--985 [])] |- frozen--985 [] : sort (typ «elpi.tests.test_elaborator.40») 0 |> [] |- frozen--985 [] : sort (typ «elpi.tests.test_elaborator.39») 0 |> [] |- unify-eq (sort (typ «elpi.tests.test_elaborator.40»)) (sort (typ «elpi.tests.test_elaborator.39»)) Query assignments: R = fun `x` X0 c0 \ c0 T = prod `x` X0 c0 \ X0 _uvk_87_ = X1 Syntactic constraints: {c0} : decl c0 `x` X0 ?- evar X2 (sort (typ «elpi.tests.test_elaborator.40»)) X0 /* suspended on X2, X0 */ Universe constraints: UNIVERSES: {elpi.tests.test_elaborator.42 elpi.tests.test_elaborator.41 elpi.tests.test_elaborator.40 elpi.tests.test_elaborator.39} |= elpi.tests.test_elaborator.39 <= elpi.tests.test_elaborator.41 elpi.tests.test_elaborator.40 <= elpi.tests.test_elaborator.39 elpi.tests.test_elaborator.40 <= elpi.tests.test_elaborator.41 elpi.tests.test_elaborator.41 <= elpi.tests.test_elaborator.42 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Query assignments: GR = const «myc» eq_op myc t t : bool global (indt «nat») Query assignments: T = global (indt «nat») _uvk_5_ = global (indt «nat») _uvk_6_ = global (indt «nat») Universe constraints: UNIVERSES: {elpi.tests.test_API_typecheck.9 elpi.tests.test_API_typecheck.8 elpi.tests.test_API_typecheck.7 elpi.tests.test_API_typecheck.6 elpi.tests.test_API_typecheck.5} |= Set < elpi.tests.test_API_typecheck.7 elpi.tests.test_API_typecheck.8 < elpi.tests.test_API_typecheck.6 elpi.tests.test_API_typecheck.9 < elpi.tests.test_API_typecheck.5 Set <= elpi.tests.test_API_typecheck.8 Set <= elpi.tests.test_API_typecheck.9 elpi.tests.test_API_typecheck.8 <= list.u0 elpi.tests.test_API_typecheck.9 <= list.u0 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: parameter T X0 (sort (typ X1)) c0 \ record eq_class (sort (typ X2)) mk_eq_class (field [canonical ff, coercion regular] eq_f (global (indt «bool»)) c1 \ field X3 eq_proof (app [global (indt «eq»), global (indt «bool»), c1, c1]) c2 \ end-record) Query assignments: DECL = parameter T X0 (sort (typ «elpi.tests.test_API_env.1»)) c0 \ record eq_class (sort (typ «elpi.tests.test_API_env.2»)) mk_eq_class (field [canonical ff, coercion regular] eq_f (global (indt «bool»)) c1 \ field X3 eq_proof (app [global (indt «eq»), global (indt «bool»), c1, c1]) c2 \ end-record) GR = «eq_class» type_1 = «elpi.tests.test_API_env.1» type_2 = «elpi.tests.test_API_env.2» Universe constraints: UNIVERSES: ALGEBRAIC UNIVERSES: {eq_class.u1 eq_class.u0} UNDEFINED UNIVERSES: elpi.tests.test_API_env.2 elpi.tests.test_API_env.1 WEAK CONSTRAINTS: Record eq_class (T : Type@{eq_class.u0}) : Type@{eq_class.u1} := mk_eq_class { eq_f : bool; eq_proof : eq_f = eq_f }. Arguments eq_class T%type_scope Arguments mk_eq_class T%type_scope eq_f%bool_scope eq_proof fun x : eq_class nat => x : bool : eq_class nat -> bool p <- eq_proof ( xxx ) Query assignments: GR = indc «Ord» K = global (indc «Ord») T = fun `u` X0 c0 \ app [global (indc «SubType»), X1 c0, X2 c0, X3 c0, app [global (const «oval»), c0], X4 c0, fun `K` (X5 c0) c1 \ fun `K_S` (X6 c0 c1) c2 \ fun `u` (X7 c0 c1 c2) c3 \ match c3 (fun `u0` (X8 c1 c2 c3) c4 \ app [c1, c4]) [fun `x` (X9 c1 c2 c3) c4 \ fun `Px` (X10 c1 c2 c3 c4) c5 \ app [c2, c4, c5]]] T1 = fun `u` (global (indt «nat»)) c0 \ app [global (indc «SubType»), global (indt «nat»), fun `x` (global (indt «nat»)) c1 \ app [global (const «leq»), c1, c0], app [global (indt «ord»), c0], app [global (const «oval»), c0], app [global (indc «Ord»), c0], fun `K` (prod `x` (app [global (indt «ord»), c0]) c1 \ sort (typ «elpi.tests.test_quotation.22»)) c1 \ fun `K_S` (prod `x` (global (indt «nat»)) c2 \ prod `Px` (app [global (indt «eq»), global (indt «bool»), app [fun `x` (global (indt «nat»)) c3 \ app [global (const «leq»), c3, c0], c2], global (indc «true»)]) c3 \ app [c1, app [global (indc «Ord»), c0, c2, c3]]) c2 \ fun `u0` (app [global (indt «ord»), c0]) c3 \ match c3 (fun `u1` (app [global (indt «ord»), c0]) c4 \ app [c1, c4]) [fun `x` (global (indt «nat»)) c4 \ fun `Px` (app [global (indt «eq»), global (indt «bool»), app [global (const «leq»), c4, c0], global (indc «true»)]) c5 \ app [c2, c4, c5]]] _uvk_35_ = X0 _uvk_36_ = X1 _uvk_37_ = X2 _uvk_38_ = X3 _uvk_39_ = X4 _uvk_40_ = X5 _uvk_41_ = X6 _uvk_42_ = X7 _uvk_43_ = X8 _uvk_44_ = X9 _uvk_45_ = X10 _uvk_46_ = global (indt «nat») _uvk_47_ = c0 \ global (indt «nat») _uvk_48_ = c0 \ fun `x` (global (indt «nat»)) c1 \ app [global (const «leq»), c1, c0] _uvk_49_ = c0 \ app [global (indt «ord»), c0] _uvk_50_ = c0 \ app [global (const «oval»), c0] _uvk_51_ = c0 \ fun `K` (prod `x` (app [global (indt «ord»), c0]) c1 \ sort (typ «elpi.tests.test_quotation.22»)) c1 \ fun `K_S` (prod `x` (global (indt «nat»)) c2 \ prod `Px` (app [global (indt «eq»), global (indt «bool»), app [fun `x` (global (indt «nat»)) c3 \ app [global (const «leq»), c3, c0], c2], global (indc «true»)]) c3 \ app [c1, app [global (indc «Ord»), c0, c2, c3]]) c2 \ fun `u0` (app [global (indt «ord»), c0]) c3 \ match c3 (fun `u1` (app [global (indt «ord»), c0]) c4 \ app [c1, c4]) [fun `x` (global (indt «nat»)) c4 \ fun `Px` (app [global (indt «eq»), global (indt «bool»), app [global (const «leq»), c4, c0], global (indc «true»)]) c5 \ app [c2, c4, c5]] Universe constraints: UNIVERSES: {elpi.tests.test_quotation.28 elpi.tests.test_quotation.27} |= Set <= is_SUB.u0 Set <= is_SUB.u1 Set <= elpi.tests.test_quotation.27 is_SUB.u2 <= elpi.tests.test_quotation.28 ALGEBRAIC UNIVERSES: {elpi.tests.test_quotation.28 elpi.tests.test_quotation.27} UNDEFINED UNIVERSES: elpi.tests.test_quotation.28 elpi.tests.test_quotation.27 WEAK CONSTRAINTS: Query assignments: MP_TA = «elpi.tests.test_API_module.TA» Module Type TB = Funsig (A:TA) Sig End COQC tests/test_ctx_cache.v «elpi.tests.test_API_elaborate.52» «elpi.tests.test_API_elaborate.52» COQC tests/test_libobject_A.v «elpi.tests.test_API_typecheck.10» Query assignments: U = «elpi.tests.test_API_typecheck.10» Universe constraints: UNIVERSES: {elpi.tests.test_API_typecheck.10} |= Set <= elpi.tests.test_API_typecheck.10 ALGEBRAIC UNIVERSES: {elpi.tests.test_API_typecheck.10} UNDEFINED UNIVERSES: elpi.tests.test_API_typecheck.10 WEAK CONSTRAINTS: Query assignments: X = c0 \ c1 \ c2 \ X0 c0 c1 c2 _uvk_19_ = global (indt «nat») Syntactic constraints: {c0 c1 c2 c3 c4 c5 c6} : decl c6 `z` (app [global (const «N»), c5]), decl c5 `x` (global (indt «nat»)), decl c4 `a` (global (indt «bool»)) ?- evar (X0 c4 c5 c6) (X1 c4 c5 c6) (X0 c4 c5 c6) /* suspended on X0 */ {c0 c1 c2 c3 c4 c5 c6} : decl c6 `z` (app [global (const «N»), c5]), decl c5 `x` (global (indt «nat»)), decl c4 `a` (global (indt «bool»)) ?- evar (X2 c4 c5 c6) (sort (typ «elpi.tests.test_HOAS.9»)) (X1 c4 c5 c6) /* suspended on X2, X1 */ Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.9 elpi.tests.test_HOAS.8} |= Set <= elpi.tests.test_HOAS.8 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: parameter A1 maximal (sort (typ «elpi.tests.test_arg_HOAS.2»)) c0 \ parameter A2 explicit c0 c1 \ inductive foo1 tt (parameter B1 explicit (sort (typ «elpi.tests.test_arg_HOAS.3»)) c2 \ parameter B2 explicit (sort (typ «elpi.tests.test_arg_HOAS.4»)) c3 \ arity (prod `_` (global (indt «nat»)) c4 \ sort (typ «elpi.tests.test_arg_HOAS.7»))) c2 \ [constructor a_k1 (parameter B1 explicit (sort (typ «elpi.tests.test_arg_HOAS.3»)) c3 \ parameter B2 explicit (sort (typ «elpi.tests.test_arg_HOAS.4»)) c4 \ arity (prod `x` (global (indt «nat»)) c5 \ prod `_` (app [c2, app [global (indt «prod»), c3, c3], c4, app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]]) c6 \ app [c2, c3, c4, c5])), constructor a_k2 (parameter B1 explicit (sort (typ «elpi.tests.test_arg_HOAS.3»)) c3 \ parameter B2 explicit (sort (typ «elpi.tests.test_arg_HOAS.4»)) c4 \ arity (prod `_` c0 c5 \ app [c2, c3, c4, app [global (indc «S»), global (indc «O»)]]))] Query assignments: D = parameter A1 maximal (sort (typ «elpi.tests.test_arg_HOAS.2»)) c0 \ parameter A2 explicit c0 c1 \ inductive foo1 tt (parameter B1 explicit (sort (typ «elpi.tests.test_arg_HOAS.3»)) c2 \ parameter B2 explicit (sort (typ «elpi.tests.test_arg_HOAS.4»)) c3 \ arity (prod `_` (global (indt «nat»)) c4 \ sort (typ «elpi.tests.test_arg_HOAS.7»))) c2 \ [constructor a_k1 (parameter B1 explicit (sort (typ «elpi.tests.test_arg_HOAS.3»)) c3 \ parameter B2 explicit (sort (typ «elpi.tests.test_arg_HOAS.4»)) c4 \ arity (prod `x` (global (indt «nat»)) c5 \ prod `_` (app [c2, app [global (indt «prod»), c3, c3], c4, app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]]) c6 \ app [c2, c3, c4, c5])), constructor a_k2 (parameter B1 explicit (sort (typ «elpi.tests.test_arg_HOAS.3»)) c3 \ parameter B2 explicit (sort (typ «elpi.tests.test_arg_HOAS.4»)) c4 \ arity (prod `_` c0 c5 \ app [c2, c3, c4, app [global (indc «S»), global (indc «O»)]]))] I = «inductive_nup.foo1» foo1 ?A2 ?B1 ?B2 ?n : Type : Type where ?A1 : [ |- Type] ?A2 : [ |- ?A1] ?B1 : [ |- Type] ?B2 : [ |- Type] ?n : [ |- nat] a_k1 ?A2 ?B1 ?B2 3 ?f : foo1 ?A2 ?B1 ?B2 3 : foo1 ?A2 ?B1 ?B2 3 where ?A1 : [ |- Type] ?A2 : [ |- ?A1] ?B1 : [ |- Type] ?B2 : [ |- Type] ?f : [ |- foo1 ?A2 (?B1 * ?B1) ?B2 3] pred_R = fun (n n0 : nat) (n1 : nat_R n n0) => match n1 in (nat_R n2 n3) return (nat_R match n2 with | 0 => n | S u => u end match n3 with | 0 => n0 | S u => u end) with | O_R => n1 | S_R _ _ u1 => u1 end : forall n n0 : nat, nat_R n n0 -> nat_R (Nat.pred n) (Nat.pred n0) Arguments pred_R (n n)%nat_scope n pred_R : nat2nat_R Nat.pred Nat.pred : nat2nat_R Nat.pred Nat.pred foo : nat : nat bar : bool -> nat : bool -> nat Query assignments: R = fun `x` (global (indt «nat»)) c0 \ app [global (const «Nat.add»), c0, global (indc «O»)] T = prod `x` (global (indt «nat»)) c0 \ global (indt «nat») _uvk_109_ = X0 Universe constraints: UNIVERSES: {elpi.tests.test_elaborator.46 elpi.tests.test_elaborator.45 elpi.tests.test_elaborator.44 elpi.tests.test_elaborator.43} |= elpi.tests.test_elaborator.43 <= elpi.tests.test_elaborator.45 elpi.tests.test_elaborator.44 <= elpi.tests.test_elaborator.45 elpi.tests.test_elaborator.45 <= elpi.tests.test_elaborator.46 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: predn_R : nat2nat_R predn predn : nat2nat_R predn predn add_R : nat2nat2nat_R Nat.add Nat.add : nat2nat2nat_R Nat.add Nat.add COQC tests/test_vernacular2.v COQC tests/test_invert.v Query assignments: L = [cs-instance (const «carrier») (cs-gref (const «W»)) (const «myc»), cs-instance (const «eq_op») (cs-gref (const «Z»)) (const «myc»)] COQC tests/test_idx2inv.v Query assignments: DECL = parameter T X0 (sort (typ «elpi.tests.test_API_env.3»)) c0 \ record prim_eq_class (sort (typ «elpi.tests.test_API_env.4»)) mk_prim_eq_class (field [canonical ff, coercion reversible] prim_eq_f (global (indt «bool»)) c1 \ field X1 prim_eq_proof (app [global (indt «eq»), global (indt «bool»), c1, c1]) c2 \ end-record) GR = «prim_eq_class» type_3 = «elpi.tests.test_API_env.3» type_4 = «elpi.tests.test_API_env.4» Universe constraints: UNIVERSES: ALGEBRAIC UNIVERSES: {prim_eq_class.u1 prim_eq_class.u0} UNDEFINED UNIVERSES: elpi.tests.test_API_env.4 elpi.tests.test_API_env.3 WEAK CONSTRAINTS: fun r : prim_eq_class nat => eq_refl : r = {| prim_eq_f := r; prim_eq_proof := prim_eq_proof _ r |} : forall r : prim_eq_class nat, r = {| prim_eq_f := r; prim_eq_proof := prim_eq_proof _ r |} (* {} |= prim_eq_class.u1 <= eq.u0 *) File "./tests/test_param2.v", line 85, characters 0-30: Warning: Not a truly recursive fixpoint. [non-recursive,fixpoints] COQC tests/test_lens.v Query assignments: GR = «nat» COQC tests/test_libobject_B.v test1 str hello str x test1 too many arguments File "./tests/test_vernacular2.v", line 6, characters 2-17: Warning: This command does not support this attribute: fwd_compat_attr. [unsupported-attributes,parsing] File "./tests/test_vernacular2.v", line 7, characters 2-17: Warning: This command does not support this attribute: fwd_compat_attr. [unsupported-attributes,parsing] File "./tests/test_vernacular2.v", line 8, characters 2-17: Warning: This command does not support this attribute: fwd_compat_attr. [unsupported-attributes,parsing] test_inv : Type -> bool -> Type : Type -> bool -> Type K1_inv : forall (A : Type) (b : bool), b = true -> test_inv A b : forall (A : Type) (b : bool), b = true -> test_inv A b K2_inv : forall (A : Type) (b x : bool), A -> test_inv A (negb x) -> b = negb (negb x) -> test_inv A b : forall (A : Type) (b x : bool), A -> test_inv A (negb x) -> b = negb (negb x) -> test_inv A b Unable to unify "Set" with "Prop" (universe inconsistency: Cannot enforce Set <= Prop). Query assignments: E = Unable to unify "Set" with "Prop" (universe inconsistency: Cannot enforce Set <= Prop). Inductive listR_inv (A : Type) (PA : A -> Type) (idx0 : list A) : Type := nilR_inv : idx0 = nil -> listR_inv A PA idx0 | consR_inv : forall a : A, PA a -> forall xs : list A, listR_inv A PA xs -> idx0 = (a :: xs)%list -> listR_inv A PA idx0. Arguments listR_inv A%type_scope PA%function_scope idx0%list_scope Arguments nilR_inv A%type_scope PA%function_scope idx0%list_scope _ Arguments consR_inv A%type_scope PA%function_scope idx0%list_scope a _ xs%list_scope _ _ COQC tests/test_tag.v COQC tests/test_eqType_ast.v sort (typ X0) Query assignments: type_1 = X0 Query assignments: I = «inductive_nup.r» R = parameter A explicit (sort (typ «elpi.tests.test_arg_HOAS.31»)) c0 \ parameter a explicit c0 c1 \ record r (sort (typ «elpi.tests.test_arg_HOAS.31»)) R (field [coercion reversible, canonical tt] f (prod `_` c0 c2 \ c0) c2 \ field [coercion off, canonical tt] g c0 c3 \ field [coercion off, canonical tt] p (app [global (indt «eq»), c0, c1, c3]) c4 \ end-record) Record r (A : Type) (a : A) : Type := R { f : A -> A; g : A; p : a = g }. Arguments r A%type_scope a Arguments R A%type_scope a f%function_scope g p raw: inductive X1 tt (arity (sort prop)) c0 \ [] typed: inductive X1 tt (arity (sort prop)) c0 \ [] X1 : Prop X1 is not universe polymorphic Expands to: Inductive elpi.tests.test_arg_HOAS.X1 Query assignments: Spilled_1 = «elpi.tests.test_API_module.A» Module IA := Struct Definition z : nat. Definition i : Type. End is_list_to_is_list_inv : forall (A : Type) (PA : A -> Type) (l : list A), is_list A PA l -> is_list_inv A PA l : forall (A : Type) (PA : A -> Type) (l : list A), is_list A PA l -> is_list_inv A PA l fun `r` (app [global (indt «prim_eq_class»), global (indt «nat»)]) c0 \ app [primitive (proj elpi.tests.test_API_env.prim_eq_f 1), c0] COQC examples/usage.v Query assignments: I = «eq» P1 = «carrier» P2 = «eq_op» evar (X0) (global (indt «nat»)) X1 /* suspended on X0, X1 */ X0 global (indt «nat») evar (X2) (global (indt «nat»)) X3 /* suspended on X2, X3 */ hello eq_refl : one = 1 : one = 1 File "./tests/test_vernacular2.v", line 9, characters 2-17: Warning: This command does not support this attribute: fwd_compat_attr. [unsupported-attributes,parsing] File "./tests/test_vernacular2.v", line 10, characters 2-17: Warning: This command does not support this attribute: fwd_compat_attr. [unsupported-attributes,parsing] raw: inductive X3 tt (arity (sort (typ «elpi.tests.test_arg_HOAS.127»))) c0 \ [] upoly-decl [«elpi.tests.test_arg_HOAS.127»] tt [] tt Universe constraints: UNIVERSES: {u1} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: elpi.tests.test_arg_HOAS.127 WEAK CONSTRAINTS: typed: inductive X3 tt (arity (sort (typ «elpi.tests.test_arg_HOAS.127»))) c0 \ [] raw: inductive X4 tt (arity (sort (typ «elpi.tests.test_arg_HOAS.135»))) c0 \ [] upoly-decl-cumul [auto «elpi.tests.test_arg_HOAS.135»] tt [] tt Universe constraints: UNIVERSES: {u2} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: elpi.tests.test_arg_HOAS.135 WEAK CONSTRAINTS: typed: inductive X4 tt (arity (sort (typ «elpi.tests.test_arg_HOAS.135»))) c0 \ [] X3@{u1} : Type@{u1} (* u1 |= *) X3 is universe polymorphic Expands to: Inductive elpi.tests.test_arg_HOAS.X3 X4@{u2} : Type@{u2} (* *u2 |= *) X4 is universe polymorphic Expands to: Inductive elpi.tests.test_arg_HOAS.X4 Query assignments: S = sort (typ «elpi.tests.test_elaborator.48») T = sort (typ «elpi.tests.test_elaborator.47») type_2 = «elpi.tests.test_elaborator.47» Universe constraints: UNIVERSES: {elpi.tests.test_elaborator.48 elpi.tests.test_elaborator.47} |= elpi.tests.test_elaborator.47 < elpi.tests.test_elaborator.48 ALGEBRAIC UNIVERSES: {elpi.tests.test_elaborator.47} UNDEFINED UNIVERSES: elpi.tests.test_elaborator.47 WEAK CONSTRAINTS: Query assignments: Spilled_1 = «elpi.tests.test_API_module.IA» i : Type COQC tests/test_libobject_C.v ---------------------------------- {c0 c1} : decl c1 `a` (global (indt «bool»)) ?- evar X0 (sort (typ «elpi.tests.test_HOAS.10»)) X1 /* suspended on X0, X1 */ {c0 c1} : decl c1 `a` (global (indt «bool»)) ?- evar (X2 c1) X1 (X2 c1) /* suspended on X2 */ EVARS: ?X11==[a |- ?elpi_evar] (internal placeholder) {?elpi_evar0} ?X10==[ |- Type] (internal placeholder) {?elpi_evar} ?X9==[a |- ?elpi_evar => ?elpi_evar0] (internal placeholder) ?X8==[a |- Type => ?elpi_evar] (internal placeholder) SHELF: FUTURE GOALS STACK:?X11 ?X10 Coq-Elpi mapping: RAW: ?X10 <-> X0 ?X11 <-> X2 ELAB: ?X10 <-> X1 ?X11 <-> X2 X2 c0 : X1 Query assignments: TY = X1 X = c0 \ c1 \ X2 c0 Syntactic constraints: {c0 c1} : decl c1 `a` (global (indt «bool»)) ?- evar X0 (sort (typ «elpi.tests.test_HOAS.10»)) X1 /* suspended on X0, X1 */ {c0 c1} : decl c1 `a` (global (indt «bool»)) ?- evar (X2 c1) X1 (X2 c1) /* suspended on X2 */ Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.10} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Query assignments: GR = const «myc1» eq_op myc1 t1 t1 : bool Query assignments: C = «pc» [(c4 \ app [c1, c2]), (c4 \ app [c0, c2]), (c4 \ c4), (c4 \ prod `x0` (app [c0, c2]) c5 \ prod `x1` (global (indt «nat»)) c6 \ sort (typ «elpi.tests.test_tactic.16»))] [app [global (indt «eq»), global (indt «nat»), c2, app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]], sort prop] _f1 : Lens fo_record fo_record peano peano : Lens fo_record fo_record peano peano _f2 : Lens fo_record fo_record unit unit : Lens fo_record fo_record unit unit [attribute elpi.loc (leaf-loc File "./tests/test_vernacular2.v", line 11, column 24, character 361:), attribute fwd_compat_attr (leaf-str )] @_f3 : forall A : Type, Lens (pa_record A) (pa_record A) peano peano : forall A : Type, Lens (pa_record A) (pa_record A) peano peano Query assignments: GR = «Nat.add» MP = «Coq.Init.Datatypes» @_f4 : forall A : Type, Lens (pa_record A) (pa_record A) A A : forall A : Type, Lens (pa_record A) (pa_record A) A A @_pf3 : forall A : Type, Lens (pr_record A) (pr_record A) peano peano : forall A : Type, Lens (pr_record A) (pr_record A) peano peano [attribute elpi.loc (leaf-loc File "./tests/test_vernacular2.v", line 12, column 0, character 366:), attribute fwd_compat_attr (leaf-str )] @_pf4 : forall A : Type, Lens (pr_record A) (pr_record A) A A : forall A : Type, Lens (pr_record A) (pr_record A) A A ok COQC examples/readme.v global (indc «O») Query assignments: S = sort (typ «elpi.tests.test_elaborator.50») T = sort (typ «elpi.tests.test_elaborator.49») TW = sort (typ «elpi.tests.test_elaborator.49») W = sort (typ «elpi.tests.test_elaborator.51») type_3 = «elpi.tests.test_elaborator.49» type_4 = «elpi.tests.test_elaborator.51» Universe constraints: UNIVERSES: {elpi.tests.test_elaborator.51 elpi.tests.test_elaborator.50 elpi.tests.test_elaborator.49} |= elpi.tests.test_elaborator.49 < elpi.tests.test_elaborator.50 elpi.tests.test_elaborator.51 < elpi.tests.test_elaborator.49 ALGEBRAIC UNIVERSES: {elpi.tests.test_elaborator.51 elpi.tests.test_elaborator.49} UNDEFINED UNIVERSES: elpi.tests.test_elaborator.51 elpi.tests.test_elaborator.49 WEAK CONSTRAINTS: app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] Query assignments: GR = indt «X3» Universe constraints: UNIVERSES: {elpi.tests.test_arg_HOAS.143} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: elpi.tests.test_arg_HOAS.143 WEAK CONSTRAINTS: Query assignments: Spilled_1 = «elpi.tests.test_API_module.TA» Module Type ITA = Sig Parameter z : nat. Parameter i : Type. End File "./tests/test_HOAS.v", line 123, characters 0-34: Warning: Use of “Require” inside a module is fragile. It is not recommended to use this functionality in finished proof scripts. [require-in-module,fragile] Query assignments: P = const «eq_op» Raw term: app [global (const «add»), primitive (uint63 2000000003333002), primitive (uint63 1)] Nice term: add 2000000003333002 1 Red: 2000000003333003 File "./tests/test_HOAS.v", line 127, characters 0-34: Warning: Use of “Require” inside a module is fragile. It is not recommended to use this functionality in finished proof scripts. [require-in-module,fragile] Query assignments: A = «elpi.tests.test_API.succ» GR = «Nat.add» MP = «Coq.Init.Datatypes» X1 = [loc-gref (const «Nat.add»)] X2 = [loc-gref (const «Nat.add»)] X3 = [loc-abbreviation «elpi.tests.test_API.succ»] X4 = [loc-modpath «Coq.Init.Datatypes»] Universe constraints: UNIVERSES: ALGEBRAIC UNIVERSES: {myind.u0} UNDEFINED UNIVERSES: elpi.tests.test_API_env.5 WEAK CONSTRAINTS: myind true false : Prop : Prop K2 true : myind true true : myind true true myind1 true false : Prop : Prop K21 true : myind1 true true : myind1 true true Query assignments: F = «elpi.tests.test_API_module.R.F» FT = «elpi.tests.test_API_module.R.FT» L = [submodule «elpi.tests.test_API_module.R.S» [gref (const «R.S.x»)], module-type «elpi.tests.test_API_module.R.P1», module-type «elpi.tests.test_API_module.R.P2», «elpi.tests.test_API_module.R.F» module-functor [«elpi.tests.test_API_module.R.P1», «elpi.tests.test_API_module.R.P2»], «elpi.tests.test_API_module.R.FT» module-type-functor [«elpi.tests.test_API_module.R.P2», «elpi.tests.test_API_module.R.P1»], gref (const «R.a»)] P1 = «elpi.tests.test_API_module.R.P1» P2 = «elpi.tests.test_API_module.R.P2» R = «elpi.tests.test_API_module.R» S = «elpi.tests.test_API_module.R.S» Raw term: app [global (const «add»), primitive (float64 24000000000000), primitive (float64 1)] Nice term: 24000000000000 + 1 Red: 24000000000001 1356 : nat this 3 app [c4, X0 c0 c1 c2 c3 c4] app [c3, app [c1, c2], global (const «a»)] foo.bar COQC tests/test_projK.v COQC tests/test_derive.v more : (forall A : Type, A -> tickle A -> tickle A) : forall A : Type, A -> tickle A -> tickle A COQC tests/test_eq.v tickle.eqb : (forall A : Type, (A -> A -> bool) -> tickle A -> tickle A -> bool) : forall A : Type, (A -> A -> bool) -> tickle A -> tickle A -> bool tickle.eqb_OK : (forall (A : Type) (f : A -> A -> bool), (forall x y : A, reflect (x = y) (f x y)) -> forall x y : tickle A, reflect (x = y) (tickle.eqb A f x y)) : forall (A : Type) (f : A -> A -> bool), (forall x y : A, reflect (x = y) (f x y)) -> forall x y : tickle A, reflect (x = y) (tickle.eqb A f x y) tickle.map : (forall A B : Type, (A -> B) -> tickle A -> tickle B) : forall A B : Type, (A -> B) -> tickle A -> tickle B tickle.tickle_R : (forall A B : Type, (A -> B -> Type) -> tickle A -> tickle B -> Type) : forall A B : Type, (A -> B -> Type) -> tickle A -> tickle B -> Type Debug: Cannot enforce elpi.tests.test_elaborator.52 < elpi.tests.test_elaborator.52 because elpi.tests.test_elaborator.52 = elpi.tests.test_elaborator.52 Query assignments: X = sort (typ X0) type_5 = X0 Starting module rtree Declaring inductive parameter A explicit (sort (typ «elpi.apps.derive.examples.usage.190»)) c0 \ inductive rtree tt (arity (sort (typ «elpi.apps.derive.examples.usage.191»))) c1 \ [constructor Leaf (arity (prod `_` c0 c2 \ c1)), constructor Node (arity (prod `_` (app [global (indt «tickle.tickle»), c1]) c2 \ c1))] Deriving Derivation map on indt «rtree» Derivation map on indt «rtree» took 0.015616 Derivation lens on indt «rtree» Derivation lens on indt «rtree» failed, continuing Derivation param1 on indt «rtree» Derivation param1 on indt «rtree» took 0.044261 Derivation param2 on indt «rtree» Derivation param2 on indt «rtree» took 0.049496 Derivation tag on indt «rtree» Derivation tag on indt «rtree» took 0.009219 Derivation eqType_ast on indt «rtree» Derivation eqType_ast on indt «rtree» took 0.002458 Derivation lens_laws on indt «rtree» Derivation lens_laws on indt «rtree» took 0.009980 Derivation param1_congr on indt «rtree» Derivation param1_congr on indt «rtree» took 0.016575 Derivation param1_inhab on indt «rtree» Derivation param1_inhab on indt «rtree» took 0.012549 Derivation param1_functor on indt «rtree» Derivation param1_functor on indt «rtree» took 0.016070 Derivation fields on indt «rtree» Query assignments: GR = indt «X4» Universe constraints: UNIVERSES: {elpi.tests.test_arg_HOAS.144} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: elpi.tests.test_arg_HOAS.144 WEAK CONSTRAINTS: empty_tag : tag empty : tag empty unit_tag : tag unit : tag unit peano_tag : tag peano : tag peano raw: inductive X5 tt (arity (sort (typ «elpi.tests.test_arg_HOAS.145»))) c0 \ [] upoly-decl [«elpi.tests.test_arg_HOAS.145»] ff [] ff Universe constraints: UNIVERSES: {u3} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: elpi.tests.test_arg_HOAS.145 WEAK CONSTRAINTS: typed: inductive X5 tt (arity (sort (typ «elpi.tests.test_arg_HOAS.145»))) c0 \ [] option_tag : forall A : Type, tag (option A) : forall A : Type, tag (option A) pair_tag : forall A B : Type, tag (pair A B) : forall A B : Type, tag (pair A B) seq_tag : forall A : Type, tag (seq A) : forall A : Type, tag (seq A) rose_tag : forall A : Type, tag (rose A) : forall A : Type, tag (rose A) nest_tag : forall A : Type, tag (nest A) : forall A : Type, tag (nest A) w_tag : forall A : Type, tag (w A) : forall A : Type, tag (w A) vect_tag : forall (A : Type) (i : peano), tag (vect A i) : forall (A : Type) (i : peano), tag (vect A i) dyn_tag : tag dyn : tag dyn beta_tag : forall A : Type, tag (beta A) : forall A : Type, tag (beta A) iota_tag : tag iota : tag iota large_tag : tag large : tag large prim_int_tag : tag prim_int : tag prim_int prim_float_tag : tag prim_float : tag prim_float pa_record_tag : forall A : Type, tag (pa_record A) : forall A : Type, tag (pa_record A) pr_record_tag : forall A : Type, tag (pr_record A) : forall A : Type, tag (pr_record A) X5@{u3} : Type@{u3} (* u3 |= *) X5 is universe polymorphic Expands to: Inductive elpi.tests.test_arg_HOAS.X5 ord_tag : forall p : peano, tag (ord p) : forall p : peano, tag (ord p) ord2_tag : forall p : peano, tag (ord2 p) : forall p : peano, tag (ord2 p) val_tag : tag val : tag val raw: inductive X6 tt (arity (sort (typ «elpi.tests.test_arg_HOAS.154»))) c0 \ [constructor K (arity (prod `u` (sort (typ «elpi.tests.test_arg_HOAS.153»)) c1 \ c0))] upoly-decl [«elpi.tests.test_arg_HOAS.153», «elpi.tests.test_arg_HOAS.154»] ff [lt «elpi.tests.test_arg_HOAS.153» «elpi.tests.test_arg_HOAS.154»] ff Universe constraints: UNIVERSES: {u5 u4} |= u4 < u5 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: elpi.tests.test_arg_HOAS.154 elpi.tests.test_arg_HOAS.153 WEAK CONSTRAINTS: typed: inductive X6 tt (arity (sort (typ «elpi.tests.test_arg_HOAS.154»))) c0 \ [constructor K (arity (prod `u` (sort (typ «elpi.tests.test_arg_HOAS.153»)) c1 \ c0))] X6@{u4 u5} : Type@{u5} (* u4 u5 |= u4 < u5 *) X6 is universe polymorphic Expands to: Inductive elpi.tests.test_arg_HOAS.X6 raw: inductive X8 tt (arity (sort (typ X0))) c0 \ [] upoly-decl [] tt [] tt Universe constraints: typed: inductive X8 tt (arity (sort (typ «elpi.tests.test_arg_HOAS.169»))) c0 \ [] Derivation fields on indt «rtree» took 0.206455 Derivation param1_trivial on indt «rtree» X8@{u} : Type@{u} (* u |= *) X8 is universe polymorphic Expands to: Inductive elpi.tests.test_arg_HOAS.X8 COQC tests/test_isK.v f1@{u} : forall T : Type@{u}, T -> T (* u |= *) f1 is universe polymorphic Arguments f1 T%type_scope x f1 is transparent Expands to: Constant elpi.tests.test_arg_HOAS.f1 f2@{u} : forall T : Type@{u}, Type@{u} -> T -> T (* u |= *) f2 is universe polymorphic Arguments f2 (T T1)%type_scope x f2 is transparent Expands to: Constant elpi.tests.test_arg_HOAS.f2 f3@{u} : forall T : Type@{u}, T -> T (* u |= *) f3 is universe polymorphic Arguments f3 T%type_scope x f3 is transparent Expands to: Constant elpi.tests.test_arg_HOAS.f3 f4@{u} : forall T : Type@{u}, Type@{u} -> T -> T (* u |= *) f4 is universe polymorphic Arguments f4 (T T1)%type_scope x f4 is transparent Expands to: Constant elpi.tests.test_arg_HOAS.f4 Universe constraints: f6@{uuux} : forall T : Type@{uuu}, Type@{uuux} -> T -> T (* uuux |= *) f6 is universe polymorphic Arguments f6 (T T1)%type_scope x f6 is transparent Expands to: Constant elpi.tests.test_arg_HOAS.f6 COQC tests/test_param1.v Finished transaction in 5.554 secs (2.426u,0.003s) (successful) Derivation param1_trivial on indt «rtree» took 0.346009 Derivation induction on indt «rtree» Derivation induction on indt «rtree» took 0.010009 Derivation eqb on indt «rtree» Derivation eqb on indt «rtree» took 0.046548 Derivation eqbcorrect on indt «rtree» Derivation eqbcorrect on indt «rtree» took 0.075496 Derivation eqbOK on indt «rtree» Derivation eqbOK on indt «rtree» took 0.004312 Done rtree.induction : (forall (A : Type) (PA : A -> Type) (P : rtree A -> Type), (forall a : A, PA a -> P (Leaf A a)) -> (forall l : tickle (rtree A), tickle.is_tickle (rtree A) P l -> P (Node A l)) -> forall x : rtree A, rtree.is_rtree A PA x -> P x) : forall (A : Type) (PA : A -> Type) (P : rtree A -> Type), (forall a : A, PA a -> P (Leaf A a)) -> (forall l : tickle (rtree A), tickle.is_tickle (rtree A) P l -> P (Node A l)) -> forall x : rtree A, rtree.is_rtree A PA x -> P x Query assignments: W = const «W» Starting module Box Declaring inductive parameter A explicit (sort (typ «elpi.apps.derive.examples.usage.379»)) c0 \ record Box (sort (typ «elpi.apps.derive.examples.usage.380»)) Build_Box (field [coercion off, canonical tt] contents c0 c1 \ field [coercion off, canonical tt] tag (global (indt «nat»)) c2 \ end-record) Deriving Skipping derivation map on indt «Box» since the user did not select it Derivation lens on indt «Box» Derivation lens on indt «Box» took 0.016359 Skipping derivation param1 on indt «Box» since the user did not select it Skipping derivation param2 on indt «Box» since the user did not select it Derivation tag on indt «Box» File "./examples/usage.v", line 53, characters 0-84: Warning: Global name tag is taken, using tag1 instead [elpi.renamed,elpi] Derivation tag on indt «Box» took 0.004694 Derivation eqType_ast on indt «Box» Derivation eqType_ast on indt «Box» took 0.002781 Derivation lens_laws on indt «Box» Derivation lens_laws on indt «Box» took 0.031145 Skipping derivation param1_congr on indt «Box» since the user did not select it Skipping derivation param1_inhab on indt «Box» since the user did not select it Skipping derivation param1_functor on indt «Box» since the user did not select it Derivation fields on indt «Box» Derivation fields on indt «Box» took 0.013824 Skipping derivation param1_trivial on indt «Box» since the user did not select it Skipping derivation induction on indt «Box» since the user did not select it Derivation eqb on indt «Box» Derivation eqb on indt «Box» took 0.014811 Skipping derivation eqbcorrect on indt «Box» since the user did not select it Skipping derivation eqbOK on indt «Box» since the user did not select it Done Box.eqb : (forall A : Type, (A -> A -> bool) -> Box A -> Box A -> bool) : forall A : Type, (A -> A -> bool) -> Box A -> Box A -> bool @Box._tag : (forall A : Type, Lens (Box A) (Box A) nat nat) : forall A : Type, Lens (Box A) (Box A) nat nat Box._tag_set_set : (forall (A : Type) (r : Box A) (y x : nat), set Box._tag x (set Box._tag y r) = set Box._tag x r) : forall (A : Type) (r : Box A) (y x : nat), set Box._tag x (set Box._tag y r) = set Box._tag x r Box._tag_contents_exchange : (forall (A : Type) (r : Box A) (x : nat) (y : A), set Box._tag x (set Box._contents y r) = set Box._contents y (set Box._tag x r)) : forall (A : Type) (r : Box A) (x : nat) (y : A), set Box._tag x (set Box._contents y r) = set Box._contents y (set Box._tag x r) Query assignments: C = «Nat.add» F = TODO T = app [fix `add` 0 (prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat»)) c0 \ fun `n` (global (indt «nat»)) c1 \ fun `m` (global (indt «nat»)) c2 \ match c1 (fun `n` (global (indt «nat»)) c3 \ global (indt «nat»)) [c2, fun `p` (global (indt «nat»)) c3 \ app [global (indc «S»), app [c0, c3, c2]]], app [global (indc «S»), global (indc «O»)], app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] T1 = app [global (const «Nat.add»), app [global (indc «S»), global (indc «O»)], app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] Query assignments: X = sort (typ «elpi.tests.test_elaborator.53») Y = sort (typ «elpi.tests.test_elaborator.54») Universe constraints: UNIVERSES: {elpi.tests.test_elaborator.54 elpi.tests.test_elaborator.53} |= elpi.tests.test_elaborator.53 < elpi.tests.test_elaborator.54 ALGEBRAIC UNIVERSES: {elpi.tests.test_elaborator.54 elpi.tests.test_elaborator.53} UNDEFINED UNIVERSES: elpi.tests.test_elaborator.54 elpi.tests.test_elaborator.53 WEAK CONSTRAINTS: nat_eqb_OK : (forall x y : nat, reflect (x = y) (nat_eqb x y)) : forall x y : nat, reflect (x = y) (nat_eqb x y) T2 = app [fix `plus` 0 (prod `n` (global (indt «nat»)) c0 \ prod `m` (global (indt «nat»)) c1 \ global (indt «nat»)) c0 \ fun `n` (global (indt «nat»)) c1 \ fun `m` (global (indt «nat»)) c2 \ match c1 (fun `n` (global (indt «nat»)) c3 \ global (indt «nat»)) [c2, fun `p` (global (indt «nat»)) c3 \ app [global (indc «S»), app [c0, c3, c2]]], app [global (indc «S»), global (indc «O»)], app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] _uvk_35_ = global (indt «nat») _uvk_36_ = c0 \ global (indt «nat») _uvk_37_ = c0 \ c1 \ global (indt «nat») _uvk_38_ = c0 \ global (indt «nat») _uvk_39_ = c0 \ c1 \ global (indt «nat») _uvk_40_ = c0 \ c1 \ c2 \ global (indt «nat») _uvk_41_ = c0 \ c1 \ c2 \ global (indt «nat») Derivation map on indt «a» Derivation map on indt «a» took 0.005737 Derivation lens on indt «a» Derivation lens on indt «a» failed, continuing Derivation param1 on indt «a» Derivation param1 on indt «a» took 0.011282 Derivation param2 on indt «a» Notation peano := peano.peano Inductive peano : Set := Zero : peano | Succ : peano -> peano. = false : bool peano.eqb_OK : forall x1 x2 : peano, reflect (x1 = x2) (peano.eqb x1 x2) peano.eqb_OK is not universe polymorphic Arguments peano.eqb_OK x1 x2 peano.eqb_OK is opaque Expands to: Constant elpi.apps.derive.examples.readme.peano.eqb_OK Derivation param2 on indt «a» took 0.013751 Derivation tag on indt «a» Derivation tag on indt «a» took 0.004230 Derivation eqType_ast on indt «a» Derivation eqType_ast on indt «a» took 0.002065 Derivation lens_laws on indt «a» Derivation lens_laws on indt «a» took 0.001733 Derivation param1_congr on indt «a» Derivation param1_congr on indt «a» took 0.002419 Derivation param1_inhab on indt «a» Derivation param1_inhab on indt «a» took 0.005081 Derivation param1_functor on indt «a» Derivation param1_functor on indt «a» took 0.005401 Derivation fields on indt «a» Derivation fields on indt «a» took 0.009312 Derivation param1_trivial on indt «a» Derivation param1_trivial on indt «a» took 0.005439 Derivation induction on indt «a» Derivation induction on indt «a» took 0.003740 Derivation eqb on indt «a» Derivation eqb on indt «a» took 0.010274 Derivation eqbcorrect on indt «a» Derivation eqbcorrect on indt «a» took 0.013407 Derivation eqbOK on indt «a» Derivation eqbOK on indt «a» took 0.003940 Skipping derivation map on indt «b» since the user did not select it Skipping derivation lens on indt «b» since the user did not select it Derivation param1 on indt «b» Derivation param1 on indt «b» took 0.012395 Skipping derivation param2 on indt «b» since the user did not select it Derivation tag on indt «b» Derivation tag on indt «b» took 0.006616 Derivation eqType_ast on indt «b» Derivation eqType_ast on indt «b» took 0.002611 Skipping derivation lens_laws on indt «b» since the user did not select it Skipping derivation param1_congr on indt «b» since the user did not select it Derivation param1_inhab on indt «b» Derivation param1_inhab on indt «b» took 0.005566 Derivation param1_functor on indt «b» Derivation param1_functor on indt «b» took 0.008060 Derivation fields on indt «b» Query assignments: type_6 = «elpi.tests.test_API_env.6» type_7 = «elpi.tests.test_API_env.7» Universe constraints: UNIVERSES: ALGEBRAIC UNIVERSES: {nuind.u1 nuind.u0} UNDEFINED UNIVERSES: elpi.tests.test_API_env.7 elpi.tests.test_API_env.6 WEAK CONSTRAINTS: Derivation fields on indt «b» took 0.014305 Skipping derivation param1_trivial on indt «b» since the user did not select it Derivation induction on indt «b» Derivation induction on indt «b» took 0.004764 Derivation eqb on indt «b» fun x : nuind nat 3 false => match x in (nuind _ _ b) return (b = b) with | k1 _ _ => eq_refl : true = true | k2 _ _ x0 => (fun _ : nuind nat 1 false => eq_refl : false = false) x0 end : nuind nat 3 false -> false = false Derivation eqb on indt «b» took 0.013821 Derivation eqbcorrect on indt «b» Derivation eqbcorrect on indt «b» took 0.015543 Derivation eqbOK on indt «b» Derivation eqbOK on indt «b» took 0.003723 a_eqb : a -> a -> bool b_eqb : b -> b -> bool COQC tests/test_map.v Derivation param1 on const «Nat.add» Derivation param1 on const «Nat.add» took 0.036256 Derivation param2 on const «Nat.add» Derivation param2 on const «Nat.add» took 0.045396 Derivation eqb-alias on const «Nat.add» Derivation eqb-alias on const «Nat.add» failed, continuing Derivation eqbcorrect-alias on const «Nat.add» Derivation eqbcorrect-alias on const «Nat.add» failed, continuing Derivation eqbOK-alias on const «Nat.add» Derivation eqbOK-alias on const «Nat.add» failed, continuing is_add : forall n : nat, is_nat n -> forall m : nat, is_nat m -> is_nat (n + m) COQC tests/test_lens_laws.v Query assignments: X = «elpi.tests.test_API.1» Universe constraints: UNIVERSES: {elpi.tests.test_API.1} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Query assignments: D = X0 R = app [global (indc «ex_intro»), X0, fun `hd_beta_auto` X0 c0 \ app [global (indt «eq»), global (indt «nat»), global (indc «O»), global (indc «O»)], X1, global (const «p»)] TY = app [global (indt «ex»), X0, fun `hd_beta_auto` X0 c0 \ app [global (indt «eq»), global (indt «nat»), global (indc «O»), global (indc «O»)]] _uvk_129_ = X2 _uvk_130_ = X3 _uvk_131_ = X4 Syntactic constraints: evar (X2) (sort (typ «Coq.Init.Logic.5»)) X0 /* suspended on X2, X0 */ evar (X4) X0 (X1) /* suspended on X4, X1 */ evar (X1) X0 X5 /* suspended on X1, X5 */ [cs-instance (const «eq_op») (cs-gref (const «Z1»)) (const «myc1»)] Query assignments: L = [cs-instance (const «eq_op») (cs-gref (const «Z1»)) (const «myc1»)] P = const «eq_op» W = const «Z1» const-decl D (some (fun `i` (global (indt «I»)) c0 \ fun `l` (app [global (indt «L»), c0]) c1 \ global (indt «True»))) (parameter i maximal (global (indt «I»)) c0 \ parameter l maximal (app [global (indt «L»), c0]) c1 \ arity (sort prop)) const-decl D (some (fun `i` (global (indt «I»)) c0 \ fun `H` (app [global (indt «L»), c0]) c1 \ global (indt «True»))) (parameter i maximal (global (indt «I»)) c0 \ parameter H maximal (app [global (indt «L»), c0]) c1 \ arity (sort prop)) const-decl D (some (fun `i` (global (indt «I»)) c0 \ fun `H` (app [global (indt «L»), c0]) c1 \ fun `n` (global (indt «nat»)) c2 \ global (indt «True»))) (parameter i maximal (global (indt «I»)) c0 \ parameter H maximal (app [global (indt «L»), c0]) c1 \ parameter n explicit (global (indt «nat»)) c2 \ arity (sort prop)) COQC tests/test_fields.v Query assignments: X = typ «elpi.tests.test_API.2» Y = typ «elpi.tests.test_API.3» Universe constraints: UNIVERSES: {elpi.tests.test_API.3 elpi.tests.test_API.2} |= elpi.tests.test_API.2 <= elpi.tests.test_API.3 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Query assignments: C = «Nat.add» F = TODO T = app [fun `n` (global (indt «nat»)) c0 \ fun `m` (global (indt «nat»)) c1 \ match c0 (fun `n` (global (indt «nat»)) c2 \ global (indt «nat»)) [c1, fun `p` (global (indt «nat»)) c2 \ app [global (indc «S»), app [fix `add` 0 (prod `n` (global (indt «nat»)) c3 \ prod `m` (global (indt «nat»)) c4 \ global (indt «nat»)) c3 \ fun `n` (global (indt «nat»)) c4 \ fun `m` (global (indt «nat»)) c5 \ match c4 (fun `n` (global (indt «nat»)) c6 \ global (indt «nat»)) [c5, fun `p` (global (indt «nat»)) c6 \ app [global (indc «S»), app [c3, c6, c5]]], c2, c1]]], app [global (indc «S»), global (indc «O»)], app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] T1 = app [global (const «Nat.add»), app [global (indc «S»), global (indc «O»)], app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] T2 = app [fun `n` (global (indt «nat»)) c0 \ fun `m` (global (indt «nat»)) c1 \ match c0 (fun `n` (global (indt «nat»)) c2 \ global (indt «nat»)) [c1, fun `p` (global (indt «nat»)) c2 \ app [global (indc «S»), app [fix `plus` 0 (prod `n` (global (indt «nat»)) c3 \ prod `m` (global (indt «nat»)) c4 \ global (indt «nat»)) c3 \ fun `n` (global (indt «nat»)) c4 \ fun `m` (global (indt «nat»)) c5 \ match c4 (fun `n` (global (indt «nat»)) c6 \ global (indt «nat»)) [c5, fun `p` (global (indt «nat»)) c6 \ app [global (indc «S»), app [c3, c6, c5]]], c2, c1]]], app [global (indc «S»), global (indc «O»)], app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] _uvk_42_ = global (indt «nat») _uvk_43_ = c0 \ global (indt «nat») _uvk_44_ = c0 \ c1 \ global (indt «nat») _uvk_45_ = c0 \ c1 \ global (indt «nat») _uvk_46_ = c0 \ c1 \ c2 \ global (indt «nat») _uvk_47_ = c0 \ c1 \ c2 \ global (indt «nat») _uvk_48_ = c0 \ c1 \ c2 \ global (indt «nat») _uvk_49_ = c0 \ c1 \ c2 \ c3 \ global (indt «nat») _uvk_50_ = c0 \ c1 \ c2 \ c3 \ global (indt «nat») _uvk_51_ = c0 \ c1 \ c2 \ c3 \ global (indt «nat») _uvk_52_ = c0 \ c1 \ c2 \ c3 \ global (indt «nat») c0 global (indt «nat») Query assignments: T = global (indt «nat») Query assignments: R = app [global (indc «ex_intro»), global (indt «nat»), fun `hd_beta_auto` (global (indt «nat»)) c0 \ app [global (indt «eq»), global (indt «nat»), c0, c0], global (indc «O»), global (const «p»)] TY = app [global (indt «ex»), global (indt «nat»), fun `hd_beta_auto` (global (indt «nat»)) c0 \ app [global (indt «eq»), global (indt «nat»), c0, c0]] _uvk_158_ = X0 _uvk_159_ = X1 [trm c0, trm (app [global (const «Nat.add»), c0, c1])] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X0 c0 c1) (global (indt «True»)) (X1 c0 c1) /* suspended on X0, X1 */ [trm c0, trm (app [global (const «Nat.add»), X0 c0 c1, c1])] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X1 c0 c1) (global (indt «nat»)) (X0 c0 c1) /* suspended on X1, X0 */ {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X2 c0 c1) (global (indt «True»)) (X3 c0 c1) /* suspended on X2, X3 */ [trm c0, trm (app [global (const «Nat.add»), X0 c0 c1, c1])] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X1 c0 c1) (global (indt «True»)) (X2 c0 c1) /* suspended on X1, X2 */ [trm c0, trm c1] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X0 c0 c1) (global (indt «True»)) (X1 c0 c1) /* suspended on X0, X1 */ [trm (app [global (const «Nat.add»), c0, c1])] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X0 c0 c1) (global (indt «True»)) (X1 c0 c1) /* suspended on X0, X1 */ [trm (app [global (const «Nat.add»), X0 c0 c1, c1])] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X1 c0 c1) (global (indt «nat»)) (X0 c0 c1) /* suspended on X1, X0 */ {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X2 c0 c1) (global (indt «True»)) (X3 c0 c1) /* suspended on X2, X3 */ [trm (app [global (const «Nat.add»), X0 c0 c1, c1])] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X1 c0 c1) (global (indt «True»)) (X2 c0 c1) /* suspended on X1, X2 */ [trm (app [global (indc «O»), global (indc «O»)])] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X0 c0 c1) (global (indt «True»)) (X1 c0 c1) /* suspended on X0, X1 */ [trm c0] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X0 c0 c1) (global (indt «True»)) (X1 c0 c1) /* suspended on X0, X1 */ [int 1] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X0 c0 c1) (global (indt «True»)) (X1 c0 c1) /* suspended on X0, X1 */ [int -1] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X0 c0 c1) (global (indt «True»)) (X1 c0 c1) /* suspended on X0, X1 */ [str a] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X0 c0 c1) (global (indt «True»)) (X1 c0 c1) /* suspended on X0, X1 */ [str a] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X0 c0 c1) (global (indt «True»)) (X1 c0 c1) /* suspended on X0, X1 */ [str x] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X0 c0 c1) (global (indt «True»)) (X1 c0 c1) /* suspended on X0, X1 */ [trm (app [global (const «Nat.add»), c0, c1])] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X0 c0 c1) (global (indt «True»)) (X1 c0 c1) /* suspended on X0, X1 */ [trm (app [global (const «Nat.add»), X0 c0 c1, c1])] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X1 c0 c1) (global (indt «True»)) (X2 c0 c1) /* suspended on X1, X2 */ [trm (app [global (const «Nat.add»), X0 c0 c1, c1])] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X1 c0 c1) (global (indt «True»)) (X2 c0 c1) /* suspended on X1, X2 */ [trm c0] {c0 c1} : decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»)) ?- evar (X0 c0 c1) (global (indt «True»)) (X1 c0 c1) /* suspended on X0, X1 */ Query assignments: P = const «eq_op» W = indt «nat» Query assignments: X = typ «elpi.tests.test_API.4» Y = typ «elpi.tests.test_API.5» Universe constraints: UNIVERSES: {elpi.tests.test_API.5 elpi.tests.test_API.4} |= elpi.tests.test_API.4 <= elpi.tests.test_API.5 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Query assignments: R = app [global (indc «ex_intro»), global (indt «nat»), fun `hd_beta_auto` (global (indt «nat»)) c0 \ app [global (indt «eq»), global (indt «nat»), c0, global (indc «O»)], global (indc «O»), global (const «p»)] TY = app [global (indt «ex»), global (indt «nat»), fun `n` (global (indt «nat»)) c0 \ app [global (indt «eq»), global (indt «nat»), c0, global (indc «O»)]] _uvk_168_ = X0 _uvk_169_ = c0 \ X1 c0 _uvk_170_ = X2 _uvk_171_ = X3 Universe constraints: UNIVERSES: {elpi.tests.test_elaborator.58 elpi.tests.test_elaborator.57 elpi.tests.test_elaborator.56 elpi.tests.test_elaborator.55} |= Set <= elpi.tests.test_elaborator.55 elpi.tests.test_elaborator.55 <= elpi.tests.test_elaborator.57 elpi.tests.test_elaborator.56 <= elpi.tests.test_elaborator.57 elpi.tests.test_elaborator.57 <= elpi.tests.test_elaborator.58 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: _f1_view_set : view_set _f1 : view_set _f1 _f2_view_set : view_set _f2 : view_set _f2 _f3_view_set : forall A : Type, view_set _f3 : forall A : Type, view_set _f3 _f4_view_set : forall A : Type, view_set _f4 : forall A : Type, view_set _f4 _pf3_view_set : forall A : Type, view_set _pf3 : forall A : Type, view_set _pf3 Query assignments: C = «Nat.add» F = TODO _pf4_view_set : forall A : Type, view_set _pf4 : forall A : Type, view_set _pf4 _f1_set_set : set_set _f1 : set_set _f1 T = match (app [global (indc «S»), global (indc «O»)]) (fun `n` (global (indt «nat»)) c0 \ global (indt «nat»)) [app [global (indc «S»), app [global (indc «S»), global (indc «O»)]], fun `p` (global (indt «nat»)) c0 \ app [global (indc «S»), app [fix `add` 0 (prod `n` (global (indt «nat»)) c1 \ prod `m` (global (indt «nat»)) c2 \ global (indt «nat»)) c1 \ fun `n` (global (indt «nat»)) c2 \ fun `m` (global (indt «nat»)) c3 \ match c2 (fun `n` (global (indt «nat»)) c4 \ global (indt «nat»)) [c3, fun `p` (global (indt «nat»)) c4 \ app [global (indc «S»), app [c1, c4, c3]]], c0, app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]]] T1 = app [global (const «Nat.add»), app [global (indc «S»), global (indc «O»)], app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] T2 = match (app [global (indc «S»), global (indc «O»)]) (fun `_` (global (indt «nat»)) c0 \ global (indt «nat»)) [app [global (indc «S»), app [global (indc «S»), global (indc «O»)]], fun `p` (global (indt «nat»)) c0 \ app [global (indc «S»), app [fix `plus` 0 (prod `n` (global (indt «nat»)) c1 \ prod `m` (global (indt «nat»)) c2 \ global (indt «nat»)) c1 \ fun `n` (global (indt «nat»)) c2 \ fun `m` (global (indt «nat»)) c3 \ match c2 (fun `n` (global (indt «nat»)) c4 \ global (indt «nat»)) [c3, fun `p` (global (indt «nat»)) c4 \ app [global (indc «S»), app [c1, c4, c3]]], c0, app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]]] _uvk_53_ = c0 \ global (indt «nat») _uvk_54_ = global (indt «nat») _uvk_55_ = c0 \ global (indt «nat») _uvk_56_ = c0 \ c1 \ global (indt «nat») _uvk_57_ = c0 \ c1 \ c2 \ global (indt «nat») _uvk_58_ = c0 \ c1 \ global (indt «nat») _uvk_59_ = c0 \ c1 \ c2 \ global (indt «nat») _uvk_60_ = c0 \ c1 \ c2 \ c3 \ global (indt «nat») _uvk_61_ = c0 \ c1 \ c2 \ c3 \ global (indt «nat») _f2_set_set : set_set _f2 : set_set _f2 _f3_set_set : forall A : Type, set_set _f3 : forall A : Type, set_set _f3 _f4_set_set : forall A : Type, set_set _f4 : forall A : Type, set_set _f4 _pf3_set_set : forall A : Type, set_set _pf3 : forall A : Type, set_set _pf3 _pf4_set_set : forall A : Type, set_set _pf4 : forall A : Type, set_set _pf4 _f1_set_view : set_view _f1 : set_view _f1 _f2_set_view : set_view _f2 : set_view _f2 _f3_set_view : forall A : Type, set_view _f3 : forall A : Type, set_view _f3 _f4_set_view : forall A : Type, set_view _f4 : forall A : Type, set_view _f4 _pf3_set_view : forall A : Type, set_view _pf3 : forall A : Type, set_view _pf3 _pf4_set_view : forall A : Type, set_view _pf4 : forall A : Type, set_view _pf4 _f1_f2_exchange : exchange _f1 _f2 : exchange _f1 _f2 _f2_f1_exchange : exchange _f2 _f1 : exchange _f2 _f1 _f3_f4_exchange : forall A : Type, exchange _f3 _f4 : forall A : Type, exchange _f3 _f4 _f4_f3_exchange : forall A : Type, exchange _f4 _f3 : forall A : Type, exchange _f4 _f3 _pf3_pf4_exchange : forall A : Type, exchange _pf3 _pf4 : forall A : Type, exchange _pf3 _pf4 _pf4_pf3_exchange : forall A : Type, exchange _pf4 _pf3 : forall A : Type, exchange _pf4 _pf3 Query assignments: D = parameter A X0 (sort (typ «elpi.tests.test_API_env.10»)) c0 \ inductive tx X1 (parameter y X2 (global (indt «nat»)) c1 \ arity (prod `_` (global (indt «bool»)) c2 \ sort (typ «elpi.tests.test_API_env.12»))) c1 \ [constructor K1x (parameter y X3 (global (indt «nat»)) c2 \ arity (prod `x` c0 c3 \ prod `n` (global (indt «nat»)) c4 \ prod `p` (app [global (indt «eq»), global (indt «nat»), app [global (indc «S»), c4], c2]) c5 \ prod `e` (app [c1, c4, global (indc «true»)]) c6 \ app [c1, c2, global (indc «true»)])), constructor K2x (parameter y X4 (global (indt «nat»)) c2 \ arity (app [c1, c2, global (indc «false»)]))] type_8 = «elpi.tests.test_API_env.10» type_9 = «elpi.tests.test_API_env.12» Universe constraints: UNIVERSES: {elpi.tests.test_API_env.18 elpi.tests.test_API_env.17 elpi.tests.test_API_env.16 elpi.tests.test_API_env.15 elpi.tests.test_API_env.14 elpi.tests.test_API_env.13 elpi.tests.test_API_env.11} |= tx.u0 < elpi.tests.test_API_env.11 tx.u1 < elpi.tests.test_API_env.13 Set <= eq.u0 Set <= elpi.tests.test_API_env.13 Set <= elpi.tests.test_API_env.14 Set <= elpi.tests.test_API_env.15 Set <= elpi.tests.test_API_env.16 Set <= elpi.tests.test_API_env.17 Set <= elpi.tests.test_API_env.18 tx.u0 <= elpi.tests.test_API_env.14 tx.u1 <= elpi.tests.test_API_env.14 elpi.tests.test_API_env.14 <= tx.u1 ALGEBRAIC UNIVERSES: {tx.u1 tx.u0} UNDEFINED UNIVERSES: elpi.tests.test_API_env.12 elpi.tests.test_API_env.10 WEAK CONSTRAINTS: empty_map : map empty : map empty unit_map : map unit : map unit peano_map : map peano : map peano option_map : map1 option : map1 option pair_map : forall A B : Type, (A -> B) -> forall C D : Type, (C -> D) -> pair A C -> pair B D : forall A B : Type, (A -> B) -> forall C D : Type, (C -> D) -> pair A C -> pair B D seq_map : map1 seq : map1 seq rose_map : map1 rose : map1 rose vect_map : forall A B : Type, (A -> B) -> forall i : peano, vect A i -> vect B i : forall A B : Type, (A -> B) -> forall i : peano, vect A i -> vect B i dyn_map : map dyn : map dyn zeta_map : map1 zeta : map1 zeta iota_map : map iota : map iota large_map : map large : map large prim_int_map : map prim_int : map prim_int prim_float_map : map prim_float : map prim_float pa_record_map : map1 pa_record : map1 pa_record pr_record_map : map1 pr_record : map1 pr_record Query assignments: X = typ «elpi.tests.test_API.6» Y = typ «elpi.tests.test_API.7» Z = typ «elpi.tests.test_API.8» Universe constraints: UNIVERSES: {elpi.tests.test_API.8 elpi.tests.test_API.7 elpi.tests.test_API.6} |= elpi.tests.test_API.6 <= elpi.tests.test_API.8 elpi.tests.test_API.7 <= elpi.tests.test_API.8 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Query assignments: R = app [global (indc «ex_intro»), global (indt «nat»), fun `n` (global (indt «nat»)) c0 \ app [global (indt «eq»), global (indt «nat»), c0, global (indc «O»)], global (indc «O»), global (const «p»)] TY = app [global (indt «ex»), global (indt «nat»), fun `n` (global (indt «nat»)) c0 \ app [global (indt «eq»), global (indt «nat»), c0, global (indc «O»)]] _uvk_205_ = X0 _uvk_206_ = c0 \ X1 c0 _uvk_207_ = X2 _uvk_208_ = X3 Universe constraints: UNIVERSES: {elpi.tests.test_elaborator.62 elpi.tests.test_elaborator.61 elpi.tests.test_elaborator.60 elpi.tests.test_elaborator.59} |= Set <= elpi.tests.test_elaborator.59 elpi.tests.test_elaborator.59 <= elpi.tests.test_elaborator.61 elpi.tests.test_elaborator.60 <= elpi.tests.test_elaborator.61 elpi.tests.test_elaborator.61 <= elpi.tests.test_elaborator.62 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Query assignments: C1 = const «C1» GR1 = const «c12» GR2 = const «c1t» GR3 = const «c1f» fun x : C1 => x : C2 : C1 -> C2 fun (x : C1) (_ : x) => true : forall x : C1, x -> bool fun x : C1 => x 3 : C1 -> nat Query assignments: C = «Nat.add» F = TODO T = app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] T1 = app [global (const «Nat.add»), app [global (indc «S»), global (indc «O»)], app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] T2 = app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] Query assignments: X = typ «elpi.tests.test_API.9» Y = typ «elpi.tests.test_API.10» Universe constraints: UNIVERSES: {elpi.tests.test_API.10 elpi.tests.test_API.9} |= elpi.tests.test_API.9 < elpi.tests.test_API.10 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Query assignments: A = tt B = 0 C = 0 D = sort (typ «Set») E = [«true», «false»] F = [global (indt «bool»), global (indt «bool»)] GR = «bool» Query assignments: D = parameter A explicit (sort (typ «elpi.tests.test_API_env.20»)) c0 \ parameter a explicit c0 c1 \ inductive ind1 tt (parameter B explicit (sort (typ «elpi.tests.test_API_env.21»)) c2 \ parameter b explicit c2 c3 \ arity (prod `C` (sort (typ «elpi.tests.test_API_env.22»)) c4 \ prod `_` c4 c5 \ sort (typ «elpi.tests.test_API_env.26»))) c2 \ [constructor k1 (parameter B explicit (sort (typ «elpi.tests.test_API_env.21»)) c3 \ parameter b explicit c3 c4 \ arity (prod `bb` (app [global (indt «prod»), c3, c3]) c5 \ prod `_` (app [c2, app [global (indt «prod»), c3, c3], c5, global (indt «bool»), global (indc «true»)]) c6 \ app [c2, c3, c4, global (indt «unit»), global (indc «tt»)])), constructor k2 (parameter B explicit (sort (typ «elpi.tests.test_API_env.21»)) c3 \ parameter b explicit c3 c4 \ arity (app [c2, c3, c4, global (indt «nat»), app [global (indc «S»), global (indc «O»)]]))] D1 = parameter A explicit (sort (typ «elpi.tests.test_API_env.20»)) c0 \ parameter a explicit c0 c1 \ inductive ind1 tt (parameter B explicit (sort (typ «elpi.tests.test_API_env.21»)) c2 \ parameter b explicit c2 c3 \ arity (prod `C` (sort (typ «elpi.tests.test_API_env.22»)) c4 \ prod `_` c4 c5 \ sort (typ «elpi.tests.test_API_env.26»))) c2 \ [constructor k1 (parameter B explicit (sort (typ «elpi.tests.test_API_env.21»)) c3 \ parameter b explicit c3 c4 \ arity (prod `bb` (app [global (indt «prod»), c3, c3]) c5 \ prod `_` (app [c2, app [global (indt «prod»), c3, c3], c5, global (indt «bool»), global (indc «true»)]) c6 \ app [c2, c3, c4, global (indt «unit»), global (indc «tt»)])), constructor k2 (parameter B explicit (sort (typ «elpi.tests.test_API_env.21»)) c3 \ parameter b explicit c3 c4 \ arity (app [c2, c3, c4, global (indt «nat»), app [global (indc «S»), global (indc «O»)]]))] I = «ind1» U = «elpi.tests.test_API_env.26» UA = «elpi.tests.test_API_env.20» UB1 = «elpi.tests.test_API_env.21» UB2 = «elpi.tests.test_API_env.21» UB3 = «elpi.tests.test_API_env.21» UC = «elpi.tests.test_API_env.22» Universe constraints: UNIVERSES: {elpi.tests.test_API_env.26} |= Set <= elpi.tests.test_API_env.26 ind1.u1 <= elpi.tests.test_API_env.26 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Query assignments: L = [coercion (const «c1t») 0 (const «C1») sortclass, coercion (const «c1f») 0 (const «C1») funclass, coercion (const «c12») 0 (const «C1») (grefclass (const «C2»))] elpi.tests.test_HOAS.P.p1 1 global (const «P.x») @P.p1 X0 global (const «P.x») P.p1 P.x some (fun `A` (sort (typ «elpi.tests.test_HOAS.11»)) c0 \ fun `f` (app [global (indt «P.foo»), c0]) c1 \ app [primitive (proj elpi.tests.test_HOAS.P.p1 1), c1]) elpi.tests.test_HOAS.P.p2 2 global (const «P.x») @P.p2 X0 global (const «P.x») P.p2 P.x some (fun `A` (sort (typ «elpi.tests.test_HOAS.11»)) c0 \ fun `f` (app [global (indt «P.foo»), c0]) c1 \ app [primitive (proj elpi.tests.test_HOAS.P.p1 1), c1]) unit_is_tt : unit -> bool : unit -> bool peano_is_Zero : peano -> bool : peano -> bool peano_is_Succ : peano -> bool : peano -> bool option_is_None : forall A : Type, option A -> bool : forall A : Type, option A -> bool option_is_Some : forall A : Type, option A -> bool : forall A : Type, option A -> bool pair_is_Comma : forall A B : Type, pair A B -> bool : forall A B : Type, pair A B -> bool seq_is_Nil : forall A : Type, seq A -> bool : forall A : Type, seq A -> bool seq_is_Cons : forall A : Type, seq A -> bool : forall A : Type, seq A -> bool rose_is_Leaf : forall A : Type, rose A -> bool : forall A : Type, rose A -> bool rose_is_Node : forall A : Type, rose A -> bool : forall A : Type, rose A -> bool nest_is_NilN : forall A : Type, nest A -> bool : forall A : Type, nest A -> bool nest_is_ConsN : forall A : Type, nest A -> bool : forall A : Type, nest A -> bool w_is_via : forall A : Type, w A -> bool : forall A : Type, w A -> bool vect_is_VNil : forall (A : Type) (i : peano), vect A i -> bool : forall (A : Type) (i : peano), vect A i -> bool vect_is_VCons : forall (A : Type) (i : peano), vect A i -> bool : forall (A : Type) (i : peano), vect A i -> bool dyn_is_box : dyn -> bool : dyn -> bool zeta_is_Envelope : forall A : Type, zeta A -> bool : forall A : Type, zeta A -> bool beta_is_Redex : forall A : Type, beta A -> bool : forall A : Type, beta A -> bool iota_is_Why : iota -> bool : iota -> bool large_is_K1 : large -> bool large_is_K2 : large -> bool prim_int_is_PI : prim_int -> bool prim_float_is_PF : prim_float -> bool fo_record_is_Build_fo_record : fo_record -> bool : fo_record -> bool pa_record_is_Build_pa_record : forall A : Type, pa_record A -> bool : forall A : Type, pa_record A -> bool pr_record_is_Build_pr_record : forall A : Type, pr_record A -> bool : forall A : Type, pr_record A -> bool enum_is_E1 : enum -> bool : enum -> bool Query assignments: F = app [global (const «nat_of_bool»), global (indc «true»)] is_empty : pred empty : pred empty is_unit : pred unit : pred unit is_peano : pred peano : pred peano is_option : forall A : Type, pred A -> pred (option A) : forall A : Type, pred A -> pred (option A) is_pair : forall A : Type, pred A -> forall B : Type, pred B -> pred (pair A B) : forall A : Type, pred A -> forall B : Type, pred B -> pred (pair A B) is_seq : forall A : Type, pred A -> pred (seq A) : forall A : Type, pred A -> pred (seq A) is_rose : forall A : Type, pred A -> pred (rose A) : forall A : Type, pred A -> pred (rose A) is_nest : forall A : Type, pred A -> pred (nest A) : forall A : Type, pred A -> pred (nest A) is_w : forall A : Type, pred A -> pred (w A) : forall A : Type, pred A -> pred (w A) is_vect : forall A : Type, pred A -> forall i : peano, is_peano i -> pred (vect A i) : forall A : Type, pred A -> forall i : peano, is_peano i -> pred (vect A i) is_dyn : pred dyn : pred dyn is_zeta : forall A : Type, pred A -> pred (zeta A) : forall A : Type, pred A -> pred (zeta A) is_beta : forall A : Type, pred A -> pred (beta A) : forall A : Type, pred A -> pred (beta A) is_iota : pred iota : pred iota is_large : pred large : pred large is_prim_int : pred prim_int : pred prim_int is_prim_float : pred prim_float : pred prim_float is_fo_record : pred fo_record : pred fo_record empty_eq : eq_test empty : eq_test empty unit_eq : eq_test unit : eq_test unit peano_eq : eq_test peano : eq_test peano option_eq : forall A : Type, eq_test A -> eq_test (option A) : forall A : Type, eq_test A -> eq_test (option A) is_pa_record : forall A : Type, pred A -> pred (pa_record A) : forall A : Type, pred A -> pred (pa_record A) is_pr_record : forall A : Type, pred A -> pred (pr_record A) : forall A : Type, pred A -> pred (pr_record A) is_enum : pred enum : pred enum is_ord : forall p : peano, is_peano p -> pred (ord p) : forall p : peano, is_peano p -> pred (ord p) pair_eq : forall A : Type, eq_test A -> forall B : Type, eq_test B -> eq_test (pair A B) : forall A : Type, eq_test A -> forall B : Type, eq_test B -> eq_test (pair A B) is_ord2 : forall p : peano, is_peano p -> pred (ord2 p) : forall p : peano, is_peano p -> pred (ord2 p) is_val : pred val : pred val seq_eq : forall A : Type, eq_test A -> eq_test (seq A) : forall A : Type, eq_test A -> eq_test (seq A) rose_eq : forall A : Type, eq_test A -> eq_test (rose A) : forall A : Type, eq_test A -> eq_test (rose A) vect_eq : forall A : Type, eq_test A -> forall i : peano, eq_test (vect A i) : forall A : Type, eq_test A -> forall i : peano, eq_test (vect A i) zeta_eq : forall A : Type, eq_test A -> eq_test (zeta A) : forall A : Type, eq_test A -> eq_test (zeta A) beta_eq : forall A : Type, eq_test A -> eq_test (beta A) : forall A : Type, eq_test A -> eq_test (beta A) large_eq : eq_test large : eq_test large prim_int_eq : eq_test prim_int : eq_test prim_int prim_float_eq : eq_test prim_float : eq_test prim_float fo_record_eq : eq_test fo_record : eq_test fo_record pa_record_eq : forall A : Type, eq_test A -> eq_test (pa_record A) : forall A : Type, eq_test A -> eq_test (pa_record A) pr_record_eq : forall A : Type, eq_test A -> eq_test (pr_record A) : forall A : Type, eq_test A -> eq_test (pr_record A) enum_eq : eq_test enum : eq_test enum [attribute elpi.loc (leaf-loc File "./tests/test_tactic.v", line 300, column 10, character 6470:)] Query assignments: D = parameter A explicit (sort (typ «elpi.tests.test_API_env.20»)) c0 \ parameter a explicit c0 c1 \ inductive ind1 tt (parameter B explicit (sort (typ «elpi.tests.test_API_env.21»)) c2 \ parameter b explicit c2 c3 \ arity (prod `C` (sort (typ «elpi.tests.test_API_env.22»)) c4 \ prod `_` c4 c5 \ sort (typ «elpi.tests.test_API_env.27»))) c2 \ [constructor k1 (parameter B explicit (sort (typ «elpi.tests.test_API_env.21»)) c3 \ parameter b explicit c3 c4 \ parameter bb implicit (app [global (indt «prod»), c3, c3]) c5 \ arity (prod `_` (app [c2, app [global (indt «prod»), c3, c3], c5, global (indt «bool»), global (indc «true»)]) c6 \ app [c2, c3, c4, global (indt «unit»), global (indc «tt»)])), constructor k2 (parameter B explicit (sort (typ «elpi.tests.test_API_env.21»)) c3 \ parameter b explicit c3 c4 \ arity (app [c2, c3, c4, global (indt «nat»), app [global (indc «S»), global (indc «O»)]]))] D1 = parameter A explicit (sort (typ «elpi.tests.test_API_env.20»)) c0 \ parameter a explicit c0 c1 \ inductive ind1 tt (parameter B explicit (sort (typ «elpi.tests.test_API_env.21»)) c2 \ parameter b explicit c2 c3 \ arity (prod `C` (sort (typ «elpi.tests.test_API_env.22»)) c4 \ prod `_` c4 c5 \ sort (typ «elpi.tests.test_API_env.27»))) c2 \ [constructor k1 (parameter B explicit (sort (typ «elpi.tests.test_API_env.21»)) c3 \ parameter b explicit c3 c4 \ parameter bb implicit (app [global (indt «prod»), c3, c3]) c5 \ arity (prod `_` (app [c2, app [global (indt «prod»), c3, c3], c5, global (indt «bool»), global (indc «true»)]) c6 \ app [c2, c3, c4, global (indt «unit»), global (indc «tt»)])), constructor k2 (parameter B explicit (sort (typ «elpi.tests.test_API_env.21»)) c3 \ parameter b explicit c3 c4 \ arity (app [c2, c3, c4, global (indt «nat»), app [global (indc «S»), global (indc «O»)]]))] I = «ind1» U = «elpi.tests.test_API_env.27» UA = «elpi.tests.test_API_env.20» UB1 = «elpi.tests.test_API_env.21» UB2 = «elpi.tests.test_API_env.21» UB3 = «elpi.tests.test_API_env.21» UC = «elpi.tests.test_API_env.22» Universe constraints: UNIVERSES: {elpi.tests.test_API_env.27} |= Set <= elpi.tests.test_API_env.27 ind1.u1 <= elpi.tests.test_API_env.27 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Query assignments: Spilled_1 = const «nuc» nuc : forall x : nat, C1 -> C3 x nuc is not universe polymorphic Arguments nuc x%nat_scope _ nuc is a reversible coercion Expands to: Constant elpi.tests.test_API_TC_CS.nuc Entry constr is [ LEFTA [ "@"; global; univ_annot | term LEVEL "8" ] ] and lconstr is [ LEFTA [ term LEVEL "200" ] ] where binder_constr is [ LEFTA [ "exists2"; "'"; pattern LEVEL "0"; ":"; term LEVEL "200"; ","; term LEVEL "200"; "&"; term LEVEL "200" | "exists2"; "'"; pattern LEVEL "0"; ","; term LEVEL "200"; "&"; term LEVEL "200" | "exists2"; name; ":"; term LEVEL "200"; ","; term LEVEL "200"; "&"; term LEVEL "200" | "exists2"; name; ","; term LEVEL "200"; "&"; term LEVEL "200" | "exists"; "!"; open_binders; ","; term LEVEL "200" | "exists"; open_binders; ","; term LEVEL "200" | "forall"; open_binders; ","; term LEVEL "200" | "fun"; open_binders; "=>"; term LEVEL "200" | "let"; "fix"; fix_decl; "in"; term LEVEL "200" | "let"; "cofix"; cofix_body; "in"; term LEVEL "200" | "let"; "'"; pattern LEVEL "200"; ":="; term LEVEL "200"; "in"; term LEVEL "200" | "let"; "'"; pattern LEVEL "200"; ":="; term LEVEL "200"; case_type; "in"; term LEVEL "200" | "let"; "'"; pattern LEVEL "200"; "in"; pattern LEVEL "200"; ":="; term LEVEL "200"; case_type; "in"; term LEVEL "200" | "let"; name; binders; let_type_cstr; ":="; term LEVEL "200"; "in"; term LEVEL "200" | "let"; [ "("; LIST0 name SEP ","; ")" | "()" ]; as_return_type; ":="; term LEVEL "200"; "in"; term LEVEL "200" | "if"; term LEVEL "200"; as_return_type; "then"; term LEVEL "200"; "else"; term LEVEL "200" | "fix"; fix_decls | "cofix"; cofix_decls ] ] and term is [ "200" RIGHTA [ binder_constr ] | "100" RIGHTA [ SELF; "<:"; term LEVEL "200" | SELF; "<<:"; term LEVEL "200" | SELF; ":"; term LEVEL "200" ] | "99" RIGHTA [ SELF; "->"; term LEVEL "200" ] | "95" RIGHTA [ SELF; "<->"; NEXT ] | "90" RIGHTA [ ] | "85" RIGHTA [ SELF; "\\/"; term LEVEL "85" ] | "80" RIGHTA [ SELF; "/\\"; term LEVEL "80" ] | "75" RIGHTA [ "~"; term LEVEL "75" ] | "70" RIGHTA [ SELF; ">"; NEXT | SELF; ">="; NEXT | SELF; "<"; NEXT; "<="; NEXT | SELF; "<"; NEXT; "<"; NEXT | SELF; "<"; NEXT | SELF; "<="; NEXT; "<"; NEXT | SELF; "<="; NEXT; "<="; NEXT | SELF; "<="; NEXT | SELF; "<>"; NEXT; ":>"; NEXT | SELF; "<>"; NEXT | SELF; "="; NEXT; "="; NEXT | SELF; "="; NEXT; ":>"; NEXT | SELF; "="; NEXT ] | "60" RIGHTA [ SELF; "++"; term LEVEL "60" | SELF; "::"; term LEVEL "60" ] | "50" LEFTA [ SELF; "||"; NEXT | SELF; "-"; NEXT | SELF; "+"; NEXT ] | "40" LEFTA [ SELF; "&&"; NEXT | SELF; "/"; NEXT | SELF; "*"; NEXT ] | "35" RIGHTA [ "/"; term LEVEL "35" | "-"; term LEVEL "35" ] | "30" RIGHTA [ SELF; "^"; term LEVEL "30" ] | LEFTA [ IDENT "XX"; FIELD "xxx"; LIST0 arg ] | "10" LEFTA [ SELF; LIST1 arg | "@"; global; univ_annot; LIST0 NEXT | "@"; pattern_ident; LIST1 identref ] | "9" LEFTA [ ".."; term LEVEL "0"; ".." ] | "8" LEFTA [ ] | "1" LEFTA [ SELF; ".("; "@"; global; univ_annot; LIST0 (term LEVEL "9"); ")" | SELF; ".("; global; univ_annot; LIST0 arg; ")" | SELF; "%"; IDENT ] | "0" LEFTA [ "lib"; ":"; "@"; qualified_name | "lib"; ":"; qualified_name | QUOTATION "lp:" | IDENT "ltac"; ":"; "("; ltac_expr; ")" | "("; term LEVEL "200"; ","; term LEVEL "200"; ","; LIST1 (term LEVEL "200") SEP ","; ")" | "("; term LEVEL "200"; ","; term LEVEL "200"; ")" | "("; term LEVEL "200"; ")" | "{|"; record_declaration; '|}' | "{"; "'"; pattern LEVEL "0"; "&"; term LEVEL "200"; "&"; term LEVEL "200"; "}" | "{"; "'"; pattern LEVEL "0"; "&"; term LEVEL "200"; "}" | "{"; "'"; pattern LEVEL "0"; ":"; term LEVEL "200"; "&"; term LEVEL "200"; "&"; term LEVEL "200"; "}" | "{"; "'"; pattern LEVEL "0"; ":"; term LEVEL "200"; "&"; term LEVEL "200"; "}" | "{"; "'"; pattern LEVEL "0"; ":"; term LEVEL "200"; "|"; term LEVEL "200"; "&"; term LEVEL "200"; "}" | "{"; "'"; pattern LEVEL "0"; ":"; term LEVEL "200"; "|"; term LEVEL "200"; "}" | "{"; "'"; pattern LEVEL "0"; "|"; term LEVEL "200"; "&"; term LEVEL "200"; "}" | "{"; "'"; pattern LEVEL "0"; "|"; term LEVEL "200"; "}" | "{"; term LEVEL "99"; "&"; term LEVEL "200"; "&"; term LEVEL "200"; "}" | "{"; term LEVEL "99"; "&"; term LEVEL "200"; "}" | "{"; term LEVEL "99"; ":"; term LEVEL "200"; "&"; term LEVEL "200"; "&"; term LEVEL "200"; "}" | "{"; term LEVEL "99"; ":"; term LEVEL "200"; "&"; term LEVEL "200"; "}" | "{"; term LEVEL "99"; ":"; term LEVEL "200"; "|"; term LEVEL "200"; "&"; term LEVEL "200"; "}" | "{"; term LEVEL "99"; ":"; term LEVEL "200"; "|"; term LEVEL "200"; "}" | "{"; term LEVEL "99"; "|"; term LEVEL "200"; "&"; term LEVEL "200"; "}" | "{"; term LEVEL "99"; "|"; term LEVEL "200"; "}" | "{"; term LEVEL "99"; "}" | "{"; binder_constr; "}" | "`{"; term LEVEL "200"; "}" | "`("; term LEVEL "200"; ")" | NUMBER | atomic_constr | term_match | ident; fields; univ_annot | ident; univ_annot | test_array_opening; "["; "|"; array_elems; "|"; lconstr; type_cstr; test_array_closing; "|"; "]"; univ_annot ] ] [attribute elpi.loc (leaf-loc File "./tests/test_tactic.v", line 311, column 12, character 6723:)] skip int 1 skip str 33 skip trm (global (indt «bool»)) [attribute elpi.loc (leaf-loc File "./tests/test_tactic.v", line 311, column 12, character 6723:)] skip int 1 skip str 33 skip trm (global (indt «bool»)) nat -> bool -> True : Prop [attribute elpi.loc (leaf-loc File "./tests/test_tactic.v", line 320, column 12, character 6909:)] [attribute elpi.loc (leaf-loc File "./tests/test_tactic.v", line 320, column 12, character 6909:)] [attribute elpi.loc (leaf-loc File "./tests/test_tactic.v", line 324, column 30, character 7010:)] [attribute elpi.loc (leaf-loc File "./tests/test_tactic.v", line 324, column 30, character 7010:)] c0 \ app [global (const «nat_of_bool»), c0] Query assignments: Res = app [global (const «map»), global (indt «bool»), global (indt «nat»), fun `x` (global (indt «bool»)) c0 \ app [global (const «nat_of_bool»), c0], app [global (indc «cons»), global (indt «bool»), global (indc «true»), app [global (indc «nil»), global (indt «bool»)]]] _uvk_232_ = X0 _uvk_233_ = X1 [attribute elpi.loc (leaf-loc File "./tests/test_tactic.v", line 332, column 7, character 7186:)] [attribute elpi.loc (leaf-loc File "./tests/test_tactic.v", line 332, column 7, character 7186:)] Query assignments: D = parameter P explicit (sort (typ «elpi.tests.test_API_env.28»)) c0 \ parameter p explicit c0 c1 \ record r1 (sort (typ «elpi.tests.test_API_env.28»)) mk_r1 (field [coercion reversible, canonical tt] f1 (prod `_` c0 c2 \ c0) c2 \ field [coercion off, canonical ff] f2 (app [global (indt «eq»), c0, c1, app [c2, c1]]) c3 \ end-record) D1 = parameter P explicit (sort (typ «elpi.tests.test_API_env.28»)) c0 \ parameter p explicit c0 c1 \ record r1 (sort (typ «elpi.tests.test_API_env.28»)) mk_r1 (field [coercion reversible, canonical tt] f1 (prod `_` c0 c2 \ c0) c2 \ field [coercion off, canonical ff] f2 (app [global (indt «eq»), c0, c1, app [c2, c1]]) c3 \ end-record) I = «r1» UP = «elpi.tests.test_API_env.28» UR = «elpi.tests.test_API_env.28» H goal [] (X0) (global (indt «True»)) X1 [trm (global (const «H»))] goal [] (X0) (global (indt «True»)) X1 [trm (app [global (indt «eq»), global (indt «True»), global (const «H»), global (const «H»)])] goal [] (X0) (global (indt «True»)) X1 [trm (global (const «H»))] Query assignments: D = parameter P explicit (sort (typ «elpi.tests.test_API_env.28»)) c0 \ parameter p explicit c0 c1 \ record r1 (sort (typ «elpi.tests.test_API_env.28»)) mk_r1 (field [coercion reversible, canonical tt] f1 (prod `_` c0 c2 \ c0) c2 \ field [coercion regular, canonical ff] f2 (app [global (indt «eq»), c0, c1, app [c2, c1]]) c3 \ end-record) D1 = parameter P explicit (sort (typ «elpi.tests.test_API_env.28»)) c0 \ parameter p explicit c0 c1 \ record r1 (sort (typ «elpi.tests.test_API_env.28»)) mk_r1 (field [coercion reversible, canonical tt] f1 (prod `_` c0 c2 \ c0) c2 \ field [coercion regular, canonical ff] f2 (app [global (indt «eq»), c0, c1, app [c2, c1]]) c3 \ end-record) I = «r1» UP = «elpi.tests.test_API_env.28» UR = «elpi.tests.test_API_env.28» Query assignments: Res = app [global (const «Z_of_nat»), app [global (const «nat_of_bool»), global (indc «true»)]] some (pglobal (const «toto») «elpi.tests.test_HOAS.19 elpi.tests.test_HOAS.20») prod `T1` (sort (typ «elpi.tests.test_HOAS.19»)) c0 \ prod `T2` (sort (typ «elpi.tests.test_HOAS.20»)) c1 \ prod `x` c0 c2 \ c0 Query assignments: Body = some (pglobal (const «toto») «elpi.tests.test_HOAS.19 elpi.tests.test_HOAS.20») C = «titi» Term = prod `T1` (sort (typ «elpi.tests.test_HOAS.19»)) c0 \ prod `T2` (sort (typ «elpi.tests.test_HOAS.20»)) c1 \ prod `x` c0 c2 \ c0 Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.20 elpi.tests.test_HOAS.19} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: [foo (const «X»), foo (indt «nat»), foo (indt «bool»)] [foo (indt «nat»), foo (indt «bool»)] [] [foo (indt «nat»)] empty_fields_t : positive -> Type : positive -> Type empty_fields : forall n : empty, empty_fields_t (empty_tag n) : forall n : empty, empty_fields_t (empty_tag n) empty_construct : forall p : positive, empty_fields_t p -> Datatypes.option empty : forall p : positive, empty_fields_t p -> Datatypes.option empty empty_constructP : forall n : empty, empty_construct (empty_tag n) (empty_fields n) = Datatypes.Some n : forall n : empty, empty_construct (empty_tag n) (empty_fields n) = Datatypes.Some n unit_fields_t : positive -> Type : positive -> Type unit_fields : forall n : unit, unit_fields_t (unit_tag n) : forall n : unit, unit_fields_t (unit_tag n) unit_construct : forall p : positive, unit_fields_t p -> Datatypes.option unit : forall p : positive, unit_fields_t p -> Datatypes.option unit unit_constructP : forall n : unit, unit_construct (unit_tag n) (unit_fields n) = Datatypes.Some n : forall n : unit, unit_construct (unit_tag n) (unit_fields n) = Datatypes.Some n peano_fields_t : positive -> Type : positive -> Type peano_fields : forall n : peano, peano_fields_t (peano_tag n) : forall n : peano, peano_fields_t (peano_tag n) peano_construct : forall p : positive, peano_fields_t p -> Datatypes.option peano : forall p : positive, peano_fields_t p -> Datatypes.option peano peano_constructP : forall n : peano, peano_construct (peano_tag n) (peano_fields n) = Datatypes.Some n : forall n : peano, peano_construct (peano_tag n) (peano_fields n) = Datatypes.Some n option_fields_t : Type -> positive -> Type : Type -> positive -> Type option_fields : forall (A : Type) (l : option A), option_fields_t A (option_tag A l) : forall (A : Type) (l : option A), option_fields_t A (option_tag A l) option_construct : forall (A : Type) (p : positive), option_fields_t A p -> Datatypes.option (option A) : forall (A : Type) (p : positive), option_fields_t A p -> Datatypes.option (option A) option_constructP : forall (A : Type) (l : option A), option_construct A (option_tag A l) (option_fields A l) = Datatypes.Some l : forall (A : Type) (l : option A), option_construct A (option_tag A l) (option_fields A l) = Datatypes.Some l pair_fields_t : Type -> Type -> positive -> Type : Type -> Type -> positive -> Type pair_fields : forall (A B : Type) (l : pair A B), pair_fields_t A B (pair_tag A B l) : forall (A B : Type) (l : pair A B), pair_fields_t A B (pair_tag A B l) pair_construct : forall (A B : Type) (p : positive), pair_fields_t A B p -> Datatypes.option (pair A B) : forall (A B : Type) (p : positive), pair_fields_t A B p -> Datatypes.option (pair A B) pair_constructP : forall (A B : Type) (l : pair A B), pair_construct A B (pair_tag A B l) (pair_fields A B l) = Datatypes.Some l : forall (A B : Type) (l : pair A B), pair_construct A B (pair_tag A B l) (pair_fields A B l) = Datatypes.Some l seq_fields_t : Type -> positive -> Type : Type -> positive -> Type seq_fields : forall (A : Type) (l : seq A), seq_fields_t A (seq_tag A l) : forall (A : Type) (l : seq A), seq_fields_t A (seq_tag A l) seq_construct : forall (A : Type) (p : positive), seq_fields_t A p -> Datatypes.option (seq A) : forall (A : Type) (p : positive), seq_fields_t A p -> Datatypes.option (seq A) seq_constructP : forall (A : Type) (l : seq A), seq_construct A (seq_tag A l) (seq_fields A l) = Datatypes.Some l : forall (A : Type) (l : seq A), seq_construct A (seq_tag A l) (seq_fields A l) = Datatypes.Some l rose_fields_t : Type -> positive -> Type : Type -> positive -> Type rose_fields : forall (A : Type) (l : rose A), rose_fields_t A (rose_tag A l) : forall (A : Type) (l : rose A), rose_fields_t A (rose_tag A l) rose_construct : forall (A : Type) (p : positive), rose_fields_t A p -> Datatypes.option (rose A) : forall (A : Type) (p : positive), rose_fields_t A p -> Datatypes.option (rose A) rose_constructP : forall (A : Type) (l : rose A), rose_construct A (rose_tag A l) (rose_fields A l) = Datatypes.Some l : forall (A : Type) (l : rose A), rose_construct A (rose_tag A l) (rose_fields A l) = Datatypes.Some l beta_fields_t : Type -> positive -> Type : Type -> positive -> Type beta_fields : forall (A : Type) (l : beta A), beta_fields_t A (beta_tag A l) : forall (A : Type) (l : beta A), beta_fields_t A (beta_tag A l) beta_construct : forall (A : Type) (p : positive), beta_fields_t A p -> Datatypes.option (beta A) : forall (A : Type) (p : positive), beta_fields_t A p -> Datatypes.option (beta A) beta_constructP : forall (A : Type) (l : beta A), beta_construct A (beta_tag A l) (beta_fields A l) = Datatypes.Some l : forall (A : Type) (l : beta A), beta_construct A (beta_tag A l) (beta_fields A l) = Datatypes.Some l large_fields_t : positive -> Type : positive -> Type large_fields : forall n : large, large_fields_t (large_tag n) : forall n : large, large_fields_t (large_tag n) large_construct : forall p : positive, large_fields_t p -> Datatypes.option large : forall p : positive, large_fields_t p -> Datatypes.option large large_constructP : forall n : large, large_construct (large_tag n) (large_fields n) = Datatypes.Some n : forall n : large, large_construct (large_tag n) (large_fields n) = Datatypes.Some n prim_int_fields_t : positive -> Type : positive -> Type prim_int_fields : forall n : prim_int, prim_int_fields_t (prim_int_tag n) : forall n : prim_int, prim_int_fields_t (prim_int_tag n) prim_int_construct : forall p : positive, prim_int_fields_t p -> Datatypes.option prim_int : forall p : positive, prim_int_fields_t p -> Datatypes.option prim_int prim_int_constructP : forall n : prim_int, prim_int_construct (prim_int_tag n) (prim_int_fields n) = Datatypes.Some n : forall n : prim_int, prim_int_construct (prim_int_tag n) (prim_int_fields n) = Datatypes.Some n pa_record_fields_t : Type -> positive -> Type : Type -> positive -> Type pa_record_fields : forall (A : Type) (l : pa_record A), pa_record_fields_t A (pa_record_tag A l) : forall (A : Type) (l : pa_record A), pa_record_fields_t A (pa_record_tag A l) pa_record_construct : forall (A : Type) (p : positive), pa_record_fields_t A p -> Datatypes.option (pa_record A) : forall (A : Type) (p : positive), pa_record_fields_t A p -> Datatypes.option (pa_record A) pa_record_constructP : forall (A : Type) (l : pa_record A), pa_record_construct A (pa_record_tag A l) (pa_record_fields A l) = Datatypes.Some l : forall (A : Type) (l : pa_record A), pa_record_construct A (pa_record_tag A l) (pa_record_fields A l) = Datatypes.Some l pr_record_fields_t : Type -> positive -> Type : Type -> positive -> Type pr_record_fields : forall (A : Type) (l : pr_record A), pr_record_fields_t A (pr_record_tag A l) : forall (A : Type) (l : pr_record A), pr_record_fields_t A (pr_record_tag A l) pr_record_construct : forall (A : Type) (p : positive), pr_record_fields_t A p -> Datatypes.option (pr_record A) : forall (A : Type) (p : positive), pr_record_fields_t A p -> Datatypes.option (pr_record A) pr_record_constructP : forall (A : Type) (l : pr_record A), pr_record_construct A (pr_record_tag A l) (pr_record_fields A l) = Datatypes.Some l : forall (A : Type) (l : pr_record A), pr_record_construct A (pr_record_tag A l) (pr_record_fields A l) = Datatypes.Some l sigma_bool_fields_t : positive -> Type : positive -> Type sigma_bool_fields : forall l : sigma_bool, sigma_bool_fields_t (sigma_bool_tag l) : forall l : sigma_bool, sigma_bool_fields_t (sigma_bool_tag l) sigma_bool_construct : forall p : positive, sigma_bool_fields_t p -> Datatypes.option sigma_bool : forall p : positive, sigma_bool_fields_t p -> Datatypes.option sigma_bool sigma_bool_constructP : forall l : sigma_bool, sigma_bool_construct (sigma_bool_tag l) (sigma_bool_fields l) = Datatypes.Some l : forall l : sigma_bool, sigma_bool_construct (sigma_bool_tag l) (sigma_bool_fields l) = Datatypes.Some l ord_fields_t : peano -> positive -> Type : peano -> positive -> Type ord_fields : forall (p : peano) (o : ord p), ord_fields_t p (ord_tag p o) : forall (p : peano) (o : ord p), ord_fields_t p (ord_tag p o) ord_construct : forall (n : peano) (p : positive), ord_fields_t n p -> Datatypes.option (ord n) : forall (n : peano) (p : positive), ord_fields_t n p -> Datatypes.option (ord n) ord_constructP : forall (p : peano) (o : ord p), ord_construct p (ord_tag p o) (ord_fields p o) = Datatypes.Some o : forall (p : peano) (o : ord p), ord_construct p (ord_tag p o) (ord_fields p o) = Datatypes.Some o ord2_fields_t : peano -> positive -> Type : peano -> positive -> Type ord2_fields : forall (p : peano) (o : ord2 p), ord2_fields_t p (ord2_tag p o) : forall (p : peano) (o : ord2 p), ord2_fields_t p (ord2_tag p o) ord2_construct : forall (n : peano) (p : positive), ord2_fields_t n p -> Datatypes.option (ord2 n) : forall (n : peano) (p : positive), ord2_fields_t n p -> Datatypes.option (ord2 n) ord2_constructP : forall (p : peano) (o : ord2 p), ord2_construct p (ord2_tag p o) (ord2_fields p o) = Datatypes.Some o : forall (p : peano) (o : ord2 p), ord2_construct p (ord2_tag p o) (ord2_fields p o) = Datatypes.Some o val_fields_t : positive -> Type : positive -> Type val_fields : forall i : val, val_fields_t (val_tag i) : forall i : val, val_fields_t (val_tag i) val_construct : forall p : positive, val_fields_t p -> Datatypes.option val : forall p : positive, val_fields_t p -> Datatypes.option val val_constructP : forall v : val, val_construct (val_tag v) (val_fields v) = Datatypes.Some v : forall v : val, val_construct (val_tag v) (val_fields v) = Datatypes.Some v Query assignments: Y = global (indc «is_O») {{ nat; S; }} {{ nat; S; }} Query assignments: GR = const «Nat.add» L = {{ nat; S; }} S = {{ nat; S; }} COQC tests/test_eqb.v c0 \ app [global (const «Z_of_nat»), app [global (const «nat_of_bool»), c0]] Query assignments: Res = app [global (const «map»), global (indt «bool»), global (const «Z»), fun `x` (global (indt «bool»)) c0 \ app [global (const «Z_of_nat»), app [global (const «nat_of_bool»), c0]], app [global (indc «cons»), global (indt «bool»), global (indc «true»), app [global (indc «nil»), global (indt «bool»)]]] _uvk_268_ = X0 _uvk_269_ = X1 pglobal (const «toto») X0 pglobal (const «toto») «elpi.tests.test_HOAS.21 elpi.tests.test_HOAS.22» toto Query assignments: Spilled_1 = toto univ_inst_1 = X0 univ_inst_2 = «elpi.tests.test_HOAS.23 elpi.tests.test_HOAS.24» Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.24 elpi.tests.test_HOAS.23} |= ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.24 elpi.tests.test_HOAS.23} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.24 elpi.tests.test_HOAS.23 WEAK CONSTRAINTS: {{ X.a; }} {{ X.a; Nat.add; nat; }} {{ X.a; }} {{ X.a; Nat.add; nat; O; S; }} Query assignments: AllL = {{ X.a; Nat.add; nat; }} AllS = {{ X.a; Nat.add; nat; O; S; }} GR = const «X.b» L = {{ X.a; }} M = «elpi.tests.test_API_env.HOAS.X» S = {{ X.a; }} Spilled_1 = const «X.a» Query assignments: Y = app [global (indc «is_S»), app [global (indc «S»), global (indc «O»)], app [global (indc «is_S»), global (indc «O»), global (indc «is_O»)]] app [pglobal (const «t») X0, global (indt «nat»), pglobal (const «fnat») X1] app [pglobal (const «t») «elpi.tests.test_HOAS.29», global (indt «nat»), pglobal (const «fnat») «»] Query assignments: T = app [pglobal (const «t») «elpi.tests.test_HOAS.29», global (indt «nat»), pglobal (const «fnat») «»] Ty = global (indt «nat») univ_inst_3 = «elpi.tests.test_HOAS.29» univ_inst_4 = «» Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.29} |= Set <= elpi.tests.test_HOAS.29 Set = elpi.tests.test_HOAS.29 ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.29} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.29 := Set WEAK CONSTRAINTS: is_pred = fun (n : nat) (Pn : is_nat n) => match Pn in (is_nat n0) return (is_nat match n0 with | 0 => n | S u => u end) with | is_O => Pn | is_S _ Pu => Pu end : forall n : nat, is_nat n -> is_nat (Nat.pred n) Arguments is_pred n%nat_scope Pn is_pred : is_nat2nat Nat.pred : is_nat2nat Nat.pred is_predn : is_nat2nat predn : is_nat2nat predn is_add : is_nat2nat2nat Nat.add : is_nat2nat2nat Nat.add Query assignments: R = prod `r` (global (const «ring»)) c0 \ prod `x` (app [global (const «carr»), c0]) c1 \ app [global (indt «eq»), app [global (const «carr»), c0], c1, c1] T = sort (typ «elpi.tests.test_elaborator.75») _uvk_304_ = c0 \ c1 \ X0 c0 c1 Universe constraints: UNIVERSES: {elpi.tests.test_elaborator.75 elpi.tests.test_elaborator.74 elpi.tests.test_elaborator.73 elpi.tests.test_elaborator.72 elpi.tests.test_elaborator.70} |= ring.u0 <= elpi.tests.test_elaborator.70 elpi.tests.test_elaborator.70 <= elpi.tests.test_elaborator.75 elpi.tests.test_elaborator.73 <= elpi.tests.test_elaborator.74 elpi.tests.test_elaborator.74 <= elpi.tests.test_elaborator.75 ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: File "./tests/test_API.v", line 204, characters 0-107: Warning: Option Foo Bar is deprecated [deprecated-option,deprecated] Inductive is_bla : forall H : nat, is_nat H -> bla H -> Type := is_Bla : forall H : nat, is_nat H -> is_bla 0 is_O (Bla H) | is_Blu : forall (n : nat) (Pn : is_nat n) (H : bla n), is_bla n Pn H -> is_bla 1 (is_S 0 is_O) (Blu n H). Arguments is_bla _%nat_scope P_ s1 Arguments is_Bla _%nat_scope P_ Arguments is_Blu n%nat_scope Pn _ P_ derive.param1_trivial: wrong shape is_nest . It does not look like a unary parametricity translation of an inductive with no indexes. Query assignments: A4 = «elpi.tests.test_HOAS.36» A5 = «elpi.tests.test_HOAS.37» A6 = «elpi.tests.test_HOAS.38» A7 = «elpi.tests.test_HOAS.39» A8 = «elpi.tests.test_HOAS.40» Arity = prod `T` (sort (typ «elpi.tests.test_HOAS.30»)) c0 \ sort (typ «elpi.tests.test_HOAS.30») Arity1 = prod `T` (sort (typ «elpi.tests.test_HOAS.31»)) c0 \ sort (typ «elpi.tests.test_HOAS.31») Arity2 = prod `T` (sort (typ «elpi.tests.test_HOAS.32»)) c0 \ sort (typ «elpi.tests.test_HOAS.32») Arity4 = prod `T` (sort (typ «elpi.tests.test_HOAS.36»)) c0 \ sort (typ «elpi.tests.test_HOAS.36») Arity5 = prod `T` (sort (typ «elpi.tests.test_HOAS.37»)) c0 \ sort (typ «elpi.tests.test_HOAS.37») B = «Build_F» B1 = «elpi.tests.test_HOAS.43» B2 = «elpi.tests.test_HOAS.44» BTy2 = prod `T` (sort (typ «elpi.tests.test_HOAS.42»)) c0 \ prod `t` c0 c1 \ app [pglobal (indt «F») «elpi.tests.test_HOAS.42», c0] BTy3 = prod `T` (sort (typ «elpi.tests.test_HOAS.43»)) c0 \ prod `t` c0 c1 \ app [pglobal (indt «F») «elpi.tests.test_HOAS.43», c0] BoN = none BoT = some (fun `T` (sort (typ «elpi.tests.test_HOAS.45»)) c0 \ fun `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.45», c0]) c1 \ match c1 (fun `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.45», c0]) c2 \ c0) [fun `t` c0 c2 \ c2]) BoT1 = some (fun `T` (sort (typ «elpi.tests.test_HOAS.46»)) c0 \ fun `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.46», c0]) c1 \ match c1 (fun `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.46», c0]) c2 \ c0) [fun `t` c0 c2 \ c2]) BoT2 = some (fun `T` (sort (typ «elpi.tests.test_HOAS.47»)) c0 \ fun `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.47», c0]) c1 \ match c1 (fun `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.47», c0]) c2 \ c0) [fun `t` c0 c2 \ c2]) BoT4 = some (fun `T` (sort (typ «elpi.tests.test_HOAS.49»)) c0 \ fun `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.49», c0]) c1 \ match c1 (fun `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.49», c0]) c2 \ c0) [fun `t` c0 c2 \ c2]) BoT5 = some (fun `T` (sort (typ «elpi.tests.test_HOAS.50»)) c0 \ fun `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.50», c0]) c1 \ match c1 (fun `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.50», c0]) c2 \ c0) [fun `t` c0 c2 \ c2]) BoT6 = some (fun `T` (sort (typ «elpi.tests.test_HOAS.64»)) c0 \ fun `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.64», c0]) c1 \ match c1 (fun `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.64», c0]) c2 \ c0) [fun `t` c0 c2 \ c2]) BoT7 = some (fun `T` (sort (typ «elpi.tests.test_HOAS.66»)) c0 \ fun `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.66», c0]) c1 \ match c1 (fun `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.66», c0]) c2 \ c0) [fun `t` c0 c2 \ c2]) C1 = «elpi.tests.test_HOAS.54» C2 = «elpi.tests.test_HOAS.55» C3 = «elpi.tests.test_HOAS.58» C4 = «elpi.tests.test_HOAS.59» C5 = «elpi.tests.test_HOAS.62» C6 = «elpi.tests.test_HOAS.63» D1 = «elpi.tests.test_HOAS.49» D2 = «elpi.tests.test_HOAS.50» D3 = «elpi.tests.test_HOAS.51» D4 = X0 E5 = «elpi.tests.test_HOAS.66» E6 = «elpi.tests.test_HOAS.67» GRB = indc «Build_F» GRF = indt «F» GRn = const «n» GRt = const «t» I = «elpi.tests.test_HOAS.30» I2 = «elpi.tests.test_HOAS.41» I3 = «elpi.tests.test_HOAS.45» I4 = «» Ind = «F» K = [«Build_F»] KTys = [prod `T` (sort (typ «elpi.tests.test_HOAS.30»)) c0 \ prod `t` c0 c1 \ app [pglobal (indt «F») «elpi.tests.test_HOAS.30», c0]] KTys1 = [prod `T` (sort (typ «elpi.tests.test_HOAS.31»)) c0 \ prod `t` c0 c1 \ app [pglobal (indt «F») «elpi.tests.test_HOAS.31», c0]] KTys3 = [prod `T` (sort (typ «elpi.tests.test_HOAS.33»)) c0 \ prod `t` c0 c1 \ app [pglobal (indt «F») «elpi.tests.test_HOAS.33», c0]] KTys4 = [prod `T` (sort (typ «elpi.tests.test_HOAS.36»)) c0 \ prod `t` c0 c1 \ app [pglobal (indt «F») «elpi.tests.test_HOAS.36», c0]] KTys6 = [prod `T` (sort (typ «elpi.tests.test_HOAS.38»)) c0 \ prod `t` c0 c1 \ app [pglobal (indt «F») «elpi.tests.test_HOAS.38», c0]] N = «n» T = «t» TyB = prod `T` (sort (typ «elpi.tests.test_HOAS.41»)) c0 \ prod `t` c0 c1 \ app [pglobal (indt «F») «elpi.tests.test_HOAS.41», c0] TyB2 = prod `T` (sort (typ «elpi.tests.test_HOAS.56»)) c0 \ prod `t` c0 c1 \ app [pglobal (indt «F») «elpi.tests.test_HOAS.56», c0] TyB3 = prod `T` (sort (typ «elpi.tests.test_HOAS.58»)) c0 \ prod `t` c0 c1 \ app [pglobal (indt «F») «elpi.tests.test_HOAS.58», c0] TyF = prod `T` (sort (typ «elpi.tests.test_HOAS.30»)) c0 \ sort (typ «elpi.tests.test_HOAS.30») TyF2 = prod `T` (sort (typ «elpi.tests.test_HOAS.52»)) c0 \ sort (typ «elpi.tests.test_HOAS.52») TyF3 = prod `T` (sort (typ «elpi.tests.test_HOAS.54»)) c0 \ sort (typ «elpi.tests.test_HOAS.54») TyN = global (indt «nat») TyT = prod `T` (sort (typ «elpi.tests.test_HOAS.45»)) c0 \ prod `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.45», c0]) c1 \ c0 TyT1 = prod `T` (sort (typ «elpi.tests.test_HOAS.46»)) c0 \ prod `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.46», c0]) c1 \ c0 TyT3 = prod `T` (sort (typ «elpi.tests.test_HOAS.48»)) c0 \ prod `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.48», c0]) c1 \ c0 TyT4 = prod `T` (sort (typ «elpi.tests.test_HOAS.49»)) c0 \ prod `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.49», c0]) c1 \ c0 TyT5 = prod `T` (sort (typ «elpi.tests.test_HOAS.51»)) c0 \ prod `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.51», c0]) c1 \ c0 TyT6 = prod `T` (sort (typ «elpi.tests.test_HOAS.60»)) c0 \ prod `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.60», c0]) c1 \ c0 TyT7 = prod `T` (sort (typ «elpi.tests.test_HOAS.62»)) c0 \ prod `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.62», c0]) c1 \ c0 Tyt = prod `T` (sort (typ «elpi.tests.test_HOAS.45»)) c0 \ prod `f` (app [pglobal (indt «F») «elpi.tests.test_HOAS.45», c0]) c1 \ c0 Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.67 elpi.tests.test_HOAS.66 elpi.tests.test_HOAS.65 elpi.tests.test_HOAS.64 elpi.tests.test_HOAS.63 elpi.tests.test_HOAS.62 elpi.tests.test_HOAS.61 elpi.tests.test_HOAS.60 elpi.tests.test_HOAS.59 elpi.tests.test_HOAS.58 elpi.tests.test_HOAS.57 elpi.tests.test_HOAS.56 elpi.tests.test_HOAS.55 elpi.tests.test_HOAS.54 elpi.tests.test_HOAS.53 elpi.tests.test_HOAS.52 elpi.tests.test_HOAS.51 elpi.tests.test_HOAS.50 elpi.tests.test_HOAS.49 elpi.tests.test_HOAS.48 elpi.tests.test_HOAS.47 elpi.tests.test_HOAS.46 elpi.tests.test_HOAS.45 elpi.tests.test_HOAS.44 elpi.tests.test_HOAS.43 elpi.tests.test_HOAS.42 elpi.tests.test_HOAS.41 elpi.tests.test_HOAS.40 elpi.tests.test_HOAS.39 elpi.tests.test_HOAS.38 elpi.tests.test_HOAS.37 elpi.tests.test_HOAS.36 elpi.tests.test_HOAS.35 elpi.tests.test_HOAS.34 elpi.tests.test_HOAS.33 elpi.tests.test_HOAS.32 elpi.tests.test_HOAS.31 elpi.tests.test_HOAS.30} |= ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.45 elpi.tests.test_HOAS.44 elpi.tests.test_HOAS.43 elpi.tests.test_HOAS.42 elpi.tests.test_HOAS.41 elpi.tests.test_HOAS.40 elpi.tests.test_HOAS.39 elpi.tests.test_HOAS.38 elpi.tests.test_HOAS.37 elpi.tests.test_HOAS.36 elpi.tests.test_HOAS.35 elpi.tests.test_HOAS.34 elpi.tests.test_HOAS.33 elpi.tests.test_HOAS.32 elpi.tests.test_HOAS.31 elpi.tests.test_HOAS.30} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.45 elpi.tests.test_HOAS.44 elpi.tests.test_HOAS.43 elpi.tests.test_HOAS.42 elpi.tests.test_HOAS.41 elpi.tests.test_HOAS.40 elpi.tests.test_HOAS.39 elpi.tests.test_HOAS.38 elpi.tests.test_HOAS.37 elpi.tests.test_HOAS.36 elpi.tests.test_HOAS.35 elpi.tests.test_HOAS.34 elpi.tests.test_HOAS.33 elpi.tests.test_HOAS.32 elpi.tests.test_HOAS.31 elpi.tests.test_HOAS.30 WEAK CONSTRAINTS: hello [int 1, int 2, trm (global (indt «nat»)), str x] derive.param1_trivial: wrong shape is_vect A PA . It does not look like a unary parametricity translation of an inductive with no indexes. «elpi.tests.test_HOAS.68» parameter T explicit (sort (typ «elpi.tests.test_HOAS.68»)) c0 \ record F (sort (typ «elpi.tests.test_HOAS.68»)) Build_F (field [coercion off, canonical tt] t c0 c1 \ end-record) «elpi.tests.test_HOAS.68» parameter T explicit (sort (typ «elpi.tests.test_HOAS.68»)) c0 \ record F (sort (typ «elpi.tests.test_HOAS.68»)) Build_F (field [coercion off, canonical tt] t c0 c1 \ end-record) parameter T explicit (sort (typ «elpi.tests.test_HOAS.69»)) c0 \ record F (sort (typ «elpi.tests.test_HOAS.69»)) Build_F (field [coercion off, canonical tt] t c0 c1 \ end-record) Query assignments: Decl = parameter T explicit (sort (typ «elpi.tests.test_HOAS.68»)) c0 \ record F (sort (typ «elpi.tests.test_HOAS.68»)) Build_F (field [coercion off, canonical tt] t c0 c1 \ end-record) Decl1 = parameter T explicit (sort (typ «elpi.tests.test_HOAS.68»)) c0 \ record F (sort (typ «elpi.tests.test_HOAS.68»)) Build_F (field [coercion off, canonical tt] t c0 c1 \ end-record) Decl2 = parameter T explicit (sort (typ «elpi.tests.test_HOAS.69»)) c0 \ record F (sort (typ «elpi.tests.test_HOAS.69»)) Build_F (field [coercion off, canonical tt] t c0 c1 \ end-record) GRF = indt «F» I = «elpi.tests.test_HOAS.68» Ind = «F» Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.69 elpi.tests.test_HOAS.68} |= ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.69 elpi.tests.test_HOAS.68} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.69 elpi.tests.test_HOAS.68 WEAK CONSTRAINTS: Query assignments: PDb = [tc-instance (const «reali_is_fin_length») 0, tc-instance (const «reali_is_vec_length») 0, tc-instance (const «reali_is_predn») 0, tc-instance (const «reali_is_plus'») 0, tc-instance (const «reali_is_nat_S») 0, tc-instance (const «reali_is_nat_O») 0, tc-instance (const «reali_is_prim_float») 0, tc-instance (const «reali_is_prim_float_PF») 0, tc-instance (const «reali_is_nest_ConsN») 0, tc-instance (const «reali_is_w_via») 0, tc-instance (const «reali_is_val_V») 0, tc-instance (const «reali_is_peano») 0, tc-instance (const «reali_is_large») 0, tc-instance (const «reali_is_empty») 0, tc-instance (const «reali_is_iota_Why») 0, tc-instance (const «reali_is_nat2nat2nat») 0, tc-instance (const «reali_is_unit_tt») 0, tc-instance (const «reali_is_nest_NilN») 0, tc-instance (const «reali_is_prim_int») 0, tc-instance (const «reali_is_vect_VCons») 0, tc-instance (const «reali_is_large_K26») 0, tc-instance (const «reali_is_large_K25») 0, tc-instance (const «reali_is_large_K24») 0, tc-instance (const «reali_is_large_K23») 0, tc-instance (const «reali_is_large_K22») 0, tc-instance (const «reali_is_large_K21») 0, tc-instance (const «reali_is_large_K20») 0, tc-instance (const «reali_is_large_K19») 0, tc-instance (const «reali_is_large_K18») 0, tc-instance (const «reali_is_large_K17») 0, tc-instance (const «reali_is_large_K16») 0, tc-instance (const «reali_is_large_K15») 0, tc-instance (const «reali_is_large_K14») 0, tc-instance (const «reali_is_large_K13») 0, tc-instance (const «reali_is_large_K12») 0, tc-instance (const «reali_is_large_K11») 0, tc-instance (const «reali_is_large_K10») 0, tc-instance (const «reali_is_eq_eq_refl») 0, tc-instance (const «Coverage.reali_is_unit_tt») 0, tc-instance (const «reali_is_large_K9») 0, tc-instance (const «reali_is_large_K8») 0, tc-instance (const «reali_is_large_K7») 0, tc-instance (const «reali_is_large_K6») 0, tc-instance (const «reali_is_large_K5») 0, tc-instance (const «reali_is_large_K4») 0, tc-instance (const «reali_is_large_K3») 0, tc-instance (const «reali_is_large_K2») 0, tc-instance (const «reali_is_large_K1») 0, tc-instance (const «reali_is_seq_Cons») 0, tc-instance (const «reali_is_ord_mkOrd») 0, tc-instance (const «reali_is_peano_Zero») 0, tc-instance (const «reali_is_peano_Succ») 0, tc-instance (const «reali_is_fo_record») 0, tc-instance (const «reali_is_vec_vcons») 0, tc-instance (const «reali_is_quasidn») 0, tc-instance (const «reali_is_vect_VNil») 0, tc-instance (const «reali_is_seq_Nil») 0, tc-instance (const «reali_is_zeta_Envelope») 0, tc-instance (const «reali_is_list_cons») 0, tc-instance (const «exports.reali_is_eq») 0, tc-instance (const «reali_is_beta_Redex») 0, tc-instance (const «reali_is_unit») 0, tc-instance (const «reali_is_test») 0, tc-instance (const «reali_is_prod») 0, tc-instance (const «reali_is_pred») 0, tc-instance (const «reali_is_list») 0, tc-instance (const «reali_is_bool») 0, tc-instance (const «reali_is_sigma_bool_Build_sigma_bool») 0, tc-instance (const «reali_is_option_Some») 0, tc-instance (const «reali_is_option_None») 0, tc-instance (const «reali_is_box_peano») 0, tc-instance (const «reali_is_nat2nat») 0, tc-instance (const «reali_is_sigma_bool») 0, tc-instance (const «reali_is_zeta») 0, tc-instance (const «reali_is_vect») 0, tc-instance (const «Coverage.reali_is_unit») 0, tc-instance (const «reali_is_rose») 0, tc-instance (const «reali_is_pair») 0, tc-instance (const «reali_is_ord2») 0, tc-instance (const «reali_is_nest») 0, tc-instance (const «reali_is_iota») 0, tc-instance (const «reali_is_enum») 0, tc-instance (const «Coverage.reali_is_bool») 0, tc-instance (const «reali_is_beta») 0, tc-instance (const «reali_is_vec_length_type») 0, tc-instance (const «reali_is_vec_length_rec») 0, tc-instance (const «reali_is_pr_record») 0, tc-instance (const «reali_is_rose_Node») 0, tc-instance (const «reali_is_rose_Leaf») 0, tc-instance (const «reali_is_rose_p_Nodep») 0, tc-instance (const «reali_is_rose_p_Leafp») 0, tc-instance (const «reali_is_eq») 0, tc-instance (const «reali_is_is_list») 0, tc-instance (const «reali_is_w») 0, tc-instance (const «reali_is_vec_vnil») 0, tc-instance (const «reali_is_dep_record_Build_dep_record») 0, tc-instance (const «reali_is_pr_record_Build_pr_record») 0, tc-instance (const «reali_is_rose_o_Nodeo») 0, tc-instance (const «reali_is_rose_o_Leafo») 0, tc-instance (const «reali_is_weirdn») 0, tc-instance (const «reali_is_pair_Comma») 0, tc-instance (const «reali_is_dep_record») 0, tc-instance (const «reali_is_is_zero») 0, tc-instance (const «reali_is_pa_record») 0, tc-instance (const «reali_is_fin_FS») 0, tc-instance (const «reali_is_fin_FO») 0, tc-instance (const «reali_is_bool_true») 0, tc-instance (const «reali_is_divmod») 0, tc-instance (const «reali_is_prim_int_PI») 0, tc-instance (const «reali_is_list_nil») 0, tc-instance (const «reali_is_vec») 0, tc-instance (const «reali_is_snd») 0, tc-instance (const «reali_is_nat») 0, tc-instance (const «reali_is_fst») 0, tc-instance (const «reali_is_fin») 0, tc-instance (const «reali_is_div») 0, tc-instance (const «reali_is_bla») 0, tc-instance (const «reali_is_add») 0, tc-instance (const «reali_is_rose_p») 0, tc-instance (const «reali_is_rose_o») 0, tc-instance (const «reali_is_is_list_is_nil») 0, tc-instance (const «reali_is_option») 0, tc-instance (const «reali_is_is_leq») 0, tc-instance (const «reali_is_bool_false») 0, tc-instance (const «reali_is_prod_pair») 0, tc-instance (const «Coverage.reali_is_bool_true») 0, tc-instance (const «reali_is_val») 0, tc-instance (const «reali_is_seq») 0, tc-instance (const «reali_is_ord») 0, tc-instance (const «reali_is_dyn») 0, tc-instance (const «reali_is_is_list_is_cons») 0, tc-instance (const «reali_is_fo_record_Build_fo_record») 0, tc-instance (const «Coverage.reali_is_bool_false») 0, tc-instance (const «reali_is_enum_E3») 0, tc-instance (const «reali_is_enum_E2») 0, tc-instance (const «reali_is_enum_E1») 0, tc-instance (const «reali_is_dyn_box») 0, tc-instance (const «exports.reali_is_eq_eq_refl») 0, tc-instance (const «reali_is_box_peano_Box») 0, tc-instance (const «reali_is_ord2_mkOrd2») 0, tc-instance (const «reali_is_bla_Blu») 0, tc-instance (const «reali_is_bla_Bla») 0, tc-instance (const «reali_is_pa_record_Build_pa_record») 0] Spilled_1 = indt «reali_db» File "./tests/test_param1.v", line 158, characters 0-30: Warning: Not a truly recursive fixpoint. [non-recursive,fixpoints] Query assignments: T = global (const «int») X = primitive (uint63 99) coq.pp.box (coq.pp.hv 2) [coq.pp.str Module, coq.pp.spc, coq.pp.str Foo, coq.pp.spc, coq.pp.str :=, coq.pp.brk 1 0, coq.pp.str body, coq.pp.spc, coq.pp.str End Foo.] Module Foo := body End Foo. fix foo (x : ?e3) (y : ?e4) {struct x} : ?e2 := match x as x0 return ?e6@{x:=x0} with | true => S (S (S O)) | false => y end fix foo x y {struct x} := if x as x0 return ?e6@{x:=x0} then 3 else y COQC tests/test_API2.v «elpi.tests.test_HOAS.70» «elpi.tests.test_HOAS.71» Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.71 elpi.tests.test_HOAS.70} |= ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.71 elpi.tests.test_HOAS.70} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.71 elpi.tests.test_HOAS.70 WEAK CONSTRAINTS: Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.71 elpi.tests.test_HOAS.70} |= elpi.tests.test_HOAS.70 = elpi.tests.test_HOAS.71 ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.71 elpi.tests.test_HOAS.70} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.71 elpi.tests.test_HOAS.70 := elpi.tests.test_HOAS.71 WEAK CONSTRAINTS: Query assignments: GRF = indt «F» I1 = «elpi.tests.test_HOAS.70» I2 = «elpi.tests.test_HOAS.71» Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.71 elpi.tests.test_HOAS.70} |= elpi.tests.test_HOAS.70 = elpi.tests.test_HOAS.71 ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.71 elpi.tests.test_HOAS.70} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.71 elpi.tests.test_HOAS.70 := elpi.tests.test_HOAS.71 WEAK CONSTRAINTS: File "./tests/test_API2.v", line 3, characters 0-27: Warning: Option Foo Bar is deprecated [deprecated-option,deprecated] «elpi.tests.test_HOAS.72» «» Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.72} |= ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.72} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.72 WEAK CONSTRAINTS: different universe instance lengths Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.72} |= ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.72} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.72 WEAK CONSTRAINTS: Query assignments: E = different universe instance lengths GRF = indt «F» GRfnat = const «fnat» I1 = «elpi.tests.test_HOAS.72» I2 = «» Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.72} |= ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.72} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.72 WEAK CONSTRAINTS: Query assignments: T = global (const «float») X = primitive (float64 993000) empty_eqb : eq_test2 empty empty : eq_test2 empty empty unit_eqb : eq_test2 unit unit : eq_test2 unit unit peano_eqb : eq_test2 peano peano : eq_test2 peano peano option_eqb : forall A : Type, eq_test2 A A -> eq_test2 (option A) (option A) : forall A : Type, eq_test2 A A -> eq_test2 (option A) (option A) pair_eqb : forall A : Type, eq_test2 A A -> forall B : Type, eq_test2 B B -> eq_test2 (pair A B) (pair A B) : forall A : Type, eq_test2 A A -> forall B : Type, eq_test2 B B -> eq_test2 (pair A B) (pair A B) seq_eqb : forall A : Type, eq_test2 A A -> eq_test2 (seq A) (seq A) : forall A : Type, eq_test2 A A -> eq_test2 (seq A) (seq A) rose_eqb : forall A : Type, eq_test2 A A -> eq_test2 (rose A) (rose A) : forall A : Type, eq_test2 A A -> eq_test2 (rose A) (rose A) beta_eqb : forall A : Type, eq_test2 A A -> eq_test2 (beta A) (beta A) : forall A : Type, eq_test2 A A -> eq_test2 (beta A) (beta A) prim_int_eqb : eq_test2 prim_int prim_int : eq_test2 prim_int prim_int fo_record_eqb : eq_test2 fo_record fo_record : eq_test2 fo_record fo_record pa_record_eqb : forall A : Type, eq_test2 A A -> eq_test2 (pa_record A) (pa_record A) : forall A : Type, eq_test2 A A -> eq_test2 (pa_record A) (pa_record A) pr_record_eqb : forall A : Type, eq_test2 A A -> eq_test2 (pr_record A) (pr_record A) : forall A : Type, eq_test2 A A -> eq_test2 (pr_record A) (pr_record A) enum_eqb : eq_test2 enum enum : eq_test2 enum enum sigma_bool_eqb : eq_test2 sigma_bool sigma_bool : eq_test2 sigma_bool sigma_bool ord_eqb : forall p1 p2 : peano, eq_test2 (ord p1) (ord p2) : forall p1 p2 : peano, eq_test2 (ord p1) (ord p2) ord2_eqb : forall p1 p2 : peano, eq_test2 (ord2 p1) (ord2 p2) : forall p1 p2 : peano, eq_test2 (ord2 p1) (ord2 p2) val_eqb : eq_test2 val val : eq_test2 val val alias_eqb : eq_test2 alias alias : eq_test2 alias alias Query assignments: GR = const «Ranalysis5.derivable_pt_lim_CVU» S = {{ BinInt.Z.A'A_left; BinNat.N.A'A_right; PeanoNat.Nat.A'A_right; BinInt.Z.A'A_right; Field_theory.AF_1_neq_0; Field_theory.AF_AR; Field_theory.AFdiv_def; Field_theory.AFinv_l; Ring_theory.ARadd_0_l; Ring_theory.ARadd_0_r; Ring_theory.ARadd_assoc; Ring_theory.ARadd_assoc1; Ring_theory.ARadd_assoc2; Ring_theory.ARadd_comm; Ring_theory.ARdistr_l; Ring_theory.ARdistr_r; InitialRing.ARgen_phiPOS_Psucc; InitialRing.ARgen_phiPOS_add; InitialRing.ARgen_phiPOS_mult; Ring_theory.ARmul_0_l; Ring_theory.ARmul_0_r; Ring_theory.ARmul_1_l; Ring_theory.ARmul_1_r; Ring_theory.ARmul_assoc; Ring_theory.ARmul_assoc1; Ring_theory.ARmul_assoc2; Ring_theory.ARmul_comm; Ring_theory.ARopp_add; Ring_theory.ARopp_mul_l; Ring_theory.ARopp_mul_r; Ring_theory.ARopp_zero; Ring_theory.ARsub_def; Ring_theory.ARsub_ext; Ring_theory.ARth_SRth; RList.AbsList; RList.AbsList_P1; RList.AbsList_P2; Acc_rect; Tauto.BFormula; PSeries_reg.Ball_in_inter; Rlimit.Base; PSeries_reg.Boule; PSeries_reg.Boule_center; Setoid.Build_Setoid_Theory; Ring_polynom.CFactor; RMicromega.CInvR0; RMicromega.CPowR0; ConstructiveReals.CR_Q_dense; ConstructiveReals.CR_archimedean; ConstructiveReals.CR_cauchy; ConstructiveReals.CR_complete; ConstructiveReals.CR_cv; ConstructiveLimits.CR_cv_bound_down; ConstructiveLimits.CR_cv_le; ConstructiveLimits.CR_cv_open_above; ConstructiveLimits.CR_cv_open_below; ConstructiveLimits.CR_cv_opp; ConstructiveLimits.CR_cv_plus; ConstructiveLimits.CR_cv_proper; ConstructiveReals.CR_of_Q; ConstructiveReals.CR_of_Q_le; ConstructiveReals.CR_of_Q_lt; ConstructiveReals.CR_of_Q_morph; ConstructiveReals.CR_of_Q_morph_Proper; ConstructiveReals.CR_of_Q_morph_T; ConstructiveReals.CR_of_Q_mult; ConstructiveReals.CR_of_Q_opp; ConstructiveReals.CR_of_Q_plus; ConstructiveReals.CR_of_Q_pos; ConstructiveLUB.CR_sig_lub; ConstructiveReals.CRabs; ConstructiveReals.CRabs_def; ConstructiveAbs.CRabs_le; ConstructiveAbs.CRabs_lt; ConstructiveAbs.CRabs_morph; ConstructiveAbs.CRabs_morph_prop_Proper; ConstructiveAbs.CRabs_opp; ConstructiveAbs.CRabs_right; ConstructiveAbs.CRabs_triang; ConstructiveReals.CRapart; ConstructiveReals.CRcarrier; ConstructiveRcomplete.CRealAbsLUB; ConstructiveCauchyRealsMult.CRealArchimedean; ConstructiveRcomplete.CRealComplete; ConstructiveRcomplete.CRealConstructive; ConstructiveCauchyReals.CRealEq; ConstructiveCauchyReals.CRealEq_diff; ConstructiveCauchyReals.CRealEq_refl; ConstructiveCauchyReals.CRealEq_rel; ConstructiveCauchyReals.CRealEq_relT; ConstructiveCauchyReals.CRealEq_rel_Reflexive; ConstructiveCauchyReals.CRealEq_rel_Symmetric; ConstructiveCauchyReals.CRealEq_rel_Transitive; ConstructiveCauchyReals.CRealEq_sym; ConstructiveCauchyReals.CRealEq_trans; ConstructiveCauchyReals.CRealGe; ConstructiveCauchyReals.CRealGt; ConstructiveCauchyReals.CRealLe; ConstructiveCauchyAbs.CRealLe_0R_to_single_dist; ConstructiveCauchyReals.CRealLe_morph_Proper; ConstructiveCauchyReals.CRealLe_not_lt; ConstructiveCauchyReals.CRealLe_refl; ConstructiveCauchyRealsMult.CRealLowerBound; ConstructiveCauchyRealsMult.CRealLowerBoundSpec; ConstructiveCauchyRealsMult.CRealLowerBound_lt_scale; ConstructiveCauchyReals.CRealLt; ConstructiveRcomplete.CRealLtDisjunctEpsilon; ConstructiveCauchyReals.CRealLtEpsilon; ConstructiveCauchyReals.CRealLtForget; ConstructiveRcomplete.CRealLtIsLinear; ConstructiveCauchyReals.CRealLtProp; ConstructiveCauchyReals.CRealLtProp_morph_Proper; ConstructiveCauchyReals.CRealLt_0_1; ConstructiveCauchyAbs.CRealLt_RQ_from_single_dist; ConstructiveCauchyReals.CRealLt_above; ConstructiveCauchyReals.CRealLt_aboveSig; ConstructiveCauchyReals.CRealLt_aboveSig'; ConstructiveCauchyReals.CRealLt_above_same; ConstructiveCauchyReals.CRealLt_asym; ConstructiveCauchyReals.CRealLt_dec; ConstructiveCauchyReals.CRealLt_irrefl; ConstructiveCauchyReals.CRealLt_lpo_dec; ConstructiveCauchyReals.CRealLt_morph; ConstructiveCauchyRealsMult.CRealQ_dense; ConstructiveCauchyRealsMult.CRealRing_ring_lemma1; ConstructiveCauchyRealsMult.CRealRing_ring_lemma2; ConstructiveCauchyAbs.CReal_abs; ConstructiveCauchyAbs.CReal_abs_appart_0; ConstructiveCauchyAbs.CReal_abs_bound; ConstructiveCauchyAbs.CReal_abs_cauchy; ConstructiveCauchyAbs.CReal_abs_def2; ConstructiveCauchyAbs.CReal_abs_le; ConstructiveCauchyAbs.CReal_abs_left; ConstructiveCauchyAbs.CReal_abs_minus_sym; ConstructiveCauchyAbs.CReal_abs_morph; ConstructiveCauchyAbs.CReal_abs_morph_Proper; ConstructiveCauchyAbs.CReal_abs_opp; ConstructiveCauchyAbs.CReal_abs_pos; ConstructiveCauchyAbs.CReal_abs_right; ConstructiveCauchyAbs.CReal_abs_scale; ConstructiveCauchyAbs.CReal_abs_seq; ConstructiveCauchyAbs.CReal_abs_triang; ConstructiveCauchyReals.CReal_appart; ConstructiveCauchyReals.CReal_appart_morph; ConstructiveRcomplete.CReal_cv_self'; ConstructiveRcomplete.CReal_from_cauchy; ConstructiveRcomplete.CReal_from_cauchy_bound; ConstructiveRcomplete.CReal_from_cauchy_cauchy; ConstructiveRcomplete.CReal_from_cauchy_cm; ConstructiveRcomplete.CReal_from_cauchy_cm_mono; ConstructiveRcomplete.CReal_from_cauchy_scale; ConstructiveRcomplete.CReal_from_cauchy_seq; ConstructiveRcomplete.CReal_from_cauchy_seq_bound; ConstructiveCauchyRealsMult.CReal_inv; ConstructiveCauchyRealsMult.CReal_inv_0_lt_compat; ConstructiveCauchyRealsMult.CReal_inv_l; ConstructiveCauchyRealsMult.CReal_inv_l_pos; ConstructiveCauchyRealsMult.CReal_inv_pos; ConstructiveCauchyRealsMult.CReal_inv_pos_bound; ConstructiveCauchyRealsMult.CReal_inv_pos_cauchy; ConstructiveCauchyRealsMult.CReal_inv_pos_cm; ConstructiveCauchyRealsMult.CReal_inv_pos_scale; ConstructiveCauchyRealsMult.CReal_inv_pos_seq; ConstructiveCauchyRealsMult.CReal_isRing; ConstructiveCauchyRealsMult.CReal_isRingExt; ConstructiveCauchyAbs.CReal_le_abs; ConstructiveCauchyReals.CReal_le_lt_trans; ConstructiveCauchyReals.CReal_le_trans; ConstructiveCauchyReals.CReal_lt_le_trans; ConstructiveCauchyReals.CReal_lt_trans; ConstructiveCauchyReals.CReal_minus; ConstructiveCauchyRealsMult.CReal_minus_morph_Proper; ConstructiveCauchyRealsMult.CReal_mult; ConstructiveCauchyRealsMult.CReal_mult_1_l; ConstructiveCauchyRealsMult.CReal_mult_assoc; ConstructiveCauchyRealsMult.CReal_mult_bound; ConstructiveCauchyRealsMult.CReal_mult_cauchy; ConstructiveCauchyRealsMult.CReal_mult_comm; ConstructiveCauchyRealsMult.CReal_mult_eq_reg_l; ConstructiveCauchyRealsMult.CReal_mult_lt_0_compat; ConstructiveCauchyRealsMult.CReal_mult_lt_0_compat_correct; ConstructiveCauchyRealsMult.CReal_mult_lt_compat_l; ConstructiveCauchyRealsMult.CReal_mult_morph_Proper; ConstructiveCauchyRealsMult.CReal_mult_plus_distr_l; ConstructiveCauchyRealsMult.CReal_mult_plus_distr_r; ConstructiveCauchyRealsMult.CReal_mult_proper_0_l; ConstructiveCauchyRealsMult.CReal_mult_proper_l; ConstructiveCauchyRealsMult.CReal_mult_scale; ConstructiveCauchyRealsMult.CReal_mult_seq; ConstructiveCauchyRealsMult.CReal_neg_lt_pos; ConstructiveCauchyRealsMult.CReal_neg_lt_pos_subproof; ConstructiveCauchyReals.CReal_opp; ConstructiveCauchyReals.CReal_opp_0; ConstructiveCauchyReals.CReal_opp_bound; ConstructiveCauchyReals.CReal_opp_cauchy; ConstructiveCauchyReals.CReal_opp_ge_le_contravar; ConstructiveCauchyReals.CReal_opp_gt_lt_contravar; ConstructiveCauchyReals.CReal_opp_involutive; ConstructiveCauchyRealsMult.CReal_opp_morph_Proper; ConstructiveCauchyRealsMult.CReal_opp_morph_T; ConstructiveCauchyRealsMult.CReal_opp_mult_distr_l; ConstructiveCauchyRealsMult.CReal_opp_mult_distr_r; ConstructiveCauchyReals.CReal_opp_scale; ConstructiveCauchyReals.CReal_opp_seq; ConstructiveCauchyReals.CReal_plus; ConstructiveCauchyReals.CReal_plus_0_l; ConstructiveCauchyReals.CReal_plus_0_r; ConstructiveCauchyReals.CReal_plus_assoc; ConstructiveCauchyReals.CReal_plus_bound; ConstructiveCauchyReals.CReal_plus_cauchy; ConstructiveCauchyReals.CReal_plus_comm; ConstructiveCauchyReals.CReal_plus_eq_reg_l; ConstructiveCauchyReals.CReal_plus_le_compat; ConstructiveCauchyReals.CReal_plus_le_compat_l; ConstructiveCauchyReals.CReal_plus_le_lt_compat; ConstructiveCauchyReals.CReal_plus_le_reg_r; ConstructiveCauchyReals.CReal_plus_lt_compat_l; ConstructiveCauchyReals.CReal_plus_lt_compat_r; ConstructiveCauchyReals.CReal_plus_lt_reg_l; ConstructiveCauchyReals.CReal_plus_lt_reg_r; ConstructiveCauchyReals.CReal_plus_morph; ConstructiveCauchyReals.CReal_plus_morph_Proper; ConstructiveCauchyReals.CReal_plus_morph_T; ConstructiveCauchyReals.CReal_plus_opp_l; ConstructiveCauchyReals.CReal_plus_opp_r; ConstructiveCauchyReals.CReal_plus_proper_l; ConstructiveCauchyReals.CReal_plus_proper_r; ConstructiveCauchyReals.CReal_plus_scale; ConstructiveCauchyReals.CReal_plus_seq; ConstructiveCauchyRealsMult.CReal_red_scale; ConstructiveCauchyReals.CReal_red_seq; ConstructiveCauchyRealsMult.CReal_scale_sep0_limit; ConstructiveReals.CReq; ConstructiveReals.CReq_refl; ConstructiveReals.CReq_rel; ConstructiveReals.CReq_relT; ConstructiveReals.CReq_rel_Reflexive; ConstructiveReals.CReq_rel_Symmetric; ConstructiveReals.CReq_rel_Transitive; ConstructiveReals.CReq_sym; ConstructiveReals.CReq_trans; ConstructiveReals.CRinv; ConstructiveReals.CRinv_0_lt_compat; ConstructiveReals.CRinv_l; ConstructiveReals.CRinv_r; ConstructiveReals.CRisRing; ConstructiveReals.CRisRingExt; ConstructiveLUB.CRis_upper_bound; ConstructiveReals.CRle; ConstructiveAbs.CRle_abs; ConstructiveReals.CRle_lt_trans; ConstructiveReals.CRle_morph_Proper; ConstructiveReals.CRle_refl; ConstructiveReals.CRle_trans; ConstructiveReals.CRlt; ConstructiveReals.CRltEpsilon; ConstructiveReals.CRltForget; ConstructiveReals.CRltLinear; ConstructiveReals.CRltProp; ConstructiveReals.CRlt_asym; ConstructiveReals.CRlt_le_trans; ConstructiveLUB.CRlt_lpo_dec; ConstructiveReals.CRlt_minus; ConstructiveReals.CRlt_morph; ConstructiveReals.CRlt_proper; ConstructiveReals.CRlt_trans; ConstructiveReals.CRminus; ConstructiveReals.CRmult; ConstructiveReals.CRmult_0_r; ConstructiveReals.CRmult_1_l; ConstructiveReals.CRmult_1_r; ConstructiveReals.CRmult_assoc; ConstructiveReals.CRmult_comm; ConstructiveReals.CRmult_lt_0_compat; ConstructiveReals.CRmult_lt_compat_l; ConstructiveReals.CRmult_lt_compat_r; ConstructiveReals.CRmult_lt_reg_l; ConstructiveReals.CRmult_lt_reg_r; ConstructiveReals.CRmult_morph; ConstructiveReals.CRmult_morph_Proper; ConstructiveReals.CRmult_morph_T; ConstructiveReals.CRmult_plus_distr_l; ConstructiveReals.CRmult_plus_distr_r; ConstructiveReals.CRopp; ConstructiveReals.CRopp_0; ConstructiveReals.CRopp_ge_le_contravar; ConstructiveReals.CRopp_gt_lt_contravar; ConstructiveReals.CRopp_involutive; ConstructiveReals.CRopp_lt_cancel; ConstructiveReals.CRopp_morph_Proper; ConstructiveReals.CRopp_mult_distr_l; ConstructiveReals.CRopp_mult_distr_r; ConstructiveReals.CRopp_plus_distr; ConstructiveReals.CRplus; ConstructiveReals.CRplus_0_l; ConstructiveReals.CRplus_0_r; ConstructiveReals.CRplus_assoc; ConstructiveReals.CRplus_comm; ConstructiveReals.CRplus_eq_reg_l; ConstructiveReals.CRplus_le_compat; ConstructiveReals.CRplus_le_compat_l; ConstructiveReals.CRplus_le_compat_r; ConstructiveReals.CRplus_le_reg_l; ConstructiveReals.CRplus_le_reg_r; ConstructiveReals.CRplus_lt_compat_l; ConstructiveReals.CRplus_lt_compat_r; ConstructiveReals.CRplus_lt_reg_l; ConstructiveReals.CRplus_lt_reg_r; ConstructiveReals.CRplus_morph; ConstructiveReals.CRplus_morph_Proper; ConstructiveReals.CRplus_morph_T; ConstructiveReals.CRplus_opp_l; ConstructiveReals.CRplus_opp_r; ConstructiveReals.CRup_nat; ConstructiveReals.CRzero_double; PSeries_reg.CVU; CompOpp; CompOpp_iff; CompOpp_inj; CompOpp_involutive; CompSpec; CompSpec2Type; CompSpecT; CompareSpec2Type; ConstructiveLUB.DDcut_limit; ConstructiveLUB.DDcut_limit_fix; ConstructiveLUB.DDdec; ConstructiveLUB.DDhigh; ConstructiveLUB.DDhighProp; ConstructiveLUB.DDinterval; ConstructiveLUB.DDlow; ConstructiveLUB.DDlowProp; ConstructiveLUB.DDlow_below_up; ConstructiveLUB.DDproper; ConstructiveLUB.DDupcut; Rderiv.D_in; Rderiv.D_x; Rderiv.Dmult; Env.Env; Ring_theory.Eq_ext; Ring_theory.Eqsth; RelationClasses.Equivalence_PER; CRelationClasses.Equivalence_Reflexive; RelationClasses.Equivalence_Reflexive; CRelationClasses.Equivalence_Symmetric; RelationClasses.Equivalence_Symmetric; RelationClasses.Equivalence_Transitive; ZMicromega.F; Field_theory.F2AF; Field_theory.FEeval; Field_theory.FExpr_ind; Field_theory.F_1_neq_0; Field_theory.F_R; False_ind; False_rec; False_rect; Field_theory.Fapp; Field_theory.Fcons0; Field_theory.Fcons1; Field_theory.Fcons2; Field_theory.Fdiv_def; Field_theory.Field_correct; Field_theory.Field_rw_pow_correct; Field_theory.Field_simplify_eq_pow_correct; Field_theory.Finv_l; Field_theory.Fnorm; Field_theory.Fnorm_FEeval_PEeval; Field_theory.Fnorm_crossproduct; Tauto.GFormula_ind; ID; Ring_theory.IDmorph; Ring_theory.IDphi; Raxioms.INR; RIneq.INR_IPR; Rdefinitions.IPR; Rdefinitions.IPR_2; Rdefinitions.IZR; RIneq.IZR_le; RIneq.IZR_lt; RIneq.IZR_neq; Qreals.IZR_nz; List.In; ZifyInst.Inj_Z_Z; ZifyInst.Inj_pos_Z; RelationClasses.Irreflexive; Ring_polynom.MFactor; Ring_polynom.MPcond; MVT.MVT; RList.MaxRlist; RList.MaxRlist_P1; Ring_polynom.Mcphi_ok; RList.MinRlist; RList.MinRlist_P1; RList.MinRlist_P2; Ring_polynom.Mphi; Ring_polynom.Mphi_ok; RingMicromega.NFormula; Classical_Prop.NNPP; Field_theory.NPEadd; Field_theory.NPEadd_ok; Field_theory.NPEequiv; Field_theory.NPEequiv_eq; Field_theory.NPEeval_ext; Field_theory.NPEmul; Field_theory.NPEmul_ok; Field_theory.NPEopp; Field_theory.NPEopp_ok; Field_theory.NPEpow; Field_theory.NPEpow_ok; Field_theory.NPEsub; Field_theory.NPEsub_ok; InitialRing.Nopp; InitialRing.Nsub; Field_theory.NtoZ; InitialRing.Ntriv_div_th; ConstructiveEpsilon.O_witness; RingMicromega.OpAdd; RingMicromega.OpAdd_sound; RingMicromega.OpMult; RingMicromega.OpMult_sound; ConstructiveEpsilon.P'; ConstructiveEpsilon.P'_decidable; EnvRing.P0; Ring_polynom.P0; EnvRing.P1; Ring_polynom.P1; Field_theory.PCond; Field_theory.PCond_app; Field_theory.PCond_cons; RelationClasses.PER_Symmetric; RelationClasses.PER_Transitive; Morphisms.PER_morphism; Morphisms.PER_morphism_obligation_1; Field_theory.PE_1_l; Field_theory.PE_1_r; Field_theory.PEadd_ext; EnvRing.PEeval; Ring_polynom.PEeval; Field_theory.PEmul_ext; Field_theory.PEopp_ext; Field_theory.PEpow_0_r; Field_theory.PEpow_1_l; Field_theory.PEpow_1_r; Field_theory.PEpow_add_r; Field_theory.PEpow_ext; Field_theory.PEpow_mul_l; Field_theory.PEpow_mul_r; Field_theory.PEpow_nz; Field_theory.PEsimp; Field_theory.PEsimp_ok; Field_theory.PEsub_ext; Field_theory.PExpr_eq; Field_theory.PExpr_eq_semi_ok; Field_theory.PExpr_eq_spec; EnvRing.PExpr_ind; Ring_polynom.PExpr_ind; Field_theory.PFcons0_fcons_inv; Field_theory.PFcons1_fcons_inv; Field_theory.PFcons2_fcons_inv; Ring_polynom.PNSubst; Ring_polynom.PNSubst1; Ring_polynom.PNSubst1_ok; Ring_polynom.PNSubstL; Ring_polynom.PNSubstL_ok; Ring_polynom.PNSubst_ok; Ring_polynom.POneSubst; Ring_polynom.POneSubst_ok; Ring_polynom.PSubstL; Ring_polynom.PSubstL1; Ring_polynom.PSubstL1_ok; Ring_polynom.PSubstL_ok; Ring_polynom.PX_ext; EnvRing.Padd; Ring_polynom.Padd; EnvRing.PaddC; Ring_polynom.PaddC; EnvRing.PaddC_ok; Ring_polynom.PaddC_ok; EnvRing.PaddI; Ring_polynom.PaddI; EnvRing.PaddX; Ring_polynom.PaddX; EnvRing.PaddX_ok; Ring_polynom.PaddX_ok; EnvRing.Padd_ok; Ring_polynom.Padd_ok; Field_theory.Pcond_Fnorm; Field_theory.Pcond_simpl_complete; EnvRing.Peq; Ring_polynom.Peq; EnvRing.Peq_ok; Ring_polynom.Peq_ok; EnvRing.Peq_spec; Ring_polynom.Peq_spec; Ring_polynom.Pequiv; Ring_polynom.Pequiv_eq; EnvRing.Pjump_add; EnvRing.Pjump_pred_double; EnvRing.Pjump_xO_tail; EnvRing.Pmul; Ring_polynom.Pmul; EnvRing.PmulC; Ring_polynom.PmulC; EnvRing.PmulC_aux; Ring_polynom.PmulC_aux; EnvRing.PmulC_aux_ok; Ring_polynom.PmulC_aux_ok; EnvRing.PmulC_ok; Ring_polynom.PmulC_ok; EnvRing.PmulI; Ring_polynom.PmulI; EnvRing.PmulI_ok; Ring_polynom.PmulI_ok; EnvRing.Pmul_ok; Ring_polynom.Pmul_ok; RingMicromega.PolC; RingMicromega.PolEnv; EnvRing.Pol_ind; Ring_polynom.Pol_ind; EnvRing.Popp; Ring_polynom.Popp; EnvRing.Popp_ok; Ring_polynom.Popp_ok; ConstructiveRcomplete.Pos2Z_pos_is_pos; QExtra.Pos_log2floor_plus1; QExtra.Pos_log2floor_plus1_spec; PosExtra.Pos_pow_1_r; PosExtra.Pos_pow_le_mono_r; ConstructiveExtra.Pos_pred_double_inj; ConstructiveRcomplete.Pospow_lin_le_2pow; EnvRing.Pphi; Ring_polynom.Pphi; EnvRing.Pphi0; Ring_polynom.Pphi0; EnvRing.Pphi1; Ring_polynom.Pphi1; Ring_polynom.Pphi_avoid; Ring_polynom.Pphi_avoid_ok; Ring_polynom.Pphi_dev; Ring_polynom.Pphi_dev_ok; Ring_polynom.Pphi_ext; Ring_polynom.Pphi_pow; Ring_polynom.Pphi_pow_ok; BinPos.Pplus_one_succ_l; BinPos.Pplus_one_succ_r; EnvRing.Ppow_N; Ring_polynom.Ppow_N; EnvRing.Ppow_N_ok; Ring_polynom.Ppow_N_ok; EnvRing.Ppow_pos; Ring_polynom.Ppow_pos; EnvRing.Ppow_pos_ok; Ring_polynom.Ppow_pos_ok; RelationClasses.PreOrder_Reflexive; RelationClasses.PreOrder_Transitive; CMorphisms.Proper; Morphisms.Proper; CMorphisms.ProperProxy; Morphisms.ProperProxy; Qminmax.Q.Proper_instance_0; BinInt.Z.Proper_instance_0; RingMicromega.Psatz_ind; EnvRing.Psquare; EnvRing.Psquare_ok; EnvRing.Psub; Ring_polynom.Psub; EnvRing.PsubC; Ring_polynom.PsubC; EnvRing.PsubC_ok; RingMicromega.PsubC_ok; Ring_polynom.PsubC_ok; EnvRing.PsubI; Ring_polynom.PsubI; EnvRing.PsubX; Ring_polynom.PsubX; EnvRing.PsubX_ok; EnvRing.Psub_ok; Ring_polynom.Psub_ok; Ring_polynom.Psub_opp; Rdefinitions.Q2R; RMicromega.Q2R_0; RMicromega.Q2R_1; Qreals.Q2R_inv; RMicromega.Q2R_inv_ext; RMicromega.Q2R_m_Proper; Qreals.Q2R_minus; Qreals.Q2R_mult; Qreals.Q2R_opp; Qreals.Q2R_plus; RMicromega.Q2R_pow_N; RMicromega.Q2R_pow_pos; RMicromega.Q2RpowerRZ; ConstructiveCauchyReals.QBound; ConstructiveCauchyReals.QCauchySeq; QMicromega.QNpower; RMicromega.QReval_expr; RMicromega.QReval_formula; RMicromega.QReval_formula'; RMicromega.QReval_formula_compat; QMicromega.QSORaddon; RMicromega.QSORaddon; QMicromega.QTautoChecker; QMicromega.QTautoChecker_sound; QMicromega.QWeakChecker; QMicromega.QWeakChecker_sound; QMicromega.QWitness; QArith_base.Q_Setoid; QArith_base.Q_dec; RMicromega.Q_of_Rcst; RMicromega.Q_of_RcstR; Qabs.Qabs; ConstructiveRcomplete.Qabs_Qgt_condition; Qabs.Qabs_Qinv; Qabs.Qabs_Qle_condition; Qabs.Qabs_Qlt_condition; Qabs.Qabs_Qmult; ConstructiveRcomplete.Qabs_Rabs; Qabs.Qabs_case; Qabs.Qabs_case_subproof; Qabs.Qabs_case_subproof0; Qabs.Qabs_case_subproof1; Qabs.Qabs_gt; ConstructiveCauchyAbs.Qabs_involutive; Qabs.Qabs_neg; Qabs.Qabs_nonneg; Qabs.Qabs_opp; Qabs.Qabs_pos; Qabs.Qabs_triangle; Qabs.Qabs_triangle_reverse; Qabs.Qabs_wd; Qabs.Qabs_wd_Proper; QArith_base.Qarchimedean; QExtra.QarchimedeanExp2_Z; QExtra.QarchimedeanLowExp2_Z; QExtra.Qbound_lt_ZExp2; QExtra.Qbound_lt_ZExp2_spec; QExtra.Qbound_ltabs_ZExp2; QExtra.Qbound_ltabs_ZExp2_spec; QArith_base.Qcompare; QArith_base.Qcompare_comp; QArith_base.Qden; QArith_base.Qdiv; QArith_base.Qdiv_comp; QArith_base.Qdiv_mult_l; QArith_base.Qeq; QArith_base.Qeq_alt; QArith_base.Qeq_bool; QArith_base.Qeq_bool_eq; QArith_base.Qeq_bool_iff; QArith_base.Qeq_bool_neq; QArith_base.Qeq_dec; Qreals.Qeq_eqR; QArith_base.Qeq_eq_bool; RMicromega.Qeq_false; QArith_base.Qeq_refl; QArith_base.Qeq_sym; QArith_base.Qeq_trans; RMicromega.Qeq_true; QMicromega.Qeval_bop2; QMicromega.Qeval_expr; QMicromega.Qeval_expr'; QMicromega.Qeval_expr_compat; QMicromega.Qeval_formula; QMicromega.Qeval_formula'; QMicromega.Qeval_formula_compat; QMicromega.Qeval_nformula; RMicromega.Qeval_nformula; QMicromega.Qeval_nformula_dec; QMicromega.Qeval_op2; QMicromega.Qeval_op2_hold; QMicromega.Qeval_pop2; Qfield.Qfield_field_lemma1; Qfield.Qfield_field_lemma2; Qfield.Qfield_lemma5; Qfield.Qfield_ring_lemma1; Qfield.Qfield_ring_lemma2; Qround.Qfloor; Qround.Qfloor_le; QArith_base.Qinv; QArith_base.Qinv_comp; QArith_base.Qinv_involutive; QArith_base.Qinv_le_0_compat; QArith_base.Qinv_lt_0_compat; QArith_base.Qinv_lt_contravar; QArith_base.Qinv_mult_distr; QArith_base.Qinv_plus_distr; QArith_base.Qinv_pos; Qpower.Qinv_power; Qpower.Qinv_power_positive; QArith_base.Qle; Qabs.Qle_Qabs; Qreals.Qle_Rle; QArith_base.Qle_alt; QArith_base.Qle_antisym; QArith_base.Qle_bool; QArith_base.Qle_bool_iff; QArith_base.Qle_bool_imp_le; QArith_base.Qle_comp; QArith_base.Qle_lt_trans; QArith_base.Qle_minus_iff; QArith_base.Qle_not_lt; QArith_base.Qle_refl; QArith_base.Qle_shift_div_l; QArith_base.Qle_shift_div_r; QArith_base.Qle_trans; RMicromega.Qle_true; QExtra.Qlowbound_lt_ZExp2_spec; QExtra.Qlowbound_ltabs_ZExp2; QExtra.Qlowbound_ltabs_ZExp2_inv; QArith_base.Qlt; QArith_base.Qlt_alt; QMicromega.Qlt_bool; QMicromega.Qlt_bool_iff; QArith_base.Qlt_compat; Qround.Qlt_floor; QArith_base.Qlt_irrefl; QArith_base.Qlt_le_dec; QArith_base.Qlt_le_trans; QArith_base.Qlt_le_weak; QArith_base.Qlt_leneq; QArith_base.Qlt_minus_iff; QArith_base.Qlt_not_eq; QArith_base.Qlt_not_le; QArith_base.Qlt_shift_div_l; QArith_base.Qlt_shift_div_r; QArith_base.Qlt_shift_inv_l; QArith_base.Qlt_trans; ConstructiveRcomplete.Qlt_trans_swap_hyp; QArith_base.Qminus; QArith_base.Qminus_comp; QArith_base.Qmult; QArith_base.Qmult_0_l; QArith_base.Qmult_0_r; QArith_base.Qmult_1_l; QArith_base.Qmult_1_r; QArith_base.Qmult_assoc; QArith_base.Qmult_comm; QArith_base.Qmult_comp; QArith_base.Qmult_div_r; QArith_base.Qmult_frac_l; QArith_base.Qmult_integral; RMicromega.Qmult_integral; QArith_base.Qmult_integral_l; QArith_base.Qmult_inv_r; QArith_base.Qmult_le_0_compat; QArith_base.Qmult_le_1_compat; QArith_base.Qmult_le_compat_nonneg; QArith_base.Qmult_le_compat_r; QArith_base.Qmult_le_l; QArith_base.Qmult_le_lt_compat_pos; QArith_base.Qmult_le_r; QArith_base.Qmult_lt_0_le_reg_r; QArith_base.Qmult_lt_compat_nonneg; QArith_base.Qmult_lt_compat_r; QArith_base.Qmult_lt_l; QArith_base.Qmult_lt_r; QArith_base.Qmult_plus_distr_l; QMicromega.Qnegate; QMicromega.Qnormalise; QArith_base.Qnot_eq_sym; QArith_base.Qnot_le_lt; QArith_base.Qnot_lt_le; QArith_base.Qnum; QArith_base.Qopp; QArith_base.Qopp_comp; QArith_base.Qopp_le_compat; QArith_base.Qopp_lt_compat; ConstructiveCauchyAbs.Qopp_mult_mone; Qfield.Qopp_opp; QArith_base.Qplus; QArith_base.Qplus_0_l; QArith_base.Qplus_0_r; QArith_base.Qplus_assoc; QArith_base.Qplus_comm; QArith_base.Qplus_comp; QArith_base.Qplus_le_compat; QArith_base.Qplus_le_l; QArith_base.Qplus_le_r; QArith_base.Qplus_lt_l; QArith_base.Qplus_lt_le_compat; QArith_base.Qplus_lt_r; QArith_base.Qplus_opp_r; QArith_base.Qpower; RMicromega.Qpower0; Qpower.Qpower_0_le; Qpower.Qpower_0_lt; Qpower.Qpower_0_r; Qpower.Qpower_1_le; Qpower.Qpower_1_le_pos; ConstructiveRcomplete.Qpower_2powneg_le_inv; QArith_base.Qpower_comp; Qpower.Qpower_decomp_pos; Qpower.Qpower_decomp_positive; Qpower.Qpower_le_compat_l; Qpower.Qpower_lt_compat_l_inv; Qpower.Qpower_minus; Qpower.Qpower_minus_pos; Qpower.Qpower_minus_positive; Qpower.Qpower_not_0; Qpower.Qpower_not_0_positive; Qpower.Qpower_opp; Qpower.Qpower_plus; Qpower.Qpower_plus_positive; Qpower.Qpower_pos_positive; QArith_base.Qpower_positive; Qpower.Qpower_positive_0; QArith_base.Qpower_positive_comp; RMicromega.Qpower_positive_eq_zero; RMicromega.Qpower_positive_zero; Qfield.Qpower_theory; Qreduction.Qred; Qreduction.Qred_correct; Qfield.Qsft; QMicromega.Qsor; Qfield.Qsrt; Rdefinitions.RbaseSymbolsImpl.R; Rdefinitions.RbaseSymbolsImpl.R0; Rdefinitions.RbaseSymbolsImpl.R0_def; Rdefinitions.RbaseSymbolsImpl.R1; Rdefinitions.RbaseSymbolsImpl.R1_def; Raxioms.R1_neq_R0; RIneq.RField_field_lemma1; RealField.RField_field_lemma1; RIneq.RField_field_lemma3; RIneq.RField_lemma5; RealField.RField_lemma5; RIneq.RField_ring_lemma1; RealField.RField_ring_lemma1; Rbasic_fun.RRle_abs; RMicromega.RTautoChecker; RMicromega.RTautoChecker_sound; RealField.RTheory; RMicromega.RWeakChecker; RMicromega.RWeakChecker_sound; RMicromega.RWitness; Rfunctions.R_dist; Rfunctions.R_dist_plus; Rfunctions.R_dist_pos; Rfunctions.R_dist_refl; Rfunctions.R_dist_sym; Rfunctions.R_dist_tri; Rlimit.R_met; RMicromega.R_of_Rcst; RealField.R_power_theory; RIneq.R_rm; InitialRing.R_set1; InitialRing.R_set1_Reflexive; InitialRing.R_set1_Transitive; Field_theory.R_setoid3; InitialRing.R_setoid3; Field_theory.R_setoid3_Reflexive; InitialRing.R_setoid3_Reflexive; Field_theory.R_setoid3_Symmetric; InitialRing.R_setoid3_Symmetric; Field_theory.R_setoid3_Transitive; InitialRing.R_setoid3_Transitive; InitialRing.R_setoid4; InitialRing.R_setoid4_Reflexive; InitialRing.R_setoid4_Transitive; Rbasic_fun.Rabs; Rbasic_fun.Rabs_R0; Rbasic_fun.Rabs_Ropp; Rbasic_fun.Rabs_def1; Rbasic_fun.Rabs_def2; Rbasic_fun.Rabs_inv; Rbasic_fun.Rabs_minus_sym; Rbasic_fun.Rabs_mult; Rbasic_fun.Rabs_no_R0; Rbasic_fun.Rabs_pos; Rbasic_fun.Rabs_pos_eq; Rbasic_fun.Rabs_pos_lt; Rbasic_fun.Rabs_right; Rbasic_fun.Rabs_triang; Rbasic_fun.Rabs_triang_inv; Rdefinitions.RbaseSymbolsImpl.Rabst; Ring_theory.Radd_0_l; Ring_theory.Radd_assoc; Ring_theory.Radd_comm; Ring_theory.Radd_ext; Rbasic_fun.Rcase_abs; ConstructiveRcomplete.Rcauchy_complete; RMicromega.Rcst_ind; RealField.Rdef_pow_add; RIneq.Rdichotomy; Ring_theory.Rdistr_l; Rdefinitions.Rdiv; CRelationClasses.Reflexive; RelationClasses.Reflexive; Morphisms.ReflexiveProxy; CMorphisms.Reflexive_partial_app_morphism; Morphisms.Reflexive_partial_app_morphism; RIneq.Req_EM_T; Rdefinitions.Req_appart_dec; RIneq.Req_dec; OrderedRing.Req_dne; OrderedRing.Req_em; RIneq.Req_ge_sym; RIneq.Req_le; RIneq.Req_le_sym; RMicromega.Reval_bop2; RMicromega.Reval_expr; RMicromega.Reval_formula; RMicromega.Reval_formula'; RMicromega.Reval_formula_compat; RMicromega.Reval_nformula_dec; RMicromega.Reval_op2; RMicromega.Reval_op2_hold; RMicromega.Reval_pop2; RMicromega.Reval_pop2_eval_op2; RealField.Rfield; Rdefinitions.Rge; RIneq.Rge_antisym; RIneq.Rge_gt_dec; RIneq.Rge_gt_trans; RIneq.Rge_le; RIneq.Rge_minus; RIneq.Rge_not_lt; RIneq.Rge_refl; RIneq.Rge_trans; RealField.Rgen_phiPOS; RealField.Rgen_phiPOS_not_0; Rdefinitions.Rgt; RIneq.Rgt_dec; RIneq.Rgt_ge; RIneq.Rgt_ge_trans; RIneq.Rgt_minus; RIneq.Rgt_not_eq; RIneq.Rgt_not_ge; RIneq.Rgt_not_le; RIneq.Rgt_trans; Rdefinitions.RinvImpl.Rinv; RIneq.Rinv_0; RIneq.Rinv_0_lt_compat; RIneq.Rinv_1; RMicromega.Rinv_1; Rdefinitions.RinvImpl.Rinv_def; Raxioms.Rinv_l; RIneq.Rinv_l_sym; RIneq.Rinv_lt_0_compat; RIneq.Rinv_mult; RIneq.Rinv_neq_0_compat; RIneq.Rinv_opp; RIneq.Rinv_r; RIneq.Rinv_r_simpl_m; RIneq.Rinv_r_sym; Rdefinitions.Rle; Rbasic_fun.Rle_abs; RIneq.Rle_antisym; OrderedRing.Rle_antisymm; RIneq.Rle_dec; RIneq.Rle_ge; OrderedRing.Rle_gt_cases; RIneq.Rle_le_eq; OrderedRing.Rle_le_minus; RIneq.Rle_lt_0_plus_1; RIneq.Rle_lt_dec; OrderedRing.Rle_lt_eq; OrderedRing.Rle_lt_trans; RIneq.Rle_lt_trans; OrderedRing.Rle_ngt; RIneq.Rle_not_lt; OrderedRing.Rle_refl; RIneq.Rle_refl; OrderedRing.Rle_trans; RIneq.Rle_trans; Rdefinitions.RbaseSymbolsImpl.Rlt; RIneq.Rlt_0_1; RealField.Rlt_0_2; RIneq.Rlt_0_sqr; RIneq.Rlt_Rminus; Raxioms.Rlt_asym; RIneq.Rlt_dec; Rdefinitions.RbaseSymbolsImpl.Rlt_def; RIneq.Rlt_dichotomy_converse; RIneq.Rlt_eq_compat; RIneq.Rlt_gt; RIneq.Rlt_irrefl; RIneq.Rlt_le; RIneq.Rlt_le_dec; OrderedRing.Rlt_le_neq; OrderedRing.Rlt_le_trans; RIneq.Rlt_le_trans; OrderedRing.Rlt_lt_minus; RealField.Rlt_n_Sn; OrderedRing.Rlt_neq; OrderedRing.Rlt_nge; RIneq.Rlt_not_eq; RIneq.Rlt_not_ge; RIneq.Rlt_not_le; OrderedRing.Rlt_trans; Raxioms.Rlt_trans; OrderedRing.Rlt_trichotomy; Rbasic_fun.Rmax; Rbasic_fun.Rmax_Rlt; Rbasic_fun.Rmax_case_strong; Rbasic_fun.Rmax_l; Rbasic_fun.Rmax_left; Rbasic_fun.Rmax_lub_lt; Rbasic_fun.Rmax_r; Rbasic_fun.Rmax_right; Rbasic_fun.Rmax_stable_in_negreal; Rbasic_fun.Rmin; Rbasic_fun.Rmin_Rgt; Rbasic_fun.Rmin_Rgt_l; Rbasic_fun.Rmin_Rgt_r; Rbasic_fun.Rmin_case_strong; Rbasic_fun.Rmin_glb_lt; Rbasic_fun.Rmin_l; Rbasic_fun.Rmin_r; Rbasic_fun.Rmin_stable_in_posreal; Rdefinitions.Rminus; RIneq.Rminus_0_r; RIneq.Rminus_diag_eq; RIneq.Rminus_diag_uniq; RIneq.Rminus_diag_uniq_sym; OrderedRing.Rminus_eq_0; RIneq.Rminus_eq_0; RIneq.Rminus_eq_contra; RIneq.Rminus_ge; RIneq.Rminus_le; RIneq.Rminus_lt; RIneq.Rminus_not_eq_right; Ring_theory.Rmul_0_l; Ring_theory.Rmul_1_l; Ring_theory.Rmul_assoc; Ring_theory.Rmul_comm; Ring_theory.Rmul_ext; Rdefinitions.RbaseSymbolsImpl.Rmult; RIneq.Rmult_0_l; RIneq.Rmult_0_r; Raxioms.Rmult_1_l; RIneq.Rmult_1_r; Raxioms.Rmult_assoc; Raxioms.Rmult_comm; Rdefinitions.RbaseSymbolsImpl.Rmult_def; RIneq.Rmult_eq_0_compat; RIneq.Rmult_eq_reg_l; RIneq.Rmult_ge_0_gt_0_lt_compat; RIneq.Rmult_gt_0_compat; RIneq.Rmult_integral; RIneq.Rmult_integral_contrapositive; RIneq.Rmult_integral_contrapositive_currified; RIneq.Rmult_le_compat_l; RIneq.Rmult_le_compat_neg_l; RIneq.Rmult_le_compat_r; RIneq.Rmult_le_ge_compat_neg_l; RIneq.Rmult_le_pos; RIneq.Rmult_lt_0_compat; Raxioms.Rmult_lt_compat_l; RIneq.Rmult_lt_compat_r; RIneq.Rmult_lt_gt_compat_neg_l; RIneq.Rmult_lt_reg_l; RIneq.Rmult_ne; RIneq.Rmult_opp_opp; Raxioms.Rmult_plus_distr_l; RMicromega.Rnegate; OrderedRing.Rneq_symm; RMicromega.Rnormalise; RIneq.Rnot_gt_le; RIneq.Rnot_le_gt; RIneq.Rnot_le_lt; RIneq.Rnot_lt_le; Rdefinitions.RbaseSymbolsImpl.Ropp; RIneq.Ropp_0; RIneq.Ropp_0_ge_le_contravar; RIneq.Ropp_0_gt_lt_contravar; RIneq.Ropp_0_le_ge_contravar; Rbasic_fun.Ropp_Rmin; RIneq.Ropp_Ropp_IZR; Ring_theory.Ropp_add; Ring_theory.Ropp_def; Rdefinitions.RbaseSymbolsImpl.Ropp_def; RIneq.Ropp_eq_0_compat; RIneq.Ropp_eq_compat; Ring_theory.Ropp_ext; RIneq.Ropp_ge_cancel; RIneq.Ropp_ge_le_contravar; RIneq.Ropp_gt_lt_0_contravar; RIneq.Ropp_gt_lt_contravar; RIneq.Ropp_involutive; RIneq.Ropp_le_cancel; RIneq.Ropp_le_contravar; RIneq.Ropp_le_ge_contravar; RIneq.Ropp_lt_cancel; RIneq.Ropp_lt_gt_0_contravar; RIneq.Ropp_lt_gt_contravar; OrderedRing.Ropp_lt_mono; RIneq.Ropp_minus_distr; Ring_theory.Ropp_mul_l; RIneq.Ropp_mult_distr_l; RIneq.Ropp_mult_distr_l_reverse; RIneq.Ropp_mult_distr_r; RIneq.Ropp_neq_0_compat; Ring_theory.Ropp_opp; RIneq.Ropp_plus_distr; OrderedRing.Ropp_pos_neg; RingMicromega.Rops_wd; Rdefinitions.RbaseSymbolsImpl.Rplus; OrderedRing.Rplus_0_l; Raxioms.Rplus_0_l; OrderedRing.Rplus_0_r; RIneq.Rplus_0_r; Raxioms.Rplus_assoc; OrderedRing.Rplus_cancel_l; OrderedRing.Rplus_comm; Raxioms.Rplus_comm; Rdefinitions.RbaseSymbolsImpl.Rplus_def; RIneq.Rplus_eq_reg_l; RIneq.Rplus_ge_compat_l; RIneq.Rplus_ge_compat_r; RIneq.Rplus_le_compat_l; RIneq.Rplus_le_compat_r; RIneq.Rplus_le_lt_0_compat; OrderedRing.Rplus_le_lt_mono; OrderedRing.Rplus_le_mono; OrderedRing.Rplus_le_mono_l; OrderedRing.Rplus_le_mono_r; RIneq.Rplus_le_reg_l; RIneq.Rplus_lt_0_compat; RIneq.Rplus_lt_compat; Raxioms.Rplus_lt_compat_l; RIneq.Rplus_lt_compat_r; RIneq.Rplus_lt_le_0_compat; RIneq.Rplus_lt_le_compat; OrderedRing.Rplus_lt_le_mono; OrderedRing.Rplus_lt_mono; OrderedRing.Rplus_lt_mono_l; OrderedRing.Rplus_lt_mono_r; RIneq.Rplus_lt_reg_l; RIneq.Rplus_lt_reg_r; RIneq.Rplus_ne; OrderedRing.Rplus_nonneg_nonneg; OrderedRing.Rplus_nonneg_pos; RIneq.Rplus_opp_l; Raxioms.Rplus_opp_r; RIneq.Rplus_opp_r_uniq; OrderedRing.Rplus_pos_nonneg; OrderedRing.Rplus_pos_pos; Rdefinitions.RbaseSymbolsImpl.Rquot1; Rdefinitions.RbaseSymbolsImpl.Rquot2; Rdefinitions.RbaseSymbolsImpl.Rrepr; Raxioms.Rrepr_0; Raxioms.Rrepr_1; Raxioms.Rrepr_IPR; Raxioms.Rrepr_IPR2; Raxioms.Rrepr_IZR; Raxioms.Rrepr_appart; Rdefinitions.Rrepr_appart_0; Raxioms.Rrepr_le; Raxioms.Rrepr_minus; Raxioms.Rrepr_mult; Raxioms.Rrepr_opp; Raxioms.Rrepr_plus; Field_theory.Rring_ring_lemma1; RMicromega.Rsor; RIneq.Rsqr; RMicromega.Rsrt; Ring_theory.Rsub_def; Ring_theory.Rth_ARth; OrderedRing.Rtimes_0_l; OrderedRing.Rtimes_0_r; OrderedRing.Rtimes_comm; OrderedRing.Rtimes_neg_neg; OrderedRing.Rtimes_neq_0; OrderedRing.Rtimes_nonneg_nonneg; OrderedRing.Rtimes_pos_neg; OrderedRing.Rtimes_pos_pos; OrderedRing.Rtimes_square_nonneg; RIneq.Rtotal_order; ConstructiveRcomplete.Rup_pos; RingMicromega.SORRing_ring_lemma1; OrderedRing.SOR_ring_lemma1; RingMicromega.SORcleb_morph; RingMicromega.SORcneqb_morph; OrderedRing.SORle_antisymm; OrderedRing.SORle_refl; OrderedRing.SORle_trans; OrderedRing.SORle_wd; OrderedRing.SORlt_le_neq; OrderedRing.SORlt_trichotomy; OrderedRing.SORlt_wd; OrderedRing.SORopp_wd; OrderedRing.SORplus_le_mono_l; OrderedRing.SORplus_wd; RingMicromega.SORpower; RingMicromega.SORrm; OrderedRing.SORrt; OrderedRing.SORsetoid; OrderedRing.SORtimes_pos_pos; OrderedRing.SORtimes_wd; Ring_theory.SRadd_0_l; Ring_theory.SRadd_assoc; Ring_theory.SRadd_comm; Ring_theory.SRadd_ext; Ring_theory.SRdistr_l; Ring_theory.SReqe_Reqe; Ring_theory.SRmul_0_l; Ring_theory.SRmul_1_l; Ring_theory.SRmul_assoc; Ring_theory.SRmul_comm; Ring_theory.SRmul_ext; Ring_theory.SRopp; Ring_theory.SRopp_add; Ring_theory.SRopp_ext; Ring_theory.SRopp_mul_l; Ring_theory.SRsub; Ring_theory.SRsub_def; Ring_theory.SRth_ARth; RIneq.S_INR; Setoid.Seq_refl; Setoid.Seq_sym; Setoid.Seq_trans; Setoid.Setoid_Theory; Ring_theory.Smorph0; Ring_theory.Smorph1; Ring_theory.Smorph_add; Ring_theory.Smorph_eq; Ring_theory.Smorph_morph; Ring_theory.Smorph_mul; Ring_theory.Smorph_opp; Ring_theory.Smorph_sub; RelationClasses.StrictOrder_Irreflexive; RelationClasses.StrictOrder_Transitive; CRelationClasses.Symmetric; RelationClasses.Symmetric; Tauto.TFormula; CRelationClasses.Transitive; RelationClasses.Transitive; ConstructiveRcomplete.Un_cauchy_mod; Rseries.Un_cv; ConstructiveLimits.Un_cv_nat_real; Init.Unconvertible; ConstructiveCauchyRealsMult.Weaken_Qle_QpowerAddExp; ConstructiveCauchyRealsMult.Weaken_Qle_QpowerFac; ConstructiveCauchyRealsMult.Weaken_Qle_QpowerRemSubExp; ZMicromega.ZChecker; ZMicromega.ZChecker_sound; ZMicromega.ZNpower; ZMicromega.ZSORaddon; ZMicromega.ZTautoChecker; ZMicromega.ZTautoChecker_sound; ZMicromega.ZWitness; Znat.Z_N_nat; RIneq.Z_R_minus; ZArith_dec.Z_dec'; Zdiv.Z_div_mod; Zdiv.Z_div_mod_eq_full; ConstructiveExtra.Z_inj_nat; ConstructiveExtra.Z_inj_nat_id; ConstructiveExtra.Z_inj_nat_rev; ZArith_dec.Z_le_lt_eq_dec; ZArith_dec.Z_lt_dec; ZArith_dec.Z_lt_ge_dec; ZArith_dec.Z_lt_le_dec; Znumtheory.Z_lt_neq; Zdiv.Z_mod_lt; Zdiv.Z_mod_mult; Field_theory.Z_pos_sub_gt; BinNums.Z_rec; BinNums.Z_rect; Zcompare.Zcompare_mult_compat; ZArith_dec.Zcompare_rec; ZArith_dec.Zcompare_rect; ZMicromega.Zdeduce; ZMicromega.Zdiv_pol; ZMicromega.Zdiv_pol_correct; Znumtheory.Zdivide_Zdiv_eq; ZMicromega.Zdivide_ceiling; Znumtheory.Zdivide_mod; Znumtheory.Zdivide_opp_r; ZMicromega.Zdivide_pol_Zdivide; ZMicromega.Zdivide_pol_ind; ZMicromega.Zdivide_pol_one; ZMicromega.Zdivide_pol_sub; Zbool.Zeq_bool; RIneq.Zeq_bool_IZR; RealField.Zeq_bool_complete; Zbool.Zeq_bool_eq; Zbool.Zeq_bool_neq; Zbool.Zeq_is_eq_bool; ZMicromega.Zeval_bop2; ZMicromega.Zeval_expr; ZMicromega.Zeval_expr_compat; ZMicromega.Zeval_formula; ZMicromega.Zeval_formula'; ZMicromega.Zeval_formula_compat; ZMicromega.Zeval_formula_compat'; ZMicromega.Zeval_nformula_dec; ZMicromega.Zeval_op2; ZMicromega.Zeval_op2_hold; ZMicromega.Zeval_pop2; ZMicromega.ZgcdM; Znumtheory.Zgcd_is_gcd; ZMicromega.Zgcd_minus; ZMicromega.Zgcd_pol; ZMicromega.Zgcd_pol_correct_lt; ZMicromega.Zgcd_pol_div; Zbool.Zgt_cases; Zbool.Zgt_is_gt_bool; Zorder.Zgt_le_succ; Zorder.Zgt_pos_0; Zorder.Zgt_trans; Znumtheory.Zis_gcd_gcd; Znumtheory.Zis_gcd_ind; Znumtheory.Zis_gcd_uniqueness_apart_sign; Zorder.Zle_0_minus_le; Zbool.Zle_bool_imp_le; Zbool.Zle_is_le_bool; Zorder.Zle_lt_succ; Zorder.Zle_minus_le_0; Zorder.Zlt_0_minus_lt; Ztac.Zlt_le_add_1; Zorder.Zlt_le_succ; auxiliary.Zlt_left_lt; Zorder.Zlt_not_le; Zorder.Zlt_succ_le; Zmax.Zmax_spec; BinInt.Zminus_eq; Zdiv.Zmod_0_r; Zorder.Zmult_le_compat_r; Zorder.Zmult_lt_compat2; Zorder.Zmult_lt_reg_r; Zorder.Znot_le_gt; Zorder.Zplus_lt_compat_l; BinInt.Zpos_eq; Zpow_def.Zpower_theory; ZArithRing.Zr_ring_lemma1; ZArithRing.Zr_ring_lemma2; ZMicromega.Zsor; InitialRing.Zsth; InitialRing.Zth; Field_theory.ZtoN; InitialRing.Ztriv_div_th; ZMicromega.Zunsat; ZMicromega.Zunsat_sound; BinInt.Z.abs; BinInt.Z.abs_eq; BinInt.Z.abs_eq_cases; BinInt.Z.abs_eq_or_opp; BinInt.Z.abs_mul; BinInt.Z.abs_neq; BinInt.Z.abs_nonneg; BinInt.Z.abs_opp; BinInt.Z.abs_or_opp_abs; BinInt.Z.abs_triangle; BinInt.Z.abs_wd; Field_theory.absurd_PCond; Field_theory.absurd_PCond_bottom; Nat.add; BinNat.N.add; BinPos.Pos.add; BinInt.Z.add; BinNat.N.add_0_l; PeanoNat.Nat.add_0_l; BinInt.Z.add_0_l; BinNat.N.add_0_r; PeanoNat.Nat.add_0_r; BinInt.Z.Private_BootStrap.add_0_r; BinInt.Z.add_0_r; PeanoNat.Nat.add_1_l; BinPos.Pos.add_1_l; BinInt.Z.add_1_l; BinPos.Pos.add_1_r; BinInt.Z.add_1_r; BinNat.N.add_assoc; PeanoNat.Nat.add_assoc; BinPos.Pos.add_assoc; BinInt.Z.Private_BootStrap.add_assoc; BinInt.Z.add_assoc; BinInt.Z.Private_BootStrap.add_assoc_pos; BinNat.N.add_cancel_l; PeanoNat.Nat.add_cancel_l; BinPos.Pos.add_cancel_l; BinInt.Z.add_cancel_l; BinNat.N.add_cancel_r; PeanoNat.Nat.add_cancel_r; BinInt.Z.add_cancel_r; BinPos.Pos.add_carry; BinPos.Pos.add_carry_add; BinPos.Pos.add_carry_spec; BinNat.N.add_comm; PeanoNat.Nat.add_comm; BinPos.Pos.add_comm; BinInt.Z.Private_BootStrap.add_comm; BinInt.Z.add_comm; BinPos.Pos.add_compare_mono_l; BinPos.Pos.add_compare_mono_r; BinPos.Pos.add_diag; Field_theory.add_inj_r; Ztac.add_le; BinInt.Z.add_le_lt_mono; PeanoNat.Nat.add_le_mono; BinInt.Z.add_le_mono; PeanoNat.Nat.add_le_mono_l; BinPos.Pos.add_le_mono_l; BinInt.Z.add_le_mono_l; PeanoNat.Nat.add_le_mono_r; BinPos.Pos.add_le_mono_r; BinInt.Z.add_le_mono_r; BinPos.Pos.add_lt_mono; BinInt.Z.add_lt_mono; BinPos.Pos.add_lt_mono_l; BinInt.Z.add_lt_mono_l; BinPos.Pos.add_lt_mono_r; BinInt.Z.add_lt_mono_r; BinPos.Pos.add_max_distr_l; BinPos.Pos.add_max_distr_r; BinInt.Z.add_move_0_l; BinInt.Z.add_move_0_r; BinInt.Z.add_move_l; BinInt.Z.add_move_r; Ring_polynom.add_mult_dev; Ring_polynom.add_mult_dev_ok; BinInt.Z.add_neg_neg; BinPos.Pos.add_no_neutral; BinInt.Z.add_nonneg_nonneg; BinInt.Z.add_nonpos_nonpos; BinInt.Z.add_opp_diag_l; BinInt.Z.Private_BootStrap.add_opp_diag_r; BinInt.Z.add_opp_diag_r; BinInt.Z.add_opp_l; BinInt.Z.add_opp_r; BinInt.Pos2Z.add_pos_neg; Ring_polynom.add_pow_list; Ring_polynom.add_pow_list_ok; BinNat.N.add_pred_l; PeanoNat.Nat.add_pred_l; BinInt.Z.add_pred_l; BinNat.N.add_pred_r; PeanoNat.Nat.add_pred_r; BinInt.Z.add_pred_r; BinPos.Pos.add_reg_l; BinPos.Pos.add_reg_r; BinInt.Z.add_simpl_r; BinNat.N.add_sub; PeanoNat.Nat.add_sub; BinPos.Pos.add_sub; BinNat.N.add_sub_assoc; PeanoNat.Nat.add_sub_assoc; BinPos.Pos.add_sub_assoc; BinInt.Z.add_sub_assoc; BinNat.N.add_succ_l; PeanoNat.Nat.add_succ_l; BinPos.Pos.add_succ_l; BinInt.Z.add_succ_l; BinNat.N.add_succ_r; PeanoNat.Nat.add_succ_r; BinPos.Pos.add_succ_r; BinInt.Z.add_succ_r; Tauto.add_term; Tauto.add_term_correct; BinNat.N.add_wd; PeanoNat.Nat.add_wd; BinInt.Z.add_wd; PeanoNat.Nat.add_wd_obligation_1; BinPos.Pos.add_xI_pred_double; BinPos.Pos.add_xO; Rlimit.adhDa; Rtopology.adherence; Rtopology.adherence_P1; Rtopology.adherence_P2; Rtopology.adherence_P3; ZMicromega.agree_env; ZMicromega.agree_env_eval_nformula; ZMicromega.agree_env_eval_nformulae; ZMicromega.agree_env_jump; ZMicromega.agree_env_subset; ZMicromega.agree_env_tail; all; Morphisms_Prop.all_iff_morphism; Morphisms_Prop.all_iff_morphism_obligation_1; and_assoc; Tauto.and_cnf; Tauto.and_cnf_opt; Tauto.and_cnf_opt_cnf_ff_r; Tauto.and_cnf_opt_cnf_tt; and_comm; and_iff_compat_l; Morphisms_Prop.and_iff_morphism; Morphisms_Prop.and_iff_morphism_obligation_1; and_ind; ZifyClasses.and_morph; and_rec; and_rect; andb; Bool.andb_false_iff; andb_prop; Bool.andb_true_iff; app; Raxioms.archimed; CRelationClasses.arrow; CRelationClasses.arrow_Transitive; CRelationClasses.arrow_Transitive_obligation_1; ZMicromega.bdepth; BinNat.N.bi_induction; PeanoNat.Nat.bi_induction; BinInt.Z.bi_induction; ConstructiveCauchyReals.bound; Raxioms.bound; ZMicromega.bound_var; Rtopology.bounded; BinNat.N.case_analysis; PeanoNat.Nat.case_analysis; ConstructiveCauchyReals.cauchy; ZMicromega.ceiling; BinNat.N.central_induction; PeanoNat.Nat.central_induction; BinInt.Z.central_induction; EnvRing.ceqb_spec; Field_theory.ceqb_spec; Ring_polynom.ceqb_spec; Field_theory.ceqb_spec'; RingMicromega.check_inconsistent; RingMicromega.check_inconsistent_sound; RingMicromega.check_normalised_formulas; RingMicromega.checker_nf_sound; Classical_Prop.classic; Tauto.clause; RingMicromega.cleb_sound; Rtopology.closed_set; Rtopology.closed_set_P1; RingMicromega.cltb; RingMicromega.cltb_sound; RingMicromega.cneqb; RingMicromega.cneqb_sound; Tauto.cnf; Tauto.cnf_checker; Tauto.cnf_checker_sound; Tauto.cnf_ff; RingMicromega.cnf_negate; RingMicromega.cnf_negate_correct; RingMicromega.cnf_normalise; RingMicromega.cnf_normalise_correct; RingMicromega.cnf_of_list; ZMicromega.cnf_of_list; RingMicromega.cnf_of_list_correct; ZMicromega.cnf_of_list_correct; Tauto.cnf_tt; Rtopology.compact; Rtopology.compact_EMP; Rtopology.compact_P1; Rtopology.compact_P2; Rtopology.compact_P3; Rtopology.compact_eqDom; PeanoNat.Nat.compare; BinNat.N.compare; BinPos.Pos.compare; BinInt.Z.compare; BinNat.N.compare_antisym; PeanoNat.Nat.compare_antisym; BinPos.Pos.compare_antisym; BinInt.Z.compare_antisym; BinPos.Pos.compare_cont; BinPos.Pos.compare_cont_antisym; BinPos.Pos.compare_cont_spec; BinNat.N.compare_eq_iff; PeanoNat.Nat.compare_eq_iff; BinPos.Pos.compare_eq_iff; BinInt.Z.compare_eq_iff; PeanoNat.Nat.compare_ge_iff; PeanoNat.Nat.compare_gt_iff; BinInt.Z.compare_gt_iff; BinNat.N.compare_le_iff; PeanoNat.Nat.compare_le_iff; BinPos.Pos.compare_le_iff; BinInt.Z.compare_le_iff; BinNat.N.compare_lt_iff; PeanoNat.Nat.compare_lt_iff; BinPos.Pos.compare_lt_iff; BinInt.Z.compare_lt_iff; BinNat.N.compare_nge_iff; BinInt.Z.compare_nge_iff; BinInt.Z.compare_ngt_iff; BinNat.N.compare_nle_iff; BinInt.Z.compare_nle_iff; BinNat.N.compare_refl; PeanoNat.Nat.compare_refl; BinPos.Pos.compare_refl; BinInt.Z.compare_refl; BinNat.N.compare_spec; PeanoNat.Nat.compare_spec; BinPos.Pos.compare_spec; Qminmax.Q.OT.compare_spec; BinInt.Z.compare_spec; BinInt.Z.compare_sub; BinPos.Pos.compare_sub_mask; PeanoNat.Nat.compare_succ; BinPos.Pos.compare_succ_l; BinPos.Pos.compare_succ_r; BinPos.Pos.compare_succ_succ; BinPos.Pos.compare_xI_xI; BinPos.Pos.compare_xI_xO; BinPos.Pos.compare_xO_xI; BinPos.Pos.compare_xO_xO; RelationClasses.complement; Rtopology.complementary; Raxioms.completeness; Rtopology.cond_fam; RIneq.cond_neg; RIneq.cond_pos; Field_theory.condition; ConstructiveEpsilon.constructive_indefinite_ground_description; ConstructiveExtra.constructive_indefinite_ground_description_Z; ConstructiveEpsilon.constructive_indefinite_ground_description_nat; Rderiv.cont_deriv; Rderiv.continue_in; Ranalysis1.continuity; Rtopology.continuity_P1; Rtopology.continuity_P2; Rtopology.continuity_ab_maj; Rtopology.continuity_ab_min; Rtopology.continuity_compact; Ranalysis1.continuity_pt; Ranalysis1.continuity_pt_minus; Ranalysis1.continuity_pt_mult; Ranalysis1.continuity_pt_opp; Rtopology.covering; Rtopology.covering_finite; Rtopology.covering_open_set; CRelationClasses.crelation; Field_theory.cross_product_eq; ZMicromega.cutting_plane_sound; Decidable.decidable; Field_theory.default_isIn; Field_theory.default_isIn_ok; SetoidTactics.default_relation; Field_theory.denum; Ranalysis1.deriv_constant2; Ranalysis1.deriv_maximum; Ranalysis1.deriv_minimum; Ranalysis1.derivable; Ranalysis1.derivable_const; Ranalysis1.derivable_continuous; Ranalysis1.derivable_continuous_pt; Ranalysis1.derivable_derive; Ranalysis1.derivable_id; Ranalysis1.derivable_pt; Ranalysis1.derivable_pt_abs; Ranalysis1.derivable_pt_const; Ranalysis1.derivable_pt_id; Ranalysis1.derivable_pt_lim; Ranalysis1.derivable_pt_lim_D_in; Ranalysis1.derivable_pt_lim_const; Ranalysis1.derivable_pt_lim_id; Ranalysis1.derivable_pt_lim_minus; Ranalysis1.derivable_pt_lim_mult; Ranalysis1.derivable_pt_lim_opp; Ranalysis1.derivable_pt_lim_opp_fwd; Ranalysis1.derivable_pt_minus; Ranalysis1.derivable_pt_mult; Ranalysis1.derivable_pt_opp; Ranalysis1.derive_pt; Ranalysis1.derive_pt_D_in; Ranalysis1.derive_pt_const; Ranalysis1.derive_pt_eq; Ranalysis1.derive_pt_eq_0; Ranalysis1.derive_pt_eq_1; Ranalysis1.derive_pt_id; Ranalysis1.derive_pt_minus; Ranalysis1.derive_pt_mult; Ranalysis1.derive_pt_opp; Bool.diff_false_true; Rtopology.disc; Rtopology.disc_P1; Field_theory.display_pow_linear; Rlimit.dist; BinInt.Z.div; BinNat.N.div_eucl; BinInt.Z.div_eucl; BinInt.Z.div_eucl_eq; BinNat.N.div_eucl_spec; Ring_theory.div_eucl_th; BinInt.Z.div_mod; BinInt.Z.Private_NZDiv.div_mod_unique; BinInt.Z.div_mod_unique; BinInt.Z.div_mul; BinInt.Z.div_unique; BinInt.Z.div_unique_exact; BinInt.Z.div_wd; BinPos.Pos.divide; BinInt.Z.divide; BinInt.Z.divide_Zpos; BinInt.Z.divide_Zpos_Zneg_l; BinInt.Z.divide_Zpos_Zneg_r; BinInt.Z.divide_abs_l; BinInt.Z.divide_abs_r; BinPos.Pos.divide_add_cancel_l; BinInt.Z.divide_antisym; BinInt.Z.divide_antisym_abs; BinInt.Z.divide_antisym_nonneg; BinPos.Pos.divide_mul_l; BinPos.Pos.divide_mul_r; BinInt.Z.divide_opp_l; BinInt.Z.divide_opp_r; BinInt.Z.divide_refl; BinInt.Z.divide_trans; BinInt.Z.divide_wd; BinPos.Pos.divide_xO_xI; BinPos.Pos.divide_xO_xO; Rtopology.domain_finite; RIneq.double; BinNat.N.double; BinInt.Z.double; BinNat.N.double_add; BinPos.Pos.double_mask; BinNat.N.double_mul; BinPos.Pos.double_pred_mask; RIneq.double_var; Tauto.eAND; Tauto.eAnd_morph_Proper; Tauto.eFF; Tauto.eIFF; Tauto.eIFF_morph_Proper; Tauto.eIMPL; Tauto.eIMPL_morph_Proper; Tauto.eKind; Tauto.eNOT; Tauto.eNOT_morph_Proper; Tauto.eOR; Tauto.eOR_morph_Proper; Tauto.eTT; Tauto.e_rtyp; Tauto.eiff; Tauto.eiff_eq; Tauto.eiff_refl; Tauto.eiff_sym; Tauto.eiff_trans; Ztac.elim_concl_le; EnvRing.env_morph; Rlimit.eps2; Rlimit.eps2_Rgt_R0; BinNat.N.eq; BinInt.Z.eq; RingMicromega.eq0_cnf; Qreals.eqR_Qeq; Rtopology.eq_Dom; RIneq.eq_IZR; RIneq.eq_IZR_R0; RelationClasses.eq_Reflexive; RelationClasses.eq_Symmetric; RelationClasses.eq_Transitive; eq_add_S; ZMicromega.eq_cnf; BinPos.Pos.eq_dec; BinInt.Z.eq_dec; BinInt.Z.eq_decidable; BinNat.N.Private_OrderTac.IsTotal.eq_equiv; PeanoNat.Nat.Private_OrderTac.IsTotal.eq_equiv; BinInt.Z.Private_OrderTac.IsTotal.eq_equiv; BinNat.N.eq_equiv; PeanoNat.Nat.eq_equiv; BinPos.Pos.eq_equiv; Qminmax.Q.OT.eq_equiv; BinInt.Z.eq_equiv; RelationClasses.eq_equivalence; Ztac.eq_incl; eq_ind; eq_ind_r; BinPos.Pos.Private_Tac.eq_le; Qminmax.Q.Private_Tac.eq_le; BinInt.Z.Private_Tac.eq_le; BinInt.Z.Private_OrderTac.Tac.eq_le; ZMicromega.eq_le_iff; BinNat.N.eq_le_incl; PeanoNat.Nat.eq_le_incl; BinInt.Z.eq_le_incl; PeanoNat.Nat.Private_Tac.eq_lt; BinPos.Pos.Private_Tac.eq_lt; Qminmax.Q.Private_Tac.eq_lt; BinInt.Z.Private_Tac.eq_lt; BinInt.Z.Private_OrderTac.Tac.eq_lt; BinInt.Z.eq_mul_0; BinInt.Z.eq_mul_1_nonneg; BinInt.Z.eq_mul_1_nonneg'; BinPos.Pos.Private_Tac.eq_neq; BinInt.Z.Private_OrderTac.Tac.eq_neq; BinInt.Z.eq_opp_l; ZifyInst.eq_pos_inj; Morphisms.eq_proper_proxy; eq_rec; eq_rec_r; eq_rect; BinPos.Pos.Private_Tac.eq_refl; BinInt.Z.Private_OrderTac.Tac.eq_refl; BinInt.Z.eq_refl; eq_sym; PeanoNat.Nat.Private_Tac.eq_sym; BinPos.Pos.Private_Tac.eq_sym; Qminmax.Q.Private_Tac.eq_sym; BinInt.Z.Private_Tac.eq_sym; BinInt.Z.Private_OrderTac.Tac.eq_sym; BinInt.Z.eq_sym_iff; eq_trans; BinPos.Pos.Private_Tac.eq_trans; BinInt.Z.Private_OrderTac.Tac.eq_trans; Bool.eqb; BinNat.N.eqb; BinPos.Pos.eqb; BinInt.Z.eqb; BinNat.N.eqb_eq; BinPos.Pos.eqb_eq; BinInt.Z.eqb_eq; BinPos.Pos.eqb_neq; BinPos.Pos.eqb_refl; BinNat.N.eqb_spec; BinPos.Pos.eqb_spec; Bool.eqb_true_iff; SetoidTactics.equivalence_default; RelationClasses.equivalence_rewrite_relation; RingMicromega.eval_Psatz; ZMicromega.eval_Psatz; RingMicromega.eval_Psatz_Sound; ZMicromega.eval_Psatz_sound; Tauto.eval_bf; Tauto.eval_bf_map; Tauto.eval_clause; Tauto.eval_cnf; Tauto.eval_cnf_and_opt; Tauto.eval_cnf_app; Tauto.eval_cnf_cons_iff; Tauto.eval_cnf_ff; Tauto.eval_cnf_tt; ZMicromega.eval_expr; Tauto.eval_f; Tauto.eval_f_morph; RingMicromega.eval_formula; RingMicromega.eval_formulaSC; RingMicromega.eval_nformula; ZMicromega.eval_nformula; ZMicromega.eval_nformula_bound_var; RingMicromega.eval_nformula_dec; ZMicromega.eval_nformula_mk_eq_pos; ZMicromega.eval_nformula_split; RingMicromega.eval_op1; RingMicromega.eval_op2; Tauto.eval_opt_clause; RingMicromega.eval_pexpr; RingMicromega.eval_pexprSC; RingMicromega.eval_pol; ZMicromega.eval_pol; ZMicromega.eval_pol_Pc; RingMicromega.eval_pol_add; ZMicromega.eval_pol_add; RingMicromega.eval_pol_norm; ZMicromega.eval_pol_norm; RingMicromega.eval_pol_opp; RingMicromega.eval_pol_sub; ZMicromega.eval_pol_sub; RingMicromega.eval_sexpr; RingMicromega.eval_sformula; Tauto.eval_tt; Morphisms_Prop.ex_iff_morphism; Morphisms_Prop.ex_iff_morphism_obligation_1; ex_ind; Rtopology.f; f_equal; RIneq.f_equal_R; f_equal_nat; Rtopology.family_finite; Rtopology.family_open_set; Field_theory.fcons_ok; Ranalysis1.fct_cte; Field_theory.field_is_integral_domain; VarMap.find; Basics.flip; CRelationClasses.flip; CMorphisms.flip1; CMorphisms.flip2; RelationClasses.flip_Reflexive; List.fold_left; List.fold_right; fst; BinPos.Pos.gcd; BinInt.Z.gcd; BinInt.Z.gcd_divide_l; BinInt.Z.gcd_divide_r; BinPos.Pos.gcd_greatest; BinInt.Z.gcd_greatest; BinInt.Z.gcd_nonneg; BinPos.Pos.gcdn; BinPos.Pos.gcdn_greatest; ge; BinPos.Pos.ge; BinInt.Z.ge; BinInt.Z.ge_le; BinPos.Pos.ge_le_iff; BinInt.Z.ge_le_iff; BinInt.Z.geb; BinInt.Z.geb_le; BinInt.Z.geb_leb; ZMicromega.genCuttingPlane; ZMicromega.genCuttingPlaneNone; InitialRing.gen_Zeqb_ok; InitialRing.gen_phiN; InitialRing.gen_phiN1; InitialRing.gen_phiN_add; InitialRing.gen_phiN_morph; InitialRing.gen_phiN_mult; InitialRing.gen_phiN_sub; InitialRing.gen_phiPOS; InitialRing.gen_phiPOS1; Field_theory.gen_phiPOS_discr_sgn; Field_theory.gen_phiPOS_inj; InitialRing.gen_phiZ; InitialRing.gen_phiZ1; InitialRing.gen_phiZ1_pos_sub; InitialRing.gen_phiZ_add; Field_theory.gen_phiZ_complete; InitialRing.gen_phiZ_ext; Field_theory.gen_phiZ_inj; InitialRing.gen_phiZ_morph; InitialRing.gen_phiZ_mul; EnvRing.get_PEopp; Ring_polynom.get_PEopp; InitialRing.get_signZ; InitialRing.get_signZ_th; Ring_theory.get_sign_None; Ring_theory.get_sign_None_th; BinPos.Pos.ggcd; BinInt.Z.ggcd; BinPos.Pos.ggcd_correct_divisors; BinInt.Z.ggcd_correct_divisors; BinPos.Pos.ggcd_gcd; BinInt.Z.ggcd_gcd; BinPos.Pos.ggcdn; BinPos.Pos.ggcdn_correct_divisors; BinPos.Pos.ggcdn_gcdn; ConstructiveLUB.glb_dec_Q; gt; BinPos.Pos.gt; BinInt.Z.gt; Arith_prebase.gt_Sn_O_stt; Arith_prebase.gt_le_S_stt; BinPos.Pos.gt_lt; BinInt.Z.gt_lt; BinPos.Pos.gt_lt_iff; BinInt.Z.gt_lt_iff; BinInt.Z.gtb; BinInt.Z.gtb_ltb; BinInt.Z.gtb_spec; Env.hd; List.hd; Tauto.hold; Tauto.hold_eAND; Tauto.hold_eEQ; Tauto.hold_eFF; Tauto.hold_eIFF; Tauto.hold_eIFF_IMPL; Tauto.hold_eIMPL; Tauto.hold_eNOT; Tauto.hold_eOR; Tauto.hold_eTT; Tauto.hold_eiff; id; Ranalysis1.id; Nnat.N2Nat.id; Znat.N2Z.id; Nnat.Nat2N.id; Pnat.Nat2Pos.id; Znat.Nat2Z.id; Pnat.Pos2Nat.id; Znat.Z2N.id; Znat.Z2Nat.id; BinInt.Z2Pos.id; Ring_theory.id_phi_N; Pnat.SuccNat2Pos.id_succ; Tauto.if_cnf_tt; Field_theory.if_true; iff; CRelationClasses.iffT; CMorphisms.iffT_arrow_subrelation; CMorphisms.iffT_flip_arrow_subrelation; RelationClasses.iff_Reflexive; RelationClasses.iff_Symmetric; RelationClasses.iff_Transitive; RelationClasses.iff_equivalence; Morphisms.iff_flip_impl_subrelation; Morphisms_Prop.iff_iff_iff_impl_morphism; Morphisms_Prop.iff_iff_iff_impl_morphism_obligation_1; Morphisms.iff_impl_subrelation; iff_refl; Bool.iff_reflect; iff_stepl; iff_sym; iff_trans; Rtopology.image_dir; Rtopology.image_rec; Basics.impl; RelationClasses.impl_Reflexive; RelationClasses.impl_Reflexive_obligation_1; implb; Classical_Prop.imply_to_and; ZMicromega.in_bdepth; Rtopology.included; Rtopology.included_trans; Rtopology.ind; BinNat.N.induction; PeanoNat.Nat.induction; ZifyClasses.inj; Nnat.N2Nat.inj; Znat.Nat2Z.inj; Pnat.Pos2Nat.inj; BinInt.Pos2Z.inj; Pnat.Pos2Nat.inj_1; Nnat.N2Nat.inj_add; Znat.N2Z.inj_add; Nnat.Nat2N.inj_add; Znat.Nat2Z.inj_add; Pnat.Pos2Nat.inj_add; BinInt.Pos2Z.inj_add; Nnat.N2Nat.inj_compare; Znat.N2Z.inj_compare; Nnat.Nat2N.inj_compare; Znat.Nat2Z.inj_compare; Pnat.Pos2Nat.inj_compare; Znat.Z2Nat.inj_compare; Znat.Nat2Z.inj_ge; Znat.Nat2Z.inj_iff; BinInt.Pos2Z.inj_iff; Znat.Nat2Z.inj_le; Pnat.Pos2Nat.inj_le; Znat.Z2Nat.inj_le; Znat.Nat2Z.inj_lt; Pnat.Pos2Nat.inj_lt; Nnat.N2Nat.inj_max; Znat.N2Z.inj_max; Nnat.Nat2N.inj_max; Znat.Nat2Z.inj_max; Pnat.Pos2Nat.inj_mul; BinInt.Pos2Z.inj_mul; Znat.N2Z.inj_pos; BinInt.Pos2Z.inj_pow; BinInt.Pos2Z.inj_pow_pos; Pnat.Pos2Nat.inj_sub; Znat.Nat2Z.inj_succ; Pnat.Pos2Nat.inj_succ; BinInt.Pos2Z.inj_succ; Pnat.Pos2Nat.inj_xI; Pnat.Pos2Nat.inj_xO; ConstructiveCauchyReals.inject_Q; ConstructiveCauchyReals.inject_Q_cauchy; ConstructiveCauchyReals.inject_Q_compare; ConstructiveCauchyReals.inject_Q_le; ConstructiveCauchyReals.inject_Q_lt; ConstructiveCauchyReals.inject_Q_morph; ConstructiveCauchyReals.inject_Q_morph_Proper; ConstructiveCauchyRealsMult.inject_Q_mult; ConstructiveCauchyReals.inject_Q_plus; ConstructiveCauchyReals.inject_Z; QArith_base.inject_Z; ConstructiveCauchyReals.inject_Z_plus; Rtopology.interior; Rtopology.interior_P1; Rtopology.interior_P2; Ring_polynom.interp_PElist; Ring_polynom.interp_PElist_ok; PeanoNat.Nat.Private_Tac.interp_ord; BinPos.Pos.Private_Tac.interp_ord; Qminmax.Q.Private_Tac.interp_ord; BinInt.Z.Private_Tac.interp_ord; BinNat.N.Private_OrderTac.Tac.interp_ord; PeanoNat.Nat.Private_OrderTac.Tac.interp_ord; BinInt.Z.Private_OrderTac.Tac.interp_ord; Rtopology.intersection_domain; Pnat.SuccNat2Pos.inv; ConstructiveEpsilon.inv_before_witness; Field_theory.isIn; Field_theory.isIn_ok; ConstructiveReals.isLinearOrder; Tauto.is_bool; Tauto.is_bool_inv; Tauto.is_cnf_ff; Tauto.is_cnf_ff_cnf_ff; Tauto.is_cnf_ff_inv; Tauto.is_cnf_tt; Tauto.is_cnf_tt_cnf_ff; Tauto.is_cnf_tt_inv; ConstructiveLUB.is_lub; Raxioms.is_lub; Znat.Nat2Z.is_nonneg; BinInt.Pos2Z.is_nonneg; ZMicromega.is_pol_Z0; ZMicromega.is_pol_Z0_eval_pol; Pnat.Pos2Nat.is_pos; BinInt.Pos2Z.is_pos; Pnat.Pos2Nat.is_succ; is_true; ConstructiveLUB.is_upper_bound; Raxioms.is_upper_bound; ConstructiveLUB.is_upper_bound_closed; ConstructiveLUB.is_upper_bound_dec; ConstructiveLUB.is_upper_bound_epsilon; ConstructiveLUB.is_upper_bound_glb; ConstructiveLUB.is_upper_bound_not_epsilon; BinPos.Pos.iter; BinPos.Pos.iter_add; BinPos.Pos.iter_ind; BinPos.Pos.iter_invariant; BinPos.Pos.iter_op; BinPos.Pos.iter_op_succ; BinPos.Pos.iter_succ; BinPos.Pos.iter_swap; BinPos.Pos.iter_swap_gen; BinList.jump; Env.jump; BinList.jump_add; Env.jump_add; Ring_polynom.jump_add'; BinList.jump_pred_double; Env.jump_pred_double; Env.jump_simpl; BinList.jump_succ; BinList.jump_tl; BinInt.Z.lbase; BinNat.N.le; BinPos.Pos.le; BinInt.Z.le; ZMicromega.le_0_iff; BinNat.N.le_0_l; PeanoNat.Nat.le_0_l; le_0_n; BinInt.Z.le_0_sub; BinPos.Pos.le_1_l; le_S_n; BinInt.Z.le_add_le_sub_l; BinInt.Z.le_add_le_sub_r; BinPos.Pos.le_antisym; BinPos.Pos.Private_Tac.le_antisym; BinInt.Z.Private_OrderTac.Tac.le_antisym; BinInt.Z.le_antisymm; Qminmax.Q.Private_Tac.le_eq; BinInt.Z.Private_Tac.le_eq; BinInt.Z.Private_OrderTac.Tac.le_eq; BinInt.Z.le_exists_sub; BinInt.Z.le_ge; BinInt.Z.le_ge_cases; BinNat.N.le_gt_cases; PeanoNat.Nat.le_gt_cases; BinInt.Z.le_gt_cases; le_ind; BinInt.Z.le_ind; BinNat.N.le_le_succ_r; PeanoNat.Nat.le_le_succ_r; BinInt.Z.le_le_succ_r; BinInt.Z.le_lt_add_lt; Compare_dec.le_lt_dec; PeanoNat.Nat.Private_Tac.le_lt_trans; BinPos.Pos.Private_Tac.le_lt_trans; Qminmax.Q.Private_Tac.le_lt_trans; BinInt.Z.Private_Tac.le_lt_trans; BinNat.N.Private_OrderTac.Tac.le_lt_trans; PeanoNat.Nat.Private_OrderTac.Tac.le_lt_trans; BinInt.Z.Private_OrderTac.Tac.le_lt_trans; BinInt.Z.le_lt_trans; BinNat.N.Private_OrderTac.IsTotal.le_lteq; PeanoNat.Nat.Private_OrderTac.IsTotal.le_lteq; BinInt.Z.Private_OrderTac.IsTotal.le_lteq; BinNat.N.le_lteq; PeanoNat.Nat.le_lteq; BinPos.Pos.le_lteq; Qminmax.Q.OT.le_lteq; BinInt.Z.le_lteq; PeanoNat.Nat.le_max_l; BinPos.Pos.le_max_l; PeanoNat.Nat.le_max_r; BinPos.Pos.le_max_r; BinInt.Z.le_min_l; le_n_S; ZMicromega.le_neg; BinInt.Z.le_neq; BinPos.Pos.Private_Tac.le_neq_lt; BinInt.Z.Private_OrderTac.Tac.le_neq_lt; BinNat.N.le_ngt; PeanoNat.Nat.le_ngt; BinInt.Z.le_ngt; BinPos.Pos.le_nlt; le_pred; BinInt.Z.le_preorder; BinNat.N.le_refl; PeanoNat.Nat.le_refl; BinPos.Pos.le_refl; BinInt.Z.Private_OrderTac.Tac.le_refl; BinInt.Z.le_refl; BinInt.Z.le_sub_le_add_l; BinInt.Z.le_sub_le_add_r; BinNat.N.le_succ_l; PeanoNat.Nat.le_succ_l; BinPos.Pos.le_succ_l; BinInt.Z.le_succ_l; BinNat.N.le_succ_r; PeanoNat.Nat.le_succ_r; BinInt.Z.le_succ_r; PeanoNat.Nat.le_trans; BinPos.Pos.le_trans; BinInt.Z.le_trans; BinNat.N.le_wd; PeanoNat.Nat.le_wd; BinInt.Z.le_wd; BinNat.N.leb; BinPos.Pos.leb; BinInt.Z.leb; BinInt.Z.leb_gt; BinNat.N.leb_le; BinPos.Pos.leb_le; BinInt.Z.leb_le; BinInt.Z.leb_nle; BinNat.N.leb_spec; BinInt.Z.leb_spec; BinNat.N.leb_spec0; BinInt.Z.leb_spec0; BinInt.Z.left_induction; Rlimit.limit1_in; Rlimit.limit_Ropp; Rlimit.limit_in; Rlimit.limit_minus; Rlimit.limit_mul; Rlimit.limit_plus; ConstructiveCauchyReals.linear_order_T; ConstructiveEpsilon.linear_search_conform; ConstructiveEpsilon.linear_search_from_0_conform; list_ind; list_rec; list_rect; Ring_polynom.local_mkpow_ok; BinInt.Z.ls'_ls''; BinInt.Z.ls_ls'; lt; BinNat.N.lt; BinPos.Pos.lt; BinInt.Z.lt; BinInt.Z.lt_0_1; RIneq.lt_0_INR; RIneq.lt_0_IZR; BinInt.Z.lt_0_sub; PeanoNat.Nat.lt_0_succ; BinInt.Z.lt_1_2; BinInt.Z.lt_1_l; BinInt.Z.lt_1_mul_pos; BinPos.Pos.lt_1_succ; ConstructiveReals.lt_CR_of_Q; RIneq.lt_IZR; BinInt.Z.lt_add_lt_sub_r; BinInt.Z.lt_add_pos_l; BinInt.Z.lt_add_pos_r; BinPos.Pos.lt_add_r; BinNat.N.lt_asymm; PeanoNat.Nat.lt_asymm; BinInt.Z.lt_asymm; BinNat.N.Private_OrderTac.IsTotal.lt_compat; PeanoNat.Nat.Private_OrderTac.IsTotal.lt_compat; BinInt.Z.Private_OrderTac.IsTotal.lt_compat; BinNat.N.lt_compat; PeanoNat.Nat.lt_compat; BinPos.Pos.lt_compat; Qminmax.Q.OT.lt_compat; BinInt.Z.lt_compat; BinPos.Pos.Private_Tac.lt_eq; Qminmax.Q.Private_Tac.lt_eq; BinInt.Z.Private_Tac.lt_eq; BinNat.N.Private_OrderTac.Tac.lt_eq; PeanoNat.Nat.Private_OrderTac.Tac.lt_eq; BinInt.Z.Private_OrderTac.Tac.lt_eq; BinNat.N.lt_eq_cases; PeanoNat.Nat.lt_eq_cases; BinPos.Pos.lt_eq_cases; BinInt.Z.lt_eq_cases; BinNat.N.lt_exists_pred; PeanoNat.Nat.lt_exists_pred; BinInt.Z.lt_exists_pred; BinNat.N.lt_exists_pred_strong; PeanoNat.Nat.lt_exists_pred_strong; BinInt.Z.lt_exists_pred_strong; BinInt.Z.lt_ge_cases; BinPos.Pos.lt_gt; BinInt.Z.lt_gt; BinInt.Z.lt_gt_cases; BinPos.Pos.lt_iff_add; BinNat.N.lt_ind; PeanoNat.Nat.lt_ind; BinInt.Z.lt_ind; BinNat.N.lt_ind_rel; PeanoNat.Nat.lt_ind_rel; ConstructiveCauchyReals.lt_inject_Q; BinNat.N.lt_irrefl; PeanoNat.Nat.lt_irrefl; BinPos.Pos.lt_irrefl; PeanoNat.Nat.Private_Tac.lt_irrefl; BinPos.Pos.Private_Tac.lt_irrefl; Qminmax.Q.Private_Tac.lt_irrefl; BinInt.Z.Private_Tac.lt_irrefl; BinNat.N.Private_OrderTac.Tac.lt_irrefl; PeanoNat.Nat.Private_OrderTac.Tac.lt_irrefl; BinInt.Z.Private_OrderTac.Tac.lt_irrefl; BinInt.Z.lt_irrefl; ZMicromega.lt_le_iff; BinNat.N.lt_le_incl; PeanoNat.Nat.lt_le_incl; BinInt.Z.lt_le_incl; BinInt.Z.lt_le_pred; PeanoNat.Nat.lt_le_trans; BinPos.Pos.lt_le_trans; BinInt.Z.lt_le_trans; BinNat.N.lt_lt_succ_r; PeanoNat.Nat.lt_lt_succ_r; BinInt.Z.lt_lt_succ_r; BinInt.Z.lt_neq; BinInt.Z.lt_nge; BinPos.Pos.lt_nle; BinNat.N.Private_OrderTac.IsTotal.lt_strorder; PeanoNat.Nat.Private_OrderTac.IsTotal.lt_strorder; BinInt.Z.Private_OrderTac.IsTotal.lt_strorder; BinNat.N.lt_strorder; PeanoNat.Nat.lt_strorder; BinPos.Pos.lt_strorder; Qminmax.Q.OT.lt_strorder; BinInt.Z.lt_strorder; BinInt.Z.lt_sub_lt_add_r; BinNat.N.lt_succ_diag_r; PeanoNat.Nat.lt_succ_diag_r; BinPos.Pos.lt_succ_diag_r; BinInt.Z.lt_succ_diag_r; BinNat.N.lt_succ_l; PeanoNat.Nat.lt_succ_l; BinInt.Z.lt_succ_l; BinNat.N.lt_succ_r; PeanoNat.Nat.lt_succ_r; BinPos.Pos.lt_succ_r; BinInt.Z.lt_succ_r; BinNat.N.Private_OrderTac.IsTotal.lt_total; PeanoNat.Nat.Private_OrderTac.IsTotal.lt_total; BinInt.Z.Private_OrderTac.IsTotal.lt_total; BinNat.N.lt_total; PeanoNat.Nat.lt_total; Qminmax.Q.OT.lt_total; BinPos.Pos.lt_total; BinInt.Z.lt_total; BinNat.N.lt_trans; PeanoNat.Nat.lt_trans; BinPos.Pos.lt_trans; PeanoNat.Nat.Private_Tac.lt_trans; BinPos.Pos.Private_Tac.lt_trans; BinInt.Z.Private_Tac.lt_trans; BinNat.N.Private_OrderTac.Tac.lt_trans; PeanoNat.Nat.Private_OrderTac.Tac.lt_trans; BinInt.Z.Private_OrderTac.Tac.lt_trans; BinInt.Z.lt_trans; BinNat.N.lt_trichotomy; PeanoNat.Nat.lt_trichotomy; BinInt.Z.lt_trichotomy; BinNat.N.lt_wd; PeanoNat.Nat.lt_wd; BinInt.Z.lt_wd; PeanoNat.Nat.lt_wd_obligation_1; BinInt.Z.ltb; BinInt.Z.ltb_ge; BinInt.Z.ltb_lt; BinInt.Z.ltb_nlt; BinInt.Z.ltb_spec; BinInt.Z.ltb_spec0; Wf_nat.ltof; ZMicromega.ltof_bdepth_split_l; ZMicromega.ltof_bdepth_split_r; ZMicromega.makeCuttingPlane; ZMicromega.makeCuttingPlane_ns_sound; Refl.make_conj; Refl.make_conj_app; Refl.make_conj_cons; Refl.make_conj_impl; Refl.make_conj_in; Refl.make_conj_rapp; Refl.make_impl; Refl.make_impl_map; List.map; RingMicromega.map_Formula; RingMicromega.map_PExpr; Tauto.map_bformula; RingMicromega.map_option; RingMicromega.map_option2; BinPos.Pos.mask2cmp; PeanoNat.Nat.max; BinNat.N.max; BinPos.Pos.max; BinInt.Z.max; BinPos.Pos.max_1_l; BinInt.Z.max_case; BinPos.Pos.max_case_strong; BinPos.Pos.Private_Dec.max_case_strong; BinInt.Z.Private_Dec.max_case_strong; BinInt.Z.max_case_strong; BinInt.Z.max_comm; max_l; PeanoNat.Nat.max_l; BinPos.Pos.max_l; BinInt.Z.max_l; BinPos.Pos.max_le_compat_r; BinPos.Pos.max_lub_iff; BinPos.Pos.max_mono; BinPos.Pos.max_monotone; max_r; PeanoNat.Nat.max_r; BinPos.Pos.max_r; BinInt.Z.max_r; PeanoNat.Nat.max_spec; BinPos.Pos.max_spec; BinInt.Z.max_spec; ZMicromega.max_var; ZMicromega.max_var_acc; ZMicromega.max_var_nformulae; ZMicromega.max_var_nformulae_mono_aux; ZMicromega.max_var_nformulae_mono_aux'; RingMicromega.micomega_sor_setoid; RingMicromega.micomega_sor_setoid_Reflexive; RingMicromega.micomega_sor_setoid_Symmetric; RingMicromega.micomega_sor_setoid_Transitive; BinInt.Z.min; BinInt.Z.Private_Dec.min_case; BinInt.Z.Private_Dec.min_case_strong; BinInt.Z.Private_Dec.min_dec; BinInt.Z.min_dec; BinInt.Z.min_l; BinInt.Z.min_r; BinInt.Z.min_spec; RIneq.minus_INR; RIneq.minus_IZR; Ranalysis1.minus_fct; EnvRing.mkPX; Ring_polynom.mkPX; Ring_polynom.mkPX_ext; EnvRing.mkPX_ok; Ring_polynom.mkPX_ok; EnvRing.mkPinj; Ring_polynom.mkPinj; Ring_polynom.mkPinj_ext; EnvRing.mkPinj_ok; Ring_polynom.mkPinj_ok; EnvRing.mkPinj_pred; Ring_polynom.mkPinj_pred; Ring_polynom.mkVmon; Ring_polynom.mkVmon_ok; EnvRing.mkX; Ring_polynom.mkX; EnvRing.mkX_ok; Ring_polynom.mkX_ok; EnvRing.mkXi; Ring_polynom.mkXi; Ring_polynom.mkZmon; Ring_polynom.mkZmon_ok; EnvRing.mk_X; Ring_polynom.mk_X; Tauto.mk_and; ZMicromega.mk_eq_pos; Tauto.mk_iff; Tauto.mk_iff_is_bool; Tauto.mk_impl; Ring_polynom.mk_monpol_list; Tauto.mk_or; Ring_polynom.mkadd_mult; Ring_polynom.mkadd_mult_ok; ZifyClasses.mkapp; ZifyClasses.mkapp2; Ring_polynom.mkmult1; Ring_polynom.mkmult1_ok; Ring_polynom.mkmult_c; Ring_polynom.mkmult_c_ok; Ring_polynom.mkmult_c_pos; Ring_polynom.mkmult_c_pos_ok; Ring_polynom.mkmult_pow; Ring_polynom.mkmult_pow_ok; Ring_polynom.mkmult_rec; Ring_polynom.mkmult_rec_ok; Ring_polynom.mkmultm1; Ring_polynom.mkmultm1_ok; Ring_polynom.mkopp_pow; Ring_polynom.mkopp_pow_ok; Ring_polynom.mkpow; Ring_polynom.mkpow_ok; ZifyClasses.mkrel; BinInt.Z.mod_eq; BinInt.Z.mod_mul; BinInt.Z.mod_neg_bound; BinInt.Z.mod_pos_bound; BinInt.Z.modulo; Ring_polynom.mon_of_pol; Ring_polynom.mon_of_pol_ok; Ring_theory.morph0; Ring_theory.morph1; Ring_theory.morph_add; Ring_theory.morph_eq; Ring_theory.morph_mul; Ring_theory.morph_opp; Ring_theory.morph_sub; Nat.mul; BinNat.N.mul; BinPos.Pos.mul; BinInt.Z.mul; BinNat.N.mul_0_l; BinInt.Z.mul_0_l; BinNat.N.mul_0_r; BinInt.Z.Private_BootStrap.mul_0_r; BinInt.Z.mul_0_r; BinPos.Pos.mul_1_l; BinInt.Z.Private_BootStrap.mul_1_l; BinInt.Z.mul_1_l; BinPos.Pos.mul_1_r; BinInt.Z.mul_1_r; BinPos.Pos.mul_add_distr_l; BinInt.Z.mul_add_distr_l; BinInt.Z.Private_BootStrap.mul_add_distr_pos; BinPos.Pos.mul_add_distr_r; BinInt.Z.Private_BootStrap.mul_add_distr_r; BinInt.Z.mul_add_distr_r; BinPos.Pos.mul_assoc; BinInt.Z.mul_assoc; BinInt.Z.mul_cancel_l; BinInt.Z.mul_cancel_r; BinNat.N.mul_comm; BinPos.Pos.mul_comm; BinInt.Z.mul_comm; BinPos.Pos.mul_compare_mono_l; BinPos.Pos.mul_compare_mono_r; BinInt.Z.mul_div_le; BinInt.Z.mul_eq_0; Rlimit.mul_factor; Rlimit.mul_factor_gt; Rlimit.mul_factor_gt_f; Rlimit.mul_factor_wd; BinInt.Z.mul_id_l; BinPos.Pos.mul_le_mono_l; BinInt.Z.mul_le_mono_nonneg; BinInt.Z.mul_le_mono_nonneg_l; BinInt.Z.mul_le_mono_nonneg_r; BinInt.Z.mul_le_mono_nonpos_l; BinInt.Z.mul_le_mono_nonpos_r; BinInt.Z.mul_le_mono_pos_l; BinInt.Z.mul_le_mono_pos_r; BinPos.Pos.mul_lt_mono_l; BinInt.Z.mul_lt_mono_neg_l; BinInt.Z.mul_lt_mono_neg_r; BinInt.Z.mul_lt_mono_nonneg; BinInt.Z.mul_lt_mono_pos_l; BinInt.Z.mul_lt_mono_pos_r; BinPos.Pos.mul_lt_mono_r; BinInt.Z.mul_lt_pred; BinInt.Z.mul_neg_neg; BinInt.Z.mul_neg_pos; BinInt.Z.mul_nonneg_nonneg; BinInt.Z.mul_nonneg_nonpos; BinInt.Z.mul_opp_comm; BinInt.Z.mul_opp_l; BinInt.Z.mul_opp_opp; BinInt.Z.Private_BootStrap.mul_opp_r; BinInt.Z.mul_opp_r; BinInt.Z.mul_pos_cancel_l; BinInt.Z.mul_pos_neg; BinInt.Z.mul_pos_pos; BinInt.Z.mul_reg_r; BinInt.Z.mul_shuffle0; BinInt.Z.mul_shuffle1; BinPos.Pos.mul_sub_distr_l; BinPos.Pos.mul_sub_distr_r; BinNat.N.mul_succ_l; BinPos.Pos.mul_succ_l; BinInt.Z.mul_succ_l; BinNat.N.mul_succ_r; BinPos.Pos.mul_succ_r; BinInt.Z.mul_succ_r; BinNat.N.mul_wd; BinInt.Z.mul_wd; BinPos.Pos.mul_xI_r; BinPos.Pos.mul_xO_r; RIneq.mult_INR; RIneq.mult_IZR; Ring_polynom.mult_dev; Ring_polynom.mult_dev_ok; Ranalysis1.mult_fct; ZMicromega.narrow_interval_lower_bound; Znat.nat_N_Z; Compare_dec.nat_compare_ge; Compare_dec.nat_compare_le; Compare_dec.nat_compare_lt; nat_ind; nat_rec; nat_rect; RIneq.neg; BinInt.Pos2Z.neg_is_neg; ZMicromega.negate; ZMicromega.negate_correct; negb; Bool.negb_false_iff; Bool.negb_true_iff; Rtopology.neighbourhood; PeanoNat.Nat.neq_0_lt_0; BinPos.Pos.Private_Tac.neq_eq; BinInt.Z.Private_OrderTac.Tac.neq_eq; BinNat.N.neq_succ_0; PeanoNat.Nat.neq_succ_0; BinNat.N.neq_succ_diag_l; PeanoNat.Nat.neq_succ_diag_l; BinInt.Z.neq_succ_diag_l; BinInt.Z.Private_OrderTac.Tac.neq_sym; BinInt.Z.neq_sym; ZMicromega.nformula_of_cutting_plane; RingMicromega.nformula_plus_nformula; RingMicromega.nformula_plus_nformula_correct; RingMicromega.nformula_times_nformula; RingMicromega.nformula_times_nformula_correct; BinInt.Z.nle_gt; BinNat.N.nle_succ_diag_l; PeanoNat.Nat.nle_succ_diag_l; BinInt.Z.nle_succ_diag_l; PeanoNat.Nat.nlt_0_r; BinInt.Z.nlt_ge; BinNat.N.nlt_succ_diag_l; PeanoNat.Nat.nlt_succ_diag_l; BinInt.Z.nlt_succ_diag_l; Ranalysis1.no_cond; RingMicromega.norm; ZMicromega.normZ; EnvRing.norm_aux; Ring_polynom.norm_aux; EnvRing.norm_aux_PEadd; Ring_polynom.norm_aux_PEadd; EnvRing.norm_aux_PEopp; Ring_polynom.norm_aux_PEopp; EnvRing.norm_aux_spec; Ring_polynom.norm_aux_spec; Ring_polynom.norm_subst; Ring_polynom.norm_subst_ok; Ring_polynom.norm_subst_spec; RingMicromega.normalise; ZMicromega.normalise; ZMicromega.normalise_correct; RingMicromega.normalise_sound; not; RIneq.not_0_IZR; ZArith_dec.not_Zeq_inf; Classical_Pred_Type.not_all_ex_not; Classical_Pred_Type.not_all_not_ex; Classical_Prop.not_and_or; not_eq_sym; Classical_Pred_Type.not_ex_all_not; BinPos.Pos.Private_Tac.not_ge_lt; PeanoNat.Nat.Private_OrderTac.Tac.not_ge_lt; BinInt.Z.Private_OrderTac.Tac.not_ge_lt; PeanoNat.Nat.Private_Tac.not_gt_le; BinPos.Pos.Private_Tac.not_gt_le; Qminmax.Q.Private_Tac.not_gt_le; BinInt.Z.Private_Tac.not_gt_le; BinNat.N.Private_OrderTac.Tac.not_gt_le; PeanoNat.Nat.Private_OrderTac.Tac.not_gt_le; BinInt.Z.Private_OrderTac.Tac.not_gt_le; Morphisms_Prop.not_iff_morphism; Morphisms_Prop.not_iff_morphism_obligation_1; Classical_Prop.not_imply_elim; Classical_Prop.not_imply_elim2; BinPos.Pos.Private_Tac.not_neq_eq; BinInt.Z.Private_OrderTac.Tac.not_neq_eq; Bool.not_true_iff_false; BinList.nth; Env.nth; List.nth; List.nth_in_or_default; BinList.nth_jump; Env.nth_jump; BinList.nth_pred_double; Env.nth_pred_double; Env.nth_spec; Field_theory.num; BinInt.Z.of_N; BinNat.N.of_nat; BinPos.Pos.of_nat; BinInt.Z.of_nat; BinPos.Pos.of_nat_succ; BinPos.Pos.of_succ_nat; PeanoNat.Nat.one_succ; BinInt.Z.one_succ; Rtopology.open_set; Rtopology.open_set_P1; Rtopology.open_set_P4; Rtopology.open_set_P6; BinInt.Z.opp; BinInt.Z.opp_0; RIneq.opp_IZR; BinInt.Z.Private_BootStrap.opp_add_distr; BinInt.Z.opp_add_distr; Ranalysis1.opp_fct; BinInt.Z.Private_BootStrap.opp_inj; BinInt.Z.opp_inj; BinInt.Z.opp_inj_wd; ConstructiveCauchyReals.opp_inject_Q; ConstructiveCauchyReals.opp_inject_Z; BinInt.Z.opp_involutive; BinInt.Z.opp_le_mono; BinInt.Z.opp_lt_mono; BinInt.Z.opp_nonneg_nonpos; BinInt.Z.opp_nonpos_nonneg; BinInt.Pos2Z.opp_pos; BinInt.Z.opp_pred; BinInt.Z.opp_sub_distr; BinInt.Z.opp_succ; BinInt.Z.opp_wd; or_cancel_r; Tauto.or_clause; Tauto.or_clause_cnf; Tauto.or_clause_cnf_correct; Tauto.or_clause_correct; Tauto.or_cnf; Tauto.or_cnf_correct; Tauto.or_cnf_opt; Tauto.or_cnf_opt_cnf_ff; Tauto.or_cnf_opt_cnf_ff_r; Tauto.or_cnf_opt_correct; or_comm; or_iff_compat_r; Morphisms_Prop.or_iff_morphism; Morphisms_Prop.or_iff_morphism_obligation_1; or_ind; orb; Bool.orb_comm; Bool.orb_true_iff; BinInt.Z.order_induction; BinInt.Z.order_induction_0; RingMicromega.padd; ZMicromega.padd; BinPos.Pos.peano_ind; BinInt.Z.peano_ind; BinNat.N.peano_rect; BinPos.Pos.peano_rect; Morphisms.per_partial_app_morphism; Morphisms.per_partial_app_morphism_obligation_1; RingMicromega.pexpr_times_nformula; RingMicromega.pexpr_times_nformula_correct; Ring_theory.phi_ext1_Proper; RIneq.plus_INR; RIneq.plus_IZR; RIneq.plus_IZR_NEG_POS; plus_Sn_m; plus_n_O; plus_n_Sm; Rtopology.point_adherent; Morphisms.pointwise_relation; QMicromega.pop2_bop2; RMicromega.pop2_bop2; ZMicromega.pop2_bop2; RingMicromega.popp; ZMicromega.popp; RIneq.pos; RIneq.pos_INR; BinNat.N.pos_div_eucl; BinInt.Z.pos_div_eucl; BinInt.Z.pos_div_eucl_bound; BinInt.Z.pos_div_eucl_eq; BinNat.N.pos_div_eucl_spec; BinInt.Pos2Z.pos_is_pos; BinInt.Pos2Z.pos_le_pos; BinInt.Z.pos_sub; BinInt.Z.Private_BootStrap.pos_sub_add; BinInt.Z.pos_sub_diag; BinInt.Z.pos_sub_discr; BinInt.Z.pos_sub_gt; BinInt.Z.pos_sub_lt; BinInt.Z.pos_sub_opp; BinInt.Z.pos_sub_spec; Znat.positive_N_nat; BinNums.positive_ind; Znat.positive_nat_Z; BinNums.positive_rec; BinNums.positive_rect; Rpow_def.pow; BinPos.Pos.pow; BinInt.Z.pow; BinInt.Z.pow_0_r; BinInt.Z.pow_1_l; BinPos.Pos.pow_1_r; BinInt.Z.pow_1_r; Ring_theory.pow_N; Field_theory.pow_N_ext; Ring_theory.pow_N_pow_N; Ring_theory.pow_N_th; BinInt.Z.pow_add_r; Field_theory.pow_ext; BinInt.Z.pow_gt_1; BinInt.Z.pow_le_mono_r; BinInt.Z.pow_lt_mono_l; BinInt.Z.pow_lt_mono_r; BinInt.Z.pow_neg_r; BinInt.Z.pow_nonneg; Ring_theory.pow_pos; BinInt.Z.pow_pos; Field_theory.pow_pos_0; Field_theory.pow_pos_1; EnvRing.pow_pos_add; Ring_polynom.pow_pos_add; Ring_theory.pow_pos_add; Field_theory.pow_pos_add_r; Field_theory.pow_pos_cst; Field_theory.pow_pos_div; Field_theory.pow_pos_mul_l; Field_theory.pow_pos_mul_r; BinInt.Z.pow_pos_nonneg; Field_theory.pow_pos_nz; Ring_theory.pow_pos_succ; Ring_theory.pow_pos_swap; BinPos.Pos.pow_succ_r; BinInt.Z.pow_succ_r; BinInt.Z.pow_twice_r; BinInt.Z.pow_wd; Rfunctions.powerRZ; Ranalysis1.pr_nu; Ranalysis4.pr_nu_var; PeanoNat.Nat.pred; BinNat.N.pred; BinPos.Pos.pred; BinInt.Z.pred; BinNat.N.pred_0; PeanoNat.Nat.pred_0; BinPos.Pos.pred_N; BinPos.Pos.pred_N_succ; BinPos.Pos.pred_double; BinInt.Z.pred_double; BinPos.Pos.pred_double_succ; BinInt.Z.pred_inj; BinInt.Z.pred_inj_wd; BinPos.Pos.pred_mask; BinNat.N.pred_succ; PeanoNat.Nat.pred_succ; BinInt.Z.pred_succ; BinNat.N.pred_wd; PeanoNat.Nat.pred_wd; BinInt.Z.pred_wd; PeanoNat.Nat.pred_wd_obligation_1; prod_ind; prod_rect; proj1; proj1_sig; proj2; proj2_sig; Rtopology.prolongement_C0; Rlimit.prop_eps; Morphisms.proper_prf; RingMicromega.psub; ZMicromega.psub; RingMicromega.psubC; QMicromega.qdeduce; QMicromega.qunsat; BinInt.Z.quotrem; BinInt.Z.quotrem_eq; Ring_polynom.r_list_pow; Ring_polynom.r_list_pow_rev; Field_theory.radd_ext; Ring_theory.radd_ext2_Proper; Field_theory.radd_ext3_Proper; InitialRing.radd_ext3_Proper; InitialRing.radd_ext4_Proper; EnvRing.radd_ext_Proper; Field_theory.radd_ext_Proper; InitialRing.radd_ext_Proper; Ring_polynom.radd_ext_Proper; BinNat.N.rbase; PeanoNat.Nat.rbase; BinInt.Z.rbase; RMicromega.rdeduce; Field_theory.rdiv1; Field_theory.rdiv2b; Field_theory.rdiv3b; Field_theory.rdiv4; Field_theory.rdiv4b; Field_theory.rdiv5; Field_theory.rdiv6; Field_theory.rdiv7; Field_theory.rdiv7b; Field_theory.rdiv_ext; Field_theory.rdiv_r_r; Field_theory.rdiv_simpl; Morphisms.reflexive_eq_dom_reflexive; Morphisms.reflexive_proper; CMorphisms.reflexive_proper_proxy; Morphisms.reflexive_proper_proxy; Morphisms.reflexive_reflexive_proxy; RelationClasses.reflexivity; ConstructiveEpsilon.rel_ls_ind; ConstructiveEpsilon.rel_ls_post; Relation_Definitions.relation; CMorphisms.respectful; Morphisms.respectful; Rtopology.restriction_family; List.rev'; List.rev_append; ZifyClasses.rew_iff; ZifyClasses.rew_iff_rev; Morphisms.rewrite_relation_eq_dom; BinNat.N.right_induction; PeanoNat.Nat.right_induction; BinInt.Z.right_induction; Field_theory.ring_S_inj; Ring_polynom.ring_correct; Ring_polynom.ring_rw_correct; Ring_polynom.ring_rw_pow_correct; Ring_tac.ring_subst_niter; Field_theory.rinv_ext_Proper; OrderedRing.rle_morph_Proper; RingMicromega.rle_morph_Proper; OrderedRing.rlt_morph_Proper; RingMicromega.rlt_morph_Proper; OrderedRing.rminus_morph; OrderedRing.rminus_morph_Proper; RingMicromega.rminus_morph_Proper; Field_theory.rmul_ext; Ring_theory.rmul_ext2_Proper; InitialRing.rmul_ext3_Proper; InitialRing.rmul_ext4_Proper; EnvRing.rmul_ext_Proper; Field_theory.rmul_ext_Proper; InitialRing.rmul_ext_Proper; Ring_polynom.rmul_ext_Proper; Field_theory.rmul_reg_l; Ring_theory.ropp_ext2_Proper; Field_theory.ropp_ext3_Proper; InitialRing.ropp_ext3_Proper; EnvRing.ropp_ext_Proper; Field_theory.ropp_ext_Proper; Ring_polynom.ropp_ext_Proper; OrderedRing.ropp_morph_Proper; RingMicromega.ropp_morph_Proper; Field_theory.ropp_neq_0; OrderedRing.rplus_morph_Proper; RingMicromega.rplus_morph_Proper; Ring_theory.rpow_pow_N; BinNat.N.rs'_rs''; PeanoNat.Nat.rs'_rs''; BinInt.Z.rs'_rs''; BinNat.N.rs_rs'; PeanoNat.Nat.rs_rs'; BinInt.Z.rs_rs'; Field_theory.rsplit_common; Field_theory.rsplit_left; Field_theory.rsplit_right; Field_theory.rsub_0_l; Field_theory.rsub_0_r; EnvRing.rsub_ext_Proper; Field_theory.rsub_ext_Proper; Ring_polynom.rsub_ext_Proper; OrderedRing.rtimes_morph_Proper; RingMicromega.rtimes_morph_Proper; Tauto.rtyp; RMicromega.runsat; InitialRing.same_gen; InitialRing.same_genN; InitialRing.same_genZ; ConstructiveCauchyReals.scale; ConstructiveCauchyReals.seq; ConstructiveRcomplete.seq_cv; BinInt.Z.sgn; ClassicalDedekindReals.sig_forall_dec; ConstructiveLUB.sig_forall_dec_T; sig_ind; ConstructiveLUB.sig_lub; ClassicalDedekindReals.sig_not_dec; ConstructiveLUB.sig_not_dec_T; sig_rec; sig_rect; Ring_theory.sign_spec; Rlimit.single_limit; BinPos.Pos.size_nat; BinPos.Pos.size_nat_monotone; snd; OrderedRing.sor_setoid; OrderedRing.sor_setoid_Reflexive; OrderedRing.sor_setoid_Symmetric; OrderedRing.sor_setoid_Transitive; Field_theory.split; Field_theory.split_aux; Field_theory.split_aux_ok; Field_theory.split_aux_ok1; Field_theory.split_nz_l; Field_theory.split_nz_r; Field_theory.split_ok_l; Field_theory.split_ok_r; BinInt.Z.strong_left_induction; BinNat.N.strong_right_induction; PeanoNat.Nat.strong_right_induction; BinInt.Z.strong_right_induction; Nat.sub; BinNat.N.sub; BinPos.Pos.sub; BinInt.Z.sub; BinInt.Z.sub_0_l; BinNat.N.sub_0_r; PeanoNat.Nat.sub_0_r; BinInt.Z.sub_0_r; BinInt.Z.sub_1_r; BinNat.N.sub_add; PeanoNat.Nat.sub_add; BinPos.Pos.sub_add; BinPos.Pos.sub_add_distr; BinInt.Z.sub_cancel_r; BinPos.Pos.sub_decr; BinNat.N.sub_diag; PeanoNat.Nat.sub_diag; BinInt.Z.sub_diag; BinNat.N.sub_gt; PeanoNat.Nat.sub_gt; BinInt.Z.sub_le_mono_r; BinInt.Z.sub_lt_mono_r; BinPos.Pos.sub_mask; BinPos.Pos.sub_mask_add; BinPos.Pos.sub_mask_add_diag_l; BinPos.Pos.sub_mask_add_diag_r; BinPos.Pos.sub_mask_carry; BinPos.Pos.sub_mask_carry_spec; BinPos.Pos.sub_mask_diag; BinPos.Pos.sub_mask_neg_iff; BinPos.Pos.sub_mask_nul_iff; BinPos.Pos.sub_mask_pos; BinPos.Pos.sub_mask_pos'; BinPos.Pos.sub_mask_pos_iff; BinPos.Pos.sub_mask_spec; BinPos.Pos.sub_mask_succ_r; BinInt.Z.sub_move_0_r; BinInt.Z.sub_move_r; BinInt.Z.sub_opp_r; BinInt.Z.sub_simpl_r; BinPos.Pos.sub_sub_distr; BinInt.Z.sub_sub_distr; BinNat.N.sub_succ; PeanoNat.Nat.sub_succ; PeanoNat.Nat.sub_succ_l; BinInt.Z.sub_succ_l; BinNat.N.sub_succ_r; PeanoNat.Nat.sub_succ_r; BinInt.Z.sub_succ_r; BinNat.N.sub_wd; PeanoNat.Nat.sub_wd; BinInt.Z.sub_wd; PeanoNat.Nat.sub_wd_obligation_1; BinPos.Pos.sub_xI_xI; BinPos.Pos.sub_xI_xO; BinPos.Pos.sub_xO_xI; BinPos.Pos.sub_xO_xO; Rtopology.subfamily; CRelationClasses.subrelation; RelationClasses.subrelation; CMorphisms.subrelation_proper; Morphisms.subrelation_proper; CMorphisms.subrelation_refl; Morphisms.subrelation_refl; CMorphisms.subrelation_respectful; Morphisms.subrelation_respectful; BinNat.N.succ; BinPos.Pos.succ; BinInt.Z.succ; BinNat.N.succ_double; BinInt.Z.succ_double; BinNat.N.succ_double_add; BinPos.Pos.succ_double_mask; BinNat.N.succ_double_mul; BinInt.Z.succ_double_spec; BinNat.N.succ_inj; PeanoNat.Nat.succ_inj; BinPos.Pos.succ_inj; BinInt.Z.succ_inj; BinNat.N.succ_inj_wd; PeanoNat.Nat.succ_inj_wd; BinInt.Z.succ_inj_wd; PeanoNat.Nat.succ_le_mono; BinInt.Z.succ_le_mono; PeanoNat.Nat.succ_lt_mono; BinPos.Pos.succ_lt_mono; BinInt.Z.succ_lt_mono; BinPos.Pos.succ_not_1; BinInt.Z.succ_pred; BinPos.Pos.succ_pred_double; BinPos.Pos.succ_pred_or; BinNat.N.succ_wd; PeanoNat.Nat.succ_wd; BinInt.Z.succ_wd; PeanoNat.Nat.succ_wd_obligation_1; sumbool_ind; sumbool_rec; sumbool_rect; RMicromega.sumboolb; sumor_ind; sumor_rec; sumor_rect; BinPos.Pos.switch_Eq; CRelationClasses.symmetry; RelationClasses.symmetry; Env.tail; Tauto.tauto_checker; Tauto.tauto_checker_sound; RIneq.tech_Rplus; List.tl; BinInt.Z.to_N; BinNat.N.to_nat; BinPos.Pos.to_nat; BinInt.Z.to_nat; BinInt.Z.to_pos; Rdefinitions.total_order_T; PeanoNat.Nat.Private_Tac.trans; BinPos.Pos.Private_Tac.trans; Qminmax.Q.Private_Tac.trans; BinInt.Z.Private_Tac.trans; BinNat.N.Private_OrderTac.Tac.trans; PeanoNat.Nat.Private_OrderTac.Tac.trans; BinInt.Z.Private_OrderTac.Tac.trans; Morphisms.trans_co_eq_inv_impl_morphism; Morphisms.trans_co_eq_inv_impl_morphism_obligation_1; Morphisms.trans_co_impl_morphism; Morphisms.trans_co_impl_morphism_obligation_1; CMorphisms.trans_contra_inv_impl_type_morphism; CMorphisms.trans_contra_inv_impl_type_morphism_obligation_1; OrdersTac.trans_ord; Morphisms.trans_sym_co_inv_impl_morphism; Morphisms.trans_sym_co_inv_impl_morphism_obligation_1; CRelationClasses.transitivity; RelationClasses.transitivity; InitialRing.triv_div; InitialRing.triv_div_th; BinInt.Z.two_succ; Ranalysis1.uniqueness_limite; Ranalysis1.uniqueness_step1; Ranalysis1.uniqueness_step2; Ranalysis1.uniqueness_step3; Rdefinitions.up; ZMicromega.valid_cut_sign; well_founded; well_founded_ind; well_founded_induction_type; Wf_nat.well_founded_ltof; BinPos.Pos.xI_succ_xO; Tauto.xcnf; Tauto.xcnf_correct; Tauto.xcnf_iff; Tauto.xcnf_impl; RingMicromega.xnegate; ZMicromega.xnegate; RingMicromega.xnegate_correct; ZMicromega.xnegate_correct; ZMicromega.xnnormalise; ZMicromega.xnnormalise_correct; RingMicromega.xnormalise; ZMicromega.xnormalise; RingMicromega.xnormalise_correct; ZMicromega.xnormalise_correct; Tauto.xor_clause_cnf; RMicromega.z_of_exp; Ring_polynom.zmon_pred; Ring_polynom.zmon_pred_ok; Acc; BoolSpec; ConstructiveCauchyReals.CReal; CompareSpec; CompareSpecT; ConstructiveReals.ConstructiveReals; ConstructiveLUB.DedekindDecCut; SetoidTactics.DefaultRelation; CRelationClasses.Equivalence; RelationClasses.Equivalence; Field_theory.FExpr; False; RingMicromega.Formula; Tauto.GFormula; ZifyClasses.InjTyp; Rlimit.Metric_Space; Ring_polynom.Mon; BinNums.N; RingMicromega.Op1; RingMicromega.Op2; RelationClasses.PER; EnvRing.PExpr; Ring_polynom.PExpr; EnvRing.Pol; Ring_polynom.Pol; RelationClasses.PreOrder; RingMicromega.Psatz; QArith_base.Q; RMicromega.Rcst; RelationClasses.RewriteRelation; OrderedRing.SOR; RingMicromega.SORaddon; RelationClasses.StrictOrder; BinPos.Pos.SubMaskSpec; True; BinNums.Z; ZMicromega.ZArithProof; ZMicromega.Zdivide_pol; Znumtheory.Zis_gcd; Field_theory.almost_field_theory; Ring_theory.almost_ring_theory; and; ConstructiveEpsilon.before_witness; bool; comparison; Ring_theory.div_theory; eq; ex; Rtopology.family; Field_theory.field_theory; Tauto.kind; le; Field_theory.linear; list; BinPos.Pos.mask; nat; RIneq.negreal; option; or; OrdersTac.ord; BinNums.positive; RIneq.posreal; Ring_theory.power_theory; prod; Bool.reflect; ConstructiveEpsilon.rel_ls; Ring_theory.ring_eq_ext; Ring_theory.ring_morph; Ring_theory.ring_theory; Field_theory.rsplit; Ring_theory.semi_morph; Ring_theory.semi_ring_theory; sig; sigT; Ring_theory.sign_theory; Ring_theory.sring_eq_ext; sum; sumbool; sumor; VarMap.t; unit; Acc_intro; BoolSpecT; ConstructiveCauchyReals.mkCReal; CompEq; CompEqT; ConstructiveReals.Build_ConstructiveReals; ConstructiveLUB.Build_DedekindDecCut; SetoidTactics.Build_DefaultRelation; CRelationClasses.Build_Equivalence; RelationClasses.Build_Equivalence; Field_theory.FEO; RingMicromega.Build_Formula; Tauto.TT; ZifyClasses.mkinj; Rlimit.Build_Metric_Space; Ring_polynom.mon0; BinNums.N0; RingMicromega.Equal; RingMicromega.OpEq; RelationClasses.Build_PER; EnvRing.PEc; Ring_polynom.PEO; EnvRing.Pc; Ring_polynom.Pc; RelationClasses.Build_PreOrder; RingMicromega.PsatzLet; QArith_base.Qmake; RMicromega.C0; RelationClasses.Build_RewriteRelation; OrderedRing.mk_SOR_theory; RingMicromega.mk_SOR_addon; RelationClasses.Build_StrictOrder; BinPos.Pos.SubIsNul; I; BinNums.Z0; ZMicromega.DoneProof; ZMicromega.Zdiv_Pc; Znumtheory.Zis_gcd_intro; Field_theory.mk_afield; Ring_theory.mk_art; conj; ConstructiveEpsilon.stop; true; Eq; Ring_theory.mkdiv_th; eq_refl; ex_intro; Rtopology.mkfamily; Field_theory.mk_field; Tauto.isProp; le_n; Field_theory.mk_linear; nil; BinPos.Pos.IsNul; O; RIneq.mknegreal; Some; or_introl; OrdersTac.OEQ; BinNums.xI; RIneq.mkposreal; Ring_theory.mkpow_th; pair; Bool.ReflectT; ConstructiveEpsilon.Rstop; Ring_theory.mk_reqe; Ring_theory.mkmorph; Ring_theory.mk_rt; Field_theory.mk_rsplit; Ring_theory.mkRmorph; Ring_theory.mk_srt; exist; existT; Ring_theory.mksign_th; Ring_theory.mk_seqe; inl; left; inleft; VarMap.Empty; tt; BoolSpecF; CompLt; CompLtT; Field_theory.FEI; Tauto.FF; Ring_polynom.zmon; BinNums.Npos; RingMicromega.NonEqual; RingMicromega.OpNEq; EnvRing.PEX; Ring_polynom.PEI; EnvRing.Pinj; Ring_polynom.Pinj; RingMicromega.PsatzIn; RMicromega.C1; BinPos.Pos.SubIsPos; BinNums.Zpos; ZMicromega.RatProof; ZMicromega.Zdiv_Pinj; ConstructiveEpsilon.next; false; Lt; Tauto.isBool; le_S; cons; BinPos.Pos.IsPos; S; None; or_intror; OrdersTac.OLT; BinNums.xO; Bool.ReflectF; ConstructiveEpsilon.Rnext; inr; right; inright; VarMap.Elt; CompGt; CompGtT; Field_theory.FEc; Tauto.X; Ring_polynom.vmon; RingMicromega.Strict; RingMicromega.OpLe; EnvRing.PEadd; Ring_polynom.PEc; EnvRing.PX; Ring_polynom.PX; RingMicromega.PsatzSquare; RMicromega.CQ; BinPos.Pos.SubIsNeg; BinNums.Zneg; ZMicromega.CutProof; ZMicromega.Zdiv_PX; Gt; BinPos.Pos.IsNeg; OrdersTac.OLE; BinNums.xH; VarMap.Branch; Field_theory.FEX; Tauto.A; RingMicromega.NonStrict; RingMicromega.OpGe; EnvRing.PEsub; Ring_polynom.PEX; RingMicromega.PsatzMulC; RMicromega.CZ; ZMicromega.SplitProof; Field_theory.FEadd; Tauto.AND; RingMicromega.OpLt; EnvRing.PEmul; Ring_polynom.PEadd; RingMicromega.PsatzMulE; RMicromega.CPlus; ZMicromega.EnumProof; Field_theory.FEsub; Tauto.OR; RingMicromega.OpGt; EnvRing.PEopp; Ring_polynom.PEsub; RingMicromega.PsatzAdd; RMicromega.CMinus; ZMicromega.ExProof; Field_theory.FEmul; Tauto.NOT; EnvRing.PEpow; Ring_polynom.PEmul; RingMicromega.PsatzC; RMicromega.CMult; Field_theory.FEopp; Tauto.IMPL; Ring_polynom.PEopp; RingMicromega.PsatzZ; RMicromega.CPow; Field_theory.FEinv; Tauto.IFF; Ring_polynom.PEpow; RMicromega.CInv; Field_theory.FEdiv; Tauto.EQ; RMicromega.COpp; Field_theory.FEpow; }} Spilled_1 = 3412 T = 4.175587 Query assignments: GRF = indt «F» I1 = «elpi.tests.test_HOAS.73» I2 = «elpi.tests.test_HOAS.73» U = «elpi.tests.test_HOAS.73» UL1 = [«elpi.tests.test_HOAS.73»] Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.73} |= ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.73} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.73 WEAK CONSTRAINTS: Cannot enforce elpi.tests.test_HOAS.74 = elpi.tests.test_HOAS.75 because elpi.tests.test_HOAS.75 < elpi.tests.test_HOAS.75 = elpi.tests.test_HOAS.74 Query assignments: E = Cannot enforce elpi.tests.test_HOAS.74 = elpi.tests.test_HOAS.75 because elpi.tests.test_HOAS.75 < elpi.tests.test_HOAS.75 = elpi.tests.test_HOAS.74 GRF = indt «F» I1 = «elpi.tests.test_HOAS.74» I2 = «elpi.tests.test_HOAS.75» L1 = «elpi.tests.test_HOAS.74» L2 = «elpi.tests.test_HOAS.75» U1 = «elpi.tests.test_HOAS.74» U2 = «elpi.tests.test_HOAS.75» Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.75 elpi.tests.test_HOAS.74} |= elpi.tests.test_HOAS.74 < elpi.tests.test_HOAS.75 ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.75 elpi.tests.test_HOAS.74} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.75 elpi.tests.test_HOAS.74 WEAK CONSTRAINTS: Query assignments: S = {{ Nat.add; eq; nat; O; }} Spilled_1 = 4 T = prod `x` (global (indt «nat»)) c0 \ app [global (indt «eq»), X0 c0, app [global (const «Nat.add»), c0, global (indc «O»)], c0] _uvk_9_ = c0 \ X0 c0 Syntactic constraints: {c0} : decl c0 `x` (global (indt «nat»)) ?- evar (X0 c0) (X1 c0) (X0 c0) /* suspended on X0 */ {c0} : decl c0 `x` (global (indt «nat»)) ?- evar (X2 c0) (sort (typ «elpi.tests.test_API_env.30»)) (X1 c0) /* suspended on X2, X1 */ Universe constraints: UNIVERSES: {elpi.tests.test_API_env.30} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Query assignments: X1 = «x1» X2 = «x2» X3 = «x3» File "./tests/test_param1.v", line 176, characters 0-66: Warning: Not a truly recursive fixpoint. [non-recursive,fixpoints] COQC tests/test_param1_functor.v COQC tests/test_param1_congr.v Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.79 elpi.tests.test_HOAS.78} |= elpi.tests.test_HOAS.78 < elpi.tests.test_HOAS.79 ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.79 elpi.tests.test_HOAS.78} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.79 elpi.tests.test_HOAS.78 WEAK CONSTRAINTS: Query assignments: GRF = indt «F2» I1 = «elpi.tests.test_HOAS.78» I2 = «elpi.tests.test_HOAS.79» L1 = «elpi.tests.test_HOAS.78» L2 = «elpi.tests.test_HOAS.79» U1 = «elpi.tests.test_HOAS.78» U2 = «elpi.tests.test_HOAS.79» Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.79 elpi.tests.test_HOAS.78} |= elpi.tests.test_HOAS.78 < elpi.tests.test_HOAS.79 elpi.tests.test_HOAS.78 <= elpi.tests.test_HOAS.79 ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.79 elpi.tests.test_HOAS.78} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.79 elpi.tests.test_HOAS.78 WEAK CONSTRAINTS: Query assignments: M = [[mode-ground], [mode-input]] Query assignments: _uvk_317_ = X0 Debug: Cannot enforce elpi.apps.derive.tests.test_derive.3312 <= Set Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.81 elpi.tests.test_HOAS.80} |= elpi.tests.test_HOAS.80 < elpi.tests.test_HOAS.81 ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.81} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.81 elpi.tests.test_HOAS.80 WEAK CONSTRAINTS: Cannot enforce elpi.tests.test_HOAS.81 = elpi.tests.test_HOAS.80 because elpi.tests.test_HOAS.80 < elpi.tests.test_HOAS.81 Query assignments: E = Cannot enforce elpi.tests.test_HOAS.81 = elpi.tests.test_HOAS.80 because elpi.tests.test_HOAS.80 < elpi.tests.test_HOAS.81 GRF = indt «F» I1 = «elpi.tests.test_HOAS.80» I2 = «elpi.tests.test_HOAS.81» L1 = «elpi.tests.test_HOAS.80» L2 = «elpi.tests.test_HOAS.81» U1 = «elpi.tests.test_HOAS.80» U2 = «elpi.tests.test_HOAS.81» Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.81 elpi.tests.test_HOAS.80} |= elpi.tests.test_HOAS.80 < elpi.tests.test_HOAS.81 ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.81} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.81 elpi.tests.test_HOAS.80 WEAK CONSTRAINTS: 1 1.000000 Query assignments: GR = indt «nat» Skipping derivation map on indt «nat» since it has been already run Derivation lens on indt «nat» Derivation lens on indt «nat» failed, continuing Skipping derivation param1 on indt «nat» since it has been already run Skipping derivation param2 on indt «nat» since it has been already run Skipping derivation tag on indt «nat» since it has been already run Skipping derivation eqType_ast on indt «nat» since it has been already run Derivation projK on indt «nat» Derivation projK on indt «nat» took 0.008758 Derivation isK on indt «nat» Derivation isK on indt «nat» took 0.015952 Derivation eq on indt «nat» Derivation eq on indt «nat» took 0.015519 Derivation invert on indt «nat» Derivation invert on indt «nat» took 0.025380 Skipping derivation lens_laws on indt «nat» since it has been already run Skipping derivation param1_congr on indt «nat» since it has been already run Skipping derivation param1_inhab on indt «nat» since it has been already run Skipping derivation param1_functor on indt «nat» since it has been already run Skipping derivation fields on indt «nat» since it has been already run Derivation bcongr on indt «nat» Derivation bcongr on indt «nat» took 0.018015 Derivation idx2inv on indt «nat» Derivation idx2inv on indt «nat» failed, continuing Skipping derivation param1_trivial on indt «nat» since it has been already run Skipping derivation induction on indt «nat» since it has been already run Skipping derivation eqb on indt «nat» since it has been already run Derivation eqK on indt «nat» Derivation eqK on indt «nat» took 0.024002 Skipping derivation eqbcorrect on indt «nat» since it has been already run Derivation eqcorrect on indt «nat» Derivation eqcorrect on indt «nat» took 0.008039 Skipping derivation eqbOK on indt «nat» since it has been already run Derivation eqOK on indt «nat» Derivation eqOK on indt «nat» took 0.007297 nat_eqb : nat -> nat -> bool : nat -> nat -> bool is_nat : nat -> Type : nat -> Type is_nat_inhab : (forall x : nat, is_nat x) : forall x : nat, is_nat x is_nat_functor : (forall x : nat, is_nat x -> is_nat x) : forall x : nat, is_nat x -> is_nat x nat_induction : (forall P : nat -> Type, P 0 -> (forall n : nat, P n -> P (S n)) -> forall x : nat, is_nat x -> P x) : forall P : nat -> Type, P 0 -> (forall n : nat, P n -> P (S n)) -> forall x : nat, is_nat x -> P x nat_tag : nat -> BinNums.positive : nat -> BinNums.positive nat_fields_t : BinNums.positive -> Type : BinNums.positive -> Type nat_fields : (forall n : nat, nat_fields_t (nat_tag n)) : forall n : nat, nat_fields_t (nat_tag n) nat_construct : (forall p : BinNums.positive, nat_fields_t p -> option nat) : forall p : BinNums.positive, nat_fields_t p -> option nat nat_constructP : (forall n : nat, nat_construct (nat_tag n) (nat_fields n) = Some n) : forall n : nat, nat_construct (nat_tag n) (nat_fields n) = Some n nat_eqb : nat -> nat -> bool : nat -> nat -> bool nat_eqb_correct : forall x : nat, eqb_correct_on nat_eqb x nat_eqb_refl : forall x : nat, eqb_refl_on nat_eqb x list_map : (forall A B : Type, (A -> B) -> list A -> list B) : forall A B : Type, (A -> B) -> list A -> list B is_nil : (forall (A : Type) (P : A -> Type), is_list A P nil) : forall (A : Type) (P : A -> Type), is_list A P nil is_cons : (forall (A : Type) (P : A -> Type) (x : A), P x -> forall tl : list A, is_list A P tl -> is_list A P (x :: tl)) : forall (A : Type) (P : A -> Type) (x : A), P x -> forall tl : list A, is_list A P tl -> is_list A P (x :: tl) is_list_functor : (forall (A : Type) (P Q : A -> Type), (forall x : A, P x -> Q x) -> forall l : list A, is_list A P l -> is_list A Q l) : forall (A : Type) (P Q : A -> Type), (forall x : A, P x -> Q x) -> forall l : list A, is_list A P l -> is_list A Q l list_induction : (forall (A : Type) (PA : A -> Type) (P : list A -> Type), P nil -> (forall x : A, PA x -> forall xs : list A, P xs -> P (x :: xs)%list) -> forall l : list A, is_list A PA l -> P l) : forall (A : Type) (PA : A -> Type) (P : list A -> Type), P nil -> (forall x : A, PA x -> forall xs : list A, P xs -> P (x :: xs)%list) -> forall l : list A, is_list A PA l -> P l list_tag : (forall A : Type, list A -> BinNums.positive) : forall A : Type, list A -> BinNums.positive list_fields_t : Type -> BinNums.positive -> Type : Type -> BinNums.positive -> Type list_fields : (forall (A : Type) (l : list A), list_fields_t A (list_tag A l)) : forall (A : Type) (l : list A), list_fields_t A (list_tag A l) list_construct : (forall (A : Type) (p : BinNums.positive), list_fields_t A p -> option (list A)) : forall (A : Type) (p : BinNums.positive), list_fields_t A p -> option (list A) projSucc1 : peano -> peano -> peano : peano -> peano -> peano projSome1 : forall A : Type, A -> option A -> A : forall A : Type, A -> option A -> A projComma1 : forall A B : Type, A -> B -> pair A B -> A : forall A B : Type, A -> B -> pair A B -> A list_constructP : (forall (A : Type) (l : list A), list_construct A (list_tag A l) (list_fields A l) = Some l) : forall (A : Type) (l : list A), list_construct A (list_tag A l) (list_fields A l) = Some l projComma2 : forall A B : Type, A -> B -> pair A B -> B : forall A B : Type, A -> B -> pair A B -> B projCons1 : forall A : Type, A -> seq A -> seq A -> A : forall A : Type, A -> seq A -> seq A -> A list_eqb : (forall A : Type, (A -> A -> bool) -> list A -> list A -> bool) : forall A : Type, (A -> A -> bool) -> list A -> list A -> bool projCons2 : forall A : Type, A -> seq A -> seq A -> seq A : forall A : Type, A -> seq A -> seq A -> seq A list_eqb_correct : forall (a : Type) (eqA : a -> a -> bool), eqb_correct eqA -> forall x : list a, eqb_correct_on (list_eqb a eqA) x list_eqb_refl : forall (a : Type) (eqA : a -> a -> bool), eqb_reflexive eqA -> forall x : list a, eqb_refl_on (list_eqb a eqA) x projLeaf1 : forall A : Type, A -> rose A -> A : forall A : Type, A -> rose A -> A projNode1 : forall A : Type, seq (rose A) -> rose A -> seq (rose A) : forall A : Type, seq (rose A) -> rose A -> seq (rose A) projConsN1 : forall A : Type, A -> nest (pair A A) -> nest A -> A : forall A : Type, A -> nest (pair A A) -> nest A -> A projConsN2 : forall A : Type, A -> nest (pair A A) -> nest A -> nest (pair A A) : forall A : Type, A -> nest (pair A A) -> nest A -> nest (pair A A) projvia1 : forall A : Type, (A -> w A) -> w A -> A -> w A : forall A : Type, (A -> w A) -> w A -> A -> w A projVCons1 : forall (A : Type) (i : peano), A -> forall j : peano, vect A j -> vect A i -> A : forall (A : Type) (i : peano), A -> forall j : peano, vect A j -> vect A i -> A projVCons2 : forall (A : Type) (i : peano), A -> forall j : peano, vect A j -> vect A i -> peano : forall (A : Type) (i : peano), A -> forall j : peano, vect A j -> vect A i -> peano projVCons3 : forall (A : Type) (i : peano), A -> forall j : peano, vect A j -> vect A i -> {w : peano & vect A w} : forall (A : Type) (i : peano), A -> forall j : peano, vect A j -> vect A i -> {w : peano & vect A w} projbox1 : forall T : Type, T -> dyn -> Type : forall T : Type, T -> dyn -> Type projbox2 : forall T : Type, T -> dyn -> {T0 : Type & T0} : forall T : Type, T -> dyn -> {T0 : Type & T0} projEnvelope1 : forall A : Type, A -> A -> zeta A -> A : forall A : Type, A -> A -> zeta A -> A eq_refl : projEnvelope1 nat 1 1 (Envelope nat 0 1) = 0 : projEnvelope1 nat 1 1 (Envelope nat 0 1) = 0 projEnvelope2 : forall A : Type, A -> A -> zeta A -> A : forall A : Type, A -> A -> zeta A -> A eq_refl : projEnvelope2 nat 1 1 (Envelope nat 1 0) = 0 : projEnvelope2 nat 1 1 (Envelope nat 1 0) = 0 projRedex1 : forall A : Type, A -> beta A -> A : forall A : Type, A -> beta A -> A projWhy1 : forall n : peano, match n with | Zero => peano | Succ _ => unit end -> iota -> peano : forall n : peano, match n with | Zero => peano | Succ _ => unit end -> iota -> peano projWhy2 : forall n : peano, match n with | Zero => peano | Succ _ => unit end -> iota -> {i : peano & match i with | Zero => peano | Succ _ => unit end} : forall n : peano, match n with | Zero => peano | Succ _ => unit end -> iota -> {i : peano & match i with | Zero => peano | Succ _ => unit end} projPI1 : PrimInt63.int -> prim_int -> PrimInt63.int projPF1 : PrimFloat.float -> prim_float -> PrimFloat.float projBuild_fo_record1 : peano -> unit -> fo_record -> peano : peano -> unit -> fo_record -> peano projBuild_fo_record2 : peano -> unit -> fo_record -> unit : peano -> unit -> fo_record -> unit projBuild_pa_record2 : forall A : Type, peano -> A -> pa_record A -> A : forall A : Type, peano -> A -> pa_record A -> A projBuild_pr_record2 : forall A : Type, peano -> A -> pr_record A -> A : forall A : Type, peano -> A -> pr_record A -> A COQC tests/test_bcongr.v is_empty_functor : func is_empty : func is_empty is_unit_functor : func is_unit : func is_unit is_peano_functor : func is_peano : func is_peano is_option_functor : func1 is_option : func1 is_option is_pair_functor : func2 is_pair : func2 is_pair is_seq_functor : func1 is_seq : func1 is_seq is_rose_functor : func1 is_rose : func1 is_rose is_vect_functor : forall (A : Type) (P Q : A -> Type), (forall y : A, P y -> Q y) -> forall (i : peano) (p : is_peano i) (v : vect A i), is_vect A P i p v -> is_vect A Q i p v : forall (A : Type) (P Q : A -> Type), (forall y : A, P y -> Q y) -> forall (i : peano) (p : is_peano i) (v : vect A i), is_vect A P i p v -> is_vect A Q i p v is_dyn_functor : func is_dyn : func is_dyn is_zeta_functor : func1 is_zeta : func1 is_zeta is_beta_functor : func1 is_beta : func1 is_beta is_iota_functor : func is_iota : func is_iota is_large_functor : func is_large : func is_large is_prim_int_functor : func is_prim_int : func is_prim_int is_prim_float_functor : func is_prim_float : func is_prim_float is_fo_record_functor : func is_fo_record : func is_fo_record is_pa_record_functor : func1 is_pa_record : func1 is_pa_record is_pr_record_functor : func1 is_pr_record : func1 is_pr_record is_enum_functor : func is_enum : func is_enum is_ord_functor : forall (n : peano) (pn : is_peano n), func (is_ord n pn) : forall (n : peano) (pn : is_peano n), func (is_ord n pn) is_ord2_functor : forall (n : peano) (pn : is_peano n), func (is_ord2 n pn) : forall (n : peano) (pn : is_peano n), func (is_ord2 n pn) is_val_functor : func is_val : func is_val Query assignments: GR = indt «F» I = «elpi.tests.test_HOAS.82» Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.82} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.82 WEAK CONSTRAINTS: COQC tests/test_induction.v congr_is_tt : is_tt = is_tt : is_tt = is_tt congr_is_Zero : is_Zero = is_Zero : is_Zero = is_Zero congr_is_Succ : forall (x : peano) (p1 p2 : is_peano x), p1 = p2 -> is_Succ x p1 = is_Succ x p2 : forall (x : peano) (p1 p2 : is_peano x), p1 = p2 -> is_Succ x p1 = is_Succ x p2 congr_is_None : forall (A : Type) (PA : A -> Type), is_None A PA = is_None A PA : forall (A : Type) (PA : A -> Type), is_None A PA = is_None A PA congr_is_Some : forall (A : Type) (PA : A -> Type) (x : A) (p1 p2 : PA x), p1 = p2 -> is_Some A PA x p1 = is_Some A PA x p2 : forall (A : Type) (PA : A -> Type) (x : A) (p1 p2 : PA x), p1 = p2 -> is_Some A PA x p1 = is_Some A PA x p2 congr_is_Comma : forall (A : Type) (PA : A -> Type) (B : Type) (PB : B -> Type) (x : A) (p1 p2 : PA x), p1 = p2 -> forall (y : B) (q1 q2 : PB y), q1 = q2 -> is_Comma A PA B PB x p1 y q1 = is_Comma A PA B PB x p2 y q2 : forall (A : Type) (PA : A -> Type) (B : Type) (PB : B -> Type) (x : A) (p1 p2 : PA x), p1 = p2 -> forall (y : B) (q1 q2 : PB y), q1 = q2 -> is_Comma A PA B PB x p1 y q1 = is_Comma A PA B PB x p2 y q2 congr_is_Nil : forall (A : Type) (PA : A -> Type), is_Nil A PA = is_Nil A PA : forall (A : Type) (PA : A -> Type), is_Nil A PA = is_Nil A PA congr_is_Cons : forall (A : Type) (PA : A -> Type) (x : A) (p1 p2 : PA x), p1 = p2 -> forall (y : seq A) (q1 q2 : is_seq A PA y), q1 = q2 -> is_Cons A PA x p1 y q1 = is_Cons A PA x p2 y q2 : forall (A : Type) (PA : A -> Type) (x : A) (p1 p2 : PA x), p1 = p2 -> forall (y : seq A) (q1 q2 : is_seq A PA y), q1 = q2 -> is_Cons A PA x p1 y q1 = is_Cons A PA x p2 y q2 congr_is_Leaf : forall (A : Type) (PA : A -> Type) (x : A) (p1 p2 : PA x), p1 = p2 -> is_Leaf A PA x p1 = is_Leaf A PA x p2 : forall (A : Type) (PA : A -> Type) (x : A) (p1 p2 : PA x), p1 = p2 -> is_Leaf A PA x p1 = is_Leaf A PA x p2 congr_is_Node : forall (A : Type) (PA : A -> Type) (x : seq (rose A)) (p1 p2 : is_seq (rose A) (is_rose A PA) x), p1 = p2 -> is_Node A PA x p1 = is_Node A PA x p2 : forall (A : Type) (PA : A -> Type) (x : seq (rose A)) (p1 p2 : is_seq (rose A) (is_rose A PA) x), p1 = p2 -> is_Node A PA x p1 = is_Node A PA x p2 congr_is_via : forall (A : Type) (PA : A -> Type) (x : A -> w A) (p1 p2 : forall H : A, PA H -> is_w A PA (x H)), p1 = p2 -> is_via A PA x p1 = is_via A PA x p2 : forall (A : Type) (PA : A -> Type) (x : A -> w A) (p1 p2 : forall H : A, PA H -> is_w A PA (x H)), p1 = p2 -> is_via A PA x p1 = is_via A PA x p2 congr_is_VNil : forall (A : Type) (PA : A -> Type), is_VNil A PA = is_VNil A PA : forall (A : Type) (PA : A -> Type), is_VNil A PA = is_VNil A PA congr_is_Envelope : forall (A : Type) (PA : A -> Type) (x : A) (p1 p2 : PA x), p1 = p2 -> forall (y : A) (q1 q2 : PA y), q1 = q2 -> is_Envelope A PA x p1 y q1 = is_Envelope A PA x p2 y q2 : forall (A : Type) (PA : A -> Type) (x : A) (p1 p2 : PA x), p1 = p2 -> forall (y : A) (q1 q2 : PA y), q1 = q2 -> is_Envelope A PA x p1 y q1 = is_Envelope A PA x p2 y q2 congr_is_Redex : forall (A : Type) (PA : A -> Type) (x : A) (p1 p2 : PA x), p1 = p2 -> is_Redex A PA x p1 = is_Redex A PA x p2 : forall (A : Type) (PA : A -> Type) (x : A) (p1 p2 : PA x), p1 = p2 -> is_Redex A PA x p1 = is_Redex A PA x p2 congr_is_PI : forall (x : PrimInt63.int) (p1 p2 : is_uint63 x), p1 = p2 -> is_PI x p1 = is_PI x p2 congr_is_PF : forall (x : PrimFloat.float) (p1 p2 : is_float64 x), p1 = p2 -> is_PF x p1 = is_PF x p2 congr_is_Build_fo_record : forall (n : peano) (p1 p2 : is_peano n), p1 = p2 -> forall (b : unit) (q1 q2 : is_unit b), q1 = q2 -> is_Build_fo_record n p1 b q1 = is_Build_fo_record n p2 b q2 : forall (n : peano) (p1 p2 : is_peano n), p1 = p2 -> forall (b : unit) (q1 q2 : is_unit b), q1 = q2 -> is_Build_fo_record n p1 b q1 = is_Build_fo_record n p2 b q2 congr_is_Build_pa_record : forall (A : Type) (PA : A -> Type) (n : peano) (p1 p2 : is_peano n), p1 = p2 -> forall (b : A) (q1 q2 : PA b), q1 = q2 -> is_Build_pa_record A PA n p1 b q1 = is_Build_pa_record A PA n p2 b q2 : forall (A : Type) (PA : A -> Type) (n : peano) (p1 p2 : is_peano n), p1 = p2 -> forall (b : A) (q1 q2 : PA b), q1 = q2 -> is_Build_pa_record A PA n p1 b q1 = is_Build_pa_record A PA n p2 b q2 congr_is_Build_pr_record : forall (A : Type) (pr : A -> Type) (n : peano) (p1 p2 : is_peano n), p1 = p2 -> forall (b : A) (q1 q2 : pr b), q1 = q2 -> is_Build_pr_record A pr n p1 b q1 = is_Build_pr_record A pr n p2 b q2 : forall (A : Type) (pr : A -> Type) (n : peano) (p1 p2 : is_peano n), p1 = p2 -> forall (b : A) (q1 q2 : pr b), q1 = q2 -> is_Build_pr_record A pr n p1 b q1 = is_Build_pr_record A pr n p2 b q2 congr_is_E1 : is_E1 = is_E1 : is_E1 = is_E1 COQC tests/test_param1_trivial.v Query assignments: GR = indt «F» pglobal (indt «F») «elpi.tests.test_HOAS.84» «elpi.tests.test_HOAS.84» pglobal (indc «Build_F») «elpi.tests.test_HOAS.84» Query assignments: GR = indt «F» GR1 = indc «Build_F» I = «elpi.tests.test_HOAS.84» Spilled_1 = pglobal (indc «Build_F») «elpi.tests.test_HOAS.84» Spilled_2 = pglobal (indt «F») «elpi.tests.test_HOAS.84» Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.84} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.84 WEAK CONSTRAINTS: «elpi.tests.test_HOAS.85 elpi.tests.test_HOAS.85» Query assignments: I = «elpi.tests.test_HOAS.85 elpi.tests.test_HOAS.85» U = «elpi.tests.test_HOAS.85» Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.85} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: File "./tests/test_API2.v", line 114, characters 0-16: Warning: Option Foo Bar is deprecated [deprecated-option,deprecated] Universe constraints: ------------------ Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.87 elpi.tests.test_HOAS.86} |= elpi.tests.test_HOAS.86 < elpi.tests.test_HOAS.87 ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.87 elpi.tests.test_HOAS.86} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.87 elpi.tests.test_HOAS.86 WEAK CONSTRAINTS: Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.87 elpi.tests.test_HOAS.86} |= elpi.tests.test_HOAS.86 < elpi.tests.test_HOAS.87 ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.87 elpi.tests.test_HOAS.86} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.87 elpi.tests.test_HOAS.86 WEAK CONSTRAINTS: Query assignments: Body = sort (typ «elpi.tests.test_HOAS.86») LX = «elpi.tests.test_HOAS.86» LY = «elpi.tests.test_HOAS.87» Type = sort (typ «elpi.tests.test_HOAS.87») UX = «elpi.tests.test_HOAS.86» UY = «elpi.tests.test_HOAS.87» Universe constraints: UNIVERSES: {u2 u1} |= u1 < u2 ALGEBRAIC UNIVERSES: {u2 u1} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.87 elpi.tests.test_HOAS.86 WEAK CONSTRAINTS: poly@{u1 u2} : Type@{u2} (* u1 u2 |= u1 < u2 *) poly is universe polymorphic poly is transparent Expands to: Constant elpi.tests.test_HOAS.poly poly@{Set elpi.tests.test_HOAS.88} : Type@{elpi.tests.test_HOAS.88} (* {elpi.tests.test_HOAS.88} |= Set < elpi.tests.test_HOAS.88 *) Box not a defined object. unit_bcongr_tt : reflect (tt = tt) true : reflect (tt = tt) true peano_bcongr_Zero : reflect (Zero = Zero) true : reflect (Zero = Zero) true peano_bcongr_Succ : forall (x y : peano) (b : bool), reflect (x = y) b -> reflect (Succ x = Succ y) b : forall (x y : peano) (b : bool), reflect (x = y) b -> reflect (Succ x = Succ y) b option_bcongr_None : forall A : Type, reflect (None A = None A) true : forall A : Type, reflect (None A = None A) true option_bcongr_Some : forall (A : Type) (x y : A) (b : bool), reflect (x = y) b -> reflect (Some A x = Some A y) b : forall (A : Type) (x y : A) (b : bool), reflect (x = y) b -> reflect (Some A x = Some A y) b pair_bcongr_Comma : forall (A B : Type) (x1 x2 : A) (b1 : bool), reflect (x1 = x2) b1 -> forall (y1 y2 : B) (b2 : bool), reflect (y1 = y2) b2 -> reflect (Comma A B x1 y1 = Comma A B x2 y2) (b1 && b2) : forall (A B : Type) (x1 x2 : A) (b1 : bool), reflect (x1 = x2) b1 -> forall (y1 y2 : B) (b2 : bool), reflect (y1 = y2) b2 -> reflect (Comma A B x1 y1 = Comma A B x2 y2) (b1 && b2) seq_bcongr_Nil : forall A : Type, reflect (Nil A = Nil A) true : forall A : Type, reflect (Nil A = Nil A) true seq_bcongr_Cons : forall (A : Type) (x y : A) (b1 : bool), reflect (x = y) b1 -> forall (xs ys : seq A) (b2 : bool), reflect (xs = ys) b2 -> reflect (Cons A x xs = Cons A y ys) (b1 && b2) : forall (A : Type) (x y : A) (b1 : bool), reflect (x = y) b1 -> forall (xs ys : seq A) (b2 : bool), reflect (xs = ys) b2 -> reflect (Cons A x xs = Cons A y ys) (b1 && b2) rose_bcongr_Leaf : forall (A : Type) (x y : A) (b : bool), reflect (x = y) b -> reflect (Leaf A x = Leaf A y) b : forall (A : Type) (x y : A) (b : bool), reflect (x = y) b -> reflect (Leaf A x = Leaf A y) b rose_bcongr_Node : forall (A : Type) (l1 l2 : seq (rose A)) (b : bool), reflect (l1 = l2) b -> reflect (Node A l1 = Node A l2) b : forall (A : Type) (l1 l2 : seq (rose A)) (b : bool), reflect (l1 = l2) b -> reflect (Node A l1 = Node A l2) b nest_bcongr_NilN : forall A : Type, reflect (NilN A = NilN A) true : forall A : Type, reflect (NilN A = NilN A) true nest_bcongr_ConsN : forall (A : Type) (x y : A) (b1 : bool), reflect (x = y) b1 -> forall (xs ys : nest (pair A A)) (b2 : bool), reflect (xs = ys) b2 -> reflect (ConsN A x xs = ConsN A y ys) (b1 && b2) : forall (A : Type) (x y : A) (b1 : bool), reflect (x = y) b1 -> forall (xs ys : nest (pair A A)) (b2 : bool), reflect (xs = ys) b2 -> reflect (ConsN A x xs = ConsN A y ys) (b1 && b2) w_bcongr_via : forall (A : Type) (f g : A -> w A) (b : bool), reflect (f = g) b -> reflect (via A f = via A g) b : forall (A : Type) (f g : A -> w A) (b : bool), reflect (f = g) b -> reflect (via A f = via A g) b zeta_bcongr_Envelope : forall (A : Type) (x1 x2 : A) (b1 : bool), reflect (x1 = x2) b1 -> forall (y1 y2 : A) (b2 : bool), reflect (y1 = y2) b2 -> reflect (Envelope A x1 y1 = Envelope A x2 y2) (b1 && b2) : forall (A : Type) (x1 x2 : A) (b1 : bool), reflect (x1 = x2) b1 -> forall (y1 y2 : A) (b2 : bool), reflect (y1 = y2) b2 -> reflect (Envelope A x1 y1 = Envelope A x2 y2) (b1 && b2) beta_bcongr_Redex : forall (A : Type) (x y : A) (b : bool), reflect (x = y) b -> reflect (Redex A x = Redex A y) b : forall (A : Type) (x y : A) (b : bool), reflect (x = y) b -> reflect (Redex A x = Redex A y) b prim_int_bcongr_PI : forall (x y : PrimInt63.int) (b : bool), reflect (x = y) b -> reflect (PI x = PI y) b : forall (x y : PrimInt63.int) (b : bool), reflect (x = y) b -> reflect (PI x = PI y) b prim_float_bcongr_PF : forall (x y : PrimFloat.float) (b : bool), reflect (x = y) b -> reflect (PF x = PF y) b : forall (x y : PrimFloat.float) (b : bool), reflect (x = y) b -> reflect (PF x = PF y) b fo_record_bcongr_Build_fo_record : forall (x1 x2 : peano) (b1 : bool), reflect (x1 = x2) b1 -> forall (y1 y2 : unit) (b2 : bool), reflect (y1 = y2) b2 -> reflect ({| f1 := x1; f2 := y1 |} = {| f1 := x2; f2 := y2 |}) (b1 && b2) : forall (x1 x2 : peano) (b1 : bool), reflect (x1 = x2) b1 -> forall (y1 y2 : unit) (b2 : bool), reflect (y1 = y2) b2 -> reflect ({| f1 := x1; f2 := y1 |} = {| f1 := x2; f2 := y2 |}) (b1 && b2) pa_record_bcongr_Build_pa_record : forall (A : Type) (x1 x2 : peano) (b1 : bool), reflect (x1 = x2) b1 -> forall (y1 y2 : A) (b2 : bool), reflect (y1 = y2) b2 -> reflect ({| f3 := x1; f4 := y1 |} = {| f3 := x2; f4 := y2 |}) (b1 && b2) : forall (A : Type) (x1 x2 : peano) (b1 : bool), reflect (x1 = x2) b1 -> forall (y1 y2 : A) (b2 : bool), reflect (y1 = y2) b2 -> reflect ({| f3 := x1; f4 := y1 |} = {| f3 := x2; f4 := y2 |}) (b1 && b2) pr_record_bcongr_Build_pr_record : forall (A : Type) (x1 x2 : peano) (b1 : bool), reflect (x1 = x2) b1 -> forall (y1 y2 : A) (b2 : bool), reflect (y1 = y2) b2 -> reflect ({| pf3 := x1; pf4 := y1 |} = {| pf3 := x2; pf4 := y2 |}) (b1 && b2) : forall (A : Type) (x1 x2 : peano) (b1 : bool), reflect (x1 = x2) b1 -> forall (y1 y2 : A) (b2 : bool), reflect (y1 = y2) b2 -> reflect ({| pf3 := x1; pf4 := y1 |} = {| pf3 := x2; pf4 := y2 |}) (b1 && b2) enum_bcongr_E1 : reflect (E1 = E1) true : reflect (E1 = E1) true enum_bcongr_E2 : reflect (E2 = E2) true : reflect (E2 = E2) true enum_bcongr_E3 : reflect (E3 = E3) true : reflect (E3 = E3) true COQC tests/test_eqK.v File "./tests/test_API2.v", line 122, characters 0-14: Warning: Option Foo Bar is deprecated [deprecated-option,deprecated] Inductive elpi.apps.derive.tests.test_param1.Coverage.is_unit Inductive elpi.apps.derive.tests.test_param1.OtherTests.is_unit (shorter name to refer to it in current context is OtherTests.is_unit) (fun P : empty -> Prop => empty_induction P) : forall (P : empty -> Prop) (x : empty), is_empty x -> P x : forall (P : empty -> Prop) (x : empty), is_empty x -> P x (fun P : unit -> Prop => unit_induction P) : forall P : unit -> Prop, P tt -> forall x : unit, is_unit x -> P x : forall P : unit -> Prop, P tt -> forall x : unit, is_unit x -> P x peano_induction : forall P : peano -> Type, P Zero -> (forall n : peano, P n -> P (Succ n)) -> forall x : peano, is_peano x -> P x : forall P : peano -> Type, P Zero -> (forall n : peano, P n -> P (Succ n)) -> forall x : peano, is_peano x -> P x option_induction : forall (A : Type) (PA : A -> Type) (P : option A -> Type), P (None A) -> (forall a : A, PA a -> P (Some A a)) -> forall x : option A, is_option A PA x -> P x : forall (A : Type) (PA : A -> Type) (P : option A -> Type), P (None A) -> (forall a : A, PA a -> P (Some A a)) -> forall x : option A, is_option A PA x -> P x pair_induction : forall (A : Type) (PA : A -> Type) (B : Type) (PB : B -> Type) (P : pair A B -> Type), (forall a : A, PA a -> forall b : B, PB b -> P (Comma A B a b)) -> forall x : pair A B, is_pair A PA B PB x -> P x : forall (A : Type) (PA : A -> Type) (B : Type) (PB : B -> Type) (P : pair A B -> Type), (forall a : A, PA a -> forall b : B, PB b -> P (Comma A B a b)) -> forall x : pair A B, is_pair A PA B PB x -> P x seq_induction : forall (A : Type) (PA : A -> Type) (P : seq A -> Type), P (Nil A) -> (forall x : A, PA x -> forall xs : seq A, P xs -> P (Cons A x xs)) -> forall l : seq A, is_seq A PA l -> P l : forall (A : Type) (PA : A -> Type) (P : seq A -> Type), P (Nil A) -> (forall x : A, PA x -> forall xs : seq A, P xs -> P (Cons A x xs)) -> forall l : seq A, is_seq A PA l -> P l rose_induction : forall (A : Type) (PA : A -> Type) (P : rose A -> Type), (forall x : A, PA x -> P (Leaf A x)) -> (forall l : seq (rose A), is_seq (rose A) P l -> P (Node A l)) -> forall x : rose A, is_rose A PA x -> P x : forall (A : Type) (PA : A -> Type) (P : rose A -> Type), (forall x : A, PA x -> P (Leaf A x)) -> (forall l : seq (rose A), is_seq (rose A) P l -> P (Node A l)) -> forall x : rose A, is_rose A PA x -> P x nest_induction : forall P : forall A : Type, (A -> Type) -> nest A -> Type, (forall (A : Type) (PA : A -> Type), P A PA (NilN A)) -> (forall (A : Type) (PA : A -> Type) (x : A), PA x -> forall xs : nest (pair A A), P (pair A A) (is_pair A PA A PA) xs -> P A PA (ConsN A x xs)) -> forall (A : Type) (PA : A -> Type) (n : nest A), is_nest A PA n -> P A PA n : forall P : forall A : Type, (A -> Type) -> nest A -> Type, (forall (A : Type) (PA : A -> Type), P A PA (NilN A)) -> (forall (A : Type) (PA : A -> Type) (x : A), PA x -> forall xs : nest (pair A A), P (pair A A) (is_pair A PA A PA) xs -> P A PA (ConsN A x xs)) -> forall (A : Type) (PA : A -> Type) (n : nest A), is_nest A PA n -> P A PA n w_induction : forall (A : Type) (PA : A -> Type) (P : w A -> Type), (forall f : A -> w A, (forall a : A, PA a -> P (f a)) -> P (via A f)) -> forall x : w A, is_w A PA x -> P x : forall (A : Type) (PA : A -> Type) (P : w A -> Type), (forall f : A -> w A, (forall a : A, PA a -> P (f a)) -> P (via A f)) -> forall x : w A, is_w A PA x -> P x vect_induction : forall (A : Type) (PA : A -> Type) (P : forall n : peano, is_peano n -> vect A n -> Type), P Zero is_Zero (VNil A) -> (forall a : A, PA a -> forall (n : peano) (nR : is_peano n) (v : vect A n), P n nR v -> P (Succ n) (is_Succ n nR) (VCons A a n v)) -> forall (l : peano) (lR : is_peano l) (x : vect A l), is_vect A PA l lR x -> P l lR x : forall (A : Type) (PA : A -> Type) (P : forall n : peano, is_peano n -> vect A n -> Type), P Zero is_Zero (VNil A) -> (forall a : A, PA a -> forall (n : peano) (nR : is_peano n) (v : vect A n), P n nR v -> P (Succ n) (is_Succ n nR) (VCons A a n v)) -> forall (l : peano) (lR : is_peano l) (x : vect A l), is_vect A PA l lR x -> P l lR x dyn_induction : forall P : dyn -> Type, (forall (T : Type) (PT : T -> Type) (t : T), PT t -> P (box T t)) -> forall x : dyn, is_dyn x -> P x : forall P : dyn -> Type, (forall (T : Type) (PT : T -> Type) (t : T), PT t -> P (box T t)) -> forall x : dyn, is_dyn x -> P x zeta_induction : forall (A : Type) (PA : A -> Type) (P : zeta A -> Type), (forall a : A, PA a -> forall c : A, PA c -> P (Envelope A a c)) -> forall x : zeta A, is_zeta A PA x -> P x : forall (A : Type) (PA : A -> Type) (P : zeta A -> Type), (forall a : A, PA a -> forall c : A, PA c -> P (Envelope A a c)) -> forall x : zeta A, is_zeta A PA x -> P x iota_induction : forall P : iota -> Type, (forall (n : peano) (Pn : is_peano n) (a : match n with | Zero => peano | Succ _ => unit end), match Pn in (is_peano n0) return (match n0 with | Zero => peano | Succ _ => unit end -> Type) with | is_Zero => is_peano | is_Succ _ _ => is_unit end a -> P (Why n a)) -> forall s1 : iota, is_iota s1 -> P s1 large_induction : forall P : large -> Type, (forall H : unit, is_unit H -> P (K1 H)) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> P (K2 H H0)) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> P (K3 H H0 H1)) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> P (K4 H H0 H1 H2)) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> P (K5 H H0 H1 H2 H3)) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> P (K6 H H0 H1 H2 H3 H4)) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> P (K7 H H0 H1 H2 H3 H4 H5)) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> P (K8 H H0 H1 H2 H3 H4 H5 H6)) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> P (K9 H H0 H1 H2 H3 H4 H5 H6 H7)) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> forall H8 : unit, is_unit H8 -> P (K10 H H0 H1 H2 H3 H4 H5 H6 H7 H8)) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> forall H8 : unit, is_unit H8 -> forall H9 : unit, is_unit H9 -> P (K11 H H0 H1 H2 H3 H4 H5 H6 H7 H8 H9)) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> forall H8 : unit, is_unit H8 -> forall H9 : unit, is_unit H9 -> forall H10 : unit, is_unit H10 -> P (K12 H H0 H1 H2 H3 H4 H5 H6 H7 H8 H9 H10)) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> forall H8 : unit, is_unit H8 -> forall H9 : unit, is_unit H9 -> forall H10 : unit, is_unit H10 -> forall H11 : unit, is_unit H11 -> P (K13 H H0 H1 H2 H3 H4 H5 H6 H7 H8 H9 H10 H11)) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> forall H8 : unit, is_unit H8 -> forall H9 : unit, is_unit H9 -> forall H10 : unit, is_unit H10 -> forall H11 : unit, is_unit H11 -> forall H12 : unit, is_unit H12 -> P (K14 H H0 H1 H2 H3 H4 H5 H6 H7 H8 H9 H10 H11 H12)) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> forall H8 : unit, is_unit H8 -> forall H9 : unit, is_unit H9 -> forall H10 : unit, is_unit H10 -> forall H11 : unit, is_unit H11 -> forall H12 : unit, is_unit H12 -> forall ..., ... -> ...) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> forall H8 : unit, is_unit H8 -> forall H9 : unit, is_unit H9 -> forall H10 : unit, is_unit H10 -> forall H11 : unit, is_unit H11 -> forall H12 : unit, is_unit H12 -> ..., ...) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> forall H8 : unit, is_unit H8 -> forall H9 : unit, is_unit H9 -> forall H10 : unit, is_unit H10 -> forall H11 : unit, is_unit H11 -> forall ..., ... -> ...) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> forall H8 : unit, is_unit H8 -> forall H9 : unit, is_unit H9 -> forall H10 : unit, is_unit H10 -> forall H11 : unit, is_unit H11 -> ..., ...) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> forall H8 : unit, is_unit H8 -> forall H9 : unit, is_unit H9 -> forall H10 : unit, is_unit H10 -> forall ..., ... -> ...) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> forall H8 : unit, is_unit H8 -> forall H9 : unit, is_unit H9 -> forall H10 : unit, is_unit H10 -> ..., ...) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> forall H8 : unit, is_unit H8 -> forall H9 : unit, is_unit H9 -> forall ..., ... -> ...) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> forall H8 : unit, is_unit H8 -> forall H9 : unit, is_unit H9 -> ..., ...) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> forall H8 : unit, is_unit H8 -> forall ..., ... -> ...) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> forall H8 : unit, is_unit H8 -> ..., ...) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> forall ..., ... -> ...) -> (forall H : unit, is_unit H -> forall H0 : unit, is_unit H0 -> forall H1 : unit, is_unit H1 -> forall H2 : unit, is_unit H2 -> forall H3 : unit, is_unit H3 -> forall H4 : unit, is_unit H4 -> forall H5 : unit, is_unit H5 -> forall H6 : unit, is_unit H6 -> forall H7 : unit, is_unit H7 -> ..., ...) -> forall s1 : large, is_large s1 -> P s1 prim_int_induction : forall P : prim_int -> Type, (forall i : PrimInt63.int, is_uint63 i -> P (PI i)) -> forall s1 : prim_int, is_prim_int s1 -> P s1 prim_float_induction : forall P : prim_float -> Type, (forall f : PrimFloat.float, is_float64 f -> P (PF f)) -> forall s1 : prim_float, is_prim_float s1 -> P s1 fo_record_induction : forall P : fo_record -> Type, (forall x : peano, is_peano x -> forall y : unit, is_unit y -> P {| f1 := x; f2 := y |}) -> forall x : fo_record, is_fo_record x -> P x : forall P : fo_record -> Type, (forall x : peano, is_peano x -> forall y : unit, is_unit y -> P {| f1 := x; f2 := y |}) -> forall x : fo_record, is_fo_record x -> P x pa_record_induction : forall (A : Type) (PA : A -> Type) (P : pa_record A -> Type), (forall x : peano, is_peano x -> forall y : A, PA y -> P {| f3 := x; f4 := y |}) -> forall x : pa_record A, is_pa_record A PA x -> P x : forall (A : Type) (PA : A -> Type) (P : pa_record A -> Type), (forall x : peano, is_peano x -> forall y : A, PA y -> P {| f3 := x; f4 := y |}) -> forall x : pa_record A, is_pa_record A PA x -> P x pr_record_induction : forall (A : Type) (pr : A -> Type) (P : pr_record A -> Type), (forall x : peano, is_peano x -> forall y : A, pr y -> P {| pf3 := x; pf4 := y |}) -> forall x : pr_record A, is_pr_record A pr x -> P x : forall (A : Type) (pr : A -> Type) (P : pr_record A -> Type), (forall x : peano, is_peano x -> forall y : A, pr y -> P {| pf3 := x; pf4 := y |}) -> forall x : pr_record A, is_pr_record A pr x -> P x dep_record_induction : forall P : dep_record -> Type, (forall (x : peano) (px : is_peano x) (y : vect unit x), is_vect unit is_unit x px y -> P {| f5 := x; f6 := y |}) -> forall x : dep_record, is_dep_record x -> P x : forall P : dep_record -> Type, (forall (x : peano) (px : is_peano x) (y : vect unit x), is_vect unit is_unit x px y -> P {| f5 := x; f6 := y |}) -> forall x : dep_record, is_dep_record x -> P x enum_induction : forall P : enum -> Type, P E1 -> P E2 -> P E3 -> forall x : enum, is_enum x -> P x : forall P : enum -> Type, P E1 -> P E2 -> P E3 -> forall x : enum, is_enum x -> P x sigma_bool_induction : forall P : sigma_bool -> Type, (forall (depn : peano) (Pdepn : is_peano depn) (depeq : is_zero depn = true), is_eq bool is_bool (is_zero depn) (is_is_zero depn Pdepn) true is_true depeq -> P {| depn := depn; depeq := depeq |}) -> forall s1 : sigma_bool, is_sigma_bool s1 -> P s1 ord_induction : forall (p : peano) (Pp : is_peano p) (P : ord p -> Type), (forall (n : peano) (Pn : is_peano n) (l : is_leq n p = true), is_eq bool is_bool (is_leq n p) (is_is_leq n Pn p Pp) true is_true l -> P (mkOrd p n l)) -> forall o : ord p, is_ord p Pp o -> P o : forall (p : peano) (Pp : is_peano p) (P : ord p -> Type), (forall (n : peano) (Pn : is_peano n) (l : is_leq n p = true), is_eq bool is_bool (is_leq n p) (is_is_leq n Pn p Pp) true is_true l -> P (mkOrd p n l)) -> forall o : ord p, is_ord p Pp o -> P o ord2_induction : forall (p : peano) (Pp : is_peano p) (P : ord2 p -> Type), (forall o1 : ord p, is_ord p Pp o1 -> forall o2 : ord p, is_ord p Pp o2 -> P (mkOrd2 p o1 o2)) -> forall o : ord2 p, is_ord2 p Pp o -> P o : forall (p : peano) (Pp : is_peano p) (P : ord2 p -> Type), (forall o1 : ord p, is_ord p Pp o1 -> forall o2 : ord p, is_ord p Pp o2 -> P (mkOrd2 p o1 o2)) -> forall o : ord2 p, is_ord2 p Pp o -> P o sort (typ «Set») Query assignments: U = «elpi.tests.test_HOAS.89» Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.89} |= Set = elpi.tests.test_HOAS.89 ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.89} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.89 := Set WEAK CONSTRAINTS: Inductive tree@{u} (A : Type@{u}) : Type@{max(Set,u)} := leaf : A -> tree@{u} A | node : A -> list (tree@{u} A) -> tree@{u} A. (* u |= u <= list.u0 *) Arguments tree A%type_scope Arguments leaf A%type_scope _ Arguments node A%type_scope _ _%list_scope parameter A explicit (sort (typ «elpi.tests.test_HOAS.98»)) c0 \ inductive tree tt (arity (sort (typ «elpi.tests.test_HOAS.99»))) c1 \ [constructor leaf (arity (prod `_` c0 c2 \ c1)), constructor node (arity (prod `_` c0 c2 \ prod `_` (app [global (indt «list»), c1]) c3 \ c1))] Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.103 elpi.tests.test_HOAS.102 elpi.tests.test_HOAS.101 elpi.tests.test_HOAS.100 elpi.tests.test_HOAS.99 elpi.tests.test_HOAS.98} |= elpi.tests.test_HOAS.98 < elpi.tests.test_HOAS.100 elpi.tests.test_HOAS.99 < elpi.tests.test_HOAS.101 Set <= elpi.tests.test_HOAS.99 Set <= elpi.tests.test_HOAS.103 elpi.tests.test_HOAS.98 <= list.u0 elpi.tests.test_HOAS.98 <= elpi.tests.test_HOAS.99 elpi.tests.test_HOAS.98 <= elpi.tests.test_HOAS.102 elpi.tests.test_HOAS.98 <= elpi.tests.test_HOAS.103 elpi.tests.test_HOAS.99 <= list.u0 elpi.tests.test_HOAS.99 <= elpi.tests.test_HOAS.102 elpi.tests.test_HOAS.99 <= elpi.tests.test_HOAS.103 elpi.tests.test_HOAS.102 <= elpi.tests.test_HOAS.99 elpi.tests.test_HOAS.103 <= elpi.tests.test_HOAS.99 ALGEBRAIC UNIVERSES: {elpi.tests.test_HOAS.98} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.98 WEAK CONSTRAINTS: Query assignments: D = parameter A explicit (sort (typ «elpi.tests.test_HOAS.98»)) c0 \ inductive tree tt (arity (sort (typ «elpi.tests.test_HOAS.99»))) c1 \ [constructor leaf (arity (prod `_` c0 c2 \ c1)), constructor node (arity (prod `_` c0 c2 \ prod `_` (app [global (indt «list»), c1]) c3 \ c1))] I = «tree» univ_inst_5 = X0 Universe constraints: UNIVERSES: {elpi.tests.test_HOAS.103 elpi.tests.test_HOAS.102 elpi.tests.test_HOAS.101 elpi.tests.test_HOAS.100} |= M.tree.u0 < elpi.tests.test_HOAS.100 M.tree.u1 < elpi.tests.test_HOAS.101 Set <= M.tree.u1 Set <= elpi.tests.test_HOAS.103 M.tree.u0 <= elpi.tests.test_HOAS.102 M.tree.u0 <= elpi.tests.test_HOAS.103 M.tree.u1 <= elpi.tests.test_HOAS.102 M.tree.u1 <= elpi.tests.test_HOAS.103 elpi.tests.test_HOAS.102 <= M.tree.u1 elpi.tests.test_HOAS.103 <= M.tree.u1 ALGEBRAIC UNIVERSES: {M.tree.u0} UNDEFINED UNIVERSES: elpi.tests.test_HOAS.98 WEAK CONSTRAINTS: Query assignments: C1 = «Nat.add» C2 = «times» X1 = tt X2 = ff eq_axiom_tt : eq_axiom_at unit unit_eq tt : eq_axiom_at unit unit_eq tt eq_axiom_Zero : eq_axiom_at peano peano_eq Zero : eq_axiom_at peano peano_eq Zero eq_axiom_Succ : forall y : peano, eq_axiom_at peano peano_eq y -> eq_axiom_at peano peano_eq (Succ y) : forall y : peano, eq_axiom_at peano peano_eq y -> eq_axiom_at peano peano_eq (Succ y) eq_axiom_None : forall (A : Type) (f : eq_test A), eq_axiom_at (option A) (option_eq A f) (None A) : forall (A : Type) (f : eq_test A), eq_axiom_at (option A) (option_eq A f) (None A) eq_axiom_Some : forall (A : Type) (f : eq_test A) (x : A), eq_axiom_at A f x -> eq_axiom_at (option A) (option_eq A f) (Some A x) : forall (A : Type) (f : eq_test A) (x : A), eq_axiom_at A f x -> eq_axiom_at (option A) (option_eq A f) (Some A x) eq_axiom_Comma : forall (A : Type) (f : eq_test A) (B : Type) (g : eq_test B) (x : A), eq_axiom_at A f x -> forall y : B, eq_axiom_at B g y -> eq_axiom_at (pair A B) (pair_eq A f B g) (Comma A B x y) : forall (A : Type) (f : eq_test A) (B : Type) (g : eq_test B) (x : A), eq_axiom_at A f x -> forall y : B, eq_axiom_at B g y -> eq_axiom_at (pair A B) (pair_eq A f B g) (Comma A B x y) eq_axiom_Nil : forall (A : Type) (f : eq_test A), eq_axiom_at (seq A) (seq_eq A f) (Nil A) : forall (A : Type) (f : eq_test A), eq_axiom_at (seq A) (seq_eq A f) (Nil A) eq_axiom_Cons : forall (A : Type) (f : eq_test A) (x : A), eq_axiom_at A f x -> forall xs : seq A, eq_axiom_at (seq A) (seq_eq A f) xs -> eq_axiom_at (seq A) (seq_eq A f) (Cons A x xs) : forall (A : Type) (f : eq_test A) (x : A), eq_axiom_at A f x -> forall xs : seq A, eq_axiom_at (seq A) (seq_eq A f) xs -> eq_axiom_at (seq A) (seq_eq A f) (Cons A x xs) eq_axiom_Leaf : forall (A : Type) (f : eq_test A) (a : A), eq_axiom_at A f a -> eq_axiom_at (rose A) (rose_eq A f) (Leaf A a) : forall (A : Type) (f : eq_test A) (a : A), eq_axiom_at A f a -> eq_axiom_at (rose A) (rose_eq A f) (Leaf A a) eq_axiom_Node : forall (A : Type) (f : eq_test A) (l : seq (rose A)), eq_axiom_at (seq (rose A)) (seq_eq (rose A) (rose_eq A f)) l -> eq_axiom_at (rose A) (rose_eq A f) (Node A l) : forall (A : Type) (f : eq_test A) (l : seq (rose A)), eq_axiom_at (seq (rose A)) (seq_eq (rose A) (rose_eq A f)) l -> eq_axiom_at (rose A) (rose_eq A f) (Node A l) eq_axiom_Envelope : forall (Sender : Type) (f : eq_test Sender) (x : Sender), eq_axiom_at Sender f x -> forall x0 : Sender, eq_axiom_at Sender f x0 -> forall x1 : zeta Sender, eq_axiom_on (zeta Sender) (zeta_eq Sender f) (Envelope Sender x x0) x1 eq_axiom_Redex : forall (A : Type) (f : eq_test A) (x : A), eq_axiom_at A f x -> forall x0 : beta A, eq_axiom_on (beta A) (beta_eq A f) (Redex A x) x0 eq_axiom_PI : forall x : PrimInt63.int, eq_axiom_at PrimInt63.int PrimInt63.eqb x -> forall x0 : prim_int, eq_axiom_on prim_int prim_int_eq (PI x) x0 eq_axiom_PF : forall x : PrimFloat.float, eq_axiom_at PrimFloat.float PrimFloat.eqb x -> forall x0 : prim_float, eq_axiom_on prim_float prim_float_eq (PF x) x0 eq_axiom_Build_fo_record : forall x : peano, eq_axiom_at peano peano_eq x -> forall y : unit, eq_axiom_at unit unit_eq y -> eq_axiom_at fo_record fo_record_eq {| f1 := x; f2 := y |} : forall x : peano, eq_axiom_at peano peano_eq x -> forall y : unit, eq_axiom_at unit unit_eq y -> eq_axiom_at fo_record fo_record_eq {| f1 := x; f2 := y |} eq_axiom_Build_pa_record : forall (A : Type) (f : eq_test A) (x : peano), eq_axiom_at peano peano_eq x -> forall y : A, eq_axiom_at A f y -> eq_axiom_at (pa_record A) (pa_record_eq A f) {| f3 := x; f4 := y |} : forall (A : Type) (f : eq_test A) (x : peano), eq_axiom_at peano peano_eq x -> forall y : A, eq_axiom_at A f y -> eq_axiom_at (pa_record A) (pa_record_eq A f) {| f3 := x; f4 := y |} eq_axiom_Build_pr_record : forall (A : Type) (f : eq_test A) (x : peano), eq_axiom_at peano peano_eq x -> forall y : A, eq_axiom_at A f y -> eq_axiom_at (pr_record A) (pr_record_eq A f) {| pf3 := x; pf4 := y |} : forall (A : Type) (f : eq_test A) (x : peano), eq_axiom_at peano peano_eq x -> forall y : A, eq_axiom_at A f y -> eq_axiom_at (pr_record A) (pr_record_eq A f) {| pf3 := x; pf4 := y |} eq_axiom_E1 : eq_axiom_at enum enum_eq E1 : eq_axiom_at enum enum_eq E1 eq_axiom_E2 : eq_axiom_at enum enum_eq E2 : eq_axiom_at enum enum_eq E2 eq_axiom_E3 : eq_axiom_at enum enum_eq E3 : eq_axiom_at enum enum_eq E3 COQC tests/test_eqcorrect.v Query assignments: C1 = «x» Skipping derivation map on indt «nat» since the user did not select it Skipping derivation lens on indt «nat» since the user did not select it Skipping derivation param1 on indt «nat» since it has been already run Skipping derivation param2 on indt «nat» since the user did not select it Skipping derivation tag on indt «nat» since the user did not select it Skipping derivation eqType_ast on indt «nat» since the user did not select it Skipping derivation projK on indt «nat» since it has been already run Skipping derivation isK on indt «nat» since it has been already run Skipping derivation eq on indt «nat» since it has been already run Skipping derivation invert on indt «nat» since the user did not select it Skipping derivation lens_laws on indt «nat» since the user did not select it Skipping derivation param1_congr on indt «nat» since it has been already run Skipping derivation param1_inhab on indt «nat» since it has been already run Skipping derivation param1_functor on indt «nat» since it has been already run Skipping derivation fields on indt «nat» since the user did not select it Skipping derivation bcongr on indt «nat» since it has been already run Skipping derivation idx2inv on indt «nat» since the user did not select it Skipping derivation param1_trivial on indt «nat» since it has been already run Skipping derivation induction on indt «nat» since it has been already run Skipping derivation eqb on indt «nat» since the user did not select it Skipping derivation eqK on indt «nat» since it has been already run Skipping derivation eqbcorrect on indt «nat» since the user did not select it Skipping derivation eqcorrect on indt «nat» since it has been already run Skipping derivation eqbOK on indt «nat» since the user did not select it Skipping derivation eqOK on indt «nat» since it has been already run Query assignments: C1 = «x» M = «elpi.tests.test_API2.xx» derive.param1_trivial: wrong shape is_t A PA . It does not look like a unary parametricity translation of an inductive with no indexes. Vector.t_eq : (forall A : Type, (A -> A -> bool) -> forall n : nat, Vector.t A n -> Vector.t A n -> bool) : forall A : Type, (A -> A -> bool) -> forall n : nat, Vector.t A n -> Vector.t A n -> bool Vector.t_isk_nil : (forall (A : Type) (n : nat), Vector.t A n -> bool) : forall (A : Type) (n : nat), Vector.t A n -> bool Vector.t_isk_cons : (forall (A : Type) (n : nat), Vector.t A n -> bool) : forall (A : Type) (n : nat), Vector.t A n -> bool Vector.t_map : (forall A B : Type, (A -> B) -> forall n : nat, Vector.t A n -> Vector.t B n) : forall A B : Type, (A -> B) -> forall n : nat, Vector.t A n -> Vector.t B n Vector.t_getk_cons1 : (forall (A : Type) (n : nat), A -> forall m : nat, Vector.t A m -> Vector.t A n -> A) : forall (A : Type) (n : nat), A -> forall m : nat, Vector.t A m -> Vector.t A n -> A Vector.t_getk_cons2 : (forall (A : Type) (n : nat), A -> forall m : nat, Vector.t A m -> Vector.t A n -> nat) : forall (A : Type) (n : nat), A -> forall m : nat, Vector.t A m -> Vector.t A n -> nat Vector.t_getk_cons3 : (forall (A : Type) (n : nat), A -> forall m : nat, Vector.t A m -> Vector.t A n -> {k : nat & Vector.t A k}) : forall (A : Type) (n : nat), A -> forall m : nat, Vector.t A m -> Vector.t A n -> {k : nat & Vector.t A k} Vector.is_t : (forall A : Type, (A -> Type) -> forall n : nat, is_nat n -> Vector.t A n -> Type) : forall A : Type, (A -> Type) -> forall n : nat, is_nat n -> Vector.t A n -> Type Vector.is_nil : (forall (A : Type) (PA : A -> Type), Vector.is_t A PA 0 is_O (Vector.nil A)) : forall (A : Type) (PA : A -> Type), Vector.is_t A PA 0 is_O (Vector.nil A) Vector.is_cons : (forall (A : Type) (PA : A -> Type) (a : A), PA a -> forall (n : nat) (Pn : is_nat n) (H : Vector.t A n), Vector.is_t A PA n Pn H -> Vector.is_t A PA (S n) (is_S n Pn) (Vector.cons A a n H)) : forall (A : Type) (PA : A -> Type) (a : A), PA a -> forall (n : nat) (Pn : is_nat n) (H : Vector.t A n), Vector.is_t A PA n Pn H -> Vector.is_t A PA (S n) (is_S n Pn) (Vector.cons A a n H) Vector.is_t_functor : (forall (A : Type) (PA QA : A -> Type), (forall x : A, PA x -> QA x) -> forall (n : nat) (nR : is_nat n) (v : Vector.t A n), Vector.is_t A PA n nR v -> Vector.is_t A QA n nR v) : forall (A : Type) (PA QA : A -> Type), (forall x : A, PA x -> QA x) -> forall (n : nat) (nR : is_nat n) (v : Vector.t A n), Vector.is_t A PA n nR v -> Vector.is_t A QA n nR v Vector.t_induction : (forall (A : Type) (PA : A -> Type) (P : forall n : nat, is_nat n -> Vector.t A n -> Type), P 0 is_O (Vector.nil A) -> (forall a : A, PA a -> forall (m : nat) (mR : is_nat m) (v : Vector.t A m), P m mR v -> P (S m) (is_S m mR) (Vector.cons A a m v)) -> forall (n : nat) (nR : is_nat n) (v : Vector.t A n), Vector.is_t A PA n nR v -> P n nR v) : forall (A : Type) (PA : A -> Type) (P : forall n : nat, is_nat n -> Vector.t A n -> Type), P 0 is_O (Vector.nil A) -> (forall a : A, PA a -> forall (m : nat) (mR : is_nat m) (v : Vector.t A m), P m mR v -> P (S m) (is_S m mR) (Vector.cons A a m v)) -> forall (n : nat) (nR : is_nat n) (v : Vector.t A n), Vector.is_t A PA n nR v -> P n nR v Vector.t_tag : (forall (A : Type) (i : nat), Vector.t A i -> BinNums.positive) : forall (A : Type) (i : nat), Vector.t A i -> BinNums.positive W_tag : (forall A : Type, W A -> BinNums.positive) : forall A : Type, W A -> BinNums.positive Query assignments: C1 = «x» M = «elpi.tests.test_API2.xx2» Query assignments: C1 = «x» M = «elpi.tests.test_API2.xx3» XXX.rtree_tag : (forall A : Type, rtree A -> BinNums.positive) : forall A : Type, rtree A -> BinNums.positive XXX.rtree_fields_t : Type -> BinNums.positive -> Type : Type -> BinNums.positive -> Type XXX.rtree_fields : (forall (A : Type) (l : rtree A), XXX.rtree_fields_t A (XXX.rtree_tag A l)) : forall (A : Type) (l : rtree A), XXX.rtree_fields_t A (XXX.rtree_tag A l) XXX.rtree_construct : (forall (A : Type) (p : BinNums.positive), XXX.rtree_fields_t A p -> option (rtree A)) : forall (A : Type) (p : BinNums.positive), XXX.rtree_fields_t A p -> option (rtree A) XXX.rtree_constructP : (forall (A : Type) (l : rtree A), XXX.rtree_construct A (XXX.rtree_tag A l) (XXX.rtree_fields A l) = Some l) : forall (A : Type) (l : rtree A), XXX.rtree_construct A (XXX.rtree_tag A l) (XXX.rtree_fields A l) = Some l XXX.rtree_eqb : (forall A : Type, (A -> A -> bool) -> rtree A -> rtree A -> bool) : forall A : Type, (A -> A -> bool) -> rtree A -> rtree A -> bool derive.param1_trivial: wrong shape is_triv . It does not look like a unary parametricity translation of an inductive with no indexes. triv.induction : (forall P : forall H : Coverage.unit, is_unit H -> triv H -> Prop, (forall (t : Coverage.unit) (Pt : is_unit t), P t Pt (one t)) -> (forall (x : Coverage.unit) (Px : is_unit x), P x Px (more x)) -> forall (u : Coverage.unit) (p : is_unit u) (s : triv u), triv.is_triv u p s -> P u p s) : forall P : forall H : Coverage.unit, is_unit H -> triv H -> Prop, (forall (t : Coverage.unit) (Pt : is_unit t), P t Pt (one t)) -> (forall (x : Coverage.unit) (Px : is_unit x), P x Px (more x)) -> forall (u : Coverage.unit) (p : is_unit u) (s : triv u), triv.is_triv u p s -> P u p s empty_eq_correct : correct empty is_empty empty_eq : correct empty is_empty empty_eq unit_eq_correct : correct unit is_unit unit_eq : correct unit is_unit unit_eq peano_eq_correct : correct peano is_peano peano_eq : correct peano is_peano peano_eq option_eq_correct : forall (A : Type) (f : eq_test A), correct (option A) (is_option A (eq_axiom_at A f)) (option_eq A f) : forall (A : Type) (f : eq_test A), correct (option A) (is_option A (eq_axiom_at A f)) (option_eq A f) pair_eq_correct : forall (A : Type) (f : eq_test A) (B : Type) (g : eq_test B), correct (pair A B) (is_pair A (eq_axiom_at A f) B (eq_axiom_at B g)) (pair_eq A f B g) : forall (A : Type) (f : eq_test A) (B : Type) (g : eq_test B), correct (pair A B) (is_pair A (eq_axiom_at A f) B (eq_axiom_at B g)) (pair_eq A f B g) seq_eq_correct : forall (A : Type) (f : eq_test A), correct (seq A) (is_seq A (eq_axiom_at A f)) (seq_eq A f) : forall (A : Type) (f : eq_test A), correct (seq A) (is_seq A (eq_axiom_at A f)) (seq_eq A f) rose_eq_correct : forall (A : Type) (f : eq_test A), correct (rose A) (is_rose A (eq_axiom_at A f)) (rose_eq A f) : forall (A : Type) (f : eq_test A), correct (rose A) (is_rose A (eq_axiom_at A f)) (rose_eq A f) zeta_eq_correct : forall (A : Type) (f : eq_test A), correct (zeta A) (is_zeta A (eq_axiom_at A f)) (zeta_eq A f) : forall (A : Type) (f : eq_test A), correct (zeta A) (is_zeta A (eq_axiom_at A f)) (zeta_eq A f) beta_eq_correct : forall (A : Type) (f : eq_test A), correct (beta A) (is_beta A (eq_axiom_at A f)) (beta_eq A f) : forall (A : Type) (f : eq_test A), correct (beta A) (is_beta A (eq_axiom_at A f)) (beta_eq A f) prim_int_eq_correct : correct prim_int is_prim_int prim_int_eq fo_record_eq_correct : correct fo_record is_fo_record fo_record_eq : correct fo_record is_fo_record fo_record_eq Debug: Cannot enforce elpi.apps.derive.tests.test_derive.4294 <= Set pa_record_eq_correct : forall (A : Type) (f : eq_test A), correct (pa_record A) (is_pa_record A (eq_axiom_at A f)) (pa_record_eq A f) : forall (A : Type) (f : eq_test A), correct (pa_record A) (is_pa_record A (eq_axiom_at A f)) (pa_record_eq A f) pr_record_eq_correct : forall (A : Type) (f : eq_test A), correct (pr_record A) (is_pr_record A (eq_axiom_at A f)) (pr_record_eq A f) : forall (A : Type) (f : eq_test A), correct (pr_record A) (is_pr_record A (eq_axiom_at A f)) (pr_record_eq A f) enum_eq_correct : correct enum is_enum enum_eq : correct enum is_enum enum_eq derive.param1_trivial: wrong shape is_Pred . It does not look like a unary parametricity translation of an inductive with no indexes. Pred.Pred_to_Predinv : (forall T : RoseTree, Pred T -> Pred.Predinv T) : forall T : RoseTree, Pred T -> Pred.Predinv T wimpls.wimpls : forall {A : Type}, rtree A -> Type wimpls.wimpls is not universe polymorphic Arguments wimpls.wimpls {A}%type_scope {rtree0} Expands to: Inductive elpi.apps.derive.tests.test_derive.wimpls.wimpls wimpls.Kwi : forall {A : Type} {rtree0 : rtree A} (x : A), x = x -> wimpls wimpls.Kwi is not universe polymorphic Arguments wimpls.Kwi {A}%type_scope {rtree0} x _ Expands to: Constructor elpi.apps.derive.tests.test_derive.wimpls.Kwi Kwi 3 eq_refl : wimpls where ?rtree0 : [ |- rtree nat] Query assignments: _uvk_1_ = X0 _uvk_2_ = X1 Syntactic constraints: evar (X1) (X2) (X1) /* suspended on X1 */ evar X3 (sort (typ «elpi.tests.test_API2.6»)) (X2) /* suspended on X3, X2 */ evar (X0) (X4) (X0) /* suspended on X0 */ evar X5 (sort (typ «elpi.tests.test_API2.5»)) (X4) /* suspended on X5, X4 */ Universe constraints: UNIVERSES: {elpi.tests.test_API2.6 elpi.tests.test_API2.5} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: Non-discriminated database Unfoldable variable definitions: all Unfoldable constant definitions: all Cut: emp For any goal -> For xeq -> exact xxx(level 0, pattern 0 = _, id 0) Query assignments: type_1 = «elpi.tests.test_API2.7» Universe constraints: UNIVERSES: ALGEBRAIC UNIVERSES: {elpi.tests.test_API2.7} UNDEFINED UNIVERSES: elpi.tests.test_API2.7 WEAK CONSTRAINTS: Query assignments: GR = const const EXN PRINTING: Not_found T = «elpi.tests.test_API2.T» «elpi.tests.test_API2.G» Query assignments: F = «elpi.tests.test_API2.F» G = «elpi.tests.test_API2.G» X = «elpi.tests.test_API2.X» Module G : Sig Definition id : X.T -> X.T. End := (F X) is_empty_trivial : trivial empty is_empty : trivial empty is_empty is_unit_trivial : trivial unit is_unit : trivial unit is_unit is_peano_trivial : trivial peano is_peano : trivial peano is_peano is_option_trivial : forall (A : Type) (P : A -> Type), trivial A P -> trivial (option A) (is_option A P) : forall (A : Type) (P : A -> Type), trivial A P -> trivial (option A) (is_option A P) is_pair_trivial : forall (A : Type) (P : A -> Type), trivial A P -> forall (B : Type) (Q : B -> Type), trivial B Q -> trivial (pair A B) (is_pair A P B Q) : forall (A : Type) (P : A -> Type), trivial A P -> forall (B : Type) (Q : B -> Type), trivial B Q -> trivial (pair A B) (is_pair A P B Q) is_seq_trivial : forall (A : Type) (P : A -> Type), trivial A P -> trivial (seq A) (is_seq A P) : forall (A : Type) (P : A -> Type), trivial A P -> trivial (seq A) (is_seq A P) is_rose_trivial : forall (A : Type) (P : A -> Type), trivial A P -> trivial (rose A) (is_rose A P) : forall (A : Type) (P : A -> Type), trivial A P -> trivial (rose A) (is_rose A P) is_zeta_trivial : forall (A : Type) (P : A -> Type), trivial A P -> trivial (zeta A) (is_zeta A P) : forall (A : Type) (P : A -> Type), trivial A P -> trivial (zeta A) (is_zeta A P) is_beta_trivial : forall (A : Type) (P : A -> Type), trivial A P -> trivial (beta A) (is_beta A P) : forall (A : Type) (P : A -> Type), trivial A P -> trivial (beta A) (is_beta A P) is_large_trivial : trivial large is_large : trivial large is_large is_prim_int_trivial : trivial prim_int is_prim_int : trivial prim_int is_prim_int is_prim_float_trivial : trivial prim_float is_prim_float : trivial prim_float is_prim_float is_fo_record_trivial : trivial fo_record is_fo_record : trivial fo_record is_fo_record is_pa_record_trivial : forall (A : Type) (P : A -> Type), trivial A P -> trivial (pa_record A) (is_pa_record A P) : forall (A : Type) (P : A -> Type), trivial A P -> trivial (pa_record A) (is_pa_record A P) is_pr_record_trivial : forall (A : Type) (P : A -> Type), trivial A P -> trivial (pr_record A) (is_pr_record A P) : forall (A : Type) (P : A -> Type), trivial A P -> trivial (pr_record A) (is_pr_record A P) is_enum_trivial : trivial enum is_enum : trivial enum is_enum is_sigma_bool_trivial : trivial sigma_bool is_sigma_bool : trivial sigma_bool is_sigma_bool is_ord_trivial : forall (p : peano) (px : is_peano p), trivial (ord p) (is_ord p px) : forall (p : peano) (px : is_peano p), trivial (ord p) (is_ord p px) is_ord2_trivial : forall (p : peano) (px : is_peano p), trivial (ord2 p) (is_ord2 p px) : forall (p : peano) (px : is_peano p), trivial (ord2 p) (is_ord2 p px) is_val_trivial : trivial val is_val : trivial val is_val is_empty_inhab : full empty is_empty : full empty is_empty is_unit_inhab : full unit is_unit : full unit is_unit is_peano_inhab : full peano is_peano : full peano is_peano is_option_inhab : forall (A : Type) (P : A -> Type), full A P -> full (option A) (is_option A P) : forall (A : Type) (P : A -> Type), full A P -> full (option A) (is_option A P) is_pair_inhab : forall (A : Type) (P : A -> Type), full A P -> forall (B : Type) (Q : B -> Type), full B Q -> full (pair A B) (is_pair A P B Q) : forall (A : Type) (P : A -> Type), full A P -> forall (B : Type) (Q : B -> Type), full B Q -> full (pair A B) (is_pair A P B Q) is_seq_inhab : forall (A : Type) (P : A -> Type), full A P -> full (seq A) (is_seq A P) : forall (A : Type) (P : A -> Type), full A P -> full (seq A) (is_seq A P) is_rose_inhab : forall (A : Type) (P : A -> Type), full A P -> full (rose A) (is_rose A P) : forall (A : Type) (P : A -> Type), full A P -> full (rose A) (is_rose A P) is_zeta_inhab : forall (A : Type) (P : A -> Type), full A P -> full (zeta A) (is_zeta A P) : forall (A : Type) (P : A -> Type), full A P -> full (zeta A) (is_zeta A P) is_beta_inhab : forall (A : Type) (P : A -> Type), full A P -> full (beta A) (is_beta A P) : forall (A : Type) (P : A -> Type), full A P -> full (beta A) (is_beta A P) is_large_inhab : full large is_large : full large is_large is_prim_int_inhab : full prim_int is_prim_int : full prim_int is_prim_int is_prim_float_inhab : full prim_float is_prim_float : full prim_float is_prim_float is_fo_record_inhab : full fo_record is_fo_record : full fo_record is_fo_record is_pa_record_inhab : forall (A : Type) (P : A -> Type), full A P -> full (pa_record A) (is_pa_record A P) : forall (A : Type) (P : A -> Type), full A P -> full (pa_record A) (is_pa_record A P) is_pr_record_inhab : forall (A : Type) (P : A -> Type), full A P -> full (pr_record A) (is_pr_record A P) : forall (A : Type) (P : A -> Type), full A P -> full (pr_record A) (is_pr_record A P) is_enum_inhab : full enum is_enum : full enum is_enum is_sigma_bool_inhab : full sigma_bool is_sigma_bool : full sigma_bool is_sigma_bool is_ord_inhab : forall (p : peano) (px : is_peano p), full (ord p) (is_ord p px) : forall (p : peano) (px : is_peano p), full (ord p) (is_ord p px) is_ord2_inhab : forall (p : peano) (px : is_peano p), full (ord2 p) (is_ord2 p px) : forall (p : peano) (px : is_peano p), full (ord2 p) (is_ord2 p px) is_val_inhab : full val is_val : full val is_val COQC tests/test_eqOK.v COQC tests/test_eqbcorrect.v «elpi.tests.test_API2.H» Query assignments: F = «elpi.tests.test_API2.F» H = «elpi.tests.test_API2.H» X = «elpi.tests.test_API2.X» Module H : Sig Definition id : nat -> nat. End := (F X) Query assignments: GR = const const EXN PRINTING: Not_found T = «elpi.tests.test_API2.T» Module Type FT = Funsig (P:T) Sig Parameter idT : P.T -> P.T. End «elpi.tests.test_API2.GT» Query assignments: F = «elpi.tests.test_API2.FT» G = «elpi.tests.test_API2.GT» X = «elpi.tests.test_API2.X» Module Type GT = Sig Parameter idT : X.T -> X.T. End «elpi.tests.test_API2.HT» Query assignments: F = «elpi.tests.test_API2.FT» H = «elpi.tests.test_API2.HT» X = «elpi.tests.test_API2.X» Module Type HT = Sig Parameter idT : nat -> nat. End empty_eq_OK : ok empty empty_eq : ok empty empty_eq unit_eq_OK : ok unit unit_eq : ok unit unit_eq peano_eq_OK : ok peano peano_eq : ok peano peano_eq option_eq_OK : forall (A : Type) (f : A -> A -> bool), ok A f -> ok (option A) (option_eq A f) : forall (A : Type) (f : A -> A -> bool), ok A f -> ok (option A) (option_eq A f) pair_eq_OK : forall (A : Type) (f : A -> A -> bool), ok A f -> forall (B : Type) (g : B -> B -> bool), ok B g -> ok (pair A B) (pair_eq A f B g) : forall (A : Type) (f : A -> A -> bool), ok A f -> forall (B : Type) (g : B -> B -> bool), ok B g -> ok (pair A B) (pair_eq A f B g) seq_eq_OK : forall (A : Type) (f : A -> A -> bool), ok A f -> ok (seq A) (seq_eq A f) : forall (A : Type) (f : A -> A -> bool), ok A f -> ok (seq A) (seq_eq A f) rose_eq_OK : forall (A : Type) (f : A -> A -> bool), ok A f -> ok (rose A) (rose_eq A f) : forall (A : Type) (f : A -> A -> bool), ok A f -> ok (rose A) (rose_eq A f) zeta_eq_OK : forall (A : Type) (f : A -> A -> bool), ok A f -> ok (zeta A) (zeta_eq A f) : forall (A : Type) (f : A -> A -> bool), ok A f -> ok (zeta A) (zeta_eq A f) beta_eq_OK : forall (A : Type) (f : A -> A -> bool), ok A f -> ok (beta A) (beta_eq A f) : forall (A : Type) (f : A -> A -> bool), ok A f -> ok (beta A) (beta_eq A f) prim_int_eq_OK : ok prim_int prim_int_eq fo_record_eq_OK : ok fo_record fo_record_eq : ok fo_record fo_record_eq pa_record_eq_OK : forall (A : Type) (f : A -> A -> bool), ok A f -> ok (pa_record A) (pa_record_eq A f) : forall (A : Type) (f : A -> A -> bool), ok A f -> ok (pa_record A) (pa_record_eq A f) pr_record_eq_OK : forall (A : Type) (f : A -> A -> bool), ok A f -> ok (pr_record A) (pr_record_eq A f) : forall (A : Type) (f : A -> A -> bool), ok A f -> ok (pr_record A) (pr_record_eq A f) enum_eq_OK : ok enum enum_eq : ok enum enum_eq Query assignments: L = [«elpi.tests.test_API2.8», «elpi.tests.test_API2.9»] S = {{ elpi.tests.test_API2.8; elpi.tests.test_API2.9; }} U = «elpi.tests.test_API2.8» UV = «elpi.tests.test_API2.8» V = «elpi.tests.test_API2.9» VV = «elpi.tests.test_API2.9» Universe constraints: UNIVERSES: {elpi.tests.test_API2.9 elpi.tests.test_API2.8} |= ALGEBRAIC UNIVERSES: {elpi.tests.test_API2.9 elpi.tests.test_API2.8} UNDEFINED UNIVERSES: elpi.tests.test_API2.9 elpi.tests.test_API2.8 WEAK CONSTRAINTS: COQC tests/test_require_bad_order.v dlist_eqOK : forall (A : Type) (f : A -> A -> bool), ok A f -> ok (dlist A) (dlist_eq A f) : forall (A : Type) (f : A -> A -> bool), ok A f -> ok (dlist A) (dlist_eq A f) File "./tests/test_require_bad_order.v", line 2, characters 0-28: Warning: Option Foo Bar is deprecated [deprecated-option,deprecated] Finished transaction in 53.441 secs (29.119u,0.055s) (successful) Finished transaction in 0.541 secs (0.507u,0.s) (successful) peano_eqb_correct : (forall n m : peano, peano_eqb n m = true -> n = m) : forall n m : peano, peano_eqb n m = true -> n = m peano_eqb_refl : (forall n : peano, peano_eqb n n = true) : forall n : peano, peano_eqb n n = true ord_eqb_correct : (forall n : peano, eqb_correct (ord_eqb n n)) : forall n : peano, eqb_correct (ord_eqb n n) ord_eqb_refl : (forall n : peano, eqb_reflexive (ord_eqb n n)) : forall n : peano, eqb_reflexive (ord_eqb n n) ord2_eqb_correct : (forall n : peano, eqb_correct (ord2_eqb n n)) : forall n : peano, eqb_correct (ord2_eqb n n) ord2_eqb_refl : (forall n : peano, eqb_reflexive (ord2_eqb n n)) : forall n : peano, eqb_reflexive (ord2_eqb n n) val_eqb_correct : eqb_correct val_eqb : eqb_correct val_eqb val_eqb_refl : eqb_reflexive val_eqb : eqb_reflexive val_eqb alias_eqb_correct : eqb_correct alias_eqb : eqb_correct alias_eqb alias_eqb_refl : eqb_reflexive alias_eqb : eqb_reflexive alias_eqb COQC tests/test_eqbOK.v peano_eqb_OK : forall n m : peano, Bool.reflect (n = m) (peano_eqb n m) : forall n m : peano, Bool.reflect (n = m) (peano_eqb n m) seq_eqb_OK : forall (A : Type) (eqA : eq_test2 A A), (forall a1 a2 : A, Bool.reflect (a1 = a2) (eqA a1 a2)) -> forall l1 l2 : seq A, Bool.reflect (l1 = l2) (seq_eqb A eqA l1 l2) : forall (A : Type) (eqA : eq_test2 A A), (forall a1 a2 : A, Bool.reflect (a1 = a2) (eqA a1 a2)) -> forall l1 l2 : seq A, Bool.reflect (l1 = l2) (seq_eqb A eqA l1 l2) ord_eqb_OK : forall (n : peano) (o1 o2 : ord n), Bool.reflect (o1 = o2) (ord_eqb n n o1 o2) : forall (n : peano) (o1 o2 : ord n), Bool.reflect (o1 = o2) (ord_eqb n n o1 o2) alias_eqb_OK : forall x y : alias, Bool.reflect (x = y) (alias_eqb x y) : forall x y : alias, Bool.reflect (x = y) (alias_eqb x y) make[2]: Leaving directory '/build/coq-elpi-1.16.0/apps/derive' make[2]: Entering directory '/build/coq-elpi-1.16.0/apps/eltac' Using coq found in /usr/bin/, from COQBIN or PATH Warning: ../../theories (used in -R or -Q) is not a subdirectory of the current directory COQDEP VFILES COQC tests/test_assumption.v COQC tests/test_constructor.v COQC tests/test_intro.v COQC tests/test_clear.v COQC tests/test_fail.v COQC tests/test_discriminate.v COQC tests/test_injection.v COQC tests/test_case.v COQC tests/test_generalize.v COQC tests/test_cycle.v COQC examples/usage_eltac.v trying i = i d : nat trying elpi_ctx_entry_2_ = elpi_ctx_entry_2_ trying elpi_ctx_entry_1_ = elpi_ctx_entry_1_ /\ p0 = p0 trying elpi_ctx_entry_1_ = elpi_ctx_entry_1_ /\ p0 = p0 make[2]: Leaving directory '/build/coq-elpi-1.16.0/apps/eltac' make[2]: Entering directory '/build/coq-elpi-1.16.0/apps/NES' Using coq found in /usr/bin/, from COQBIN or PATH Warning: ../../theories (used in -R or -Q) is not a subdirectory of the current directory COQDEP VFILES COQC tests/test_NES.v COQC tests/test_NES_perf.v COQC tests/test_NES_perf_optimal.v COQC examples/usage_NES.v Foo.x = 3 : nat Foo.x = 3 : nat Foo.x2 = 4 : nat eq_refl : Foo.x = 5 : Foo.x = 5 A.B.c : nat A.B.c is not universe polymorphic A.B.c is transparent Expands to: Constant elpi.apps.NES.tests.test_NES.A_aux_4.A.B.c This.Is.A.Long.Namespace.stuff = 1 : nat = 1 : nat This.Is.A.Long.Namespace.stuff = 2 : nat = 1 : nat A1.B1.d : nat A1.B1.d is not universe polymorphic A1.B1.d is transparent Expands to: Constant elpi.apps.NES.tests.test_NES.A1_aux_6.A1.B1.d A1.B1.c : nat A1.B1.c is not universe polymorphic A1.B1.c is transparent Expands to: Constant elpi.apps.NES.tests.test_NES.A1_aux_5.A1.B1.c stuff = 2 : nat x = 5 : nat x2 = 4 : nat B1.c = 1 : nat B1.d = 1 : nat default nat_def : nat : nat d = 1 : nat A2.B2.f = 2 : nat make[2]: Leaving directory '/build/coq-elpi-1.16.0/apps/NES' make[2]: Entering directory '/build/coq-elpi-1.16.0/apps/locker' Using coq found in /usr/bin/, from COQBIN or PATH Warning: ../../theories (used in -R or -Q) is not a subdirectory of the current directory COQDEP VFILES COQC tests/test_locker.v Module d3 : d3_Locked := Struct Definition body : nat. Parameter unlock : d3 = 3. End Module Type d3_Locked = Sig Parameter body : nat. Parameter unlock : body = 3. End cons2 : forall {A : Type}, A -> list A -> list A cons2 is not universe polymorphic Arguments cons2 {A}%type_scope x xs%list_scope cons2 is transparent Expands to: Constant elpi.apps.locker.tests.test_locker.Bug_286.cons2 cons3 : forall [A : Type], EqDecision A -> A -> list A -> list A cons3 is not universe polymorphic Arguments cons3 [A]%type_scope {H} x xs%list_scope cons3 is transparent Expands to: Constant elpi.apps.locker.tests.test_locker.Bug_286.cons3 id1@{u} : forall T : Type@{u}, T -> T (* u |= u < locked_with.u0 *) id1 is universe polymorphic Arguments id1 T%type_scope x id1 is transparent Expands to: Constant elpi.apps.locker.tests.test_locker.id1 Query assignments: GR = const «id1» id2.body@{u} : forall T : Type@{u}, T -> T (* u |= u < eq.u0 *) id2.body is universe polymorphic Arguments id2.body T%type_scope x Expands to: Constant elpi.apps.locker.tests.test_locker.id2.body Query assignments: GR = const «id2.body» up1.body@{u} : forall T : Type@{u}, T -> T (* u |= u < eq.u0 *) up1.body is universe polymorphic Arguments up1.body T%type_scope x Expands to: Constant elpi.apps.locker.tests.test_locker.up1.body Query assignments: GR = const «up1.body» nup1.body : forall T : Type@{nup1.body.u0}, T -> T nup1.body is not universe polymorphic Arguments nup1.body T%type_scope x Expands to: Constant elpi.apps.locker.tests.test_locker.nup1.body Query assignments: GR = const «nup1.body» up2.body@{u u0} : forall T : Type@{u}, Type@{u0} -> T -> T (* u u0 |= u < eq.u0 u0 < eq.u0 *) up2.body is universe polymorphic Arguments up2.body (T W)%type_scope x Expands to: Constant elpi.apps.locker.tests.test_locker.up2.body Query assignments: GR = const «up2.body» make[2]: Leaving directory '/build/coq-elpi-1.16.0/apps/locker' make[1]: Leaving directory '/build/coq-elpi-1.16.0' create-stamp debian/debhelper-build-stamp dh_prep dh_auto_install --destdir=debian/libcoq-elpi/ make -j15 install DESTDIR=/build/coq-elpi-1.16.0/debian/libcoq-elpi AM_UPDATE_INFO_DIR=no "INSTALL=install --strip-program=true" make[1]: Entering directory '/build/coq-elpi-1.16.0' Using coq found in /usr/bin, from COQBIN or PATH ########################## installing plugin ############################ make[2]: Entering directory '/build/coq-elpi-1.16.0' make[2]: /usr/lib/ocaml/coq: Permission denied make[2]: /usr/lib/ocaml/coq: Permission denied make[2]: /usr/lib/ocaml/coq: Permission denied make[2]: /usr/lib/ocaml/coq: Permission denied make[2]: /usr/lib/ocaml/coq: Permission denied make[2]: /usr/lib/ocaml/coq: Permission denied INSTALL theories/elpi.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/ INSTALL theories/elpi.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/ INSTALL theories/elpi.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/ INSTALL src/elpi_plugin.cmxs /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/ INSTALL src/elpi_plugin.cmxs /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/ ocamlfind: [WARNING] No such file: /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/META Installed /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/elpi_plugin.cmx Installed /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/elpi_plugin.cmxa Installed /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/elpi_plugin.cmxs ocamlfind: [WARNING] Overwriting file /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/elpi_plugin.cmxs Installed /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/elpi_plugin.cmxs Installed /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/elpi_plugin.cmi Installed /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/META make[3]: Entering directory '/build/coq-elpi-1.16.0' df="`"/usr/bin///coq_makefile" -destination-of theories/elpi.vo -I src -Q examples elpi.examples -Q tests elpi.tests -Q src elpi -Q apps/derive/tests elpi.apps.derive.tests -Q tests elpi.tests -Q elpi elpi -R theories elpi -R apps/derive/theories elpi.apps -R apps/derive/tests elpi.apps.derive.tests -R apps/derive/examples elpi.apps.derive.examples -R apps/NES/theories elpi.apps -R apps/NES/tests elpi.apps.NES.tests -R apps/NES/examples elpi.apps.NES.examples -R apps/eltac/theories elpi.apps.eltac -R apps/eltac/tests elpi.apps.eltac.tests -R apps/eltac/examples elpi.apps.eltac.examples`";\ install -m 0644 elpi-builtin.elpi "/build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/$df";\ install -m 0644 coq-builtin.elpi "/build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/$df";\ install -m 0644 elpi/coq-lib.elpi "/build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/$df";\ install -m 0644 elpi/elpi_elaborator.elpi "/build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/$df" make[3]: Leaving directory '/build/coq-elpi-1.16.0' make[2]: Leaving directory '/build/coq-elpi-1.16.0' make[2]: Entering directory '/build/coq-elpi-1.16.0' Installed /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/elpi_plugin.cmo Installed /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/elpi_plugin.cma make[2]: Leaving directory '/build/coq-elpi-1.16.0' mkdir -p /build/coq-elpi-1.16.0/debian/libcoq-elpi/usr/share/coq cp etc/coq-elpi.lang /build/coq-elpi-1.16.0/debian/libcoq-elpi/usr/share/coq/ ########################## installing APPS ############################ make[2]: Entering directory '/build/coq-elpi-1.16.0/apps/derive' Using coq found in /usr/bin/, from COQBIN or PATH make[3]: Entering directory '/build/coq-elpi-1.16.0/apps/derive' make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied INSTALL theories/derive.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ INSTALL theories/derive/std.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/legacy.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/experimental.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/bcongr.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/cast.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eq.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqcorrect.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqK.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqOK.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/map.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/isK.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/idx2inv.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/invert.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/projK.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_functor.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_congr.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_trivial.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param2.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/induction.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/lens.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/lens_laws.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqb_core_defs.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/tag.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/fields.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqb.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqbcorrect.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqbOK.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqType_ast.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ INSTALL theories/derive/std.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/legacy.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/experimental.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/bcongr.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/cast.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eq.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqcorrect.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqK.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqOK.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/map.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/isK.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/idx2inv.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/invert.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/projK.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_functor.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_congr.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_trivial.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param2.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/induction.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/lens.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/lens_laws.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqb_core_defs.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/tag.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/fields.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqb.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqbcorrect.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqbOK.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqType_ast.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ INSTALL theories/derive/std.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/legacy.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/experimental.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/bcongr.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/cast.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eq.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqcorrect.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqK.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqOK.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/map.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/isK.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/idx2inv.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/invert.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/projK.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_functor.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_congr.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_trivial.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param2.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/induction.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/lens.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/lens_laws.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqb_core_defs.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/tag.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/fields.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqb.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqbcorrect.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqbOK.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqType_ast.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive make[4]: Entering directory '/build/coq-elpi-1.16.0/apps/derive' df="`"/usr/bin////coq_makefile" -destination-of theories/derive/std.vo -I ../../src -Q ../../theories elpi -Q elpi elpi.apps.derive -R theories elpi.apps -R tests elpi.apps.derive.tests -R examples elpi.apps.derive.examples`";\ install -m 0644 elpi/bcongr.elpi elpi/cast.elpi elpi/derive.elpi elpi/derive_hook.elpi elpi/discriminate.elpi elpi/eq.elpi elpi/eqK.elpi elpi/eqOK.elpi elpi/eqType.elpi elpi/eqb.elpi elpi/eqbOK.elpi elpi/eqbcorrect.elpi elpi/eqcorrect.elpi elpi/fields.elpi elpi/idx2inv.elpi elpi/induction.elpi elpi/injection.elpi elpi/invert.elpi elpi/isK.elpi elpi/lens.elpi elpi/lens_laws.elpi elpi/map.elpi elpi/param1.elpi elpi/param1_congr.elpi elpi/param1_functor.elpi elpi/param1_inhab.elpi elpi/param1_trivial.elpi elpi/param2.elpi elpi/paramX_lib.elpi elpi/projK.elpi elpi/tag.elpi "/build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/$df" make[4]: Leaving directory '/build/coq-elpi-1.16.0/apps/derive' make[3]: Leaving directory '/build/coq-elpi-1.16.0/apps/derive' make[2]: Leaving directory '/build/coq-elpi-1.16.0/apps/derive' make[2]: Entering directory '/build/coq-elpi-1.16.0/apps/eltac' Using coq found in /usr/bin/, from COQBIN or PATH make[3]: Entering directory '/build/coq-elpi-1.16.0/apps/eltac' make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied INSTALL theories/assumption.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/constructor.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/intro.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/clear.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/fail.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/discriminate.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/injection.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/case.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/generalize.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/cycle.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/tactics.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/assumption.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/constructor.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/intro.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/clear.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/fail.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/discriminate.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/injection.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/case.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/generalize.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/cycle.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/tactics.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/assumption.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/constructor.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/intro.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/clear.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/fail.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/discriminate.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/injection.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/case.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/generalize.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/cycle.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/tactics.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ make[4]: Entering directory '/build/coq-elpi-1.16.0/apps/eltac' make[4]: Leaving directory '/build/coq-elpi-1.16.0/apps/eltac' make[3]: Leaving directory '/build/coq-elpi-1.16.0/apps/eltac' make[2]: Leaving directory '/build/coq-elpi-1.16.0/apps/eltac' make[2]: Entering directory '/build/coq-elpi-1.16.0/apps/NES' Using coq found in /usr/bin/, from COQBIN or PATH make[3]: Entering directory '/build/coq-elpi-1.16.0/apps/NES' make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied INSTALL theories/NES.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ INSTALL theories/NES.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ INSTALL theories/NES.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ make[4]: Entering directory '/build/coq-elpi-1.16.0/apps/NES' make[4]: Leaving directory '/build/coq-elpi-1.16.0/apps/NES' make[3]: Leaving directory '/build/coq-elpi-1.16.0/apps/NES' make[2]: Leaving directory '/build/coq-elpi-1.16.0/apps/NES' make[2]: Entering directory '/build/coq-elpi-1.16.0/apps/locker' Using coq found in /usr/bin/, from COQBIN or PATH make[3]: Entering directory '/build/coq-elpi-1.16.0/apps/locker' make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied make[3]: /usr/lib/ocaml/coq: Permission denied INSTALL theories/locker.vo /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ INSTALL theories/locker.v /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ INSTALL theories/locker.glob /build/coq-elpi-1.16.0/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ make[4]: Entering directory '/build/coq-elpi-1.16.0/apps/locker' make[4]: Leaving directory '/build/coq-elpi-1.16.0/apps/locker' make[3]: Leaving directory '/build/coq-elpi-1.16.0/apps/locker' make[2]: Leaving directory '/build/coq-elpi-1.16.0/apps/locker' #@echo "########################## installing doc ############################" #-mkdir -p /build/coq-elpi-1.16.0/debian/libcoq-elpi/usr/lib/ocaml/coq/../../share/doc/coq-elpi #-cp doc/* /build/coq-elpi-1.16.0/debian/libcoq-elpi/usr/lib/ocaml/coq/../../share/doc/coq-elpi ########################## installed ############################ make[1]: Leaving directory '/build/coq-elpi-1.16.0' dh_ocamldoc dh_installdocs dh_installchangelogs dh_installexamples dh_perl dh_link dh_strip_nondeterminism dh_compress dh_fixperms dh_missing dh_strip -a dh_makeshlibs -a dh_shlibdeps -a dh_installdeb debian/rules override_dh_ocaml make[1]: Entering directory '/build/coq-elpi-1.16.0' dh_ocaml --nodefined-map=libcoq-elpi-ocaml-dev:Elpi_parser,Elpi_util,Elpi_parser__Ast,Elpi__Runtime,Elpi__,Elpi_util__Util,Elpi__Builtin_checker,Elpi__Builtin,Elpi__Ptmap,Elpi_parser__Grammar,Elpi__Data,Elpi_lexer_config,Elpi__API,Elpi_parser__Parse,Elpi__Builtin_set,Trace_ppx_runtime,Elpi_parser__Parser_config,Elpi_parser__Error_messages,Elpi_parser__Lexer,Elpi,Elpi_exer_config__Tokens,Elpi_Builtin_stdlib,Elpi__Legacy_parser_proxy,Elpi__Builtin_map,Elpi_lexer_config__Tokens,Elpi__Compiler,Trace_ppx_runtime__Runtime,Elpi_lexer_config__Lexer_config,Elpi__Builtin_stdlib,Elpi__Runtime_trace_off,MenhirLib,Ppx_deriving_runtime,Re__Perl,Re__Core,Re__Pcre,Re_str,Re__Automata,Re__Emacs,Re,Re__Fmt,Re__Group,Re__,Re__Glob,Re__Pmark,Re__Category,Re__Str,Re__Posix,Re__Color_map,Re__Cset,Result make[1]: Leaving directory '/build/coq-elpi-1.16.0' dh_coq dh_gencontrol dh_md5sums dh_builddeb dpkg-deb: building package 'libcoq-elpi' in '../libcoq-elpi_1.16.0-2_amd64.deb'. dpkg-deb: building package 'libcoq-elpi-dbgsym' in '../libcoq-elpi-dbgsym_1.16.0-2_amd64.deb'. dpkg-genbuildinfo --build=binary -O../coq-elpi_1.16.0-2_amd64.buildinfo dpkg-genchanges --build=binary -O../coq-elpi_1.16.0-2_amd64.changes dpkg-genchanges: info: binary-only upload (no source code included) dpkg-source --after-build . dpkg-buildpackage: info: binary-only upload (no source included) dpkg-genchanges: info: not including original source code in upload I: copying local configuration I: user script /srv/workspace/pbuilder/3117304/tmp/hooks/B01_cleanup starting I: user script /srv/workspace/pbuilder/3117304/tmp/hooks/B01_cleanup finished 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/3117304 and its subdirectories I: Current time: Wed Jun 7 19:22:57 +14 2023 I: pbuilder-time-stamp: 1686115377