{"abstract":"A block request receives a forbidden partial allocation.","category":"Auction allocation rules","checks":6,"contract":"Process positive block sizes in submitted priority order. Accept a whole block if it fits remaining nonnegative capacity; otherwise skip it. Return accepted input indices.","contract_signature":"sizes, capacity","evaluation_group":"model-30e25206a0bfe007","failed_approach":"Stopping at the first oversized block prevents later smaller blocks from fitting.","family":"z-auction_matching-indivisible-block","id":"FA-12706","implementations":{"attempt":{"sha256":"eaccb06a32e6b826357d3beba68c97ccfc35dce0f5d6445ae5d611af44f42ee6","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(sizes, capacity):\n    result=[]\n    for i,size in enumerate(sizes):\n     if size>capacity: break\n     result.append(i); capacity-=size\n    return result\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('skip oversized first', solve([10+N,2,1], 3), [1,2])\ncheck('exact capacity', solve([2,3], 5), [0,1])\ncheck('later smaller fits', solve([3,4,1], 4), [0,2])\ncheck('no capacity', solve([1], 0), [])\ncheck('empty', solve([], 5), [])\ncheck('all too large', solve([5,6], 4), [])\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":"785cd756cf4547831fe460757b932b19e6289085313f560139f4fbda01db33a7","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(sizes, capacity):\n    result=[]\n    for i,size in enumerate(sizes):\n     if capacity>0:\n      result.append(i); capacity-=min(size,capacity)\n    return result\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('skip oversized first', solve([10+N,2,1], 3), [1,2])\ncheck('exact capacity', solve([2,3], 5), [0,1])\ncheck('later smaller fits', solve([3,4,1], 4), [0,2])\ncheck('no capacity', solve([1], 0), [])\ncheck('empty', solve([], 5), [])\ncheck('all too large', solve([5,6], 4), [])\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-indivisible-block","generated_at":"2026-09-29T14:38:59.429330+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.","root_cause":"Capacity is consumed by clipping an indivisible request.","sha256":"92e975c8d67374c1ab65a7921ea9b9a0271d82c33c343ed0b54a690a32c59bfc","title":"A block request receives a forbidden partial allocation · 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":38.997,"exit_code":1,"observations":[{"actual":[],"check":"skip oversized first","expected":[1,2],"passed":false},{"actual":[0,1],"check":"exact capacity","expected":[0,1],"passed":true},{"actual":[0],"check":"later smaller fits","expected":[0,2],"passed":false},{"actual":[],"check":"no capacity","expected":[],"passed":true},{"actual":[],"check":"empty","expected":[],"passed":true},{"actual":[],"check":"all too large","expected":[],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"skip oversized first\", \"actual\": [], \"expected\": [1, 2], \"passed\": false}, {\"check\": \"exact capacity\", \"actual\": [0, 1], \"expected\": [0, 1], \"passed\": true}, {\"check\": \"later smaller fits\", \"actual\": [0], \"expected\": [0, 2], \"passed\": false}, {\"check\": \"no capacity\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"empty\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"all too large\", \"actual\": [], \"expected\": [], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":41.737,"exit_code":1,"observations":[{"actual":[0],"check":"skip oversized first","expected":[1,2],"passed":false},{"actual":[0,1],"check":"exact capacity","expected":[0,1],"passed":true},{"actual":[0,1],"check":"later smaller fits","expected":[0,2],"passed":false},{"actual":[],"check":"no capacity","expected":[],"passed":true},{"actual":[],"check":"empty","expected":[],"passed":true},{"actual":[0],"check":"all too large","expected":[],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"skip oversized first\", \"actual\": [0], \"expected\": [1, 2], \"passed\": false}, {\"check\": \"exact capacity\", \"actual\": [0, 1], \"expected\": [0, 1], \"passed\": true}, {\"check\": \"later smaller fits\", \"actual\": [0, 1], \"expected\": [0, 2], \"passed\": false}, {\"check\": \"no capacity\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"empty\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"all too large\", \"actual\": [0], \"expected\": [], \"passed\": false}], \"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."}}