Every number, where it came from, and the command that reproduces it.
This project holds against a vendor that it claimed a benchmark score and never published a reproducible run. That standard applies here first. Below is every measurement, its source, and what it does not show.
V verified against a primary source · S derived, with the derivation named · ? unconfirmed, carried along and marked
| Quantity | Value | Source |
|---|---|---|
Hit rate, GLM-5.2 + Terminus 2, 20 tasks, k=3 | 78.3 % ± 7.6 | V 47/60 runs, measured |
| 95 % interval, cluster bootstrap over tasks | 63.3 – 91.7 | V 10,000 resamples, seed 20260803 |
pass@3 | 90.0 % | V |
| Post-stratified to all 89 tasks | 82.1 % | S same raw data, population weights |
| Cost | $17.81 | V reconciled against the provider’s dashboard |
| Extrapolated to a full submission (445 runs) | $132 | S from the measured per-run cost |
⚠️ The ±7.6 and the interval are not the same estimator, and the interval is not 78.3 ± 1.96 × 7.6. Both come from the same cluster bootstrap; ±7.6 is its standard deviation and 63.3–91.7 are its 2.5th and 97.5th percentiles. The interval is asymmetric on purpose — a bounded proportion over 20 clusters runs past 100 % under a normal approximation long before the data does.
git clone https://github.com/KeinNiek/constrained-agent-systems cd constrained-agent-systems # the sample: 20 of 89 tasks, stratified, seed 20260803 python3 scripts/sample_tasks.py --seed 20260803 # the evaluation, including the error bars and the honest breakdown of zeros python3 scripts/q15_evaluate.py <your jobs directory> # every experiment recomputes its own published figures from its raw rows python3 experiments/exp04-q15/verify_numbers.py python3 experiments/exp05-q25/verify_numbers.py python3 experiments/exp06-q28/verify_numbers.py python3 experiments/exp07-q29/verify_numbers.py
The exact command blocks that produced each run are in
docs/Q15-COMMANDS.md, docs/Q25-COMMANDS.md,
docs/Q28-COMMANDS.md and docs/Q29-COMMANDS.md, together
with which parts of each were actually executed and which were not.
| # | Question | Answer | Cost |
|---|---|---|---|
| 01 | Can an agent write a usable acceptance oracle from the task statement? | No. 25 % of the real test assertions are in principle underivable; as a gate it rejects correct solutions | — |
| 02 | Can that oracle rank candidates instead? | No. 3 of 5 right, one tie, one inversion by 15 points — and the error is anticorrelated with correctness | — |
| 03 | Does the pipeline run end to end against a real container? | Yes. Reward 1.0, schema-valid trajectory | — |
| 04 | How good is GLM-5.2 really? | 78.3 % ± 7.6, the number above | $17.81 |
| 05 | Does time budgeting rescue timeouts? | Failed its own criterion — 0 of 3 where ≥2 was required, because a turn cap nobody had named bound first | $10.91 |
| 06 | Does batching commands cut turns and cost? | Refuted. The model batched (2.00 commands/turn vs 1.06) and turns rose 1.19×, tokens 1.75× | $6.37 |
| 07 | Does a time budget help, once isolated? | The phenomenon was not there. The clock bound 0 times in 17 runs | $11.19 |
Kept here rather than quietly fixed, because an instrument you built yourself is not thereby verified: