modality large_string | model large_string | run_folder large_string | source_file large_string | timestamp large_string | concept large_string | puzzle large_string | test_idx int64 | effort large_string | is_correct int64 | err large_string | tools_used int64 | answer large_string | summary large_string | programming_calls large_string | Rule large_string | Rule_correct int64 | rule_evaluation_reasoning large_string | Rule_correct_label large_string | starred int64 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Textual | claude-sonnet-4 | mediumeffort_autosummary_withtools | mediumeffort_autosummary_withtools/AboveBelow.csv | 2025-09-08T07:07:34 | AboveBelow | AboveBelow1 | 1 | medium | 1 | null | 1 | 0 6 6 0 0 6 6 6 0 6
0 6 6 0 0 6 6 6 0 6
0 0 0 0 0 6 6 6 0 0
4 4 4 4 4 4 4 4 4 4
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 | Let me analyze the given examples to find the common rule that maps input grids to output grids.
Example 1:
Input:
```
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 4 4 4 4 0 0 0 0 0
0 0 0 4 4 4 4 0 0 0 0 0
0 0 0 4 4 4 4 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
2 2 2 2 2 2 2 2 2 2 2 2
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 4 ... | [server_tool_use:text_editor_code_execution] {"command": "create", "path": "/tmp/pattern_analysis.py", "file_text": "def analyze_examples():\n # Example 1\n print(\"Example 1:\")\n input1 = [\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 4, 4, 4, 4, 0, 0, 0, 0, 0],\n [0, 0, 0, 4, 4, ... | Find the horizontal line that spans the entire width with a single repeating value or pattern. Keep all rows above and including this divider line unchanged. Replace all rows below the divider line with zeros. | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary_withtools | mediumeffort_autosummary_withtools/AboveBelow.csv | 2025-09-08T07:12:25 | AboveBelow | AboveBelow1 | 2 | medium | 1 | null | 1 | 0 0 3 3 3 3 3 0 0 0 0 0 0
0 0 3 3 3 3 3 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0
9 0 9 0 9 0 9 0 9 0 9 0 9
0 0 0 0 0 0 0 0 0 0 0 0 0 | Let me analyze these examples to find the common rule.
Example 1:
- Input has a horizontal line of 2s at row 6 (0-indexed)
- There are some 4s scattered around in different regions
- In the output, everything below the 2-line (row 7 onwards) becomes all 0s
- Everything above and including the 2-line stays the same
Ex... | [server_tool_use:text_editor_code_execution] {"command": "create", "path": "/tmp/grid_analysis.py", "file_text": "import numpy as np\n\ndef analyze_examples():\n # Example 1\n example1_input = [\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 4, 4, 4, 4, 0, 0, 0, 0, 0],\n [0, 0, 0, 4, 4, ... | Find the horizontal line that spans most or all of the width with a distinctive pattern (non-zero values), then keep everything above and including that line unchanged, and set everything below that line to zeros | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary_withtools | mediumeffort_autosummary_withtools/AboveBelow.csv | 2025-09-08T07:19:46 | AboveBelow | AboveBelow1 | 3 | medium | 0 | mismatch | 1 | 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 0 5 0 5 0 5 0 5 0 5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | Let me analyze these examples to find the common rule.
Looking at Example 1:
Input:
```
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 4 4 4 4 0 0 0 0 0
0 0 0 4 4 4 4 0 0 0 0 0
0 0 0 4 4 4 4 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
2 2 2 2 2 2 2 2 2 2 2 2
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 4 4 4 4 0 0 4 4 4
0 0 0 4 4 4 4 ... | [server_tool_use:text_editor_code_execution] {"command": "create", "path": "/tmp/grid_analysis.py", "file_text": "import numpy as np\n\n# Example 1\ninput1 = [\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 4, 4, 4, 4, 0, 0, 0, 0, 0],\n [0, 0, 0, 4, 4, 4, 4, 0, 0, 0, 0, 0],\n [0, 0, 0, 4, 4, 4, 4, 0, 0... | Find the separator row (distinctive pattern like all same non-zero values or alternating non-zero/zero pattern). Keep everything above and including the separator unchanged. Clear all non-zero values below the separator by converting them to 0. | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary_withtools | mediumeffort_autosummary_withtools/AboveBelow.csv | 2025-09-08T07:08:24 | AboveBelow | AboveBelow10 | 1 | medium | 0 | parse:rows have unequal length | 0 | null | null | null | null | -1 | null | Nonresponsive | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary_withtools | mediumeffort_autosummary_withtools/AboveBelow.csv | 2025-09-08T07:07:27 | AboveBelow | AboveBelow10 | 2 | medium | 1 | null | 1 | 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
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 0 0 0 0 0 0 0 0 0 0 0
6 6 0 0 0 0 0 0 0 0 0 0
6 6 6 0 0 0 0 0 0 0 0 0 | Let me analyze the examples to find the pattern.
Example 1:
Input has a diagonal line of 4s from top-left to bottom-right (starting at row 3, column 1, then row 4, column 2, etc.)
Output fills in below and to the left of each 4 in the diagonal, creating a triangular pattern.
Example 2:
Input has a diagonal line of 3s... | [server_tool_use:text_editor_code_execution] {"command": "create", "path": "/tmp/grid_analysis.py", "file_text": "def analyze_examples():\n # Example 1\n print(\"Example 1 Analysis:\")\n example1_input = [\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],... | For diagonal patterns, if the diagonal goes down-right, fill from left edge to diagonal position in each row with a diagonal element, then continue filling subsequent rows from left up to the maximum diagonal column. If the diagonal goes down-left, fill from diagonal position to right edge in each row with a diagonal e... | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary_withtools | mediumeffort_autosummary_withtools/AboveBelow.csv | 2025-09-08T07:10:06 | AboveBelow | AboveBelow10 | 3 | medium | 0 | mismatch | 1 | 0 0 0 0 0 0 0 0 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 | Let me analyze the examples to find the rule.
Example 1:
Input: A diagonal line of 4's starting from position (2,0) and moving diagonally down-right for 9 steps.
Output: Below the diagonal, all positions are filled with 4's. The diagonal itself and all cells below and to the left of it are filled with 4's.
Looking at... | [server_tool_use:text_editor_code_execution] {"command": "create", "path": "/tmp/analyze_pattern.py", "file_text": "import numpy as np\n\n# Example 1\ninput1 = [\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 4,... | For diagonal lines: fill triangle from diagonal to edge. For horizontal lines: fill rectangle below the line within column bounds. | 0 | null | Incorrect | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary_withtools | mediumeffort_autosummary_withtools/AboveBelow.csv | 2025-09-08T07:12:30 | AboveBelow | AboveBelow2 | 1 | medium | 0 | mismatch | 1 | 0 0 0 0 0 0 0 0 0 0
6 6 0 0 0 6 6 0 0 0
6 6 0 0 0 6 6 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 3 3 3 0 0 0 0
0 0 0 3 3 3 0 0 0 0
0 0 0 3 3 3 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 6 6 0 0 0 0 0
0 0 0 6 6 0 0 0 0 0 | Let me analyze the examples to find the pattern:
Example 1:
Input has several colored shapes:
- 4s at positions around (0-2, 2-4) and (15-17, 3-5) and (15-17, 9-11)
- 2s in several places forming rectangular blocks
- 3s forming a 5x5 block at (9-13, 4-8)
- 1s forming a block at (0-2, 17-19)
Output:
- All 1s, 2s, and ... | [server_tool_use:text_editor_code_execution] {"command": "create", "path": "/tmp/analyze_pattern.py", "file_text": "import numpy as np\n\ndef analyze_examples():\n # Example 1\n input1 = [\n [0, 0, 4, 4, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1],\n [0, 0, 4, 4, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,... | Always keep color 3, AND keep the color that extends to the bottommost row. If color 3 is already the bottommost, keep only color 3. | 0 | null | Incorrect | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary_withtools | mediumeffort_autosummary_withtools/AboveBelow.csv | 2025-09-08T07:16:30 | AboveBelow | AboveBelow2 | 2 | medium | 0 | parse:non-integer token in row 1 | 1 | [[0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2], [0, 2, 2, 2, 0, 0, 0, 2, 2, 2, 2], [0, 2, 2, 2, 0, 0, 0, 2, 2, 2, 2], [0, 2, 2, 2, 0, 0, 0, 2, 2, 2, 2], [0, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0], [3, ... | Let me analyze the examples to find the common rule.
Example 1:
Input has various colored regions scattered across the grid:
- Some 4s in small blocks
- Some 2s in blocks
- Some 1s in a rectangular region
- Some 3s in a larger rectangular block
Output:
- The 1s and most of the 2s and 4s are removed (set to 0)
- Only ... | [server_tool_use:text_editor_code_execution] {"command": "create", "path": "/tmp/analyze_pattern.py", "file_text": "import numpy as np\n\n# Example 1\ninput1 = np.array([\n [0,0,4,4,4,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1],\n [0,0,4,4,4,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1],\n [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1],\n ... | Group regions by overlapping/adjacent row ranges. Remove any row group that contains multiple different colors. Keep row groups that contain only a single color. | 0 | null | Incorrect | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary_withtools | mediumeffort_autosummary_withtools/AboveBelow.csv | 2025-09-08T07:16:19 | AboveBelow | AboveBelow2 | 3 | medium | 0 | parse:rows have unequal length | 1 | null | "Let me analyze the examples to find the pattern.\n\nExample 1:\nInput has various colored blocks sc(...TRUNCATED) | "[server_tool_use:text_editor_code_execution] {\"command\": \"create\", \"path\": \"/tmp/analyze_pat(...TRUNCATED) | null | -1 | null | Nonresponsive | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary_withtools | mediumeffort_autosummary_withtools/AboveBelow.csv | 2025-09-08T07:15:19 | AboveBelow | AboveBelow3 | 1 | medium | 1 | null | 1 | "0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0\n0 0 1 1 1 1 1 0 0\n0 0 5 5 5 5 5 0 0\n0 0 (...TRUNCATED) | "Let me analyze the examples to find the common rule that maps input to output.\n\nExample 1:\n\nInp(...TRUNCATED) | "[server_tool_use:text_editor_code_execution] {\"command\": \"create\", \"path\": \"/tmp/analyze_gri(...TRUNCATED) | "Find the largest rectangular contiguous block. Find the topmost isolated block of a different color(...TRUNCATED) | 1 | null | Correct - Intended | 0 |
ConceptARC Rule Annotations
Model outputs, natural-language rules and human judgements of those rules on the 480 tasks of the ConceptARC benchmark. This is the data behind the paper Distinguishing Performance From Competence in Evaluations of Humanlike Abstract Reasoning (NeurIPS 2026, Evaluations and Datasets Track).
- Paper: arXiv:2510.02125
- Project page and interactive viewer: claasbeger.github.io/performance-competence-gap
- Authors: Claas Beger, Ryan Yi, Shuhao Fu, Kaleda Denton, Arseny Moskvichev, Sarah W. Tsai, Sivasankaran Rajamanickam, Melanie Mitchell
- Contact: claasbeger@santafe.edu
Summary
Accuracy alone can overstate or understate how well a model reasons with the abstractions a benchmark was designed to test. For each ConceptARC task we collected the model's output grid together with the natural-language rule it stated, and a team of annotators judged whether that rule captures the intended abstraction. The same judgements were made for rules written by human participants.
This dataset contains o3 at low reasoning effort (with and without Python tools) and at medium effort with tools, and Claude Sonnet 4 and Gemini 2.5 Pro at medium effort with tools, each with textual and visual inputs. The medium-effort runs without tools, which the paper also reports, are in the companion dataset ClaasBeger/HumanLikeARCAbstraction and use the same columns. ConceptARC covers 16 spatial and semantic concepts with 10 tasks per concept, and each task has 3 test inputs (480 test items in total).
Contents
| Subset / file | Rows | Contents |
|---|---|---|
model_evaluations (evaluation_rows.parquet, .csv) |
4,800 | One row per model attempt on one test input: 10 runs × 480 items. Covers o3 (low effort with and without tools, medium effort with tools) and Claude Sonnet 4 and Gemini 2.5 Pro (medium effort with tools), each with textual and visual inputs. |
human_rule_annotations (human_rule_annotations.parquet, .csv) |
3,049 | One row per human participant rule, from the study of Moskvichev et al. (2023). Rules were only collected for correct outputs. |
ground_truth_rules (ground_truth_rules.parquet, .csv) |
160 | The intended rule for each ConceptARC task, as revised by the authors. Columns: concept, puzzle, rule. |
corpus/ |
160 files | ConceptARC task definitions (training demonstrations and test inputs and outputs), one JSON file per task under corpus/<Concept>/<Task>.json. |
Model evaluation columns
| Column | Description |
|---|---|
modality |
Textual (grids given as numbers) or Visual (grids given as images). |
model |
o3, claude-sonnet-4 or gemini-2.5-pro. |
run_folder |
Run configuration, e.g. mediumeffort_autosummary_withtools (reasoning effort, and whether Python tools were available). |
source_file |
Original log file the row came from. |
concept, puzzle, test_idx |
Concept group, task (e.g. Center3) and test input (1–3). Join puzzle with corpus/<concept>/<puzzle>.json. |
effort, tools_used |
Reasoning effort setting, and whether the model actually called a tool. |
answer |
The model's predicted output grid. |
is_correct, err |
Whether answer exactly matches the ground-truth grid, and any parsing error. This is a grid check only and says nothing about the rule. |
Rule |
The rule the model stated for its solution. |
summary |
The model's reasoning summary as logged. |
programming_calls |
Code the model ran, when tools were enabled. |
Rule_correct_label, Rule_correct |
Human judgement of Rule (see below). |
rule_evaluation_reasoning |
The annotators' notes on the judgement, where recorded. |
starred |
1 if an annotator starred the row. |
Human rule columns
| Column | Description |
|---|---|
concept_group, Task, Test |
Concept, task file and test input (1–3). |
VerbalDescription |
The rule written by the participant. |
Rule_correct_label, Rule_correct |
Human judgement of the rule (see below). |
starred |
1 if an annotator starred the row. |
Rule judgements
Rule_correct_label |
Rule_correct |
Meaning |
|---|---|---|
| Correct - Intended | 1 | The rule works on the demonstrations and captures the abstraction the task was designed to test. |
| Correct - Unintended | 1 | The rule works on the demonstrations but does not capture the intended abstraction (for example a surface-level shortcut). |
| Incorrect | 0 | The rule does not work on the demonstrations. |
| Nonresponsive | -1 | No usable rule was given. |
| Unclear | -2 | The rule was too unclear to judge confidently. |
| Literal | -3 | Human rules only: the rule describes the literal process of producing the output grid (for example clicking "copy" or selecting one specific colour) rather than the transformation. |
The paper's figures group Nonresponsive, Unclear and Literal together as "Not Classified". Judgements were made by the authors. One annotator gave an initial judgement for each item, and ambiguous cases were discussed as a group until consensus was reached.
Loading
from datasets import load_dataset
models = load_dataset("ClaasBeger/ConceptARC_Rule_Annotations", "model_evaluations", split="train")
humans = load_dataset("ClaasBeger/ConceptARC_Rule_Annotations", "human_rule_annotations", split="train")
rules = load_dataset("ClaasBeger/ConceptARC_Rule_Annotations", "ground_truth_rules", split="train")
Citation
@inproceedings{beger2026distinguishing,
title = {Distinguishing Performance From Competence in Evaluations of Humanlike Abstract Reasoning},
author = {Beger, Claas and Yi, Ryan and Fu, Shuhao and Denton, Kaleda and Moskvichev, Arseny and Tsai, Sarah W. and Rajamanickam, Sivasankaran and Mitchell, Melanie},
booktitle = {Advances in Neural Information Processing Systems},
year = {2026}
}
Please also cite ConceptARC:
@article{moskvichev2023conceptarc,
title = {The {ConceptARC} Benchmark: Evaluating Understanding and Generalization in the {ARC} Domain},
author = {Moskvichev, Arseny and Odouard, Victor Vikram and Mitchell, Melanie},
journal = {Transactions on Machine Learning Research},
year = {2023}
}
- Downloads last month
- 222