task_name stringclasses 6
values | strategy_id stringclasses 20
values | input_text stringlengths 6 26 | reasoning_trace stringlengths 11 152 |
|---|---|---|---|
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(3,0) ; G=(4,4) | R:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4) ; D:(4,4) |
sorting_algorithms | sorting_algorithms:heap-sort | 9, 3, 5, 7, 4 | [9,7,5,3,4] ; [4,7,5,3,9] ; [7,4,5,3,9] ; [3,4,5,7,9] ; [5,4,3,7,9] ; [3,4,5,7,9] ; [4,3,5,7,9] ; [3,4,5,7,9] |
linear_equation_solving | linear_equation_solving:inverse-ops | 2x-2=8 | 2x-2=8 ; x=(8--2)/2 ; x=10/2 ; x=5 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(1,1) ; G=(5,2) | R:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2) |
sorting_algorithms | sorting_algorithms:heap-sort | 9, 6, 1, 7, 2 | [9,7,1,6,2] ; [2,7,1,6,9] ; [7,2,1,6,9] ; [7,6,1,2,9] ; [2,6,1,7,9] ; [6,2,1,7,9] ; [1,2,6,7,9] ; [2,1,6,7,9] ; [1,2,6,7,9] |
list_summation | list_summation:pairwise | 9, 1, 0, 1 | 9+1=10 ; 0+1=1 ; 10+1=11 |
multidigit_addition | multidigit_addition:right-to-left-carry | 886+183 | d2:6+3+0=9→w9,c0 ; d1:8+8+0=16→w6,c1 ; d0:8+1+1=10→w0,c1 ; sum=1069 |
list_summation | list_summation:right-to-left | 4, 2, 5, 2 | 5+2=7 ; 2+7=9 ; 4+9=13 |
multidigit_addition | multidigit_addition:right-to-left-carry | 609+595 | d2:9+5+0=14→w4,c1 ; d1:0+9+1=10→w0,c1 ; d0:6+5+1=12→w2,c1 ; sum=1204 |
base_conversion | base_conversion:decomposition | n=34,base=8 | TERM:4*8^1=32 ; TERM:2*8^0=2 ; OUT:42 |
sorting_algorithms | sorting_algorithms:insertion-sort | 0, 4, 3, 9, 2 | [0,4,3,9,2] ; [0,3,4,9,2] ; [0,3,4,9,2] ; [0,2,3,4,9] |
list_summation | list_summation:left-to-right | 7, 0, 0, 6 | 7+0=7 ; 7+0=7 ; 7+6=13 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,0) ; G=(3,3) | R:(2,1) ; D:(3,1) ; R:(3,2) ; R:(3,3) |
base_conversion | base_conversion:repeated-division | n=36,base=16 | DIV:36/16=2,r:4 ; DIV:2/16=0,r:2 ; OUT:24 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(3,4) ; G=(5,5) | R:(3,5) ; D:(4,5) ; D:(5,5) |
sorting_algorithms | sorting_algorithms:bubble-sort | 8, 3, 0, 5, 2 | [3,8,0,5,2] ; [3,0,8,5,2] ; [3,0,5,8,2] ; [3,0,5,2,8] ; [0,3,5,2,8] ; [0,3,2,5,8] ; [0,2,3,5,8] |
multidigit_addition | multidigit_addition:right-to-left-carry | 261+458 | d2:1+8+0=9→w9,c0 ; d1:6+5+0=11→w1,c1 ; d0:2+4+1=7→w7,c0 ; sum=719 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(0,0) ; G=(1,4) | R:(0,1) ; D:(1,1) ; R:(1,2) ; R:(1,3) ; R:(1,4) |
base_conversion | base_conversion:repeated-division | n=153,base=16 | DIV:153/16=9,r:9 ; DIV:9/16=0,r:9 ; OUT:99 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,2) ; G=(4,5) | R:(2,3) ; D:(3,3) ; R:(3,4) ; D:(4,4) ; R:(4,5) |
base_conversion | base_conversion:decomposition | n=138,base=2 | TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:0*2^5=0 ; TERM:0*2^4=0 ; TERM:1*2^3=8 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:10001010 |
base_conversion | base_conversion:via-binary | n=6,base=16 | BINLEN:3 ; CHUNK:0:6 ; OUT:6 |
list_summation | list_summation:right-to-left | 5, 8, 6, 4 | 6+4=10 ; 8+10=18 ; 5+18=23 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(2,4) ; G=(3,5) | D:(3,4) ; R:(3,5) |
multidigit_addition | multidigit_addition:rounding-decomposition | 141+155 | round:150+155=305 ; adjust:305-9=296 ; sum=296 |
base_conversion | base_conversion:decomposition | n=139,base=2 | TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:0*2^5=0 ; TERM:0*2^4=0 ; TERM:1*2^3=8 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:10001011 |
multidigit_addition | multidigit_addition:right-to-left-carry | 743+312 | d2:3+2+0=5→w5,c0 ; d1:4+1+0=5→w5,c0 ; d0:7+3+0=10→w0,c1 ; sum=1055 |
list_summation | list_summation:right-to-left | 2, 0, 6, 5 | 6+5=11 ; 0+11=11 ; 2+11=13 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(1,4) ; G=(5,5) | R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5) |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 6x-54=-48 | 6x-54=-48 ; 6x=6 ; x=1 |
base_conversion | base_conversion:repeated-division | n=74,base=4 | DIV:74/4=18,r:2 ; DIV:18/4=4,r:2 ; DIV:4/4=1,r:0 ; DIV:1/4=0,r:1 ; OUT:1022 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 8x-48=-96 | 8x-48=-96 ; 8x=-48 ; x=-6 |
base_conversion | base_conversion:via-binary | n=248,base=8 | BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:7 ; CHUNK:2:0 ; OUT:370 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(2,1) ; G=(4,4) | D:(3,1) ; D:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4) |
sorting_algorithms | sorting_algorithms:bubble-sort | 3, 4, 5, 0, 7 | [3,4,0,5,7] ; [3,0,4,5,7] ; [0,3,4,5,7] |
multidigit_addition | multidigit_addition:rounding-decomposition | 416+587 | round:420+587=1007 ; adjust:1007-4=1003 ; sum=1003 |
multidigit_addition | multidigit_addition:left-to-right-partials | 948+234 | p100:900+200=1100 ; p10:40+30=70 ; p1:8+4=12 ; sum=1100+70+12=1182 |
list_summation | list_summation:left-to-right | 6, 9, 7, 7 | 6+9=15 ; 15+7=22 ; 22+7=29 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(2,1) ; G=(5,2) | R:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2) |
sorting_algorithms | sorting_algorithms:merge-sort | 5, 6, 9, 4, 3 | [5,6,4,9,3] ; [4,5,6,9,3] ; [3,4,5,6,9] |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(0,2) ; G=(4,5) | R:(0,3) ; R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) |
multidigit_addition | multidigit_addition:rounding-decomposition | 910+503 | round:910+503=1413 ; adjust:1413-0=1413 ; sum=1413 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(4,2) ; G=(5,3) | R:(4,3) ; D:(5,3) |
list_summation | list_summation:right-to-left | 2, 1, 0, 4 | 0+4=4 ; 1+4=5 ; 2+5=7 |
sorting_algorithms | sorting_algorithms:heap-sort | 8, 3, 9, 0, 1 | [9,3,8,0,1] ; [1,3,8,0,9] ; [8,3,1,0,9] ; [0,3,1,8,9] ; [3,0,1,8,9] ; [1,0,3,8,9] ; [0,1,3,8,9] |
sorting_algorithms | sorting_algorithms:insertion-sort | 1, 8, 5, 6, 9 | [1,8,5,6,9] ; [1,5,8,6,9] ; [1,5,6,8,9] ; [1,5,6,8,9] |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 8x+40=56 | 8x+40=56 ; 8x=16 ; x=2 |
sorting_algorithms | sorting_algorithms:heap-sort | 9, 6, 4, 3, 2 | [2,6,4,3,9] ; [6,2,4,3,9] ; [6,3,4,2,9] ; [2,3,4,6,9] ; [4,3,2,6,9] ; [2,3,4,6,9] ; [3,2,4,6,9] ; [2,3,4,6,9] |
sorting_algorithms | sorting_algorithms:merge-sort | 5, 3, 4, 8, 1 | [3,5,4,8,1] ; [3,4,5,8,1] ; [1,3,4,5,8] |
list_summation | list_summation:left-to-right | 6, 9, 4, 3 | 6+9=15 ; 15+4=19 ; 19+3=22 |
base_conversion | base_conversion:decomposition | n=166,base=8 | TERM:2*8^2=128 ; TERM:4*8^1=32 ; TERM:6*8^0=6 ; OUT:246 |
list_summation | list_summation:left-to-right | 2, 4, 6, 9 | 2+4=6 ; 6+6=12 ; 12+9=21 |
base_conversion | base_conversion:via-binary | n=209,base=4 | BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:1 ; OUT:3101 |
linear_equation_solving | linear_equation_solving:inverse-ops | 2x+4=-6 | 2x+4=-6 ; x=(-6-4)/2 ; x=-10/2 ; x=-5 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(0,1) ; G=(3,2) | R:(0,2) ; D:(1,2) ; D:(2,2) ; D:(3,2) |
list_summation | list_summation:pairwise | 1, 1, 2, 0 | 1+1=2 ; 2+0=2 ; 2+2=4 |
multidigit_addition | multidigit_addition:right-to-left-carry | 901+665 | d2:1+5+0=6→w6,c0 ; d1:0+6+0=6→w6,c0 ; d0:9+6+0=15→w5,c1 ; sum=1566 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(4,0) ; G=(5,4) | D:(5,0) ; R:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 3x+21=21 | 3x+21=21 ; x+7=7 ; x=7-7 ; x=0 |
sorting_algorithms | sorting_algorithms:insertion-sort | 6, 9, 2, 7, 8 | [6,9,2,7,8] ; [2,6,9,7,8] ; [2,6,7,9,8] ; [2,6,7,8,9] |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(4,4) ; G=(5,5) | R:(4,5) ; D:(5,5) |
list_summation | list_summation:pairwise | 9, 4, 7, 2 | 9+4=13 ; 7+2=9 ; 13+9=22 |
list_summation | list_summation:right-to-left | 0, 7, 8, 3 | 8+3=11 ; 7+11=18 ; 0+18=18 |
sorting_algorithms | sorting_algorithms:selection-sort | 6, 3, 0, 5, 2 | [0,3,6,5,2] ; [0,2,6,5,3] ; [0,2,3,5,6] ; [0,2,3,5,6] |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 4x-8=16 | 4x-8=16 ; x+-2=4 ; x=4--2 ; x=6 |
multidigit_addition | multidigit_addition:right-to-left-carry | 770+563 | d2:0+3+0=3→w3,c0 ; d1:7+6+0=13→w3,c1 ; d0:7+5+1=13→w3,c1 ; sum=1333 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 6x+18=6 | 6x+18=6 ; x+3=1 ; x=1-3 ; x=-2 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(3,2) ; G=(4,3) | D:(4,2) ; R:(4,3) |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(3,3) ; G=(4,4) | R:(3,4) ; D:(4,4) |
base_conversion | base_conversion:repeated-division | n=202,base=4 | DIV:202/4=50,r:2 ; DIV:50/4=12,r:2 ; DIV:12/4=3,r:0 ; DIV:3/4=0,r:3 ; OUT:3022 |
list_summation | list_summation:right-to-left | 0, 9, 7, 7 | 7+7=14 ; 9+14=23 ; 0+23=23 |
sorting_algorithms | sorting_algorithms:selection-sort | 4, 0, 9, 7, 6 | [0,4,9,7,6] ; [0,4,9,7,6] ; [0,4,6,7,9] ; [0,4,6,7,9] |
list_summation | list_summation:left-to-right | 7, 5, 6, 2 | 7+5=12 ; 12+6=18 ; 18+2=20 |
base_conversion | base_conversion:decomposition | n=68,base=4 | TERM:1*4^3=64 ; TERM:0*4^2=0 ; TERM:1*4^1=4 ; TERM:0*4^0=0 ; OUT:1010 |
base_conversion | base_conversion:via-binary | n=237,base=8 | BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:5 ; CHUNK:2:5 ; OUT:355 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 6x+48=42 | 6x+48=42 ; x+8=7 ; x=7-8 ; x=-1 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(3,1) ; G=(4,3) | R:(3,2) ; R:(3,3) ; D:(4,3) |
base_conversion | base_conversion:decomposition | n=66,base=2 | TERM:1*2^6=64 ; TERM:0*2^5=0 ; TERM:0*2^4=0 ; TERM:0*2^3=0 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:1000010 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 5x+30=15 | 5x+30=15 ; 5x=-15 ; x=-3 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(3,1) ; G=(4,5) | R:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5) |
list_summation | list_summation:pairwise | 4, 0, 2, 1 | 4+0=4 ; 2+1=3 ; 4+3=7 |
sorting_algorithms | sorting_algorithms:insertion-sort | 9, 8, 5, 4, 7 | [8,9,5,4,7] ; [5,8,9,4,7] ; [4,5,8,9,7] ; [4,5,7,8,9] |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 6x+6=42 | 6x+6=42 ; 6x=36 ; x=6 |
list_summation | list_summation:right-to-left | 4, 4, 1, 8 | 1+8=9 ; 4+9=13 ; 4+13=17 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(0,4) ; G=(1,5) | D:(1,4) ; R:(1,5) |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(2,1) ; G=(5,4) | D:(3,1) ; D:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) |
sorting_algorithms | sorting_algorithms:selection-sort | 5, 0, 4, 1, 8 | [0,5,4,1,8] ; [0,1,4,5,8] ; [0,1,4,5,8] ; [0,1,4,5,8] |
base_conversion | base_conversion:decomposition | n=130,base=8 | TERM:2*8^2=128 ; TERM:0*8^1=0 ; TERM:2*8^0=2 ; OUT:202 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(0,0) ; G=(4,2) | D:(1,0) ; D:(2,0) ; D:(3,0) ; D:(4,0) ; R:(4,1) ; R:(4,2) |
base_conversion | base_conversion:via-binary | n=38,base=8 | BINLEN:6 ; CHUNK:0:4 ; CHUNK:1:6 ; OUT:46 |
base_conversion | base_conversion:repeated-division | n=17,base=16 | DIV:17/16=1,r:1 ; DIV:1/16=0,r:1 ; OUT:11 |
sorting_algorithms | sorting_algorithms:selection-sort | 7, 8, 3, 0, 4 | [0,8,3,7,4] ; [0,3,8,7,4] ; [0,3,4,7,8] ; [0,3,4,7,8] |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 4x+8=44 | 4x+8=44 ; 4x=36 ; x=9 |
multidigit_addition | multidigit_addition:right-to-left-carry | 141+716 | d2:1+6+0=7→w7,c0 ; d1:4+1+0=5→w5,c0 ; d0:1+7+0=8→w8,c0 ; sum=857 |
list_summation | list_summation:pairwise | 3, 7, 7, 3 | 3+7=10 ; 7+3=10 ; 10+10=20 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(2,0) ; G=(4,5) | R:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5) ; D:(3,5) ; D:(4,5) |
base_conversion | base_conversion:repeated-division | n=75,base=4 | DIV:75/4=18,r:3 ; DIV:18/4=4,r:2 ; DIV:4/4=1,r:0 ; DIV:1/4=0,r:1 ; OUT:1023 |
list_summation | list_summation:pairwise | 0, 7, 9, 9 | 0+7=7 ; 9+9=18 ; 7+18=25 |
list_summation | list_summation:left-to-right | 9, 3, 3, 1 | 9+3=12 ; 12+3=15 ; 15+1=16 |
list_summation | list_summation:pairwise | 4, 4, 0, 2 | 4+4=8 ; 0+2=2 ; 8+2=10 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.