{
 "tm": "1RB1RF_1LC0RF_1LE0LD_1RC0LB_---1RA_1LB1RA",
 "bucket_reason": "Low/med confidence at observe: the mechanism is exact, but it reduces to #13's open edge lemma (E'), which Dennis parked on #13. Proof work waits.",
 "question": "Park this machine with #13 (same edge lemma), or fund one family stage on that lemma for #13, #34, #35 and #36?",
 "options": [
  {
   "id": "park",
   "label": "Park with #13: STUCK at observe, keep the card and rules as the reduction",
   "consequence": "No further spend. Reopen all four machines together if (E') or a stronger CTL tool turns up. The background edge-map run is done: clean to 1.5e7 cycles (about 4.9e16 real steps)."
  },
  {
   "id": "family",
   "label": "Fund one 2 h family stage on (E') for #13, #34, #35 and #36",
   "consequence": "One lemma would give 4 kills, but #13 already failed SFT_k (k <= 36) and plain CPS (n <= 26), and its CTL62 runs ran out of memory. Odds unknown; the next route (native CTL modes) is days of work."
  },
  {
   "id": "halt_search",
   "label": "Park, plus a longer background halting search (edge map past 1.5e7 cycles)",
   "consequence": "About 1 core-hour per 3e7 cycles, niced, past the 1.5e7 cycles already done. It answers mxdys's UBRRBA hint (a late halt) for all four machines at once. A halt in the edge map would still need confirming at the real bulk size."
  }
 ],
 "recommended": "park",
 "rationale": [
  "Not easier than #13: same junction, same tail cycle for cycle, same probe map on every tested input.",
  "You parked #13 on this lemma; this machine gives no new idea for (E').",
  "New value: any future (E') proof now pays 4 kills (noted here and in STATUS.md)."
 ],
 "evidence": [
  {
   "kind": "figure",
   "text": "Fig 2: our tail D_n | #13's tail | XOR, one row per cycle (XOR all black)",
   "href": "img/twin_tail_vs_13.png"
  },
  {
   "kind": "fact",
   "text": "Probe map equal to #13's: 120/120 orbit D; 200 random D give 97 the same and 103 break in both; 0 disagree",
   "href": "work/validate.json"
  },
  {
   "kind": "fact",
   "text": "#35 is this table renamed (A..F -> D,C,E,A,F,B) and follows the same D_n; #34 follows the mirror of D_n",
   "href": "notes.md"
  },
  {
   "kind": "fact",
   "text": "Edge map clean to 1.5e7 cycles (about 4.9e16 real steps); its first 5.5e6 cycles match #13's log line for line",
   "href": "work/edgemap_5.5e6_to_1.5e7.txt"
  }
 ],
 "effort_if_yes": "park: 0. family: 2 h agent time, odds low. halt_search: about 1 core-hour of background CPU, no agent time.",
 "updated": "2026-10-10",
 "answer": {
  "option": "park",
  "note": "auto-applied: Claude's recommendation, under Dennis's standing instruction 'do your recommendations and continuously orchestrate' (2026-10-10, while he was at lunch). Override any time.",
  "date": "2026-10-10"
 }
}