Datasets:
modality string | model string | run_folder string | source_file string | timestamp string | concept string | puzzle string | test_idx int64 | effort string | is_correct int64 | err string | tools_used int64 | answer string | summary string | programming_calls string | Rule string | Rule_correct int64 | rule_evaluation_reasoning string | Rule_correct_label string | starred int64 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:28:03 | AboveBelow | AboveBelow1 | 1 | medium | 1 | null | 0 | 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 each example to understand the transformation rule.
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 0 0 ... | null | Find the horizontal line with all identical non-zero values, keep everything above and including this line unchanged, and replace all non-zero values below this line with zeros | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:30:28 | AboveBelow | AboveBelow1 | 2 | medium | 0 | parse:non-integer token in row 1 | 0 | [[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 the examples to find the common rule.
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 0 0 4 4 4
0 0 0 4 ... | null | Identify a divider row with distinctive pattern (all same non-zero value or alternating pattern). Keep divider and everything above unchanged. Erase all non-zero values below divider. | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:31:12 | AboveBelow | AboveBelow1 | 3 | medium | 1 | null | 0 | 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
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 the examples to identify the common transformation rule.
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 <- row 6, all 2s
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 4 4 4 4 0... | null | Find the horizontal divider row with repeating pattern, keep everything above and including it unchanged, set everything below to 0 | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:28:17 | AboveBelow | AboveBelow10 | 1 | medium | 1 | null | 0 | 0 0 2 2 2 2 2 2 2 2 2 2 2
0 2 2 2 2 2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2 2 2 2 2 2 | Let me analyze the examples to find the common rule.
Example 1:
Input:
```
0 0 0 0 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 0 0 0 0 0 0 0 0 0 0 0 0 0
0 4 0 0 0 0 0 0 0 0 0 0 0 0
0 0 4 0 0 0 0 0 0 0 0 0 0 0
0 0 0 4 0 0 0 0 0 0 0 0 0 0
0 0 0 0 4 0 0 0 0 0 0 0 0 0
0 0 0 0 0 4 0 0 0 0 0 0 0 0
0 0 0 0 0 0 4 0 0 0 ... | null | For a diagonal line of non-zero values, if the diagonal goes down-right, fill from the left edge to the diagonal position in each row. If the diagonal goes down-left, fill from the diagonal position to the right edge in each row. | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:27:59 | AboveBelow | AboveBelow10 | 2 | medium | 1 | null | 0 | 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0
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 understand the transformation rule.
Example 1:
Input:
- Has a diagonal pattern of 4's starting from position (2,0) and going diagonally down-right to (10,8)
- The diagonal consists of: (2,0), (3,1), (4,2), (5,3), (6,4), (7,5), (8,6), (9,7), (10,8)
Output:
- Starting from the same diagon... | null | For a diagonal line of non-zero elements: if diagonal goes down-right, fill each row from leftmost column to diagonal position; if diagonal goes up-right, fill each row from diagonal position to rightmost column; fill any rows below diagonal completely | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:29:20 | AboveBelow | AboveBelow10 | 3 | medium | 0 | parse:non-integer token in row 1 | 0 | [[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 patterns in these examples.
Example 1:
Input:
```
0 0 0 0 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 0 0 0 0 0 0 0 0 0 0 0 0 0
0 4 0 0 0 0 0 0 0 0 0 0 0 0
0 0 4 0 0 0 0 0 0 0 0 0 0 0
0 0 0 4 0 0 0 0 0 0 0 0 0 0
0 0 0 0 4 0 0 0 0 0 0 0 0 0
0 0 0 0 0 4 0 0 0 0 0 0 0 0
0 0 0 0 0 0 4 0 0 0 0 0 0... | null | Identify the pattern of non-zero elements. For down-right diagonal: fill triangular area to the left. For down-left diagonal: fill triangular area to the right plus all rows below. For horizontal line: fill all rows at and below the line. | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:30:39 | AboveBelow | AboveBelow2 | 1 | medium | 1 | null | 0 | 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 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 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:
0 0 4 4 4 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1
0 0 4 4 4 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1
0 2 2 2 0 0 2 2 2 0 0 0 0 2 2 2 0 0 0 0
0 2 2 2 0 0 2 2 2 0 0 0 0 2 2 2 0 0 0 0
0 2 2 2 0 0 2 2 2 0 0 0 0 2 2 2 0 0 0 0
0 2 2 2 0 0... | null | Keep only colored blocks that start at or below a certain vertical threshold, removing blocks that appear in the upper portion of the grid | -2 | null | Unclear | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:31:13 | AboveBelow | AboveBelow2 | 2 | medium | 1 | null | 0 | 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 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 3 0 0 0 0 0 0 0 0 0 | Let me analyze the examples to find the common rule.
Example 1:
Input has various patterns:
- 4s at positions (0,2)-(0,4), (1,2)-(1,4), (15,3)-(15,5), (16,3)-(16,5), (17,3)-(17,5), (15,9)-(15,11), (16,9)-(16,11), (17,9)-(17,11)
- 2s in several rectangular blocks
- 3s in a large rectangular block (9,4)-(13,8)
- 1s at p... | null | Keep all rectangular blocks of color 3. For other colors, keep only rectangular blocks whose topmost row has index 6 or greater. Replace all other non-zero values with 0. | 0 | null | Incorrect | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:31:05 | AboveBelow | AboveBelow2 | 3 | medium | 1 | null | 0 | 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 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 0 0 0 3 3 0
0 0 0 0 0 0 5 5 5 5 0 5 5 0
0 0 0 0 0 0 5 5 5 5 0 5 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 ... | Let me analyze the examples to understand the transformation rule.
Example 1:
Input has several colored regions:
- Blue (4) regions at positions:
- Top-left corner (2,0) to (4,2) - 3x3 block
- Bottom region (15,3) to (17,5) - 3x3 block
- Bottom region (15,9) to (17,11) - 3x3 block
- Red (2) regions at positio... | null | Identify the first row where green (3) colored regions appear. Preserve all colored regions that start at that row or later. Remove all colored regions that start before that row. | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:31:37 | AboveBelow | AboveBelow3 | 1 | medium | 1 | null | 0 | 0 0 0 0 0 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 0 0
0 0 5 5 5 5 5 0 0
0 0 5 5 5 5 5 0 0
0 0 5 5 5 5 5 0 0
0 0 5 5 5 5 5 0 0
0 0 5 5 5 5 5 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 0 0 | Let me analyze the examples to find the common rule.
Example 1:
Input:
0 0 0 0 0 0 0 0
0 3 3 3 0 0 0 0 <- 3 in row 1
0 0 0 0 0 0 0 0
0 4 4 4 0 0 0 0 <- 4 in rows 3-5
0 4 4 4 0 0 0 0
0 4 4 4 0 0 0 0
0 0 0 0 0 3 3 3 <- 3 in row 6
0 0 3 3 3 0 0 0 <- 3 in row 7
Output:
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 <- row 1 becom... | null | Move the topmost isolated block down to the row directly above the first main continuous block | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:31:49 | AboveBelow | AboveBelow3 | 2 | medium | 0 | parse:non-integer token in row 1 | 0 | [[0,0,0,0,0,0,0,0,0],[0,0,0,0,1,1,1,0,0],[0,0,4,4,4,4,4,0,0],[0,0,4,0,0,0,4,0,0],[0,0,4,0,0,0,4,0,0],[0,0,4,0,0,0,4,0,0],[0,0,4,4,4,4,4,0,0],[0,0,0,0,0,0,0,0,0],[0,0,0,1,1,1,1,0,0]] | Let me analyze the examples to find the pattern.
Example 1:
Input:
0 0 0 0 0 0 0 0
0 3 3 3 0 0 0 0
0 0 0 0 0 0 0 0
0 4 4 4 0 0 0 0
0 4 4 4 0 0 0 0
0 4 4 4 0 0 0 0
0 0 0 0 0 3 3 3
0 0 3 3 3 0 0 0
Output:
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 3 3 3 0 0 0 0
0 4 4 4 0 0 0 0
0 4 4 4 0 0 0 0
0 4 4 4 0 0 0 0
0 0 0 0 0 3 3 3
0 ... | null | Find the topmost non-zero shape and move it down until it's positioned one row above the next non-zero shape below it, filling the original location with zeros | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:27:56 | AboveBelow | AboveBelow3 | 3 | medium | 1 | null | 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 5 5 5 0 0 0
0 0 0 5 5 5 5 0 0 0
0 0 0 5 5 5 5 0 0 0
0 0 0 5 5 5 5 0 0 0
0 0 0 5 5 5 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 | Let me analyze each example to find the pattern.
Example 1:
Input:
0 0 0 0 0 0 0 0
0 3 3 3 0 0 0 0
0 0 0 0 0 0 0 0
0 4 4 4 0 0 0 0
0 4 4 4 0 0 0 0
0 4 4 4 0 0 0 0
0 0 0 0 0 3 3 3
0 0 3 3 3 0 0 0
Output:
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 3 3 3 0 0 0 0
0 4 4 4 0 0 0 0
0 4 4 4 0 0 0 0
0 4 4 4 0 0 0 0
0 0 0 0 0 3 3 3
0 0... | null | Move the first row with non-zero elements to the position immediately above the second row with non-zero elements, clearing the original position | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:28:29 | AboveBelow | AboveBelow4 | 1 | medium | 0 | parse:non-integer token in row 1 | 0 | [[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,1,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,0,0,0,0,0,1,3,3],[1,1,1,1,1,1,1,1,1,1,1,1],[0,0,0,0,0,0,0,0,0,0,0,0],[0,3,3,3,3,3,1,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,3,3,1]] | Let me analyze the given examples to find the common rule.
Example 1:
Input:
0 0 0 0 0 0 0 0 0 0
0 0 2 2 2 0 0 2 2 2
0 0 0 0 0 0 0 0 0 0
0 0 0 0 2 2 2 0 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 2 2 2 0 0 0 0 0 0
0 0 0 0 2 2 2 0 0 0
0 0 0 0 0 0 0 0 0 0
Output:
0 0 0 0 0 0 0 0 0 0
0 0 4 2 2 0 0... | null | For horizontal segments of colored cells: if above the full-width horizontal line, replace the first cell with the line color; if below the line, replace the last cell with the line color | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:29:00 | AboveBelow | AboveBelow4 | 2 | medium | 0 | parse:non-integer token in row 1 | 0 | [[0,0,0,0,3,4,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[3,3,3,3,3,3,3,3,3,3],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,4,4,4,4,4,3],[0,0,0,0,0,0,0,0,0,0]] | Let me examine the examples to find the pattern.
Example 1:
Input:
0 0 0 0 0 0 0 0 0 0
0 0 2 2 2 0 0 2 2 2
0 0 0 0 0 0 0 0 0 0
0 0 0 0 2 2 2 0 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 2 2 2 0 0 0 0 0 0
0 0 0 0 2 2 2 0 0 0
0 0 0 0 0 0 0 0 0 0
Output:
0 0 0 0 0 0 0 0 0 0
0 0 4 2 2 0 0 4 2 2
0 ... | null | Find the horizontal line (row filled with same non-zero value). For contiguous groups above the line, replace leftmost element with line value. For contiguous groups below the line, replace rightmost element with line value. | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:29:19 | AboveBelow | AboveBelow4 | 3 | medium | 1 | null | 0 | 0 0 0 0 0 0 0 0 0 0 0
0 5 6 6 6 6 6 6 6 6 6
5 5 5 5 5 5 5 5 5 5 5
0 6 6 6 6 6 6 6 6 6 5
0 0 0 0 0 0 0 0 0 0 0 | Let me analyze the examples to find the pattern.
Example 1:
Input:
0 0 0 0 0 0 0 0 0 0
0 0 2 2 2 0 0 2 2 2
0 0 0 0 0 0 0 0 0 0
0 0 0 0 2 2 2 0 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 2 2 2 0 0 0 0 0 0
0 0 0 0 2 2 2 0 0 0
0 0 0 0 0 0 0 0 0 0
Output:
0 0 0 0 0 0 0 0 0 0
0 0 4 2 2 0 0 4 2 2
0 0... | null | Find the horizontal line spanning the grid width. Above this line, replace the first cell of each non-zero sequence with the line color. Below this line, replace the last cell of each non-zero sequence with the line color. | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:30:10 | AboveBelow | AboveBelow5 | 1 | medium | 1 | null | 0 | 0 0 0 6 0 0 0 0
0 0 0 6 0 0 0 0
0 0 0 6 0 0 0 0
0 0 0 5 0 0 0 6
6 0 0 5 0 0 0 6
6 0 0 5 0 0 0 6
5 0 0 5 0 0 0 5
5 0 0 5 0 0 0 5 | Let me analyze the two examples to find the common rule.
Example 1:
Input:
0 0 0 0 0 1 0 0 0
0 0 0 0 0 1 0 0 0
0 1 0 0 0 1 0 0 0
0 1 0 0 0 3 0 0 1
0 1 0 0 0 1 0 0 1
0 1 0 0 0 1 0 0 1
0 1 0 0 0 1 0 0 3
0 3 0 0 0 1 0 0 1
0 1 0 0 0 1 0 0 1
Output:
0 0 0 0 0 3 0 0 0
0 0 0 0 0 3 0 0 0
0 3 0 0 0 3 0 0 0
0 3 0 0 0 3 0 0 3
0... | null | For each column, the minority non-zero element spreads upward from its position, replacing the majority non-zero element until hitting a 0 or boundary | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:32:28 | AboveBelow | AboveBelow5 | 2 | medium | 0 | parse:non-integer token in row 1 | 0 | [[0,0,0,0,0,0],[2,8,2,2,0,0],[2,8,2,2,0,0],[2,8,2,2,0,0],[2,8,8,2,0,0],[2,8,8,2,0,0],[2,8,8,2,0,0],[2,8,8,2,0,0],[8,8,8,2,0,0],[8,8,8,2,0,0]] | Let me analyze the examples to understand the transformation rule.
Example 1:
Input:
```
0 0 0 0 0 1 0 0 0
0 0 0 0 0 1 0 0 0
0 1 0 0 0 1 0 0 0
0 1 0 0 0 3 0 0 1
0 1 0 0 0 1 0 0 1
0 1 0 0 0 1 0 0 1
0 1 0 0 0 1 0 0 3
0 3 0 0 0 1 0 0 1
0 1 0 0 0 1 0 0 1
```
Output:
```
0 0 0 0 0 3 0 0 0
0 0 0 0 0 3 0 0 0
0 3 0 0 0 3 0 0... | null | For each column, identify minority non-zero values. From each such value's position, extend it upwards by replacing consecutive instances of the value immediately above it until hitting a different value. | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:31:36 | AboveBelow | AboveBelow5 | 3 | medium | 0 | parse:non-integer token in row 1 | 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,1,1,1,1,1,1,1,1,1],[1,1,1,1,1,1,1,1,1,1,1,1]] | Let me analyze the patterns in the two examples to find the common rule.
Example 1:
Input:
0 0 0 0 0 1 0 0 0
0 0 0 0 0 1 0 0 0
0 1 0 0 0 1 0 0 0
0 1 0 0 0 3 0 0 1
0 1 0 0 0 1 0 0 1
0 1 0 0 0 1 0 0 1
0 1 0 0 0 1 0 0 3
0 3 0 0 0 1 0 0 1
0 1 0 0 0 1 0 0 1
Output:
0 0 0 0 0 3 0 0 0
0 0 0 0 0 3 0 0 0
0 3 0 0 0 3 0 0 0
0 3... | null | For each column, when a special value appears, replace all instances of the primary value from the top of the column down to that position with the special value | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:28:21 | AboveBelow | AboveBelow6 | 1 | medium | 0 | mismatch | 0 | 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 3 3 3 3
0 2 2 0 3 3 3 3 3 3
0 2 2 0 2 2 2 2 2 2
0 2 2 0 2 2 2 2 2 2
0 2 2 0 2 2 2 2 2 2
0 2 2 0 2 2 2 2 2 2 | Let me analyze the examples to find the pattern.
Example 1:
Input:
0 0 0 0 0 0 0 0 0 0
0 4 4 4 4 4 4 4 4 0
0 4 4 4 4 4 4 4 4 0
0 4 4 4 4 4 4 4 4 0
0 2 2 2 2 2 2 2 2 0
0 4 4 4 4 4 4 4 4 0
0 4 4 4 4 4 4 4 4 0
0 0 0 0 0 0 0 0 0 0
Output:
0 0 0 0 0 0 0 0 0 0
0 4 4 4 4 4 4 4 4 0
0 4 4 4 4 4 4 4 4 0
0 4 4 4 4 4 4 4 4 0
0 ... | null | Within each region separated by columns or rows of zeros, find the first row containing the value 2, then copy that row's pattern to all rows below it in the same region | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:28:08 | AboveBelow | AboveBelow6 | 2 | medium | 1 | null | 0 | 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 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 8 8 8 8 8 8 8 8 8 8 8
8 8 8 8 8 8 8 8 2 2 2 2 2
2 2 2 2 8 8 8 8 2 2 2 2 2
2 2 2 2 8 8 8 8 2 2 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 | Let me analyze these examples to find the pattern.
Example 1:
Input:
0 0 0 0 0 0 0 0 0 0
0 4 4 4 4 4 4 4 4 0
0 4 4 4 4 4 4 4 4 0
0 4 4 4 4 4 4 4 4 0
0 2 2 2 2 2 2 2 2 0
0 4 4 4 4 4 4 4 4 0
0 4 4 4 4 4 4 4 4 0
0 0 0 0 0 0 0 0 0 0
Output:
0 0 0 0 0 0 0 0 0 0
0 4 4 4 4 4 4 4 4 0
0 4 4 4 4 4 4 4 4 0
0 4 4 4 4 4 4 4 4 0
... | null | For each position containing a 2, propagate that 2 downward to subsequent rows, replacing non-zero values with 2s at those same column positions, until reaching a 0 or grid boundary | 1 | null | Correct - Intended | 0 |
Textual | claude-sonnet-4 | mediumeffort_autosummary | mediumeffort_autosummary/AboveBelow.csv | 2025-09-11T17:29:29 | AboveBelow | AboveBelow6 | 3 | medium | 0 | parse:non-integer token in row 1 | 0 | 0 0 0 0 0 0 0,0 0 0 0 0 0 0,0 0 0 0 0 0 0,2 2 0 0 0 2 1,2 2 0 0 0 2 1,2 2 0 0 0 2 1,2 2 0 0 0 2 1,2 2 0 0 0 2 1,2 2 0 0 0 2 1 | Let me analyze the examples to find the common rule.
Example 1:
Input:
0 0 0 0 0 0 0 0 0 0
0 4 4 4 4 4 4 4 4 0
0 4 4 4 4 4 4 4 4 0
0 4 4 4 4 4 4 4 4 0
0 2 2 2 2 2 2 2 2 0
0 4 4 4 4 4 4 4 4 0
0 4 4 4 4 4 4 4 4 0
0 0 0 0 0 0 0 0 0 0
Output:
0 0 0 0 0 0 0 0 0 0
0 4 4 4 4 4 4 4 4 0
0 4 4 4 4 4 4 4 4 0
0 4 4 4 4 4 4 4 4 0... | null | 2's fall down vertically like gravity, replacing non-zero values below them until they hit a 0 or the bottom | 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.
Models were evaluated with textual and visual inputs, at low and medium reasoning effort, and with and without Python tools. 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) |
7,680 | One row per model attempt on one test input: 16 runs × 480 items. Covers o3 (low and medium effort, with and without tools) and Claude Sonnet 4 and Gemini 2.5 Pro (medium effort, with and without 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
- 129