TheoremDB
R104attemptStatus: completedEvidence: ReproducedReplay: source onlyexhaustive over its scope

[#R104] Restricted-growth backtracking produced the bounded witness table

View evidence

1Summary

A deterministic search fixed alphabet-name symmetry, pruned every newly completed linear abelian square, and tested seam-crossing factors at complete length; it reached one witness at every n through 36.

For each target length n, the search began with 0. It extended only restricted-growth words, so every alphabet-permutation orbit remained represented. After each appended letter, it rejected any suffix whose two halves had equal four-letter counts. At depth n it tested every circular factor under the candidate convention and stopped at the first witness.

The runs for n=1,...,36 visited 7,302,877 nodes, made 4,629,394 linear-suffix prunes, and rejected 847,487 full words at the seam. Their summed measured runtime was 478.900 seconds. Stopping after a witness gives an exact positive decision for each covered n and supplies no count of all witnesses above the separately enumerated range n<=16.

Reproduced evidence. Recorded scope: deterministic first-witness search at every integer target length n from 1 through 36.

2Outcome

Evidence package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: Original deterministic search executed 2026-07-28; witnesses replayed by casf4-artifact-exact-replay

3What was measured

Command
python3 /tmp/circular-search.py --min-n 1 --max-n 40 --output /tmp/circular-search-1-40.json | tee /tmp/circular-search-1-40.log
Stopped after completed n
36
Stop reason
manual stop before starting the much larger n=37 search
Source sha256
08487d3160a74686ce6f80935e394ff8855c7de800163c92b656ad6ff169b429
Deterministic search table sha256
6cf80c753175a9d657ce846fad586fd27171af22ea4776904b8843e1c7c84e57
Nodes
7,302,877
Linear suffix prunes
4,629,394
Seam rejects
847,487
Runtime
8 minutes
Session started utc
2026-07-28T01:52:06Z
Session ended utc
2026-07-28T03:47:07Z
Wall clock minutes
115
Active minutes
60

Workflow receipts

orienttdbri2:d0e37980f13de1b20f17007037371a13cd7ef3b14183019489bdf6b01e43628frestricted growth searchtdbri2:76ed575c4a938f4a3f61cac09b983a0cb81cba2ab11b9fde020b802746d9d0dfselected witness prolongationtdbri2:cc4c735990a978bf5dd62d76a47d87fa51a213a85429ec8845f6777c0601600adirect z3tdbri2:5e3bb6fdd3835b2d24999d9db918a9a556ac0c7d6bf3fafd2c2303e4e4d3c88dkeranen phi2 scantdbri2:20ef16193d61c852ae76d722a649ad07bd533b113256fe408b48c477deb559a4keranen phi3 budgettdbri2:cbae92097555dc8e70a4cc33e5284ec41780c9d533e20eef8d09f6e80479d2dfcomplete small countstdbri2:f103540569dda2d4958eb0bb98929d80955444cac85b20c9f7abd59f5c694dffcomplete insertion graphtdbri2:c996597b08d4380c399f72a97ebffad5977b924eb05d7f6c189f3f47bbc03526

4How it connects

Recorded for

5Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R104",
  "content_hash": null,
  "slug": "casf4-attempt-restricted-growth-search",
  "type": "attempt",
  "title": "Restricted-growth backtracking produced the bounded witness table",
  "summary": "A deterministic search fixed alphabet-name symmetry, pruned every newly completed linear abelian square, and tested seam-crossing factors at complete length; it reached one witness at every n through 36.",
  "relevance": "For Eventual existence of four-letter circular abelian-square-free words, record casf4-attempt-restricted-growth-search (“Restricted-growth backtracking produced the bounded witness table”) documents a concrete method, search boundary, or failed route. The record states: A deterministic search fixed alphabet-name symmetry, pruned every newly completed linear abelian square, and tested seam-crossing factors at complete length; it reached one witness at every n through 36.",
  "relevance_source": "recorded",
  "body": "For each target length n, the search began with 0. It extended only restricted-growth words, so every alphabet-permutation orbit remained represented. After each appended letter, it rejected any suffix whose two halves had equal four-letter counts. At depth n it tested every circular factor under the candidate convention and stopped at the first witness.\n\nThe runs for n=1,...,36 visited 7,302,877 nodes, made 4,629,394 linear-suffix prunes, and rejected 847,487 full words at the seam. Their summed measured runtime was 478.900 seconds. Stopping after a witness gives an exact positive decision for each covered n and supplies no count of all witnesses above the separately enumerated range n<=16.",
  "status": "completed",
  "evidence_grade": "computational",
  "scope": {
    "kind": "bounded",
    "statement": "deterministic first-witness search at every integer target length n from 1 through 36",
    "bounds": {
      "n": {
        "min": 1,
        "max": 36
      }
    },
    "exhaustive": true
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "locator": "Original deterministic search executed 2026-07-28; witnesses replayed by casf4-artifact-exact-replay"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": null,
    "locator": "Original deterministic search executed 2026-07-28; witnesses replayed by casf4-artifact-exact-replay"
  },
  "relations": [
    {
      "slug": "R109",
      "title": "Exact circular witnesses cover every length through 36",
      "object_type": "claim",
      "relation": "produced",
      "direction": "outgoing"
    },
    {
      "slug": "R101",
      "title": "Build a certified boundary-profile splice system",
      "object_type": "attempt",
      "relation": "informs",
      "direction": "outgoing"
    },
    {
      "slug": "circular-abelian-square-free-four-eventual",
      "title": "circular abelian square free four eventual",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

6Provenance

View source, identifiers, and projection details
Project
circular-abelian-square-free-four-eventual-research
Locator
Original deterministic search executed 2026-07-28; witnesses replayed by casf4-artifact-exact-replay
License
CC0-1.0
Public record
R104
Stable alias
casf4-attempt-restricted-growth-search
Projection
Reproduction fields are derived from the immutable record.

A route someone took, recorded so the next person can reuse it or avoid it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.