{"abstract":"Cut tiebreak removes every tied minimum.","category":"Tournament pairing rules","checks":6,"contract":"Synthetic model: Discard exactly one lowest opponent-score occurrence and sum the rest; empty and singleton lists return zero.","contract_signature":"scores","evaluation_group":"model-fc5036c5ca6b0dbc","failed_approach":"Deduplicating before cutting also drops repeated nonminimum scores.","family":"z-tournament_pairing-cut-one","id":"FA-12806","implementations":{"attempt":{"sha256":"5a509ffaece718d3aea93ab781d7aeb51ec83d1800035a9df30c2d9e8b6cdce2","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(scores):\n    return sum(sorted(set(scores))[1:])\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('tied minimum', solve([N,N,N+2]), 2*N+2)\ncheck('all equal', solve([N,N,N]), 2*N)\ncheck('singleton', solve([N]), 0)\ncheck('empty', solve([]), 0)\ncheck('negative', solve([-N,-N,2]), 2-N)\ncheck('distinct', solve([N,N+1,N+2]), 2*N+3)\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":"7ddffcd95ced636e87b1bb695ded78066bd836e8ee22039698a9075c25cf2e43","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(scores):\n    return sum(x for x in scores if x!=min(scores)) if scores else 0\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('tied minimum', solve([N,N,N+2]), 2*N+2)\ncheck('all equal', solve([N,N,N]), 2*N)\ncheck('singleton', solve([N]), 0)\ncheck('empty', solve([]), 0)\ncheck('negative', solve([-N,-N,2]), 2-N)\ncheck('distinct', solve([N,N+1,N+2]), 2*N+3)\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":"Controlled synthetic policy; does not implement an entire tournament system. 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-tournament_pairing-cut-one","generated_at":"2026-09-29T14:39:00.290894+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"Makes the stated pairing or standings policy executable without assuming any real federation rulebook.","root_cause":"Value-based filtering removes all minimum occurrences.","sha256":"06c3058a82f1e1b2dc4abb382466f23e2eec13907f1e4d107255502330e463ab","title":"Cut tiebreak removes every tied minimum · 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":42.728,"exit_code":1,"observations":[{"actual":3,"check":"tied minimum","expected":4,"passed":false},{"actual":0,"check":"all equal","expected":2,"passed":false},{"actual":0,"check":"singleton","expected":0,"passed":true},{"actual":0,"check":"empty","expected":0,"passed":true},{"actual":2,"check":"negative","expected":1,"passed":false},{"actual":5,"check":"distinct","expected":5,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"tied minimum\", \"actual\": 3, \"expected\": 4, \"passed\": false}, {\"check\": \"all equal\", \"actual\": 0, \"expected\": 2, \"passed\": false}, {\"check\": \"singleton\", \"actual\": 0, \"expected\": 0, \"passed\": true}, {\"check\": \"empty\", \"actual\": 0, \"expected\": 0, \"passed\": true}, {\"check\": \"negative\", \"actual\": 2, \"expected\": 1, \"passed\": false}, {\"check\": \"distinct\", \"actual\": 5, \"expected\": 5, \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":41.505,"exit_code":1,"observations":[{"actual":3,"check":"tied minimum","expected":4,"passed":false},{"actual":0,"check":"all equal","expected":2,"passed":false},{"actual":0,"check":"singleton","expected":0,"passed":true},{"actual":0,"check":"empty","expected":0,"passed":true},{"actual":2,"check":"negative","expected":1,"passed":false},{"actual":5,"check":"distinct","expected":5,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"tied minimum\", \"actual\": 3, \"expected\": 4, \"passed\": false}, {\"check\": \"all equal\", \"actual\": 0, \"expected\": 2, \"passed\": false}, {\"check\": \"singleton\", \"actual\": 0, \"expected\": 0, \"passed\": true}, {\"check\": \"empty\", \"actual\": 0, \"expected\": 0, \"passed\": true}, {\"check\": \"negative\", \"actual\": 2, \"expected\": 1, \"passed\": false}, {\"check\": \"distinct\", \"actual\": 5, \"expected\": 5, \"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."}}