Diff of the two buildlogs: -- --- b1/build.log 2025-03-19 08:15:55.056411351 +0000 +++ b2/build.log 2025-03-19 08:29:09.000608583 +0000 @@ -1,6 +1,6 @@ I: pbuilder: network access will be disabled during build -I: Current time: Tue Apr 21 02:30:41 -12 2026 -I: pbuilder-time-stamp: 1776781841 +I: Current time: Wed Mar 19 22:15:58 +14 2025 +I: pbuilder-time-stamp: 1742372158 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/unstable-reproducible-base.tgz] I: copying local configuration @@ -22,52 +22,84 @@ dpkg-source: info: unpacking coq-elpi_2.5.0-1.debian.tar.xz I: Not using root during the build. I: Installing the build-deps -I: user script /srv/workspace/pbuilder/4053802/tmp/hooks/D02_print_environment starting +I: user script /srv/workspace/pbuilder/1399090/tmp/hooks/D01_modify_environment starting +debug: Running on ionos1-amd64. +I: Changing host+domainname to test build reproducibility +I: Adding a custom variable just for the fun of it... +I: Changing /bin/sh to bash +'/bin/sh' -> '/bin/bash' +lrwxrwxrwx 1 root root 9 Mar 19 08:16 /bin/sh -> /bin/bash +I: Setting pbuilder2's login shell to /bin/bash +I: Setting pbuilder2's GECOS to second user,second room,second work-phone,second home-phone,second other +I: user script /srv/workspace/pbuilder/1399090/tmp/hooks/D01_modify_environment finished +I: user script /srv/workspace/pbuilder/1399090/tmp/hooks/D02_print_environment starting I: set - BUILDDIR='/build/reproducible-path' - BUILDUSERGECOS='first user,first room,first work-phone,first home-phone,first other' - BUILDUSERNAME='pbuilder1' - BUILD_ARCH='amd64' - DEBIAN_FRONTEND='noninteractive' - DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=42 ' - DISTRIBUTION='unstable' - HOME='/root' - HOST_ARCH='amd64' + BASH=/bin/sh + BASHOPTS=checkwinsize:cmdhist:complete_fullquote:extquote:force_fignore:globasciiranges:globskipdots:hostcomplete:interactive_comments:patsub_replacement:progcomp:promptvars:sourcepath + BASH_ALIASES=() + BASH_ARGC=() + BASH_ARGV=() + BASH_CMDS=() + BASH_LINENO=([0]="12" [1]="0") + BASH_LOADABLES_PATH=/usr/local/lib/bash:/usr/lib/bash:/opt/local/lib/bash:/usr/pkg/lib/bash:/opt/pkg/lib/bash:. + BASH_SOURCE=([0]="/tmp/hooks/D02_print_environment" [1]="/tmp/hooks/D02_print_environment") + BASH_VERSINFO=([0]="5" [1]="2" [2]="37" [3]="1" [4]="release" [5]="x86_64-pc-linux-gnu") + BASH_VERSION='5.2.37(1)-release' + BUILDDIR=/build/reproducible-path + BUILDUSERGECOS='second user,second room,second work-phone,second home-phone,second other' + BUILDUSERNAME=pbuilder2 + BUILD_ARCH=amd64 + DEBIAN_FRONTEND=noninteractive + DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=20 ' + DIRSTACK=() + DISTRIBUTION=unstable + EUID=0 + FUNCNAME=([0]="Echo" [1]="main") + GROUPS=() + HOME=/root + HOSTNAME=i-capture-the-hostname + HOSTTYPE=x86_64 + HOST_ARCH=amd64 IFS=' ' - INVOCATION_ID='051c315a52c24942a01d21e23ad17fc2' - LANG='C' - LANGUAGE='en_US:en' - LC_ALL='C' - MAIL='/var/mail/root' - OPTIND='1' - PATH='/usr/sbin:/usr/bin:/sbin:/bin:/usr/games' - PBCURRENTCOMMANDLINEOPERATION='build' - PBUILDER_OPERATION='build' - PBUILDER_PKGDATADIR='/usr/share/pbuilder' - PBUILDER_PKGLIBDIR='/usr/lib/pbuilder' - PBUILDER_SYSCONFDIR='/etc' - PPID='4053802' - PS1='# ' - PS2='> ' + INVOCATION_ID=b8e7f52e91544f88989f36047b441b2c + LANG=C + LANGUAGE=et_EE:et + LC_ALL=C + MACHTYPE=x86_64-pc-linux-gnu + MAIL=/var/mail/root + OPTERR=1 + OPTIND=1 + OSTYPE=linux-gnu + PATH=/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path + PBCURRENTCOMMANDLINEOPERATION=build + PBUILDER_OPERATION=build + PBUILDER_PKGDATADIR=/usr/share/pbuilder + PBUILDER_PKGLIBDIR=/usr/lib/pbuilder + PBUILDER_SYSCONFDIR=/etc + PIPESTATUS=([0]="0") + POSIXLY_CORRECT=y + PPID=1399090 PS4='+ ' - PWD='/' - SHELL='/bin/bash' - SHLVL='2' - SUDO_COMMAND='/usr/bin/timeout -k 18.1h 18h /usr/bin/ionice -c 3 /usr/bin/nice /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.mvsEo2Ro/pbuilderrc_wb43 --distribution unstable --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/unstable-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.mvsEo2Ro/b1 --logfile b1/build.log coq-elpi_2.5.0-1.dsc' - SUDO_GID='111' - SUDO_UID='106' - SUDO_USER='jenkins' - TERM='unknown' - TZ='/usr/share/zoneinfo/Etc/GMT+12' - USER='root' - _='/usr/bin/systemd-run' - http_proxy='http://213.165.73.152:3128' + PWD=/ + SHELL=/bin/bash + SHELLOPTS=braceexpand:errexit:hashall:interactive-comments:posix + SHLVL=3 + SUDO_COMMAND='/usr/bin/timeout -k 24.1h 24h /usr/bin/ionice -c 3 /usr/bin/nice -n 11 /usr/bin/unshare --uts -- /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.mvsEo2Ro/pbuilderrc_l80P --distribution unstable --hookdir /etc/pbuilder/rebuild-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/unstable-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.mvsEo2Ro/b2 --logfile b2/build.log coq-elpi_2.5.0-1.dsc' + SUDO_GID=110 + SUDO_UID=105 + SUDO_USER=jenkins + TERM=unknown + TZ=/usr/share/zoneinfo/Etc/GMT-14 + UID=0 + USER=root + _='I: set' + http_proxy=http://46.16.76.132:3128 I: uname -a - Linux ionos15-amd64 6.12.12+bpo-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.12.12-1~bpo12+1 (2025-02-23) x86_64 GNU/Linux + Linux i-capture-the-hostname 6.1.0-32-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.129-1 (2025-03-06) x86_64 GNU/Linux I: ls -l /bin - lrwxrwxrwx 1 root root 7 Mar 4 2025 /bin -> usr/bin -I: user script /srv/workspace/pbuilder/4053802/tmp/hooks/D02_print_environment finished + lrwxrwxrwx 1 root root 7 Mar 4 11:20 /bin -> usr/bin +I: user script /srv/workspace/pbuilder/1399090/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy @@ -282,7 +314,7 @@ Get: 87 http://deb.debian.org/debian unstable/main amd64 libstdio-ocaml-dev amd64 0.17.0-1+b1 [114 kB] Get: 88 http://deb.debian.org/debian unstable/main amd64 libppx-optcomp-ocaml-dev amd64 1:0.17.0-1+b6 [327 kB] Get: 89 http://deb.debian.org/debian unstable/main amd64 ocaml-dune amd64 3.17.2-1 [4834 kB] -Fetched 371 MB in 29s (13.0 MB/s) +Fetched 371 MB in 23s (15.9 MB/s) Preconfiguring packages ... Selecting previously unselected package libpython3.13-minimal:amd64. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 19784 files and directories currently installed.) @@ -580,8 +612,8 @@ Setting up tzdata (2025a-2) ... Current default time zone: 'Etc/UTC' -Local time is now: Tue Apr 21 14:35:05 UTC 2026. -Universal Time is now: Tue Apr 21 14:35:05 UTC 2026. +Local time is now: Wed Mar 19 08:21:06 UTC 2025. +Universal Time is now: Wed Mar 19 08:21:06 UTC 2025. Run 'dpkg-reconfigure tzdata' if you wish to change it. Setting up autotools-dev (20220109.1) ... @@ -665,7 +697,11 @@ Building tag database... -> Finished parsing the build-deps I: Building the package -I: Running cd /build/reproducible-path/coq-elpi-2.5.0/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-genchanges -S > ../coq-elpi_2.5.0-1_source.changes +I: user script /srv/workspace/pbuilder/1399090/tmp/hooks/A99_set_merged_usr starting +Not re-configuring usrmerge for unstable +I: user script /srv/workspace/pbuilder/1399090/tmp/hooks/A99_set_merged_usr finished +hostname: Name or service not known +I: Running cd /build/reproducible-path/coq-elpi-2.5.0/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path" HOME="/nonexistent/second-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path" HOME="/nonexistent/second-build" dpkg-genchanges -S > ../coq-elpi_2.5.0-1_source.changes dpkg-buildpackage: info: source package coq-elpi dpkg-buildpackage: info: source version 2.5.0-1 dpkg-buildpackage: info: source distribution UNRELEASED @@ -679,7 +715,7 @@ dune clean Warning: Cache directories could not be created: Permission denied; disabling cache -Hint: Make sure the directory /nonexistent/first-build/.cache/dune/db/temp +Hint: Make sure the directory /nonexistent/second-build/.cache/dune/db/temp can be created make[1]: Leaving directory '/build/reproducible-path/coq-elpi-2.5.0' dh_ocamlclean @@ -697,17 +733,8 @@ dune build Warning: Cache directories could not be created: Permission denied; disabling cache -Hint: Make sure the directory /nonexistent/first-build/.cache/dune/db/temp +Hint: Make sure the directory /nonexistent/second-build/.cache/dune/db/temp can be created -File "./apps/NES/elpi/dummy.v", line 1, characters 0-99: -Warning: To avoid stack overflow, large numbers in nat are interpreted as -applications of Nat.of_num_uint. [abstract-large-number,numbers,default] -File "./apps/NES/elpi/dummy.v", line 2, characters 0-65: -Warning: To avoid stack overflow, large numbers in nat are interpreted as -applications of Nat.of_num_uint. [abstract-large-number,numbers,default] -File "./apps/NES/elpi/dummy.v", line 3, characters 0-66: -Warning: To avoid stack overflow, large numbers in nat are interpreted as -applications of Nat.of_num_uint. [abstract-large-number,numbers,default] File "./elpi/dummy.v", line 1, characters 0-93: Warning: To avoid stack overflow, large numbers in nat are interpreted as applications of Nat.of_num_uint. [abstract-large-number,numbers,default] @@ -747,10 +774,13 @@ File "./elpi/dummy.v", line 13, characters 0-70: Warning: To avoid stack overflow, large numbers in nat are interpreted as applications of Nat.of_num_uint. [abstract-large-number,numbers,default] -File "./apps/locker/elpi/dummy.v", line 1, characters 0-99: +File "./apps/NES/elpi/dummy.v", line 1, characters 0-99: Warning: To avoid stack overflow, large numbers in nat are interpreted as applications of Nat.of_num_uint. [abstract-large-number,numbers,default] -File "./apps/locker/elpi/dummy.v", line 2, characters 0-61: +File "./apps/NES/elpi/dummy.v", line 2, characters 0-65: +Warning: To avoid stack overflow, large numbers in nat are interpreted as +applications of Nat.of_num_uint. [abstract-large-number,numbers,default] +File "./apps/NES/elpi/dummy.v", line 3, characters 0-66: Warning: To avoid stack overflow, large numbers in nat are interpreted as applications of Nat.of_num_uint. [abstract-large-number,numbers,default] File "./apps/derive/elpi/dummy.v", line 1, characters 0-99: @@ -900,6 +930,12 @@ File "./apps/tc/elpi/dummy.v", line 15, characters 0-59: Warning: To avoid stack overflow, large numbers in nat are interpreted as applications of Nat.of_num_uint. [abstract-large-number,numbers,default] +File "./apps/locker/elpi/dummy.v", line 1, characters 0-99: +Warning: To avoid stack overflow, large numbers in nat are interpreted as +applications of Nat.of_num_uint. [abstract-large-number,numbers,default] +File "./apps/locker/elpi/dummy.v", line 2, characters 0-61: +Warning: To avoid stack overflow, large numbers in nat are interpreted as +applications of Nat.of_num_uint. [abstract-large-number,numbers,default] File "./theories-stdlib/Vector.v", line 1, characters 0-31: Warning: Using Vector.t is known to be technically difficult, see . @@ -924,1490 +960,86 @@ 2410 | type 'arg tactic_main = Solve of 'arg list | Custom of string ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Warning 34 [unused-type-declaration]: unused type tactic_main. -File "./apps/eltac/theories/apply.v", line 15, characters 16-19: -Warning: -File "./apps/eltac/theories/apply.v", line 15, characters 16-19 -Ctx is linear: name it _Ctx (discard) or Ctx_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -Query assignments: - GRnat = indt «nat» - GRplus = const «Nat.add» - GRs = indc «S» -Query assignments: - Bo = app [global (indc «S»), app [global (indc «S»), global (indc «O»)]] - C = «x» - GR = const «x» - Ty = global (indt «nat») - TyC = global (indt «nat») -Query assignments: - Bo = fun `x` (global (indt «nat»)) c0 \ c0 - C = «f» -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]]] - C = «Nat.add» -The return type of m is: c0 \ c1 \ -fun `x` (global (indt «nat»)) c2 \ - fun `e` - (app [global (indt «eq»), global (indt «nat»), global (indc «O»), c2]) - c3 \ prod `_` (app [c1, global (indc «O»)]) c4 \ app [c1, c2] -Query assignments: - C = «m» - RT = c0 \ c1 \ -fun `x` (global (indt «nat»)) c2 \ - fun `e` - (app [global (indt «eq»), global (indt «nat»), global (indc «O»), c2]) - c3 \ prod `_` (app [c1, global (indc «O»)]) c4 \ app [c1, c2] -typ «elpi_examples.tutorial_coq_elpi_HOAS.6» < -typ «elpi_examples.tutorial_coq_elpi_HOAS.7» -Debug: Cannot enforce elpi_examples.tutorial_coq_elpi_HOAS.7 <= -elpi_examples.tutorial_coq_elpi_HOAS.6 because -elpi_examples.tutorial_coq_elpi_HOAS.6 -< elpi_examples.tutorial_coq_elpi_HOAS.7 -Query assignments: - U = typ «elpi_examples.tutorial_coq_elpi_HOAS.6» - U1 = typ «elpi_examples.tutorial_coq_elpi_HOAS.7» -Universe constraints: -UNIVERSES: - {elpi_examples.tutorial_coq_elpi_HOAS.7 - elpi_examples.tutorial_coq_elpi_HOAS.6} |= - elpi_examples.tutorial_coq_elpi_HOAS.6 < elpi_examples.tutorial_coq_elpi_HOAS.7 -ALGEBRAIC UNIVERSES: - {} -FLEXIBLE UNIVERSES: - -SORTS: - -WEAK CONSTRAINTS: - - -(id b) is: app [fun `x` (sort (typ X0)) c0 \ c0, sort (typ X1)] -(id a) is illtyped: -Illegal application: -The term "fun x : Type => x" of type "Type -> Type" -cannot be applied to the term - "Type" : "Type" -This term has type "Type@{elpi_examples.tutorial_coq_elpi_HOAS.8+1}" -which should be a subtype of "Type@{elpi_examples.tutorial_coq_elpi_HOAS.8}". -(universe inconsistency: Cannot enforce elpi_examples.tutorial_coq_elpi_HOAS.8 -< elpi_examples.tutorial_coq_elpi_HOAS.8 because -elpi_examples.tutorial_coq_elpi_HOAS.8 -= elpi_examples.tutorial_coq_elpi_HOAS.8) -after typing (id b) is: -app - [fun `x` (sort (typ «elpi_examples.tutorial_coq_elpi_HOAS.8»)) c0 \ c0, - sort (typ «elpi_examples.tutorial_coq_elpi_HOAS.9»)] : -sort (typ «elpi_examples.tutorial_coq_elpi_HOAS.8») -Universe constraints: UNIVERSES: - {elpi_examples.tutorial_coq_elpi_HOAS.9 - elpi_examples.tutorial_coq_elpi_HOAS.8} |= - elpi_examples.tutorial_coq_elpi_HOAS.9 < elpi_examples.tutorial_coq_elpi_HOAS.8 - ALGEBRAIC UNIVERSES: - {elpi_examples.tutorial_coq_elpi_HOAS.9 - elpi_examples.tutorial_coq_elpi_HOAS.8} - FLEXIBLE UNIVERSES: - elpi_examples.tutorial_coq_elpi_HOAS.9 - elpi_examples.tutorial_coq_elpi_HOAS.8 - SORTS: - - WEAK CONSTRAINTS: - - -Query assignments: - A = sort (typ «elpi_examples.tutorial_coq_elpi_HOAS.8») - B = sort (typ «elpi_examples.tutorial_coq_elpi_HOAS.9») - ErrMsg = Illegal application: -The term "fun x : Type => x" of type "Type -> Type" -cannot be applied to the term - "Type" : "Type" -This term has type "Type@{elpi_examples.tutorial_coq_elpi_HOAS.8+1}" -which should be a subtype of "Type@{elpi_examples.tutorial_coq_elpi_HOAS.8}". -(universe inconsistency: Cannot enforce elpi_examples.tutorial_coq_elpi_HOAS.8 -< elpi_examples.tutorial_coq_elpi_HOAS.8 because -elpi_examples.tutorial_coq_elpi_HOAS.8 -= elpi_examples.tutorial_coq_elpi_HOAS.8) - ID = fun `x` (sort (typ «elpi_examples.tutorial_coq_elpi_HOAS.8»)) c0 \ c0 - T = sort (typ «elpi_examples.tutorial_coq_elpi_HOAS.8») - U = «elpi_examples.tutorial_coq_elpi_HOAS.8» - V = «elpi_examples.tutorial_coq_elpi_HOAS.9» -Universe constraints: -UNIVERSES: - {elpi_examples.tutorial_coq_elpi_HOAS.9 - elpi_examples.tutorial_coq_elpi_HOAS.8} |= - elpi_examples.tutorial_coq_elpi_HOAS.9 < elpi_examples.tutorial_coq_elpi_HOAS.8 -ALGEBRAIC UNIVERSES: - {elpi_examples.tutorial_coq_elpi_HOAS.9 - elpi_examples.tutorial_coq_elpi_HOAS.8} -FLEXIBLE UNIVERSES: - elpi_examples.tutorial_coq_elpi_HOAS.9 - elpi_examples.tutorial_coq_elpi_HOAS.8 -SORTS: - -WEAK CONSTRAINTS: - - -app - [global (const «Nat.add»), - app [global (indc «S»), global (indc «O»)], - app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] -= -app - [global (const «Nat.add»), - app [global (indc «S»), global (indc «O»)], - app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] -app - [global (const «Nat.add»), - app [global (indc «S»), global (indc «O»)], - app [global (indc «S»), global (indc «O»)]] -Query assignments: - S = indc «S» -fun `x` (global (indt «nat»)) c0 \ - fun `x` (global (indt «nat»)) c1 \ - app [global (const «Nat.add»), c1, c0] -fun `x` (global (indt «nat»)) c0 \ - fun `x` (global (indt «nat»)) c1 \ - app [global (const «Nat.add»), c1, c0] -fun `a` (global (indt «nat»)) c0 \ - fun `b` (global (indt «nat»)) c1 \ - app [global (const «Nat.add»), c1, c0] -Query assignments: - X = c0 \ c1 \ -app [global (const «Nat.add»), c1, c0] -fun `a` (global (indt «nat»)) c0 \ - fun `b` (global (indt «nat»)) c1 \ - app [global (indt «eq»), global (indt «nat»), c0, c1] -indt «nat» -indt «nat» -before: -fun `ax` (global (indt «nat»)) c0 \ - fun `b` (global (indt «nat»)) c1 \ - app [global (indt «eq»), X0 c1, c0, c1] -after: -fun `ax` (global (indt «nat»)) c0 \ - fun `b` (global (indt «nat»)) c1 \ - app [global (indt «eq»), global (indt «nat»), c0, c1] -Query assignments: - T = fun `ax` (global (indt «nat»)) c0 \ - fun `b` (global (indt «nat»)) c1 \ - app [global (indt «eq»), global (indt «nat»), c0, c1] - X1_ = c0 \ -global (indt «nat») -Universe constraints: -UNIVERSES: - {elpi_examples.tutorial_coq_elpi_HOAS.11 - elpi_examples.tutorial_coq_elpi_HOAS.10} |= - elpi_examples.tutorial_coq_elpi_HOAS.11 < elpi_examples.tutorial_coq_elpi_HOAS.10 - Set <= elpi_examples.tutorial_coq_elpi_HOAS.11 - elpi_examples.tutorial_coq_elpi_HOAS.11 <= eq.u0 -ALGEBRAIC UNIVERSES: - {} -FLEXIBLE UNIVERSES: - -SORTS: - α6 := Type -WEAK CONSTRAINTS: - - -Query assignments: - Bo = c0 \ -app - [global (const «Nat.add»), c0, - app [global (indc «S»), global (indc «O»)]] - N = `x` - T = fun `x` (global (indt «nat»)) c0 \ - app - [global (const «Nat.add»), c0, - app [global (indc «S»), global (indc «O»)]] - Ty = global (indt «nat») -Query assignments: - Bo = c0 \ -app - [global (const «Nat.add»), c0, - app [global (indc «S»), global (indc «O»)]] - N = `x` - T = fun `x` (global (indt «nat»)) c0 \ - app - [global (const «Nat.add»), c0, - app [global (indc «S»), global (indc «O»)]] - Ty = global (indt «nat») -raw T = X0 - -SHELF: -FUTURE GOALS STACK: - - -Rocq-Elpi mapping: -RAW: -ELAB: - --------------------------------- - evar (X1) (global (indt «nat»)) (X1) /* suspended on X1 */ -EVARS: - ?X11==[ |- nat] (internal placeholder) {?e0} - ?X10==[ |- => nat] (internal placeholder) - -SHELF: -FUTURE GOALS STACK: - ?X11 - -Rocq-Elpi mapping: -RAW: -?X11 <-> X1 -ELAB: -?X11 <-> X1 - -Query assignments: - T = X1 - X2_ = X1 -Syntactic constraints: - evar (X1) (global (indt «nat»)) (X1) /* suspended on X1 */ -Universe constraints: -UNIVERSES: - {elpi_examples.tutorial_coq_elpi_HOAS.12} |= - Set <= elpi_examples.tutorial_coq_elpi_HOAS.12 -ALGEBRAIC UNIVERSES: - {} -FLEXIBLE UNIVERSES: - -SORTS: - α7 := Type -WEAK CONSTRAINTS: - - -raw T = -fun `x` (global (indt «nat»)) c0 \ - app [global (const «Nat.add»), c0, X0 c0] - {c0 c1} : decl c1 `x` (global (indt «nat»)) - ?- evar (X1 c1) (global (indt «nat»)) (X1 c1) /* suspended on X1 */ -EVARS: - ?X13==[x |- nat] (internal placeholder) {?e0} - ?X12==[x |- => nat] (internal placeholder) - -SHELF: -FUTURE GOALS STACK: - ?X13 - -Rocq-Elpi mapping: -RAW: -?X13 <-> c0 \ X1 c0 -ELAB: -?X13 <-> X1 - +«elpi.tests.test_API_notations.abbr» Query assignments: - Bo = c0 \ -app [global (const «Nat.add»), c0, X1 c0] - N = `x` - T = fun `x` (global (indt «nat»)) c0 \ - app [global (const «Nat.add»), c0, X1 c0] - Ty = global (indt «nat») - X3_ = c0 \ + A = «elpi.tests.test_API_notations.abbr» + X1_ = X0 + X2_ = c0 \ X1 c0 + X3_ = c0 \ +X2 c0 Syntactic constraints: - {c0 c1} : decl c1 `x` (global (indt «nat»)) - ?- evar (X1 c1) (global (indt «nat»)) (X1 c1) /* suspended on X1 */ + {c0} : decl c0 `x` X0 ?- evar (X2 c0) (X3 c0) (X2 c0) /* suspended on X2 */ + {c0} : decl c0 `x` X0 + ?- evar (X4 c0) (sort (typ «elpi.tests.test_API_notations.3»)) (X3 c0) /* suspended on X4, X3 */ + {c0} : decl c0 `x` X0 + ?- evar (X1 c0) (sort (typ «elpi.tests.test_API_notations.2»)) (X1 c0) /* suspended on X1 */ + evar (X0) (sort (typ «elpi.tests.test_API_notations.1»)) (X0) /* suspended on X0 */ Universe constraints: UNIVERSES: - {elpi_examples.tutorial_coq_elpi_HOAS.13} |= - Set <= elpi_examples.tutorial_coq_elpi_HOAS.13 + {elpi.tests.test_API_notations.3 elpi.tests.test_API_notations.2 + elpi.tests.test_API_notations.1} |= ALGEBRAIC UNIVERSES: {} FLEXIBLE UNIVERSES: SORTS: - α8 := Type + α1 + α2 + α3 WEAK CONSTRAINTS: -Bo1 (not in pattern fragment) = -app - [global (const «Nat.add»), - app [global (indc «S»), global (indc «O»)], - X0 (app [global (indc «S»), global (indc «O»)])] -Bo1 before = -app - [global (const «Nat.add»), - app [global (indc «S»), global (indc «O»)], - X0 (app [global (indc «S»), global (indc «O»)])] -Bo1 after = -app - [global (const «Nat.add»), - app [global (indc «S»), global (indc «O»)], X1] +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: - Bo = c0 \ -app [global (const «Nat.add»), c0, X1] - Bo1 = app - [global (const «Nat.add»), - app [global (indc «S»), global (indc «O»)], X1] - N = `x` - T = fun `x` (global (indt «nat»)) c0 \ app [global (const «Nat.add»), c0, X1] - Ty = global (indt «nat») + X4_ = X0 X5_ = c0 \ -X1 +X1 c0 + X6_ = c0 \ +X2 c0 Syntactic constraints: - evar (X1) (global (indt «nat»)) (X1) /* suspended on X1 */ + {c0} : decl c0 `x` X0 ?- evar (X2 c0) (X3 c0) (X2 c0) /* suspended on X2 */ + {c0} : decl c0 `x` X0 + ?- evar (X4 c0) (sort (typ «elpi.tests.test_API_notations.6»)) (X3 c0) /* suspended on X4, X3 */ + {c0} : decl c0 `x` X0 + ?- evar (X1 c0) (sort (typ «elpi.tests.test_API_notations.5»)) (X1 c0) /* suspended on X1 */ + evar (X0) (sort (typ «elpi.tests.test_API_notations.4»)) (X0) /* suspended on X0 */ Universe constraints: UNIVERSES: - {elpi_examples.tutorial_coq_elpi_HOAS.14} |= - Set <= elpi_examples.tutorial_coq_elpi_HOAS.14 + {elpi.tests.test_API_notations.6 elpi.tests.test_API_notations.5 + elpi.tests.test_API_notations.4} |= ALGEBRAIC UNIVERSES: {} FLEXIBLE UNIVERSES: SORTS: - α9 := Type + α4 + α5 + α6 WEAK CONSTRAINTS: +Notation abbr2 _elpi_ctx_entry_1_was_x_ := + (fun _ => _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 +fun `_` X0 c0 \ + app [global (indt «eq»), X1, fun `x` X2 c1 \ c1, fun `x` X2 c1 \ c1] Query assignments: - Bo = c0 \ -app [global (const «andb»), c0, X0 c0] - Bo1 = app - [global (const «andb»), app [global (indc «S»), global (indc «O»)], - X0 (app [global (indc «S»), global (indc «O»)])] - Bo2 = app - [global (const «andb»), - app - [global (const «nat2bool»), - app [global (indc «S»), global (indc «O»)]], X1] - N = `x` - T = fun `x` (global (indt «nat»)) c0 \ app [global (const «andb»), c0, X0 c0] - Ty = global (indt «nat») - X6_ = X0 -Syntactic constraints: - evar (X2) (global (indt «bool»)) X1 /* suspended on X2, X1 */ -File "./examples/tutorial_coq_elpi_HOAS.v", line 87, characters 19-24: -Warning: -File "./examples/tutorial_coq_elpi_HOAS.v", line 87, characters 19-24 -GRnat is linear: name it _GRnat (discard) or GRnat_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_HOAS.v", line 89, characters 20-26: -Warning: -File "./examples/tutorial_coq_elpi_HOAS.v", line 89, characters 20-26 -GRplus is linear: name it _GRplus (discard) or GRplus_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_HOAS.v", line 88, characters 17-20: -Warning: -File "./examples/tutorial_coq_elpi_HOAS.v", line 88, characters 17-20 -GRs is linear: name it _GRs (discard) or GRs_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_HOAS.v", line 113, characters 24-26: -Warning: -File "./examples/tutorial_coq_elpi_HOAS.v", line 113, characters 24-26 -Bo is linear: name it _Bo (discard) or Bo_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_HOAS.v", line 107, characters 20-22: -Warning: -File "./examples/tutorial_coq_elpi_HOAS.v", line 107, characters 20-22 -Ty is linear: name it _Ty (discard) or Ty_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_HOAS.v", line 113, characters 28-31: -Warning: -File "./examples/tutorial_coq_elpi_HOAS.v", line 113, characters 28-31 -TyC is linear: name it _TyC (discard) or TyC_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_HOAS.v", line 152, characters 24-26: -Warning: -File "./examples/tutorial_coq_elpi_HOAS.v", line 152, characters 24-26 -Bo is linear: name it _Bo (discard) or Bo_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_HOAS.v", line 195, characters 24-26: -Warning: -File "./examples/tutorial_coq_elpi_HOAS.v", line 195, characters 24-26 -Bo is linear: name it _Bo (discard) or Bo_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_HOAS.v", line 285, characters 17-18: -Warning: -File "./examples/tutorial_coq_elpi_HOAS.v", line 285, characters 17-18 -V is linear: name it _V (discard) or V_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_HOAS.v", line 681, characters 10-11: -Warning: -File "./examples/tutorial_coq_elpi_HOAS.v", line 681, characters 10-11 -N is linear: name it _N (discard) or N_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_HOAS.v", line 681, characters 12-14: -Warning: -File "./examples/tutorial_coq_elpi_HOAS.v", line 681, characters 12-14 -Ty is linear: name it _Ty (discard) or Ty_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_HOAS.v", line 718, characters 10-11: -Warning: -File "./examples/tutorial_coq_elpi_HOAS.v", line 718, characters 10-11 -N is linear: name it _N (discard) or N_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_HOAS.v", line 718, characters 12-14: -Warning: -File "./examples/tutorial_coq_elpi_HOAS.v", line 718, characters 12-14 -Ty is linear: name it _Ty (discard) or Ty_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_HOAS.v", line 756, characters 40-43: -Warning: -File "./examples/tutorial_coq_elpi_HOAS.v", line 756, characters 40-43 -Bo2 is linear: name it _Bo2 (discard) or Bo2_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_HOAS.v", line 754, characters 10-11: -Warning: -File "./examples/tutorial_coq_elpi_HOAS.v", line 754, characters 10-11 -N is linear: name it _N (discard) or N_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_HOAS.v", line 754, characters 12-14: -Warning: -File "./examples/tutorial_coq_elpi_HOAS.v", line 754, characters 12-14 -Ty is linear: name it _Ty (discard) or Ty_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -Notation p2 := (p2 nat 3 x) -example_import_projections.p1 nat 3 x : nat - : nat -p1 : forall (T : Type) (t : T), r T t -> nat - : forall (T : Type) (t : T), r T t -> nat -eq_refl -: -example_import_projections.p1 bool false (Build bool false 3 eq_refl eq_refl) = -3 - : example_import_projections.p1 bool false - (Build bool false 3 eq_refl eq_refl) = 3 -example_import_projections.f1 _ x - : bool -(eq_refl : 2 = (let z := 1 in S z)) -foo = -{f1 : Type & {f2 : f1 -> Type & forall t : f1, f2 t -> bool}} - : Type -mk_foo = -fun (f1 : Type) (f2 : f1 -> Type) (f3 : forall t : f1, f2 t -> bool) => -existT (fun f4 : Type => {f5 : f4 -> Type & forall t : f4, f5 t -> bool}) f1 - (existT (fun f4 : f1 -> Type => forall t : f1, f4 t -> bool) f2 f3) - : forall (f1 : Type) (f2 : f1 -> Type), - (forall t : f1, f2 t -> bool) -> foo - -Arguments mk_foo f1%type_scope (f2 f3)%function_scope -The Db contains [phone_prefix USA 1] -Phone prefix for USA is 1 -The Db contains -[phone_prefix USA 1, phone_prefix France 33, phone_prefix Italy 39] -Phone prefix for France is 33 -sweet! -brr -yummy! -goal X0 c0 c1 c2 c3 is - -[decl c3 `H` (app [global (const «lt»), c0, c1]), - decl c2 `z` (global (indt «nat»)), decl c1 `y` (global (indt «nat»)), - decl c0 `x` (global (indt «nat»))] -------- - -prod `_` (app [global (const «lt»), c1, c2]) c4 \ - app [global (const «lt»), c0, c2] -3 -The age of alice is 20 -Query assignments: - A = 20 -mallory is 23 years old -Query assignments: - P = mallory -alice is 20 years old -Query assignments: - P = alice -mallory and bob are 23 years old -Query assignments: - A = 23 - P = mallory - Q = bob -I picked P = mallory -I picked Q = mallory -I picked Q = bob -the last choice worked! -mallory and bob are 23 years old -Query assignments: - A = 23 - P = mallory - Q = bob -bob is older than alice -Query assignments: - X = alice -both bob and mallory are older than alice -Query assignments: - X = alice -F = c0 \ age alice c0 -F 20 = age alice 20 -F 23 = age alice 23 -Query assignments: - F = c0 \ -age alice c0 -λx.x ~> fun c0 \ c0 -(λx.x) (λx.x) ~> fun c0 \ c0 -Query assignments: - I = fun c0 \ c0 - T = fun c0 \ c0 - T1 = fun c0 \ c0 -(Fst foo bar) ~> foo -(foo bar) ~> app foo bar -Query assignments: - Fst = fun c0 \ fun c1 \ c0 - S = app foo bar - S1 = app foo bar - T = app (app (fun c0 \ fun c1 \ c0) foo) bar - T1 = foo -The type of λx.λy.x is: arr X0 (arr X1 X0) -Query assignments: - Ty = arr X0 (arr X1 X0) -Error: fun c0 \ app c0 c0 has no type -Query assignments: - Delta = fun c0 \ app c0 c0 - Ty = X0 -2 + 1 = s (s (s z)) -Query assignments: - R = s (s (s z)) -Query assignments: - X = X0 - Z = X1 -Syntactic constraints: sum X0 (s z) X1 /* suspended on X0 */ -The result is: s z -Query assignments: - X = z - Z = s z -Query assignments: - X = s z -Debug: sum X0 (s z) X1 /* suspended on X0 */ -Currently Y = X1 -Debug: sum X2 (s z) X3 /* suspended on X2 */ -Currently Y = s X3 -Finally Y = s (s z) -Query assignments: - X = s z - Y = s (s z) - Z = z -Query assignments: - X = X0 -Syntactic constraints: - even X0 /* suspended on X0 */ odd X0 /* suspended on X0 */ -X0 can't be even and odd at the same time -Query assignments: - A = [1, 2, 3, 3, 2, 1] -Query assignments: - A = [1, 2, 3, 3, 2, 1] -result = 5 -Query assignments: - X = result = - Y = 5 -result = 5 -Query assignments: - %arg1 = 5 -Query assignments: - R1 = X0 - R2 = [2, 3, 4] - R3 = [2, 3, 4] -Query assignments: - R = [2, 3, 4] -Y = c0 -arr X0 (arr X1 X0) -Query assignments: - Ty = arr X0 (arr X1 X0) -Debug: run 1 {{{ - -Debug: - rid:0 step:1 gid:4 user:curgoal = , - of (fun c0 \ fun c1 \ c0) X0 , coq.say X0 - -Debug: - rid:0 step:1 gid:4 user:rule = and - -Debug: - rid:0 step:1 gid:4 user:subgoal = 5 - -Debug: - rid:0 step:1 gid:5 user:newgoal = of (fun c0 \ fun c1 \ c0) X0 - -Debug: - rid:0 step:1 gid:4 user:subgoal = 6 - -Debug: - rid:0 step:1 gid:6 user:newgoal = coq.say X0 - -Debug: - rid:0 step:1 gid:4 user:rule:and = success - -Debug: }}} -> (0.000s) -Debug: run 2 {{{ - -Debug: - rid:0 step:2 gid:5 user:curgoal = of - of (fun c0 \ fun c1 \ c0) X0 - -Debug: - rid:0 step:2 gid:5 user:rule = backchain - -Debug: - rid:0 step:2 gid:5 user:rule:backchain:candidates = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: - -Debug: }}} -> (0.000s) -Debug: select 3 {{{ - -Debug: - rid:0 step:2 gid:5 user:rule:backchain:try = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: - (of (fun A0) (arr A2 A1)) :- ( - pi (c0 \ - (of c0 A2 => of (A0 c0) A1))). - -Debug: - rid:0 step:2 gid:0 user:assign = A0 := c0 \ - fun c1 \ c0 - -Debug: - rid:0 step:2 gid:0 user:assign = X0 := arr X1 X2 - -Debug: - rid:0 step:2 gid:5 user:subgoal = 7 - -Debug: - rid:0 step:2 gid:7 user:newgoal = pi c0 \ of c0 X1 => of (fun c1 \ c0) X2 - -Debug: - rid:0 step:2 gid:7 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 3 {{{ - -Debug: - rid:0 step:3 gid:7 user:curgoal = pi - pi c0 \ of c0 X1 => of (fun c1 \ c0) X2 - -Debug: rid:0 step:3 gid:7 user:rule = pi - -Debug: - rid:0 step:3 gid:7 user:subgoal = 8 - -Debug: - rid:0 step:3 gid:8 user:newgoal = of c0 X1 => of (fun c1 \ c0) X2 - -Debug: - rid:0 step:3 gid:8 user:rule:pi = success - -Debug: }}} -> (0.000s) -Debug: run 4 {{{ - -Debug: - rid:0 step:4 gid:8 user:curgoal = => - of c0 X1 => of (fun c1 \ c0) X2 - -Debug: - rid:0 step:4 gid:8 user:rule = implication - -Debug: - rid:0 step:4 gid:8 user:subgoal = 9 - -Debug: - rid:0 step:4 gid:9 user:newgoal = of (fun c1 \ c0) X2 - -Debug: - rid:0 step:4 gid:9 user:rule:implication = success - -Debug: }}} -> (0.000s) -Debug: run 5 {{{ - -Debug: - rid:0 step:5 gid:9 user:curgoal = of - of (fun c1 \ c0) X2 - -Debug: - rid:0 step:5 gid:9 user:rule = backchain - -Debug: - rid:0 step:5 gid:9 user:rule:backchain:candidates = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: - -Debug: }}} -> (0.000s) -Debug: select 4 {{{ - -Debug: - rid:0 step:5 gid:9 user:rule:backchain:try = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: - (of (fun A0) (arr A2 A1)) :- ( - pi (c0 \ - (of c0 A2 => of (A0 c0) A1))). - -Debug: - rid:0 step:5 gid:0 user:assign = A0 := c1 \ - c0 - -Debug: - rid:0 step:5 gid:0 user:assign = X2 := arr X3 X4 - -Debug: - rid:0 step:5 gid:9 user:subgoal = 10 - -Debug: - rid:0 step:5 gid:10 user:newgoal = pi c1 \ of c1 X3 => of c0 X4 - -Debug: - rid:0 step:5 gid:10 user:rule:backchain = success - -Debug: }}} -> (0.001s) -Debug: run 6 {{{ - -Debug: - rid:0 step:6 gid:10 user:curgoal = pi - pi c1 \ of c1 X3 => of c0 X4 - -Debug: - rid:0 step:6 gid:10 user:rule = pi - -Debug: - rid:0 step:6 gid:10 user:subgoal = 11 - -Debug: - rid:0 step:6 gid:11 user:newgoal = of c1 X3 => of c0 X4 - -Debug: - rid:0 step:6 gid:11 user:rule:pi = success - -Debug: }}} -> (0.001s) -Debug: run 7 {{{ - -Debug: - rid:0 step:7 gid:11 user:curgoal = => - of c1 X3 => of c0 X4 - -Debug: - rid:0 step:7 gid:11 user:rule = implication - -Debug: - rid:0 step:7 gid:11 user:subgoal = 12 - -Debug: - rid:0 step:7 gid:12 user:newgoal = of c0 X4 - -Debug: - rid:0 step:7 gid:12 user:rule:implication = success - -Debug: }}} -> (0.000s) -Debug: run 8 {{{ - -Debug: - rid:0 step:8 gid:12 user:curgoal = of - of c0 X4 - -Debug: - rid:0 step:8 gid:12 user:rule = backchain - -Debug: - rid:0 step:8 gid:12 user:rule:backchain:candidates = File "(context step_id:4)", line 1, column 0, characters 0-0: - -Debug: }}} -> (0.000s) -Debug: select 5 {{{ - -Debug: - rid:0 step:8 gid:12 user:rule:backchain:try = File "(context step_id:4)", line 1, column 0, characters 0-0: - (of c0 X1) :- . - -Debug: - rid:0 step:8 gid:0 user:assign = X1 := X4 - -Debug: - rid:0 step:8 gid:12 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 9 {{{ - -Debug: - rid:0 step:9 gid:6 user:curgoal = coq.say - coq.say (arr X4 (arr X3 X4)) - -Debug: - rid:0 step:9 gid:6 user:rule = builtin - -Debug: - rid:0 step:9 gid:6 user:rule:builtin:name = coq.say - -arr X4 (arr X3 X4) -Debug: - rid:0 step:9 gid:6 user:rule:builtin = success - -Debug: }}} -> (0.000s) -Query assignments: - Ty = arr X4 (arr X3 X4) -Debug: run 1 {{{ - -Debug: - rid:1 step:1 gid:13 user:curgoal = , - of (fun c0 \ app c0 c0) X0 , coq.say X0 - -Debug: - rid:1 step:1 gid:13 user:rule = and - -Debug: - rid:1 step:1 gid:13 user:subgoal = 14 - -Debug: - rid:1 step:1 gid:14 user:newgoal = of (fun c0 \ app c0 c0) X0 - -Debug: - rid:1 step:1 gid:13 user:subgoal = 15 - -Debug: - rid:1 step:1 gid:15 user:newgoal = coq.say X0 - -Debug: - rid:1 step:1 gid:13 user:rule:and = success - -Debug: }}} -> (0.000s) -Debug: run 2 {{{ - -Debug: - rid:1 step:2 gid:14 user:curgoal = of - of (fun c0 \ app c0 c0) X0 - -Debug: - rid:1 step:2 gid:14 user:rule = backchain - -Debug: - rid:1 step:2 gid:14 user:rule:backchain:candidates = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: - -Debug: }}} -> (0.000s) -Debug: select 3 {{{ - -Debug: - rid:1 step:2 gid:14 user:rule:backchain:try = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: - (of (fun A0) (arr A2 A1)) :- ( - pi (c0 \ - (of c0 A2 => of (A0 c0) A1))). - -Debug: - rid:1 step:2 gid:0 user:assign = A0 := c0 \ - app c0 c0 - -Debug: - rid:1 step:2 gid:0 user:assign = X0 := arr X1 X2 - -Debug: - rid:1 step:2 gid:14 user:subgoal = 16 - -Debug: - rid:1 step:2 gid:16 user:newgoal = pi c0 \ of c0 X1 => of (app c0 c0) X2 - -Debug: - rid:1 step:2 gid:16 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 3 {{{ - -Debug: - rid:1 step:3 gid:16 user:curgoal = pi - pi c0 \ of c0 X1 => of (app c0 c0) X2 - -Debug: - rid:1 step:3 gid:16 user:rule = pi - -Debug: - rid:1 step:3 gid:16 user:subgoal = 17 - -Debug: - rid:1 step:3 gid:17 user:newgoal = of c0 X1 => of (app c0 c0) X2 - -Debug: - rid:1 step:3 gid:17 user:rule:pi = success - -Debug: }}} -> (0.000s) -Debug: run 4 {{{ - -Debug: - rid:1 step:4 gid:17 user:curgoal = => - of c0 X1 => of (app c0 c0) X2 - -Debug: - rid:1 step:4 gid:17 user:rule = implication - -Debug: - rid:1 step:4 gid:17 user:subgoal = 18 - -Debug: - rid:1 step:4 gid:18 user:newgoal = of (app c0 c0) X2 - -Debug: - rid:1 step:4 gid:18 user:rule:implication = success - -Debug: }}} -> (0.000s) -Debug: run 5 {{{ - -Debug: - rid:1 step:5 gid:18 user:curgoal = of - of (app c0 c0) X2 - -Debug: - rid:1 step:5 gid:18 user:rule = backchain - -Debug: - rid:1 step:5 gid:18 user:rule:backchain:candidates = File "./examples/tutorial_elpi_lang.v", line 591, column 2, characters 15200-15250: - -Debug: }}} -> (0.000s) -Debug: select 4 {{{ - -Debug: - rid:1 step:5 gid:18 user:rule:backchain:try = File "./examples/tutorial_elpi_lang.v", line 591, column 2, characters 15200-15250: - (of (app A0 A3) A2) :- ( - of A0 (arr A1 A2)), - (of A3 A1). - -Debug: - rid:1 step:5 gid:0 user:assign = A0 := c0 - -Debug: - rid:1 step:5 gid:0 user:assign = A3 := c0 - -Debug: - rid:1 step:5 gid:0 user:assign = A2 := X2 - -Debug: - rid:1 step:5 gid:18 user:subgoal = 19 - -Debug: - rid:1 step:5 gid:19 user:newgoal = of c0 (arr X3^1 X2) - -Debug: - rid:1 step:5 gid:19 user:subgoal = 20 - -Debug: - rid:1 step:5 gid:20 user:newgoal = of c0 X3^1 - -Debug: - rid:1 step:5 gid:19 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 6 {{{ - -Debug: - rid:1 step:6 gid:19 user:curgoal = of - of c0 (arr X3^1 X2) - -Debug: - rid:1 step:6 gid:19 user:rule = backchain - -Debug: - rid:1 step:6 gid:19 user:rule:backchain:candidates = File "(context step_id:4)", line 1, column 0, characters 0-0: - -Debug: }}} -> (0.000s) -Debug: select 5 {{{ - -Debug: - rid:1 step:6 gid:19 user:rule:backchain:try = File "(context step_id:4)", line 1, column 0, characters 0-0: - (of c0 X1) :- . - -Debug: - rid:1 step:6 gid:0 user:assign:expand = X3^1 := X4 c0 - -Debug: - rid:1 step:6 gid:0 user:assign:restrict = 0 X4 c0 := c0 \ - .X5 - -Debug: - rid:1 step:6 gid:0 user:assign = X1 := arr X5 X2 - -Debug: - rid:1 step:6 gid:19 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 7 {{{ - -Debug: - rid:1 step:7 gid:20 user:curgoal = of - of c0 X5 - -Debug: - rid:1 step:7 gid:20 user:rule = backchain - -Debug: - rid:1 step:7 gid:20 user:rule:backchain:candidates = File "(context step_id:4)", line 1, column 0, characters 0-0: - -Debug: }}} -> (0.000s) -Debug: select 6 {{{ - -Debug: - rid:1 step:7 gid:20 user:rule:backchain:try = File "(context step_id:4)", line 1, column 0, characters 0-0: - (of c0 (arr X5 X2)) :- . - -Debug: - rid:1 step:7 gid:20 user:backchain:fail-to = unify X5 with arr X5 X2 - -Debug: }}} -> (0.000s) -Debug: select 7 {{{ - -Debug: - rid:1 step:7 gid:20 user:rule:backchain = fail - -Debug: }}} -> (0.000s) -Debug: run 6 {{{ - -Debug: - rid:2 step:6 gid:27 user:curgoal = pi - pi c1 \ of c1 X0 => of c0 X1 - -Debug: - rid:2 step:6 gid:27 user:rule = pi - -Debug: - rid:2 step:6 gid:27 user:subgoal = 28 - -Debug: - rid:2 step:6 gid:28 user:newgoal = of c1 X0 => of c0 X1 - -Debug: - rid:2 step:6 gid:28 user:rule:pi = success - -Debug: }}} -> (0.000s) -Debug: run 7 {{{ - -Debug: - rid:2 step:7 gid:28 user:curgoal = => - of c1 X0 => of c0 X1 - -Debug: - rid:2 step:7 gid:28 user:rule = implication - -Debug: - rid:2 step:7 gid:28 user:subgoal = 29 - -Debug: - rid:2 step:7 gid:29 user:newgoal = of c0 X1 - -Debug: - rid:2 step:7 gid:29 user:rule:implication = success - -Debug: }}} -> (0.000s) -Debug: run 8 {{{ - -Debug: - rid:2 step:8 gid:29 user:curgoal = of - of c0 X1 - -Debug: - rid:2 step:8 gid:29 user:rule = backchain - -Debug: - rid:2 step:8 gid:29 user:rule:backchain:candidates = File "(context step_id:4)", line 1, column 0, characters 0-0: - -Debug: }}} -> (0.000s) -Debug: select 5 {{{ - -Debug: - rid:2 step:8 gid:29 user:rule:backchain:try = File "(context step_id:4)", line 1, column 0, characters 0-0: - (of c0 X2) :- . - -Debug: - rid:2 step:8 gid:0 user:assign = X2 := X1 - -Debug: - rid:2 step:8 gid:29 user:rule:backchain = success - -Debug: }}} -> (0.000s) -arr X1 (arr X0 X1) -Query assignments: - Ty = arr X1 (arr X0 X1) -Debug: run 2 {{{ - -Debug: - rid:3 step:2 gid:31 user:curgoal = of - of (fun c0 \ fun c1 \ c0) X0 - -Debug: - rid:3 step:2 gid:31 user:rule = backchain - -Debug: - rid:3 step:2 gid:31 user:rule:backchain:candidates = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: - -Debug: }}} -> (0.000s) -Debug: select 3 {{{ - -Debug: - rid:3 step:2 gid:31 user:rule:backchain:try = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: - (of (fun A0) (arr A2 A1)) :- ( - pi (c0 \ - (of c0 A2 => of (A0 c0) A1))). - -Debug: - rid:3 step:2 gid:0 user:assign = A0 := c0 \ - fun c1 \ c0 - -Debug: - rid:3 step:2 gid:0 user:assign = X0 := arr X1 X2 - -Debug: - rid:3 step:2 gid:31 user:subgoal = 33 - -Debug: - rid:3 step:2 gid:33 user:newgoal = pi c0 \ of c0 X1 => of (fun c1 \ c0) X2 - -Debug: - rid:3 step:2 gid:33 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 5 {{{ - -Debug: - rid:3 step:5 gid:35 user:curgoal = of - of (fun c1 \ c0) X2 - -Debug: - rid:3 step:5 gid:35 user:rule = backchain - -Debug: - rid:3 step:5 gid:35 user:rule:backchain:candidates = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: - -Debug: }}} -> (0.000s) -Debug: select 4 {{{ - -Debug: - rid:3 step:5 gid:35 user:rule:backchain:try = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: - (of (fun A0) (arr A2 A1)) :- ( - pi (c0 \ - (of c0 A2 => of (A0 c0) A1))). - -Debug: - rid:3 step:5 gid:0 user:assign = A0 := c1 \ - c0 - -Debug: - rid:3 step:5 gid:0 user:assign = X2 := arr X3 X4 - -Debug: - rid:3 step:5 gid:35 user:subgoal = 36 - -Debug: - rid:3 step:5 gid:36 user:newgoal = pi c1 \ of c1 X3 => of c0 X4 - -Debug: - rid:3 step:5 gid:36 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 8 {{{ - -Debug: - rid:3 step:8 gid:38 user:curgoal = of - of c0 X4 - -Debug: - rid:3 step:8 gid:38 user:rule = backchain - -Debug: - rid:3 step:8 gid:38 user:rule:backchain:candidates = File "(context step_id:4)", line 1, column 0, characters 0-0: - -Debug: }}} -> (0.000s) -Debug: select 5 {{{ - -Debug: - rid:3 step:8 gid:38 user:rule:backchain:try = File "(context step_id:4)", line 1, column 0, characters 0-0: - (of c0 X1) :- . - -Debug: - rid:3 step:8 gid:0 user:assign = X1 := X4 - -Debug: - rid:3 step:8 gid:38 user:rule:backchain = success - -Debug: }}} -> (0.000s) -arr X4 (arr X3 X4) -Query assignments: - Ty = arr X4 (arr X3 X4) -Debug: run 8 {{{ - -Debug: - rid:4 step:8 gid:47 user:curgoal = of - of c0 X0 - -Debug: - rid:4 step:8 gid:47 user:rule = backchain - -Debug: - rid:4 step:8 gid:47 user:rule:backchain:candidates = File "(context step_id:4)", line 1, column 0, characters 0-0: - -Debug: }}} -> (0.000s) -Debug: select 5 {{{ - -Debug: - rid:4 step:8 gid:47 user:rule:backchain:try = File "(context step_id:4)", line 1, column 0, characters 0-0: - (of c0 X1) :- . - -Debug: - rid:4 step:8 gid:0 user:assign = X1 := X0 - -Debug: - rid:4 step:8 gid:47 user:rule:backchain = success - -Debug: }}} -> (0.000s) -arr X0 (arr X2 X0) -Query assignments: - Ty = arr X0 (arr X2 X0) -calling mypred on 3 -calling mypred on 2 -calling mypred on 1 -calling mypred on 0 -ok -Query assignments: - A = X0 - B = X0 - C = X0 -Query assignments: - A = X0 - B = X0 - C = X0 -File "./examples/tutorial_elpi_lang.v", line 554, characters 12-17: -Warning: -File "./examples/tutorial_elpi_lang.v", line 554, characters 12-17 -Hummm is linear: name it _Hummm (discard) or Hummm_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 670, characters 12-14: -Warning: -File "./examples/tutorial_elpi_lang.v", line 670, characters 12-14 -Ty is linear: name it _Ty (discard) or Ty_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 826, characters 26-27: -Warning: -File "./examples/tutorial_elpi_lang.v", line 826, characters 26-27 -X is linear: name it _X (discard) or X_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 826, characters 34-35: -Warning: -File "./examples/tutorial_elpi_lang.v", line 826, characters 34-35 -Y is linear: name it _Y (discard) or Y_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 856, characters 26-27: -Warning: -File "./examples/tutorial_elpi_lang.v", line 856, characters 26-27 -X is linear: name it _X (discard) or X_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 856, characters 34-35: -Warning: -File "./examples/tutorial_elpi_lang.v", line 856, characters 34-35 -Y is linear: name it _Y (discard) or Y_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 888, characters 21-22: -Warning: -File "./examples/tutorial_elpi_lang.v", line 888, characters 21-22 -X is linear: name it _X (discard) or X_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 888, characters 29-30: -Warning: -File "./examples/tutorial_elpi_lang.v", line 888, characters 29-30 -Z is linear: name it _Z (discard) or Z_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 1020, characters 26-27: -Warning: -File "./examples/tutorial_elpi_lang.v", line 1020, characters 26-27 -A is linear: name it _A (discard) or A_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 1057, characters 27-28: -Warning: -File "./examples/tutorial_elpi_lang.v", line 1057, characters 27-28 -A is linear: name it _A (discard) or A_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 1146, characters 18-20: -Warning: -File "./examples/tutorial_elpi_lang.v", line 1146, characters 18-20 -R1 is linear: name it _R1 (discard) or R1_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 1147, characters 15-17: -Warning: -File "./examples/tutorial_elpi_lang.v", line 1147, characters 15-17 -R2 is linear: name it _R2 (discard) or R2_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 1148, characters 16-18: -Warning: -File "./examples/tutorial_elpi_lang.v", line 1148, characters 16-18 -R3 is linear: name it _R3 (discard) or R3_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 1184, characters 16-17: -Warning: -File "./examples/tutorial_elpi_lang.v", line 1184, characters 16-17 -R is linear: name it _R (discard) or R_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 1511, characters 9-10: -Warning: -File "./examples/tutorial_elpi_lang.v", line 1511, characters 9-10 -A is linear: name it _A (discard) or A_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 1511, characters 20-21: -Warning: -File "./examples/tutorial_elpi_lang.v", line 1511, characters 20-21 -B is linear: name it _B (discard) or B_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 1511, characters 28-29: -Warning: -File "./examples/tutorial_elpi_lang.v", line 1511, characters 28-29 -C is linear: name it _C (discard) or C_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 1518, characters 9-10: -Warning: -File "./examples/tutorial_elpi_lang.v", line 1518, characters 9-10 -A is linear: name it _A (discard) or A_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 1518, characters 20-21: -Warning: -File "./examples/tutorial_elpi_lang.v", line 1518, characters 20-21 -B is linear: name it _B (discard) or B_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_elpi_lang.v", line 1518, characters 28-29: -Warning: -File "./examples/tutorial_elpi_lang.v", line 1518, characters 28-29 -C is linear: name it _C (discard) or C_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -DEBUG: attempt at fuzzing binary op: global (indc «PLUS») -DEBUG: attempt at fuzzing binary op: global (const «Nat.add») -DEBUG: attempt at fuzzing binary op: global (indc «AND») -DEBUG: fuzzed! -DEBUG: attempt at fuzzing binary op: global (const «andb») -DEBUG: attempt at fuzzing binary op: global (indc «OR») -DEBUG: fuzzed! -DEBUG: attempt at fuzzing binary op: global (const «orb») -DEBUG: attempt at fuzzing binary op: global (indc «EQ») -DEBUG: attempt at fuzzing binary op: global (const «Nat.eqb») -Inductive eval1 : forall T : ty, Exp T -> Val T -> Prop := - E_Num1 : forall n : nat, eval1 N (NUM n) (iNv n) - | E_Bool1 : forall b : bool, eval1 B (BOOL b) (iBv b) - | E_Plus1 : forall (e1 e2 : Exp N) (n1 n2 : nat), - eval1 N e1 (iNv n1) -> - eval1 N e2 (iNv n2) -> eval1 N (PLUS e1 e2) (iNv (n1 + n2)) - | E_AND1 : forall (e1 e2 : Exp B) (b1 b2 : bool), - eval1 B e1 (iBv b1) -> - eval1 B e2 (iBv b2) -> eval1 B (AND e1 e2) (iBv (b1 && b2)) - | E_OR1 : forall (e1 e2 : Exp B) (b1 b2 : bool), - eval1 B e1 (iBv b1) -> - eval1 B e2 (iBv b2) -> eval1 B (AND e1 e2) (iBv (b1 || b2)) - | E_EQ1 : forall (e1 e2 : Exp N) (n1 n2 : nat), - eval1 N e1 (iNv n1) -> - eval1 N e2 (iNv n2) -> eval1 B (EQ e1 e2) (iBv (Nat.eqb n1 n2)). - -Arguments eval1 T _ _ -Arguments E_Num1 n%nat_scope -Arguments E_Bool1 b%bool_scope -Arguments E_Plus1 e1 e2 (n1 n2)%nat_scope _ _ -Arguments E_AND1 e1 e2 (b1 b2)%bool_scope _ _ -Arguments E_OR1 e1 e2 (b1 b2)%bool_scope _ _ -Arguments E_EQ1 e1 e2 (n1 n2)%nat_scope _ _ -File "./apps/NES/theories/NES.v", line 39, characters 0-42: -Warning: -Undeclared globals: -- File "/build/reproducible-path/coq-elpi-2.5.0/apps/NES/elpi/nes_interp.elpi", line 6, column 24, characters 152-161: ns. -Please add the following text to your program: -type ns list string -> modpath -> prop. -[elpi.missing-types,elpi.typecheck,elpi,default] -eq_refl : d = 3 - : d = 3 -eq_refl : e = 4 - : e = 4 -foo = fun a b c : nat => a + b + c + d + e - : nat -> nat -> nat -> nat - -Arguments foo a%nat_scope [b]%nat_scope {c}%nat_scope + %arg1 = «elpi.tests.test_API_notations.abbr2» + T = fun `_` X0 c0 \ + app [global (indt «eq»), X1, fun `x` X2 c1 \ c1, fun `x` X2 c1 \ c1] + X7_ = X2 Query assignments: - %arg1 = const «foo» -3 + 7 becomes fun (x : ?e) (x0 : ?e0) => S (S x0) + S (S (S (S (S (S x))))) -File "./tests/perf_calls.v", line 11, characters 2-3: -Warning: -File "./tests/perf_calls.v", line 11, characters 2-3 -N is linear: name it _N (discard) or N_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/perf_calls.v", line 13, characters 9-11: -Warning: -File "./tests/perf_calls.v", line 13, characters 9-11 -GR is linear: name it _GR (discard) or GR_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/perf_calls.v", line 13, characters 7-8: -Warning: -File "./tests/perf_calls.v", line 13, characters 7-8 -N is linear: name it _N (discard) or N_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] + %arg1 = «elpi.tests.test_API_notations.abbr2» File "./tests/test_File3.v", line 18, characters 2-16: Warning: This command does not support this attribute: phase. [unsupported-attributes,parsing,default] -Hello [str world!] -Hello [int 46] -Hello [str there] -Hello [str my, str friend] -Hello [str this.is.a.qualified.name] -Hello -[trm - (app - [global (indt «eq»), global (indt «nat»), global (indc «O»), - app [global (indc «S»), global (indc «O»)]])] -Hello -[const-decl test - (some - (app - [global (indt «eq»), global (indt «nat»), global (indc «O»), - app [global (indc «S»), global (indc «O»)]])) (arity (sort prop))] -Hello -[indt-decl - (record test (sort (typ «Set»)) Build_test - (field [coercion off, canonical tt] f1 (global (indt «nat»)) c0 \ - field [coercion off, canonical tt] f2 - (app - [global (indt «eq»), global (indt «nat»), c0, - app [global (indc «S»), global (indc «O»)]]) c1 \ end-record))] -The type of -app - [global (indt «eq»), global (indt «nat»), - app [global (indc «S»), global (indc «O»)], global (indc «O»)] is -sort prop -1 = true - : Prop -T= -app - [global (indt «eq»), X0, app [global (indc «S»), global (indc «O»)], - global (indc «true»)] -T1= -app - [global (indt «eq»), global (indt «nat»), - app [global (indc «S»), global (indc «O»)], - app [global (const «bool2nat»), global (indc «true»)]] -Ty= sort prop -nK_bool = 2 - : nat -nK_False = 0 - : nat -Inductive tree' (A : Set) : Set := - leaf' : tree' A | node' : tree' A -> A -> tree' A -> tree' A. - -Arguments tree' A%type_scope -Arguments leaf' A%type_scope -Arguments node' A%type_scope _ _ _ -bob is 24 years old -alice is 21 years old -bob is 24 years old -alice is 21 years old -[attribute elpi.loc - (leaf-loc - File "./examples/tutorial_coq_elpi_command.v", line 610, column 31, characters 17257-17261:), - attribute elpi.phase (leaf-str interp), attribute this (leaf-str ), - attribute more (node [attribute stuff (leaf-str 33)])] -options= -[get-option elpi.loc - File "./examples/tutorial_coq_elpi_command.v", line 643, column 31, characters 18094-18104:, - get-option elpi.phase interp, get-option this tt, get-option more.stuff 33] -33 tt -That is all folks! -going from source to target via plane -synterp x := some _ -interp x := -some - (app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]) -The module is «elpi_examples.tutorial_coq_elpi_command.Module36» -Box.Box.Box.Box.foo = fun n : nat => n + 2 - : nat -> nat - -Arguments Box.Box.Box.Box.foo n%nat_scope -Module NextModule2 := Struct End -File "./examples/tutorial_coq_elpi_command.v", line 610, characters 2-24: -Warning: This command does not support these attributes: more, this. -[unsupported-attributes,parsing,default] -File "./examples/tutorial_coq_elpi_command.v", line 643, characters 2-24: -Warning: This command does not support these attributes: more, this. -[unsupported-attributes,parsing,default] -File "./examples/tutorial_coq_elpi_command.v", line 644, characters 7-14: -Warning: This command does not support this attribute: unknown. -[unsupported-attributes,parsing,default] Query assignments: I = const «imp» X2.imp : forall (T : Type) (x : T), x = x -> Prop @@ -2448,129 +1080,192 @@ : bool * bool -> Prop = fun x : bool => x = x : bool -> Prop -Goal: -[decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»))] -|- X0 c0 c1 : -app - [global (indt «eq»), global (indt «nat»), - app - [global (const «Nat.add»), c0, - app [global (indc «S»), global (indc «O»)]], c1] -(I, 0) -conj : forall [A B : Prop], A -> B -> A /\ B +Query assignments: + E = fun `n` (global (indt «nat»)) c0 \ + fun `t` (app [global (const «T2»), c0]) c1 \ + fun `x` + (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 `x` + (app [global (const «f3»), c0, app [global (const «h»), c0, c1]]) c2 \ + global (indt «nat») + X1_ = 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} +FLEXIBLE UNIVERSES: + elpi.tests.test_API_elaborate.10 +SORTS: + α4 := Type + α5 := Type +WEAK CONSTRAINTS: + -conj is not universe polymorphic -Arguments conj [A B]%type_scope _ _ -Expands to: Constructor Coq.Init.Logic.conj -(ex_intro (fun t : Prop => True /\ True /\ t) True (conj I (conj I I))) -[int 1, str x, str a b, - trm - (app - [global (indt «eq»), X0, - app [global (indc «S»), global (indc «O»)], global (indc «O»)])] -Using H ?p of type Q -Using H ?p of type Q -Using p of type P -[trm c0, trm c3, trm (app [c2, c3])] -found P -found P /\ P -Goal: [decl c0 `x` (global (indt «nat»))] |- X0 c0 : -app - [global (indt «eq»), global (indt «nat»), +Query assignments: + E = app + [global (const «bar»), app - [global (const «Nat.add»), c0, - app [global (indc «S»), global (indc «O»)]], global (indc «O»)] -Proof state: - {c0} : decl c0 `x` (global (indt «nat»)) - ?- evar (X1 c0) - (app - [global (indt «eq»), global (indt «nat»), - app - [global (const «Nat.add»), c0, - app [global (indc «S»), global (indc «O»)]], - global (indc «O»)]) (X0 c0) /* suspended on X1, X0 */ -EVARS: - ?X57==[x |- x + 1 = 0] (goal evar) {?Goal} - ?X56==[ |- => fun x : nat => ?Goal] (goal evar) - ?X55==[x |- => nat] (parameter A of eq) - ?X54==[ |- => nat] (type of x) - -SHELF:|| -FUTURE GOALS STACK: - || + [global (indc «S»), + app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]], + global (const «xxx»)] + TY = prop + X2_ = X0 + X3_ = X1 +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»)] + X4_ = 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: + {} +FLEXIBLE UNIVERSES: + +SORTS: + α11 := Type +WEAK CONSTRAINTS: + -Rocq-Elpi mapping: -RAW: -?X57 <-> c0 \ X1 c0 -ELAB: -?X57 <-> X0 +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 `a` (app [global (const «f1»), c0]) c3 \ app [c1, c2]))] +elab2: +parameter A explicit (global (const «T1»)) c0 \ + parameter B explicit (sort (typ «ind1.u0»)) c1 \ + inductive ind1 tt (arity (sort (typ «ind1.u1»))) c2 \ + [constructor K1 (arity (prod `_` c2 c3 \ c2)), + constructor K2 + (arity (prod `_` (app [global (const «f1»), c0]) c3 \ c2)), + constructor K3 + (arity (prod `a` (app [global (const «f1»), c0]) c3 \ c2))] +raw: +parameter A explicit (global (const «T1»)) c0 \ + record ind2 (sort (typ «f1.u0»)) 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 «ind2.u0»)) 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 «ind3.u0»)) Build_ind3 + (field [coercion reversible, canonical tt] fld3 (sort (typ «ind3.u1»)) + 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 +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: + {} +FLEXIBLE UNIVERSES: + +SORTS: + α21 := Type +WEAK CONSTRAINTS: + -#goals = 2 -[nabla c0 \ - nabla c1 \ - seal - (goal [decl c1 `Q` (sort prop), decl c0 `P` (sort prop)] (X0 c0 c1) c0 - (X1 c0 c1) []), - nabla c0 \ - nabla c1 \ - seal - (goal [decl c1 `Q` (sort prop), decl c0 `P` (sort prop)] (X2 c0 c1) c1 - (X3 c0 c1) [])] -(fun (P Q : Prop) (p : P) (q : Q) => conj ?Goal (conj ?Goal0 ?Goal1)) -(fun (P Q : Prop) (p : P) (q : Q) => conj ?Goal0 (conj ?Goal ?Goal0)) -foo = 46 - : nat -bar = (false :: nil)%list - : list bool -baz = (46%nat :: nil)%list - : list nat -File "./examples/tutorial_coq_elpi_tactic.v", line 632, characters 0-22: -Warning: x is already taken, Elpi will make a name up [lib,elpi,default] -File "./examples/tutorial_coq_elpi_tactic.v", line 742, characters 32-33: -Warning: -File "./examples/tutorial_coq_elpi_tactic.v", line 742, characters 32-33 -A is linear: name it _A (discard) or A_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_tactic.v", line 742, characters 40-41: -Warning: -File "./examples/tutorial_coq_elpi_tactic.v", line 742, characters 40-41 -B is linear: name it _B (discard) or B_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_tactic.v", line 742, characters 14-17: -Warning: -File "./examples/tutorial_coq_elpi_tactic.v", line 742, characters 14-17 -Ctx is linear: name it _Ctx (discard) or Ctx_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_tactic.v", line 843, characters 44-46: +unknown_gref +«elpi.tests.test_API_elaborate.52» «elpi.tests.test_API_elaborate.52» +File "./tests/test_API_elaborate.v", line 160, characters 19-20: Warning: -File "./examples/tutorial_coq_elpi_tactic.v", line 843, characters 44-46 -G1 is linear: name it _G1 (discard) or G1_ (fresh variable) +File "./tests/test_API_elaborate.v", line 160, characters 19-20 +Y is linear: name it _Y (discard) or Y_ (fresh variable) [elpi.linear-variable,elpi.typecheck,elpi,default] -File "./examples/tutorial_coq_elpi_tactic.v", line 844, characters 44-46: +File "./tests/test_API_elaborate.v", line 170, characters 33-34: Warning: -File "./examples/tutorial_coq_elpi_tactic.v", line 844, characters 44-46 -G2 is linear: name it _G2 (discard) or G2_ (fresh variable) +File "./tests/test_API_elaborate.v", line 170, characters 33-34 +Y is linear: name it _Y (discard) or Y_ (fresh variable) [elpi.linear-variable,elpi.typecheck,elpi,default] -d1 - : nat -d2 - : nat -i1 - : Prop -i2 - : Prop -k1 - : i1 -k2 - : i2 -r1 - : Set -r2 - : Type -f1 - : r1 -> nat -f2 - : r2 -> nat Query assignments: GR = const «myi» Query assignments: @@ -2792,6 +1487,21 @@ File "./tests/test_API_TC_CS.v", line 159, characters 32-33 L is linear: name it _L (discard) or L_ (fresh variable) [elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/perf_calls.v", line 11, characters 2-3: +Warning: +File "./tests/perf_calls.v", line 11, characters 2-3 +N is linear: name it _N (discard) or N_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/perf_calls.v", line 13, characters 9-11: +Warning: +File "./tests/perf_calls.v", line 13, characters 9-11 +GR is linear: name it _GR (discard) or GR_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/perf_calls.v", line 13, characters 7-8: +Warning: +File "./tests/perf_calls.v", line 13, characters 7-8 +N is linear: name it _N (discard) or N_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] Query assignments: CA = «a» CB = «b» @@ -2815,6 +1525,404 @@ : nat bar : bool -> nat : bool -> nat +Query q X0 +Query r X0 +Result r 1 +eq_refl : d = 3 + : d = 3 +eq_refl : e = 4 + : e = 4 +foo = fun a b c : nat => a + b + c + d + e + : nat -> nat -> nat -> nat + +Arguments foo a%nat_scope [b]%nat_scope {c}%nat_scope +Query assignments: + %arg1 = const «foo» +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 «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» +elpi.tests.test_API_module.X.i +[elpi, tests, test_API_module, X, Y] +[elpi, tests, test_API_module, X, Y] +Query assignments: + %arg1 = elpi.tests.test_API_module.X.i + %arg2 = elpi.tests.test_API_module.X.i + %arg3 = elpi.tests.test_API_module.X.Y.i + %arg4 = [elpi, tests, test_API_module, X, Y] + %arg5 = [elpi, tests, test_API_module, X, Y] + 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» + XYi = «X.Y.i» + XYr = «X.Y.i_rect» + Xi = «X.i» +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: + Mp_ta = «elpi.tests.test_API_module.TA» +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» + X1_ = «A.i.u0» + X2_ = «elpi.tests.test_API_module.11» +Universe constraints: +UNIVERSES: + +ALGEBRAIC UNIVERSES: + {elpi.tests.test_API_module.11 A.i.u0} +FLEXIBLE UNIVERSES: + elpi.tests.test_API_module.11 + A.i.u0 +SORTS: + +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: + A = «elpi.tests.test_API_module.a» + MP_TA = «elpi.tests.test_API_module.TA» + TF = «elpi.tests.test_API_module.TF» +Query assignments: + %arg1 = «elpi.tests.test_API_module.a» + %arg2 = const const EXN PRINTING: Not_found + MP_TA = «elpi.tests.test_API_module.TA» + MP_TF = «elpi.tests.test_API_module.TF» +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: + MP_TA = «elpi.tests.test_API_module.TA» +Module Type TB = Funsig (A:TA) Sig End +Query assignments: + A = «elpi.tests.test_API_module.A» +Query assignments: + %arg1 = «elpi.tests.test_API_module.A» +Module IA := Struct Definition z : nat. Definition i : Type. End +Query assignments: + %arg1 = «elpi.tests.test_API_module.IA» +Query assignments: + %arg1 = «elpi.tests.test_API_module.IA» +i + : Type +Query assignments: + %arg1 = «elpi.tests.test_API_module.TA» +Query assignments: + %arg1 = «elpi.tests.test_API_module.TA» +Module Type ITA = Sig Parameter z : nat. Parameter i : Type. End +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» +File "./tests/test_API_module.v", line 7, characters 69-70: +Warning: +File "./tests/test_API_module.v", line 7, characters 69-70 +L is linear: name it _L (discard) or L_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API_module.v", line 50, characters 26-28: +Warning: +File "./tests/test_API_module.v", line 50, characters 26-28 +ID is linear: name it _ID (discard) or ID_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API_module.v", line 49, characters 28-29: +Warning: +File "./tests/test_API_module.v", line 49, characters 28-29 +P is linear: name it _P (discard) or P_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API_module.v", line 77, characters 21-22: +Warning: +File "./tests/test_API_module.v", line 77, characters 21-22 +L is linear: name it _L (discard) or L_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API_module.v", line 67, characters 27-32: +Warning: +File "./tests/test_API_module.v", line 67, characters 27-32 +MP_TA is linear: name it _MP_TA (discard) or MP_TA_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API_module.v", line 102, characters 31-36: +Warning: +File "./tests/test_API_module.v", line 102, characters 31-36 +MP_TA is linear: name it _MP_TA (discard) or MP_TA_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API_module.v", line 101, characters 27-32: +Warning: +File "./tests/test_API_module.v", line 101, characters 27-32 +MP_TF is linear: name it _MP_TF (discard) or MP_TF_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +Coq version: 8.20.1 = 8 . 20 . 1 +Query assignments: + MA = 8 + MI = 20 + P = 1 + V = 8.20.1 +hello world +A +B +Query assignments: + GR = «nat» +Query assignments: + GR = «Nat.add» + MP = «Coq.Init.Datatypes» +Query assignments: + A = «elpi.tests.test_API.succ» + GR = «Nat.add» + MP = «Coq.Init.Datatypes» + X1 = [loc-gref (const «Nat.add»)] + X2 = [loc-gref (const «Nat.add»)] + X3 = [loc-abbreviation «elpi.tests.test_API.succ»] + X4 = [loc-modpath «Coq.Init.Datatypes»] +Universe constraints: +Query assignments: + X = «elpi.tests.test_API.1» +Universe constraints: +UNIVERSES: + {elpi.tests.test_API.1} |= +ALGEBRAIC UNIVERSES: + {} +FLEXIBLE UNIVERSES: + +SORTS: + +WEAK CONSTRAINTS: + + +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: + {} +FLEXIBLE UNIVERSES: + +SORTS: + +WEAK CONSTRAINTS: + + +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: + {} +FLEXIBLE UNIVERSES: + +SORTS: + +WEAK CONSTRAINTS: + + +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: + {} +FLEXIBLE UNIVERSES: + +SORTS: + +WEAK CONSTRAINTS: + + +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: + {} +FLEXIBLE UNIVERSES: + +SORTS: + +WEAK CONSTRAINTS: + + +[foo (const «X»), foo (indt «nat»), foo (indt «bool»)] +[foo (indt «nat»), foo (indt «bool»)] +[] +[foo (indt «nat»)] +hello [int 1, int 2, trm (global (indt «nat»)), str x] +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 _elpi_renamed_x_3 return ?e6 with + | true => S (S (S O)) + | false => y + end +fix foo x y {struct x} := if x as _elpi_renamed_x_3 then 3 else y +File "./tests/test_API.v", line 73, characters 37-39: +Warning: +File "./tests/test_API.v", line 73, characters 37-39 +MP is linear: name it _MP (discard) or MP_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API.v", line 81, characters 54-55: +Warning: +File "./tests/test_API.v", line 81, characters 54-55 +A is linear: name it _A (discard) or A_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API.v", line 82, characters 56-58: +Warning: +File "./tests/test_API.v", line 82, characters 56-58 +MP is linear: name it _MP (discard) or MP_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API.v", line 91, characters 29-30: +Warning: +File "./tests/test_API.v", line 91, characters 29-30 +X is linear: name it _X (discard) or X_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API.v", line 92, characters 29-30: +Warning: +File "./tests/test_API.v", line 92, characters 29-30 +X is linear: name it _X (discard) or X_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API.v", line 92, characters 31-32: +Warning: +File "./tests/test_API.v", line 92, characters 31-32 +Y is linear: name it _Y (discard) or Y_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API.v", line 93, characters 28-29: +Warning: +File "./tests/test_API.v", line 93, characters 28-29 +X is linear: name it _X (discard) or X_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API.v", line 93, characters 30-31: +Warning: +File "./tests/test_API.v", line 93, characters 30-31 +Y is linear: name it _Y (discard) or Y_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API.v", line 94, characters 36-37: +Warning: +File "./tests/test_API.v", line 94, characters 36-37 +X is linear: name it _X (discard) or X_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API.v", line 94, characters 38-39: +Warning: +File "./tests/test_API.v", line 94, characters 38-39 +Y is linear: name it _Y (discard) or Y_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API.v", line 94, characters 40-41: +Warning: +File "./tests/test_API.v", line 94, characters 40-41 +Z is linear: name it _Z (discard) or Z_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API.v", line 95, characters 29-30: +Warning: +File "./tests/test_API.v", line 95, characters 29-30 +X is linear: name it _X (discard) or X_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API.v", line 95, characters 31-32: +Warning: +File "./tests/test_API.v", line 95, characters 31-32 +Y is linear: name it _Y (discard) or Y_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] Query assignments: BO = fix `add` 0 (prod `n` (global (indt «nat»)) c0 \ @@ -3365,7 +2473,7 @@ c5 \ app [c2, c4, c5]]] Debug: [elpi] - Elpi: query-compilation:0.0027 static-check:0.0000 optimization:0.0001 runtime:0.0112 (with success) + Elpi: query-compilation:0.0125 static-check:0.0000 optimization:0.0002 runtime:0.0266 (with success) Query assignments: GR = indc «Ord» @@ -5769,7 +4877,7 @@ (X10 c0 c1 c2 c3 c4) Debug: [elpi] - Elpi: query-compilation:0.0018 static-check:0.0000 optimization:0.0001 runtime:0.2145 (with error) + Elpi: query-compilation:0.0029 static-check:0.0000 optimization:0.0087 runtime:0.0880 (with error) hd : forall A : Type, A -> list A -> A @@ -5783,1027 +4891,6 @@ File "./tests-stdlib/test_quotation.v", line 47, characters 32-33 X is linear: name it _X (discard) or X_ (fresh variable) [elpi.linear-variable,elpi.typecheck,elpi,default] -Query q X0 -Query r X0 -Result r 1 -«elpi.tests.test_API_notations.abbr» -Query assignments: - A = «elpi.tests.test_API_notations.abbr» - X1_ = X0 - X2_ = c0 \ -X1 c0 - X3_ = c0 \ -X2 c0 -Syntactic constraints: - {c0} : decl c0 `x` X0 ?- evar (X2 c0) (X3 c0) (X2 c0) /* suspended on X2 */ - {c0} : decl c0 `x` X0 - ?- evar (X4 c0) (sort (typ «elpi.tests.test_API_notations.3»)) (X3 c0) /* suspended on X4, X3 */ - {c0} : decl c0 `x` X0 - ?- evar (X1 c0) (sort (typ «elpi.tests.test_API_notations.2»)) (X1 c0) /* suspended on X1 */ - evar (X0) (sort (typ «elpi.tests.test_API_notations.1»)) (X0) /* suspended on X0 */ -Universe constraints: -UNIVERSES: - {elpi.tests.test_API_notations.3 elpi.tests.test_API_notations.2 - elpi.tests.test_API_notations.1} |= -ALGEBRAIC UNIVERSES: - {} -FLEXIBLE UNIVERSES: - -SORTS: - α1 - α2 - α3 -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: - X4_ = X0 - X5_ = c0 \ -X1 c0 - X6_ = c0 \ -X2 c0 -Syntactic constraints: - {c0} : decl c0 `x` X0 ?- evar (X2 c0) (X3 c0) (X2 c0) /* suspended on X2 */ - {c0} : decl c0 `x` X0 - ?- evar (X4 c0) (sort (typ «elpi.tests.test_API_notations.6»)) (X3 c0) /* suspended on X4, X3 */ - {c0} : decl c0 `x` X0 - ?- evar (X1 c0) (sort (typ «elpi.tests.test_API_notations.5»)) (X1 c0) /* suspended on X1 */ - evar (X0) (sort (typ «elpi.tests.test_API_notations.4»)) (X0) /* suspended on X0 */ -Universe constraints: -UNIVERSES: - {elpi.tests.test_API_notations.6 elpi.tests.test_API_notations.5 - elpi.tests.test_API_notations.4} |= -ALGEBRAIC UNIVERSES: - {} -FLEXIBLE UNIVERSES: - -SORTS: - α4 - α5 - α6 -WEAK CONSTRAINTS: - - -Notation abbr2 _elpi_ctx_entry_1_was_x_ := - (fun _ => _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 -fun `_` X0 c0 \ - app [global (indt «eq»), X1, fun `x` X2 c1 \ c1, fun `x` X2 c1 \ c1] -Query assignments: - %arg1 = «elpi.tests.test_API_notations.abbr2» - T = fun `_` X0 c0 \ - app [global (indt «eq»), X1, fun `x` X2 c1 \ c1, fun `x` X2 c1 \ c1] - X7_ = X2 -Query assignments: - %arg1 = «elpi.tests.test_API_notations.abbr2» -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 «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» -elpi.tests.test_API_module.X.i -[elpi, tests, test_API_module, X, Y] -[elpi, tests, test_API_module, X, Y] -Query assignments: - %arg1 = elpi.tests.test_API_module.X.i - %arg2 = elpi.tests.test_API_module.X.i - %arg3 = elpi.tests.test_API_module.X.Y.i - %arg4 = [elpi, tests, test_API_module, X, Y] - %arg5 = [elpi, tests, test_API_module, X, Y] - 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» - XYi = «X.Y.i» - XYr = «X.Y.i_rect» - Xi = «X.i» -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: - Mp_ta = «elpi.tests.test_API_module.TA» -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» - X1_ = «A.i.u0» - X2_ = «elpi.tests.test_API_module.11» -Universe constraints: -UNIVERSES: - -ALGEBRAIC UNIVERSES: - {elpi.tests.test_API_module.11 A.i.u0} -FLEXIBLE UNIVERSES: - elpi.tests.test_API_module.11 - A.i.u0 -SORTS: - -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: - A = «elpi.tests.test_API_module.a» - MP_TA = «elpi.tests.test_API_module.TA» - TF = «elpi.tests.test_API_module.TF» -Query assignments: - %arg1 = «elpi.tests.test_API_module.a» - %arg2 = const const EXN PRINTING: Not_found - MP_TA = «elpi.tests.test_API_module.TA» - MP_TF = «elpi.tests.test_API_module.TF» -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: - MP_TA = «elpi.tests.test_API_module.TA» -Module Type TB = Funsig (A:TA) Sig End -Query assignments: - A = «elpi.tests.test_API_module.A» -Query assignments: - %arg1 = «elpi.tests.test_API_module.A» -Module IA := Struct Definition z : nat. Definition i : Type. End -Query assignments: - %arg1 = «elpi.tests.test_API_module.IA» -Query assignments: - %arg1 = «elpi.tests.test_API_module.IA» -i - : Type -Query assignments: - %arg1 = «elpi.tests.test_API_module.TA» -Query assignments: - %arg1 = «elpi.tests.test_API_module.TA» -Module Type ITA = Sig Parameter z : nat. Parameter i : Type. End -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» -File "./tests/test_API_module.v", line 7, characters 69-70: -Warning: -File "./tests/test_API_module.v", line 7, characters 69-70 -L is linear: name it _L (discard) or L_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API_module.v", line 50, characters 26-28: -Warning: -File "./tests/test_API_module.v", line 50, characters 26-28 -ID is linear: name it _ID (discard) or ID_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API_module.v", line 49, characters 28-29: -Warning: -File "./tests/test_API_module.v", line 49, characters 28-29 -P is linear: name it _P (discard) or P_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API_module.v", line 77, characters 21-22: -Warning: -File "./tests/test_API_module.v", line 77, characters 21-22 -L is linear: name it _L (discard) or L_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API_module.v", line 67, characters 27-32: -Warning: -File "./tests/test_API_module.v", line 67, characters 27-32 -MP_TA is linear: name it _MP_TA (discard) or MP_TA_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API_module.v", line 102, characters 31-36: -Warning: -File "./tests/test_API_module.v", line 102, characters 31-36 -MP_TA is linear: name it _MP_TA (discard) or MP_TA_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API_module.v", line 101, characters 27-32: -Warning: -File "./tests/test_API_module.v", line 101, characters 27-32 -MP_TF is linear: name it _MP_TF (discard) or MP_TF_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -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») -c2 -global (indt «nat») -z -nat -Query assignments: - %arg1 = c0 \ c1 \ c2 \ -z - %arg2 = c0 \ c1 \ c2 \ -nat - T = global (indt «nat») -c2 -global (indt «nat») -z -nat -Query assignments: - %arg1 = c0 \ c1 \ c2 \ -z - %arg2 = c0 \ c1 \ c2 \ -nat - T = global (indt «nat») -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" -Unable to unify "bool" with "nat". -Query assignments: - Msg = Unable to unify "bool" with "nat". -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: - {} -FLEXIBLE UNIVERSES: - -SORTS: - α1 := Type - α2 := Type -WEAK CONSTRAINTS: - - -global (indt «nat») -Query assignments: - T = global (indt «nat») - X1_ = global (indt «nat») - X2_ = 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: - {} -FLEXIBLE UNIVERSES: - -SORTS: - α3 := Type - α4 := Type - α5 := Type -WEAK CONSTRAINTS: - - -«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} -FLEXIBLE UNIVERSES: - elpi.tests.test_API_typecheck.10 -SORTS: - -WEAK CONSTRAINTS: - - -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). -File "./tests/test_API_typecheck.v", line 59, characters 2-4: -Warning: -File "./tests/test_API_typecheck.v", line 59, characters 2-4 -LE is linear: name it _LE (discard) or LE_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -Query assignments: - E = fun `n` (global (indt «nat»)) c0 \ - fun `t` (app [global (const «T2»), c0]) c1 \ - fun `x` - (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 `x` - (app [global (const «f3»), c0, app [global (const «h»), c0, c1]]) c2 \ - global (indt «nat») - X1_ = 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} -FLEXIBLE UNIVERSES: - elpi.tests.test_API_elaborate.10 -SORTS: - α4 := Type - α5 := Type -WEAK CONSTRAINTS: - - -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 - X2_ = X0 - X3_ = X1 -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»)] - X4_ = 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: - {} -FLEXIBLE UNIVERSES: - -SORTS: - α11 := Type -WEAK CONSTRAINTS: - - -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 `a` (app [global (const «f1»), c0]) c3 \ app [c1, c2]))] -elab2: -parameter A explicit (global (const «T1»)) c0 \ - parameter B explicit (sort (typ «ind1.u0»)) c1 \ - inductive ind1 tt (arity (sort (typ «ind1.u1»))) c2 \ - [constructor K1 (arity (prod `_` c2 c3 \ c2)), - constructor K2 - (arity (prod `_` (app [global (const «f1»), c0]) c3 \ c2)), - constructor K3 - (arity (prod `a` (app [global (const «f1»), c0]) c3 \ c2))] -raw: -parameter A explicit (global (const «T1»)) c0 \ - record ind2 (sort (typ «f1.u0»)) 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 «ind2.u0»)) 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 «ind3.u0»)) Build_ind3 - (field [coercion reversible, canonical tt] fld3 (sort (typ «ind3.u1»)) - 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 -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: - {} -FLEXIBLE UNIVERSES: - -SORTS: - α21 := Type -WEAK CONSTRAINTS: - - -unknown_gref -«elpi.tests.test_API_elaborate.52» «elpi.tests.test_API_elaborate.52» -File "./tests/test_API_elaborate.v", line 160, characters 19-20: -Warning: -File "./tests/test_API_elaborate.v", line 160, characters 19-20 -Y is linear: name it _Y (discard) or Y_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API_elaborate.v", line 170, characters 33-34: -Warning: -File "./tests/test_API_elaborate.v", line 170, characters 33-34 -Y is linear: name it _Y (discard) or Y_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -Coq version: 8.20.1 = 8 . 20 . 1 -Query assignments: - MA = 8 - MI = 20 - P = 1 - V = 8.20.1 -hello world -A -B -Query assignments: - GR = «nat» -Query assignments: - GR = «Nat.add» - MP = «Coq.Init.Datatypes» -Query assignments: - A = «elpi.tests.test_API.succ» - GR = «Nat.add» - MP = «Coq.Init.Datatypes» - X1 = [loc-gref (const «Nat.add»)] - X2 = [loc-gref (const «Nat.add»)] - X3 = [loc-abbreviation «elpi.tests.test_API.succ»] - X4 = [loc-modpath «Coq.Init.Datatypes»] -Universe constraints: -Query assignments: - X = «elpi.tests.test_API.1» -Universe constraints: -UNIVERSES: - {elpi.tests.test_API.1} |= -ALGEBRAIC UNIVERSES: - {} -FLEXIBLE UNIVERSES: - -SORTS: - -WEAK CONSTRAINTS: - - -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: - {} -FLEXIBLE UNIVERSES: - -SORTS: - -WEAK CONSTRAINTS: - - -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: - {} -FLEXIBLE UNIVERSES: - -SORTS: - -WEAK CONSTRAINTS: - - -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: - {} -FLEXIBLE UNIVERSES: - -SORTS: - -WEAK CONSTRAINTS: - - -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: - {} -FLEXIBLE UNIVERSES: - -SORTS: - -WEAK CONSTRAINTS: - - -[foo (const «X»), foo (indt «nat»), foo (indt «bool»)] -[foo (indt «nat»), foo (indt «bool»)] -[] -[foo (indt «nat»)] -hello [int 1, int 2, trm (global (indt «nat»)), str x] -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 _elpi_renamed_x_3 return ?e6 with - | true => S (S (S O)) - | false => y - end -fix foo x y {struct x} := if x as _elpi_renamed_x_3 then 3 else y -File "./tests/test_API.v", line 73, characters 37-39: -Warning: -File "./tests/test_API.v", line 73, characters 37-39 -MP is linear: name it _MP (discard) or MP_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API.v", line 81, characters 54-55: -Warning: -File "./tests/test_API.v", line 81, characters 54-55 -A is linear: name it _A (discard) or A_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API.v", line 82, characters 56-58: -Warning: -File "./tests/test_API.v", line 82, characters 56-58 -MP is linear: name it _MP (discard) or MP_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API.v", line 91, characters 29-30: -Warning: -File "./tests/test_API.v", line 91, characters 29-30 -X is linear: name it _X (discard) or X_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API.v", line 92, characters 29-30: -Warning: -File "./tests/test_API.v", line 92, characters 29-30 -X is linear: name it _X (discard) or X_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API.v", line 92, characters 31-32: -Warning: -File "./tests/test_API.v", line 92, characters 31-32 -Y is linear: name it _Y (discard) or Y_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API.v", line 93, characters 28-29: -Warning: -File "./tests/test_API.v", line 93, characters 28-29 -X is linear: name it _X (discard) or X_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API.v", line 93, characters 30-31: -Warning: -File "./tests/test_API.v", line 93, characters 30-31 -Y is linear: name it _Y (discard) or Y_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API.v", line 94, characters 36-37: -Warning: -File "./tests/test_API.v", line 94, characters 36-37 -X is linear: name it _X (discard) or X_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API.v", line 94, characters 38-39: -Warning: -File "./tests/test_API.v", line 94, characters 38-39 -Y is linear: name it _Y (discard) or Y_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API.v", line 94, characters 40-41: -Warning: -File "./tests/test_API.v", line 94, characters 40-41 -Z is linear: name it _Z (discard) or Z_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API.v", line 95, characters 29-30: -Warning: -File "./tests/test_API.v", line 95, characters 29-30 -X is linear: name it _X (discard) or X_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API.v", line 95, characters 31-32: -Warning: -File "./tests/test_API.v", line 95, characters 31-32 -Y is linear: name it _Y (discard) or Y_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -The argument fun x : ?e => x + ?e1 was closed under 1 binders -old replacement: fun (x : ?e) (y : ?e0) => x - y with -fun (y : ?e1) (x : ?e2) => y + x -new replacement: fun y : ?e0 => x - y with fun y : ?e1 => y + x -z - : nat -it = elpi_subproof - : True -it : True - -it is not universe polymorphic -it is transparent -Expands to: Constant elpi.tests.test_ltac.it -elpi_subproof = I - : True -elpi_subproof : True - -elpi_subproof is not universe polymorphic -elpi_subproof is opaque -Expands to: Constant elpi.tests.test_ltac.elpi_subproof -Closed under the global context -app - [global (indt «eq»), global (indt «nat»), - app - [global (const «map»), - fun `x` (global (indt «nat»)) c1 \ - app - [global (const «Nat.add»), c1, - app [global (indc «S»), global (indc «O»)]]], c0] -app - [global (indt «eq»), global (indt «nat»), - app - [global (const «map»), - fun `x` (global (indt «nat»)) c1 \ - app - [global (const «Nat.add»), c1, - app [global (indc «S»), global (indc «O»)]]], c0] -app - [global (indt «eq»), global (indt «nat»), - app - [global (const «map»), - fun `x0` (global (indt «nat»)) c1 \ - app - [global (const «Nat.add»), c1, - app [global (indc «S»), global (indc «O»)]]], c0] -Query assignments: - P = /build/reproducible-path/coq-elpi-2.5.0/_build/default/elpi/elpi_elaborator.elpi -File "./tests/test_query_extra_dep.v", line 7, characters 44-45: -Warning: -File "./tests/test_query_extra_dep.v", line 7, characters 44-45 -P is linear: name it _P (discard) or P_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -synterp [str X] -interp [str X] -synterp [int 1] -interp [int 1] -synterp [trm _] -interp [trm (app [global (indc «S»), global (indc «O»)])] -synterp -[const-decl x (some _) - (parameter P explicit _ c0 \ parameter Q explicit _ c1 \ arity _)] -interp -[const-decl x - (some - (fun `P` (global (indt «bool»)) c0 \ - fun `Q` (global (indt «bool»)) c1 \ global (indc «O»))) - (parameter P explicit (global (indt «bool»)) c0 \ - parameter Q explicit (global (indt «bool»)) c1 \ - arity (global (indt «nat»)))] -synterp -[const-decl x none - (parameter P explicit _ c0 \ parameter Q explicit _ c1 \ arity _)] -interp -[const-decl x none - (parameter P explicit (global (indt «bool»)) c0 \ - parameter Q explicit (global (indt «bool»)) c1 \ - arity (global (indt «nat»)))] -synterp -[indt-decl - (parameter P explicit _ c0 \ - parameter Q explicit _ c1 \ - record x _ K - (field [coercion off, canonical tt] f1 _ c2 \ - field [coercion off, canonical tt] f2 _ c3 \ end-record))] -interp -[indt-decl - (parameter P explicit (global (indt «bool»)) c0 \ - parameter Q explicit (global (indt «bool»)) c1 \ - record x (sort (typ «Set»)) K - (field [coercion off, canonical tt] f1 (global (indt «nat»)) c2 \ - field [coercion off, canonical tt] f2 - (app [global (indt «eq»), global (indt «nat»), c2, c2]) c3 \ - end-record))] -synterp -[indt-decl - (parameter P explicit _ c0 \ - inductive x tt (parameter Q explicit _ c1 \ arity _) c1 \ - [constructor K (parameter Q explicit _ c2 \ arity _), - constructor R (parameter Q explicit _ c2 \ arity _)])] -interp -[indt-decl - (parameter P explicit (global (indt «bool»)) c0 \ - inductive x tt - (parameter Q explicit (global (indt «bool»)) c1 \ - arity (prod `_` (global (indt «nat»)) c2 \ sort (typ «Set»))) c1 \ - [constructor K - (parameter Q explicit (global (indt «bool»)) c2 \ - arity - (prod `_` (global (indt «nat»)) c3 \ - app - [c1, c2, - app - [global (indc «S»), - app - [global (indc «S»), - app [global (indc «S»), global (indc «O»)]]]])), - constructor R - (parameter Q explicit (global (indt «bool»)) c2 \ - arity - (prod `w` (global (indt «bool»)) c3 \ - app [c1, c2, app [global (indc «S»), global (indc «O»)]]))])] -synterp -[ctx-decl - (context-item A explicit _ none c0 \ - context-item B explicit _ none c1 \ context-end)] -interp -[ctx-decl - (context-item A explicit (global (indt «nat»)) none c0 \ - context-item B explicit (global (indt «bool»)) none c1 \ context-end)] -synterp [str X] -interp [str X] -synterp [int 1] -interp [int 1] -synterp [trm _] -interp [trm (app [global (indc «S»), global (indc «O»)])] -synterp -[const-decl x (some _) - (parameter P explicit _ c0 \ parameter Q explicit _ c1 \ arity _)] -interp -[const-decl x - (some - (fun `P` (global (indt «bool»)) c0 \ - fun `Q` (global (indt «bool»)) c1 \ global (indc «O»))) - (parameter P explicit (global (indt «bool»)) c0 \ - parameter Q explicit (global (indt «bool»)) c1 \ - arity (global (indt «nat»)))] -synterp -[const-decl x none - (parameter P explicit _ c0 \ parameter Q explicit _ c1 \ arity _)] -interp -[const-decl x none - (parameter P explicit (global (indt «bool»)) c0 \ - parameter Q explicit (global (indt «bool»)) c1 \ - arity (global (indt «nat»)))] -synterp -[indt-decl - (parameter P explicit _ c0 \ - parameter Q explicit _ c1 \ - record x _ K - (field [coercion off, canonical tt] f1 _ c2 \ - field [coercion off, canonical tt] f2 _ c3 \ end-record))] -interp -[indt-decl - (parameter P explicit (global (indt «bool»)) c0 \ - parameter Q explicit (global (indt «bool»)) c1 \ - record x (sort (typ «Set»)) K - (field [coercion off, canonical tt] f1 (global (indt «nat»)) c2 \ - field [coercion off, canonical tt] f2 - (app [global (indt «eq»), global (indt «nat»), c2, c2]) c3 \ - end-record))] -synterp -[indt-decl - (parameter P explicit _ c0 \ - inductive x tt (parameter Q explicit _ c1 \ arity _) c1 \ - [constructor K (parameter Q explicit _ c2 \ arity _), - constructor R (parameter Q explicit _ c2 \ arity _)])] -interp -[indt-decl - (parameter P explicit (global (indt «bool»)) c0 \ - inductive x tt - (parameter Q explicit (global (indt «bool»)) c1 \ - arity (prod `_` (global (indt «nat»)) c2 \ sort (typ «Set»))) c1 \ - [constructor K - (parameter Q explicit (global (indt «bool»)) c2 \ - arity - (prod `_` (global (indt «nat»)) c3 \ - app - [c1, c2, - app - [global (indc «S»), - app - [global (indc «S»), - app [global (indc «S»), global (indc «O»)]]]])), - constructor R - (parameter Q explicit (global (indt «bool»)) c2 \ - arity - (prod `w` (global (indt «bool»)) c3 \ - app [c1, c2, app [global (indc «S»), global (indc «O»)]]))])] -synterp -[ctx-decl - (context-item A explicit _ none c0 \ - context-item B explicit _ none c1 \ context-end)] -interp -[ctx-decl - (context-item A explicit (global (indt «nat»)) none c0 \ - context-item B explicit (global (indt «bool»)) none c1 \ context-end)] -a : nat - -a is not universe polymorphic -a is transparent -Expands to: Constant elpi.tests.test_synterp.X.a -Module X := Struct Definition a : nat. End -Module A := Struct Definition a : nat. End -a - : nat -L= [p 1] -File "./tests/test_synterp.v", line 38, characters 20-21: -Warning: -File "./tests/test_synterp.v", line 38, characters 20-21 -X is linear: name it _X (discard) or X_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_synterp.v", line 41, characters 12-13: -Warning: -File "./tests/test_synterp.v", line 41, characters 12-13 -X is linear: name it _X (discard) or X_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -Cats.And.Dogs.x = 42 - : nat -(true && false)%bool - : bool -natmul R n : ringType_sort R - : ringType_sort R -natmul R n : ringType_sort R - : ringType_sort R Debug: ----<<---- enter: coq.say raw: @@ -9559,10 +7646,162 @@ If you instead put X1 explicitly in Prop, set Dependent Proposition Eliminators around the declaration for full backwards compatibility. [automatic-prop-lowering,deprecated-since-8.20,deprecated,default] -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 +d1 + : nat +d2 + : nat +i1 + : Prop +i2 + : Prop +k1 + : i1 +k2 + : i2 +r1 + : Set +r2 + : Type +f1 + : r1 -> nat +f2 + : r2 -> nat +Query assignments: + BO = fix `add` 0 + (prod `n` (global (indt «nat»)) c0 \ + prod `m` (global (indt «nat»)) c1 \ global (indt «nat»)) c0 \ + fun `n` (global (indt «nat»)) c1 \ + fun `m` (global (indt «nat»)) c2 \ + match c1 (fun `n` (global (indt «nat»)) c3 \ global (indt «nat»)) + [c2, + fun `p` (global (indt «nat»)) c3 \ + app [global (indc «S»), app [c0, c3, c2]]] + GR = «Nat.add» + TY = prod `n` (global (indt «nat»)) c0 \ + prod `m` (global (indt «nat»)) c1 \ global (indt «nat») +c2 +global (indt «nat») +z +nat +Query assignments: + %arg1 = c0 \ c1 \ c2 \ +z + %arg2 = c0 \ c1 \ c2 \ +nat + T = global (indt «nat») +c2 +global (indt «nat») +z +nat +Query assignments: + %arg1 = c0 \ c1 \ c2 \ +z + %arg2 = c0 \ c1 \ c2 \ +nat + T = global (indt «nat») +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" +Unable to unify "bool" with "nat". +Query assignments: + Msg = Unable to unify "bool" with "nat". +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: + {} +FLEXIBLE UNIVERSES: + +SORTS: + α1 := Type + α2 := Type +WEAK CONSTRAINTS: + + +global (indt «nat») +Query assignments: + T = global (indt «nat») + X1_ = global (indt «nat») + X2_ = 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: + {} +FLEXIBLE UNIVERSES: + +SORTS: + α3 := Type + α4 := Type + α5 := Type +WEAK CONSTRAINTS: + + +«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} +FLEXIBLE UNIVERSES: + elpi.tests.test_API_typecheck.10 +SORTS: + +WEAK CONSTRAINTS: + + +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). +File "./tests/test_API_typecheck.v", line 59, characters 2-4: +Warning: +File "./tests/test_API_typecheck.v", line 59, characters 2-4 +LE is linear: name it _LE (discard) or LE_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] test2 test1 str hello @@ -9615,47 +7854,8 @@ File "./tests/test_vernacular1.v", line 65, characters 26-27 X is linear: name it _X (discard) or X_ (fresh variable) [elpi.linear-variable,elpi.typecheck,elpi,default] -d - : nat -Foo.x = 3 - : nat -Foo.x = 3 - : nat -Foo.x2 = 4 - : nat -eq_refl : Foo.x = 5 - : Foo.x = 5 -A.B.c : nat - -A.B.c is not universe polymorphic -A.B.c is transparent -Expands to: Constant elpi.apps.NES.tests.test_NES.A_aux_4.A.B.c -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 -1 +z : nat -true : bool - : bool it = elpi_subproof : True it : True @@ -9671,2101 +7871,237 @@ elpi_subproof is opaque Expands to: Constant elpi.tests.test_ltac.elpi_subproof Closed under the global context -hello1 -test1 -str hello -str x -test1 -too many arguments -[attribute elpi.loc - (leaf-loc - File "./tests/test_vernacular2.v", line 10, column 24, characters 326-329:), - attribute elpi.phase (leaf-str interp), - attribute fwd_compat_attr (leaf-str )] -[attribute elpi.loc - (leaf-loc - File "./tests/test_vernacular2.v", line 11, column 0, characters 331-354:), - attribute elpi.phase (leaf-str interp), - attribute fwd_compat_attr (leaf-str )] -File "./tests/test_vernacular2.v", line 6, characters 2-17: -Warning: This command does not support this attribute: fwd_compat_attr. -[unsupported-attributes,parsing,default] -File "./tests/test_vernacular2.v", line 7, characters 2-17: -Warning: This command does not support this attribute: fwd_compat_attr. -[unsupported-attributes,parsing,default] -File "./tests/test_vernacular2.v", line 8, characters 2-17: -Warning: This command does not support this attribute: fwd_compat_attr. -[unsupported-attributes,parsing,default] -File "./tests/test_vernacular2.v", line 9, characters 2-17: -Warning: This command does not support this attribute: fwd_compat_attr. -[unsupported-attributes,parsing,default] -File "./tests/test_vernacular2.v", line 10, characters 2-17: -Warning: This command does not support this attribute: fwd_compat_attr. -[unsupported-attributes,parsing,default] -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. +app + [global (indt «eq»), global (indt «nat»), + app + [global (const «map»), + fun `x` (global (indt «nat»)) c1 \ + app + [global (const «Nat.add»), c1, + app [global (indc «S»), global (indc «O»)]]], c0] +app + [global (indt «eq»), global (indt «nat»), + app + [global (const «map»), + fun `x` (global (indt «nat»)) c1 \ + app + [global (const «Nat.add»), c1, + app [global (indc «S»), global (indc «O»)]]], c0] +app + [global (indt «eq»), global (indt «nat»), + app + [global (const «map»), + fun `x0` (global (indt «nat»)) c1 \ + app + [global (const «Nat.add»), c1, + app [global (indc «S»), global (indc «O»)]]], c0] +Query assignments: + P = /build/reproducible-path/coq-elpi-2.5.0/_build/default/elpi/elpi_elaborator.elpi +File "./tests/test_query_extra_dep.v", line 7, characters 44-45: +Warning: +File "./tests/test_query_extra_dep.v", line 7, characters 44-45 +P is linear: name it _P (discard) or P_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +synterp [str X] +interp [str X] +synterp [int 1] +interp [int 1] +synterp [trm _] +interp [trm (app [global (indc «S»), global (indc «O»)])] +synterp +[const-decl x (some _) + (parameter P explicit _ c0 \ parameter Q explicit _ c1 \ arity _)] +interp +[const-decl x + (some + (fun `P` (global (indt «bool»)) c0 \ + fun `Q` (global (indt «bool»)) c1 \ global (indc «O»))) + (parameter P explicit (global (indt «bool»)) c0 \ + parameter Q explicit (global (indt «bool»)) c1 \ + arity (global (indt «nat»)))] +synterp +[const-decl x none + (parameter P explicit _ c0 \ parameter Q explicit _ c1 \ arity _)] +interp +[const-decl x none + (parameter P explicit (global (indt «bool»)) c0 \ + parameter Q explicit (global (indt «bool»)) c1 \ + arity (global (indt «nat»)))] +synterp +[indt-decl + (parameter P explicit _ c0 \ + parameter Q explicit _ c1 \ + record x _ K + (field [coercion off, canonical tt] f1 _ c2 \ + field [coercion off, canonical tt] f2 _ c3 \ end-record))] +interp +[indt-decl + (parameter P explicit (global (indt «bool»)) c0 \ + parameter Q explicit (global (indt «bool»)) c1 \ + record x (sort (typ «Set»)) K + (field [coercion off, canonical tt] f1 (global (indt «nat»)) c2 \ + field [coercion off, canonical tt] f2 + (app [global (indt «eq»), global (indt «nat»), c2, c2]) c3 \ + end-record))] +synterp +[indt-decl + (parameter P explicit _ c0 \ + inductive x tt (parameter Q explicit _ c1 \ arity _) c1 \ + [constructor K (parameter Q explicit _ c2 \ arity _), + constructor R (parameter Q explicit _ c2 \ arity _)])] +interp +[indt-decl + (parameter P explicit (global (indt «bool»)) c0 \ + inductive x tt + (parameter Q explicit (global (indt «bool»)) c1 \ + arity (prod `_` (global (indt «nat»)) c2 \ sort (typ «Set»))) c1 \ + [constructor K + (parameter Q explicit (global (indt «bool»)) c2 \ + arity + (prod `_` (global (indt «nat»)) c3 \ + app + [c1, c2, + app + [global (indc «S»), + app + [global (indc «S»), + app [global (indc «S»), global (indc «O»)]]]])), + constructor R + (parameter Q explicit (global (indt «bool»)) c2 \ + arity + (prod `w` (global (indt «bool»)) c3 \ + app [c1, c2, app [global (indc «S»), global (indc «O»)]]))])] +synterp +[ctx-decl + (context-item A explicit _ none c0 \ + context-item B explicit _ none c1 \ context-end)] +interp +[ctx-decl + (context-item A explicit (global (indt «nat»)) none c0 \ + context-item B explicit (global (indt «bool»)) none c1 \ context-end)] +synterp [str X] +interp [str X] +synterp [int 1] +interp [int 1] +synterp [trm _] +interp [trm (app [global (indc «S»), global (indc «O»)])] +synterp +[const-decl x (some _) + (parameter P explicit _ c0 \ parameter Q explicit _ c1 \ arity _)] +interp +[const-decl x + (some + (fun `P` (global (indt «bool»)) c0 \ + fun `Q` (global (indt «bool»)) c1 \ global (indc «O»))) + (parameter P explicit (global (indt «bool»)) c0 \ + parameter Q explicit (global (indt «bool»)) c1 \ + arity (global (indt «nat»)))] +synterp +[const-decl x none + (parameter P explicit _ c0 \ parameter Q explicit _ c1 \ arity _)] +interp +[const-decl x none + (parameter P explicit (global (indt «bool»)) c0 \ + parameter Q explicit (global (indt «bool»)) c1 \ + arity (global (indt «nat»)))] +synterp +[indt-decl + (parameter P explicit _ c0 \ + parameter Q explicit _ c1 \ + record x _ K + (field [coercion off, canonical tt] f1 _ c2 \ + field [coercion off, canonical tt] f2 _ c3 \ end-record))] +interp +[indt-decl + (parameter P explicit (global (indt «bool»)) c0 \ + parameter Q explicit (global (indt «bool»)) c1 \ + record x (sort (typ «Set»)) K + (field [coercion off, canonical tt] f1 (global (indt «nat»)) c2 \ + field [coercion off, canonical tt] f2 + (app [global (indt «eq»), global (indt «nat»), c2, c2]) c3 \ + end-record))] +synterp +[indt-decl + (parameter P explicit _ c0 \ + inductive x tt (parameter Q explicit _ c1 \ arity _) c1 \ + [constructor K (parameter Q explicit _ c2 \ arity _), + constructor R (parameter Q explicit _ c2 \ arity _)])] +interp +[indt-decl + (parameter P explicit (global (indt «bool»)) c0 \ + inductive x tt + (parameter Q explicit (global (indt «bool»)) c1 \ + arity (prod `_` (global (indt «nat»)) c2 \ sort (typ «Set»))) c1 \ + [constructor K + (parameter Q explicit (global (indt «bool»)) c2 \ + arity + (prod `_` (global (indt «nat»)) c3 \ + app + [c1, c2, + app + [global (indc «S»), + app + [global (indc «S»), + app [global (indc «S»), global (indc «O»)]]]])), + constructor R + (parameter Q explicit (global (indt «bool»)) c2 \ + arity + (prod `w` (global (indt «bool»)) c3 \ + app [c1, c2, app [global (indc «S»), global (indc «O»)]]))])] +synterp +[ctx-decl + (context-item A explicit _ none c0 \ + context-item B explicit _ none c1 \ context-end)] +interp +[ctx-decl + (context-item A explicit (global (indt «nat»)) none c0 \ + context-item B explicit (global (indt «bool»)) none c1 \ context-end)] +a : nat -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 _ _ -Debug: run 1 {{{ - -Debug: - rid:0 step:1 gid:4 user:curgoal = => - attributes - [attribute elpi.loc - (leaf-loc - File "./examples/example_record_expansion.v", line 221, column 5, characters 9572-9585:), - attribute elpi.phase (leaf-str interp)] - => - (main-interp - [str r, str f, str expanded_] _ ; - main [str r, str f, str expanded_]) - -Debug: - rid:0 step:1 gid:4 user:rule = implication - -Debug: - rid:0 step:1 gid:4 user:subgoal = 5 - -Debug: - rid:0 step:1 gid:5 user:newgoal = main-interp [str r, str f, str expanded_] _ - ; main [str r, str f, str expanded_] - -Debug: - rid:0 step:1 gid:5 user:rule:implication = success - -Debug: }}} -> (0.079s) -Debug: run 2 {{{ - -Debug: - rid:0 step:2 gid:5 user:curgoal = ; - main-interp [str r, str f, str expanded_] _ - ; main [str r, str f, str expanded_] - -Debug: - rid:0 step:2 gid:5 user:rule = backchain - -Debug: - rid:0 step:2 gid:5 user:rule:backchain:candidates = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: - File "elpi-builtin.elpi", line 36, column 0, characters 388-400: - -Debug: }}} -> (0.000s) -Debug: select 3 {{{ - -Debug: - rid:0 step:2 gid:5 user:rule:backchain:try = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: - (A0 ; _) :- A0. - -Debug: - rid:0 step:2 gid:0 user:assign = A0 := main-interp - [str r, str f, str expanded_] _ - -Debug: - rid:0 step:2 gid:5 user:subgoal = 6 - -Debug: - rid:0 step:2 gid:6 user:newgoal = main-interp [str r, str f, str expanded_] _ - -Debug: - rid:0 step:2 gid:6 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 3 {{{ - -Debug: - rid:0 step:3 gid:6 user:curgoal = main-interp - main-interp [str r, str f, str expanded_] _ - -Debug: - rid:0 step:3 gid:6 user:rule = backchain - -Debug: rid:0 step:3 gid:6 user:rule:backchain:candidates = -Debug: }}} -> (0.000s) -Debug: select 4 {{{ - -Debug: - rid:0 step:3 gid:6 user:rule:backchain = fail - -Debug: }}} -> (0.000s) -Debug: run 4 {{{ - -Debug: - rid:0 step:4 gid:5 user:curgoal = ; - main-interp [str r, str f, str expanded_] _ - ; main [str r, str f, str expanded_] - -Debug: - rid:0 step:4 gid:5 user:rule = backchain - -Debug: - rid:0 step:4 gid:5 user:rule:backchain:candidates = File "elpi-builtin.elpi", line 36, column 0, characters 388-400: - -Debug: }}} -> (0.000s) -Debug: select 5 {{{ - -Debug: - rid:0 step:4 gid:5 user:rule:backchain:try = File "elpi-builtin.elpi", line 36, column 0, characters 388-400: - (_ ; A0) :- A0. - -Debug: - rid:0 step:4 gid:0 user:assign = A0 := main [str r, str f, str expanded_] - -Debug: - rid:0 step:4 gid:5 user:subgoal = 7 - -Debug: - rid:0 step:4 gid:7 user:newgoal = main [str r, str f, str expanded_] - -Debug: - rid:0 step:4 gid:7 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 5 {{{ - -Debug: - rid:0 step:5 gid:7 user:curgoal = main - main [str r, str f, str expanded_] - -Debug: - rid:0 step:5 gid:7 user:rule = backchain - -Debug: - rid:0 step:5 gid:7 user:rule:backchain:candidates = File "./examples/example_record_expansion.v", line 197, column 0, characters 8773-9225: - File "./examples/example_record_expansion.v", line 207, column 0, characters 9228-9306: - -Debug: }}} -> (0.000s) -Debug: select 6 {{{ - -Debug: - rid:0 step:5 gid:7 user:rule:backchain:try = File "./examples/example_record_expansion.v", line 197, column 0, characters 8773-9225: - (main [str A0, str A2, str A6]) :- (!), - (std.assert! - (coq.locate A0 (indt A1)) - The first argument must be a record name), - (std.assert! - (coq.locate A2 A3) - The second argument must be a global term), - (coq.gref->id A3 A4), - (A5 is A6 ^ A4), - (expand-gref A1 A3 A5 A7), - (coq.elpi.accumulate _ - record.expand.db - (clause _ - (before expand:start) A7)). - -Debug: - rid:0 step:5 gid:0 user:assign = A0 := r - -Debug: - rid:0 step:5 gid:0 user:assign = A2 := f - -Debug: - rid:0 step:5 gid:0 user:assign = A6 := expanded_ - -Debug: - rid:0 step:5 gid:7 user:subgoal = 8 - -Debug: - rid:0 step:5 gid:8 user:newgoal = ! - -Debug: - rid:0 step:5 gid:8 user:subgoal = 9 - -Debug: - rid:0 step:5 gid:9 user:newgoal = std.assert! (coq.locate r (indt X0)) - The first argument must be a record name - -Debug: - rid:0 step:5 gid:8 user:subgoal = 10 - -Debug: - rid:0 step:5 gid:10 user:newgoal = std.assert! (coq.locate f X1) - The second argument must be a global term - -Debug: - rid:0 step:5 gid:8 user:subgoal = 11 - -Debug: - rid:0 step:5 gid:11 user:newgoal = coq.gref->id X1 X2 - -Debug: - rid:0 step:5 gid:8 user:subgoal = 12 - -Debug: - rid:0 step:5 gid:12 user:newgoal = X3 is expanded_ ^ X2 - -Debug: - rid:0 step:5 gid:8 user:subgoal = 13 - -Debug: - rid:0 step:5 gid:13 user:newgoal = expand-gref X0 X1 X3 X4 - -Debug: - rid:0 step:5 gid:8 user:subgoal = 14 - -Debug: - rid:0 step:5 gid:14 user:newgoal = coq.elpi.accumulate _ record.expand.db - (clause _ (before expand:start) X4) - -Debug: - rid:0 step:5 gid:8 user:rule:backchain = success - -Debug: }}} -> (0.002s) -Debug: run 6 {{{ - -Debug: - rid:0 step:6 gid:8 user:curgoal = ! - ! - -Debug: }}} -> (0.000s) -Debug: - rid:0 step:6 gid:8 user:rule = cut - -Debug: - rid:0 step:6 gid:0 user:rule:cut:branch = 7 - File "./examples/example_record_expansion.v", line 207, column 0, characters 9228-9306: - (main _) :- (coq.error - usage: Elpi record.expand record_name global_term prefix). - -Debug: - rid:0 step:6 gid:8 user:rule:cut = success - -Debug: run 7 {{{ - -Debug: - rid:0 step:7 gid:9 user:curgoal = std.assert! - std.assert! (coq.locate r (indt X0)) - The first argument must be a record name - -Debug: - rid:0 step:7 gid:9 user:rule = backchain - -Debug: - rid:0 step:7 gid:9 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 39, column 0, characters 1190-1249: - -Debug: }}} -> (0.000s) -Debug: select 7 {{{ - -Debug: - rid:0 step:7 gid:9 user:rule:backchain:try = File "builtin_stdlib.elpi", line 39, column 0, characters 1190-1249: - (std.assert! A0 A1) :- ( - A0 ; - std.fatal-error-w-data A1 A0), - (!). - -Debug: - rid:0 step:7 gid:0 user:assign = A0 := coq.locate r (indt X0) - -Debug: - rid:0 step:7 gid:0 user:assign = A1 := The first argument must be a record name - -Debug: - rid:0 step:7 gid:9 user:subgoal = 15 - -Debug: - rid:0 step:7 gid:15 user:newgoal = coq.locate r (indt X0) ; - std.fatal-error-w-data - The first argument must be a record name - (coq.locate r (indt X0)) - -Debug: - rid:0 step:7 gid:15 user:subgoal = 16 - -Debug: - rid:0 step:7 gid:16 user:newgoal = ! - -Debug: - rid:0 step:7 gid:15 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 8 {{{ - -Debug: - rid:0 step:8 gid:15 user:curgoal = ; - coq.locate r (indt X0) ; - std.fatal-error-w-data - The first argument must be a record name - (coq.locate r (indt X0)) - -Debug: - rid:0 step:8 gid:15 user:rule = backchain - -Debug: - rid:0 step:8 gid:15 user:rule:backchain:candidates = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: - File "elpi-builtin.elpi", line 36, column 0, characters 388-400: - -Debug: }}} -> (0.000s) -Debug: select 8 {{{ - -Debug: - rid:0 step:8 gid:15 user:rule:backchain:try = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: - (A0 ; _) :- A0. - -Debug: - rid:0 step:8 gid:0 user:assign = A0 := coq.locate r (indt X0) - -Debug: - rid:0 step:8 gid:15 user:subgoal = 17 - -Debug: - rid:0 step:8 gid:17 user:newgoal = coq.locate r (indt X0) - -Debug: - rid:0 step:8 gid:17 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 9 {{{ - -Debug: - rid:0 step:9 gid:17 user:curgoal = coq.locate - coq.locate r (indt X0) - -Debug: - rid:0 step:9 gid:17 user:rule = builtin - -Debug: - rid:0 step:9 gid:17 user:rule:builtin:name = coq.locate - -Debug: - rid:0 step:9 gid:17 user:rule:builtin = success - -Debug: - rid:0 step:9 gid:17 user:subgoal = 18 - -Debug: - rid:0 step:9 gid:18 user:newgoal = indt X0 = indt «r» - -Debug: }}} -> (0.000s) -Debug: run 10 {{{ - -Debug: - rid:0 step:10 gid:18 user:curgoal = = - indt X0 = indt «r» - -Debug: - rid:0 step:10 gid:18 user:rule = eq - -Debug: - rid:0 step:10 gid:18 user:rule:builtin:name = = - -Debug: - rid:0 step:10 gid:0 user:assign = X0 := «r» - -Debug: - rid:0 step:10 gid:18 user:rule:eq = success - -Debug: }}} -> (0.000s) -Debug: run 11 {{{ - -Debug: - rid:0 step:11 gid:16 user:curgoal = ! - ! - -Debug: }}} -> (0.000s) -Debug: - rid:0 step:11 gid:16 user:rule = cut - -Debug: - rid:0 step:11 gid:0 user:rule:cut:branch = 15 - File "elpi-builtin.elpi", line 36, column 0, characters 388-400: - (_ ; A0) :- A0. - -Debug: - rid:0 step:11 gid:16 user:rule:cut = success - -Debug: run 12 {{{ - -Debug: - rid:0 step:12 gid:10 user:curgoal = std.assert! - std.assert! (coq.locate f X1) - The second argument must be a global term - -Debug: - rid:0 step:12 gid:10 user:rule = backchain - -Debug: - rid:0 step:12 gid:10 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 39, column 0, characters 1190-1249: - -Debug: }}} -> (0.000s) -Debug: select 9 {{{ - -Debug: - rid:0 step:12 gid:10 user:rule:backchain:try = File "builtin_stdlib.elpi", line 39, column 0, characters 1190-1249: - (std.assert! A0 A1) :- ( - A0 ; - std.fatal-error-w-data A1 A0), - (!). - -Debug: - rid:0 step:12 gid:0 user:assign = A0 := coq.locate f X1 - -Debug: - rid:0 step:12 gid:0 user:assign = A1 := The second argument must be a global term - -Debug: - rid:0 step:12 gid:10 user:subgoal = 19 - -Debug: - rid:0 step:12 gid:19 user:newgoal = coq.locate f X1 ; - std.fatal-error-w-data - The second argument must be a global term - (coq.locate f X1) - -Debug: - rid:0 step:12 gid:19 user:subgoal = 20 - -Debug: - rid:0 step:12 gid:20 user:newgoal = ! - -Debug: - rid:0 step:12 gid:19 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 13 {{{ - -Debug: - rid:0 step:13 gid:19 user:curgoal = ; - coq.locate f X1 ; - std.fatal-error-w-data - The second argument must be a global term - (coq.locate f X1) - -Debug: - rid:0 step:13 gid:19 user:rule = backchain - -Debug: - rid:0 step:13 gid:19 user:rule:backchain:candidates = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: - File "elpi-builtin.elpi", line 36, column 0, characters 388-400: - -Debug: }}} -> (0.000s) -Debug: select 10 {{{ - -Debug: - rid:0 step:13 gid:19 user:rule:backchain:try = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: - (A0 ; _) :- A0. - -Debug: - rid:0 step:13 gid:0 user:assign = A0 := coq.locate f X1 - -Debug: - rid:0 step:13 gid:19 user:subgoal = 21 - -Debug: - rid:0 step:13 gid:21 user:newgoal = coq.locate f X1 - -Debug: - rid:0 step:13 gid:21 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 14 {{{ - -Debug: - rid:0 step:14 gid:21 user:curgoal = coq.locate - coq.locate f X1 - -Debug: - rid:0 step:14 gid:21 user:rule = builtin - -Debug: - rid:0 step:14 gid:21 user:rule:builtin:name = coq.locate - -Debug: - rid:0 step:14 gid:21 user:rule:builtin = success - -Debug: - rid:0 step:14 gid:21 user:subgoal = 22 - -Debug: - rid:0 step:14 gid:22 user:newgoal = X1 = const «f» - -Debug: }}} -> (0.000s) -Debug: run 15 {{{ - -Debug: - rid:0 step:15 gid:22 user:curgoal = = - X1 = const «f» - -Debug: - rid:0 step:15 gid:22 user:rule = eq - -Debug: - rid:0 step:15 gid:22 user:rule:builtin:name = = - -Debug: - rid:0 step:15 gid:0 user:assign = X1 := const «f» - -Debug: - rid:0 step:15 gid:22 user:rule:eq = success - -Debug: }}} -> (0.000s) -Debug: run 16 {{{ - -Debug: - rid:0 step:16 gid:20 user:curgoal = ! - ! - -Debug: }}} -> (0.000s) -Debug: - rid:0 step:16 gid:20 user:rule = cut - -Debug: - rid:0 step:16 gid:0 user:rule:cut:branch = 19 - File "elpi-builtin.elpi", line 36, column 0, characters 388-400: - (_ ; A0) :- A0. - -Debug: - rid:0 step:16 gid:20 user:rule:cut = success - -Debug: run 17 {{{ - -Debug: - rid:0 step:17 gid:11 user:curgoal = coq.gref->id - coq.gref->id (const «f») X2 - -Debug: - rid:0 step:17 gid:11 user:rule = builtin - -Debug: - rid:0 step:17 gid:11 user:rule:builtin:name = coq.gref->id - -Debug: - rid:0 step:17 gid:11 user:rule:builtin = success - -Debug: - rid:0 step:17 gid:11 user:subgoal = 23 - -Debug: - rid:0 step:17 gid:23 user:newgoal = X2 = f - -Debug: }}} -> (0.000s) -Debug: run 18 {{{ - -Debug: - rid:0 step:18 gid:23 user:curgoal = = - X2 = f - -Debug: - rid:0 step:18 gid:23 user:rule = eq - -Debug: - rid:0 step:18 gid:23 user:rule:builtin:name = = - -Debug: - rid:0 step:18 gid:0 user:assign = X2 := f - -Debug: - rid:0 step:18 gid:23 user:rule:eq = success - -Debug: }}} -> (0.000s) -Debug: run 19 {{{ - -Debug: - rid:0 step:19 gid:12 user:curgoal = is - X3 is expanded_ ^ f - -Debug: - rid:0 step:19 gid:12 user:rule = backchain - -Debug: - rid:0 step:19 gid:12 user:rule:backchain:candidates = File "elpi-builtin.elpi", line 83, column 0, characters 1181-1199: - -Debug: }}} -> (0.000s) -Debug: select 11 {{{ - -Debug: - rid:0 step:19 gid:12 user:rule:backchain:try = File "elpi-builtin.elpi", line 83, column 0, characters 1181-1199: - (A1 is A0) :- (calc A0 A1). - -Debug: - rid:0 step:19 gid:0 user:assign = A1 := X3 - -Debug: - rid:0 step:19 gid:0 user:assign = A0 := expanded_ ^ f - -Debug: - rid:0 step:19 gid:12 user:subgoal = 24 - -Debug: - rid:0 step:19 gid:24 user:newgoal = calc (expanded_ ^ f) X3 - -Debug: - rid:0 step:19 gid:24 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 20 {{{ - -Debug: - rid:0 step:20 gid:24 user:curgoal = calc - calc (expanded_ ^ f) X3 - -Debug: - rid:0 step:20 gid:24 user:rule = builtin - -Debug: - rid:0 step:20 gid:24 user:rule:builtin:name = calc - -Debug: - rid:0 step:20 gid:24 user:rule:builtin = success - -Debug: - rid:0 step:20 gid:24 user:subgoal = 25 - -Debug: - rid:0 step:20 gid:25 user:newgoal = X3 = expanded_f - -Debug: }}} -> (0.001s) -Debug: run 21 {{{ - -Debug: - rid:0 step:21 gid:25 user:curgoal = = - X3 = expanded_f - -Debug: - rid:0 step:21 gid:25 user:rule = eq - -Debug: - rid:0 step:21 gid:25 user:rule:builtin:name = = - -Debug: - rid:0 step:21 gid:0 user:assign = X3 := expanded_f - -Debug: - rid:0 step:21 gid:25 user:rule:eq = success - -Debug: }}} -> (0.000s) -Debug: run 22 {{{ - -Debug: - rid:0 step:22 gid:13 user:curgoal = expand-gref - expand-gref «r» (const «f») - expanded_f X4 - -Debug: - rid:0 step:22 gid:13 user:rule = backchain - -Debug: - rid:0 step:22 gid:13 user:rule:backchain:candidates = File "./examples/example_record_expansion.v", line 184, column 0, characters 8165-8504: - File "./examples/example_record_expansion.v", line 192, column 0, characters 8507-8568: - File "./examples/example_record_expansion.v", line 194, column 0, characters 8571-8690: - -Debug: }}} -> (0.000s) -Debug: select 12 {{{ - -Debug: - rid:0 step:22 gid:13 user:rule:backchain:try = File "./examples/example_record_expansion.v", line 184, column 0, characters 8165-8504: - (expand-gref A2 (const A0) A5 - A7) :- (!), - (std.do! - [std.assert! - (coq.env.const A0 - (some A1) _) - only transparent constants can be expanded, - pi (c0 \ - (expand-record A2 - (const A0) c0 A1 A3 - (A4 c0))), - std.assert-ok! - (coq.typecheck A3 _) - illtyped, - coq.env.add-const A5 A3 _ - _ A6, A7 = A4 (const A6)]). - -Debug: - rid:0 step:22 gid:0 user:assign = A2 := «r» - -Debug: - rid:0 step:22 gid:0 user:assign = A0 := «f» - -Debug: - rid:0 step:22 gid:0 user:assign = A5 := expanded_f - -Debug: - rid:0 step:22 gid:0 user:assign = A7 := X4 - -Debug: - rid:0 step:22 gid:13 user:subgoal = 26 - -Debug: - rid:0 step:22 gid:26 user:newgoal = ! - -Debug: - rid:0 step:22 gid:26 user:subgoal = 27 - -Debug: - rid:0 step:22 gid:27 user:newgoal = std.do! - [std.assert! - (coq.env.const «f» (some X5) _) - only transparent constants can be expanded, - pi c0 \ - expand-record «r» (const «f») c0 - X5 X6 (X7 c0), - std.assert-ok! (coq.typecheck X6 _) - illtyped, - coq.env.add-const expanded_f X6 _ _ X8, - X4 = X7 (const X8)] - -Debug: - rid:0 step:22 gid:26 user:rule:backchain = success - -Debug: }}} -> (0.001s) -Debug: run 23 {{{ - -Debug: - rid:0 step:23 gid:26 user:curgoal = ! - ! - -Debug: }}} -> (0.000s) -Debug: - rid:0 step:23 gid:26 user:rule = cut - -Debug: - rid:0 step:23 gid:0 user:rule:cut:branch = 13 - File "./examples/example_record_expansion.v", line 192, column 0, characters 8507-8568: - (expand-gref _ (indt _) _ _) :- ( - coq.error Not implemented yet). - -Debug: - rid:0 step:23 gid:0 user:rule:cut:branch = 13 - File "./examples/example_record_expansion.v", line 194, column 0, characters 8571-8690: - (expand-gref _ (indc _) _ _) :- ( - coq.error - It makes no sense to expand a constructor alone, expand the inductive instead). - -Debug: - rid:0 step:23 gid:26 user:rule:cut = success - -Debug: run 24 {{{ - -Debug: - rid:0 step:24 gid:27 user:curgoal = std.do! - std.do! - [std.assert! - (coq.env.const «f» (some X5) _) - only transparent constants can be expanded, - pi c0 \ - expand-record «r» (const «f») c0 - X5 X6 (X7 c0), - std.assert-ok! (coq.typecheck X6 _) - illtyped, - coq.env.add-const expanded_f X6 _ _ X8, - X4 = X7 (const X8)] - -Debug: - rid:0 step:24 gid:27 user:rule = backchain - -Debug: - rid:0 step:24 gid:27 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 279, column 0, characters 9290-9316: - -Debug: }}} -> (0.000s) -Debug: select 13 {{{ - -Debug: - rid:0 step:24 gid:27 user:rule:backchain:try = File "builtin_stdlib.elpi", line 279, column 0, characters 9290-9316: - (std.do! [A0 | A1]) :- A0, - (!), (std.do! A1). - -Debug: - rid:0 step:24 gid:0 user:assign = A0 := std.assert! - (coq.env.const «f» (some X5) _) - only transparent constants can be expanded - -Debug: - rid:0 step:24 gid:0 user:assign = A1 := [pi c0 \ - expand-record «r» (const «f») - c0 X5 X6 (X7 c0), - std.assert-ok! (coq.typecheck X6 _) - illtyped, - coq.env.add-const expanded_f X6 _ _ - X8, X4 = X7 (const X8)] - -Debug: - rid:0 step:24 gid:27 user:subgoal = 28 - -Debug: - rid:0 step:24 gid:28 user:newgoal = std.assert! - (coq.env.const «f» (some X5) _) - only transparent constants can be expanded - -Debug: - rid:0 step:24 gid:28 user:subgoal = 29 - -Debug: - rid:0 step:24 gid:29 user:newgoal = ! - -Debug: - rid:0 step:24 gid:28 user:subgoal = 30 - -Debug: - rid:0 step:24 gid:30 user:newgoal = std.do! - [pi c0 \ - expand-record «r» (const «f») c0 - X5 X6 (X7 c0), - std.assert-ok! (coq.typecheck X6 _) - illtyped, - coq.env.add-const expanded_f X6 _ _ X8, - X4 = X7 (const X8)] - -Debug: - rid:0 step:24 gid:28 user:rule:backchain = success - -Debug: }}} -> (0.001s) -Debug: run 25 {{{ - -Debug: - rid:0 step:25 gid:28 user:curgoal = std.assert! - std.assert! - (coq.env.const «f» (some X5) _) - only transparent constants can be expanded - -Debug: - rid:0 step:25 gid:28 user:rule = backchain - -Debug: - rid:0 step:25 gid:28 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 39, column 0, characters 1190-1249: - -Debug: }}} -> (0.000s) -Debug: select 14 {{{ - -Debug: - rid:0 step:25 gid:28 user:rule:backchain:try = File "builtin_stdlib.elpi", line 39, column 0, characters 1190-1249: - (std.assert! A0 A1) :- ( - A0 ; - std.fatal-error-w-data A1 A0), - (!). - -Debug: - rid:0 step:25 gid:0 user:assign = A0 := coq.env.const «f» (some X5) _ - -Debug: - rid:0 step:25 gid:0 user:assign = A1 := only transparent constants can be expanded - -Debug: - rid:0 step:25 gid:28 user:subgoal = 31 - -Debug: - rid:0 step:25 gid:31 user:newgoal = coq.env.const «f» (some X5) _ ; - std.fatal-error-w-data - only transparent constants can be expanded - (coq.env.const «f» (some X5) _) - -Debug: - rid:0 step:25 gid:31 user:subgoal = 32 - -Debug: - rid:0 step:25 gid:32 user:newgoal = ! - -Debug: - rid:0 step:25 gid:31 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 26 {{{ - -Debug: - rid:0 step:26 gid:31 user:curgoal = ; - coq.env.const «f» (some X5) _ ; - std.fatal-error-w-data - only transparent constants can be expanded - (coq.env.const «f» (some X5) _) - -Debug: - rid:0 step:26 gid:31 user:rule = backchain - -Debug: - rid:0 step:26 gid:31 user:rule:backchain:candidates = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: - File "elpi-builtin.elpi", line 36, column 0, characters 388-400: - -Debug: }}} -> (0.000s) -Debug: select 15 {{{ - -Debug: - rid:0 step:26 gid:31 user:rule:backchain:try = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: - (A0 ; _) :- A0. - -Debug: - rid:0 step:26 gid:0 user:assign = A0 := coq.env.const «f» (some X5) _ - -Debug: - rid:0 step:26 gid:31 user:subgoal = 33 - -Debug: - rid:0 step:26 gid:33 user:newgoal = coq.env.const «f» (some X5) _ - -Debug: - rid:0 step:26 gid:33 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 27 {{{ - -Debug: - rid:0 step:27 gid:33 user:curgoal = coq.env.const - coq.env.const «f» (some X5) _ - -Debug: - rid:0 step:27 gid:33 user:rule = builtin - -Debug: - rid:0 step:27 gid:33 user:rule:builtin:name = coq.env.const - -Debug: - rid:0 step:27 gid:33 user:rule:builtin = success - -Debug: - rid:0 step:27 gid:33 user:subgoal = 34 - -Debug: - rid:0 step:27 gid:34 user:newgoal = some X5 = - some - (fun `b` (global (indt «bool»)) c0 \ - fun `t` (global (indt «r»)) c1 \ - let `q` (global (indt «bool»)) - (app [global (const «negb»), c0]) - c2 \ - fix `rec` 0 - (prod `l1` - (app - [global (indt «list»), - app - [global (const «T»), c1]]) - c3 \ - prod `l2` - (app - [global (indt «list»), - app - [global (const «T»), c1]]) - c4 \ global (indt «bool»)) - c3 \ - fun `l1` - (app - [global (indt «list»), - app [global (const «T»), c1]]) - c4 \ - fun `l2` - (app - [global (indt «list»), - app - [global (const «T»), c1]]) - c5 \ - match c4 - (fun `l1` - (app - [global (indt «list»), - app - [global (const «T»), c1]]) - c6 \ global (indt «bool»)) - [match c5 - (fun `l2` - (app - [global (indt «list»), - app - [global (const «T»), - c1]]) c6 \ - global (indt «bool»)) - [c0, - fun `t0` - (app - [global (const «T»), c1]) - c6 \ - fun `l` - (app - [global (indt «list»), - app - [global (const «T»), - c1]]) c7 \ c2], - fun `x` - (app - [global (const «T»), c1]) - c6 \ - fun `xs` - (app - [global (indt «list»), - app - [global (const «T»), - c1]]) c7 \ - match c5 - (fun `l2` - (app - [global (indt «list»), - app - [global (const «T»), - c1]]) c8 \ - global (indt «bool»)) - [c2, - fun `y` - (app - [global (const «T»), - c1]) c8 \ - fun `ys` - (app - [global - (indt «list»), - app - [global - (const «T»), c1]]) - c9 \ - app - [global - (const «andb»), - app - [global - (const «op»), - c1, c6, c8], - app [c3, c7, c9]]]]) - -Debug: }}} -> (0.002s) -Debug: run 28 {{{ - -Debug: - rid:0 step:28 gid:34 user:curgoal = = - some X5 = - some - (fun `b` (global (indt «bool»)) c0 \ - fun `t` (global (indt «r»)) c1 \ - let `q` (global (indt «bool»)) - (app [global (const «negb»), c0]) - c2 \ - fix `rec` 0 - (prod `l1` - (app - [global (indt «list»), - app - [global (const «T»), c1]]) - c3 \ - prod `l2` - (app - [global (indt «list»), - app - [global (const «T»), c1]]) - c4 \ global (indt «bool»)) - c3 \ - fun `l1` - (app - [global (indt «list»), - app [global (const «T»), c1]]) - c4 \ - fun `l2` - (app - [global (indt «list»), - app - [global (const «T»), c1]]) - c5 \ - match c4 - (fun `l1` - (app - [global (indt «list»), - app - [global (const «T»), c1]]) - c6 \ global (indt «bool»)) - [match c5 - (fun `l2` - (app - [global (indt «list»), - app - [global (const «T»), - c1]]) c6 \ - global (indt «bool»)) - [c0, - fun `t0` - (app - [global (const «T»), c1]) - c6 \ - fun `l` - (app - [global (indt «list»), - app - [global (const «T»), - c1]]) c7 \ c2], - fun `x` - (app - [global (const «T»), c1]) - c6 \ - fun `xs` - (app - [global (indt «list»), - app - [global (const «T»), - c1]]) c7 \ - match c5 - (fun `l2` - (app - [global (indt «list»), - app - [global (const «T»), - c1]]) c8 \ - global (indt «bool»)) - [c2, - fun `y` - (app - [global (const «T»), - c1]) c8 \ - fun `ys` - (app - [global - (indt «list»), - app - [global - (const «T»), c1]]) - c9 \ - app - [global - (const «andb»), - app - [global - (const «op»), - c1, c6, c8], - app [c3, c7, c9]]]]) - -Debug: - rid:0 step:28 gid:34 user:rule = eq - -Debug: - rid:0 step:28 gid:34 user:rule:builtin:name = = - -Debug: - rid:0 step:28 gid:0 user:assign = X5 := fun `b` (global (indt «bool»)) c0 \ - fun `t` (global (indt «r»)) c1 \ - let `q` (global (indt «bool»)) -...TRUNCATED BY DUNE... - global (indt «bool»)) c1 \ - prod `l` - (app [global (indt «list»), c0]) - c2 \ - prod `s` - (app [global (indt «list»), c0]) - c3 \ - prod `h` - (global (indt «bool»)) c4 \ - sort prop - -Debug: - rid:1 step:356 gid:1042 user:rule = eq - -Debug: - rid:1 step:356 gid:1042 user:rule:builtin:name = = - -Debug: - rid:1 step:356 gid:1042 user:rule:eq = success - -Debug: }}} -> (0.000s) -Debug: run 357 {{{ - -Debug: - rid:1 step:357 gid:1043 user:curgoal = = - X211 = ok - -Debug: - rid:1 step:357 gid:1043 user:rule = eq - -Debug: - rid:1 step:357 gid:1043 user:rule:builtin:name = = - -Debug: - rid:1 step:357 gid:0 user:assign = X211 := ok - -Debug: - rid:1 step:357 gid:1043 user:rule:eq = success - -Debug: }}} -> (0.000s) -Debug: run 358 {{{ - -Debug: - rid:1 step:358 gid:1039 user:curgoal = ! - ! - -Debug: }}} -> (0.000s) -Debug: - rid:1 step:358 gid:1039 user:rule = cut - -Debug: - rid:1 step:358 gid:0 user:rule:cut:branch = 1035 - File "builtin_stdlib.elpi", line 45, column 0, characters 1554-1621: - (std.assert-ok! _ A0) :- ( - std.fatal-error-w-data A0 - no diagnostic returned). - -Debug: - rid:1 step:358 gid:1039 user:rule:cut = success - -Debug: run 359 {{{ - -Debug: - rid:1 step:359 gid:1040 user:curgoal = ; - ok = ok ; - ok = error X212 , - std.fatal-error-w-data illtyped X212 - -Debug: - rid:1 step:359 gid:1040 user:rule = backchain - -Debug: - rid:1 step:359 gid:1040 user:rule:backchain:candidates = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: - File "elpi-builtin.elpi", line 36, column 0, characters 388-400: - -Debug: }}} -> (0.000s) -Debug: select 269 {{{ - -Debug: - rid:1 step:359 gid:1040 user:rule:backchain:try = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: - (A0 ; _) :- A0. - -Debug: - rid:1 step:359 gid:0 user:assign = A0 := ok = ok - -Debug: - rid:1 step:359 gid:1040 user:subgoal = 1044 - -Debug: - rid:1 step:359 gid:1044 user:newgoal = ok = ok - -Debug: - rid:1 step:359 gid:1044 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 360 {{{ - -Debug: - rid:1 step:360 gid:1044 user:curgoal = = - ok = ok - -Debug: - rid:1 step:360 gid:1044 user:rule = eq - -Debug: - rid:1 step:360 gid:1044 user:rule:builtin:name = = - -Debug: - rid:1 step:360 gid:1044 user:rule:eq = success - -Debug: }}} -> (0.000s) -Debug: run 361 {{{ - -Debug: - rid:1 step:361 gid:1041 user:curgoal = ! - ! - -Debug: }}} -> (0.000s) -Debug: - rid:1 step:361 gid:1041 user:rule = cut - -Debug: - rid:1 step:361 gid:0 user:rule:cut:branch = 1040 - File "elpi-builtin.elpi", line 36, column 0, characters 388-400: - (_ ; A0) :- A0. - -Debug: - rid:1 step:361 gid:1041 user:rule:cut = success - -Debug: run 362 {{{ - -Debug: - rid:1 step:362 gid:1036 user:curgoal = ! - ! - -Debug: }}} -> (0.000s) -Debug: - rid:1 step:362 gid:1036 user:rule = cut - -Debug: - rid:1 step:362 gid:1036 user:rule:cut = success - -Debug: run 363 {{{ - -Debug: - rid:1 step:363 gid:1037 user:curgoal = std.do! - std.do! - [coq.env.add-const expanded_g - (fun `T` (sort (typ «r.u0»)) c0 \ - let `X` (sort (typ «r.u0»)) c0 - c1 \ - fun `op` - (prod `_` c0 c2 \ - prod `_` c1 c3 \ - global (indt «bool»)) c2 \ - fun `l` - (app - [global (indt «list»), c0]) - c3 \ - fun `s` - (app - [global (indt «list»), c0]) - c4 \ - fun `h` - (global (indt «bool»)) - c5 \ - app - [global (indt «and»), - prod `x` c0 c6 \ - prod `y` c1 c7 \ - app - [global (indt «eq»), - global (indt «bool»), - app [c2, c6, c7], - global - (indc «false»)], - app - [global (indt «eq»), - global (indt «bool»), - app - [global - (const «expanded_f»), - global (indc «true»), - c0, c2, c3, c4], c5]]) - _ _ X8, - X4 = - pi c0 \ - pi c1 \ - pi c2 \ - pi c3 \ - pi c4 \ - pi c5 \ - pi c6 \ - pi c7 \ - pi c8 \ - pi c9 \ - pi c10 \ - expand - (app - [global (const «g»), - c0, c3, c5, c7 | c9]) - (app - [global (const X8), - c1, c2, c4, c6, c8 | c10]) - :- - [!, - std.map c9 expand c10, - expand c7 c8, - expand c5 c6, - expand c3 c4, - expand c0 - (app - [global - (indc «Build_r»), - c1, c2])]] - -Debug: - rid:1 step:363 gid:1037 user:rule = backchain - -Debug: - rid:1 step:363 gid:1037 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 279, column 0, characters 9290-9316: - -Debug: }}} -> (0.001s) -Debug: select 270 {{{ - -Debug: - rid:1 step:363 gid:1037 user:rule:backchain:try = File "builtin_stdlib.elpi", line 279, column 0, characters 9290-9316: - (std.do! [A0 | A1]) :- A0, - (!), (std.do! A1). - -Debug: - rid:1 step:363 gid:0 user:assign = A0 := coq.env.add-const expanded_g - (fun `T` (sort (typ «r.u0»)) c0 \ - let `X` (sort (typ «r.u0»)) c0 - c1 \ - fun `op` - (prod `_` c0 c2 \ - prod `_` c1 c3 \ - global (indt «bool»)) c2 \ - fun `l` - (app - [global (indt «list»), c0]) - c3 \ - fun `s` - (app - [global (indt «list»), c0]) - c4 \ - fun `h` - (global (indt «bool»)) - c5 \ - app - [global (indt «and»), - prod `x` c0 c6 \ - prod `y` c1 c7 \ - app - [global (indt «eq»), - global (indt «bool»), - app [c2, c6, c7], - global - (indc «false»)], - app - [global (indt «eq»), - global (indt «bool»), - app - [global - (const «expanded_f»), - global (indc «true»), - c0, c2, c3, c4], c5]]) - _ _ X8 - -Debug: - rid:1 step:363 gid:0 user:assign = A1 := [X4 = - pi c0 \ - pi c1 \ - pi c2 \ - pi c3 \ - pi c4 \ - pi c5 \ - pi c6 \ - pi c7 \ - pi c8 \ - pi c9 \ - pi c10 \ - expand - (app - [global - (const «g»), - c0, c3, c5, c7 | c9]) - (app - [global (const X8), - c1, c2, c4, c6, c8 | c10]) - :- - [!, - std.map c9 expand c10, - expand c7 c8, - expand c5 c6, - expand c3 c4, - expand c0 - (app - [global - (indc - «Build_r»), - c1, c2])]] - -Debug: - rid:1 step:363 gid:1037 user:subgoal = 1045 - -Debug: - rid:1 step:363 gid:1045 user:newgoal = coq.env.add-const expanded_g - (fun `T` (sort (typ «r.u0»)) c0 \ - let `X` (sort (typ «r.u0»)) c0 - c1 \ - fun `op` - (prod `_` c0 c2 \ - prod `_` c1 c3 \ - global (indt «bool»)) c2 \ - fun `l` - (app - [global (indt «list»), c0]) - c3 \ - fun `s` - (app - [global (indt «list»), c0]) - c4 \ - fun `h` - (global (indt «bool»)) c5 \ - app - [global (indt «and»), - prod `x` c0 c6 \ - prod `y` c1 c7 \ - app - [global (indt «eq»), - global (indt «bool»), - app [c2, c6, c7], - global (indc «false»)], - app - [global (indt «eq»), - global (indt «bool»), - app - [global - (const «expanded_f»), - global (indc «true»), - c0, c2, c3, c4], c5]]) - _ _ X8 - -Debug: - rid:1 step:363 gid:1045 user:subgoal = 1046 - -Debug: - rid:1 step:363 gid:1046 user:newgoal = ! - -Debug: - rid:1 step:363 gid:1045 user:subgoal = 1047 - -Debug: - rid:1 step:363 gid:1047 user:newgoal = std.do! - [X4 = - pi c0 \ - pi c1 \ - pi c2 \ - pi c3 \ - pi c4 \ - pi c5 \ - pi c6 \ - pi c7 \ - pi c8 \ - pi c9 \ - pi c10 \ - expand - (app - [global (const «g»), - c0, c3, c5, c7 | c9]) - (app - [global (const X8), - c1, c2, c4, c6, c8 | c10]) - :- - [!, - std.map c9 expand c10, - expand c7 c8, - expand c5 c6, - expand c3 c4, - expand c0 - (app - [global - (indc «Build_r»), - c1, c2])]] - -Debug: - rid:1 step:363 gid:1045 user:rule:backchain = success - -Debug: }}} -> (0.007s) -Debug: run 364 {{{ - -Debug: - rid:1 step:364 gid:1045 user:curgoal = coq.env.add-const - coq.env.add-const expanded_g - (fun `T` (sort (typ «r.u0»)) c0 \ - let `X` (sort (typ «r.u0»)) c0 - c1 \ - fun `op` - (prod `_` c0 c2 \ - prod `_` c1 c3 \ - global (indt «bool»)) c2 \ - fun `l` - (app - [global (indt «list»), c0]) - c3 \ - fun `s` - (app - [global (indt «list»), c0]) - c4 \ - fun `h` - (global (indt «bool»)) c5 \ - app - [global (indt «and»), - prod `x` c0 c6 \ - prod `y` c1 c7 \ - app - [global (indt «eq»), - global (indt «bool»), - app [c2, c6, c7], - global (indc «false»)], - app - [global (indt «eq»), - global (indt «bool»), - app - [global - (const «expanded_f»), - global (indc «true»), - c0, c2, c3, c4], c5]]) - _ _ X8 - -Debug: - rid:1 step:364 gid:1045 user:rule = builtin - -Debug: - rid:1 step:364 gid:1045 user:rule:builtin:name = coq.env.add-const - -Debug: - rid:1 step:364 gid:1045 user:rule:builtin = success - -Debug: - rid:1 step:364 gid:1045 user:subgoal = 1048 - -Debug: - rid:1 step:364 gid:1048 user:newgoal = X8 = «expanded_g» - -Debug: }}} -> (0.002s) -Debug: run 365 {{{ - -Debug: - rid:1 step:365 gid:1048 user:curgoal = = - X8 = «expanded_g» - -Debug: - rid:1 step:365 gid:1048 user:rule = eq - -Debug: - rid:1 step:365 gid:1048 user:rule:builtin:name = = - -Debug: - rid:1 step:365 gid:0 user:assign = X8 := «expanded_g» - -Debug: - rid:1 step:365 gid:1048 user:rule:eq = success - -Debug: }}} -> (0.000s) -Debug: run 366 {{{ - -Debug: - rid:1 step:366 gid:1046 user:curgoal = ! - ! - -Debug: }}} -> (0.000s) -Debug: - rid:1 step:366 gid:1046 user:rule = cut - -Debug: - rid:1 step:366 gid:1046 user:rule:cut = success - -Debug: run 367 {{{ - -Debug: - rid:1 step:367 gid:1047 user:curgoal = std.do! - std.do! - [X4 = - pi c0 \ - pi c1 \ - pi c2 \ - pi c3 \ - pi c4 \ - pi c5 \ - pi c6 \ - pi c7 \ - pi c8 \ - pi c9 \ - pi c10 \ - expand - (app - [global (const «g»), - c0, c3, c5, c7 | c9]) - (app - [global - (const - «expanded_g»), - c1, c2, c4, c6, c8 | c10]) - :- - [!, - std.map c9 expand c10, - expand c7 c8, - expand c5 c6, - expand c3 c4, - expand c0 - (app - [global - (indc «Build_r»), - c1, c2])]] - -Debug: - rid:1 step:367 gid:1047 user:rule = backchain - -Debug: - rid:1 step:367 gid:1047 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 279, column 0, characters 9290-9316: - -Debug: }}} -> (0.005s) -Debug: select 271 {{{ - -Debug: - rid:1 step:367 gid:1047 user:rule:backchain:try = File "builtin_stdlib.elpi", line 279, column 0, characters 9290-9316: - (std.do! [A0 | A1]) :- A0, - (!), (std.do! A1). - -Debug: - rid:1 step:367 gid:0 user:assign = A0 := X4 = - pi c0 \ - pi c1 \ - pi c2 \ - pi c3 \ - pi c4 \ - pi c5 \ - pi c6 \ - pi c7 \ - pi c8 \ - pi c9 \ - pi c10 \ - expand - (app - [global (const «g»), - c0, c3, c5, c7 | c9]) - (app - [global - (const - «expanded_g»), - c1, c2, c4, c6, c8 | c10]) - :- - [!, - std.map c9 expand c10, - expand c7 c8, - expand c5 c6, - expand c3 c4, - expand c0 - (app - [global - (indc «Build_r»), - c1, c2])] - -Debug: - rid:1 step:367 gid:0 user:assign = A1 := [] - -Debug: - rid:1 step:367 gid:1047 user:subgoal = 1049 - -Debug: - rid:1 step:367 gid:1049 user:newgoal = X4 = - pi c0 \ - pi c1 \ - pi c2 \ - pi c3 \ - pi c4 \ - pi c5 \ - pi c6 \ - pi c7 \ - pi c8 \ - pi c9 \ - pi c10 \ - expand - (app - [global (const «g»), - c0, c3, c5, c7 | c9]) - (app - [global - (const «expanded_g»), - c1, c2, c4, c6, c8 | c10]) - :- - [!, - std.map c9 expand c10, - expand c7 c8, - expand c5 c6, - expand c3 c4, - expand c0 - (app - [global - (indc «Build_r»), - c1, c2])] - -Debug: - rid:1 step:367 gid:1049 user:subgoal = 1050 - -Debug: - rid:1 step:367 gid:1050 user:newgoal = ! - -Debug: - rid:1 step:367 gid:1049 user:subgoal = 1051 - -Debug: - rid:1 step:367 gid:1051 user:newgoal = std.do! [] - -Debug: - rid:1 step:367 gid:1049 user:rule:backchain = success - -Debug: }}} -> (0.001s) -Debug: run 368 {{{ - -Debug: - rid:1 step:368 gid:1049 user:curgoal = = - X4 = - pi c0 \ - pi c1 \ - pi c2 \ - pi c3 \ - pi c4 \ - pi c5 \ - pi c6 \ - pi c7 \ - pi c8 \ - pi c9 \ - pi c10 \ - expand - (app - [global (const «g»), - c0, c3, c5, c7 | c9]) - (app - [global - (const «expanded_g»), - c1, c2, c4, c6, c8 | c10]) - :- - [!, - std.map c9 expand c10, - expand c7 c8, - expand c5 c6, - expand c3 c4, - expand c0 - (app - [global - (indc «Build_r»), - c1, c2])] - -Debug: - rid:1 step:368 gid:1049 user:rule = eq - -Debug: - rid:1 step:368 gid:1049 user:rule:builtin:name = = - -Debug: - rid:1 step:368 gid:0 user:assign = X4 := pi c0 \ - pi c1 \ - pi c2 \ - pi c3 \ - pi c4 \ - pi c5 \ - pi c6 \ - pi c7 \ - pi c8 \ - pi c9 \ - pi c10 \ - expand - (app - [global (const «g»), - c0, c3, c5, c7 | c9]) - (app - [global - (const - «expanded_g»), - c1, c2, c4, c6, c8 | c10]) - :- - [!, - std.map c9 expand c10, - expand c7 c8, - expand c5 c6, - expand c3 c4, - expand c0 - (app - [global - (indc «Build_r»), - c1, c2])] - -Debug: - rid:1 step:368 gid:1049 user:rule:eq = success - -Debug: }}} -> (0.001s) -Debug: run 369 {{{ - -Debug: - rid:1 step:369 gid:1050 user:curgoal = ! - ! - -Debug: }}} -> (0.000s) -Debug: - rid:1 step:369 gid:1050 user:rule = cut - -Debug: - rid:1 step:369 gid:1050 user:rule:cut = success - -Debug: run 370 {{{ - -Debug: - rid:1 step:370 gid:1051 user:curgoal = std.do! - std.do! [] - -Debug: - rid:1 step:370 gid:1051 user:rule = backchain - -Debug: - rid:1 step:370 gid:1051 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 278, column 0, characters 9282-9288: - -Debug: }}} -> (0.000s) -Debug: select 272 {{{ - -Debug: - rid:1 step:370 gid:1051 user:rule:backchain:try = File "builtin_stdlib.elpi", line 278, column 0, characters 9282-9288: - (std.do! []) :- . - -Debug: - rid:1 step:370 gid:1051 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 371 {{{ - -Debug: - rid:1 step:371 gid:692 user:curgoal = coq.elpi.accumulate - coq.elpi.accumulate _ record.expand.db - (clause _ (before expand:start) - (pi c0 \ - pi c1 \ - pi c2 \ - pi c3 \ - pi c4 \ - pi c5 \ - pi c6 \ - pi c7 \ - pi c8 \ - pi c9 \ - pi c10 \ - expand - (app - [global (const «g»), - c0, c3, c5, c7 | c9]) - (app - [global - (const - «expanded_g»), - c1, c2, c4, c6, c8 | c10]) - :- - [!, - std.map c9 expand c10, - expand c7 c8, - expand c5 c6, - expand c3 c4, - expand c0 - (app - [global - (indc «Build_r»), - c1, c2])])) - -Debug: - rid:1 step:371 gid:692 user:rule = backchain - -Debug: - rid:1 step:371 gid:692 user:rule:backchain:candidates = File "coq-builtin.elpi", line 1787, column 0, characters 71769-71833: - -Debug: }}} -> (0.000s) -Debug: select 273 {{{ - -Debug: - rid:1 step:371 gid:692 user:rule:backchain:try = File "coq-builtin.elpi", line 1787, column 0, characters 71769-71833: - (coq.elpi.accumulate A0 A1 - A2) :- (coq.elpi.accumulate-clauses - A0 A1 [ - A2]). - -Debug: - rid:1 step:371 gid:0 user:assign = A1 := record.expand.db - -Debug: - rid:1 step:371 gid:0 user:assign = A2 := clause _ (before expand:start) - (pi c0 \ - pi c1 \ - pi c2 \ - pi c3 \ - pi c4 \ - pi c5 \ - pi c6 \ - pi c7 \ - pi c8 \ - pi c9 \ - pi c10 \ - expand - (app - [global - (const «g»), - c0, c3, c5, c7 | c9]) - (app - [global - (const - «expanded_g»), - c1, c2, c4, c6, c8 | c10]) - :- - [!, - std.map c9 expand c10, - expand c7 c8, - expand c5 c6, - expand c3 c4, - expand c0 - (app - [global - (indc - «Build_r»), - c1, c2])]) - -Debug: - rid:1 step:371 gid:692 user:subgoal = 1052 - -Debug: - rid:1 step:371 gid:1052 user:newgoal = coq.elpi.accumulate-clauses X213 - record.expand.db - [clause _ (before expand:start) - (pi c0 \ - pi c1 \ - pi c2 \ - pi c3 \ - pi c4 \ - pi c5 \ - pi c6 \ - pi c7 \ - pi c8 \ - pi c9 \ - pi c10 \ - expand - (app - [global - (const «g»), - c0, c3, c5, c7 | c9]) - (app - [global - (const - «expanded_g»), - c1, c2, c4, c6, c8 | c10]) - :- - [!, - std.map c9 expand c10, - expand c7 c8, - expand c5 c6, - expand c3 c4, - expand c0 - (app - [global - (indc - «Build_r»), - c1, c2])])] - -Debug: - rid:1 step:371 gid:1052 user:rule:backchain = success - -Debug: }}} -> (0.001s) -Debug: run 372 {{{ - -Debug: - rid:1 step:372 gid:1052 user:curgoal = coq.elpi.accumulate-clauses - coq.elpi.accumulate-clauses X213 - record.expand.db - [clause _ (before expand:start) - (pi c0 \ - pi c1 \ - pi c2 \ - pi c3 \ - pi c4 \ - pi c5 \ - pi c6 \ - pi c7 \ - pi c8 \ - pi c9 \ - pi c10 \ - expand - (app - [global - (const «g»), - c0, c3, c5, c7 | c9]) - (app - [global - (const - «expanded_g»), - c1, c2, c4, c6, c8 | c10]) - :- - [!, - std.map c9 expand c10, - expand c7 c8, - expand c5 c6, - expand c3 c4, - expand c0 - (app - [global - (indc - «Build_r»), - c1, c2])])] - -Debug: - rid:1 step:372 gid:1052 user:rule = builtin - -Debug: - rid:1 step:372 gid:1052 user:rule:builtin:name = coq.elpi.accumulate-clauses - -Debug: - rid:1 step:372 gid:1052 user:rule:builtin = success - -Debug: }}} -> (0.005s) -expanded_g = -fun T : Type => -let X := T in -fun (op : T -> X -> bool) (l s : list T) (h : bool) => -(forall (x : T) (y : X), op x y = false) /\ expanded_f true T op l s = h - : forall T : Type, (T -> T -> bool) -> list T -> list T -> bool -> Prop - -Arguments expanded_g T%type_scope op%function_scope - (l s)%list_scope h%bool_scope +a is not universe polymorphic +a is transparent +Expands to: Constant elpi.tests.test_synterp.X.a +Module X := Struct Definition a : nat. End +Module A := Struct Definition a : nat. End +a + : nat +L= [p 1] +File "./tests/test_synterp.v", line 38, characters 20-21: +Warning: +File "./tests/test_synterp.v", line 38, characters 20-21 +X is linear: name it _X (discard) or X_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_synterp.v", line 41, characters 12-13: +Warning: +File "./tests/test_synterp.v", line 41, characters 12-13 +X is linear: name it _X (discard) or X_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./apps/NES/theories/NES.v", line 39, characters 0-42: +Warning: +Undeclared globals: +- File "/build/reproducible-path/coq-elpi-2.5.0/apps/NES/elpi/nes_interp.elpi", line 6, column 24, characters 152-161: ns. +Please add the following text to your program: +type ns list string -> modpath -> prop. +[elpi.missing-types,elpi.typecheck,elpi,default] +The Db contains [phone_prefix USA 1] +Phone prefix for USA is 1 +The Db contains +[phone_prefix USA 1, phone_prefix France 33, phone_prefix Italy 39] +Phone prefix for France is 33 +sweet! +brr +yummy! +goal X0 c0 c1 c2 c3 is + +[decl c3 `H` (app [global (const «lt»), c0, c1]), + decl c2 `z` (global (indt «nat»)), decl c1 `y` (global (indt «nat»)), + decl c0 `x` (global (indt «nat»))] +------- + +prod `_` (app [global (const «lt»), c1, c2]) c4 \ + app [global (const «lt»), c0, c2] +3 +(eq_refl : 2 = (let z := 1 in S z)) Query assignments: B = fix `add` 0 (prod `n` (global (indt «nat»)) c0 \ @@ -12404,24 +8740,2398 @@ File "./tests/test_elaborator.v", line 157, characters 41-42 X is linear: name it _X (discard) or X_ (fresh variable) [elpi.linear-variable,elpi.typecheck,elpi,default] -This.Is.A.Long.Namespace.stuff = 1 - : nat - = 1 - : nat -This.Is.A.Long.Namespace.stuff = 2 - : nat - = 1 +DEBUG: attempt at fuzzing binary op: global (indc «PLUS») +DEBUG: attempt at fuzzing binary op: global (const «Nat.add») +DEBUG: attempt at fuzzing binary op: global (indc «AND») +DEBUG: fuzzed! +DEBUG: attempt at fuzzing binary op: global (const «andb») +DEBUG: attempt at fuzzing binary op: global (indc «OR») +DEBUG: fuzzed! +DEBUG: attempt at fuzzing binary op: global (const «orb») +DEBUG: attempt at fuzzing binary op: global (indc «EQ») +DEBUG: attempt at fuzzing binary op: global (const «Nat.eqb») +Inductive eval1 : forall T : ty, Exp T -> Val T -> Prop := + E_Num1 : forall n : nat, eval1 N (NUM n) (iNv n) + | E_Bool1 : forall b : bool, eval1 B (BOOL b) (iBv b) + | E_Plus1 : forall (e1 e2 : Exp N) (n1 n2 : nat), + eval1 N e1 (iNv n1) -> + eval1 N e2 (iNv n2) -> eval1 N (PLUS e1 e2) (iNv (n1 + n2)) + | E_AND1 : forall (e1 e2 : Exp B) (b1 b2 : bool), + eval1 B e1 (iBv b1) -> + eval1 B e2 (iBv b2) -> eval1 B (AND e1 e2) (iBv (b1 && b2)) + | E_OR1 : forall (e1 e2 : Exp B) (b1 b2 : bool), + eval1 B e1 (iBv b1) -> + eval1 B e2 (iBv b2) -> eval1 B (AND e1 e2) (iBv (b1 || b2)) + | E_EQ1 : forall (e1 e2 : Exp N) (n1 n2 : nat), + eval1 N e1 (iNv n1) -> + eval1 N e2 (iNv n2) -> eval1 B (EQ e1 e2) (iBv (Nat.eqb n1 n2)). + +Arguments eval1 T _ _ +Arguments E_Num1 n%nat_scope +Arguments E_Bool1 b%bool_scope +Arguments E_Plus1 e1 e2 (n1 n2)%nat_scope _ _ +Arguments E_AND1 e1 e2 (b1 b2)%bool_scope _ _ +Arguments E_OR1 e1 e2 (b1 b2)%bool_scope _ _ +Arguments E_EQ1 e1 e2 (n1 n2)%nat_scope _ _ +Notation p2 := (p2 nat 3 x) +example_import_projections.p1 nat 3 x : nat : nat -This_aux_1.This.Is.A.Long.Namespace.stuff -This.Is.A.Long.Namespace.more_stuff -This.Is.A.Long.Namespace.stuff -This_aux_1.This.Is.A.Long.Namespace.stuff : nat -This.Is.A.Long.Namespace.more_stuff : nat -This.Is.A.Long.Namespace.stuff : nat -stuff = 2 +p1 : forall (T : Type) (t : T), r T t -> nat + : forall (T : Type) (t : T), r T t -> nat +eq_refl +: +example_import_projections.p1 bool false (Build bool false 3 eq_refl eq_refl) = +3 + : example_import_projections.p1 bool false + (Build bool false 3 eq_refl eq_refl) = 3 +example_import_projections.f1 _ x + : bool +3 + 7 becomes fun (x : ?e) (x0 : ?e0) => S (S x0) + S (S (S (S (S (S x))))) +foo = +{f1 : Type & {f2 : f1 -> Type & forall t : f1, f2 t -> bool}} + : Type +mk_foo = +fun (f1 : Type) (f2 : f1 -> Type) (f3 : forall t : f1, f2 t -> bool) => +existT (fun f4 : Type => {f5 : f4 -> Type & forall t : f4, f5 t -> bool}) f1 + (existT (fun f4 : f1 -> Type => forall t : f1, f4 t -> bool) f2 f3) + : forall (f1 : Type) (f2 : f1 -> Type), + (forall t : f1, f2 t -> bool) -> foo + +Arguments mk_foo f1%type_scope (f2 f3)%function_scope +Query assignments: + GRnat = indt «nat» + GRplus = const «Nat.add» + GRs = indc «S» +Query assignments: + Bo = app [global (indc «S»), app [global (indc «S»), global (indc «O»)]] + C = «x» + GR = const «x» + Ty = global (indt «nat») + TyC = global (indt «nat») +Query assignments: + Bo = fun `x` (global (indt «nat»)) c0 \ c0 + C = «f» +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]]] + C = «Nat.add» +The return type of m is: c0 \ c1 \ +fun `x` (global (indt «nat»)) c2 \ + fun `e` + (app [global (indt «eq»), global (indt «nat»), global (indc «O»), c2]) + c3 \ prod `_` (app [c1, global (indc «O»)]) c4 \ app [c1, c2] +Query assignments: + C = «m» + RT = c0 \ c1 \ +fun `x` (global (indt «nat»)) c2 \ + fun `e` + (app [global (indt «eq»), global (indt «nat»), global (indc «O»), c2]) + c3 \ prod `_` (app [c1, global (indc «O»)]) c4 \ app [c1, c2] +typ «elpi_examples.tutorial_coq_elpi_HOAS.6» < +typ «elpi_examples.tutorial_coq_elpi_HOAS.7» +Debug: Cannot enforce elpi_examples.tutorial_coq_elpi_HOAS.7 <= +elpi_examples.tutorial_coq_elpi_HOAS.6 because +elpi_examples.tutorial_coq_elpi_HOAS.6 +< elpi_examples.tutorial_coq_elpi_HOAS.7 +Query assignments: + U = typ «elpi_examples.tutorial_coq_elpi_HOAS.6» + U1 = typ «elpi_examples.tutorial_coq_elpi_HOAS.7» +Universe constraints: +UNIVERSES: + {elpi_examples.tutorial_coq_elpi_HOAS.7 + elpi_examples.tutorial_coq_elpi_HOAS.6} |= + elpi_examples.tutorial_coq_elpi_HOAS.6 < elpi_examples.tutorial_coq_elpi_HOAS.7 +ALGEBRAIC UNIVERSES: + {} +FLEXIBLE UNIVERSES: + +SORTS: + +WEAK CONSTRAINTS: + + +(id b) is: app [fun `x` (sort (typ X0)) c0 \ c0, sort (typ X1)] +(id a) is illtyped: +Illegal application: +The term "fun x : Type => x" of type "Type -> Type" +cannot be applied to the term + "Type" : "Type" +This term has type "Type@{elpi_examples.tutorial_coq_elpi_HOAS.8+1}" +which should be a subtype of "Type@{elpi_examples.tutorial_coq_elpi_HOAS.8}". +(universe inconsistency: Cannot enforce elpi_examples.tutorial_coq_elpi_HOAS.8 +< elpi_examples.tutorial_coq_elpi_HOAS.8 because +elpi_examples.tutorial_coq_elpi_HOAS.8 += elpi_examples.tutorial_coq_elpi_HOAS.8) +after typing (id b) is: +app + [fun `x` (sort (typ «elpi_examples.tutorial_coq_elpi_HOAS.8»)) c0 \ c0, + sort (typ «elpi_examples.tutorial_coq_elpi_HOAS.9»)] : +sort (typ «elpi_examples.tutorial_coq_elpi_HOAS.8») +Universe constraints: UNIVERSES: + {elpi_examples.tutorial_coq_elpi_HOAS.9 + elpi_examples.tutorial_coq_elpi_HOAS.8} |= + elpi_examples.tutorial_coq_elpi_HOAS.9 < elpi_examples.tutorial_coq_elpi_HOAS.8 + ALGEBRAIC UNIVERSES: + {elpi_examples.tutorial_coq_elpi_HOAS.9 + elpi_examples.tutorial_coq_elpi_HOAS.8} + FLEXIBLE UNIVERSES: + elpi_examples.tutorial_coq_elpi_HOAS.9 + elpi_examples.tutorial_coq_elpi_HOAS.8 + SORTS: + + WEAK CONSTRAINTS: + + +Query assignments: + A = sort (typ «elpi_examples.tutorial_coq_elpi_HOAS.8») + B = sort (typ «elpi_examples.tutorial_coq_elpi_HOAS.9») + ErrMsg = Illegal application: +The term "fun x : Type => x" of type "Type -> Type" +cannot be applied to the term + "Type" : "Type" +This term has type "Type@{elpi_examples.tutorial_coq_elpi_HOAS.8+1}" +which should be a subtype of "Type@{elpi_examples.tutorial_coq_elpi_HOAS.8}". +(universe inconsistency: Cannot enforce elpi_examples.tutorial_coq_elpi_HOAS.8 +< elpi_examples.tutorial_coq_elpi_HOAS.8 because +elpi_examples.tutorial_coq_elpi_HOAS.8 += elpi_examples.tutorial_coq_elpi_HOAS.8) + ID = fun `x` (sort (typ «elpi_examples.tutorial_coq_elpi_HOAS.8»)) c0 \ c0 + T = sort (typ «elpi_examples.tutorial_coq_elpi_HOAS.8») + U = «elpi_examples.tutorial_coq_elpi_HOAS.8» + V = «elpi_examples.tutorial_coq_elpi_HOAS.9» +Universe constraints: +UNIVERSES: + {elpi_examples.tutorial_coq_elpi_HOAS.9 + elpi_examples.tutorial_coq_elpi_HOAS.8} |= + elpi_examples.tutorial_coq_elpi_HOAS.9 < elpi_examples.tutorial_coq_elpi_HOAS.8 +ALGEBRAIC UNIVERSES: + {elpi_examples.tutorial_coq_elpi_HOAS.9 + elpi_examples.tutorial_coq_elpi_HOAS.8} +FLEXIBLE UNIVERSES: + elpi_examples.tutorial_coq_elpi_HOAS.9 + elpi_examples.tutorial_coq_elpi_HOAS.8 +SORTS: + +WEAK CONSTRAINTS: + + +app + [global (const «Nat.add»), + app [global (indc «S»), global (indc «O»)], + app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] += +app + [global (const «Nat.add»), + app [global (indc «S»), global (indc «O»)], + app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] +app + [global (const «Nat.add»), + app [global (indc «S»), global (indc «O»)], + app [global (indc «S»), global (indc «O»)]] +Query assignments: + S = indc «S» +fun `x` (global (indt «nat»)) c0 \ + fun `x` (global (indt «nat»)) c1 \ + app [global (const «Nat.add»), c1, c0] +fun `x` (global (indt «nat»)) c0 \ + fun `x` (global (indt «nat»)) c1 \ + app [global (const «Nat.add»), c1, c0] +fun `a` (global (indt «nat»)) c0 \ + fun `b` (global (indt «nat»)) c1 \ + app [global (const «Nat.add»), c1, c0] +Query assignments: + X = c0 \ c1 \ +app [global (const «Nat.add»), c1, c0] +fun `a` (global (indt «nat»)) c0 \ + fun `b` (global (indt «nat»)) c1 \ + app [global (indt «eq»), global (indt «nat»), c0, c1] +indt «nat» +indt «nat» +before: +fun `ax` (global (indt «nat»)) c0 \ + fun `b` (global (indt «nat»)) c1 \ + app [global (indt «eq»), X0 c1, c0, c1] +after: +fun `ax` (global (indt «nat»)) c0 \ + fun `b` (global (indt «nat»)) c1 \ + app [global (indt «eq»), global (indt «nat»), c0, c1] +Query assignments: + T = fun `ax` (global (indt «nat»)) c0 \ + fun `b` (global (indt «nat»)) c1 \ + app [global (indt «eq»), global (indt «nat»), c0, c1] + X1_ = c0 \ +global (indt «nat») +Universe constraints: +UNIVERSES: + {elpi_examples.tutorial_coq_elpi_HOAS.11 + elpi_examples.tutorial_coq_elpi_HOAS.10} |= + elpi_examples.tutorial_coq_elpi_HOAS.11 < elpi_examples.tutorial_coq_elpi_HOAS.10 + Set <= elpi_examples.tutorial_coq_elpi_HOAS.11 + elpi_examples.tutorial_coq_elpi_HOAS.11 <= eq.u0 +ALGEBRAIC UNIVERSES: + {} +FLEXIBLE UNIVERSES: + +SORTS: + α6 := Type +WEAK CONSTRAINTS: + + +Query assignments: + Bo = c0 \ +app + [global (const «Nat.add»), c0, + app [global (indc «S»), global (indc «O»)]] + N = `x` + T = fun `x` (global (indt «nat»)) c0 \ + app + [global (const «Nat.add»), c0, + app [global (indc «S»), global (indc «O»)]] + Ty = global (indt «nat») +Query assignments: + Bo = c0 \ +app + [global (const «Nat.add»), c0, + app [global (indc «S»), global (indc «O»)]] + N = `x` + T = fun `x` (global (indt «nat»)) c0 \ + app + [global (const «Nat.add»), c0, + app [global (indc «S»), global (indc «O»)]] + Ty = global (indt «nat») +raw T = X0 + +SHELF: +FUTURE GOALS STACK: + + +Rocq-Elpi mapping: +RAW: +ELAB: + +-------------------------------- + evar (X1) (global (indt «nat»)) (X1) /* suspended on X1 */ +EVARS: + ?X11==[ |- nat] (internal placeholder) {?e0} + ?X10==[ |- => nat] (internal placeholder) + +SHELF: +FUTURE GOALS STACK: + ?X11 + +Rocq-Elpi mapping: +RAW: +?X11 <-> X1 +ELAB: +?X11 <-> X1 + +Query assignments: + T = X1 + X2_ = X1 +Syntactic constraints: + evar (X1) (global (indt «nat»)) (X1) /* suspended on X1 */ +Universe constraints: +UNIVERSES: + {elpi_examples.tutorial_coq_elpi_HOAS.12} |= + Set <= elpi_examples.tutorial_coq_elpi_HOAS.12 +ALGEBRAIC UNIVERSES: + {} +FLEXIBLE UNIVERSES: + +SORTS: + α7 := Type +WEAK CONSTRAINTS: + + +raw T = +fun `x` (global (indt «nat»)) c0 \ + app [global (const «Nat.add»), c0, X0 c0] + {c0 c1} : decl c1 `x` (global (indt «nat»)) + ?- evar (X1 c1) (global (indt «nat»)) (X1 c1) /* suspended on X1 */ +EVARS: + ?X13==[x |- nat] (internal placeholder) {?e0} + ?X12==[x |- => nat] (internal placeholder) + +SHELF: +FUTURE GOALS STACK: + ?X13 + +Rocq-Elpi mapping: +RAW: +?X13 <-> c0 \ X1 c0 +ELAB: +?X13 <-> X1 + +Query assignments: + Bo = c0 \ +app [global (const «Nat.add»), c0, X1 c0] + N = `x` + T = fun `x` (global (indt «nat»)) c0 \ + app [global (const «Nat.add»), c0, X1 c0] + Ty = global (indt «nat») + X3_ = c0 \ +X1 c0 +Syntactic constraints: + {c0 c1} : decl c1 `x` (global (indt «nat»)) + ?- evar (X1 c1) (global (indt «nat»)) (X1 c1) /* suspended on X1 */ +Universe constraints: +UNIVERSES: + {elpi_examples.tutorial_coq_elpi_HOAS.13} |= + Set <= elpi_examples.tutorial_coq_elpi_HOAS.13 +ALGEBRAIC UNIVERSES: + {} +FLEXIBLE UNIVERSES: + +SORTS: + α8 := Type +WEAK CONSTRAINTS: + + +Bo1 (not in pattern fragment) = +app + [global (const «Nat.add»), + app [global (indc «S»), global (indc «O»)], + X0 (app [global (indc «S»), global (indc «O»)])] +Bo1 before = +app + [global (const «Nat.add»), + app [global (indc «S»), global (indc «O»)], + X0 (app [global (indc «S»), global (indc «O»)])] +Bo1 after = +app + [global (const «Nat.add»), + app [global (indc «S»), global (indc «O»)], X1] +Query assignments: + Bo = c0 \ +app [global (const «Nat.add»), c0, X1] + Bo1 = app + [global (const «Nat.add»), + app [global (indc «S»), global (indc «O»)], X1] + N = `x` + T = fun `x` (global (indt «nat»)) c0 \ app [global (const «Nat.add»), c0, X1] + Ty = global (indt «nat») + X5_ = c0 \ +X1 +Syntactic constraints: + evar (X1) (global (indt «nat»)) (X1) /* suspended on X1 */ +Universe constraints: +UNIVERSES: + {elpi_examples.tutorial_coq_elpi_HOAS.14} |= + Set <= elpi_examples.tutorial_coq_elpi_HOAS.14 +ALGEBRAIC UNIVERSES: + {} +FLEXIBLE UNIVERSES: + +SORTS: + α9 := Type +WEAK CONSTRAINTS: + + +Query assignments: + Bo = c0 \ +app [global (const «andb»), c0, X0 c0] + Bo1 = app + [global (const «andb»), app [global (indc «S»), global (indc «O»)], + X0 (app [global (indc «S»), global (indc «O»)])] + Bo2 = app + [global (const «andb»), + app + [global (const «nat2bool»), + app [global (indc «S»), global (indc «O»)]], X1] + N = `x` + T = fun `x` (global (indt «nat»)) c0 \ app [global (const «andb»), c0, X0 c0] + Ty = global (indt «nat») + X6_ = X0 +Syntactic constraints: + evar (X2) (global (indt «bool»)) X1 /* suspended on X2, X1 */ +File "./examples/tutorial_coq_elpi_HOAS.v", line 87, characters 19-24: +Warning: +File "./examples/tutorial_coq_elpi_HOAS.v", line 87, characters 19-24 +GRnat is linear: name it _GRnat (discard) or GRnat_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_HOAS.v", line 89, characters 20-26: +Warning: +File "./examples/tutorial_coq_elpi_HOAS.v", line 89, characters 20-26 +GRplus is linear: name it _GRplus (discard) or GRplus_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_HOAS.v", line 88, characters 17-20: +Warning: +File "./examples/tutorial_coq_elpi_HOAS.v", line 88, characters 17-20 +GRs is linear: name it _GRs (discard) or GRs_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_HOAS.v", line 113, characters 24-26: +Warning: +File "./examples/tutorial_coq_elpi_HOAS.v", line 113, characters 24-26 +Bo is linear: name it _Bo (discard) or Bo_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_HOAS.v", line 107, characters 20-22: +Warning: +File "./examples/tutorial_coq_elpi_HOAS.v", line 107, characters 20-22 +Ty is linear: name it _Ty (discard) or Ty_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_HOAS.v", line 113, characters 28-31: +Warning: +File "./examples/tutorial_coq_elpi_HOAS.v", line 113, characters 28-31 +TyC is linear: name it _TyC (discard) or TyC_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_HOAS.v", line 152, characters 24-26: +Warning: +File "./examples/tutorial_coq_elpi_HOAS.v", line 152, characters 24-26 +Bo is linear: name it _Bo (discard) or Bo_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_HOAS.v", line 195, characters 24-26: +Warning: +File "./examples/tutorial_coq_elpi_HOAS.v", line 195, characters 24-26 +Bo is linear: name it _Bo (discard) or Bo_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_HOAS.v", line 285, characters 17-18: +Warning: +File "./examples/tutorial_coq_elpi_HOAS.v", line 285, characters 17-18 +V is linear: name it _V (discard) or V_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_HOAS.v", line 681, characters 10-11: +Warning: +File "./examples/tutorial_coq_elpi_HOAS.v", line 681, characters 10-11 +N is linear: name it _N (discard) or N_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_HOAS.v", line 681, characters 12-14: +Warning: +File "./examples/tutorial_coq_elpi_HOAS.v", line 681, characters 12-14 +Ty is linear: name it _Ty (discard) or Ty_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_HOAS.v", line 718, characters 10-11: +Warning: +File "./examples/tutorial_coq_elpi_HOAS.v", line 718, characters 10-11 +N is linear: name it _N (discard) or N_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_HOAS.v", line 718, characters 12-14: +Warning: +File "./examples/tutorial_coq_elpi_HOAS.v", line 718, characters 12-14 +Ty is linear: name it _Ty (discard) or Ty_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_HOAS.v", line 756, characters 40-43: +Warning: +File "./examples/tutorial_coq_elpi_HOAS.v", line 756, characters 40-43 +Bo2 is linear: name it _Bo2 (discard) or Bo2_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_HOAS.v", line 754, characters 10-11: +Warning: +File "./examples/tutorial_coq_elpi_HOAS.v", line 754, characters 10-11 +N is linear: name it _N (discard) or N_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_HOAS.v", line 754, characters 12-14: +Warning: +File "./examples/tutorial_coq_elpi_HOAS.v", line 754, characters 12-14 +Ty is linear: name it _Ty (discard) or Ty_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./apps/eltac/theories/apply.v", line 15, characters 16-19: +Warning: +File "./apps/eltac/theories/apply.v", line 15, characters 16-19 +Ctx is linear: name it _Ctx (discard) or Ctx_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +The age of alice is 20 +Query assignments: + A = 20 +mallory is 23 years old +Query assignments: + P = mallory +alice is 20 years old +Query assignments: + P = alice +mallory and bob are 23 years old +Query assignments: + A = 23 + P = mallory + Q = bob +I picked P = mallory +I picked Q = mallory +I picked Q = bob +the last choice worked! +mallory and bob are 23 years old +Query assignments: + A = 23 + P = mallory + Q = bob +bob is older than alice +Query assignments: + X = alice +both bob and mallory are older than alice +Query assignments: + X = alice +F = c0 \ age alice c0 +F 20 = age alice 20 +F 23 = age alice 23 +Query assignments: + F = c0 \ +age alice c0 +λx.x ~> fun c0 \ c0 +(λx.x) (λx.x) ~> fun c0 \ c0 +Query assignments: + I = fun c0 \ c0 + T = fun c0 \ c0 + T1 = fun c0 \ c0 +(Fst foo bar) ~> foo +(foo bar) ~> app foo bar +Query assignments: + Fst = fun c0 \ fun c1 \ c0 + S = app foo bar + S1 = app foo bar + T = app (app (fun c0 \ fun c1 \ c0) foo) bar + T1 = foo +The type of λx.λy.x is: arr X0 (arr X1 X0) +Query assignments: + Ty = arr X0 (arr X1 X0) +Error: fun c0 \ app c0 c0 has no type +Query assignments: + Delta = fun c0 \ app c0 c0 + Ty = X0 +2 + 1 = s (s (s z)) +Query assignments: + R = s (s (s z)) +Query assignments: + X = X0 + Z = X1 +Syntactic constraints: sum X0 (s z) X1 /* suspended on X0 */ +The result is: s z +Query assignments: + X = z + Z = s z +Query assignments: + X = s z +Debug: sum X0 (s z) X1 /* suspended on X0 */ +Currently Y = X1 +Debug: sum X2 (s z) X3 /* suspended on X2 */ +Currently Y = s X3 +Finally Y = s (s z) +Query assignments: + X = s z + Y = s (s z) + Z = z +Query assignments: + X = X0 +Syntactic constraints: + even X0 /* suspended on X0 */ odd X0 /* suspended on X0 */ +X0 can't be even and odd at the same time +Query assignments: + A = [1, 2, 3, 3, 2, 1] +Query assignments: + A = [1, 2, 3, 3, 2, 1] +result = 5 +Query assignments: + X = result = + Y = 5 +result = 5 +Query assignments: + %arg1 = 5 +Query assignments: + R1 = X0 + R2 = [2, 3, 4] + R3 = [2, 3, 4] +Query assignments: + R = [2, 3, 4] +Y = c0 +arr X0 (arr X1 X0) +Query assignments: + Ty = arr X0 (arr X1 X0) +Debug: run 1 {{{ + +Debug: + rid:0 step:1 gid:4 user:curgoal = , + of (fun c0 \ fun c1 \ c0) X0 , coq.say X0 + +Debug: + rid:0 step:1 gid:4 user:rule = and + +Debug: + rid:0 step:1 gid:4 user:subgoal = 5 + +Debug: + rid:0 step:1 gid:5 user:newgoal = of (fun c0 \ fun c1 \ c0) X0 + +Debug: + rid:0 step:1 gid:4 user:subgoal = 6 + +Debug: + rid:0 step:1 gid:6 user:newgoal = coq.say X0 + +Debug: + rid:0 step:1 gid:4 user:rule:and = success + +Debug: }}} -> (0.000s) +Debug: run 2 {{{ + +Debug: + rid:0 step:2 gid:5 user:curgoal = of + of (fun c0 \ fun c1 \ c0) X0 + +Debug: + rid:0 step:2 gid:5 user:rule = backchain + +Debug: + rid:0 step:2 gid:5 user:rule:backchain:candidates = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: + +Debug: }}} -> (0.000s) +Debug: select 3 {{{ + +Debug: + rid:0 step:2 gid:5 user:rule:backchain:try = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: + (of (fun A0) (arr A2 A1)) :- ( + pi (c0 \ + (of c0 A2 => of (A0 c0) A1))). + +Debug: + rid:0 step:2 gid:0 user:assign = A0 := c0 \ + fun c1 \ c0 + +Debug: + rid:0 step:2 gid:0 user:assign = X0 := arr X1 X2 + +Debug: + rid:0 step:2 gid:5 user:subgoal = 7 + +Debug: + rid:0 step:2 gid:7 user:newgoal = pi c0 \ of c0 X1 => of (fun c1 \ c0) X2 + +Debug: + rid:0 step:2 gid:7 user:rule:backchain = success + +Debug: }}} -> (0.021s) +Debug: run 3 {{{ + +Debug: + rid:0 step:3 gid:7 user:curgoal = pi + pi c0 \ of c0 X1 => of (fun c1 \ c0) X2 + +Debug: rid:0 step:3 gid:7 user:rule = pi + +Debug: + rid:0 step:3 gid:7 user:subgoal = 8 + +Debug: + rid:0 step:3 gid:8 user:newgoal = of c0 X1 => of (fun c1 \ c0) X2 + +Debug: + rid:0 step:3 gid:8 user:rule:pi = success + +Debug: }}} -> (0.000s) +Debug: run 4 {{{ + +Debug: + rid:0 step:4 gid:8 user:curgoal = => + of c0 X1 => of (fun c1 \ c0) X2 + +Debug: + rid:0 step:4 gid:8 user:rule = implication + +Debug: + rid:0 step:4 gid:8 user:subgoal = 9 + +Debug: + rid:0 step:4 gid:9 user:newgoal = of (fun c1 \ c0) X2 + +Debug: + rid:0 step:4 gid:9 user:rule:implication = success + +Debug: }}} -> (0.000s) +Debug: run 5 {{{ + +Debug: + rid:0 step:5 gid:9 user:curgoal = of + of (fun c1 \ c0) X2 + +Debug: + rid:0 step:5 gid:9 user:rule = backchain + +Debug: + rid:0 step:5 gid:9 user:rule:backchain:candidates = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: + +Debug: }}} -> (0.000s) +Debug: select 4 {{{ + +Debug: + rid:0 step:5 gid:9 user:rule:backchain:try = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: + (of (fun A0) (arr A2 A1)) :- ( + pi (c0 \ + (of c0 A2 => of (A0 c0) A1))). + +Debug: + rid:0 step:5 gid:0 user:assign = A0 := c1 \ + c0 + +Debug: + rid:0 step:5 gid:0 user:assign = X2 := arr X3 X4 + +Debug: + rid:0 step:5 gid:9 user:subgoal = 10 + +Debug: + rid:0 step:5 gid:10 user:newgoal = pi c1 \ of c1 X3 => of c0 X4 + +Debug: + rid:0 step:5 gid:10 user:rule:backchain = success + +Debug: }}} -> (0.000s) +Debug: run 6 {{{ + +Debug: + rid:0 step:6 gid:10 user:curgoal = pi + pi c1 \ of c1 X3 => of c0 X4 + +Debug: + rid:0 step:6 gid:10 user:rule = pi + +Debug: + rid:0 step:6 gid:10 user:subgoal = 11 + +Debug: + rid:0 step:6 gid:11 user:newgoal = of c1 X3 => of c0 X4 + +Debug: + rid:0 step:6 gid:11 user:rule:pi = success + +Debug: }}} -> (0.000s) +Debug: run 7 {{{ + +Debug: + rid:0 step:7 gid:11 user:curgoal = => + of c1 X3 => of c0 X4 + +Debug: + rid:0 step:7 gid:11 user:rule = implication + +Debug: + rid:0 step:7 gid:11 user:subgoal = 12 + +Debug: + rid:0 step:7 gid:12 user:newgoal = of c0 X4 + +Debug: + rid:0 step:7 gid:12 user:rule:implication = success + +Debug: }}} -> (0.000s) +Debug: run 8 {{{ + +Debug: + rid:0 step:8 gid:12 user:curgoal = of + of c0 X4 + +Debug: + rid:0 step:8 gid:12 user:rule = backchain + +Debug: + rid:0 step:8 gid:12 user:rule:backchain:candidates = File "(context step_id:4)", line 1, column 0, characters 0-0: + +Debug: }}} -> (0.000s) +Debug: select 5 {{{ + +Debug: + rid:0 step:8 gid:12 user:rule:backchain:try = File "(context step_id:4)", line 1, column 0, characters 0-0: + (of c0 X1) :- . + +Debug: + rid:0 step:8 gid:0 user:assign = X1 := X4 + +Debug: + rid:0 step:8 gid:12 user:rule:backchain = success + +Debug: }}} -> (0.027s) +Debug: run 9 {{{ + +Debug: + rid:0 step:9 gid:6 user:curgoal = coq.say + coq.say (arr X4 (arr X3 X4)) + +Debug: + rid:0 step:9 gid:6 user:rule = builtin + +Debug: + rid:0 step:9 gid:6 user:rule:builtin:name = coq.say + +arr X4 (arr X3 X4) +Debug: + rid:0 step:9 gid:6 user:rule:builtin = success + +Debug: }}} -> (0.000s) +Query assignments: + Ty = arr X4 (arr X3 X4) +Debug: run 1 {{{ + +Debug: + rid:1 step:1 gid:13 user:curgoal = , + of (fun c0 \ app c0 c0) X0 , coq.say X0 + +Debug: + rid:1 step:1 gid:13 user:rule = and + +Debug: + rid:1 step:1 gid:13 user:subgoal = 14 + +Debug: + rid:1 step:1 gid:14 user:newgoal = of (fun c0 \ app c0 c0) X0 + +Debug: + rid:1 step:1 gid:13 user:subgoal = 15 + +Debug: + rid:1 step:1 gid:15 user:newgoal = coq.say X0 + +Debug: + rid:1 step:1 gid:13 user:rule:and = success + +Debug: }}} -> (0.000s) +Debug: run 2 {{{ + +Debug: + rid:1 step:2 gid:14 user:curgoal = of + of (fun c0 \ app c0 c0) X0 + +Debug: + rid:1 step:2 gid:14 user:rule = backchain + +Debug: + rid:1 step:2 gid:14 user:rule:backchain:candidates = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: + +Debug: }}} -> (0.000s) +Debug: select 3 {{{ + +Debug: + rid:1 step:2 gid:14 user:rule:backchain:try = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: + (of (fun A0) (arr A2 A1)) :- ( + pi (c0 \ + (of c0 A2 => of (A0 c0) A1))). + +Debug: + rid:1 step:2 gid:0 user:assign = A0 := c0 \ + app c0 c0 + +Debug: + rid:1 step:2 gid:0 user:assign = X0 := arr X1 X2 + +Debug: + rid:1 step:2 gid:14 user:subgoal = 16 + +Debug: + rid:1 step:2 gid:16 user:newgoal = pi c0 \ of c0 X1 => of (app c0 c0) X2 + +Debug: + rid:1 step:2 gid:16 user:rule:backchain = success + +Debug: }}} -> (0.001s) +Debug: run 3 {{{ + +Debug: + rid:1 step:3 gid:16 user:curgoal = pi + pi c0 \ of c0 X1 => of (app c0 c0) X2 + +Debug: + rid:1 step:3 gid:16 user:rule = pi + +Debug: + rid:1 step:3 gid:16 user:subgoal = 17 + +Debug: + rid:1 step:3 gid:17 user:newgoal = of c0 X1 => of (app c0 c0) X2 + +Debug: + rid:1 step:3 gid:17 user:rule:pi = success + +Debug: }}} -> (0.000s) +Debug: run 4 {{{ + +Debug: + rid:1 step:4 gid:17 user:curgoal = => + of c0 X1 => of (app c0 c0) X2 + +Debug: + rid:1 step:4 gid:17 user:rule = implication + +Debug: + rid:1 step:4 gid:17 user:subgoal = 18 + +Debug: + rid:1 step:4 gid:18 user:newgoal = of (app c0 c0) X2 + +Debug: + rid:1 step:4 gid:18 user:rule:implication = success + +Debug: }}} -> (0.000s) +Debug: run 5 {{{ + +Debug: + rid:1 step:5 gid:18 user:curgoal = of + of (app c0 c0) X2 + +Debug: + rid:1 step:5 gid:18 user:rule = backchain + +Debug: + rid:1 step:5 gid:18 user:rule:backchain:candidates = File "./examples/tutorial_elpi_lang.v", line 591, column 2, characters 15200-15250: + +Debug: }}} -> (0.000s) +Debug: select 4 {{{ + +Debug: + rid:1 step:5 gid:18 user:rule:backchain:try = File "./examples/tutorial_elpi_lang.v", line 591, column 2, characters 15200-15250: + (of (app A0 A3) A2) :- ( + of A0 (arr A1 A2)), + (of A3 A1). + +Debug: + rid:1 step:5 gid:0 user:assign = A0 := c0 + +Debug: + rid:1 step:5 gid:0 user:assign = A3 := c0 + +Debug: + rid:1 step:5 gid:0 user:assign = A2 := X2 + +Debug: + rid:1 step:5 gid:18 user:subgoal = 19 + +Debug: + rid:1 step:5 gid:19 user:newgoal = of c0 (arr X3^1 X2) + +Debug: + rid:1 step:5 gid:19 user:subgoal = 20 + +Debug: + rid:1 step:5 gid:20 user:newgoal = of c0 X3^1 + +Debug: + rid:1 step:5 gid:19 user:rule:backchain = success + +Debug: }}} -> (0.001s) +Debug: run 6 {{{ + +Debug: + rid:1 step:6 gid:19 user:curgoal = of + of c0 (arr X3^1 X2) + +Debug: + rid:1 step:6 gid:19 user:rule = backchain + +Debug: + rid:1 step:6 gid:19 user:rule:backchain:candidates = File "(context step_id:4)", line 1, column 0, characters 0-0: + +Debug: }}} -> (0.000s) +Debug: select 5 {{{ + +Debug: + rid:1 step:6 gid:19 user:rule:backchain:try = File "(context step_id:4)", line 1, column 0, characters 0-0: + (of c0 X1) :- . + +Debug: + rid:1 step:6 gid:0 user:assign:expand = X3^1 := X4 c0 + +Debug: + rid:1 step:6 gid:0 user:assign:restrict = 0 X4 c0 := c0 \ + .X5 + +Debug: + rid:1 step:6 gid:0 user:assign = X1 := arr X5 X2 + +Debug: + rid:1 step:6 gid:19 user:rule:backchain = success + +Debug: }}} -> (0.000s) +Debug: run 7 {{{ + +Debug: + rid:1 step:7 gid:20 user:curgoal = of + of c0 X5 + +Debug: + rid:1 step:7 gid:20 user:rule = backchain + +Debug: + rid:1 step:7 gid:20 user:rule:backchain:candidates = File "(context step_id:4)", line 1, column 0, characters 0-0: + +Debug: }}} -> (0.000s) +Debug: select 6 {{{ + +Debug: + rid:1 step:7 gid:20 user:rule:backchain:try = File "(context step_id:4)", line 1, column 0, characters 0-0: + (of c0 (arr X5 X2)) :- . + +Debug: + rid:1 step:7 gid:20 user:backchain:fail-to = unify X5 with arr X5 X2 + +Debug: }}} -> (0.000s) +Debug: select 7 {{{ + +Debug: + rid:1 step:7 gid:20 user:rule:backchain = fail + +Debug: }}} -> (0.000s) +Debug: run 6 {{{ + +Debug: + rid:2 step:6 gid:27 user:curgoal = pi + pi c1 \ of c1 X0 => of c0 X1 + +Debug: + rid:2 step:6 gid:27 user:rule = pi + +Debug: + rid:2 step:6 gid:27 user:subgoal = 28 + +Debug: + rid:2 step:6 gid:28 user:newgoal = of c1 X0 => of c0 X1 + +Debug: + rid:2 step:6 gid:28 user:rule:pi = success + +Debug: }}} -> (0.000s) +Debug: run 7 {{{ + +Debug: + rid:2 step:7 gid:28 user:curgoal = => + of c1 X0 => of c0 X1 + +Debug: + rid:2 step:7 gid:28 user:rule = implication + +Debug: + rid:2 step:7 gid:28 user:subgoal = 29 + +Debug: + rid:2 step:7 gid:29 user:newgoal = of c0 X1 + +Debug: + rid:2 step:7 gid:29 user:rule:implication = success + +Debug: }}} -> (0.000s) +Debug: run 8 {{{ + +Debug: + rid:2 step:8 gid:29 user:curgoal = of + of c0 X1 + +Debug: + rid:2 step:8 gid:29 user:rule = backchain + +Debug: + rid:2 step:8 gid:29 user:rule:backchain:candidates = File "(context step_id:4)", line 1, column 0, characters 0-0: + +Debug: }}} -> (0.000s) +Debug: select 5 {{{ + +Debug: + rid:2 step:8 gid:29 user:rule:backchain:try = File "(context step_id:4)", line 1, column 0, characters 0-0: + (of c0 X2) :- . + +Debug: + rid:2 step:8 gid:0 user:assign = X2 := X1 + +Debug: + rid:2 step:8 gid:29 user:rule:backchain = success + +Debug: }}} -> (0.000s) +arr X1 (arr X0 X1) +Query assignments: + Ty = arr X1 (arr X0 X1) +Debug: run 2 {{{ + +Debug: + rid:3 step:2 gid:31 user:curgoal = of + of (fun c0 \ fun c1 \ c0) X0 + +Debug: + rid:3 step:2 gid:31 user:rule = backchain + +Debug: + rid:3 step:2 gid:31 user:rule:backchain:candidates = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: + +Debug: }}} -> (0.000s) +Debug: select 3 {{{ + +Debug: + rid:3 step:2 gid:31 user:rule:backchain:try = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: + (of (fun A0) (arr A2 A1)) :- ( + pi (c0 \ + (of c0 A2 => of (A0 c0) A1))). + +Debug: + rid:3 step:2 gid:0 user:assign = A0 := c0 \ + fun c1 \ c0 + +Debug: + rid:3 step:2 gid:0 user:assign = X0 := arr X1 X2 + +Debug: + rid:3 step:2 gid:31 user:subgoal = 33 + +Debug: + rid:3 step:2 gid:33 user:newgoal = pi c0 \ of c0 X1 => of (fun c1 \ c0) X2 + +Debug: + rid:3 step:2 gid:33 user:rule:backchain = success + +Debug: }}} -> (0.000s) +Debug: run 5 {{{ + +Debug: + rid:3 step:5 gid:35 user:curgoal = of + of (fun c1 \ c0) X2 + +Debug: + rid:3 step:5 gid:35 user:rule = backchain + +Debug: + rid:3 step:5 gid:35 user:rule:backchain:candidates = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: + +Debug: }}} -> (0.000s) +Debug: select 4 {{{ + +Debug: + rid:3 step:5 gid:35 user:rule:backchain:try = File "./examples/tutorial_elpi_lang.v", line 596, column 2, characters 15366-15421: + (of (fun A0) (arr A2 A1)) :- ( + pi (c0 \ + (of c0 A2 => of (A0 c0) A1))). + +Debug: + rid:3 step:5 gid:0 user:assign = A0 := c1 \ + c0 + +Debug: + rid:3 step:5 gid:0 user:assign = X2 := arr X3 X4 + +Debug: + rid:3 step:5 gid:35 user:subgoal = 36 + +Debug: + rid:3 step:5 gid:36 user:newgoal = pi c1 \ of c1 X3 => of c0 X4 + +Debug: + rid:3 step:5 gid:36 user:rule:backchain = success + +Debug: }}} -> (0.000s) +Debug: run 8 {{{ + +Debug: + rid:3 step:8 gid:38 user:curgoal = of + of c0 X4 + +Debug: + rid:3 step:8 gid:38 user:rule = backchain + +Debug: + rid:3 step:8 gid:38 user:rule:backchain:candidates = File "(context step_id:4)", line 1, column 0, characters 0-0: + +Debug: }}} -> (0.000s) +Debug: select 5 {{{ + +Debug: + rid:3 step:8 gid:38 user:rule:backchain:try = File "(context step_id:4)", line 1, column 0, characters 0-0: + (of c0 X1) :- . + +Debug: + rid:3 step:8 gid:0 user:assign = X1 := X4 + +Debug: + rid:3 step:8 gid:38 user:rule:backchain = success + +Debug: }}} -> (0.000s) +arr X4 (arr X3 X4) +Query assignments: + Ty = arr X4 (arr X3 X4) +Debug: run 8 {{{ + +Debug: + rid:4 step:8 gid:47 user:curgoal = of + of c0 X0 + +Debug: + rid:4 step:8 gid:47 user:rule = backchain + +Debug: + rid:4 step:8 gid:47 user:rule:backchain:candidates = File "(context step_id:4)", line 1, column 0, characters 0-0: + +Debug: }}} -> (0.000s) +Debug: select 5 {{{ + +Debug: + rid:4 step:8 gid:47 user:rule:backchain:try = File "(context step_id:4)", line 1, column 0, characters 0-0: + (of c0 X1) :- . + +Debug: + rid:4 step:8 gid:0 user:assign = X1 := X0 + +Debug: + rid:4 step:8 gid:47 user:rule:backchain = success + +Debug: }}} -> (0.000s) +arr X0 (arr X2 X0) +Query assignments: + Ty = arr X0 (arr X2 X0) +calling mypred on 3 +calling mypred on 2 +calling mypred on 1 +calling mypred on 0 +ok +Query assignments: + A = X0 + B = X0 + C = X0 +Query assignments: + A = X0 + B = X0 + C = X0 +File "./examples/tutorial_elpi_lang.v", line 554, characters 12-17: +Warning: +File "./examples/tutorial_elpi_lang.v", line 554, characters 12-17 +Hummm is linear: name it _Hummm (discard) or Hummm_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 670, characters 12-14: +Warning: +File "./examples/tutorial_elpi_lang.v", line 670, characters 12-14 +Ty is linear: name it _Ty (discard) or Ty_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 826, characters 26-27: +Warning: +File "./examples/tutorial_elpi_lang.v", line 826, characters 26-27 +X is linear: name it _X (discard) or X_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 826, characters 34-35: +Warning: +File "./examples/tutorial_elpi_lang.v", line 826, characters 34-35 +Y is linear: name it _Y (discard) or Y_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 856, characters 26-27: +Warning: +File "./examples/tutorial_elpi_lang.v", line 856, characters 26-27 +X is linear: name it _X (discard) or X_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 856, characters 34-35: +Warning: +File "./examples/tutorial_elpi_lang.v", line 856, characters 34-35 +Y is linear: name it _Y (discard) or Y_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 888, characters 21-22: +Warning: +File "./examples/tutorial_elpi_lang.v", line 888, characters 21-22 +X is linear: name it _X (discard) or X_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 888, characters 29-30: +Warning: +File "./examples/tutorial_elpi_lang.v", line 888, characters 29-30 +Z is linear: name it _Z (discard) or Z_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 1020, characters 26-27: +Warning: +File "./examples/tutorial_elpi_lang.v", line 1020, characters 26-27 +A is linear: name it _A (discard) or A_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 1057, characters 27-28: +Warning: +File "./examples/tutorial_elpi_lang.v", line 1057, characters 27-28 +A is linear: name it _A (discard) or A_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 1146, characters 18-20: +Warning: +File "./examples/tutorial_elpi_lang.v", line 1146, characters 18-20 +R1 is linear: name it _R1 (discard) or R1_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 1147, characters 15-17: +Warning: +File "./examples/tutorial_elpi_lang.v", line 1147, characters 15-17 +R2 is linear: name it _R2 (discard) or R2_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 1148, characters 16-18: +Warning: +File "./examples/tutorial_elpi_lang.v", line 1148, characters 16-18 +R3 is linear: name it _R3 (discard) or R3_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 1184, characters 16-17: +Warning: +File "./examples/tutorial_elpi_lang.v", line 1184, characters 16-17 +R is linear: name it _R (discard) or R_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 1511, characters 9-10: +Warning: +File "./examples/tutorial_elpi_lang.v", line 1511, characters 9-10 +A is linear: name it _A (discard) or A_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 1511, characters 20-21: +Warning: +File "./examples/tutorial_elpi_lang.v", line 1511, characters 20-21 +B is linear: name it _B (discard) or B_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 1511, characters 28-29: +Warning: +File "./examples/tutorial_elpi_lang.v", line 1511, characters 28-29 +C is linear: name it _C (discard) or C_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 1518, characters 9-10: +Warning: +File "./examples/tutorial_elpi_lang.v", line 1518, characters 9-10 +A is linear: name it _A (discard) or A_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 1518, characters 20-21: +Warning: +File "./examples/tutorial_elpi_lang.v", line 1518, characters 20-21 +B is linear: name it _B (discard) or B_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_elpi_lang.v", line 1518, characters 28-29: +Warning: +File "./examples/tutorial_elpi_lang.v", line 1518, characters 28-29 +C is linear: name it _C (discard) or C_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +Hello [str world!] +Hello [int 46] +Hello [str there] +Hello [str my, str friend] +Hello [str this.is.a.qualified.name] +Hello +[trm + (app + [global (indt «eq»), global (indt «nat»), global (indc «O»), + app [global (indc «S»), global (indc «O»)]])] +Hello +[const-decl test + (some + (app + [global (indt «eq»), global (indt «nat»), global (indc «O»), + app [global (indc «S»), global (indc «O»)]])) (arity (sort prop))] +Hello +[indt-decl + (record test (sort (typ «Set»)) Build_test + (field [coercion off, canonical tt] f1 (global (indt «nat»)) c0 \ + field [coercion off, canonical tt] f2 + (app + [global (indt «eq»), global (indt «nat»), c0, + app [global (indc «S»), global (indc «O»)]]) c1 \ end-record))] +The type of +app + [global (indt «eq»), global (indt «nat»), + app [global (indc «S»), global (indc «O»)], global (indc «O»)] is +sort prop +1 = true + : Prop +T= +app + [global (indt «eq»), X0, app [global (indc «S»), global (indc «O»)], + global (indc «true»)] +T1= +app + [global (indt «eq»), global (indt «nat»), + app [global (indc «S»), global (indc «O»)], + app [global (const «bool2nat»), global (indc «true»)]] +Ty= sort prop +nK_bool = 2 : nat -default nat_def : nat +nK_False = 0 : nat +Inductive tree' (A : Set) : Set := + leaf' : tree' A | node' : tree' A -> A -> tree' A -> tree' A. + +Arguments tree' A%type_scope +Arguments leaf' A%type_scope +Arguments node' A%type_scope _ _ _ +bob is 24 years old +alice is 21 years old +bob is 24 years old +alice is 21 years old +[attribute elpi.loc + (leaf-loc + File "./examples/tutorial_coq_elpi_command.v", line 610, column 31, characters 17257-17261:), + attribute elpi.phase (leaf-str interp), attribute this (leaf-str ), + attribute more (node [attribute stuff (leaf-str 33)])] +options= +[get-option elpi.loc + File "./examples/tutorial_coq_elpi_command.v", line 643, column 31, characters 18094-18104:, + get-option elpi.phase interp, get-option this tt, get-option more.stuff 33] +33 tt +That is all folks! +going from source to target via plane +synterp x := some _ +interp x := +some + (app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]) +The module is «elpi_examples.tutorial_coq_elpi_command.Module49» +Box.Box.Box.Box.foo = fun n : nat => n + 2 + : nat -> nat + +Arguments Box.Box.Box.Box.foo n%nat_scope +Module NextModule2 := Struct End +File "./examples/tutorial_coq_elpi_command.v", line 610, characters 2-24: +Warning: This command does not support these attributes: more, this. +[unsupported-attributes,parsing,default] +File "./examples/tutorial_coq_elpi_command.v", line 643, characters 2-24: +Warning: This command does not support these attributes: more, this. +[unsupported-attributes,parsing,default] +File "./examples/tutorial_coq_elpi_command.v", line 644, characters 7-14: +Warning: This command does not support this attribute: unknown. +[unsupported-attributes,parsing,default] + {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==[ |- => fun x : nat => ?Goal] (goal evar) + +SHELF:|| +FUTURE GOALS STACK: + || + +Rocq-Elpi mapping: +RAW: +?X2 <-> c0 \ X0 c0 +ELAB: +?X2 <-> X1 + +Debug: + {c0} : decl c0 `x` (global (indt «nat»)) + ?- evar (X0 c0) + (prod `_` (global (indt «bool»)) c1 \ global (indt «True»)) + (X1 c0) /* suspended on X0, X1 */ +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) [])] +[str fun, str in, str as, int 4, str end, str match, str return, str =>, + str :, str :=, str {, str }, str ;, str ,, str |, str x, int 1, str H, + trm + (fun `x` (global (indt «False»)) c0 \ + match c0 (fun `y` (global (indt «False»)) c1 \ global (indt «nat»)) + [])] +Query assignments: + T = sort (typ «elpi.tests.test_HOAS.3») + U = «elpi.tests.test_HOAS.3» +Query assignments: + U = «elpi.tests.test_HOAS.4» +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.4} |= +ALGEBRAIC UNIVERSES: + {} +FLEXIBLE UNIVERSES: + +SORTS: + +WEAK CONSTRAINTS: + + +Query assignments: + U = «foo» +Query assignments: + X = c0 \ c1 \ c2 \ +X0 c0 c1 c2 + X3_ = 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 + elpi.tests.test_HOAS.8 <= elpi.tests.test_HOAS.8 +ALGEBRAIC UNIVERSES: + {} +FLEXIBLE UNIVERSES: + +SORTS: + α3 := Type + α4 +WEAK 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 */ +EVARS: + ?X10==[ |- Type] (internal placeholder) {?elpi_evar} + ?X9==[a |- ?elpi_evar] (internal placeholder) {?e0} + ?X8==[a |- => ?elpi_evar] (internal placeholder) + +SHELF: +FUTURE GOALS STACK:?X10 +?X9 + +Rocq-Elpi mapping: +RAW: +?X9 <-> c0 \ X2 c0 +?X10 <-> X0 +ELAB: +?X9 <-> X2 +?X10 <-> X1 + +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: + {} +FLEXIBLE UNIVERSES: + +SORTS: + α5 +WEAK CONSTRAINTS: + + +Raw term: +app + [global (const «add»), primitive (uint63 2000000003333002), + primitive (uint63 1)] +Nice term: (2000000003333002 + 1)%uint63 +Red: +2000000003333003%uint63 +Raw term: +app + [global (const «add»), primitive (float64 24000000000000), + primitive (float64 1)] +Nice term: 24000000000000 + 1 +Red: 24000000000001 +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 `_elpi_renamed_n_3` (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»)]]] + X10_ = c0 \ c1 \ c2 \ +global (indt «nat») + X4_ = global (indt «nat») + X5_ = c0 \ +global (indt «nat») + X6_ = c0 \ c1 \ +global (indt «nat») + X7_ = c0 \ +global (indt «nat») + X8_ = c0 \ c1 \ +global (indt «nat») + X9_ = c0 \ c1 \ c2 \ c3 \ +global (indt «nat») +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 `_elpi_renamed_n_2` (global (indt «nat»)) c2 \ + global (indt «nat»)) + [c1, + fun `p` (global (indt «nat»)) c2 \ + app + [global (indc «S»), + app + [fix `plus` 0 + (prod `_elpi_renamed_n_3` (global (indt «nat»)) c3 \ + prod `_elpi_renamed_m_4` (global (indt «nat»)) c4 \ + global (indt «nat»)) c3 \ + fun `_elpi_renamed_n_4` (global (indt «nat»)) c4 \ + fun `_elpi_renamed_m_5` (global (indt «nat»)) c5 \ + match c4 + (fun `_elpi_renamed_n_6` (global (indt «nat»)) c6 \ + global (indt «nat»)) + [c5, + fun `_elpi_renamed_p_6` (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»)]]] + X11_ = global (indt «nat») + X12_ = c0 \ +global (indt «nat») + X13_ = c0 \ c1 \ c2 \ +global (indt «nat») + X14_ = c0 \ c1 \ +global (indt «nat») + X15_ = c0 \ c1 \ c2 \ +global (indt «nat») + X16_ = c0 \ c1 \ c2 \ c3 \ +global (indt «nat») + X17_ = c0 \ c1 \ c2 \ c3 \ c4 \ +global (indt «nat») + X18_ = c0 \ c1 \ c2 \ c3 \ +global (indt «nat») + X19_ = c0 \ c1 \ c2 \ c3 \ c4 \ +global (indt «nat») + X20_ = c0 \ c1 \ c2 \ c3 \ c4 \ c5 \ c6 \ +global (indt «nat») + X21_ = c0 \ c1 \ c2 \ c3 \ c4 \ c5 \ +global (indt «nat») +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 `_elpi_renamed_n_4` (global (indt «nat»)) c4 \ + global (indt «nat»)) + [c3, + fun `_elpi_renamed_p_4` (global (indt «nat»)) c4 \ + app [global (indc «S»), app [c1, c4, c3]]], c0, + app + [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]]] + X22_ = global (indt «nat») + X23_ = global (indt «nat») + X24_ = c0 \ +global (indt «nat») + X25_ = c0 \ c1 \ +global (indt «nat») + X26_ = c0 \ c1 \ c2 \ +global (indt «nat») + X27_ = c0 \ c1 \ +global (indt «nat») + X28_ = c0 \ c1 \ c2 \ +global (indt «nat») + X29_ = c0 \ c1 \ c2 \ c3 \ c4 \ +global (indt «nat») + X30_ = c0 \ c1 \ c2 \ c3 \ +global (indt «nat») +Query assignments: + C = «Nat.add» + F = TODO + T = app + [global (indc «S»), + app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] + T1 = app + [global (const «Nat.add»), + app [global (indc «S»), global (indc «O»)], + app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] + T2 = app + [global (indc «S»), + app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] +Query assignments: + C = «proj1» +Query assignments: + C = «proj1» + P = elpi.tests.test_HOAS.P''.proj1 +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 «P.foo.u0»)) 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 «P.foo.u0»)) c0 \ + fun `f` (app [global (indt «P.foo»), c0]) c1 \ + app [primitive (proj elpi.tests.test_HOAS.P.p1 1), c1]) +some + (pglobal (const «toto») + «elpi.tests.test_HOAS.23 elpi.tests.test_HOAS.24») +prod `T1` (sort (typ «elpi.tests.test_HOAS.23»)) c0 \ + prod `T2` (sort (typ «elpi.tests.test_HOAS.24»)) c1 \ prod `x` c0 c2 \ c0 +Query assignments: + Body = some + (pglobal (const «toto») + «elpi.tests.test_HOAS.23 elpi.tests.test_HOAS.24») + C = «titi» + Term = prod `T1` (sort (typ «elpi.tests.test_HOAS.23»)) c0 \ + prod `T2` (sort (typ «elpi.tests.test_HOAS.24»)) c1 \ prod `x` c0 c2 \ c0 +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.24 elpi.tests.test_HOAS.23} |= +ALGEBRAIC UNIVERSES: + {} +FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.24 + elpi.tests.test_HOAS.23 +SORTS: + +WEAK CONSTRAINTS: + + +pglobal (const «toto») X0 +pglobal (const «toto») «u1 u2» +toto +Query assignments: + %arg1 = toto + X31_ = X0 + X32_ = «elpi.tests.test_HOAS.27 elpi.tests.test_HOAS.28» +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.28 elpi.tests.test_HOAS.27} |= +ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.28 elpi.tests.test_HOAS.27} +FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.28 + elpi.tests.test_HOAS.27 +SORTS: + +WEAK CONSTRAINTS: + + +app + [pglobal (const «t») X0, global (indt «nat»), + pglobal (const «fnat») X1] +app + [pglobal (const «t») «elpi.tests.test_HOAS.33», global (indt «nat»), + pglobal (const «fnat») «»] +Query assignments: + T = app + [pglobal (const «t») «elpi.tests.test_HOAS.33», global (indt «nat»), + pglobal (const «fnat») «»] + Ty = global (indt «nat») + X33_ = «elpi.tests.test_HOAS.33» + X34_ = «» +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.33} |= + Set <= elpi.tests.test_HOAS.33 + Set = elpi.tests.test_HOAS.33 +ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.33} +FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.33 := Set +SORTS: + +WEAK CONSTRAINTS: + + +Query assignments: + Arity = prod `T` (sort (typ «elpi.tests.test_HOAS.34»)) c0 \ + sort (typ «elpi.tests.test_HOAS.34») + GRF = indt «F» + I = «elpi.tests.test_HOAS.34» + Ind = «F» + K = [«Build_F»] + KTys = [prod `T` (sort (typ «elpi.tests.test_HOAS.34»)) c0 \ + prod `t` c0 c1 \ app [pglobal (indt «F») «elpi.tests.test_HOAS.34», c0]] + TyF = prod `T` (sort (typ «elpi.tests.test_HOAS.34»)) c0 \ + sort (typ «elpi.tests.test_HOAS.34») +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.34} |= +ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.34} +FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.34 +SORTS: + +WEAK CONSTRAINTS: + + +Query assignments: + Decl = parameter T explicit (sort (typ «elpi.tests.test_HOAS.35»)) c0 \ + record F (sort (typ «elpi.tests.test_HOAS.35»)) Build_F + (field [coercion off, canonical tt] t c0 c1 \ end-record) + GRF = indt «F» + I = «elpi.tests.test_HOAS.35» + Ind = «F» +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.35} |= +ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.35} +FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.35 +SORTS: + +WEAK CONSTRAINTS: + + +«elpi.tests.test_HOAS.36» «elpi.tests.test_HOAS.37» +Universe constraints: UNIVERSES: + {elpi.tests.test_HOAS.37 elpi.tests.test_HOAS.36} |= + ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.37 elpi.tests.test_HOAS.36} + FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.37 + elpi.tests.test_HOAS.36 + SORTS: + + WEAK CONSTRAINTS: + + +Universe constraints: UNIVERSES: + {elpi.tests.test_HOAS.37 elpi.tests.test_HOAS.36} |= + elpi.tests.test_HOAS.36 = elpi.tests.test_HOAS.37 + ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.37 elpi.tests.test_HOAS.36} + FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.37 + elpi.tests.test_HOAS.36 := elpi.tests.test_HOAS.37 + SORTS: + + WEAK CONSTRAINTS: + + +Query assignments: + GRF = indt «F» + I1 = «elpi.tests.test_HOAS.36» + I2 = «elpi.tests.test_HOAS.37» +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.37 elpi.tests.test_HOAS.36} |= + elpi.tests.test_HOAS.36 = elpi.tests.test_HOAS.37 +ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.37 elpi.tests.test_HOAS.36} +FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.37 + elpi.tests.test_HOAS.36 := elpi.tests.test_HOAS.37 +SORTS: + +WEAK CONSTRAINTS: + + +«elpi.tests.test_HOAS.38» «» +Universe constraints: UNIVERSES: + {elpi.tests.test_HOAS.38} |= + ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.38} + FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.38 + SORTS: + + WEAK CONSTRAINTS: + + +different universe instance lengths +Universe constraints: UNIVERSES: + {elpi.tests.test_HOAS.38} |= + ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.38} + FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.38 + SORTS: + + WEAK CONSTRAINTS: + + +Query assignments: + E = different universe instance lengths + GRF = indt «F» + GRfnat = const «fnat» + I1 = «elpi.tests.test_HOAS.38» + I2 = «» +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.38} |= +ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.38} +FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.38 +SORTS: + +WEAK CONSTRAINTS: + + +Query assignments: + GRF = indt «F» + I1 = «elpi.tests.test_HOAS.39» + I2 = «elpi.tests.test_HOAS.39» + U = «elpi.tests.test_HOAS.39» + UL1 = [«elpi.tests.test_HOAS.39»] +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.39} |= +ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.39} +FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.39 +SORTS: + +WEAK CONSTRAINTS: + + +Cannot enforce elpi.tests.test_HOAS.40 = elpi.tests.test_HOAS.41 because +elpi.tests.test_HOAS.40 < elpi.tests.test_HOAS.41 +Query assignments: + E = Cannot enforce elpi.tests.test_HOAS.40 = elpi.tests.test_HOAS.41 because +elpi.tests.test_HOAS.40 < elpi.tests.test_HOAS.41 + GRF = indt «F» + I1 = «elpi.tests.test_HOAS.40» + I2 = «elpi.tests.test_HOAS.41» + L1 = «elpi.tests.test_HOAS.40» + L2 = «elpi.tests.test_HOAS.41» + U1 = «elpi.tests.test_HOAS.40» + U2 = «elpi.tests.test_HOAS.41» +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.41 elpi.tests.test_HOAS.40} |= + elpi.tests.test_HOAS.40 < elpi.tests.test_HOAS.41 +ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.41 elpi.tests.test_HOAS.40} +FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.41 + elpi.tests.test_HOAS.40 +SORTS: + +WEAK CONSTRAINTS: + + +Universe constraints: UNIVERSES: + {elpi.tests.test_HOAS.45 elpi.tests.test_HOAS.44} |= + elpi.tests.test_HOAS.44 < elpi.tests.test_HOAS.45 + ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.45 elpi.tests.test_HOAS.44} + FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.45 + elpi.tests.test_HOAS.44 + SORTS: + + WEAK CONSTRAINTS: + + +Query assignments: + GRF = indt «F2» + I1 = «elpi.tests.test_HOAS.44» + I2 = «elpi.tests.test_HOAS.45» + L1 = «elpi.tests.test_HOAS.44» + L2 = «elpi.tests.test_HOAS.45» + U1 = «elpi.tests.test_HOAS.44» + U2 = «elpi.tests.test_HOAS.45» +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.45 elpi.tests.test_HOAS.44} |= + elpi.tests.test_HOAS.44 < elpi.tests.test_HOAS.45 + elpi.tests.test_HOAS.44 <= elpi.tests.test_HOAS.45 +ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.45 elpi.tests.test_HOAS.44} +FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.45 + elpi.tests.test_HOAS.44 +SORTS: + +WEAK CONSTRAINTS: + + +Universe constraints: UNIVERSES: + {elpi.tests.test_HOAS.47 elpi.tests.test_HOAS.46} |= + elpi.tests.test_HOAS.46 < elpi.tests.test_HOAS.47 + ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.47} + FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.47 + elpi.tests.test_HOAS.46 + SORTS: + + WEAK CONSTRAINTS: + + +Cannot enforce elpi.tests.test_HOAS.47 = elpi.tests.test_HOAS.46 because +elpi.tests.test_HOAS.46 < elpi.tests.test_HOAS.47 +Query assignments: + E = Cannot enforce elpi.tests.test_HOAS.47 = elpi.tests.test_HOAS.46 because +elpi.tests.test_HOAS.46 < elpi.tests.test_HOAS.47 + GRF = indt «F» + I1 = «elpi.tests.test_HOAS.46» + I2 = «elpi.tests.test_HOAS.47» + L1 = «elpi.tests.test_HOAS.46» + L2 = «elpi.tests.test_HOAS.47» + U1 = «elpi.tests.test_HOAS.46» + U2 = «elpi.tests.test_HOAS.47» +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.47 elpi.tests.test_HOAS.46} |= + elpi.tests.test_HOAS.46 < elpi.tests.test_HOAS.47 +ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.47} +FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.47 + elpi.tests.test_HOAS.46 +SORTS: + +WEAK CONSTRAINTS: + + +Query assignments: + GR = indt «nat» +Query assignments: + GR = indt «F» + I = «elpi.tests.test_HOAS.48» +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.48} |= +ALGEBRAIC UNIVERSES: + {} +FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.48 +SORTS: + +WEAK CONSTRAINTS: + + +Query assignments: + GR = indt «F» +pglobal (indt «F») «elpi.tests.test_HOAS.50» +Query assignments: + %arg1 = pglobal (indt «F») «elpi.tests.test_HOAS.50» + GR = indt «F» + I = «elpi.tests.test_HOAS.50» +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.50} |= +ALGEBRAIC UNIVERSES: + {} +FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.50 +SORTS: + +WEAK CONSTRAINTS: + + +«elpi.tests.test_HOAS.51 elpi.tests.test_HOAS.51» +Query assignments: + I = «elpi.tests.test_HOAS.51 elpi.tests.test_HOAS.51» + U = «elpi.tests.test_HOAS.51» +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.51} |= +ALGEBRAIC UNIVERSES: + {} +FLEXIBLE UNIVERSES: + +SORTS: + +WEAK CONSTRAINTS: + + +Universe constraints: +------------------ +Universe constraints: UNIVERSES: + {elpi.tests.test_HOAS.53 elpi.tests.test_HOAS.52} |= + elpi.tests.test_HOAS.52 < elpi.tests.test_HOAS.53 + ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.53 elpi.tests.test_HOAS.52} + FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.53 + elpi.tests.test_HOAS.52 + SORTS: + + WEAK CONSTRAINTS: + + +Universe constraints: UNIVERSES: + {elpi.tests.test_HOAS.53 elpi.tests.test_HOAS.52} |= + elpi.tests.test_HOAS.52 < elpi.tests.test_HOAS.53 + ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.53 elpi.tests.test_HOAS.52} + FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.53 + elpi.tests.test_HOAS.52 + SORTS: + + WEAK CONSTRAINTS: + + +Query assignments: + Body = sort (typ «elpi.tests.test_HOAS.52») + LX = «elpi.tests.test_HOAS.52» + LY = «elpi.tests.test_HOAS.53» + Type = sort (typ «elpi.tests.test_HOAS.53») + UX = «elpi.tests.test_HOAS.52» + UY = «elpi.tests.test_HOAS.53» +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.53 elpi.tests.test_HOAS.52} |= + elpi.tests.test_HOAS.52 < elpi.tests.test_HOAS.53 +ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.53 elpi.tests.test_HOAS.52} +FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.53 + elpi.tests.test_HOAS.52 +SORTS: + +WEAK CONSTRAINTS: + + +poly@{u u0} : Type@{u0} +(* u u0 |= u < u0 *) + +poly is universe polymorphic +poly is transparent +Expands to: Constant elpi.tests.test_HOAS.poly +poly@{Set +elpi.tests.test_HOAS.54} + : Type@{elpi.tests.test_HOAS.54} +(* {elpi.tests.test_HOAS.54} |= Set < elpi.tests.test_HOAS.54 *) +Box not a defined object. +sort (typ «Set») +Query assignments: + U = «elpi.tests.test_HOAS.55» +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.55} |= Set = elpi.tests.test_HOAS.55 +ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.55} +FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.55 := Set +SORTS: + +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 |= Set <= list.u0 + u <= list.u0 *) + +Arguments tree A%type_scope +Arguments leaf A%type_scope _ +Arguments node A%type_scope _ _%list_scope +parameter A explicit (sort (typ «elpi.tests.test_HOAS.64»)) c0 \ + inductive tree tt (arity (sort (typ «elpi.tests.test_HOAS.65»))) 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.69 elpi.tests.test_HOAS.68 + elpi.tests.test_HOAS.67 elpi.tests.test_HOAS.66 + elpi.tests.test_HOAS.65 elpi.tests.test_HOAS.64} |= + elpi.tests.test_HOAS.64 < elpi.tests.test_HOAS.66 + elpi.tests.test_HOAS.65 < elpi.tests.test_HOAS.67 + Set <= list.u0 + Set <= elpi.tests.test_HOAS.65 + Set <= elpi.tests.test_HOAS.69 + elpi.tests.test_HOAS.64 <= list.u0 + elpi.tests.test_HOAS.64 <= elpi.tests.test_HOAS.65 + elpi.tests.test_HOAS.64 <= elpi.tests.test_HOAS.68 + elpi.tests.test_HOAS.64 <= elpi.tests.test_HOAS.69 + elpi.tests.test_HOAS.65 <= list.u0 + elpi.tests.test_HOAS.65 <= elpi.tests.test_HOAS.68 + elpi.tests.test_HOAS.65 <= elpi.tests.test_HOAS.69 + elpi.tests.test_HOAS.68 <= elpi.tests.test_HOAS.65 + elpi.tests.test_HOAS.69 <= elpi.tests.test_HOAS.65 + ALGEBRAIC UNIVERSES: + {elpi.tests.test_HOAS.64} + FLEXIBLE UNIVERSES: + elpi.tests.test_HOAS.64 + SORTS: + + WEAK CONSTRAINTS: + + +Query assignments: + D = parameter A explicit (sort (typ «M.tree.u0»)) c0 \ + inductive tree tt (arity (sort (typ «M.tree.u1»))) c1 \ + [constructor leaf (arity (prod `_` c0 c2 \ c1)), + constructor node + (arity + (prod `_` c0 c2 \ prod `_` (app [global (indt «list»), c1]) c3 \ c1))] + I = «tree» + X35_ = X0 +Universe constraints: +UNIVERSES: + {elpi.tests.test_HOAS.69 elpi.tests.test_HOAS.68 elpi.tests.test_HOAS.67 + elpi.tests.test_HOAS.66} |= + M.tree.u0 < elpi.tests.test_HOAS.66 + M.tree.u1 < elpi.tests.test_HOAS.67 + Set <= elpi.tests.test_HOAS.69 + M.tree.u0 <= elpi.tests.test_HOAS.68 + M.tree.u0 <= elpi.tests.test_HOAS.69 + M.tree.u1 <= elpi.tests.test_HOAS.68 + M.tree.u1 <= elpi.tests.test_HOAS.69 + elpi.tests.test_HOAS.68 <= M.tree.u1 + elpi.tests.test_HOAS.69 <= M.tree.u1 +ALGEBRAIC UNIVERSES: + {M.tree.u0} +FLEXIBLE UNIVERSES: + M.tree.u0 +SORTS: + +WEAK CONSTRAINTS: + + +File "./tests/test_HOAS.v", line 94, characters 46-61: +Warning: +File "./tests/test_HOAS.v", line 94, characters 46-61 +X is linear: name it _X (discard) or X_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_HOAS.v", line 101, characters 19-24: +Warning: +File "./tests/test_HOAS.v", line 101, characters 19-24 +X is linear: name it _X (discard) or X_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_HOAS.v", line 127, characters 0-40: +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,default] +File "./tests/test_HOAS.v", line 130, characters 0-40: +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,default] +File "./tests/test_HOAS.v", line 306, characters 18-20: +Warning: +File "./tests/test_HOAS.v", line 306, characters 18-20 +Ty is linear: name it _Ty (discard) or Ty_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_HOAS.v", line 320, characters 43-48: +Warning: +File "./tests/test_HOAS.v", line 320, characters 43-48 +Arity is linear: name it _Arity (discard) or Arity_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_HOAS.v", line 320, characters 49-50: +Warning: +File "./tests/test_HOAS.v", line 320, characters 49-50 +K is linear: name it _K (discard) or K_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_HOAS.v", line 320, characters 51-55: +Warning: +File "./tests/test_HOAS.v", line 320, characters 51-55 +KTys is linear: name it _KTys (discard) or KTys_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_HOAS.v", line 316, characters 32-35: +Warning: +File "./tests/test_HOAS.v", line 316, characters 32-35 +TyF is linear: name it _TyF (discard) or TyF_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_HOAS.v", line 467, characters 42-46: +Warning: +File "./tests/test_HOAS.v", line 467, characters 42-46 +Decl is linear: name it _Decl (discard) or Decl_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "coq-builtin.elpi", line 461, characters 50-51: +Warning: +File "coq-builtin.elpi", line 461, characters 50-51 +I is linear: name it _I (discard) or I_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_HOAS.v", line 506, characters 20-22: +Warning: +File "./tests/test_HOAS.v", line 506, characters 20-22 +I2 is linear: name it _I2 (discard) or I2_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_HOAS.v", line 504, characters 23-26: +Warning: +File "./tests/test_HOAS.v", line 504, characters 23-26 +UL1 is linear: name it _UL1 (discard) or UL1_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_HOAS.v", line 558, characters 32-33: +Warning: +File "./tests/test_HOAS.v", line 558, characters 32-33 +I is linear: name it _I (discard) or I_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "coq-builtin.elpi", line 461, characters 50-51: +Warning: +File "coq-builtin.elpi", line 461, characters 50-51 +I is linear: name it _I (discard) or I_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_HOAS.v", line 629, characters 36-37: +Warning: +File "./tests/test_HOAS.v", line 629, characters 36-37 +U is linear: name it _U (discard) or U_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +The argument fun x : ?e => x + ?e1 was closed under 1 binders +old replacement: fun (x : ?e) (y : ?e0) => x - y with +fun (y : ?e1) (x : ?e2) => y + x +new replacement: fun y : ?e0 => x - y with fun y : ?e1 => y + x nabla c1 \ seal (goal [decl c1 `P` (sort prop)] (app [global (const «id»), X0, X1]) @@ -13142,7 +11852,7 @@ Debug: rid:0 step:1 gid:4 user:rule:and = success -Debug: }}} -> (0.003s) +Debug: }}} -> (0.021s) Debug: run 2 {{{ Debug: @@ -13193,7 +11903,7 @@ Debug: rid:0 step:2 gid:7 user:rule:pi = success -Debug: }}} -> (0.005s) +Debug: }}} -> (0.001s) Debug: run 3 {{{ Debug: @@ -13242,7 +11952,7 @@ Debug: rid:0 step:3 gid:8 user:rule:pi = success -Debug: }}} -> (0.001s) +Debug: }}} -> (0.018s) Debug: run 4 {{{ Debug: @@ -13270,7 +11980,7 @@ Debug: rid:0 step:4 gid:8 user:rule:backchain:candidates = File "coq-builtin.elpi", line 270, column 0, characters 10866-10986: -Debug: }}} -> (0.000s) +Debug: }}} -> (0.001s) Debug: select 5 {{{ Debug: @@ -13328,7 +12038,7 @@ Debug: rid:0 step:4 gid:9 user:rule:backchain = success -Debug: }}} -> (0.001s) +Debug: }}} -> (0.014s) Debug: run 5 {{{ Debug: @@ -13381,7 +12091,7 @@ Debug: rid:0 step:5 gid:9 user:rule:builtin = success -Debug: }}} -> (0.005s) +Debug: }}} -> (0.001s) Debug: run 6 {{{ Debug: @@ -13643,7 +12353,7 @@ Debug: rid:4 step:103 gid:241 user:rule:backchain = success -Debug: }}} -> (0.002s) +Debug: }}} -> (0.003s) Debug: run 104 {{{ Debug: @@ -13747,1038 +12457,2919 @@ (X22 c1 c2 c3) [])) Debug: - rid:4 step:105 gid:244 user:rule = builtin - + rid:4 step:105 gid:244 user:rule = builtin + +Debug: + rid:4 step:105 gid:244 user:rule:builtin:name = occurs + +Debug: + rid:4 step:105 gid:244 user:rule:builtin = fail + +Debug: }}} -> (0.001s) +Debug: run 106 {{{ + +Debug: + rid:4 step:106 gid:157 user:curgoal = coq.ltac.private.distribute-nabla + coq.ltac.private.distribute-nabla (c0 \ + [nabla c1 \ + nabla c2 \ + nabla c3 \ + seal + (goal + [decl c3 `w` + (global (indt «nat»)), + decl c2 `z` + (global (indt «nat»)), + decl c1 `x` + (global (indt «nat»))] + (X26 c1 c2 c3) + (app + [global (indt «eq»), + global (indt «nat»), c1, + app + [global (const «Nat.add»), + app + [global + (const «Nat.add»), + app + [global (indc «S»), + global (indc «O»)], + c3], c2]]) + (X22 c1 c2 c3) [])]) X7 + +Debug: + rid:4 step:106 gid:157 user:rule = backchain + +Debug: + rid:4 step:106 gid:157 user:rule:backchain:candidates = File "/build/reproducible-path/coq-elpi-2.5.0/elpi/elpi-ltac.elpi", line 119, column 0, characters 4642-4704: + +Debug: }}} -> (0.001s) +Debug: select 52 {{{ + +Debug: + rid:4 step:106 gid:157 user:rule:backchain:try = File "/build/reproducible-path/coq-elpi-2.5.0/elpi/elpi-ltac.elpi", line 119, column 0, characters 4642-4704: + (coq.ltac.private.distribute-nabla + (c0 \ [A2 | (A0 c0)]) + [A2 | A1]) :- (coq.ltac.private.distribute-nabla + A0 A1). + +Debug: + rid:4 step:106 gid:0 user:assign = A2 := nabla c0 \ + nabla c1 \ + nabla c2 \ + seal + (goal + [decl c2 `w` + (global (indt «nat»)), + decl c1 `z` + (global (indt «nat»)), + decl c0 `x` + (global (indt «nat»))] + (X26 c0 c1 c2) + (app + [global (indt «eq»), + global (indt «nat»), c0, + app + [global + (const «Nat.add»), + app + [global + (const «Nat.add»), + app + [global (indc «S»), + global (indc «O»)], + c2], c1]]) + (X22 c0 c1 c2) []) + +Debug: + rid:4 step:106 gid:0 user:assign:simplify:stack:arg = A0 := X43 + +Debug: + rid:4 step:106 gid:0 user:assign:HO = X43 := c0 \ + [] + +Debug: + rid:4 step:106 gid:0 user:assign = X7 := [nabla c0 \ + nabla c1 \ + nabla c2 \ + seal + (goal + [decl c2 `w` + (global (indt «nat»)), + decl c1 `z` + (global (indt «nat»)), + decl c0 `x` + (global (indt «nat»))] + (X26 c0 c1 c2) + (app + [global (indt «eq»), + global (indt «nat»), + c0, + app + [global + (const «Nat.add»), + app + [global + (const «Nat.add»), + app + [global (indc «S»), + global (indc «O»)], + c2], c1]]) + (X22 c0 c1 c2) []) | X44] + +Debug: + rid:4 step:106 gid:157 user:subgoal = 245 + +Debug: + rid:4 step:106 gid:245 user:newgoal = coq.ltac.private.distribute-nabla (c0 \ + []) X44 + +Debug: + rid:4 step:106 gid:245 user:rule:backchain = success + +Debug: }}} -> (0.002s) +Debug: run 107 {{{ + +Debug: + rid:4 step:107 gid:245 user:curgoal = coq.ltac.private.distribute-nabla + coq.ltac.private.distribute-nabla (c0 \ + []) X44 + +Debug: + rid:4 step:107 gid:245 user:rule = backchain + +Debug: + rid:4 step:107 gid:245 user:rule:backchain:candidates = File "/build/reproducible-path/coq-elpi-2.5.0/elpi/elpi-ltac.elpi", line 116, column 0, characters 4512-4539: + File "/build/reproducible-path/coq-elpi-2.5.0/elpi/elpi-ltac.elpi", line 117, column 0, characters 4541-4640: + File "/build/reproducible-path/coq-elpi-2.5.0/elpi/elpi-ltac.elpi", line 119, column 0, characters 4642-4704: + +Debug: }}} -> (0.000s) +Debug: select 53 {{{ + +Debug: + rid:4 step:107 gid:245 user:rule:backchain:try = File "/build/reproducible-path/coq-elpi-2.5.0/elpi/elpi-ltac.elpi", line 116, column 0, characters 4512-4539: + (coq.ltac.private.distribute-nabla + (c0 \ []) []) :- . + +Debug: + rid:4 step:107 gid:0 user:assign = X44 := [] + +Debug: + rid:4 step:107 gid:245 user:rule:backchain = success + +Debug: }}} -> (0.000s) +Debug: run 108 {{{ + +Debug: + rid:4 step:108 gid:154 user:curgoal = coq.ltac.all + coq.ltac.all (coq.ltac.open solve) [] + X8 + +Debug: + rid:4 step:108 gid:154 user:rule = backchain + +Debug: + rid:4 step:108 gid:154 user:rule:backchain:candidates = File "/build/reproducible-path/coq-elpi-2.5.0/elpi/elpi-ltac.elpi", line 62, column 0, characters 2339-2350: + +Debug: }}} -> (0.000s) +Debug: select 54 {{{ + +Debug: + rid:4 step:108 gid:154 user:rule:backchain:try = File "/build/reproducible-path/coq-elpi-2.5.0/elpi/elpi-ltac.elpi", line 62, column 0, characters 2339-2350: + (coq.ltac.all _ [] []) :- . + +Debug: + rid:4 step:108 gid:0 user:assign = X8 := [] + +Debug: + rid:4 step:108 gid:154 user:rule:backchain = success + +Debug: }}} -> (0.000s) +Debug: run 109 {{{ + +Debug: + rid:4 step:109 gid:155 user:curgoal = std.append + std.append + [nabla c0 \ + nabla c1 \ + nabla c2 \ + seal + (goal + [decl c2 `w` + (global (indt «nat»)), + decl c1 `z` + (global (indt «nat»)), + decl c0 `x` + (global (indt «nat»))] + (X26 c0 c1 c2) + (app + [global (indt «eq»), + global (indt «nat»), c0, + app + [global (const «Nat.add»), + app + [global + (const «Nat.add»), + app + [global (indc «S»), + global (indc «O»)], + c2], c1]]) + (X22 c0 c1 c2) [])] [] (X2) + +Debug: + rid:4 step:109 gid:155 user:rule = backchain + +Debug: + rid:4 step:109 gid:155 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 86, column 0, characters 2798-2838: + +Debug: }}} -> (0.001s) +Debug: select 55 {{{ + +Debug: + rid:4 step:109 gid:155 user:rule:backchain:try = File "builtin_stdlib.elpi", line 86, column 0, characters 2798-2838: + (std.append [A3 | A0] A1 + [A3 | A2]) :- (std.append + A0 A1 A2). + +Debug: + rid:4 step:109 gid:0 user:assign = A3 := nabla c0 \ + nabla c1 \ + nabla c2 \ + seal + (goal + [decl c2 `w` + (global (indt «nat»)), + decl c1 `z` + (global (indt «nat»)), + decl c0 `x` + (global (indt «nat»))] + (X26 c0 c1 c2) + (app + [global (indt «eq»), + global (indt «nat»), c0, + app + [global + (const «Nat.add»), + app + [global + (const «Nat.add»), + app + [global (indc «S»), + global (indc «O»)], + c2], c1]]) + (X22 c0 c1 c2) []) + +Debug: + rid:4 step:109 gid:0 user:assign = A0 := [] + +Debug: + rid:4 step:109 gid:0 user:assign = A1 := [] + +Debug: + rid:4 step:109 gid:0 user:assign:resume = 230 + +Debug: + rid:4 step:109 gid:0 user:assign:resume = 230 + +Debug: + rid:4 step:109 gid:0 user:assign:HO = X2 := [nabla c0 \ + nabla c1 \ + nabla c2 \ + seal + (goal + [decl c2 `w` + (global (indt «nat»)), + decl c1 `z` + (global (indt «nat»)), + decl c0 `x` + (global (indt «nat»))] + (X45 c0 c1 c2) + (app + [global (indt «eq»), + global (indt «nat»), + c0, + app + [global + (const «Nat.add»), + app + [global + (const «Nat.add»), + app + [global + (indc «S»), + global + (indc «O»)], + c2], c1]]) + (X46 c0 c1 c2) []) | X47] + +Debug: + rid:4 step:109 gid:155 user:subgoal = 246 + +Debug: + rid:4 step:109 gid:246 user:newgoal = std.append [] [] X47 + +Debug: + rid:4 step:109 gid:246 user:rule:backchain = success + +Debug: }}} -> (0.002s) +Debug: run 110 {{{ + +Debug: + rid:4 step:110 gid:0 user:rule = resume + +Debug: + rid:4 step:110 gid:230 user:rule:resume:resumed = evar (X45 c2 c3 c4) + (app + [global (indt «eq»), + global (indt «nat»), + c2, + app + [global + (const «Nat.add»), + app + [global + (const «Nat.add»), + app + [global + (indc «S»), + global + (indc «O»)], + c4], c3]]) + (X46 c2 c3 c4) + +Debug: + rid:4 step:110 gid:0 user:rule:resume = success + +Debug: }}} -> (0.000s) +Debug: run 111 {{{ + +Debug: + rid:4 step:111 gid:230 user:curgoal = evar + evar (X45 c2 c3 c4) + (app + [global (indt «eq»), + global (indt «nat»), c2, + app + [global (const «Nat.add»), + app + [global (const «Nat.add»), + app + [global (indc «S»), + global (indc «O»)], c4], c3]]) + (X46 c2 c3 c4) + +Debug: + rid:4 step:111 gid:230 user:rule = backchain + +Debug: + rid:4 step:111 gid:230 user:rule:backchain:candidates = File "coq-builtin.elpi", line 301, column 0, characters 12083-12186: + File "/build/reproducible-path/coq-elpi-2.5.0/elpi/coq-elaborator.elpi", line 7, column 0, characters 296-388: + File "/build/reproducible-path/coq-elpi-2.5.0/elpi/coq-elaborator.elpi", line 11, column 0, characters 391-621: + File "/build/reproducible-path/coq-elpi-2.5.0/elpi/coq-elaborator.elpi", line 16, column 0, characters 624-744: + File "coq-builtin.elpi", line 304, column 0, characters 12189-12227: + +Debug: }}} -> (0.001s) +Debug: select 56 {{{ + +Debug: + rid:4 step:111 gid:230 user:rule:backchain:try = File "coq-builtin.elpi", line 301, column 0, characters 12083-12186: + (evar (as uvar A3) A2 A0) :- ( + var A0 _ A1), (!), + (prune A2 A1), + (prune A3 A1), + (declare_constraint + (evar A3 A2 A0) [ + A3, A0]). + +Debug: + rid:4 step:111 gid:0 user:assign = A3 := X45 c2 c3 c4 + +Debug: + rid:4 step:111 gid:0 user:assign = A2 := app + [global (indt «eq»), + global (indt «nat»), c2, + app + [global (const «Nat.add»), + app + [global (const «Nat.add»), + app + [global (indc «S»), + global (indc «O»)], c4], + c3]] + +Debug: + rid:4 step:111 gid:0 user:assign = A0 := X46 c2 c3 c4 + +Debug: + rid:4 step:111 gid:230 user:subgoal = 247 + +Debug: + rid:4 step:111 gid:247 user:newgoal = var (X46 c2 c3 c4) _ X48^5 + +Debug: + rid:4 step:111 gid:247 user:subgoal = 248 + +Debug: + rid:4 step:111 gid:248 user:newgoal = ! + +Debug: + rid:4 step:111 gid:247 user:subgoal = 249 + +Debug: + rid:4 step:111 gid:249 user:newgoal = prune + (app + [global (indt «eq»), + global (indt «nat»), c2, + app + [global (const «Nat.add»), + app + [global (const «Nat.add»), + app + [global (indc «S»), + global (indc «O»)], c4], c3]]) + X48^5 + +Debug: + rid:4 step:111 gid:247 user:subgoal = 250 + +Debug: + rid:4 step:111 gid:250 user:newgoal = prune (X45 c2 c3 c4) X48^5 + +Debug: + rid:4 step:111 gid:247 user:subgoal = 251 + +Debug: + rid:4 step:111 gid:251 user:newgoal = declare_constraint + (evar (X45 c2 c3 c4) + (app + [global (indt «eq»), + global (indt «nat»), c2, + app + [global (const «Nat.add»), + app + [global (const «Nat.add»), + app + [global (indc «S»), + global (indc «O»)], c4], + c3]]) (X46 c2 c3 c4)) + [X45 c2 c3 c4, X46 c2 c3 c4] + +Debug: + rid:4 step:111 gid:247 user:rule:backchain = success + +Debug: }}} -> (0.001s) +Debug: run 112 {{{ + +Debug: + rid:4 step:112 gid:247 user:curgoal = var + var (X46 c2 c3 c4) _ X48^5 + +Debug: + rid:4 step:112 gid:247 user:rule = builtin + +Debug: + rid:4 step:112 gid:247 user:rule:builtin:name = var + +Debug: + rid:4 step:112 gid:247 user:rule:builtin = success + +Debug: + rid:4 step:112 gid:247 user:subgoal = 252 + +Debug: + rid:4 step:112 gid:252 user:newgoal = X48^5 = [c2, c3, c4] + +Debug: }}} -> (0.000s) +Debug: run 113 {{{ + +Debug: + rid:4 step:113 gid:252 user:curgoal = = + X48^5 = [c2, c3, c4] + +Debug: + rid:4 step:113 gid:252 user:rule = eq + +Debug: + rid:4 step:113 gid:252 user:rule:builtin:name = = + +Debug: + rid:4 step:113 gid:0 user:assign = X48^5 := [c2, c3, c4] + +Debug: + rid:4 step:113 gid:252 user:rule:eq = success + +Debug: }}} -> (0.000s) +Debug: run 114 {{{ + +Debug: + rid:4 step:114 gid:248 user:curgoal = ! + ! + +Debug: }}} -> (0.000s) +Debug: + rid:4 step:114 gid:248 user:rule = cut + +Debug: + rid:4 step:114 gid:0 user:rule:cut:branch = 230 + File "/build/reproducible-path/coq-elpi-2.5.0/elpi/coq-elaborator.elpi", line 7, column 0, characters 296-388: + (evar A1 A2 A0) :- (var A0), + (!), (of A1 A2 A0). + +Debug: + rid:4 step:114 gid:0 user:rule:cut:branch = 230 + File "/build/reproducible-path/coq-elpi-2.5.0/elpi/coq-elaborator.elpi", line 11, column 0, characters 391-621: + (evar A2 A1 A0) :- (not (var A0)), + (same_term A1 (sort prop)), + (coq.version _ 8 17 _), (!), + (hack-8-17.propagate-Prop-constraint-inward + A0), + (coq.typecheck A0 A1 ok), + (A2 = A0). + +Debug: + rid:4 step:114 gid:0 user:rule:cut:branch = 230 + File "/build/reproducible-path/coq-elpi-2.5.0/elpi/coq-elaborator.elpi", line 16, column 0, characters 624-744: + (evar A2 A1 A0) :- (not (var A0)), + (!), (coq.typecheck A0 A1 ok), + (A2 = A0). + +Debug: + rid:4 step:114 gid:0 user:rule:cut:branch = 230 + File "coq-builtin.elpi", line 304, column 0, characters 12189-12227: + (evar _ _ _) :- . + +Debug: + rid:4 step:114 gid:248 user:rule:cut = success + +Debug: run 115 {{{ + +Debug: + rid:4 step:115 gid:249 user:curgoal = prune + prune + (app + [global (indt «eq»), + global (indt «nat»), c2, + app + [global (const «Nat.add»), + app + [global (const «Nat.add»), + app + [global (indc «S»), + global (indc «O»)], c4], c3]]) + [c2, c3, c4] + +Debug: + rid:4 step:115 gid:249 user:rule = builtin + +Debug: + rid:4 step:115 gid:249 user:rule:builtin:name = prune + +Debug: + rid:4 step:115 gid:249 user:rule:builtin = success + +Debug: + rid:4 step:115 gid:249 user:subgoal = 253 + +Debug: + rid:4 step:115 gid:253 user:newgoal = app + [global (indt «eq»), + global (indt «nat»), c2, + app + [global (const «Nat.add»), + app + [global (const «Nat.add»), + app + [global (indc «S»), + global (indc «O»)], c4], c3]] + = X49 c2 c3 c4 + +Debug: }}} -> (0.001s) +Debug: run 116 {{{ + +Debug: + rid:4 step:116 gid:253 user:curgoal = = + app + [global (indt «eq»), + global (indt «nat»), c2, + app + [global (const «Nat.add»), + app + [global (const «Nat.add»), + app + [global (indc «S»), + global (indc «O»)], c4], c3]] + = X49 c2 c3 c4 + +Debug: + rid:4 step:116 gid:253 user:rule = eq + +Debug: + rid:4 step:116 gid:253 user:rule:builtin:name = = + +Debug: + rid:4 step:116 gid:0 user:assign:HO = X49 := c0 \ + c1 \ + c2 \ + app + [global (indt «eq»), + global (indt «nat»), c0, + app + [global (const «Nat.add»), + app + [global (const «Nat.add»), + app + [global (indc «S»), + global (indc «O»)], c2], c1]] + +Debug: + rid:4 step:116 gid:253 user:rule:eq = success + +Debug: }}} -> (0.001s) +Debug: run 117 {{{ + +Debug: + rid:4 step:117 gid:250 user:curgoal = prune + prune (X45 c2 c3 c4) [c2, c3, c4] + +Debug: + rid:4 step:117 gid:250 user:rule = builtin + +Debug: + rid:4 step:117 gid:250 user:rule:builtin:name = prune + +Debug: + rid:4 step:117 gid:250 user:rule:builtin = success + +Debug: + rid:4 step:117 gid:250 user:subgoal = 254 + +Debug: + rid:4 step:117 gid:254 user:newgoal = X45 c2 c3 c4 = X50 c2 c3 c4 + +Debug: }}} -> (0.001s) +Debug: run 118 {{{ + +Debug: + rid:4 step:118 gid:254 user:curgoal = = + X45 c2 c3 c4 = X50 c2 c3 c4 + +Debug: + rid:4 step:118 gid:254 user:rule = eq + +Debug: + rid:4 step:118 gid:254 user:rule:builtin:name = = + +Debug: + rid:4 step:118 gid:0 user:assign:HO = X45 := c0 \ + c1 \ + c2 \ + X50 c0 c1 c2 + +Debug: + rid:4 step:118 gid:254 user:rule:eq = success + +Debug: }}} -> (0.000s) +Debug: run 119 {{{ + +Debug: + rid:4 step:119 gid:251 user:curgoal = declare_constraint + declare_constraint + (evar (X50 c2 c3 c4) + (app + [global (indt «eq»), + global (indt «nat»), c2, + app + [global (const «Nat.add»), + app + [global (const «Nat.add»), + app + [global (indc «S»), + global (indc «O»)], c4], + c3]]) (X46 c2 c3 c4)) + [X50 c2 c3 c4, X46 c2 c3 c4] + +Debug: + rid:4 step:119 gid:251 user:rule = builtin + +Debug: + rid:4 step:119 gid:251 user:rule:builtin:name = declare_constraint + +Debug: + rid:4 step:119 gid:251 user:subgoal = 255 + +Debug: + rid:4 step:119 gid:255 user:newgoal = evar (X50 c2 c3 c4) + (app + [global (indt «eq»), + global (indt «nat»), c2, + app + [global (const «Nat.add»), + app + [global (const «Nat.add»), + app + [global (indc «S»), + global (indc «O»)], c4], c3]]) + (X46 c2 c3 c4) + +Debug: + rid:4 step:119 gid:251 user:rule:builtin = success + +Debug: }}} -> (0.001s) +Debug: run 120 {{{ + +Debug: + rid:4 step:120 gid:246 user:curgoal = std.append + std.append [] [] X47 + +Debug: + rid:4 step:120 gid:246 user:rule = backchain + +Debug: + rid:4 step:120 gid:246 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 87, column 0, characters 2841-2854: + +Debug: }}} -> (0.000s) +Debug: select 57 {{{ + +Debug: + rid:4 step:120 gid:246 user:rule:backchain:try = File "builtin_stdlib.elpi", line 87, column 0, characters 2841-2854: + (std.append [] A0 A0) :- . + +Debug: + rid:4 step:120 gid:0 user:assign = A0 := [] + +Debug: + rid:4 step:120 gid:0 user:assign = X47 := [] + +Debug: + rid:4 step:120 gid:246 user:rule:backchain = success + +Debug: }}} -> (0.000s) +w + : nat +File "./tests/test_tactic.v", line 5, characters 28-32: +Warning: +File "./tests/test_tactic.v", line 5, characters 28-32 +Type is linear: name it _Type (discard) or Type_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +hello1 +Foo.x = 3 + : nat +Foo.x = 3 + : nat +Foo.x2 = 4 + : nat +eq_refl : Foo.x = 5 + : Foo.x = 5 +A.B.c : nat + +A.B.c is not universe polymorphic +A.B.c is transparent +Expands to: Constant elpi.apps.NES.tests.test_NES.A_aux_4.A.B.c +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 +test1 +str hello +str x +test1 +too many arguments +[attribute elpi.loc + (leaf-loc + File "./tests/test_vernacular2.v", line 10, column 24, characters 326-329:), + attribute elpi.phase (leaf-str interp), + attribute fwd_compat_attr (leaf-str )] +[attribute elpi.loc + (leaf-loc + File "./tests/test_vernacular2.v", line 11, column 0, characters 331-354:), + attribute elpi.phase (leaf-str interp), + attribute fwd_compat_attr (leaf-str )] +File "./tests/test_vernacular2.v", line 6, characters 2-17: +Warning: This command does not support this attribute: fwd_compat_attr. +[unsupported-attributes,parsing,default] +File "./tests/test_vernacular2.v", line 7, characters 2-17: +Warning: This command does not support this attribute: fwd_compat_attr. +[unsupported-attributes,parsing,default] +File "./tests/test_vernacular2.v", line 8, characters 2-17: +Warning: This command does not support this attribute: fwd_compat_attr. +[unsupported-attributes,parsing,default] +File "./tests/test_vernacular2.v", line 9, characters 2-17: +Warning: This command does not support this attribute: fwd_compat_attr. +[unsupported-attributes,parsing,default] +File "./tests/test_vernacular2.v", line 10, characters 2-17: +Warning: This command does not support this attribute: fwd_compat_attr. +[unsupported-attributes,parsing,default] +This.Is.A.Long.Namespace.stuff = 1 + : nat + = 1 + : nat +This.Is.A.Long.Namespace.stuff = 2 + : nat + = 1 + : nat +This_aux_1.This.Is.A.Long.Namespace.stuff +This.Is.A.Long.Namespace.more_stuff +This.Is.A.Long.Namespace.stuff +This_aux_1.This.Is.A.Long.Namespace.stuff : nat +This.Is.A.Long.Namespace.more_stuff : nat +This.Is.A.Long.Namespace.stuff : nat +stuff = 2 + : nat +default nat_def : nat + : nat +it = elpi_subproof + : True +it : True + +it is not universe polymorphic +it is transparent +Expands to: Constant elpi.tests.test_ltac.it +elpi_subproof = I + : True +elpi_subproof : True + +elpi_subproof is not universe polymorphic +elpi_subproof is opaque +Expands to: Constant elpi.tests.test_ltac.elpi_subproof +Closed under the global context +Debug: run 1 {{{ + +Debug: + rid:0 step:1 gid:4 user:curgoal = => + attributes + [attribute elpi.loc + (leaf-loc + File "./examples/example_record_expansion.v", line 221, column 5, characters 9572-9585:), + attribute elpi.phase (leaf-str interp)] + => + (main-interp + [str r, str f, str expanded_] _ ; + main [str r, str f, str expanded_]) + +Debug: + rid:0 step:1 gid:4 user:rule = implication + +Debug: + rid:0 step:1 gid:4 user:subgoal = 5 + +Debug: + rid:0 step:1 gid:5 user:newgoal = main-interp [str r, str f, str expanded_] _ + ; main [str r, str f, str expanded_] + +Debug: + rid:0 step:1 gid:5 user:rule:implication = success + +Debug: }}} -> (0.001s) +Debug: run 2 {{{ + +Debug: + rid:0 step:2 gid:5 user:curgoal = ; + main-interp [str r, str f, str expanded_] _ + ; main [str r, str f, str expanded_] + +Debug: + rid:0 step:2 gid:5 user:rule = backchain + +Debug: + rid:0 step:2 gid:5 user:rule:backchain:candidates = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: + File "elpi-builtin.elpi", line 36, column 0, characters 388-400: + +Debug: }}} -> (0.000s) +Debug: select 3 {{{ + +Debug: + rid:0 step:2 gid:5 user:rule:backchain:try = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: + (A0 ; _) :- A0. + +Debug: + rid:0 step:2 gid:0 user:assign = A0 := main-interp + [str r, str f, str expanded_] _ + +Debug: + rid:0 step:2 gid:5 user:subgoal = 6 + +Debug: + rid:0 step:2 gid:6 user:newgoal = main-interp [str r, str f, str expanded_] _ + +Debug: + rid:0 step:2 gid:6 user:rule:backchain = success + +Debug: }}} -> (0.017s) +Debug: run 3 {{{ + +Debug: + rid:0 step:3 gid:6 user:curgoal = main-interp + main-interp [str r, str f, str expanded_] _ + +Debug: + rid:0 step:3 gid:6 user:rule = backchain + +Debug: rid:0 step:3 gid:6 user:rule:backchain:candidates = +Debug: }}} -> (0.000s) +Debug: select 4 {{{ + +Debug: + rid:0 step:3 gid:6 user:rule:backchain = fail + +Debug: }}} -> (0.000s) +Debug: run 4 {{{ + +Debug: + rid:0 step:4 gid:5 user:curgoal = ; + main-interp [str r, str f, str expanded_] _ + ; main [str r, str f, str expanded_] + +Debug: + rid:0 step:4 gid:5 user:rule = backchain + +Debug: + rid:0 step:4 gid:5 user:rule:backchain:candidates = File "elpi-builtin.elpi", line 36, column 0, characters 388-400: + +Debug: }}} -> (0.000s) +Debug: select 5 {{{ + +Debug: + rid:0 step:4 gid:5 user:rule:backchain:try = File "elpi-builtin.elpi", line 36, column 0, characters 388-400: + (_ ; A0) :- A0. + +Debug: + rid:0 step:4 gid:0 user:assign = A0 := main [str r, str f, str expanded_] + +Debug: + rid:0 step:4 gid:5 user:subgoal = 7 + +Debug: + rid:0 step:4 gid:7 user:newgoal = main [str r, str f, str expanded_] + +Debug: + rid:0 step:4 gid:7 user:rule:backchain = success + +Debug: }}} -> (0.001s) +Debug: run 5 {{{ + +Debug: + rid:0 step:5 gid:7 user:curgoal = main + main [str r, str f, str expanded_] + +Debug: + rid:0 step:5 gid:7 user:rule = backchain + +Debug: + rid:0 step:5 gid:7 user:rule:backchain:candidates = File "./examples/example_record_expansion.v", line 197, column 0, characters 8773-9225: + File "./examples/example_record_expansion.v", line 207, column 0, characters 9228-9306: + +Debug: }}} -> (0.000s) +Debug: select 6 {{{ + +Debug: + rid:0 step:5 gid:7 user:rule:backchain:try = File "./examples/example_record_expansion.v", line 197, column 0, characters 8773-9225: + (main [str A0, str A2, str A6]) :- (!), + (std.assert! + (coq.locate A0 (indt A1)) + The first argument must be a record name), + (std.assert! + (coq.locate A2 A3) + The second argument must be a global term), + (coq.gref->id A3 A4), + (A5 is A6 ^ A4), + (expand-gref A1 A3 A5 A7), + (coq.elpi.accumulate _ + record.expand.db + (clause _ + (before expand:start) A7)). + +Debug: + rid:0 step:5 gid:0 user:assign = A0 := r + +Debug: + rid:0 step:5 gid:0 user:assign = A2 := f + +Debug: + rid:0 step:5 gid:0 user:assign = A6 := expanded_ + +Debug: + rid:0 step:5 gid:7 user:subgoal = 8 + +Debug: + rid:0 step:5 gid:8 user:newgoal = ! + +Debug: + rid:0 step:5 gid:8 user:subgoal = 9 + +Debug: + rid:0 step:5 gid:9 user:newgoal = std.assert! (coq.locate r (indt X0)) + The first argument must be a record name + +Debug: + rid:0 step:5 gid:8 user:subgoal = 10 + +Debug: + rid:0 step:5 gid:10 user:newgoal = std.assert! (coq.locate f X1) + The second argument must be a global term + +Debug: + rid:0 step:5 gid:8 user:subgoal = 11 + +Debug: + rid:0 step:5 gid:11 user:newgoal = coq.gref->id X1 X2 + +Debug: + rid:0 step:5 gid:8 user:subgoal = 12 + +Debug: + rid:0 step:5 gid:12 user:newgoal = X3 is expanded_ ^ X2 + +Debug: + rid:0 step:5 gid:8 user:subgoal = 13 + +Debug: + rid:0 step:5 gid:13 user:newgoal = expand-gref X0 X1 X3 X4 + +Debug: + rid:0 step:5 gid:8 user:subgoal = 14 + +Debug: + rid:0 step:5 gid:14 user:newgoal = coq.elpi.accumulate _ record.expand.db + (clause _ (before expand:start) X4) + +Debug: + rid:0 step:5 gid:8 user:rule:backchain = success + +Debug: }}} -> (0.046s) +Debug: run 6 {{{ + +Debug: + rid:0 step:6 gid:8 user:curgoal = ! + ! + +Debug: }}} -> (0.000s) +Debug: + rid:0 step:6 gid:8 user:rule = cut + +Debug: + rid:0 step:6 gid:0 user:rule:cut:branch = 7 + File "./examples/example_record_expansion.v", line 207, column 0, characters 9228-9306: + (main _) :- (coq.error + usage: Elpi record.expand record_name global_term prefix). + +Debug: + rid:0 step:6 gid:8 user:rule:cut = success + +Debug: run 7 {{{ + +Debug: + rid:0 step:7 gid:9 user:curgoal = std.assert! + std.assert! (coq.locate r (indt X0)) + The first argument must be a record name + +Debug: + rid:0 step:7 gid:9 user:rule = backchain + +Debug: + rid:0 step:7 gid:9 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 39, column 0, characters 1190-1249: + +Debug: }}} -> (0.000s) +Debug: select 7 {{{ + +Debug: + rid:0 step:7 gid:9 user:rule:backchain:try = File "builtin_stdlib.elpi", line 39, column 0, characters 1190-1249: + (std.assert! A0 A1) :- ( + A0 ; + std.fatal-error-w-data A1 A0), + (!). + +Debug: + rid:0 step:7 gid:0 user:assign = A0 := coq.locate r (indt X0) + +Debug: + rid:0 step:7 gid:0 user:assign = A1 := The first argument must be a record name + +Debug: + rid:0 step:7 gid:9 user:subgoal = 15 + +Debug: + rid:0 step:7 gid:15 user:newgoal = coq.locate r (indt X0) ; + std.fatal-error-w-data + The first argument must be a record name + (coq.locate r (indt X0)) + +Debug: + rid:0 step:7 gid:15 user:subgoal = 16 + +Debug: + rid:0 step:7 gid:16 user:newgoal = ! + +Debug: + rid:0 step:7 gid:15 user:rule:backchain = success + +Debug: }}} -> (0.001s) +Debug: run 8 {{{ + +Debug: + rid:0 step:8 gid:15 user:curgoal = ; + coq.locate r (indt X0) ; + std.fatal-error-w-data + The first argument must be a record name + (coq.locate r (indt X0)) + +Debug: + rid:0 step:8 gid:15 user:rule = backchain + +Debug: + rid:0 step:8 gid:15 user:rule:backchain:candidates = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: + File "elpi-builtin.elpi", line 36, column 0, characters 388-400: + +Debug: }}} -> (0.000s) +Debug: select 8 {{{ + +Debug: + rid:0 step:8 gid:15 user:rule:backchain:try = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: + (A0 ; _) :- A0. + +Debug: + rid:0 step:8 gid:0 user:assign = A0 := coq.locate r (indt X0) + +Debug: + rid:0 step:8 gid:15 user:subgoal = 17 + +Debug: + rid:0 step:8 gid:17 user:newgoal = coq.locate r (indt X0) + +Debug: + rid:0 step:8 gid:17 user:rule:backchain = success + +Debug: }}} -> (0.000s) +Debug: run 9 {{{ + +Debug: + rid:0 step:9 gid:17 user:curgoal = coq.locate + coq.locate r (indt X0) + +Debug: + rid:0 step:9 gid:17 user:rule = builtin + +Debug: + rid:0 step:9 gid:17 user:rule:builtin:name = coq.locate + +Debug: + rid:0 step:9 gid:17 user:rule:builtin = success + +Debug: + rid:0 step:9 gid:17 user:subgoal = 18 + +Debug: + rid:0 step:9 gid:18 user:newgoal = indt X0 = indt «r» + +Debug: }}} -> (0.000s) +Debug: run 10 {{{ + +Debug: + rid:0 step:10 gid:18 user:curgoal = = + indt X0 = indt «r» + +Debug: + rid:0 step:10 gid:18 user:rule = eq + +Debug: + rid:0 step:10 gid:18 user:rule:builtin:name = = + +Debug: + rid:0 step:10 gid:0 user:assign = X0 := «r» + +Debug: + rid:0 step:10 gid:18 user:rule:eq = success + +Debug: }}} -> (0.000s) +Debug: run 11 {{{ + +Debug: + rid:0 step:11 gid:16 user:curgoal = ! + ! + +Debug: }}} -> (0.000s) +Debug: + rid:0 step:11 gid:16 user:rule = cut + +Debug: + rid:0 step:11 gid:0 user:rule:cut:branch = 15 + File "elpi-builtin.elpi", line 36, column 0, characters 388-400: + (_ ; A0) :- A0. + +Debug: + rid:0 step:11 gid:16 user:rule:cut = success + +Debug: run 12 {{{ + +Debug: + rid:0 step:12 gid:10 user:curgoal = std.assert! + std.assert! (coq.locate f X1) + The second argument must be a global term + +Debug: + rid:0 step:12 gid:10 user:rule = backchain + +Debug: + rid:0 step:12 gid:10 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 39, column 0, characters 1190-1249: + +Debug: }}} -> (0.000s) +Debug: select 9 {{{ + +Debug: + rid:0 step:12 gid:10 user:rule:backchain:try = File "builtin_stdlib.elpi", line 39, column 0, characters 1190-1249: + (std.assert! A0 A1) :- ( + A0 ; + std.fatal-error-w-data A1 A0), + (!). + +Debug: + rid:0 step:12 gid:0 user:assign = A0 := coq.locate f X1 + +Debug: + rid:0 step:12 gid:0 user:assign = A1 := The second argument must be a global term + +Debug: + rid:0 step:12 gid:10 user:subgoal = 19 + +Debug: + rid:0 step:12 gid:19 user:newgoal = coq.locate f X1 ; + std.fatal-error-w-data + The second argument must be a global term + (coq.locate f X1) + +Debug: + rid:0 step:12 gid:19 user:subgoal = 20 + +Debug: + rid:0 step:12 gid:20 user:newgoal = ! + +Debug: + rid:0 step:12 gid:19 user:rule:backchain = success + +Debug: }}} -> (0.001s) +Debug: run 13 {{{ + +Debug: + rid:0 step:13 gid:19 user:curgoal = ; + coq.locate f X1 ; + std.fatal-error-w-data + The second argument must be a global term + (coq.locate f X1) + +Debug: + rid:0 step:13 gid:19 user:rule = backchain + +Debug: + rid:0 step:13 gid:19 user:rule:backchain:candidates = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: + File "elpi-builtin.elpi", line 36, column 0, characters 388-400: + +Debug: }}} -> (0.000s) +Debug: select 10 {{{ + +Debug: + rid:0 step:13 gid:19 user:rule:backchain:try = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: + (A0 ; _) :- A0. + +Debug: + rid:0 step:13 gid:0 user:assign = A0 := coq.locate f X1 + +Debug: + rid:0 step:13 gid:19 user:subgoal = 21 + +Debug: + rid:0 step:13 gid:21 user:newgoal = coq.locate f X1 + +Debug: + rid:0 step:13 gid:21 user:rule:backchain = success + +Debug: }}} -> (0.000s) +Debug: run 14 {{{ + +Debug: + rid:0 step:14 gid:21 user:curgoal = coq.locate + coq.locate f X1 + +Debug: + rid:0 step:14 gid:21 user:rule = builtin + +Debug: + rid:0 step:14 gid:21 user:rule:builtin:name = coq.locate + +Debug: + rid:0 step:14 gid:21 user:rule:builtin = success + +Debug: + rid:0 step:14 gid:21 user:subgoal = 22 + +Debug: + rid:0 step:14 gid:22 user:newgoal = X1 = const «f» + +Debug: }}} -> (0.000s) +Debug: run 15 {{{ + +Debug: + rid:0 step:15 gid:22 user:curgoal = = + X1 = const «f» + +Debug: + rid:0 step:15 gid:22 user:rule = eq + +Debug: + rid:0 step:15 gid:22 user:rule:builtin:name = = + +Debug: + rid:0 step:15 gid:0 user:assign = X1 := const «f» + +Debug: + rid:0 step:15 gid:22 user:rule:eq = success + +Debug: }}} -> (0.000s) +Debug: run 16 {{{ + +Debug: + rid:0 step:16 gid:20 user:curgoal = ! + ! + +Debug: }}} -> (0.000s) +Debug: + rid:0 step:16 gid:20 user:rule = cut + +Debug: + rid:0 step:16 gid:0 user:rule:cut:branch = 19 + File "elpi-builtin.elpi", line 36, column 0, characters 388-400: + (_ ; A0) :- A0. + +Debug: + rid:0 step:16 gid:20 user:rule:cut = success + +Debug: run 17 {{{ + +Debug: + rid:0 step:17 gid:11 user:curgoal = coq.gref->id + coq.gref->id (const «f») X2 + +Debug: + rid:0 step:17 gid:11 user:rule = builtin + +Debug: + rid:0 step:17 gid:11 user:rule:builtin:name = coq.gref->id + +Debug: + rid:0 step:17 gid:11 user:rule:builtin = success + +Debug: + rid:0 step:17 gid:11 user:subgoal = 23 + +Debug: + rid:0 step:17 gid:23 user:newgoal = X2 = f + +Debug: }}} -> (0.000s) +Debug: run 18 {{{ + +Debug: + rid:0 step:18 gid:23 user:curgoal = = + X2 = f + +Debug: + rid:0 step:18 gid:23 user:rule = eq + +Debug: + rid:0 step:18 gid:23 user:rule:builtin:name = = + +Debug: + rid:0 step:18 gid:0 user:assign = X2 := f + +Debug: + rid:0 step:18 gid:23 user:rule:eq = success + +Debug: }}} -> (0.000s) +Debug: run 19 {{{ + +Debug: + rid:0 step:19 gid:12 user:curgoal = is + X3 is expanded_ ^ f + +Debug: + rid:0 step:19 gid:12 user:rule = backchain + +Debug: + rid:0 step:19 gid:12 user:rule:backchain:candidates = File "elpi-builtin.elpi", line 83, column 0, characters 1181-1199: + +Debug: }}} -> (0.000s) +Debug: select 11 {{{ + +Debug: + rid:0 step:19 gid:12 user:rule:backchain:try = File "elpi-builtin.elpi", line 83, column 0, characters 1181-1199: + (A1 is A0) :- (calc A0 A1). + +Debug: + rid:0 step:19 gid:0 user:assign = A1 := X3 + +Debug: + rid:0 step:19 gid:0 user:assign = A0 := expanded_ ^ f + +Debug: + rid:0 step:19 gid:12 user:subgoal = 24 + +Debug: + rid:0 step:19 gid:24 user:newgoal = calc (expanded_ ^ f) X3 + +Debug: + rid:0 step:19 gid:24 user:rule:backchain = success + +Debug: }}} -> (0.021s) +Debug: run 20 {{{ + +Debug: + rid:0 step:20 gid:24 user:curgoal = calc + calc (expanded_ ^ f) X3 + +Debug: + rid:0 step:20 gid:24 user:rule = builtin + +Debug: + rid:0 step:20 gid:24 user:rule:builtin:name = calc + +Debug: + rid:0 step:20 gid:24 user:rule:builtin = success + +Debug: + rid:0 step:20 gid:24 user:subgoal = 25 + +Debug: + rid:0 step:20 gid:25 user:newgoal = X3 = expanded_f + +Debug: }}} -> (0.002s) +Debug: run 21 {{{ + +Debug: + rid:0 step:21 gid:25 user:curgoal = = + X3 = expanded_f + +Debug: + rid:0 step:21 gid:25 user:rule = eq + +Debug: + rid:0 step:21 gid:25 user:rule:builtin:name = = + +Debug: + rid:0 step:21 gid:0 user:assign = X3 := expanded_f + +Debug: + rid:0 step:21 gid:25 user:rule:eq = success + +Debug: }}} -> (0.000s) +Debug: run 22 {{{ + +Debug: + rid:0 step:22 gid:13 user:curgoal = expand-gref + expand-gref «r» (const «f») + expanded_f X4 + +Debug: + rid:0 step:22 gid:13 user:rule = backchain + +Debug: + rid:0 step:22 gid:13 user:rule:backchain:candidates = File "./examples/example_record_expansion.v", line 184, column 0, characters 8165-8504: + File "./examples/example_record_expansion.v", line 192, column 0, characters 8507-8568: + File "./examples/example_record_expansion.v", line 194, column 0, characters 8571-8690: + +Debug: }}} -> (0.000s) +Debug: select 12 {{{ + +Debug: + rid:0 step:22 gid:13 user:rule:backchain:try = File "./examples/example_record_expansion.v", line 184, column 0, characters 8165-8504: + (expand-gref A2 (const A0) A5 + A7) :- (!), + (std.do! + [std.assert! + (coq.env.const A0 + (some A1) _) + only transparent constants can be expanded, + pi (c0 \ + (expand-record A2 + (const A0) c0 A1 A3 + (A4 c0))), + std.assert-ok! + (coq.typecheck A3 _) + illtyped, + coq.env.add-const A5 A3 _ + _ A6, A7 = A4 (const A6)]). + +Debug: + rid:0 step:22 gid:0 user:assign = A2 := «r» + +Debug: + rid:0 step:22 gid:0 user:assign = A0 := «f» + +Debug: + rid:0 step:22 gid:0 user:assign = A5 := expanded_f + +Debug: + rid:0 step:22 gid:0 user:assign = A7 := X4 + +Debug: + rid:0 step:22 gid:13 user:subgoal = 26 + +Debug: + rid:0 step:22 gid:26 user:newgoal = ! + +Debug: + rid:0 step:22 gid:26 user:subgoal = 27 + +Debug: + rid:0 step:22 gid:27 user:newgoal = std.do! + [std.assert! + (coq.env.const «f» (some X5) _) + only transparent constants can be expanded, + pi c0 \ + expand-record «r» (const «f») c0 + X5 X6 (X7 c0), + std.assert-ok! (coq.typecheck X6 _) + illtyped, + coq.env.add-const expanded_f X6 _ _ X8, + X4 = X7 (const X8)] + +Debug: + rid:0 step:22 gid:26 user:rule:backchain = success + +Debug: }}} -> (0.001s) +Debug: run 23 {{{ + +Debug: + rid:0 step:23 gid:26 user:curgoal = ! + ! + +Debug: }}} -> (0.000s) +Debug: + rid:0 step:23 gid:26 user:rule = cut + +Debug: + rid:0 step:23 gid:0 user:rule:cut:branch = 13 + File "./examples/example_record_expansion.v", line 192, column 0, characters 8507-8568: + (expand-gref _ (indt _) _ _) :- ( + coq.error Not implemented yet). + +Debug: + rid:0 step:23 gid:0 user:rule:cut:branch = 13 + File "./examples/example_record_expansion.v", line 194, column 0, characters 8571-8690: + (expand-gref _ (indc _) _ _) :- ( + coq.error + It makes no sense to expand a constructor alone, expand the inductive instead). + +Debug: + rid:0 step:23 gid:26 user:rule:cut = success + +Debug: run 24 {{{ + +Debug: + rid:0 step:24 gid:27 user:curgoal = std.do! + std.do! + [std.assert! + (coq.env.const «f» (some X5) _) + only transparent constants can be expanded, + pi c0 \ + expand-record «r» (const «f») c0 + X5 X6 (X7 c0), + std.assert-ok! (coq.typecheck X6 _) + illtyped, + coq.env.add-const expanded_f X6 _ _ X8, + X4 = X7 (const X8)] + +Debug: + rid:0 step:24 gid:27 user:rule = backchain + +Debug: + rid:0 step:24 gid:27 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 279, column 0, characters 9290-9316: + +Debug: }}} -> (0.000s) +Debug: select 13 {{{ + +Debug: + rid:0 step:24 gid:27 user:rule:backchain:try = File "builtin_stdlib.elpi", line 279, column 0, characters 9290-9316: + (std.do! [A0 | A1]) :- A0, + (!), (std.do! A1). + +Debug: + rid:0 step:24 gid:0 user:assign = A0 := std.assert! + (coq.env.const «f» (some X5) _) + only transparent constants can be expanded + +Debug: + rid:0 step:24 gid:0 user:assign = A1 := [pi c0 \ + expand-record «r» (const «f») + c0 X5 X6 (X7 c0), + std.assert-ok! (coq.typecheck X6 _) + illtyped, + coq.env.add-const expanded_f X6 _ _ + X8, X4 = X7 (const X8)] + +Debug: + rid:0 step:24 gid:27 user:subgoal = 28 + +Debug: + rid:0 step:24 gid:28 user:newgoal = std.assert! + (coq.env.const «f» (some X5) _) + only transparent constants can be expanded + +Debug: + rid:0 step:24 gid:28 user:subgoal = 29 + +Debug: + rid:0 step:24 gid:29 user:newgoal = ! + +Debug: + rid:0 step:24 gid:28 user:subgoal = 30 + +Debug: + rid:0 step:24 gid:30 user:newgoal = std.do! + [pi c0 \ + expand-record «r» (const «f») c0 + X5 X6 (X7 c0), + std.assert-ok! (coq.typecheck X6 _) + illtyped, + coq.env.add-const expanded_f X6 _ _ X8, + X4 = X7 (const X8)] + +Debug: + rid:0 step:24 gid:28 user:rule:backchain = success + +Debug: }}} -> (0.021s) +Debug: run 25 {{{ + +Debug: + rid:0 step:25 gid:28 user:curgoal = std.assert! + std.assert! + (coq.env.const «f» (some X5) _) + only transparent constants can be expanded + +Debug: + rid:0 step:25 gid:28 user:rule = backchain + +Debug: + rid:0 step:25 gid:28 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 39, column 0, characters 1190-1249: + +Debug: }}} -> (0.000s) +Debug: select 14 {{{ + +Debug: + rid:0 step:25 gid:28 user:rule:backchain:try = File "builtin_stdlib.elpi", line 39, column 0, characters 1190-1249: + (std.assert! A0 A1) :- ( + A0 ; + std.fatal-error-w-data A1 A0), + (!). + +Debug: + rid:0 step:25 gid:0 user:assign = A0 := coq.env.const «f» (some X5) _ + +Debug: + rid:0 step:25 gid:0 user:assign = A1 := only transparent constants can be expanded + Debug: - rid:4 step:105 gid:244 user:rule:builtin:name = occurs - + rid:0 step:25 gid:28 user:subgoal = 31 + Debug: - rid:4 step:105 gid:244 user:rule:builtin = fail + rid:0 step:25 gid:31 user:newgoal = coq.env.const «f» (some X5) _ ; + std.fatal-error-w-data + only transparent constants can be expanded + (coq.env.const «f» (some X5) _) + +Debug: + rid:0 step:25 gid:31 user:subgoal = 32 + +Debug: + rid:0 step:25 gid:32 user:newgoal = ! + +Debug: + rid:0 step:25 gid:31 user:rule:backchain = success -Debug: }}} -> (0.000s) -Debug: run 106 {{{ - +Debug: }}} -> (0.001s) +Debug: run 26 {{{ + Debug: - rid:4 step:106 gid:157 user:curgoal = coq.ltac.private.distribute-nabla - coq.ltac.private.distribute-nabla (c0 \ - [nabla c1 \ - nabla c2 \ - nabla c3 \ - seal - (goal - [decl c3 `w` - (global (indt «nat»)), - decl c2 `z` - (global (indt «nat»)), - decl c1 `x` - (global (indt «nat»))] - (X26 c1 c2 c3) - (app - [global (indt «eq»), - global (indt «nat»), c1, - app - [global (const «Nat.add»), - app - [global - (const «Nat.add»), - app - [global (indc «S»), - global (indc «O»)], - c3], c2]]) - (X22 c1 c2 c3) [])]) X7 - + rid:0 step:26 gid:31 user:curgoal = ; + coq.env.const «f» (some X5) _ ; + std.fatal-error-w-data + only transparent constants can be expanded + (coq.env.const «f» (some X5) _) + Debug: - rid:4 step:106 gid:157 user:rule = backchain - + rid:0 step:26 gid:31 user:rule = backchain + Debug: - rid:4 step:106 gid:157 user:rule:backchain:candidates = File "/build/reproducible-path/coq-elpi-2.5.0/elpi/elpi-ltac.elpi", line 119, column 0, characters 4642-4704: - + rid:0 step:26 gid:31 user:rule:backchain:candidates = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: + File "elpi-builtin.elpi", line 36, column 0, characters 388-400: + Debug: }}} -> (0.000s) -Debug: select 52 {{{ +Debug: select 15 {{{ Debug: - rid:4 step:106 gid:157 user:rule:backchain:try = File "/build/reproducible-path/coq-elpi-2.5.0/elpi/elpi-ltac.elpi", line 119, column 0, characters 4642-4704: - (coq.ltac.private.distribute-nabla - (c0 \ [A2 | (A0 c0)]) - [A2 | A1]) :- (coq.ltac.private.distribute-nabla - A0 A1). - + rid:0 step:26 gid:31 user:rule:backchain:try = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: + (A0 ; _) :- A0. + Debug: - rid:4 step:106 gid:0 user:assign = A2 := nabla c0 \ - nabla c1 \ - nabla c2 \ - seal - (goal - [decl c2 `w` - (global (indt «nat»)), - decl c1 `z` - (global (indt «nat»)), - decl c0 `x` - (global (indt «nat»))] - (X26 c0 c1 c2) - (app - [global (indt «eq»), - global (indt «nat»), c0, - app - [global - (const «Nat.add»), - app - [global - (const «Nat.add»), - app - [global (indc «S»), - global (indc «O»)], - c2], c1]]) - (X22 c0 c1 c2) []) - + rid:0 step:26 gid:0 user:assign = A0 := coq.env.const «f» (some X5) _ + Debug: - rid:4 step:106 gid:0 user:assign:simplify:stack:arg = A0 := X43 - + rid:0 step:26 gid:31 user:subgoal = 33 + Debug: - rid:4 step:106 gid:0 user:assign:HO = X43 := c0 \ - [] - + rid:0 step:26 gid:33 user:newgoal = coq.env.const «f» (some X5) _ + Debug: - rid:4 step:106 gid:0 user:assign = X7 := [nabla c0 \ - nabla c1 \ - nabla c2 \ - seal - (goal - [decl c2 `w` - (global (indt «nat»)), - decl c1 `z` - (global (indt «nat»)), - decl c0 `x` - (global (indt «nat»))] - (X26 c0 c1 c2) + rid:0 step:26 gid:33 user:rule:backchain = success + +Debug: }}} -> (0.000s) +Debug: run 27 {{{ + +Debug: + rid:0 step:27 gid:33 user:curgoal = coq.env.const + coq.env.const «f» (some X5) _ + +Debug: + rid:0 step:27 gid:33 user:rule = builtin + +Debug: + rid:0 step:27 gid:33 user:rule:builtin:name = coq.env.const + +Debug: + rid:0 step:27 gid:33 user:rule:builtin = success + +Debug: + rid:0 step:27 gid:33 user:subgoal = 34 + +Debug: + rid:0 step:27 gid:34 user:newgoal = some X5 = + some + (fun `b` (global (indt «bool»)) c0 \ + fun `t` (global (indt «r»)) c1 \ + let `q` (global (indt «bool»)) + (app [global (const «negb»), c0]) + c2 \ + fix `rec` 0 + (prod `l1` + (app + [global (indt «list»), + app + [global (const «T»), c1]]) + c3 \ + prod `l2` + (app + [global (indt «list»), + app + [global (const «T»), c1]]) + c4 \ global (indt «bool»)) + c3 \ + fun `l1` + (app + [global (indt «list»), + app [global (const «T»), c1]]) + c4 \ + fun `l2` + (app + [global (indt «list»), + app + [global (const «T»), c1]]) + c5 \ + match c4 + (fun `l1` (app - [global (indt «eq»), - global (indt «nat»), - c0, + [global (indt «list»), app - [global - (const «Nat.add»), + [global (const «T»), c1]]) + c6 \ global (indt «bool»)) + [match c5 + (fun `l2` + (app + [global (indt «list»), + app + [global (const «T»), + c1]]) c6 \ + global (indt «bool»)) + [c0, + fun `t0` + (app + [global (const «T»), c1]) + c6 \ + fun `l` + (app + [global (indt «list»), + app + [global (const «T»), + c1]]) c7 \ c2], + fun `x` + (app + [global (const «T»), c1]) + c6 \ + fun `xs` + (app + [global (indt «list»), + app + [global (const «T»), + c1]]) c7 \ + match c5 + (fun `l2` + (app + [global (indt «list»), + app + [global (const «T»), + c1]]) c8 \ + global (indt «bool»)) + [c2, + fun `y` + (app + [global (const «T»), + c1]) c8 \ + fun `ys` + (app + [global + (indt «list»), + app + [global + (const «T»), c1]]) + c9 \ app [global - (const «Nat.add»), + (const «andb»), app - [global (indc «S»), - global (indc «O»)], - c2], c1]]) - (X22 c0 c1 c2) []) | X44] - + [global + (const «op»), + c1, c6, c8], + app [c3, c7, c9]]]]) + +Debug: }}} -> (0.051s) +Debug: run 28 {{{ + Debug: - rid:4 step:106 gid:157 user:subgoal = 245 - + rid:0 step:28 gid:34 user:curgoal = = + some X5 = + some + (fun `b` (global (indt «bool»)) c0 \ + fun `t` (global (indt «r»)) c1 \ + let `q` (global (indt «bool»)) + (app [global (const «negb»), c0]) + c2 \ + fix `rec` 0 + (prod `l1` + (app + [global (indt «list»), + app + [global (const «T»), c1]]) + c3 \ + prod `l2` + (app + [global (indt «list»), + app + [global (const «T»), c1]]) + c4 \ global (indt «bool»)) + c3 \ + fun `l1` + (app + [global (indt «list»), + app [global (const «T»), c1]]) + c4 \ + fun `l2` + (app + [global (indt «list»), + app + [global (const «T»), c1]]) + c5 \ + match c4 + (fun `l1` + (app + [global (indt «list»), + app + [global (const «T»), c1]]) + c6 \ global (indt «bool»)) + [match c5 + (fun `l2` + (app + [global (indt «list»), + app + [global (const «T»), + c1]]) c6 \ + global (indt «bool»)) + [c0, + fun `t0` + (app + [global (const «T»), c1]) + c6 \ + fun `l` + (app + [global (indt «list»), + app + [global (const «T»), + c1]]) c7 \ c2], + fun `x` + (app + [global (const «T»), c1]) + c6 \ + fun `xs` + (app + [global (indt «list»), + app + [global (const «T»), + c1]]) c7 \ + match c5 + (fun `l2` + (app + [global (indt «list»), + app + [global (const «T»), + c1]]) c8 \ + global (indt «bool»)) + [c2, + fun `y` + (app + [global (const «T»), + c1]) c8 \ + fun `ys` + (app + [global + (indt «list»), + app + [global + (const «T»), c1]]) + c9 \ + app + [global + (const «andb»), + app + [global + (const «op»), + c1, c6, c8], + app [c3, c7, c9]]]]) + Debug: - rid:4 step:106 gid:245 user:newgoal = coq.ltac.private.distribute-nabla (c0 \ - []) X44 - + rid:0 step:28 gid:34 user:rule = eq + Debug: - rid:4 step:106 gid:245 user:rule:backchain = success - -Debug: }}} -> (0.007s) -Debug: run 107 {{{ - + rid:0 step:28 gid:34 user:rule:builtin:name = = + Debug: - rid:4 step:107 gid:245 user:curgoal = coq.ltac.private.distribute-nabla - coq.ltac.private.distribute-nabla (c0 \ - []) X44 - + rid:0 step:28 gid:0 user:assign = X5 := fun `b` (global (indt «bool»)) c0 \ + fun `t` (global (indt «r»)) c1 \ + let `q` (global (indt «bool»)) +...TRUNCATED BY DUNE... + global (indt «bool»)) c1 \ + prod `l` + (app [global (indt «list»), c0]) + c2 \ + prod `s` + (app [global (indt «list»), c0]) + c3 \ + prod `h` + (global (indt «bool»)) c4 \ + sort prop + Debug: - rid:4 step:107 gid:245 user:rule = backchain - + rid:1 step:356 gid:1042 user:rule = eq + Debug: - rid:4 step:107 gid:245 user:rule:backchain:candidates = File "/build/reproducible-path/coq-elpi-2.5.0/elpi/elpi-ltac.elpi", line 116, column 0, characters 4512-4539: - File "/build/reproducible-path/coq-elpi-2.5.0/elpi/elpi-ltac.elpi", line 117, column 0, characters 4541-4640: - File "/build/reproducible-path/coq-elpi-2.5.0/elpi/elpi-ltac.elpi", line 119, column 0, characters 4642-4704: - -Debug: }}} -> (0.000s) -Debug: select 53 {{{ - + rid:1 step:356 gid:1042 user:rule:builtin:name = = + Debug: - rid:4 step:107 gid:245 user:rule:backchain:try = File "/build/reproducible-path/coq-elpi-2.5.0/elpi/elpi-ltac.elpi", line 116, column 0, characters 4512-4539: - (coq.ltac.private.distribute-nabla - (c0 \ []) []) :- . + rid:1 step:356 gid:1042 user:rule:eq = success + +Debug: }}} -> (0.001s) +Debug: run 357 {{{ + +Debug: + rid:1 step:357 gid:1043 user:curgoal = = + X211 = ok + +Debug: + rid:1 step:357 gid:1043 user:rule = eq + +Debug: + rid:1 step:357 gid:1043 user:rule:builtin:name = = Debug: - rid:4 step:107 gid:0 user:assign = X44 := [] + rid:1 step:357 gid:0 user:assign = X211 := ok Debug: - rid:4 step:107 gid:245 user:rule:backchain = success - + rid:1 step:357 gid:1043 user:rule:eq = success + Debug: }}} -> (0.000s) -Debug: run 108 {{{ +Debug: run 358 {{{ Debug: - rid:4 step:108 gid:154 user:curgoal = coq.ltac.all - coq.ltac.all (coq.ltac.open solve) [] - X8 - -Debug: - rid:4 step:108 gid:154 user:rule = backchain - -Debug: - rid:4 step:108 gid:154 user:rule:backchain:candidates = File "/build/reproducible-path/coq-elpi-2.5.0/elpi/elpi-ltac.elpi", line 62, column 0, characters 2339-2350: - + rid:1 step:358 gid:1039 user:curgoal = ! + ! + Debug: }}} -> (0.000s) -Debug: select 54 {{{ - Debug: - rid:4 step:108 gid:154 user:rule:backchain:try = File "/build/reproducible-path/coq-elpi-2.5.0/elpi/elpi-ltac.elpi", line 62, column 0, characters 2339-2350: - (coq.ltac.all _ [] []) :- . - + rid:1 step:358 gid:1039 user:rule = cut + Debug: - rid:4 step:108 gid:0 user:assign = X8 := [] - + rid:1 step:358 gid:0 user:rule:cut:branch = 1035 + File "builtin_stdlib.elpi", line 45, column 0, characters 1554-1621: + (std.assert-ok! _ A0) :- ( + std.fatal-error-w-data A0 + no diagnostic returned). + Debug: - rid:4 step:108 gid:154 user:rule:backchain = success - -Debug: }}} -> (0.000s) -Debug: run 109 {{{ + rid:1 step:358 gid:1039 user:rule:cut = success + +Debug: run 359 {{{ Debug: - rid:4 step:109 gid:155 user:curgoal = std.append - std.append - [nabla c0 \ - nabla c1 \ - nabla c2 \ - seal - (goal - [decl c2 `w` - (global (indt «nat»)), - decl c1 `z` - (global (indt «nat»)), - decl c0 `x` - (global (indt «nat»))] - (X26 c0 c1 c2) - (app - [global (indt «eq»), - global (indt «nat»), c0, - app - [global (const «Nat.add»), - app - [global - (const «Nat.add»), - app - [global (indc «S»), - global (indc «O»)], - c2], c1]]) - (X22 c0 c1 c2) [])] [] (X2) - + rid:1 step:359 gid:1040 user:curgoal = ; + ok = ok ; + ok = error X212 , + std.fatal-error-w-data illtyped X212 + Debug: - rid:4 step:109 gid:155 user:rule = backchain - + rid:1 step:359 gid:1040 user:rule = backchain + Debug: - rid:4 step:109 gid:155 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 86, column 0, characters 2798-2838: - + rid:1 step:359 gid:1040 user:rule:backchain:candidates = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: + File "elpi-builtin.elpi", line 36, column 0, characters 388-400: + Debug: }}} -> (0.000s) -Debug: select 55 {{{ - -Debug: - rid:4 step:109 gid:155 user:rule:backchain:try = File "builtin_stdlib.elpi", line 86, column 0, characters 2798-2838: - (std.append [A3 | A0] A1 - [A3 | A2]) :- (std.append - A0 A1 A2). - +Debug: select 269 {{{ + Debug: - rid:4 step:109 gid:0 user:assign = A3 := nabla c0 \ - nabla c1 \ - nabla c2 \ - seal - (goal - [decl c2 `w` - (global (indt «nat»)), - decl c1 `z` - (global (indt «nat»)), - decl c0 `x` - (global (indt «nat»))] - (X26 c0 c1 c2) - (app - [global (indt «eq»), - global (indt «nat»), c0, - app - [global - (const «Nat.add»), - app - [global - (const «Nat.add»), - app - [global (indc «S»), - global (indc «O»)], - c2], c1]]) - (X22 c0 c1 c2) []) - + rid:1 step:359 gid:1040 user:rule:backchain:try = File "elpi-builtin.elpi", line 34, column 0, characters 373-385: + (A0 ; _) :- A0. + Debug: - rid:4 step:109 gid:0 user:assign = A0 := [] + rid:1 step:359 gid:0 user:assign = A0 := ok = ok Debug: - rid:4 step:109 gid:0 user:assign = A1 := [] - + rid:1 step:359 gid:1040 user:subgoal = 1044 + Debug: - rid:4 step:109 gid:0 user:assign:resume = 230 - + rid:1 step:359 gid:1044 user:newgoal = ok = ok + Debug: - rid:4 step:109 gid:0 user:assign:resume = 230 - + rid:1 step:359 gid:1044 user:rule:backchain = success + +Debug: }}} -> (0.000s) +Debug: run 360 {{{ + Debug: - rid:4 step:109 gid:0 user:assign:HO = X2 := [nabla c0 \ - nabla c1 \ - nabla c2 \ - seal - (goal - [decl c2 `w` - (global (indt «nat»)), - decl c1 `z` - (global (indt «nat»)), - decl c0 `x` - (global (indt «nat»))] - (X45 c0 c1 c2) - (app - [global (indt «eq»), - global (indt «nat»), - c0, - app - [global - (const «Nat.add»), - app - [global - (const «Nat.add»), - app - [global - (indc «S»), - global - (indc «O»)], - c2], c1]]) - (X46 c0 c1 c2) []) | X47] - + rid:1 step:360 gid:1044 user:curgoal = = + ok = ok + Debug: - rid:4 step:109 gid:155 user:subgoal = 246 - + rid:1 step:360 gid:1044 user:rule = eq + Debug: - rid:4 step:109 gid:246 user:newgoal = std.append [] [] X47 - + rid:1 step:360 gid:1044 user:rule:builtin:name = = + Debug: - rid:4 step:109 gid:246 user:rule:backchain = success - -Debug: }}} -> (0.001s) -Debug: run 110 {{{ + rid:1 step:360 gid:1044 user:rule:eq = success + +Debug: }}} -> (0.000s) +Debug: run 361 {{{ Debug: - rid:4 step:110 gid:0 user:rule = resume - + rid:1 step:361 gid:1041 user:curgoal = ! + ! + +Debug: }}} -> (0.000s) Debug: - rid:4 step:110 gid:230 user:rule:resume:resumed = evar (X45 c2 c3 c4) - (app - [global (indt «eq»), - global (indt «nat»), - c2, - app - [global - (const «Nat.add»), - app - [global - (const «Nat.add»), - app - [global - (indc «S»), - global - (indc «O»)], - c4], c3]]) - (X46 c2 c3 c4) - + rid:1 step:361 gid:1041 user:rule = cut + Debug: - rid:4 step:110 gid:0 user:rule:resume = success + rid:1 step:361 gid:0 user:rule:cut:branch = 1040 + File "elpi-builtin.elpi", line 36, column 0, characters 388-400: + (_ ; A0) :- A0. + +Debug: + rid:1 step:361 gid:1041 user:rule:cut = success -Debug: }}} -> (0.000s) -Debug: run 111 {{{ +Debug: run 362 {{{ Debug: - rid:4 step:111 gid:230 user:curgoal = evar - evar (X45 c2 c3 c4) - (app - [global (indt «eq»), - global (indt «nat»), c2, - app - [global (const «Nat.add»), - app - [global (const «Nat.add»), - app - [global (indc «S»), - global (indc «O»)], c4], c3]]) - (X46 c2 c3 c4) - -Debug: - rid:4 step:111 gid:230 user:rule = backchain - -Debug: - rid:4 step:111 gid:230 user:rule:backchain:candidates = File "coq-builtin.elpi", line 301, column 0, characters 12083-12186: - File "/build/reproducible-path/coq-elpi-2.5.0/elpi/coq-elaborator.elpi", line 7, column 0, characters 296-388: - File "/build/reproducible-path/coq-elpi-2.5.0/elpi/coq-elaborator.elpi", line 11, column 0, characters 391-621: - File "/build/reproducible-path/coq-elpi-2.5.0/elpi/coq-elaborator.elpi", line 16, column 0, characters 624-744: - File "coq-builtin.elpi", line 304, column 0, characters 12189-12227: - -Debug: }}} -> (0.001s) -Debug: select 56 {{{ - + rid:1 step:362 gid:1036 user:curgoal = ! + ! + +Debug: }}} -> (0.000s) Debug: - rid:4 step:111 gid:230 user:rule:backchain:try = File "coq-builtin.elpi", line 301, column 0, characters 12083-12186: - (evar (as uvar A3) A2 A0) :- ( - var A0 _ A1), (!), - (prune A2 A1), - (prune A3 A1), - (declare_constraint - (evar A3 A2 A0) [ - A3, A0]). - + rid:1 step:362 gid:1036 user:rule = cut + Debug: - rid:4 step:111 gid:0 user:assign = A3 := X45 c2 c3 c4 - + rid:1 step:362 gid:1036 user:rule:cut = success + +Debug: run 363 {{{ + Debug: - rid:4 step:111 gid:0 user:assign = A2 := app - [global (indt «eq»), - global (indt «nat»), c2, - app - [global (const «Nat.add»), - app - [global (const «Nat.add»), - app - [global (indc «S»), - global (indc «O»)], c4], - c3]] - + rid:1 step:363 gid:1037 user:curgoal = std.do! + std.do! + [coq.env.add-const expanded_g + (fun `T` (sort (typ «r.u0»)) c0 \ + let `X` (sort (typ «r.u0»)) c0 + c1 \ + fun `op` + (prod `_` c0 c2 \ + prod `_` c1 c3 \ + global (indt «bool»)) c2 \ + fun `l` + (app + [global (indt «list»), c0]) + c3 \ + fun `s` + (app + [global (indt «list»), c0]) + c4 \ + fun `h` + (global (indt «bool»)) + c5 \ + app + [global (indt «and»), + prod `x` c0 c6 \ + prod `y` c1 c7 \ + app + [global (indt «eq»), + global (indt «bool»), + app [c2, c6, c7], + global + (indc «false»)], + app + [global (indt «eq»), + global (indt «bool»), + app + [global + (const «expanded_f»), + global (indc «true»), + c0, c2, c3, c4], c5]]) + _ _ X8, + X4 = + pi c0 \ + pi c1 \ + pi c2 \ + pi c3 \ + pi c4 \ + pi c5 \ + pi c6 \ + pi c7 \ + pi c8 \ + pi c9 \ + pi c10 \ + expand + (app + [global (const «g»), + c0, c3, c5, c7 | c9]) + (app + [global (const X8), + c1, c2, c4, c6, c8 | c10]) + :- + [!, + std.map c9 expand c10, + expand c7 c8, + expand c5 c6, + expand c3 c4, + expand c0 + (app + [global + (indc «Build_r»), + c1, c2])]] + Debug: - rid:4 step:111 gid:0 user:assign = A0 := X46 c2 c3 c4 - + rid:1 step:363 gid:1037 user:rule = backchain + Debug: - rid:4 step:111 gid:230 user:subgoal = 247 - + rid:1 step:363 gid:1037 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 279, column 0, characters 9290-9316: + +Debug: }}} -> (0.002s) +Debug: select 270 {{{ + Debug: - rid:4 step:111 gid:247 user:newgoal = var (X46 c2 c3 c4) _ X48^5 - + rid:1 step:363 gid:1037 user:rule:backchain:try = File "builtin_stdlib.elpi", line 279, column 0, characters 9290-9316: + (std.do! [A0 | A1]) :- A0, + (!), (std.do! A1). + Debug: - rid:4 step:111 gid:247 user:subgoal = 248 - + rid:1 step:363 gid:0 user:assign = A0 := coq.env.add-const expanded_g + (fun `T` (sort (typ «r.u0»)) c0 \ + let `X` (sort (typ «r.u0»)) c0 + c1 \ + fun `op` + (prod `_` c0 c2 \ + prod `_` c1 c3 \ + global (indt «bool»)) c2 \ + fun `l` + (app + [global (indt «list»), c0]) + c3 \ + fun `s` + (app + [global (indt «list»), c0]) + c4 \ + fun `h` + (global (indt «bool»)) + c5 \ + app + [global (indt «and»), + prod `x` c0 c6 \ + prod `y` c1 c7 \ + app + [global (indt «eq»), + global (indt «bool»), + app [c2, c6, c7], + global + (indc «false»)], + app + [global (indt «eq»), + global (indt «bool»), + app + [global + (const «expanded_f»), + global (indc «true»), + c0, c2, c3, c4], c5]]) + _ _ X8 + Debug: - rid:4 step:111 gid:248 user:newgoal = ! - + rid:1 step:363 gid:0 user:assign = A1 := [X4 = + pi c0 \ + pi c1 \ + pi c2 \ + pi c3 \ + pi c4 \ + pi c5 \ + pi c6 \ + pi c7 \ + pi c8 \ + pi c9 \ + pi c10 \ + expand + (app + [global + (const «g»), + c0, c3, c5, c7 | c9]) + (app + [global (const X8), + c1, c2, c4, c6, c8 | c10]) + :- + [!, + std.map c9 expand c10, + expand c7 c8, + expand c5 c6, + expand c3 c4, + expand c0 + (app + [global + (indc + «Build_r»), + c1, c2])]] + Debug: - rid:4 step:111 gid:247 user:subgoal = 249 - + rid:1 step:363 gid:1037 user:subgoal = 1045 + Debug: - rid:4 step:111 gid:249 user:newgoal = prune - (app - [global (indt «eq»), - global (indt «nat»), c2, - app - [global (const «Nat.add»), - app - [global (const «Nat.add»), - app - [global (indc «S»), - global (indc «O»)], c4], c3]]) - X48^5 - + rid:1 step:363 gid:1045 user:newgoal = coq.env.add-const expanded_g + (fun `T` (sort (typ «r.u0»)) c0 \ + let `X` (sort (typ «r.u0»)) c0 + c1 \ + fun `op` + (prod `_` c0 c2 \ + prod `_` c1 c3 \ + global (indt «bool»)) c2 \ + fun `l` + (app + [global (indt «list»), c0]) + c3 \ + fun `s` + (app + [global (indt «list»), c0]) + c4 \ + fun `h` + (global (indt «bool»)) c5 \ + app + [global (indt «and»), + prod `x` c0 c6 \ + prod `y` c1 c7 \ + app + [global (indt «eq»), + global (indt «bool»), + app [c2, c6, c7], + global (indc «false»)], + app + [global (indt «eq»), + global (indt «bool»), + app + [global + (const «expanded_f»), + global (indc «true»), + c0, c2, c3, c4], c5]]) + _ _ X8 + Debug: - rid:4 step:111 gid:247 user:subgoal = 250 - + rid:1 step:363 gid:1045 user:subgoal = 1046 + Debug: - rid:4 step:111 gid:250 user:newgoal = prune (X45 c2 c3 c4) X48^5 - + rid:1 step:363 gid:1046 user:newgoal = ! + Debug: - rid:4 step:111 gid:247 user:subgoal = 251 - + rid:1 step:363 gid:1045 user:subgoal = 1047 + Debug: - rid:4 step:111 gid:251 user:newgoal = declare_constraint - (evar (X45 c2 c3 c4) - (app - [global (indt «eq»), - global (indt «nat»), c2, - app - [global (const «Nat.add»), - app - [global (const «Nat.add»), - app - [global (indc «S»), - global (indc «O»)], c4], - c3]]) (X46 c2 c3 c4)) - [X45 c2 c3 c4, X46 c2 c3 c4] - + rid:1 step:363 gid:1047 user:newgoal = std.do! + [X4 = + pi c0 \ + pi c1 \ + pi c2 \ + pi c3 \ + pi c4 \ + pi c5 \ + pi c6 \ + pi c7 \ + pi c8 \ + pi c9 \ + pi c10 \ + expand + (app + [global (const «g»), + c0, c3, c5, c7 | c9]) + (app + [global (const X8), + c1, c2, c4, c6, c8 | c10]) + :- + [!, + std.map c9 expand c10, + expand c7 c8, + expand c5 c6, + expand c3 c4, + expand c0 + (app + [global + (indc «Build_r»), + c1, c2])]] + Debug: - rid:4 step:111 gid:247 user:rule:backchain = success - -Debug: }}} -> (0.001s) -Debug: run 112 {{{ + rid:1 step:363 gid:1045 user:rule:backchain = success + +Debug: }}} -> (0.002s) +Debug: run 364 {{{ Debug: - rid:4 step:112 gid:247 user:curgoal = var - var (X46 c2 c3 c4) _ X48^5 - + rid:1 step:364 gid:1045 user:curgoal = coq.env.add-const + coq.env.add-const expanded_g + (fun `T` (sort (typ «r.u0»)) c0 \ + let `X` (sort (typ «r.u0»)) c0 + c1 \ + fun `op` + (prod `_` c0 c2 \ + prod `_` c1 c3 \ + global (indt «bool»)) c2 \ + fun `l` + (app + [global (indt «list»), c0]) + c3 \ + fun `s` + (app + [global (indt «list»), c0]) + c4 \ + fun `h` + (global (indt «bool»)) c5 \ + app + [global (indt «and»), + prod `x` c0 c6 \ + prod `y` c1 c7 \ + app + [global (indt «eq»), + global (indt «bool»), + app [c2, c6, c7], + global (indc «false»)], + app + [global (indt «eq»), + global (indt «bool»), + app + [global + (const «expanded_f»), + global (indc «true»), + c0, c2, c3, c4], c5]]) + _ _ X8 + Debug: - rid:4 step:112 gid:247 user:rule = builtin - + rid:1 step:364 gid:1045 user:rule = builtin + Debug: - rid:4 step:112 gid:247 user:rule:builtin:name = var - + rid:1 step:364 gid:1045 user:rule:builtin:name = coq.env.add-const + Debug: - rid:4 step:112 gid:247 user:rule:builtin = success - + rid:1 step:364 gid:1045 user:rule:builtin = success + Debug: - rid:4 step:112 gid:247 user:subgoal = 252 - + rid:1 step:364 gid:1045 user:subgoal = 1048 + Debug: - rid:4 step:112 gid:252 user:newgoal = X48^5 = [c2, c3, c4] - -Debug: }}} -> (0.000s) -Debug: run 113 {{{ + rid:1 step:364 gid:1048 user:newgoal = X8 = «expanded_g» + +Debug: }}} -> (0.030s) +Debug: run 365 {{{ Debug: - rid:4 step:113 gid:252 user:curgoal = = - X48^5 = [c2, c3, c4] - + rid:1 step:365 gid:1048 user:curgoal = = + X8 = «expanded_g» + Debug: - rid:4 step:113 gid:252 user:rule = eq - + rid:1 step:365 gid:1048 user:rule = eq + Debug: - rid:4 step:113 gid:252 user:rule:builtin:name = = - + rid:1 step:365 gid:1048 user:rule:builtin:name = = + Debug: - rid:4 step:113 gid:0 user:assign = X48^5 := [c2, c3, c4] + rid:1 step:365 gid:0 user:assign = X8 := «expanded_g» Debug: - rid:4 step:113 gid:252 user:rule:eq = success - + rid:1 step:365 gid:1048 user:rule:eq = success + Debug: }}} -> (0.000s) -Debug: run 114 {{{ +Debug: run 366 {{{ Debug: - rid:4 step:114 gid:248 user:curgoal = ! - ! - + rid:1 step:366 gid:1046 user:curgoal = ! + ! + Debug: }}} -> (0.000s) Debug: - rid:4 step:114 gid:248 user:rule = cut - + rid:1 step:366 gid:1046 user:rule = cut + Debug: - rid:4 step:114 gid:0 user:rule:cut:branch = 230 - File "/build/reproducible-path/coq-elpi-2.5.0/elpi/coq-elaborator.elpi", line 7, column 0, characters 296-388: - (evar A1 A2 A0) :- (var A0), - (!), (of A1 A2 A0). - + rid:1 step:366 gid:1046 user:rule:cut = success + +Debug: run 367 {{{ + Debug: - rid:4 step:114 gid:0 user:rule:cut:branch = 230 - File "/build/reproducible-path/coq-elpi-2.5.0/elpi/coq-elaborator.elpi", line 11, column 0, characters 391-621: - (evar A2 A1 A0) :- (not (var A0)), - (same_term A1 (sort prop)), - (coq.version _ 8 17 _), (!), - (hack-8-17.propagate-Prop-constraint-inward - A0), - (coq.typecheck A0 A1 ok), - (A2 = A0). - + rid:1 step:367 gid:1047 user:curgoal = std.do! + std.do! + [X4 = + pi c0 \ + pi c1 \ + pi c2 \ + pi c3 \ + pi c4 \ + pi c5 \ + pi c6 \ + pi c7 \ + pi c8 \ + pi c9 \ + pi c10 \ + expand + (app + [global (const «g»), + c0, c3, c5, c7 | c9]) + (app + [global + (const + «expanded_g»), + c1, c2, c4, c6, c8 | c10]) + :- + [!, + std.map c9 expand c10, + expand c7 c8, + expand c5 c6, + expand c3 c4, + expand c0 + (app + [global + (indc «Build_r»), + c1, c2])]] + Debug: - rid:4 step:114 gid:0 user:rule:cut:branch = 230 - File "/build/reproducible-path/coq-elpi-2.5.0/elpi/coq-elaborator.elpi", line 16, column 0, characters 624-744: - (evar A2 A1 A0) :- (not (var A0)), - (!), (coq.typecheck A0 A1 ok), - (A2 = A0). - + rid:1 step:367 gid:1047 user:rule = backchain + Debug: - rid:4 step:114 gid:0 user:rule:cut:branch = 230 - File "coq-builtin.elpi", line 304, column 0, characters 12189-12227: - (evar _ _ _) :- . - + rid:1 step:367 gid:1047 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 279, column 0, characters 9290-9316: + +Debug: }}} -> (0.001s) +Debug: select 271 {{{ + Debug: - rid:4 step:114 gid:248 user:rule:cut = success - -Debug: run 115 {{{ - + rid:1 step:367 gid:1047 user:rule:backchain:try = File "builtin_stdlib.elpi", line 279, column 0, characters 9290-9316: + (std.do! [A0 | A1]) :- A0, + (!), (std.do! A1). + Debug: - rid:4 step:115 gid:249 user:curgoal = prune - prune - (app - [global (indt «eq»), - global (indt «nat»), c2, - app - [global (const «Nat.add»), - app - [global (const «Nat.add»), - app - [global (indc «S»), - global (indc «O»)], c4], c3]]) - [c2, c3, c4] - + rid:1 step:367 gid:0 user:assign = A0 := X4 = + pi c0 \ + pi c1 \ + pi c2 \ + pi c3 \ + pi c4 \ + pi c5 \ + pi c6 \ + pi c7 \ + pi c8 \ + pi c9 \ + pi c10 \ + expand + (app + [global (const «g»), + c0, c3, c5, c7 | c9]) + (app + [global + (const + «expanded_g»), + c1, c2, c4, c6, c8 | c10]) + :- + [!, + std.map c9 expand c10, + expand c7 c8, + expand c5 c6, + expand c3 c4, + expand c0 + (app + [global + (indc «Build_r»), + c1, c2])] + Debug: - rid:4 step:115 gid:249 user:rule = builtin + rid:1 step:367 gid:0 user:assign = A1 := [] Debug: - rid:4 step:115 gid:249 user:rule:builtin:name = prune - + rid:1 step:367 gid:1047 user:subgoal = 1049 + Debug: - rid:4 step:115 gid:249 user:rule:builtin = success - + rid:1 step:367 gid:1049 user:newgoal = X4 = + pi c0 \ + pi c1 \ + pi c2 \ + pi c3 \ + pi c4 \ + pi c5 \ + pi c6 \ + pi c7 \ + pi c8 \ + pi c9 \ + pi c10 \ + expand + (app + [global (const «g»), + c0, c3, c5, c7 | c9]) + (app + [global + (const «expanded_g»), + c1, c2, c4, c6, c8 | c10]) + :- + [!, + std.map c9 expand c10, + expand c7 c8, + expand c5 c6, + expand c3 c4, + expand c0 + (app + [global + (indc «Build_r»), + c1, c2])] + Debug: - rid:4 step:115 gid:249 user:subgoal = 253 - + rid:1 step:367 gid:1049 user:subgoal = 1050 + Debug: - rid:4 step:115 gid:253 user:newgoal = app - [global (indt «eq»), - global (indt «nat»), c2, - app - [global (const «Nat.add»), - app - [global (const «Nat.add»), - app - [global (indc «S»), - global (indc «O»)], c4], c3]] - = X49 c2 c3 c4 - -Debug: }}} -> (0.001s) -Debug: run 116 {{{ - + rid:1 step:367 gid:1050 user:newgoal = ! + Debug: - rid:4 step:116 gid:253 user:curgoal = = - app - [global (indt «eq»), - global (indt «nat»), c2, - app - [global (const «Nat.add»), - app - [global (const «Nat.add»), - app - [global (indc «S»), - global (indc «O»)], c4], c3]] - = X49 c2 c3 c4 - + rid:1 step:367 gid:1049 user:subgoal = 1051 + Debug: - rid:4 step:116 gid:253 user:rule = eq - + rid:1 step:367 gid:1051 user:newgoal = std.do! [] + Debug: - rid:4 step:116 gid:253 user:rule:builtin:name = = - + rid:1 step:367 gid:1049 user:rule:backchain = success + +Debug: }}} -> (0.007s) +Debug: run 368 {{{ + Debug: - rid:4 step:116 gid:0 user:assign:HO = X49 := c0 \ - c1 \ - c2 \ - app - [global (indt «eq»), - global (indt «nat»), c0, - app - [global (const «Nat.add»), - app - [global (const «Nat.add»), - app - [global (indc «S»), - global (indc «O»)], c2], c1]] - + rid:1 step:368 gid:1049 user:curgoal = = + X4 = + pi c0 \ + pi c1 \ + pi c2 \ + pi c3 \ + pi c4 \ + pi c5 \ + pi c6 \ + pi c7 \ + pi c8 \ + pi c9 \ + pi c10 \ + expand + (app + [global (const «g»), + c0, c3, c5, c7 | c9]) + (app + [global + (const «expanded_g»), + c1, c2, c4, c6, c8 | c10]) + :- + [!, + std.map c9 expand c10, + expand c7 c8, + expand c5 c6, + expand c3 c4, + expand c0 + (app + [global + (indc «Build_r»), + c1, c2])] + Debug: - rid:4 step:116 gid:253 user:rule:eq = success - -Debug: }}} -> (0.000s) -Debug: run 117 {{{ - + rid:1 step:368 gid:1049 user:rule = eq + Debug: - rid:4 step:117 gid:250 user:curgoal = prune - prune (X45 c2 c3 c4) [c2, c3, c4] - + rid:1 step:368 gid:1049 user:rule:builtin:name = = + Debug: - rid:4 step:117 gid:250 user:rule = builtin + rid:1 step:368 gid:0 user:assign = X4 := pi c0 \ + pi c1 \ + pi c2 \ + pi c3 \ + pi c4 \ + pi c5 \ + pi c6 \ + pi c7 \ + pi c8 \ + pi c9 \ + pi c10 \ + expand + (app + [global (const «g»), + c0, c3, c5, c7 | c9]) + (app + [global + (const + «expanded_g»), + c1, c2, c4, c6, c8 | c10]) + :- + [!, + std.map c9 expand c10, + expand c7 c8, + expand c5 c6, + expand c3 c4, + expand c0 + (app + [global + (indc «Build_r»), + c1, c2])] Debug: - rid:4 step:117 gid:250 user:rule:builtin:name = prune - + rid:1 step:368 gid:1049 user:rule:eq = success + +Debug: }}} -> (0.001s) +Debug: run 369 {{{ + Debug: - rid:4 step:117 gid:250 user:rule:builtin = success - + rid:1 step:369 gid:1050 user:curgoal = ! + ! + +Debug: }}} -> (0.000s) Debug: - rid:4 step:117 gid:250 user:subgoal = 254 - + rid:1 step:369 gid:1050 user:rule = cut + Debug: - rid:4 step:117 gid:254 user:newgoal = X45 c2 c3 c4 = X50 c2 c3 c4 - -Debug: }}} -> (0.000s) -Debug: run 118 {{{ + rid:1 step:369 gid:1050 user:rule:cut = success + +Debug: run 370 {{{ Debug: - rid:4 step:118 gid:254 user:curgoal = = - X45 c2 c3 c4 = X50 c2 c3 c4 - + rid:1 step:370 gid:1051 user:curgoal = std.do! + std.do! [] + Debug: - rid:4 step:118 gid:254 user:rule = eq - + rid:1 step:370 gid:1051 user:rule = backchain + Debug: - rid:4 step:118 gid:254 user:rule:builtin:name = = - + rid:1 step:370 gid:1051 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 278, column 0, characters 9282-9288: + +Debug: }}} -> (0.000s) +Debug: select 272 {{{ + Debug: - rid:4 step:118 gid:0 user:assign:HO = X45 := c0 \ - c1 \ - c2 \ - X50 c0 c1 c2 - + rid:1 step:370 gid:1051 user:rule:backchain:try = File "builtin_stdlib.elpi", line 278, column 0, characters 9282-9288: + (std.do! []) :- . + Debug: - rid:4 step:118 gid:254 user:rule:eq = success - -Debug: }}} -> (0.000s) -Debug: run 119 {{{ + rid:1 step:370 gid:1051 user:rule:backchain = success + +Debug: }}} -> (0.008s) +Debug: run 371 {{{ Debug: - rid:4 step:119 gid:251 user:curgoal = declare_constraint - declare_constraint - (evar (X50 c2 c3 c4) - (app - [global (indt «eq»), - global (indt «nat»), c2, - app - [global (const «Nat.add»), - app - [global (const «Nat.add»), - app - [global (indc «S»), - global (indc «O»)], c4], - c3]]) (X46 c2 c3 c4)) - [X50 c2 c3 c4, X46 c2 c3 c4] + rid:1 step:371 gid:692 user:curgoal = coq.elpi.accumulate + coq.elpi.accumulate _ record.expand.db + (clause _ (before expand:start) + (pi c0 \ + pi c1 \ + pi c2 \ + pi c3 \ + pi c4 \ + pi c5 \ + pi c6 \ + pi c7 \ + pi c8 \ + pi c9 \ + pi c10 \ + expand + (app + [global (const «g»), + c0, c3, c5, c7 | c9]) + (app + [global + (const + «expanded_g»), + c1, c2, c4, c6, c8 | c10]) + :- + [!, + std.map c9 expand c10, + expand c7 c8, + expand c5 c6, + expand c3 c4, + expand c0 + (app + [global + (indc «Build_r»), + c1, c2])])) Debug: - rid:4 step:119 gid:251 user:rule = builtin + rid:1 step:371 gid:692 user:rule = backchain Debug: - rid:4 step:119 gid:251 user:rule:builtin:name = declare_constraint - + rid:1 step:371 gid:692 user:rule:backchain:candidates = File "coq-builtin.elpi", line 1787, column 0, characters 71769-71833: + +Debug: }}} -> (0.001s) +Debug: select 273 {{{ + Debug: - rid:4 step:119 gid:251 user:subgoal = 255 - + rid:1 step:371 gid:692 user:rule:backchain:try = File "coq-builtin.elpi", line 1787, column 0, characters 71769-71833: + (coq.elpi.accumulate A0 A1 + A2) :- (coq.elpi.accumulate-clauses + A0 A1 [ + A2]). + Debug: - rid:4 step:119 gid:255 user:newgoal = evar (X50 c2 c3 c4) - (app - [global (indt «eq»), - global (indt «nat»), c2, - app - [global (const «Nat.add»), - app - [global (const «Nat.add»), - app - [global (indc «S»), - global (indc «O»)], c4], c3]]) - (X46 c2 c3 c4) - + rid:1 step:371 gid:0 user:assign = A1 := record.expand.db + Debug: - rid:4 step:119 gid:251 user:rule:builtin = success - -Debug: }}} -> (0.001s) -Debug: run 120 {{{ - + rid:1 step:371 gid:0 user:assign = A2 := clause _ (before expand:start) + (pi c0 \ + pi c1 \ + pi c2 \ + pi c3 \ + pi c4 \ + pi c5 \ + pi c6 \ + pi c7 \ + pi c8 \ + pi c9 \ + pi c10 \ + expand + (app + [global + (const «g»), + c0, c3, c5, c7 | c9]) + (app + [global + (const + «expanded_g»), + c1, c2, c4, c6, c8 | c10]) + :- + [!, + std.map c9 expand c10, + expand c7 c8, + expand c5 c6, + expand c3 c4, + expand c0 + (app + [global + (indc + «Build_r»), + c1, c2])]) + Debug: - rid:4 step:120 gid:246 user:curgoal = std.append - std.append [] [] X47 + rid:1 step:371 gid:692 user:subgoal = 1052 Debug: - rid:4 step:120 gid:246 user:rule = backchain - -Debug: - rid:4 step:120 gid:246 user:rule:backchain:candidates = File "builtin_stdlib.elpi", line 87, column 0, characters 2841-2854: - -Debug: }}} -> (0.000s) -Debug: select 57 {{{ - + rid:1 step:371 gid:1052 user:newgoal = coq.elpi.accumulate-clauses X213 + record.expand.db + [clause _ (before expand:start) + (pi c0 \ + pi c1 \ + pi c2 \ + pi c3 \ + pi c4 \ + pi c5 \ + pi c6 \ + pi c7 \ + pi c8 \ + pi c9 \ + pi c10 \ + expand + (app + [global + (const «g»), + c0, c3, c5, c7 | c9]) + (app + [global + (const + «expanded_g»), + c1, c2, c4, c6, c8 | c10]) + :- + [!, + std.map c9 expand c10, + expand c7 c8, + expand c5 c6, + expand c3 c4, + expand c0 + (app + [global + (indc + «Build_r»), + c1, c2])])] + Debug: - rid:4 step:120 gid:246 user:rule:backchain:try = File "builtin_stdlib.elpi", line 87, column 0, characters 2841-2854: - (std.append [] A0 A0) :- . - + rid:1 step:371 gid:1052 user:rule:backchain = success + +Debug: }}} -> (0.001s) +Debug: run 372 {{{ + Debug: - rid:4 step:120 gid:0 user:assign = A0 := [] - + rid:1 step:372 gid:1052 user:curgoal = coq.elpi.accumulate-clauses + coq.elpi.accumulate-clauses X213 + record.expand.db + [clause _ (before expand:start) + (pi c0 \ + pi c1 \ + pi c2 \ + pi c3 \ + pi c4 \ + pi c5 \ + pi c6 \ + pi c7 \ + pi c8 \ + pi c9 \ + pi c10 \ + expand + (app + [global + (const «g»), + c0, c3, c5, c7 | c9]) + (app + [global + (const + «expanded_g»), + c1, c2, c4, c6, c8 | c10]) + :- + [!, + std.map c9 expand c10, + expand c7 c8, + expand c5 c6, + expand c3 c4, + expand c0 + (app + [global + (indc + «Build_r»), + c1, c2])])] + Debug: - rid:4 step:120 gid:0 user:assign = X47 := [] - + rid:1 step:372 gid:1052 user:rule = builtin + Debug: - rid:4 step:120 gid:246 user:rule:backchain = success - -Debug: }}} -> (0.000s) -w - : nat -File "./tests/test_tactic.v", line 5, characters 28-32: -Warning: -File "./tests/test_tactic.v", line 5, characters 28-32 -Type is linear: name it _Type (discard) or Type_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -global (indc «O») -app - [global (indc «S»), - app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] -normP : -forall {T : Type} {e : T} {op : T -> T -> T} {gamma : list T} {t1 t2 : lang}, -(forall a b c : T, op a (op b c) = op (op a b) c) -> -(forall a : T, op e a = a) -> -(forall a : T, op a e = a) -> -norm t1 = norm t2 -> interp T e op gamma t1 = interp T e op gamma t2 - -normP is not universe polymorphic -Arguments normP {T}%type_scope {e} {op}%function_scope - {gamma}%list_scope {t1 t2} (p1 p2 p3)%function_scope - H -normP is transparent -Expands to: Constant elpi_examples_stdlib.example_reflexive_tactic.normP -(fun x y z t : Z => - normP Z.add_assoc Z.add_0_l Z.add_0_r - (eq_refl - <: - norm (add (add (var 0) (var 1)) (add (add (var 2) zero) (var 3))) = - norm (add (add (var 0) (add (var 1) (var 2))) (var 3)))) -Debug: In environment -x, y, z, t : Z -Unable to unify "var 1" with - "var 0". -Raised at Loc.raise in file "lib/loc.ml", line 101, characters 16-23 -Called from Unification.unify_0_with_initial_metas in file "pretyping/unification.ml", line 1281, characters 13-48 -Re-raised at Exninfo.iraise in file "clib/exninfo.ml", line 81, characters 4-38 -Called from Unification.unify_with_eta in file "pretyping/unification.ml", line 1320, characters 14-48 -Called from Unification.merge_instances in file "pretyping/unification.ml", line 1333, characters 23-64 -Called from Unification.w_merge.w_merge_rec in file "pretyping/unification.ml", line 1554, characters 14-63 -Called from Unification.w_merge in file "pretyping/unification.ml", lines 1608-1610, characters 4-35 -Called from Unification.w_unify_core_0 in file "pretyping/unification.ml", line 1661, characters 12-65 -Called from Clenv.clenv_unify in file "proofs/clenv.ml", line 298, characters 25-73 -Called from Clenv.res_pf.(fun) in file "proofs/clenv.ml", line 771, characters 16-56 -Called from Proofview.Goal.enter.f in file "engine/proofview.ml", line 1136, characters 40-46 -Called from Proofview.Goal.enter.(fun) in file "engine/proofview.ml", line 1141, characters 10-34 - -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.lock_container.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.lock_container2.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» + rid:1 step:372 gid:1052 user:rule:builtin:name = coq.elpi.accumulate-clauses + Debug: -elpi lets escape exception: Universe - elpi.apps.locker.tests.test_locker.161 (File "./apps/locker/tests/test_locker.v", line 113, characters 50-54) - is unbound. -Raised at UState.error_unbound_universes in file "engine/uState.ml", line 832, characters 41-74 -Called from UState.universe_context_inst in file "engine/uState.ml", line 845, characters 9-58 -Called from UState.check_poly_univ_decl in file "engine/uState.ml", line 901, characters 13-63 -Called from UState.check_univ_decl in file "engine/uState.ml", line 917, characters 35-67 -Called from Elpi_plugin__Rocq_elpi_builtins.add_axiom_or_variable in file "src/rocq_elpi_builtins.ml", line 913, characters 14-82 -Called from Elpi_plugin__Rocq_elpi_builtins.coq_rest_builtins.(fun) in file "src/rocq_elpi_builtins.ml", line 2068, characters 20-86 -Called from Elpi_plugin__Rocq_elpi_builtins.grab_global_env.(fun) in file "src/rocq_elpi_builtins.ml", line 141, characters 33-44 -Called from Elpi_runtime__Runtime_trace_off.FFI.wrap_type_err in file "src/runtime/runtime_trace_off.ml", line 2125, characters 6-9 -Called from Elpi_runtime__Runtime_trace_off.FFI.call.aux in file "src/runtime/runtime_trace_off.ml", line 2207, characters 32-92 -Called from Elpi_runtime__Runtime_trace_off.FFI.call in file "src/runtime/runtime_trace_off.ml", line 2299, characters 21-70 -Called from Elpi_runtime__Runtime_trace_off.Constraints.exect_builtin_predicate in file "src/runtime/runtime_trace_off.ml", line 3565, characters 20-83 -Called from Elpi_runtime__Runtime_trace_off.Mainloop.make_runtime.run in file "src/runtime/runtime_trace_off.ml", line 3983, characters 19-90 -Called from Elpi_util__Util.Fork.fork.ensure_runtime in file "src/utils/util.ml", line 523, characters 16-19 -Re-raised at Elpi_util__Util.Fork.fork.ensure_runtime in file "src/utils/util.ml", line 532, characters 7-14 -Called from Elpi_runtime__Runtime_trace_off.mk_outcome in file "src/runtime/runtime_trace_off.ml", line 4265, characters 14-23 -Called from Elpi_runtime__Runtime_trace_off.execute_once in file "src/runtime/runtime_trace_off.ml", line 4282, characters 20-242 -Re-raised at Elpi_runtime__Runtime_trace_off.execute_once in file "src/runtime/runtime_trace_off.ml", line 4287, characters 2-9 -Called from Elpi__API.Execute.once in file "src/API.ml", line 235, characters 40-91 -Called from Elpi_plugin__Rocq_elpi_vernacular.Compiler.run in file "src/rocq_elpi_vernacular.ml", line 145, characters 13-55 -Re-raised at Exninfo.iraise in file "clib/exninfo.ml", line 81, characters 4-38 -Called from Elpi_plugin__Rocq_elpi_vernacular.Compiler.run_and_print in file "src/rocq_elpi_vernacular.ml", line 166, characters 8-38 -Called from Elpi_plugin__Rocq_elpi_vernacular.Interp.run_program.(fun) in file "src/rocq_elpi_vernacular.ml", line 557, characters 34-90 - -program -[p] -nth_R = -fun (T1 T2 : Type) (T_R : T1 -> T2 -> Type) (x01 : T1) - (x02 : T2) (x0_R : T_R x01 x02) => -let rec1 := - fix rec (n : nat) (l : list T1) {struct n} : T1 := - match l with - | nil => x01 - | (x :: xs)%list => match n with - | 0 => x - | S m => rec m xs - end - end in -let rec2 := - fix rec (n : nat) (l : list T2) {struct n} : T2 := - match l with - | nil => x02 - | (x :: xs)%list => match n with - | 0 => x - | S m => rec m xs - end - end in -fix rec_R (n1 n2 : nat) (n_R : nat_R n1 n2) {struct n_R} : - forall (l1 : list T1) (l2 : list T2), - list_R T1 T2 T_R l1 l2 -> T_R (rec1 n1 l1) (rec2 n2 l2) := - match - n_R in (nat_R s1 s2) - return - (forall (l1 : list T1) (l2 : list T2), - list_R T1 T2 T_R l1 l2 -> T_R (rec1 s1 l1) (rec2 s2 l2)) - with - | O_R => - let K := O_R in - (fun (n3 n4 : nat) (n_R0 : nat_R n3 n4) (l1 : list T1) - (l2 : list T2) (l_R : list_R T1 T2 T_R l1 l2) => - match - l_R in (list_R _ _ _ l3 l4) - return - (T_R - match l3 with - | nil => x01 - | (x :: xs)%list => - match n3 with - | 0 => x - | S m => rec1 m xs - end - end - match l4 with - | nil => x02 - | (x :: xs)%list => - match n4 with - | 0 => x - | S m => rec2 m xs - end - end) - with - | nil_R _ _ _ => x0_R - | cons_R _ _ _ x1 x2 x_R xs1 xs2 xs_R => - match - n_R0 in (nat_R n5 n6) - return - (T_R match n5 with - | 0 => x1 - | S m => rec1 m xs1 - end match n6 with - | 0 => x2 - | S m => rec2 m xs2 - end) - with - | O_R => x_R - | S_R m1 m2 m_R => rec_R m1 m2 m_R xs1 xs2 xs_R - end - end) 0 0 K - | S_R _1 _2 __R => - let K := S_R _1 _2 __R in - (fun (n3 n4 : nat) (n_R0 : nat_R n3 n4) (l1 : list T1) - (l2 : list T2) (l_R : list_R T1 T2 T_R l1 l2) => - match - l_R in (list_R _ _ _ l3 l4) - return - (T_R - match l3 with - | nil => x01 - | (x :: xs)%list => - match n3 with - | 0 => x - | S m => rec1 m xs - end - end - match l4 with - | nil => x02 - | (x :: xs)%list => - match n4 with - | 0 => x - | S m => rec2 m xs - end - end) - with - | nil_R _ _ _ => x0_R - | cons_R _ _ _ x1 x2 x_R xs1 xs2 xs_R => - match - n_R0 in (nat_R n5 n6) - return - (T_R match n5 with - | 0 => x1 - | S m => rec1 m xs1 - end match n6 with - | 0 => x2 - | S m => rec2 m xs2 - end) - with - | O_R => x_R - | S_R m1 m2 m_R => rec_R m1 m2 m_R xs1 xs2 xs_R - end - end) (S _1) (S _2) K - end - : forall (T1 T2 : Type) (T_R : T1 -> T2 -> Type) (x01 : T1) (x02 : T2), - T_R x01 x02 -> - forall n1 n2 : nat, - nat_R n1 n2 -> - forall (l1 : list T1) (l2 : list T2), - list_R T1 T2 T_R l1 l2 -> T_R (nth T1 x01 n1 l1) (nth T2 x02 n2 l2) - -Arguments nth_R (T1 T2)%type_scope T_R%function_scope - x01 x02 x0_R (n1 n2)%nat_scope n_R (l1 l2)%list_scope - l_R -pred_R = -fun (n1 n2 : nat) (n_R : nat_R n1 n2) => -match - n_R in (nat_R n3 n4) - return - (nat_R match n3 with - | 0 => n1 - | S u => u - end match n4 with - | 0 => n2 - | S u => u - end) -with -| O_R => n_R -| S_R _ _ u_R => u_R -end - : forall n1 n2 : nat, nat_R n1 n2 -> nat_R (Nat.pred n1) (Nat.pred n2) + rid:1 step:372 gid:1052 user:rule:builtin = success + +Debug: }}} -> (0.001s) +expanded_g = +fun T : Type => +let X := T in +fun (op : T -> X -> bool) (l s : list T) (h : bool) => +(forall (x : T) (y : X), op x y = false) /\ expanded_f true T op l s = h + : forall T : Type, (T -> T -> bool) -> list T -> list T -> bool -> Prop -Arguments pred_R (n1 n2)%nat_scope n_R -File "./apps/derive/tests/test_param2.v", line 85, characters 0-30: -Warning: Not a truly recursive fixpoint. [non-recursive,fixpoints,default] +Arguments expanded_g T%type_scope op%function_scope + (l s)%list_scope h%bool_scope +Cats.And.Dogs.x = 42 + : nat +(true && false)%bool + : bool +natmul R n : ringType_sort R + : ringType_sort R +natmul R n : ringType_sort R + : ringType_sort R [p 1, p 2, p 3, p 4, p 5, p 6, p 7, p 8, p 9, p 10, p 11, p 12, p 13, p 14, p 15, p 16, p 17, p 18, p 19, p 20, p 21, p 22, p 23, p 24, p 25, p 26, p 27, p 28, p 29, p 30, p 31, p 32, p 33, p 34, p 35, p 36, p 37, @@ -15179,1212 +15770,8 @@ p 3689, p 3690, p 3691, p 3692, p 3693, p 3694, p 3695, p 3696, p 3697, p 3698, p 3699, p 3700, p 3701, p 3702, p 3703, p 3704, p 3705, p 3706, p 3707, p 3708, p 3709, p 3710] - {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==[ |- => fun x : nat => ?Goal] (goal evar) - -SHELF:|| -FUTURE GOALS STACK: - || - -Rocq-Elpi mapping: -RAW: -?X2 <-> c0 \ X0 c0 -ELAB: -?X2 <-> X1 - -Debug: - {c0} : decl c0 `x` (global (indt «nat»)) - ?- evar (X0 c0) - (prod `_` (global (indt «bool»)) c1 \ global (indt «True»)) - (X1 c0) /* suspended on X0, X1 */ -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) [])] -[str fun, str in, str as, int 4, str end, str match, str return, str =>, - str :, str :=, str {, str }, str ;, str ,, str |, str x, int 1, str H, - trm - (fun `x` (global (indt «False»)) c0 \ - match c0 (fun `y` (global (indt «False»)) c1 \ global (indt «nat»)) - [])] -Query assignments: - T = sort (typ «elpi.tests.test_HOAS.3») - U = «elpi.tests.test_HOAS.3» -Query assignments: - U = «elpi.tests.test_HOAS.4» -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.4} |= -ALGEBRAIC UNIVERSES: - {} -FLEXIBLE UNIVERSES: - -SORTS: - -WEAK CONSTRAINTS: - - -Query assignments: - U = «foo» -Query assignments: - X = c0 \ c1 \ c2 \ -X0 c0 c1 c2 - X3_ = 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 - elpi.tests.test_HOAS.8 <= elpi.tests.test_HOAS.8 -ALGEBRAIC UNIVERSES: - {} -FLEXIBLE UNIVERSES: - -SORTS: - α3 := Type - α4 -WEAK 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 */ -EVARS: - ?X10==[ |- Type] (internal placeholder) {?elpi_evar} - ?X9==[a |- ?elpi_evar] (internal placeholder) {?e0} - ?X8==[a |- => ?elpi_evar] (internal placeholder) - -SHELF: -FUTURE GOALS STACK:?X10 -?X9 - -Rocq-Elpi mapping: -RAW: -?X9 <-> c0 \ X2 c0 -?X10 <-> X0 -ELAB: -?X9 <-> X2 -?X10 <-> X1 - -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: - {} -FLEXIBLE UNIVERSES: - -SORTS: - α5 -WEAK CONSTRAINTS: - - -Raw term: -app - [global (const «add»), primitive (uint63 2000000003333002), - primitive (uint63 1)] -Nice term: (2000000003333002 + 1)%uint63 -Red: -2000000003333003%uint63 -Raw term: -app - [global (const «add»), primitive (float64 24000000000000), - primitive (float64 1)] -Nice term: 24000000000000 + 1 -Red: 24000000000001 -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 `_elpi_renamed_n_3` (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»)]]] - X10_ = c0 \ c1 \ c2 \ -global (indt «nat») - X4_ = global (indt «nat») - X5_ = c0 \ -global (indt «nat») - X6_ = c0 \ c1 \ -global (indt «nat») - X7_ = c0 \ -global (indt «nat») - X8_ = c0 \ c1 \ -global (indt «nat») - X9_ = c0 \ c1 \ c2 \ c3 \ -global (indt «nat») -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 `_elpi_renamed_n_2` (global (indt «nat»)) c2 \ - global (indt «nat»)) - [c1, - fun `p` (global (indt «nat»)) c2 \ - app - [global (indc «S»), - app - [fix `plus` 0 - (prod `_elpi_renamed_n_3` (global (indt «nat»)) c3 \ - prod `_elpi_renamed_m_4` (global (indt «nat»)) c4 \ - global (indt «nat»)) c3 \ - fun `_elpi_renamed_n_4` (global (indt «nat»)) c4 \ - fun `_elpi_renamed_m_5` (global (indt «nat»)) c5 \ - match c4 - (fun `_elpi_renamed_n_6` (global (indt «nat»)) c6 \ - global (indt «nat»)) - [c5, - fun `_elpi_renamed_p_6` (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»)]]] - X11_ = global (indt «nat») - X12_ = c0 \ -global (indt «nat») - X13_ = c0 \ c1 \ c2 \ -global (indt «nat») - X14_ = c0 \ c1 \ -global (indt «nat») - X15_ = c0 \ c1 \ c2 \ -global (indt «nat») - X16_ = c0 \ c1 \ c2 \ c3 \ -global (indt «nat») - X17_ = c0 \ c1 \ c2 \ c3 \ c4 \ -global (indt «nat») - X18_ = c0 \ c1 \ c2 \ c3 \ -global (indt «nat») - X19_ = c0 \ c1 \ c2 \ c3 \ c4 \ -global (indt «nat») - X20_ = c0 \ c1 \ c2 \ c3 \ c4 \ c5 \ c6 \ -global (indt «nat») - X21_ = c0 \ c1 \ c2 \ c3 \ c4 \ c5 \ -global (indt «nat») -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 `_elpi_renamed_n_4` (global (indt «nat»)) c4 \ - global (indt «nat»)) - [c3, - fun `_elpi_renamed_p_4` (global (indt «nat»)) c4 \ - app [global (indc «S»), app [c1, c4, c3]]], c0, - app - [global (indc «S»), app [global (indc «S»), global (indc «O»)]]]]] - X22_ = global (indt «nat») - X23_ = global (indt «nat») - X24_ = c0 \ -global (indt «nat») - X25_ = c0 \ c1 \ -global (indt «nat») - X26_ = c0 \ c1 \ c2 \ -global (indt «nat») - X27_ = c0 \ c1 \ -global (indt «nat») - X28_ = c0 \ c1 \ c2 \ -global (indt «nat») - X29_ = c0 \ c1 \ c2 \ c3 \ c4 \ -global (indt «nat») - X30_ = c0 \ c1 \ c2 \ c3 \ -global (indt «nat») -Query assignments: - C = «Nat.add» - F = TODO - T = app - [global (indc «S»), - app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] - T1 = app - [global (const «Nat.add»), - app [global (indc «S»), global (indc «O»)], - app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] - T2 = app - [global (indc «S»), - app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] -Query assignments: - C = «proj1» -Query assignments: - C = «proj1» - P = elpi.tests.test_HOAS.P''.proj1 -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 «P.foo.u0»)) 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 «P.foo.u0»)) c0 \ - fun `f` (app [global (indt «P.foo»), c0]) c1 \ - app [primitive (proj elpi.tests.test_HOAS.P.p1 1), c1]) -some - (pglobal (const «toto») - «elpi.tests.test_HOAS.23 elpi.tests.test_HOAS.24») -prod `T1` (sort (typ «elpi.tests.test_HOAS.23»)) c0 \ - prod `T2` (sort (typ «elpi.tests.test_HOAS.24»)) c1 \ prod `x` c0 c2 \ c0 -Query assignments: - Body = some - (pglobal (const «toto») - «elpi.tests.test_HOAS.23 elpi.tests.test_HOAS.24») - C = «titi» - Term = prod `T1` (sort (typ «elpi.tests.test_HOAS.23»)) c0 \ - prod `T2` (sort (typ «elpi.tests.test_HOAS.24»)) c1 \ prod `x` c0 c2 \ c0 -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.24 elpi.tests.test_HOAS.23} |= -ALGEBRAIC UNIVERSES: - {} -FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.24 - elpi.tests.test_HOAS.23 -SORTS: - -WEAK CONSTRAINTS: - - -pglobal (const «toto») X0 -pglobal (const «toto») «u1 u2» -toto -Query assignments: - %arg1 = toto - X31_ = X0 - X32_ = «elpi.tests.test_HOAS.27 elpi.tests.test_HOAS.28» -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.28 elpi.tests.test_HOAS.27} |= -ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.28 elpi.tests.test_HOAS.27} -FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.28 - elpi.tests.test_HOAS.27 -SORTS: - -WEAK CONSTRAINTS: - - -app - [pglobal (const «t») X0, global (indt «nat»), - pglobal (const «fnat») X1] -app - [pglobal (const «t») «elpi.tests.test_HOAS.33», global (indt «nat»), - pglobal (const «fnat») «»] -Query assignments: - T = app - [pglobal (const «t») «elpi.tests.test_HOAS.33», global (indt «nat»), - pglobal (const «fnat») «»] - Ty = global (indt «nat») - X33_ = «elpi.tests.test_HOAS.33» - X34_ = «» -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.33} |= - Set <= elpi.tests.test_HOAS.33 - Set = elpi.tests.test_HOAS.33 -ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.33} -FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.33 := Set -SORTS: - -WEAK CONSTRAINTS: - - -Query assignments: - Arity = prod `T` (sort (typ «elpi.tests.test_HOAS.34»)) c0 \ - sort (typ «elpi.tests.test_HOAS.34») - GRF = indt «F» - I = «elpi.tests.test_HOAS.34» - Ind = «F» - K = [«Build_F»] - KTys = [prod `T` (sort (typ «elpi.tests.test_HOAS.34»)) c0 \ - prod `t` c0 c1 \ app [pglobal (indt «F») «elpi.tests.test_HOAS.34», c0]] - TyF = prod `T` (sort (typ «elpi.tests.test_HOAS.34»)) c0 \ - sort (typ «elpi.tests.test_HOAS.34») -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.34} |= -ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.34} -FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.34 -SORTS: - -WEAK CONSTRAINTS: - - -Query assignments: - Decl = parameter T explicit (sort (typ «elpi.tests.test_HOAS.35»)) c0 \ - record F (sort (typ «elpi.tests.test_HOAS.35»)) Build_F - (field [coercion off, canonical tt] t c0 c1 \ end-record) - GRF = indt «F» - I = «elpi.tests.test_HOAS.35» - Ind = «F» -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.35} |= -ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.35} -FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.35 -SORTS: - -WEAK CONSTRAINTS: - - -«elpi.tests.test_HOAS.36» «elpi.tests.test_HOAS.37» -Universe constraints: UNIVERSES: - {elpi.tests.test_HOAS.37 elpi.tests.test_HOAS.36} |= - ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.37 elpi.tests.test_HOAS.36} - FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.37 - elpi.tests.test_HOAS.36 - SORTS: - - WEAK CONSTRAINTS: - - -Universe constraints: UNIVERSES: - {elpi.tests.test_HOAS.37 elpi.tests.test_HOAS.36} |= - elpi.tests.test_HOAS.36 = elpi.tests.test_HOAS.37 - ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.37 elpi.tests.test_HOAS.36} - FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.37 - elpi.tests.test_HOAS.36 := elpi.tests.test_HOAS.37 - SORTS: - - WEAK CONSTRAINTS: - - -Query assignments: - GRF = indt «F» - I1 = «elpi.tests.test_HOAS.36» - I2 = «elpi.tests.test_HOAS.37» -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.37 elpi.tests.test_HOAS.36} |= - elpi.tests.test_HOAS.36 = elpi.tests.test_HOAS.37 -ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.37 elpi.tests.test_HOAS.36} -FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.37 - elpi.tests.test_HOAS.36 := elpi.tests.test_HOAS.37 -SORTS: - -WEAK CONSTRAINTS: - - -«elpi.tests.test_HOAS.38» «» -Universe constraints: UNIVERSES: - {elpi.tests.test_HOAS.38} |= - ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.38} - FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.38 - SORTS: - - WEAK CONSTRAINTS: - - -different universe instance lengths -Universe constraints: UNIVERSES: - {elpi.tests.test_HOAS.38} |= - ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.38} - FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.38 - SORTS: - - WEAK CONSTRAINTS: - - -Query assignments: - E = different universe instance lengths - GRF = indt «F» - GRfnat = const «fnat» - I1 = «elpi.tests.test_HOAS.38» - I2 = «» -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.38} |= -ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.38} -FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.38 -SORTS: - -WEAK CONSTRAINTS: - - -Query assignments: - GRF = indt «F» - I1 = «elpi.tests.test_HOAS.39» - I2 = «elpi.tests.test_HOAS.39» - U = «elpi.tests.test_HOAS.39» - UL1 = [«elpi.tests.test_HOAS.39»] -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.39} |= -ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.39} -FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.39 -SORTS: - -WEAK CONSTRAINTS: - - -Cannot enforce elpi.tests.test_HOAS.40 = elpi.tests.test_HOAS.41 because -elpi.tests.test_HOAS.40 < elpi.tests.test_HOAS.41 -Query assignments: - E = Cannot enforce elpi.tests.test_HOAS.40 = elpi.tests.test_HOAS.41 because -elpi.tests.test_HOAS.40 < elpi.tests.test_HOAS.41 - GRF = indt «F» - I1 = «elpi.tests.test_HOAS.40» - I2 = «elpi.tests.test_HOAS.41» - L1 = «elpi.tests.test_HOAS.40» - L2 = «elpi.tests.test_HOAS.41» - U1 = «elpi.tests.test_HOAS.40» - U2 = «elpi.tests.test_HOAS.41» -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.41 elpi.tests.test_HOAS.40} |= - elpi.tests.test_HOAS.40 < elpi.tests.test_HOAS.41 -ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.41 elpi.tests.test_HOAS.40} -FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.41 - elpi.tests.test_HOAS.40 -SORTS: - -WEAK CONSTRAINTS: - - -Universe constraints: UNIVERSES: - {elpi.tests.test_HOAS.45 elpi.tests.test_HOAS.44} |= - elpi.tests.test_HOAS.44 < elpi.tests.test_HOAS.45 - ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.45 elpi.tests.test_HOAS.44} - FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.45 - elpi.tests.test_HOAS.44 - SORTS: - - WEAK CONSTRAINTS: - - -Query assignments: - GRF = indt «F2» - I1 = «elpi.tests.test_HOAS.44» - I2 = «elpi.tests.test_HOAS.45» - L1 = «elpi.tests.test_HOAS.44» - L2 = «elpi.tests.test_HOAS.45» - U1 = «elpi.tests.test_HOAS.44» - U2 = «elpi.tests.test_HOAS.45» -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.45 elpi.tests.test_HOAS.44} |= - elpi.tests.test_HOAS.44 < elpi.tests.test_HOAS.45 - elpi.tests.test_HOAS.44 <= elpi.tests.test_HOAS.45 -ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.45 elpi.tests.test_HOAS.44} -FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.45 - elpi.tests.test_HOAS.44 -SORTS: - -WEAK CONSTRAINTS: - - -Universe constraints: UNIVERSES: - {elpi.tests.test_HOAS.47 elpi.tests.test_HOAS.46} |= - elpi.tests.test_HOAS.46 < elpi.tests.test_HOAS.47 - ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.47} - FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.47 - elpi.tests.test_HOAS.46 - SORTS: - - WEAK CONSTRAINTS: - - -Cannot enforce elpi.tests.test_HOAS.47 = elpi.tests.test_HOAS.46 because -elpi.tests.test_HOAS.46 < elpi.tests.test_HOAS.47 -Query assignments: - E = Cannot enforce elpi.tests.test_HOAS.47 = elpi.tests.test_HOAS.46 because -elpi.tests.test_HOAS.46 < elpi.tests.test_HOAS.47 - GRF = indt «F» - I1 = «elpi.tests.test_HOAS.46» - I2 = «elpi.tests.test_HOAS.47» - L1 = «elpi.tests.test_HOAS.46» - L2 = «elpi.tests.test_HOAS.47» - U1 = «elpi.tests.test_HOAS.46» - U2 = «elpi.tests.test_HOAS.47» -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.47 elpi.tests.test_HOAS.46} |= - elpi.tests.test_HOAS.46 < elpi.tests.test_HOAS.47 -ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.47} -FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.47 - elpi.tests.test_HOAS.46 -SORTS: - -WEAK CONSTRAINTS: - - -Query assignments: - GR = indt «nat» -Query assignments: - GR = indt «F» - I = «elpi.tests.test_HOAS.48» -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.48} |= -ALGEBRAIC UNIVERSES: - {} -FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.48 -SORTS: - -WEAK CONSTRAINTS: - - -Query assignments: - GR = indt «F» -pglobal (indt «F») «elpi.tests.test_HOAS.50» -Query assignments: - %arg1 = pglobal (indt «F») «elpi.tests.test_HOAS.50» - GR = indt «F» - I = «elpi.tests.test_HOAS.50» -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.50} |= -ALGEBRAIC UNIVERSES: - {} -FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.50 -SORTS: - -WEAK CONSTRAINTS: - - -«elpi.tests.test_HOAS.51 elpi.tests.test_HOAS.51» -Query assignments: - I = «elpi.tests.test_HOAS.51 elpi.tests.test_HOAS.51» - U = «elpi.tests.test_HOAS.51» -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.51} |= -ALGEBRAIC UNIVERSES: - {} -FLEXIBLE UNIVERSES: - -SORTS: - -WEAK CONSTRAINTS: - - -Universe constraints: ------------------- -Universe constraints: UNIVERSES: - {elpi.tests.test_HOAS.53 elpi.tests.test_HOAS.52} |= - elpi.tests.test_HOAS.52 < elpi.tests.test_HOAS.53 - ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.53 elpi.tests.test_HOAS.52} - FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.53 - elpi.tests.test_HOAS.52 - SORTS: - - WEAK CONSTRAINTS: - - -Universe constraints: UNIVERSES: - {elpi.tests.test_HOAS.53 elpi.tests.test_HOAS.52} |= - elpi.tests.test_HOAS.52 < elpi.tests.test_HOAS.53 - ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.53 elpi.tests.test_HOAS.52} - FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.53 - elpi.tests.test_HOAS.52 - SORTS: - - WEAK CONSTRAINTS: - - -Query assignments: - Body = sort (typ «elpi.tests.test_HOAS.52») - LX = «elpi.tests.test_HOAS.52» - LY = «elpi.tests.test_HOAS.53» - Type = sort (typ «elpi.tests.test_HOAS.53») - UX = «elpi.tests.test_HOAS.52» - UY = «elpi.tests.test_HOAS.53» -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.53 elpi.tests.test_HOAS.52} |= - elpi.tests.test_HOAS.52 < elpi.tests.test_HOAS.53 -ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.53 elpi.tests.test_HOAS.52} -FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.53 - elpi.tests.test_HOAS.52 -SORTS: - -WEAK CONSTRAINTS: - - -poly@{u u0} : Type@{u0} -(* u u0 |= u < u0 *) - -poly is universe polymorphic -poly is transparent -Expands to: Constant elpi.tests.test_HOAS.poly -poly@{Set -elpi.tests.test_HOAS.54} - : Type@{elpi.tests.test_HOAS.54} -(* {elpi.tests.test_HOAS.54} |= Set < elpi.tests.test_HOAS.54 *) -Box not a defined object. -sort (typ «Set») -Query assignments: - U = «elpi.tests.test_HOAS.55» -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.55} |= Set = elpi.tests.test_HOAS.55 -ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.55} -FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.55 := Set -SORTS: - -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 |= Set <= list.u0 - u <= list.u0 *) - -Arguments tree A%type_scope -Arguments leaf A%type_scope _ -Arguments node A%type_scope _ _%list_scope -parameter A explicit (sort (typ «elpi.tests.test_HOAS.64»)) c0 \ - inductive tree tt (arity (sort (typ «elpi.tests.test_HOAS.65»))) 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.69 elpi.tests.test_HOAS.68 - elpi.tests.test_HOAS.67 elpi.tests.test_HOAS.66 - elpi.tests.test_HOAS.65 elpi.tests.test_HOAS.64} |= - elpi.tests.test_HOAS.64 < elpi.tests.test_HOAS.66 - elpi.tests.test_HOAS.65 < elpi.tests.test_HOAS.67 - Set <= list.u0 - Set <= elpi.tests.test_HOAS.65 - Set <= elpi.tests.test_HOAS.69 - elpi.tests.test_HOAS.64 <= list.u0 - elpi.tests.test_HOAS.64 <= elpi.tests.test_HOAS.65 - elpi.tests.test_HOAS.64 <= elpi.tests.test_HOAS.68 - elpi.tests.test_HOAS.64 <= elpi.tests.test_HOAS.69 - elpi.tests.test_HOAS.65 <= list.u0 - elpi.tests.test_HOAS.65 <= elpi.tests.test_HOAS.68 - elpi.tests.test_HOAS.65 <= elpi.tests.test_HOAS.69 - elpi.tests.test_HOAS.68 <= elpi.tests.test_HOAS.65 - elpi.tests.test_HOAS.69 <= elpi.tests.test_HOAS.65 - ALGEBRAIC UNIVERSES: - {elpi.tests.test_HOAS.64} - FLEXIBLE UNIVERSES: - elpi.tests.test_HOAS.64 - SORTS: - - WEAK CONSTRAINTS: - - -Query assignments: - D = parameter A explicit (sort (typ «M.tree.u0»)) c0 \ - inductive tree tt (arity (sort (typ «M.tree.u1»))) c1 \ - [constructor leaf (arity (prod `_` c0 c2 \ c1)), - constructor node - (arity - (prod `_` c0 c2 \ prod `_` (app [global (indt «list»), c1]) c3 \ c1))] - I = «tree» - X35_ = X0 -Universe constraints: -UNIVERSES: - {elpi.tests.test_HOAS.69 elpi.tests.test_HOAS.68 elpi.tests.test_HOAS.67 - elpi.tests.test_HOAS.66} |= - M.tree.u0 < elpi.tests.test_HOAS.66 - M.tree.u1 < elpi.tests.test_HOAS.67 - Set <= elpi.tests.test_HOAS.69 - M.tree.u0 <= elpi.tests.test_HOAS.68 - M.tree.u0 <= elpi.tests.test_HOAS.69 - M.tree.u1 <= elpi.tests.test_HOAS.68 - M.tree.u1 <= elpi.tests.test_HOAS.69 - elpi.tests.test_HOAS.68 <= M.tree.u1 - elpi.tests.test_HOAS.69 <= M.tree.u1 -ALGEBRAIC UNIVERSES: - {M.tree.u0} -FLEXIBLE UNIVERSES: - M.tree.u0 -SORTS: - -WEAK CONSTRAINTS: - - -File "./tests/test_HOAS.v", line 94, characters 46-61: -Warning: -File "./tests/test_HOAS.v", line 94, characters 46-61 -X is linear: name it _X (discard) or X_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_HOAS.v", line 101, characters 19-24: -Warning: -File "./tests/test_HOAS.v", line 101, characters 19-24 -X is linear: name it _X (discard) or X_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_HOAS.v", line 127, characters 0-40: -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,default] -File "./tests/test_HOAS.v", line 130, characters 0-40: -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,default] -File "./tests/test_HOAS.v", line 306, characters 18-20: -Warning: -File "./tests/test_HOAS.v", line 306, characters 18-20 -Ty is linear: name it _Ty (discard) or Ty_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_HOAS.v", line 320, characters 43-48: -Warning: -File "./tests/test_HOAS.v", line 320, characters 43-48 -Arity is linear: name it _Arity (discard) or Arity_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_HOAS.v", line 320, characters 49-50: -Warning: -File "./tests/test_HOAS.v", line 320, characters 49-50 -K is linear: name it _K (discard) or K_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_HOAS.v", line 320, characters 51-55: -Warning: -File "./tests/test_HOAS.v", line 320, characters 51-55 -KTys is linear: name it _KTys (discard) or KTys_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_HOAS.v", line 316, characters 32-35: -Warning: -File "./tests/test_HOAS.v", line 316, characters 32-35 -TyF is linear: name it _TyF (discard) or TyF_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_HOAS.v", line 467, characters 42-46: -Warning: -File "./tests/test_HOAS.v", line 467, characters 42-46 -Decl is linear: name it _Decl (discard) or Decl_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "coq-builtin.elpi", line 461, characters 50-51: -Warning: -File "coq-builtin.elpi", line 461, characters 50-51 -I is linear: name it _I (discard) or I_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_HOAS.v", line 506, characters 20-22: -Warning: -File "./tests/test_HOAS.v", line 506, characters 20-22 -I2 is linear: name it _I2 (discard) or I2_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_HOAS.v", line 504, characters 23-26: -Warning: -File "./tests/test_HOAS.v", line 504, characters 23-26 -UL1 is linear: name it _UL1 (discard) or UL1_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_HOAS.v", line 558, characters 32-33: -Warning: -File "./tests/test_HOAS.v", line 558, characters 32-33 -I is linear: name it _I (discard) or I_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "coq-builtin.elpi", line 461, characters 50-51: -Warning: -File "coq-builtin.elpi", line 461, characters 50-51 -I is linear: name it _I (discard) or I_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_HOAS.v", line 629, characters 36-37: -Warning: -File "./tests/test_HOAS.v", line 629, characters 36-37 -U is linear: name it _U (discard) or U_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -ok -Query assignments: - X1 = «x1» - X2 = «x2» - X3 = «x3» -Query assignments: - M = [[mode-ground], [mode-input]] 1 -1 -1.000000 -1.2 -Query assignments: - C1 = «Nat.add» - C2 = «times» - X1 = tt - X2 = ff -Query assignments: - C1 = «x» -Query assignments: - XX = «elpi.tests.test_API2.xx» -Query assignments: - C1 = «x» - M = «elpi.tests.test_API2.xx» -Query assignments: - XX = «elpi.tests.test_API2.xx2» -Query assignments: - C1 = «x» - M = «elpi.tests.test_API2.xx2» -Query assignments: - C1 = «x» - M = «elpi.tests.test_API2.xx3» -Query assignments: - X1_ = X0 - X2_ = 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: - {} -FLEXIBLE UNIVERSES: - -SORTS: - α4 - α5 -WEAK CONSTRAINTS: - - -Non-discriminated database -Unfoldable variable definitions: all -Unfoldable constant definitions: all -Unfoldable projection definitions: all -Cut: emp -For any goal -> -For xeq -> exact xxx(level 0, pattern 0 = _, id 0) - -Query assignments: - X3_ = «elpi.tests.test_API2.7» -Universe constraints: -UNIVERSES: - -ALGEBRAIC UNIVERSES: - {elpi.tests.test_API2.7} -FLEXIBLE UNIVERSES: - elpi.tests.test_API2.7 -SORTS: - -WEAK CONSTRAINTS: - - -Query assignments: - %arg1 = «elpi.tests.test_API2.T» -Query assignments: - GR = const const EXN PRINTING: Not_found -Query assignments: - %arg1 = «elpi.tests.test_API2.F» - %arg2 = «elpi.tests.test_API2.X» -«elpi.tests.test_API2.G» -Query assignments: - G = «elpi.tests.test_API2.G» -Module G : Sig Definition id : X.T -> X.T. End := (F X) -Query assignments: - %arg1 = «elpi.tests.test_API2.F» - %arg2 = «elpi.tests.test_API2.X» -«elpi.tests.test_API2.H» -Query assignments: - H = «elpi.tests.test_API2.H» -Module H : Sig Definition id : nat -> nat. End := (F X) -Query assignments: - %arg1 = «elpi.tests.test_API2.T» -Query assignments: - GR = const const EXN PRINTING: Not_found -Module Type FT = Funsig (P:T) Sig Parameter idT : P.T -> P.T. End -Query assignments: - %arg1 = «elpi.tests.test_API2.FT» - %arg2 = «elpi.tests.test_API2.X» -«elpi.tests.test_API2.GT» -Query assignments: - G = «elpi.tests.test_API2.GT» -Module Type GT = Sig Parameter idT : X.T -> X.T. End -Query assignments: - %arg1 = «elpi.tests.test_API2.FT» - %arg2 = «elpi.tests.test_API2.X» -«elpi.tests.test_API2.HT» -Query assignments: - H = «elpi.tests.test_API2.HT» -Module Type HT = Sig Parameter idT : nat -> nat. End -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} -FLEXIBLE UNIVERSES: - elpi.tests.test_API2.9 - elpi.tests.test_API2.8 -SORTS: - -WEAK CONSTRAINTS: - - -Query assignments: - X10_ = c0 \ -X0 c0 - X11_ = X1 - X12_ = c0 \ -X0 c0 - X13_ = X2 - X14_ = c0 \ -X3 c0 - X15_ = c0 \ c1 \ -X4 c0 c1 - X16_ = X5 - X17_ = c0 \ -X6 c0 - X18_ = c0 \ c1 \ -X7 c0 c1 - X19_ = X8 - X20_ = c0 \ -X9 c0 - X21_ = c0 \ c1 \ -X10 c0 c1 - X22_ = X8 - X4_ = X11 - X5_ = X11 - X6_ = X12 - X7_ = X13 - X8_ = c0 \ -X14 c0 - X9_ = X1 -Syntactic constraints: - evar X8 (sort (typ «elpi.tests.test_API2.25»)) X8 /* suspended on X8 */ - evar X8 (sort (typ «elpi.tests.test_API2.28»)) X8 /* suspended on X8 */ - {c0 c1} : decl c1 `x` (X9 c0), decl c0 `z` X8 - ?- evar (X10 c0 c1) (sort (typ «elpi.tests.test_API2.27»)) (X10 c0 c1) /* suspended on X10 */ - {c0} : decl c0 `z` X8 - ?- evar (X9 c0) (sort (typ «elpi.tests.test_API2.26»)) (X9 c0) /* suspended on X9 */ - {c0 c1} : decl c1 `x` (X6 c0), decl c0 `z` X5 - ?- evar (X7 c0 c1) (sort (typ «elpi.tests.test_API2.24»)) (X7 c0 c1) /* suspended on X7 */ - {c0} : decl c0 `z` X5 - ?- evar (X6 c0) (sort (typ «elpi.tests.test_API2.23»)) (X6 c0) /* suspended on X6 */ - evar (X5) (sort (typ «elpi.tests.test_API2.22»)) (X5) /* suspended on X5 */ - {c0 c1} : decl c1 `x` (X3 c0), decl c0 `z` X2 - ?- evar (X4 c0 c1) (sort (typ «elpi.tests.test_API2.21»)) (X4 c0 c1) /* suspended on X4 */ - {c0} : decl c0 `z` X2 - ?- evar (X3 c0) (sort (typ «elpi.tests.test_API2.20»)) (X3 c0) /* suspended on X3 */ - evar (X2) (sort (typ «elpi.tests.test_API2.19»)) (X2) /* suspended on X2 */ - evar X1 (sort (typ «elpi.tests.test_API2.15»)) X1 /* suspended on X1 */ - evar X1 (sort (typ «elpi.tests.test_API2.17»)) X1 /* suspended on X1 */ - {c0} : decl c0 `x` X1 - ?- evar (X0 c0) (sort (typ «elpi.tests.test_API2.16»)) (X0 c0) /* suspended on X0 */ - {c0} : decl c0 `x` X1 - ?- evar (X0 c0) (sort (typ «elpi.tests.test_API2.18»)) (X0 c0) /* suspended on X0 */ - {c0} : decl c0 `x` X13 - ?- evar (X14 c0) (sort (typ «elpi.tests.test_API2.14»)) (X14 c0) /* suspended on X14 */ - evar (X13) (sort (typ «elpi.tests.test_API2.13»)) (X13) /* suspended on X13 */ - evar (X12) (sort (typ «elpi.tests.test_API2.12»)) (X12) /* suspended on X12 */ - evar X11 (sort (typ «elpi.tests.test_API2.10»)) X11 /* suspended on X11 */ - evar X11 (sort (typ «elpi.tests.test_API2.11»)) X11 /* suspended on X11 */ -Universe constraints: -UNIVERSES: - {elpi.tests.test_API2.28 elpi.tests.test_API2.27 elpi.tests.test_API2.26 - elpi.tests.test_API2.25 elpi.tests.test_API2.24 elpi.tests.test_API2.23 - elpi.tests.test_API2.22 elpi.tests.test_API2.21 elpi.tests.test_API2.20 - elpi.tests.test_API2.19 elpi.tests.test_API2.18 elpi.tests.test_API2.17 - elpi.tests.test_API2.16 elpi.tests.test_API2.15 elpi.tests.test_API2.14 - elpi.tests.test_API2.13 elpi.tests.test_API2.12 elpi.tests.test_API2.11 - elpi.tests.test_API2.10} |= -ALGEBRAIC UNIVERSES: - {} -FLEXIBLE UNIVERSES: - -SORTS: - α6 - α7 - α8 - α9 - α10 - α11 - α12 - α13 - α14 - α15 - α16 - α17 - α18 - α19 - α20 - α21 - α22 - α23 - α24 -WEAK CONSTRAINTS: - - -File "./tests/test_API2.v", line 127, characters 0-16: -Warning: Option Foo Bar is deprecated. elpi -[deprecated-option,deprecated,default] -File "./tests/test_API2.v", line 135, characters 0-14: -Warning: Option Foo Bar is deprecated. elpi -[deprecated-option,deprecated,default] -File "./tests/test_API2.v", line 216, characters 23-24: -Warning: -File "./tests/test_API2.v", line 216, characters 23-24 -M is linear: name it _M (discard) or M_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API2.v", line 224, characters 31-32: -Warning: -File "./tests/test_API2.v", line 224, characters 31-32 -T is linear: name it _T (discard) or T_ (fresh variable) -[elpi.linear-variable,elpi.typecheck,elpi,default] -File "./tests/test_API2.v", line 372, characters 0-228: -Warning: -Undeclared globals: -- File "./tests/test_API2.v", line 373, column 2, characters 8777-8787: test. -Please add the following text to your program: -type test term -> term -> prop. -[elpi.missing-types,elpi.typecheck,elpi,default] + : nat Query assignments: BO = fix `add` 0 (prod `n` (global (indt «nat»)) c0 \ @@ -18145,7 +17532,7 @@ RingMicromega.PsatzZ; RMicromega.CPow; Field_theory.FEinv; Tauto.IFF; Ring_polynom.PEpow; RMicromega.CInv; Field_theory.FEdiv; Tauto.EQ; RMicromega.COpp; Field_theory.FEpow; }} - T = 1.838537 + T = 7.792647 Query assignments: %arg1 = 4 S = {{ Nat.add; eq; nat; O; }} @@ -18299,125 +17686,659 @@ File "./tests-stdlib/test_API_env.v", line 293, characters 30-32 UR is linear: name it _UR (discard) or UR_ (fresh variable) [elpi.linear-variable,elpi.typecheck,elpi,default] +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.lock_container.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.lock_container2.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: - Len = 2 - Rules = [tc.instance [] (const «Bool.Decidable_eq_bool») - (indt «DecidableClass.Decidable») [], - tc.instance [] (const «DecidableClass.Decidable_not») - (indt «DecidableClass.Decidable») []] -All the remaining goals are on the shelf. + GR = const «id1» +id2.body@{u} : forall T : Type@{u}, T -> T +(* u |= u < eq.u0 *) -1 goal +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 *) -goal 1 is: - C -1 goal - - ============================ - C -All the remaining goals are on the shelf. +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 -1 goal +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 *) -goal 1 is: - C -1 goal - - ============================ - C -Debug: -Calling typeclass resolution with flags: depth = ∞,unique = false,fail = true -Debug: 1: looking for (C ?i) with backtracking -Debug: 1.1: exact i2 on (C ?i), 0 subgoal(s) -Debug: 2: looking for (E 2) without backtracking -Debug: 2: no match for (E 2), 0 possibilities -Debug: 1.2: exact i1 on (C ?i), 0 subgoal(s) -Debug: 2: looking for (E 1) without backtracking -Debug: 2.1: exact e1 on (E 1), 0 subgoal(s) -Debug: -Calling typeclass resolution with flags: depth = ∞,unique = false,fail = true -Debug: 1: looking for (C ?i) with backtracking -Debug: 1.1: exact i2 on (C ?i), 0 subgoal(s) +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» Debug: -Calling typeclass resolution with flags: depth = ∞,unique = false,fail = true -Debug: 1: looking for (E 2) without backtracking -Debug: 1: no match for (E 2), 0 possibilities -Debug: 1: looking for (C ?i) with backtracking -Debug: 1.1: exact i2 on (C ?i), 0 subgoal(s) -Debug: 2: looking for (E 2) without backtracking -Debug: 2: no match for (E 2), 0 possibilities -Debug: 1.2: exact i1 on (C ?i), 0 subgoal(s) -Debug: 2: looking for (E 1) without backtracking -Debug: 2.1: exact e1 on (E 1), 0 subgoal(s) -[seal (goal [] (X0) (app [global (indt «C»), X1]) (X2) []), - seal (goal [] (X3) (app [global (indt «E»), X1]) (X4) [])] -Goal is C ?i -Solution for C 2 is i2 -Goal is E 2 -Solution for C 1 is i1 -Goal is E 1 -Solution for E 1 is e1 -[TC] For indt «C» : - elpi predicate : tc-C - search mode is : tc.deterministic - modes are : [o, o] -File "./apps/eltac/tests-stdlib/test_injection.v", line 15, characters 0-15: -Warning: Using Vector.t is known to be technically difficult, see -. -[warn-library-file-stdlib-vector,stdlib-vector,warn-library-file,user-warn,default] -File "./apps/tc/tests/test_tc_declare.v", line 8, characters 2-36: +elpi lets escape exception: Universe + elpi.apps.locker.tests.test_locker.161 (File "./apps/locker/tests/test_locker.v", line 113, characters 50-54) + is unbound. +Raised at UState.error_unbound_universes in file "engine/uState.ml", line 832, characters 41-74 +Called from UState.universe_context_inst in file "engine/uState.ml", line 845, characters 9-58 +Called from UState.check_poly_univ_decl in file "engine/uState.ml", line 901, characters 13-63 +Called from UState.check_univ_decl in file "engine/uState.ml", line 917, characters 35-67 +Called from Elpi_plugin__Rocq_elpi_builtins.add_axiom_or_variable in file "src/rocq_elpi_builtins.ml", line 913, characters 14-82 +Called from Elpi_plugin__Rocq_elpi_builtins.coq_rest_builtins.(fun) in file "src/rocq_elpi_builtins.ml", line 2068, characters 20-86 +Called from Elpi_plugin__Rocq_elpi_builtins.grab_global_env.(fun) in file "src/rocq_elpi_builtins.ml", line 141, characters 33-44 +Called from Elpi_runtime__Runtime_trace_off.FFI.wrap_type_err in file "src/runtime/runtime_trace_off.ml", line 2125, characters 6-9 +Called from Elpi_runtime__Runtime_trace_off.FFI.call.aux in file "src/runtime/runtime_trace_off.ml", line 2207, characters 32-92 +Called from Elpi_runtime__Runtime_trace_off.FFI.call in file "src/runtime/runtime_trace_off.ml", line 2299, characters 21-70 +Called from Elpi_runtime__Runtime_trace_off.Constraints.exect_builtin_predicate in file "src/runtime/runtime_trace_off.ml", line 3565, characters 20-83 +Called from Elpi_runtime__Runtime_trace_off.Mainloop.make_runtime.run in file "src/runtime/runtime_trace_off.ml", line 3983, characters 19-90 +Called from Elpi_util__Util.Fork.fork.ensure_runtime in file "src/utils/util.ml", line 523, characters 16-19 +Re-raised at Elpi_util__Util.Fork.fork.ensure_runtime in file "src/utils/util.ml", line 532, characters 7-14 +Called from Elpi_runtime__Runtime_trace_off.mk_outcome in file "src/runtime/runtime_trace_off.ml", line 4265, characters 14-23 +Called from Elpi_runtime__Runtime_trace_off.execute_once in file "src/runtime/runtime_trace_off.ml", line 4282, characters 20-242 +Re-raised at Elpi_runtime__Runtime_trace_off.execute_once in file "src/runtime/runtime_trace_off.ml", line 4287, characters 2-9 +Called from Elpi__API.Execute.once in file "src/API.ml", line 235, characters 40-91 +Called from Elpi_plugin__Rocq_elpi_vernacular.Compiler.run in file "src/rocq_elpi_vernacular.ml", line 145, characters 13-55 +Re-raised at Exninfo.iraise in file "clib/exninfo.ml", line 81, characters 4-38 +Called from Elpi_plugin__Rocq_elpi_vernacular.Compiler.run_and_print in file "src/rocq_elpi_vernacular.ml", line 166, characters 8-38 +Called from Elpi_plugin__Rocq_elpi_vernacular.Interp.run_program.(fun) in file "src/rocq_elpi_vernacular.ml", line 557, characters 34-90 + +Goal: +[decl c1 `y` (global (indt «nat»)), decl c0 `x` (global (indt «nat»))] +|- X0 c0 c1 : +app + [global (indt «eq»), global (indt «nat»), + app + [global (const «Nat.add»), c0, + app [global (indc «S»), global (indc «O»)]], c1] +(I, 0) +conj : forall [A B : Prop], A -> B -> A /\ B + +conj is not universe polymorphic +Arguments conj [A B]%type_scope _ _ +Expands to: Constructor Coq.Init.Logic.conj +(ex_intro (fun t : Prop => True /\ True /\ t) True (conj I (conj I I))) +[int 1, str x, str a b, + trm + (app + [global (indt «eq»), X0, + app [global (indc «S»), global (indc «O»)], global (indc «O»)])] +Using H ?p of type Q +Using H ?p of type Q +Using p of type P +[trm c0, trm c3, trm (app [c2, c3])] +found P +found P /\ P +Goal: [decl c0 `x` (global (indt «nat»))] |- X0 c0 : +app + [global (indt «eq»), global (indt «nat»), + app + [global (const «Nat.add»), c0, + app [global (indc «S»), global (indc «O»)]], global (indc «O»)] +Proof state: + {c0} : decl c0 `x` (global (indt «nat»)) + ?- evar (X1 c0) + (app + [global (indt «eq»), global (indt «nat»), + app + [global (const «Nat.add»), c0, + app [global (indc «S»), global (indc «O»)]], + global (indc «O»)]) (X0 c0) /* suspended on X1, X0 */ +EVARS: + ?X57==[x |- x + 1 = 0] (goal evar) {?Goal} + ?X56==[ |- => fun x : nat => ?Goal] (goal evar) + ?X55==[x |- => nat] (parameter A of eq) + ?X54==[ |- => nat] (type of x) + +SHELF:|| +FUTURE GOALS STACK: + || + +Rocq-Elpi mapping: +RAW: +?X57 <-> c0 \ X1 c0 +ELAB: +?X57 <-> X0 + +#goals = 2 +[nabla c0 \ + nabla c1 \ + seal + (goal [decl c1 `Q` (sort prop), decl c0 `P` (sort prop)] (X0 c0 c1) c0 + (X1 c0 c1) []), + nabla c0 \ + nabla c1 \ + seal + (goal [decl c1 `Q` (sort prop), decl c0 `P` (sort prop)] (X2 c0 c1) c1 + (X3 c0 c1) [])] +(fun (P Q : Prop) (p : P) (q : Q) => conj ?Goal (conj ?Goal0 ?Goal1)) +(fun (P Q : Prop) (p : P) (q : Q) => conj ?Goal0 (conj ?Goal ?Goal0)) +foo = 46 + : nat +bar = (false :: nil)%list + : list bool +baz = (46%nat :: nil)%list + : list nat +File "./examples/tutorial_coq_elpi_tactic.v", line 632, characters 0-22: +Warning: x is already taken, Elpi will make a name up [lib,elpi,default] +File "./examples/tutorial_coq_elpi_tactic.v", line 742, characters 32-33: Warning: -This command does not fully mirror the watned behavior if the class has methods -with implicit arguments (those implicits will be neglected) -[[TC] Warning,TC.Declare,elpi,default] -File "./apps/tc/tests/test_tc_declare.v", line 20, characters 2-53: +File "./examples/tutorial_coq_elpi_tactic.v", line 742, characters 32-33 +A is linear: name it _A (discard) or A_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_tactic.v", line 742, characters 40-41: Warning: -This command does not fully mirror the watned behavior if the class has methods -with implicit arguments (those implicits will be neglected) -[[TC] Warning,TC.Declare,elpi,default] -File "./apps/tc/tests/test_tc_declare.v", line 50, characters 2-47: +File "./examples/tutorial_coq_elpi_tactic.v", line 742, characters 40-41 +B is linear: name it _B (discard) or B_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_tactic.v", line 742, characters 14-17: Warning: -This command does not fully mirror the watned behavior if the class has methods -with implicit arguments (those implicits will be neglected) -[[TC] Warning,TC.Declare,elpi,default] -File "./apps/tc/tests/test_tc_declare.v", line 63, characters 2-51: +File "./examples/tutorial_coq_elpi_tactic.v", line 742, characters 14-17 +Ctx is linear: name it _Ctx (discard) or Ctx_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_tactic.v", line 843, characters 44-46: Warning: -This command does not fully mirror the watned behavior if the class has methods -with implicit arguments (those implicits will be neglected) -[[TC] Warning,TC.Declare,elpi,default] -In tc-A -In tc-A -In tc-B -In tc-A -In tc-B -In tc-A -c AX (BX AX) : C AX (BX AX) - : C AX (BX AX) +File "./examples/tutorial_coq_elpi_tactic.v", line 843, characters 44-46 +G1 is linear: name it _G1 (discard) or G1_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./examples/tutorial_coq_elpi_tactic.v", line 844, characters 44-46: +Warning: +File "./examples/tutorial_coq_elpi_tactic.v", line 844, characters 44-46 +G2 is linear: name it _G2 (discard) or G2_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +d + : nat +program +[p] +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 +normP : +forall {T : Type} {e : T} {op : T -> T -> T} {gamma : list T} {t1 t2 : lang}, +(forall a b c : T, op a (op b c) = op (op a b) c) -> +(forall a : T, op e a = a) -> +(forall a : T, op a e = a) -> +norm t1 = norm t2 -> interp T e op gamma t1 = interp T e op gamma t2 + +normP is not universe polymorphic +Arguments normP {T}%type_scope {e} {op}%function_scope + {gamma}%list_scope {t1 t2} (p1 p2 p3)%function_scope + H +normP is transparent +Expands to: Constant elpi_examples_stdlib.example_reflexive_tactic.normP +(fun x y z t : Z => + normP Z.add_assoc Z.add_0_l Z.add_0_r + (eq_refl + <: + norm (add (add (var 0) (var 1)) (add (add (var 2) zero) (var 3))) = + norm (add (add (var 0) (add (var 1) (var 2))) (var 3)))) +Debug: In environment +x, y, z, t : Z +Unable to unify "var 1" with + "var 0". +Raised at Loc.raise in file "lib/loc.ml", line 101, characters 16-23 +Called from Unification.unify_0_with_initial_metas in file "pretyping/unification.ml", line 1281, characters 13-48 +Re-raised at Exninfo.iraise in file "clib/exninfo.ml", line 81, characters 4-38 +Called from Unification.unify_with_eta in file "pretyping/unification.ml", line 1320, characters 14-48 +Called from Unification.merge_instances in file "pretyping/unification.ml", line 1333, characters 23-64 +Called from Unification.w_merge.w_merge_rec in file "pretyping/unification.ml", line 1554, characters 14-63 +Called from Unification.w_merge in file "pretyping/unification.ml", lines 1608-1610, characters 4-35 +Called from Unification.w_unify_core_0 in file "pretyping/unification.ml", line 1661, characters 12-65 +Called from Clenv.clenv_unify in file "proofs/clenv.ml", line 298, characters 25-73 +Called from Clenv.res_pf.(fun) in file "proofs/clenv.ml", line 771, characters 16-56 +Called from Proofview.Goal.enter.f in file "engine/proofview.ml", line 1136, characters 40-46 +Called from Proofview.Goal.enter.(fun) in file "engine/proofview.ml", line 1141, characters 10-34 + +Query assignments: + X1 = «x1» + X2 = «x2» + X3 = «x3» +Query assignments: + M = [[mode-ground], [mode-input]] +1 +1 +1.000000 +1.2 +Query assignments: + C1 = «Nat.add» + C2 = «times» + X1 = tt + X2 = ff +Query assignments: + C1 = «x» +Query assignments: + XX = «elpi.tests.test_API2.xx» +Query assignments: + C1 = «x» + M = «elpi.tests.test_API2.xx» +Query assignments: + XX = «elpi.tests.test_API2.xx2» +Query assignments: + C1 = «x» + M = «elpi.tests.test_API2.xx2» +Query assignments: + C1 = «x» + M = «elpi.tests.test_API2.xx3» Query assignments: - S = app - [global (const «c»), global (const «AX»), - app [global (const «BX»), X0]] X1_ = X0 - X2_ = global (const «AX») - X3_ = app [global (const «BX»), X0] + X2_ = X1 Syntactic constraints: - evar (X0) (global (indt «A»)) (X0) /* suspended on X0 */ + 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.apps.tc.tests.hyp_in_conl.15 elpi.apps.tc.tests.hyp_in_conl.14 - elpi.apps.tc.tests.hyp_in_conl.13} |= + {elpi.tests.test_API2.6 elpi.tests.test_API2.5} |= +ALGEBRAIC UNIVERSES: + {} +FLEXIBLE UNIVERSES: + +SORTS: + α4 + α5 +WEAK CONSTRAINTS: + + +Non-discriminated database +Unfoldable variable definitions: all +Unfoldable constant definitions: all +Unfoldable projection definitions: all +Cut: emp +For any goal -> +For xeq -> exact xxx(level 0, pattern 0 = _, id 0) + +Query assignments: + X3_ = «elpi.tests.test_API2.7» +Universe constraints: +UNIVERSES: + +ALGEBRAIC UNIVERSES: + {elpi.tests.test_API2.7} +FLEXIBLE UNIVERSES: + elpi.tests.test_API2.7 +SORTS: + +WEAK CONSTRAINTS: + + +Query assignments: + %arg1 = «elpi.tests.test_API2.T» +Query assignments: + GR = const const EXN PRINTING: Not_found +Query assignments: + %arg1 = «elpi.tests.test_API2.F» + %arg2 = «elpi.tests.test_API2.X» +«elpi.tests.test_API2.G» +Query assignments: + G = «elpi.tests.test_API2.G» +Module G : Sig Definition id : X.T -> X.T. End := (F X) +Query assignments: + %arg1 = «elpi.tests.test_API2.F» + %arg2 = «elpi.tests.test_API2.X» +«elpi.tests.test_API2.H» +Query assignments: + H = «elpi.tests.test_API2.H» +Module H : Sig Definition id : nat -> nat. End := (F X) +Query assignments: + %arg1 = «elpi.tests.test_API2.T» +Query assignments: + GR = const const EXN PRINTING: Not_found +Module Type FT = Funsig (P:T) Sig Parameter idT : P.T -> P.T. End +Query assignments: + %arg1 = «elpi.tests.test_API2.FT» + %arg2 = «elpi.tests.test_API2.X» +«elpi.tests.test_API2.GT» +Query assignments: + G = «elpi.tests.test_API2.GT» +Module Type GT = Sig Parameter idT : X.T -> X.T. End +Query assignments: + %arg1 = «elpi.tests.test_API2.FT» + %arg2 = «elpi.tests.test_API2.X» +«elpi.tests.test_API2.HT» +Query assignments: + H = «elpi.tests.test_API2.HT» +Module Type HT = Sig Parameter idT : nat -> nat. End +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} +FLEXIBLE UNIVERSES: + elpi.tests.test_API2.9 + elpi.tests.test_API2.8 +SORTS: + +WEAK CONSTRAINTS: + + +Query assignments: + X10_ = c0 \ +X0 c0 + X11_ = X1 + X12_ = c0 \ +X0 c0 + X13_ = X2 + X14_ = c0 \ +X3 c0 + X15_ = c0 \ c1 \ +X4 c0 c1 + X16_ = X5 + X17_ = c0 \ +X6 c0 + X18_ = c0 \ c1 \ +X7 c0 c1 + X19_ = X8 + X20_ = c0 \ +X9 c0 + X21_ = c0 \ c1 \ +X10 c0 c1 + X22_ = X8 + X4_ = X11 + X5_ = X11 + X6_ = X12 + X7_ = X13 + X8_ = c0 \ +X14 c0 + X9_ = X1 +Syntactic constraints: + evar X8 (sort (typ «elpi.tests.test_API2.25»)) X8 /* suspended on X8 */ + evar X8 (sort (typ «elpi.tests.test_API2.28»)) X8 /* suspended on X8 */ + {c0 c1} : decl c1 `x` (X9 c0), decl c0 `z` X8 + ?- evar (X10 c0 c1) (sort (typ «elpi.tests.test_API2.27»)) (X10 c0 c1) /* suspended on X10 */ + {c0} : decl c0 `z` X8 + ?- evar (X9 c0) (sort (typ «elpi.tests.test_API2.26»)) (X9 c0) /* suspended on X9 */ + {c0 c1} : decl c1 `x` (X6 c0), decl c0 `z` X5 + ?- evar (X7 c0 c1) (sort (typ «elpi.tests.test_API2.24»)) (X7 c0 c1) /* suspended on X7 */ + {c0} : decl c0 `z` X5 + ?- evar (X6 c0) (sort (typ «elpi.tests.test_API2.23»)) (X6 c0) /* suspended on X6 */ + evar (X5) (sort (typ «elpi.tests.test_API2.22»)) (X5) /* suspended on X5 */ + {c0 c1} : decl c1 `x` (X3 c0), decl c0 `z` X2 + ?- evar (X4 c0 c1) (sort (typ «elpi.tests.test_API2.21»)) (X4 c0 c1) /* suspended on X4 */ + {c0} : decl c0 `z` X2 + ?- evar (X3 c0) (sort (typ «elpi.tests.test_API2.20»)) (X3 c0) /* suspended on X3 */ + evar (X2) (sort (typ «elpi.tests.test_API2.19»)) (X2) /* suspended on X2 */ + evar X1 (sort (typ «elpi.tests.test_API2.15»)) X1 /* suspended on X1 */ + evar X1 (sort (typ «elpi.tests.test_API2.17»)) X1 /* suspended on X1 */ + {c0} : decl c0 `x` X1 + ?- evar (X0 c0) (sort (typ «elpi.tests.test_API2.16»)) (X0 c0) /* suspended on X0 */ + {c0} : decl c0 `x` X1 + ?- evar (X0 c0) (sort (typ «elpi.tests.test_API2.18»)) (X0 c0) /* suspended on X0 */ + {c0} : decl c0 `x` X13 + ?- evar (X14 c0) (sort (typ «elpi.tests.test_API2.14»)) (X14 c0) /* suspended on X14 */ + evar (X13) (sort (typ «elpi.tests.test_API2.13»)) (X13) /* suspended on X13 */ + evar (X12) (sort (typ «elpi.tests.test_API2.12»)) (X12) /* suspended on X12 */ + evar X11 (sort (typ «elpi.tests.test_API2.10»)) X11 /* suspended on X11 */ + evar X11 (sort (typ «elpi.tests.test_API2.11»)) X11 /* suspended on X11 */ +Universe constraints: +UNIVERSES: + {elpi.tests.test_API2.28 elpi.tests.test_API2.27 elpi.tests.test_API2.26 + elpi.tests.test_API2.25 elpi.tests.test_API2.24 elpi.tests.test_API2.23 + elpi.tests.test_API2.22 elpi.tests.test_API2.21 elpi.tests.test_API2.20 + elpi.tests.test_API2.19 elpi.tests.test_API2.18 elpi.tests.test_API2.17 + elpi.tests.test_API2.16 elpi.tests.test_API2.15 elpi.tests.test_API2.14 + elpi.tests.test_API2.13 elpi.tests.test_API2.12 elpi.tests.test_API2.11 + elpi.tests.test_API2.10} |= ALGEBRAIC UNIVERSES: {} FLEXIBLE UNIVERSES: SORTS: + α6 + α7 + α8 + α9 + α10 + α11 α12 α13 - α14 >= Prop + α14 + α15 + α16 + α17 + α18 + α19 + α20 + α21 + α22 + α23 + α24 WEAK CONSTRAINTS: -(fun x : tele => tele_fmap) +File "./tests/test_API2.v", line 127, characters 0-16: +Warning: Option Foo Bar is deprecated. elpi +[deprecated-option,deprecated,default] +File "./tests/test_API2.v", line 135, characters 0-14: +Warning: Option Foo Bar is deprecated. elpi +[deprecated-option,deprecated,default] +File "./tests/test_API2.v", line 216, characters 23-24: +Warning: +File "./tests/test_API2.v", line 216, characters 23-24 +M is linear: name it _M (discard) or M_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API2.v", line 224, characters 31-32: +Warning: +File "./tests/test_API2.v", line 224, characters 31-32 +T is linear: name it _T (discard) or T_ (fresh variable) +[elpi.linear-variable,elpi.typecheck,elpi,default] +File "./tests/test_API2.v", line 372, characters 0-228: +Warning: +Undeclared globals: +- File "./tests/test_API2.v", line 373, column 2, characters 8777-8787: test. +Please add the following text to your program: +type test term -> term -> prop. +[elpi.missing-types,elpi.typecheck,elpi,default] +global (indc «O») +app + [global (indc «S»), + app [global (indc «S»), app [global (indc «S»), global (indc «O»)]]] +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 _ _ +true : bool + : bool +ok +nth_R = +fun (T1 T2 : Type) (T_R : T1 -> T2 -> Type) (x01 : T1) + (x02 : T2) (x0_R : T_R x01 x02) => +let rec1 := + fix rec (n : nat) (l : list T1) {struct n} : T1 := + match l with + | nil => x01 + | (x :: xs)%list => match n with + | 0 => x + | S m => rec m xs + end + end in +let rec2 := + fix rec (n : nat) (l : list T2) {struct n} : T2 := + match l with + | nil => x02 + | (x :: xs)%list => match n with + | 0 => x + | S m => rec m xs + end + end in +fix rec_R (n1 n2 : nat) (n_R : nat_R n1 n2) {struct n_R} : + forall (l1 : list T1) (l2 : list T2), + list_R T1 T2 T_R l1 l2 -> T_R (rec1 n1 l1) (rec2 n2 l2) := + match + n_R in (nat_R s1 s2) + return + (forall (l1 : list T1) (l2 : list T2), + list_R T1 T2 T_R l1 l2 -> T_R (rec1 s1 l1) (rec2 s2 l2)) + with + | O_R => + let K := O_R in + (fun (n3 n4 : nat) (n_R0 : nat_R n3 n4) (l1 : list T1) + (l2 : list T2) (l_R : list_R T1 T2 T_R l1 l2) => + match + l_R in (list_R _ _ _ l3 l4) + return + (T_R + match l3 with + | nil => x01 + | (x :: xs)%list => + match n3 with + | 0 => x + | S m => rec1 m xs + end + end + match l4 with + | nil => x02 + | (x :: xs)%list => + match n4 with + | 0 => x + | S m => rec2 m xs + end + end) + with + | nil_R _ _ _ => x0_R + | cons_R _ _ _ x1 x2 x_R xs1 xs2 xs_R => + match + n_R0 in (nat_R n5 n6) + return + (T_R match n5 with + | 0 => x1 + | S m => rec1 m xs1 + end match n6 with + | 0 => x2 + | S m => rec2 m xs2 + end) + with + | O_R => x_R + | S_R m1 m2 m_R => rec_R m1 m2 m_R xs1 xs2 xs_R + end + end) 0 0 K + | S_R _1 _2 __R => + let K := S_R _1 _2 __R in + (fun (n3 n4 : nat) (n_R0 : nat_R n3 n4) (l1 : list T1) + (l2 : list T2) (l_R : list_R T1 T2 T_R l1 l2) => + match + l_R in (list_R _ _ _ l3 l4) + return + (T_R + match l3 with + | nil => x01 + | (x :: xs)%list => + match n3 with + | 0 => x + | S m => rec1 m xs + end + end + match l4 with + | nil => x02 + | (x :: xs)%list => + match n4 with + | 0 => x + | S m => rec2 m xs + end + end) + with + | nil_R _ _ _ => x0_R + | cons_R _ _ _ x1 x2 x_R xs1 xs2 xs_R => + match + n_R0 in (nat_R n5 n6) + return + (T_R match n5 with + | 0 => x1 + | S m => rec1 m xs1 + end match n6 with + | 0 => x2 + | S m => rec2 m xs2 + end) + with + | O_R => x_R + | S_R m1 m2 m_R => rec_R m1 m2 m_R xs1 xs2 xs_R + end + end) (S _1) (S _2) K + end + : forall (T1 T2 : Type) (T_R : T1 -> T2 -> Type) (x01 : T1) (x02 : T2), + T_R x01 x02 -> + forall n1 n2 : nat, + nat_R n1 n2 -> + forall (l1 : list T1) (l2 : list T2), + list_R T1 T2 T_R l1 l2 -> T_R (nth T1 x01 n1 l1) (nth T2 x02 n2 l2) + +Arguments nth_R (T1 T2)%type_scope T_R%function_scope + x01 x02 x0_R (n1 n2)%nat_scope n_R (l1 l2)%list_scope + l_R +pred_R = +fun (n1 n2 : nat) (n_R : nat_R n1 n2) => +match + n_R in (nat_R n3 n4) + return + (nat_R match n3 with + | 0 => n1 + | S u => u + end match n4 with + | 0 => n2 + | S u => u + end) +with +| O_R => n_R +| S_R _ _ u_R => u_R +end + : forall n1 n2 : nat, nat_R n1 n2 -> nat_R (Nat.pred n1) (Nat.pred n2) + +Arguments pred_R (n1 n2)%nat_scope n_R +File "./apps/derive/tests/test_param2.v", line 85, characters 0-30: +Warning: Not a truly recursive fixpoint. [non-recursive,fixpoints,default] +File "./apps/eltac/tests-stdlib/test_injection.v", line 15, characters 0-15: +Warning: Using Vector.t is known to be technically difficult, see +. +[warn-library-file-stdlib-vector,stdlib-vector,warn-library-file,user-warn,default] Instances list for indt «Eqb» is: const «eqBool» with locality [] const «eqProd» with locality [] @@ -18449,6 +18370,48 @@ Instances list for indt «DecidableClass.Decidable» is: const «Decidable_eq_bool» with locality [] const «DecidableClass.Decidable_not» with locality [] +In tc-A +In tc-A +In tc-B +In tc-A +In tc-B +In tc-A +c AX (BX AX) : C AX (BX AX) + : C AX (BX AX) +Query assignments: + S = app + [global (const «c»), global (const «AX»), + app [global (const «BX»), X0]] + X1_ = X0 + X2_ = global (const «AX») + X3_ = app [global (const «BX»), X0] +Syntactic constraints: + evar (X0) (global (indt «A»)) (X0) /* suspended on X0 */ +Universe constraints: +UNIVERSES: + {elpi.apps.tc.tests.hyp_in_conl.15 elpi.apps.tc.tests.hyp_in_conl.14 + elpi.apps.tc.tests.hyp_in_conl.13} |= +ALGEBRAIC UNIVERSES: + {} +FLEXIBLE UNIVERSES: + +SORTS: + α12 + α13 + α14 >= Prop +WEAK CONSTRAINTS: + + +Query assignments: + Len = 2 + Rules = [tc.instance [] (const «Bool.Decidable_eq_bool») + (indt «DecidableClass.Decidable») [], + tc.instance [] (const «DecidableClass.Decidable_not») + (indt «DecidableClass.Decidable») []] +[TC] For indt «C» : + elpi predicate : tc-C + search mode is : tc.deterministic + modes are : [o, o] ((fun (A : Type) (f : Type -> Type) (H : forall x : Type, Y (f x)) => ex_intro (fun g : Type -> Type => Ex g A /\ g nat = g bool) f (conj (Inst2 A f H) ?Goal)) @@ -18472,14 +18435,59 @@ ============================ (fun H0 : Type => f ?e0@{T:=H0}) nat = (fun H0 : Type => f ?e0@{T:=H0}) bool -Query assignments: - S = app - [global (const «IsAnimal»), global (indc «Fly»), global (const «dove»)] -Query assignments: - S = X0 -Normalizing app [global (indt «nat2»), global (const «Nat.succ»)] -Normalizing app [global (indt «nat2»), global (indc «S»)] -Normalizing app [global (indt «nat2»), global (const «Nat.succ»)] +All the remaining goals are on the shelf. + +1 goal + +goal 1 is: + C +1 goal + + ============================ + C +All the remaining goals are on the shelf. + +1 goal + +goal 1 is: + C +1 goal + + ============================ + C +Debug: +Calling typeclass resolution with flags: depth = ∞,unique = false,fail = true +Debug: 1: looking for (C ?i) with backtracking +Debug: 1.1: exact i2 on (C ?i), 0 subgoal(s) +Debug: 2: looking for (E 2) without backtracking +Debug: 2: no match for (E 2), 0 possibilities +Debug: 1.2: exact i1 on (C ?i), 0 subgoal(s) +Debug: 2: looking for (E 1) without backtracking +Debug: 2.1: exact e1 on (E 1), 0 subgoal(s) +Debug: +Calling typeclass resolution with flags: depth = ∞,unique = false,fail = true +Debug: 1: looking for (C ?i) with backtracking +Debug: 1.1: exact i2 on (C ?i), 0 subgoal(s) +Debug: +Calling typeclass resolution with flags: depth = ∞,unique = false,fail = true +Debug: 1: looking for (E 2) without backtracking +Debug: 1: no match for (E 2), 0 possibilities +Debug: 1: looking for (C ?i) with backtracking +Debug: 1.1: exact i2 on (C ?i), 0 subgoal(s) +Debug: 2: looking for (E 2) without backtracking +Debug: 2: no match for (E 2), 0 possibilities +Debug: 1.2: exact i1 on (C ?i), 0 subgoal(s) +Debug: 2: looking for (E 1) without backtracking +Debug: 2.1: exact e1 on (E 1), 0 subgoal(s) +[seal (goal [] (X0) (app [global (indt «C»), X1]) (X2) []), + seal (goal [] (X3) (app [global (indt «E»), X1]) (X4) [])] +Goal is C ?i +Solution for C 2 is i2 +Goal is E 2 +Solution for C 1 is i1 +Goal is E 1 +Solution for E 1 is e1 +(fun x : tele => tele_fmap) Now click "Start watching" in the Elpi Trace Browser panel and then execute the Command/Tactic/Query you want to trace. Also try "F1 Elpi". (fun H : C Q => @@ -18487,8 +18495,29 @@ (fun (R : Type -> Type) (_ : C R) => let H1 : C Q := H in H1)) Now click "Start watching" in the Elpi Trace Browser panel and then execute the Command/Tactic/Query you want to trace. Also try "F1 Elpi". -Received the following event -[str new_instance, str I4, str A, str Export, int -1] +File "./apps/tc/tests/test_tc_declare.v", line 8, characters 2-36: +Warning: +This command does not fully mirror the watned behavior if the class has methods +with implicit arguments (those implicits will be neglected) +[[TC] Warning,TC.Declare,elpi,default] +File "./apps/tc/tests/test_tc_declare.v", line 20, characters 2-53: +Warning: +This command does not fully mirror the watned behavior if the class has methods +with implicit arguments (those implicits will be neglected) +[[TC] Warning,TC.Declare,elpi,default] +File "./apps/tc/tests/test_tc_declare.v", line 50, characters 2-47: +Warning: +This command does not fully mirror the watned behavior if the class has methods +with implicit arguments (those implicits will be neglected) +[[TC] Warning,TC.Declare,elpi,default] +File "./apps/tc/tests/test_tc_declare.v", line 63, characters 2-51: +Warning: +This command does not fully mirror the watned behavior if the class has methods +with implicit arguments (those implicits will be neglected) +[[TC] Warning,TC.Declare,elpi,default] +Normalizing app [global (indt «nat2»), global (const «Nat.succ»)] +Normalizing app [global (indt «nat2»), global (indc «S»)] +Normalizing app [global (indt «nat2»), global (const «Nat.succ»)] File "./apps/tc/tests-stdlib/stdppInj.v", line 13, characters 0-24: Warning: There is an hint extern in the typeclass db: @@ -18812,6 +18841,11 @@ (*external*) (reflexive_proxy_tac A R) [elpi.TC.hints,elpi,default] Query assignments: + S = app + [global (const «IsAnimal»), global (indc «Fly»), global (const «dove»)] +Query assignments: + S = X0 +Query assignments: EqP = const «eqU» File "./apps/tc/tests-stdlib/test_commands_API.v", line 52, characters 2-25: Warning: @@ -19135,14 +19169,8 @@ There is an hint extern in the typeclass db: (*external*) (Morphisms.reflexive_proxy_tac A R) [elpi.TC.hints,elpi,default] -Debug: [elpitime] Elpi: get_and_compile 0.0002 -Debug: [TC] - Time of instance search is 0.000148 -Debug: [TC] - Time of refine.typecheck is 0.000419 -Debug: -[elpitime] - Elpi: query-compilation:0.0002 static-check:0.0000 optimization:0.0002 runtime:0.0039 (with success) - -Finished transaction in 0.005 secs (0.004u,0.s) (successful) +Received the following event +[str new_instance, str I4, str A, str Export, int -1] (fun (T : Type) (p : nat -> T -> T -> Prop) (x : T) => partial_app T (p 0) x) eq_refl : @@ -19257,6 +19285,14 @@ forall (T : Type -> Type) (H : forall x : Type, T x), C2 T (fun x : Type => H x) -> D Debug: [tactic-unification] Leaving unification with success +Debug: [elpitime] Elpi: get_and_compile 0.0003 +Debug: [TC] - Time of instance search is 0.000210 +Debug: [TC] - Time of refine.typecheck is 0.000582 +Debug: +[elpitime] + Elpi: query-compilation:0.0004 static-check:0.0000 optimization:0.0002 runtime:0.0173 (with success) + +Finished transaction in 0.019 secs (0.007u,0.s) (successful) Query assignments: T = c0 \ prod `c` X0 c1 \ @@ -19275,7 +19311,7 @@ X3_ = X2 X4_ = X3 X5_ = X4 -Finished transaction in 0.137 secs (0.073u,0.003s) (successful) +Finished transaction in 0.314 secs (0.087u,0.007s) (successful) Query assignments: A = c0 \ c0 @@ -19562,29 +19598,9 @@ File "./apps/tc/tests/test.v", line 558, characters 51-56 Y is linear: name it _Y (discard) or Y_ (fresh variable) [elpi.linear-variable,elpi.typecheck,elpi,default] -Inductive peano : Set := Zero : peano | Succ : peano -> peano. - -Arguments peano.Succ p - = if pos_eq_dec (BinNums.xO BinNums.xH) BinNums.xH then true else false - : bool -peano.eqb_OK : forall x1 x2 : peano, reflect (x1 = x2) (peano.eqb x1 x2) - -peano.eqb_OK is not universe polymorphic -Arguments peano.eqb_OK x1 x2 -peano.eqb_OK is opaque -Expands to: Constant elpi.apps.derive.examples.readme.peano.eqb_OK -Derivation param1 on const «Nat.add» -Derivation param1 on const «Nat.add» took 0.006049 -Derivation param2 on const «Nat.add» -Derivation param2 on const «Nat.add» took 0.007365 -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) +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) File "./apps/tc/tests-stdlib/bigTest.v", line 21, characters 0-19: Warning: There is an hint extern in the typeclass db: @@ -19997,6 +20013,29 @@ There is an hint extern in the typeclass db: (*external*) proper_reflexive [elpi.TC.hints,elpi,default] +Inductive peano : Set := Zero : peano | Succ : peano -> peano. + +Arguments peano.Succ p + = if pos_eq_dec (BinNums.xO BinNums.xH) BinNums.xH then true else false + : bool +peano.eqb_OK : forall x1 x2 : peano, reflect (x1 = x2) (peano.eqb x1 x2) + +peano.eqb_OK is not universe polymorphic +Arguments peano.eqb_OK x1 x2 +peano.eqb_OK is opaque +Expands to: Constant elpi.apps.derive.examples.readme.peano.eqb_OK +Derivation param1 on const «Nat.add» +Derivation param1 on const «Nat.add» took 0.029572 +Derivation param2 on const «Nat.add» +Derivation param2 on const «Nat.add» took 0.036041 +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) more : forall A : Type, A -> tickle A -> tickle A : forall A : Type, A -> tickle A -> tickle A tickle.eqb @@ -20028,37 +20067,37 @@ (arity (prod `l` (app [global (indt «tickle.tickle»), c1]) c2 \ c1))] Deriving Derivation map on indt «rtree» -Derivation map on indt «rtree» took 0.004913 +Derivation map on indt «rtree» took 0.031529 Derivation lens on indt «rtree» Derivation lens on indt «rtree» failed, continuing Derivation param1 on indt «rtree» -Derivation param1 on indt «rtree» took 0.014587 +Derivation param1 on indt «rtree» took 0.094477 Derivation param2 on indt «rtree» -Derivation param2 on indt «rtree» took 0.014446 +Derivation param2 on indt «rtree» took 0.084550 Derivation tag on indt «rtree» -Derivation tag on indt «rtree» took 0.002020 +Derivation tag on indt «rtree» took 0.012196 Derivation eqType_ast on indt «rtree» -Derivation eqType_ast on indt «rtree» took 0.000822 +Derivation eqType_ast on indt «rtree» took 0.001397 Derivation lens_laws on indt «rtree» -Derivation lens_laws on indt «rtree» took 0.000111 +Derivation lens_laws on indt «rtree» took 0.000082 Derivation param1_congr on indt «rtree» -Derivation param1_congr on indt «rtree» took 0.004188 +Derivation param1_congr on indt «rtree» took 0.022993 Derivation param1_inhab on indt «rtree» -Derivation param1_inhab on indt «rtree» took 0.003613 +Derivation param1_inhab on indt «rtree» took 0.011497 Derivation param1_functor on indt «rtree» -Derivation param1_functor on indt «rtree» took 0.004051 +Derivation param1_functor on indt «rtree» took 0.006882 Derivation fields on indt «rtree» -Derivation fields on indt «rtree» took 0.013619 +Derivation fields on indt «rtree» took 0.036320 Derivation param1_trivial on indt «rtree» -Derivation param1_trivial on indt «rtree» took 2.600482 +Derivation param1_trivial on indt «rtree» took 0.944463 Derivation induction on indt «rtree» -Derivation induction on indt «rtree» took 0.004071 +Derivation induction on indt «rtree» took 0.033369 Derivation eqb on indt «rtree» -Derivation eqb on indt «rtree» took 0.034031 +Derivation eqb on indt «rtree» took 0.074083 Derivation eqbcorrect on indt «rtree» -Derivation eqbcorrect on indt «rtree» took 0.072276 +Derivation eqbcorrect on indt «rtree» took 0.308734 Derivation eqbOK on indt «rtree» -Derivation eqbOK on indt «rtree» took 0.002993 +Derivation eqbOK on indt «rtree» took 0.015631 Done rtree.induction : @@ -20082,15 +20121,15 @@ 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.011664 +Derivation lens on indt «Box» took 0.033903 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» -Derivation tag on indt «Box» took 0.002372 +Derivation tag on indt «Box» took 0.027260 Derivation eqType_ast on indt «Box» -Derivation eqType_ast on indt «Box» took 0.000594 +Derivation eqType_ast on indt «Box» took 0.000527 Derivation lens_laws on indt «Box» -Derivation lens_laws on indt «Box» took 0.047430 +Derivation lens_laws on indt «Box» took 0.182205 Skipping derivation param1_congr on indt «Box» since the user did not select it Skipping derivation param1_inhab on indt «Box» @@ -20098,13 +20137,13 @@ 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.009624 +Derivation fields on indt «Box» took 0.054189 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.022347 +Derivation eqb on indt «Box» took 0.035158 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 @@ -20130,65 +20169,65 @@ 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.001700 +Derivation map on indt «a» took 0.015878 Derivation lens on indt «a» Derivation lens on indt «a» failed, continuing Derivation param1 on indt «a» -Derivation param1 on indt «a» took 0.008950 +Derivation param1 on indt «a» took 0.024055 Derivation param2 on indt «a» -Derivation param2 on indt «a» took 0.009610 +Derivation param2 on indt «a» took 0.015048 Derivation tag on indt «a» -Derivation tag on indt «a» took 0.005823 +Derivation tag on indt «a» took 0.012056 Derivation eqType_ast on indt «a» -Derivation eqType_ast on indt «a» took 0.000364 +Derivation eqType_ast on indt «a» took 0.001131 Derivation lens_laws on indt «a» -Derivation lens_laws on indt «a» took 0.000114 +Derivation lens_laws on indt «a» took 0.000235 Derivation param1_congr on indt «a» -Derivation param1_congr on indt «a» took 0.000646 +Derivation param1_congr on indt «a» took 0.001529 Derivation param1_inhab on indt «a» -Derivation param1_inhab on indt «a» took 0.005963 +Derivation param1_inhab on indt «a» took 0.011124 Derivation param1_functor on indt «a» -Derivation param1_functor on indt «a» took 0.001514 +Derivation param1_functor on indt «a» took 0.001859 Derivation fields on indt «a» -Derivation fields on indt «a» took 0.014403 +Derivation fields on indt «a» took 0.046283 Derivation param1_trivial on indt «a» -Derivation param1_trivial on indt «a» took 0.006836 +Derivation param1_trivial on indt «a» took 0.012030 Derivation induction on indt «a» -Derivation induction on indt «a» took 0.001947 +Derivation induction on indt «a» took 0.011550 Derivation eqb on indt «a» -Derivation eqb on indt «a» took 0.007497 +Derivation eqb on indt «a» took 0.026442 Derivation eqbcorrect on indt «a» -Derivation eqbcorrect on indt «a» took 0.015908 +Derivation eqbcorrect on indt «a» took 0.022585 Derivation eqbOK on indt «a» -Derivation eqbOK on indt «a» took 0.005491 +Derivation eqbOK on indt «a» took 0.003564 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.014154 +Derivation param1 on indt «b» took 0.053536 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.001597 +Derivation tag on indt «b» took 0.015369 Derivation eqType_ast on indt «b» -Derivation eqType_ast on indt «b» took 0.000633 +Derivation eqType_ast on indt «b» took 0.000447 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.001875 +Derivation param1_inhab on indt «b» took 0.009178 Derivation param1_functor on indt «b» -Derivation param1_functor on indt «b» took 0.006000 +Derivation param1_functor on indt «b» took 0.009010 Derivation fields on indt «b» -Derivation fields on indt «b» took 0.015260 +Derivation fields on indt «b» took 0.054533 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.002325 +Derivation induction on indt «b» took 0.007480 Derivation eqb on indt «b» -Derivation eqb on indt «b» took 0.012585 +Derivation eqb on indt «b» took 0.027757 Derivation eqbcorrect on indt «b» -Derivation eqbcorrect on indt «b» took 0.025365 +Derivation eqbcorrect on indt «b» took 0.065649 Derivation eqbOK on indt «b» -Derivation eqbOK on indt «b» took 0.001421 +Derivation eqbOK on indt «b» took 0.013460 a_eqb : a -> a -> bool b_eqb @@ -20388,9 +20427,6 @@ : bool Peano.eqb_OK : forall x1 x2 : Peano.peano, reflect (x1 = x2) (Peano.eqb x1 x2) -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) derive.param1_trivial: wrong shape is_nest . It does not look like a unary parametricity translation of an inductive with no indexes. derive.param1_trivial: wrong shape is_vect A PA @@ -20404,13 +20440,13 @@ 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.001948 +Derivation projK on indt «nat» took 0.013391 Derivation isK on indt «nat» -Derivation isK on indt «nat» took 0.003223 +Derivation isK on indt «nat» took 0.027373 Derivation eq on indt «nat» -Derivation eq on indt «nat» took 0.003507 +Derivation eq on indt «nat» took 0.023699 Derivation invert on indt «nat» -Derivation invert on indt «nat» took 0.002953 +Derivation invert on indt «nat» took 0.005089 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 @@ -20420,7 +20456,7 @@ 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.005762 +Derivation bcongr on indt «nat» took 0.016116 Derivation idx2inv on indt «nat» Derivation idx2inv on indt «nat» failed, continuing Skipping derivation param1_trivial on indt «nat» @@ -20428,13 +20464,13 @@ Skipping derivation induction on indt «nat» since it has been already run Skipping derivation eqb on indt «nat» since it has been already run Derivation eqK on indt «nat» -Derivation eqK on indt «nat» took 0.006361 +Derivation eqK on indt «nat» took 0.023517 Skipping derivation eqbcorrect on indt «nat» since it has been already run Derivation eqcorrect on indt «nat» -Derivation eqcorrect on indt «nat» took 0.002171 +Derivation eqcorrect on indt «nat» took 0.011587 Skipping derivation eqbOK on indt «nat» since it has been already run Derivation eqOK on indt «nat» -Derivation eqOK on indt «nat» took 0.000956 +Derivation eqOK on indt «nat» took 0.002336 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 @@ -20479,12 +20515,12 @@ Skipping derivation map on indt «foo» since the user did not select it Skipping derivation lens on indt «foo» since the user did not select it Derivation param1 on indt «foo» -Derivation param1 on indt «foo» took 0.006042 +Derivation param1 on indt «foo» took 0.020229 Skipping derivation param2 on indt «foo» since the user did not select it Derivation tag on indt «foo» -Derivation tag on indt «foo» took 0.001669 +Derivation tag on indt «foo» took 0.023603 Derivation eqType_ast on indt «foo» -Derivation eqType_ast on indt «foo» took 0.000579 +Derivation eqType_ast on indt «foo» took 0.000646 Skipping derivation projK on indt «foo» since the user did not select it Skipping derivation isK on indt «foo» since the user did not select it Skipping derivation eq on indt «foo» since the user did not select it @@ -20494,26 +20530,26 @@ Skipping derivation param1_congr on indt «foo» since the user did not select it Derivation param1_inhab on indt «foo» -Derivation param1_inhab on indt «foo» took 0.002247 +Derivation param1_inhab on indt «foo» took 0.015751 Derivation param1_functor on indt «foo» -Derivation param1_functor on indt «foo» took 0.001926 +Derivation param1_functor on indt «foo» took 0.002503 Derivation fields on indt «foo» -Derivation fields on indt «foo» took 0.007406 +Derivation fields on indt «foo» took 0.030343 Skipping derivation bcongr on indt «foo» since the user did not select it Skipping derivation idx2inv on indt «foo» since the user did not select it Skipping derivation param1_trivial on indt «foo» since the user did not select it Derivation induction on indt «foo» -Derivation induction on indt «foo» took 0.002641 +Derivation induction on indt «foo» took 0.015484 Derivation eqb on indt «foo» -Derivation eqb on indt «foo» took 0.010491 +Derivation eqb on indt «foo» took 0.037030 Skipping derivation eqK on indt «foo» since the user did not select it Derivation eqbcorrect on indt «foo» -Derivation eqbcorrect on indt «foo» took 0.009148 +Derivation eqbcorrect on indt «foo» took 0.071720 Skipping derivation eqcorrect on indt «foo» since the user did not select it Derivation eqbOK on indt «foo» -Derivation eqbOK on indt «foo» took 0.001532 +Derivation eqbOK on indt «foo» took 0.014650 Skipping derivation eqOK on indt «foo» since the user did not select it File "./apps/derive/tests-stdlib/test_derive.v", line 33, characters 2-9: Warning: This command does not support this attribute: verbose. @@ -20522,13 +20558,13 @@ Warning: Using Vector.t is known to be technically difficult, see . [warn-library-file-stdlib-vector,stdlib-vector,warn-library-file,user-warn,default] -Finished transaction in 5.444 secs (1.87u,0.136s) (successful) -Finished transaction in 46.641 secs (37.058u,0.914s) (successful) -Finished transaction in 0.399 secs (0.394u,0.s) (successful) +Finished transaction in 13.296 secs (3.449u,0.178s) (successful) +Finished transaction in 185.335 secs (60.019u,0.272s) (successful) +Finished transaction in 2.709 secs (0.816u,0.s) (successful) dune build builtin-doc Warning: Cache directories could not be created: Permission denied; disabling cache -Hint: Make sure the directory /nonexistent/first-build/.cache/dune/db/temp +Hint: Make sure the directory /nonexistent/second-build/.cache/dune/db/temp can be created make[2]: Leaving directory '/build/reproducible-path/coq-elpi-2.5.0' make[1]: Leaving directory '/build/reproducible-path/coq-elpi-2.5.0' @@ -20540,7 +20576,7 @@ dune install rocq-elpi --destdir=/build/reproducible-path/coq-elpi-2.5.0/debian/tmp --prefix=/usr --libdir=/usr/lib/x86_64-linux-gnu/ocaml/5.3.0 Warning: Cache directories could not be created: Permission denied; disabling cache -Hint: Make sure the directory /nonexistent/first-build/.cache/dune/db/temp +Hint: Make sure the directory /nonexistent/second-build/.cache/dune/db/temp can be created rm -fr /build/reproducible-path/coq-elpi-2.5.0/debian/tmp/usr/doc/coq-elpi rm -fr /build/reproducible-path/coq-elpi-2.5.0/debian/tmp/usr/doc/rocq-elpi @@ -20588,12 +20624,14 @@ dpkg-buildpackage: info: binary-only upload (no source included) dpkg-genchanges: info: including full source code in upload I: copying local configuration +I: user script /srv/workspace/pbuilder/1399090/tmp/hooks/B01_cleanup starting +I: user script /srv/workspace/pbuilder/1399090/tmp/hooks/B01_cleanup finished I: unmounting dev/ptmx filesystem I: unmounting dev/pts filesystem I: unmounting dev/shm filesystem I: unmounting proc filesystem I: unmounting sys filesystem I: cleaning the build env -I: removing directory /srv/workspace/pbuilder/4053802 and its subdirectories -I: Current time: Tue Apr 21 02:38:53 -12 2026 -I: pbuilder-time-stamp: 1776782333 +I: removing directory /srv/workspace/pbuilder/1399090 and its subdirectories +I: Current time: Wed Mar 19 22:29:08 +14 2025 +I: pbuilder-time-stamp: 1742372948