{"abstract":"A minimum-fill order is rejected despite sufficient aggregate counterparties.","category":"Auction allocation rules","checks":6,"contract":"For a buy size, minimum fill and already-price-compatible opposing sizes, aggregate available size; execute min(size,total) only if it is at least minimum, otherwise zero. Size >= minimum >=1; opposing sizes positive.","evaluation_group":"model-adc77e15cc1bc14a","failed_approach":"Ignoring the minimum entirely permits a forbidden small execution.","family":"z-auction_matching-minimum-execution","id":"FA-12736","implementations":{"attempt":{"sha256":"10c2925f48f7bc10cf94776a9fb724e87e2fedf00b40041cb6f20ad256706b8b","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(size, minimum, opposing):\n    return min(size,sum(opposing))\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('aggregate meets minimum', solve(10+N, 5, [2,3]), 5)\ncheck('below minimum', solve(10, 5, [2,2]), 0)\ncheck('one adequate opponent', solve(10, 5, [7]), 7)\ncheck('empty book', solve(10, 5, []), 0)\ncheck('cap requested size', solve(6, 5, [4,4]), 6)\ncheck('exact requested minimum', solve(5, 5, [2,3,9]), 5)\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":"a0dfe254d49cc7c951f286521cc6550847a59e9c1f3f92cdb6c907402573c71c","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(size, minimum, opposing):\n    return min(size,sum(q for q in opposing if q>=minimum))\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('aggregate meets minimum', solve(10+N, 5, [2,3]), 5)\ncheck('below minimum', solve(10, 5, [2,2]), 0)\ncheck('one adequate opponent', solve(10, 5, [7]), 7)\ncheck('empty book', solve(10, 5, []), 0)\ncheck('cap requested size', solve(6, 5, [4,4]), 6)\ncheck('exact requested minimum', solve(5, 5, [2,3,9]), 5)\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"},"fixed":{"sha256":"798c90a077687b497ef96c65653ab5c95911462ffd8a11c7c581f9f3fa6740f2","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(size, minimum, opposing):\n    amount=min(size,sum(opposing))\n    return amount if amount>=minimum else 0\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('aggregate meets minimum', solve(10+N, 5, [2,3]), 5)\ncheck('below minimum', solve(10, 5, [2,2]), 0)\ncheck('one adequate opponent', solve(10, 5, [7]), 7)\ncheck('empty book', solve(10, 5, []), 0)\ncheck('cap requested size', solve(6, 5, [4,4]), 6)\ncheck('exact requested minimum', solve(5, 5, [2,3,9]), 5)\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":"Offline toy model with explicit integer inputs; no strategic behavior or real market execution. 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-auction_matching-minimum-execution","generated_at":"2026-09-29T14:38:59.606433+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"Deterministic teaching model for reviewing auction allocation software; not a representation of any venue or financial advice.","repair":"Implement the stated toy allocation contract directly: For a buy size, minimum fill and already-price-compatible opposing sizes, aggregate available size; execute min(size,total) only if it is at least minimum, otherwise zero. Size >= minimum >=1; opposing sizes positive.","root_cause":"Minimum execution size is applied to each opposing order separately.","sha256":"df10215c740dadd244b80aaca73c561dd8d6d7e813de7545d4228ad9cb5268ee","title":"A minimum-fill order is rejected despite sufficient aggregate counterparties · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":45.116,"exit_code":1,"observations":[{"actual":5,"check":"aggregate meets minimum","expected":5,"passed":true},{"actual":4,"check":"below minimum","expected":0,"passed":false},{"actual":7,"check":"one adequate opponent","expected":7,"passed":true},{"actual":0,"check":"empty book","expected":0,"passed":true},{"actual":6,"check":"cap requested size","expected":6,"passed":true},{"actual":5,"check":"exact requested minimum","expected":5,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"aggregate meets minimum\", \"actual\": 5, \"expected\": 5, \"passed\": true}, {\"check\": \"below minimum\", \"actual\": 4, \"expected\": 0, \"passed\": false}, {\"check\": \"one adequate opponent\", \"actual\": 7, \"expected\": 7, \"passed\": true}, {\"check\": \"empty book\", \"actual\": 0, \"expected\": 0, \"passed\": true}, {\"check\": \"cap requested size\", \"actual\": 6, \"expected\": 6, \"passed\": true}, {\"check\": \"exact requested minimum\", \"actual\": 5, \"expected\": 5, \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":40.705,"exit_code":1,"observations":[{"actual":0,"check":"aggregate meets minimum","expected":5,"passed":false},{"actual":0,"check":"below minimum","expected":0,"passed":true},{"actual":7,"check":"one adequate opponent","expected":7,"passed":true},{"actual":0,"check":"empty book","expected":0,"passed":true},{"actual":0,"check":"cap requested size","expected":6,"passed":false},{"actual":5,"check":"exact requested minimum","expected":5,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"aggregate meets minimum\", \"actual\": 0, \"expected\": 5, \"passed\": false}, {\"check\": \"below minimum\", \"actual\": 0, \"expected\": 0, \"passed\": true}, {\"check\": \"one adequate opponent\", \"actual\": 7, \"expected\": 7, \"passed\": true}, {\"check\": \"empty book\", \"actual\": 0, \"expected\": 0, \"passed\": true}, {\"check\": \"cap requested size\", \"actual\": 0, \"expected\": 6, \"passed\": false}, {\"check\": \"exact requested minimum\", \"actual\": 5, \"expected\": 5, \"passed\": true}], \"passed\": false}\n"},"fixed":{"elapsed_ms":43.209,"exit_code":0,"observations":[{"actual":5,"check":"aggregate meets minimum","expected":5,"passed":true},{"actual":0,"check":"below minimum","expected":0,"passed":true},{"actual":7,"check":"one adequate opponent","expected":7,"passed":true},{"actual":0,"check":"empty book","expected":0,"passed":true},{"actual":6,"check":"cap requested size","expected":6,"passed":true},{"actual":5,"check":"exact requested minimum","expected":5,"passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"aggregate meets minimum\", \"actual\": 5, \"expected\": 5, \"passed\": true}, {\"check\": \"below minimum\", \"actual\": 0, \"expected\": 0, \"passed\": true}, {\"check\": \"one adequate opponent\", \"actual\": 7, \"expected\": 7, \"passed\": true}, {\"check\": \"empty book\", \"actual\": 0, \"expected\": 0, \"passed\": true}, {\"check\": \"cap requested size\", \"actual\": 6, \"expected\": 6, \"passed\": true}, {\"check\": \"exact requested minimum\", \"actual\": 5, \"expected\": 5, \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}