Add files using upload-large-folder tool

tasks/construct-ae-p38-factorial-factors-l1-s0/environment/Dockerfile

@@ -0,0 +1,7 @@
+FROM python:3.11.16-slim
+RUN apt-get update && apt-get install -y --no-install-recommends tmux curl git procps build-essential \
+    && rm -rf /var/lib/apt/lists/*
+RUN pip install --no-cache-dir numpy==2.4.6 scipy==1.17.1 sympy==1.14.0 networkx==3.6.1 \
+    python-sat==1.9.dev15 z3-solver==5.1.0.0 PuLP==3.3.2 ortools==9.15.6755
+WORKDIR /workdir
+COPY instance.json /workdir/instance.json

tasks/construct-ae-p38-factorial-factors-l1-s0/environment/instance.json

@@ -0,0 +1 @@
+{"N": 36, "t": 10, "family": "ae_p38_factorial_factors", "subset": "construct"}

tasks/construct-ae-p38-factorial-factors-l1-s0/solution/solve.sh

@@ -0,0 +1,5 @@
+#!/bin/bash
+# oracle: a known valid construction (planted witness or published solution)
+cat > /workdir/answer.json <<'RLMATH_EOF'
+{"factors": [60, 10, 10, 10, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 14, 14, 14, 14, 14, 15, 15, 15, 15, 17, 17, 19, 23, 29, 31]}
+RLMATH_EOF

tasks/construct-ae-p38-factorial-factors-l1-s0/tests/check.py

@@ -0,0 +1,12 @@
+"""Factor N! into N factors, each >= t (AlphaEvolve problem 38 / OEIS A034258). Exact big-integer check."""
+import math
+
+from run import Invalid, int_list
+
+
+def check(inst, ans):
+    n, t = inst["N"], inst["t"]
+    f = int_list(ans.get("factors"), n, t, None, "factors")
+    if math.prod(f) != math.factorial(n):
+        raise Invalid(f"the product of the factors is not {n}!")
+    return None, {"min_factor": min(f)}

tasks/construct-ae-p38-factorial-factors-l1-s0/tests/instance.json

@@ -0,0 +1 @@
+{"N": 36, "t": 10, "family": "ae_p38_factorial_factors", "subset": "construct"}

tasks/construct-ae-p38-factorial-factors-l1-s0/tests/run.py

@@ -0,0 +1,127 @@
+"""rlmath runtime grader. Copied into every task as /tests/run.py next to /tests/check.py.
+
+Deterministic; no LLM in the reward path. Runs with python3 + numpy/scipy/sympy/networkx only.
+
+    python3 /tests/run.py /tests/instance.json /workdir/answer.json
+
+Prints the reward in [0, 1] and writes /logs/verifier/details.json when that directory exists.
+
+check.py must define  check(inst, ans) -> (value, extra_dict)  and raise Invalid for a bad answer.
+  construct : value is ignored; a returned check means the witness is valid -> reward 1.0
+  optimize  : value is the raw objective; reward = 0.1 + 0.9 * progress, where
+              progress = clip((s - baseline) / (best_known - baseline), 0, 1)       (maximize)
+                         clip((baseline - s) / (baseline - best_known), 0, 1)       (minimize)
+              inst must carry "direction", "baseline", "best_known".
+"""
+import json
+import math
+import os
+import sys
+
+VALID_FLOOR = 0.1
+
+
+class Invalid(Exception):
+    pass
+
+
+# ------------------------------------------------------------ input helpers
+
+def int_list(v, n=None, lo=None, hi=None, name="list"):
+    if not isinstance(v, list):
+        raise Invalid(f"{name} must be a list")
+    if n is not None and len(v) != n:
+        raise Invalid(f"{name} must have length {n}, got {len(v)}")
+    for x in v:
+        if isinstance(x, bool) or not isinstance(x, int):
+            raise Invalid(f"{name} must contain integers only")
+        if (lo is not None and x < lo) or (hi is not None and x > hi):
+            raise Invalid(f"{name} entry {x} out of range [{lo}, {hi}]")
+    return v
+
+
+def as_int(x, name="value", lo=None, hi=None):
+    return int_list([x], 1, lo, hi, name)[0]
+
+
+def num(x, name="value"):
+    if isinstance(x, bool) or not isinstance(x, (int, float)):
+        raise Invalid(f"{name} must be a number")
+    if not math.isfinite(x):
+        raise Invalid(f"{name} is not finite")
+    return float(x)
+
+
+def float_matrix(v, rows=None, cols=None, name="matrix"):
+    if not isinstance(v, list) or (rows is not None and len(v) != rows):
+        raise Invalid(f"{name} must be a list of {rows} rows")
+    out = []
+    for r in v:
+        if not isinstance(r, list) or (cols is not None and len(r) != cols):
+            raise Invalid(f"each row of {name} must have {cols} numbers")
+        out.append([num(x, name) for x in r])
+    return out
+
+
+def float_list(v, n=None, name="list"):
+    if not isinstance(v, list) or (n is not None and len(v) != n):
+        raise Invalid(f"{name} must be a list of length {n}")
+    return [num(x, name) for x in v]
+
+
+# ------------------------------------------------------------------ reward
+
+def optimize_reward(inst, s):
+    b, best = inst["baseline"], inst["best_known"]
+    if inst.get("progress_scale") == "log":
+        # for non-negative losses spanning orders of magnitude (e.g. overlap loss -> 0);
+        # progress is measured in log10(value + floor)
+        f = inst.get("log_floor", 1e-3)
+        b, best, s = (math.log10(max(x, 0.0) + f) for x in (b, best, s))
+    if inst["direction"] == "maximize":
+        p = (s - b) / (best - b)
+    else:
+        p = (b - s) / (b - best)
+    return VALID_FLOOR + (1 - VALID_FLOOR) * max(0.0, min(1.0, p))
+
+
+def grade(inst, ans, check):
+    try:
+        if not isinstance(ans, dict):
+            raise Invalid("answer must be a JSON object")
+        value, extra = check(inst, ans)
+        if inst.get("subset") == "optimize":
+            s = float(value)
+            if not math.isfinite(s):
+                raise Invalid("non-finite score")
+            return optimize_reward(inst, s), {"valid": True, "raw_score": s, **(extra or {})}
+        return 1.0, {"valid": True, **(extra or {})}
+    except Invalid as e:
+        return 0.0, {"valid": False, "error": str(e)}
+    except Exception as e:  # any malformed answer
+        return 0.0, {"valid": False, "error": f"{type(e).__name__}: {e}"}
+
+
+def main():
+    here = os.path.dirname(os.path.abspath(__file__))
+    sys.path.insert(0, here)
+    # import ourselves as `run` so check.py's `from run import Invalid` is the same class
+    import run as R  # noqa: E402
+    import check as family  # noqa: E402
+
+    inst = json.load(open(sys.argv[1]))
+    try:
+        ans = json.load(open(sys.argv[2]))
+    except Exception as e:
+        reward, det = 0.0, {"valid": False, "error": f"unreadable answer: {e}"}
+    else:
+        reward, det = R.grade(inst, ans, family.check)
+    det["reward"] = reward
+    if os.path.isdir("/logs/verifier"):
+        with open("/logs/verifier/details.json", "w") as f:
+            json.dump(det, f)
+    print(reward)
+
+
+if __name__ == "__main__":
+    main()

tasks/construct-ae-p38-factorial-factors-l1-s0/tests/test.sh

@@ -0,0 +1,9 @@
+#!/bin/bash
+mkdir -p /logs/verifier
+if [ ! -s /workdir/answer.json ]; then
+  echo '{"valid": false, "error": "no /workdir/answer.json"}' > /logs/verifier/details.json
+  echo 0 > /logs/verifier/reward.txt
+  exit 0
+fi
+timeout 290 python3 /tests/run.py /tests/instance.json /workdir/answer.json \
+  > /logs/verifier/reward.txt 2> /logs/verifier/grader.log || echo 0 > /logs/verifier/reward.txt

tasks/construct-ae-p38-factorial-factors-l1-s7/environment/Dockerfile

@@ -0,0 +1,7 @@
+FROM python:3.11.16-slim
+RUN apt-get update && apt-get install -y --no-install-recommends tmux curl git procps build-essential \
+    && rm -rf /var/lib/apt/lists/*
+RUN pip install --no-cache-dir numpy==2.4.6 scipy==1.17.1 sympy==1.14.0 networkx==3.6.1 \
+    python-sat==1.9.dev15 z3-solver==5.1.0.0 PuLP==3.3.2 ortools==9.15.6755
+WORKDIR /workdir
+COPY instance.json /workdir/instance.json

tasks/construct-ae-p38-factorial-factors-l1-s7/environment/instance.json

@@ -0,0 +1 @@
+{"N": 55, "t": 15, "family": "ae_p38_factorial_factors", "subset": "construct"}

tasks/construct-ae-p38-factorial-factors-l1-s7/solution/solve.sh

@@ -0,0 +1,5 @@
+#!/bin/bash
+# oracle: a known valid construction (planted witness or published solution)
+cat > /workdir/answer.json <<'RLMATH_EOF'
+{"factors": [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 18, 18, 19, 19, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, 23, 23, 26, 26, 26, 26, 29, 31, 33, 37, 41, 43, 47, 795]}
+RLMATH_EOF

tasks/construct-ae-p38-factorial-factors-l1-s7/tests/check.py

@@ -0,0 +1,12 @@
+"""Factor N! into N factors, each >= t (AlphaEvolve problem 38 / OEIS A034258). Exact big-integer check."""
+import math
+
+from run import Invalid, int_list
+
+
+def check(inst, ans):
+    n, t = inst["N"], inst["t"]
+    f = int_list(ans.get("factors"), n, t, None, "factors")
+    if math.prod(f) != math.factorial(n):
+        raise Invalid(f"the product of the factors is not {n}!")
+    return None, {"min_factor": min(f)}

tasks/construct-ae-p38-factorial-factors-l1-s7/tests/instance.json

@@ -0,0 +1 @@
+{"N": 55, "t": 15, "family": "ae_p38_factorial_factors", "subset": "construct"}

tasks/construct-ae-p38-factorial-factors-l1-s7/tests/run.py

@@ -0,0 +1,127 @@
+"""rlmath runtime grader. Copied into every task as /tests/run.py next to /tests/check.py.
+
+Deterministic; no LLM in the reward path. Runs with python3 + numpy/scipy/sympy/networkx only.
+
+    python3 /tests/run.py /tests/instance.json /workdir/answer.json
+
+Prints the reward in [0, 1] and writes /logs/verifier/details.json when that directory exists.
+
+check.py must define  check(inst, ans) -> (value, extra_dict)  and raise Invalid for a bad answer.
+  construct : value is ignored; a returned check means the witness is valid -> reward 1.0
+  optimize  : value is the raw objective; reward = 0.1 + 0.9 * progress, where
+              progress = clip((s - baseline) / (best_known - baseline), 0, 1)       (maximize)
+                         clip((baseline - s) / (baseline - best_known), 0, 1)       (minimize)
+              inst must carry "direction", "baseline", "best_known".
+"""
+import json
+import math
+import os
+import sys
+
+VALID_FLOOR = 0.1
+
+
+class Invalid(Exception):
+    pass
+
+
+# ------------------------------------------------------------ input helpers
+
+def int_list(v, n=None, lo=None, hi=None, name="list"):
+    if not isinstance(v, list):
+        raise Invalid(f"{name} must be a list")
+    if n is not None and len(v) != n:
+        raise Invalid(f"{name} must have length {n}, got {len(v)}")
+    for x in v:
+        if isinstance(x, bool) or not isinstance(x, int):
+            raise Invalid(f"{name} must contain integers only")
+        if (lo is not None and x < lo) or (hi is not None and x > hi):
+            raise Invalid(f"{name} entry {x} out of range [{lo}, {hi}]")
+    return v
+
+
+def as_int(x, name="value", lo=None, hi=None):
+    return int_list([x], 1, lo, hi, name)[0]
+
+
+def num(x, name="value"):
+    if isinstance(x, bool) or not isinstance(x, (int, float)):
+        raise Invalid(f"{name} must be a number")
+    if not math.isfinite(x):
+        raise Invalid(f"{name} is not finite")
+    return float(x)
+
+
+def float_matrix(v, rows=None, cols=None, name="matrix"):
+    if not isinstance(v, list) or (rows is not None and len(v) != rows):
+        raise Invalid(f"{name} must be a list of {rows} rows")
+    out = []
+    for r in v:
+        if not isinstance(r, list) or (cols is not None and len(r) != cols):
+            raise Invalid(f"each row of {name} must have {cols} numbers")
+        out.append([num(x, name) for x in r])
+    return out
+
+
+def float_list(v, n=None, name="list"):
+    if not isinstance(v, list) or (n is not None and len(v) != n):
+        raise Invalid(f"{name} must be a list of length {n}")
+    return [num(x, name) for x in v]
+
+
+# ------------------------------------------------------------------ reward
+
+def optimize_reward(inst, s):
+    b, best = inst["baseline"], inst["best_known"]
+    if inst.get("progress_scale") == "log":
+        # for non-negative losses spanning orders of magnitude (e.g. overlap loss -> 0);
+        # progress is measured in log10(value + floor)
+        f = inst.get("log_floor", 1e-3)
+        b, best, s = (math.log10(max(x, 0.0) + f) for x in (b, best, s))
+    if inst["direction"] == "maximize":
+        p = (s - b) / (best - b)
+    else:
+        p = (b - s) / (b - best)
+    return VALID_FLOOR + (1 - VALID_FLOOR) * max(0.0, min(1.0, p))
+
+
+def grade(inst, ans, check):
+    try:
+        if not isinstance(ans, dict):
+            raise Invalid("answer must be a JSON object")
+        value, extra = check(inst, ans)
+        if inst.get("subset") == "optimize":
+            s = float(value)
+            if not math.isfinite(s):
+                raise Invalid("non-finite score")
+            return optimize_reward(inst, s), {"valid": True, "raw_score": s, **(extra or {})}
+        return 1.0, {"valid": True, **(extra or {})}
+    except Invalid as e:
+        return 0.0, {"valid": False, "error": str(e)}
+    except Exception as e:  # any malformed answer
+        return 0.0, {"valid": False, "error": f"{type(e).__name__}: {e}"}
+
+
+def main():
+    here = os.path.dirname(os.path.abspath(__file__))
+    sys.path.insert(0, here)
+    # import ourselves as `run` so check.py's `from run import Invalid` is the same class
+    import run as R  # noqa: E402
+    import check as family  # noqa: E402
+
+    inst = json.load(open(sys.argv[1]))
+    try:
+        ans = json.load(open(sys.argv[2]))
+    except Exception as e:
+        reward, det = 0.0, {"valid": False, "error": f"unreadable answer: {e}"}
+    else:
+        reward, det = R.grade(inst, ans, family.check)
+    det["reward"] = reward
+    if os.path.isdir("/logs/verifier"):
+        with open("/logs/verifier/details.json", "w") as f:
+            json.dump(det, f)
+    print(reward)
+
+
+if __name__ == "__main__":
+    main()

tasks/construct-ae-p38-factorial-factors-l1-s7/tests/test.sh

@@ -0,0 +1,9 @@
+#!/bin/bash
+mkdir -p /logs/verifier
+if [ ! -s /workdir/answer.json ]; then
+  echo '{"valid": false, "error": "no /workdir/answer.json"}' > /logs/verifier/details.json
+  echo 0 > /logs/verifier/reward.txt
+  exit 0
+fi
+timeout 290 python3 /tests/run.py /tests/instance.json /workdir/answer.json \
+  > /logs/verifier/reward.txt 2> /logs/verifier/grader.log || echo 0 > /logs/verifier/reward.txt

tasks/construct-ae-p38-factorial-factors-l5-s8/environment/Dockerfile

@@ -0,0 +1,7 @@
+FROM python:3.11.16-slim
+RUN apt-get update && apt-get install -y --no-install-recommends tmux curl git procps build-essential \
+    && rm -rf /var/lib/apt/lists/*
+RUN pip install --no-cache-dir numpy==2.4.6 scipy==1.17.1 sympy==1.14.0 networkx==3.6.1 \
+    python-sat==1.9.dev15 z3-solver==5.1.0.0 PuLP==3.3.2 ortools==9.15.6755
+WORKDIR /workdir
+COPY instance.json /workdir/instance.json

tasks/construct-ae-p38-factorial-factors-l5-s8/environment/instance.json

@@ -0,0 +1 @@
+{"N": 3148, "t": 1010, "family": "ae_p38_factorial_factors", "subset": "construct"}

tasks/construct-ae-p38-factorial-factors-l5-s8/solution/solve.sh

@@ -0,0 +1,5 @@
+#!/bin/bash
+# oracle: a known valid construction (planted witness or published solution)
+cat > /workdir/answer.json <<'RLMATH_EOF'
+{"factors": [2020, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1010, 1011, 1011, 1011, 1011, 1011, 1011, 1011, 1011, 1011, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1013, 1013, 1013, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1014, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1015, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1016, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1017, 1018, 1018, 1018, 1018, 1018, 1018, 1019, 1019, 1019, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1020, 1021, 1021, 1021, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1022, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1025, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1026, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1027, 1028, 1028, 1028, 1028, 1028, 1028, 1028, 1028, 1028, 1028, 1028, 1028, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1029, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1030, 1031, 1031, 1031, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1032, 1033, 1033, 1033, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1034, 1035, 1035, 1035, 1035, 1035, 1035, 1035, 1035, 1035, 1035, 1035, 1035, 1035, 1035, 1035, 1035, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1036, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1037, 1038, 1038, 1038, 1038, 1038, 1038, 1038, 1038, 1038, 1038, 1038, 1038, 1038, 1038, 1038, 1038, 1038, 1038, 1039, 1039, 1039, 1040, 1041, 1041, 1041, 1041, 1041, 1041, 1041, 1041, 1041, 1042, 1042, 1042, 1042, 1042, 1042, 1043, 1043, 1043, 1043, 1043, 1043, 1043, 1043, 1043, 1043, 1043, 1043, 1043, 1043, 1043, 1043, 1043, 1043, 1043, 1043, 1043, 1046, 1046, 1046, 1046, 1046, 1046, 1047, 1047, 1047, 1047, 1047, 1047, 1047, 1047, 1047, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1048, 1049, 1049, 1049, 1050, 1051, 1051, 1052, 1052, 1052, 1052, 1052, 1052, 1052, 1052, 1052, 1052, 1052, 1055, 1055, 1055, 1055, 1055, 1055, 1055, 1055, 1055, 1055, 1055, 1055, 1055, 1055, 1057, 1057, 1057, 1057, 1057, 1057, 1057, 1057, 1057, 1057, 1057, 1057, 1057, 1057, 1057, 1057, 1057, 1057, 1057, 1057, 1059, 1059, 1059, 1059, 1059, 1059, 1059, 1059, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1060, 1061, 1061, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1062, 1063, 1063, 1064, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1065, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1067, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1068, 1069, 1069, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1070, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1072, 1074, 1074, 1074, 1074, 1074, 1074, 1074, 1074, 1074, 1074, 1074, 1074, 1074, 1074, 1074, 1074, 1074, 1075, 1075, 1075, 1075, 1075, 1075, 1075, 1075, 1075, 1075, 1075, 1075, 1075, 1075, 1076, 1076, 1076, 1076, 1076, 1076, 1076, 1076, 1076, 1076, 1076, 1077, 1077, 1077, 1077, 1077, 1077, 1077, 1077, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1079, 1081, 1081, 1081, 1081, 1081, 1081, 1082, 1082, 1082, 1082, 1082, 1084, 1084, 1084, 1084, 1084, 1084, 1084, 1084, 1084, 1084, 1084, 1086, 1086, 1086, 1086, 1086, 1086, 1086, 1086, 1086, 1086, 1086, 1086, 1086, 1086, 1086, 1086, 1086, 1087, 1087, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1090, 1091, 1091, 1093, 1093, 1094, 1094, 1094, 1094, 1094, 1096, 1096, 1096, 1096, 1096, 1096, 1096, 1096, 1096, 1096, 1096, 1096, 1096, 1096, 1096, 1096, 1096, 1096, 1096, 1096, 1096, 1096, 1097, 1097, 1099, 1099, 1099, 1099, 1099, 1099, 1099, 1099, 1099, 1099, 1099, 1099, 1099, 1099, 1099, 1099, 1099, 1099, 1099, 1099, 1101, 1101, 1101, 1101, 1101, 1101, 1101, 1101, 1103, 1103, 1108, 1108, 1108, 1108, 1108, 1108, 1108, 1108, 1108, 1108, 1108, 1109, 1109, 1112, 1112, 1112, 1112, 1112, 1112, 1112, 1112, 1112, 1112, 1112, 1112, 1112, 1112, 1112, 1112, 1112, 1112, 1112, 1112, 1112, 1112, 1114, 1114, 1114, 1114, 1114, 1115, 1115, 1115, 1115, 1115, 1115, 1115, 1115, 1115, 1115, 1115, 1115, 1115, 1115, 1117, 1117, 1119, 1119, 1119, 1119, 1119, 1119, 1119, 1119, 1123, 1123, 1124, 1124, 1124, 1124, 1124, 1124, 1124, 1124, 1124, 1124, 1124, 1126, 1126, 1126, 1126, 1126, 1129, 1129, 1132, 1132, 1132, 1132, 1132, 1132, 1132, 1132, 1132, 1132, 1132, 1135, 1135, 1135, 1135, 1135, 1135, 1135, 1135, 1135, 1135, 1135, 1135, 1135, 1137, 1137, 1137, 1137, 1137, 1137, 1137, 1137, 1138, 1138, 1138, 1138, 1138, 1141, 1141, 1141, 1141, 1141, 1141, 1141, 1141, 1141, 1141, 1141, 1141, 1141, 1141, 1141, 1141, 1141, 1141, 1141, 1142, 1142, 1142, 1142, 1142, 1145, 1145, 1145, 1145, 1145, 1145, 1145, 1145, 1145, 1145, 1145, 1145, 1145, 1146, 1146, 1146, 1146, 1146, 1146, 1146, 1146, 1146, 1146, 1146, 1146, 1146, 1146, 1146, 1146, 1147, 1149, 1149, 1149, 1149, 1149, 1149, 1149, 1149, 1150, 1151, 1151, 1153, 1153, 1154, 1154, 1154, 1154, 1154, 1158, 1158, 1158, 1158, 1158, 1158, 1158, 1158, 1158, 1158, 1158, 1158, 1158, 1158, 1158, 1158, 1163, 1163, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1167, 1167, 1167, 1167, 1167, 1167, 1167, 1167, 1169, 1169, 1169, 1169, 1169, 1169, 1169, 1169, 1169, 1169, 1169, 1169, 1169, 1169, 1169, 1169, 1169, 1169, 1171, 1171, 1172, 1172, 1172, 1172, 1172, 1172, 1172, 1172, 1172, 1172, 1174, 1174, 1174, 1174, 1174, 1181, 1181, 1182, 1182, 1182, 1182, 1182, 1182, 1182, 1182, 1182, 1182, 1182, 1182, 1182, 1182, 1182, 1186, 1186, 1186, 1186, 1186, 1187, 1187, 1191, 1191, 1191, 1191, 1191, 1191, 1191, 1193, 1193, 1194, 1194, 1194, 1194, 1194, 1194, 1194, 1194, 1194, 1194, 1194, 1194, 1194, 1194, 1194, 1195, 1195, 1195, 1195, 1195, 1195, 1195, 1195, 1195, 1195, 1195, 1195, 1195, 1198, 1198, 1198, 1198, 1198, 1201, 1201, 1202, 1202, 1202, 1202, 1202, 1203, 1203, 1203, 1203, 1203, 1203, 1203, 1205, 1205, 1205, 1205, 1205, 1205, 1205, 1205, 1205, 1205, 1205, 1205, 1205, 1213, 1213, 1214, 1214, 1214, 1214, 1214, 1217, 1217, 1223, 1223, 1226, 1226, 1226, 1226, 1226, 1227, 1227, 1227, 1227, 1227, 1227, 1227, 1228, 1228, 1228, 1228, 1228, 1228, 1228, 1228, 1228, 1228, 1229, 1229, 1231, 1231, 1234, 1234, 1234, 1234, 1234, 1237, 1237, 1238, 1238, 1238, 1238, 1238, 1244, 1244, 1244, 1244, 1244, 1244, 1244, 1244, 1244, 1244, 1249, 1249, 1252, 1252, 1252, 1252, 1252, 1252, 1252, 1252, 1252, 1252, 1255, 1255, 1255, 1255, 1255, 1255, 1255, 1255, 1255, 1255, 1255, 1255, 1257, 1257, 1257, 1257, 1257, 1257, 1257, 1259, 1259, 1262, 1262, 1262, 1262, 1263, 1263, 1263, 1263, 1263, 1263, 1263, 1268, 1268, 1268, 1268, 1268, 1268, 1268, 1268, 1268, 1277, 1277, 1279, 1279, 1282, 1282, 1282, 1282, 1283, 1283, 1286, 1286, 1286, 1286, 1289, 1289, 1291, 1291, 1293, 1293, 1293, 1293, 1293, 1293, 1293, 1294, 1294, 1294, 1294, 1297, 1297, 1299, 1299, 1299, 1299, 1299, 1299, 1299, 1301, 1301, 1303, 1303, 1306, 1306, 1306, 1306, 1307, 1307, 1317, 1317, 1317, 1317, 1317, 1317, 1317, 1318, 1318, 1318, 1318, 1319, 1319, 1321, 1321, 1322, 1322, 1322, 1322, 1324, 1324, 1324, 1324, 1324, 1324, 1324, 1324, 1324, 1327, 1327, 1329, 1329, 1329, 1329, 1329, 1329, 1329, 1346, 1346, 1346, 1346, 1347, 1347, 1347, 1347, 1347, 1347, 1347, 1354, 1354, 1354, 1354, 1361, 1361, 1366, 1366, 1366, 1366, 1367, 1367, 1371, 1371, 1371, 1371, 1371, 1371, 1373, 1373, 1381, 1381, 1382, 1382, 1382, 1382, 1383, 1383, 1383, 1383, 1383, 1383, 1389, 1389, 1389, 1389, 1389, 1389, 1399, 1399, 1401, 1401, 1401, 1401, 1401, 1401, 1402, 1402, 1402, 1402, 1409, 1409, 1418, 1418, 1418, 1418, 1423, 1423, 1427, 1427, 1429, 1429, 1433, 1433, 1437, 1437, 1437, 1437, 1437, 1437, 1438, 1438, 1438, 1438, 1439, 1439, 1447, 1447, 1451, 1451, 1453, 1453, 1454, 1454, 1454, 1454, 1459, 1459, 1461, 1461, 1461, 1461, 1461, 1461, 1466, 1466, 1466, 1466, 1471, 1471, 1473, 1473, 1473, 1473, 1473, 1473, 1478, 1478, 1478, 1478, 1481, 1481, 1483, 1483, 1486, 1486, 1486, 1486, 1487, 1487, 1489, 1489, 1493, 1493, 1497, 1497, 1497, 1497, 1497, 1497, 1499, 1499, 1502, 1502, 1502, 1502, 1509, 1509, 1509, 1509, 1509, 1509, 1511, 1511, 1514, 1514, 1514, 1514, 1522, 1522, 1522, 1522, 1523, 1523, 1531, 1531, 1538, 1538, 1538, 1538, 1543, 1543, 1546, 1546, 1546, 1546, 1549, 1549, 1553, 1553, 1559, 1559, 1567, 1567, 1571, 1571, 1574, 1574, 1574, 1574, 1579, 1583, 1594, 1594, 1594, 1597, 1601, 1607, 1609, 1613, 1618, 1618, 1618, 1619, 1621, 1622, 1622, 1622, 1627, 1637, 1642, 1642, 1642, 1646, 1646, 1646, 1654, 1654, 1654, 1657, 1658, 1658, 1658, 1663, 1667, 1669, 1678, 1678, 1678, 1693, 1697, 1699, 1706, 1706, 1706, 1709, 1714, 1714, 1714, 1718, 1718, 1718, 1721, 1723, 1726, 1726, 1726, 1733, 1741, 1747, 1753, 1754, 1754, 1754, 1759, 1762, 1762, 1762, 1766, 1766, 1766, 1774, 1774, 1774, 1777, 1783, 1787, 1789, 1801, 1811, 1814, 1814, 1814, 1822, 1822, 1822, 1823, 1831, 1838, 1838, 1838, 1847, 1858, 1858, 1858, 1861, 1867, 1871, 1873, 1874, 1874, 1874, 1877, 1879, 1882, 1882, 1882, 1889, 1894, 1894, 1894, 1901, 1906, 1906, 1906, 1907, 1913, 1931, 1933, 1934, 1934, 1934, 1942, 1942, 1942, 1949, 1951, 1954, 1954, 1954, 1966, 1966, 1966, 1973, 1979, 1982, 1982, 1982, 1987, 1993, 1994, 1994, 1994, 1997, 1999, 2003, 2011, 2017, 2018, 2018, 2018, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137]}
+RLMATH_EOF

tasks/construct-ae-p38-factorial-factors-l5-s8/tests/check.py

@@ -0,0 +1,12 @@
+"""Factor N! into N factors, each >= t (AlphaEvolve problem 38 / OEIS A034258). Exact big-integer check."""
+import math
+
+from run import Invalid, int_list
+
+
+def check(inst, ans):
+    n, t = inst["N"], inst["t"]
+    f = int_list(ans.get("factors"), n, t, None, "factors")
+    if math.prod(f) != math.factorial(n):
+        raise Invalid(f"the product of the factors is not {n}!")
+    return None, {"min_factor": min(f)}

tasks/construct-ae-p38-factorial-factors-l5-s8/tests/instance.json

@@ -0,0 +1 @@
+{"N": 3148, "t": 1010, "family": "ae_p38_factorial_factors", "subset": "construct"}

tasks/construct-ae-p38-factorial-factors-l5-s8/tests/run.py

@@ -0,0 +1,127 @@
+"""rlmath runtime grader. Copied into every task as /tests/run.py next to /tests/check.py.
+
+Deterministic; no LLM in the reward path. Runs with python3 + numpy/scipy/sympy/networkx only.
+
+    python3 /tests/run.py /tests/instance.json /workdir/answer.json
+
+Prints the reward in [0, 1] and writes /logs/verifier/details.json when that directory exists.
+
+check.py must define  check(inst, ans) -> (value, extra_dict)  and raise Invalid for a bad answer.
+  construct : value is ignored; a returned check means the witness is valid -> reward 1.0
+  optimize  : value is the raw objective; reward = 0.1 + 0.9 * progress, where
+              progress = clip((s - baseline) / (best_known - baseline), 0, 1)       (maximize)
+                         clip((baseline - s) / (baseline - best_known), 0, 1)       (minimize)
+              inst must carry "direction", "baseline", "best_known".
+"""
+import json
+import math
+import os
+import sys
+
+VALID_FLOOR = 0.1
+
+
+class Invalid(Exception):
+    pass
+
+
+# ------------------------------------------------------------ input helpers
+
+def int_list(v, n=None, lo=None, hi=None, name="list"):
+    if not isinstance(v, list):
+        raise Invalid(f"{name} must be a list")
+    if n is not None and len(v) != n:
+        raise Invalid(f"{name} must have length {n}, got {len(v)}")
+    for x in v:
+        if isinstance(x, bool) or not isinstance(x, int):
+            raise Invalid(f"{name} must contain integers only")
+        if (lo is not None and x < lo) or (hi is not None and x > hi):
+            raise Invalid(f"{name} entry {x} out of range [{lo}, {hi}]")
+    return v
+
+
+def as_int(x, name="value", lo=None, hi=None):
+    return int_list([x], 1, lo, hi, name)[0]
+
+
+def num(x, name="value"):
+    if isinstance(x, bool) or not isinstance(x, (int, float)):
+        raise Invalid(f"{name} must be a number")
+    if not math.isfinite(x):
+        raise Invalid(f"{name} is not finite")
+    return float(x)
+
+
+def float_matrix(v, rows=None, cols=None, name="matrix"):
+    if not isinstance(v, list) or (rows is not None and len(v) != rows):
+        raise Invalid(f"{name} must be a list of {rows} rows")
+    out = []
+    for r in v:
+        if not isinstance(r, list) or (cols is not None and len(r) != cols):
+            raise Invalid(f"each row of {name} must have {cols} numbers")
+        out.append([num(x, name) for x in r])
+    return out
+
+
+def float_list(v, n=None, name="list"):
+    if not isinstance(v, list) or (n is not None and len(v) != n):
+        raise Invalid(f"{name} must be a list of length {n}")
+    return [num(x, name) for x in v]
+
+
+# ------------------------------------------------------------------ reward
+
+def optimize_reward(inst, s):
+    b, best = inst["baseline"], inst["best_known"]
+    if inst.get("progress_scale") == "log":
+        # for non-negative losses spanning orders of magnitude (e.g. overlap loss -> 0);
+        # progress is measured in log10(value + floor)
+        f = inst.get("log_floor", 1e-3)
+        b, best, s = (math.log10(max(x, 0.0) + f) for x in (b, best, s))
+    if inst["direction"] == "maximize":
+        p = (s - b) / (best - b)
+    else:
+        p = (b - s) / (b - best)
+    return VALID_FLOOR + (1 - VALID_FLOOR) * max(0.0, min(1.0, p))
+
+
+def grade(inst, ans, check):
+    try:
+        if not isinstance(ans, dict):
+            raise Invalid("answer must be a JSON object")
+        value, extra = check(inst, ans)
+        if inst.get("subset") == "optimize":
+            s = float(value)
+            if not math.isfinite(s):
+                raise Invalid("non-finite score")
+            return optimize_reward(inst, s), {"valid": True, "raw_score": s, **(extra or {})}
+        return 1.0, {"valid": True, **(extra or {})}
+    except Invalid as e:
+        return 0.0, {"valid": False, "error": str(e)}
+    except Exception as e:  # any malformed answer
+        return 0.0, {"valid": False, "error": f"{type(e).__name__}: {e}"}
+
+
+def main():
+    here = os.path.dirname(os.path.abspath(__file__))
+    sys.path.insert(0, here)
+    # import ourselves as `run` so check.py's `from run import Invalid` is the same class
+    import run as R  # noqa: E402
+    import check as family  # noqa: E402
+
+    inst = json.load(open(sys.argv[1]))
+    try:
+        ans = json.load(open(sys.argv[2]))
+    except Exception as e:
+        reward, det = 0.0, {"valid": False, "error": f"unreadable answer: {e}"}
+    else:
+        reward, det = R.grade(inst, ans, family.check)
+    det["reward"] = reward
+    if os.path.isdir("/logs/verifier"):
+        with open("/logs/verifier/details.json", "w") as f:
+            json.dump(det, f)
+    print(reward)
+
+
+if __name__ == "__main__":
+    main()

tasks/construct-ae-p38-factorial-factors-l5-s8/tests/test.sh

@@ -0,0 +1,9 @@
+#!/bin/bash
+mkdir -p /logs/verifier
+if [ ! -s /workdir/answer.json ]; then
+  echo '{"valid": false, "error": "no /workdir/answer.json"}' > /logs/verifier/details.json
+  echo 0 > /logs/verifier/reward.txt
+  exit 0
+fi
+timeout 290 python3 /tests/run.py /tests/instance.json /workdir/answer.json \
+  > /logs/verifier/reward.txt 2> /logs/verifier/grader.log || echo 0 > /logs/verifier/reward.txt

tasks/construct-ae-p52-erdos-squarefree-l5-s3/environment/Dockerfile

@@ -0,0 +1,7 @@
+FROM python:3.11.16-slim
+RUN apt-get update && apt-get install -y --no-install-recommends tmux curl git procps build-essential \
+    && rm -rf /var/lib/apt/lists/*
+RUN pip install --no-cache-dir numpy==2.4.6 scipy==1.17.1 sympy==1.14.0 networkx==3.6.1 \
+    python-sat==1.9.dev15 z3-solver==5.1.0.0 PuLP==3.3.2 ortools==9.15.6755
+WORKDIR /workdir
+COPY instance.json /workdir/instance.json

tasks/construct-ae-p52-erdos-squarefree-l5-s3/environment/instance.json

@@ -0,0 +1 @@
+{"N": 7068, "t": 283, "family": "ae_p52_erdos_squarefree", "subset": "construct"}

tasks/construct-ae-p52-erdos-squarefree-l5-s3/solution/solve.sh

@@ -0,0 +1,5 @@
+#!/bin/bash
+# oracle: a known valid construction (planted witness or published solution)
+cat > /workdir/answer.json <<'RLMATH_EOF'
+{"A": [7, 32, 57, 82, 107, 132, 157, 182, 207, 232, 257, 282, 307, 332, 357, 382, 407, 432, 457, 482, 507, 532, 557, 582, 607, 632, 657, 682, 707, 732, 757, 782, 807, 832, 857, 882, 907, 932, 957, 982, 1007, 1032, 1057, 1082, 1107, 1132, 1157, 1182, 1207, 1232, 1257, 1282, 1307, 1332, 1357, 1382, 1407, 1432, 1457, 1482, 1507, 1532, 1557, 1582, 1607, 1632, 1657, 1682, 1707, 1732, 1757, 1782, 1807, 1832, 1857, 1882, 1907, 1932, 1957, 1982, 2007, 2032, 2057, 2082, 2107, 2132, 2157, 2182, 2207, 2232, 2257, 2282, 2307, 2332, 2357, 2382, 2407, 2432, 2457, 2482, 2507, 2532, 2557, 2582, 2607, 2632, 2657, 2682, 2707, 2732, 2757, 2782, 2807, 2832, 2857, 2882, 2907, 2932, 2957, 2982, 3007, 3032, 3057, 3082, 3107, 3132, 3157, 3182, 3207, 3232, 3257, 3282, 3307, 3332, 3357, 3382, 3407, 3432, 3457, 3482, 3507, 3532, 3557, 3582, 3607, 3632, 3657, 3682, 3707, 3732, 3757, 3782, 3807, 3832, 3857, 3882, 3907, 3932, 3957, 3982, 4007, 4032, 4057, 4082, 4107, 4132, 4157, 4182, 4207, 4232, 4257, 4282, 4307, 4332, 4357, 4382, 4407, 4432, 4457, 4482, 4507, 4532, 4557, 4582, 4607, 4632, 4657, 4682, 4707, 4732, 4757, 4782, 4807, 4832, 4857, 4882, 4907, 4932, 4957, 4982, 5007, 5032, 5057, 5082, 5107, 5132, 5157, 5182, 5207, 5232, 5257, 5282, 5307, 5332, 5357, 5382, 5407, 5432, 5457, 5482, 5507, 5532, 5557, 5582, 5607, 5632, 5657, 5682, 5707, 5732, 5757, 5782, 5807, 5832, 5857, 5882, 5907, 5932, 5957, 5982, 6007, 6032, 6057, 6082, 6107, 6132, 6157, 6182, 6207, 6232, 6257, 6282, 6307, 6332, 6357, 6382, 6407, 6432, 6457, 6482, 6507, 6532, 6557, 6582, 6607, 6632, 6657, 6682, 6707, 6732, 6757, 6782, 6807, 6832, 6857, 6882, 6907, 6932, 6957, 6982, 7007, 7032, 7057]}
+RLMATH_EOF

tasks/construct-ae-p52-erdos-squarefree-l5-s3/tests/check.py

@@ -0,0 +1,38 @@
+"""Erdos squarefree problem (AlphaEvolve problem 52): A in [1, N], |A| >= t, ab+1 NOT squarefree for all a, b in A
+(a = b included). The repo's problem page says "square-free"; the notebook and the Erdos problem ask for
+"never squarefree", which is what we check. Exact: for every pair we find a prime p with p^2 | ab+1."""
+import numpy as np
+
+from run import Invalid, int_list
+
+
+def _primes(n):
+    s = np.ones(n + 1, dtype=bool)
+    s[:2] = False
+    for i in range(2, int(n ** .5) + 1):
+        if s[i]:
+            s[i * i::i] = False
+    return np.nonzero(s)[0]
+
+
+def check(inst, ans):
+    n, t = inst["N"], inst["t"]
+    a = ans.get("A")
+    if not isinstance(a, list) or not (t <= len(a) <= 2 * t + 20):
+        raise Invalid(f"A must be a list of {t}..{2 * t + 20} integers")
+    int_list(a, None, 1, n, "A")
+    if len(set(a)) != len(a):
+        raise Invalid("A must consist of distinct integers")
+    x = np.array(sorted(a), dtype=np.int64)
+    iu, ju = np.triu_indices(len(x))
+    va, vb = x[iu], x[ju]
+    left = np.ones(len(iu), dtype=bool)  # pairs without a square divisor found yet
+    for p in _primes(int((n * n + 1) ** .5) + 1):
+        q = int(p) * int(p)
+        idx = np.nonzero(left)[0]
+        hit = ((va[idx] % q) * (vb[idx] % q) + 1) % q == 0
+        left[idx[hit]] = False
+        if not left.any():
+            return None, {"size": len(a)}
+    k = int(np.nonzero(left)[0][0])
+    raise Invalid(f"{int(va[k])}*{int(vb[k])}+1 = {int(va[k]) * int(vb[k]) + 1} is squarefree")

tasks/construct-ae-p52-erdos-squarefree-l5-s3/tests/instance.json

@@ -0,0 +1 @@
+{"N": 7068, "t": 283, "family": "ae_p52_erdos_squarefree", "subset": "construct"}

tasks/construct-ae-p52-erdos-squarefree-l5-s3/tests/run.py

@@ -0,0 +1,127 @@
+"""rlmath runtime grader. Copied into every task as /tests/run.py next to /tests/check.py.
+
+Deterministic; no LLM in the reward path. Runs with python3 + numpy/scipy/sympy/networkx only.
+
+    python3 /tests/run.py /tests/instance.json /workdir/answer.json
+
+Prints the reward in [0, 1] and writes /logs/verifier/details.json when that directory exists.
+
+check.py must define  check(inst, ans) -> (value, extra_dict)  and raise Invalid for a bad answer.
+  construct : value is ignored; a returned check means the witness is valid -> reward 1.0
+  optimize  : value is the raw objective; reward = 0.1 + 0.9 * progress, where
+              progress = clip((s - baseline) / (best_known - baseline), 0, 1)       (maximize)
+                         clip((baseline - s) / (baseline - best_known), 0, 1)       (minimize)
+              inst must carry "direction", "baseline", "best_known".
+"""
+import json
+import math
+import os
+import sys
+
+VALID_FLOOR = 0.1
+
+
+class Invalid(Exception):
+    pass
+
+
+# ------------------------------------------------------------ input helpers
+
+def int_list(v, n=None, lo=None, hi=None, name="list"):
+    if not isinstance(v, list):
+        raise Invalid(f"{name} must be a list")
+    if n is not None and len(v) != n:
+        raise Invalid(f"{name} must have length {n}, got {len(v)}")
+    for x in v:
+        if isinstance(x, bool) or not isinstance(x, int):
+            raise Invalid(f"{name} must contain integers only")
+        if (lo is not None and x < lo) or (hi is not None and x > hi):
+            raise Invalid(f"{name} entry {x} out of range [{lo}, {hi}]")
+    return v
+
+
+def as_int(x, name="value", lo=None, hi=None):
+    return int_list([x], 1, lo, hi, name)[0]
+
+
+def num(x, name="value"):
+    if isinstance(x, bool) or not isinstance(x, (int, float)):
+        raise Invalid(f"{name} must be a number")
+    if not math.isfinite(x):
+        raise Invalid(f"{name} is not finite")
+    return float(x)
+
+
+def float_matrix(v, rows=None, cols=None, name="matrix"):
+    if not isinstance(v, list) or (rows is not None and len(v) != rows):
+        raise Invalid(f"{name} must be a list of {rows} rows")
+    out = []
+    for r in v:
+        if not isinstance(r, list) or (cols is not None and len(r) != cols):
+            raise Invalid(f"each row of {name} must have {cols} numbers")
+        out.append([num(x, name) for x in r])
+    return out
+
+
+def float_list(v, n=None, name="list"):
+    if not isinstance(v, list) or (n is not None and len(v) != n):
+        raise Invalid(f"{name} must be a list of length {n}")
+    return [num(x, name) for x in v]
+
+
+# ------------------------------------------------------------------ reward
+
+def optimize_reward(inst, s):
+    b, best = inst["baseline"], inst["best_known"]
+    if inst.get("progress_scale") == "log":
+        # for non-negative losses spanning orders of magnitude (e.g. overlap loss -> 0);
+        # progress is measured in log10(value + floor)
+        f = inst.get("log_floor", 1e-3)
+        b, best, s = (math.log10(max(x, 0.0) + f) for x in (b, best, s))
+    if inst["direction"] == "maximize":
+        p = (s - b) / (best - b)
+    else:
+        p = (b - s) / (b - best)
+    return VALID_FLOOR + (1 - VALID_FLOOR) * max(0.0, min(1.0, p))
+
+
+def grade(inst, ans, check):
+    try:
+        if not isinstance(ans, dict):
+            raise Invalid("answer must be a JSON object")
+        value, extra = check(inst, ans)
+        if inst.get("subset") == "optimize":
+            s = float(value)
+            if not math.isfinite(s):
+                raise Invalid("non-finite score")
+            return optimize_reward(inst, s), {"valid": True, "raw_score": s, **(extra or {})}
+        return 1.0, {"valid": True, **(extra or {})}
+    except Invalid as e:
+        return 0.0, {"valid": False, "error": str(e)}
+    except Exception as e:  # any malformed answer
+        return 0.0, {"valid": False, "error": f"{type(e).__name__}: {e}"}
+
+
+def main():
+    here = os.path.dirname(os.path.abspath(__file__))
+    sys.path.insert(0, here)
+    # import ourselves as `run` so check.py's `from run import Invalid` is the same class
+    import run as R  # noqa: E402
+    import check as family  # noqa: E402
+
+    inst = json.load(open(sys.argv[1]))
+    try:
+        ans = json.load(open(sys.argv[2]))
+    except Exception as e:
+        reward, det = 0.0, {"valid": False, "error": f"unreadable answer: {e}"}
+    else:
+        reward, det = R.grade(inst, ans, family.check)
+    det["reward"] = reward
+    if os.path.isdir("/logs/verifier"):
+        with open("/logs/verifier/details.json", "w") as f:
+            json.dump(det, f)
+    print(reward)
+
+
+if __name__ == "__main__":
+    main()

tasks/construct-ae-p52-erdos-squarefree-l5-s3/tests/test.sh

@@ -0,0 +1,9 @@
+#!/bin/bash
+mkdir -p /logs/verifier
+if [ ! -s /workdir/answer.json ]; then
+  echo '{"valid": false, "error": "no /workdir/answer.json"}' > /logs/verifier/details.json
+  echo 0 > /logs/verifier/reward.txt
+  exit 0
+fi
+timeout 290 python3 /tests/run.py /tests/instance.json /workdir/answer.json \
+  > /logs/verifier/reward.txt 2> /logs/verifier/grader.log || echo 0 > /logs/verifier/reward.txt

tasks/construct-ae-p52-erdos-squarefree-l5-s4/environment/Dockerfile

@@ -0,0 +1,7 @@
+FROM python:3.11.16-slim
+RUN apt-get update && apt-get install -y --no-install-recommends tmux curl git procps build-essential \
+    && rm -rf /var/lib/apt/lists/*
+RUN pip install --no-cache-dir numpy==2.4.6 scipy==1.17.1 sympy==1.14.0 networkx==3.6.1 \
+    python-sat==1.9.dev15 z3-solver==5.1.0.0 PuLP==3.3.2 ortools==9.15.6755
+WORKDIR /workdir
+COPY instance.json /workdir/instance.json

tasks/construct-ae-p52-erdos-squarefree-l5-s4/environment/instance.json

@@ -0,0 +1 @@
+{"N": 7124, "t": 285, "family": "ae_p52_erdos_squarefree", "subset": "construct"}

tasks/construct-ae-p52-erdos-squarefree-l5-s4/solution/solve.sh

@@ -0,0 +1,5 @@
+#!/bin/bash
+# oracle: a known valid construction (planted witness or published solution)
+cat > /workdir/answer.json <<'RLMATH_EOF'
+{"A": [7, 32, 57, 82, 107, 132, 157, 182, 207, 232, 257, 282, 307, 332, 357, 382, 407, 432, 457, 482, 507, 532, 557, 582, 607, 632, 657, 682, 707, 732, 757, 782, 807, 832, 857, 882, 907, 932, 957, 982, 1007, 1032, 1057, 1082, 1107, 1132, 1157, 1182, 1207, 1232, 1257, 1282, 1307, 1332, 1357, 1382, 1407, 1432, 1457, 1482, 1507, 1532, 1557, 1582, 1607, 1632, 1657, 1682, 1707, 1732, 1757, 1782, 1807, 1832, 1857, 1882, 1907, 1932, 1957, 1982, 2007, 2032, 2057, 2082, 2107, 2132, 2157, 2182, 2207, 2232, 2257, 2282, 2307, 2332, 2357, 2382, 2407, 2432, 2457, 2482, 2507, 2532, 2557, 2582, 2607, 2632, 2657, 2682, 2707, 2732, 2757, 2782, 2807, 2832, 2857, 2882, 2907, 2932, 2957, 2982, 3007, 3032, 3057, 3082, 3107, 3132, 3157, 3182, 3207, 3232, 3257, 3282, 3307, 3332, 3357, 3382, 3407, 3432, 3457, 3482, 3507, 3532, 3557, 3582, 3607, 3632, 3657, 3682, 3707, 3732, 3757, 3782, 3807, 3832, 3857, 3882, 3907, 3932, 3957, 3982, 4007, 4032, 4057, 4082, 4107, 4132, 4157, 4182, 4207, 4232, 4257, 4282, 4307, 4332, 4357, 4382, 4407, 4432, 4457, 4482, 4507, 4532, 4557, 4582, 4607, 4632, 4657, 4682, 4707, 4732, 4757, 4782, 4807, 4832, 4857, 4882, 4907, 4932, 4957, 4982, 5007, 5032, 5057, 5082, 5107, 5132, 5157, 5182, 5207, 5232, 5257, 5282, 5307, 5332, 5357, 5382, 5407, 5432, 5457, 5482, 5507, 5532, 5557, 5582, 5607, 5632, 5657, 5682, 5707, 5732, 5757, 5782, 5807, 5832, 5857, 5882, 5907, 5932, 5957, 5982, 6007, 6032, 6057, 6082, 6107, 6132, 6157, 6182, 6207, 6232, 6257, 6282, 6307, 6332, 6357, 6382, 6407, 6432, 6457, 6482, 6507, 6532, 6557, 6582, 6607, 6632, 6657, 6682, 6707, 6732, 6757, 6782, 6807, 6832, 6857, 6882, 6907, 6932, 6957, 6982, 7007, 7032, 7057, 7082, 7107]}
+RLMATH_EOF

tasks/construct-ae-p52-erdos-squarefree-l5-s4/tests/check.py

@@ -0,0 +1,38 @@
+"""Erdos squarefree problem (AlphaEvolve problem 52): A in [1, N], |A| >= t, ab+1 NOT squarefree for all a, b in A
+(a = b included). The repo's problem page says "square-free"; the notebook and the Erdos problem ask for
+"never squarefree", which is what we check. Exact: for every pair we find a prime p with p^2 | ab+1."""
+import numpy as np
+
+from run import Invalid, int_list
+
+
+def _primes(n):
+    s = np.ones(n + 1, dtype=bool)
+    s[:2] = False
+    for i in range(2, int(n ** .5) + 1):
+        if s[i]:
+            s[i * i::i] = False
+    return np.nonzero(s)[0]
+
+
+def check(inst, ans):
+    n, t = inst["N"], inst["t"]
+    a = ans.get("A")
+    if not isinstance(a, list) or not (t <= len(a) <= 2 * t + 20):
+        raise Invalid(f"A must be a list of {t}..{2 * t + 20} integers")
+    int_list(a, None, 1, n, "A")
+    if len(set(a)) != len(a):
+        raise Invalid("A must consist of distinct integers")
+    x = np.array(sorted(a), dtype=np.int64)
+    iu, ju = np.triu_indices(len(x))
+    va, vb = x[iu], x[ju]
+    left = np.ones(len(iu), dtype=bool)  # pairs without a square divisor found yet
+    for p in _primes(int((n * n + 1) ** .5) + 1):
+        q = int(p) * int(p)
+        idx = np.nonzero(left)[0]
+        hit = ((va[idx] % q) * (vb[idx] % q) + 1) % q == 0
+        left[idx[hit]] = False
+        if not left.any():
+            return None, {"size": len(a)}
+    k = int(np.nonzero(left)[0][0])
+    raise Invalid(f"{int(va[k])}*{int(vb[k])}+1 = {int(va[k]) * int(vb[k]) + 1} is squarefree")

tasks/construct-ae-p52-erdos-squarefree-l5-s4/tests/instance.json

@@ -0,0 +1 @@
+{"N": 7124, "t": 285, "family": "ae_p52_erdos_squarefree", "subset": "construct"}

tasks/construct-ae-p52-erdos-squarefree-l5-s4/tests/run.py

@@ -0,0 +1,127 @@
+"""rlmath runtime grader. Copied into every task as /tests/run.py next to /tests/check.py.
+
+Deterministic; no LLM in the reward path. Runs with python3 + numpy/scipy/sympy/networkx only.
+
+    python3 /tests/run.py /tests/instance.json /workdir/answer.json
+
+Prints the reward in [0, 1] and writes /logs/verifier/details.json when that directory exists.
+
+check.py must define  check(inst, ans) -> (value, extra_dict)  and raise Invalid for a bad answer.
+  construct : value is ignored; a returned check means the witness is valid -> reward 1.0
+  optimize  : value is the raw objective; reward = 0.1 + 0.9 * progress, where
+              progress = clip((s - baseline) / (best_known - baseline), 0, 1)       (maximize)
+                         clip((baseline - s) / (baseline - best_known), 0, 1)       (minimize)
+              inst must carry "direction", "baseline", "best_known".
+"""
+import json
+import math
+import os
+import sys
+
+VALID_FLOOR = 0.1
+
+
+class Invalid(Exception):
+    pass
+
+
+# ------------------------------------------------------------ input helpers
+
+def int_list(v, n=None, lo=None, hi=None, name="list"):
+    if not isinstance(v, list):
+        raise Invalid(f"{name} must be a list")
+    if n is not None and len(v) != n:
+        raise Invalid(f"{name} must have length {n}, got {len(v)}")
+    for x in v:
+        if isinstance(x, bool) or not isinstance(x, int):
+            raise Invalid(f"{name} must contain integers only")
+        if (lo is not None and x < lo) or (hi is not None and x > hi):
+            raise Invalid(f"{name} entry {x} out of range [{lo}, {hi}]")
+    return v
+
+
+def as_int(x, name="value", lo=None, hi=None):
+    return int_list([x], 1, lo, hi, name)[0]
+
+
+def num(x, name="value"):
+    if isinstance(x, bool) or not isinstance(x, (int, float)):
+        raise Invalid(f"{name} must be a number")
+    if not math.isfinite(x):
+        raise Invalid(f"{name} is not finite")
+    return float(x)
+
+
+def float_matrix(v, rows=None, cols=None, name="matrix"):
+    if not isinstance(v, list) or (rows is not None and len(v) != rows):
+        raise Invalid(f"{name} must be a list of {rows} rows")
+    out = []
+    for r in v:
+        if not isinstance(r, list) or (cols is not None and len(r) != cols):
+            raise Invalid(f"each row of {name} must have {cols} numbers")
+        out.append([num(x, name) for x in r])
+    return out
+
+
+def float_list(v, n=None, name="list"):
+    if not isinstance(v, list) or (n is not None and len(v) != n):
+        raise Invalid(f"{name} must be a list of length {n}")
+    return [num(x, name) for x in v]
+
+
+# ------------------------------------------------------------------ reward
+
+def optimize_reward(inst, s):
+    b, best = inst["baseline"], inst["best_known"]
+    if inst.get("progress_scale") == "log":
+        # for non-negative losses spanning orders of magnitude (e.g. overlap loss -> 0);
+        # progress is measured in log10(value + floor)
+        f = inst.get("log_floor", 1e-3)
+        b, best, s = (math.log10(max(x, 0.0) + f) for x in (b, best, s))
+    if inst["direction"] == "maximize":
+        p = (s - b) / (best - b)
+    else:
+        p = (b - s) / (b - best)
+    return VALID_FLOOR + (1 - VALID_FLOOR) * max(0.0, min(1.0, p))
+
+
+def grade(inst, ans, check):
+    try:
+        if not isinstance(ans, dict):
+            raise Invalid("answer must be a JSON object")
+        value, extra = check(inst, ans)
+        if inst.get("subset") == "optimize":
+            s = float(value)
+            if not math.isfinite(s):
+                raise Invalid("non-finite score")
+            return optimize_reward(inst, s), {"valid": True, "raw_score": s, **(extra or {})}
+        return 1.0, {"valid": True, **(extra or {})}
+    except Invalid as e:
+        return 0.0, {"valid": False, "error": str(e)}
+    except Exception as e:  # any malformed answer
+        return 0.0, {"valid": False, "error": f"{type(e).__name__}: {e}"}
+
+
+def main():
+    here = os.path.dirname(os.path.abspath(__file__))
+    sys.path.insert(0, here)
+    # import ourselves as `run` so check.py's `from run import Invalid` is the same class
+    import run as R  # noqa: E402
+    import check as family  # noqa: E402
+
+    inst = json.load(open(sys.argv[1]))
+    try:
+        ans = json.load(open(sys.argv[2]))
+    except Exception as e:
+        reward, det = 0.0, {"valid": False, "error": f"unreadable answer: {e}"}
+    else:
+        reward, det = R.grade(inst, ans, family.check)
+    det["reward"] = reward
+    if os.path.isdir("/logs/verifier"):
+        with open("/logs/verifier/details.json", "w") as f:
+            json.dump(det, f)
+    print(reward)
+
+
+if __name__ == "__main__":
+    main()

tasks/construct-ae-p52-erdos-squarefree-l5-s4/tests/test.sh

@@ -0,0 +1,9 @@
+#!/bin/bash
+mkdir -p /logs/verifier
+if [ ! -s /workdir/answer.json ]; then
+  echo '{"valid": false, "error": "no /workdir/answer.json"}' > /logs/verifier/details.json
+  echo 0 > /logs/verifier/reward.txt
+  exit 0
+fi
+timeout 290 python3 /tests/run.py /tests/instance.json /workdir/answer.json \
+  > /logs/verifier/reward.txt 2> /logs/verifier/grader.log || echo 0 > /logs/verifier/reward.txt

tasks/construct-ae-p58-happy-ending-l2-s0/environment/Dockerfile

@@ -0,0 +1,7 @@
+FROM python:3.11.16-slim
+RUN apt-get update && apt-get install -y --no-install-recommends tmux curl git procps build-essential \
+    && rm -rf /var/lib/apt/lists/*
+RUN pip install --no-cache-dir numpy==2.4.6 scipy==1.17.1 sympy==1.14.0 networkx==3.6.1 \
+    python-sat==1.9.dev15 z3-solver==5.1.0.0 PuLP==3.3.2 ortools==9.15.6755
+WORKDIR /workdir
+COPY instance.json /workdir/instance.json

tasks/construct-ae-p58-happy-ending-l2-s0/environment/instance.json

@@ -0,0 +1 @@
+{"n": 16, "k": 6, "max_abs": 1000000000000000000, "family": "ae_p58_happy_ending", "subset": "construct"}

tasks/construct-ae-p58-happy-ending-l2-s0/solution/solve.sh

@@ -0,0 +1,5 @@
+#!/bin/bash
+# oracle: a known valid construction (planted witness or published solution)
+cat > /workdir/answer.json <<'RLMATH_EOF'
+{"points": [[0, 0], [92000, -92000000], [92001, -91999998], [92002, -91999990], [92003, -91999954], [184000, -368000000], [184001, -367999990], [184002, -367999988], [184003, -367999924], [184004, -367999922], [184005, -367999914], [276000, -828000000], [276001, -827999944], [276002, -827999934], [276003, -827999932], [368000, -1472000000]]}
+RLMATH_EOF

tasks/construct-ae-p58-happy-ending-l2-s0/tests/check.py

@@ -0,0 +1,69 @@
+"""Erdos-Szekeres happy ending (AlphaEvolve problem 58): n = 2^(k-2) integer points in general position with no
+k points in convex position. Exact integer orientation tests; the largest convex-position subset is computed by
+the O(n^4) bottom-vertex / angular-order dynamic programme.
+
+Upstream bug: the notebook's verifier uses float orientations with a 1e-9 threshold (and numba fastmath); its
+33- and 65-point sets (claimed to have "0 convex k-gons") contain a convex 7-gon / 8-gon under exact arithmetic."""
+import functools
+
+import numpy as np
+
+from run import Invalid, int_list
+
+
+def orient_table(p):
+    n = len(p)
+    o = np.zeros((n, n, n), dtype=np.int8)
+    for i in range(n):
+        xi, yi = p[i]
+        for j in range(i + 1, n):
+            dx, dy = p[j][0] - xi, p[j][1] - yi
+            for k in range(j + 1, n):
+                c = dx * (p[k][1] - yi) - dy * (p[k][0] - xi)
+                if c == 0:
+                    raise Invalid(f"points {p[i]}, {p[j]}, {p[k]} are collinear")
+                s = 1 if c > 0 else -1
+                o[i, j, k] = o[j, k, i] = o[k, i, j] = s
+                o[i, k, j] = o[k, j, i] = o[j, i, k] = -s
+    return o
+
+
+def max_convex(p, o):
+    n = len(p)
+    best = min(n, 3)
+    order = sorted(range(n), key=lambda i: (p[i][1], p[i][0]))
+    for bi, b in enumerate(order):
+        rest = order[bi + 1:]
+        m = len(rest)
+        if m < 2:
+            continue
+        rest = sorted(rest, key=functools.cmp_to_key(lambda u, v: -int(o[b, u, v])))
+        r = np.array(rest)
+        chain = np.zeros((m, m), dtype=np.int32)  # chain[i, j]: longest convex chain b .. r_i -> r_j
+        for j in range(1, m):
+            for i in range(j):
+                v = 3
+                if i > 0:
+                    ok = (chain[:i, i] > 0) & (o[r[:i], r[i], r[j]] > 0)
+                    if ok.any():
+                        v = max(v, int(chain[:i, i][ok].max()) + 1)
+                chain[i, j] = v
+            close = o[r[:j], r[j], b] > 0
+            if close.any():
+                best = max(best, int(chain[:j, j][close].max()))
+    return best
+
+
+def check(inst, ans):
+    n, k, lim = inst["n"], inst["k"], inst["max_abs"]
+    pts = ans.get("points")
+    if not isinstance(pts, list) or len(pts) != n:
+        raise Invalid(f"points must be a list of {n} [x, y] pairs")
+    p = [tuple(int_list(q, 2, -lim, lim, "point")) for q in pts]
+    if len(set(p)) != n:
+        raise Invalid("points must be distinct")
+    o = orient_table(p)
+    mc = max_convex(p, o)
+    if mc >= k:
+        raise Invalid(f"the set contains {mc} points in convex position (>= {k})")
+    return None, {"max_convex_subset": mc}

tasks/construct-ae-p58-happy-ending-l2-s0/tests/instance.json

@@ -0,0 +1 @@
+{"n": 16, "k": 6, "max_abs": 1000000000000000000, "family": "ae_p58_happy_ending", "subset": "construct"}

tasks/construct-ae-p58-happy-ending-l2-s0/tests/run.py

@@ -0,0 +1,127 @@
+"""rlmath runtime grader. Copied into every task as /tests/run.py next to /tests/check.py.
+
+Deterministic; no LLM in the reward path. Runs with python3 + numpy/scipy/sympy/networkx only.
+
+    python3 /tests/run.py /tests/instance.json /workdir/answer.json
+
+Prints the reward in [0, 1] and writes /logs/verifier/details.json when that directory exists.
+
+check.py must define  check(inst, ans) -> (value, extra_dict)  and raise Invalid for a bad answer.
+  construct : value is ignored; a returned check means the witness is valid -> reward 1.0
+  optimize  : value is the raw objective; reward = 0.1 + 0.9 * progress, where
+              progress = clip((s - baseline) / (best_known - baseline), 0, 1)       (maximize)
+                         clip((baseline - s) / (baseline - best_known), 0, 1)       (minimize)
+              inst must carry "direction", "baseline", "best_known".
+"""
+import json
+import math
+import os
+import sys
+
+VALID_FLOOR = 0.1
+
+
+class Invalid(Exception):
+    pass
+
+
+# ------------------------------------------------------------ input helpers
+
+def int_list(v, n=None, lo=None, hi=None, name="list"):
+    if not isinstance(v, list):
+        raise Invalid(f"{name} must be a list")
+    if n is not None and len(v) != n:
+        raise Invalid(f"{name} must have length {n}, got {len(v)}")
+    for x in v:
+        if isinstance(x, bool) or not isinstance(x, int):
+            raise Invalid(f"{name} must contain integers only")
+        if (lo is not None and x < lo) or (hi is not None and x > hi):
+            raise Invalid(f"{name} entry {x} out of range [{lo}, {hi}]")
+    return v
+
+
+def as_int(x, name="value", lo=None, hi=None):
+    return int_list([x], 1, lo, hi, name)[0]
+
+
+def num(x, name="value"):
+    if isinstance(x, bool) or not isinstance(x, (int, float)):
+        raise Invalid(f"{name} must be a number")
+    if not math.isfinite(x):
+        raise Invalid(f"{name} is not finite")
+    return float(x)
+
+
+def float_matrix(v, rows=None, cols=None, name="matrix"):
+    if not isinstance(v, list) or (rows is not None and len(v) != rows):
+        raise Invalid(f"{name} must be a list of {rows} rows")
+    out = []
+    for r in v:
+        if not isinstance(r, list) or (cols is not None and len(r) != cols):
+            raise Invalid(f"each row of {name} must have {cols} numbers")
+        out.append([num(x, name) for x in r])
+    return out
+
+
+def float_list(v, n=None, name="list"):
+    if not isinstance(v, list) or (n is not None and len(v) != n):
+        raise Invalid(f"{name} must be a list of length {n}")
+    return [num(x, name) for x in v]
+
+
+# ------------------------------------------------------------------ reward
+
+def optimize_reward(inst, s):
+    b, best = inst["baseline"], inst["best_known"]
+    if inst.get("progress_scale") == "log":
+        # for non-negative losses spanning orders of magnitude (e.g. overlap loss -> 0);
+        # progress is measured in log10(value + floor)
+        f = inst.get("log_floor", 1e-3)
+        b, best, s = (math.log10(max(x, 0.0) + f) for x in (b, best, s))
+    if inst["direction"] == "maximize":
+        p = (s - b) / (best - b)
+    else:
+        p = (b - s) / (b - best)
+    return VALID_FLOOR + (1 - VALID_FLOOR) * max(0.0, min(1.0, p))
+
+
+def grade(inst, ans, check):
+    try:
+        if not isinstance(ans, dict):
+            raise Invalid("answer must be a JSON object")
+        value, extra = check(inst, ans)
+        if inst.get("subset") == "optimize":
+            s = float(value)
+            if not math.isfinite(s):
+                raise Invalid("non-finite score")
+            return optimize_reward(inst, s), {"valid": True, "raw_score": s, **(extra or {})}
+        return 1.0, {"valid": True, **(extra or {})}
+    except Invalid as e:
+        return 0.0, {"valid": False, "error": str(e)}
+    except Exception as e:  # any malformed answer
+        return 0.0, {"valid": False, "error": f"{type(e).__name__}: {e}"}
+
+
+def main():
+    here = os.path.dirname(os.path.abspath(__file__))
+    sys.path.insert(0, here)
+    # import ourselves as `run` so check.py's `from run import Invalid` is the same class
+    import run as R  # noqa: E402
+    import check as family  # noqa: E402
+
+    inst = json.load(open(sys.argv[1]))
+    try:
+        ans = json.load(open(sys.argv[2]))
+    except Exception as e:
+        reward, det = 0.0, {"valid": False, "error": f"unreadable answer: {e}"}
+    else:
+        reward, det = R.grade(inst, ans, family.check)
+    det["reward"] = reward
+    if os.path.isdir("/logs/verifier"):
+        with open("/logs/verifier/details.json", "w") as f:
+            json.dump(det, f)
+    print(reward)
+
+
+if __name__ == "__main__":
+    main()

tasks/construct-ae-p58-happy-ending-l2-s0/tests/test.sh

@@ -0,0 +1,9 @@
+#!/bin/bash
+mkdir -p /logs/verifier
+if [ ! -s /workdir/answer.json ]; then
+  echo '{"valid": false, "error": "no /workdir/answer.json"}' > /logs/verifier/details.json
+  echo 0 > /logs/verifier/reward.txt
+  exit 0
+fi
+timeout 290 python3 /tests/run.py /tests/instance.json /workdir/answer.json \
+  > /logs/verifier/reward.txt 2> /logs/verifier/grader.log || echo 0 > /logs/verifier/reward.txt

tasks/construct-mc-all-interval-l5-s6/environment/Dockerfile

@@ -0,0 +1,7 @@
+FROM python:3.11.16-slim
+RUN apt-get update && apt-get install -y --no-install-recommends tmux curl git procps build-essential \
+    && rm -rf /var/lib/apt/lists/*
+RUN pip install --no-cache-dir numpy==2.4.6 scipy==1.17.1 sympy==1.14.0 networkx==3.6.1 \
+    python-sat==1.9.dev15 z3-solver==5.1.0.0 PuLP==3.3.2 ortools==9.15.6755
+WORKDIR /workdir
+COPY instance.json /workdir/instance.json

tasks/construct-mc-all-interval-l5-s6/environment/instance.json

@@ -0,0 +1 @@
+{"n": 32, "fixed": [], "family": "mc_all_interval", "subset": "construct"}

tasks/construct-mc-all-interval-l5-s6/solution/solve.sh

@@ -0,0 +1,5 @@
+#!/bin/bash
+# oracle: a known valid construction (planted witness or published solution)
+cat > /workdir/answer.json <<'RLMATH_EOF'
+{"x": [0, 31, 1, 30, 2, 29, 3, 28, 4, 27, 5, 26, 6, 25, 7, 24, 8, 23, 9, 22, 10, 21, 11, 20, 12, 19, 13, 18, 14, 17, 15, 16]}
+RLMATH_EOF

tasks/construct-mc-all-interval-l5-s6/tests/check.py

@@ -0,0 +1,17 @@
+"""All-interval series of size n (MathConstraint all_interval, CC-BY-4.0). Accepts any valid series."""
+from run import Invalid, int_list
+
+
+def check(inst, ans):
+    n = inst["n"]
+    x = int_list(ans.get("x"), n, 0, n - 1, "x")
+    if sorted(x) != list(range(n)):
+        raise Invalid("x is not a permutation of 0..n-1")
+    d = [abs(x[i + 1] - x[i]) for i in range(n - 1)]
+    if sorted(d) != list(range(1, n)):
+        raise Invalid("consecutive differences are not a permutation of 1..n-1")
+    seqs = {"x": x, "d": d}
+    for name, i, v in inst.get("fixed", []):
+        if seqs[name][i] != v:
+            raise Invalid(f"fixed value {name}[{i}] = {v} not respected")
+    return None, {}

tasks/construct-mc-all-interval-l5-s6/tests/instance.json

@@ -0,0 +1 @@
+{"n": 32, "fixed": [], "family": "mc_all_interval", "subset": "construct"}

tasks/construct-mc-all-interval-l5-s6/tests/run.py

@@ -0,0 +1,127 @@
+"""rlmath runtime grader. Copied into every task as /tests/run.py next to /tests/check.py.
+
+Deterministic; no LLM in the reward path. Runs with python3 + numpy/scipy/sympy/networkx only.
+
+    python3 /tests/run.py /tests/instance.json /workdir/answer.json
+
+Prints the reward in [0, 1] and writes /logs/verifier/details.json when that directory exists.
+
+check.py must define  check(inst, ans) -> (value, extra_dict)  and raise Invalid for a bad answer.
+  construct : value is ignored; a returned check means the witness is valid -> reward 1.0
+  optimize  : value is the raw objective; reward = 0.1 + 0.9 * progress, where
+              progress = clip((s - baseline) / (best_known - baseline), 0, 1)       (maximize)
+                         clip((baseline - s) / (baseline - best_known), 0, 1)       (minimize)
+              inst must carry "direction", "baseline", "best_known".
+"""
+import json
+import math
+import os
+import sys
+
+VALID_FLOOR = 0.1
+
+
+class Invalid(Exception):
+    pass
+
+
+# ------------------------------------------------------------ input helpers
+
+def int_list(v, n=None, lo=None, hi=None, name="list"):
+    if not isinstance(v, list):
+        raise Invalid(f"{name} must be a list")
+    if n is not None and len(v) != n:
+        raise Invalid(f"{name} must have length {n}, got {len(v)}")
+    for x in v:
+        if isinstance(x, bool) or not isinstance(x, int):
+            raise Invalid(f"{name} must contain integers only")
+        if (lo is not None and x < lo) or (hi is not None and x > hi):
+            raise Invalid(f"{name} entry {x} out of range [{lo}, {hi}]")
+    return v
+
+
+def as_int(x, name="value", lo=None, hi=None):
+    return int_list([x], 1, lo, hi, name)[0]
+
+
+def num(x, name="value"):
+    if isinstance(x, bool) or not isinstance(x, (int, float)):
+        raise Invalid(f"{name} must be a number")
+    if not math.isfinite(x):
+        raise Invalid(f"{name} is not finite")
+    return float(x)
+
+
+def float_matrix(v, rows=None, cols=None, name="matrix"):
+    if not isinstance(v, list) or (rows is not None and len(v) != rows):
+        raise Invalid(f"{name} must be a list of {rows} rows")
+    out = []
+    for r in v:
+        if not isinstance(r, list) or (cols is not None and len(r) != cols):
+            raise Invalid(f"each row of {name} must have {cols} numbers")
+        out.append([num(x, name) for x in r])
+    return out
+
+
+def float_list(v, n=None, name="list"):
+    if not isinstance(v, list) or (n is not None and len(v) != n):
+        raise Invalid(f"{name} must be a list of length {n}")
+    return [num(x, name) for x in v]
+
+
+# ------------------------------------------------------------------ reward
+
+def optimize_reward(inst, s):
+    b, best = inst["baseline"], inst["best_known"]
+    if inst.get("progress_scale") == "log":
+        # for non-negative losses spanning orders of magnitude (e.g. overlap loss -> 0);
+        # progress is measured in log10(value + floor)
+        f = inst.get("log_floor", 1e-3)
+        b, best, s = (math.log10(max(x, 0.0) + f) for x in (b, best, s))
+    if inst["direction"] == "maximize":
+        p = (s - b) / (best - b)
+    else:
+        p = (b - s) / (b - best)
+    return VALID_FLOOR + (1 - VALID_FLOOR) * max(0.0, min(1.0, p))
+
+
+def grade(inst, ans, check):
+    try:
+        if not isinstance(ans, dict):
+            raise Invalid("answer must be a JSON object")
+        value, extra = check(inst, ans)
+        if inst.get("subset") == "optimize":
+            s = float(value)
+            if not math.isfinite(s):
+                raise Invalid("non-finite score")
+            return optimize_reward(inst, s), {"valid": True, "raw_score": s, **(extra or {})}
+        return 1.0, {"valid": True, **(extra or {})}
+    except Invalid as e:
+        return 0.0, {"valid": False, "error": str(e)}
+    except Exception as e:  # any malformed answer
+        return 0.0, {"valid": False, "error": f"{type(e).__name__}: {e}"}
+
+
+def main():
+    here = os.path.dirname(os.path.abspath(__file__))
+    sys.path.insert(0, here)
+    # import ourselves as `run` so check.py's `from run import Invalid` is the same class
+    import run as R  # noqa: E402
+    import check as family  # noqa: E402
+
+    inst = json.load(open(sys.argv[1]))
+    try:
+        ans = json.load(open(sys.argv[2]))
+    except Exception as e:
+        reward, det = 0.0, {"valid": False, "error": f"unreadable answer: {e}"}
+    else:
+        reward, det = R.grade(inst, ans, family.check)
+    det["reward"] = reward
+    if os.path.isdir("/logs/verifier"):
+        with open("/logs/verifier/details.json", "w") as f:
+            json.dump(det, f)
+    print(reward)
+
+
+if __name__ == "__main__":
+    main()

tasks/construct-mc-all-interval-l5-s6/tests/test.sh

@@ -0,0 +1,9 @@
+#!/bin/bash
+mkdir -p /logs/verifier
+if [ ! -s /workdir/answer.json ]; then
+  echo '{"valid": false, "error": "no /workdir/answer.json"}' > /logs/verifier/details.json
+  echo 0 > /logs/verifier/reward.txt
+  exit 0
+fi
+timeout 290 python3 /tests/run.py /tests/instance.json /workdir/answer.json \
+  > /logs/verifier/reward.txt 2> /logs/verifier/grader.log || echo 0 > /logs/verifier/reward.txt

tasks/construct-mc-all-interval-l5-s7/environment/Dockerfile

@@ -0,0 +1,7 @@
+FROM python:3.11.16-slim
+RUN apt-get update && apt-get install -y --no-install-recommends tmux curl git procps build-essential \
+    && rm -rf /var/lib/apt/lists/*
+RUN pip install --no-cache-dir numpy==2.4.6 scipy==1.17.1 sympy==1.14.0 networkx==3.6.1 \
+    python-sat==1.9.dev15 z3-solver==5.1.0.0 PuLP==3.3.2 ortools==9.15.6755
+WORKDIR /workdir
+COPY instance.json /workdir/instance.json