Add builds (2026-11-09)
Browse files- LICENSE +21 -0
- NOTICE.md +7 -0
- README.md +79 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/SHA256SUMS.txt +9 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/lake-manifest.json +95 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/manifest.json +91 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/reports/axiom_audit.txt +20 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/reports/axiom_audit_result.json +1 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/reports/build.log +92 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/shards/frames.jsonl +2 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/shards/index.jsonl +14 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/shards/modules.jsonl +2 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/shards/part-00000.tar.zst +3 -0
LICENSE
ADDED
|
@@ -0,0 +1,21 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
MIT License
|
| 2 |
+
|
| 3 |
+
Copyright (c) 2026 Axiom Math.
|
| 4 |
+
|
| 5 |
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
| 6 |
+
of this software and associated documentation files (the "Software"), to deal
|
| 7 |
+
in the Software without restriction, including without limitation the rights
|
| 8 |
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
| 9 |
+
copies of the Software, and to permit persons to whom the Software is
|
| 10 |
+
furnished to do so, subject to the following conditions:
|
| 11 |
+
|
| 12 |
+
The above copyright notice and this permission notice shall be included in all
|
| 13 |
+
copies or substantial portions of the Software.
|
| 14 |
+
|
| 15 |
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
| 16 |
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
| 17 |
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
| 18 |
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
| 19 |
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
| 20 |
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
| 21 |
+
SOFTWARE.
|
NOTICE.md
ADDED
|
@@ -0,0 +1,7 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# Notice
|
| 2 |
+
|
| 3 |
+
Built from https://github.com/AxiomMath/PartitionParity by MoteMath (unofficial).
|
| 4 |
+
The source and its copyright belong to its authors. License: MIT.
|
| 5 |
+
|
| 6 |
+
Builds:
|
| 7 |
+
- `builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5`: source commit 67e16e88088ba20407979a2d86473d425e0eb4e2
|
README.md
ADDED
|
@@ -0,0 +1,79 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
license: mit
|
| 3 |
+
pretty_name: "Compiled Lean outputs for PartitionParity (from AxiomMath/PartitionParity, unofficial)"
|
| 4 |
+
tags:
|
| 5 |
+
- lean4
|
| 6 |
+
- mathlib
|
| 7 |
+
- formal-mathematics
|
| 8 |
+
- build-cache
|
| 9 |
+
---
|
| 10 |
+
|
| 11 |
+
# Compiled Lean outputs for PartitionParity
|
| 12 |
+
|
| 13 |
+
> **What this is.** Compiled Lean 4 outputs (`.olean`, `.ilean`, `.c` and Lake trace files) for
|
| 14 |
+
> [AxiomMath/PartitionParity](https://github.com/AxiomMath/PartitionParity) at the commits listed below, so a checkout can skip compiling.
|
| 15 |
+
>
|
| 16 |
+
> **What this is not.**
|
| 17 |
+
> - Not a check of the mathematics. These files show that the code compiled. They do not show that the Lean
|
| 18 |
+
> statements faithfully formalize the results they are named after, and nobody here reviewed them as mathematics.
|
| 19 |
+
> - Not an official release. Built and published by MoteMath; not affiliated with or endorsed by AxiomMath or the
|
| 20 |
+
> authors of PartitionParity. The source and all credit belong to its authors (see `LICENSE` and `NOTICE.md`).
|
| 21 |
+
>
|
| 22 |
+
> **How it was made.** By an automated, AI-assisted build pipeline on cloud machines, from the public source at each
|
| 23 |
+
> listed commit. The build log and every report are in each build folder under `reports/`.
|
| 24 |
+
|
| 25 |
+
## Builds and what was checked
|
| 26 |
+
|
| 27 |
+
Every value below is read from the build folder's own reports; "not run" and "not recorded" mean exactly that.
|
| 28 |
+
|
| 29 |
+
| commit | Lean | packed | modules | `sorry` warnings | other warnings | axiom audit | round trip |
|
| 30 |
+
|---|---|---|---|---|---|---|---|
|
| 31 |
+
| `67e16e88088b` | v4.28.0 | 2026-11-08 | 2 | 9 | 17 | flags sorry | passed |
|
| 32 |
+
|
| 33 |
+
**Build `67e16e88088b-e97371d381bc0ed5`** (source commit `67e16e88088ba20407979a2d86473d425e0eb4e2`)
|
| 34 |
+
|
| 35 |
+
- `sorry` warnings: 9, in `PartitionParity/Output/problem.lean`. Results in these files are not proved.
|
| 36 |
+
- Axiom audit: 207 declarations; axioms beyond the standard three: sorryAx.
|
| 37 |
+
- Declarations that depend on them (first ones listed by the audit): `PartitionParity.statement1_mod2_consequence` (sorryAx), `PartitionParity.statement6_twist` (sorryAx), `PartitionParity.statement2_collapse` (sorryAx), `PartitionParity.statement5_mod2` (sorryAx), `PartitionParity.statement3_lambert` (sorryAx), `PartitionParity.statement1_mod4` (sorryAx), `PartitionParity.statement7_FeqE` (sorryAx), `PartitionParity.statement2_logderiv` (sorryAx), `PartitionParity.statement5_coeff_mod2` (sorryAx).
|
| 38 |
+
- Round trip on a clean machine: passed. Restored on a clean machine; AxiomMath/PartitionParity: Lake reported every target up to date (8028 jobs). (1 of 1 projects using it passed; checked 2026-11-09)
|
| 39 |
+
|
| 40 |
+
What the columns mean:
|
| 41 |
+
- **`sorry` warnings:** declarations the build reported as using `sorry`. Anything depending on them is not proved.
|
| 42 |
+
- **Axiom audit:** every declaration in the package's modules traced to the axioms it uses. "passed" means only
|
| 43 |
+
`propext`, `Classical.choice` and `Quot.sound`. It does not say a statement is the intended one: a theorem that
|
| 44 |
+
takes a hard fact as a hypothesis passes.
|
| 45 |
+
- **Round trip:** a separate user with empty Lean and Lake caches restored the build from the archive and Lake reported
|
| 46 |
+
every target up to date. It shows the archive is complete, not that the proofs are right.
|
| 47 |
+
|
| 48 |
+
## Using a build
|
| 49 |
+
|
| 50 |
+
1. Clone AxiomMath/PartitionParity at the build's commit and run `lake exe cache get`, which fetches Mathlib from Mathlib's own
|
| 51 |
+
cache and checks out the dependencies.
|
| 52 |
+
2. Get `lbc.py` from [MoteMath/lean-builds-index](https://huggingface.co/datasets/MoteMath/lean-builds-index)
|
| 53 |
+
(`tools/lbc.py`, about 700 lines of Python; read it before running it). It needs Python 3.10+, `zstd` and
|
| 54 |
+
`huggingface_hub`.
|
| 55 |
+
3. Fetch as little as you need:
|
| 56 |
+
- `python3 lbc.py fetch . --module Some.Module` downloads only the shards holding that module and its import closure.
|
| 57 |
+
Repeat `--module` for several, and add `--dry-run` to see the size first.
|
| 58 |
+
- `python3 lbc.py fetch .` downloads every shard of every package with a published build.
|
| 59 |
+
4. Run `lake build --no-build +Some.Module` (or `lake build --no-build` after a full fetch). It must report everything up
|
| 60 |
+
to date; `--check` on the fetch does this for you.
|
| 61 |
+
|
| 62 |
+
Each build folder holds `manifest.json` (commit, toolchain, dependency closure, shard hashes), the exact
|
| 63 |
+
`lake-manifest.json` used, deterministic `shards/*.tar.zst` with a per-file SHA-256 index, and `reports/`.
|
| 64 |
+
|
| 65 |
+
## Trust and checking independently
|
| 66 |
+
|
| 67 |
+
- The SHA-256 hashes show a download is intact and matches what was published here. They come from the same publisher
|
| 68 |
+
as the files, so they are not evidence that the files are honest.
|
| 69 |
+
- Lean does not re-check `.olean` files when it loads them. A tampered file could contain a theorem with no valid proof.
|
| 70 |
+
- To check independently, use either route:
|
| 71 |
+
- re-check the compiled environment with the kernel: `lake env lean4checker --fresh Some.Module` (lean4checker
|
| 72 |
+
replays every declaration through Lean's kernel);
|
| 73 |
+
- or rebuild from the source commit and compare.
|
| 74 |
+
- For anything you rely on, prefer one of these over trusting the archive.
|
| 75 |
+
|
| 76 |
+
## Questions, corrections and removal
|
| 77 |
+
|
| 78 |
+
Open a discussion in this repository's Community tab. Authors who want a build corrected or removed can ask there,
|
| 79 |
+
and it will be done.
|
builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/SHA256SUMS.txt
ADDED
|
@@ -0,0 +1,9 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
c9c8b039136b29fe92a246929258c824e0e70db261b43c012de9054ff4ceaf11 lake-manifest.json
|
| 2 |
+
15ffb641f621e126629828d302c042fe122aaf438b02d5d3efaa09ed1951506e manifest.json
|
| 3 |
+
8ca8a141fd8ab933c928710ba864cb27232c3fd6c1def239eca25a3b2750284b reports/axiom_audit.txt
|
| 4 |
+
4db5c56921c920e806f83f22a8adcf92f265e2f3d942511024919ea12e123faa reports/axiom_audit_result.json
|
| 5 |
+
28d6ee6d512886f7d7c2fdb3485aaa96295ea697270a71106a67d3e8b849d965 reports/build.log
|
| 6 |
+
780e173a7d1c0eed8b174d8c5f5bcb391b545224fb8d1a119255bee85ab0ace6 shards/frames.jsonl
|
| 7 |
+
72f62f47171b7541474060e55cfb32ab0a522f04dbe9ebceeeb88e6a7c30d91b shards/index.jsonl
|
| 8 |
+
49969e2e907bab3c7ea115edbf9ee24227d6c408b75833c48adfbcab377ef6f5 shards/modules.jsonl
|
| 9 |
+
6f6871671003c49d895d17ab3c81c5235209b581aad7fa36900b5d4f05b3093c shards/part-00000.tar.zst
|
builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/lake-manifest.json
ADDED
|
@@ -0,0 +1,95 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{"version": "1.1.0",
|
| 2 |
+
"packagesDir": ".lake/packages",
|
| 3 |
+
"packages":
|
| 4 |
+
[{"url": "https://github.com/leanprover-community/mathlib4",
|
| 5 |
+
"type": "git",
|
| 6 |
+
"subDir": null,
|
| 7 |
+
"scope": "leanprover-community",
|
| 8 |
+
"rev": "8f9d9cff6bd728b17a24e163c9402775d9e6a365",
|
| 9 |
+
"name": "mathlib",
|
| 10 |
+
"manifestFile": "lake-manifest.json",
|
| 11 |
+
"inputRev": "v4.28.0",
|
| 12 |
+
"inherited": false,
|
| 13 |
+
"configFile": "lakefile.lean"},
|
| 14 |
+
{"url": "https://github.com/leanprover-community/plausible",
|
| 15 |
+
"type": "git",
|
| 16 |
+
"subDir": null,
|
| 17 |
+
"scope": "leanprover-community",
|
| 18 |
+
"rev": "55c8532eb21ec9f6d565d51d96b8ca50bd1fbef3",
|
| 19 |
+
"name": "plausible",
|
| 20 |
+
"manifestFile": "lake-manifest.json",
|
| 21 |
+
"inputRev": "main",
|
| 22 |
+
"inherited": true,
|
| 23 |
+
"configFile": "lakefile.toml"},
|
| 24 |
+
{"url": "https://github.com/leanprover-community/LeanSearchClient",
|
| 25 |
+
"type": "git",
|
| 26 |
+
"subDir": null,
|
| 27 |
+
"scope": "leanprover-community",
|
| 28 |
+
"rev": "c5d5b8fe6e5158def25cd28eb94e4141ad97c843",
|
| 29 |
+
"name": "LeanSearchClient",
|
| 30 |
+
"manifestFile": "lake-manifest.json",
|
| 31 |
+
"inputRev": "main",
|
| 32 |
+
"inherited": true,
|
| 33 |
+
"configFile": "lakefile.toml"},
|
| 34 |
+
{"url": "https://github.com/leanprover-community/import-graph",
|
| 35 |
+
"type": "git",
|
| 36 |
+
"subDir": null,
|
| 37 |
+
"scope": "leanprover-community",
|
| 38 |
+
"rev": "85b59af46828c029a9168f2f9c35119bd0721e6e",
|
| 39 |
+
"name": "importGraph",
|
| 40 |
+
"manifestFile": "lake-manifest.json",
|
| 41 |
+
"inputRev": "main",
|
| 42 |
+
"inherited": true,
|
| 43 |
+
"configFile": "lakefile.toml"},
|
| 44 |
+
{"url": "https://github.com/leanprover-community/ProofWidgets4",
|
| 45 |
+
"type": "git",
|
| 46 |
+
"subDir": null,
|
| 47 |
+
"scope": "leanprover-community",
|
| 48 |
+
"rev": "be3b2e63b1bbf496c478cef98b86972a37c1417d",
|
| 49 |
+
"name": "proofwidgets",
|
| 50 |
+
"manifestFile": "lake-manifest.json",
|
| 51 |
+
"inputRev": "v0.0.87",
|
| 52 |
+
"inherited": true,
|
| 53 |
+
"configFile": "lakefile.lean"},
|
| 54 |
+
{"url": "https://github.com/leanprover-community/aesop",
|
| 55 |
+
"type": "git",
|
| 56 |
+
"subDir": null,
|
| 57 |
+
"scope": "leanprover-community",
|
| 58 |
+
"rev": "f642a64c76df8ba9cb53dba3b919425a0c2aeaf1",
|
| 59 |
+
"name": "aesop",
|
| 60 |
+
"manifestFile": "lake-manifest.json",
|
| 61 |
+
"inputRev": "master",
|
| 62 |
+
"inherited": true,
|
| 63 |
+
"configFile": "lakefile.toml"},
|
| 64 |
+
{"url": "https://github.com/leanprover-community/quote4",
|
| 65 |
+
"type": "git",
|
| 66 |
+
"subDir": null,
|
| 67 |
+
"scope": "leanprover-community",
|
| 68 |
+
"rev": "b8f98e9087e02c8553945a2c5abf07cec8e798c3",
|
| 69 |
+
"name": "Qq",
|
| 70 |
+
"manifestFile": "lake-manifest.json",
|
| 71 |
+
"inputRev": "master",
|
| 72 |
+
"inherited": true,
|
| 73 |
+
"configFile": "lakefile.toml"},
|
| 74 |
+
{"url": "https://github.com/leanprover-community/batteries",
|
| 75 |
+
"type": "git",
|
| 76 |
+
"subDir": null,
|
| 77 |
+
"scope": "leanprover-community",
|
| 78 |
+
"rev": "495c008c3e3f4fb4256ff5582ddb3abf3198026f",
|
| 79 |
+
"name": "batteries",
|
| 80 |
+
"manifestFile": "lake-manifest.json",
|
| 81 |
+
"inputRev": "main",
|
| 82 |
+
"inherited": true,
|
| 83 |
+
"configFile": "lakefile.toml"},
|
| 84 |
+
{"url": "https://github.com/leanprover/lean4-cli",
|
| 85 |
+
"type": "git",
|
| 86 |
+
"subDir": null,
|
| 87 |
+
"scope": "leanprover",
|
| 88 |
+
"rev": "4f10f47646cb7d5748d6f423f4a07f98f7bbcc9e",
|
| 89 |
+
"name": "Cli",
|
| 90 |
+
"manifestFile": "lake-manifest.json",
|
| 91 |
+
"inputRev": "v4.28.0",
|
| 92 |
+
"inherited": true,
|
| 93 |
+
"configFile": "lakefile.toml"}],
|
| 94 |
+
"name": "PartitionParity",
|
| 95 |
+
"lakeDir": ".lake"}
|
builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/manifest.json
ADDED
|
@@ -0,0 +1,91 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{
|
| 2 |
+
"schema": "lean-build-manifest/1",
|
| 3 |
+
"features": [
|
| 4 |
+
"modules_index",
|
| 5 |
+
"module_frames"
|
| 6 |
+
],
|
| 7 |
+
"frames": 2,
|
| 8 |
+
"package": "PartitionParity",
|
| 9 |
+
"source_repo": "https://github.com/AxiomMath/PartitionParity",
|
| 10 |
+
"commit": "67e16e88088ba20407979a2d86473d425e0eb4e2",
|
| 11 |
+
"license": "MIT",
|
| 12 |
+
"toolchain": "leanprover/lean4:v4.28.0",
|
| 13 |
+
"platform": "x86_64-unknown-linux-gnu",
|
| 14 |
+
"build_key": "e97371d381bc0ed5",
|
| 15 |
+
"closure": [
|
| 16 |
+
[
|
| 17 |
+
"Cli",
|
| 18 |
+
"4f10f47646cb7d5748d6f423f4a07f98f7bbcc9e"
|
| 19 |
+
],
|
| 20 |
+
[
|
| 21 |
+
"LeanSearchClient",
|
| 22 |
+
"c5d5b8fe6e5158def25cd28eb94e4141ad97c843"
|
| 23 |
+
],
|
| 24 |
+
[
|
| 25 |
+
"PartitionParity",
|
| 26 |
+
"67e16e88088ba20407979a2d86473d425e0eb4e2"
|
| 27 |
+
],
|
| 28 |
+
[
|
| 29 |
+
"Qq",
|
| 30 |
+
"b8f98e9087e02c8553945a2c5abf07cec8e798c3"
|
| 31 |
+
],
|
| 32 |
+
[
|
| 33 |
+
"aesop",
|
| 34 |
+
"f642a64c76df8ba9cb53dba3b919425a0c2aeaf1"
|
| 35 |
+
],
|
| 36 |
+
[
|
| 37 |
+
"batteries",
|
| 38 |
+
"495c008c3e3f4fb4256ff5582ddb3abf3198026f"
|
| 39 |
+
],
|
| 40 |
+
[
|
| 41 |
+
"importGraph",
|
| 42 |
+
"85b59af46828c029a9168f2f9c35119bd0721e6e"
|
| 43 |
+
],
|
| 44 |
+
[
|
| 45 |
+
"mathlib",
|
| 46 |
+
"8f9d9cff6bd728b17a24e163c9402775d9e6a365"
|
| 47 |
+
],
|
| 48 |
+
[
|
| 49 |
+
"plausible",
|
| 50 |
+
"55c8532eb21ec9f6d565d51d96b8ca50bd1fbef3"
|
| 51 |
+
],
|
| 52 |
+
[
|
| 53 |
+
"proofwidgets",
|
| 54 |
+
"be3b2e63b1bbf496c478cef98b86972a37c1417d"
|
| 55 |
+
]
|
| 56 |
+
],
|
| 57 |
+
"modules_built": 2,
|
| 58 |
+
"modules_without_source": 0,
|
| 59 |
+
"files": 14,
|
| 60 |
+
"bytes_uncompressed": 2820157,
|
| 61 |
+
"bytes_compressed": 788051,
|
| 62 |
+
"shard_target_bytes_uncompressed": 1000000000,
|
| 63 |
+
"shards": [
|
| 64 |
+
{
|
| 65 |
+
"name": "shards/part-00000.tar.zst",
|
| 66 |
+
"sha256": "6f6871671003c49d895d17ab3c81c5235209b581aad7fa36900b5d4f05b3093c",
|
| 67 |
+
"bytes": 788051,
|
| 68 |
+
"bytes_uncompressed": 2836480,
|
| 69 |
+
"files": 14,
|
| 70 |
+
"first_module": "PartitionParity.Output.problem",
|
| 71 |
+
"last_module": "PartitionParity.Output.solution"
|
| 72 |
+
}
|
| 73 |
+
],
|
| 74 |
+
"zstd_level": 19,
|
| 75 |
+
"excluded": {
|
| 76 |
+
"setup_json": true,
|
| 77 |
+
"skipped": [
|
| 78 |
+
[
|
| 79 |
+
".lake/build/ir/PartitionParity/Output/solution.setup.json",
|
| 80 |
+
"setup.json excluded"
|
| 81 |
+
],
|
| 82 |
+
[
|
| 83 |
+
".lake/build/ir/PartitionParity/Output/problem.setup.json",
|
| 84 |
+
"setup.json excluded"
|
| 85 |
+
]
|
| 86 |
+
],
|
| 87 |
+
"skipped_count": 2
|
| 88 |
+
},
|
| 89 |
+
"packed_at": "2026-11-08T21:40:53Z",
|
| 90 |
+
"unofficial": true
|
| 91 |
+
}
|
builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/reports/axiom_audit.txt
ADDED
|
@@ -0,0 +1,20 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
/home/ubuntu/staging/small/PartitionParity/67e16e88088b-e97371d381bc0ed5/reports/axiom_audit.lean:1:0: error: import PartitionParity.Output.solution failed, environment already contains 'PartitionParity.pFun' from PartitionParity.Output.problem
|
| 2 |
+
|
| 3 |
+
== PartitionParity.Output.problem
|
| 4 |
+
AXIOM-AUDIT decls=82 declared_axioms=[] axioms_used=[Quot.sound,
|
| 5 |
+
Classical.choice,
|
| 6 |
+
sorryAx,
|
| 7 |
+
propext] nonstandard_count=9 nonstandard_first=[(PartitionParity.statement1_mod2_consequence, [sorryAx]),
|
| 8 |
+
(PartitionParity.statement6_twist, [sorryAx]),
|
| 9 |
+
(PartitionParity.statement2_collapse, [sorryAx]),
|
| 10 |
+
(PartitionParity.statement5_mod2, [sorryAx]),
|
| 11 |
+
(PartitionParity.statement3_lambert, [sorryAx]),
|
| 12 |
+
(PartitionParity.statement1_mod4, [sorryAx]),
|
| 13 |
+
(PartitionParity.statement7_FeqE, [sorryAx]),
|
| 14 |
+
(PartitionParity.statement2_logderiv, [sorryAx]),
|
| 15 |
+
(PartitionParity.statement5_coeff_mod2, [sorryAx])] constants_walked=20836 AXIOM-AUDIT-END
|
| 16 |
+
|
| 17 |
+
== PartitionParity.Output.solution
|
| 18 |
+
AXIOM-AUDIT decls=125 declared_axioms=[] axioms_used=[Quot.sound,
|
| 19 |
+
Classical.choice,
|
| 20 |
+
propext] nonstandard_count=0 nonstandard_first=[] constants_walked=21507 AXIOM-AUDIT-END
|
builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/reports/axiom_audit_result.json
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
{"rc": 0, "mode": "per-module", "modules": 2, "pass": false, "decls": 207, "results": ["AXIOM-AUDIT decls=82 declared_axioms=[] axioms_used=[Quot.sound, Classical.choice, sorryAx, propext] nonstandard_count=9 nonstandard_first=[(PartitionParity.statement1_mod2_consequence, [sorryAx]), (PartitionParity.statement6_twist, [sorryAx]), (PartitionParity.statement2_collapse, [sorryAx]), (PartitionParity.statement5_mod2, [sorryAx]), (PartitionParity.statement3_lambert, [sorryAx]), (PartitionParity.statement1_mod4, [sorryAx]), (PartitionParity.statement7_FeqE, [sorryAx]), (PartitionParity.statement2_logderiv, [sorryAx]), (PartitionParity.statement5_coeff_mod2, [sorryAx])] constants_walked=20836 AXIOM-AUDIT-END", "AXIOM-AUDIT decls=125 declared_axioms=[] axioms_used=[Quot.sound, Classical.choice, propext] nonstandard_count=0 nonstandard_first=[] constants_walked=21507 AXIOM-AUDIT-END"], "errors": null}
|
builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/reports/build.log
ADDED
|
@@ -0,0 +1,92 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
⚠ [8026/8028] Built PartitionParity.Output.problem (5.7s)
|
| 2 |
+
warning: PartitionParity/Output/problem.lean:335:8: declaration uses `sorry`
|
| 3 |
+
warning: PartitionParity/Output/problem.lean:342:8: declaration uses `sorry`
|
| 4 |
+
warning: PartitionParity/Output/problem.lean:358:8: declaration uses `sorry`
|
| 5 |
+
warning: PartitionParity/Output/problem.lean:366:8: declaration uses `sorry`
|
| 6 |
+
warning: PartitionParity/Output/problem.lean:385:8: declaration uses `sorry`
|
| 7 |
+
warning: PartitionParity/Output/problem.lean:428:8: declaration uses `sorry`
|
| 8 |
+
warning: PartitionParity/Output/problem.lean:437:8: declaration uses `sorry`
|
| 9 |
+
warning: PartitionParity/Output/problem.lean:444:8: declaration uses `sorry`
|
| 10 |
+
warning: PartitionParity/Output/problem.lean:448:8: declaration uses `sorry`
|
| 11 |
+
⚠ [8027/8028] Built PartitionParity.Output.solution (14s)
|
| 12 |
+
warning: PartitionParity/Output/solution.lean:385:13: This simp argument is unused:
|
| 13 |
+
map_one
|
| 14 |
+
|
| 15 |
+
Hint: Omit it from the simp argument list.
|
| 16 |
+
simp only [̵m̵a̵p̵_̵o̵n̵e̵,̵ ̵m̵a̵p̵_̵p̵o̵w̵,̵[̲m̲a̲p̲_̲p̲o̲w̲,̲ PowerSeries.coeff_one]
|
| 17 |
+
|
| 18 |
+
Note: This linter can be disabled with `set_option linter.unusedSimpArgs false`
|
| 19 |
+
warning: PartitionParity/Output/solution.lean:385:22: This simp argument is unused:
|
| 20 |
+
map_pow
|
| 21 |
+
|
| 22 |
+
Hint: Omit it from the simp argument list.
|
| 23 |
+
simp only [map_one, m̵a̵p̵_̵p̵o̵w̵,̵ ̵PowerSeries.coeff_one]
|
| 24 |
+
|
| 25 |
+
Note: This linter can be disabled with `set_option linter.unusedSimpArgs false`
|
| 26 |
+
warning: PartitionParity/Output/solution.lean:398:23: this tactic is never executed
|
| 27 |
+
|
| 28 |
+
Note: This linter can be disabled with `set_option linter.unreachableTactic false`
|
| 29 |
+
warning: PartitionParity/Output/solution.lean:389:4: 'simp [map_pow, constantCoeff_X]' is a flexible tactic modifying '⊢'. Try 'simp?' and use the suggested 'simp only [...]'. Alternatively, use `suffices` to explicitly state the simplified form.
|
| 30 |
+
|
| 31 |
+
Note: This linter can be disabled with `set_option linter.flexible false`
|
| 32 |
+
info: PartitionParity/Output/solution.lean:389:4: Try this:
|
| 33 |
+
[apply] simp only [↓reduceIte, map_pow, constantCoeff_X, eq_intCast, Int.cast_sub, Int.cast_one, Int.cast_pow,
|
| 34 |
+
Int.cast_zero, Int.cast_add]
|
| 35 |
+
info: PartitionParity/Output/solution.lean:390:4: 'rcases eq_or_ne j 0 with rfl | hj0' uses '⊢'!
|
| 36 |
+
warning: PartitionParity/Output/solution.lean:389:4: 'simp [map_pow, constantCoeff_X]' is a flexible tactic modifying '⊢'. Try 'simp?' and use the suggested 'simp only [...]'. Alternatively, use `suffices` to explicitly state the simplified form.
|
| 37 |
+
|
| 38 |
+
Note: This linter can be disabled with `set_option linter.flexible false`
|
| 39 |
+
info: PartitionParity/Output/solution.lean:389:4: Try this:
|
| 40 |
+
[apply] simp only [↓reduceIte, map_pow, constantCoeff_X, eq_intCast, Int.cast_sub, Int.cast_one, Int.cast_pow,
|
| 41 |
+
Int.cast_zero, Int.cast_add]
|
| 42 |
+
info: PartitionParity/Output/solution.lean:391:12: 'decide' uses '⊢'!
|
| 43 |
+
warning: PartitionParity/Output/solution.lean:398:23: 'decide' tactic does nothing
|
| 44 |
+
|
| 45 |
+
Note: This linter can be disabled with `set_option linter.unusedTactic false`
|
| 46 |
+
warning: PartitionParity/Output/solution.lean:468:5: unused variable `hGauss`
|
| 47 |
+
|
| 48 |
+
Note: This linter can be disabled with `set_option linter.unusedVariables false`
|
| 49 |
+
warning: PartitionParity/Output/solution.lean:482:5: unused variable `hD1`
|
| 50 |
+
|
| 51 |
+
Note: This linter can be disabled with `set_option linter.unusedVariables false`
|
| 52 |
+
warning: PartitionParity/Output/solution.lean:482:19: unused variable `hDsf`
|
| 53 |
+
|
| 54 |
+
Note: This linter can be disabled with `set_option linter.unusedVariables false`
|
| 55 |
+
warning: PartitionParity/Output/solution.lean:482:41: unused variable `hD24`
|
| 56 |
+
|
| 57 |
+
Note: This linter can be disabled with `set_option linter.unusedVariables false`
|
| 58 |
+
warning: PartitionParity/Output/solution.lean:516:5: unused variable `hD1`
|
| 59 |
+
|
| 60 |
+
Note: This linter can be disabled with `set_option linter.unusedVariables false`
|
| 61 |
+
warning: PartitionParity/Output/solution.lean:516:19: unused variable `hDsf`
|
| 62 |
+
|
| 63 |
+
Note: This linter can be disabled with `set_option linter.unusedVariables false`
|
| 64 |
+
warning: PartitionParity/Output/solution.lean:555:16: 'simp at hmdvd' is a flexible tactic modifying 'hmdvd'. Try 'simp?' and use the suggested 'simp only [...]'. Alternatively, use `suffices` to explicitly state the simplified form.
|
| 65 |
+
|
| 66 |
+
Note: This linter can be disabled with `set_option linter.flexible false`
|
| 67 |
+
info: PartitionParity/Output/solution.lean:555:16: Try this:
|
| 68 |
+
[apply] simp only [lt_self_iff_false] at hmdvd
|
| 69 |
+
info: PartitionParity/Output/solution.lean:555:31: 'exact absurd hmdvd hN0' uses 'hmdvd'!
|
| 70 |
+
warning: PartitionParity/Output/solution.lean:542:6: The `show` tactic should only be used to indicate intermediate goal states for readability.
|
| 71 |
+
However, this tactic invocation changed the goal. Please use `change` instead for these purposes.
|
| 72 |
+
|
| 73 |
+
Note: This linter can be disabled with `set_option linter.style.show false`
|
| 74 |
+
warning: PartitionParity/Output/solution.lean:649:2: 'simp' is a flexible tactic modifying '⊢'. Try 'simp?' and use the suggested 'simp only [...]'. Alternatively, use `suffices` to explicitly state the simplified form.
|
| 75 |
+
|
| 76 |
+
Note: This linter can be disabled with `set_option linter.flexible false`
|
| 77 |
+
info: PartitionParity/Output/solution.lean:649:2: Try this:
|
| 78 |
+
[apply] simp only [pow_zero, add_eq_right]
|
| 79 |
+
info: PartitionParity/Output/solution.lean:650:2: 'induction a with
|
| 80 |
+
| zero => simp
|
| 81 |
+
| succ k ih =>
|
| 82 |
+
rw [Finset.sum_range_succ]
|
| 83 |
+
rw [show ((2 : ZMod 2)) = 0 by decide]
|
| 84 |
+
simp' uses '⊢'!
|
| 85 |
+
warning: PartitionParity/Output/solution.lean:798:6: The `show` tactic should only be used to indicate intermediate goal states for readability.
|
| 86 |
+
However, this tactic invocation changed the goal. Please use `change` instead for these purposes.
|
| 87 |
+
|
| 88 |
+
Note: This linter can be disabled with `set_option linter.style.show false`
|
| 89 |
+
warning: PartitionParity/Output/solution.lean:915:4: 'push_cast' tactic does nothing
|
| 90 |
+
|
| 91 |
+
Note: This linter can be disabled with `set_option linter.unusedTactic false`
|
| 92 |
+
Build completed successfully (8028 jobs).
|
builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/shards/frames.jsonl
ADDED
|
@@ -0,0 +1,2 @@
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{"shard":"shards/part-00000.tar.zst","offset":0,"length":267249,"raw_length":983040,"module":"PartitionParity.Output.problem","files":7,"sha256":"2f9d39b72d08ea24da1443923e9d1a6887ef33ea1a67243f9685b040c8d83a2f"}
|
| 2 |
+
{"shard":"shards/part-00000.tar.zst","offset":267249,"length":520802,"raw_length":1853440,"module":"PartitionParity.Output.solution","files":7,"sha256":"84f7137dd27705432c6d583203defaa4e736c4ce37c8a4fe2b383070a2562339"}
|
builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/shards/index.jsonl
ADDED
|
@@ -0,0 +1,14 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{"path":".lake/build/ir/PartitionParity/Output/problem.c","sha256":"329b67f42bada0029f22436b68bb042d37a6e95241ebacdc8710da90849aecf8","bytes":16503,"shard":"shards/part-00000.tar.zst","module":"PartitionParity.Output.problem"}
|
| 2 |
+
{"path":".lake/build/ir/PartitionParity/Output/problem.c.hash","sha256":"13c884f30a0123e67cddce38d9ae010ac23718bfc74a0fb0eb23aa64c3d815e3","bytes":16,"shard":"shards/part-00000.tar.zst","module":"PartitionParity.Output.problem"}
|
| 3 |
+
{"path":".lake/build/lib/lean/PartitionParity/Output/problem.ilean","sha256":"c4ad8ead8baa2addeb6de88978e1c5609681fca70fa09b5ac64cd84d0e41010e","bytes":56515,"shard":"shards/part-00000.tar.zst","module":"PartitionParity.Output.problem"}
|
| 4 |
+
{"path":".lake/build/lib/lean/PartitionParity/Output/problem.ilean.hash","sha256":"31ddadb61703b36b7c9605361e310fc4f3236d0ecce878b3b3b85993653ad9e6","bytes":16,"shard":"shards/part-00000.tar.zst","module":"PartitionParity.Output.problem"}
|
| 5 |
+
{"path":".lake/build/lib/lean/PartitionParity/Output/problem.olean","sha256":"fe8d1cc1ecba4d4430beb130234edfbbd6cae14d63efb17e90121ea5f8ff7f47","bytes":896888,"shard":"shards/part-00000.tar.zst","module":"PartitionParity.Output.problem"}
|
| 6 |
+
{"path":".lake/build/lib/lean/PartitionParity/Output/problem.olean.hash","sha256":"d296e77cd4d097d9f501d8b4024b37c7aee51ce4d2d9d4ac8895a5bd9d6e6312","bytes":16,"shard":"shards/part-00000.tar.zst","module":"PartitionParity.Output.problem"}
|
| 7 |
+
{"path":".lake/build/lib/lean/PartitionParity/Output/problem.trace","sha256":"5682b01118c0e914030dfef306533697a72d5337002818ca511b99652330e631","bytes":3720,"shard":"shards/part-00000.tar.zst","module":"PartitionParity.Output.problem"}
|
| 8 |
+
{"path":".lake/build/ir/PartitionParity/Output/solution.c","sha256":"9dc91de6f3e219b18e194c893dd095eef07b6a0d4622c0021545e97345684bf6","bytes":16505,"shard":"shards/part-00000.tar.zst","module":"PartitionParity.Output.solution"}
|
| 9 |
+
{"path":".lake/build/ir/PartitionParity/Output/solution.c.hash","sha256":"b76c461786f9007f52f2c99a7ca7f8bcfbce802d588c3dbc22f68d85bb3a90e3","bytes":16,"shard":"shards/part-00000.tar.zst","module":"PartitionParity.Output.solution"}
|
| 10 |
+
{"path":".lake/build/lib/lean/PartitionParity/Output/solution.ilean","sha256":"7f3a94b9aa33b545296582f06845520855b89d24dc358c25839ab8e207f256a9","bytes":109254,"shard":"shards/part-00000.tar.zst","module":"PartitionParity.Output.solution"}
|
| 11 |
+
{"path":".lake/build/lib/lean/PartitionParity/Output/solution.ilean.hash","sha256":"1cd576df69b8459ce1e5b4674894419c33f5c185a94b100b88d1c382ba49b278","bytes":16,"shard":"shards/part-00000.tar.zst","module":"PartitionParity.Output.solution"}
|
| 12 |
+
{"path":".lake/build/lib/lean/PartitionParity/Output/solution.olean","sha256":"369aa1fb1fdf8a5d0dec8eff2ad8e23c813447a5eead087f3d381a9fb6ba3514","bytes":1711984,"shard":"shards/part-00000.tar.zst","module":"PartitionParity.Output.solution"}
|
| 13 |
+
{"path":".lake/build/lib/lean/PartitionParity/Output/solution.olean.hash","sha256":"a702107d5e406db6f6198f1f6988baf7e201eaa2046c0ca99c742ae6b2d3ee26","bytes":16,"shard":"shards/part-00000.tar.zst","module":"PartitionParity.Output.solution"}
|
| 14 |
+
{"path":".lake/build/lib/lean/PartitionParity/Output/solution.trace","sha256":"a04705a8c483c74ebb5596086198bb099fd1148fe17cb0518137879741439f0b","bytes":8692,"shard":"shards/part-00000.tar.zst","module":"PartitionParity.Output.solution"}
|
builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/shards/modules.jsonl
ADDED
|
@@ -0,0 +1,2 @@
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{"module":"PartitionParity.Output.problem","shards":["shards/part-00000.tar.zst"],"imports":["Mathlib"]}
|
| 2 |
+
{"module":"PartitionParity.Output.solution","shards":["shards/part-00000.tar.zst"],"imports":["Mathlib"]}
|
builds/v4.28.0/x86_64-unknown-linux-gnu/67e16e88088b-e97371d381bc0ed5/shards/part-00000.tar.zst
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:6f6871671003c49d895d17ab3c81c5235209b581aad7fa36900b5d4f05b3093c
|
| 3 |
+
size 788051
|