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/906bf3459081-1cbbfaa1d792e33b/SHA256SUMS.txt +9 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/lake-manifest.json +96 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/manifest.json +99 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/reports/axiom_audit.txt +35 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/reports/axiom_audit_result.json +1 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/reports/build.log +241 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/shards/frames.jsonl +4 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/shards/index.jsonl +28 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/shards/modules.jsonl +4 -0
- builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/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/challenge_3 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/906bf3459081-1cbbfaa1d792e33b`: source commit 906bf345908100af358c60f9336f27dc571d21ac
|
README.md
ADDED
|
@@ -0,0 +1,79 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
license: mit
|
| 3 |
+
pretty_name: "Compiled Lean outputs for challenge_3 (from AxiomMath/challenge_3, unofficial)"
|
| 4 |
+
tags:
|
| 5 |
+
- lean4
|
| 6 |
+
- mathlib
|
| 7 |
+
- formal-mathematics
|
| 8 |
+
- build-cache
|
| 9 |
+
---
|
| 10 |
+
|
| 11 |
+
# Compiled Lean outputs for challenge_3
|
| 12 |
+
|
| 13 |
+
> **What this is.** Compiled Lean 4 outputs (`.olean`, `.ilean`, `.c` and Lake trace files) for
|
| 14 |
+
> [AxiomMath/challenge_3](https://github.com/AxiomMath/challenge_3) 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 challenge_3. 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 |
+
| `906bf3459081` | v4.28.0 | 2026-11-08 | 4 | 12 | 52 | flags sorry | passed |
|
| 32 |
+
|
| 33 |
+
**Build `906bf3459081-1cbbfaa1d792e33b`** (source commit `906bf345908100af358c60f9336f27dc571d21ac`)
|
| 34 |
+
|
| 35 |
+
- `sorry` warnings: 12, in `Challenge_3/lemma_b2/problem.lean`, `Challenge_3/lemma_b3/problem.lean`. Results in these files are not proved.
|
| 36 |
+
- Axiom audit: 526 declarations; axioms beyond the standard three: sorryAx.
|
| 37 |
+
- Declarations that depend on them (first ones listed by the audit): `ColoredRectangles.q_signed_count` (sorryAx), `ColoredRectangles.card_R` (sorryAx), `ColoredRectangles.qn_nonneg` (sorryAx), `ColoredRectangles.injection` (sorryAx), `ColoredRectangles.Xpos_union_Xneg` (sorryAx), `ColoredRectangles.disjoint_Xpos_Xneg` (sorryAx), `ColoredRectangles.card_Xneg_le_card_Xpos` (sorryAx), `ColoredRectangles.prop_main` (sorryAx), `ColoredRectangles.q_signed_count` (sorryAx), `ColoredRectangles.qn_nonneg` (sorryAx), `ColoredRectangles.cQ_pos` (sorryAx), `ColoredRectangles.injection` (sorryAx) ...
|
| 38 |
+
- Round trip on a clean machine: passed. Restored on a clean machine; AxiomMath/challenge_3: Lake reported every target up to date (8030 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/challenge_3 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/906bf3459081-1cbbfaa1d792e33b/SHA256SUMS.txt
ADDED
|
@@ -0,0 +1,9 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
5a6b411343caf1a9b5dd51c2a6d54ebc826adba900aff17b916f2b823d44c026 lake-manifest.json
|
| 2 |
+
cf4d5fe963d7da8b6cc7a29e2f7863ae88b22a3faf20a9999079e4cdc69dd7b4 manifest.json
|
| 3 |
+
34878e8702fcfb680506181eeb82c87807d01bbda87311077d2c204586d8d094 reports/axiom_audit.txt
|
| 4 |
+
8fc7bbab0ca4308cd3bf77a02baee9b3a9d80ae6b2c33eca1bf80f2c7b08f26c reports/axiom_audit_result.json
|
| 5 |
+
c4e01a15da81698e358faf41ea5d8e34509cb70a62c6b9fca48de4bb84c03a8e reports/build.log
|
| 6 |
+
298ad300d7e903bfc6bf6869afed2ff5c3a27deb46a1adc10d91072062c74ccc shards/frames.jsonl
|
| 7 |
+
e1884d27510e8569a2c20cba5055153977663f126c80cdf48a3447ee3788a4fa shards/index.jsonl
|
| 8 |
+
212773f3f1048fd68f24972a4f09a9712a55960a294631554b4ad4d2aa11e530 shards/modules.jsonl
|
| 9 |
+
265ed46c562fc6ce60a0ce6ce6800379ad712a8258c2cf20d1dbcc90bf28c629 shards/part-00000.tar.zst
|
builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/lake-manifest.json
ADDED
|
@@ -0,0 +1,96 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{"version": "1.2.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": "Challenge_3",
|
| 95 |
+
"lakeDir": ".lake",
|
| 96 |
+
"fixedToolchain": false}
|
builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/manifest.json
ADDED
|
@@ -0,0 +1,99 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{
|
| 2 |
+
"schema": "lean-build-manifest/1",
|
| 3 |
+
"features": [
|
| 4 |
+
"modules_index",
|
| 5 |
+
"module_frames"
|
| 6 |
+
],
|
| 7 |
+
"frames": 4,
|
| 8 |
+
"package": "Challenge_3",
|
| 9 |
+
"source_repo": "https://github.com/AxiomMath/challenge_3",
|
| 10 |
+
"commit": "906bf345908100af358c60f9336f27dc571d21ac",
|
| 11 |
+
"license": "MIT",
|
| 12 |
+
"toolchain": "leanprover/lean4:v4.28.0",
|
| 13 |
+
"platform": "x86_64-unknown-linux-gnu",
|
| 14 |
+
"build_key": "1cbbfaa1d792e33b",
|
| 15 |
+
"closure": [
|
| 16 |
+
[
|
| 17 |
+
"Challenge_3",
|
| 18 |
+
"906bf345908100af358c60f9336f27dc571d21ac"
|
| 19 |
+
],
|
| 20 |
+
[
|
| 21 |
+
"Cli",
|
| 22 |
+
"4f10f47646cb7d5748d6f423f4a07f98f7bbcc9e"
|
| 23 |
+
],
|
| 24 |
+
[
|
| 25 |
+
"LeanSearchClient",
|
| 26 |
+
"c5d5b8fe6e5158def25cd28eb94e4141ad97c843"
|
| 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": 4,
|
| 58 |
+
"modules_without_source": 0,
|
| 59 |
+
"files": 28,
|
| 60 |
+
"bytes_uncompressed": 7736751,
|
| 61 |
+
"bytes_compressed": 2171423,
|
| 62 |
+
"shard_target_bytes_uncompressed": 1000000000,
|
| 63 |
+
"shards": [
|
| 64 |
+
{
|
| 65 |
+
"name": "shards/part-00000.tar.zst",
|
| 66 |
+
"sha256": "265ed46c562fc6ce60a0ce6ce6800379ad712a8258c2cf20d1dbcc90bf28c629",
|
| 67 |
+
"bytes": 2171423,
|
| 68 |
+
"bytes_uncompressed": 7782400,
|
| 69 |
+
"files": 28,
|
| 70 |
+
"first_module": "Challenge_3.lemma_b2.problem",
|
| 71 |
+
"last_module": "Challenge_3.lemma_b3.solution"
|
| 72 |
+
}
|
| 73 |
+
],
|
| 74 |
+
"zstd_level": 19,
|
| 75 |
+
"excluded": {
|
| 76 |
+
"setup_json": true,
|
| 77 |
+
"skipped": [
|
| 78 |
+
[
|
| 79 |
+
".lake/build/ir/Challenge_3/lemma_b2/solution.setup.json",
|
| 80 |
+
"setup.json excluded"
|
| 81 |
+
],
|
| 82 |
+
[
|
| 83 |
+
".lake/build/ir/Challenge_3/lemma_b2/problem.setup.json",
|
| 84 |
+
"setup.json excluded"
|
| 85 |
+
],
|
| 86 |
+
[
|
| 87 |
+
".lake/build/ir/Challenge_3/lemma_b3/solution.setup.json",
|
| 88 |
+
"setup.json excluded"
|
| 89 |
+
],
|
| 90 |
+
[
|
| 91 |
+
".lake/build/ir/Challenge_3/lemma_b3/problem.setup.json",
|
| 92 |
+
"setup.json excluded"
|
| 93 |
+
]
|
| 94 |
+
],
|
| 95 |
+
"skipped_count": 4
|
| 96 |
+
},
|
| 97 |
+
"packed_at": "2026-11-08T21:51:56Z",
|
| 98 |
+
"unofficial": true
|
| 99 |
+
}
|
builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/reports/axiom_audit.txt
ADDED
|
@@ -0,0 +1,35 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
/home/ubuntu/staging/small/Challenge_3/906bf3459081-1cbbfaa1d792e33b/reports/axiom_audit.lean:1:0: error: import Challenge_3.lemma_b2.solution failed, environment already contains 'ColoredRectangles.Xpos' from Challenge_3.lemma_b2.problem
|
| 2 |
+
|
| 3 |
+
== Challenge_3.lemma_b2.problem
|
| 4 |
+
AXIOM-AUDIT decls=14 declared_axioms=[] axioms_used=[Quot.sound,
|
| 5 |
+
Classical.choice,
|
| 6 |
+
sorryAx,
|
| 7 |
+
propext] nonstandard_count=7 nonstandard_first=[(ColoredRectangles.q_signed_count, [sorryAx]),
|
| 8 |
+
(ColoredRectangles.card_R, [sorryAx]),
|
| 9 |
+
(ColoredRectangles.qn_nonneg, [sorryAx]),
|
| 10 |
+
(ColoredRectangles.injection, [sorryAx]),
|
| 11 |
+
(ColoredRectangles.Xpos_union_Xneg, [sorryAx]),
|
| 12 |
+
(ColoredRectangles.disjoint_Xpos_Xneg, [sorryAx]),
|
| 13 |
+
(ColoredRectangles.card_Xneg_le_card_Xpos, [sorryAx])] constants_walked=3813 AXIOM-AUDIT-END
|
| 14 |
+
|
| 15 |
+
== Challenge_3.lemma_b2.solution
|
| 16 |
+
AXIOM-AUDIT decls=172 declared_axioms=[] axioms_used=[Quot.sound,
|
| 17 |
+
Classical.choice,
|
| 18 |
+
propext] nonstandard_count=0 nonstandard_first=[] constants_walked=12887 AXIOM-AUDIT-END
|
| 19 |
+
|
| 20 |
+
== Challenge_3.lemma_b3.problem
|
| 21 |
+
AXIOM-AUDIT decls=32 declared_axioms=[] axioms_used=[Quot.sound,
|
| 22 |
+
Classical.choice,
|
| 23 |
+
sorryAx,
|
| 24 |
+
propext] nonstandard_count=7 nonstandard_first=[(ColoredRectangles.prop_main, [sorryAx]),
|
| 25 |
+
(ColoredRectangles.q_signed_count, [sorryAx]),
|
| 26 |
+
(ColoredRectangles.qn_nonneg, [sorryAx]),
|
| 27 |
+
(ColoredRectangles.cQ_pos, [sorryAx]),
|
| 28 |
+
(ColoredRectangles.injection, [sorryAx]),
|
| 29 |
+
(ColoredRectangles.prop_easy, [sorryAx]),
|
| 30 |
+
(ColoredRectangles.card_Xneg_le_card_Xpos, [sorryAx])] constants_walked=13418 AXIOM-AUDIT-END
|
| 31 |
+
|
| 32 |
+
== Challenge_3.lemma_b3.solution
|
| 33 |
+
AXIOM-AUDIT decls=308 declared_axioms=[] axioms_used=[Quot.sound,
|
| 34 |
+
Classical.choice,
|
| 35 |
+
propext] nonstandard_count=0 nonstandard_first=[] constants_walked=14325 AXIOM-AUDIT-END
|
builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/reports/axiom_audit_result.json
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
{"rc": 0, "mode": "per-module", "modules": 4, "pass": false, "decls": 526, "results": ["AXIOM-AUDIT decls=14 declared_axioms=[] axioms_used=[Quot.sound, Classical.choice, sorryAx, propext] nonstandard_count=7 nonstandard_first=[(ColoredRectangles.q_signed_count, [sorryAx]), (ColoredRectangles.card_R, [sorryAx]), (ColoredRectangles.qn_nonneg, [sorryAx]), (ColoredRectangles.injection, [sorryAx]), (ColoredRectangles.Xpos_union_Xneg, [sorryAx]), (ColoredRectangles.disjoint_Xpos_Xneg, [sorryAx]), (ColoredRectangles.card_Xneg_le_card_Xpos, [sorryAx])] constants_walked=3813 AXIOM-AUDIT-END", "AXIOM-AUDIT decls=172 declared_axioms=[] axioms_used=[Quot.sound, Classical.choice, propext] nonstandard_count=0 nonstandard_first=[] constants_walked=12887 AXIOM-AUDIT-END", "AXIOM-AUDIT decls=32 declared_axioms=[] axioms_used=[Quot.sound, Classical.choice, sorryAx, propext] nonstandard_count=7 nonstandard_first=[(ColoredRectangles.prop_main, [sorryAx]), (ColoredRectangles.q_signed_count, [sorryAx]), (ColoredRectangles.qn_nonneg, [sorryAx]), (ColoredRectangles.cQ_pos, [sorryAx]), (ColoredRectangles.injection, [sorryAx]), (ColoredRectangles.prop_easy, [sorryAx]), (ColoredRectangles.card_Xneg_le_card_Xpos, [sorryAx])] constants_walked=13418 AXIOM-AUDIT-END", "AXIOM-AUDIT decls=308 declared_axioms=[] axioms_used=[Quot.sound, Classical.choice, propext] nonstandard_count=0 nonstandard_first=[] constants_walked=14325 AXIOM-AUDIT-END"], "errors": null}
|
builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/reports/build.log
ADDED
|
@@ -0,0 +1,241 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
⚠ [8026/8030] Built Challenge_3.lemma_b2.problem (4.1s)
|
| 2 |
+
warning: Challenge_3/lemma_b2/problem.lean:92:8: declaration uses `sorry`
|
| 3 |
+
warning: Challenge_3/lemma_b2/problem.lean:96:8: declaration uses `sorry`
|
| 4 |
+
warning: Challenge_3/lemma_b2/problem.lean:100:8: declaration uses `sorry`
|
| 5 |
+
warning: Challenge_3/lemma_b2/problem.lean:105:8: declaration uses `sorry`
|
| 6 |
+
warning: Challenge_3/lemma_b2/problem.lean:112:8: declaration uses `sorry`
|
| 7 |
+
warning: Challenge_3/lemma_b2/problem.lean:118:8: declaration uses `sorry`
|
| 8 |
+
warning: Challenge_3/lemma_b2/problem.lean:123:8: declaration uses `sorry`
|
| 9 |
+
⚠ [8027/8030] Built Challenge_3.lemma_b3.problem (4.4s)
|
| 10 |
+
warning: Challenge_3/lemma_b3/problem.lean:121:8: declaration uses `sorry`
|
| 11 |
+
warning: Challenge_3/lemma_b3/problem.lean:128:8: declaration uses `sorry`
|
| 12 |
+
warning: Challenge_3/lemma_b3/problem.lean:198:8: declaration uses `sorry`
|
| 13 |
+
warning: Challenge_3/lemma_b3/problem.lean:203:8: declaration uses `sorry`
|
| 14 |
+
warning: Challenge_3/lemma_b3/problem.lean:208:8: declaration uses `sorry`
|
| 15 |
+
⚠ [8028/8030] Built Challenge_3.lemma_b3.solution (17s)
|
| 16 |
+
warning: Challenge_3/lemma_b3/solution.lean:177:8: 'simp [Finset.mem_insert, Finset.mem_singleton] at hε_mem' is a flexible tactic modifying 'hε_mem'. Try 'simp?' and use the suggested 'simp only [...]'. Alternatively, use `suffices` to explicitly state the simplified form.
|
| 17 |
+
|
| 18 |
+
Note: This linter can be disabled with `set_option linter.flexible false`
|
| 19 |
+
info: Challenge_3/lemma_b3/solution.lean:177:66: 'exact hε_mem' uses 'hε_mem'!
|
| 20 |
+
warning: Challenge_3/lemma_b3/solution.lean:178:8: 'simp [Finset.mem_singleton] at hε_mem' is a flexible tactic modifying 'hε_mem'. Try 'simp?' and use the suggested 'simp only [...]'. Alternatively, use `suffices` to explicitly state the simplified form.
|
| 21 |
+
|
| 22 |
+
Note: This linter can be disabled with `set_option linter.flexible false`
|
| 23 |
+
info: Challenge_3/lemma_b3/solution.lean:178:53: 'exact hε_mem' uses 'hε_mem'!
|
| 24 |
+
warning: Challenge_3/lemma_b3/solution.lean:155:100: This line exceeds the 100 character limit, please shorten it!
|
| 25 |
+
|
| 26 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 27 |
+
warning: Challenge_3/lemma_b3/solution.lean:159:100: This line exceeds the 100 character limit, please shorten it!
|
| 28 |
+
|
| 29 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 30 |
+
warning: Challenge_3/lemma_b3/solution.lean:182:100: This line exceeds the 100 character limit, please shorten it!
|
| 31 |
+
|
| 32 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 33 |
+
warning: Challenge_3/lemma_b3/solution.lean:203:100: This line exceeds the 100 character limit, please shorten it!
|
| 34 |
+
|
| 35 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 36 |
+
warning: Challenge_3/lemma_b3/solution.lean:279:100: This line exceeds the 100 character limit, please shorten it!
|
| 37 |
+
|
| 38 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 39 |
+
warning: Challenge_3/lemma_b3/solution.lean:293:75: Used `tac1 <;> tac2` where `(tac1; tac2)` would suffice
|
| 40 |
+
|
| 41 |
+
Note: This linter can be disabled with `set_option linter.unnecessarySeqFocus false`
|
| 42 |
+
warning: Challenge_3/lemma_b3/solution.lean:337:16: This simp argument is unused:
|
| 43 |
+
show ¬(x.1 + 1 < N) from by omega
|
| 44 |
+
|
| 45 |
+
Hint: Omit it from the simp argument list.
|
| 46 |
+
s̵i̵m̵p̵ ̵[̵s̵h̵o̵w̵ ̵¬̵ ̵(̵x̵.̵1̵ ̵+̵ ̵1̵ ̵<̵ ̵N̵)̵ ̵f̵r̵o̵m̵ ̵b̵y̵ ̵o̵m̵e̵g̵a̵,̵ ̵h̵]̵s̲i̲m̲p̲ ̲[̲h̲]̲
|
| 47 |
+
|
| 48 |
+
Note: This linter can be disabled with `set_option linter.unusedSimpArgs false`
|
| 49 |
+
warning: Challenge_3/lemma_b3/solution.lean:351:16: This simp argument is unused:
|
| 50 |
+
show ¬(x.1 + 1 < N) from by omega
|
| 51 |
+
|
| 52 |
+
Hint: Omit it from the simp argument list.
|
| 53 |
+
s̵i̵m̵p̵ ̵[̵s̵h̵o̵w̵ ̵¬̵ ̵(̵x̵.̵1̵ ̵+̵ ̵1̵ ̵<̵ ̵N̵)̵ ̵f̵r̵o̵m̵ ̵b̵y̵ ̵o̵m̵e̵g̵a̵,̵ ̵h̵]̵s̲i̲m̲p̲ ̲[̲h̲]̲
|
| 54 |
+
|
| 55 |
+
Note: This linter can be disabled with `set_option linter.unusedSimpArgs false`
|
| 56 |
+
warning: Challenge_3/lemma_b3/solution.lean:295:0: Please, add a comment explaining the need for modifying the maxHeartbeat limit, as in
|
| 57 |
+
set_option maxHeartbeats 400000 in
|
| 58 |
+
-- reason for change
|
| 59 |
+
...
|
| 60 |
+
|
| 61 |
+
Note: This linter can be disabled with `set_option linter.style.maxHeartbeats false`
|
| 62 |
+
warning: Challenge_3/lemma_b3/solution.lean:322:8: 'simp [hlt]' is a flexible tactic modifying '⊢'. Try 'simp?' and use the suggested 'simp only [...]'. Alternatively, use `suffices` to explicitly state the simplified form.
|
| 63 |
+
|
| 64 |
+
Note: This linter can be disabled with `set_option linter.flexible false`
|
| 65 |
+
info: Challenge_3/lemma_b3/solution.lean:322:20: 'rcases heps01 with h | h' uses '⊢'!
|
| 66 |
+
warning: Challenge_3/lemma_b3/solution.lean:319:100: This line exceeds the 100 character limit, please shorten it!
|
| 67 |
+
|
| 68 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 69 |
+
warning: Challenge_3/lemma_b3/solution.lean:321:100: This line exceeds the 100 character limit, please shorten it!
|
| 70 |
+
|
| 71 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 72 |
+
warning: Challenge_3/lemma_b3/solution.lean:399:100: This line exceeds the 100 character limit, please shorten it!
|
| 73 |
+
|
| 74 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 75 |
+
warning: Challenge_3/lemma_b3/solution.lean:400:100: This line exceeds the 100 character limit, please shorten it!
|
| 76 |
+
|
| 77 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 78 |
+
warning: Challenge_3/lemma_b3/solution.lean:550:14: This simp argument is unused:
|
| 79 |
+
show ¬(x.1 + 1 < N) from by omega
|
| 80 |
+
|
| 81 |
+
Hint: Omit it from the simp argument list.
|
| 82 |
+
s̵i̵m̵p̵ ̵[̵s̵h̵o̵w̵ ̵¬̵ ̵(̵x̵.̵1̵ ̵+̵ ̵1̵ ̵<̵ ̵N̵)̵ ̵f̵r̵o̵m̵ ̵b̵y̵ ̵o̵m̵e̵g̵a̵,̵ ̵h̵]̵s̲i̲m̲p̲ ̲[̲h̲]̲
|
| 83 |
+
|
| 84 |
+
Note: This linter can be disabled with `set_option linter.unusedSimpArgs false`
|
| 85 |
+
warning: Challenge_3/lemma_b3/solution.lean:563:14: This simp argument is unused:
|
| 86 |
+
show ¬(x.1 + 1 < N) from by omega
|
| 87 |
+
|
| 88 |
+
Hint: Omit it from the simp argument list.
|
| 89 |
+
s̵i̵m̵p̵ ̵[̵s̵h̵o̵w̵ ̵¬̵ ̵(̵x̵.̵1̵ ̵+̵ ̵1̵ ̵<̵ ̵N̵)̵ ̵f̵r̵o̵m̵ ̵b̵y̵ ̵o̵m̵e̵g̵a̵,̵ ̵h̵]̵s̲i̲m̲p̲ ̲[̲h̲]̲
|
| 90 |
+
|
| 91 |
+
Note: This linter can be disabled with `set_option linter.unusedSimpArgs false`
|
| 92 |
+
warning: Challenge_3/lemma_b3/solution.lean:515:0: Please, add a comment explaining the need for modifying the maxHeartbeat limit, as in
|
| 93 |
+
set_option maxHeartbeats 400000 in
|
| 94 |
+
-- reason for change
|
| 95 |
+
...
|
| 96 |
+
|
| 97 |
+
Note: This linter can be disabled with `set_option linter.style.maxHeartbeats false`
|
| 98 |
+
warning: Challenge_3/lemma_b3/solution.lean:536:6: 'simp [hlt]' is a flexible tactic modifying '⊢'. Try 'simp?' and use the suggested 'simp only [...]'. Alternatively, use `suffices` to explicitly state the simplified form.
|
| 99 |
+
|
| 100 |
+
Note: This linter can be disabled with `set_option linter.flexible false`
|
| 101 |
+
info: Challenge_3/lemma_b3/solution.lean:536:18: 'rcases heps01 with h | h' uses '⊢'!
|
| 102 |
+
warning: Challenge_3/lemma_b3/solution.lean:533:100: This line exceeds the 100 character limit, please shorten it!
|
| 103 |
+
|
| 104 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 105 |
+
warning: Challenge_3/lemma_b3/solution.lean:535:100: This line exceeds the 100 character limit, please shorten it!
|
| 106 |
+
|
| 107 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 108 |
+
warning: Challenge_3/lemma_b3/solution.lean:607:0: Please, add a comment explaining the need for modifying the maxHeartbeat limit, as in
|
| 109 |
+
set_option maxHeartbeats 400000 in
|
| 110 |
+
-- reason for change
|
| 111 |
+
...
|
| 112 |
+
|
| 113 |
+
Note: This linter can be disabled with `set_option linter.style.maxHeartbeats false`
|
| 114 |
+
info: Challenge_3/lemma_b3/solution.lean:848:36: Try this:
|
| 115 |
+
[apply] ring_nf
|
| 116 |
+
|
| 117 |
+
The `ring` tactic failed to close the goal. Use `ring_nf` to obtain a normal form.
|
| 118 |
+
|
| 119 |
+
Note that `ring` works primarily in *commutative* rings. If you have a noncommutative ring, abelian group or module, consider using `noncomm_ring`, `abel` or `module` instead.
|
| 120 |
+
warning: Challenge_3/lemma_b3/solution.lean:826:100: This line exceeds the 100 character limit, please shorten it!
|
| 121 |
+
|
| 122 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 123 |
+
warning: Challenge_3/lemma_b3/solution.lean:940:100: This line exceeds the 100 character limit, please shorten it!
|
| 124 |
+
|
| 125 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 126 |
+
warning: Challenge_3/lemma_b3/solution.lean:990:26: This simp argument is unused:
|
| 127 |
+
Finset.mem_antidiagonal
|
| 128 |
+
|
| 129 |
+
Hint: Omit it from the simp argument list.
|
| 130 |
+
simp ̵[̵F̵i̵n̵s̵e̵t̵.̵m̵e̵m̵_̵a̵n̵t̵i̵d̵i̵a̵g̵o̵n̵a̵l̵]̵
|
| 131 |
+
|
| 132 |
+
Note: This linter can be disabled with `set_option linter.unusedSimpArgs false`
|
| 133 |
+
warning: Challenge_3/lemma_b3/solution.lean:1003:17: This simp argument is unused:
|
| 134 |
+
Prod.fst
|
| 135 |
+
|
| 136 |
+
Hint: Omit it from the simp argument list.
|
| 137 |
+
simp only [̵P̵r̵o̵d̵.̵f̵s̵t̵,̵ ̵P̵r̵o̵d̵.̵s̵n̵d̵]̵[̲P̲r̲o̲d̲.̲s̲n̲d̲]̲
|
| 138 |
+
|
| 139 |
+
Note: This linter can be disabled with `set_option linter.unusedSimpArgs false`
|
| 140 |
+
warning: Challenge_3/lemma_b3/solution.lean:1003:27: This simp argument is unused:
|
| 141 |
+
Prod.snd
|
| 142 |
+
|
| 143 |
+
Hint: Omit it from the simp argument list.
|
| 144 |
+
simp only [Prod.fst,̵ ̵P̵r̵o̵d̵.̵s̵n̵d̵]
|
| 145 |
+
|
| 146 |
+
Note: This linter can be disabled with `set_option linter.unusedSimpArgs false`
|
| 147 |
+
⚠ [8029/8030] Built Challenge_3.lemma_b2.solution (103s)
|
| 148 |
+
warning: Challenge_3/lemma_b2/solution.lean:169:55: this tactic is never executed
|
| 149 |
+
|
| 150 |
+
Note: This linter can be disabled with `set_option linter.unreachableTactic false`
|
| 151 |
+
warning: Challenge_3/lemma_b2/solution.lean:169:55: 'omega' tactic does nothing
|
| 152 |
+
|
| 153 |
+
Note: This linter can be disabled with `set_option linter.unusedTactic false`
|
| 154 |
+
warning: Challenge_3/lemma_b2/solution.lean:173:40: unused variable `hr`
|
| 155 |
+
|
| 156 |
+
Note: This linter can be disabled with `set_option linter.unusedVariables false`
|
| 157 |
+
warning: Challenge_3/lemma_b2/solution.lean:197:100: This line exceeds the 100 character limit, please shorten it!
|
| 158 |
+
|
| 159 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 160 |
+
warning: Challenge_3/lemma_b2/solution.lean:213:32: unused variable `hr`
|
| 161 |
+
|
| 162 |
+
Note: This linter can be disabled with `set_option linter.unusedVariables false`
|
| 163 |
+
warning: Challenge_3/lemma_b2/solution.lean:213:59: unused variable `hN`
|
| 164 |
+
|
| 165 |
+
Note: This linter can be disabled with `set_option linter.unusedVariables false`
|
| 166 |
+
warning: Challenge_3/lemma_b2/solution.lean:222:0: Please, add a comment explaining the need for modifying the maxHeartbeat limit, as in
|
| 167 |
+
set_option maxHeartbeats 800000 in
|
| 168 |
+
-- reason for change
|
| 169 |
+
...
|
| 170 |
+
|
| 171 |
+
Note: This linter can be disabled with `set_option linter.style.maxHeartbeats false`
|
| 172 |
+
warning: Challenge_3/lemma_b2/solution.lean:253:100: This line exceeds the 100 character limit, please shorten it!
|
| 173 |
+
|
| 174 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 175 |
+
warning: Challenge_3/lemma_b2/solution.lean:302:100: This line exceeds the 100 character limit, please shorten it!
|
| 176 |
+
|
| 177 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 178 |
+
warning: Challenge_3/lemma_b2/solution.lean:441:47: This simp argument is unused:
|
| 179 |
+
Prod.fst
|
| 180 |
+
|
| 181 |
+
Hint: Omit it from the simp argument list.
|
| 182 |
+
simp only [̵P̵r̵o̵d̵.̵f̵s̵t̵,̵ ̵P̵r̵o̵d̵.̵s̵n̵d̵]̵[̲P̲r̲o̲d̲.̲s̲n̲d̲]̲
|
| 183 |
+
|
| 184 |
+
Note: This linter can be disabled with `set_option linter.unusedSimpArgs false`
|
| 185 |
+
warning: Challenge_3/lemma_b2/solution.lean:441:57: This simp argument is unused:
|
| 186 |
+
Prod.snd
|
| 187 |
+
|
| 188 |
+
Hint: Omit it from the simp argument list.
|
| 189 |
+
simp only [Prod.fst,̵ ̵P̵r̵o̵d̵.̵s̵n̵d̵]
|
| 190 |
+
|
| 191 |
+
Note: This linter can be disabled with `set_option linter.unusedSimpArgs false`
|
| 192 |
+
warning: Challenge_3/lemma_b2/solution.lean:437:100: This line exceeds the 100 character limit, please shorten it!
|
| 193 |
+
|
| 194 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 195 |
+
warning: Challenge_3/lemma_b2/solution.lean:447:100: This line exceeds the 100 character limit, please shorten it!
|
| 196 |
+
|
| 197 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 198 |
+
warning: Challenge_3/lemma_b2/solution.lean:506:18: 'simp [hab] at hE' is a flexible tactic modifying 'hE'. Try 'simp?' and use the suggested 'simp only [...]'. Alternatively, use `suffices` to explicitly state the simplified form.
|
| 199 |
+
|
| 200 |
+
Note: This linter can be disabled with `set_option linter.flexible false`
|
| 201 |
+
info: Challenge_3/lemma_b2/solution.lean:506:36: 'exact hE' uses 'hE'!
|
| 202 |
+
warning: Challenge_3/lemma_b2/solution.lean:564:6: this tactic is never executed
|
| 203 |
+
|
| 204 |
+
Note: This linter can be disabled with `set_option linter.unreachableTactic false`
|
| 205 |
+
warning: Challenge_3/lemma_b2/solution.lean:567:6: this tactic is never executed
|
| 206 |
+
|
| 207 |
+
Note: This linter can be disabled with `set_option linter.unreachableTactic false`
|
| 208 |
+
warning: Challenge_3/lemma_b2/solution.lean:509:0: Please, add a comment explaining the need for modifying the maxHeartbeat limit, as in
|
| 209 |
+
set_option maxHeartbeats 1600000 in
|
| 210 |
+
-- reason for change
|
| 211 |
+
...
|
| 212 |
+
|
| 213 |
+
Note: This linter can be disabled with `set_option linter.style.maxHeartbeats false`
|
| 214 |
+
warning: Challenge_3/lemma_b2/solution.lean:534:52: 'omega' tactic does nothing
|
| 215 |
+
|
| 216 |
+
Note: This linter can be disabled with `set_option linter.unusedTactic false`
|
| 217 |
+
warning: Challenge_3/lemma_b2/solution.lean:541:7: 'exact absurd (E_eq_N' N a₁ b₁ ε₁ hE₁ hab₁) (by omega)' tactic does nothing
|
| 218 |
+
|
| 219 |
+
Note: This linter can be disabled with `set_option linter.unusedTactic false`
|
| 220 |
+
warning: Challenge_3/lemma_b2/solution.lean:544:7: 'exact absurd (E_eq_N' N a₂ b₂ ε₂ hE₂ hab₂) (by omega)' tactic does nothing
|
| 221 |
+
|
| 222 |
+
Note: This linter can be disabled with `set_option linter.unusedTactic false`
|
| 223 |
+
warning: Challenge_3/lemma_b2/solution.lean:564:6: '(
|
| 224 |
+
exfalso
|
| 225 |
+
have hab₁ : a₁ * b₁ = N := by nlinarith [show b₁ = 1 from by omega]
|
| 226 |
+
exact absurd (E_eq_N' N a₁ b₁ ε₁ hE₁ hab₁) (by omega))' tactic does nothing
|
| 227 |
+
|
| 228 |
+
Note: This linter can be disabled with `set_option linter.unusedTactic false`
|
| 229 |
+
warning: Challenge_3/lemma_b2/solution.lean:567:6: '(
|
| 230 |
+
exfalso
|
| 231 |
+
have hab₂ : a₂ * b₂ = N := by nlinarith [show b₂ = 1 from by omega]
|
| 232 |
+
exact absurd (E_eq_N' N a₂ b₂ ε₂ hE₂ hab₂) (by omega))' tactic does nothing
|
| 233 |
+
|
| 234 |
+
Note: This linter can be disabled with `set_option linter.unusedTactic false`
|
| 235 |
+
warning: Challenge_3/lemma_b2/solution.lean:547:100: This line exceeds the 100 character limit, please shorten it!
|
| 236 |
+
|
| 237 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 238 |
+
warning: Challenge_3/lemma_b2/solution.lean:550:100: This line exceeds the 100 character limit, please shorten it!
|
| 239 |
+
|
| 240 |
+
Note: This linter can be disabled with `set_option linter.style.longLine false`
|
| 241 |
+
Build completed successfully (8030 jobs).
|
builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/shards/frames.jsonl
ADDED
|
@@ -0,0 +1,4 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{"shard":"shards/part-00000.tar.zst","offset":0,"length":46842,"raw_length":225280,"module":"Challenge_3.lemma_b2.problem","files":7,"sha256":"f37fff5b5d6d0dd0d19a1df02e5d8e618eecc1747a69bcabda2e75e3604ffd38"}
|
| 2 |
+
{"shard":"shards/part-00000.tar.zst","offset":46842,"length":923059,"raw_length":3225600,"module":"Challenge_3.lemma_b2.solution","files":7,"sha256":"6a39b1315befb29ac174b01e9dc162bff1b9e061c739d0059e1839b53a752a4a"}
|
| 3 |
+
{"shard":"shards/part-00000.tar.zst","offset":969901,"length":90828,"raw_length":389120,"module":"Challenge_3.lemma_b3.problem","files":7,"sha256":"3286ae01cfbfd1ed79e05288b03603457add54d1eece7de2556e075ac031fa94"}
|
| 4 |
+
{"shard":"shards/part-00000.tar.zst","offset":1060729,"length":1110694,"raw_length":3942400,"module":"Challenge_3.lemma_b3.solution","files":7,"sha256":"4f2aff48415e722875ee31d72513f83abceca40ba20fa93effa13af55daad335"}
|
builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/shards/index.jsonl
ADDED
|
@@ -0,0 +1,28 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{"path":".lake/build/ir/Challenge_3/lemma_b2/problem.c","sha256":"0681e0ec8b1c005e1e79055c8057df23e6c1e80408c618953144be1e960ca066","bytes":28642,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b2.problem"}
|
| 2 |
+
{"path":".lake/build/ir/Challenge_3/lemma_b2/problem.c.hash","sha256":"5198ad53f1a252596a53b564ba847a54b7eb458966a0b1a5acddf99ad54ee54f","bytes":16,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b2.problem"}
|
| 3 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b2/problem.ilean","sha256":"53ef9c1b03a383209fb28b92afe065a47728cae1ad29c34f3cb68b9c36ec9fe3","bytes":9129,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b2.problem"}
|
| 4 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b2/problem.ilean.hash","sha256":"e8bafa2875fc2bbd13d260fc82adfb344824391a1295b0f2e915654c020fcb06","bytes":16,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b2.problem"}
|
| 5 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b2/problem.olean","sha256":"62152cf318a85098229bb9d5ac89b1aaf24ce09f8e03e3a0f5a50f3b4cd48e61","bytes":174376,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b2.problem"}
|
| 6 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b2/problem.olean.hash","sha256":"f3b8d132c113d4371f8ceeb57d7e86334a78c7e762899977127f746ff1ee50ff","bytes":16,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b2.problem"}
|
| 7 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b2/problem.trace","sha256":"c0039427bc9de9b73ac84528a6840a3ab63ce9575f33b0199cd8bdb0a71c0a41","bytes":3340,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b2.problem"}
|
| 8 |
+
{"path":".lake/build/ir/Challenge_3/lemma_b2/solution.c","sha256":"cdbe760f858948ab841240b991d28b8bc9957f30cf8e809fcbaafde5694d3bc7","bytes":45496,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b2.solution"}
|
| 9 |
+
{"path":".lake/build/ir/Challenge_3/lemma_b2/solution.c.hash","sha256":"f19aba43b225b8af6660d9f8307107805dd6e70738f1093848f0a5a467c633db","bytes":16,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b2.solution"}
|
| 10 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b2/solution.ilean","sha256":"9076bfcfa535eab156ac383134d10237b808b4c32fadfb330c76152642cb23ac","bytes":56508,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b2.solution"}
|
| 11 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b2/solution.ilean.hash","sha256":"d6365326fa9fb1ee8c0d0363e65c7178321587a013133b2795691c2b7449b054","bytes":16,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b2.solution"}
|
| 12 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b2/solution.olean","sha256":"fb38a735f4081e154e4cc0e0ec378d53975c7e1cf9c7732bd4598c3456f79327","bytes":3107824,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b2.solution"}
|
| 13 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b2/solution.olean.hash","sha256":"78d247b40fde10a421d11b8f005fa82d401638d2ce433ee8d0eab63f8777844a","bytes":16,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b2.solution"}
|
| 14 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b2/solution.trace","sha256":"dbfcf9f8f60992245339d98a07fa12572f6d9069673765c22a40e5b3628afd33","bytes":8764,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b2.solution"}
|
| 15 |
+
{"path":".lake/build/ir/Challenge_3/lemma_b3/problem.c","sha256":"a5d19fcc3b6a96745ef36eefe8a32c382fd27ac3f1ea2d7e99d03aff81975b8e","bytes":33000,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b3.problem"}
|
| 16 |
+
{"path":".lake/build/ir/Challenge_3/lemma_b3/problem.c.hash","sha256":"61f8b3e6503d442cb4ee7fe130b92cf43878dffdc1f1d4e5e1c1da2952fbb7c3","bytes":16,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b3.problem"}
|
| 17 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b3/problem.ilean","sha256":"3d6c4878a3e715f807179923e359411c8da444e13929e017e2569e45a94c591b","bytes":15731,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b3.problem"}
|
| 18 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b3/problem.ilean.hash","sha256":"329f286ba47f6fa23915dc09141469d55b37b0c047de1393f83023eacc6543a5","bytes":16,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b3.problem"}
|
| 19 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b3/problem.olean","sha256":"c0e34db186c85eb18d8dd9d74203b3308ee82542e3799aca2cded7d114a32328","bytes":324184,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b3.problem"}
|
| 20 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b3/problem.olean.hash","sha256":"4462017d6728ea745b18c5e0327f998385e6b68b469babf5dd67785fb177ad5a","bytes":16,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b3.problem"}
|
| 21 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b3/problem.trace","sha256":"956af7f8c6eef5e0773537b1b8895ec52ed31d3ef51e9f2562e3d525cb68eaa7","bytes":3122,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b3.problem"}
|
| 22 |
+
{"path":".lake/build/ir/Challenge_3/lemma_b3/solution.c","sha256":"0de2e09d4045a55463eaa558dfe5bedd35bcd4e34460df31e6984f044d044e34","bytes":34806,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b3.solution"}
|
| 23 |
+
{"path":".lake/build/ir/Challenge_3/lemma_b3/solution.c.hash","sha256":"993b116a309e5201c88521597c5d6195206a828163c5b3a14f55449588fae4bd","bytes":16,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b3.solution"}
|
| 24 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b3/solution.ilean","sha256":"4675dbf019b48d16488d5eab577079cd68edab2172eddcc53d70149df67a7492","bytes":111817,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b3.solution"}
|
| 25 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b3/solution.ilean.hash","sha256":"509e463d9f5ad47d6048ddea97c0e549ba7e2f232c7798b8bac752bcfc9665cb","bytes":16,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b3.solution"}
|
| 26 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b3/solution.olean","sha256":"f53e28fecf4c851b25f9372fc973e3bac4e733498e57a75269fdba056529544e","bytes":3767896,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b3.solution"}
|
| 27 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b3/solution.olean.hash","sha256":"0d1c65a2bcd2e6a4fb382640a0c2ab3081f9ea51c85f556527780e155fb3c49f","bytes":16,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b3.solution"}
|
| 28 |
+
{"path":".lake/build/lib/lean/Challenge_3/lemma_b3/solution.trace","sha256":"2b77cbc340693607a3547c142177d6b3561528ffe6430004fbd56e972eb3b871","bytes":11924,"shard":"shards/part-00000.tar.zst","module":"Challenge_3.lemma_b3.solution"}
|
builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/shards/modules.jsonl
ADDED
|
@@ -0,0 +1,4 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{"module":"Challenge_3.lemma_b2.problem","shards":["shards/part-00000.tar.zst"],"imports":["Mathlib"]}
|
| 2 |
+
{"module":"Challenge_3.lemma_b2.solution","shards":["shards/part-00000.tar.zst"],"imports":["Mathlib"]}
|
| 3 |
+
{"module":"Challenge_3.lemma_b3.problem","shards":["shards/part-00000.tar.zst"],"imports":["Mathlib"]}
|
| 4 |
+
{"module":"Challenge_3.lemma_b3.solution","shards":["shards/part-00000.tar.zst"],"imports":["Mathlib"]}
|
builds/v4.28.0/x86_64-unknown-linux-gnu/906bf3459081-1cbbfaa1d792e33b/shards/part-00000.tar.zst
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:265ed46c562fc6ce60a0ce6ce6800379ad712a8258c2cf20d1dbcc90bf28c629
|
| 3 |
+
size 2171423
|