# Original synthetic arithmetic illustration by Nodus. No GPU, model or KernelBench execution.
import json
from fractions import Fraction


def main():
    tasks = [
        {"id": "a", "correct": True, "reference_ms": 3, "candidate_ms": 2},
        {"id": "b", "correct": True, "reference_ms": 2, "candidate_ms": 2},
        {"id": "c", "correct": False, "reference_ms": 4, "candidate_ms": 1},
        {"id": "d", "correct": False, "reference_ms": 2, "candidate_ms": None},
    ]
    p = Fraction(1)
    accepted = [x["id"] for x in tasks if x["correct"] and x["candidate_ms"] is not None
                and Fraction(x["reference_ms"], x["candidate_ms"]) > p]
    denominator = len(tasks)
    print(json.dumps({"scope": "synthetic arithmetic only", "benchmark_executed": False,
                      "n": denominator, "correct": sum(x["correct"] for x in tasks),
                      "correct_and_strictly_faster": len(accepted), "counted_task_ids": accepted,
                      "fast_1": float(Fraction(len(accepted), denominator)),
                      "all_baselines_present": True}, indent=2))


if __name__ == "__main__":
    main()