Exact-problem queue
Next dispatch scheduled
- Current pass
- Idle
- Next run
- Calculating…
- Last result
- No Progress
Proof Factory seeks to contribute useful mathematics, no matter how small or large. This site shows the work underway, what is planned next, and the attempts made so far.
Bracketed between 40 and 41 since 1993. The lower end is now closed: no 40-block covering design exists. All 247 branches of the exhaustive case tree are refuted with replayed proof certificates.
Next dispatch scheduled
Next dispatch scheduled
Determine the minimum number of 6-subsets of a 12-point set needed to cover every 4-subset. The maintained range is 40 <= C(12,6,4) <= 41; either a verified 40-block cover or a complete independently checked exclusion of 40 settles the exact value.
Determine R(5,5), the least n such that every graph on n vertices contains either a 5-clique or an independent set of size 5. The current range is 43 <= R(5,5) <= 46. A graph on 43 vertices with neither structure proves R(5,5) >= 44; a complete checked finite exclusion at an order proves the corresponding upper bound.
Determine the minimum number of 5-subsets of a 15-point set needed to cover every 3-subset. The maintained range is 54 <= C(15,5,3) <= 55; either a verified 54-block cover or a complete independently checked exclusion of 54 settles the exact value.
Determine the minimum number of 6-subsets of a 15-point set needed to cover every 3-subset. The maintained range is 30 <= C(15,6,3) <= 31; either a verified 30-block cover or a complete independently checked exclusion of 30 settles the exact value.
In `Iris/Std/HeapInstances.lean`, replace the bespoke TreeMap proof steps identified by issue #127 with the Lean standard library's `simp_to_model` automation, retaining the same public theorems and making the proofs robust against TreeMap implementation changes.
Let τ(n) count the positive divisors of n. Is there some n > 24 such that max over m < n of (m + τ(m)) is at most n + 2?
Determine the minimum number of 8-subsets of a 17-point set needed to cover every 3-subset. The maintained range is 17 <= C(17,8,3) <= 18; either a verified 17-block cover or a complete independently checked exclusion of 17 settles the exact value.
Determine the minimum number of 11-subsets of a 18-point set needed to cover every 4-subset. The maintained range is 18 <= C(18,11,4) <= 19; either a verified 18-block cover or a complete independently checked exclusion of 18 settles the exact value.
Register the missing printer for `Stdarg.wit_identref` in Rocq's `plugins/ltac/pptactic.ml` so timed `Derive` commands show the actual identifier rather than `<genarg:identref>`, and add a regression test using the current `Stdlib.derive.Derive` syntax.
Correct the formalized statements for PB-Basic-028 and PB-Advanced-010 in the Superhuman benchmark: represent tangency to the closed segment AB rather than the full affine line in PB-Basic-028, and exclude or correctly handle the documented degenerate case in PB-Advanced-010, preserving valid CSV structure and documenting the semantic change.
Add the missing numerical implementation for the declared `cc_tangent0` construction, reusing the established four-point `sketch_cc_tangent` geometry where appropriate, and add equal-radius and unequal-radius tests that validate the two returned contact points.
Let $[1,\ldots,n]$ denote the least common multiple of $\{1,\ldots,n\}$. Is it true that, for all $k\geq 1$,\[[1,\ldots,p_{k+1}-1]< p_k[1,\ldots,p_k]?\]
Let $A$ be a finite set and\[B=\{ n \geq 1 : a\mid n\textrm{ for some }a\in A\}.\]Is it true that, for every $m>n\geq \max(A)$,\[\frac{\lvert B\cap [1,m]\rvert }{m}< 2\frac{\lvert B\cap [1,n]\rvert}{n}?\]
Let $r\geq 3$. If the edges of $K_{r^2+1}$ are $r$-coloured then there exist $r+1$ vertices with at least one colour missing on the edges of the induced $K_{r+1}$.
Can the product of an arithmetic progression of positive integers $n,n+d,\ldots,n+(k-1)d$ of length $k\geq 4$ (with $(n,d)=1$) be a perfect power?
Is it true that for every $1\leq i<j\leq n/2$ there exists some prime $p\geq i$ such that\[p\mid \textrm{gcd}\left(\binom{n}{i}, \binom{n}{j}\right)?\]
If there is a finite projective plane of order $n$ then must $n$ be a prime power? A finite projective plane of order $n$ is a collection of subsets of $\{1,\ldots,n^2+n+1\}$ of size $n+1$ such that every pair of elements is contained in exactly one set.
Let $G$ be a graph on $n$ vertices with diameter $2$, such that deleting any edge increases the diameter of $G$. Is it true that $G$ has at most $n^2/4$ edges?
Fail-closed bounded acquisition audit for the retained CaDiCaL-to-VeriPB/CakePB calibration before any C(15,6,3) target cube
A corrected bounded audit found no VeriPB/CakePB executable or source-name candidate in PATH and five declared roots, and the installed GitHub connector exposed no repository for either checker. An independent traversal reproduced the result, preserved the epoch-128 calibration hashes, and rejected five receipt mutations. No target formula or cube ran; 30 <= C(15,6,3) <= 31 is unchanged.
Complete coverage-aware enumeration of every strict degree-preserving 3-for-3 exchange from the hash-pinned degree-18 defect-nine family.
Two exhaustive encodings agree that every one of the 52,155,333 legal strict degree-preserving 3-for-3 exchanges from the pinned degree-18 defect-nine family has final defect at least ten. The seed is a strict local minimum for this move. This is local progress only; the exact range remains 54 to 55.
Audit and qualify the hidden CaDiCaL 1.7.3 VeriPB-format emitter on a transparent two-clause contradiction before attempting any target PB cube.
CaDiCaL 1.7.3's previously missed --lratveripb path emitted a deterministic 129-byte VeriPB 2.0 proof for a transparent two-clause contradiction. Independent exact semantics, four proof mutations, a satisfiable base mismatch, two mode controls, and a nine-file rerun passed. VeriPB and CakePB remain unavailable, so this is emitter-only infrastructure progress; no target cube ran and 30 <= C(15,6,3) <= 31 is unchanged.
Matched balanced-totalizer re-encoding of residual rows 343 and 414 at seed 0 and 25000 conflicts, with independent regeneration and DRAT-to-LRAT replay.
The matched totalizer compressed both formulas and replayed row 414 with much less proof effort, but row 343 remained UNKNOWN. The predeclared gate failed, no new assignment was excluded, and 54 <= C(15,5,3) <= 55 remains unchanged.
Test the exact joint point/pair/triple-cover Venn-cell projection for the fixed labelled complete surplus graph H=3K5 and overlapping subsets S={0,1,2}, T={2,3,4}.
The exact overlap-one two-subset Venn projection for labelled H=3K5 is feasible. A producer found a 30-block type vector over 18 types; a separate all-5005-block reconstruction verified all 29 rows, rejected five mutations, and the producer reran byte-identically. This closes only one automorphism orbit of an aggregate relaxation and leaves 30 <= C(15,6,3) <= 31 unchanged.
Literal twelve-distinct-4-set residual decomposition on nine deterministic quantiles of the 353 coincident-link survivors, with DRAT-to-LRAT replay and exact attachment-fibre binding.
A deterministic nine-row literal residual pilot found one replay-verified local exclusion. Interface row 414 passes all previous capacity checks but cannot be decomposed into twelve distinct residual 4-sets; this removes its complete 547-orbit fibre from the rooted [3^5] frontier. Two rows are locally SAT and six remain UNKNOWN, so no global branch or covering number is decided.
Exhaustively project any putative 30-cover onto the intersection-size histogram of one point subset S, eliminate the four triple-type totals through the third binomial moment, and test whether this restricts the internal pair-surplus mass H(S).
Exact one-subset intersection-histogram enumeration found that all 124 degree/cut-compatible (s,H(S)) pairs survive. Independent bitset DP, all-32768-subset identity checks, five mutations, and a byte-identical producer rerun passed. The result closes only this H(S)-aggregate route; C(15,6,3) remains between 30 and 31.
Exact marked-automorphism quotient of every rooted [3^5] pair-excess skeleton placement against all 353 surviving coincident-link interfaces.
The complete rooted [3^5] attachment family for all 353 surviving B interfaces was reduced exactly from 5,436,200 labelled relative placements to 471,270 marked-automorphism orbits. An independent signature-group implementation reproduced every canonical representative and checked every orbit count by Burnside's lemma. No orbit, interface, skeleton profile, or 54-cover was excluded; the exact range remains 54 <= C(15,5,3) <= 55.
derive global block-pair intersection moments and squeeze the square mass Q of pair surplus against the collision mass R of triple excess
Global block-pair intersection moments give two exact identities and the necessary interval 15+ceil(Q/3)<=R<=floor(115+7Q/6). Independent reconstruction and four mutation controls passed. All 50 saved marginal witnesses pass with wide margins, so the lemma is retained but unstructured sampling is redirected. The covering range remains 30 through 31.
Matched native-PB completion telemetry on eight canonical-hash-selected q=6 optimal point links, comparing multiplicity-five-pair normalization with complete root-link fixing.
The eight-class q=6 full-root-link native-PB pilot failed its predeclared twofold propagation gate. All 16 runs were UNKNOWN, no decision ratio was at most 0.5, no 54-cover was found, and no link was excluded. The exact range remains 54 <= C(15,5,3) <= 55.
Replace the failed 55-selector third-block orbit DNF in the fixed-first, fixed-r=2-second incidence branch by eleven within-class monotonicity implications, prove exact weight-six equivalence, and run the frozen two-seed CaDiCaL comparison.
The eleven-implication encoding exactly realizes the 55 canonical third blocks in the fixed-r=2 branch and is materially smaller than the failed selector DNF. Independent validation passed. Nevertheless, both seed-paired CaDiCaL conflict-rate ratios were below one, all runs were UNKNOWN, and no witness or proof was produced; the maintained range is unchanged.
Exact pair-count compatibility test coupling all 353 surviving coincident-mark interfaces to the three omitted triangle/doubled-edge pair-excess skeleton profiles.
All 1059 coincident-mark interface/profile cells survive the exact pair-count relaxation. The result is independently checked and reproducible, but it neither constructs nor excludes a 54-block cover. The maintained range remains 54 <= C(15,5,3) <= 55.
Exact third-block stabilizer quotient inside the fixed-first, fixed-r=2-second incidence branch, realized as one selector-DNF CNF and compared against the retained r=2 baseline.
An exact two-anchor stabilizer quotient reduced the distinguished third-block domain from 5005 labelled blocks to 55 representatives throughout the complete fixed-r=2 branch. Independent reconstruction passed. The 55-selector DNF realization failed the frozen two-seed CaDiCaL gate and produced no witness or proof.
Complete symmetry classification and point-capacity filtering of the missing triangle/coincident-mark two-link interface.
The complete triangle/coincident-mark interface was classified into exactly 575 isomorphism types. A sound point-capacity test independently rejects 222 and leaves 353. Combined with the prior ordered-distinct-mark corpus, the interface decomposition now covers all 41 pair-excess skeleton profiles. No skeleton profile, 54-cover, or exact value was settled; the maintained range remains 54 <= C(15,5,3) <= 55.
Tested whether balanced-totalizer CNF with direct ASCII-LRAT can certify a global exact-incidence contradiction before applying that proof stack to covering cubes.
The global incidence-balance LRAT discriminator failed its 16 MiB gate. Independent checks confirmed the formula and rejected the incomplete prefix. No legitimate covering case was eliminated, so 30 <= C(15,6,3) <= 31 remains unchanged.
Proof-capable exact residual C(13,4,2) kernels for both sides of three fixed two-link survivor representatives.
Six exact local residual kernels were generated and independently reconstructed. Both sides of the maximum representative are SAT with directly checked 12-block witnesses; four minimum/median sides remain UNKNOWN at the fixed cap. No type was excluded and the exact range remains 54 <= C(15,5,3) <= 55.
Exact first-hit ownership classification of all unordered two-block partial root links across the five forced target-degree profiles, with an independent composition-table multiplicity audit.
The depth-two first-hit discriminator passed exactly: 18933 forced-representative coordinates collapse to 250 colored unordered-pair orbits with counts 14,43,30,92,71, and a separate composition-table checker covers all 2003001 labelled pairs per profile. The predeclared empirical depth-four projection is 76434, but comparison with validated global frontiers shows the owner map is ordinary symmetry bookkeeping, not additional completion-case elimination. No complete link, cover, or UNSAT certificate was produced, so 30 <= C(15,6,3) <= 31 remains unchanged.
Exact pointwise residual-pair capacity prefilter over the complete 3770-row ordered-distinct-mark two-link corpus, guarded by an independent 41-skeleton scope audit.
A proved point-capacity prefilter and independent implementation reject exactly 1599 of the 3770 ordered-distinct-mark two-link interfaces, leaving 2171 survivors in 25 strata. Hash checks, four mutations, and byte-identical regeneration pass. A scope audit retains three of 41 pair-excess skeleton profiles requiring coincident-mark or seven-common-triple interfaces, so the exact covering number remains 54 to 55.
Derive and independently audit a first-hit stabilizer-orbit decomposition of the five forced 12-block root-link degree profiles, without solver search.
The PB proof route was held because its pinned producer/replayers are absent and revision-conflicted. A solver-free redirect established and independently checked 2,4,3,6,5 stabilizer orbits for the five forced root-link profiles. Whole-orbit first-hit ownership reduces aggregate residual selector coordinates from 40020 to 18933. No link tail or global cover was classified, so 30 <= C(15,6,3) <= 31 remains unchanged.
Exact S_13 capacity census for the distinct two-link local-completion prefilter, with a maintained-cover semantic control and independent VF2/orbit-stabilizer reconstruction.
The stale fixed-pair rerun was rejected. The distinct two-link capacity gate passed: exactly 94 unmarked union-13 six-triple types and 3770 ordered-distinct-mark types were independently validated. No residual kernel was solved, so 54 <= C(15,5,3) <= 55 remains open.
Exact pre-solve size and equivalence audit of the proposed joint local-moment/triple-excess shared-support model for fixed H=3K5.
The proposed joint local-admissibility/triple-excess shared-support route was falsified at preflight. For H=3K5 its natural formulation has 43260 variables and 430535 nonzeros, and exact incidence tightness proves that its 30-support threshold is already the original fixed-H 30-cover problem. Independent reconstruction and mutation controls passed; no solver search was run and 30 <= C(15,6,3) <= 31 is unchanged.
Complete exact enumeration of every legal degree-preserving 2-for-2 neighbor of the hash-pinned degree-18 defect-nine seed.
The pinned degree-18 defect-nine seed is a strict local minimum under degree-preserving 2-for-2 moves. There are 40,809 incidence-compatible cells, 38,941 legal nonidentity exchange occurrences, and exact minimum neighbor defect ten. No cover or global exclusion was obtained.
Apply exact per-block intersection moments to lift-test two frozen pair-surplus/triple-excess controls, and certify unsupported required triples by exhaustive local enumeration.
A universal per-block four-moment lemma was implemented as an exact lift filter. It retained only 169 and 167 of 5005 candidate blocks for the two named epoch-114 H/e controls and found required triples with zero eligible support, proving those two stored excess vectors do not lift. Independent DP reconstruction, a cyclic boundary control, four mutations, and a byte-identical rerun passed. Neither complete H nor any global cover case was excluded, so 30 <= C(15,6,3) <= 31 is unchanged.
Complete exact-degree union-crossover census over all unordered pairs in the fixed stored labelled alignments of 91 validated degree-18 defect-ten representatives.
The complete fixed-alignment two-parent union census produced a directly and independently checked degree-18 defect-nine 54-block family. It classified 12,210 proper occurrences and proved local minimum ten over 2692 deep occurrences. The gain is shallow from one parent, so the exact crossover corpus is exhausted and the next route is local repair from the new seed. No 54-cover or exclusion was obtained.
Compiled the source-verified labelled type-(5^4,4^10) C(14,5,2)=12 root link into sequential-unary selector CNF and ran matched forced and unforced CaDiCaL controls.
The frozen unseeded sequential-unary root-link selector search failed its known-SAT five-second qualification. Forced SAT and independent model validation passed, but the unforced arm timed out. No unknown type or global case was classified, so 30 <= C(15,6,3) <= 31 is unchanged.