broken_source:
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    magnitude = abs(r['debt'])
    capacity = r['elapsed'] * r['rate']
    direction = (r['debt'] > 0) - (r['debt'] < 0)
    applied = direction * max(magnitude,capacity)
    remaining = r['debt'] - applied
    advance = r['elapsed'] + applied
    wall = r['wall'] + advance
    complete = remaining == 0
    unused = capacity - abs(applied)
    cumulative = r['prior_correction'] + applied
    return [remaining,wall,complete,unused,cumulative]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 4}), [4, 109, False, 0, 10])
check('fixture 2', solve({'debt': -10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': -4}), [-4, 97, False, 0, -10])
check('fixture 3', solve({'debt': 4, 'elapsed': 2, 'rate': 2, 'wall': 20, 'prior_correction': 0}), [0, 26, True, 0, 4])
check('fixture 4', solve({'debt': 0, 'elapsed': 3, 'rate': 1, 'wall': 10, 'prior_correction': 8}), [0, 13, True, 3, 8])
check('fixture 5', solve({'debt': 3, 'elapsed': 0, 'rate': 2, 'wall': 50, 'prior_correction': 2}), [3, 50, False, 0, 2])
check('fixture 6', solve({'debt': -2, 'elapsed': 5, 'rate': 1, 'wall': -10, 'prior_correction': 7}), [0, -7, True, 3, 5])
check('fixture 7', solve({'debt': 20, 'elapsed': 4, 'rate': 0, 'wall': 100, 'prior_correction': 3}), [20, 104, False, 0, 3])
check('fixture 8', solve({'debt': 1, 'elapsed': 3, 'rate': 2, 'wall': 0, 'prior_correction': -1}), [0, 4, True, 5, 0])
check('fixture 9', solve({'debt': -3, 'elapsed': 2, 'rate': 2, 'wall': 4, 'prior_correction': -1}), [0, 3, True, 1, -4])
check('fixture 10', solve({'debt': 0, 'elapsed': 0, 'rate': 0, 'wall': 0, 'prior_correction': 0}), [0, 0, True, 0, 0])
variant = [({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 5}, [4, 109, False, 0, 11]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 6}, [4, 109, False, 0, 12]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 7}, [4, 109, False, 0, 13]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 8}, [4, 109, False, 0, 14]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 9}, [4, 109, False, 0, 15])]
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):
    magnitude = abs(r['debt'])
    capacity = r['elapsed'] * r['rate']
    direction = (r['debt'] > 0) - (r['debt'] < 0)
    applied = min(magnitude,capacity)
    remaining = r['debt'] - applied
    advance = r['elapsed'] + applied
    wall = r['wall'] + advance
    complete = remaining == 0
    unused = capacity - abs(applied)
    cumulative = r['prior_correction'] + applied
    return [remaining,wall,complete,unused,cumulative]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 4}), [4, 109, False, 0, 10])
check('fixture 2', solve({'debt': -10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': -4}), [-4, 97, False, 0, -10])
check('fixture 3', solve({'debt': 4, 'elapsed': 2, 'rate': 2, 'wall': 20, 'prior_correction': 0}), [0, 26, True, 0, 4])
check('fixture 4', solve({'debt': 0, 'elapsed': 3, 'rate': 1, 'wall': 10, 'prior_correction': 8}), [0, 13, True, 3, 8])
check('fixture 5', solve({'debt': 3, 'elapsed': 0, 'rate': 2, 'wall': 50, 'prior_correction': 2}), [3, 50, False, 0, 2])
check('fixture 6', solve({'debt': -2, 'elapsed': 5, 'rate': 1, 'wall': -10, 'prior_correction': 7}), [0, -7, True, 3, 5])
check('fixture 7', solve({'debt': 20, 'elapsed': 4, 'rate': 0, 'wall': 100, 'prior_correction': 3}), [20, 104, False, 0, 3])
check('fixture 8', solve({'debt': 1, 'elapsed': 3, 'rate': 2, 'wall': 0, 'prior_correction': -1}), [0, 4, True, 5, 0])
check('fixture 9', solve({'debt': -3, 'elapsed': 2, 'rate': 2, 'wall': 4, 'prior_correction': -1}), [0, 3, True, 1, -4])
check('fixture 10', solve({'debt': 0, 'elapsed': 0, 'rate': 0, 'wall': 0, 'prior_correction': 0}), [0, 0, True, 0, 0])
variant = [({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 5}, [4, 109, False, 0, 11]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 6}, [4, 109, False, 0, 12]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 7}, [4, 109, False, 0, 13]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 8}, [4, 109, False, 0, 14]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 9}, [4, 109, False, 0, 15])]
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 applied.

Slew signed phase debt at capacity elapsed*rate without changing ordinary elapsed advancement. Return signed remaining debt, new wall coordinate, completion flag, unused correction capacity and signed cumulative correction. Elapsed and rate are nonnegative integers; wall and debt may be signed.

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):
    magnitude = abs(r['debt'])
    capacity = r['elapsed'] * r['rate']
    direction = (r['debt'] > 0) - (r['debt'] < 0)
    applied = direction * min(magnitude,capacity)
    remaining = r['debt'] + applied
    advance = r['elapsed'] + applied
    wall = r['wall'] + advance
    complete = remaining == 0
    unused = capacity - abs(applied)
    cumulative = r['prior_correction'] + applied
    return [remaining,wall,complete,unused,cumulative]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 4}), [4, 109, False, 0, 10])
check('fixture 2', solve({'debt': -10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': -4}), [-4, 97, False, 0, -10])
check('fixture 3', solve({'debt': 4, 'elapsed': 2, 'rate': 2, 'wall': 20, 'prior_correction': 0}), [0, 26, True, 0, 4])
check('fixture 4', solve({'debt': 0, 'elapsed': 3, 'rate': 1, 'wall': 10, 'prior_correction': 8}), [0, 13, True, 3, 8])
check('fixture 5', solve({'debt': 3, 'elapsed': 0, 'rate': 2, 'wall': 50, 'prior_correction': 2}), [3, 50, False, 0, 2])
check('fixture 6', solve({'debt': -2, 'elapsed': 5, 'rate': 1, 'wall': -10, 'prior_correction': 7}), [0, -7, True, 3, 5])
check('fixture 7', solve({'debt': 20, 'elapsed': 4, 'rate': 0, 'wall': 100, 'prior_correction': 3}), [20, 104, False, 0, 3])
check('fixture 8', solve({'debt': 1, 'elapsed': 3, 'rate': 2, 'wall': 0, 'prior_correction': -1}), [0, 4, True, 5, 0])
check('fixture 9', solve({'debt': -3, 'elapsed': 2, 'rate': 2, 'wall': 4, 'prior_correction': -1}), [0, 3, True, 1, -4])
check('fixture 10', solve({'debt': 0, 'elapsed': 0, 'rate': 0, 'wall': 0, 'prior_correction': 0}), [0, 0, True, 0, 0])
variant = [({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 5}, [4, 109, False, 0, 11]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 6}, [4, 109, False, 0, 12]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 7}, [4, 109, False, 0, 13]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 8}, [4, 109, False, 0, 14]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 9}, [4, 109, False, 0, 15])]
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):
    magnitude = abs(r['debt'])
    capacity = r['elapsed'] * r['rate']
    direction = (r['debt'] > 0) - (r['debt'] < 0)
    applied = direction * min(magnitude,capacity)
    remaining = max(0,r['debt'] - applied)
    advance = r['elapsed'] + applied
    wall = r['wall'] + advance
    complete = remaining == 0
    unused = capacity - abs(applied)
    cumulative = r['prior_correction'] + applied
    return [remaining,wall,complete,unused,cumulative]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 4}), [4, 109, False, 0, 10])
check('fixture 2', solve({'debt': -10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': -4}), [-4, 97, False, 0, -10])
check('fixture 3', solve({'debt': 4, 'elapsed': 2, 'rate': 2, 'wall': 20, 'prior_correction': 0}), [0, 26, True, 0, 4])
check('fixture 4', solve({'debt': 0, 'elapsed': 3, 'rate': 1, 'wall': 10, 'prior_correction': 8}), [0, 13, True, 3, 8])
check('fixture 5', solve({'debt': 3, 'elapsed': 0, 'rate': 2, 'wall': 50, 'prior_correction': 2}), [3, 50, False, 0, 2])
check('fixture 6', solve({'debt': -2, 'elapsed': 5, 'rate': 1, 'wall': -10, 'prior_correction': 7}), [0, -7, True, 3, 5])
check('fixture 7', solve({'debt': 20, 'elapsed': 4, 'rate': 0, 'wall': 100, 'prior_correction': 3}), [20, 104, False, 0, 3])
check('fixture 8', solve({'debt': 1, 'elapsed': 3, 'rate': 2, 'wall': 0, 'prior_correction': -1}), [0, 4, True, 5, 0])
check('fixture 9', solve({'debt': -3, 'elapsed': 2, 'rate': 2, 'wall': 4, 'prior_correction': -1}), [0, 3, True, 1, -4])
check('fixture 10', solve({'debt': 0, 'elapsed': 0, 'rate': 0, 'wall': 0, 'prior_correction': 0}), [0, 0, True, 0, 0])
variant = [({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 5}, [4, 109, False, 0, 11]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 6}, [4, 109, False, 0, 12]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 7}, [4, 109, False, 0, 13]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 8}, [4, 109, False, 0, 14]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 9}, [4, 109, False, 0, 15])]
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 remaining.

Slew signed phase debt at capacity elapsed*rate without changing ordinary elapsed advancement. Return signed remaining debt, new wall coordinate, completion flag, unused correction capacity and signed cumulative correction. Elapsed and rate are nonnegative integers; wall and debt may be signed.

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):
    magnitude = abs(r['debt'])
    capacity = r['elapsed'] * r['rate']
    direction = (r['debt'] > 0) - (r['debt'] < 0)
    applied = direction * min(magnitude,capacity)
    remaining = r['debt'] - applied
    advance = applied
    wall = r['wall'] + advance
    complete = remaining == 0
    unused = capacity - abs(applied)
    cumulative = r['prior_correction'] + applied
    return [remaining,wall,complete,unused,cumulative]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 4}), [4, 109, False, 0, 10])
check('fixture 2', solve({'debt': -10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': -4}), [-4, 97, False, 0, -10])
check('fixture 3', solve({'debt': 4, 'elapsed': 2, 'rate': 2, 'wall': 20, 'prior_correction': 0}), [0, 26, True, 0, 4])
check('fixture 4', solve({'debt': 0, 'elapsed': 3, 'rate': 1, 'wall': 10, 'prior_correction': 8}), [0, 13, True, 3, 8])
check('fixture 5', solve({'debt': 3, 'elapsed': 0, 'rate': 2, 'wall': 50, 'prior_correction': 2}), [3, 50, False, 0, 2])
check('fixture 6', solve({'debt': -2, 'elapsed': 5, 'rate': 1, 'wall': -10, 'prior_correction': 7}), [0, -7, True, 3, 5])
check('fixture 7', solve({'debt': 20, 'elapsed': 4, 'rate': 0, 'wall': 100, 'prior_correction': 3}), [20, 104, False, 0, 3])
check('fixture 8', solve({'debt': 1, 'elapsed': 3, 'rate': 2, 'wall': 0, 'prior_correction': -1}), [0, 4, True, 5, 0])
check('fixture 9', solve({'debt': -3, 'elapsed': 2, 'rate': 2, 'wall': 4, 'prior_correction': -1}), [0, 3, True, 1, -4])
check('fixture 10', solve({'debt': 0, 'elapsed': 0, 'rate': 0, 'wall': 0, 'prior_correction': 0}), [0, 0, True, 0, 0])
variant = [({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 5}, [4, 109, False, 0, 11]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 6}, [4, 109, False, 0, 12]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 7}, [4, 109, False, 0, 13]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 8}, [4, 109, False, 0, 14]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 9}, [4, 109, False, 0, 15])]
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):
    magnitude = abs(r['debt'])
    capacity = r['elapsed'] * r['rate']
    direction = (r['debt'] > 0) - (r['debt'] < 0)
    applied = direction * min(magnitude,capacity)
    remaining = r['debt'] - applied
    advance = r['elapsed'] - applied
    wall = r['wall'] + advance
    complete = remaining == 0
    unused = capacity - abs(applied)
    cumulative = r['prior_correction'] + applied
    return [remaining,wall,complete,unused,cumulative]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 4}), [4, 109, False, 0, 10])
check('fixture 2', solve({'debt': -10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': -4}), [-4, 97, False, 0, -10])
check('fixture 3', solve({'debt': 4, 'elapsed': 2, 'rate': 2, 'wall': 20, 'prior_correction': 0}), [0, 26, True, 0, 4])
check('fixture 4', solve({'debt': 0, 'elapsed': 3, 'rate': 1, 'wall': 10, 'prior_correction': 8}), [0, 13, True, 3, 8])
check('fixture 5', solve({'debt': 3, 'elapsed': 0, 'rate': 2, 'wall': 50, 'prior_correction': 2}), [3, 50, False, 0, 2])
check('fixture 6', solve({'debt': -2, 'elapsed': 5, 'rate': 1, 'wall': -10, 'prior_correction': 7}), [0, -7, True, 3, 5])
check('fixture 7', solve({'debt': 20, 'elapsed': 4, 'rate': 0, 'wall': 100, 'prior_correction': 3}), [20, 104, False, 0, 3])
check('fixture 8', solve({'debt': 1, 'elapsed': 3, 'rate': 2, 'wall': 0, 'prior_correction': -1}), [0, 4, True, 5, 0])
check('fixture 9', solve({'debt': -3, 'elapsed': 2, 'rate': 2, 'wall': 4, 'prior_correction': -1}), [0, 3, True, 1, -4])
check('fixture 10', solve({'debt': 0, 'elapsed': 0, 'rate': 0, 'wall': 0, 'prior_correction': 0}), [0, 0, True, 0, 0])
variant = [({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 5}, [4, 109, False, 0, 11]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 6}, [4, 109, False, 0, 12]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 7}, [4, 109, False, 0, 13]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 8}, [4, 109, False, 0, 14]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 9}, [4, 109, False, 0, 15])]
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 advance.

Slew signed phase debt at capacity elapsed*rate without changing ordinary elapsed advancement. Return signed remaining debt, new wall coordinate, completion flag, unused correction capacity and signed cumulative correction. Elapsed and rate are nonnegative integers; wall and debt may be signed.

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):
    magnitude = abs(r['debt'])
    capacity = r['elapsed'] * r['rate']
    direction = (r['debt'] > 0) - (r['debt'] < 0)
    applied = direction * min(magnitude,capacity)
    remaining = r['debt'] - applied
    advance = r['elapsed'] + applied
    wall = r['wall'] + r['elapsed']
    complete = remaining == 0
    unused = capacity - abs(applied)
    cumulative = r['prior_correction'] + applied
    return [remaining,wall,complete,unused,cumulative]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 4}), [4, 109, False, 0, 10])
check('fixture 2', solve({'debt': -10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': -4}), [-4, 97, False, 0, -10])
check('fixture 3', solve({'debt': 4, 'elapsed': 2, 'rate': 2, 'wall': 20, 'prior_correction': 0}), [0, 26, True, 0, 4])
check('fixture 4', solve({'debt': 0, 'elapsed': 3, 'rate': 1, 'wall': 10, 'prior_correction': 8}), [0, 13, True, 3, 8])
check('fixture 5', solve({'debt': 3, 'elapsed': 0, 'rate': 2, 'wall': 50, 'prior_correction': 2}), [3, 50, False, 0, 2])
check('fixture 6', solve({'debt': -2, 'elapsed': 5, 'rate': 1, 'wall': -10, 'prior_correction': 7}), [0, -7, True, 3, 5])
check('fixture 7', solve({'debt': 20, 'elapsed': 4, 'rate': 0, 'wall': 100, 'prior_correction': 3}), [20, 104, False, 0, 3])
check('fixture 8', solve({'debt': 1, 'elapsed': 3, 'rate': 2, 'wall': 0, 'prior_correction': -1}), [0, 4, True, 5, 0])
check('fixture 9', solve({'debt': -3, 'elapsed': 2, 'rate': 2, 'wall': 4, 'prior_correction': -1}), [0, 3, True, 1, -4])
check('fixture 10', solve({'debt': 0, 'elapsed': 0, 'rate': 0, 'wall': 0, 'prior_correction': 0}), [0, 0, True, 0, 0])
variant = [({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 5}, [4, 109, False, 0, 11]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 6}, [4, 109, False, 0, 12]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 7}, [4, 109, False, 0, 13]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 8}, [4, 109, False, 0, 14]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 9}, [4, 109, False, 0, 15])]
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):
    magnitude = abs(r['debt'])
    capacity = r['elapsed'] * r['rate']
    direction = (r['debt'] > 0) - (r['debt'] < 0)
    applied = direction * min(magnitude,capacity)
    remaining = r['debt'] - applied
    advance = r['elapsed'] + applied
    wall = advance
    complete = remaining == 0
    unused = capacity - abs(applied)
    cumulative = r['prior_correction'] + applied
    return [remaining,wall,complete,unused,cumulative]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 4}), [4, 109, False, 0, 10])
check('fixture 2', solve({'debt': -10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': -4}), [-4, 97, False, 0, -10])
check('fixture 3', solve({'debt': 4, 'elapsed': 2, 'rate': 2, 'wall': 20, 'prior_correction': 0}), [0, 26, True, 0, 4])
check('fixture 4', solve({'debt': 0, 'elapsed': 3, 'rate': 1, 'wall': 10, 'prior_correction': 8}), [0, 13, True, 3, 8])
check('fixture 5', solve({'debt': 3, 'elapsed': 0, 'rate': 2, 'wall': 50, 'prior_correction': 2}), [3, 50, False, 0, 2])
check('fixture 6', solve({'debt': -2, 'elapsed': 5, 'rate': 1, 'wall': -10, 'prior_correction': 7}), [0, -7, True, 3, 5])
check('fixture 7', solve({'debt': 20, 'elapsed': 4, 'rate': 0, 'wall': 100, 'prior_correction': 3}), [20, 104, False, 0, 3])
check('fixture 8', solve({'debt': 1, 'elapsed': 3, 'rate': 2, 'wall': 0, 'prior_correction': -1}), [0, 4, True, 5, 0])
check('fixture 9', solve({'debt': -3, 'elapsed': 2, 'rate': 2, 'wall': 4, 'prior_correction': -1}), [0, 3, True, 1, -4])
check('fixture 10', solve({'debt': 0, 'elapsed': 0, 'rate': 0, 'wall': 0, 'prior_correction': 0}), [0, 0, True, 0, 0])
variant = [({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 5}, [4, 109, False, 0, 11]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 6}, [4, 109, False, 0, 12]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 7}, [4, 109, False, 0, 13]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 8}, [4, 109, False, 0, 14]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 9}, [4, 109, False, 0, 15])]
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 wall.

Slew signed phase debt at capacity elapsed*rate without changing ordinary elapsed advancement. Return signed remaining debt, new wall coordinate, completion flag, unused correction capacity and signed cumulative correction. Elapsed and rate are nonnegative integers; wall and debt may be signed.

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):
    magnitude = abs(r['debt'])
    capacity = r['elapsed'] * r['rate']
    direction = (r['debt'] > 0) - (r['debt'] < 0)
    applied = direction * min(magnitude,capacity)
    remaining = r['debt'] - applied
    advance = r['elapsed'] + applied
    wall = r['wall'] + advance
    complete = applied == 0
    unused = capacity - abs(applied)
    cumulative = r['prior_correction'] + applied
    return [remaining,wall,complete,unused,cumulative]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 4}), [4, 109, False, 0, 10])
check('fixture 2', solve({'debt': -10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': -4}), [-4, 97, False, 0, -10])
check('fixture 3', solve({'debt': 4, 'elapsed': 2, 'rate': 2, 'wall': 20, 'prior_correction': 0}), [0, 26, True, 0, 4])
check('fixture 4', solve({'debt': 0, 'elapsed': 3, 'rate': 1, 'wall': 10, 'prior_correction': 8}), [0, 13, True, 3, 8])
check('fixture 5', solve({'debt': 3, 'elapsed': 0, 'rate': 2, 'wall': 50, 'prior_correction': 2}), [3, 50, False, 0, 2])
check('fixture 6', solve({'debt': -2, 'elapsed': 5, 'rate': 1, 'wall': -10, 'prior_correction': 7}), [0, -7, True, 3, 5])
check('fixture 7', solve({'debt': 20, 'elapsed': 4, 'rate': 0, 'wall': 100, 'prior_correction': 3}), [20, 104, False, 0, 3])
check('fixture 8', solve({'debt': 1, 'elapsed': 3, 'rate': 2, 'wall': 0, 'prior_correction': -1}), [0, 4, True, 5, 0])
check('fixture 9', solve({'debt': -3, 'elapsed': 2, 'rate': 2, 'wall': 4, 'prior_correction': -1}), [0, 3, True, 1, -4])
check('fixture 10', solve({'debt': 0, 'elapsed': 0, 'rate': 0, 'wall': 0, 'prior_correction': 0}), [0, 0, True, 0, 0])
variant = [({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 5}, [4, 109, False, 0, 11]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 6}, [4, 109, False, 0, 12]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 7}, [4, 109, False, 0, 13]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 8}, [4, 109, False, 0, 14]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 9}, [4, 109, False, 0, 15])]
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):
    magnitude = abs(r['debt'])
    capacity = r['elapsed'] * r['rate']
    direction = (r['debt'] > 0) - (r['debt'] < 0)
    applied = direction * min(magnitude,capacity)
    remaining = r['debt'] - applied
    advance = r['elapsed'] + applied
    wall = r['wall'] + advance
    complete = remaining <= 0
    unused = capacity - abs(applied)
    cumulative = r['prior_correction'] + applied
    return [remaining,wall,complete,unused,cumulative]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 4}), [4, 109, False, 0, 10])
check('fixture 2', solve({'debt': -10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': -4}), [-4, 97, False, 0, -10])
check('fixture 3', solve({'debt': 4, 'elapsed': 2, 'rate': 2, 'wall': 20, 'prior_correction': 0}), [0, 26, True, 0, 4])
check('fixture 4', solve({'debt': 0, 'elapsed': 3, 'rate': 1, 'wall': 10, 'prior_correction': 8}), [0, 13, True, 3, 8])
check('fixture 5', solve({'debt': 3, 'elapsed': 0, 'rate': 2, 'wall': 50, 'prior_correction': 2}), [3, 50, False, 0, 2])
check('fixture 6', solve({'debt': -2, 'elapsed': 5, 'rate': 1, 'wall': -10, 'prior_correction': 7}), [0, -7, True, 3, 5])
check('fixture 7', solve({'debt': 20, 'elapsed': 4, 'rate': 0, 'wall': 100, 'prior_correction': 3}), [20, 104, False, 0, 3])
check('fixture 8', solve({'debt': 1, 'elapsed': 3, 'rate': 2, 'wall': 0, 'prior_correction': -1}), [0, 4, True, 5, 0])
check('fixture 9', solve({'debt': -3, 'elapsed': 2, 'rate': 2, 'wall': 4, 'prior_correction': -1}), [0, 3, True, 1, -4])
check('fixture 10', solve({'debt': 0, 'elapsed': 0, 'rate': 0, 'wall': 0, 'prior_correction': 0}), [0, 0, True, 0, 0])
variant = [({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 5}, [4, 109, False, 0, 11]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 6}, [4, 109, False, 0, 12]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 7}, [4, 109, False, 0, 13]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 8}, [4, 109, False, 0, 14]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 9}, [4, 109, False, 0, 15])]
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 complete.

Slew signed phase debt at capacity elapsed*rate without changing ordinary elapsed advancement. Return signed remaining debt, new wall coordinate, completion flag, unused correction capacity and signed cumulative correction. Elapsed and rate are nonnegative integers; wall and debt may be signed.

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):
    magnitude = abs(r['debt'])
    capacity = r['elapsed'] * r['rate']
    direction = (r['debt'] > 0) - (r['debt'] < 0)
    applied = direction * min(magnitude,capacity)
    remaining = r['debt'] - applied
    advance = r['elapsed'] + applied
    wall = r['wall'] + advance
    complete = remaining == 0
    unused = capacity - applied
    cumulative = r['prior_correction'] + applied
    return [remaining,wall,complete,unused,cumulative]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 4}), [4, 109, False, 0, 10])
check('fixture 2', solve({'debt': -10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': -4}), [-4, 97, False, 0, -10])
check('fixture 3', solve({'debt': 4, 'elapsed': 2, 'rate': 2, 'wall': 20, 'prior_correction': 0}), [0, 26, True, 0, 4])
check('fixture 4', solve({'debt': 0, 'elapsed': 3, 'rate': 1, 'wall': 10, 'prior_correction': 8}), [0, 13, True, 3, 8])
check('fixture 5', solve({'debt': 3, 'elapsed': 0, 'rate': 2, 'wall': 50, 'prior_correction': 2}), [3, 50, False, 0, 2])
check('fixture 6', solve({'debt': -2, 'elapsed': 5, 'rate': 1, 'wall': -10, 'prior_correction': 7}), [0, -7, True, 3, 5])
check('fixture 7', solve({'debt': 20, 'elapsed': 4, 'rate': 0, 'wall': 100, 'prior_correction': 3}), [20, 104, False, 0, 3])
check('fixture 8', solve({'debt': 1, 'elapsed': 3, 'rate': 2, 'wall': 0, 'prior_correction': -1}), [0, 4, True, 5, 0])
check('fixture 9', solve({'debt': -3, 'elapsed': 2, 'rate': 2, 'wall': 4, 'prior_correction': -1}), [0, 3, True, 1, -4])
check('fixture 10', solve({'debt': 0, 'elapsed': 0, 'rate': 0, 'wall': 0, 'prior_correction': 0}), [0, 0, True, 0, 0])
variant = [({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 5}, [4, 109, False, 0, 11]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 6}, [4, 109, False, 0, 12]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 7}, [4, 109, False, 0, 13]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 8}, [4, 109, False, 0, 14]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 9}, [4, 109, False, 0, 15])]
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):
    magnitude = abs(r['debt'])
    capacity = r['elapsed'] * r['rate']
    direction = (r['debt'] > 0) - (r['debt'] < 0)
    applied = direction * min(magnitude,capacity)
    remaining = r['debt'] - applied
    advance = r['elapsed'] + applied
    wall = r['wall'] + advance
    complete = remaining == 0
    unused = capacity
    cumulative = r['prior_correction'] + applied
    return [remaining,wall,complete,unused,cumulative]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 4}), [4, 109, False, 0, 10])
check('fixture 2', solve({'debt': -10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': -4}), [-4, 97, False, 0, -10])
check('fixture 3', solve({'debt': 4, 'elapsed': 2, 'rate': 2, 'wall': 20, 'prior_correction': 0}), [0, 26, True, 0, 4])
check('fixture 4', solve({'debt': 0, 'elapsed': 3, 'rate': 1, 'wall': 10, 'prior_correction': 8}), [0, 13, True, 3, 8])
check('fixture 5', solve({'debt': 3, 'elapsed': 0, 'rate': 2, 'wall': 50, 'prior_correction': 2}), [3, 50, False, 0, 2])
check('fixture 6', solve({'debt': -2, 'elapsed': 5, 'rate': 1, 'wall': -10, 'prior_correction': 7}), [0, -7, True, 3, 5])
check('fixture 7', solve({'debt': 20, 'elapsed': 4, 'rate': 0, 'wall': 100, 'prior_correction': 3}), [20, 104, False, 0, 3])
check('fixture 8', solve({'debt': 1, 'elapsed': 3, 'rate': 2, 'wall': 0, 'prior_correction': -1}), [0, 4, True, 5, 0])
check('fixture 9', solve({'debt': -3, 'elapsed': 2, 'rate': 2, 'wall': 4, 'prior_correction': -1}), [0, 3, True, 1, -4])
check('fixture 10', solve({'debt': 0, 'elapsed': 0, 'rate': 0, 'wall': 0, 'prior_correction': 0}), [0, 0, True, 0, 0])
variant = [({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 5}, [4, 109, False, 0, 11]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 6}, [4, 109, False, 0, 12]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 7}, [4, 109, False, 0, 13]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 8}, [4, 109, False, 0, 14]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 9}, [4, 109, False, 0, 15])]
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 unused.

Slew signed phase debt at capacity elapsed*rate without changing ordinary elapsed advancement. Return signed remaining debt, new wall coordinate, completion flag, unused correction capacity and signed cumulative correction. Elapsed and rate are nonnegative integers; wall and debt may be signed.

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):
    magnitude = abs(r['debt'])
    capacity = r['elapsed'] * r['rate']
    direction = (r['debt'] > 0) - (r['debt'] < 0)
    applied = direction * min(magnitude,capacity)
    remaining = r['debt'] - applied
    advance = r['elapsed'] + applied
    wall = r['wall'] + advance
    complete = remaining == 0
    unused = capacity - abs(applied)
    cumulative = applied
    return [remaining,wall,complete,unused,cumulative]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 4}), [4, 109, False, 0, 10])
check('fixture 2', solve({'debt': -10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': -4}), [-4, 97, False, 0, -10])
check('fixture 3', solve({'debt': 4, 'elapsed': 2, 'rate': 2, 'wall': 20, 'prior_correction': 0}), [0, 26, True, 0, 4])
check('fixture 4', solve({'debt': 0, 'elapsed': 3, 'rate': 1, 'wall': 10, 'prior_correction': 8}), [0, 13, True, 3, 8])
check('fixture 5', solve({'debt': 3, 'elapsed': 0, 'rate': 2, 'wall': 50, 'prior_correction': 2}), [3, 50, False, 0, 2])
check('fixture 6', solve({'debt': -2, 'elapsed': 5, 'rate': 1, 'wall': -10, 'prior_correction': 7}), [0, -7, True, 3, 5])
check('fixture 7', solve({'debt': 20, 'elapsed': 4, 'rate': 0, 'wall': 100, 'prior_correction': 3}), [20, 104, False, 0, 3])
check('fixture 8', solve({'debt': 1, 'elapsed': 3, 'rate': 2, 'wall': 0, 'prior_correction': -1}), [0, 4, True, 5, 0])
check('fixture 9', solve({'debt': -3, 'elapsed': 2, 'rate': 2, 'wall': 4, 'prior_correction': -1}), [0, 3, True, 1, -4])
check('fixture 10', solve({'debt': 0, 'elapsed': 0, 'rate': 0, 'wall': 0, 'prior_correction': 0}), [0, 0, True, 0, 0])
variant = [({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 5}, [4, 109, False, 0, 11]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 6}, [4, 109, False, 0, 12]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 7}, [4, 109, False, 0, 13]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 8}, [4, 109, False, 0, 14]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 9}, [4, 109, False, 0, 15])]
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):
    magnitude = abs(r['debt'])
    capacity = r['elapsed'] * r['rate']
    direction = (r['debt'] > 0) - (r['debt'] < 0)
    applied = direction * min(magnitude,capacity)
    remaining = r['debt'] - applied
    advance = r['elapsed'] + applied
    wall = r['wall'] + advance
    complete = remaining == 0
    unused = capacity - abs(applied)
    cumulative = r['prior_correction'] + abs(applied)
    return [remaining,wall,complete,unused,cumulative]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 4}), [4, 109, False, 0, 10])
check('fixture 2', solve({'debt': -10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': -4}), [-4, 97, False, 0, -10])
check('fixture 3', solve({'debt': 4, 'elapsed': 2, 'rate': 2, 'wall': 20, 'prior_correction': 0}), [0, 26, True, 0, 4])
check('fixture 4', solve({'debt': 0, 'elapsed': 3, 'rate': 1, 'wall': 10, 'prior_correction': 8}), [0, 13, True, 3, 8])
check('fixture 5', solve({'debt': 3, 'elapsed': 0, 'rate': 2, 'wall': 50, 'prior_correction': 2}), [3, 50, False, 0, 2])
check('fixture 6', solve({'debt': -2, 'elapsed': 5, 'rate': 1, 'wall': -10, 'prior_correction': 7}), [0, -7, True, 3, 5])
check('fixture 7', solve({'debt': 20, 'elapsed': 4, 'rate': 0, 'wall': 100, 'prior_correction': 3}), [20, 104, False, 0, 3])
check('fixture 8', solve({'debt': 1, 'elapsed': 3, 'rate': 2, 'wall': 0, 'prior_correction': -1}), [0, 4, True, 5, 0])
check('fixture 9', solve({'debt': -3, 'elapsed': 2, 'rate': 2, 'wall': 4, 'prior_correction': -1}), [0, 3, True, 1, -4])
check('fixture 10', solve({'debt': 0, 'elapsed': 0, 'rate': 0, 'wall': 0, 'prior_correction': 0}), [0, 0, True, 0, 0])
variant = [({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 5}, [4, 109, False, 0, 11]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 6}, [4, 109, False, 0, 12]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 7}, [4, 109, False, 0, 13]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 8}, [4, 109, False, 0, 14]), ({'debt': 10, 'elapsed': 3, 'rate': 2, 'wall': 100, 'prior_correction': 9}, [4, 109, False, 0, 15])]
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 cumulative.

Slew signed phase debt at capacity elapsed*rate without changing ordinary elapsed advancement. Return signed remaining debt, new wall coordinate, completion flag, unused correction capacity and signed cumulative correction. Elapsed and rate are nonnegative integers; wall and debt may be signed.

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):
    old_candidate = r['local'] + r['old']
    new_candidate = r['local'] - r['new']
    old_valid = old_candidate < r['transition']
    new_valid = new_candidate >= r['transition']
    candidates = sorted(set(([old_candidate] if old_valid else []) + ([new_candidate] if new_valid else [])))
    count = len(candidates)
    ambiguous = count == 2
    chosen = None if count == 0 or (ambiguous and r['policy'] == 'reject') else candidates[-1 if r['policy'] == 'later' else 0]
    offset = None if chosen is None else (r['old'] if chosen < r['transition'] else r['new'])
    roundtrip = None if chosen is None else chosen + offset
    return [candidates,ambiguous,chosen,offset,roundtrip]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local': 109, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[89], False, 89, 20, 109])
check('fixture 2', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[90, 100], True, 90, 20, 110])
check('fixture 3', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[90, 100], True, 100, 10, 110])
check('fixture 4', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[90, 100], True, None, None, None])
check('fixture 5', solve({'local': 119, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[99, 109], True, 109, 10, 119])
check('fixture 6', solve({'local': 120, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[110], False, 110, 10, 120])
check('fixture 7', solve({'local': 100, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[80], False, 80, 20, 100])
check('fixture 8', solve({'local': 130, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[120], False, 120, 10, 130])
check('fixture 9', solve({'local': -20, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[-40], False, -40, 20, -20])
check('fixture 10', solve({'local': 115, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[95, 105], True, 105, 10, 115])
variant = [({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[90, 100], True, 90, 20, 110]), ({'local': 111, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[91, 101], True, 91, 20, 111]), ({'local': 112, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[92, 102], True, 92, 20, 112]), ({'local': 113, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[93, 103], True, 93, 20, 113]), ({'local': 114, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[94, 104], True, 94, 20, 114])]
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):
    old_candidate = r['local'] - r['new']
    new_candidate = r['local'] - r['new']
    old_valid = old_candidate < r['transition']
    new_valid = new_candidate >= r['transition']
    candidates = sorted(set(([old_candidate] if old_valid else []) + ([new_candidate] if new_valid else [])))
    count = len(candidates)
    ambiguous = count == 2
    chosen = None if count == 0 or (ambiguous and r['policy'] == 'reject') else candidates[-1 if r['policy'] == 'later' else 0]
    offset = None if chosen is None else (r['old'] if chosen < r['transition'] else r['new'])
    roundtrip = None if chosen is None else chosen + offset
    return [candidates,ambiguous,chosen,offset,roundtrip]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local': 109, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[89], False, 89, 20, 109])
check('fixture 2', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[90, 100], True, 90, 20, 110])
check('fixture 3', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[90, 100], True, 100, 10, 110])
check('fixture 4', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[90, 100], True, None, None, None])
check('fixture 5', solve({'local': 119, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[99, 109], True, 109, 10, 119])
check('fixture 6', solve({'local': 120, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[110], False, 110, 10, 120])
check('fixture 7', solve({'local': 100, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[80], False, 80, 20, 100])
check('fixture 8', solve({'local': 130, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[120], False, 120, 10, 130])
check('fixture 9', solve({'local': -20, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[-40], False, -40, 20, -20])
check('fixture 10', solve({'local': 115, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[95, 105], True, 105, 10, 115])
variant = [({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[90, 100], True, 90, 20, 110]), ({'local': 111, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[91, 101], True, 91, 20, 111]), ({'local': 112, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[92, 102], True, 92, 20, 112]), ({'local': 113, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[93, 103], True, 93, 20, 113]), ({'local': 114, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[94, 104], True, 94, 20, 114])]
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 old_candidate.

A stipulated backward offset transition at UTC T changes larger old offset to smaller new offset. Candidate UTC coordinates local-offset are admitted on their owning sides (<T old, >=T new). Return sorted unique candidates, ambiguity flag, selected instant under earlier/later/reject policy, selected offset and civil roundtrip. No timezone database is modeled.

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):
    old_candidate = r['local'] - r['old']
    new_candidate = r['local'] + r['new']
    old_valid = old_candidate < r['transition']
    new_valid = new_candidate >= r['transition']
    candidates = sorted(set(([old_candidate] if old_valid else []) + ([new_candidate] if new_valid else [])))
    count = len(candidates)
    ambiguous = count == 2
    chosen = None if count == 0 or (ambiguous and r['policy'] == 'reject') else candidates[-1 if r['policy'] == 'later' else 0]
    offset = None if chosen is None else (r['old'] if chosen < r['transition'] else r['new'])
    roundtrip = None if chosen is None else chosen + offset
    return [candidates,ambiguous,chosen,offset,roundtrip]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local': 109, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[89], False, 89, 20, 109])
check('fixture 2', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[90, 100], True, 90, 20, 110])
check('fixture 3', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[90, 100], True, 100, 10, 110])
check('fixture 4', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[90, 100], True, None, None, None])
check('fixture 5', solve({'local': 119, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[99, 109], True, 109, 10, 119])
check('fixture 6', solve({'local': 120, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[110], False, 110, 10, 120])
check('fixture 7', solve({'local': 100, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[80], False, 80, 20, 100])
check('fixture 8', solve({'local': 130, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[120], False, 120, 10, 130])
check('fixture 9', solve({'local': -20, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[-40], False, -40, 20, -20])
check('fixture 10', solve({'local': 115, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[95, 105], True, 105, 10, 115])
variant = [({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[90, 100], True, 90, 20, 110]), ({'local': 111, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[91, 101], True, 91, 20, 111]), ({'local': 112, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[92, 102], True, 92, 20, 112]), ({'local': 113, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[93, 103], True, 93, 20, 113]), ({'local': 114, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[94, 104], True, 94, 20, 114])]
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):
    old_candidate = r['local'] - r['old']
    new_candidate = r['local'] - r['old']
    old_valid = old_candidate < r['transition']
    new_valid = new_candidate >= r['transition']
    candidates = sorted(set(([old_candidate] if old_valid else []) + ([new_candidate] if new_valid else [])))
    count = len(candidates)
    ambiguous = count == 2
    chosen = None if count == 0 or (ambiguous and r['policy'] == 'reject') else candidates[-1 if r['policy'] == 'later' else 0]
    offset = None if chosen is None else (r['old'] if chosen < r['transition'] else r['new'])
    roundtrip = None if chosen is None else chosen + offset
    return [candidates,ambiguous,chosen,offset,roundtrip]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local': 109, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[89], False, 89, 20, 109])
check('fixture 2', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[90, 100], True, 90, 20, 110])
check('fixture 3', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[90, 100], True, 100, 10, 110])
check('fixture 4', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[90, 100], True, None, None, None])
check('fixture 5', solve({'local': 119, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[99, 109], True, 109, 10, 119])
check('fixture 6', solve({'local': 120, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[110], False, 110, 10, 120])
check('fixture 7', solve({'local': 100, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[80], False, 80, 20, 100])
check('fixture 8', solve({'local': 130, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[120], False, 120, 10, 130])
check('fixture 9', solve({'local': -20, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[-40], False, -40, 20, -20])
check('fixture 10', solve({'local': 115, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[95, 105], True, 105, 10, 115])
variant = [({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[90, 100], True, 90, 20, 110]), ({'local': 111, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[91, 101], True, 91, 20, 111]), ({'local': 112, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[92, 102], True, 92, 20, 112]), ({'local': 113, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[93, 103], True, 93, 20, 113]), ({'local': 114, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[94, 104], True, 94, 20, 114])]
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 new_candidate.

A stipulated backward offset transition at UTC T changes larger old offset to smaller new offset. Candidate UTC coordinates local-offset are admitted on their owning sides (<T old, >=T new). Return sorted unique candidates, ambiguity flag, selected instant under earlier/later/reject policy, selected offset and civil roundtrip. No timezone database is modeled.

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):
    old_candidate = r['local'] - r['old']
    new_candidate = r['local'] - r['new']
    old_valid = old_candidate <= r['transition']
    new_valid = new_candidate >= r['transition']
    candidates = sorted(set(([old_candidate] if old_valid else []) + ([new_candidate] if new_valid else [])))
    count = len(candidates)
    ambiguous = count == 2
    chosen = None if count == 0 or (ambiguous and r['policy'] == 'reject') else candidates[-1 if r['policy'] == 'later' else 0]
    offset = None if chosen is None else (r['old'] if chosen < r['transition'] else r['new'])
    roundtrip = None if chosen is None else chosen + offset
    return [candidates,ambiguous,chosen,offset,roundtrip]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local': 109, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[89], False, 89, 20, 109])
check('fixture 2', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[90, 100], True, 90, 20, 110])
check('fixture 3', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[90, 100], True, 100, 10, 110])
check('fixture 4', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[90, 100], True, None, None, None])
check('fixture 5', solve({'local': 119, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[99, 109], True, 109, 10, 119])
check('fixture 6', solve({'local': 120, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[110], False, 110, 10, 120])
check('fixture 7', solve({'local': 100, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[80], False, 80, 20, 100])
check('fixture 8', solve({'local': 130, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[120], False, 120, 10, 130])
check('fixture 9', solve({'local': -20, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[-40], False, -40, 20, -20])
check('fixture 10', solve({'local': 115, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[95, 105], True, 105, 10, 115])
variant = [({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[90, 100], True, 90, 20, 110]), ({'local': 111, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[91, 101], True, 91, 20, 111]), ({'local': 112, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[92, 102], True, 92, 20, 112]), ({'local': 113, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[93, 103], True, 93, 20, 113]), ({'local': 114, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[94, 104], True, 94, 20, 114])]
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):
    old_candidate = r['local'] - r['old']
    new_candidate = r['local'] - r['new']
    old_valid = r['local'] < r['transition']
    new_valid = new_candidate >= r['transition']
    candidates = sorted(set(([old_candidate] if old_valid else []) + ([new_candidate] if new_valid else [])))
    count = len(candidates)
    ambiguous = count == 2
    chosen = None if count == 0 or (ambiguous and r['policy'] == 'reject') else candidates[-1 if r['policy'] == 'later' else 0]
    offset = None if chosen is None else (r['old'] if chosen < r['transition'] else r['new'])
    roundtrip = None if chosen is None else chosen + offset
    return [candidates,ambiguous,chosen,offset,roundtrip]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local': 109, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[89], False, 89, 20, 109])
check('fixture 2', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[90, 100], True, 90, 20, 110])
check('fixture 3', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[90, 100], True, 100, 10, 110])
check('fixture 4', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[90, 100], True, None, None, None])
check('fixture 5', solve({'local': 119, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[99, 109], True, 109, 10, 119])
check('fixture 6', solve({'local': 120, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[110], False, 110, 10, 120])
check('fixture 7', solve({'local': 100, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[80], False, 80, 20, 100])
check('fixture 8', solve({'local': 130, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[120], False, 120, 10, 130])
check('fixture 9', solve({'local': -20, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[-40], False, -40, 20, -20])
check('fixture 10', solve({'local': 115, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[95, 105], True, 105, 10, 115])
variant = [({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[90, 100], True, 90, 20, 110]), ({'local': 111, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[91, 101], True, 91, 20, 111]), ({'local': 112, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[92, 102], True, 92, 20, 112]), ({'local': 113, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[93, 103], True, 93, 20, 113]), ({'local': 114, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[94, 104], True, 94, 20, 114])]
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 old_valid.

A stipulated backward offset transition at UTC T changes larger old offset to smaller new offset. Candidate UTC coordinates local-offset are admitted on their owning sides (<T old, >=T new). Return sorted unique candidates, ambiguity flag, selected instant under earlier/later/reject policy, selected offset and civil roundtrip. No timezone database is modeled.

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):
    old_candidate = r['local'] - r['old']
    new_candidate = r['local'] - r['new']
    old_valid = old_candidate < r['transition']
    new_valid = new_candidate > r['transition']
    candidates = sorted(set(([old_candidate] if old_valid else []) + ([new_candidate] if new_valid else [])))
    count = len(candidates)
    ambiguous = count == 2
    chosen = None if count == 0 or (ambiguous and r['policy'] == 'reject') else candidates[-1 if r['policy'] == 'later' else 0]
    offset = None if chosen is None else (r['old'] if chosen < r['transition'] else r['new'])
    roundtrip = None if chosen is None else chosen + offset
    return [candidates,ambiguous,chosen,offset,roundtrip]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local': 109, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[89], False, 89, 20, 109])
check('fixture 2', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[90, 100], True, 90, 20, 110])
check('fixture 3', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[90, 100], True, 100, 10, 110])
check('fixture 4', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[90, 100], True, None, None, None])
check('fixture 5', solve({'local': 119, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[99, 109], True, 109, 10, 119])
check('fixture 6', solve({'local': 120, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[110], False, 110, 10, 120])
check('fixture 7', solve({'local': 100, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[80], False, 80, 20, 100])
check('fixture 8', solve({'local': 130, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[120], False, 120, 10, 130])
check('fixture 9', solve({'local': -20, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[-40], False, -40, 20, -20])
check('fixture 10', solve({'local': 115, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[95, 105], True, 105, 10, 115])
variant = [({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[90, 100], True, 90, 20, 110]), ({'local': 111, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[91, 101], True, 91, 20, 111]), ({'local': 112, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[92, 102], True, 92, 20, 112]), ({'local': 113, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[93, 103], True, 93, 20, 113]), ({'local': 114, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[94, 104], True, 94, 20, 114])]
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):
    old_candidate = r['local'] - r['old']
    new_candidate = r['local'] - r['new']
    old_valid = old_candidate < r['transition']
    new_valid = r['local'] >= r['transition']
    candidates = sorted(set(([old_candidate] if old_valid else []) + ([new_candidate] if new_valid else [])))
    count = len(candidates)
    ambiguous = count == 2
    chosen = None if count == 0 or (ambiguous and r['policy'] == 'reject') else candidates[-1 if r['policy'] == 'later' else 0]
    offset = None if chosen is None else (r['old'] if chosen < r['transition'] else r['new'])
    roundtrip = None if chosen is None else chosen + offset
    return [candidates,ambiguous,chosen,offset,roundtrip]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local': 109, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[89], False, 89, 20, 109])
check('fixture 2', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[90, 100], True, 90, 20, 110])
check('fixture 3', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[90, 100], True, 100, 10, 110])
check('fixture 4', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[90, 100], True, None, None, None])
check('fixture 5', solve({'local': 119, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[99, 109], True, 109, 10, 119])
check('fixture 6', solve({'local': 120, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[110], False, 110, 10, 120])
check('fixture 7', solve({'local': 100, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[80], False, 80, 20, 100])
check('fixture 8', solve({'local': 130, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[120], False, 120, 10, 130])
check('fixture 9', solve({'local': -20, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[-40], False, -40, 20, -20])
check('fixture 10', solve({'local': 115, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[95, 105], True, 105, 10, 115])
variant = [({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[90, 100], True, 90, 20, 110]), ({'local': 111, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[91, 101], True, 91, 20, 111]), ({'local': 112, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[92, 102], True, 92, 20, 112]), ({'local': 113, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[93, 103], True, 93, 20, 113]), ({'local': 114, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[94, 104], True, 94, 20, 114])]
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 new_valid.

A stipulated backward offset transition at UTC T changes larger old offset to smaller new offset. Candidate UTC coordinates local-offset are admitted on their owning sides (<T old, >=T new). Return sorted unique candidates, ambiguity flag, selected instant under earlier/later/reject policy, selected offset and civil roundtrip. No timezone database is modeled.

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):
    old_candidate = r['local'] - r['old']
    new_candidate = r['local'] - r['new']
    old_valid = old_candidate < r['transition']
    new_valid = new_candidate >= r['transition']
    candidates = [old_candidate] if old_valid else [new_candidate]
    count = len(candidates)
    ambiguous = count == 2
    chosen = None if count == 0 or (ambiguous and r['policy'] == 'reject') else candidates[-1 if r['policy'] == 'later' else 0]
    offset = None if chosen is None else (r['old'] if chosen < r['transition'] else r['new'])
    roundtrip = None if chosen is None else chosen + offset
    return [candidates,ambiguous,chosen,offset,roundtrip]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local': 109, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[89], False, 89, 20, 109])
check('fixture 2', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[90, 100], True, 90, 20, 110])
check('fixture 3', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[90, 100], True, 100, 10, 110])
check('fixture 4', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[90, 100], True, None, None, None])
check('fixture 5', solve({'local': 119, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[99, 109], True, 109, 10, 119])
check('fixture 6', solve({'local': 120, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[110], False, 110, 10, 120])
check('fixture 7', solve({'local': 100, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[80], False, 80, 20, 100])
check('fixture 8', solve({'local': 130, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[120], False, 120, 10, 130])
check('fixture 9', solve({'local': -20, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[-40], False, -40, 20, -20])
check('fixture 10', solve({'local': 115, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[95, 105], True, 105, 10, 115])
variant = [({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[90, 100], True, 90, 20, 110]), ({'local': 111, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[91, 101], True, 91, 20, 111]), ({'local': 112, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[92, 102], True, 92, 20, 112]), ({'local': 113, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[93, 103], True, 93, 20, 113]), ({'local': 114, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[94, 104], True, 94, 20, 114])]
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):
    old_candidate = r['local'] - r['old']
    new_candidate = r['local'] - r['new']
    old_valid = old_candidate < r['transition']
    new_valid = new_candidate >= r['transition']
    candidates = sorted(set([old_candidate,new_candidate]))
    count = len(candidates)
    ambiguous = count == 2
    chosen = None if count == 0 or (ambiguous and r['policy'] == 'reject') else candidates[-1 if r['policy'] == 'later' else 0]
    offset = None if chosen is None else (r['old'] if chosen < r['transition'] else r['new'])
    roundtrip = None if chosen is None else chosen + offset
    return [candidates,ambiguous,chosen,offset,roundtrip]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local': 109, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[89], False, 89, 20, 109])
check('fixture 2', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[90, 100], True, 90, 20, 110])
check('fixture 3', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[90, 100], True, 100, 10, 110])
check('fixture 4', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[90, 100], True, None, None, None])
check('fixture 5', solve({'local': 119, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[99, 109], True, 109, 10, 119])
check('fixture 6', solve({'local': 120, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[110], False, 110, 10, 120])
check('fixture 7', solve({'local': 100, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[80], False, 80, 20, 100])
check('fixture 8', solve({'local': 130, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[120], False, 120, 10, 130])
check('fixture 9', solve({'local': -20, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[-40], False, -40, 20, -20])
check('fixture 10', solve({'local': 115, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[95, 105], True, 105, 10, 115])
variant = [({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[90, 100], True, 90, 20, 110]), ({'local': 111, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[91, 101], True, 91, 20, 111]), ({'local': 112, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[92, 102], True, 92, 20, 112]), ({'local': 113, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[93, 103], True, 93, 20, 113]), ({'local': 114, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[94, 104], True, 94, 20, 114])]
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 candidates.

A stipulated backward offset transition at UTC T changes larger old offset to smaller new offset. Candidate UTC coordinates local-offset are admitted on their owning sides (<T old, >=T new). Return sorted unique candidates, ambiguity flag, selected instant under earlier/later/reject policy, selected offset and civil roundtrip. No timezone database is modeled.

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):
    old_candidate = r['local'] - r['old']
    new_candidate = r['local'] - r['new']
    old_valid = old_candidate < r['transition']
    new_valid = new_candidate >= r['transition']
    candidates = sorted(set(([old_candidate] if old_valid else []) + ([new_candidate] if new_valid else [])))
    count = int(bool(candidates))
    ambiguous = count == 2
    chosen = None if count == 0 or (ambiguous and r['policy'] == 'reject') else candidates[-1 if r['policy'] == 'later' else 0]
    offset = None if chosen is None else (r['old'] if chosen < r['transition'] else r['new'])
    roundtrip = None if chosen is None else chosen + offset
    return [candidates,ambiguous,chosen,offset,roundtrip]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local': 109, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[89], False, 89, 20, 109])
check('fixture 2', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[90, 100], True, 90, 20, 110])
check('fixture 3', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[90, 100], True, 100, 10, 110])
check('fixture 4', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[90, 100], True, None, None, None])
check('fixture 5', solve({'local': 119, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[99, 109], True, 109, 10, 119])
check('fixture 6', solve({'local': 120, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[110], False, 110, 10, 120])
check('fixture 7', solve({'local': 100, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[80], False, 80, 20, 100])
check('fixture 8', solve({'local': 130, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[120], False, 120, 10, 130])
check('fixture 9', solve({'local': -20, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[-40], False, -40, 20, -20])
check('fixture 10', solve({'local': 115, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[95, 105], True, 105, 10, 115])
variant = [({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[90, 100], True, 90, 20, 110]), ({'local': 111, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[91, 101], True, 91, 20, 111]), ({'local': 112, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[92, 102], True, 92, 20, 112]), ({'local': 113, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[93, 103], True, 93, 20, 113]), ({'local': 114, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[94, 104], True, 94, 20, 114])]
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):
    old_candidate = r['local'] - r['old']
    new_candidate = r['local'] - r['new']
    old_valid = old_candidate < r['transition']
    new_valid = new_candidate >= r['transition']
    candidates = sorted(set(([old_candidate] if old_valid else []) + ([new_candidate] if new_valid else [])))
    count = len(candidates) + 1
    ambiguous = count == 2
    chosen = None if count == 0 or (ambiguous and r['policy'] == 'reject') else candidates[-1 if r['policy'] == 'later' else 0]
    offset = None if chosen is None else (r['old'] if chosen < r['transition'] else r['new'])
    roundtrip = None if chosen is None else chosen + offset
    return [candidates,ambiguous,chosen,offset,roundtrip]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local': 109, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[89], False, 89, 20, 109])
check('fixture 2', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[90, 100], True, 90, 20, 110])
check('fixture 3', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[90, 100], True, 100, 10, 110])
check('fixture 4', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[90, 100], True, None, None, None])
check('fixture 5', solve({'local': 119, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[99, 109], True, 109, 10, 119])
check('fixture 6', solve({'local': 120, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[110], False, 110, 10, 120])
check('fixture 7', solve({'local': 100, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[80], False, 80, 20, 100])
check('fixture 8', solve({'local': 130, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[120], False, 120, 10, 130])
check('fixture 9', solve({'local': -20, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[-40], False, -40, 20, -20])
check('fixture 10', solve({'local': 115, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[95, 105], True, 105, 10, 115])
variant = [({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[90, 100], True, 90, 20, 110]), ({'local': 111, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[91, 101], True, 91, 20, 111]), ({'local': 112, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[92, 102], True, 92, 20, 112]), ({'local': 113, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[93, 103], True, 93, 20, 113]), ({'local': 114, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[94, 104], True, 94, 20, 114])]
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 count.

A stipulated backward offset transition at UTC T changes larger old offset to smaller new offset. Candidate UTC coordinates local-offset are admitted on their owning sides (<T old, >=T new). Return sorted unique candidates, ambiguity flag, selected instant under earlier/later/reject policy, selected offset and civil roundtrip. No timezone database is modeled.

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):
    old_candidate = r['local'] - r['old']
    new_candidate = r['local'] - r['new']
    old_valid = old_candidate < r['transition']
    new_valid = new_candidate >= r['transition']
    candidates = sorted(set(([old_candidate] if old_valid else []) + ([new_candidate] if new_valid else [])))
    count = len(candidates)
    ambiguous = count > 0
    chosen = None if count == 0 or (ambiguous and r['policy'] == 'reject') else candidates[-1 if r['policy'] == 'later' else 0]
    offset = None if chosen is None else (r['old'] if chosen < r['transition'] else r['new'])
    roundtrip = None if chosen is None else chosen + offset
    return [candidates,ambiguous,chosen,offset,roundtrip]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local': 109, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[89], False, 89, 20, 109])
check('fixture 2', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[90, 100], True, 90, 20, 110])
check('fixture 3', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[90, 100], True, 100, 10, 110])
check('fixture 4', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[90, 100], True, None, None, None])
check('fixture 5', solve({'local': 119, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[99, 109], True, 109, 10, 119])
check('fixture 6', solve({'local': 120, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[110], False, 110, 10, 120])
check('fixture 7', solve({'local': 100, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[80], False, 80, 20, 100])
check('fixture 8', solve({'local': 130, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[120], False, 120, 10, 130])
check('fixture 9', solve({'local': -20, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[-40], False, -40, 20, -20])
check('fixture 10', solve({'local': 115, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[95, 105], True, 105, 10, 115])
variant = [({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[90, 100], True, 90, 20, 110]), ({'local': 111, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[91, 101], True, 91, 20, 111]), ({'local': 112, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[92, 102], True, 92, 20, 112]), ({'local': 113, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[93, 103], True, 93, 20, 113]), ({'local': 114, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[94, 104], True, 94, 20, 114])]
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):
    old_candidate = r['local'] - r['old']
    new_candidate = r['local'] - r['new']
    old_valid = old_candidate < r['transition']
    new_valid = new_candidate >= r['transition']
    candidates = sorted(set(([old_candidate] if old_valid else []) + ([new_candidate] if new_valid else [])))
    count = len(candidates)
    ambiguous = old_valid != new_valid
    chosen = None if count == 0 or (ambiguous and r['policy'] == 'reject') else candidates[-1 if r['policy'] == 'later' else 0]
    offset = None if chosen is None else (r['old'] if chosen < r['transition'] else r['new'])
    roundtrip = None if chosen is None else chosen + offset
    return [candidates,ambiguous,chosen,offset,roundtrip]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local': 109, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[89], False, 89, 20, 109])
check('fixture 2', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[90, 100], True, 90, 20, 110])
check('fixture 3', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[90, 100], True, 100, 10, 110])
check('fixture 4', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[90, 100], True, None, None, None])
check('fixture 5', solve({'local': 119, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[99, 109], True, 109, 10, 119])
check('fixture 6', solve({'local': 120, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[110], False, 110, 10, 120])
check('fixture 7', solve({'local': 100, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[80], False, 80, 20, 100])
check('fixture 8', solve({'local': 130, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[120], False, 120, 10, 130])
check('fixture 9', solve({'local': -20, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[-40], False, -40, 20, -20])
check('fixture 10', solve({'local': 115, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[95, 105], True, 105, 10, 115])
variant = [({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[90, 100], True, 90, 20, 110]), ({'local': 111, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[91, 101], True, 91, 20, 111]), ({'local': 112, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[92, 102], True, 92, 20, 112]), ({'local': 113, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[93, 103], True, 93, 20, 113]), ({'local': 114, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[94, 104], True, 94, 20, 114])]
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 ambiguous.

A stipulated backward offset transition at UTC T changes larger old offset to smaller new offset. Candidate UTC coordinates local-offset are admitted on their owning sides (<T old, >=T new). Return sorted unique candidates, ambiguity flag, selected instant under earlier/later/reject policy, selected offset and civil roundtrip. No timezone database is modeled.

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):
    old_candidate = r['local'] - r['old']
    new_candidate = r['local'] - r['new']
    old_valid = old_candidate < r['transition']
    new_valid = new_candidate >= r['transition']
    candidates = sorted(set(([old_candidate] if old_valid else []) + ([new_candidate] if new_valid else [])))
    count = len(candidates)
    ambiguous = count == 2
    chosen = None if not candidates else candidates[0]
    offset = None if chosen is None else (r['old'] if chosen < r['transition'] else r['new'])
    roundtrip = None if chosen is None else chosen + offset
    return [candidates,ambiguous,chosen,offset,roundtrip]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local': 109, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[89], False, 89, 20, 109])
check('fixture 2', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[90, 100], True, 90, 20, 110])
check('fixture 3', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[90, 100], True, 100, 10, 110])
check('fixture 4', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[90, 100], True, None, None, None])
check('fixture 5', solve({'local': 119, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[99, 109], True, 109, 10, 119])
check('fixture 6', solve({'local': 120, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[110], False, 110, 10, 120])
check('fixture 7', solve({'local': 100, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[80], False, 80, 20, 100])
check('fixture 8', solve({'local': 130, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[120], False, 120, 10, 130])
check('fixture 9', solve({'local': -20, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[-40], False, -40, 20, -20])
check('fixture 10', solve({'local': 115, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[95, 105], True, 105, 10, 115])
variant = [({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[90, 100], True, 90, 20, 110]), ({'local': 111, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[91, 101], True, 91, 20, 111]), ({'local': 112, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[92, 102], True, 92, 20, 112]), ({'local': 113, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[93, 103], True, 93, 20, 113]), ({'local': 114, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[94, 104], True, 94, 20, 114])]
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):
    old_candidate = r['local'] - r['old']
    new_candidate = r['local'] - r['new']
    old_valid = old_candidate < r['transition']
    new_valid = new_candidate >= r['transition']
    candidates = sorted(set(([old_candidate] if old_valid else []) + ([new_candidate] if new_valid else [])))
    count = len(candidates)
    ambiguous = count == 2
    chosen = None if not candidates else candidates[-1]
    offset = None if chosen is None else (r['old'] if chosen < r['transition'] else r['new'])
    roundtrip = None if chosen is None else chosen + offset
    return [candidates,ambiguous,chosen,offset,roundtrip]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'local': 109, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[89], False, 89, 20, 109])
check('fixture 2', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[90, 100], True, 90, 20, 110])
check('fixture 3', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[90, 100], True, 100, 10, 110])
check('fixture 4', solve({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[90, 100], True, None, None, None])
check('fixture 5', solve({'local': 119, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[99, 109], True, 109, 10, 119])
check('fixture 6', solve({'local': 120, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[110], False, 110, 10, 120])
check('fixture 7', solve({'local': 100, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[80], False, 80, 20, 100])
check('fixture 8', solve({'local': 130, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'reject'}), [[120], False, 120, 10, 130])
check('fixture 9', solve({'local': -20, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}), [[-40], False, -40, 20, -20])
check('fixture 10', solve({'local': 115, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'later'}), [[95, 105], True, 105, 10, 115])
variant = [({'local': 110, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[90, 100], True, 90, 20, 110]), ({'local': 111, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[91, 101], True, 91, 20, 111]), ({'local': 112, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[92, 102], True, 92, 20, 112]), ({'local': 113, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[93, 103], True, 93, 20, 113]), ({'local': 114, 'old': 20, 'new': 10, 'transition': 100, 'policy': 'earlier'}, [[94, 104], True, 94, 20, 114])]
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 chosen.

A stipulated backward offset transition at UTC T changes larger old offset to smaller new offset. Candidate UTC coordinates local-offset are admitted on their owning sides (<T old, >=T new). Return sorted unique candidates, ambiguity flag, selected instant under earlier/later/reject policy, selected offset and civil roundtrip. No timezone database is modeled.

split: open-access