task_name stringclasses 6
values | strategy_id stringclasses 20
values | input_text stringlengths 6 26 | reasoning_trace stringlengths 11 152 |
|---|---|---|---|
list_summation | list_summation:right-to-left | 1, 2, 2, 8 | 2+8=10 ; 2+10=12 ; 1+12=13 |
list_summation | list_summation:pairwise | 2, 1, 1, 1 | 2+1=3 ; 1+1=2 ; 3+2=5 |
multidigit_addition | multidigit_addition:right-to-left-carry | 176+905 | d2:6+5+0=11→w1,c1 ; d1:7+0+1=8→w8,c0 ; d0:1+9+0=10→w0,c1 ; sum=1081 |
sorting_algorithms | sorting_algorithms:insertion-sort | 4, 9, 1, 8, 2 | [4,9,1,8,2] ; [1,4,9,8,2] ; [1,4,8,9,2] ; [1,2,4,8,9] |
multidigit_addition | multidigit_addition:rounding-decomposition | 785+242 | round:790+242=1032 ; adjust:1032-5=1027 ; sum=1027 |
list_summation | list_summation:right-to-left | 3, 6, 3, 2 | 3+2=5 ; 6+5=11 ; 3+11=14 |
multidigit_addition | multidigit_addition:left-to-right-partials | 180+171 | p100:100+100=200 ; p10:80+70=150 ; p1:0+1=1 ; sum=200+150+1=351 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(0,2) ; G=(3,5) | R:(0,3) ; R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) |
base_conversion | base_conversion:via-binary | n=203,base=2 | BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:1 ; CHUNK:5:0 ; CHUNK:6:1 ; CHUNK:7:1 ; OUT:11001011 |
sorting_algorithms | sorting_algorithms:insertion-sort | 3, 2, 0, 5, 6 | [2,3,0,5,6] ; [0,2,3,5,6] ; [0,2,3,5,6] ; [0,2,3,5,6] |
sorting_algorithms | sorting_algorithms:heap-sort | 8, 7, 3, 9, 2 | [8,9,3,7,2] ; [9,8,3,7,2] ; [2,8,3,7,9] ; [8,2,3,7,9] ; [8,7,3,2,9] ; [2,7,3,8,9] ; [7,2,3,8,9] ; [3,2,7,8,9] ; [2,3,7,8,9] |
multidigit_addition | multidigit_addition:left-to-right-partials | 456+719 | p100:400+700=1100 ; p10:50+10=60 ; p1:6+9=15 ; sum=1100+60+15=1175 |
sorting_algorithms | sorting_algorithms:merge-sort | 6, 7, 8, 4, 0 | [6,7,4,8,0] ; [4,6,7,8,0] ; [0,4,6,7,8] |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 9x-9=-27 | 9x-9=-27 ; x+-1=-3 ; x=-3--1 ; x=-2 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(2,1) ; G=(5,2) | D:(3,1) ; D:(4,1) ; D:(5,1) ; R:(5,2) |
list_summation | list_summation:left-to-right | 3, 8, 5, 0 | 3+8=11 ; 11+5=16 ; 16+0=16 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 4x+8=40 | 4x+8=40 ; 4x=32 ; x=8 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(3,0) ; G=(4,4) | D:(4,0) ; R:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4) |
base_conversion | base_conversion:decomposition | n=252,base=2 | TERM:1*2^7=128 ; TERM:1*2^6=64 ; TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:1*2^3=8 ; TERM:1*2^2=4 ; TERM:0*2^1=0 ; TERM:0*2^0=0 ; OUT:11111100 |
base_conversion | base_conversion:decomposition | n=100,base=16 | TERM:6*16^1=96 ; TERM:4*16^0=4 ; OUT:64 |
multidigit_addition | multidigit_addition:left-to-right-partials | 360+331 | p100:300+300=600 ; p10:60+30=90 ; p1:0+1=1 ; sum=600+90+1=691 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 6x-12=36 | 6x-12=36 ; 6x=48 ; x=8 |
sorting_algorithms | sorting_algorithms:merge-sort | 9, 7, 3, 5, 2 | [7,9,3,5,2] ; [3,5,7,9,2] ; [2,3,5,7,9] |
multidigit_addition | multidigit_addition:left-to-right-partials | 558+156 | p100:500+100=600 ; p10:50+50=100 ; p1:8+6=14 ; sum=600+100+14=714 |
linear_equation_solving | linear_equation_solving:inverse-ops | 2x+14=18 | 2x+14=18 ; x=(18-14)/2 ; x=4/2 ; x=2 |
list_summation | list_summation:left-to-right | 8, 1, 1, 5 | 8+1=9 ; 9+1=10 ; 10+5=15 |
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) |
sorting_algorithms | sorting_algorithms:heap-sort | 8, 9, 2, 1, 7 | [9,8,2,1,7] ; [7,8,2,1,9] ; [8,7,2,1,9] ; [1,7,2,8,9] ; [7,1,2,8,9] ; [2,1,7,8,9] ; [1,2,7,8,9] |
base_conversion | base_conversion:repeated-division | n=73,base=4 | DIV:73/4=18,r:1 ; DIV:18/4=4,r:2 ; DIV:4/4=1,r:0 ; DIV:1/4=0,r:1 ; OUT:1021 |
base_conversion | base_conversion:repeated-division | n=186,base=8 | DIV:186/8=23,r:2 ; DIV:23/8=2,r:7 ; DIV:2/8=0,r:2 ; OUT:272 |
base_conversion | base_conversion:decomposition | n=196,base=4 | TERM:3*4^3=192 ; TERM:0*4^2=0 ; TERM:1*4^1=4 ; TERM:0*4^0=0 ; OUT:3010 |
list_summation | list_summation:right-to-left | 3, 9, 0, 5 | 0+5=5 ; 9+5=14 ; 3+14=17 |
sorting_algorithms | sorting_algorithms:heap-sort | 8, 3, 7, 1, 5 | [8,5,7,1,3] ; [3,5,7,1,8] ; [7,5,3,1,8] ; [1,5,3,7,8] ; [5,1,3,7,8] ; [3,1,5,7,8] ; [1,3,5,7,8] |
base_conversion | base_conversion:via-binary | n=138,base=16 | BINLEN:8 ; CHUNK:0:8 ; CHUNK:1:10 ; OUT:8A |
list_summation | list_summation:pairwise | 7, 4, 6, 1 | 7+4=11 ; 6+1=7 ; 11+7=18 |
sorting_algorithms | sorting_algorithms:insertion-sort | 7, 5, 8, 1, 2 | [5,7,8,1,2] ; [5,7,8,1,2] ; [1,5,7,8,2] ; [1,2,5,7,8] |
list_summation | list_summation:right-to-left | 7, 7, 7, 2 | 7+2=9 ; 7+9=16 ; 7+16=23 |
base_conversion | base_conversion:decomposition | n=161,base=8 | TERM:2*8^2=128 ; TERM:4*8^1=32 ; TERM:1*8^0=1 ; OUT:241 |
sorting_algorithms | sorting_algorithms:merge-sort | 3, 1, 0, 9, 8 | [1,3,0,9,8] ; [0,1,3,9,8] ; [0,1,3,8,9] |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(3,0) ; G=(5,2) | R:(3,1) ; R:(3,2) ; D:(4,2) ; D:(5,2) |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 3x+18=39 | 3x+18=39 ; x+6=13 ; x=13-6 ; x=7 |
list_summation | list_summation:right-to-left | 6, 5, 2, 0 | 2+0=2 ; 5+2=7 ; 6+7=13 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 4x+36=32 | 4x+36=32 ; 4x=-4 ; x=-1 |
list_summation | list_summation:left-to-right | 7, 1, 6, 4 | 7+1=8 ; 8+6=14 ; 14+4=18 |
base_conversion | base_conversion:via-binary | n=15,base=2 | BINLEN:4 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:1 ; CHUNK:3:1 ; OUT:1111 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 2x-10=-18 | 2x-10=-18 ; x+-5=-9 ; x=-9--5 ; x=-4 |
sorting_algorithms | sorting_algorithms:selection-sort | 7, 2, 0, 8, 3 | [0,2,7,8,3] ; [0,2,7,8,3] ; [0,2,3,8,7] ; [0,2,3,7,8] |
sorting_algorithms | sorting_algorithms:merge-sort | 9, 7, 4, 6, 0 | [7,9,4,6,0] ; [4,6,7,9,0] ; [0,4,6,7,9] |
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 | 966+354 | round:970+354=1324 ; adjust:1324-4=1320 ; sum=1320 |
base_conversion | base_conversion:repeated-division | n=22,base=8 | DIV:22/8=2,r:6 ; DIV:2/8=0,r:2 ; OUT:26 |
sorting_algorithms | sorting_algorithms:merge-sort | 9, 2, 3, 4, 7 | [2,9,3,4,7] ; [2,3,4,9,7] ; [2,3,4,7,9] |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 7x-49=-28 | 7x-49=-28 ; 7x=21 ; x=3 |
base_conversion | base_conversion:via-binary | n=180,base=8 | BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:6 ; CHUNK:2:4 ; OUT:264 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 5x+45=90 | 5x+45=90 ; x+9=18 ; x=18-9 ; x=9 |
sorting_algorithms | sorting_algorithms:insertion-sort | 3, 4, 6, 9, 5 | [3,4,6,9,5] ; [3,4,6,9,5] ; [3,4,6,9,5] ; [3,4,5,6,9] |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 4x+12=-24 | 4x+12=-24 ; 4x=-36 ; x=-9 |
list_summation | list_summation:left-to-right | 5, 9, 6, 9 | 5+9=14 ; 14+6=20 ; 20+9=29 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 7x-56=-119 | 7x-56=-119 ; x+-8=-17 ; x=-17--8 ; x=-9 |
multidigit_addition | multidigit_addition:rounding-decomposition | 815+282 | round:820+282=1102 ; adjust:1102-5=1097 ; sum=1097 |
list_summation | list_summation:right-to-left | 2, 0, 8, 9 | 8+9=17 ; 0+17=17 ; 2+17=19 |
sorting_algorithms | sorting_algorithms:insertion-sort | 4, 1, 3, 9, 8 | [1,4,3,9,8] ; [1,3,4,9,8] ; [1,3,4,9,8] ; [1,3,4,8,9] |
multidigit_addition | multidigit_addition:left-to-right-partials | 600+123 | p100:600+100=700 ; p10:0+20=20 ; p1:0+3=3 ; sum=700+20+3=723 |
base_conversion | base_conversion:decomposition | n=20,base=8 | TERM:2*8^1=16 ; TERM:4*8^0=4 ; OUT:24 |
multidigit_addition | multidigit_addition:left-to-right-partials | 965+959 | p100:900+900=1800 ; p10:60+50=110 ; p1:5+9=14 ; sum=1800+110+14=1924 |
linear_equation_solving | linear_equation_solving:inverse-ops | 8x-32=32 | 8x-32=32 ; x=(32--32)/8 ; x=64/8 ; x=8 |
multidigit_addition | multidigit_addition:left-to-right-partials | 288+840 | p100:200+800=1000 ; p10:80+40=120 ; p1:8+0=8 ; sum=1000+120+8=1128 |
list_summation | list_summation:right-to-left | 6, 3, 6, 0 | 6+0=6 ; 3+6=9 ; 6+9=15 |
list_summation | list_summation:pairwise | 3, 3, 9, 0 | 3+3=6 ; 9+0=9 ; 6+9=15 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(4,1) ; G=(5,3) | D:(5,1) ; R:(5,2) ; R:(5,3) |
linear_equation_solving | linear_equation_solving:inverse-ops | 8x+40=48 | 8x+40=48 ; x=(48-40)/8 ; x=8/8 ; x=1 |
base_conversion | base_conversion:via-binary | n=190,base=4 | BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:3 ; CHUNK:2:3 ; CHUNK:3:2 ; OUT:2332 |
base_conversion | base_conversion:repeated-division | n=101,base=16 | DIV:101/16=6,r:5 ; DIV:6/16=0,r:6 ; OUT:65 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(4,1) ; G=(5,4) | R:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4) |
multidigit_addition | multidigit_addition:left-to-right-partials | 473+691 | p100:400+600=1000 ; p10:70+90=160 ; p1:3+1=4 ; sum=1000+160+4=1164 |
multidigit_addition | multidigit_addition:rounding-decomposition | 496+388 | round:500+388=888 ; adjust:888-4=884 ; sum=884 |
base_conversion | base_conversion:via-binary | n=175,base=4 | BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:2 ; CHUNK:2:3 ; CHUNK:3:3 ; OUT:2233 |
base_conversion | base_conversion:decomposition | n=104,base=8 | TERM:1*8^2=64 ; TERM:5*8^1=40 ; TERM:0*8^0=0 ; OUT:150 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 7x+56=-7 | 7x+56=-7 ; x+8=-1 ; x=-1-8 ; x=-9 |
base_conversion | base_conversion:decomposition | n=243,base=8 | TERM:3*8^2=192 ; TERM:6*8^1=48 ; TERM:3*8^0=3 ; OUT:363 |
list_summation | list_summation:pairwise | 0, 4, 9, 3 | 0+4=4 ; 9+3=12 ; 4+12=16 |
list_summation | list_summation:pairwise | 3, 6, 4, 1 | 3+6=9 ; 4+1=5 ; 9+5=14 |
list_summation | list_summation:left-to-right | 1, 4, 8, 4 | 1+4=5 ; 5+8=13 ; 13+4=17 |
multidigit_addition | multidigit_addition:rounding-decomposition | 895+628 | round:900+628=1528 ; adjust:1528-5=1523 ; sum=1523 |
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) |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 8x-40=8 | 8x-40=8 ; 8x=48 ; x=6 |
linear_equation_solving | linear_equation_solving:inverse-ops | 2x-18=-32 | 2x-18=-32 ; x=(-32--18)/2 ; x=-14/2 ; x=-7 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 9x+27=27 | 9x+27=27 ; 9x=0 ; x=0 |
list_summation | list_summation:pairwise | 1, 1, 1, 9 | 1+1=2 ; 1+9=10 ; 2+10=12 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(3,0) ; G=(4,2) | D:(4,0) ; R:(4,1) ; R:(4,2) |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 5x-40=-20 | 5x-40=-20 ; 5x=20 ; x=4 |
sorting_algorithms | sorting_algorithms:bubble-sort | 7, 3, 5, 2, 0 | [3,7,5,2,0] ; [3,5,7,2,0] ; [3,5,2,7,0] ; [3,5,2,0,7] ; [3,2,5,0,7] ; [3,2,0,5,7] ; [2,3,0,5,7] ; [2,0,3,5,7] ; [0,2,3,5,7] |
base_conversion | base_conversion:decomposition | n=21,base=8 | TERM:2*8^1=16 ; TERM:5*8^0=5 ; OUT:25 |
multidigit_addition | multidigit_addition:right-to-left-carry | 756+983 | d2:6+3+0=9→w9,c0 ; d1:5+8+0=13→w3,c1 ; d0:7+9+1=17→w7,c1 ; sum=1739 |
base_conversion | base_conversion:decomposition | n=42,base=4 | TERM:2*4^2=32 ; TERM:2*4^1=8 ; TERM:2*4^0=2 ; OUT:222 |
list_summation | list_summation:pairwise | 9, 8, 2, 4 | 9+8=17 ; 2+4=6 ; 17+6=23 |
base_conversion | base_conversion:via-binary | n=225,base=8 | BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:4 ; CHUNK:2:1 ; OUT:341 |
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) |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(4,0) ; G=(5,2) | R:(4,1) ; D:(5,1) ; R:(5,2) |
sorting_algorithms | sorting_algorithms:heap-sort | 5, 7, 6, 8, 0 | [5,8,6,7,0] ; [8,5,6,7,0] ; [8,7,6,5,0] ; [0,7,6,5,8] ; [7,0,6,5,8] ; [7,5,6,0,8] ; [0,5,6,7,8] ; [6,5,0,7,8] ; [0,5,6,7,8] ; [5,0,6,7,8] ; [0,5,6,7,8] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.