{"abstract":"Repeated token occurrences satisfy too many optional query clauses.","category":"Search retrieval semantics","checks":7,"contract":"For unique optional query terms and nonnegative minimum, match if at least minimum query terms occur. Repetitions and unrelated terms do not count.","contract_signature":"tokens, clauses, minimum","evaluation_group":"model-5fb788a528e10e77","failed_approach":"Deduplicating document terms alone still counts unrelated document vocabulary.","family":"z-search-minimum-should-clause-count","id":"FA-11851","implementations":{"attempt":{"sha256":"5811b76c39f8d8599c8b20f97ee26c97172dc9e874fc9f11c830d2b9f6ebc988","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(tokens, clauses, minimum):\n    return len(set(tokens)) >= minimum\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\na='a'+str(N)\ncheck('repeated token', solve([a]* (N+2), [a,'b'],2), False)\ncheck('unrelated vocabulary', solve([a,'x','y'], [a,'b'],2), False)\ncheck('two clauses', solve([a,'b','b'],[a,'b'],2), True)\ncheck('zero minimum', solve([], [a],0), True)\ncheck('impossible minimum', solve([a,'b'],[a,'b'],3), False)\ncheck('empty query positive minimum', solve(['x'],[],1), False)\ncheck('one match', solve([a],[a,'b'],1), True)\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"},"broken":{"sha256":"10ed763bc4477a1fb0382c9d734edaef12b8a23e6224f1348b0c41c8e59e5431","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(tokens, clauses, minimum):\n    return sum(t in clauses for t in tokens) >= minimum\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\na='a'+str(N)\ncheck('repeated token', solve([a]* (N+2), [a,'b'],2), False)\ncheck('unrelated vocabulary', solve([a,'x','y'], [a,'b'],2), False)\ncheck('two clauses', solve([a,'b','b'],[a,'b'],2), True)\ncheck('zero minimum', solve([], [a],0), True)\ncheck('impossible minimum', solve([a,'b'],[a,'b'],3), False)\ncheck('empty query positive minimum', solve(['x'],[],1), False)\ncheck('one match', solve([a],[a,'b'],1), True)\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"}},"limitations":"Inputs are already tokenized or scored; this model makes no claim about production engine performance or linguistic analysis. This reproducer isolates one failure mechanism. Results cover the supplied fixtures. Variants within a family share a test contract and should remain grouped when constructing evaluation splits. Related mechanisms with a shared evaluation_group must also remain together; these controlled models are not independent production incidents.","method":"Deterministic executable model with adversarial boundary fixtures.","provenance":{"created_by":"Failure Map","dependencies":"Python standard library","family":"z-search-minimum-should-clause-count","generated_at":"2026-09-29T14:38:51.596300+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"An offline deterministic retrieval model isolates this search contract from tokenization, storage, and network behavior.","root_cause":"Term frequency is counted instead of satisfied optional clauses.","sha256":"0fe5ee36cc0d0b79b19e68afa8491d1b3bb80df0e2e87ac5ee9050d641f0f138","title":"Repeated token occurrences satisfy too many optional query clauses · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verified":true,"visibility":"public","verification":{"attempt":{"elapsed_ms":40.07,"exit_code":1,"observations":[{"actual":false,"check":"repeated token","expected":false,"passed":true},{"actual":true,"check":"unrelated vocabulary","expected":false,"passed":false},{"actual":true,"check":"two clauses","expected":true,"passed":true},{"actual":true,"check":"zero minimum","expected":true,"passed":true},{"actual":false,"check":"impossible minimum","expected":false,"passed":true},{"actual":true,"check":"empty query positive minimum","expected":false,"passed":false},{"actual":true,"check":"one match","expected":true,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"repeated token\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"unrelated vocabulary\", \"actual\": true, \"expected\": false, \"passed\": false}, {\"check\": \"two clauses\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"zero minimum\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"impossible minimum\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"empty query positive minimum\", \"actual\": true, \"expected\": false, \"passed\": false}, {\"check\": \"one match\", \"actual\": true, \"expected\": true, \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":39.639,"exit_code":1,"observations":[{"actual":true,"check":"repeated token","expected":false,"passed":false},{"actual":false,"check":"unrelated vocabulary","expected":false,"passed":true},{"actual":true,"check":"two clauses","expected":true,"passed":true},{"actual":true,"check":"zero minimum","expected":true,"passed":true},{"actual":false,"check":"impossible minimum","expected":false,"passed":true},{"actual":false,"check":"empty query positive minimum","expected":false,"passed":true},{"actual":true,"check":"one match","expected":true,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"repeated token\", \"actual\": true, \"expected\": false, \"passed\": false}, {\"check\": \"unrelated vocabulary\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"two clauses\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"zero minimum\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"impossible minimum\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"empty query positive minimum\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"one match\", \"actual\": true, \"expected\": true, \"passed\": true}], \"passed\": false}\n"}},"member_only":{"stages":["fixed"],"fields":["implementations.fixed","verification.fixed","harness","repair"],"note":"The verified repair, its recorded checks, the repair description, and the scoring harness are available to members."}}