FAILURE MAP
← Case archive

FA-56526 / Auction allocation rules / Open access

Package conditions: substitute collision · case 01

Substitute sets may deliver two mutually substitutable items.

Verified by executionVariant 1 · 10 checks per implementationDownload source bundle ↓JSON ↗

ROOT CAUSE

Substitute sets may deliver two mutually substitutable items.

THE FAILURE

Substitute sets may deliver two mutually substitutable items.

Unsuccessful approach: The attempted repair uses all(not set(a)&set(x["won"]) for a in x["substitutes"]); the explicit regression cases demonstrate that this still violates the stipulated auction rule.

Case contract

Auction package certification operates on item sets, declared item quantities and a dependency graph already known acyclic. It reports whether a proposed award respects must-link, excludes, prerequisites, lots offered, exact package quantities, and a seller consent rule. All package item identifiers are strings. Named decision substitute-collision: Permit at most one awarded item from each substitute set.

Why this case matters

Offline administrative auction model for software failure analysis.

1 / The failure

Exit 1
"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(x):
    v0 = not set(x["won"])&set(x["required"]) or set(x["required"])<=set(x["won"])
    v1 = not set(x["won"])&set(x["forbidden"])
    v2 = set(x["won"])<=set(x["available"])
    v3 = all(set(x["prerequisites"].get(i,[]))<=set(x["won"]) for i in x["won"])
    v4 = all(x["counts"].get(i,0)==q for i,q in x["wanted"].items())
    v5 = sum(set(a)<=set(x["won"]) for a in x["alternatives"])<=1
    v6 = set(x["won"])&set(x["seller_items"])<=set(x["consents"])
    v7 = True
    v8 = set(x["split"])<=set(x["divisible"])
    v9 = not set(x["won"])&set(x["previous"])
    return {'must-link-completeness':v0,'negative-package-clause':v1,'offered-inventory':v2,'dependency-closure':v3,'exact-quantity-contract':v4,'alternative-activation':v5,'seller-consent-scope':v6,'substitute-collision':v7,'divisibility-certificate':v8,'prior-package-encumbrance':v9}
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
fixtures = [('blocked bundle', {'won': ['A', 'C'], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [False, False, False, False, False]), ('two alternatives', {'won': ['A', 'B', 'C'], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [False, False, False, False, False]), ('normal contract', {'won': ['A', 'B'], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [True, True, True, True, True]), ('partial exclusion set', {'won': ['A', 'B'], 'required': ['A', 'B'], 'forbidden': ['B', 'C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [True, True, True, True, True]), ('multi prerequisite', {'won': ['A', 'B'], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A', 'C']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [True, True, True, True, True]), ('mixed split certificate', {'won': ['A', 'B'], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['A', 'B'], 'previous': ['C']}, [True, True, True, True, True]), ('nothing awarded', {'won': [], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [True, True, True, True, True]), ('partial bundle', {'won': ['A'], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [True, True, True, True, True]), ('unoffered item', {'won': ['D'], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [True, True, True, True, True]), ('full consent', {'won': ['A', 'B'], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A', 'B'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [True, True, True, True, True])]
def vary(value):
 if type(value) is int: return value*N
 if isinstance(value,list): return [vary(v) for v in value]
 if isinstance(value,dict): return {k:(v if k in ['count', 'delivery_index', 'disputed', 'maximum_set', 'minimum_set', 'stage', 'threshold', 'waived'] else vary(v)) for k,v in value.items()}
 return value
for label, request, expected in fixtures:
 check(label, solve(vary(request))['substitute-collision'], expected[N-1])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
Boundary fixtureActualExpectedOutcome
blocked bundleTrueFalseFailed
two alternativesTrueFalseFailed
normal contractTrueTruePassed
partial exclusion setTrueTruePassed
multi prerequisiteTrueTruePassed
mixed split certificateTrueTruePassed
nothing awardedTrueTruePassed
partial bundleTrueTruePassed
unoffered itemTrueTruePassed
full consentTrueTruePassed

SHA-256 / e6c68ad787379e5c1e05d5182184fb7c817fdc94b9b920a1217ded313eec6490

2 / The unsuccessful fix

Exit 1
"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(x):
    v0 = not set(x["won"])&set(x["required"]) or set(x["required"])<=set(x["won"])
    v1 = not set(x["won"])&set(x["forbidden"])
    v2 = set(x["won"])<=set(x["available"])
    v3 = all(set(x["prerequisites"].get(i,[]))<=set(x["won"]) for i in x["won"])
    v4 = all(x["counts"].get(i,0)==q for i,q in x["wanted"].items())
    v5 = sum(set(a)<=set(x["won"]) for a in x["alternatives"])<=1
    v6 = set(x["won"])&set(x["seller_items"])<=set(x["consents"])
    v7 = all(not set(a)&set(x["won"]) for a in x["substitutes"])
    v8 = set(x["split"])<=set(x["divisible"])
    v9 = not set(x["won"])&set(x["previous"])
    return {'must-link-completeness':v0,'negative-package-clause':v1,'offered-inventory':v2,'dependency-closure':v3,'exact-quantity-contract':v4,'alternative-activation':v5,'seller-consent-scope':v6,'substitute-collision':v7,'divisibility-certificate':v8,'prior-package-encumbrance':v9}
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
fixtures = [('blocked bundle', {'won': ['A', 'C'], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [False, False, False, False, False]), ('two alternatives', {'won': ['A', 'B', 'C'], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [False, False, False, False, False]), ('normal contract', {'won': ['A', 'B'], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [True, True, True, True, True]), ('partial exclusion set', {'won': ['A', 'B'], 'required': ['A', 'B'], 'forbidden': ['B', 'C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [True, True, True, True, True]), ('multi prerequisite', {'won': ['A', 'B'], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A', 'C']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [True, True, True, True, True]), ('mixed split certificate', {'won': ['A', 'B'], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['A', 'B'], 'previous': ['C']}, [True, True, True, True, True]), ('nothing awarded', {'won': [], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [True, True, True, True, True]), ('partial bundle', {'won': ['A'], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [True, True, True, True, True]), ('unoffered item', {'won': ['D'], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [True, True, True, True, True]), ('full consent', {'won': ['A', 'B'], 'required': ['A', 'B'], 'forbidden': ['C'], 'available': ['A', 'B', 'C'], 'prerequisites': {'B': ['A'], 'C': ['B']}, 'counts': {'A': 2, 'B': 1}, 'wanted': {'A': 2, 'B': 1}, 'alternatives': [['A', 'B'], ['C']], 'consents': ['A', 'B'], 'seller_items': ['A', 'B'], 'substitutes': [['A', 'C']], 'divisible': ['A'], 'split': ['B'], 'previous': ['C']}, [True, True, True, True, True])]
def vary(value):
 if type(value) is int: return value*N
 if isinstance(value,list): return [vary(v) for v in value]
 if isinstance(value,dict): return {k:(v if k in ['count', 'delivery_index', 'disputed', 'maximum_set', 'minimum_set', 'stage', 'threshold', 'waived'] else vary(v)) for k,v in value.items()}
 return value
for label, request, expected in fixtures:
 check(label, solve(vary(request))['substitute-collision'], expected[N-1])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
Boundary fixtureActualExpectedOutcome
blocked bundleFalseFalsePassed
two alternativesFalseFalsePassed
normal contractFalseTrueFailed
partial exclusion setFalseTrueFailed
multi prerequisiteFalseTrueFailed
mixed split certificateFalseTrueFailed
nothing awardedTrueTruePassed
partial bundleFalseTrueFailed
unoffered itemTrueTruePassed
full consentFalseTrueFailed

SHA-256 / a77c7ac7ab679f20454e24bc4677a001fd2b46edad287a6a2b1d9d20145b99bb

HELD IN THE MEMBER ARCHIVE

The verified repair and its recorded checks are member-only.

This mechanism has 10 recorded checks per implementation. The open-access tier publishes the failure and the unsuccessful fix; the repaired source that passes every check, and the observations that prove it, are available to members.

Every case sharing this mechanism uses the same contract and the same repair, so this one record is held back for all of them.

Member access is invitation-based. Sign in with your invited account to inspect the repair.

Sign in to the archive ↗

Verification & scope

Stipulated toy auction rules, not a venue specification, financial advice, optimization claim, or live trading implementation. Nonnegative integer inputs and internally aligned list fields only. 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.

Observations recorded using Python 3.12.14 at 2026-09-29T14:46:07.894844+00:00.

Case digest / 07fc88a86b742e32100a6f463b95a93060b8f2a146e5ee3a7e0a4854faad3d1a