{
  "scope": "Handwritten Small-only tree model on all binary words of lengths 3..10 at eligible levels 1,2, plus eight words at levels 3,4; all formal expressions through length 4 over a,b,X,Y separated inside levels 1,2. The equality control is a direct model assertion. Polymorphic Empty is checked by source inspection, not a runtime test. Source hashes pin inspected statements; no Rocq build or unrestricted proof verification.",
  "constructed_cases": 3584,
  "separated_expressions": 341,
  "source_commit": "503c5d3ff7f9a20bad1cd7a8f8d7abf4e635d3a0",
  "source_hashes": {
    "theory/Cadeque/Types.v": "4beb995bd9634c6cc275aa053e009065a7ff699e2ad7b04fd2821df97bcd9e23",
    "theory/Cadeque/Models.v": "d19612a21f4e506aedb31657393c437a07d1f2f8e5ed4ebcea4e408d6b05402f",
    "theory/Deque/Deque.v": "5ff4fd4122c4372d2b1abd5f18e039e5e80d3b12c94887b56d24b1ed233d60bb"
  }
}