{"abstract":"The operation returns a result or retained state that violates this contract: Return whether every left occurrence can be matched to a distinct equal right occurrence.","category":"Collection algebra","checks":6,"contract":"Return whether every left occurrence can be matched to a distinct equal right occurrence. Inputs are the finite Python values shown by the executable fixtures; no concurrent execution is assumed.","evaluation_group":"model-0633b355fb9169ca","failed_approach":"Strict set inclusion rejects equality and ignores count constraints.","family":"xr-multiset-subset-respects-counts","id":"FA-4311","implementations":{"attempt":{"sha256":"322ccb2ad3a2cd6b6d0e71fea09b6b34e5e206685db810f5f445f33265c8c2c6","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(x, y=None):\n    return set(x)<set(y)\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('both empty', solve([], []), True)\ncheck('empty right operand', solve(['a'], []), False)\ncheck('empty left operand', solve([], ['b']), True)\ncheck('overlap and multiplicity', solve(['b', 'a', 'b'], ['b', 'c', 'c']), False)\ncheck('equal bags are contained', solve(['a'], ['a']), True)\ncheck('membership does not imply enough copies', solve(['a','a'], ['a','b']), False)\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":"9ed53e79dbd50fcbd0d33653ab2076f3dddc98f33620f3fe2b64b7a648a1cfda","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(x, y=None):\n    return all(v in y for v in x)\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('both empty', solve([], []), True)\ncheck('empty right operand', solve(['a'], []), False)\ncheck('empty left operand', solve([], ['b']), True)\ncheck('overlap and multiplicity', solve(['b', 'a', 'b'], ['b', 'c', 'c']), False)\ncheck('equal bags are contained', solve(['a'], ['a']), True)\ncheck('membership does not imply enough copies', solve(['a','a'], ['a','b']), False)\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":"024121b0f25f555ffa1e8ccb9f5df750bddfd53cd7a348ce189a991afb37c2cf","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(x, y=None):\n    return all(x.count(v)<=y.count(v) for v in x)\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('both empty', solve([], []), True)\ncheck('empty right operand', solve(['a'], []), False)\ncheck('empty left operand', solve([], ['b']), True)\ncheck('overlap and multiplicity', solve(['b', 'a', 'b'], ['b', 'c', 'c']), False)\ncheck('equal bags are contained', solve(['a'], ['a']), True)\ncheck('membership does not imply enough copies', solve(['a','a'], ['a','b']), False)\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":" 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":"xr-multiset-subset-respects-counts","generated_at":"2026-09-29T14:37:37.823136+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A controlled local-runtime regression for collection APIs, language semantics, or ownership wrappers. Fixtures include boundary and interaction cases.","repair":"Return whether every left occurrence can be matched to a distinct equal right occurrence.","root_cause":"Membership tests do not reserve a distinct matching copy for each occurrence.","sha256":"770c9411400e8a2eafa1523e86dd5d898e1e5fa7c4ef807833e5e1996b8c20a4","title":"Multiset subset respects counts · case 01","variant":1,"variant_policy":"Five execution reruns of a fixed adversarial fixture suite; variant number does not alter semantic inputs.","verification":{"attempt":{"elapsed_ms":42.031,"exit_code":1,"observations":[{"actual":false,"check":"both empty","expected":true,"passed":false},{"actual":false,"check":"empty right operand","expected":false,"passed":true},{"actual":true,"check":"empty left operand","expected":true,"passed":true},{"actual":false,"check":"overlap and multiplicity","expected":false,"passed":true},{"actual":false,"check":"equal bags are contained","expected":true,"passed":false},{"actual":true,"check":"membership does not imply enough copies","expected":false,"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"both empty\", \"actual\": false, \"expected\": true, \"passed\": false}, {\"check\": \"empty right operand\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"empty left operand\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"overlap and multiplicity\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"equal bags are contained\", \"actual\": false, \"expected\": true, \"passed\": false}, {\"check\": \"membership does not imply enough copies\", \"actual\": true, \"expected\": false, \"passed\": false}], \"passed\": false}\n"},"broken":{"elapsed_ms":37.592,"exit_code":1,"observations":[{"actual":true,"check":"both empty","expected":true,"passed":true},{"actual":false,"check":"empty right operand","expected":false,"passed":true},{"actual":true,"check":"empty left operand","expected":true,"passed":true},{"actual":false,"check":"overlap and multiplicity","expected":false,"passed":true},{"actual":true,"check":"equal bags are contained","expected":true,"passed":true},{"actual":true,"check":"membership does not imply enough copies","expected":false,"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"both empty\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"empty right operand\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"empty left operand\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"overlap and multiplicity\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"equal bags are contained\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"membership does not imply enough copies\", \"actual\": true, \"expected\": false, \"passed\": false}], \"passed\": false}\n"},"fixed":{"elapsed_ms":114.497,"exit_code":0,"observations":[{"actual":true,"check":"both empty","expected":true,"passed":true},{"actual":false,"check":"empty right operand","expected":false,"passed":true},{"actual":true,"check":"empty left operand","expected":true,"passed":true},{"actual":false,"check":"overlap and multiplicity","expected":false,"passed":true},{"actual":true,"check":"equal bags are contained","expected":true,"passed":true},{"actual":false,"check":"membership does not imply enough copies","expected":false,"passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"both empty\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"empty right operand\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"empty left operand\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"overlap and multiplicity\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"equal bags are contained\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"membership does not imply enough copies\", \"actual\": false, \"expected\": false, \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}