https://launchpad.net/ubuntu/+source/coq-elpi/1.16.0-1build1/+build/24874149 RUN: /usr/share/launchpad-buildd/bin/builder-prep Kernel version: Linux bos02-ppc64el-013 5.4.0-132-generic #148-Ubuntu SMP Mon Oct 17 16:02:37 UTC 2022 ppc64le Buildd toolchain package versions: launchpad-buildd_223~593~ubuntu20.04.1 python3-lpbuildd_223~593~ubuntu20.04.1 sbuild_0.79.0-1ubuntu1 git-build-recipe_0.3.6 git_1:2.25.1-1ubuntu3.6 dpkg-dev_1.19.7ubuntu3.2 python3-debian_0.1.36ubuntu1. Syncing the system clock with the buildd NTP service... 27 Nov 08:01:41 ntpdate[1910]: adjust time server 10.211.37.1 offset 0.000241 sec RUN: /usr/share/launchpad-buildd/bin/in-target unpack-chroot --backend=chroot --series=lunar --arch=ppc64el PACKAGEBUILD-24874149 --image-type chroot /home/buildd/filecache-default/85c27e6382232f1ea76df327de0d2159dac326be Creating target for build PACKAGEBUILD-24874149 RUN: /usr/share/launchpad-buildd/bin/in-target mount-chroot --backend=chroot --series=lunar --arch=ppc64el PACKAGEBUILD-24874149 Starting target for build PACKAGEBUILD-24874149 RUN: /usr/share/launchpad-buildd/bin/in-target override-sources-list --backend=chroot --series=lunar --arch=ppc64el PACKAGEBUILD-24874149 'deb http://ftpmaster.internal/ubuntu lunar main universe' 'deb http://ftpmaster.internal/ubuntu lunar-security main universe' 'deb http://ftpmaster.internal/ubuntu lunar-updates main universe' 'deb http://ftpmaster.internal/ubuntu lunar-proposed main universe' Overriding sources.list in build-PACKAGEBUILD-24874149 RUN: /usr/share/launchpad-buildd/bin/in-target update-debian-chroot --backend=chroot --series=lunar --arch=ppc64el PACKAGEBUILD-24874149 Updating target for build PACKAGEBUILD-24874149 Get:1 http://ftpmaster.internal/ubuntu lunar InRelease [251 kB] Get:2 http://ftpmaster.internal/ubuntu lunar-security InRelease [74.9 kB] Get:3 http://ftpmaster.internal/ubuntu lunar-updates InRelease [74.9 kB] Get:4 http://ftpmaster.internal/ubuntu lunar-proposed InRelease [102 kB] Get:5 http://ftpmaster.internal/ubuntu lunar/main ppc64el Packages [1338 kB] Get:6 http://ftpmaster.internal/ubuntu lunar/main Translation-en [510 kB] Get:7 http://ftpmaster.internal/ubuntu lunar/universe ppc64el Packages [13.8 MB] Get:8 http://ftpmaster.internal/ubuntu lunar/universe Translation-en [5840 kB] Get:9 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el Packages [309 kB] Get:10 http://ftpmaster.internal/ubuntu lunar-proposed/main Translation-en [123 kB] Get:11 http://ftpmaster.internal/ubuntu lunar-proposed/universe ppc64el Packages [1720 kB] Get:12 http://ftpmaster.internal/ubuntu lunar-proposed/universe Translation-en [702 kB] Fetched 24.9 MB in 5s (5346 kB/s) Reading package lists... Reading package lists... Building dependency tree... Reading state information... Calculating upgrade... The following packages were automatically installed and are no longer required: libperl5.34 perl-modules-5.34 Use 'sudo apt autoremove' to remove them. The following NEW packages will be installed: libperl5.36 perl-modules-5.36 The following packages will be upgraded: advancecomp apt binutils binutils-common binutils-powerpc64le-linux-gnu debianutils e2fsprogs fakeroot gpg gpg-agent gpgconf gpgv grep init init-system-helpers libapparmor1 libapt-pkg6.0 libassuan0 libaudit-common libaudit1 libbinutils libcap-ng0 libcom-err2 libcrypt-dev libcrypt1 libcryptsetup12 libctf-nobfd0 libctf0 libext2fs2 libfakeroot libffi8 libgpg-error0 libgssapi-krb5-2 libip4tc2 libjson-c5 libk5crypto3 libkrb5-3 libkrb5support0 liblz4-1 liblzma5 libpam-modules libpam-modules-bin libpam-runtime libpam0g libpng16-16 libreadline8 libseccomp2 libselinux1 libsqlite3-0 libss2 libssl3 linux-libc-dev login logsave openssl passwd perl perl-base pinentry-curses readline-common tar usrmerge xz-utils zlib1g 64 upgraded, 2 newly installed, 0 to remove and 0 not upgraded. Need to get 28.8 MB of archives. After this operation, 49.2 MB of additional disk space will be used. Get:1 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el debianutils ppc64el 5.7-0.4 [103 kB] Get:2 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el grep ppc64el 3.8-3 [170 kB] Get:3 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el login ppc64el 1:4.13+dfsg1-1ubuntu1 [201 kB] Get:4 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el perl-modules-5.36 all 5.36.0-4ubuntu2 [2984 kB] Get:5 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libperl5.36 ppc64el 5.36.0-4ubuntu2 [4854 kB] Get:6 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el perl ppc64el 5.36.0-4ubuntu2 [235 kB] Get:7 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el perl-base ppc64el 5.36.0-4ubuntu2 [1855 kB] Get:8 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libcrypt-dev ppc64el 1:4.4.33-1 [143 kB] Get:9 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libcrypt1 ppc64el 1:4.4.33-1 [106 kB] Get:10 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el zlib1g ppc64el 1:1.2.13.dfsg-1ubuntu2 [70.0 kB] Get:11 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el tar ppc64el 1.34+dfsg-1.1 [353 kB] Get:12 http://ftpmaster.internal/ubuntu lunar/main ppc64el usrmerge all 33ubuntu1 [57.0 kB] Get:13 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el init-system-helpers all 1.65.2 [38.1 kB] Get:14 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el liblz4-1 ppc64el 1.9.4-1 [104 kB] Get:15 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el liblzma5 ppc64el 5.2.8-0.0 [126 kB] Get:16 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libapt-pkg6.0 ppc64el 2.5.4 [1017 kB] Get:17 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libgpg-error0 ppc64el 1.46-1 [85.1 kB] Get:18 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el gpgv ppc64el 2.2.40-1ubuntu1 [171 kB] Get:19 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libseccomp2 ppc64el 2.5.4-1ubuntu2 [58.7 kB] Get:20 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el apt ppc64el 2.5.4 [1417 kB] Get:21 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libaudit-common all 1:3.0.7-1ubuntu2 [5018 B] Get:22 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libcap-ng0 ppc64el 0.8.3-1build1 [16.0 kB] Get:23 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libaudit1 ppc64el 1:3.0.7-1ubuntu2 [50.7 kB] Get:24 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libpam0g ppc64el 1.5.2-5ubuntu1 [67.7 kB] Get:25 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libselinux1 ppc64el 3.4-1build1 [96.4 kB] Get:26 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libpam-modules-bin ppc64el 1.5.2-5ubuntu1 [50.1 kB] Get:27 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libpam-modules ppc64el 1.5.2-5ubuntu1 [321 kB] Get:28 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el logsave ppc64el 1.46.6~rc1-1ubuntu1 [11.2 kB] Get:29 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libext2fs2 ppc64el 1.46.6~rc1-1ubuntu1 [249 kB] Get:30 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el e2fsprogs ppc64el 1.46.6~rc1-1ubuntu1 [647 kB] Get:31 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el init ppc64el 1.65.2 [4812 B] Get:32 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libpam-runtime all 1.5.2-5ubuntu1 [40.0 kB] Get:33 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el passwd ppc64el 1:4.13+dfsg1-1ubuntu1 [871 kB] Get:34 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libffi8 ppc64el 3.4.4-1 [27.8 kB] Get:35 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libcom-err2 ppc64el 1.46.6~rc1-1ubuntu1 [10.0 kB] Get:36 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libss2 ppc64el 1.46.6~rc1-1ubuntu1 [13.2 kB] Get:37 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libapparmor1 ppc64el 3.0.7-1ubuntu4 [41.2 kB] Get:38 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libjson-c5 ppc64el 0.16-2 [38.3 kB] Get:39 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libssl3 ppc64el 3.0.5-2ubuntu2 [2127 kB] Get:40 http://ftpmaster.internal/ubuntu lunar/main ppc64el libcryptsetup12 ppc64el 2:2.5.0-6ubuntu1 [317 kB] Get:41 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libgssapi-krb5-2 ppc64el 1.20.1-1 [182 kB] Get:42 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libkrb5-3 ppc64el 1.20.1-1 [425 kB] Get:43 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libkrb5support0 ppc64el 1.20.1-1 [36.0 kB] Get:44 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libk5crypto3 ppc64el 1.20.1-1 [106 kB] Get:45 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libip4tc2 ppc64el 1.8.7-1ubuntu7 [23.0 kB] Get:46 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el readline-common all 8.2-1.2 [55.2 kB] Get:47 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libreadline8 ppc64el 8.2-1.2 [174 kB] Get:48 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libsqlite3-0 ppc64el 3.40.0-1 [749 kB] Get:49 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el openssl ppc64el 3.0.5-2ubuntu2 [1194 kB] Get:50 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libpng16-16 ppc64el 1.6.39-1 [237 kB] Get:51 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el xz-utils ppc64el 5.2.8-0.0 [149 kB] Get:52 http://ftpmaster.internal/ubuntu lunar/main ppc64el advancecomp ppc64el 2.4-1 [235 kB] Get:53 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libctf-nobfd0 ppc64el 2.39-8ubuntu2 [109 kB] Get:54 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libctf0 ppc64el 2.39-8ubuntu2 [109 kB] Get:55 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el binutils-powerpc64le-linux-gnu ppc64el 2.39-8ubuntu2 [2426 kB] Get:56 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libbinutils ppc64el 2.39-8ubuntu2 [676 kB] Get:57 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el binutils ppc64el 2.39-8ubuntu2 [3110 B] Get:58 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el binutils-common ppc64el 2.39-8ubuntu2 [223 kB] Get:59 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libfakeroot ppc64el 1.30.1-1ubuntu1 [32.9 kB] Get:60 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el fakeroot ppc64el 1.30.1-1ubuntu1 [62.1 kB] Get:61 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libassuan0 ppc64el 2.5.5-5 [41.3 kB] Get:62 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el pinentry-curses ppc64el 1.2.1-1ubuntu1 [38.1 kB] Get:63 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el gpg ppc64el 2.2.40-1ubuntu1 [646 kB] Get:64 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el gpgconf ppc64el 2.2.40-1ubuntu1 [104 kB] Get:65 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el gpg-agent ppc64el 2.2.40-1ubuntu1 [253 kB] Get:66 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el linux-libc-dev ppc64el 5.19.0-23.24 [1335 kB] debconf: delaying package configuration, since apt-utils is not installed Fetched 28.8 MB in 2s (12.5 MB/s) (Reading database ... 13494 files and directories currently installed.) Preparing to unpack .../debianutils_5.7-0.4_ppc64el.deb ... Unpacking debianutils (5.7-0.4) over (5.7-0.3) ... Setting up debianutils (5.7-0.4) ... (Reading database ... 13494 files and directories currently installed.) Preparing to unpack .../grep_3.8-3_ppc64el.deb ... Unpacking grep (3.8-3) over (3.7-1build1) ... Setting up grep (3.8-3) ... (Reading database ... 13494 files and directories currently installed.) Preparing to unpack .../login_1%3a4.13+dfsg1-1ubuntu1_ppc64el.deb ... Unpacking login (1:4.13+dfsg1-1ubuntu1) over (1:4.11.1+dfsg1-2ubuntu1) ... Setting up login (1:4.13+dfsg1-1ubuntu1) ... (Reading database ... 13502 files and directories currently installed.) Preparing to unpack .../perl_5.36.0-4ubuntu2_ppc64el.deb ... Unpacking perl (5.36.0-4ubuntu2) over (5.34.0-5ubuntu1) ... Selecting previously unselected package perl-modules-5.36. Preparing to unpack .../perl-modules-5.36_5.36.0-4ubuntu2_all.deb ... Unpacking perl-modules-5.36 (5.36.0-4ubuntu2) ... Selecting previously unselected package libperl5.36:ppc64el. Preparing to unpack .../libperl5.36_5.36.0-4ubuntu2_ppc64el.deb ... Unpacking libperl5.36:ppc64el (5.36.0-4ubuntu2) ... Preparing to unpack .../perl-base_5.36.0-4ubuntu2_ppc64el.deb ... Unpacking perl-base (5.36.0-4ubuntu2) over (5.34.0-5ubuntu1) ... Setting up perl-base (5.36.0-4ubuntu2) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../libcrypt-dev_1%3a4.4.33-1_ppc64el.deb ... Unpacking libcrypt-dev:ppc64el (1:4.4.33-1) over (1:4.4.28-2) ... Preparing to unpack .../libcrypt1_1%3a4.4.33-1_ppc64el.deb ... Unpacking libcrypt1:ppc64el (1:4.4.33-1) over (1:4.4.28-2) ... Setting up libcrypt1:ppc64el (1:4.4.33-1) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../zlib1g_1%3a1.2.13.dfsg-1ubuntu2_ppc64el.deb ... Unpacking zlib1g:ppc64el (1:1.2.13.dfsg-1ubuntu2) over (1:1.2.11.dfsg-4.1ubuntu1) ... Setting up zlib1g:ppc64el (1:1.2.13.dfsg-1ubuntu2) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../tar_1.34+dfsg-1.1_ppc64el.deb ... Unpacking tar (1.34+dfsg-1.1) over (1.34+dfsg-1build3) ... Setting up tar (1.34+dfsg-1.1) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../usrmerge_33ubuntu1_all.deb ... Unpacking usrmerge (33ubuntu1) over (29ubuntu2) ... Setting up usrmerge (33ubuntu1) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../init-system-helpers_1.65.2_all.deb ... Unpacking init-system-helpers (1.65.2) over (1.64) ... Setting up init-system-helpers (1.65.2) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../liblz4-1_1.9.4-1_ppc64el.deb ... Unpacking liblz4-1:ppc64el (1.9.4-1) over (1.9.3-2build2) ... Setting up liblz4-1:ppc64el (1.9.4-1) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../liblzma5_5.2.8-0.0_ppc64el.deb ... Unpacking liblzma5:ppc64el (5.2.8-0.0) over (5.2.5-2.1) ... Setting up liblzma5:ppc64el (5.2.8-0.0) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../libapt-pkg6.0_2.5.4_ppc64el.deb ... Unpacking libapt-pkg6.0:ppc64el (2.5.4) over (2.5.3) ... Setting up libapt-pkg6.0:ppc64el (2.5.4) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../libgpg-error0_1.46-1_ppc64el.deb ... Unpacking libgpg-error0:ppc64el (1.46-1) over (1.45-2) ... Setting up libgpg-error0:ppc64el (1.46-1) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../gpgv_2.2.40-1ubuntu1_ppc64el.deb ... Unpacking gpgv (2.2.40-1ubuntu1) over (2.2.35-3ubuntu1) ... Setting up gpgv (2.2.40-1ubuntu1) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../libseccomp2_2.5.4-1ubuntu2_ppc64el.deb ... Unpacking libseccomp2:ppc64el (2.5.4-1ubuntu2) over (2.5.4-1ubuntu1) ... Setting up libseccomp2:ppc64el (2.5.4-1ubuntu2) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../archives/apt_2.5.4_ppc64el.deb ... Unpacking apt (2.5.4) over (2.5.3) ... Setting up apt (2.5.4) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../libaudit-common_1%3a3.0.7-1ubuntu2_all.deb ... Unpacking libaudit-common (1:3.0.7-1ubuntu2) over (1:3.0.7-1ubuntu1) ... Setting up libaudit-common (1:3.0.7-1ubuntu2) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../libcap-ng0_0.8.3-1build1_ppc64el.deb ... Unpacking libcap-ng0:ppc64el (0.8.3-1build1) over (0.8.3-1) ... Setting up libcap-ng0:ppc64el (0.8.3-1build1) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../libaudit1_1%3a3.0.7-1ubuntu2_ppc64el.deb ... Unpacking libaudit1:ppc64el (1:3.0.7-1ubuntu2) over (1:3.0.7-1ubuntu1) ... Setting up libaudit1:ppc64el (1:3.0.7-1ubuntu2) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../libpam0g_1.5.2-5ubuntu1_ppc64el.deb ... Unpacking libpam0g:ppc64el (1.5.2-5ubuntu1) over (1.5.2-2ubuntu1) ... Setting up libpam0g:ppc64el (1.5.2-5ubuntu1) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../libselinux1_3.4-1build1_ppc64el.deb ... Unpacking libselinux1:ppc64el (3.4-1build1) over (3.4-1) ... Setting up libselinux1:ppc64el (3.4-1build1) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../libpam-modules-bin_1.5.2-5ubuntu1_ppc64el.deb ... Unpacking libpam-modules-bin (1.5.2-5ubuntu1) over (1.5.2-2ubuntu1) ... Replacing files in old package libpam-modules:ppc64el (1.5.2-2ubuntu1) ... Setting up libpam-modules-bin (1.5.2-5ubuntu1) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../libpam-modules_1.5.2-5ubuntu1_ppc64el.deb ... Unpacking libpam-modules:ppc64el (1.5.2-5ubuntu1) over (1.5.2-2ubuntu1) ... Setting up libpam-modules:ppc64el (1.5.2-5ubuntu1) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../logsave_1.46.6~rc1-1ubuntu1_ppc64el.deb ... Unpacking logsave (1.46.6~rc1-1ubuntu1) over (1.46.5-2ubuntu2) ... Preparing to unpack .../libext2fs2_1.46.6~rc1-1ubuntu1_ppc64el.deb ... Unpacking libext2fs2:ppc64el (1.46.6~rc1-1ubuntu1) over (1.46.5-2ubuntu2) ... Setting up libext2fs2:ppc64el (1.46.6~rc1-1ubuntu1) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../e2fsprogs_1.46.6~rc1-1ubuntu1_ppc64el.deb ... Unpacking e2fsprogs (1.46.6~rc1-1ubuntu1) over (1.46.5-2ubuntu2) ... Preparing to unpack .../init_1.65.2_ppc64el.deb ... Unpacking init (1.65.2) over (1.64) ... Preparing to unpack .../libpam-runtime_1.5.2-5ubuntu1_all.deb ... Unpacking libpam-runtime (1.5.2-5ubuntu1) over (1.5.2-2ubuntu1) ... Setting up libpam-runtime (1.5.2-5ubuntu1) ... (Reading database ... 15428 files and directories currently installed.) Preparing to unpack .../passwd_1%3a4.13+dfsg1-1ubuntu1_ppc64el.deb ... Unpacking passwd (1:4.13+dfsg1-1ubuntu1) over (1:4.11.1+dfsg1-2ubuntu1) ... Setting up passwd (1:4.13+dfsg1-1ubuntu1) ... (Reading database ... 15455 files and directories currently installed.) Preparing to unpack .../libffi8_3.4.4-1_ppc64el.deb ... Unpacking libffi8:ppc64el (3.4.4-1) over (3.4.2-4) ... Setting up libffi8:ppc64el (3.4.4-1) ... (Reading database ... 15455 files and directories currently installed.) Preparing to unpack .../00-libcom-err2_1.46.6~rc1-1ubuntu1_ppc64el.deb ... Unpacking libcom-err2:ppc64el (1.46.6~rc1-1ubuntu1) over (1.46.5-2ubuntu2) ... Preparing to unpack .../01-libss2_1.46.6~rc1-1ubuntu1_ppc64el.deb ... Unpacking libss2:ppc64el (1.46.6~rc1-1ubuntu1) over (1.46.5-2ubuntu2) ... Preparing to unpack .../02-libapparmor1_3.0.7-1ubuntu4_ppc64el.deb ... Unpacking libapparmor1:ppc64el (3.0.7-1ubuntu4) over (3.0.7-1ubuntu2) ... Preparing to unpack .../03-libjson-c5_0.16-2_ppc64el.deb ... Unpacking libjson-c5:ppc64el (0.16-2) over (0.16-1) ... Preparing to unpack .../04-libssl3_3.0.5-2ubuntu2_ppc64el.deb ... Unpacking libssl3:ppc64el (3.0.5-2ubuntu2) over (3.0.5-2ubuntu1) ... Preparing to unpack .../05-libcryptsetup12_2%3a2.5.0-6ubuntu1_ppc64el.deb ... Unpacking libcryptsetup12:ppc64el (2:2.5.0-6ubuntu1) over (2:2.5.0-2ubuntu1) ... Preparing to unpack .../06-libgssapi-krb5-2_1.20.1-1_ppc64el.deb ... Unpacking libgssapi-krb5-2:ppc64el (1.20.1-1) over (1.20-1) ... Preparing to unpack .../07-libkrb5-3_1.20.1-1_ppc64el.deb ... Unpacking libkrb5-3:ppc64el (1.20.1-1) over (1.20-1) ... Preparing to unpack .../08-libkrb5support0_1.20.1-1_ppc64el.deb ... Unpacking libkrb5support0:ppc64el (1.20.1-1) over (1.20-1) ... Preparing to unpack .../09-libk5crypto3_1.20.1-1_ppc64el.deb ... Unpacking libk5crypto3:ppc64el (1.20.1-1) over (1.20-1) ... Preparing to unpack .../10-libip4tc2_1.8.7-1ubuntu7_ppc64el.deb ... Unpacking libip4tc2:ppc64el (1.8.7-1ubuntu7) over (1.8.7-1ubuntu6) ... Preparing to unpack .../11-readline-common_8.2-1.2_all.deb ... Unpacking readline-common (8.2-1.2) over (8.2-1) ... Preparing to unpack .../12-libreadline8_8.2-1.2_ppc64el.deb ... Unpacking libreadline8:ppc64el (8.2-1.2) over (8.2-1) ... Preparing to unpack .../13-libsqlite3-0_3.40.0-1_ppc64el.deb ... Unpacking libsqlite3-0:ppc64el (3.40.0-1) over (3.39.3-1) ... Preparing to unpack .../14-openssl_3.0.5-2ubuntu2_ppc64el.deb ... Unpacking openssl (3.0.5-2ubuntu2) over (3.0.5-2ubuntu1) ... Preparing to unpack .../15-libpng16-16_1.6.39-1_ppc64el.deb ... Unpacking libpng16-16:ppc64el (1.6.39-1) over (1.6.38-2) ... Preparing to unpack .../16-xz-utils_5.2.8-0.0_ppc64el.deb ... Unpacking xz-utils (5.2.8-0.0) over (5.2.5-2.1) ... Preparing to unpack .../17-advancecomp_2.4-1_ppc64el.deb ... Unpacking advancecomp (2.4-1) over (2.3-1) ... Preparing to unpack .../18-libctf-nobfd0_2.39-8ubuntu2_ppc64el.deb ... Unpacking libctf-nobfd0:ppc64el (2.39-8ubuntu2) over (2.39-3ubuntu1) ... Preparing to unpack .../19-libctf0_2.39-8ubuntu2_ppc64el.deb ... Unpacking libctf0:ppc64el (2.39-8ubuntu2) over (2.39-3ubuntu1) ... Preparing to unpack .../20-binutils-powerpc64le-linux-gnu_2.39-8ubuntu2_ppc64el.deb ... Unpacking binutils-powerpc64le-linux-gnu (2.39-8ubuntu2) over (2.39-3ubuntu1) ... Preparing to unpack .../21-libbinutils_2.39-8ubuntu2_ppc64el.deb ... Unpacking libbinutils:ppc64el (2.39-8ubuntu2) over (2.39-3ubuntu1) ... Preparing to unpack .../22-binutils_2.39-8ubuntu2_ppc64el.deb ... Unpacking binutils (2.39-8ubuntu2) over (2.39-3ubuntu1) ... Preparing to unpack .../23-binutils-common_2.39-8ubuntu2_ppc64el.deb ... Unpacking binutils-common:ppc64el (2.39-8ubuntu2) over (2.39-3ubuntu1) ... Preparing to unpack .../24-libfakeroot_1.30.1-1ubuntu1_ppc64el.deb ... Unpacking libfakeroot:ppc64el (1.30.1-1ubuntu1) over (1.29-1ubuntu1) ... Preparing to unpack .../25-fakeroot_1.30.1-1ubuntu1_ppc64el.deb ... Unpacking fakeroot (1.30.1-1ubuntu1) over (1.29-1ubuntu1) ... Preparing to unpack .../26-libassuan0_2.5.5-5_ppc64el.deb ... Unpacking libassuan0:ppc64el (2.5.5-5) over (2.5.5-4) ... Preparing to unpack .../27-pinentry-curses_1.2.1-1ubuntu1_ppc64el.deb ... Unpacking pinentry-curses (1.2.1-1ubuntu1) over (1.2.0-2ubuntu1) ... Preparing to unpack .../28-gpg_2.2.40-1ubuntu1_ppc64el.deb ... Unpacking gpg (2.2.40-1ubuntu1) over (2.2.35-3ubuntu1) ... Preparing to unpack .../29-gpgconf_2.2.40-1ubuntu1_ppc64el.deb ... Unpacking gpgconf (2.2.40-1ubuntu1) over (2.2.35-3ubuntu1) ... Preparing to unpack .../30-gpg-agent_2.2.40-1ubuntu1_ppc64el.deb ... Unpacking gpg-agent (2.2.40-1ubuntu1) over (2.2.35-3ubuntu1) ... Preparing to unpack .../31-linux-libc-dev_5.19.0-23.24_ppc64el.deb ... Unpacking linux-libc-dev:ppc64el (5.19.0-23.24) over (5.19.0-21.21) ... Setting up libip4tc2:ppc64el (1.8.7-1ubuntu7) ... Setting up libapparmor1:ppc64el (3.0.7-1ubuntu4) ... Setting up init (1.65.2) ... Setting up libsqlite3-0:ppc64el (3.40.0-1) ... Setting up binutils-common:ppc64el (2.39-8ubuntu2) ... Setting up libssl3:ppc64el (3.0.5-2ubuntu2) ... Setting up linux-libc-dev:ppc64el (5.19.0-23.24) ... Setting up libctf-nobfd0:ppc64el (2.39-8ubuntu2) ... Setting up libcom-err2:ppc64el (1.46.6~rc1-1ubuntu1) ... Setting up libassuan0:ppc64el (2.5.5-5) ... Setting up libfakeroot:ppc64el (1.30.1-1ubuntu1) ... Setting up libkrb5support0:ppc64el (1.20.1-1) ... Setting up fakeroot (1.30.1-1ubuntu1) ... Setting up perl-modules-5.36 (5.36.0-4ubuntu2) ... Setting up xz-utils (5.2.8-0.0) ... Setting up libpng16-16:ppc64el (1.6.39-1) ... Setting up libss2:ppc64el (1.46.6~rc1-1ubuntu1) ... Setting up libk5crypto3:ppc64el (1.20.1-1) ... Setting up logsave (1.46.6~rc1-1ubuntu1) ... Setting up advancecomp (2.4-1) ... Setting up libcrypt-dev:ppc64el (1:4.4.33-1) ... Setting up libkrb5-3:ppc64el (1.20.1-1) ... Setting up libbinutils:ppc64el (2.39-8ubuntu2) ... Setting up openssl (3.0.5-2ubuntu2) ... Setting up libjson-c5:ppc64el (0.16-2) ... Setting up readline-common (8.2-1.2) ... Setting up libperl5.36:ppc64el (5.36.0-4ubuntu2) ... Setting up libctf0:ppc64el (2.39-8ubuntu2) ... Setting up pinentry-curses (1.2.1-1ubuntu1) ... Setting up libreadline8:ppc64el (8.2-1.2) ... Setting up e2fsprogs (1.46.6~rc1-1ubuntu1) ... Setting up perl (5.36.0-4ubuntu2) ... Setting up libgssapi-krb5-2:ppc64el (1.20.1-1) ... Setting up gpgconf (2.2.40-1ubuntu1) ... Setting up libcryptsetup12:ppc64el (2:2.5.0-6ubuntu1) ... Setting up binutils-powerpc64le-linux-gnu (2.39-8ubuntu2) ... Setting up gpg (2.2.40-1ubuntu1) ... Setting up gpg-agent (2.2.40-1ubuntu1) ... Setting up binutils (2.39-8ubuntu2) ... Processing triggers for libc-bin (2.36-0ubuntu4) ... RUN: /usr/share/launchpad-buildd/bin/sbuild-package PACKAGEBUILD-24874149 ppc64el lunar-proposed -c chroot:build-PACKAGEBUILD-24874149 --arch=ppc64el --dist=lunar-proposed --nolog coq-elpi_1.16.0-1build1.dsc Initiating build PACKAGEBUILD-24874149 with 4 jobs across 4 processor cores. Kernel reported to sbuild: 5.4.0-132-generic #148-Ubuntu SMP Mon Oct 17 16:02:37 UTC 2022 ppc64le sbuild (Debian sbuild) 0.79.0 (05 February 2020) on bos02-ppc64el-013.buildd +==============================================================================+ | coq-elpi 1.16.0-1build1 (ppc64el) Sun, 27 Nov 2022 08:02:05 +0000 | +==============================================================================+ Package: coq-elpi Version: 1.16.0-1build1 Source Version: 1.16.0-1build1 Distribution: lunar-proposed Machine Architecture: ppc64el Host Architecture: ppc64el Build Architecture: ppc64el Build Type: any I: NOTICE: Log filtering will replace 'home/buildd/build-PACKAGEBUILD-24874149/chroot-autobuild' with '<>' I: NOTICE: Log filtering will replace 'build/coq-elpi-QIMHUC/resolver-QhmPB4' with '<>' +------------------------------------------------------------------------------+ | Fetch source files | +------------------------------------------------------------------------------+ Local sources ------------- coq-elpi_1.16.0-1build1.dsc exists in .; copying to chroot I: NOTICE: Log filtering will replace 'build/coq-elpi-QIMHUC/coq-elpi-1.16.0' with '<>' I: NOTICE: Log filtering will replace 'build/coq-elpi-QIMHUC' with '<>' +------------------------------------------------------------------------------+ | Install package build dependencies | +------------------------------------------------------------------------------+ Setup apt archive ----------------- Merged Build-Depends: coq, debhelper-compat (= 13), dh-coq, dh-ocaml, libcoq-ocaml-dev (>= 8.15), libcoq-stdlib, libelpi-ocaml-dev, build-essential, fakeroot Filtered Build-Depends: coq, debhelper-compat (= 13), dh-coq, dh-ocaml, libcoq-ocaml-dev (>= 8.15), libcoq-stdlib, libelpi-ocaml-dev, build-essential, fakeroot dpkg-deb: building package 'sbuild-build-depends-main-dummy' in '/<>/apt_archive/sbuild-build-depends-main-dummy.deb'. Ign:1 copy:/<>/apt_archive ./ InRelease Get:2 copy:/<>/apt_archive ./ Release [957 B] Ign:3 copy:/<>/apt_archive ./ Release.gpg Get:4 copy:/<>/apt_archive ./ Sources [413 B] Get:5 copy:/<>/apt_archive ./ Packages [496 B] Fetched 1866 B in 0s (178 kB/s) Reading package lists... Reading package lists... Install main build dependencies (apt-based resolver) ---------------------------------------------------- Installing build dependencies Reading package lists... Building dependency tree... Reading state information... The following packages were automatically installed and are no longer required: libperl5.34 perl-modules-5.34 Use 'apt autoremove' to remove them. The following additional packages will be installed: autoconf automake autopoint autotools-dev bsdextrautils coq debhelper debugedit dh-autoreconf dh-coq dh-ocaml dh-strip-nondeterminism dwz file gettext gettext-base groff-base intltool-debian libarchive-zip-perl libcoq-core-ocaml libcoq-core-ocaml-dev libcoq-stdlib libdebhelper-perl libdw1 libelf1 libelpi-ocaml libelpi-ocaml-dev libexpat1 libfile-stripnondeterminism-perl libfindlib-ocaml libfindlib-ocaml-dev libgmp-dev libgmp3-dev libgmpxx4ldbl libicu71 libmagic-mgc libmagic1 libmenhir-ocaml-dev libmpdec3 libncurses-dev libncurses5-dev libocaml-compiler-libs-ocaml-dev libpipeline1 libppx-derivers-ocaml-dev libppx-deriving-ocaml libppx-deriving-ocaml-dev libppxlib-ocaml-dev libpython3-stdlib libpython3.10-minimal libpython3.10-stdlib libre-ocaml-dev libresult-ocaml libresult-ocaml-dev libsexplib0-ocaml libsexplib0-ocaml-dev libsub-override-perl libtool libuchardet0 libxml2 libzarith-ocaml libzarith-ocaml-dev m4 man-db media-types ocaml ocaml-base ocaml-compiler-libs ocaml-findlib ocaml-interp ocaml-nox po-debconf python3 python3-minimal python3.10 python3.10-minimal Suggested packages: autoconf-archive gnu-standards autoconf-doc coqide | proofgeneral ledit | readline-editor why coq-doc dh-make git gettext-doc libasprintf-dev libgettextpo-dev groff gmp-doc libgmp10-doc libmpfr-dev ncurses-doc libtool-doc gfortran | fortran95-compiler gcj-jdk m4-doc apparmor less www-browser ocaml-doc elpa-tuareg camlp4 libmail-box-perl python3-doc python3-tk python3-venv python3.10-venv python3.10-doc binfmt-support Recommended packages: curl | wget | lynx libarchive-cpio-perl libltdl-dev ocaml-man ledit | readline-editor libmail-sendmail-perl The following NEW packages will be installed: autoconf automake autopoint autotools-dev bsdextrautils coq debhelper debugedit dh-autoreconf dh-coq dh-ocaml dh-strip-nondeterminism dwz file gettext gettext-base groff-base intltool-debian libarchive-zip-perl libcoq-core-ocaml libcoq-core-ocaml-dev libcoq-stdlib libdebhelper-perl libdw1 libelf1 libelpi-ocaml libelpi-ocaml-dev libexpat1 libfile-stripnondeterminism-perl libfindlib-ocaml libfindlib-ocaml-dev libgmp-dev libgmp3-dev libgmpxx4ldbl libicu71 libmagic-mgc libmagic1 libmenhir-ocaml-dev libmpdec3 libncurses-dev libncurses5-dev libocaml-compiler-libs-ocaml-dev libpipeline1 libppx-derivers-ocaml-dev libppx-deriving-ocaml libppx-deriving-ocaml-dev libppxlib-ocaml-dev libpython3-stdlib libpython3.10-minimal libpython3.10-stdlib libre-ocaml-dev libresult-ocaml libresult-ocaml-dev libsexplib0-ocaml libsexplib0-ocaml-dev libsub-override-perl libtool libuchardet0 libxml2 libzarith-ocaml libzarith-ocaml-dev m4 man-db media-types ocaml ocaml-base ocaml-compiler-libs ocaml-findlib ocaml-interp ocaml-nox po-debconf python3 python3-minimal python3.10 python3.10-minimal sbuild-build-depends-main-dummy 0 upgraded, 76 newly installed, 0 to remove and 0 not upgraded. Need to get 421 MB of archives. After this operation, 1570 MB of additional disk space will be used. Get:1 copy:/<>/apt_archive ./ sbuild-build-depends-main-dummy 0.invalid.0 [712 B] Get:2 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libpython3.10-minimal ppc64el 3.10.8-3 [803 kB] Get:3 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libexpat1 ppc64el 2.5.0-1 [95.3 kB] Get:4 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el python3.10-minimal ppc64el 3.10.8-3 [2210 kB] Get:5 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el python3-minimal ppc64el 3.10.6-1ubuntu1 [24.1 kB] Get:6 http://ftpmaster.internal/ubuntu lunar/main ppc64el media-types all 8.0.0 [24.9 kB] Get:7 http://ftpmaster.internal/ubuntu lunar/main ppc64el libmpdec3 ppc64el 2.5.1-2build2 [116 kB] Get:8 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libpython3.10-stdlib ppc64el 3.10.8-3 [1799 kB] Get:9 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el python3.10 ppc64el 3.10.8-3 [499 kB] Get:10 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libpython3-stdlib ppc64el 3.10.6-1ubuntu1 [6878 B] Get:11 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el python3 ppc64el 3.10.6-1ubuntu1 [22.3 kB] Get:12 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libelf1 ppc64el 0.188-1 [61.0 kB] Get:13 http://ftpmaster.internal/ubuntu lunar/main ppc64el libicu71 ppc64el 71.1-3ubuntu1 [10.9 MB] Get:14 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libxml2 ppc64el 2.9.14+dfsg-1.1 [820 kB] Get:15 http://ftpmaster.internal/ubuntu lunar/main ppc64el bsdextrautils ppc64el 2.38-4ubuntu1 [77.3 kB] Get:16 http://ftpmaster.internal/ubuntu lunar/main ppc64el libmagic-mgc ppc64el 1:5.41-4 [257 kB] Get:17 http://ftpmaster.internal/ubuntu lunar/main ppc64el libmagic1 ppc64el 1:5.41-4 [103 kB] Get:18 http://ftpmaster.internal/ubuntu lunar/main ppc64el file ppc64el 1:5.41-4 [22.6 kB] Get:19 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el gettext-base ppc64el 0.21-10 [41.8 kB] Get:20 http://ftpmaster.internal/ubuntu lunar/main ppc64el libuchardet0 ppc64el 0.0.7-1build2 [80.4 kB] Get:21 http://ftpmaster.internal/ubuntu lunar/main ppc64el groff-base ppc64el 1.22.4-9 [1004 kB] Get:22 http://ftpmaster.internal/ubuntu lunar/main ppc64el libpipeline1 ppc64el 1.5.7-1 [25.8 kB] Get:23 http://ftpmaster.internal/ubuntu lunar/main ppc64el man-db ppc64el 2.11.1-1 [1257 kB] Get:24 http://ftpmaster.internal/ubuntu lunar/main ppc64el m4 ppc64el 1.4.19-1 [275 kB] Get:25 http://ftpmaster.internal/ubuntu lunar/main ppc64el autoconf all 2.71-2 [338 kB] Get:26 http://ftpmaster.internal/ubuntu lunar/main ppc64el autotools-dev all 20220109.1 [44.9 kB] Get:27 http://ftpmaster.internal/ubuntu lunar/main ppc64el automake all 1:1.16.5-1.3 [558 kB] Get:28 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el autopoint all 0.21-10 [421 kB] Get:29 http://ftpmaster.internal/ubuntu lunar-proposed/universe ppc64el libcoq-stdlib ppc64el 8.16.0+dfsg-1build1 [24.5 MB] Get:30 http://ftpmaster.internal/ubuntu lunar/universe ppc64el ocaml-base ppc64el 4.13.1-3ubuntu1 [657 kB] Get:31 http://ftpmaster.internal/ubuntu lunar/universe ppc64el libfindlib-ocaml ppc64el 1.9.3-1 [201 kB] Get:32 http://ftpmaster.internal/ubuntu lunar/universe ppc64el libzarith-ocaml ppc64el 1.12-1build1 [69.8 kB] Get:33 http://ftpmaster.internal/ubuntu lunar-proposed/universe ppc64el libcoq-core-ocaml ppc64el 8.16.0+dfsg-1build1 [27.3 MB] Get:34 http://ftpmaster.internal/ubuntu lunar/universe ppc64el ocaml-compiler-libs ppc64el 4.13.1-3ubuntu1 [36.0 MB] Get:35 http://ftpmaster.internal/ubuntu lunar/universe ppc64el ocaml-interp ppc64el 4.13.1-3ubuntu1 [7486 kB] Get:36 http://ftpmaster.internal/ubuntu lunar/main ppc64el libncurses-dev ppc64el 6.3+20220423-2 [479 kB] Get:37 http://ftpmaster.internal/ubuntu lunar/main ppc64el libncurses5-dev ppc64el 6.3+20220423-2 [794 B] Get:38 http://ftpmaster.internal/ubuntu lunar/universe ppc64el ocaml ppc64el 4.13.1-3ubuntu1 [89.4 MB] Get:39 http://ftpmaster.internal/ubuntu lunar/universe ppc64el ocaml-nox all 4.13.1-3ubuntu1 [3082 B] Get:40 http://ftpmaster.internal/ubuntu lunar/universe ppc64el ocaml-findlib ppc64el 1.9.3-1 [598 kB] Get:41 http://ftpmaster.internal/ubuntu lunar-proposed/universe ppc64el coq ppc64el 8.16.0+dfsg-1build1 [113 MB] Get:42 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libdebhelper-perl all 13.10.1ubuntu1 [67.1 kB] Get:43 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libtool all 2.4.7-5 [166 kB] Get:44 http://ftpmaster.internal/ubuntu lunar/main ppc64el dh-autoreconf all 20 [16.1 kB] Get:45 http://ftpmaster.internal/ubuntu lunar/main ppc64el libarchive-zip-perl all 1.68-1 [90.2 kB] Get:46 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libsub-override-perl all 0.09-4 [8706 B] Get:47 http://ftpmaster.internal/ubuntu lunar/main ppc64el libfile-stripnondeterminism-perl all 1.13.0-1 [18.1 kB] Get:48 http://ftpmaster.internal/ubuntu lunar/main ppc64el dh-strip-nondeterminism all 1.13.0-1 [5344 B] Get:49 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el libdw1 ppc64el 0.188-1 [282 kB] Get:50 http://ftpmaster.internal/ubuntu lunar/main ppc64el debugedit ppc64el 1:5.0-5 [51.1 kB] Get:51 http://ftpmaster.internal/ubuntu lunar/main ppc64el dwz ppc64el 0.14+20220924-2 [139 kB] Get:52 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el gettext ppc64el 0.21-10 [971 kB] Get:53 http://ftpmaster.internal/ubuntu lunar/main ppc64el intltool-debian all 0.35.0+20060710.6 [23.2 kB] Get:54 http://ftpmaster.internal/ubuntu lunar/main ppc64el po-debconf all 1.0.21+nmu1 [233 kB] Get:55 http://ftpmaster.internal/ubuntu lunar-proposed/main ppc64el debhelper all 13.10.1ubuntu1 [924 kB] Get:56 http://ftpmaster.internal/ubuntu lunar/universe ppc64el dh-coq all 0.5 [7382 B] Get:57 http://ftpmaster.internal/ubuntu lunar/universe ppc64el libfindlib-ocaml-dev ppc64el 1.9.3-1 [184 kB] Get:58 http://ftpmaster.internal/ubuntu lunar/main ppc64el libgmpxx4ldbl ppc64el 2:6.2.1+dfsg1-1ubuntu2 [10.3 kB] Get:59 http://ftpmaster.internal/ubuntu lunar/main ppc64el libgmp-dev ppc64el 2:6.2.1+dfsg1-1ubuntu2 [359 kB] Get:60 http://ftpmaster.internal/ubuntu lunar/main ppc64el libgmp3-dev ppc64el 2:6.2.1+dfsg1-1ubuntu2 [2304 B] Get:61 http://ftpmaster.internal/ubuntu lunar/universe ppc64el libzarith-ocaml-dev ppc64el 1.12-1build1 [115 kB] Get:62 http://ftpmaster.internal/ubuntu lunar-proposed/universe ppc64el libcoq-core-ocaml-dev ppc64el 8.16.0+dfsg-1build1 [50.8 MB] Get:63 http://ftpmaster.internal/ubuntu lunar/universe ppc64el libresult-ocaml ppc64el 1.5-1build2 [7448 B] Get:64 http://ftpmaster.internal/ubuntu lunar-proposed/universe ppc64el libsexplib0-ocaml ppc64el 0.15.1-1 [104 kB] Get:65 http://ftpmaster.internal/ubuntu lunar-proposed/universe ppc64el libppx-deriving-ocaml ppc64el 5.2.1-1build2 [4583 kB] Get:66 http://ftpmaster.internal/ubuntu lunar-proposed/universe ppc64el libelpi-ocaml ppc64el 1.16.7-2 [6446 kB] Get:67 http://ftpmaster.internal/ubuntu lunar/universe ppc64el libmenhir-ocaml-dev ppc64el 20220210+ds-2 [626 kB] Get:68 http://ftpmaster.internal/ubuntu lunar/universe ppc64el libocaml-compiler-libs-ocaml-dev ppc64el 0.12.4-1build1 [93.6 kB] Get:69 http://ftpmaster.internal/ubuntu lunar/universe ppc64el libppx-derivers-ocaml-dev ppc64el 1.2.1-1build3 [17.4 kB] Get:70 http://ftpmaster.internal/ubuntu lunar-proposed/universe ppc64el libsexplib0-ocaml-dev ppc64el 0.15.1-1 [219 kB] Get:71 http://ftpmaster.internal/ubuntu lunar-proposed/universe ppc64el libppxlib-ocaml-dev ppc64el 0.27.0-2build1 [17.5 MB] Get:72 http://ftpmaster.internal/ubuntu lunar/universe ppc64el libresult-ocaml-dev ppc64el 1.5-1build2 [10.8 kB] Get:73 http://ftpmaster.internal/ubuntu lunar-proposed/universe ppc64el libppx-deriving-ocaml-dev ppc64el 5.2.1-1build2 [972 kB] Get:74 http://ftpmaster.internal/ubuntu lunar/universe ppc64el libre-ocaml-dev ppc64el 1.10.3-1build1 [1068 kB] Get:75 http://ftpmaster.internal/ubuntu lunar-proposed/universe ppc64el libelpi-ocaml-dev ppc64el 1.16.7-2 [13.1 MB] Get:76 http://ftpmaster.internal/ubuntu lunar/universe ppc64el dh-ocaml all 1.1.3 [78.9 kB] debconf: delaying package configuration, since apt-utils is not installed Fetched 421 MB in 36s (11.6 MB/s) Selecting previously unselected package libpython3.10-minimal:ppc64el. (Reading database ... 15483 files and directories currently installed.) Preparing to unpack .../libpython3.10-minimal_3.10.8-3_ppc64el.deb ... Unpacking libpython3.10-minimal:ppc64el (3.10.8-3) ... Selecting previously unselected package libexpat1:ppc64el. Preparing to unpack .../libexpat1_2.5.0-1_ppc64el.deb ... Unpacking libexpat1:ppc64el (2.5.0-1) ... Selecting previously unselected package python3.10-minimal. Preparing to unpack .../python3.10-minimal_3.10.8-3_ppc64el.deb ... Unpacking python3.10-minimal (3.10.8-3) ... Setting up libpython3.10-minimal:ppc64el (3.10.8-3) ... Setting up libexpat1:ppc64el (2.5.0-1) ... Setting up python3.10-minimal (3.10.8-3) ... Selecting previously unselected package python3-minimal. (Reading database ... 15786 files and directories currently installed.) Preparing to unpack .../0-python3-minimal_3.10.6-1ubuntu1_ppc64el.deb ... Unpacking python3-minimal (3.10.6-1ubuntu1) ... Selecting previously unselected package media-types. Preparing to unpack .../1-media-types_8.0.0_all.deb ... Unpacking media-types (8.0.0) ... Selecting previously unselected package libmpdec3:ppc64el. Preparing to unpack .../2-libmpdec3_2.5.1-2build2_ppc64el.deb ... Unpacking libmpdec3:ppc64el (2.5.1-2build2) ... Selecting previously unselected package libpython3.10-stdlib:ppc64el. Preparing to unpack .../3-libpython3.10-stdlib_3.10.8-3_ppc64el.deb ... Unpacking libpython3.10-stdlib:ppc64el (3.10.8-3) ... Selecting previously unselected package python3.10. Preparing to unpack .../4-python3.10_3.10.8-3_ppc64el.deb ... Unpacking python3.10 (3.10.8-3) ... Selecting previously unselected package libpython3-stdlib:ppc64el. Preparing to unpack .../5-libpython3-stdlib_3.10.6-1ubuntu1_ppc64el.deb ... Unpacking libpython3-stdlib:ppc64el (3.10.6-1ubuntu1) ... Setting up python3-minimal (3.10.6-1ubuntu1) ... Selecting previously unselected package python3. (Reading database ... 16187 files and directories currently installed.) Preparing to unpack .../00-python3_3.10.6-1ubuntu1_ppc64el.deb ... Unpacking python3 (3.10.6-1ubuntu1) ... Selecting previously unselected package libelf1:ppc64el. Preparing to unpack .../01-libelf1_0.188-1_ppc64el.deb ... Unpacking libelf1:ppc64el (0.188-1) ... Selecting previously unselected package libicu71:ppc64el. Preparing to unpack .../02-libicu71_71.1-3ubuntu1_ppc64el.deb ... Unpacking libicu71:ppc64el (71.1-3ubuntu1) ... Selecting previously unselected package libxml2:ppc64el. Preparing to unpack .../03-libxml2_2.9.14+dfsg-1.1_ppc64el.deb ... Unpacking libxml2:ppc64el (2.9.14+dfsg-1.1) ... Selecting previously unselected package bsdextrautils. Preparing to unpack .../04-bsdextrautils_2.38-4ubuntu1_ppc64el.deb ... Unpacking bsdextrautils (2.38-4ubuntu1) ... Selecting previously unselected package libmagic-mgc. Preparing to unpack .../05-libmagic-mgc_1%3a5.41-4_ppc64el.deb ... Unpacking libmagic-mgc (1:5.41-4) ... Selecting previously unselected package libmagic1:ppc64el. Preparing to unpack .../06-libmagic1_1%3a5.41-4_ppc64el.deb ... Unpacking libmagic1:ppc64el (1:5.41-4) ... Selecting previously unselected package file. Preparing to unpack .../07-file_1%3a5.41-4_ppc64el.deb ... Unpacking file (1:5.41-4) ... Selecting previously unselected package gettext-base. Preparing to unpack .../08-gettext-base_0.21-10_ppc64el.deb ... Unpacking gettext-base (0.21-10) ... Selecting previously unselected package libuchardet0:ppc64el. Preparing to unpack .../09-libuchardet0_0.0.7-1build2_ppc64el.deb ... Unpacking libuchardet0:ppc64el (0.0.7-1build2) ... Selecting previously unselected package groff-base. Preparing to unpack .../10-groff-base_1.22.4-9_ppc64el.deb ... Unpacking groff-base (1.22.4-9) ... Selecting previously unselected package libpipeline1:ppc64el. Preparing to unpack .../11-libpipeline1_1.5.7-1_ppc64el.deb ... Unpacking libpipeline1:ppc64el (1.5.7-1) ... Selecting previously unselected package man-db. Preparing to unpack .../12-man-db_2.11.1-1_ppc64el.deb ... Unpacking man-db (2.11.1-1) ... Selecting previously unselected package m4. Preparing to unpack .../13-m4_1.4.19-1_ppc64el.deb ... Unpacking m4 (1.4.19-1) ... Selecting previously unselected package autoconf. Preparing to unpack .../14-autoconf_2.71-2_all.deb ... Unpacking autoconf (2.71-2) ... Selecting previously unselected package autotools-dev. Preparing to unpack .../15-autotools-dev_20220109.1_all.deb ... Unpacking autotools-dev (20220109.1) ... Selecting previously unselected package automake. Preparing to unpack .../16-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 .../17-autopoint_0.21-10_all.deb ... Unpacking autopoint (0.21-10) ... Selecting previously unselected package libcoq-stdlib. Preparing to unpack .../18-libcoq-stdlib_8.16.0+dfsg-1build1_ppc64el.deb ... Unpacking libcoq-stdlib (8.16.0+dfsg-1build1) ... Selecting previously unselected package ocaml-base. Preparing to unpack .../19-ocaml-base_4.13.1-3ubuntu1_ppc64el.deb ... Unpacking ocaml-base (4.13.1-3ubuntu1) ... Selecting previously unselected package libfindlib-ocaml. Preparing to unpack .../20-libfindlib-ocaml_1.9.3-1_ppc64el.deb ... Unpacking libfindlib-ocaml (1.9.3-1) ... Selecting previously unselected package libzarith-ocaml. Preparing to unpack .../21-libzarith-ocaml_1.12-1build1_ppc64el.deb ... Unpacking libzarith-ocaml (1.12-1build1) ... Selecting previously unselected package libcoq-core-ocaml. Preparing to unpack .../22-libcoq-core-ocaml_8.16.0+dfsg-1build1_ppc64el.deb ... Unpacking libcoq-core-ocaml (8.16.0+dfsg-1build1) ... Selecting previously unselected package ocaml-compiler-libs. Preparing to unpack .../23-ocaml-compiler-libs_4.13.1-3ubuntu1_ppc64el.deb ... Unpacking ocaml-compiler-libs (4.13.1-3ubuntu1) ... Selecting previously unselected package ocaml-interp. Preparing to unpack .../24-ocaml-interp_4.13.1-3ubuntu1_ppc64el.deb ... Unpacking ocaml-interp (4.13.1-3ubuntu1) ... Selecting previously unselected package libncurses-dev:ppc64el. Preparing to unpack .../25-libncurses-dev_6.3+20220423-2_ppc64el.deb ... Unpacking libncurses-dev:ppc64el (6.3+20220423-2) ... Selecting previously unselected package libncurses5-dev:ppc64el. Preparing to unpack .../26-libncurses5-dev_6.3+20220423-2_ppc64el.deb ... Unpacking libncurses5-dev:ppc64el (6.3+20220423-2) ... Selecting previously unselected package ocaml. Preparing to unpack .../27-ocaml_4.13.1-3ubuntu1_ppc64el.deb ... Unpacking ocaml (4.13.1-3ubuntu1) ... Selecting previously unselected package ocaml-nox. Preparing to unpack .../28-ocaml-nox_4.13.1-3ubuntu1_all.deb ... Unpacking ocaml-nox (4.13.1-3ubuntu1) ... Selecting previously unselected package ocaml-findlib. Preparing to unpack .../29-ocaml-findlib_1.9.3-1_ppc64el.deb ... Unpacking ocaml-findlib (1.9.3-1) ... Selecting previously unselected package coq. Preparing to unpack .../30-coq_8.16.0+dfsg-1build1_ppc64el.deb ... Unpacking coq (8.16.0+dfsg-1build1) ... Selecting previously unselected package libdebhelper-perl. Preparing to unpack .../31-libdebhelper-perl_13.10.1ubuntu1_all.deb ... Unpacking libdebhelper-perl (13.10.1ubuntu1) ... Selecting previously unselected package libtool. Preparing to unpack .../32-libtool_2.4.7-5_all.deb ... Unpacking libtool (2.4.7-5) ... Selecting previously unselected package dh-autoreconf. Preparing to unpack .../33-dh-autoreconf_20_all.deb ... Unpacking dh-autoreconf (20) ... Selecting previously unselected package libarchive-zip-perl. Preparing to unpack .../34-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 .../35-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 .../36-libfile-stripnondeterminism-perl_1.13.0-1_all.deb ... Unpacking libfile-stripnondeterminism-perl (1.13.0-1) ... Selecting previously unselected package dh-strip-nondeterminism. Preparing to unpack .../37-dh-strip-nondeterminism_1.13.0-1_all.deb ... Unpacking dh-strip-nondeterminism (1.13.0-1) ... Selecting previously unselected package libdw1:ppc64el. Preparing to unpack .../38-libdw1_0.188-1_ppc64el.deb ... Unpacking libdw1:ppc64el (0.188-1) ... Selecting previously unselected package debugedit. Preparing to unpack .../39-debugedit_1%3a5.0-5_ppc64el.deb ... Unpacking debugedit (1:5.0-5) ... Selecting previously unselected package dwz. Preparing to unpack .../40-dwz_0.14+20220924-2_ppc64el.deb ... Unpacking dwz (0.14+20220924-2) ... Selecting previously unselected package gettext. Preparing to unpack .../41-gettext_0.21-10_ppc64el.deb ... Unpacking gettext (0.21-10) ... Selecting previously unselected package intltool-debian. Preparing to unpack .../42-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 .../43-po-debconf_1.0.21+nmu1_all.deb ... Unpacking po-debconf (1.0.21+nmu1) ... Selecting previously unselected package debhelper. Preparing to unpack .../44-debhelper_13.10.1ubuntu1_all.deb ... Unpacking debhelper (13.10.1ubuntu1) ... Selecting previously unselected package dh-coq. Preparing to unpack .../45-dh-coq_0.5_all.deb ... Unpacking dh-coq (0.5) ... Selecting previously unselected package libfindlib-ocaml-dev. Preparing to unpack .../46-libfindlib-ocaml-dev_1.9.3-1_ppc64el.deb ... Unpacking libfindlib-ocaml-dev (1.9.3-1) ... Selecting previously unselected package libgmpxx4ldbl:ppc64el. Preparing to unpack .../47-libgmpxx4ldbl_2%3a6.2.1+dfsg1-1ubuntu2_ppc64el.deb ... Unpacking libgmpxx4ldbl:ppc64el (2:6.2.1+dfsg1-1ubuntu2) ... Selecting previously unselected package libgmp-dev:ppc64el. Preparing to unpack .../48-libgmp-dev_2%3a6.2.1+dfsg1-1ubuntu2_ppc64el.deb ... Unpacking libgmp-dev:ppc64el (2:6.2.1+dfsg1-1ubuntu2) ... Selecting previously unselected package libgmp3-dev:ppc64el. Preparing to unpack .../49-libgmp3-dev_2%3a6.2.1+dfsg1-1ubuntu2_ppc64el.deb ... Unpacking libgmp3-dev:ppc64el (2:6.2.1+dfsg1-1ubuntu2) ... Selecting previously unselected package libzarith-ocaml-dev. Preparing to unpack .../50-libzarith-ocaml-dev_1.12-1build1_ppc64el.deb ... Unpacking libzarith-ocaml-dev (1.12-1build1) ... Selecting previously unselected package libcoq-core-ocaml-dev. Preparing to unpack .../51-libcoq-core-ocaml-dev_8.16.0+dfsg-1build1_ppc64el.deb ... Unpacking libcoq-core-ocaml-dev (8.16.0+dfsg-1build1) ... Selecting previously unselected package libresult-ocaml. Preparing to unpack .../52-libresult-ocaml_1.5-1build2_ppc64el.deb ... Unpacking libresult-ocaml (1.5-1build2) ... Selecting previously unselected package libsexplib0-ocaml. Preparing to unpack .../53-libsexplib0-ocaml_0.15.1-1_ppc64el.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-1build2_ppc64el.deb ... Unpacking libppx-deriving-ocaml (5.2.1-1build2) ... Selecting previously unselected package libelpi-ocaml. Preparing to unpack .../55-libelpi-ocaml_1.16.7-2_ppc64el.deb ... Unpacking libelpi-ocaml (1.16.7-2) ... Selecting previously unselected package libmenhir-ocaml-dev. Preparing to unpack .../56-libmenhir-ocaml-dev_20220210+ds-2_ppc64el.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-1build1_ppc64el.deb ... Unpacking libocaml-compiler-libs-ocaml-dev (0.12.4-1build1) ... Selecting previously unselected package libppx-derivers-ocaml-dev. Preparing to unpack .../58-libppx-derivers-ocaml-dev_1.2.1-1build3_ppc64el.deb ... Unpacking libppx-derivers-ocaml-dev (1.2.1-1build3) ... Selecting previously unselected package libsexplib0-ocaml-dev. Preparing to unpack .../59-libsexplib0-ocaml-dev_0.15.1-1_ppc64el.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-2build1_ppc64el.deb ... Unpacking libppxlib-ocaml-dev (0.27.0-2build1) ... Selecting previously unselected package libresult-ocaml-dev. Preparing to unpack .../61-libresult-ocaml-dev_1.5-1build2_ppc64el.deb ... Unpacking libresult-ocaml-dev (1.5-1build2) ... Selecting previously unselected package libppx-deriving-ocaml-dev. Preparing to unpack .../62-libppx-deriving-ocaml-dev_5.2.1-1build2_ppc64el.deb ... Unpacking libppx-deriving-ocaml-dev (5.2.1-1build2) ... Selecting previously unselected package libre-ocaml-dev. Preparing to unpack .../63-libre-ocaml-dev_1.10.3-1build1_ppc64el.deb ... Unpacking libre-ocaml-dev (1.10.3-1build1) ... Selecting previously unselected package libelpi-ocaml-dev. Preparing to unpack .../64-libelpi-ocaml-dev_1.16.7-2_ppc64el.deb ... Unpacking libelpi-ocaml-dev (1.16.7-2) ... Selecting previously unselected package dh-ocaml. Preparing to unpack .../65-dh-ocaml_1.1.3_all.deb ... Unpacking dh-ocaml (1.1.3) ... Selecting previously unselected package sbuild-build-depends-main-dummy. Preparing to unpack .../66-sbuild-build-depends-main-dummy_0.invalid.0_ppc64el.deb ... Unpacking sbuild-build-depends-main-dummy (0.invalid.0) ... Setting up media-types (8.0.0) ... Setting up libpipeline1:ppc64el (1.5.7-1) ... Setting up libicu71:ppc64el (71.1-3ubuntu1) ... Setting up libncurses-dev:ppc64el (6.3+20220423-2) ... Setting up bsdextrautils (2.38-4ubuntu1) ... Setting up libmagic-mgc (1:5.41-4) ... Setting up dh-coq (0.5) ... Setting up libarchive-zip-perl (1.68-1) ... Setting up libdebhelper-perl (13.10.1ubuntu1) ... Setting up dh-ocaml (1.1.3) ... Setting up libmagic1:ppc64el (1:5.41-4) ... Setting up gettext-base (0.21-10) ... Setting up m4 (1.4.19-1) ... Setting up file (1:5.41-4) ... Setting up autotools-dev (20220109.1) ... Setting up libcoq-stdlib (8.16.0+dfsg-1build1) ... Setting up libgmpxx4ldbl:ppc64el (2:6.2.1+dfsg1-1ubuntu2) ... Setting up autopoint (0.21-10) ... Setting up ocaml-base (4.13.1-3ubuntu1) ... Setting up autoconf (2.71-2) ... Setting up libsexplib0-ocaml (0.15.1-1) ... Setting up libuchardet0:ppc64el (0.0.7-1build2) ... Setting up libncurses5-dev:ppc64el (6.3+20220423-2) ... Setting up libmpdec3:ppc64el (2.5.1-2build2) ... Setting up libsub-override-perl (0.09-4) ... Setting up libresult-ocaml (1.5-1build2) ... Setting up libelf1:ppc64el (0.188-1) ... Setting up libxml2:ppc64el (2.9.14+dfsg-1.1) ... 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.0-1) ... Setting up libppx-deriving-ocaml (5.2.1-1build2) ... Setting up libdw1:ppc64el (0.188-1) ... Setting up gettext (0.21-10) ... Setting up libgmp-dev:ppc64el (2:6.2.1+dfsg1-1ubuntu2) ... Setting up libtool (2.4.7-5) ... Setting up libfindlib-ocaml (1.9.3-1) ... Setting up libzarith-ocaml (1.12-1build1) ... Setting up intltool-debian (0.35.0+20060710.6) ... Setting up libpython3.10-stdlib:ppc64el (3.10.8-3) ... Setting up dh-autoreconf (20) ... Setting up ocaml-findlib (1.9.3-1) ... Setting up dh-strip-nondeterminism (1.13.0-1) ... Setting up libelpi-ocaml (1.16.7-2) ... Setting up dwz (0.14+20220924-2) ... Setting up libcoq-core-ocaml (8.16.0+dfsg-1build1) ... Setting up groff-base (1.22.4-9) ... Setting up libgmp3-dev:ppc64el (2:6.2.1+dfsg1-1ubuntu2) ... Setting up debugedit (1:5.0-5) ... Setting up libpython3-stdlib:ppc64el (3.10.6-1ubuntu1) ... Setting up python3.10 (3.10.8-3) ... Setting up po-debconf (1.0.21+nmu1) ... Setting up python3 (3.10.6-1ubuntu1) ... Setting up man-db (2.11.1-1) ... Not building database; man-db/auto-update is not 'true'. Created symlink /etc/systemd/system/timers.target.wants/man-db.timer → /lib/systemd/system/man-db.timer. Setting up debhelper (13.10.1ubuntu1) ... Setting up ocaml-compiler-libs (4.13.1-3ubuntu1) ... Setting up ocaml-interp (4.13.1-3ubuntu1) ... Setting up ocaml (4.13.1-3ubuntu1) ... Setting up libre-ocaml-dev (1.10.3-1build1) ... Setting up libmenhir-ocaml-dev (20220210+ds-2) ... Setting up libocaml-compiler-libs-ocaml-dev (0.12.4-1build1) ... Setting up libfindlib-ocaml-dev (1.9.3-1) ... Setting up ocaml-nox (4.13.1-3ubuntu1) ... Setting up libsexplib0-ocaml-dev (0.15.1-1) ... Setting up coq (8.16.0+dfsg-1build1) ... Setting up libresult-ocaml-dev (1.5-1build2) ... Setting up libzarith-ocaml-dev (1.12-1build1) ... Setting up libppx-derivers-ocaml-dev (1.2.1-1build3) ... Setting up libppxlib-ocaml-dev (0.27.0-2build1) ... Setting up libcoq-core-ocaml-dev (8.16.0+dfsg-1build1) ... Setting up libppx-deriving-ocaml-dev (5.2.1-1build2) ... Setting up libelpi-ocaml-dev (1.16.7-2) ... Setting up sbuild-build-depends-main-dummy (0.invalid.0) ... Processing triggers for libc-bin (2.36-0ubuntu4) ... Processing triggers for systemd (251.4-1ubuntu7) ... +------------------------------------------------------------------------------+ | Check architectures | +------------------------------------------------------------------------------+ Arch check ok (ppc64el included in any) +------------------------------------------------------------------------------+ | Build environment | +------------------------------------------------------------------------------+ Kernel: Linux 5.4.0-132-generic #148-Ubuntu SMP Mon Oct 17 16:02:37 UTC 2022 ppc64el (ppc64le) Toolchain package versions: binutils_2.39-8ubuntu2 dpkg-dev_1.21.9ubuntu1 g++-12_12.2.0-9ubuntu1 gcc-12_12.2.0-9ubuntu1 libc6-dev_2.36-0ubuntu4 libstdc++-12-dev_12.2.0-9ubuntu1 libstdc++6_12.2.0-9ubuntu1 linux-libc-dev_5.19.0-23.24 Package versions: adduser_3.121ubuntu1 advancecomp_2.4-1 apt_2.5.4 autoconf_2.71-2 automake_1:1.16.5-1.3 autopoint_0.21-10 autotools-dev_20220109.1 base-files_12.3ubuntu1 base-passwd_3.6.1 bash_5.2-1ubuntu2 binutils_2.39-8ubuntu2 binutils-common_2.39-8ubuntu2 binutils-powerpc64le-linux-gnu_2.39-8ubuntu2 bsdextrautils_2.38-4ubuntu1 bsdutils_1:2.38-4ubuntu1 build-essential_12.9ubuntu3 bzip2_1.0.8-5build1 ca-certificates_20211016 coq_8.16.0+dfsg-1build1 coreutils_8.32-4.1ubuntu1 cpp_4:12.2.0-1ubuntu1 cpp-12_12.2.0-9ubuntu1 dash_0.5.11+git20210903+057cd650a4ed-8ubuntu1 debconf_1.5.79ubuntu1 debhelper_13.10.1ubuntu1 debianutils_5.7-0.4 debugedit_1:5.0-5 dh-autoreconf_20 dh-coq_0.5 dh-ocaml_1.1.3 dh-strip-nondeterminism_1.13.0-1 diffutils_1:3.8-1 dpkg_1.21.9ubuntu1 dpkg-dev_1.21.9ubuntu1 dwz_0.14+20220924-2 e2fsprogs_1.46.6~rc1-1ubuntu1 fakeroot_1.30.1-1ubuntu1 file_1:5.41-4 findutils_4.9.0-3ubuntu1 g++_4:12.2.0-1ubuntu1 g++-12_12.2.0-9ubuntu1 gcc_4:12.2.0-1ubuntu1 gcc-12_12.2.0-9ubuntu1 gcc-12-base_12.2.0-9ubuntu1 gettext_0.21-10 gettext-base_0.21-10 gpg_2.2.40-1ubuntu1 gpg-agent_2.2.40-1ubuntu1 gpgconf_2.2.40-1ubuntu1 gpgv_2.2.40-1ubuntu1 grep_3.8-3 groff-base_1.22.4-9 gzip_1.12-1ubuntu1 hostname_3.23ubuntu2 init_1.65.2 init-system-helpers_1.65.2 intltool-debian_0.35.0+20060710.6 libacl1_2.3.1-1 libapparmor1_3.0.7-1ubuntu4 libapt-pkg6.0_2.5.4 libarchive-zip-perl_1.68-1 libargon2-1_0~20171227-0.3 libasan8_12.2.0-9ubuntu1 libassuan0_2.5.5-5 libatomic1_12.2.0-9ubuntu1 libattr1_1:2.5.1-1build1 libaudit-common_1:3.0.7-1ubuntu2 libaudit1_1:3.0.7-1ubuntu2 libbinutils_2.39-8ubuntu2 libblkid1_2.38-4ubuntu1 libbz2-1.0_1.0.8-5build1 libc-bin_2.36-0ubuntu4 libc-dev-bin_2.36-0ubuntu4 libc6_2.36-0ubuntu4 libc6-dev_2.36-0ubuntu4 libcap-ng0_0.8.3-1build1 libcap2_1:2.44-1build3 libcc1-0_12.2.0-9ubuntu1 libcom-err2_1.46.6~rc1-1ubuntu1 libcoq-core-ocaml_8.16.0+dfsg-1build1 libcoq-core-ocaml-dev_8.16.0+dfsg-1build1 libcoq-stdlib_8.16.0+dfsg-1build1 libcrypt-dev_1:4.4.33-1 libcrypt1_1:4.4.33-1 libcryptsetup12_2:2.5.0-6ubuntu1 libctf-nobfd0_2.39-8ubuntu2 libctf0_2.39-8ubuntu2 libdb5.3_5.3.28+dfsg1-0.10 libdebconfclient0_0.264ubuntu1 libdebhelper-perl_13.10.1ubuntu1 libdevmapper1.02.1_2:1.02.185-1ubuntu1 libdpkg-perl_1.21.9ubuntu1 libdw1_0.188-1 libelf1_0.188-1 libelpi-ocaml_1.16.7-2 libelpi-ocaml-dev_1.16.7-2 libexpat1_2.5.0-1 libext2fs2_1.46.6~rc1-1ubuntu1 libfakeroot_1.30.1-1ubuntu1 libfdisk1_2.38-4ubuntu1 libffi8_3.4.4-1 libfile-stripnondeterminism-perl_1.13.0-1 libfindlib-ocaml_1.9.3-1 libfindlib-ocaml-dev_1.9.3-1 libgcc-12-dev_12.2.0-9ubuntu1 libgcc-s1_12.2.0-9ubuntu1 libgcrypt20_1.10.1-2ubuntu1 libgdbm-compat4_1.23-3 libgdbm6_1.23-3 libgmp-dev_2:6.2.1+dfsg1-1ubuntu2 libgmp10_2:6.2.1+dfsg1-1ubuntu2 libgmp3-dev_2:6.2.1+dfsg1-1ubuntu2 libgmpxx4ldbl_2:6.2.1+dfsg1-1ubuntu2 libgnutls30_3.7.7-2ubuntu2 libgomp1_12.2.0-9ubuntu1 libgpg-error0_1.46-1 libgssapi-krb5-2_1.20.1-1 libhogweed6_3.8.1-2 libicu71_71.1-3ubuntu1 libidn2-0_2.3.3-1build1 libip4tc2_1.8.7-1ubuntu7 libisl23_0.25-1 libitm1_12.2.0-9ubuntu1 libjson-c5_0.16-2 libk5crypto3_1.20.1-1 libkeyutils1_1.6.3-1 libkmod2_30+20220630-3ubuntu1 libkrb5-3_1.20.1-1 libkrb5support0_1.20.1-1 liblockfile-bin_1.17-1build2 liblockfile1_1.17-1build2 liblsan0_12.2.0-9ubuntu1 liblz4-1_1.9.4-1 liblzma5_5.2.8-0.0 libmagic-mgc_1:5.41-4 libmagic1_1:5.41-4 libmenhir-ocaml-dev_20220210+ds-2 libmount1_2.38-4ubuntu1 libmpc3_1.2.1-2build1 libmpdec3_2.5.1-2build2 libmpfr6_4.1.0-3build3 libncurses-dev_6.3+20220423-2 libncurses5-dev_6.3+20220423-2 libncurses6_6.3+20220423-2 libncursesw6_6.3+20220423-2 libnettle8_3.8.1-2 libnpth0_1.6-3build2 libnsl-dev_1.3.0-2build2 libnsl2_1.3.0-2build2 libocaml-compiler-libs-ocaml-dev_0.12.4-1build1 libp11-kit0_0.24.1-1ubuntu2 libpam-modules_1.5.2-5ubuntu1 libpam-modules-bin_1.5.2-5ubuntu1 libpam-runtime_1.5.2-5ubuntu1 libpam0g_1.5.2-5ubuntu1 libpcre2-8-0_10.40-1ubuntu1 libpcre3_2:8.39-14 libperl5.34_5.34.0-5ubuntu1 libperl5.36_5.36.0-4ubuntu2 libpipeline1_1.5.7-1 libpng16-16_1.6.39-1 libppx-derivers-ocaml-dev_1.2.1-1build3 libppx-deriving-ocaml_5.2.1-1build2 libppx-deriving-ocaml-dev_5.2.1-1build2 libppxlib-ocaml-dev_0.27.0-2build1 libprocps8_2:3.3.17-7ubuntu1 libpython3-stdlib_3.10.6-1ubuntu1 libpython3.10-minimal_3.10.8-3 libpython3.10-stdlib_3.10.8-3 libquadmath0_12.2.0-9ubuntu1 libre-ocaml-dev_1.10.3-1build1 libreadline8_8.2-1.2 libresult-ocaml_1.5-1build2 libresult-ocaml-dev_1.5-1build2 libseccomp2_2.5.4-1ubuntu2 libselinux1_3.4-1build1 libsemanage-common_3.4-1build1 libsemanage2_3.4-1build1 libsepol2_3.4-2 libsexplib0-ocaml_0.15.1-1 libsexplib0-ocaml-dev_0.15.1-1 libsmartcols1_2.38-4ubuntu1 libsqlite3-0_3.40.0-1 libss2_1.46.6~rc1-1ubuntu1 libssl3_3.0.5-2ubuntu2 libstdc++-12-dev_12.2.0-9ubuntu1 libstdc++6_12.2.0-9ubuntu1 libsub-override-perl_0.09-4 libsystemd-shared_251.4-1ubuntu7 libsystemd0_251.4-1ubuntu7 libtasn1-6_4.19.0-2 libtinfo6_6.3+20220423-2 libtirpc-common_1.3.3+ds-1 libtirpc-dev_1.3.3+ds-1 libtirpc3_1.3.3+ds-1 libtool_2.4.7-5 libtsan2_12.2.0-9ubuntu1 libubsan1_12.2.0-9ubuntu1 libuchardet0_0.0.7-1build2 libudev1_251.4-1ubuntu7 libunistring2_1.0-2 libuuid1_2.38-4ubuntu1 libxml2_2.9.14+dfsg-1.1 libxxhash0_0.8.1-1 libzarith-ocaml_1.12-1build1 libzarith-ocaml-dev_1.12-1build1 libzstd1_1.5.2+dfsg-1 linux-libc-dev_5.19.0-23.24 lockfile-progs_0.1.19build1 login_1:4.13+dfsg1-1ubuntu1 logsave_1.46.6~rc1-1ubuntu1 lsb-base_11.2ubuntu1 lto-disabled-list_36 m4_1.4.19-1 make_4.3-4.1build1 man-db_2.11.1-1 mawk_1.3.4.20200120-3.1 media-types_8.0.0 mount_2.38-4ubuntu1 ncurses-base_6.3+20220423-2 ncurses-bin_6.3+20220423-2 ocaml_4.13.1-3ubuntu1 ocaml-base_4.13.1-3ubuntu1 ocaml-compiler-libs_4.13.1-3ubuntu1 ocaml-findlib_1.9.3-1 ocaml-interp_4.13.1-3ubuntu1 ocaml-nox_4.13.1-3ubuntu1 openssl_3.0.5-2ubuntu2 optipng_0.7.7-2build1 passwd_1:4.13+dfsg1-1ubuntu1 patch_2.7.6-7build2 perl_5.36.0-4ubuntu2 perl-base_5.36.0-4ubuntu2 perl-modules-5.34_5.34.0-5ubuntu1 perl-modules-5.36_5.36.0-4ubuntu2 pinentry-curses_1.2.1-1ubuntu1 pkgbinarymangler_149 po-debconf_1.0.21+nmu1 policyrcd-script-zg2_0.1-3.1 procps_2:3.3.17-7ubuntu1 python3_3.10.6-1ubuntu1 python3-minimal_3.10.6-1ubuntu1 python3.10_3.10.8-3 python3.10-minimal_3.10.8-3 readline-common_8.2-1.2 rpcsvc-proto_1.4.2-0ubuntu6 sbuild-build-depends-main-dummy_0.invalid.0 sed_4.8-1ubuntu2 sensible-utils_0.0.17 systemd_251.4-1ubuntu7 systemd-sysv_251.4-1ubuntu7 sysvinit-utils_3.04-1ubuntu1 tar_1.34+dfsg-1.1 tzdata_2022f-0ubuntu2 ubuntu-keyring_2021.03.26 usrmerge_33ubuntu1 util-linux_2.38-4ubuntu1 util-linux-extra_2.38-4ubuntu1 xz-utils_5.2.8-0.0 zlib1g_1:1.2.13.dfsg-1ubuntu2 +------------------------------------------------------------------------------+ | Build | +------------------------------------------------------------------------------+ Unpack source ------------- -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA256 Format: 3.0 (quilt) Source: coq-elpi Binary: libcoq-elpi Architecture: any Version: 1.16.0-1build1 Maintainer: Debian OCaml Maintainers Uploaders: Julien Puydt Homepage: https://github.com/LPCIC/coq-elpi Standards-Version: 4.6.1 Vcs-Browser: https://salsa.debian.org/ocaml-team/coq-elpi Vcs-Git: https://salsa.debian.org/ocaml-team/coq-elpi.git Build-Depends: coq, debhelper-compat (= 13), dh-coq, dh-ocaml, libcoq-ocaml-dev (>= 8.15), libcoq-stdlib, libelpi-ocaml-dev Package-List: libcoq-elpi deb ocaml optional arch=any Checksums-Sha1: f340c26af224a9c6844731bddc4b037a1ffe4020 426223 coq-elpi_1.16.0.orig.tar.gz b285c8cfdb93998788a87d3b3eb8cf54c0dd2063 3436 coq-elpi_1.16.0-1build1.debian.tar.xz Checksums-Sha256: db21d73dd749290fa6ab858dc40e75ce7bde7b80724338580b20902bf05feaa7 426223 coq-elpi_1.16.0.orig.tar.gz 3bb8cafd3407361b82dbf06325e956f68e5da884dbc6988b87a6a982ac113a16 3436 coq-elpi_1.16.0-1build1.debian.tar.xz Files: 688a6cb1b67db26b007a0cf54ba0e985 426223 coq-elpi_1.16.0.orig.tar.gz f507d3a33bcefedfe95ba187535fa174 3436 coq-elpi_1.16.0-1build1.debian.tar.xz -----BEGIN PGP SIGNATURE----- iQIzBAEBCAAdFiEEkpeKbhleSSGCX3/w808JdE6fXdkFAmODE9AACgkQ808JdE6f Xdluvw/8CDillfpYWGL2S3cb0pZI20cBRIcvmwMHmfeNR7Ogft6wmsbfKNFigiyI 96Sh7BGjaRuAhJ9ew0nYexulKtecfwfBfy1z8eF+48k21mtB49sQpwfYn7BNn2IC hQOfhs4ngE42we3bhRCxx8VS4ruX/QmF0viLIawzK8Rh1QsqGIBAqBvxaztNUqJW 1sAliZ/rr/mRZb1WsDmrOy6npXYvbDKuMUF0wCPMSpVQANFOGtwqsEri6FjgGO0M 2T31Q5iF9yJ230SdEqtKMLnOP+4L/S0LJg5g+qHQFS0+UDMuRyh0WtBLuaZW4l+U /mVSDayWOdF1d70U6xR9psHCoxNsfqgQ6+2/SQZlcH1QTeVaRa3ZdnosbGZJUcd5 GrXltE5Y+TwkeYBqZ6XQHNK3qiuKHWxpmbvzOk+gRssiLepDgGKYUvsVhibwiTlO arRc7SmOYftPwI66Il1v4SrIO9ydCDqpRir5EAzIHqPE3/VqrCIS/w9s/KvN7/vL yW55atxa0RclPmjToIozGl0iE3PwjoNlDYLJJya8jd5RubAd+r+me1BWks4ivtFv yu2FKlS6EwTLShYVLNiJf5jOg9XYjXpMJNH/v1+Bnt2UvRC/t5CQ+o3kohTr//2U 0HzYmjGdv9QOr9qun3XaPWf8e+qxyzTO0S4GxRjupnDvKd3hbVg= =6fQ+ -----END PGP SIGNATURE----- gpgv: Signature made Sun Nov 27 07:37:52 2022 UTC gpgv: using RSA key 92978A6E195E4921825F7FF0F34F09744E9F5DD9 gpgv: Can't check signature: No public key dpkg-source: warning: cannot verify signature ./coq-elpi_1.16.0-1build1.dsc dpkg-source: info: extracting coq-elpi in /<> dpkg-source: info: unpacking coq-elpi_1.16.0.orig.tar.gz dpkg-source: info: unpacking coq-elpi_1.16.0-1build1.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 Check disk space ---------------- Sufficient free space for build User Environment ---------------- APT_CONFIG=/var/lib/sbuild/apt.conf DEB_BUILD_OPTIONS=parallel=4 HOME=/sbuild-nonexistent LANG=C.UTF-8 LC_ALL=C.UTF-8 LOGNAME=buildd PATH=/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games SCHROOT_ALIAS_NAME=build-PACKAGEBUILD-24874149 SCHROOT_CHROOT_NAME=build-PACKAGEBUILD-24874149 SCHROOT_COMMAND=env SCHROOT_GID=2501 SCHROOT_GROUP=buildd SCHROOT_SESSION_ID=build-PACKAGEBUILD-24874149 SCHROOT_UID=2001 SCHROOT_USER=buildd SHELL=/bin/sh TERM=unknown USER=buildd V=1 dpkg-buildpackage ----------------- Command: dpkg-buildpackage -us -uc -mLaunchpad Build Daemon -B -rfakeroot dpkg-buildpackage: info: source package coq-elpi dpkg-buildpackage: info: source version 1.16.0-1build1 dpkg-buildpackage: info: source distribution lunar dpkg-source --before-build . dpkg-buildpackage: info: host architecture ppc64el debian/rules clean dh clean --with ocaml,coq debian/rules override_dh_auto_clean make[1]: Entering directory '/<>' Clean target is fragile make[1]: Leaving directory '/<>' dh_ocamlclean dh_clean debian/rules binary-arch dh binary-arch --with ocaml,coq dh_update_autotools_config -a dh_autoreconf -a dh_ocamlinit -a dh_auto_configure -a debian/rules override_dh_auto_build make[1]: Entering directory '/<>' /usr/bin/make build OCAMLWARN= make[2]: Entering directory '/<>' 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.008 secs (0.006u,0.s) (successful) ########################## building APPS ############################ make[3]: Entering directory '/<>/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 '/<>/apps/derive' make[3]: Entering directory '/<>/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 '/<>/apps/eltac' make[3]: Entering directory '/<>/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 '/<>/apps/NES' make[3]: Entering directory '/<>/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 '/<>/apps/locker' make[2]: Leaving directory '/<>' make[1]: Leaving directory '/<>' dh_auto_test -a make -j4 test make[1]: Entering directory '/<>' 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 '/<>/apps/derive' Using coq found in /usr/bin/, from COQBIN or PATH COQDEP VFILES make[4]: Nothing to be done for 'real-all'. make[2]: Leaving directory '/<>/apps/derive' make[2]: Entering directory '/<>/apps/eltac' Using coq found in /usr/bin/, from COQBIN or PATH COQC tests/test_API.v COQC tests/test_API_typecheck.v COQC tests/test_API_elaborate.v make[4]: Nothing to be done for 'real-all'. make[2]: Leaving directory '/<>/apps/eltac' make[2]: Entering directory '/<>/apps/NES' Using coq found in /usr/bin/, from COQBIN or PATH make[4]: Nothing to be done for 'real-all'. make[2]: Leaving directory '/<>/apps/NES' make[2]: Entering directory '/<>/apps/locker' Using coq found in /usr/bin/, from COQBIN or PATH make[4]: Nothing to be done for 'real-all'. make[2]: Leaving directory '/<>/apps/locker' ########################## testing APPS ############################ make[2]: Entering directory '/<>/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 COQC tests/test_derive_stdlib.v 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: 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») Coq version: 8.16.0 = 8 . 16 . 0 Query assignments: MA = 8 MI = 16 P = 0 V = 8.16.0 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 c2 global (indt «nat») z nat Query assignments: Spilled_1 = c0 \ c1 \ c2 \ nat Spilled_2 = c0 \ c1 \ c2 \ z T = global (indt «nat») hello world COQC tests/test_param2.v 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: c2 global (indt «nat») z nat Query assignments: Spilled_1 = c0 \ c1 \ c2 \ nat Spilled_2 = c0 \ c1 \ c2 \ z T = global (indt «nat») 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 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]))] 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))] 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 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" 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: unknown_gref Unable to unify "bool" with "nat". Query assignments: Msg = Unable to unify "bool" with "nat". 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 predn_R : nat2nat_R predn predn : nat2nat_R predn predn add_R : nat2nat2nat_R Nat.add Nat.add : nat2nat2nat_R Nat.add Nat.add File "./tests/test_param2.v", line 85, characters 0-30: Warning: Not a truly recursive fixpoint. [non-recursive,fixpoints] COQC tests/test_invert.v «elpi.tests.test_API_elaborate.52» «elpi.tests.test_API_elaborate.52» COQC tests/test_API_env.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: 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 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_idx2inv.v 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 COQC tests/test_lens.v Query assignments: GR = «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» 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») 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: Query assignments: GR = «empty_nat» TY = global (indt «nat») «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: _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 @_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 @_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 @_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 tests/test_tag.v Query assignments: GR = «Nat.add» MP = «Coq.Init.Datatypes» Query assignments: GR1 = indc «Vector.nil» GR2 = indt «nat» GR3 = const «A» 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). COQC tests/test_API_module.v 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»] 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 Universe constraints: 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» «myfalse» Query assignments: F = indt «False» GR = «myfalse» myfalse : False Query assignments: X = «elpi.tests.test_API.1» Universe constraints: UNIVERSES: {elpi.tests.test_API.1} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: WEAK CONSTRAINTS: 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» 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 ) empty_tag : tag empty : tag empty unit_tag : tag unit : tag unit peano_tag : tag peano : tag peano 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) 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 COQC tests/test_eqType_ast.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: I = «Y.i» ID = j J = «Y.j» MP = «elpi.tests.test_API_module.Y» P = [elpi, tests, test_API_module, Y] 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 *) 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 ] 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: 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] 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 ] 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: C = «pc» Query assignments: MP_TA = «elpi.tests.test_API_module.TA» Module Type TB = Funsig (A:TA) Sig End 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: 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 COQC examples/usage.v Query assignments: Spilled_1 = «elpi.tests.test_API_module.A» Module IA := Struct Definition z : nat. Definition i : Type. End 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: 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 Query assignments: Spilled_1 = «elpi.tests.test_API_module.IA» i : Type c0 global (indt «nat») Query assignments: T = global (indt «nat») Query assignments: Spilled_1 = «elpi.tests.test_API_module.TA» Module Type ITA = Sig Parameter z : nat. Parameter i : Type. End more : (forall A : Type, A -> tickle A -> tickle A) : forall A : Type, A -> tickle A -> tickle A 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 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.003398 Derivation lens on indt «rtree» Derivation lens on indt «rtree» failed, continuing Derivation param1 on indt «rtree» Derivation param1 on indt «rtree» took 0.008480 Derivation param2 on indt «rtree» 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: Derivation param2 on indt «rtree» took 0.009963 Derivation tag on indt «rtree» Derivation tag on indt «rtree» took 0.001616 Derivation eqType_ast on indt «rtree» Derivation eqType_ast on indt «rtree» took 0.000921 Derivation lens_laws on indt «rtree» Derivation lens_laws on indt «rtree» took 0.000715 Derivation param1_congr on indt «rtree» Derivation param1_congr on indt «rtree» took 0.003267 Derivation param1_inhab on indt «rtree» Derivation param1_inhab on indt «rtree» took 0.002971 Derivation param1_functor on indt «rtree» Derivation param1_functor on indt «rtree» took 0.003071 Derivation fields on indt «rtree» Derivation fields on indt «rtree» took 0.030974 Derivation param1_trivial on indt «rtree» 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» COQC tests/test_API_section.v Derivation param1_trivial on indt «rtree» took 0.075327 Derivation induction on indt «rtree» Derivation induction on indt «rtree» took 0.002530 Derivation eqb on indt «rtree» Derivation eqb on indt «rtree» took 0.016062 Derivation eqbcorrect on indt «rtree» Derivation eqbcorrect on indt «rtree» took 0.027086 Derivation eqbOK on indt «rtree» Derivation eqbOK on indt «rtree» took 0.001767 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 [foo (const «X»), foo (indt «nat»), foo (indt «bool»)] 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.004581 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.001670 Derivation eqType_ast on indt «Box» Derivation eqType_ast on indt «Box» took 0.000857 Derivation lens_laws on indt «Box» [foo (indt «nat»), foo (indt «bool»)] Derivation lens_laws on indt «Box» took 0.011449 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.005265 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.004657 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) [foo (indt «nat»)] 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: 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) Derivation map on indt «a» Derivation map on indt «a» took 0.002180 Derivation lens on indt «a» Derivation lens on indt «a» failed, continuing Derivation param1 on indt «a» Derivation param1 on indt «a» took 0.004427 Derivation param2 on indt «a» Derivation param2 on indt «a» took 0.004662 Derivation tag on indt «a» Derivation tag on indt «a» took 0.001238 Derivation eqType_ast on indt «a» Derivation eqType_ast on indt «a» took 0.000777 Derivation lens_laws on indt «a» Derivation lens_laws on indt «a» took 0.000721 Derivation param1_congr on indt «a» Derivation param1_congr on indt «a» took 0.000862 Derivation param1_inhab on indt «a» Derivation param1_inhab on indt «a» took 0.001855 Derivation param1_functor on indt «a» Derivation param1_functor on indt «a» took 0.001823 Derivation fields on indt «a» Derivation fields on indt «a» took 0.003350 Derivation param1_trivial on indt «a» Derivation param1_trivial on indt «a» took 0.002235 Derivation induction on indt «a» Derivation induction on indt «a» took 0.001310 Derivation eqb on indt «a» Derivation eqb on indt «a» took 0.003151 Derivation eqbcorrect on indt «a» Derivation eqbcorrect on indt «a» took 0.004689 Derivation eqbOK on indt «a» Derivation eqbOK on indt «a» took 0.001070 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.004632 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.001267 Derivation eqType_ast on indt «b» Derivation eqType_ast on indt «b» took 0.000823 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.001934 Derivation param1_functor on indt «b» Derivation param1_functor on indt «b» took 0.001880 Derivation fields on indt «b» Derivation fields on indt «b» took 0.003803 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.001417 Derivation eqb on indt «b» Derivation eqb on indt «b» took 0.003544 Derivation eqbcorrect on indt «b» Derivation eqbcorrect on indt «b» took 0.005596 Derivation eqbOK on indt «b» Derivation eqbOK on indt «b» took 0.001085 a_eqb : a -> a -> bool b_eqb : b -> b -> bool COQC examples/readme.v 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: 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: X = «x» fx : nat -> nat : nat -> nat 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» 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 opaque_3 : nat opaque_3 is not universe polymorphic opaque_3 is opaque Expands to: Constant elpi.tests.test_API_section.opaque_3 Derivation param1 on const «Nat.add» Derivation param1 on const «Nat.add» took 0.004984 Derivation param2 on const «Nat.add» Derivation param2 on const «Nat.add» took 0.005516 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_projK.v File "./tests/test_API.v", line 204, characters 0-107: Warning: Option Foo Bar is deprecated [deprecated-option,deprecated] 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» {{ nat; S; }} {{ nat; S; }} Query assignments: GR = const «Nat.add» L = {{ nat; S; }} S = {{ nat; S; }} hello [int 1, int 2, trm (global (indt «nat»)), str x] {{ 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» 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_API_TC_CS.v ?r : Reflexive R : Reflexive R where ?r : [ |- Reflexive R] foo : nat : nat bar : bool -> nat : bool -> nat COQC tests/test_API_arguments.v Query assignments: GR = const «myi» myi : Reflexive R : Reflexive R 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 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: Spilled_1 = const «foo» foo 3 : 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] 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: GR = indt «RewriteRelation» 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 COQC tests/test_API_notations.v Query assignments: GR = indt «True» 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 = 1.063990 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: COQC tests/test_API2.v «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 Query assignments: GR = const «myc» eq_op myc t t : bool File "./tests/test_API2.v", line 3, characters 0-27: Warning: Option Foo Bar is deprecated [deprecated-option,deprecated] 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 Query assignments: L = [cs-instance (const «carrier») (cs-gref (const «W»)) (const «myc»), cs-instance (const «eq_op») (cs-gref (const «Z»)) (const «myc»)] 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: I = «eq» P1 = «carrier» P2 = «eq_op» Query assignments: Spilled_1 = «elpi.tests.test_API_notations.abbr2» COQC tests/test_HOAS.v Query assignments: X1 = «x1» X2 = «x2» X3 = «x3» Query assignments: GR = const «myc1» eq_op myc1 t1 t1 : bool Query assignments: M = [[mode-ground], [mode-input]] {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: P = const «eq_op» 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: W = const «W» 1 1.000000 [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»)) [])] [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» Query assignments: T = sort (typ «elpi.tests.test_HOAS.3») U = «elpi.tests.test_HOAS.3» Query assignments: P = const «eq_op» W = indt «nat» 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: U = «elpi.tests.test_HOAS.5» 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»))] File "./tests/test_API2.v", line 114, characters 0-16: Warning: Option Foo Bar is deprecated [deprecated-option,deprecated] 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: 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 COQC tests/test_arg_HOAS.v File "./tests/test_API2.v", line 122, characters 0-14: Warning: Option Foo Bar is deprecated [deprecated-option,deprecated] ---------------------------------- {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: 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: C1 = «Nat.add» C2 = «times» X1 = tt X2 = ff 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] 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] Raw term: app [global (const «add»), primitive (float64 24000000000000), primitive (float64 1)] Nice term: 24000000000000 + 1 Red: 24000000000001 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] 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] 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 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 projCons2 : forall A : Type, A -> seq A -> seq A -> seq A : forall A : Type, A -> seq A -> seq A -> seq A 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_derive.v Query assignments: C1 = «x» 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»)]]] 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») 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) Query assignments: C1 = «x» M = «elpi.tests.test_API2.xx» 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») 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: C1 = «x» M = «elpi.tests.test_API2.xx2» Query assignments: C = «Nat.add» F = TODO 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») Query assignments: I = «foo» 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) y : nat -> Type : nat -> Type 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) y : nat -> Type : nat -> Type 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: C1 = «x» M = «elpi.tests.test_API2.xx3» 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] 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]) 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 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: _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: GR = indt «X3» Universe constraints: UNIVERSES: {elpi.tests.test_arg_HOAS.143} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: elpi.tests.test_arg_HOAS.143 WEAK CONSTRAINTS: 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: 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 = indt «X4» Universe constraints: UNIVERSES: {elpi.tests.test_arg_HOAS.144} |= ALGEBRAIC UNIVERSES: {} UNDEFINED UNIVERSES: elpi.tests.test_arg_HOAS.144 WEAK CONSTRAINTS: 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 \ [] 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: X5@{u3} : Type@{u3} (* u3 |= *) X5 is universe polymorphic Expands to: Inductive elpi.tests.test_arg_HOAS.X5 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 \ [] X8@{u} : Type@{u} (* u |= *) X8 is universe polymorphic Expands to: Inductive elpi.tests.test_arg_HOAS.X8 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 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 Query assignments: GR = const const EXN PRINTING: Not_found T = «elpi.tests.test_API2.T» 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: 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_quotation.v 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: «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) 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») «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: derive.param1_trivial: wrong shape is_nest . It does not look like a unary parametricity translation of an inductive with no indexes. «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) 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: «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: derive.param1_trivial: wrong shape is_vect A PA . It does not look like a unary parametricity translation of an inductive with no indexes. 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_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: 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: «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 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: 3 Query assignments: X = 3 «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 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: fun `x` X0 c0 \ app [X1, c0] Query assignments: X = X1 Y = fun `x` X0 c0 \ app [X1, c0] _uvk_34_ = X0 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_vernacular1.v File "coq-builtin.elpi", line 1470, characters 0-93: Warning: constant get-option has no declared type. [elpi.typecheck,elpi] 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»)] 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) test2 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: test1 str hello test1 too many arguments test1 str hello my str Dear test1 too many arguments 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: COQC tests/test_tactic.v 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: Query assignments: GR = indt «nat» [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] Debug: Cannot enforce elpi.apps.derive.tests.test_derive.3312 <= Set 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: Query assignments: GR = indt «F» 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.002202 Derivation isK on indt «nat» Derivation isK on indt «nat» took 0.003517 Derivation eq on indt «nat» Query assignments: X = 3 Derivation eq on indt «nat» took 0.003390 Derivation invert on indt «nat» Derivation invert on indt «nat» took 0.004118 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.004051 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» app [global (const «Nat.mul»), X0, X1] type Derivation eqK on indt «nat» took 0.004671 Skipping derivation eqbcorrect on indt «nat» since it has been already run Derivation eqcorrect on indt «nat» Derivation eqcorrect on indt «nat» took 0.001643 Skipping derivation eqbOK on indt «nat» since it has been already run Derivation eqOK on indt «nat» Derivation eqOK on indt «nat» took 0.001309 COQC tests/test_elaborator.v 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) 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 list_eqb : (forall A : Type, (A -> A -> bool) -> list A -> list A -> bool) : forall A : Type, (A -> A -> bool) -> list A -> list A -> bool 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 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: {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 «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: {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: 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: 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. 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: 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 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: 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: COQC tests/test_ltac.v 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: 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 z : nat COQC tests/test_cache_async.v sort (typ X0) Query assignments: type_1 = X0 COQC tests/test_COQ_ELPI_ATTRIBUTES.v 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: [(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] COQC tests/perf_calls.v 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: 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: derive.param1_trivial: wrong shape is_t A PA . It does not look like a unary parametricity translation of an inductive with no indexes. 1356 : nat 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 this 3 app [c4, X0 c0 c1 c2 c3 c4] app [c3, app [c1, c2], global (const «a»)] foo.bar 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 COQC tests/test_require_bad_order.v 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 File "./tests/test_require_bad_order.v", line 2, characters 0-28: Warning: Option Foo Bar is deprecated [deprecated-option,deprecated] 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 COQC tests/test_ctx_cache.v [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 */ 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: [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 */ 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 Debug: Cannot enforce elpi.apps.derive.tests.test_derive.4294 <= Set 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 */ 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 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 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] COQC tests/test_eq.v [attribute elpi.loc (leaf-loc File "./tests/test_tactic.v", line 300, column 10, character 6470:)] 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: 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:)] [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: 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: 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»))] COQC tests/test_libobject_A.v Finished transaction in 1.156 secs (1.154u,0.s) (successful) Query assignments: A = tt B = 0 C = 0 D = sort (typ «Set») E = [«true», «false»] F = [global (indt «bool»), global (indt «bool»)] GR = «bool» COQC tests/test_vernacular2.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] Query assignments: F = app [global (const «nat_of_bool»), global (indc «true»)] 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] 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) 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) 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 COQC tests/test_isK.v 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_vernacular2.v", line 11, column 24, character 361:), attribute fwd_compat_attr (leaf-str )] [attribute elpi.loc (leaf-loc File "./tests/test_vernacular2.v", line 12, column 0, character 366:), attribute fwd_compat_attr (leaf-str )] Query assignments: Res = app [global (const «Z_of_nat»), app [global (const «nat_of_bool»), global (indc «true»)]] COQC tests/test_libobject_B.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 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: COQC tests/test_libobject_C.v global (indc «O») app [global (indc «S»), app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] COQC tests/test_param1.v 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 COQC tests/test_map.v Query assignments: T = global (const «int») X = primitive (uint63 99) Query assignments: T = global (const «float») X = primitive (float64 993000) 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 COQC tests/test_lens_laws.v Query assignments: _uvk_317_ = X0 COQC tests/test_fields.v _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 _pf4_view_set : forall A : Type, view_set _pf4 : forall A : Type, view_set _pf4 _f1_set_set : set_set _f1 : set_set _f1 _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 COQC tests/test_bcongr.v 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 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) 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 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 Query assignments: Y = global (indc «is_O») 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 COQC tests/test_eqb.v 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»)]] 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 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_ 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] 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 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 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 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 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 COQC tests/test_induction.v 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 COQC tests/test_eqcorrect.v 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 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 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 Finished transaction in 12.963 secs (12.948u,0.008s) (successful) Finished transaction in 0.267 secs (0.267u,0.s) (successful) 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 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) 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 '/<>/apps/derive' make[2]: Entering directory '/<>/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 d : nat COQC tests/test_injection.v COQC tests/test_case.v COQC tests/test_generalize.v trying i = i 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 COQC tests/test_cycle.v COQC examples/usage_eltac.v make[2]: Leaving directory '/<>/apps/eltac' make[2]: Entering directory '/<>/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 This.Is.A.Long.Namespace.stuff = 1 : nat = 1 : nat eq_refl : Foo.x = 5 : Foo.x = 5 This.Is.A.Long.Namespace.stuff = 2 : nat = 1 : nat stuff = 2 : nat 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 default nat_def : nat : 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 x = 5 : nat x2 = 4 : nat B1.c = 1 : nat B1.d = 1 : nat d = 1 : nat A2.B2.f = 2 : nat make[2]: Leaving directory '/<>/apps/NES' make[2]: Entering directory '/<>/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 '/<>/apps/locker' make[1]: Leaving directory '/<>' create-stamp debian/debhelper-build-stamp dh_prep -a dh_auto_install --destdir=debian/libcoq-elpi/ -a make -j4 install DESTDIR=/<>/debian/libcoq-elpi AM_UPDATE_INFO_DIR=no "INSTALL=install --strip-program=true" make[1]: Entering directory '/<>' Using coq found in /usr/bin, from COQBIN or PATH ########################## installing plugin ############################ make[2]: Entering directory '/<>' 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 /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/ INSTALL theories/elpi.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/ INSTALL theories/elpi.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/ INSTALL src/elpi_plugin.cmxs /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/ INSTALL src/elpi_plugin.cmxs /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/ # findlib needs the package to not be installed, so we remove it before # installing it ocamlfind: [WARNING] No such file: /<>/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/META Installed /<>/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/elpi_plugin.cmx Installed /<>/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/elpi_plugin.cmxa Installed /<>/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/elpi_plugin.cmxs ocamlfind: [WARNING] Overwriting file /<>/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/elpi_plugin.cmxs Installed /<>/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/elpi_plugin.cmxs Installed /<>/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/elpi_plugin.cmi Installed /<>/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/META make[3]: Entering directory '/<>' 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 "/<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/$df";\ install -m 0644 coq-builtin.elpi "/<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/$df";\ install -m 0644 elpi/coq-lib.elpi "/<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/$df";\ install -m 0644 elpi/elpi_elaborator.elpi "/<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/$df" make[3]: Leaving directory '/<>' make[2]: Leaving directory '/<>' make[2]: Entering directory '/<>' Installed /<>/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/elpi_plugin.cmo Installed /<>/debian/libcoq-elpi//usr/lib/ocaml/coq/../coq-core//../coq-elpi/elpi_plugin.cma make[2]: Leaving directory '/<>' mkdir -p /<>/debian/libcoq-elpi/usr/share/coq cp etc/coq-elpi.lang /<>/debian/libcoq-elpi/usr/share/coq/ ########################## installing APPS ############################ make[2]: Entering directory '/<>/apps/derive' Using coq found in /usr/bin/, from COQBIN or PATH make[3]: Entering directory '/<>/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 /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ INSTALL theories/derive/std.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/legacy.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/experimental.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/bcongr.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/cast.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eq.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqcorrect.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqK.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqOK.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/map.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/isK.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/idx2inv.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/invert.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/projK.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_functor.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_congr.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_trivial.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param2.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/induction.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/lens.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/lens_laws.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqb_core_defs.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/tag.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/fields.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqb.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqbcorrect.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqbOK.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqType_ast.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ INSTALL theories/derive/std.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/legacy.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/experimental.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/bcongr.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/cast.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eq.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqcorrect.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqK.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqOK.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/map.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/isK.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/idx2inv.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/invert.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/projK.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_functor.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_congr.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_trivial.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param2.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/induction.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/lens.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/lens_laws.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqb_core_defs.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/tag.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/fields.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqb.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqbcorrect.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqbOK.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqType_ast.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ INSTALL theories/derive/std.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/legacy.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/experimental.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/bcongr.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/cast.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eq.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqcorrect.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqK.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqOK.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/map.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/isK.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/idx2inv.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/invert.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/projK.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_functor.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_congr.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param1_trivial.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/param2.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/induction.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/lens.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/lens_laws.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqb_core_defs.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/tag.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/fields.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqb.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqbcorrect.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqbOK.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive INSTALL theories/derive/eqType_ast.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps//derive # findlib needs the package to not be installed, so we remove it before # installing it make[4]: Entering directory '/<>/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 "/<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/$df" make[4]: Leaving directory '/<>/apps/derive' make[3]: Leaving directory '/<>/apps/derive' make[2]: Leaving directory '/<>/apps/derive' make[2]: Entering directory '/<>/apps/eltac' Using coq found in /usr/bin/, from COQBIN or PATH make[3]: Entering directory '/<>/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 /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/constructor.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/intro.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/clear.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/fail.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/discriminate.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/injection.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/case.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/generalize.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/cycle.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/tactics.vo /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/assumption.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/constructor.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/intro.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/clear.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/fail.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/discriminate.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/injection.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/case.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/generalize.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/cycle.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/tactics.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/assumption.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/constructor.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/intro.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/clear.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/fail.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/discriminate.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/injection.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/case.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/generalize.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/cycle.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ INSTALL theories/tactics.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/eltac/ # findlib needs the package to not be installed, so we remove it before # installing it make[4]: Entering directory '/<>/apps/eltac' make[4]: Leaving directory '/<>/apps/eltac' make[3]: Leaving directory '/<>/apps/eltac' make[2]: Leaving directory '/<>/apps/eltac' make[2]: Entering directory '/<>/apps/NES' Using coq found in /usr/bin/, from COQBIN or PATH make[3]: Entering directory '/<>/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 /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ INSTALL theories/NES.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ INSTALL theories/NES.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ # findlib needs the package to not be installed, so we remove it before # installing it make[4]: Entering directory '/<>/apps/NES' make[4]: Leaving directory '/<>/apps/NES' make[3]: Leaving directory '/<>/apps/NES' make[2]: Leaving directory '/<>/apps/NES' make[2]: Entering directory '/<>/apps/locker' Using coq found in /usr/bin/, from COQBIN or PATH make[3]: Entering directory '/<>/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 /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ INSTALL theories/locker.v /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ INSTALL theories/locker.glob /<>/debian/libcoq-elpi//usr/lib/ocaml/coq//user-contrib/elpi/apps/ # findlib needs the package to not be installed, so we remove it before # installing it make[4]: Entering directory '/<>/apps/locker' make[4]: Leaving directory '/<>/apps/locker' make[3]: Leaving directory '/<>/apps/locker' make[2]: Leaving directory '/<>/apps/locker' #@echo "########################## installing doc ############################" #-mkdir -p /<>/debian/libcoq-elpi/usr/lib/ocaml/coq/../../share/doc/coq-elpi #-cp doc/* /<>/debian/libcoq-elpi/usr/lib/ocaml/coq/../../share/doc/coq-elpi ########################## installed ############################ make[1]: Leaving directory '/<>' dh_ocamldoc -a dh_installdocs -a dh_installchangelogs -a dh_installexamples -a dh_perl -a dh_link -a dh_strip_nondeterminism -a dh_compress -a dh_fixperms -a dh_missing -a dh_strip -a 03e0d1846c6ed8abc342809b0506db75e96b1857 03e0d1846c6ed8abc342809b0506db75e96b1857 dh_makeshlibs -a dh_shlibdeps -a dh_installdeb -a debian/rules override_dh_ocaml make[1]: Entering directory '/<>' 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 '/<>' dh_coq -a dh_gencontrol -a dh_md5sums -a dh_builddeb -a INFO: pkgstriptranslations version 149 INFO: pkgstriptranslations version 149 pkgstriptranslations: processing libcoq-elpi (in debian/libcoq-elpi); do_strip: , oemstrip: pkgstriptranslations: processing libcoq-elpi-dbgsym (in debian/.debhelper/libcoq-elpi/dbgsym-root); do_strip: , oemstrip: pkgmaintainermangler: Maintainer field overridden to "Ubuntu Developers " pkgstripfiles: processing control file: debian/libcoq-elpi/DEBIAN/control, package libcoq-elpi, directory debian/libcoq-elpi pkgstripfiles: Truncating usr/share/doc/libcoq-elpi/changelog.Debian.gz to topmost ten records pkgstripfiles: Running PNG optimization (using 4 cpus) for package libcoq-elpi ... pkgstripfiles: No PNG files. dpkg-deb: building package 'libcoq-elpi' in '../libcoq-elpi_1.16.0-1build1_ppc64el.deb'. pkgmaintainermangler: Maintainer field overridden to "Ubuntu Developers " pkgstripfiles: processing control file: debian/.debhelper/libcoq-elpi/dbgsym-root/DEBIAN/control, package libcoq-elpi-dbgsym, directory debian/.debhelper/libcoq-elpi/dbgsym-root dpkg-deb: building package 'libcoq-elpi-dbgsym' in 'debian/.debhelper/scratch-space/build-libcoq-elpi/libcoq-elpi-dbgsym_1.16.0-1build1_ppc64el.deb'. Renaming libcoq-elpi-dbgsym_1.16.0-1build1_ppc64el.deb to libcoq-elpi-dbgsym_1.16.0-1build1_ppc64el.ddeb dpkg-genbuildinfo --build=any -O../coq-elpi_1.16.0-1build1_ppc64el.buildinfo dpkg-genchanges --build=any -mLaunchpad Build Daemon -O../coq-elpi_1.16.0-1build1_ppc64el.changes dpkg-genchanges: info: binary-only arch-specific upload (source code and arch-indep packages not included) dpkg-source --after-build . dpkg-buildpackage: info: binary-only upload (no source included) -------------------------------------------------------------------------------- Build finished at 2022-11-27T08:04:33Z Finished -------- I: Built successfully +------------------------------------------------------------------------------+ | Changes | +------------------------------------------------------------------------------+ coq-elpi_1.16.0-1build1_ppc64el.changes: ---------------------------------------- Format: 1.8 Date: Sun, 27 Nov 2022 08:37:50 +0100 Source: coq-elpi Binary: libcoq-elpi Built-For-Profiles: noudeb Architecture: ppc64el Version: 1.16.0-1build1 Distribution: lunar-proposed Urgency: medium Maintainer: Launchpad Build Daemon Changed-By: Gianfranco Costamagna Description: libcoq-elpi - Coq plugin embedding Elpi Changes: coq-elpi (1.16.0-1build1) lunar; urgency=medium . * Rebuild against new OCAML ABI. Checksums-Sha1: 0737798444193f49288c5ea4c24aea6fa69162c5 7439 coq-elpi_1.16.0-1build1_ppc64el.buildinfo 0a9106ab9768e11ce2f8b78939e9489f21660af9 83968 libcoq-elpi-dbgsym_1.16.0-1build1_ppc64el.ddeb a8b4206cdda9c879ce01a0ac0ac9f78466cfc984 3082260 libcoq-elpi_1.16.0-1build1_ppc64el.deb Checksums-Sha256: 3cc3d8cc8dc829b81003a7cb5b01ffdae5a92f77b7d7a687453e7a6d6e13e45b 7439 coq-elpi_1.16.0-1build1_ppc64el.buildinfo b88e26b5a5a92e6b8d7c3fb77477aa8ef7660ddd3927c33c45d11d422712cc2d 83968 libcoq-elpi-dbgsym_1.16.0-1build1_ppc64el.ddeb ffdb5df4104df43df6bd142780af16367a5da609dda2efe1ac2775024b6a4964 3082260 libcoq-elpi_1.16.0-1build1_ppc64el.deb Files: e90e39c2128041904eb902cccf7318a2 7439 ocaml optional coq-elpi_1.16.0-1build1_ppc64el.buildinfo ebf44091d4ba6f84521730545ef55290 83968 debug optional libcoq-elpi-dbgsym_1.16.0-1build1_ppc64el.ddeb 0d5c802a41e526838553f3d12336d434 3082260 ocaml optional libcoq-elpi_1.16.0-1build1_ppc64el.deb /<>/coq-elpi_1.16.0-1build1_ppc64el.changes.new could not be renamed to /<>/coq-elpi_1.16.0-1build1_ppc64el.changes: Illegal seek Distribution field may be wrong!!! +------------------------------------------------------------------------------+ | Buildinfo | +------------------------------------------------------------------------------+ Format: 1.0 Source: coq-elpi Binary: libcoq-elpi libcoq-elpi-dbgsym Architecture: ppc64el Version: 1.16.0-1build1 Checksums-Md5: ebf44091d4ba6f84521730545ef55290 83968 libcoq-elpi-dbgsym_1.16.0-1build1_ppc64el.ddeb 0d5c802a41e526838553f3d12336d434 3082260 libcoq-elpi_1.16.0-1build1_ppc64el.deb Checksums-Sha1: 0a9106ab9768e11ce2f8b78939e9489f21660af9 83968 libcoq-elpi-dbgsym_1.16.0-1build1_ppc64el.ddeb a8b4206cdda9c879ce01a0ac0ac9f78466cfc984 3082260 libcoq-elpi_1.16.0-1build1_ppc64el.deb Checksums-Sha256: b88e26b5a5a92e6b8d7c3fb77477aa8ef7660ddd3927c33c45d11d422712cc2d 83968 libcoq-elpi-dbgsym_1.16.0-1build1_ppc64el.ddeb ffdb5df4104df43df6bd142780af16367a5da609dda2efe1ac2775024b6a4964 3082260 libcoq-elpi_1.16.0-1build1_ppc64el.deb Build-Origin: Ubuntu Build-Architecture: ppc64el Build-Date: Sun, 27 Nov 2022 08:04:32 +0000 Build-Path: /<> Build-Tainted-By: merged-usr-via-aliased-dirs usr-local-has-programs Installed-Build-Depends: autoconf (= 2.71-2), automake (= 1:1.16.5-1.3), autopoint (= 0.21-10), autotools-dev (= 20220109.1), base-files (= 12.3ubuntu1), base-passwd (= 3.6.1), bash (= 5.2-1ubuntu2), binutils (= 2.39-8ubuntu2), binutils-common (= 2.39-8ubuntu2), binutils-powerpc64le-linux-gnu (= 2.39-8ubuntu2), bsdextrautils (= 2.38-4ubuntu1), bsdutils (= 1:2.38-4ubuntu1), build-essential (= 12.9ubuntu3), bzip2 (= 1.0.8-5build1), coq (= 8.16.0+dfsg-1build1), coreutils (= 8.32-4.1ubuntu1), cpp (= 4:12.2.0-1ubuntu1), cpp-12 (= 12.2.0-9ubuntu1), dash (= 0.5.11+git20210903+057cd650a4ed-8ubuntu1), debconf (= 1.5.79ubuntu1), debhelper (= 13.10.1ubuntu1), debianutils (= 5.7-0.4), debugedit (= 1:5.0-5), dh-autoreconf (= 20), dh-coq (= 0.5), dh-ocaml (= 1.1.3), dh-strip-nondeterminism (= 1.13.0-1), diffutils (= 1:3.8-1), dpkg (= 1.21.9ubuntu1), dpkg-dev (= 1.21.9ubuntu1), dwz (= 0.14+20220924-2), file (= 1:5.41-4), findutils (= 4.9.0-3ubuntu1), g++ (= 4:12.2.0-1ubuntu1), g++-12 (= 12.2.0-9ubuntu1), gcc (= 4:12.2.0-1ubuntu1), gcc-12 (= 12.2.0-9ubuntu1), gcc-12-base (= 12.2.0-9ubuntu1), gettext (= 0.21-10), gettext-base (= 0.21-10), grep (= 3.8-3), groff-base (= 1.22.4-9), gzip (= 1.12-1ubuntu1), hostname (= 3.23ubuntu2), init-system-helpers (= 1.65.2), intltool-debian (= 0.35.0+20060710.6), libacl1 (= 2.3.1-1), libarchive-zip-perl (= 1.68-1), libasan8 (= 12.2.0-9ubuntu1), libatomic1 (= 12.2.0-9ubuntu1), libattr1 (= 1:2.5.1-1build1), libaudit-common (= 1:3.0.7-1ubuntu2), libaudit1 (= 1:3.0.7-1ubuntu2), libbinutils (= 2.39-8ubuntu2), libblkid1 (= 2.38-4ubuntu1), libbz2-1.0 (= 1.0.8-5build1), libc-bin (= 2.36-0ubuntu4), libc-dev-bin (= 2.36-0ubuntu4), libc6 (= 2.36-0ubuntu4), libc6-dev (= 2.36-0ubuntu4), libcap-ng0 (= 0.8.3-1build1), libcap2 (= 1:2.44-1build3), libcc1-0 (= 12.2.0-9ubuntu1), libcom-err2 (= 1.46.6~rc1-1ubuntu1), libcoq-core-ocaml (= 8.16.0+dfsg-1build1), libcoq-core-ocaml-dev (= 8.16.0+dfsg-1build1), libcoq-stdlib (= 8.16.0+dfsg-1build1), libcrypt-dev (= 1:4.4.33-1), libcrypt1 (= 1:4.4.33-1), libctf-nobfd0 (= 2.39-8ubuntu2), libctf0 (= 2.39-8ubuntu2), libdb5.3 (= 5.3.28+dfsg1-0.10), libdebconfclient0 (= 0.264ubuntu1), libdebhelper-perl (= 13.10.1ubuntu1), libdpkg-perl (= 1.21.9ubuntu1), libdw1 (= 0.188-1), libelf1 (= 0.188-1), libelpi-ocaml (= 1.16.7-2), libelpi-ocaml-dev (= 1.16.7-2), libexpat1 (= 2.5.0-1), libffi8 (= 3.4.4-1), libfile-stripnondeterminism-perl (= 1.13.0-1), libfindlib-ocaml (= 1.9.3-1), libfindlib-ocaml-dev (= 1.9.3-1), libgcc-12-dev (= 12.2.0-9ubuntu1), libgcc-s1 (= 12.2.0-9ubuntu1), libgcrypt20 (= 1.10.1-2ubuntu1), libgdbm-compat4 (= 1.23-3), libgdbm6 (= 1.23-3), libgmp-dev (= 2:6.2.1+dfsg1-1ubuntu2), libgmp10 (= 2:6.2.1+dfsg1-1ubuntu2), libgmp3-dev (= 2:6.2.1+dfsg1-1ubuntu2), libgmpxx4ldbl (= 2:6.2.1+dfsg1-1ubuntu2), libgomp1 (= 12.2.0-9ubuntu1), libgpg-error0 (= 1.46-1), libgssapi-krb5-2 (= 1.20.1-1), libicu71 (= 71.1-3ubuntu1), libisl23 (= 0.25-1), libitm1 (= 12.2.0-9ubuntu1), libk5crypto3 (= 1.20.1-1), libkeyutils1 (= 1.6.3-1), libkrb5-3 (= 1.20.1-1), libkrb5support0 (= 1.20.1-1), liblsan0 (= 12.2.0-9ubuntu1), liblz4-1 (= 1.9.4-1), liblzma5 (= 5.2.8-0.0), libmagic-mgc (= 1:5.41-4), libmagic1 (= 1:5.41-4), libmenhir-ocaml-dev (= 20220210+ds-2), libmount1 (= 2.38-4ubuntu1), libmpc3 (= 1.2.1-2build1), libmpdec3 (= 2.5.1-2build2), libmpfr6 (= 4.1.0-3build3), libncurses-dev (= 6.3+20220423-2), libncurses5-dev (= 6.3+20220423-2), libncurses6 (= 6.3+20220423-2), libncursesw6 (= 6.3+20220423-2), libnsl-dev (= 1.3.0-2build2), libnsl2 (= 1.3.0-2build2), libocaml-compiler-libs-ocaml-dev (= 0.12.4-1build1), libpam-modules (= 1.5.2-5ubuntu1), libpam-modules-bin (= 1.5.2-5ubuntu1), libpam-runtime (= 1.5.2-5ubuntu1), libpam0g (= 1.5.2-5ubuntu1), libpcre2-8-0 (= 10.40-1ubuntu1), libperl5.36 (= 5.36.0-4ubuntu2), libpipeline1 (= 1.5.7-1), libppx-derivers-ocaml-dev (= 1.2.1-1build3), libppx-deriving-ocaml (= 5.2.1-1build2), libppx-deriving-ocaml-dev (= 5.2.1-1build2), libppxlib-ocaml-dev (= 0.27.0-2build1), libpython3-stdlib (= 3.10.6-1ubuntu1), libpython3.10-minimal (= 3.10.8-3), libpython3.10-stdlib (= 3.10.8-3), libquadmath0 (= 12.2.0-9ubuntu1), libre-ocaml-dev (= 1.10.3-1build1), libreadline8 (= 8.2-1.2), libresult-ocaml (= 1.5-1build2), libresult-ocaml-dev (= 1.5-1build2), libseccomp2 (= 2.5.4-1ubuntu2), libselinux1 (= 3.4-1build1), libsexplib0-ocaml (= 0.15.1-1), libsexplib0-ocaml-dev (= 0.15.1-1), libsmartcols1 (= 2.38-4ubuntu1), libsqlite3-0 (= 3.40.0-1), libssl3 (= 3.0.5-2ubuntu2), libstdc++-12-dev (= 12.2.0-9ubuntu1), libstdc++6 (= 12.2.0-9ubuntu1), libsub-override-perl (= 0.09-4), libsystemd0 (= 251.4-1ubuntu7), libtinfo6 (= 6.3+20220423-2), libtirpc-common (= 1.3.3+ds-1), libtirpc-dev (= 1.3.3+ds-1), libtirpc3 (= 1.3.3+ds-1), libtool (= 2.4.7-5), libtsan2 (= 12.2.0-9ubuntu1), libubsan1 (= 12.2.0-9ubuntu1), libuchardet0 (= 0.0.7-1build2), libudev1 (= 251.4-1ubuntu7), libunistring2 (= 1.0-2), libuuid1 (= 2.38-4ubuntu1), libxml2 (= 2.9.14+dfsg-1.1), libzarith-ocaml (= 1.12-1build1), libzarith-ocaml-dev (= 1.12-1build1), libzstd1 (= 1.5.2+dfsg-1), linux-libc-dev (= 5.19.0-23.24), login (= 1:4.13+dfsg1-1ubuntu1), lsb-base (= 11.2ubuntu1), lto-disabled-list (= 36), m4 (= 1.4.19-1), make (= 4.3-4.1build1), man-db (= 2.11.1-1), mawk (= 1.3.4.20200120-3.1), media-types (= 8.0.0), ncurses-base (= 6.3+20220423-2), ncurses-bin (= 6.3+20220423-2), ocaml (= 4.13.1-3ubuntu1), ocaml-base (= 4.13.1-3ubuntu1), ocaml-compiler-libs (= 4.13.1-3ubuntu1), ocaml-findlib (= 1.9.3-1), ocaml-interp (= 4.13.1-3ubuntu1), ocaml-nox (= 4.13.1-3ubuntu1), patch (= 2.7.6-7build2), perl (= 5.36.0-4ubuntu2), perl-base (= 5.36.0-4ubuntu2), perl-modules-5.36 (= 5.36.0-4ubuntu2), po-debconf (= 1.0.21+nmu1), python3 (= 3.10.6-1ubuntu1), python3-minimal (= 3.10.6-1ubuntu1), python3.10 (= 3.10.8-3), python3.10-minimal (= 3.10.8-3), readline-common (= 8.2-1.2), rpcsvc-proto (= 1.4.2-0ubuntu6), sed (= 4.8-1ubuntu2), sensible-utils (= 0.0.17), sysvinit-utils (= 3.04-1ubuntu1), tar (= 1.34+dfsg-1.1), usrmerge (= 33ubuntu1), util-linux (= 2.38-4ubuntu1), util-linux-extra (= 2.38-4ubuntu1), xz-utils (= 5.2.8-0.0), zlib1g (= 1:1.2.13.dfsg-1ubuntu2) Environment: DEB_BUILD_OPTIONS="parallel=4" DEB_BUILD_PROFILES="noudeb" LANG="C.UTF-8" LC_ALL="C.UTF-8" SOURCE_DATE_EPOCH="1669534670" +------------------------------------------------------------------------------+ | Package contents | +------------------------------------------------------------------------------+ libcoq-elpi_1.16.0-1build1_ppc64el.deb -------------------------------------- new Debian package, version 2.0. size 3082260 bytes: control archive=5303 bytes. 797 bytes, 20 lines control 17873 bytes, 196 lines md5sums Package: libcoq-elpi Source: coq-elpi Version: 1.16.0-1build1 Architecture: ppc64el Maintainer: Ubuntu Developers Original-Maintainer: Debian OCaml Maintainers Installed-Size: 18292 Depends: libelpi-ocaml-dev, libcoq-ocaml-dev (>= 8.15), libcoq-stdlib-haa55, libcoq-core-ocaml-uf529, libelpi-ocaml-dj8o6, libzarith-ocaml-4dps0, ocaml-base-4.13.1 Provides: libcoq-elpi-23tt3 Section: ocaml Priority: optional Homepage: https://github.com/LPCIC/coq-elpi Description: Coq plugin embedding Elpi This package makes it possible to define new commands and tactics for Coq in Elpi. . Elpi implements a lambda-Prolog interpreter enriched with constraint handling rules. . Coq is a proof assistant for higher-order logic. drwxr-xr-x root/root 0 2022-11-27 07:37 ./ drwxr-xr-x root/root 0 2022-11-27 07:37 ./usr/ drwxr-xr-x root/root 0 2022-11-27 07:37 ./usr/lib/ drwxr-xr-x root/root 0 2022-11-27 07:37 ./usr/lib/ocaml/ drwxr-xr-x root/root 0 2022-11-27 07:37 ./usr/lib/ocaml/coq-core/ drwxr-xr-x root/root 0 2022-11-27 07:37 ./usr/lib/ocaml/coq-elpi/ -rw-r--r-- root/root 249 2022-11-27 07:37 ./usr/lib/ocaml/coq-elpi/META -rw-r--r-- root/root 4528117 2022-11-27 07:37 ./usr/lib/ocaml/coq-elpi/elpi_plugin.cma -rw-r--r-- root/root 110484 2022-11-27 07:37 ./usr/lib/ocaml/coq-elpi/elpi_plugin.cmi -rw-r--r-- root/root 4528110 2022-11-27 07:37 ./usr/lib/ocaml/coq-elpi/elpi_plugin.cmo -rw-r--r-- root/root 101334 2022-11-27 07:37 ./usr/lib/ocaml/coq-elpi/elpi_plugin.cmx -rw-r--r-- root/root 10385 2022-11-27 07:37 ./usr/lib/ocaml/coq-elpi/elpi_plugin.cmxa -rw-r--r-- root/root 1613200 2022-11-27 07:37 ./usr/lib/ocaml/coq-elpi/elpi_plugin.cmxs drwxr-xr-x root/root 0 2022-11-27 07:37 ./usr/lib/ocaml/coq/ drwxr-xr-x root/root 0 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/ drwxr-xr-x root/root 0 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/ drwxr-xr-x root/root 0 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/ -rw-r--r-- root/root 82 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/NES.glob -rw-r--r-- root/root 1403 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/NES.v -rw-r--r-- root/root 117781 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/NES.vo -rw-r--r-- root/root 89 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive.glob -rw-r--r-- root/root 2680 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive.v -rw-r--r-- root/root 120221 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive.vo drwxr-xr-x root/root 0 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/ -rw-r--r-- root/root 4866 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/bcongr.elpi -rw-r--r-- root/root 2271 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/bcongr.glob -rw-r--r-- root/root 1811 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/bcongr.v -rw-r--r-- root/root 124273 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/bcongr.vo -rw-r--r-- root/root 1912 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/cast.elpi -rw-r--r-- root/root 200 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/cast.glob -rw-r--r-- root/root 676 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/cast.v -rw-r--r-- root/root 122534 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/cast.vo -rw-r--r-- root/root 5428 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/derive.elpi -rw-r--r-- root/root 417 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/derive_hook.elpi -rw-r--r-- root/root 1318 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/discriminate.elpi -rw-r--r-- root/root 6982 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eq.elpi -rw-r--r-- root/root 1287 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eq.glob -rw-r--r-- root/root 1900 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eq.v -rw-r--r-- root/root 122156 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eq.vo -rw-r--r-- root/root 3910 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqK.elpi -rw-r--r-- root/root 3612 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqK.glob -rw-r--r-- root/root 2342 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqK.v -rw-r--r-- root/root 122084 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqK.vo -rw-r--r-- root/root 1591 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqOK.elpi -rw-r--r-- root/root 460 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqOK.glob -rw-r--r-- root/root 1741 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqOK.v -rw-r--r-- root/root 151261 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqOK.vo -rw-r--r-- root/root 6673 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqType.elpi -rw-r--r-- root/root 891 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqType_ast.glob -rw-r--r-- root/root 1547 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqType_ast.v -rw-r--r-- root/root 124777 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqType_ast.vo -rw-r--r-- root/root 10373 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqb.elpi -rw-r--r-- root/root 5655 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqb.glob -rw-r--r-- root/root 2000 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqb.v -rw-r--r-- root/root 195658 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqb.vo -rw-r--r-- root/root 2663 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqbOK.elpi -rw-r--r-- root/root 2546 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqbOK.glob -rw-r--r-- root/root 1560 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqbOK.v -rw-r--r-- root/root 149017 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqbOK.vo -rw-r--r-- root/root 21390 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqb_core_defs.glob -rw-r--r-- root/root 4313 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqb_core_defs.v -rw-r--r-- root/root 27983 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqb_core_defs.vo -rw-r--r-- root/root 18912 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqbcorrect.elpi -rw-r--r-- root/root 8846 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqbcorrect.glob -rw-r--r-- root/root 3444 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqbcorrect.v -rw-r--r-- root/root 208590 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqbcorrect.vo -rw-r--r-- root/root 4892 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqcorrect.elpi -rw-r--r-- root/root 2311 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqcorrect.glob -rw-r--r-- root/root 2446 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqcorrect.v -rw-r--r-- root/root 139151 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/eqcorrect.vo -rw-r--r-- root/root 194 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/experimental.glob -rw-r--r-- root/root 310 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/experimental.v -rw-r--r-- root/root 2780 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/experimental.vo -rw-r--r-- root/root 12553 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/fields.elpi -rw-r--r-- root/root 2429 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/fields.glob -rw-r--r-- root/root 1628 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/fields.v -rw-r--r-- root/root 161922 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/fields.vo -rw-r--r-- root/root 3358 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/idx2inv.elpi -rw-r--r-- root/root 1666 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/idx2inv.glob -rw-r--r-- root/root 1754 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/idx2inv.v -rw-r--r-- root/root 144303 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/idx2inv.vo -rw-r--r-- root/root 5347 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/induction.elpi -rw-r--r-- root/root 284 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/induction.glob -rw-r--r-- root/root 1636 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/induction.v -rw-r--r-- root/root 140121 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/induction.vo -rw-r--r-- root/root 2055 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/injection.elpi -rw-r--r-- root/root 3654 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/invert.elpi -rw-r--r-- root/root 239 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/invert.glob -rw-r--r-- root/root 1190 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/invert.v -rw-r--r-- root/root 115496 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/invert.vo -rw-r--r-- root/root 1567 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/isK.elpi -rw-r--r-- root/root 254 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/isK.glob -rw-r--r-- root/root 1517 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/isK.v -rw-r--r-- root/root 111215 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/isK.vo -rw-r--r-- root/root 346 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/legacy.glob -rw-r--r-- root/root 354 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/legacy.v -rw-r--r-- root/root 21310 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/legacy.vo -rw-r--r-- root/root 3533 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/lens.elpi -rw-r--r-- root/root 1591 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/lens.glob -rw-r--r-- root/root 1732 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/lens.v -rw-r--r-- root/root 117182 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/lens.vo -rw-r--r-- root/root 4743 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/lens_laws.elpi -rw-r--r-- root/root 7435 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/lens_laws.glob -rw-r--r-- root/root 2409 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/lens_laws.v -rw-r--r-- root/root 126279 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/lens_laws.vo -rw-r--r-- root/root 7050 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/map.elpi -rw-r--r-- root/root 127 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/map.glob -rw-r--r-- root/root 1257 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/map.v -rw-r--r-- root/root 122197 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/map.vo -rw-r--r-- root/root 7397 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param1.elpi -rw-r--r-- root/root 5331 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param1.glob -rw-r--r-- root/root 3477 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param1.v -rw-r--r-- root/root 141834 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param1.vo -rw-r--r-- root/root 2414 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param1_congr.elpi -rw-r--r-- root/root 947 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param1_congr.glob -rw-r--r-- root/root 1645 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param1_congr.v -rw-r--r-- root/root 119659 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param1_congr.vo -rw-r--r-- root/root 8849 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param1_functor.elpi -rw-r--r-- root/root 1497 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param1_functor.glob -rw-r--r-- root/root 1635 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param1_functor.v -rw-r--r-- root/root 127260 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param1_functor.vo -rw-r--r-- root/root 5063 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param1_inhab.elpi -rw-r--r-- root/root 5078 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param1_trivial.elpi -rw-r--r-- root/root 8363 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param1_trivial.glob -rw-r--r-- root/root 7154 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param1_trivial.v -rw-r--r-- root/root 166088 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param1_trivial.vo -rw-r--r-- root/root 8457 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param2.elpi -rw-r--r-- root/root 966 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param2.glob -rw-r--r-- root/root 1954 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param2.v -rw-r--r-- root/root 133184 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/param2.vo -rw-r--r-- root/root 2881 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/paramX_lib.elpi -rw-r--r-- root/root 5551 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/projK.elpi -rw-r--r-- root/root 247 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/projK.glob -rw-r--r-- root/root 1528 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/projK.v -rw-r--r-- root/root 121537 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/projK.vo -rw-r--r-- root/root 833 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/std.glob -rw-r--r-- root/root 861 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/std.v -rw-r--r-- root/root 287219 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/std.vo -rw-r--r-- root/root 2377 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/tag.elpi -rw-r--r-- root/root 266 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/tag.glob -rw-r--r-- root/root 1125 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/tag.v -rw-r--r-- root/root 117339 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/derive/tag.vo drwxr-xr-x root/root 0 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/ -rw-r--r-- root/root 95 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/assumption.glob -rw-r--r-- root/root 322 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/assumption.v -rw-r--r-- root/root 105050 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/assumption.vo -rw-r--r-- root/root 89 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/case.glob -rw-r--r-- root/root 1179 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/case.v -rw-r--r-- root/root 108545 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/case.vo -rw-r--r-- root/root 90 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/clear.glob -rw-r--r-- root/root 1928 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/clear.v -rw-r--r-- root/root 110788 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/clear.vo -rw-r--r-- root/root 96 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/constructor.glob -rw-r--r-- root/root 527 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/constructor.v -rw-r--r-- root/root 106110 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/constructor.vo -rw-r--r-- root/root 90 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/cycle.glob -rw-r--r-- root/root 679 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/cycle.v -rw-r--r-- root/root 107212 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/cycle.vo -rw-r--r-- root/root 360 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/discriminate.glob -rw-r--r-- root/root 610 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/discriminate.v -rw-r--r-- root/root 109641 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/discriminate.vo -rw-r--r-- root/root 89 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/fail.glob -rw-r--r-- root/root 303 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/fail.v -rw-r--r-- root/root 104893 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/fail.vo -rw-r--r-- root/root 95 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/generalize.glob -rw-r--r-- root/root 588 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/generalize.v -rw-r--r-- root/root 106627 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/generalize.vo -rw-r--r-- root/root 235 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/injection.glob -rw-r--r-- root/root 668 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/injection.v -rw-r--r-- root/root 111949 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/injection.vo -rw-r--r-- root/root 90 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/intro.glob -rw-r--r-- root/root 472 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/intro.v -rw-r--r-- root/root 105736 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/intro.vo -rw-r--r-- root/root 490 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/tactics.glob -rw-r--r-- root/root 142 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/tactics.v -rw-r--r-- root/root 3938 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/eltac/tactics.vo -rw-r--r-- root/root 708 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/locker.glob -rw-r--r-- root/root 2152 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/locker.v -rw-r--r-- root/root 116010 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/apps/locker.vo -rw-r--r-- root/root 77347 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/coq-builtin.elpi -rw-r--r-- root/root 32406 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/coq-lib.elpi -rw-r--r-- root/root 37489 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/elpi-builtin.elpi -rw-r--r-- root/root 444 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/elpi.glob -rw-r--r-- root/root 1850 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/elpi.v -rw-r--r-- root/root 256377 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/elpi.vo -rw-r--r-- root/root 14917 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/elpi_elaborator.elpi -rw-r--r-- root/root 1613200 2022-11-27 07:37 ./usr/lib/ocaml/coq/user-contrib/elpi/elpi_plugin.cmxs drwxr-xr-x root/root 0 2022-11-27 07:37 ./usr/share/ drwxr-xr-x root/root 0 2022-11-27 07:37 ./usr/share/coq/ -rw-r--r-- root/root 12008 2022-11-27 07:37 ./usr/share/coq/coq-elpi.lang drwxr-xr-x root/root 0 2022-11-27 07:37 ./usr/share/doc/ drwxr-xr-x root/root 0 2022-11-27 07:37 ./usr/share/doc/libcoq-elpi/ -rw-r--r-- root/root 598 2022-11-27 07:37 ./usr/share/doc/libcoq-elpi/changelog.Debian.gz -rw-r--r-- root/root 1031 2022-11-19 17:31 ./usr/share/doc/libcoq-elpi/copyright drwxr-xr-x root/root 0 2022-11-27 07:37 ./usr/share/doc/libcoq-elpi/examples/ -rw-r--r-- root/root 1942 2022-11-10 10:36 ./usr/share/doc/libcoq-elpi/examples/example_curry_howard_tactics.v -rw-r--r-- root/root 2374 2022-11-10 10:36 ./usr/share/doc/libcoq-elpi/examples/example_data_base.v -rw-r--r-- root/root 2850 2022-11-10 10:36 ./usr/share/doc/libcoq-elpi/examples/example_fuzzer.v -rw-r--r-- root/root 1124 2022-11-10 10:36 ./usr/share/doc/libcoq-elpi/examples/example_generalize.v -rw-r--r-- root/root 2372 2022-11-10 10:36 ./usr/share/doc/libcoq-elpi/examples/example_import_projections.v -rw-r--r-- root/root 8751 2022-11-10 10:36 ./usr/share/doc/libcoq-elpi/examples/example_record_expansion.v -rw-r--r-- root/root 2668 2022-11-10 10:36 ./usr/share/doc/libcoq-elpi/examples/example_record_to_sigma.v -rw-r--r-- root/root 1170 2022-11-10 10:36 ./usr/share/doc/libcoq-elpi/examples/example_reduction_surgery.v -rw-r--r-- root/root 8990 2022-11-10 10:36 ./usr/share/doc/libcoq-elpi/examples/example_reflexive_tactic.v -rw-r--r-- root/root 668 2022-11-10 10:36 ./usr/share/doc/libcoq-elpi/examples/readme.v -rw-r--r-- root/root 21004 2022-11-10 10:36 ./usr/share/doc/libcoq-elpi/examples/tutorial_coq_elpi_HOAS.v -rw-r--r-- root/root 20402 2022-11-10 10:36 ./usr/share/doc/libcoq-elpi/examples/tutorial_coq_elpi_command.v -rw-r--r-- root/root 29293 2022-11-10 10:36 ./usr/share/doc/libcoq-elpi/examples/tutorial_coq_elpi_tactic.v -rw-r--r-- root/root 37045 2022-11-10 10:36 ./usr/share/doc/libcoq-elpi/examples/tutorial_elpi_lang.v -rw-r--r-- root/root 2841 2022-11-10 10:36 ./usr/share/doc/libcoq-elpi/examples/usage.v -rw-r--r-- root/root 1663 2022-11-10 10:36 ./usr/share/doc/libcoq-elpi/examples/usage_NES.v -rw-r--r-- root/root 312 2022-11-10 10:36 ./usr/share/doc/libcoq-elpi/examples/usage_eltac.v drwxr-xr-x root/root 0 2022-11-27 07:37 ./var/ drwxr-xr-x root/root 0 2022-11-27 07:37 ./var/lib/ drwxr-xr-x root/root 0 2022-11-27 07:37 ./var/lib/coq/ drwxr-xr-x root/root 0 2022-11-27 07:37 ./var/lib/coq/md5sums/ -rw-r--r-- root/root 5 2022-11-27 07:37 ./var/lib/coq/md5sums/libcoq-elpi.checksum +------------------------------------------------------------------------------+ | Post Build | +------------------------------------------------------------------------------+ +------------------------------------------------------------------------------+ | Cleanup | +------------------------------------------------------------------------------+ Purging /<> Not removing build depends: as requested +------------------------------------------------------------------------------+ | Summary | +------------------------------------------------------------------------------+ Build Architecture: ppc64el Build Type: any Build-Space: 75760 Build-Time: 97 Distribution: lunar-proposed Host Architecture: ppc64el Install-Time: 51 Job: coq-elpi_1.16.0-1build1.dsc Machine Architecture: ppc64el Package: coq-elpi Package-Time: 148 Source-Version: 1.16.0-1build1 Space: 75760 Status: successful Version: 1.16.0-1build1 -------------------------------------------------------------------------------- Finished at 2022-11-27T08:04:33Z Build needed 00:02:28, 75760k disk space Adding user buildd to group lxd RUN: /usr/share/launchpad-buildd/bin/in-target scan-for-processes --backend=chroot --series=lunar --arch=ppc64el PACKAGEBUILD-24874149 Scanning for processes to kill in build PACKAGEBUILD-24874149