broken_source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    a_end = r['a'] + r['qa']
    b_end = r['b'] + r['qb']
    compatible = True
    low = max(r['a'],r['b'])
    high = min(a_end,b_end)
    overlap = compatible and low < high
    definite_before = compatible and a_end <= r['b']
    possible_before = compatible and r['a'] < b_end
    equal = compatible and r['a'] == r['b'] and r['qa'] == r['qb']
    contains = r['a'] <= r['query'] < a_end
    return [None if not overlap else [low,high],definite_before,possible_before,equal,contains, None if not compatible else [min(r['a'],r['b']),max(a_end,b_end)]]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'a': 10, 'qa': 10, 'b': 15, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}), [[15, 20], False, True, False, True, [10, 35]])
check('fixture 2', solve({'a': 10, 'qa': 10, 'b': 20, 'qb': 2, 'query': 20, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 22]])
check('fixture 3', solve({'a': 10, 'qa': 10, 'b': 10, 'qb': 2, 'query': 15, 'domain_a': 'utc', 'domain_b': 'utc'}), [[10, 12], False, True, False, True, [10, 20]])
check('fixture 4', solve({'a': 20, 'qa': 2, 'b': 10, 'qb': 10, 'query': 21, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [10, 22]])
check('fixture 5', solve({'a': 0, 'qa': 1, 'b': 0, 'qb': 1, 'query': 0, 'domain_a': 'mono', 'domain_b': 'mono'}), [[0, 1], False, True, True, True, [0, 1]])
check('fixture 6', solve({'a': 0, 'qa': 10, 'b': 2, 'qb': 3, 'query': 2, 'domain_a': 'a', 'domain_b': 'b'}), [None, False, False, False, True, None])
check('fixture 7', solve({'a': -10, 'qa': 5, 'b': -8, 'qb': 1, 'query': -5, 'domain_a': 'utc', 'domain_b': 'utc'}), [[-8, -7], False, True, False, False, [-10, -5]])
check('fixture 8', solve({'a': 0, 'qa': 3, 'b': 2, 'qb': 1, 'query': 1, 'domain_a': 'utc', 'domain_b': 'utc'}), [[2, 3], False, True, False, True, [0, 3]])
check('fixture 9', solve({'a': 10, 'qa': 1, 'b': 20, 'qb': 1, 'query': 11, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 21]])
check('fixture 10', solve({'a': 0, 'qa': 1, 'b': -1, 'qb': 1, 'query': 0, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [-1, 1]])
variant = [({'a': 10, 'qa': 10, 'b': 16, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[16, 20], False, True, False, True, [10, 36]]), ({'a': 10, 'qa': 10, 'b': 17, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[17, 20], False, True, False, True, [10, 37]]), ({'a': 10, 'qa': 10, 'b': 18, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[18, 20], False, True, False, True, [10, 38]]), ({'a': 10, 'qa': 10, 'b': 19, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[19, 20], False, True, False, True, [10, 39]]), ({'a': 10, 'qa': 10, 'b': 20, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [None, True, True, False, True, [10, 40]])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    a_end = r['a'] + r['qa']
    b_end = r['b'] + r['qb']
    compatible = r['domain_a'] is r['domain_b'] and r['domain_a']=='utc'
    low = max(r['a'],r['b'])
    high = min(a_end,b_end)
    overlap = compatible and low < high
    definite_before = compatible and a_end <= r['b']
    possible_before = compatible and r['a'] < b_end
    equal = compatible and r['a'] == r['b'] and r['qa'] == r['qb']
    contains = r['a'] <= r['query'] < a_end
    return [None if not overlap else [low,high],definite_before,possible_before,equal,contains, None if not compatible else [min(r['a'],r['b']),max(a_end,b_end)]]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'a': 10, 'qa': 10, 'b': 15, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}), [[15, 20], False, True, False, True, [10, 35]])
check('fixture 2', solve({'a': 10, 'qa': 10, 'b': 20, 'qb': 2, 'query': 20, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 22]])
check('fixture 3', solve({'a': 10, 'qa': 10, 'b': 10, 'qb': 2, 'query': 15, 'domain_a': 'utc', 'domain_b': 'utc'}), [[10, 12], False, True, False, True, [10, 20]])
check('fixture 4', solve({'a': 20, 'qa': 2, 'b': 10, 'qb': 10, 'query': 21, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [10, 22]])
check('fixture 5', solve({'a': 0, 'qa': 1, 'b': 0, 'qb': 1, 'query': 0, 'domain_a': 'mono', 'domain_b': 'mono'}), [[0, 1], False, True, True, True, [0, 1]])
check('fixture 6', solve({'a': 0, 'qa': 10, 'b': 2, 'qb': 3, 'query': 2, 'domain_a': 'a', 'domain_b': 'b'}), [None, False, False, False, True, None])
check('fixture 7', solve({'a': -10, 'qa': 5, 'b': -8, 'qb': 1, 'query': -5, 'domain_a': 'utc', 'domain_b': 'utc'}), [[-8, -7], False, True, False, False, [-10, -5]])
check('fixture 8', solve({'a': 0, 'qa': 3, 'b': 2, 'qb': 1, 'query': 1, 'domain_a': 'utc', 'domain_b': 'utc'}), [[2, 3], False, True, False, True, [0, 3]])
check('fixture 9', solve({'a': 10, 'qa': 1, 'b': 20, 'qb': 1, 'query': 11, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 21]])
check('fixture 10', solve({'a': 0, 'qa': 1, 'b': -1, 'qb': 1, 'query': 0, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [-1, 1]])
variant = [({'a': 10, 'qa': 10, 'b': 16, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[16, 20], False, True, False, True, [10, 36]]), ({'a': 10, 'qa': 10, 'b': 17, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[17, 20], False, True, False, True, [10, 37]]), ({'a': 10, 'qa': 10, 'b': 18, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[18, 20], False, True, False, True, [10, 38]]), ({'a': 10, 'qa': 10, 'b': 19, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[19, 20], False, True, False, True, [10, 39]]), ({'a': 10, 'qa': 10, 'b': 20, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [None, True, True, False, True, [10, 40]])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

prompt:
The decoded time state disagrees with the explicit regression oracle for compatible.

A timestamp rounded down to resolution q represents half-open [stamp,stamp+q). Preserve domain tag; q positive. Comparing two buckets yields exact intersection and possible/definite-before relations, equality of represented sets and union envelope. Query membership is half-open. This model handles precision buckets, not point timestamps.

split: open-access


broken_source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    a_end = r['a'] + r['qa']
    b_end = r['b'] + r['qb']
    compatible = r['domain_a'] == r['domain_b']
    low = min(r['a'],r['b'])
    high = min(a_end,b_end)
    overlap = compatible and low < high
    definite_before = compatible and a_end <= r['b']
    possible_before = compatible and r['a'] < b_end
    equal = compatible and r['a'] == r['b'] and r['qa'] == r['qb']
    contains = r['a'] <= r['query'] < a_end
    return [None if not overlap else [low,high],definite_before,possible_before,equal,contains, None if not compatible else [min(r['a'],r['b']),max(a_end,b_end)]]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'a': 10, 'qa': 10, 'b': 15, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}), [[15, 20], False, True, False, True, [10, 35]])
check('fixture 2', solve({'a': 10, 'qa': 10, 'b': 20, 'qb': 2, 'query': 20, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 22]])
check('fixture 3', solve({'a': 10, 'qa': 10, 'b': 10, 'qb': 2, 'query': 15, 'domain_a': 'utc', 'domain_b': 'utc'}), [[10, 12], False, True, False, True, [10, 20]])
check('fixture 4', solve({'a': 20, 'qa': 2, 'b': 10, 'qb': 10, 'query': 21, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [10, 22]])
check('fixture 5', solve({'a': 0, 'qa': 1, 'b': 0, 'qb': 1, 'query': 0, 'domain_a': 'mono', 'domain_b': 'mono'}), [[0, 1], False, True, True, True, [0, 1]])
check('fixture 6', solve({'a': 0, 'qa': 10, 'b': 2, 'qb': 3, 'query': 2, 'domain_a': 'a', 'domain_b': 'b'}), [None, False, False, False, True, None])
check('fixture 7', solve({'a': -10, 'qa': 5, 'b': -8, 'qb': 1, 'query': -5, 'domain_a': 'utc', 'domain_b': 'utc'}), [[-8, -7], False, True, False, False, [-10, -5]])
check('fixture 8', solve({'a': 0, 'qa': 3, 'b': 2, 'qb': 1, 'query': 1, 'domain_a': 'utc', 'domain_b': 'utc'}), [[2, 3], False, True, False, True, [0, 3]])
check('fixture 9', solve({'a': 10, 'qa': 1, 'b': 20, 'qb': 1, 'query': 11, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 21]])
check('fixture 10', solve({'a': 0, 'qa': 1, 'b': -1, 'qb': 1, 'query': 0, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [-1, 1]])
variant = [({'a': 10, 'qa': 10, 'b': 16, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[16, 20], False, True, False, True, [10, 36]]), ({'a': 10, 'qa': 10, 'b': 17, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[17, 20], False, True, False, True, [10, 37]]), ({'a': 10, 'qa': 10, 'b': 18, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[18, 20], False, True, False, True, [10, 38]]), ({'a': 10, 'qa': 10, 'b': 19, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[19, 20], False, True, False, True, [10, 39]]), ({'a': 10, 'qa': 10, 'b': 20, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [None, True, True, False, True, [10, 40]])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

meaning: Fixture-count band, not measured model difficulty

deps: stdlib

source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    a_end = r['a'] + r['qa']
    b_end = r['b'] + r['qb']
    compatible = r['domain_a'] == r['domain_b']
    low = r['a']
    high = min(a_end,b_end)
    overlap = compatible and low < high
    definite_before = compatible and a_end <= r['b']
    possible_before = compatible and r['a'] < b_end
    equal = compatible and r['a'] == r['b'] and r['qa'] == r['qb']
    contains = r['a'] <= r['query'] < a_end
    return [None if not overlap else [low,high],definite_before,possible_before,equal,contains, None if not compatible else [min(r['a'],r['b']),max(a_end,b_end)]]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'a': 10, 'qa': 10, 'b': 15, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}), [[15, 20], False, True, False, True, [10, 35]])
check('fixture 2', solve({'a': 10, 'qa': 10, 'b': 20, 'qb': 2, 'query': 20, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 22]])
check('fixture 3', solve({'a': 10, 'qa': 10, 'b': 10, 'qb': 2, 'query': 15, 'domain_a': 'utc', 'domain_b': 'utc'}), [[10, 12], False, True, False, True, [10, 20]])
check('fixture 4', solve({'a': 20, 'qa': 2, 'b': 10, 'qb': 10, 'query': 21, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [10, 22]])
check('fixture 5', solve({'a': 0, 'qa': 1, 'b': 0, 'qb': 1, 'query': 0, 'domain_a': 'mono', 'domain_b': 'mono'}), [[0, 1], False, True, True, True, [0, 1]])
check('fixture 6', solve({'a': 0, 'qa': 10, 'b': 2, 'qb': 3, 'query': 2, 'domain_a': 'a', 'domain_b': 'b'}), [None, False, False, False, True, None])
check('fixture 7', solve({'a': -10, 'qa': 5, 'b': -8, 'qb': 1, 'query': -5, 'domain_a': 'utc', 'domain_b': 'utc'}), [[-8, -7], False, True, False, False, [-10, -5]])
check('fixture 8', solve({'a': 0, 'qa': 3, 'b': 2, 'qb': 1, 'query': 1, 'domain_a': 'utc', 'domain_b': 'utc'}), [[2, 3], False, True, False, True, [0, 3]])
check('fixture 9', solve({'a': 10, 'qa': 1, 'b': 20, 'qb': 1, 'query': 11, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 21]])
check('fixture 10', solve({'a': 0, 'qa': 1, 'b': -1, 'qb': 1, 'query': 0, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [-1, 1]])
variant = [({'a': 10, 'qa': 10, 'b': 16, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[16, 20], False, True, False, True, [10, 36]]), ({'a': 10, 'qa': 10, 'b': 17, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[17, 20], False, True, False, True, [10, 37]]), ({'a': 10, 'qa': 10, 'b': 18, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[18, 20], False, True, False, True, [10, 38]]), ({'a': 10, 'qa': 10, 'b': 19, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[19, 20], False, True, False, True, [10, 39]]), ({'a': 10, 'qa': 10, 'b': 20, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [None, True, True, False, True, [10, 40]])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

prompt:
The decoded time state disagrees with the explicit regression oracle for low.

A timestamp rounded down to resolution q represents half-open [stamp,stamp+q). Preserve domain tag; q positive. Comparing two buckets yields exact intersection and possible/definite-before relations, equality of represented sets and union envelope. Query membership is half-open. This model handles precision buckets, not point timestamps.

split: open-access


broken_source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    a_end = r['a'] + r['qa']
    b_end = r['b'] + r['qb']
    compatible = r['domain_a'] == r['domain_b']
    low = max(r['a'],r['b'])
    high = max(a_end,b_end)
    overlap = compatible and low < high
    definite_before = compatible and a_end <= r['b']
    possible_before = compatible and r['a'] < b_end
    equal = compatible and r['a'] == r['b'] and r['qa'] == r['qb']
    contains = r['a'] <= r['query'] < a_end
    return [None if not overlap else [low,high],definite_before,possible_before,equal,contains, None if not compatible else [min(r['a'],r['b']),max(a_end,b_end)]]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'a': 10, 'qa': 10, 'b': 15, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}), [[15, 20], False, True, False, True, [10, 35]])
check('fixture 2', solve({'a': 10, 'qa': 10, 'b': 20, 'qb': 2, 'query': 20, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 22]])
check('fixture 3', solve({'a': 10, 'qa': 10, 'b': 10, 'qb': 2, 'query': 15, 'domain_a': 'utc', 'domain_b': 'utc'}), [[10, 12], False, True, False, True, [10, 20]])
check('fixture 4', solve({'a': 20, 'qa': 2, 'b': 10, 'qb': 10, 'query': 21, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [10, 22]])
check('fixture 5', solve({'a': 0, 'qa': 1, 'b': 0, 'qb': 1, 'query': 0, 'domain_a': 'mono', 'domain_b': 'mono'}), [[0, 1], False, True, True, True, [0, 1]])
check('fixture 6', solve({'a': 0, 'qa': 10, 'b': 2, 'qb': 3, 'query': 2, 'domain_a': 'a', 'domain_b': 'b'}), [None, False, False, False, True, None])
check('fixture 7', solve({'a': -10, 'qa': 5, 'b': -8, 'qb': 1, 'query': -5, 'domain_a': 'utc', 'domain_b': 'utc'}), [[-8, -7], False, True, False, False, [-10, -5]])
check('fixture 8', solve({'a': 0, 'qa': 3, 'b': 2, 'qb': 1, 'query': 1, 'domain_a': 'utc', 'domain_b': 'utc'}), [[2, 3], False, True, False, True, [0, 3]])
check('fixture 9', solve({'a': 10, 'qa': 1, 'b': 20, 'qb': 1, 'query': 11, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 21]])
check('fixture 10', solve({'a': 0, 'qa': 1, 'b': -1, 'qb': 1, 'query': 0, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [-1, 1]])
variant = [({'a': 10, 'qa': 10, 'b': 16, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[16, 20], False, True, False, True, [10, 36]]), ({'a': 10, 'qa': 10, 'b': 17, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[17, 20], False, True, False, True, [10, 37]]), ({'a': 10, 'qa': 10, 'b': 18, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[18, 20], False, True, False, True, [10, 38]]), ({'a': 10, 'qa': 10, 'b': 19, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[19, 20], False, True, False, True, [10, 39]]), ({'a': 10, 'qa': 10, 'b': 20, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [None, True, True, False, True, [10, 40]])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    a_end = r['a'] + r['qa']
    b_end = r['b'] + r['qb']
    compatible = r['domain_a'] == r['domain_b']
    low = max(r['a'],r['b'])
    high = a_end
    overlap = compatible and low < high
    definite_before = compatible and a_end <= r['b']
    possible_before = compatible and r['a'] < b_end
    equal = compatible and r['a'] == r['b'] and r['qa'] == r['qb']
    contains = r['a'] <= r['query'] < a_end
    return [None if not overlap else [low,high],definite_before,possible_before,equal,contains, None if not compatible else [min(r['a'],r['b']),max(a_end,b_end)]]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'a': 10, 'qa': 10, 'b': 15, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}), [[15, 20], False, True, False, True, [10, 35]])
check('fixture 2', solve({'a': 10, 'qa': 10, 'b': 20, 'qb': 2, 'query': 20, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 22]])
check('fixture 3', solve({'a': 10, 'qa': 10, 'b': 10, 'qb': 2, 'query': 15, 'domain_a': 'utc', 'domain_b': 'utc'}), [[10, 12], False, True, False, True, [10, 20]])
check('fixture 4', solve({'a': 20, 'qa': 2, 'b': 10, 'qb': 10, 'query': 21, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [10, 22]])
check('fixture 5', solve({'a': 0, 'qa': 1, 'b': 0, 'qb': 1, 'query': 0, 'domain_a': 'mono', 'domain_b': 'mono'}), [[0, 1], False, True, True, True, [0, 1]])
check('fixture 6', solve({'a': 0, 'qa': 10, 'b': 2, 'qb': 3, 'query': 2, 'domain_a': 'a', 'domain_b': 'b'}), [None, False, False, False, True, None])
check('fixture 7', solve({'a': -10, 'qa': 5, 'b': -8, 'qb': 1, 'query': -5, 'domain_a': 'utc', 'domain_b': 'utc'}), [[-8, -7], False, True, False, False, [-10, -5]])
check('fixture 8', solve({'a': 0, 'qa': 3, 'b': 2, 'qb': 1, 'query': 1, 'domain_a': 'utc', 'domain_b': 'utc'}), [[2, 3], False, True, False, True, [0, 3]])
check('fixture 9', solve({'a': 10, 'qa': 1, 'b': 20, 'qb': 1, 'query': 11, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 21]])
check('fixture 10', solve({'a': 0, 'qa': 1, 'b': -1, 'qb': 1, 'query': 0, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [-1, 1]])
variant = [({'a': 10, 'qa': 10, 'b': 16, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[16, 20], False, True, False, True, [10, 36]]), ({'a': 10, 'qa': 10, 'b': 17, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[17, 20], False, True, False, True, [10, 37]]), ({'a': 10, 'qa': 10, 'b': 18, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[18, 20], False, True, False, True, [10, 38]]), ({'a': 10, 'qa': 10, 'b': 19, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[19, 20], False, True, False, True, [10, 39]]), ({'a': 10, 'qa': 10, 'b': 20, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [None, True, True, False, True, [10, 40]])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

prompt:
The decoded time state disagrees with the explicit regression oracle for high.

A timestamp rounded down to resolution q represents half-open [stamp,stamp+q). Preserve domain tag; q positive. Comparing two buckets yields exact intersection and possible/definite-before relations, equality of represented sets and union envelope. Query membership is half-open. This model handles precision buckets, not point timestamps.

split: open-access


broken_source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    a_end = r['a'] + r['qa']
    b_end = r['b'] + r['qb']
    compatible = r['domain_a'] == r['domain_b']
    low = max(r['a'],r['b'])
    high = min(a_end,b_end)
    overlap = compatible and low <= high
    definite_before = compatible and a_end <= r['b']
    possible_before = compatible and r['a'] < b_end
    equal = compatible and r['a'] == r['b'] and r['qa'] == r['qb']
    contains = r['a'] <= r['query'] < a_end
    return [None if not overlap else [low,high],definite_before,possible_before,equal,contains, None if not compatible else [min(r['a'],r['b']),max(a_end,b_end)]]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'a': 10, 'qa': 10, 'b': 15, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}), [[15, 20], False, True, False, True, [10, 35]])
check('fixture 2', solve({'a': 10, 'qa': 10, 'b': 20, 'qb': 2, 'query': 20, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 22]])
check('fixture 3', solve({'a': 10, 'qa': 10, 'b': 10, 'qb': 2, 'query': 15, 'domain_a': 'utc', 'domain_b': 'utc'}), [[10, 12], False, True, False, True, [10, 20]])
check('fixture 4', solve({'a': 20, 'qa': 2, 'b': 10, 'qb': 10, 'query': 21, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [10, 22]])
check('fixture 5', solve({'a': 0, 'qa': 1, 'b': 0, 'qb': 1, 'query': 0, 'domain_a': 'mono', 'domain_b': 'mono'}), [[0, 1], False, True, True, True, [0, 1]])
check('fixture 6', solve({'a': 0, 'qa': 10, 'b': 2, 'qb': 3, 'query': 2, 'domain_a': 'a', 'domain_b': 'b'}), [None, False, False, False, True, None])
check('fixture 7', solve({'a': -10, 'qa': 5, 'b': -8, 'qb': 1, 'query': -5, 'domain_a': 'utc', 'domain_b': 'utc'}), [[-8, -7], False, True, False, False, [-10, -5]])
check('fixture 8', solve({'a': 0, 'qa': 3, 'b': 2, 'qb': 1, 'query': 1, 'domain_a': 'utc', 'domain_b': 'utc'}), [[2, 3], False, True, False, True, [0, 3]])
check('fixture 9', solve({'a': 10, 'qa': 1, 'b': 20, 'qb': 1, 'query': 11, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 21]])
check('fixture 10', solve({'a': 0, 'qa': 1, 'b': -1, 'qb': 1, 'query': 0, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [-1, 1]])
variant = [({'a': 10, 'qa': 10, 'b': 16, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[16, 20], False, True, False, True, [10, 36]]), ({'a': 10, 'qa': 10, 'b': 17, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[17, 20], False, True, False, True, [10, 37]]), ({'a': 10, 'qa': 10, 'b': 18, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[18, 20], False, True, False, True, [10, 38]]), ({'a': 10, 'qa': 10, 'b': 19, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[19, 20], False, True, False, True, [10, 39]]), ({'a': 10, 'qa': 10, 'b': 20, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [None, True, True, False, True, [10, 40]])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    a_end = r['a'] + r['qa']
    b_end = r['b'] + r['qb']
    compatible = r['domain_a'] == r['domain_b']
    low = max(r['a'],r['b'])
    high = min(a_end,b_end)
    overlap = low < high
    definite_before = compatible and a_end <= r['b']
    possible_before = compatible and r['a'] < b_end
    equal = compatible and r['a'] == r['b'] and r['qa'] == r['qb']
    contains = r['a'] <= r['query'] < a_end
    return [None if not overlap else [low,high],definite_before,possible_before,equal,contains, None if not compatible else [min(r['a'],r['b']),max(a_end,b_end)]]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'a': 10, 'qa': 10, 'b': 15, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}), [[15, 20], False, True, False, True, [10, 35]])
check('fixture 2', solve({'a': 10, 'qa': 10, 'b': 20, 'qb': 2, 'query': 20, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 22]])
check('fixture 3', solve({'a': 10, 'qa': 10, 'b': 10, 'qb': 2, 'query': 15, 'domain_a': 'utc', 'domain_b': 'utc'}), [[10, 12], False, True, False, True, [10, 20]])
check('fixture 4', solve({'a': 20, 'qa': 2, 'b': 10, 'qb': 10, 'query': 21, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [10, 22]])
check('fixture 5', solve({'a': 0, 'qa': 1, 'b': 0, 'qb': 1, 'query': 0, 'domain_a': 'mono', 'domain_b': 'mono'}), [[0, 1], False, True, True, True, [0, 1]])
check('fixture 6', solve({'a': 0, 'qa': 10, 'b': 2, 'qb': 3, 'query': 2, 'domain_a': 'a', 'domain_b': 'b'}), [None, False, False, False, True, None])
check('fixture 7', solve({'a': -10, 'qa': 5, 'b': -8, 'qb': 1, 'query': -5, 'domain_a': 'utc', 'domain_b': 'utc'}), [[-8, -7], False, True, False, False, [-10, -5]])
check('fixture 8', solve({'a': 0, 'qa': 3, 'b': 2, 'qb': 1, 'query': 1, 'domain_a': 'utc', 'domain_b': 'utc'}), [[2, 3], False, True, False, True, [0, 3]])
check('fixture 9', solve({'a': 10, 'qa': 1, 'b': 20, 'qb': 1, 'query': 11, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 21]])
check('fixture 10', solve({'a': 0, 'qa': 1, 'b': -1, 'qb': 1, 'query': 0, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [-1, 1]])
variant = [({'a': 10, 'qa': 10, 'b': 16, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[16, 20], False, True, False, True, [10, 36]]), ({'a': 10, 'qa': 10, 'b': 17, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[17, 20], False, True, False, True, [10, 37]]), ({'a': 10, 'qa': 10, 'b': 18, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[18, 20], False, True, False, True, [10, 38]]), ({'a': 10, 'qa': 10, 'b': 19, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[19, 20], False, True, False, True, [10, 39]]), ({'a': 10, 'qa': 10, 'b': 20, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [None, True, True, False, True, [10, 40]])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

prompt:
The decoded time state disagrees with the explicit regression oracle for overlap.

A timestamp rounded down to resolution q represents half-open [stamp,stamp+q). Preserve domain tag; q positive. Comparing two buckets yields exact intersection and possible/definite-before relations, equality of represented sets and union envelope. Query membership is half-open. This model handles precision buckets, not point timestamps.

split: open-access


broken_source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    a_end = r['a'] + r['qa']
    b_end = r['b'] + r['qb']
    compatible = r['domain_a'] == r['domain_b']
    low = max(r['a'],r['b'])
    high = min(a_end,b_end)
    overlap = compatible and low < high
    definite_before = compatible and r['a'] < r['b']
    possible_before = compatible and r['a'] < b_end
    equal = compatible and r['a'] == r['b'] and r['qa'] == r['qb']
    contains = r['a'] <= r['query'] < a_end
    return [None if not overlap else [low,high],definite_before,possible_before,equal,contains, None if not compatible else [min(r['a'],r['b']),max(a_end,b_end)]]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'a': 10, 'qa': 10, 'b': 15, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}), [[15, 20], False, True, False, True, [10, 35]])
check('fixture 2', solve({'a': 10, 'qa': 10, 'b': 20, 'qb': 2, 'query': 20, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 22]])
check('fixture 3', solve({'a': 10, 'qa': 10, 'b': 10, 'qb': 2, 'query': 15, 'domain_a': 'utc', 'domain_b': 'utc'}), [[10, 12], False, True, False, True, [10, 20]])
check('fixture 4', solve({'a': 20, 'qa': 2, 'b': 10, 'qb': 10, 'query': 21, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [10, 22]])
check('fixture 5', solve({'a': 0, 'qa': 1, 'b': 0, 'qb': 1, 'query': 0, 'domain_a': 'mono', 'domain_b': 'mono'}), [[0, 1], False, True, True, True, [0, 1]])
check('fixture 6', solve({'a': 0, 'qa': 10, 'b': 2, 'qb': 3, 'query': 2, 'domain_a': 'a', 'domain_b': 'b'}), [None, False, False, False, True, None])
check('fixture 7', solve({'a': -10, 'qa': 5, 'b': -8, 'qb': 1, 'query': -5, 'domain_a': 'utc', 'domain_b': 'utc'}), [[-8, -7], False, True, False, False, [-10, -5]])
check('fixture 8', solve({'a': 0, 'qa': 3, 'b': 2, 'qb': 1, 'query': 1, 'domain_a': 'utc', 'domain_b': 'utc'}), [[2, 3], False, True, False, True, [0, 3]])
check('fixture 9', solve({'a': 10, 'qa': 1, 'b': 20, 'qb': 1, 'query': 11, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 21]])
check('fixture 10', solve({'a': 0, 'qa': 1, 'b': -1, 'qb': 1, 'query': 0, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [-1, 1]])
variant = [({'a': 10, 'qa': 10, 'b': 16, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[16, 20], False, True, False, True, [10, 36]]), ({'a': 10, 'qa': 10, 'b': 17, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[17, 20], False, True, False, True, [10, 37]]), ({'a': 10, 'qa': 10, 'b': 18, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[18, 20], False, True, False, True, [10, 38]]), ({'a': 10, 'qa': 10, 'b': 19, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[19, 20], False, True, False, True, [10, 39]]), ({'a': 10, 'qa': 10, 'b': 20, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [None, True, True, False, True, [10, 40]])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    a_end = r['a'] + r['qa']
    b_end = r['b'] + r['qb']
    compatible = r['domain_a'] == r['domain_b']
    low = max(r['a'],r['b'])
    high = min(a_end,b_end)
    overlap = compatible and low < high
    definite_before = compatible and a_end < r['b']
    possible_before = compatible and r['a'] < b_end
    equal = compatible and r['a'] == r['b'] and r['qa'] == r['qb']
    contains = r['a'] <= r['query'] < a_end
    return [None if not overlap else [low,high],definite_before,possible_before,equal,contains, None if not compatible else [min(r['a'],r['b']),max(a_end,b_end)]]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'a': 10, 'qa': 10, 'b': 15, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}), [[15, 20], False, True, False, True, [10, 35]])
check('fixture 2', solve({'a': 10, 'qa': 10, 'b': 20, 'qb': 2, 'query': 20, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 22]])
check('fixture 3', solve({'a': 10, 'qa': 10, 'b': 10, 'qb': 2, 'query': 15, 'domain_a': 'utc', 'domain_b': 'utc'}), [[10, 12], False, True, False, True, [10, 20]])
check('fixture 4', solve({'a': 20, 'qa': 2, 'b': 10, 'qb': 10, 'query': 21, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [10, 22]])
check('fixture 5', solve({'a': 0, 'qa': 1, 'b': 0, 'qb': 1, 'query': 0, 'domain_a': 'mono', 'domain_b': 'mono'}), [[0, 1], False, True, True, True, [0, 1]])
check('fixture 6', solve({'a': 0, 'qa': 10, 'b': 2, 'qb': 3, 'query': 2, 'domain_a': 'a', 'domain_b': 'b'}), [None, False, False, False, True, None])
check('fixture 7', solve({'a': -10, 'qa': 5, 'b': -8, 'qb': 1, 'query': -5, 'domain_a': 'utc', 'domain_b': 'utc'}), [[-8, -7], False, True, False, False, [-10, -5]])
check('fixture 8', solve({'a': 0, 'qa': 3, 'b': 2, 'qb': 1, 'query': 1, 'domain_a': 'utc', 'domain_b': 'utc'}), [[2, 3], False, True, False, True, [0, 3]])
check('fixture 9', solve({'a': 10, 'qa': 1, 'b': 20, 'qb': 1, 'query': 11, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 21]])
check('fixture 10', solve({'a': 0, 'qa': 1, 'b': -1, 'qb': 1, 'query': 0, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [-1, 1]])
variant = [({'a': 10, 'qa': 10, 'b': 16, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[16, 20], False, True, False, True, [10, 36]]), ({'a': 10, 'qa': 10, 'b': 17, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[17, 20], False, True, False, True, [10, 37]]), ({'a': 10, 'qa': 10, 'b': 18, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[18, 20], False, True, False, True, [10, 38]]), ({'a': 10, 'qa': 10, 'b': 19, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[19, 20], False, True, False, True, [10, 39]]), ({'a': 10, 'qa': 10, 'b': 20, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [None, True, True, False, True, [10, 40]])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

prompt:
The decoded time state disagrees with the explicit regression oracle for definite_before.

A timestamp rounded down to resolution q represents half-open [stamp,stamp+q). Preserve domain tag; q positive. Comparing two buckets yields exact intersection and possible/definite-before relations, equality of represented sets and union envelope. Query membership is half-open. This model handles precision buckets, not point timestamps.

split: open-access


broken_source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    a_end = r['a'] + r['qa']
    b_end = r['b'] + r['qb']
    compatible = r['domain_a'] == r['domain_b']
    low = max(r['a'],r['b'])
    high = min(a_end,b_end)
    overlap = compatible and low < high
    definite_before = compatible and a_end <= r['b']
    possible_before = compatible and a_end < r['b']
    equal = compatible and r['a'] == r['b'] and r['qa'] == r['qb']
    contains = r['a'] <= r['query'] < a_end
    return [None if not overlap else [low,high],definite_before,possible_before,equal,contains, None if not compatible else [min(r['a'],r['b']),max(a_end,b_end)]]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'a': 10, 'qa': 10, 'b': 15, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}), [[15, 20], False, True, False, True, [10, 35]])
check('fixture 2', solve({'a': 10, 'qa': 10, 'b': 20, 'qb': 2, 'query': 20, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 22]])
check('fixture 3', solve({'a': 10, 'qa': 10, 'b': 10, 'qb': 2, 'query': 15, 'domain_a': 'utc', 'domain_b': 'utc'}), [[10, 12], False, True, False, True, [10, 20]])
check('fixture 4', solve({'a': 20, 'qa': 2, 'b': 10, 'qb': 10, 'query': 21, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [10, 22]])
check('fixture 5', solve({'a': 0, 'qa': 1, 'b': 0, 'qb': 1, 'query': 0, 'domain_a': 'mono', 'domain_b': 'mono'}), [[0, 1], False, True, True, True, [0, 1]])
check('fixture 6', solve({'a': 0, 'qa': 10, 'b': 2, 'qb': 3, 'query': 2, 'domain_a': 'a', 'domain_b': 'b'}), [None, False, False, False, True, None])
check('fixture 7', solve({'a': -10, 'qa': 5, 'b': -8, 'qb': 1, 'query': -5, 'domain_a': 'utc', 'domain_b': 'utc'}), [[-8, -7], False, True, False, False, [-10, -5]])
check('fixture 8', solve({'a': 0, 'qa': 3, 'b': 2, 'qb': 1, 'query': 1, 'domain_a': 'utc', 'domain_b': 'utc'}), [[2, 3], False, True, False, True, [0, 3]])
check('fixture 9', solve({'a': 10, 'qa': 1, 'b': 20, 'qb': 1, 'query': 11, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 21]])
check('fixture 10', solve({'a': 0, 'qa': 1, 'b': -1, 'qb': 1, 'query': 0, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [-1, 1]])
variant = [({'a': 10, 'qa': 10, 'b': 16, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[16, 20], False, True, False, True, [10, 36]]), ({'a': 10, 'qa': 10, 'b': 17, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[17, 20], False, True, False, True, [10, 37]]), ({'a': 10, 'qa': 10, 'b': 18, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[18, 20], False, True, False, True, [10, 38]]), ({'a': 10, 'qa': 10, 'b': 19, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[19, 20], False, True, False, True, [10, 39]]), ({'a': 10, 'qa': 10, 'b': 20, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [None, True, True, False, True, [10, 40]])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    a_end = r['a'] + r['qa']
    b_end = r['b'] + r['qb']
    compatible = r['domain_a'] == r['domain_b']
    low = max(r['a'],r['b'])
    high = min(a_end,b_end)
    overlap = compatible and low < high
    definite_before = compatible and a_end <= r['b']
    possible_before = compatible and r['a'] <= b_end
    equal = compatible and r['a'] == r['b'] and r['qa'] == r['qb']
    contains = r['a'] <= r['query'] < a_end
    return [None if not overlap else [low,high],definite_before,possible_before,equal,contains, None if not compatible else [min(r['a'],r['b']),max(a_end,b_end)]]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'a': 10, 'qa': 10, 'b': 15, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}), [[15, 20], False, True, False, True, [10, 35]])
check('fixture 2', solve({'a': 10, 'qa': 10, 'b': 20, 'qb': 2, 'query': 20, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 22]])
check('fixture 3', solve({'a': 10, 'qa': 10, 'b': 10, 'qb': 2, 'query': 15, 'domain_a': 'utc', 'domain_b': 'utc'}), [[10, 12], False, True, False, True, [10, 20]])
check('fixture 4', solve({'a': 20, 'qa': 2, 'b': 10, 'qb': 10, 'query': 21, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [10, 22]])
check('fixture 5', solve({'a': 0, 'qa': 1, 'b': 0, 'qb': 1, 'query': 0, 'domain_a': 'mono', 'domain_b': 'mono'}), [[0, 1], False, True, True, True, [0, 1]])
check('fixture 6', solve({'a': 0, 'qa': 10, 'b': 2, 'qb': 3, 'query': 2, 'domain_a': 'a', 'domain_b': 'b'}), [None, False, False, False, True, None])
check('fixture 7', solve({'a': -10, 'qa': 5, 'b': -8, 'qb': 1, 'query': -5, 'domain_a': 'utc', 'domain_b': 'utc'}), [[-8, -7], False, True, False, False, [-10, -5]])
check('fixture 8', solve({'a': 0, 'qa': 3, 'b': 2, 'qb': 1, 'query': 1, 'domain_a': 'utc', 'domain_b': 'utc'}), [[2, 3], False, True, False, True, [0, 3]])
check('fixture 9', solve({'a': 10, 'qa': 1, 'b': 20, 'qb': 1, 'query': 11, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 21]])
check('fixture 10', solve({'a': 0, 'qa': 1, 'b': -1, 'qb': 1, 'query': 0, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [-1, 1]])
variant = [({'a': 10, 'qa': 10, 'b': 16, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[16, 20], False, True, False, True, [10, 36]]), ({'a': 10, 'qa': 10, 'b': 17, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[17, 20], False, True, False, True, [10, 37]]), ({'a': 10, 'qa': 10, 'b': 18, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[18, 20], False, True, False, True, [10, 38]]), ({'a': 10, 'qa': 10, 'b': 19, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[19, 20], False, True, False, True, [10, 39]]), ({'a': 10, 'qa': 10, 'b': 20, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [None, True, True, False, True, [10, 40]])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

prompt:
The decoded time state disagrees with the explicit regression oracle for possible_before.

A timestamp rounded down to resolution q represents half-open [stamp,stamp+q). Preserve domain tag; q positive. Comparing two buckets yields exact intersection and possible/definite-before relations, equality of represented sets and union envelope. Query membership is half-open. This model handles precision buckets, not point timestamps.

split: open-access


broken_source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    a_end = r['a'] + r['qa']
    b_end = r['b'] + r['qb']
    compatible = r['domain_a'] == r['domain_b']
    low = max(r['a'],r['b'])
    high = min(a_end,b_end)
    overlap = compatible and low < high
    definite_before = compatible and a_end <= r['b']
    possible_before = compatible and r['a'] < b_end
    equal = compatible and r['a'] == r['b']
    contains = r['a'] <= r['query'] < a_end
    return [None if not overlap else [low,high],definite_before,possible_before,equal,contains, None if not compatible else [min(r['a'],r['b']),max(a_end,b_end)]]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'a': 10, 'qa': 10, 'b': 15, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}), [[15, 20], False, True, False, True, [10, 35]])
check('fixture 2', solve({'a': 10, 'qa': 10, 'b': 20, 'qb': 2, 'query': 20, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 22]])
check('fixture 3', solve({'a': 10, 'qa': 10, 'b': 10, 'qb': 2, 'query': 15, 'domain_a': 'utc', 'domain_b': 'utc'}), [[10, 12], False, True, False, True, [10, 20]])
check('fixture 4', solve({'a': 20, 'qa': 2, 'b': 10, 'qb': 10, 'query': 21, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [10, 22]])
check('fixture 5', solve({'a': 0, 'qa': 1, 'b': 0, 'qb': 1, 'query': 0, 'domain_a': 'mono', 'domain_b': 'mono'}), [[0, 1], False, True, True, True, [0, 1]])
check('fixture 6', solve({'a': 0, 'qa': 10, 'b': 2, 'qb': 3, 'query': 2, 'domain_a': 'a', 'domain_b': 'b'}), [None, False, False, False, True, None])
check('fixture 7', solve({'a': -10, 'qa': 5, 'b': -8, 'qb': 1, 'query': -5, 'domain_a': 'utc', 'domain_b': 'utc'}), [[-8, -7], False, True, False, False, [-10, -5]])
check('fixture 8', solve({'a': 0, 'qa': 3, 'b': 2, 'qb': 1, 'query': 1, 'domain_a': 'utc', 'domain_b': 'utc'}), [[2, 3], False, True, False, True, [0, 3]])
check('fixture 9', solve({'a': 10, 'qa': 1, 'b': 20, 'qb': 1, 'query': 11, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 21]])
check('fixture 10', solve({'a': 0, 'qa': 1, 'b': -1, 'qb': 1, 'query': 0, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [-1, 1]])
variant = [({'a': 10, 'qa': 10, 'b': 16, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[16, 20], False, True, False, True, [10, 36]]), ({'a': 10, 'qa': 10, 'b': 17, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[17, 20], False, True, False, True, [10, 37]]), ({'a': 10, 'qa': 10, 'b': 18, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[18, 20], False, True, False, True, [10, 38]]), ({'a': 10, 'qa': 10, 'b': 19, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[19, 20], False, True, False, True, [10, 39]]), ({'a': 10, 'qa': 10, 'b': 20, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [None, True, True, False, True, [10, 40]])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    a_end = r['a'] + r['qa']
    b_end = r['b'] + r['qb']
    compatible = r['domain_a'] == r['domain_b']
    low = max(r['a'],r['b'])
    high = min(a_end,b_end)
    overlap = compatible and low < high
    definite_before = compatible and a_end <= r['b']
    possible_before = compatible and r['a'] < b_end
    equal = compatible and r['qa'] == r['qb']
    contains = r['a'] <= r['query'] < a_end
    return [None if not overlap else [low,high],definite_before,possible_before,equal,contains, None if not compatible else [min(r['a'],r['b']),max(a_end,b_end)]]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'a': 10, 'qa': 10, 'b': 15, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}), [[15, 20], False, True, False, True, [10, 35]])
check('fixture 2', solve({'a': 10, 'qa': 10, 'b': 20, 'qb': 2, 'query': 20, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 22]])
check('fixture 3', solve({'a': 10, 'qa': 10, 'b': 10, 'qb': 2, 'query': 15, 'domain_a': 'utc', 'domain_b': 'utc'}), [[10, 12], False, True, False, True, [10, 20]])
check('fixture 4', solve({'a': 20, 'qa': 2, 'b': 10, 'qb': 10, 'query': 21, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [10, 22]])
check('fixture 5', solve({'a': 0, 'qa': 1, 'b': 0, 'qb': 1, 'query': 0, 'domain_a': 'mono', 'domain_b': 'mono'}), [[0, 1], False, True, True, True, [0, 1]])
check('fixture 6', solve({'a': 0, 'qa': 10, 'b': 2, 'qb': 3, 'query': 2, 'domain_a': 'a', 'domain_b': 'b'}), [None, False, False, False, True, None])
check('fixture 7', solve({'a': -10, 'qa': 5, 'b': -8, 'qb': 1, 'query': -5, 'domain_a': 'utc', 'domain_b': 'utc'}), [[-8, -7], False, True, False, False, [-10, -5]])
check('fixture 8', solve({'a': 0, 'qa': 3, 'b': 2, 'qb': 1, 'query': 1, 'domain_a': 'utc', 'domain_b': 'utc'}), [[2, 3], False, True, False, True, [0, 3]])
check('fixture 9', solve({'a': 10, 'qa': 1, 'b': 20, 'qb': 1, 'query': 11, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 21]])
check('fixture 10', solve({'a': 0, 'qa': 1, 'b': -1, 'qb': 1, 'query': 0, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [-1, 1]])
variant = [({'a': 10, 'qa': 10, 'b': 16, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[16, 20], False, True, False, True, [10, 36]]), ({'a': 10, 'qa': 10, 'b': 17, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[17, 20], False, True, False, True, [10, 37]]), ({'a': 10, 'qa': 10, 'b': 18, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[18, 20], False, True, False, True, [10, 38]]), ({'a': 10, 'qa': 10, 'b': 19, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[19, 20], False, True, False, True, [10, 39]]), ({'a': 10, 'qa': 10, 'b': 20, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [None, True, True, False, True, [10, 40]])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

prompt:
The decoded time state disagrees with the explicit regression oracle for equal.

A timestamp rounded down to resolution q represents half-open [stamp,stamp+q). Preserve domain tag; q positive. Comparing two buckets yields exact intersection and possible/definite-before relations, equality of represented sets and union envelope. Query membership is half-open. This model handles precision buckets, not point timestamps.

split: open-access


broken_source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    a_end = r['a'] + r['qa']
    b_end = r['b'] + r['qb']
    compatible = r['domain_a'] == r['domain_b']
    low = max(r['a'],r['b'])
    high = min(a_end,b_end)
    overlap = compatible and low < high
    definite_before = compatible and a_end <= r['b']
    possible_before = compatible and r['a'] < b_end
    equal = compatible and r['a'] == r['b'] and r['qa'] == r['qb']
    contains = r['a'] <= r['query'] <= a_end
    return [None if not overlap else [low,high],definite_before,possible_before,equal,contains, None if not compatible else [min(r['a'],r['b']),max(a_end,b_end)]]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'a': 10, 'qa': 10, 'b': 15, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}), [[15, 20], False, True, False, True, [10, 35]])
check('fixture 2', solve({'a': 10, 'qa': 10, 'b': 20, 'qb': 2, 'query': 20, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 22]])
check('fixture 3', solve({'a': 10, 'qa': 10, 'b': 10, 'qb': 2, 'query': 15, 'domain_a': 'utc', 'domain_b': 'utc'}), [[10, 12], False, True, False, True, [10, 20]])
check('fixture 4', solve({'a': 20, 'qa': 2, 'b': 10, 'qb': 10, 'query': 21, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [10, 22]])
check('fixture 5', solve({'a': 0, 'qa': 1, 'b': 0, 'qb': 1, 'query': 0, 'domain_a': 'mono', 'domain_b': 'mono'}), [[0, 1], False, True, True, True, [0, 1]])
check('fixture 6', solve({'a': 0, 'qa': 10, 'b': 2, 'qb': 3, 'query': 2, 'domain_a': 'a', 'domain_b': 'b'}), [None, False, False, False, True, None])
check('fixture 7', solve({'a': -10, 'qa': 5, 'b': -8, 'qb': 1, 'query': -5, 'domain_a': 'utc', 'domain_b': 'utc'}), [[-8, -7], False, True, False, False, [-10, -5]])
check('fixture 8', solve({'a': 0, 'qa': 3, 'b': 2, 'qb': 1, 'query': 1, 'domain_a': 'utc', 'domain_b': 'utc'}), [[2, 3], False, True, False, True, [0, 3]])
check('fixture 9', solve({'a': 10, 'qa': 1, 'b': 20, 'qb': 1, 'query': 11, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 21]])
check('fixture 10', solve({'a': 0, 'qa': 1, 'b': -1, 'qb': 1, 'query': 0, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [-1, 1]])
variant = [({'a': 10, 'qa': 10, 'b': 16, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[16, 20], False, True, False, True, [10, 36]]), ({'a': 10, 'qa': 10, 'b': 17, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[17, 20], False, True, False, True, [10, 37]]), ({'a': 10, 'qa': 10, 'b': 18, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[18, 20], False, True, False, True, [10, 38]]), ({'a': 10, 'qa': 10, 'b': 19, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[19, 20], False, True, False, True, [10, 39]]), ({'a': 10, 'qa': 10, 'b': 20, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [None, True, True, False, True, [10, 40]])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    a_end = r['a'] + r['qa']
    b_end = r['b'] + r['qb']
    compatible = r['domain_a'] == r['domain_b']
    low = max(r['a'],r['b'])
    high = min(a_end,b_end)
    overlap = compatible and low < high
    definite_before = compatible and a_end <= r['b']
    possible_before = compatible and r['a'] < b_end
    equal = compatible and r['a'] == r['b'] and r['qa'] == r['qb']
    contains = r['a'] < r['query'] < a_end
    return [None if not overlap else [low,high],definite_before,possible_before,equal,contains, None if not compatible else [min(r['a'],r['b']),max(a_end,b_end)]]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'a': 10, 'qa': 10, 'b': 15, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}), [[15, 20], False, True, False, True, [10, 35]])
check('fixture 2', solve({'a': 10, 'qa': 10, 'b': 20, 'qb': 2, 'query': 20, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 22]])
check('fixture 3', solve({'a': 10, 'qa': 10, 'b': 10, 'qb': 2, 'query': 15, 'domain_a': 'utc', 'domain_b': 'utc'}), [[10, 12], False, True, False, True, [10, 20]])
check('fixture 4', solve({'a': 20, 'qa': 2, 'b': 10, 'qb': 10, 'query': 21, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [10, 22]])
check('fixture 5', solve({'a': 0, 'qa': 1, 'b': 0, 'qb': 1, 'query': 0, 'domain_a': 'mono', 'domain_b': 'mono'}), [[0, 1], False, True, True, True, [0, 1]])
check('fixture 6', solve({'a': 0, 'qa': 10, 'b': 2, 'qb': 3, 'query': 2, 'domain_a': 'a', 'domain_b': 'b'}), [None, False, False, False, True, None])
check('fixture 7', solve({'a': -10, 'qa': 5, 'b': -8, 'qb': 1, 'query': -5, 'domain_a': 'utc', 'domain_b': 'utc'}), [[-8, -7], False, True, False, False, [-10, -5]])
check('fixture 8', solve({'a': 0, 'qa': 3, 'b': 2, 'qb': 1, 'query': 1, 'domain_a': 'utc', 'domain_b': 'utc'}), [[2, 3], False, True, False, True, [0, 3]])
check('fixture 9', solve({'a': 10, 'qa': 1, 'b': 20, 'qb': 1, 'query': 11, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, True, True, False, False, [10, 21]])
check('fixture 10', solve({'a': 0, 'qa': 1, 'b': -1, 'qb': 1, 'query': 0, 'domain_a': 'utc', 'domain_b': 'utc'}), [None, False, False, False, True, [-1, 1]])
variant = [({'a': 10, 'qa': 10, 'b': 16, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[16, 20], False, True, False, True, [10, 36]]), ({'a': 10, 'qa': 10, 'b': 17, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[17, 20], False, True, False, True, [10, 37]]), ({'a': 10, 'qa': 10, 'b': 18, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[18, 20], False, True, False, True, [10, 38]]), ({'a': 10, 'qa': 10, 'b': 19, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [[19, 20], False, True, False, True, [10, 39]]), ({'a': 10, 'qa': 10, 'b': 20, 'qb': 20, 'query': 10, 'domain_a': 'utc', 'domain_b': 'utc'}, [None, True, True, False, True, [10, 40]])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

prompt:
The decoded time state disagrees with the explicit regression oracle for contains.

A timestamp rounded down to resolution q represents half-open [stamp,stamp+q). Preserve domain tag; q positive. Comparing two buckets yields exact intersection and possible/definite-before relations, equality of represented sets and union envelope. Query membership is half-open. This model handles precision buckets, not point timestamps.

split: open-access


prompt:
The decoded time state disagrees with the explicit regression oracle for client_span.

Four timestamps are ordered by message path: client send c0, server receive s1, server send s2, client receive c3. Constant offset server-minus-client is estimated by symmetric path assumption. Preserve exact half-tick fractions; report network round trip, offset, projected server now, local send/receive server equivalents, one-way path estimate and delay bounds from nonnegative path delays.

split: open-access


prompt:
The decoded time state disagrees with the explicit regression oracle for server_span.

Four timestamps are ordered by message path: client send c0, server receive s1, server send s2, client receive c3. Constant offset server-minus-client is estimated by symmetric path assumption. Preserve exact half-tick fractions; report network round trip, offset, projected server now, local send/receive server equivalents, one-way path estimate and delay bounds from nonnegative path delays.

split: open-access


prompt:
The decoded time state disagrees with the explicit regression oracle for round_trip.

Four timestamps are ordered by message path: client send c0, server receive s1, server send s2, client receive c3. Constant offset server-minus-client is estimated by symmetric path assumption. Preserve exact half-tick fractions; report network round trip, offset, projected server now, local send/receive server equivalents, one-way path estimate and delay bounds from nonnegative path delays.

split: open-access


prompt:
The decoded time state disagrees with the explicit regression oracle for offset_low.

Four timestamps are ordered by message path: client send c0, server receive s1, server send s2, client receive c3. Constant offset server-minus-client is estimated by symmetric path assumption. Preserve exact half-tick fractions; report network round trip, offset, projected server now, local send/receive server equivalents, one-way path estimate and delay bounds from nonnegative path delays.

split: open-access


prompt:
The decoded time state disagrees with the explicit regression oracle for offset_high.

Four timestamps are ordered by message path: client send c0, server receive s1, server send s2, client receive c3. Constant offset server-minus-client is estimated by symmetric path assumption. Preserve exact half-tick fractions; report network round trip, offset, projected server now, local send/receive server equivalents, one-way path estimate and delay bounds from nonnegative path delays.

split: open-access


prompt:
The decoded time state disagrees with the explicit regression oracle for offset.

Four timestamps are ordered by message path: client send c0, server receive s1, server send s2, client receive c3. Constant offset server-minus-client is estimated by symmetric path assumption. Preserve exact half-tick fractions; report network round trip, offset, projected server now, local send/receive server equivalents, one-way path estimate and delay bounds from nonnegative path delays.

split: open-access


prompt:
The decoded time state disagrees with the explicit regression oracle for projected.

Four timestamps are ordered by message path: client send c0, server receive s1, server send s2, client receive c3. Constant offset server-minus-client is estimated by symmetric path assumption. Preserve exact half-tick fractions; report network round trip, offset, projected server now, local send/receive server equivalents, one-way path estimate and delay bounds from nonnegative path delays.

split: open-access


prompt:
The decoded time state disagrees with the explicit regression oracle for one_way.

Four timestamps are ordered by message path: client send c0, server receive s1, server send s2, client receive c3. Constant offset server-minus-client is estimated by symmetric path assumption. Preserve exact half-tick fractions; report network round trip, offset, projected server now, local send/receive server equivalents, one-way path estimate and delay bounds from nonnegative path delays.

split: open-access


prompt:
The decoded time state disagrees with the explicit regression oracle for valid.

Four timestamps are ordered by message path: client send c0, server receive s1, server send s2, client receive c3. Constant offset server-minus-client is estimated by symmetric path assumption. Preserve exact half-tick fractions; report network round trip, offset, projected server now, local send/receive server equivalents, one-way path estimate and delay bounds from nonnegative path delays.

split: open-access


prompt:
The decoded time state disagrees with the explicit regression oracle for uncertainty.

Four timestamps are ordered by message path: client send c0, server receive s1, server send s2, client receive c3. Constant offset server-minus-client is estimated by symmetric path assumption. Preserve exact half-tick fractions; report network round trip, offset, projected server now, local send/receive server equivalents, one-way path estimate and delay bounds from nonnegative path delays.

split: open-access


broken_source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    physical = max(r['local_p'],r['wall'])
    local_owns = physical == r['local_p']
    remote_owns = physical == r['remote_p']
    logical = max(r['local_l'],r['remote_l']) + 1 if local_owns and remote_owns else (r['local_l'] + 1 if local_owns else (r['remote_l'] + 1 if remote_owns else 0))
    carry = logical // 256
    normalized_p = physical + carry
    normalized_l = logical % 256
    mask = int(local_owns) + 2 * int(remote_owns) + 4 * int(physical == r['wall'])
    after_local = (normalized_p,normalized_l) > (r['local_p'],r['local_l'])
    after_remote = (normalized_p,normalized_l) > (r['remote_p'],r['remote_l'])
    return [[normalized_p,normalized_l],mask,after_local,after_remote,normalized_p > r['wall']]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 9}), [[10, 5], 3, True, True, True])
check('fixture 2', solve({'local_p': 10, 'local_l': 5, 'remote_p': 9, 'remote_l': 8, 'wall': 8}), [[10, 6], 1, True, True, True])
check('fixture 3', solve({'local_p': 9, 'local_l': 7, 'remote_p': 10, 'remote_l': 2, 'wall': 8}), [[10, 3], 2, True, True, True])
check('fixture 4', solve({'local_p': 10, 'local_l': 5, 'remote_p': 10, 'remote_l': 7, 'wall': 11}), [[11, 0], 4, True, True, False])
check('fixture 5', solve({'local_p': 10, 'local_l': 255, 'remote_p': 10, 'remote_l': 2, 'wall': 10}), [[11, 0], 7, True, True, True])
check('fixture 6', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 255, 'wall': 9}), [[11, 0], 3, True, True, True])
check('fixture 7', solve({'local_p': 10, 'local_l': 0, 'remote_p': 10, 'remote_l': 0, 'wall': 10}), [[10, 1], 7, True, True, False])
check('fixture 8', solve({'local_p': 1, 'local_l': 200, 'remote_p': 2, 'remote_l': 0, 'wall': 1}), [[2, 1], 2, True, True, True])
check('fixture 9', solve({'local_p': 2, 'local_l': 0, 'remote_p': 1, 'remote_l': 200, 'wall': 1}), [[2, 1], 1, True, True, True])
check('fixture 10', solve({'local_p': 0, 'local_l': 0, 'remote_p': 0, 'remote_l': 0, 'wall': 1}), [[1, 0], 4, True, True, False])
check('fixture 11', solve({'local_p': 10, 'local_l': 254, 'remote_p': 10, 'remote_l': 0, 'wall': 9}), [[10, 255], 3, True, True, True])
variant = [({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 10}, [[10, 5], 7, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 11}, [[11, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 12}, [[12, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 13}, [[13, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 14}, [[14, 0], 4, True, True, False])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    physical = max(r['remote_p'],r['wall'])
    local_owns = physical == r['local_p']
    remote_owns = physical == r['remote_p']
    logical = max(r['local_l'],r['remote_l']) + 1 if local_owns and remote_owns else (r['local_l'] + 1 if local_owns else (r['remote_l'] + 1 if remote_owns else 0))
    carry = logical // 256
    normalized_p = physical + carry
    normalized_l = logical % 256
    mask = int(local_owns) + 2 * int(remote_owns) + 4 * int(physical == r['wall'])
    after_local = (normalized_p,normalized_l) > (r['local_p'],r['local_l'])
    after_remote = (normalized_p,normalized_l) > (r['remote_p'],r['remote_l'])
    return [[normalized_p,normalized_l],mask,after_local,after_remote,normalized_p > r['wall']]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 9}), [[10, 5], 3, True, True, True])
check('fixture 2', solve({'local_p': 10, 'local_l': 5, 'remote_p': 9, 'remote_l': 8, 'wall': 8}), [[10, 6], 1, True, True, True])
check('fixture 3', solve({'local_p': 9, 'local_l': 7, 'remote_p': 10, 'remote_l': 2, 'wall': 8}), [[10, 3], 2, True, True, True])
check('fixture 4', solve({'local_p': 10, 'local_l': 5, 'remote_p': 10, 'remote_l': 7, 'wall': 11}), [[11, 0], 4, True, True, False])
check('fixture 5', solve({'local_p': 10, 'local_l': 255, 'remote_p': 10, 'remote_l': 2, 'wall': 10}), [[11, 0], 7, True, True, True])
check('fixture 6', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 255, 'wall': 9}), [[11, 0], 3, True, True, True])
check('fixture 7', solve({'local_p': 10, 'local_l': 0, 'remote_p': 10, 'remote_l': 0, 'wall': 10}), [[10, 1], 7, True, True, False])
check('fixture 8', solve({'local_p': 1, 'local_l': 200, 'remote_p': 2, 'remote_l': 0, 'wall': 1}), [[2, 1], 2, True, True, True])
check('fixture 9', solve({'local_p': 2, 'local_l': 0, 'remote_p': 1, 'remote_l': 200, 'wall': 1}), [[2, 1], 1, True, True, True])
check('fixture 10', solve({'local_p': 0, 'local_l': 0, 'remote_p': 0, 'remote_l': 0, 'wall': 1}), [[1, 0], 4, True, True, False])
check('fixture 11', solve({'local_p': 10, 'local_l': 254, 'remote_p': 10, 'remote_l': 0, 'wall': 9}), [[10, 255], 3, True, True, True])
variant = [({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 10}, [[10, 5], 7, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 11}, [[11, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 12}, [[12, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 13}, [[13, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 14}, [[14, 0], 4, True, True, False])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

prompt:
The decoded time state disagrees with the explicit regression oracle for physical.

A bounded hybrid logical timestamp has physical integer p and logical integer l, cap 255. On receive, p=max(local p,remote p,wall). Increment max logical when both timestamps share p, increment owning side when only one shares p, otherwise reset logical to zero. Carry logical overflow into physical. Return canonical pair, physical source mask, ordering versus inputs and wall-advance flag.

split: open-access


broken_source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    physical = max(r['local_p'],r['remote_p'],r['wall'])
    local_owns = physical >= r['local_p']
    remote_owns = physical == r['remote_p']
    logical = max(r['local_l'],r['remote_l']) + 1 if local_owns and remote_owns else (r['local_l'] + 1 if local_owns else (r['remote_l'] + 1 if remote_owns else 0))
    carry = logical // 256
    normalized_p = physical + carry
    normalized_l = logical % 256
    mask = int(local_owns) + 2 * int(remote_owns) + 4 * int(physical == r['wall'])
    after_local = (normalized_p,normalized_l) > (r['local_p'],r['local_l'])
    after_remote = (normalized_p,normalized_l) > (r['remote_p'],r['remote_l'])
    return [[normalized_p,normalized_l],mask,after_local,after_remote,normalized_p > r['wall']]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 9}), [[10, 5], 3, True, True, True])
check('fixture 2', solve({'local_p': 10, 'local_l': 5, 'remote_p': 9, 'remote_l': 8, 'wall': 8}), [[10, 6], 1, True, True, True])
check('fixture 3', solve({'local_p': 9, 'local_l': 7, 'remote_p': 10, 'remote_l': 2, 'wall': 8}), [[10, 3], 2, True, True, True])
check('fixture 4', solve({'local_p': 10, 'local_l': 5, 'remote_p': 10, 'remote_l': 7, 'wall': 11}), [[11, 0], 4, True, True, False])
check('fixture 5', solve({'local_p': 10, 'local_l': 255, 'remote_p': 10, 'remote_l': 2, 'wall': 10}), [[11, 0], 7, True, True, True])
check('fixture 6', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 255, 'wall': 9}), [[11, 0], 3, True, True, True])
check('fixture 7', solve({'local_p': 10, 'local_l': 0, 'remote_p': 10, 'remote_l': 0, 'wall': 10}), [[10, 1], 7, True, True, False])
check('fixture 8', solve({'local_p': 1, 'local_l': 200, 'remote_p': 2, 'remote_l': 0, 'wall': 1}), [[2, 1], 2, True, True, True])
check('fixture 9', solve({'local_p': 2, 'local_l': 0, 'remote_p': 1, 'remote_l': 200, 'wall': 1}), [[2, 1], 1, True, True, True])
check('fixture 10', solve({'local_p': 0, 'local_l': 0, 'remote_p': 0, 'remote_l': 0, 'wall': 1}), [[1, 0], 4, True, True, False])
check('fixture 11', solve({'local_p': 10, 'local_l': 254, 'remote_p': 10, 'remote_l': 0, 'wall': 9}), [[10, 255], 3, True, True, True])
variant = [({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 10}, [[10, 5], 7, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 11}, [[11, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 12}, [[12, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 13}, [[13, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 14}, [[14, 0], 4, True, True, False])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    physical = max(r['local_p'],r['remote_p'],r['wall'])
    local_owns = physical > r['local_p']
    remote_owns = physical == r['remote_p']
    logical = max(r['local_l'],r['remote_l']) + 1 if local_owns and remote_owns else (r['local_l'] + 1 if local_owns else (r['remote_l'] + 1 if remote_owns else 0))
    carry = logical // 256
    normalized_p = physical + carry
    normalized_l = logical % 256
    mask = int(local_owns) + 2 * int(remote_owns) + 4 * int(physical == r['wall'])
    after_local = (normalized_p,normalized_l) > (r['local_p'],r['local_l'])
    after_remote = (normalized_p,normalized_l) > (r['remote_p'],r['remote_l'])
    return [[normalized_p,normalized_l],mask,after_local,after_remote,normalized_p > r['wall']]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 9}), [[10, 5], 3, True, True, True])
check('fixture 2', solve({'local_p': 10, 'local_l': 5, 'remote_p': 9, 'remote_l': 8, 'wall': 8}), [[10, 6], 1, True, True, True])
check('fixture 3', solve({'local_p': 9, 'local_l': 7, 'remote_p': 10, 'remote_l': 2, 'wall': 8}), [[10, 3], 2, True, True, True])
check('fixture 4', solve({'local_p': 10, 'local_l': 5, 'remote_p': 10, 'remote_l': 7, 'wall': 11}), [[11, 0], 4, True, True, False])
check('fixture 5', solve({'local_p': 10, 'local_l': 255, 'remote_p': 10, 'remote_l': 2, 'wall': 10}), [[11, 0], 7, True, True, True])
check('fixture 6', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 255, 'wall': 9}), [[11, 0], 3, True, True, True])
check('fixture 7', solve({'local_p': 10, 'local_l': 0, 'remote_p': 10, 'remote_l': 0, 'wall': 10}), [[10, 1], 7, True, True, False])
check('fixture 8', solve({'local_p': 1, 'local_l': 200, 'remote_p': 2, 'remote_l': 0, 'wall': 1}), [[2, 1], 2, True, True, True])
check('fixture 9', solve({'local_p': 2, 'local_l': 0, 'remote_p': 1, 'remote_l': 200, 'wall': 1}), [[2, 1], 1, True, True, True])
check('fixture 10', solve({'local_p': 0, 'local_l': 0, 'remote_p': 0, 'remote_l': 0, 'wall': 1}), [[1, 0], 4, True, True, False])
check('fixture 11', solve({'local_p': 10, 'local_l': 254, 'remote_p': 10, 'remote_l': 0, 'wall': 9}), [[10, 255], 3, True, True, True])
variant = [({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 10}, [[10, 5], 7, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 11}, [[11, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 12}, [[12, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 13}, [[13, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 14}, [[14, 0], 4, True, True, False])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

prompt:
The decoded time state disagrees with the explicit regression oracle for local_owns.

A bounded hybrid logical timestamp has physical integer p and logical integer l, cap 255. On receive, p=max(local p,remote p,wall). Increment max logical when both timestamps share p, increment owning side when only one shares p, otherwise reset logical to zero. Carry logical overflow into physical. Return canonical pair, physical source mask, ordering versus inputs and wall-advance flag.

split: open-access


broken_source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    physical = max(r['local_p'],r['remote_p'],r['wall'])
    local_owns = physical == r['local_p']
    remote_owns = physical >= r['remote_p']
    logical = max(r['local_l'],r['remote_l']) + 1 if local_owns and remote_owns else (r['local_l'] + 1 if local_owns else (r['remote_l'] + 1 if remote_owns else 0))
    carry = logical // 256
    normalized_p = physical + carry
    normalized_l = logical % 256
    mask = int(local_owns) + 2 * int(remote_owns) + 4 * int(physical == r['wall'])
    after_local = (normalized_p,normalized_l) > (r['local_p'],r['local_l'])
    after_remote = (normalized_p,normalized_l) > (r['remote_p'],r['remote_l'])
    return [[normalized_p,normalized_l],mask,after_local,after_remote,normalized_p > r['wall']]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 9}), [[10, 5], 3, True, True, True])
check('fixture 2', solve({'local_p': 10, 'local_l': 5, 'remote_p': 9, 'remote_l': 8, 'wall': 8}), [[10, 6], 1, True, True, True])
check('fixture 3', solve({'local_p': 9, 'local_l': 7, 'remote_p': 10, 'remote_l': 2, 'wall': 8}), [[10, 3], 2, True, True, True])
check('fixture 4', solve({'local_p': 10, 'local_l': 5, 'remote_p': 10, 'remote_l': 7, 'wall': 11}), [[11, 0], 4, True, True, False])
check('fixture 5', solve({'local_p': 10, 'local_l': 255, 'remote_p': 10, 'remote_l': 2, 'wall': 10}), [[11, 0], 7, True, True, True])
check('fixture 6', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 255, 'wall': 9}), [[11, 0], 3, True, True, True])
check('fixture 7', solve({'local_p': 10, 'local_l': 0, 'remote_p': 10, 'remote_l': 0, 'wall': 10}), [[10, 1], 7, True, True, False])
check('fixture 8', solve({'local_p': 1, 'local_l': 200, 'remote_p': 2, 'remote_l': 0, 'wall': 1}), [[2, 1], 2, True, True, True])
check('fixture 9', solve({'local_p': 2, 'local_l': 0, 'remote_p': 1, 'remote_l': 200, 'wall': 1}), [[2, 1], 1, True, True, True])
check('fixture 10', solve({'local_p': 0, 'local_l': 0, 'remote_p': 0, 'remote_l': 0, 'wall': 1}), [[1, 0], 4, True, True, False])
check('fixture 11', solve({'local_p': 10, 'local_l': 254, 'remote_p': 10, 'remote_l': 0, 'wall': 9}), [[10, 255], 3, True, True, True])
variant = [({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 10}, [[10, 5], 7, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 11}, [[11, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 12}, [[12, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 13}, [[13, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 14}, [[14, 0], 4, True, True, False])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    physical = max(r['local_p'],r['remote_p'],r['wall'])
    local_owns = physical == r['local_p']
    remote_owns = physical > r['remote_p']
    logical = max(r['local_l'],r['remote_l']) + 1 if local_owns and remote_owns else (r['local_l'] + 1 if local_owns else (r['remote_l'] + 1 if remote_owns else 0))
    carry = logical // 256
    normalized_p = physical + carry
    normalized_l = logical % 256
    mask = int(local_owns) + 2 * int(remote_owns) + 4 * int(physical == r['wall'])
    after_local = (normalized_p,normalized_l) > (r['local_p'],r['local_l'])
    after_remote = (normalized_p,normalized_l) > (r['remote_p'],r['remote_l'])
    return [[normalized_p,normalized_l],mask,after_local,after_remote,normalized_p > r['wall']]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 9}), [[10, 5], 3, True, True, True])
check('fixture 2', solve({'local_p': 10, 'local_l': 5, 'remote_p': 9, 'remote_l': 8, 'wall': 8}), [[10, 6], 1, True, True, True])
check('fixture 3', solve({'local_p': 9, 'local_l': 7, 'remote_p': 10, 'remote_l': 2, 'wall': 8}), [[10, 3], 2, True, True, True])
check('fixture 4', solve({'local_p': 10, 'local_l': 5, 'remote_p': 10, 'remote_l': 7, 'wall': 11}), [[11, 0], 4, True, True, False])
check('fixture 5', solve({'local_p': 10, 'local_l': 255, 'remote_p': 10, 'remote_l': 2, 'wall': 10}), [[11, 0], 7, True, True, True])
check('fixture 6', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 255, 'wall': 9}), [[11, 0], 3, True, True, True])
check('fixture 7', solve({'local_p': 10, 'local_l': 0, 'remote_p': 10, 'remote_l': 0, 'wall': 10}), [[10, 1], 7, True, True, False])
check('fixture 8', solve({'local_p': 1, 'local_l': 200, 'remote_p': 2, 'remote_l': 0, 'wall': 1}), [[2, 1], 2, True, True, True])
check('fixture 9', solve({'local_p': 2, 'local_l': 0, 'remote_p': 1, 'remote_l': 200, 'wall': 1}), [[2, 1], 1, True, True, True])
check('fixture 10', solve({'local_p': 0, 'local_l': 0, 'remote_p': 0, 'remote_l': 0, 'wall': 1}), [[1, 0], 4, True, True, False])
check('fixture 11', solve({'local_p': 10, 'local_l': 254, 'remote_p': 10, 'remote_l': 0, 'wall': 9}), [[10, 255], 3, True, True, True])
variant = [({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 10}, [[10, 5], 7, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 11}, [[11, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 12}, [[12, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 13}, [[13, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 14}, [[14, 0], 4, True, True, False])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

prompt:
The decoded time state disagrees with the explicit regression oracle for remote_owns.

A bounded hybrid logical timestamp has physical integer p and logical integer l, cap 255. On receive, p=max(local p,remote p,wall). Increment max logical when both timestamps share p, increment owning side when only one shares p, otherwise reset logical to zero. Carry logical overflow into physical. Return canonical pair, physical source mask, ordering versus inputs and wall-advance flag.

split: open-access


broken_source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    physical = max(r['local_p'],r['remote_p'],r['wall'])
    local_owns = physical == r['local_p']
    remote_owns = physical == r['remote_p']
    logical = r['local_l'] + 1
    carry = logical // 256
    normalized_p = physical + carry
    normalized_l = logical % 256
    mask = int(local_owns) + 2 * int(remote_owns) + 4 * int(physical == r['wall'])
    after_local = (normalized_p,normalized_l) > (r['local_p'],r['local_l'])
    after_remote = (normalized_p,normalized_l) > (r['remote_p'],r['remote_l'])
    return [[normalized_p,normalized_l],mask,after_local,after_remote,normalized_p > r['wall']]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 9}), [[10, 5], 3, True, True, True])
check('fixture 2', solve({'local_p': 10, 'local_l': 5, 'remote_p': 9, 'remote_l': 8, 'wall': 8}), [[10, 6], 1, True, True, True])
check('fixture 3', solve({'local_p': 9, 'local_l': 7, 'remote_p': 10, 'remote_l': 2, 'wall': 8}), [[10, 3], 2, True, True, True])
check('fixture 4', solve({'local_p': 10, 'local_l': 5, 'remote_p': 10, 'remote_l': 7, 'wall': 11}), [[11, 0], 4, True, True, False])
check('fixture 5', solve({'local_p': 10, 'local_l': 255, 'remote_p': 10, 'remote_l': 2, 'wall': 10}), [[11, 0], 7, True, True, True])
check('fixture 6', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 255, 'wall': 9}), [[11, 0], 3, True, True, True])
check('fixture 7', solve({'local_p': 10, 'local_l': 0, 'remote_p': 10, 'remote_l': 0, 'wall': 10}), [[10, 1], 7, True, True, False])
check('fixture 8', solve({'local_p': 1, 'local_l': 200, 'remote_p': 2, 'remote_l': 0, 'wall': 1}), [[2, 1], 2, True, True, True])
check('fixture 9', solve({'local_p': 2, 'local_l': 0, 'remote_p': 1, 'remote_l': 200, 'wall': 1}), [[2, 1], 1, True, True, True])
check('fixture 10', solve({'local_p': 0, 'local_l': 0, 'remote_p': 0, 'remote_l': 0, 'wall': 1}), [[1, 0], 4, True, True, False])
check('fixture 11', solve({'local_p': 10, 'local_l': 254, 'remote_p': 10, 'remote_l': 0, 'wall': 9}), [[10, 255], 3, True, True, True])
variant = [({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 10}, [[10, 5], 7, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 11}, [[11, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 12}, [[12, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 13}, [[13, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 14}, [[14, 0], 4, True, True, False])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    physical = max(r['local_p'],r['remote_p'],r['wall'])
    local_owns = physical == r['local_p']
    remote_owns = physical == r['remote_p']
    logical = max(r['local_l'],r['remote_l']) + 1
    carry = logical // 256
    normalized_p = physical + carry
    normalized_l = logical % 256
    mask = int(local_owns) + 2 * int(remote_owns) + 4 * int(physical == r['wall'])
    after_local = (normalized_p,normalized_l) > (r['local_p'],r['local_l'])
    after_remote = (normalized_p,normalized_l) > (r['remote_p'],r['remote_l'])
    return [[normalized_p,normalized_l],mask,after_local,after_remote,normalized_p > r['wall']]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 9}), [[10, 5], 3, True, True, True])
check('fixture 2', solve({'local_p': 10, 'local_l': 5, 'remote_p': 9, 'remote_l': 8, 'wall': 8}), [[10, 6], 1, True, True, True])
check('fixture 3', solve({'local_p': 9, 'local_l': 7, 'remote_p': 10, 'remote_l': 2, 'wall': 8}), [[10, 3], 2, True, True, True])
check('fixture 4', solve({'local_p': 10, 'local_l': 5, 'remote_p': 10, 'remote_l': 7, 'wall': 11}), [[11, 0], 4, True, True, False])
check('fixture 5', solve({'local_p': 10, 'local_l': 255, 'remote_p': 10, 'remote_l': 2, 'wall': 10}), [[11, 0], 7, True, True, True])
check('fixture 6', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 255, 'wall': 9}), [[11, 0], 3, True, True, True])
check('fixture 7', solve({'local_p': 10, 'local_l': 0, 'remote_p': 10, 'remote_l': 0, 'wall': 10}), [[10, 1], 7, True, True, False])
check('fixture 8', solve({'local_p': 1, 'local_l': 200, 'remote_p': 2, 'remote_l': 0, 'wall': 1}), [[2, 1], 2, True, True, True])
check('fixture 9', solve({'local_p': 2, 'local_l': 0, 'remote_p': 1, 'remote_l': 200, 'wall': 1}), [[2, 1], 1, True, True, True])
check('fixture 10', solve({'local_p': 0, 'local_l': 0, 'remote_p': 0, 'remote_l': 0, 'wall': 1}), [[1, 0], 4, True, True, False])
check('fixture 11', solve({'local_p': 10, 'local_l': 254, 'remote_p': 10, 'remote_l': 0, 'wall': 9}), [[10, 255], 3, True, True, True])
variant = [({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 10}, [[10, 5], 7, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 11}, [[11, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 12}, [[12, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 13}, [[13, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 14}, [[14, 0], 4, True, True, False])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

prompt:
The decoded time state disagrees with the explicit regression oracle for logical.

A bounded hybrid logical timestamp has physical integer p and logical integer l, cap 255. On receive, p=max(local p,remote p,wall). Increment max logical when both timestamps share p, increment owning side when only one shares p, otherwise reset logical to zero. Carry logical overflow into physical. Return canonical pair, physical source mask, ordering versus inputs and wall-advance flag.

split: open-access


broken_source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    physical = max(r['local_p'],r['remote_p'],r['wall'])
    local_owns = physical == r['local_p']
    remote_owns = physical == r['remote_p']
    logical = max(r['local_l'],r['remote_l']) + 1 if local_owns and remote_owns else (r['local_l'] + 1 if local_owns else (r['remote_l'] + 1 if remote_owns else 0))
    carry = logical // 255
    normalized_p = physical + carry
    normalized_l = logical % 256
    mask = int(local_owns) + 2 * int(remote_owns) + 4 * int(physical == r['wall'])
    after_local = (normalized_p,normalized_l) > (r['local_p'],r['local_l'])
    after_remote = (normalized_p,normalized_l) > (r['remote_p'],r['remote_l'])
    return [[normalized_p,normalized_l],mask,after_local,after_remote,normalized_p > r['wall']]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 9}), [[10, 5], 3, True, True, True])
check('fixture 2', solve({'local_p': 10, 'local_l': 5, 'remote_p': 9, 'remote_l': 8, 'wall': 8}), [[10, 6], 1, True, True, True])
check('fixture 3', solve({'local_p': 9, 'local_l': 7, 'remote_p': 10, 'remote_l': 2, 'wall': 8}), [[10, 3], 2, True, True, True])
check('fixture 4', solve({'local_p': 10, 'local_l': 5, 'remote_p': 10, 'remote_l': 7, 'wall': 11}), [[11, 0], 4, True, True, False])
check('fixture 5', solve({'local_p': 10, 'local_l': 255, 'remote_p': 10, 'remote_l': 2, 'wall': 10}), [[11, 0], 7, True, True, True])
check('fixture 6', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 255, 'wall': 9}), [[11, 0], 3, True, True, True])
check('fixture 7', solve({'local_p': 10, 'local_l': 0, 'remote_p': 10, 'remote_l': 0, 'wall': 10}), [[10, 1], 7, True, True, False])
check('fixture 8', solve({'local_p': 1, 'local_l': 200, 'remote_p': 2, 'remote_l': 0, 'wall': 1}), [[2, 1], 2, True, True, True])
check('fixture 9', solve({'local_p': 2, 'local_l': 0, 'remote_p': 1, 'remote_l': 200, 'wall': 1}), [[2, 1], 1, True, True, True])
check('fixture 10', solve({'local_p': 0, 'local_l': 0, 'remote_p': 0, 'remote_l': 0, 'wall': 1}), [[1, 0], 4, True, True, False])
check('fixture 11', solve({'local_p': 10, 'local_l': 254, 'remote_p': 10, 'remote_l': 0, 'wall': 9}), [[10, 255], 3, True, True, True])
variant = [({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 10}, [[10, 5], 7, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 11}, [[11, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 12}, [[12, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 13}, [[13, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 14}, [[14, 0], 4, True, True, False])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    physical = max(r['local_p'],r['remote_p'],r['wall'])
    local_owns = physical == r['local_p']
    remote_owns = physical == r['remote_p']
    logical = max(r['local_l'],r['remote_l']) + 1 if local_owns and remote_owns else (r['local_l'] + 1 if local_owns else (r['remote_l'] + 1 if remote_owns else 0))
    carry = logical // 257
    normalized_p = physical + carry
    normalized_l = logical % 256
    mask = int(local_owns) + 2 * int(remote_owns) + 4 * int(physical == r['wall'])
    after_local = (normalized_p,normalized_l) > (r['local_p'],r['local_l'])
    after_remote = (normalized_p,normalized_l) > (r['remote_p'],r['remote_l'])
    return [[normalized_p,normalized_l],mask,after_local,after_remote,normalized_p > r['wall']]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 9}), [[10, 5], 3, True, True, True])
check('fixture 2', solve({'local_p': 10, 'local_l': 5, 'remote_p': 9, 'remote_l': 8, 'wall': 8}), [[10, 6], 1, True, True, True])
check('fixture 3', solve({'local_p': 9, 'local_l': 7, 'remote_p': 10, 'remote_l': 2, 'wall': 8}), [[10, 3], 2, True, True, True])
check('fixture 4', solve({'local_p': 10, 'local_l': 5, 'remote_p': 10, 'remote_l': 7, 'wall': 11}), [[11, 0], 4, True, True, False])
check('fixture 5', solve({'local_p': 10, 'local_l': 255, 'remote_p': 10, 'remote_l': 2, 'wall': 10}), [[11, 0], 7, True, True, True])
check('fixture 6', solve({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 255, 'wall': 9}), [[11, 0], 3, True, True, True])
check('fixture 7', solve({'local_p': 10, 'local_l': 0, 'remote_p': 10, 'remote_l': 0, 'wall': 10}), [[10, 1], 7, True, True, False])
check('fixture 8', solve({'local_p': 1, 'local_l': 200, 'remote_p': 2, 'remote_l': 0, 'wall': 1}), [[2, 1], 2, True, True, True])
check('fixture 9', solve({'local_p': 2, 'local_l': 0, 'remote_p': 1, 'remote_l': 200, 'wall': 1}), [[2, 1], 1, True, True, True])
check('fixture 10', solve({'local_p': 0, 'local_l': 0, 'remote_p': 0, 'remote_l': 0, 'wall': 1}), [[1, 0], 4, True, True, False])
check('fixture 11', solve({'local_p': 10, 'local_l': 254, 'remote_p': 10, 'remote_l': 0, 'wall': 9}), [[10, 255], 3, True, True, True])
variant = [({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 10}, [[10, 5], 7, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 11}, [[11, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 12}, [[12, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 13}, [[13, 0], 4, True, True, False]), ({'local_p': 10, 'local_l': 2, 'remote_p': 10, 'remote_l': 4, 'wall': 14}, [[14, 0], 4, True, True, False])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][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)

prompt:
The decoded time state disagrees with the explicit regression oracle for carry.

A bounded hybrid logical timestamp has physical integer p and logical integer l, cap 255. On receive, p=max(local p,remote p,wall). Increment max logical when both timestamps share p, increment owning side when only one shares p, otherwise reset logical to zero. Carry logical overflow into physical. Return canonical pair, physical source mask, ordering versus inputs and wall-advance flag.

split: open-access