task_name stringclasses 6
values | strategy_id stringclasses 20
values | input_text stringlengths 6 26 | reasoning_trace stringlengths 11 152 |
|---|---|---|---|
sorting_algorithms | sorting_algorithms:merge-sort | 0, 7, 6, 8, 3 | [0,6,7,8,3] ; [0,3,6,7,8] |
base_conversion | base_conversion:decomposition | n=124,base=4 | TERM:1*4^3=64 ; TERM:3*4^2=48 ; TERM:3*4^1=12 ; TERM:0*4^0=0 ; OUT:1330 |
base_conversion | base_conversion:decomposition | n=212,base=4 | TERM:3*4^3=192 ; TERM:1*4^2=16 ; TERM:1*4^1=4 ; TERM:0*4^0=0 ; OUT:3110 |
base_conversion | base_conversion:decomposition | n=173,base=16 | TERM:10*16^1=160 ; TERM:13*16^0=13 ; OUT:AD |
sorting_algorithms | sorting_algorithms:heap-sort | 9, 7, 6, 3, 5 | [5,7,6,3,9] ; [7,5,6,3,9] ; [3,5,6,7,9] ; [6,5,3,7,9] ; [3,5,6,7,9] ; [5,3,6,7,9] ; [3,5,6,7,9] |
multidigit_addition | multidigit_addition:right-to-left-carry | 164+430 | d2:4+0+0=4→w4,c0 ; d1:6+3+0=9→w9,c0 ; d0:1+4+0=5→w5,c0 ; sum=594 |
list_summation | list_summation:pairwise | 5, 0, 3, 6 | 5+0=5 ; 3+6=9 ; 5+9=14 |
sorting_algorithms | sorting_algorithms:insertion-sort | 5, 7, 0, 9, 4 | [5,7,0,9,4] ; [0,5,7,9,4] ; [0,5,7,9,4] ; [0,4,5,7,9] |
list_summation | list_summation:pairwise | 8, 6, 4, 5 | 8+6=14 ; 4+5=9 ; 14+9=23 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 9x+72=144 | 9x+72=144 ; x+8=16 ; x=16-8 ; x=8 |
sorting_algorithms | sorting_algorithms:merge-sort | 9, 2, 8, 7, 4 | [2,9,8,7,4] ; [2,9,7,8,4] ; [2,7,8,9,4] ; [2,4,7,8,9] |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 8x+32=72 | 8x+32=72 ; x+4=9 ; x=9-4 ; x=5 |
list_summation | list_summation:right-to-left | 3, 3, 3, 8 | 3+8=11 ; 3+11=14 ; 3+14=17 |
list_summation | list_summation:left-to-right | 7, 6, 8, 1 | 7+6=13 ; 13+8=21 ; 21+1=22 |
base_conversion | base_conversion:via-binary | n=229,base=2 | BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:1 ; CHUNK:3:0 ; CHUNK:4:0 ; CHUNK:5:1 ; CHUNK:6:0 ; CHUNK:7:1 ; OUT:11100101 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(0,0) ; G=(4,1) | D:(1,0) ; D:(2,0) ; D:(3,0) ; D:(4,0) ; R:(4,1) |
list_summation | list_summation:left-to-right | 6, 8, 6, 1 | 6+8=14 ; 14+6=20 ; 20+1=21 |
multidigit_addition | multidigit_addition:rounding-decomposition | 606+214 | round:610+214=824 ; adjust:824-4=820 ; sum=820 |
sorting_algorithms | sorting_algorithms:merge-sort | 5, 2, 3, 8, 0 | [2,5,3,8,0] ; [2,3,5,8,0] ; [0,2,3,5,8] |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(3,4) ; G=(4,5) | R:(3,5) ; D:(4,5) |
multidigit_addition | multidigit_addition:rounding-decomposition | 850+561 | round:850+561=1411 ; adjust:1411-0=1411 ; sum=1411 |
multidigit_addition | multidigit_addition:rounding-decomposition | 682+316 | round:690+316=1006 ; adjust:1006-8=998 ; sum=998 |
list_summation | list_summation:left-to-right | 3, 5, 8, 1 | 3+5=8 ; 8+8=16 ; 16+1=17 |
multidigit_addition | multidigit_addition:rounding-decomposition | 303+290 | round:310+290=600 ; adjust:600-7=593 ; sum=593 |
base_conversion | base_conversion:via-binary | n=102,base=4 | BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:2 ; CHUNK:2:1 ; CHUNK:3:2 ; OUT:1212 |
base_conversion | base_conversion:decomposition | n=51,base=4 | TERM:3*4^2=48 ; TERM:0*4^1=0 ; TERM:3*4^0=3 ; OUT:303 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 2x+16=14 | 2x+16=14 ; x+8=7 ; x=7-8 ; x=-1 |
base_conversion | base_conversion:repeated-division | n=162,base=8 | DIV:162/8=20,r:2 ; DIV:20/8=2,r:4 ; DIV:2/8=0,r:2 ; OUT:242 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(4,3) ; G=(5,5) | D:(5,3) ; R:(5,4) ; R:(5,5) |
multidigit_addition | multidigit_addition:right-to-left-carry | 809+111 | d2:9+1+0=10→w0,c1 ; d1:0+1+1=2→w2,c0 ; d0:8+1+0=9→w9,c0 ; sum=920 |
multidigit_addition | multidigit_addition:left-to-right-partials | 533+950 | p100:500+900=1400 ; p10:30+50=80 ; p1:3+0=3 ; sum=1400+80+3=1483 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 9x-45=-27 | 9x-45=-27 ; 9x=18 ; x=2 |
linear_equation_solving | linear_equation_solving:inverse-ops | 2x-8=0 | 2x-8=0 ; x=(0--8)/2 ; x=8/2 ; x=4 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(1,1) ; G=(2,2) | R:(1,2) ; D:(2,2) |
base_conversion | base_conversion:decomposition | n=32,base=2 | TERM:1*2^5=32 ; TERM:0*2^4=0 ; TERM:0*2^3=0 ; TERM:0*2^2=0 ; TERM:0*2^1=0 ; TERM:0*2^0=0 ; OUT:100000 |
sorting_algorithms | sorting_algorithms:insertion-sort | 4, 3, 2, 9, 7 | [3,4,2,9,7] ; [2,3,4,9,7] ; [2,3,4,9,7] ; [2,3,4,7,9] |
list_summation | list_summation:pairwise | 8, 6, 1, 4 | 8+6=14 ; 1+4=5 ; 14+5=19 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,2) ; G=(4,4) | R:(2,3) ; D:(3,3) ; R:(3,4) ; D:(4,4) |
list_summation | list_summation:left-to-right | 2, 6, 4, 4 | 2+6=8 ; 8+4=12 ; 12+4=16 |
multidigit_addition | multidigit_addition:right-to-left-carry | 735+328 | d2:5+8+0=13→w3,c1 ; d1:3+2+1=6→w6,c0 ; d0:7+3+0=10→w0,c1 ; sum=1063 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 6x-18=30 | 6x-18=30 ; 6x=48 ; x=8 |
sorting_algorithms | sorting_algorithms:insertion-sort | 5, 9, 0, 4, 8 | [5,9,0,4,8] ; [0,5,9,4,8] ; [0,4,5,9,8] ; [0,4,5,8,9] |
multidigit_addition | multidigit_addition:left-to-right-partials | 177+146 | p100:100+100=200 ; p10:70+40=110 ; p1:7+6=13 ; sum=200+110+13=323 |
list_summation | list_summation:right-to-left | 2, 3, 6, 7 | 6+7=13 ; 3+13=16 ; 2+16=18 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 8x+24=8 | 8x+24=8 ; x+3=1 ; x=1-3 ; x=-2 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(1,1) ; G=(4,2) | R:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2) |
base_conversion | base_conversion:decomposition | n=2,base=2 | TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:10 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 8x-40=-8 | 8x-40=-8 ; x+-5=-1 ; x=-1--5 ; x=4 |
list_summation | list_summation:left-to-right | 5, 8, 1, 0 | 5+8=13 ; 13+1=14 ; 14+0=14 |
base_conversion | base_conversion:decomposition | n=243,base=16 | TERM:15*16^1=240 ; TERM:3*16^0=3 ; OUT:F3 |
sorting_algorithms | sorting_algorithms:selection-sort | 1, 6, 2, 5, 4 | [1,6,2,5,4] ; [1,2,6,5,4] ; [1,2,4,5,6] ; [1,2,4,5,6] |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(0,1) ; G=(3,5) | R:(0,2) ; R:(0,3) ; R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) |
multidigit_addition | multidigit_addition:right-to-left-carry | 158+406 | d2:8+6+0=14→w4,c1 ; d1:5+0+1=6→w6,c0 ; d0:1+4+0=5→w5,c0 ; sum=564 |
base_conversion | base_conversion:decomposition | n=248,base=4 | TERM:3*4^3=192 ; TERM:3*4^2=48 ; TERM:2*4^1=8 ; TERM:0*4^0=0 ; OUT:3320 |
list_summation | list_summation:pairwise | 4, 1, 3, 4 | 4+1=5 ; 3+4=7 ; 5+7=12 |
base_conversion | base_conversion:repeated-division | n=17,base=4 | DIV:17/4=4,r:1 ; DIV:4/4=1,r:0 ; DIV:1/4=0,r:1 ; OUT:101 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(0,0) ; G=(4,3) | D:(1,0) ; D:(2,0) ; D:(3,0) ; D:(4,0) ; R:(4,1) ; R:(4,2) ; R:(4,3) |
multidigit_addition | multidigit_addition:right-to-left-carry | 834+932 | d2:4+2+0=6→w6,c0 ; d1:3+3+0=6→w6,c0 ; d0:8+9+0=17→w7,c1 ; sum=1766 |
list_summation | list_summation:left-to-right | 6, 3, 2, 0 | 6+3=9 ; 9+2=11 ; 11+0=11 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 5x-40=-50 | 5x-40=-50 ; x+-8=-10 ; x=-10--8 ; x=-2 |
list_summation | list_summation:right-to-left | 2, 4, 0, 7 | 0+7=7 ; 4+7=11 ; 2+11=13 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(1,4) ; G=(5,5) | R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5) |
list_summation | list_summation:pairwise | 2, 1, 3, 6 | 2+1=3 ; 3+6=9 ; 3+9=12 |
base_conversion | base_conversion:repeated-division | n=162,base=2 | DIV:162/2=81,r:0 ; DIV:81/2=40,r:1 ; DIV:40/2=20,r:0 ; DIV:20/2=10,r:0 ; DIV:10/2=5,r:0 ; DIV:5/2=2,r:1 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:10100010 |
sorting_algorithms | sorting_algorithms:heap-sort | 1, 4, 7, 6, 2 | [1,6,7,4,2] ; [7,6,1,4,2] ; [2,6,1,4,7] ; [6,2,1,4,7] ; [6,4,1,2,7] ; [2,4,1,6,7] ; [4,2,1,6,7] ; [1,2,4,6,7] ; [2,1,4,6,7] ; [1,2,4,6,7] |
list_summation | list_summation:left-to-right | 9, 7, 8, 6 | 9+7=16 ; 16+8=24 ; 24+6=30 |
linear_equation_solving | linear_equation_solving:inverse-ops | 6x+6=0 | 6x+6=0 ; x=(0-6)/6 ; x=-6/6 ; x=-1 |
sorting_algorithms | sorting_algorithms:insertion-sort | 3, 0, 7, 1, 9 | [0,3,7,1,9] ; [0,3,7,1,9] ; [0,1,3,7,9] ; [0,1,3,7,9] |
list_summation | list_summation:pairwise | 4, 1, 5, 0 | 4+1=5 ; 5+0=5 ; 5+5=10 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(4,2) ; G=(5,3) | R:(4,3) ; D:(5,3) |
multidigit_addition | multidigit_addition:right-to-left-carry | 748+252 | d2:8+2+0=10→w0,c1 ; d1:4+5+1=10→w0,c1 ; d0:7+2+1=10→w0,c1 ; sum=1000 |
sorting_algorithms | sorting_algorithms:bubble-sort | 1, 2, 3, 9, 5 | [1,2,3,5,9] |
sorting_algorithms | sorting_algorithms:selection-sort | 2, 6, 7, 4, 9 | [2,6,7,4,9] ; [2,4,7,6,9] ; [2,4,6,7,9] ; [2,4,6,7,9] |
sorting_algorithms | sorting_algorithms:insertion-sort | 0, 9, 2, 4, 3 | [0,9,2,4,3] ; [0,2,9,4,3] ; [0,2,4,9,3] ; [0,2,3,4,9] |
list_summation | list_summation:right-to-left | 5, 8, 0, 6 | 0+6=6 ; 8+6=14 ; 5+14=19 |
sorting_algorithms | sorting_algorithms:selection-sort | 4, 2, 0, 9, 5 | [0,2,4,9,5] ; [0,2,4,9,5] ; [0,2,4,9,5] ; [0,2,4,5,9] |
base_conversion | base_conversion:repeated-division | n=1,base=4 | DIV:1/4=0,r:1 ; OUT:1 |
sorting_algorithms | sorting_algorithms:heap-sort | 6, 8, 7, 2, 9 | [6,9,7,2,8] ; [9,6,7,2,8] ; [9,8,7,2,6] ; [6,8,7,2,9] ; [8,6,7,2,9] ; [2,6,7,8,9] ; [7,6,2,8,9] ; [2,6,7,8,9] ; [6,2,7,8,9] ; [2,6,7,8,9] |
linear_equation_solving | linear_equation_solving:inverse-ops | 7x+56=77 | 7x+56=77 ; x=(77-56)/7 ; x=21/7 ; x=3 |
sorting_algorithms | sorting_algorithms:insertion-sort | 6, 2, 1, 3, 7 | [2,6,1,3,7] ; [1,2,6,3,7] ; [1,2,3,6,7] ; [1,2,3,6,7] |
sorting_algorithms | sorting_algorithms:bubble-sort | 0, 8, 6, 3, 7 | [0,6,8,3,7] ; [0,6,3,8,7] ; [0,6,3,7,8] ; [0,3,6,7,8] |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(2,3) ; G=(4,5) | R:(2,4) ; R:(2,5) ; D:(3,5) ; D:(4,5) |
base_conversion | base_conversion:decomposition | n=169,base=4 | TERM:2*4^3=128 ; TERM:2*4^2=32 ; TERM:2*4^1=8 ; TERM:1*4^0=1 ; OUT:2221 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(1,1) ; G=(3,5) | R:(1,2) ; R:(1,3) ; R:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5) |
multidigit_addition | multidigit_addition:rounding-decomposition | 842+491 | round:850+491=1341 ; adjust:1341-8=1333 ; sum=1333 |
multidigit_addition | multidigit_addition:right-to-left-carry | 339+808 | d2:9+8+0=17→w7,c1 ; d1:3+0+1=4→w4,c0 ; d0:3+8+0=11→w1,c1 ; sum=1147 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(4,2) ; G=(5,3) | D:(5,2) ; R:(5,3) |
list_summation | list_summation:left-to-right | 4, 8, 9, 7 | 4+8=12 ; 12+9=21 ; 21+7=28 |
multidigit_addition | multidigit_addition:left-to-right-partials | 626+684 | p100:600+600=1200 ; p10:20+80=100 ; p1:6+4=10 ; sum=1200+100+10=1310 |
base_conversion | base_conversion:via-binary | n=247,base=8 | BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:6 ; CHUNK:2:7 ; OUT:367 |
sorting_algorithms | sorting_algorithms:merge-sort | 7, 2, 9, 5, 1 | [2,7,9,5,1] ; [2,7,5,9,1] ; [2,5,7,9,1] ; [1,2,5,7,9] |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(3,4) ; G=(4,5) | R:(3,5) ; D:(4,5) |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(1,1) ; G=(3,2) | R:(1,2) ; D:(2,2) ; D:(3,2) |
sorting_algorithms | sorting_algorithms:selection-sort | 2, 0, 4, 3, 6 | [0,2,4,3,6] ; [0,2,4,3,6] ; [0,2,3,4,6] ; [0,2,3,4,6] |
list_summation | list_summation:pairwise | 8, 2, 8, 5 | 8+2=10 ; 8+5=13 ; 10+13=23 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(4,4) ; G=(5,5) | D:(5,4) ; R:(5,5) |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(4,2) ; G=(5,3) | R:(4,3) ; D:(5,3) |
multidigit_addition | multidigit_addition:right-to-left-carry | 326+497 | d2:6+7+0=13→w3,c1 ; d1:2+9+1=12→w2,c1 ; d0:3+4+1=8→w8,c0 ; sum=823 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(2,0) ; G=(4,3) | R:(2,1) ; R:(2,2) ; R:(2,3) ; D:(3,3) ; D:(4,3) |
linear_equation_solving | linear_equation_solving:inverse-ops | 5x-20=20 | 5x-20=20 ; x=(20--20)/5 ; x=40/5 ; x=8 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.