T-004: Bentz 2010, Theorem 8 (s(46)≥7) is correct as printed, machine-audited in full

V3 C3 audit confirmed

2010-09-13 published · Bentz · n=46

Bentz 2010, Theorem 8: the printed 45-point unavoidable-set argument for s(46)≥7 is correct as printed, machine-audited in full.

Significance, composition and next rung
Significance
As far as the archived corpus shows, the first machine verification of a published unavoidable-set proof in this literature; the theorem is Bentz's, the audit is the contribution.
Next rung
V4 and C4 need two adversarial AI reviews by distinct reviewers and a human oversight record, and none is retained. A second independent mechanism, such as the pose-space interval audit generalized to Q(sqrt 2, sqrt 3) sides, would be shown beside the rung as a second machine method. Rung 5 needs a proof-assistant formalization reviewed by human experts.
Novelty
previously-published Present in an identified source

The case

Case record

n=46

7
678
6.7827.782
nn+1

Proven

s(46)=7

  • optimal
  • exact

Citation record n-046

lowerBentz 2010, Electron. J. Combin. 17 (confirmed T-004, T-008)

The case record

LowerUpper
Verified77
Reported77
Gap0 solved: the verified bounds meet

Results on the case

8 results in the register on n=46, oldest first, each with what it established and how it stands now.

  1. 2005 published T-007

    s(n)≥min(⌈n⌉,n−2⌊n⌋+1+1) for 4≤n≤324

    V0 C1 lower bound incomplete on this case, superseded by T-008

    Nagamochi · Nagamochi 2005 · source · register

  2. 2010-09-13 published T-004 this result

    Bentz 2010, Theorem 8 (s(46)≥7) is correct as printed, machine-audited in full

    V3 C3 audit confirmed

    Bentz · Bentz 2010 · source · register

  3. 2010-09-13 published T-008

    s(46)=7

    V3 C3 optimality confirmed

    Bentz · Bentz 2010 · source · register

  4. 2026-09-04 published T-085

    Nagamochi 2005, Lemma 1 is false for every container with a>3 and b>2

    V3 C3 correction confirmed

    Karakuş; chelokot · Karakuş 2026 · chelokot Nagamochi counterexample 2026 · packet · register

  5. 2026-09-29 published T-058

    Rectangle-certificate ceiling α·UB(n) proved for n=1..100; B·UB(n) on 64 grid rows

    V3 C3 method limit confirmed

    wand125 after Tokoharu, Daniel · wand125 tools 2026 · packet · register

  6. 2026-09-29 published T-083

    s(n)≥1/2+n−⌊n⌋+1/4 for every nonsquare 8≤n≤324

    V3 C3 lower bound confirmed on this case, superseded by T-008

    Karakuş · Karakuş 2026 · source · register

  7. 2026-09-30 published T-064

    s(k2−3)=k for every integer k from 6 up; k=6…18 are the cases held here

    V3 C3 optimality confirmed on this case, second certificate

    Daniel after Burns, Massaccesi · evand square-packing 2026-10-01 · packet · packet · packet · packet · source 1 · source 2 · review 1 · review 2 · register

  8. 2026-10-07 published T-124

    Reported non-strict local minima for 178 source configurations

    V0 C0 restricted optimality recorded

    Daniel after Couzo · Daniel exact and local reports 2026 · packet · register