{"abstract":"Full outer join marks equal-key residual failures as matched.","category":"Data systems","checks":7,"contract":"Execute a full outer join of [id,key,value] rows with equality on non-null keys and right.value>=left.value. Track right matches by physical position; failed residuals do not mark a row matched. Emit left-major pairs, then unmatched right rows.","contract_signature":"d","evaluation_group":"s3-data-systems-full-outer-match-flags","failed_approach":"Replacing the residual with a constant test still misclassifies matches.","family":"s3-data-systems-full-outer-match-flags-residual-match","id":"FA-45001","implementations":{"attempt":{"sha256":"f389d4ae0a444aa83b6051961c9b0e2f62cedc03ef04ba34ea0642adf5cab127","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(d):\n    try:\n        left,right=d\n        seen=set(); out=[]\n        for ident,key,value in left:\n            matched=False\n            for pos,(other,k,v) in enumerate(right):\n                if key is not None and k==key and v>=0:\n                    matched=True\n                    seen.add(pos)\n                    out.append([ident,other])\n            if not matched: out.append([ident,None])\n        for pos,(other,k,v) in enumerate(right):\n            if pos not in seen: out.append([None,other])\n        return out\n    except (IndexError, KeyError, ValueError, StopIteration) as exc:\n        return {\"representation_error\": type(exc).__name__}\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nif N == 1:\n    check('residual failure', solve([[[10, 'a', 2]], [[20, 'a', 1]]]), [[10, None], [None, 20]])\n    check('matched then unmatched', solve([[[10, 'a', 1], [11, 'b', 1]], [[20, 'a', 2]]]), [[10, 20], [11, None]])\n    check('null keys', solve([[[10, None, 1]], [[20, None, 1]]]), [[10, None], [None, 20]])\n    check('right unmatched', solve([[[10, 'a', 1]], [[20, 'a', 1], [21, 'b', 1]]]), [[10, 20], [None, 21]])\n    check('right physical duplicates', solve([[[10, 'a', 1]], [[20, 'a', 1], [20, 'a', 1]]]), [[10, 20], [10, 20]])\n    check('empty left', solve([[], [[20, 'a', 1]]]), [[None, 20]])\n    check('empty right', solve([[[10, 'a', 1]], []]), [[10, None]])\nelif N == 2:\n    check('residual failure', solve([[[10, 'a', 3]], [[20, 'a', 2]]]), [[10, None], [None, 20]])\n    check('matched then unmatched', solve([[[10, 'a', 2], [11, 'b', 2]], [[20, 'a', 3]]]), [[10, 20], [11, None]])\n    check('null keys', solve([[[10, None, 2]], [[20, None, 2]]]), [[10, None], [None, 20]])\n    check('right unmatched', solve([[[10, 'a', 2]], [[20, 'a', 2], [21, 'b', 2]]]), [[10, 20], [None, 21]])\n    check('right physical duplicates', solve([[[10, 'a', 2]], [[20, 'a', 2], [20, 'a', 2]]]), [[10, 20], [10, 20]])\n    check('empty left', solve([[], [[20, 'a', 2]]]), [[None, 20]])\n    check('empty right', solve([[[10, 'a', 2]], []]), [[10, None]])\nelif N == 3:\n    check('residual failure', solve([[[10, 'a', 4]], [[20, 'a', 3]]]), [[10, None], [None, 20]])\n    check('matched then unmatched', solve([[[10, 'a', 3], [11, 'b', 3]], [[20, 'a', 4]]]), [[10, 20], [11, None]])\n    check('null keys', solve([[[10, None, 3]], [[20, None, 3]]]), [[10, None], [None, 20]])\n    check('right unmatched', solve([[[10, 'a', 3]], [[20, 'a', 3], [21, 'b', 3]]]), [[10, 20], [None, 21]])\n    check('right physical duplicates', solve([[[10, 'a', 3]], [[20, 'a', 3], [20, 'a', 3]]]), [[10, 20], [10, 20]])\n    check('empty left', solve([[], [[20, 'a', 3]]]), [[None, 20]])\n    check('empty right', solve([[[10, 'a', 3]], []]), [[10, None]])\nelif N == 4:\n    check('residual failure', solve([[[10, 'a', 5]], [[20, 'a', 4]]]), [[10, None], [None, 20]])\n    check('matched then unmatched', solve([[[10, 'a', 4], [11, 'b', 4]], [[20, 'a', 5]]]), [[10, 20], [11, None]])\n    check('null keys', solve([[[10, None, 4]], [[20, None, 4]]]), [[10, None], [None, 20]])\n    check('right unmatched', solve([[[10, 'a', 4]], [[20, 'a', 4], [21, 'b', 4]]]), [[10, 20], [None, 21]])\n    check('right physical duplicates', solve([[[10, 'a', 4]], [[20, 'a', 4], [20, 'a', 4]]]), [[10, 20], [10, 20]])\n    check('empty left', solve([[], [[20, 'a', 4]]]), [[None, 20]])\n    check('empty right', solve([[[10, 'a', 4]], []]), [[10, None]])\nelif N == 5:\n    check('residual failure', solve([[[10, 'a', 6]], [[20, 'a', 5]]]), [[10, None], [None, 20]])\n    check('matched then unmatched', solve([[[10, 'a', 5], [11, 'b', 5]], [[20, 'a', 6]]]), [[10, 20], [11, None]])\n    check('null keys', solve([[[10, None, 5]], [[20, None, 5]]]), [[10, None], [None, 20]])\n    check('right unmatched', solve([[[10, 'a', 5]], [[20, 'a', 5], [21, 'b', 5]]]), [[10, 20], [None, 21]])\n    check('right physical duplicates', solve([[[10, 'a', 5]], [[20, 'a', 5], [20, 'a', 5]]]), [[10, 20], [10, 20]])\n    check('empty left', solve([[], [[20, 'a', 5]]]), [[None, 20]])\n    check('empty right', solve([[[10, 'a', 5]], []]), [[10, None]])\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":"ad3a1c6eda8a2b1ee693c7375421b3e148616ed5b035a44d3dbeddc2634e9a0d","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(d):\n    try:\n        left,right=d\n        seen=set(); out=[]\n        for ident,key,value in left:\n            matched=False\n            for pos,(other,k,v) in enumerate(right):\n                if key is not None and k==key:\n                    matched=True\n                    seen.add(pos)\n                    out.append([ident,other])\n            if not matched: out.append([ident,None])\n        for pos,(other,k,v) in enumerate(right):\n            if pos not in seen: out.append([None,other])\n        return out\n    except (IndexError, KeyError, ValueError, StopIteration) as exc:\n        return {\"representation_error\": type(exc).__name__}\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nif N == 1:\n    check('residual failure', solve([[[10, 'a', 2]], [[20, 'a', 1]]]), [[10, None], [None, 20]])\n    check('matched then unmatched', solve([[[10, 'a', 1], [11, 'b', 1]], [[20, 'a', 2]]]), [[10, 20], [11, None]])\n    check('null keys', solve([[[10, None, 1]], [[20, None, 1]]]), [[10, None], [None, 20]])\n    check('right unmatched', solve([[[10, 'a', 1]], [[20, 'a', 1], [21, 'b', 1]]]), [[10, 20], [None, 21]])\n    check('right physical duplicates', solve([[[10, 'a', 1]], [[20, 'a', 1], [20, 'a', 1]]]), [[10, 20], [10, 20]])\n    check('empty left', solve([[], [[20, 'a', 1]]]), [[None, 20]])\n    check('empty right', solve([[[10, 'a', 1]], []]), [[10, None]])\nelif N == 2:\n    check('residual failure', solve([[[10, 'a', 3]], [[20, 'a', 2]]]), [[10, None], [None, 20]])\n    check('matched then unmatched', solve([[[10, 'a', 2], [11, 'b', 2]], [[20, 'a', 3]]]), [[10, 20], [11, None]])\n    check('null keys', solve([[[10, None, 2]], [[20, None, 2]]]), [[10, None], [None, 20]])\n    check('right unmatched', solve([[[10, 'a', 2]], [[20, 'a', 2], [21, 'b', 2]]]), [[10, 20], [None, 21]])\n    check('right physical duplicates', solve([[[10, 'a', 2]], [[20, 'a', 2], [20, 'a', 2]]]), [[10, 20], [10, 20]])\n    check('empty left', solve([[], [[20, 'a', 2]]]), [[None, 20]])\n    check('empty right', solve([[[10, 'a', 2]], []]), [[10, None]])\nelif N == 3:\n    check('residual failure', solve([[[10, 'a', 4]], [[20, 'a', 3]]]), [[10, None], [None, 20]])\n    check('matched then unmatched', solve([[[10, 'a', 3], [11, 'b', 3]], [[20, 'a', 4]]]), [[10, 20], [11, None]])\n    check('null keys', solve([[[10, None, 3]], [[20, None, 3]]]), [[10, None], [None, 20]])\n    check('right unmatched', solve([[[10, 'a', 3]], [[20, 'a', 3], [21, 'b', 3]]]), [[10, 20], [None, 21]])\n    check('right physical duplicates', solve([[[10, 'a', 3]], [[20, 'a', 3], [20, 'a', 3]]]), [[10, 20], [10, 20]])\n    check('empty left', solve([[], [[20, 'a', 3]]]), [[None, 20]])\n    check('empty right', solve([[[10, 'a', 3]], []]), [[10, None]])\nelif N == 4:\n    check('residual failure', solve([[[10, 'a', 5]], [[20, 'a', 4]]]), [[10, None], [None, 20]])\n    check('matched then unmatched', solve([[[10, 'a', 4], [11, 'b', 4]], [[20, 'a', 5]]]), [[10, 20], [11, None]])\n    check('null keys', solve([[[10, None, 4]], [[20, None, 4]]]), [[10, None], [None, 20]])\n    check('right unmatched', solve([[[10, 'a', 4]], [[20, 'a', 4], [21, 'b', 4]]]), [[10, 20], [None, 21]])\n    check('right physical duplicates', solve([[[10, 'a', 4]], [[20, 'a', 4], [20, 'a', 4]]]), [[10, 20], [10, 20]])\n    check('empty left', solve([[], [[20, 'a', 4]]]), [[None, 20]])\n    check('empty right', solve([[[10, 'a', 4]], []]), [[10, None]])\nelif N == 5:\n    check('residual failure', solve([[[10, 'a', 6]], [[20, 'a', 5]]]), [[10, None], [None, 20]])\n    check('matched then unmatched', solve([[[10, 'a', 5], [11, 'b', 5]], [[20, 'a', 6]]]), [[10, 20], [11, None]])\n    check('null keys', solve([[[10, None, 5]], [[20, None, 5]]]), [[10, None], [None, 20]])\n    check('right unmatched', solve([[[10, 'a', 5]], [[20, 'a', 5], [21, 'b', 5]]]), [[10, 20], [None, 21]])\n    check('right physical duplicates', solve([[[10, 'a', 5]], [[20, 'a', 5], [20, 'a', 5]]]), [[10, 20], [10, 20]])\n    check('empty left', solve([[], [[20, 'a', 5]]]), [[None, 20]])\n    check('empty right', solve([[[10, 'a', 5]], []]), [[10, None]])\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 stipulated semantics over valid small inputs; no performance, concurrency, or production-engine conformance claim. 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":"s3-data-systems-full-outer-match-flags-residual-match","generated_at":"2026-09-29T14:44:17.961992+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A bounded deterministic data engine model makes representation and changelog faults reproducible.","root_cause":"full-outer-match-flags: Full outer join marks equal-key residual failures as matched.","sha256":"3cffaadf245987be400adc77a9c6a7f3a7137fd85f38b2b21c91fb38331134fa","title":"Full outer join marks equal-key residual failures as matched · 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":44.603,"exit_code":1,"observations":[{"actual":[[10,20]],"check":"residual failure","expected":[[10,null],[null,20]],"passed":false},{"actual":[[10,20],[11,null]],"check":"matched then unmatched","expected":[[10,20],[11,null]],"passed":true},{"actual":[[10,null],[null,20]],"check":"null keys","expected":[[10,null],[null,20]],"passed":true},{"actual":[[10,20],[null,21]],"check":"right unmatched","expected":[[10,20],[null,21]],"passed":true},{"actual":[[10,20],[10,20]],"check":"right physical duplicates","expected":[[10,20],[10,20]],"passed":true},{"actual":[[null,20]],"check":"empty left","expected":[[null,20]],"passed":true},{"actual":[[10,null]],"check":"empty right","expected":[[10,null]],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"residual failure\", \"actual\": [[10, 20]], \"expected\": [[10, null], [null, 20]], \"passed\": false}, {\"check\": \"matched then unmatched\", \"actual\": [[10, 20], [11, null]], \"expected\": [[10, 20], [11, null]], \"passed\": true}, {\"check\": \"null keys\", \"actual\": [[10, null], [null, 20]], \"expected\": [[10, null], [null, 20]], \"passed\": true}, {\"check\": \"right unmatched\", \"actual\": [[10, 20], [null, 21]], \"expected\": [[10, 20], [null, 21]], \"passed\": true}, {\"check\": \"right physical duplicates\", \"actual\": [[10, 20], [10, 20]], \"expected\": [[10, 20], [10, 20]], \"passed\": true}, {\"check\": \"empty left\", \"actual\": [[null, 20]], \"expected\": [[null, 20]], \"passed\": true}, {\"check\": \"empty right\", \"actual\": [[10, null]], \"expected\": [[10, null]], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":43.161,"exit_code":1,"observations":[{"actual":[[10,20]],"check":"residual failure","expected":[[10,null],[null,20]],"passed":false},{"actual":[[10,20],[11,null]],"check":"matched then unmatched","expected":[[10,20],[11,null]],"passed":true},{"actual":[[10,null],[null,20]],"check":"null keys","expected":[[10,null],[null,20]],"passed":true},{"actual":[[10,20],[null,21]],"check":"right unmatched","expected":[[10,20],[null,21]],"passed":true},{"actual":[[10,20],[10,20]],"check":"right physical duplicates","expected":[[10,20],[10,20]],"passed":true},{"actual":[[null,20]],"check":"empty left","expected":[[null,20]],"passed":true},{"actual":[[10,null]],"check":"empty right","expected":[[10,null]],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"residual failure\", \"actual\": [[10, 20]], \"expected\": [[10, null], [null, 20]], \"passed\": false}, {\"check\": \"matched then unmatched\", \"actual\": [[10, 20], [11, null]], \"expected\": [[10, 20], [11, null]], \"passed\": true}, {\"check\": \"null keys\", \"actual\": [[10, null], [null, 20]], \"expected\": [[10, null], [null, 20]], \"passed\": true}, {\"check\": \"right unmatched\", \"actual\": [[10, 20], [null, 21]], \"expected\": [[10, 20], [null, 21]], \"passed\": true}, {\"check\": \"right physical duplicates\", \"actual\": [[10, 20], [10, 20]], \"expected\": [[10, 20], [10, 20]], \"passed\": true}, {\"check\": \"empty left\", \"actual\": [[null, 20]], \"expected\": [[null, 20]], \"passed\": true}, {\"check\": \"empty right\", \"actual\": [[10, null]], \"expected\": [[10, null]], \"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."}}