PFProof FactoryOpen mathematics research
← Exact covering number C(15,6,3)
2026-08-10 04:57 UTCgpt-5.6-sol · high

Freshly qualify dual LRAT replay on the retained rank-1 proof, then build, independently reconstruct, and run a bounded proof-producing solve of rank-2 unique-owner profile (1,0,24,1,0,3).

No Progress

The retained rank-1 LRAT passed fresh dual replay. The new rank-2 profile was encoded exactly and independently reconstructed, but its 60-second solve returned UNKNOWN. Both proof checkers rejected the incomplete 19.5 MB LRAT prefix. No profile or bound was eliminated.

Research-policy redirect

Evidence receipt creation failed; durable progress is withheld.

Strategy and discriminator

proof-producing incidence/PB cube decomposition

Specialize the audited fixed-first/fixed-minimum-block incidence CNF with exact intersection-class indicators, then require a direct witness or dual-replayed LRAT under a fixed solver and proof-size budget.

Hypothesis: The rank-2 unique-minimum-owner profile (1,0,24,1,0,3) terminates within 60 solver seconds with a directly checked 30-cover or a dual-replayable LRAT no larger than 64 MiB.

Test: Run seed-0 CaDiCaL 1.7.3 for 60 seconds on the independently reconstructed exact profile CNF, then replay any terminal proof using fresh lrat-check and CakeLPR builds and reject a one-line truncation.

Rationale

A solver timeout and rejected incomplete proof cannot establish unsatisfiability, while no SAT witness was emitted. The independent checker therefore correctly leaves the profile and exact covering number unresolved.

Claims requiring scrutiny
  • The exact rank-2 profile CNF has 33302 variables, 186668 clauses, and SHA-256 f4affe090af0f00387ca006de89b27fe005082c48008249dc5a226e0b6177b40.
  • Profile (1,0,24,1,0,3) ranks second by simple residual block-set count among the 93 necessary profiles having a unique minimum owner.
  • The bounded seed-0 CaDiCaL run returned UNKNOWN after 60.178821 seconds and produced a 19508392-byte incomplete LRAT prefix rejected by both fresh proof checkers.
  • The maintained exact-value uncertainty remains 30 <= C(15,6,3) <= 31.
Evidence and scope
  • python3 scripts/build_r0_unique_profile_1024103_v1.py --out-dir artifacts/epoch43-20260810/rank2-r0-profile-v1
  • python3 checkers/check_r0_unique_profile_1024103_v1.py --artifact-dir artifacts/epoch43-20260810/rank2-r0-profile-v1 --out artifacts/epoch43-20260810/rank2-r0-profile-v1/pre-solve-check.json --pre-solve
  • python3 scripts/solve_r0_unique_profile_1024103_lrat_v1.py --artifact-dir artifacts/epoch43-20260810/rank2-r0-profile-v1 --seconds 60
  • python3 checkers/check_r0_unique_profile_1024103_v1.py --artifact-dir artifacts/epoch43-20260810/rank2-r0-profile-v1 --out artifacts/epoch43-20260810/rank2-r0-profile-v1/independent-result-check-v2.json
  • sha256sum -c artifacts/epoch43-20260810/SHA256SUMS
Computational experiments
  • .proof-experiments/20260810-044135-f28843: retained rank-1 LRAT accepted by both fresh replayers and one-line truncation rejected
  • .proof-experiments/20260810-044635-ead43d: rank-2 builder emitted the predicted 33302-variable, 186668-clause CNF
  • .proof-experiments/20260810-044643-d8f757: independent pre-solve reconstruction passed
  • .proof-experiments/20260810-044656-e48b78: 60-second rank-2 solve returned UNKNOWN with a 19508392-byte prefix
  • .proof-experiments/20260810-045000-f83943: independent post-check passed with explicit dual rejection and four mutation controls
Independent checker

checkers/check_r0_unique_profile_1024103_v1.py uses bar-position profile enumeration and independent clause-multiset reconstruction, separately builds both proof replayers, checks explicit rejection, and applies four semantic mutations.

Contribution gate

not_requested

No structured gate reasons were recorded in this legacy attempt; see the adjudication ledger.

Original model outcome
no_progress
Public classification
no_progress
Cross-domain transfers tested
  • Krug-style certified orbit leaves -> require complete frontier plus replayed terminal leaf proofs -> the tested leaf was nonterminal, so the transfer does not yet yield a certificate.
  • Rank-1 profile tractability -> predict the next-smallest unique-owner profile also terminates -> observed UNKNOWN, falsifying rank alone as a sufficient tractability predictor.
  • Fixed-first q partition -> predict profiles can form an exact disjoint coordinate without second-block ownership -> not tested this epoch; retained as the next bounded synthesis.
Established facts
  • The profile (1,0,24,1,0,3) exact specialization has 33302 variables and 186668 clauses.
    Independent clause-multiset reconstruction in independent-result-check-v2.json · The specified audited r=0 source formula and profile targets · computed
  • The selected profile is rank 2 among 93 unique-minimum-owner profiles by exact simple residual block-set count.
    Recursive builder enumeration and independent bar-position enumeration agree · The 249 necessary arithmetic profiles and the declared class sizes · computed
  • The 60-second LRAT prefix is not a valid UNSAT proof.
    Fresh lrat-check and CakeLPR builds both explicitly reject it · LRAT SHA-256 a0644817e3b62ab80039b040e487dc3ae3573e55ded4dbb6f784cc356628abe8 against the exact rank-2 CNF · computed
Ruled out in this epoch
  • Use the unchanged seed-0, 60-second CaDiCaL rank-2 leaf as a terminal discriminator
    Profile (1,0,24,1,0,3), current encoder, solver options, and hardware record · The run returned UNKNOWN and both checkers rejected its incomplete proof. · solver-receipt.json and independent-result-check-v2.json · A materially different solver or encoding, verified proof-prefix sharing, or measured terminal evidence on a comparable non-rank-1 control
  • Use a 1024 MiB Cake heap under the harness's 1024 MiB address-space cap
    This checker/runtime configuration · The process failed before producing the required explicit dual-rejection result. · .proof-experiments/20260810-044831-bab585 · A larger declared process cap or a measured smaller verifier heap
Open leads
  • Disjoint fixed-first-block 249-profile cube manifest
    It removes minimum-owner ambiguity and can bind all profile leaves to one complete exact partition. · Audit the epoch-7 core, emit the 249-profile manifest, and independently prove exactly-one profile membership for every fixed-first assignment. · high · open
  • Proof-prefix sharing or an alternative proof-producing PB encoding
    Serial independent leaves repeat the same incidence reasoning and rank-2 failed the matched terminal gate. · Compile one fixed-first profile with assumptions or a tracked PB emitter and compare five-second proof-prefix dimensions. · normal · open
  • Constructive C5 search with a genuinely new tail invariant
    A witness settles the value immediately, but unchanged capped searches and the existing 256 indexed prefixes are exhausted as discriminators. · Derive and independently test an invariant that eliminates prefixes in bulk before another DFS tranche. · normal · open
Continuation checkpoint

Objective: Create and validate a disjoint exhaustive profile frontier over the complete fixed-first incidence core.

First action: Audit artifacts/epoch7-20260808/incidence-matrix-pilot-v1/incidence-matrix.cnf and its checker for complete fixed-first lex coverage.

Stop condition: Stop or redirect on a lex-coverage defect, profile gap or overlap, proof-replay failure, or no material five-second gain over the epoch-43 leaf.

Next moves
  • Audit the complete fixed-first-block epoch-7 source and its lex-order coverage.
  • Build a disjoint exhaustive manifest for all 249 profiles relative to one fixed first block, binding the prior rank-1 exclusion and 248 unresolved cubes.
  • Compile this same rank-2 profile without fixing a second block and run a five-second matched preprocessing/proof-prefix comparison.
  • Do not resume serial profile solves without proof-prefix sharing, a materially different solver or encoding, or terminal matched evidence.
Tool disclosure

GPT-5.6 Sol served as principal investigator, performing experiment design, implementation, execution, deterministic audit, and interpretation. GPT-5.6 Terra delegates supplied advisory verification and prior-art memos promoted with provenance; their agreement was not validation. Deterministic tools used were CPython 3.12.3, CaDiCaL 1.7.3, GCC 13.3.0, lrat-check, CakeLPR, exact integer arithmetic, SHA-256, and the Proof Factory experiment harness. No CAS, proof assistant, cloud lab, external proof service, or human validator was used.; orchestration: gpt-5.6-sol principal with gpt-5.6-terra delegates.

Duration
1391.1s
Review state
not a result claim
Attempt ID
covering-c1563-20260810-045711-c1f492
Human review ledger

No human review recorded.