Reasoning Compression: Ablation Arms
Collection
All ablation arms + dataset variants behind the caveman reasoning-compression study. For headline artifacts: see the main collection. • 13 items • Updated
prompt_id stringlengths 16 16 | input stringlengths 32 9.54k | reasoning stringlengths 237 34.5k | answer stringlengths 11 28.2k | domain stringclasses 4
values | source stringclasses 2
values | lang stringclasses 1
value | task_type stringclasses 26
values | verified bool 1
class | difficulty dict | meta dict |
|---|---|---|---|---|---|---|---|---|---|---|
211b014398b377b9 | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | The problem asks for the minimum number of minutes until no fresh oranges (value 1) remain in an $n \times n$ grid.
The grid is given as:
$$
\begin{bmatrix}
1 & 1 & 1 \\
0 & 1 & 1 \\
1 & 1 & 1
\end{bmatrix}
$$
Values:
- 0: Empty
- 1: Fresh
- 2: Rotten
This is a classic Breadth-First Search (BFS) problem (LeetCode 994:... |
```json
{
"answer": -1
}
``` | general | PrimeIntellect/SYNTHETIC-2-SFT-verified | en | reasoning_gym | null | null | {
"mode": "section-aware",
"level_name": "section-aware-v2",
"raw_tokens": 4321,
"caveman_tokens": 4320,
"template_version": "caveman_convert/2.0",
"policy_version": "policy/1.1",
"spans": [
{
"i": 0,
"start": 0,
"end": 218,
"label": "compute",
"action": "verbatim"
},... |
9a1ea1061b87b416 | (7) Given the sequence $\left\{a_{n}\right\}$ where the first term $a_{1}=2, a_{n+1}=\frac{5 a_{n}-13}{3 a_{n}-7}$, then $a_{2011}=$ | The user wants to find the value of $a_{2011}$ given the sequence defined by $a_1 = 2$ and $a_{n+1} = \frac{5 a_n - 13}{3 a_n - 7}$.
Let's compute the first few terms to see if there's a pattern.
$a_1 = 2$.
$a_2 = \frac{5(2) - 13}{3(2) - 7} = \frac{10 - 13}{6 - 7} = \frac{-3}{-1} = 3$.
$a_3 = \frac{5(3) - 13}{3(3) - 7... |
The sequence $\{a_n\}$ is defined by the recurrence relation $a_{n+1} = \frac{5 a_n - 13}{3 a_n - 7}$ with the initial term $a_1 = 2$.
Let's compute the first few terms of the sequence to identify a pattern.
For $n=1$:
$a_1 = 2$.
$a_2 = \frac{5(2) - 13}{3(2) - 7} = \frac{10 - 13}{6 - 7} = \frac{-3}{-1} = 3$.
For $n... | math | PrimeIntellect/SYNTHETIC-2-SFT-verified | en | verifiable_math | true | {
"solve_rate": 0.75,
"k": 4
} | {
"mode": "section-aware",
"level_name": "section-aware-v2",
"raw_tokens": 9326,
"caveman_tokens": 9325,
"template_version": "caveman_convert/2.0",
"policy_version": "policy/1.1",
"spans": [
{
"i": 0,
"start": 0,
"end": 366,
"label": "compute",
"action": "verbatim"
},... |
e93265780156c03c | 81. A long rope, the first time used more than half of its total length by 3 meters, the second time used more than half of the remaining by 5 meters, and finally 7 meters were left. The original length of this long rope is $\qquad$ meters. | Here's a thinking process that leads to the solution:
1. **Analyze the Problem:**
* We have a long rope with an unknown original length. Let's call it $x$.
* **First usage:** "used more than half of its total length by 3 meters". This phrasing is slightly ambiguous. Let's interpret it carefully.
*... |
Let the original length of the rope be $x$ meters.
**First usage:**
The problem states that the first time, more than half of the total length was used by 3 meters.
Mathematically, this means the amount used was $\frac{1}{2}x + 3$.
The remaining length after the first usage is:
$$ \text{Remaining}_1 = x - \left(\fra... | math | PrimeIntellect/SYNTHETIC-2-SFT-verified | en | verifiable_math | true | {
"solve_rate": 0.5,
"k": 4
} | {
"mode": "section-aware",
"level_name": "section-aware-v2",
"raw_tokens": 5468,
"caveman_tokens": 5467,
"template_version": "caveman_convert/2.0",
"policy_version": "policy/1.1",
"spans": [
{
"i": 0,
"start": 0,
"end": 463,
"label": "compute",
"action": "verbatim"
},... |
37d9fa13a6daa1c3 | Title: Sereja and Coat Rack
Time Limit: None seconds
Memory Limit: None megabytes
Problem Description:
Sereja owns a restaurant for *n* people. The restaurant hall has a coat rack with *n* hooks. Each restaurant visitor can use a hook to hang his clothes on it. Using the *i*-th hook costs *a**i* rubles. Only one per... | The user wants a Python solution for the "Sereja and Coat Rack" problem.
**Problem Analysis:**
1. **Inputs:**
* $n$: Number of hooks.
* $d$: Fine amount if a hook is not available.
* $a$: A list of integers representing the cost of using each hook.
* $m$: Number of guests.
2. **Logic:**
*... |
```python
import sys
def solve():
# Read all input from standard input.
# Using sys.stdin.read().split() is efficient and handles various whitespace formatting
# (newlines vs spaces) robustly for competitive programming inputs.
input_data = sys.stdin.read().split()
if not input_data:
... | code | PrimeIntellect/SYNTHETIC-2-SFT-verified | en | prime_rl_code | true | {
"solve_rate": 1,
"k": 4
} | {
"mode": "section-aware",
"level_name": "section-aware-v2",
"raw_tokens": 5963,
"caveman_tokens": 5962,
"template_version": "caveman_convert/2.0",
"policy_version": "policy/1.1",
"spans": [
{
"i": 0,
"start": 0,
"end": 146,
"label": "compute",
"action": "verbatim"
},... |
590c1565b9661273 | 2. If the focal distance of the conic section $\frac{x^{2}}{k-2}+\frac{y^{2}}{k+5}=1$ is independent of the real number $k$, then its foci coordinates are $\qquad$ | The user wants me to find the coordinates of the foci of a conic section given by the equation $\frac{x^{2}}{k-2}+\frac{y^{2}}{k+5}=1$.
The condition is that the focal distance (which usually refers to the distance between the foci, i.e., $2c$, or sometimes just $c$) is independent of the real number $k$.
Let the equa... |
The equation of the conic section is given by:
$$ \frac{x^{2}}{k-2} + \frac{y^{2}}{k+5} = 1 $$
Let the denominators be $A = k-2$ and $B = k+5$. The equation is of the form $\frac{x^2}{A} + \frac{y^2}{B} = 1$.
The type of conic section depends on the signs of $A$ and $B$.
1. **Case 1: Ellipse**
For the equation t... | math | PrimeIntellect/SYNTHETIC-2-SFT-verified | en | verifiable_math | true | {
"solve_rate": 0.75,
"k": 4
} | {
"mode": "section-aware",
"level_name": "section-aware-v2",
"raw_tokens": 9651,
"caveman_tokens": 9650,
"template_version": "caveman_convert/2.0",
"policy_version": "policy/1.1",
"spans": [
{
"i": 0,
"start": 0,
"end": 490,
"label": "compute",
"action": "verbatim"
},... |
876f6b2749c0a233 | You are given an array of integers. Check whether there exists a number in this array which is divisible by all other numbers in this array. Output 1, if such a number exists, and 0 otherwise.
Input
The only line of the input contains a list of space-separated integers ai (1 ≤ ai ≤ 100) — elements of the array. The s... | Read line: `input().split()`.
Parse ints: `arr = list(map(int, line))`.
Constraint check: $1 \le a_i \le 100$, $2 \le N \le 10$.
Iterate candidates: `for x in arr:`.
Check divisibility: `ok = True`.
Iterate all elements: `for y in arr:`.
If `x % y != 0`: `ok = False`; break.
If `ok`: print 1; exit.
If loo... |
```python
import sys
def solve():
# Read all input from standard input.
# The problem specifies a single line with space-separated integers.
# sys.stdin.read().split() is robust for reading tokens regardless of whitespace.
input_data = sys.stdin.read().split()
if not input_data:
retu... | code | PrimeIntellect/SYNTHETIC-2-SFT-verified | en | prime_rl_code | true | {
"solve_rate": 1,
"k": 4
} | {
"mode": "section-aware",
"level_name": "section-aware-v2",
"raw_tokens": 7737,
"caveman_tokens": 5930,
"template_version": "caveman_convert/2.0",
"policy_version": "policy/1.1",
"spans": [
{
"i": 0,
"start": 0,
"end": 431,
"label": "plan",
"action": "caveman:medium"
... |
2150ba12f8850479 | 7.126. $\log _{x} 9+\log _{x^{2}} 729=10$. | Here's my thought process for solving the equation $\log _{x} 9+\log _{x^{2}} 729=10$:
1. **Analyze the Equation:**
The given equation is $\log _{x} 9+\log _{x^{2}} 729=10$.
I need to find the value(s) of $x$ that satisfy this equation.
2. **Identify Constraints:**
For logarithms to be defined:
* ... |
To solve the equation $\log _{x} 9+\log _{x^{2}} 729=10$, we first determine the domain of validity for the variable $x$. For the logarithms to be defined, the base must be positive and not equal to 1. Thus, we require:
$$x > 0 \quad \text{and} \quad x \neq 1$$
Next, we simplify the logarithmic terms. We can express... | math | PrimeIntellect/SYNTHETIC-2-SFT-verified | en | verifiable_math | true | {
"solve_rate": 0.75,
"k": 4
} | {
"mode": "section-aware",
"level_name": "section-aware-v2",
"raw_tokens": 5708,
"caveman_tokens": 5707,
"template_version": "caveman_convert/2.0",
"policy_version": "policy/1.1",
"spans": [
{
"i": 0,
"start": 0,
"end": 184,
"label": "compute",
"action": "verbatim"
},... |
ad9ae93955d26874 | "explain the anatomy including specific blood and veins and nerves supply with the location and meas(...TRUNCATED) | "Topic: Anatomy of GI Tract.\nRegions: Mouth, Pharynx, Esophagus, Stomach, Small Intestine, Large In(...TRUNCATED) | "\n\n# Comprehensive Anatomical, Vascular, and Neurological Atlas of the Gastrointestinal (GI) Tract(...TRUNCATED) | creative | m-a-p/DeepWriting-20K | en | Ordinary Life - Factual QAs | null | null | {"mode":"section-aware","level_name":"section-aware-v2","raw_tokens":2129,"caveman_tokens":1942,"tem(...TRUNCATED) |
a97bae0c280c1bc4 | "Write a story that falls into the genre of Science Fiction, Romance, based on the following prompt:(...TRUNCATED) | "Genre: Sci-Fi, Romance.\nPrompt: 2+ year relationship; she reveals alien nature.\nTone: Sarcastic \(...TRUNCATED) | "\n\nThe anniversary cake had been a three-tiered masterpiece, covered in white frosting and edible (...TRUNCATED) | creative | m-a-p/DeepWriting-20K | en | Artistic - Creative & Narrative Writing | null | null | {"mode":"section-aware","level_name":"section-aware-v2","raw_tokens":1987,"caveman_tokens":1627,"tem(...TRUNCATED) |
bae330bb4f5f27c1 | "A cylinder has a height of $10$ and a radius of $3.$ Determine the total surface area, including th(...TRUNCATED) | "The user wants to find the total surface area of a cylinder.\nThe dimensions given are:\n- Height ((...TRUNCATED) | "\n\nThe problem asks for the total surface area of a cylinder with a height of $10$ and a radius of(...TRUNCATED) | math | PrimeIntellect/SYNTHETIC-2-SFT-verified | en | verifiable_math | true | {
"solve_rate": 0.75,
"k": 4
} | {"mode":"section-aware","level_name":"section-aware-v2","raw_tokens":6747,"caveman_tokens":6746,"tem(...TRUNCATED) |
End of preview. Expand in Data Studio
flint-section-aware-step37seg-qwen3.5-4b
Compressed ("caveman") reasoning traces for SFT — the section-aware-step37seg variant of
the flint reasoning-compression pipeline. Converted from verified
self-distilled traces by Qwen/Qwen3.5-4B (segmenter: stepfun/step-3.7-flash:free), policy
policy/1.1, template caveman_convert/2.0.
Hybrid decomposition probe: stepfun/step-3.7-flash segments (stronger span labels), the target model itself converts (self-voice). Isolates segmentation quality from converter voice in the stronger-teacher falsification.
Each row: input, reasoning (compressed trace), answer (carried verbatim
from the source), domain, verified, difficulty, and meta with per-row
provenance (converter/segmenter model, span labels + actions for
section-aware rows, token counts raw vs compressed).
- Rows: 593 — domains: {"general": 202, "math": 172, "code": 90, "creative": 129}
- Mean compression ratio (caveman/raw tokens): 0.87
- Content-preservation linters (numbers, negations, byte-identical code blocks, repetition) reject unsafe conversions; rejects are excluded.
Part of the caveman reasoning-compression ablation study.
Build manifest
{
"created_at": "2026-07-10T08:38:04+00:00",
"git_sha": "ff1275c69333675e45437658e790aa938f04d5c0",
"variant": "section-aware",
"config": {
"mode": "section"
},
"counts": {
"ok": 593,
"rejected": 55,
"failed": 0
},
"convert_model": "Qwen/Qwen3.5-4B",
"segment_model": "stepfun/step-3.7-flash:free",
"template_version": "caveman_convert/2.0",
"policy_version": "policy/1.1",
"segment_template_version": "segment/1.0",
"tokenizer": "Qwen/Qwen3.5-4B",
"input_rows": 648
}
- Downloads last month
- 14