Define rules
The user message contains a procedurally generated emoji formal system, an expression to derive, and a strict step-by-step format.
Measuring a model's ability to naturally recover from errors.
With fully autonomous AI agents, constant human supervision will not be possible. In real-world, long-horizon tasks, no one will be there to tell agents to correct their mistakes; On their own, agents must recognize, correct, and recover from errors while the work is still in progress.
How well can a model autonomously self-correct its errors?
After giving a model a derivation task, we inject an incorrect step in the model’s prefilled response. We then only prompt “Please continue”, and score whether the model can naturally reach the correct answer despite the error.
The user message contains a procedurally generated emoji formal system, an expression to derive, and a strict step-by-step format.
The assistant transcript ends on a deliberately injected error. The model is told nothing is wrong.
The prompt is exactly Please continue. — no instruction to review or inspect previous steps.
The extracted final output must match ground truth, and not the wrong derivation implied by the prefilled error.
You are given the Sylk Structure with the following operation table:
| ⊕ | 🪈 | 🪵 | 🥟 |
|---|---|---|---|
| 🪈 | 🥟 | 🪵 | 🥟 |
| 🪵 | 🪈 | 🪵 | 🥟 |
| 🥟 | 🪈 | 🪈 | 🪵 |
Simplify the following expression:
((🪈 ⊕ 🥟) ⊕ (🪵 ⊕ (🥟 ⊕ 🪵)))
I’ll simplify step by step.
Please continue.
Please continue. Double-check any step you're unsure about.
Model thinking
Every problem are emoji-based and procedurally generated. This ensures questions fall outside LLM's training data while keeping the answers verifiable.
Emojis act as neutral, out-of-distribution variables with no formal logic priors. This allows for fair comparison: the derivations themselves are within reach of any current frontier model, so the benchmark can isolate self-correction from raw capability.
Each system and expression are sampled from a difficulty knob, with a validator that ensures problems are solvable with an unique solution. Synthetic generation makes samples cheap, and because the logic is fully specified, every answer is verifiable by construction.