Dataset Viewer
Auto-converted to Parquet Duplicate
cot_idx
int64
0
75.6k
sample_idx
int64
0
36.9k
problem
stringlengths
16
4.03k
solution
stringlengths
85
38.1k
⌀
answer
stringlengths
0
3.24k
data_source
stringclasses
45 values
data_fields
dict
input_ids
listlengths
286
23.9k
labels
listlengths
286
23.9k
valid_mask
listlengths
286
23.9k
0
0
If $5x - 3 = 12$, what is the value of $5x + 3$?
null
18
math
{ "unique_id": "test/prealgebra/2002.json", "subject": "Prealgebra", "level": 2, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 2679, 400, 20, 87, 481, 220, 18, 284, 220, 16, 17, 54876, 1128, 374, 279, 897, 315, 400, 20, 87, 488, 220, 18, 3, 1939, 5501, 2874, 3019, 553, 3019, 11, 323, 2182, 697, 1590, 4226, 2878, 1124, 79075, 46391, 15164...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
1
1
How many vertical asymptotes does the graph of $y=\frac{2}{x^2+x-6}$ have?
null
2
math
{ "unique_id": "test/algebra/1.json", "subject": "Algebra", "level": 3, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 4340, 1657, 12140, 96254, 6295, 1558, 279, 4771, 315, 400, 88, 34433, 37018, 90, 17, 15170, 87, 61, 17, 37892, 12, 21, 31716, 614, 1939, 5501, 2874, 3019, 553, 3019, 11, 323, 2182, 697, 1590, 4226, 2878, 1124, 79075,...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
2
2
Alice wants to buy $3$ pounds of veal at the grocery store, but the scales at the store only show weight in kilograms. If one kilogram is $2.20$ pounds, how many kilograms of veal should Alice buy? (You may use a calculator on this problem; answer to the nearest hundredth.)
null
1.36
math
{ "unique_id": "test/prealgebra/2017.json", "subject": "Prealgebra", "level": 4, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 61686, 6801, 311, 3695, 400, 18, 3, 16302, 315, 5208, 278, 518, 279, 29587, 3553, 11, 714, 279, 28405, 518, 279, 3553, 1172, 1473, 4680, 304, 84302, 13, 1416, 825, 15045, 12958, 374, 400, 17, 13, 17, 15, 3, 16302, ...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
3
3
Connie is starting an exercise program. On June 1, she will do 25 sit-ups. Each day after that, she will increase her number of sit-ups by four. On which date during the month of June will Connie first do more than 100 sit-ups in one day?
null
\text{June 20}
math
{ "unique_id": "test/algebra/2359.json", "subject": "Algebra", "level": 2, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 9701, 645, 374, 5916, 458, 10158, 2025, 13, 1913, 5534, 220, 16, 11, 1340, 686, 653, 220, 17, 20, 2444, 26761, 13, 8886, 1899, 1283, 429, 11, 1340, 686, 5263, 1059, 1372, 315, 2444, 26761, 553, 3040, 13, 1913, 892,...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
4
4
We have two geometric sequences of positive real numbers: $$6,a,b\text{ and }\frac{1}{b},a,54$$Solve for $a$.
null
3\sqrt{2}
math
{ "unique_id": "test/algebra/184.json", "subject": "Algebra", "level": 5, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 1654, 614, 1378, 52484, 23700, 315, 6785, 1931, 5109, 25, 26107, 21, 15012, 8402, 59, 1318, 90, 323, 51300, 37018, 90, 16, 15170, 65, 2137, 64, 11, 20, 19, 14085, 50, 3948, 369, 400, 64, 3, 382, 5501, 2874, 3019, ...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1...
5
5
$AB = 20$ cm, $m \angle A = 30^\circ$, and $m \angle C = 45^\circ$. Express the number of centimeters in the length of $\overline{BC}$ in simplest radical form. [asy] import olympiad; size(200); import geometry; import graph; defaultpen(linewidth(0.8)); pair A = origin, B = (10*sqrt(3),10), C = (10*sqrt(3) + 10,0); dra...
null
10\sqrt{2}
math
{ "unique_id": "test/prealgebra/1210.json", "subject": "Prealgebra", "level": 5, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 3, 1867, 284, 220, 17, 15, 3, 9961, 11, 400, 76, 1124, 4044, 362, 284, 220, 18, 15, 24884, 43298, 54876, 323, 400, 76, 1124, 4044, 356, 284, 220, 19, 20, 24884, 43298, 12947, 17399, 279, 1372, 315, 2889, 54236, 3...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
6
6
Determine the remainder of 71 (mod 3).
null
2
math
{ "unique_id": "test/number_theory/81.json", "subject": "Number Theory", "level": 1, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 35, 24308, 279, 26313, 315, 220, 22, 16, 320, 2593, 220, 18, 3593, 5501, 2874, 3019, 553, 3019, 11, 323, 2182, 697, 1590, 4226, 2878, 1124, 79075, 46391, 151645, 198, 151644, 77091, 198, 151667, 198, 32313, 11, 773, ...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, 0, 0, 0, 0, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
7
7
One sphere is centered at $(3,-5,7)$ with radius $5 \sqrt{5}.$ A second sphere is centered at $(0,1,1)$ with radius $2 \sqrt{17}.$ The two spheres intersect in a circle. Find the radius of this circle.
null
\frac{2 \sqrt{149}}{3}
math
{ "unique_id": "test/precalculus/396.json", "subject": "Precalculus", "level": 5, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 3966, 25366, 374, 30188, 518, 4930, 18, 4999, 20, 11, 22, 15087, 448, 10578, 400, 20, 1124, 26888, 90, 20, 92, 2418, 220, 362, 2086, 25366, 374, 30188, 518, 4930, 15, 11, 16, 11, 16, 15087, 448, 10578, 400, 17, 1...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
8
8
"One morning each member of Angela's family drank an 8-ounce mixture of coffee with milk. The amount(...TRUNCATED)
null
5
math
{"unique_id":"test/number_theory/227.json","subject":"Number Theory","level":5,"seq_id":null,"testca(...TRUNCATED)
[151644,872,198,3966,6556,1817,4462,315,37143,594,2997,53144,458,220,23,12,9734,20980,315,10799,448,(...TRUNCATED)
[-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED)
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0(...TRUNCATED)
9
9
"The sum of the squares of three consecutive positive even numbers is $12296$. Find the product of t(...TRUNCATED)
null
32736
math
{"unique_id":"test/algebra/392.json","subject":"Algebra","level":4,"seq_id":null,"testcase":null,"ID(...TRUNCATED)
[151644,872,198,785,2629,315,279,31340,315,2326,23921,6785,1496,5109,374,400,16,17,17,24,21,12947,73(...TRUNCATED)
[-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED)
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0(...TRUNCATED)
End of preview. Expand in Data Studio

Terminator-Qwen3-14B Training Data

Project page | Paper | Code | Trained weights

The tokenized, labeled data used to train Terminator-Qwen3-14B. Terminator is a small network that predicts when a reasoning model has reached its final answer so the remaining reasoning can be skipped.

Each row is one chain of thought (CoT) from Qwen3-14B on a math, coding or science problem, with per-token labels marking where the CoT first reaches its final answer. This dataset holds training data only. To evaluate on the test benchmarks, generate their CoTs with the code.

Contents

Source Train CoTs Train problems Validation CoTs Validation problems
MATH 19,890 7,703 134 50
OpenCoder 22,265 9,175 126 50
OpenScience 31,184 11,784 135 50
AIME 1983-2024 1,712 798 106 50
Total 75,051 29,460 501 200

Usage

from datasets import load_dataset
from transformers import AutoTokenizer

ds = load_dataset("acnagle/Terminator-Qwen3-14B-Training-Data")
row = ds["train"][0]

tokenizer = AutoTokenizer.from_pretrained("Qwen/Qwen3-14B")
text = tokenizer.decode(row["input_ids"])  # the prompt and the CoT

To train with the code, download the files to the path its scripts expect, then run the training script from the repo root:

hf download acnagle/Terminator-Qwen3-14B-Training-Data train.jsonl val.jsonl \
  --repo-type dataset --local-dir data/outputs/Qwen/Qwen3-14B
bash train_terminator_qwen3-14b.sh

Fields

Field Description
cot_idx CoT ID, unique across both splits
sample_idx Problem ID, specific to this dataset. CoTs of the same problem share it
problem, answer Problem text and reference answer
solution Reference solution. Null for MATH (see Sources and licenses) and AIME (none upstream)
data_source math, opencoder, openscience or aime_<year>
data_fields Source-specific metadata. Keys that don't apply to a source are null
input_ids Qwen3-14B tokens: prompt, <think>, the CoT, </think>. The final response isn't included
labels -100 outside the reasoning, 0 up to and including the last token of the answer span, 1 after it. </think> is always 1
valid_mask 1 where labels isn't -100. The training code doesn't read it

How it was made

Each problem has 3 CoTs, sampled from Qwen3-14B with temperature 0.6, top-p 0.95, top-k 20 and presence penalty 1.5, up to 24,576 tokens. Qwen3-30B-A3B-Thinking-2507 then extracted each final answer and located the first place the CoT reaches it. Only CoTs whose span passed verification were kept: 75,552 of 110,504, covering 29,660 of 36,933 problems.

prepare_training_data.py tokenized those CoTs and built the labels with its default split settings, holding out 50 problems per source for validation using seed 1337. The rows are grouped by source, so shuffle them before training.

Rebuilding this data from scratch requires generating CoTs and rerunning the pipeline in the code.

Sources and licenses

CoTs, spans and labels are released under Apache-2.0, matching Qwen3-14B. Problem text and reference data stay under their original terms. The labels below are as listed upstream, and they may not settle the rights to the underlying problems.

Source License listed upstream
MATH, via the PRM800K split None. solution is omitted because AoPS claims those solutions as proprietary
AIME 1983-2024 MIT
OpenCoder (educational_instruct) MIT
OpenScience (OS-Q3-235B-4) CC BY 4.0

Citation

@misc{nagle2026terminatorlearningoptimalexit,
  title   = {TERMINATOR: Learning Optimal Exit Points for Early Stopping in Chain-of-Thought Reasoning},
  author  = {Alliot Nagle and Jakhongir Saydaliev and Dhia Garbaya and Michael Gastpar and Ashok Vardhan Makkuva and Hyeji Kim},
  year    = {2026},
  eprint  = {2603.12529},
  archivePrefix = {arXiv},
  primaryClass  = {cs.LG},
  url     = {https://arxiv.org/abs/2603.12529}
}
Downloads last month
13

Models trained or fine-tuned on acnagle/Terminator-Qwen3-14B-Training-Data

Collection including acnagle/Terminator-Qwen3-14B-Training-Data

Paper for acnagle/Terminator-Qwen3-14B-Training-Data