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=(4,3) ; G=(5,5) | R:(4,4) ; R:(4,5) ; D:(5,5) |
sorting_algorithms | sorting_algorithms:insertion-sort | 6, 3, 8, 5, 0 | [3,6,8,5,0] ; [3,6,8,5,0] ; [3,5,6,8,0] ; [0,3,5,6,8] |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(2,4) ; G=(3,5) | D:(3,4) ; R:(3,5) |
list_summation | list_summation:right-to-left | 7, 5, 0, 3 | 0+3=3 ; 5+3=8 ; 7+8=15 |
list_summation | list_summation:right-to-left | 1, 9, 1, 7 | 1+7=8 ; 9+8=17 ; 1+17=18 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(2,1) ; G=(5,3) | D:(3,1) ; D:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3) |
base_conversion | base_conversion:repeated-division | n=31,base=4 | DIV:31/4=7,r:3 ; DIV:7/4=1,r:3 ; DIV:1/4=0,r:1 ; OUT:133 |
list_summation | list_summation:left-to-right | 5, 1, 7, 6 | 5+1=6 ; 6+7=13 ; 13+6=19 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(1,1) ; G=(5,4) | R:(1,2) ; R:(1,3) ; R:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4) |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(1,4) ; G=(3,5) | R:(1,5) ; D:(2,5) ; D:(3,5) |
multidigit_addition | multidigit_addition:right-to-left-carry | 812+433 | d2:2+3+0=5→w5,c0 ; d1:1+3+0=4→w4,c0 ; d0:8+4+0=12→w2,c1 ; sum=1245 |
list_summation | list_summation:right-to-left | 8, 3, 8, 6 | 8+6=14 ; 3+14=17 ; 8+17=25 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 2x+12=24 | 2x+12=24 ; x+6=12 ; x=12-6 ; x=6 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 6x+54=102 | 6x+54=102 ; x+9=17 ; x=17-9 ; x=8 |
multidigit_addition | multidigit_addition:rounding-decomposition | 506+812 | round:510+812=1322 ; adjust:1322-4=1318 ; sum=1318 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(4,3) ; G=(5,4) | D:(5,3) ; R:(5,4) |
sorting_algorithms | sorting_algorithms:heap-sort | 5, 2, 7, 6, 9 | [5,9,7,6,2] ; [9,5,7,6,2] ; [9,6,7,5,2] ; [2,6,7,5,9] ; [7,6,2,5,9] ; [5,6,2,7,9] ; [6,5,2,7,9] ; [2,5,6,7,9] ; [5,2,6,7,9] ; [2,5,6,7,9] |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 6x+6=-30 | 6x+6=-30 ; x+1=-5 ; x=-5-1 ; x=-6 |
multidigit_addition | multidigit_addition:rounding-decomposition | 268+760 | round:270+760=1030 ; adjust:1030-2=1028 ; sum=1028 |
sorting_algorithms | sorting_algorithms:merge-sort | 0, 9, 3, 2, 6 | [0,9,2,3,6] ; [0,2,3,9,6] ; [0,2,3,6,9] |
list_summation | list_summation:right-to-left | 4, 4, 4, 9 | 4+9=13 ; 4+13=17 ; 4+17=21 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(4,2) ; G=(5,4) | R:(4,3) ; R:(4,4) ; D:(5,4) |
sorting_algorithms | sorting_algorithms:bubble-sort | 0, 6, 2, 3, 7 | [0,2,6,3,7] ; [0,2,3,6,7] |
sorting_algorithms | sorting_algorithms:insertion-sort | 3, 6, 2, 5, 7 | [3,6,2,5,7] ; [2,3,6,5,7] ; [2,3,5,6,7] ; [2,3,5,6,7] |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 5x-40=-10 | 5x-40=-10 ; 5x=30 ; x=6 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 7x-35=-49 | 7x-35=-49 ; x+-5=-7 ; x=-7--5 ; x=-2 |
multidigit_addition | multidigit_addition:right-to-left-carry | 434+852 | d2:4+2+0=6→w6,c0 ; d1:3+5+0=8→w8,c0 ; d0:4+8+0=12→w2,c1 ; sum=1286 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(4,4) ; G=(5,5) | D:(5,4) ; R:(5,5) |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 4x+20=-8 | 4x+20=-8 ; x+5=-2 ; x=-2-5 ; x=-7 |
linear_equation_solving | linear_equation_solving:inverse-ops | 7x+28=0 | 7x+28=0 ; x=(0-28)/7 ; x=-28/7 ; x=-4 |
base_conversion | base_conversion:via-binary | n=191,base=8 | BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:7 ; CHUNK:2:7 ; OUT:277 |
sorting_algorithms | sorting_algorithms:bubble-sort | 3, 1, 2, 9, 6 | [1,3,2,9,6] ; [1,2,3,9,6] ; [1,2,3,6,9] |
multidigit_addition | multidigit_addition:left-to-right-partials | 644+994 | p100:600+900=1500 ; p10:40+90=130 ; p1:4+4=8 ; sum=1500+130+8=1638 |
list_summation | list_summation:pairwise | 4, 3, 5, 8 | 4+3=7 ; 5+8=13 ; 7+13=20 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(0,1) ; G=(5,4) | D:(1,1) ; D:(2,1) ; D:(3,1) ; D:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) |
multidigit_addition | multidigit_addition:rounding-decomposition | 899+909 | round:900+909=1809 ; adjust:1809-1=1808 ; sum=1808 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(3,2) ; G=(4,4) | R:(3,3) ; R:(3,4) ; D:(4,4) |
sorting_algorithms | sorting_algorithms:insertion-sort | 9, 5, 7, 0, 6 | [5,9,7,0,6] ; [5,7,9,0,6] ; [0,5,7,9,6] ; [0,5,6,7,9] |
list_summation | list_summation:left-to-right | 5, 5, 5, 0 | 5+5=10 ; 10+5=15 ; 15+0=15 |
sorting_algorithms | sorting_algorithms:insertion-sort | 3, 9, 0, 5, 8 | [3,9,0,5,8] ; [0,3,9,5,8] ; [0,3,5,9,8] ; [0,3,5,8,9] |
base_conversion | base_conversion:via-binary | n=216,base=4 | BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:1 ; CHUNK:2:2 ; CHUNK:3:0 ; OUT:3120 |
base_conversion | base_conversion:decomposition | n=18,base=16 | TERM:1*16^1=16 ; TERM:2*16^0=2 ; OUT:12 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(1,2) ; G=(3,4) | D:(2,2) ; D:(3,2) ; R:(3,3) ; R:(3,4) |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,2) ; G=(4,3) | R:(2,3) ; D:(3,3) ; D:(4,3) |
sorting_algorithms | sorting_algorithms:insertion-sort | 1, 6, 7, 0, 8 | [1,6,7,0,8] ; [1,6,7,0,8] ; [0,1,6,7,8] ; [0,1,6,7,8] |
sorting_algorithms | sorting_algorithms:heap-sort | 9, 4, 5, 2, 0 | [0,4,5,2,9] ; [5,4,0,2,9] ; [2,4,0,5,9] ; [4,2,0,5,9] ; [0,2,4,5,9] ; [2,0,4,5,9] ; [0,2,4,5,9] |
sorting_algorithms | sorting_algorithms:merge-sort | 3, 2, 8, 6, 0 | [2,3,8,6,0] ; [2,3,6,8,0] ; [0,2,3,6,8] |
multidigit_addition | multidigit_addition:rounding-decomposition | 494+240 | round:500+240=740 ; adjust:740-6=734 ; sum=734 |
multidigit_addition | multidigit_addition:rounding-decomposition | 608+572 | round:610+572=1182 ; adjust:1182-2=1180 ; sum=1180 |
sorting_algorithms | sorting_algorithms:merge-sort | 8, 0, 3, 9, 6 | [0,8,3,9,6] ; [0,3,8,9,6] ; [0,3,6,8,9] |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 5x-20=-10 | 5x-20=-10 ; 5x=10 ; x=2 |
list_summation | list_summation:pairwise | 8, 3, 0, 2 | 8+3=11 ; 0+2=2 ; 11+2=13 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(3,3) ; G=(5,4) | D:(4,3) ; D:(5,3) ; R:(5,4) |
multidigit_addition | multidigit_addition:rounding-decomposition | 542+797 | round:550+797=1347 ; adjust:1347-8=1339 ; sum=1339 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 8x+56=88 | 8x+56=88 ; 8x=32 ; x=4 |
base_conversion | base_conversion:via-binary | n=160,base=8 | BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:4 ; CHUNK:2:0 ; OUT:240 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 9x-54=-36 | 9x-54=-36 ; 9x=18 ; x=2 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 8x+48=48 | 8x+48=48 ; 8x=0 ; x=0 |
base_conversion | base_conversion:decomposition | n=108,base=4 | TERM:1*4^3=64 ; TERM:2*4^2=32 ; TERM:3*4^1=12 ; TERM:0*4^0=0 ; OUT:1230 |
base_conversion | base_conversion:repeated-division | n=251,base=16 | DIV:251/16=15,r:11 ; DIV:15/16=0,r:15 ; OUT:FB |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(2,1) ; G=(3,4) | D:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4) |
multidigit_addition | multidigit_addition:rounding-decomposition | 780+589 | round:780+589=1369 ; adjust:1369-0=1369 ; sum=1369 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 9x+54=18 | 9x+54=18 ; x+6=2 ; x=2-6 ; x=-4 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 4x-28=-52 | 4x-28=-52 ; x+-7=-13 ; x=-13--7 ; x=-6 |
list_summation | list_summation:pairwise | 2, 6, 6, 4 | 2+6=8 ; 6+4=10 ; 8+10=18 |
sorting_algorithms | sorting_algorithms:merge-sort | 2, 9, 7, 1, 5 | [2,9,1,7,5] ; [1,2,7,9,5] ; [1,2,5,7,9] |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,4) ; G=(5,5) | R:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5) |
base_conversion | base_conversion:decomposition | n=247,base=8 | TERM:3*8^2=192 ; TERM:6*8^1=48 ; TERM:7*8^0=7 ; OUT:367 |
base_conversion | base_conversion:via-binary | n=113,base=2 | BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:1 ; CHUNK:3:0 ; CHUNK:4:0 ; CHUNK:5:0 ; CHUNK:6:1 ; OUT:1110001 |
base_conversion | base_conversion:via-binary | n=99,base=16 | BINLEN:7 ; CHUNK:0:6 ; CHUNK:1:3 ; OUT:63 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,1) ; G=(4,3) | R:(2,2) ; D:(3,2) ; R:(3,3) ; D:(4,3) |
sorting_algorithms | sorting_algorithms:insertion-sort | 0, 6, 8, 4, 7 | [0,6,8,4,7] ; [0,6,8,4,7] ; [0,4,6,8,7] ; [0,4,6,7,8] |
sorting_algorithms | sorting_algorithms:insertion-sort | 9, 3, 7, 8, 1 | [3,9,7,8,1] ; [3,7,9,8,1] ; [3,7,8,9,1] ; [1,3,7,8,9] |
sorting_algorithms | sorting_algorithms:selection-sort | 2, 7, 4, 5, 8 | [2,7,4,5,8] ; [2,4,7,5,8] ; [2,4,5,7,8] ; [2,4,5,7,8] |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(0,0) ; G=(3,5) | D:(1,0) ; D:(2,0) ; D:(3,0) ; R:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5) |
base_conversion | base_conversion:decomposition | n=127,base=8 | TERM:1*8^2=64 ; TERM:7*8^1=56 ; TERM:7*8^0=7 ; OUT:177 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(1,3) ; G=(2,4) | R:(1,4) ; D:(2,4) |
sorting_algorithms | sorting_algorithms:heap-sort | 6, 2, 9, 8, 3 | [6,8,9,2,3] ; [9,8,6,2,3] ; [3,8,6,2,9] ; [8,3,6,2,9] ; [2,3,6,8,9] ; [6,3,2,8,9] ; [2,3,6,8,9] ; [3,2,6,8,9] ; [2,3,6,8,9] |
base_conversion | base_conversion:decomposition | n=252,base=16 | TERM:15*16^1=240 ; TERM:12*16^0=12 ; OUT:FC |
sorting_algorithms | sorting_algorithms:merge-sort | 5, 9, 0, 1, 3 | [0,1,5,9,3] ; [0,1,3,5,9] |
multidigit_addition | multidigit_addition:rounding-decomposition | 539+929 | round:540+929=1469 ; adjust:1469-1=1468 ; sum=1468 |
list_summation | list_summation:right-to-left | 6, 8, 8, 8 | 8+8=16 ; 8+16=24 ; 6+24=30 |
multidigit_addition | multidigit_addition:rounding-decomposition | 849+475 | round:850+475=1325 ; adjust:1325-1=1324 ; sum=1324 |
list_summation | list_summation:left-to-right | 1, 5, 0, 2 | 1+5=6 ; 6+0=6 ; 6+2=8 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 5x+0=-15 | 5x+0=-15 ; x+0=-3 ; x=-3-0 ; x=-3 |
base_conversion | base_conversion:decomposition | n=103,base=8 | TERM:1*8^2=64 ; TERM:4*8^1=32 ; TERM:7*8^0=7 ; OUT:147 |
list_summation | list_summation:pairwise | 5, 6, 9, 0 | 5+6=11 ; 9+0=9 ; 11+9=20 |
linear_equation_solving | linear_equation_solving:inverse-ops | 8x-24=8 | 8x-24=8 ; x=(8--24)/8 ; x=32/8 ; x=4 |
sorting_algorithms | sorting_algorithms:heap-sort | 2, 7, 5, 9, 1 | [2,9,5,7,1] ; [9,2,5,7,1] ; [9,7,5,2,1] ; [1,7,5,2,9] ; [7,1,5,2,9] ; [7,2,5,1,9] ; [1,2,5,7,9] ; [5,2,1,7,9] ; [1,2,5,7,9] ; [2,1,5,7,9] ; [1,2,5,7,9] |
base_conversion | base_conversion:via-binary | n=26,base=2 | BINLEN:5 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:1 ; CHUNK:4:0 ; OUT:11010 |
multidigit_addition | multidigit_addition:right-to-left-carry | 887+662 | d2:7+2+0=9→w9,c0 ; d1:8+6+0=14→w4,c1 ; d0:8+6+1=15→w5,c1 ; sum=1549 |
list_summation | list_summation:pairwise | 6, 7, 9, 9 | 6+7=13 ; 9+9=18 ; 13+18=31 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 9x-81=0 | 9x-81=0 ; 9x=81 ; x=9 |
sorting_algorithms | sorting_algorithms:merge-sort | 0, 8, 4, 5, 9 | [0,4,5,8,9] |
linear_equation_solving | linear_equation_solving:inverse-ops | 4x+0=-28 | 4x+0=-28 ; x=(-28-0)/4 ; x=-28/4 ; x=-7 |
sorting_algorithms | sorting_algorithms:bubble-sort | 7, 3, 9, 8, 1 | [3,7,9,8,1] ; [3,7,8,9,1] ; [3,7,8,1,9] ; [3,7,1,8,9] ; [3,1,7,8,9] ; [1,3,7,8,9] |
base_conversion | base_conversion:via-binary | n=122,base=2 | BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:1 ; CHUNK:3:1 ; CHUNK:4:0 ; CHUNK:5:1 ; CHUNK:6:0 ; OUT:1111010 |
multidigit_addition | multidigit_addition:left-to-right-partials | 226+785 | p100:200+700=900 ; p10:20+80=100 ; p1:6+5=11 ; sum=900+100+11=1011 |
list_summation | list_summation:left-to-right | 6, 2, 3, 5 | 6+2=8 ; 8+3=11 ; 11+5=16 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 2x-2=-20 | 2x-2=-20 ; 2x=-18 ; x=-9 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.