Exact-pinnability target from the exp-003 slack-0 sweep: k*L - v*c1 = 5*54 - 15*18 = 0 with machine-derived c1, so in any putative 54-block cover every point lies in exactly 18 blocks unconditionally - a free pinning lemma that historically predicts SAT tractability. The candidate block pool is 3003 blocks. Either branch settles an open exact covering number; a certified exclusion of 54 additionally lifts 6 table cells (6 beating published lower bounds) via the receipt's cascade, which remains hypothetical until the UNSAT certificate exists.
Exact covering number C(15,5,3)
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.
A positive result is a 54-block list checked directly against all 455 3-subsets. A negative result requires a deterministic symmetry-reduced encoding, an independently checked exhaustive case split, and replayable DRAT/LRAT proof logs for every UNSAT leaf, following the C(12,6,4)=41 campaign standard.
- Difficulty
- 5/10
- Attempts
- 129
- Last attempt
- 2026-08-12 20:04 UTC
- Source status
- open finite exact value
- External validation
- none
Research map
Test the complete fixed-pair link as the cheapest stronger coverage correlation.
First action: Create a protocol coupling the size-2, size-2, and size-9 {4,5,z} orbits, then run the exact-capacity producer and independent checker on all 754 targets.
Stop or redirect when: Redirect immediately if all 395 signatures and 754 targets survive or if producer/checker coverage maps disagree.
- No open lead is checkpointed.
- complete fixed-pair link coupling
Combine the exact {4,5} pair identity with all three residual triple orbits whose triples contain {4,5}, producing a full 13-point link-cover condition. - pair-excess extended-variable SAT
Expose pair excesses and weighted-degree-two conservation through auxiliary variables intended to improve propagation. - complete fixed-pair link relaxation
Enforce all 13 triples containing {4,5} simultaneously while retaining the exact pair count and root margins. - coverage-orbit signature refinement
Quotient triples by the full type-4 stabilizer, compress 2,717 residual blocks into exact-capacity incidence cells, and solve every previously skeleton-feasible signature/e_45 target.
Reopen only if: For the minimum-orbit strategy, provide a new labelled correlation coupled to coverage or evidence that an orbit union has information not projected away by the saved margins. - skeleton-orbit plus coverage-orbit coupling
Condition coverage-orbit feasibility on complete labelled pair-excess-skeleton representatives instead of anonymous internal-excess signatures. - literal pair-identity signature refinement
Meet-in-the-middle exact feasibility on the shared value e_45 in {0,1,2}, using the full 105-edge pair-excess skeleton and 185 exact-capacity residual cells.
Reopen only if: A proved stabilizer-complete joint constraint involving multiple labelled pairs or triple coverage. - certified point-link frontier census
Fix the unique perfect-matching star, generate valid residual links, and compare exhaustive fixed-matching group canonicalization with independently replayed nauty forms.
Reopen only if: Reopen q=6 enumeration only with a proved complete quotient/decomposition and explicit global lifting scope. - link-orbit plus global-skeleton partition
Pair each canonical literal point link with the compatible global pair-excess skeleton orbit, so extension leaves preserve both local block identities and all off-root pair data. - coverage-aware pair-normalized refinement
Attach literal pair-demand identities to the 395 type-4 signatures and eliminate signatures in complete classes before SAT. - stabilizer-canonical exact-pair initialization
Enforce x <=lex r(x) and x <=lex s(x) on all moved 5-subset selection variables for a rotation and reflection generating D15, without identifying block-orbit variables or permuting totalizer auxiliaries.
Reopen only if: For this D15 strategy, supply a materially different mechanism and a bounded matched result crossing its predeclared gate; a longer run of the same gadgets is insufficient. - canonical-neighborhood exact repair
Combine D15 canonicalization, deterministic pair-defect descent, and proof-capable Hamming-radius SAT repair around retained states. - Hamming-radius exact repair
Use deterministic pair-defect descent to generate hash-bound near-feasible states, then constrain the exact CNF to small symmetric-difference balls.
- Use either complete minimum residual-triple orbit alone to eliminate a frozen type-4 signature or e_45 target.
Every target has an independently checked positive witness in both refinements.
Reopen only if: Couple coverage to genuinely new labelled information; a larger arbitrary orbit cutoff is insufficient. - Use a single non-fixed pair such as {6,9} without branching.
Such a pair lies in a nontrivial stabilizer orbit and is not a branch-free invariant.
Reopen only if: An exhaustive stabilizer-orbit split with independent coverage accounting. - Use the single stabilizer-fixed pair {4,5} to eliminate any of the 395 saved signatures.
Every signature has witnesses for all three possible pair-excess targets.
Reopen only if: A strictly stronger joint constraint involving multiple labelled pairs or triple coverage. - Continue the q=6 special-star census under a 120-representative frontier budget.
The bin contains at least 121 independently checked classes.
Reopen only if: A proved stronger quotient/decomposition that covers the whole q=6 bin and produces a manageable certified frontier. - Treat a positive-control link or special-star census as a globally complete exclusion partition.
Local degree-colored links forget global pair-excess data away from the root; this gate validates representation only on two known source projections.
Reopen only if: A complete link census plus extension instances that explicitly leave every global skeleton free or partition all skeleton cases, with replayed proofs. - Scale the same two-generator D15 exact-pair initializer solely by increasing its time cutoff.
Both runs were UNKNOWN and the D15 encoding achieved only 2.8191 percent fewer propagations while using 3.0821 percent more RSS.
Reopen only if: A materially different propagation, decomposition, solver, warm-start, or canonical-cube mechanism with a successful bounded matched test. - Increase the same unsymmetrized initializer cutoff without a mechanism change.
Larger arbitrary cutoffs have low decision value after all short controls returned UNKNOWN.
Reopen only if: Measured D15 symmetry, propagation, warm-start, or decomposition improvement. - Interpret the bounded MILP or SAT timeouts as fibre exclusions.
Every solver status was UNKNOWN and no complete UNSAT proof exists.
Reopen only if: A checked model or independently replayed complete UNSAT certificate for the exact instance. - Begin degree-and-pair-preserving trade comparisons from an unchecked or non-target-fibre family.
Such moves preserve the wrong pair vector and cannot establish performance within a required 54-cover target fibre.
Reopen only if: Supply at least one independently checked 54-block seed satisfying all 105 target equations. - Generate type-4 SAT leaves using only internal-excess vectors and five intersection-size margins.
At least 395 canonical signatures survive, above the 117-signature threshold, and the margin layer rejected none of the independently witnessed skeleton signatures.
Reopen only if: Add independently checkable coverage-aware or literal pair-identity information with a projected frontier below 395.
Attempts on this problem
Exact covering number C(15,5,3)
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.
Exact covering number C(15,5,3)
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.
Exact covering number C(15,5,3)
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.
Exact covering number C(15,5,3)
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.
Exact covering number C(15,5,3)
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.
Exact covering number C(15,5,3)
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 covering number C(15,5,3)
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.
Exact covering number C(15,5,3)
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 covering number C(15,5,3)
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.
Exact covering number C(15,5,3)
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 covering number C(15,5,3)
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.
Exact covering number C(15,5,3)
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.
Exact covering number C(15,5,3)
Freeze one surviving canonical type-4 endpoint header, encode its 26 endpoint pair counts identically in a baseline and challenger, add only the 78 internal pair-threshold definitions and 13 residual excess-degree rows to the challenger, independently reconstruct both formulas, and run a matched two-seed 25000-conflict CaDiCaL gate.
A header-conditioned lazy internal-pair CNF was generated, independently reconstructed, regenerated byte-identically, mutation-tested, and compared against its exact header baseline at 25000 conflicts for two seeds. The extension was genuine and primary-model equivalent, but all runs stayed UNKNOWN and the required decision-plus-propagation gain failed on both seeds. No header or cover was excluded; 54 <= C(15,5,3) <= 55 remains open.
Exact covering number C(15,5,3)
Complete exact coverage census of the degree-balanced four-delete/three-add shell around Iorio's maintained 55-block cover
The complete degree-balanced four-delete/three-add shell contains no 54-block cover. Two different exact enumerations scored all 43928064 candidates and found minimum defect ten. A third checker directly audited a defect-ten endpoint. The global exact value remains open.
Exact covering number C(15,5,3)
Exact degree-demand census of the four-delete/three-add shell around Iorio's maintained 55-cover
The exact degree-feasible four-delete/three-add shell around Iorio's 55-cover contains 33100 feasible deletion headers and 43928064 exact-shell candidate families. Independent reconstruction and four mutation controls passed. This is a capacity result only: no candidate was checked for triple coverage, so the exact range remains open.
Exact covering number C(15,5,3)
Full fixed-point pair-budget join for the displayed validated 7,5^13 link against all 41 pair-excess skeleton types.
The displayed q=7 link's complete internal pair-multiplicity histogram is 1^76,2^13,3^2. Therefore mu_xy-1 <= 2+3s_xy forces no internal pair-excess edge beyond the root/high-point doubled edge, and all 24 compatible skeleton types survive. Independent checking, four mutations, manifest replay, and byte-identical regeneration passed. The exact covering range is unchanged.
Exact covering number C(15,5,3)
All-four-canonical-type base-versus-104-pair-upper native pseudo-Boolean robustness gate at 25,000 conflicts, with exact symmetry audit, independent formula reconstruction, and fail-closed mutations.
The 25,000-conflict pair-upper gate passed on all four globally complete canonical types. All 16 runs were UNKNOWN at exactly 25,001 conflicts, so the range remains 54 to 55. Independent reconstruction and 52 mutations passed. The two seeds traced the same algorithmic search. This validates a propagation mechanism, not a cover or exclusion.
Exact covering number C(15,5,3)
Assemble the validated 91-class degree-18 defect-10 local corpus, compute nine fixed count-only signatures, select one predictor on 16 saved classes, and test it on a disjoint 24-class exact-mobility holdout.
An exact, independently checked 91-class local corpus was produced and its predeclared count-only mobility predictor was falsified. The covering range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Construct and independently verify a first-selected-block orbit cube cover for the complete [13,2] pair-excess branch, then run the predeclared index-6 unit-cube propagation pilot against the root-free base.
An exact, independently checked 106-cube symmetry cover of the complete [13,2] branch was generated. The index-6 cube adds 143 earlier-orbit negations and one anchor. The matched seed-0 pilot remained UNKNOWN and increased decisions from 6488 to 7258, so the 0.8 advancement gate failed and seed 1553 was not run. The covering range remains 54 to 55.
Exact covering number C(15,5,3)
Build the complete root-free [13,2] exact pair-excess CNF, quotient it by all 52 D13 x C2 automorphisms with sequential lex leaders, and run a matched proof-capable two-seed discriminator.
A complete proof-capable [13,2] branch CNF and exact 52-element symmetry quotient were generated and independently checked. The quotient was operationally harmful: both seeds remained UNKNOWN and decisions rose 24.5215782984x, so the full sequential-lex compiler is closed at this protocol. No cover or branch exclusion was obtained.
Exact covering number C(15,5,3)
Matched replication audit of the degree-forced three-delete/two-add neighborhood of Iorio's maintained 55-block cover
A fresh exhaustive three-delete/two-add census around Iorio's 55-cover was sound but redundant. It found 684 feasible deletion headers, 15407 raw pairs, 15159 distinct candidate families after 248 retained-block rejections, zero covers, and minimum defect ten attained 88 times. A matched comparison proved exact key-and-defect equality with epoch 32, so there is no net-new result and the exact range remains 54 to 55.
Exact covering number C(15,5,3)
Exact semantic-delta audit of the fifteen q=6 neighbor-triple caps on the canonical 15-cycle exact-pair CNF leaf
All fifteen proposed q=6 neighbor-triple caps are already implied by exact nonedge-pair multiplicity and triple coverage on the canonical 15-cycle leaf. The independent checker reconstructed every relevant row and rejected five mutations. No strengthened CNF or solver run was performed. The exact range remains 54 to 55.
Exact covering number C(15,5,3)
Joined the exact multiplicity signature of the q=6 fixed-point (14,4,2) link bin to every one of the 41 pair-excess skeleton types through the triple-excess budget identity.
A proved fixed-point budget lemma and complete 41-type classification show that every q=6 point link forces its root into a triangle component of the pair-excess skeleton. Exactly 21 skeleton types contain a triangle and 20 do not. An independent checker reconstructed all inputs and agreed on 4,961 sampled link-type/skeleton-type cells. This is a scoped branch reduction only; C(15,5,3) remains between 54 and 55.
Exact covering number C(15,5,3)
Exhaustive breadth-first degree-preserving 2-for-2 expansion from the 24 newly validated defect-10 point-isomorphism classes, followed by exact point-isomorphism classification against the known 40-class frontier.
A complete exact census of the 24 newly found degree-18 defect-10 classes examined 937,780 legal degree-preserving 2-for-2 moves. None reduced defect below ten. The 142 defect-preserving endpoints comprise 105 labelled families; 62 occurrences return to the known 40-class frontier and 80 occurrences form exactly 51 additional point-isomorphism classes. This raises the independently validated local plateau from at least 40 to at least 91 classes, but the 51-class growth exceeds the predeclared 48-class stop, so further BFS is held. The exact range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Exact point-isomorphism classification of every defect-preserving endpoint in the complete saved-sixteen degree-preserving 2-for-2 census.
The proposed closure of the sixteen saved defect-10 classes was falsified. The complete one-step frontier contains 115 defect-10 occurrences representing 91 labelled families. Eighty-six occurrences map to fifteen saved classes; the other 29 form exactly 24 additional point-isomorphism classes. The known local plateau therefore has at least forty classes. No defect below 10, 54-block cover, or exclusion of 54 was obtained, so the maintained range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Exhaustive degree-preserving 2-for-2 repair census on one verified representative of every saved defect-10 point-isomorphism class.
The complete direct degree-preserving 2-for-2 neighborhoods of all sixteen saved defect-10 isomorphism classes were enumerated. From 22,896 deleted pairs there were 633,425 nonidentity replacement attempts, 7,076 collision rejections, and 626,349 legal simple candidates. Every class had minimum defect exactly 10; no improvement and no cover was found. Exactly 115 candidates retained defect 10. Independent reconstruction, five mutation controls, byte-identical regeneration, and a hash manifest passed. The global range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Construct explicit elementary signed 3-trades proving equality of the full and normalized residual integer incidence lattices.
The twenty fixed-column occurrences across the four normalized branches comprise twelve distinct blocks. Each distinct block has an independently checked 16-term signed 3-trade with coefficient +1 on the target and all other terms among the 2991 retained columns. Therefore simultaneous twelve-column deletion leaves the integer incidence lattice unchanged. This closes only signed-lattice congruence filtering; the exact range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Exact point-isomorphism census of the declared saved degree-18 defect-10 near-cover corpus.
The declared saved degree-18 defect-10 corpus contains 90 distinct labelled families and exactly 16 point-isomorphism classes. The 88 Iorio radius-five minima form 14 classes, while two later persisted families form two additional singleton classes. This is an exact saved-corpus classification, not a classification of all near-covers; the maintained range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Proof-producing threshold SAT for the complete rank-0 strict-six deletion cell of the locked defect-10 degree-18 seed.
Rank-0 strict-six cell (6,7,17,19,29,53) was compiled to an independently reconstructed 14,837-variable, 51,196-clause CNF. It is UNSAT at final defect at most 9, with DRAT and LRAT independently replayed. This is a local exclusion only; 54 <= C(15,5,3) <= 55 remains unchanged.
Exact covering number C(15,5,3)
Deterministic nonseparable strict 6-for-6 search using arbitrary 2+2+2 incidence-profile decompositions over 1,024 ranked deletion cells of a fixed defect-10 degree-18 seed.
The fixed-pair-link proposal was rejected using the prior independently checked zero-delta audit, and the already-executed joint skeleton quotient was rejected because its checked lower bound was 12,247,501 orbits. The selected constructive discriminator removed the previous pairwise separability restriction. It sampled 131,072 exact-demand profiles over 1,024 ranked deletion cells and scored 5,503,010 literal completions. Independent replay found minimum defect 11, zero positive-loss-budget winners, and no cover. The exact range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Deterministic coverage-guided sampling of strict 6-for-6 degree-preserving neighbors assembled as three exact two-block incidence joins.
The fixed-pair-link challenger was rejected as a certified zero-delta replication. The constructive discriminator generated 32768 valid strict 6-for-6 degree-18 neighbors. Independent replay found minimum defect 11, three minimizers, and zero positive-loss-budget candidates. No cover or exclusion was obtained, so 54 <= C(15,5,3) <= 55 remains open.
Exact covering number C(15,5,3)
Sparse joint binary MILP over the complete strict six-deletion/six-addition exact-degree neighborhood of the locked defect-10 seed.
The fixed-pair rerun was rejected as redundant. The radius-six MILP timed out with a valid but worse defect-13 incumbent. No move was excluded and the exact range remains open.
Exact covering number C(15,5,3)
Freeze and exactly certify the first 512 lexicographic strict-five deletion cells around the locked degree-18 defect-10 seed using sparse maximum-recovery LP duals.
A frozen, prior-corpus-disjoint 512-cell lexicographic shard was produced and independently verified. Every exact-demand strict five-addition completion in these cells has residual defect at least 14. The checker replayed 626773 dual inequalities, six mutations failed, and stable bytes regenerated. This is a local one-seed classification only; 54 <= C(15,5,3) <= 55 remains open.
Exact covering number C(15,5,3)
Denominator-cleared sparse integer encoding and two-implementation exact replay of the immutable 256-cell demand-recovery LP dual corpus.
The immutable 256 recovery-LP dual certificates were converted to a transparent sparse integer format. Canonical size fell 12.70805448323528x and deterministic gzip size 73.82407090045537x; packed and scalar checkers verified all 373112 inequalities and the original histogram, nine mutations failed, and certificate bytes regenerated identically. This is validated infrastructure only; 54 <= C(15,5,3) <= 55 remains open.
Exact covering number C(15,5,3)
A predeclared 256-cell min-hash-stratified usefulness pilot for exact demand-aware maximum-recovery LP dual certificates, with full-sort independent sampling reconstruction.
A fixed 256-cell stratified pilot produced exact demand-recovery LP certificates for 256 previously unclassified local deletion cells. Every cell has integer residual-defect lower bound at least 11; all predeclared count, timing, and size gates passed. A materially different checker reconstructed the complete sampler and 373112 dual inequalities, seven mutations failed closed, and certificate bytes regenerated identically. The global range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Exact two-cell calibration of a demand-aware fractional maximum-recovery LP using independently replayed rational primal-dual certificates.
The demand-aware recovery LP exactly certifies local minimum defects 10 and 11 on the two predeclared calibration cells and strictly ranks them. An independent checker replayed 2041 exact dual block inequalities, five mutations failed closed, and regeneration was byte-identical. The global range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Complete minimum-unique-triple-loss deletion-class selection followed by exact incidence-profile enumeration of every defect-nine-relevant five-block completion.
The complete singleton minimum-unique-loss deletion class was selected from all 3162510 cells and exhaustively searched. Independent encodings agree on 6767836 threshold-relevant exact-degree completions and minimum defect 11. This excludes defect at most nine only in cell [7,17,19,30,53] and leaves 54 <= C(15,5,3) <= 55 unchanged.
Exact covering number C(15,5,3)
Exact finite-field rank and kernel audit of W_{3,5}(15), followed by Wilson's integral signed-design solvability criterion.
The untried modular-incidence lead was executed after rejecting the stale Terra joint-census recommendation. Exact and independent calculations show that GF(2), GF(3), and the full unrestricted signed-block lattice add no constraint beyond established margins. All four normalized residual pools preserve the GF(2)/GF(3) image ranks. This is a scoped route closure, not a cover or exclusion; the exact range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Incoming-first canonical all-original-missing-hitter sampling, followed by an exhaustive exact-incidence join against every five-block deletion and literal loss-budget verification.
The maintained range remains 54 <= C(15,5,3) <= 55. The fixed incoming boundary set has exactly one degree-compatible deletion and reproduces the known defect-10 fixture. The additional 262,144 sampled incoming families yielded 1,561 compatible moves, all with defect at least 18. This closes only random all-hitter scale-up around one seed.
Exact covering number C(15,5,3)
Deterministic 10000-cell min-hash-stratified pilot of exact residual-state memoization across strict five-deletion cells of the locked defect-ten degree-18 seed.
The 10000-cell pilot found 10000 distinct exact states. Independent selection and coverage reconstruction agreed on every record, and five mutations failed closed. The 128x gate failed at 1.0x, so no full census or completion search ran. The range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Compiled canonical type 4 into the exact three-way lambda_45 count partition q in {5,6,7}, independently reconstructed it, and ran a matched 5000-conflict discriminator.
The exact q=5,6,7 partition was compiled with 1092 variables and 6245 clauses and independently reconstructed. Every leaf remained UNKNOWN and regressed in decisions, so the route failed its gate. The range remains 54<=C(15,5,3)<=55.
Exact covering number C(15,5,3)
Classified one saved literal e45=0 complete-link witness for each of 376 type-4 targets under the full 10,368-element stabilizer, with an independent lift-map and primary-clause audit.
The two-marked-pair saved-witness pilot failed its compression gate. All 376 joint target-witness objects are distinct stabilizer orbits; ignoring targets leaves 219 family-only orbits. The literal families have a genuine 275-unit syntactic delta, but no exhaustive family census or SAT test was performed. The exact range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Canonical missing-triple hitter plus a 1+2+2 exact incidence-profile meet-in-the-middle census for one fixed strict five-deletion cell.
A complete, independently reconstructed meet-in-the-middle census proves that one fixed strict five-deletion cell around the locked defect-10 seed cannot reach defect at most nine. Exactly 1451104 canonical completions were checked; the known boundary fixture is the unique defect-10 minimizer. This does not change the maintained range 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Replace the one-hot counters in the complete strict 5-for-5, defect-at-most-nine local CNF with Wallace binary sums and a truncated defect totalizer, then run a matched three-seed solver pilot.
The hybrid formula is exact within its independently checked encoding contract and materially smaller than the one-hot control. It did not decide the local question, failed its decision-quality gate, and produced no covering-design bound or witness. The maintained range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Proof-capable CNF feasibility test for defect at most nine over the complete strict 5-for-5 exact-degree neighborhood of one verified defect-10 seed.
The complete strict 5-for-5 defect-at-most-nine local question was compiled and independently reconstructed, but CaDiCaL returned UNKNOWN at the fixed cap. No candidate, local exclusion, global bound, or exact covering value was obtained. The incomplete partial DRAT from the initial proof-producing control was removed by the runner because it was non-evidence.
Exact covering number C(15,5,3)
Joint sparse binary-MILP optimization over the complete strict five-deletion/five-addition, point-degree-preserving neighborhood of the newest verified defect-10 seed.
The joint model represented every strict exact-degree 5-for-5 move from one defect-10 seed but timed out with another defect-10 family. Independent direct checking passed. The reported lower bound was not independently certified, so no local or global exclusion follows and 54 <= C(15,5,3) <= 55 remains open.
Exact covering number C(15,5,3)
Optimize 24 residual-defect-ranked strict 4-for-4 repairs of an independently checked defect-10 degree-18 seed using sparse binary MILP, then reconstruct every endpoint and returned family independently.
The fixed-pair-link challenger was rejected as zero-delta. Because the exact selector map lacked explicit owner approval, a new constructive 4-for-4 MILP pilot was run instead. It produced no family below defect 10. Independent reconstruction and byte-identical regeneration passed, but no MILP optimality certificate, 54-cover, branch exclusion, structural lemma, or bound improvement was obtained.
Exact covering number C(15,5,3)
Instantiate the Asin et al. shared range-cardinality network on audited canonical type-4 leaf 8, perform a no-solver exact topology/DIMACS census, and stop unless it is at least 20 percent smaller than the totalizer control.
The genuine shared backward-sliced Asin Card_rng encoding was generated and independently reconstructed on canonical type-4 leaf 8. It has 229510 variables and 680822 clauses, 14.5984 percent more clauses than the totalizer and 43.2480 percent above the predeclared advancement gate. All semantic and reproducibility checks passed, so the exact compiler is closed without a SAT run. No cover, branch exclusion, structural covering lemma, or bound improvement was obtained; 54 <= C(15,5,3) <= 55 remains open.
Exact covering number C(15,5,3)
Replaced all fifteen exact-degree totalizers in canonical type-4 leaf 8 with a backward-sliced, false-padding-folded Batcher bitonic selection network and ran a matched proof-capable three-seed calibration.
An exact backward-sliced bitonic compiler produced a 618,812-variable, 1,848,728-clause audited leaf. All runs remained UNKNOWN and were worse than the totalizer on decisions, propagation, and wall time. This compiler is closed; C(15,5,3) remains between 54 and 55.
Exact covering number C(15,5,3)
Replace all fifteen exact-degree totalizers in audited canonical type-4 leaf 8 by an independently reconstructed Wallace carry-save binary-adder CNF and run a matched three-seed proof-capable calibration.
An exact Wallace compiler reduced the audited leaf to 29,681 variables and 215,899 clauses and passed independent semantic/proof checks. All matched runs remained UNKNOWN; decisions improved only 13.96 percent, so the 20-percent all-seed gate failed. The exact range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Appended thirteen proof-capable Sinz endpoint-collision counters to hash-bound canonical type-4 semantic leaf 8, then compared fresh CaDiCaL runs against the unchanged leaf for seeds 0, 1, and 2 at 2,000 conflicts.
A 126,976-variable, 710,190-clause proof-capable collision CNF was independently reconstructed and tested against its unchanged leaf for three seeds. All runs were UNKNOWN, challenger decisions regressed by 13.7164 percent, and the all-seed gate failed. No cover or exclusion was obtained, so 54 <= C(15,5,3) <= 55 remains open.
Exact covering number C(15,5,3)
Matched all-four-type native pseudo-Boolean pilot for 13 endpoint-collision inequalities, with fresh base and 104-pair-upper controls.
A validated 13-row endpoint-collision PB encoding used only 21.0526% of the 104-row control's incidences, but reduced aggregate rlimit by 16.0463%, retained only 30.2587% of the control's saving, and regressed on type 4. The exact range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Exact pre-materialization census and orbit-size lower bound for every weighted internal pair-excess skeleton coupled to the 91 surviving canonical type-4 endpoint headers.
Two independent exact counts show that the 91 surviving type-4 endpoint headers support 1,203,611,004 labelled weighted internal skeletons and at least 12,247,501 joint symmetry cells. This exceeds the 1,000,000-cell materialization gate by 12.247501-fold, so explicit quotient enumeration is closed. The exact range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Exact coupling of all canonical type-4 endpoint pair-excess headers to the omitted internal 13-point pair-excess degree sequence.
The omitted internal pair-excess constraint reduces the type-4 endpoint frontier from 8,281 labelled headers in 104 orbits to 7,956 in 91. Exactly 325 headers in 13 orbits are impossible. The maintained range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Exhaustive type-4 endpoint pair-excess skeleton/link interface census with explicit stabilizer inverse lifts and direct positive witnesses.
The stale fixed-pair-link continuation was rejected. The materially distinct endpoint skeleton-link census classified all 8,281 labelled type-4 headers into 104 stabilizer orbits and constructed a positive necessary-relaxation witness for every orbit. Independent reconstruction, byte-identical regeneration, mutation tests, and manifest replay passed. No header was excluded, no 54-cover was found, and the exact range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Exhaustive strict degree-preserving 3-for-3 closure of the first 512 coverage-ranked deletion endpoints from the verified defect-10 seed.
Exactly 1,191,854 strict neighbors across a deterministic 512-endpoint prefix were produced, regenerated, and independently reconstructed. The best covers 445 of 455 triples with degree 18 at every point and defect ten. The below-ten gate failed, so the exact covering number remains open.
Exact covering number C(15,5,3)
Exact, independently reconstructed audit of the approval-gated twelve-by-256 local layer-five deletion-cell map without SAT solving or lab dispatch
The stale fixed-pair-link rerun was rejected. The exact approval-gated 3,072-cell local map was generated from all 3,162,510 deletions, independently reconstructed, mutation-tested, and regenerated byte-identically. No cell was solved, no cover or exclusion was obtained, and 54 <= C(15,5,3) <= 55 remains unchanged.
Exact covering number C(15,5,3)
A deterministic 256-pair comparison of proof-core-weighted versus singleton-loss-only immediate strict 3-for-3 exact-degree repairs from the verified defect-10 seed.
The stale fixed-pair-link continuation was rejected and a distinct 256-pair constructive discriminator was executed. Neither selector improved the defect-10 seed; proof-core weighting lost the matched comparison. Independent reconstruction and all controls passed, but no cover, exclusion, structural lemma, or covering-number improvement was obtained.
Exact covering number C(15,5,3)
Partitioned the complete canonical type-4 multiplicity-five-pair CNF by four audited primary block literals into 16 exact leaves and ran each with proof emission under a fixed 2000-conflict cap.
A hash-bound, independently checked 16-cube partition of the complete canonical type-4 CNF was generated and run. Every leaf returned UNKNOWN at the 2000-conflict cap. The exact range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Four-type CNF-delta audit of complete pair-link coverage
The complete pair-link proposal was audited across all four canonical CNFs. Every labelled requirement was already present, so the logical clause delta is zero. This rules out only link-only strengthening and leaves 54 <= C(15,5,3) <= 55 unchanged.
Exact covering number C(15,5,3)
Proof-capable unary SAT decision of integral ten-zero parent row 123 in the rooted [13,2] pair-excess partition
A deterministic unary SAT formula decided the previously HiGHS-UNKNOWN row 123 as SAT after 1,031 conflicts. The exact total-85 vector passes all 105 equations and ten zero pins, so 120 weaker children survive this necessary projection. No cover or exclusion resulted; 54 <= C(15,5,3) <= 55 remains open.
Exact covering number C(15,5,3)
Prove and independently audit a reflection-normalizer lex quotient of the fixed C6-invariant family, then compare its compact CNF against the locked baseline at 25000 CaDiCaL conflicts.
The reflection normalizer of the fixed C6 action was independently classified and encoded. It produces an exact near-twofold quotient of the local weighted-size-54 selection space. The bounded CaDiCaL test remained UNKNOWN and failed both predeclared 20-percent telemetry thresholds, so no repeat or scale-up was run. The global range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Byte-regenerate and independently reconstruct the globally complete root-block forward-cap CNF, then compare it against the exact-degree root CNF using identical seed-0 CaDiCaL 1.7.3 runs capped at 25000 conflicts.
The cap CNF regenerated byte-identically with 80332 variables and 481880 clauses, versus 695275 clauses for the exact-degree baseline. Both matched runs remained UNKNOWN at 25000 conflicts. The candidate reduced propagations, time, and memory but increased decisions from 59078 to 86075, so the predeclared advancement gate failed. No cover, excluded branch, or bound improvement resulted.
Exact covering number C(15,5,3)
Independently enumerate and search the 54-block covers invariant under (0 1 2 3 4 5)(6 7 8 9 10 11)(12 13 14), then replace redundant weighted constraints with a semantics-equivalent normalized cardinality encoding.
The stale fixed-pair rerun was rejected. A fixed C6-invariant constructive search was independently implemented and audited. Its compact encoding gives a large measured efficiency improvement but remained UNKNOWN at 25,000 conflicts. No cover or exclusion resulted, so 54 <= C(15,5,3) <= 55 remains open.
Exact covering number C(15,5,3)
Run the complete predeclared [13,2] integral ten-zero parent census until the first one-second HiGHS non-SAT row, then independently reconstruct every positive witness and the exact stopping row.
The bounded [13,2] integral census produced and independently verified exact witnesses for 12 rooted parents, covering 1,272 children in the necessary projection, then reproducibly stopped at global row 123 with HiGHS-UNKNOWN. No cover or exclusion resulted, so 54 <= C(15,5,3) <= 55 remains open.
Exact covering number C(15,5,3)
Enumerate the globally complete 2145 rooted pair-excess skeleton classes, replace each child seven-zero system by its stronger ten-zero parent, solve the continuous nonnegative triple-excess system, reconstruct every positive solution over the rationals, and independently verify all witnesses and child containments.
All 2145 rooted pair-excess skeleton representatives admit exact nonnegative rational ten-zero triple-excess witnesses. Consequently all 124988 seven-zero child headers survive this necessary continuous relaxation. Independent checking, five fail-closed mutations, byte-identical regeneration, and manifest replay passed. No cover or branch exclusion was obtained, so 54 <= C(15,5,3) <= 55 remains open.
Exact covering number C(15,5,3)
Compressed the complete safely quotiented [3,2^6] seven-zero triple-excess tranche from 211 child headers to ten stronger ten-zero integer systems, solved them with HiGHS, and independently reconstructed every witness and child lift.
All ten rooted [3,2^6] representatives have explicit ten-zero triple-excess witnesses, so all 211 seven-zero child headers survive this necessary relaxation. Independent checking, mutation testing, regeneration, and manifest replay passed. No cover, excluded exact branch, or covering-bound improvement was obtained.
Exact covering number C(15,5,3)
Re-encode the exact orbit-27 rooted [3,2^6] cube using rectangular Sinz sequential counters for all 105 pair caps, independently reconstruct the formula, and compare it with the audited totalizer encoding under a fresh matched 2000-conflict CaDiCaL pilot.
The stale fixed-pair challenger was rejected as dominated. A deterministic sequential-counter encoding of the exact orbit-27 cube was generated, independently reconstructed, exhaustively tested on small cases, mutation-tested, and compared with a fresh totalizer control. Both solver runs returned LIMIT. The sequential encoding missed both telemetry gates, so no cover, exclusion, or field-level improvement was obtained.
Exact covering number C(15,5,3)
Materialized, independently reconstructed, and boundedly solved the best-pilot orbit-27 second-block cube of the exact size-1 rooted [3,2^6] leaf.
The exact orbit-27 unit CNF was generated at the predeclared hash, independently reconstructed, and run once at the existing 25000-conflict cap. CaDiCaL returned LIMIT. The partial DRAT is not a certificate, no cover or exclusion was obtained, and the maintained range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Exact second-block stabilizer quotient and matched SAT telemetry for the fixed size-1 rooted [3,2^6] leaf.
The fixed size-1 [3,2^6] leaf admits an independently verified exhaustive cover by 31 representative second-block cubes instead of 3002 labelled choices. Two matched solver runs left every cube unresolved. Orbit 27 nevertheless reduced decisions from 8295 to 4057, passing the continuation gate. The exact range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Constructed, independently reconstructed, proof-smoke validated, and boundedly solved the unique size-1 rooted representative leaf of the canonical [3,2^6] pair-excess skeleton.
A proof-producing exact CNF was created for the unique size-1 rooted [3,2^6] representative and independently reconstructed clause-for-clause. Four mutations were rejected, 258 small totalizer cases passed, and the DRAT-to-LRAT smoke stack plus wrong-formula control passed. The live run returned LIMIT, so no branch was excluded and 54 <= C(15,5,3) <= 55 remains unchanged.
Exact covering number C(15,5,3)
Complete five-root [3,3,3,3,3] ten-zero triple-excess dominance test
All five rooted [3,3,3,3,3] representatives have explicit ten-zero witnesses, so all 80 seven-zero headers in this partition survive the necessary triple-excess projection. The result is independently checked and reproducible but does not change the exact covering-number range.
Exact covering number C(15,5,3)
Compress the complete simple-15-cycle seven-zero triple-excess screen by finding one stronger ten-zero positive witness for each rooted skeleton representative.
All 111 rooted simple-15-cycle representatives have explicit ten-zero triple-excess witnesses. These independently certify survival of all 12,096 seven-zero headers in the complete [15] partition tranche. The result closes this necessary relaxation as a pruning mechanism for that partition but does not change 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Incremental integer-feasibility screening of the first 100 safely quotiented seven-zero triple-excess headers for the 15-cycle pair-excess skeleton
The deterministic first 100 of 12,096 safely quotiented [15]-skeleton headers all survive the seven-zero integer triple-excess relaxation. Independent checking and mutation controls passed. This prefix neither excludes a header nor changes 54 <= C(15,5,3) <= 55. The complete resumable run was prepared, but lab submission was blocked by a read-only service-state directory.
Exact covering number C(15,5,3)
Jointly quotient all 2,145 pair-excess-skeleton/root orbits with all 120 labelled seven-unique-triple selections using each rooted skeleton's actual stabilizer.
The globally safe 257400-header universe collapses to exactly 124988 joint orbits, eliminating 132412 orientations. This is a structural classification only; every remaining header may still be extendable.
Exact covering number C(15,5,3)
Proved and independently checked a globally complete four-branch normalization based on seven triples uniquely covered by one root block, then ran matched bounded SAT telemetry.
Every hypothetical 54-cover admits one of four independently checked seven-unique-triple root normalizations. The reduction is global and exact, but all eight capped solver runs remained UNKNOWN and failed the telemetry gate. The exact range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Computed and independently verified a complete rooted link-block orbit quotient for the pair-excess skeleton [3,2^6], replacing 1001 labelled first-block choices by 14 exhaustive representative branches.
A deterministic producer and materially different checker established that the [3,2^6] pair-excess skeleton, rooted at a doubled-edge endpoint, has a 23040-element stabilizer and exactly 14 orbits on its 1001 possible first root-link blocks. This yields a complete overlapping 14-branch extension split but excludes no branch and does not change 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Exhaustively classify all 32,768 labelled point-boundary interfaces for compatible lifted-Pasch trades around canonical fixed-family type 1 using hidden-vertex masks and an exact subset-zeta transform.
The full point-boundary census is complete. Of 32,768 boundaries, 28,054 hide at least one compatible trade and 4,714 separate all tested trades. The minimum separating size is 10, the largest hidden size is 11, and all boundaries from size 12 separate. This closes the route as a compact aggregation because a minimum separator retains 445 of 455 triple bits. The exact covering range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Exhaustively screen all lifted Pasch trades against every two-point boundary of canonical fixed-family type 1, quotienting boundaries by the exact fixed-family stabilizer and independently reconstructing all labelled counts.
An exhaustive, independently reconstructed census shows that every two-point boundary in canonical fixed-family type 1 is blind to many compatible lifted-Pasch trade directions. The exact covering range remains 54 <= C(15,5,3) <= 55, and no 54-block candidate family was eliminated.
Exact covering number C(15,5,3)
Constructed and independently checked a lifted-Pasch-trade collision before launching the proposed symbolic state-DAG census.
A checked lifted-Pasch-trade witness falsified the declared pair-summary/two-endpoint-boundary projection as a general completion congruence, even while the normalized pair remains in exactly five blocks. The exact range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Transferred the proof-preserving point-degree-cap encoding to canonical multiplicity-five-pair type 2 and compared it with the hash-locked exact-degree CNF.
The validated type-2 cap CNF reduced clauses from 594088 to 410049 but increased matched decisions from 54423 to 85748. Both runs stopped at the conflict limit, so the exact range remains 54 <= C(15,5,3) <= 55. Seed 1, other types, and larger cutoffs were not run.
Exact covering number C(15,5,3)
Derived and tested a globally complete root-block CNF replacing exact point-degree totalizers with theorem-equivalent forward-only degree caps.
The fixed-pair recommendation was rejected as stale, and the approval-gated layer-five job was not dispatched. A new globally complete link-cap CNF was independently reconstructed and proof-smoke validated. It reduced clauses by 30.692172% and decisions by 21.464272% at both matched seeds, but every live run remained at the conflict limit. The exact range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Matched two-seed comparison of the globally complete root-block native-PB encoding with and without all 105 theorem-implied pair floors.
The globally complete native-PB pair-floor pilot was executed and independently checked. All four runs remained UNKNOWN, both seeds regressed in deterministic resource usage, and the exact covering range remains 54 to 55. Protocol v1 is closed, not the global problem.
Exact covering number C(15,5,3)
Four deterministic strict exact-degree ejection-chain arms of lengths 4, 5, 6, and 7 from the verified defect-10 seed, followed by a complete pre-acceptance proposal audit.
The four-arm variable-length ejection-chain discriminator completed 32768 proposals. Although 32750 strict exact-degree replacements were generated, none improved defect 10 before acceptance. Independently checked proposed minima were 13, 17, 18, and 22. No cover or exclusion was obtained.
Exact covering number C(15,5,3)
Coupled saved triple-excess witnesses for all 41 pair-excess skeleton types to four global block-intersection moments, the root skeleton moment, and block-pair parity using exact profile-histogram feasibility.
A deterministic global intersection-moment projection was derived, implemented, independently reconstructed, mutation-tested, and run over all 41 pair-excess skeleton types. Every saved triple-excess witness survived. This closes the aggregate envelope as a type-pruning route but leaves 54 <= C(15,5,3) <= 55 unchanged.
Exact covering number C(15,5,3)
Proof-core-guided necessary filtering of a deterministic 288-cell sample from the strict five-for-five repair neighborhood of one defect-10 degree-18 seed.
A deterministic 288-cell count-five repair pilot was built, independently reconstructed, and proved UNSAT as one shared-selector union CNF. All sampled deletion cells are excluded under a necessary relaxation. The result is strictly local and leaves C(15,5,3) in the maintained range 54 to 55.
Exact covering number C(15,5,3)
Extract and occurrence-map the verified radius-0-through-4 DRAT input core, then independently reconstruct its clause semantics from the fixed seed.
drat-trim verified the locked proof and selected 80527 of 379377 source clauses. Canonical literal-multiset mapping found no missing or duplicate clauses and preserved source occurrence order. The map contains 326 coverage clauses, 28 point-degree clauses spanning 9 points, 4 global-count equivalences, and 80169 auxiliary clauses. Independent reconstruction and mutation testing passed. This is reusable infrastructure, not a layer-five or global exclusion.
Exact covering number C(15,5,3)
Proof-producing SAT exclusion of every degree-preserving r-out/r-in repair with 0 <= r <= 4 around the verified defect-10 seed.
A deterministic 93253-variable, 379377-clause formula representing every degree-preserving repair layer zero through four around the verified defect-10 seed was independently reconstructed and proved UNSAT. DRAT conversion and LRAT replay passed, and a wrong-formula control failed as required. Thus every 54-cover is at symmetric-difference distance at least 10 from this seed. The result is local and does not change the global range 54 to 55.
Exact covering number C(15,5,3)
Complete count-only census of strict degree-preserving 3-for-3 neighbors of the independently checked defect-10 seed.
The complete strict degree-preserving 3-for-3 neighborhood of the verified defect-10 seed contains exactly 52,472,921 neighbors. Independent ordered-triple reconstruction and stratified brute controls agree. The count is 12.5105 times the scoring cap, so no neighbor was scored and no cover or global exclusion was obtained.
Exact covering number C(15,5,3)
Deterministic uncovered-triple-guided strict 3-for-3 local search on exact point-degree-18 54-block families, starting from the independently verified defect-10 seed.
A deterministic uncovered-triple-guided strict 3-for-3 exact-degree trajectory completed 32,768 proposals. Independent replay matched all 30,123 legal proposals and 1,591 accepted moves, but the best defect remained 10. No cover, exclusion, or covering-number improvement was obtained.
Exact covering number C(15,5,3)
Applied an orbit-size lower bound to a sound 15-cycle subset before attempting the proposed joint pair-type/exact-skeleton header census.
The explicit joint pair-type/exact-skeleton header route fails its compression gate: simple 15-cycle skeletons alone require at least 65,765,700 canonical headers. Independent checking, regeneration, and mutation controls passed. No cover or solver branch was excluded, so 54 <= C(15,5,3) <= 55 remains open.
Exact covering number C(15,5,3)
Three-basin deterministic constructive search over exact point-degree-18 families using legal 2-for-2 incidence-preserving switches.
A deterministic three-basin exact-degree constructive tranche executed 786432 proposals and accepted 68396 legal 2-for-2 moves. Independent replay verified best defects 10, 27, and 26. The predeclared below-10 advance gate failed, so no 54-cover, exclusion, structural lemma, or field-level improvement was obtained.
Exact covering number C(15,5,3)
Recompiled one immutable type-4 joint skeleton/profile/coverage leaf as a fully bi-implicational BDD-CNF and ran one proof-producing bounded solve.
A deterministic 260,358-variable, 1,028,222-clause BDD-CNF was generated and independently reconstructed for one joint type-4 necessary leaf. All semantic and proof-stack controls passed. CaDiCaL returned UNKNOWN at the fixed 60-second limit, so no witness, exclusion, or exact covering-number result was obtained.
Exact covering number C(15,5,3)
Exact orbit-quotiented constructive search for a 54-block cover invariant under (0 1 2)(3 4 5)(6 7 8)(9 10 11)(12 13 14), with matched proof-producing CNF pilots
The exact C3 orbit quotient and proof-producing CNFs were built and independently audited. The audit caught a duplicate-member bug in fixed triple orbits, after which every formula and pilot was regenerated. Both corrected 25000-conflict runs remained UNKNOWN. A separate exact Z15 orbit census excludes fully cyclic invariant families of size 54, but no unrestricted cover or exclusion was obtained.
Exact covering number C(15,5,3)
One hash-bound type-4 leaf coupling an exact labelled pair-excess skeleton, five residual-margin profiles, and the first minimum residual-triple orbit
The stale standalone fixed-pair-link challenger was rejected. A materially new joint skeleton/profile/coverage leaf was encoded and independently reconstructed, but Z3 returned UNKNOWN at the predeclared 90-second cap. No witness, exclusion, or exact-value progress resulted; 54 <= C(15,5,3) <= 55 remains unchanged.
Exact covering number C(15,5,3)
Proof-producing canonical type-2 CNF calibration with all 104 implied pair-multiplicity upper bounds
A proof-producing canonical type-2 pair-cap CNF was generated and independently reconstructed. It satisfied the formula-size and validation gates but failed the performance gate: decisions rose from 54423 to 148779 at matched 25000-conflict caps. Both searches remained UNKNOWN, so the exact covering number remains unresolved.
Exact covering number C(15,5,3)
Cross-type robustness gate for auxiliary-free native pseudo-Boolean pair-upper strengthening on canonical multiplicity-five pair types 1–3.
The predeclared cross-type native-PB robustness gate passed. Types 1–3 all showed large PB-propagation and rlimit-count reductions with the implied pair bounds, supported by six independent formula reconstructions, an exact four-type audit, and 27 rejected mutations. All six searches remained UNKNOWN, so the exact covering number is unresolved.
Exact covering number C(15,5,3)
Exhausted the first degree-feasible local exchange layer around Carmine Iorio's maintained 55-block cover: exactly three deletions and two additions.
The complete degree-compatible three-delete/two-add neighborhood contains 15159 distinct 54-block candidates and no cover. Its minimum defect is ten. This proves only a local symmetric-difference lower bound of seven from the displayed Iorio cover; C(15,5,3) remains between 54 and 55.
Exact covering number C(15,5,3)
Headless research pass
The pass did not produce a valid research result: TimeoutExpired: Command '['/root/.local/bin/codex', 'exec', '--ephemeral', '--json', '--sandbox', 'workspace-write', '-c', 'approval_policy="never"', '-c', 'forced_login_method="chatgpt"', '-c', 'model_reasoning_effort="high"', '--ignore-user-config', '--ignore-rules', '--model', 'gpt-5.6-sol', '-']' timed out after 7200 seconds
Exact covering number C(15,5,3)
Compile canonical type 4 directly as native pseudo-Boolean constraints and compare its 424-row base against an auxiliary-free strengthening by 104 implied pair upper bounds.
An auxiliary-free native-PB pair strengthening passed its predeclared propagation gate on canonical type 4. Exact counters reproduced across reruns, both formulas remained UNKNOWN, and the stricter Terra time-plus-resource advancement gate did not pass. The exact covering number remains 54 to 55.
Exact covering number C(15,5,3)
Construct and independently verify a redundant global pair-envelope extension of the canonical type-4 multiplicity-five CNF, then compare it with the exact base under matched bounded CaDiCaL runs.
The global pair-envelope extension was generated, independently reconstructed, mutation-tested, and compared at a matched fallback cap. It remained UNKNOWN and increased propagations by 87.9812 percent. This closes only this encoding/protocol, not any mathematical branch. The exact value remains open.
Exact covering number C(15,5,3)
Exact-capacity test of the simultaneous 13-triple link of the stabilizer-fixed pair {4,5} on all 754 frozen type-4 signature/e_45 targets
The complete labelled {4,5} link was tested across the entire frozen type-4 frontier. Exact aggregation produced 431 cells. All 754 targets survived with independently checked positive witnesses, so the relaxation has zero pruning value. This is scoped campaign progress, not a 54-cover, exclusion certificate, or exact determination.
Exact covering number C(15,5,3)
Exhaustively test both tied minimum residual-triple orbits against every frozen type-4 signature while retaining exact root margins and the {4,5} pair identity.
Both complete minimum residual-triple orbits were exhaustively tested on the frozen type-4 frontier. Each retained all 395 signatures and all 754 previously skeleton-feasible signature/e_45 targets. The exact covering number remains unresolved.
Exact covering number C(15,5,3)
Test the stabilizer-fixed residual pair identity count_45 = 5 + e_45 across the frozen 395-signature type-4 frontier while retaining all skeleton variables existentially.
The exact {4,5} pair-identity refinement retained all 395 frozen type-4 signatures. Every signature has checked residual witnesses for e_45 = 0,1,2. This closes only the one-pair necessary relaxation and does not change 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Falsified the predeclared 120-class capacity premise for the q=6 special-star point-link bin by producing and independently classifying 121 valid links.
The q=6 capacity hypothesis was falsified by 121 explicit, independently verified isomorphism classes. This is a local lower bound and route-capacity result only; the q=6 bin remains incompletely counted and C(15,5,3) remains between 54 and 55.
Exact covering number C(15,5,3)
Audited literal point-link lifting and dual colored-incidence canonicalization before any two-profile frontier census.
The prerequisite gate passed and produced independently checked research infrastructure. It did not enumerate a link frontier, solve an extension instance, produce a 54-cover, or exclude any cover. The exact range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Constructed, independently reconstructed, mutation-tested, and benchmarked two full-primary-vector D15 generator lex leaders for the [15] exact-pair seed CNF.
The D15 encoding and all controls succeeded, but the solver discriminator did not. Both formulas remained UNKNOWN, and the 2.8191 percent propagation reduction missed the 20 percent retention threshold. No seed, cover, exclusion, or proof was obtained. The maintained range remains 54 <= C(15,5,3) <= 55.
Exact covering number C(15,5,3)
Gate degree-and-pair-preserving trade search by first constructing exact-pair 54-block seeds for four canonical weighted-degree-two cycle skeletons, then prepare an exhaustive common-core lifted-Pasch census.
The prerequisite seed gate was implemented for four canonical pair-excess skeletons. All four bounded MILPs returned UNKNOWN without incumbents, so no second seed or trade census was attempted. A materially different [15] balanced-totalizer CNF regenerated byte-identically and also returned UNKNOWN under a ten-second CaDiCaL cap. Independent structural and mutation checks passed. The exact covering number remains unresolved.
Exact covering number C(15,5,3)
Enumerated all S2 x S3-canonical type-4 internal-excess vectors, tested exact weighted-degree-two skeleton feasibility, then coupled the five fixed roots through exact-capacity residual intersection-feature counts after the required 53-to-49 subtraction.
The canonical type-4 projection contains 1176 possible internal-excess vectors. The producer reported 395 skeleton-feasible vectors, and every one has both a full skeleton witness and a simultaneous exact-capacity aggregate feature witness accepted by an independent checker. Since 395 exceeds the 117-vector promotion threshold, no SAT leaves were generated. The producer's 781 negative skeleton statuses were not promoted because this epoch did not independently certify them.
Exact covering number C(15,5,3)
Independently compile the frozen mapping-1438 literal profile into a proof-capable balanced-totalizer CNF while algebraically discharging ten redundant outside-point degree rows, validate the complete encoding, and run one bounded CaDiCaL pilot.
A deterministic proof-capable CNF and independent checker were completed for the frozen mapping-1438 profile. Ten redundant degree totalizers were safely discharged, cutting the all-row CNF estimate by 32.83% of variables and 47.19% of clauses. All semantic, mutation, boundary, regeneration, and proof-stack controls passed. The single 110-second CaDiCaL run returned UNKNOWN, so no cover, local exclusion, or global bound was obtained.
Exact covering number C(15,5,3)
Literal outside-subset realization of the hash-bound mapping-1438 31-cell witness for the 15-cycle skeleton, root orbit 107 and profile 0.
The selected aggregate survivor was promoted to a reproducible literal-subset PB instance. Independent checks passed, but the bounded solver result was UNKNOWN. This is reusable infrastructure and a negative tractability signal, not a cover, exclusion or new bound.
Exact covering number C(15,5,3)
Independently reconstruct the canonical type-4 common-family stabilizer, add sound generator lex leaders on the 2,717 primary block variables, and compare pointwise, full, and unsymmetrized CNFs at the identical 25,000-conflict protocol.
The type-4 pointwise and full stabilizers were independently verified at orders 5,184 and 10,368. Sound lex CNFs were constructed and audited, but both remained UNKNOWN and nearly doubled or more than doubled propagation at the matched cap. This rejects scaling these particular encodings; it does not exclude type 4 or change the maintained 54–55 range.
Exact covering number C(15,5,3)
Normalize a hypothetical 54-cover on a pair of multiplicity exactly five, classify its five common blocks into four canonical types, and probe all four extension CNFs.
A complete four-case normalization was proved and independently counted. The known 55-cover supplied a successful type-2 encoding and decoding control. All four live 54-cover branches remained UNKNOWN at 25,000 conflicts, so the maintained range remains 54–55.
Exact covering number C(15,5,3)
Built and independently audited exact-cardinality C(5,3,2) OPB controls, then tested availability of the first required pinned proof-producing solver source.
The exact-cardinality C(5,3,2) OPB packet passed independent exhaustive checking, byte-identical regeneration, and semantic mutation controls. The first required pinned RoundingSat source could not be acquired because gitlab.com did not resolve, so no proof was emitted or replayed and no C(15,5,3) leaf was run. The maintained range remains 54–55.
Exact covering number C(15,5,3)
Independently audited the automorphism stabilizer and common-family frontier for the certified partition-[15], root-mask-31, ordered-edge-(0,1) two-link cell.
The selected two-link canonicalization gate is complete. The full cycle group has order 30, the root stabilizer has order 2, and fixing ordered edge (0,1) leaves only the identity. Forced endpoint-triple coverage reduces the six-triple common-family frontier by factor 66.54, but 10835789965 families remain. No 54-cover was found or excluded, so the exact range remains 54–55.
Exact covering number C(15,5,3)
Built and independently checked a block-identity-preserving two-link calibration using ordered endpoints (1,15) of the maintained 55-block cover.
The two-link representation passed its positive calibration on the maintained 55-cover. Endpoints (1,15) produce two 18-block C(14,4,2) links, each covering all 91 pairs, with six exactly shared triples. Byte-identical regeneration and three mutation controls passed. This excludes no 54-cover case, so the exact value remains unresolved.
Exact covering number C(15,5,3)
Globally classify the proved 31-cell root-pair excess relaxation across every certified rooted skeleton/profile instance, solving only canonical coefficient signatures and transporting every result back to its original labels.
The global root-pair sweep compressed 30,845 systems to 279 canonical signatures and independently validated 3,955 LP-infeasible profile mappings plus 25,278 integer-feasible mappings. Zero of 2,145 rooted orbits was excluded, so the exact covering number remains unresolved and this relaxation is closed at its current strength.
Exact covering number C(15,5,3)
Derived and tested a root-pair outside-triple coupling inequality on the selected partition-[15], root-mask-31 case.
A general root-pair outside-coverage lemma was proved and applied to one selected rooted skeleton case. Exact certificates eliminate 7 of its 20 profiles, while integer witnesses preserve 13. This is profile-level progress only: C(15,5,3) remains between 54 and 55 and all 2145 rooted cubes remain open. An initial wrapper invocation was discarded because shell quoting split the source URL; the claimed receipt is the subsequent clean run with a fresh output path.
Exact covering number C(15,5,3)
Test every certified unrooted pair-excess skeleton using the necessary nonnegative integer triple-excess projection sum_{T contains xy} e_T = 2 + 3 s_xy.
All 41 certified unrooted pair-excess skeleton types have explicit feasible witnesses for the necessary triple-excess projection. A separate checker validated 18655 nonnegative entries and all 4305 pair equations. Three mutations were rejected, including a total-preserving unit move that reached row comparison and failed at pair (0,2). Thus the projection prunes nothing and implies neither a 54-cover nor impossibility. Pinned OPB calibration was not attempted because no local RoundingSat/VeriPB/CakePB stack exists and sandbox DNS blocks GitLab retrieval. The exact range remains 54 to 55 and all 2145 rooted cubes remain open.
Exact covering number C(15,5,3)
Construct and independently reconstruct the complete sparse OPB semantics of the certified partition-[15], root-mask-31 leaf, with hash-rebound target, variable, and orientation mutation controls.
The root-31 leaf now has a canonical sparse OPB formula and independently checked semantic manifest. Exact counts are 3002 variables, 445 coverage inequalities, 105 equalities, 550 written constraints, 655 equality-expanded proof axioms, and 59390 incidence terms. Three hash-rebound mutations were rejected. No model or proof was run, so C(15,5,3) remains between 54 and 55 and all 2145 cubes remain open.
Exact covering number C(15,5,3)
Run the predeclared byte-identical 250000-conflict no-reflection Z3 native-PB continuation on the certified partition-[15], root-mask-31 leaf, then independently audit provenance, structure, status, and witness absence.
The exact byte-identical no-reflection native-PB continuation returned UNKNOWN at 250001 conflicts and produced no witness. Independent reconstruction and provenance checks passed, including two fail-closed negative controls. The covering range remains 54 to 55, every one of the 2145 cubes remains open, and further cutoff-only scaling on this leaf is closed.
Exact covering number C(15,5,3)
Independently test exact 31-cell root-flow refinement, then calibrate a hash-bound direct native-PB formulation of the certified partition-[15], root-mask-31 leaf with and without its reflection lex-leader.
The incumbent root-flow refinement was independently falsified as a reduction: all 20 profiles survive with checked integer witnesses. A new direct-PB producer and independent checker validated a 3002-variable, 550-row formulation. Z3 returned UNKNOWN at 25001 conflicts both with and without reflection, so no cover or exclusion was obtained. The no-reflection control was faster, making one larger bounded constructive test inexpensive, but all 2145 cubes remain open.
Exact covering number C(15,5,3)
Generated, independently audited, and proof-calibrated the certified 15-cycle pair-excess leaf with distinguished root 01234 and all 105 exact residual pair equalities.
A deterministic generator and materially different checker validate the first certified exact-pair joint leaf. The final CNF has 109327 variables and 542540 clauses, with target histogram 4^6,5^88,6^11. All structural, mutation, and counter controls passed. The fixed live run returned UNKNOWN, so no cover or exclusion was obtained and all 2145 cubes remain open.
Exact covering number C(15,5,3)
Exact joint orbit census of every weighted-degree-two pair-excess skeleton with a distinguished 5-subset, followed by an independent component-word and Burnside verification and a necessary root-intersection profile filter.
A deterministic producer and materially different checker establish exactly 2145 joint pair-excess-skeleton/root orbits. Necessary aggregate triple coverage reduces the attached root-profile layer from 54032 to 30845. No 54-cover was found and no joint orbit was excluded, so C(15,5,3) remains between 54 and 55.
Exact covering number C(15,5,3)
Implemented and independently controlled the globally complete root-block-normalized exact-degree SAT encoding, then ran the predeclared 5000-conflict CaDiCaL discriminator.
The root-block encoder passed duplicate-generation, fixed SAT/UNSAT CNF and PB controls, decoder, two direct cover checkers, and 448 exhaustive cardinality tests. The live 5000-conflict run returned UNKNOWN. No 54-cover was found and no case was excluded; the exact range remains 54 to 55.
Exact covering number C(15,5,3)
Added 13 theorem-forced high-point pair equations to the fixed-link residual CNF, independently checked their derivation and cardinality semantics, and compared baseline, exact-36, and pair-aware formulas under a matched 5000-conflict CaDiCaL pilot.
The forced-pair strengthening was implemented and validated but failed its retention threshold. All three matched formulas returned UNKNOWN, so no cover was found and no case was excluded. The durable campaign state now activates root-block-only constructive SAT.
Exact covering number C(15,5,3)
Fix the validated 18-block 7,5^13 point link, encode the remaining 36 root-avoiding blocks with exact residual degrees and triple coverage, then run a bounded controlled CaDiCaL discriminator.
A deterministic fixed-link residual CNF generator, decoder, protocol, and two independent global checkers were implemented. All maintained-cover and mutation controls passed, and two live CNFs regenerated byte-identically. The clean bounded live run returned UNKNOWN, so no link class or global case was eliminated and the exact range remains 54 to 55.
Exact covering number C(15,5,3)
Root-normalized SAT feasibility test for the doubled-edge local-link degree profile 7,5^13, followed by independent witness validation.
The local-infeasibility hypothesis was falsified. A byte-reproducible rooted CNF produced an 18-block C(14,4,2) cover with ordered degrees 7,5^13. Three materially different validations accepted the exact witness. This eliminates no global skeleton and leaves 54 <= C(15,5,3) <= 55 unchanged.
Exact covering number C(15,5,3)
Mandatory source-and-method baseline followed by deterministic verification of the known 55-block cover and an independently checked pair-excess stratification for hypothetical 54-covers.
The mandatory baseline was completed without launching a frontier search. The 55-block source cover and the ordinary-profile C(14,4,2) link were directly verified. A pair-excess lemma reduces hypothetical 54-covers to 41 skeleton types. Two independent counts corrected the Terra labeled-profile total to 147267180508. The exact value remains open.