task_name stringclasses 6
values | strategy_id stringclasses 20
values | input_text stringlengths 6 26 | reasoning_trace stringlengths 11 152 |
|---|---|---|---|
multidigit_addition | multidigit_addition:right-to-left-carry | 747+321 | d2:7+1+0=8→w8,c0 ; d1:4+2+0=6→w6,c0 ; d0:7+3+0=10→w0,c1 ; sum=1068 |
sorting_algorithms | sorting_algorithms:bubble-sort | 0, 7, 6, 2, 1 | [0,6,7,2,1] ; [0,6,2,7,1] ; [0,6,2,1,7] ; [0,2,6,1,7] ; [0,2,1,6,7] ; [0,1,2,6,7] |
list_summation | list_summation:left-to-right | 6, 1, 1, 8 | 6+1=7 ; 7+1=8 ; 8+8=16 |
base_conversion | base_conversion:repeated-division | n=6,base=2 | DIV:6/2=3,r:0 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:110 |
list_summation | list_summation:right-to-left | 0, 6, 7, 5 | 7+5=12 ; 6+12=18 ; 0+18=18 |
base_conversion | base_conversion:decomposition | n=178,base=2 | TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:0*2^3=0 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:10110010 |
sorting_algorithms | sorting_algorithms:selection-sort | 1, 0, 9, 7, 8 | [0,1,9,7,8] ; [0,1,9,7,8] ; [0,1,7,9,8] ; [0,1,7,8,9] |
sorting_algorithms | sorting_algorithms:bubble-sort | 3, 8, 5, 9, 6 | [3,5,8,9,6] ; [3,5,8,6,9] ; [3,5,6,8,9] |
multidigit_addition | multidigit_addition:right-to-left-carry | 586+151 | d2:6+1+0=7→w7,c0 ; d1:8+5+0=13→w3,c1 ; d0:5+1+1=7→w7,c0 ; sum=737 |
sorting_algorithms | sorting_algorithms:bubble-sort | 1, 8, 4, 0, 2 | [1,4,8,0,2] ; [1,4,0,8,2] ; [1,4,0,2,8] ; [1,0,4,2,8] ; [1,0,2,4,8] ; [0,1,2,4,8] |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(3,3) ; G=(4,5) | R:(3,4) ; R:(3,5) ; D:(4,5) |
multidigit_addition | multidigit_addition:right-to-left-carry | 978+367 | d2:8+7+0=15→w5,c1 ; d1:7+6+1=14→w4,c1 ; d0:9+3+1=13→w3,c1 ; sum=1345 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(0,2) ; G=(5,5) | D:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5) |
linear_equation_solving | linear_equation_solving:inverse-ops | 4x+20=52 | 4x+20=52 ; x=(52-20)/4 ; x=32/4 ; x=8 |
list_summation | list_summation:left-to-right | 6, 5, 3, 4 | 6+5=11 ; 11+3=14 ; 14+4=18 |
base_conversion | base_conversion:decomposition | n=179,base=2 | TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:0*2^3=0 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:10110011 |
list_summation | list_summation:left-to-right | 3, 1, 7, 6 | 3+1=4 ; 4+7=11 ; 11+6=17 |
linear_equation_solving | linear_equation_solving:inverse-ops | 8x-24=-48 | 8x-24=-48 ; x=(-48--24)/8 ; x=-24/8 ; x=-3 |
list_summation | list_summation:pairwise | 8, 1, 6, 4 | 8+1=9 ; 6+4=10 ; 9+10=19 |
base_conversion | base_conversion:via-binary | n=252,base=16 | BINLEN:8 ; CHUNK:0:15 ; CHUNK:1:12 ; OUT:FC |
multidigit_addition | multidigit_addition:left-to-right-partials | 323+428 | p100:300+400=700 ; p10:20+20=40 ; p1:3+8=11 ; sum=700+40+11=751 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(4,3) ; G=(5,5) | R:(4,4) ; D:(5,4) ; R:(5,5) |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(0,3) ; G=(1,4) | R:(0,4) ; D:(1,4) |
base_conversion | base_conversion:decomposition | n=31,base=4 | TERM:1*4^2=16 ; TERM:3*4^1=12 ; TERM:3*4^0=3 ; OUT:133 |
list_summation | list_summation:pairwise | 7, 8, 9, 1 | 7+8=15 ; 9+1=10 ; 15+10=25 |
list_summation | list_summation:left-to-right | 5, 4, 8, 3 | 5+4=9 ; 9+8=17 ; 17+3=20 |
multidigit_addition | multidigit_addition:rounding-decomposition | 612+309 | round:620+309=929 ; adjust:929-8=921 ; sum=921 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(1,2) ; G=(5,5) | R:(1,3) ; D:(2,3) ; R:(2,4) ; D:(3,4) ; R:(3,5) ; D:(4,5) ; D:(5,5) |
linear_equation_solving | linear_equation_solving:inverse-ops | 6x-54=-108 | 6x-54=-108 ; x=(-108--54)/6 ; x=-54/6 ; x=-9 |
sorting_algorithms | sorting_algorithms:bubble-sort | 3, 9, 2, 4, 6 | [3,2,9,4,6] ; [3,2,4,9,6] ; [3,2,4,6,9] ; [2,3,4,6,9] |
list_summation | list_summation:right-to-left | 5, 0, 2, 5 | 2+5=7 ; 0+7=7 ; 5+7=12 |
list_summation | list_summation:right-to-left | 4, 4, 6, 0 | 6+0=6 ; 4+6=10 ; 4+10=14 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(1,2) ; G=(5,5) | R:(1,3) ; R:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5) |
list_summation | list_summation:left-to-right | 4, 6, 4, 7 | 4+6=10 ; 10+4=14 ; 14+7=21 |
sorting_algorithms | sorting_algorithms:heap-sort | 7, 8, 1, 6, 2 | [8,7,1,6,2] ; [2,7,1,6,8] ; [7,2,1,6,8] ; [7,6,1,2,8] ; [2,6,1,7,8] ; [6,2,1,7,8] ; [1,2,6,7,8] ; [2,1,6,7,8] ; [1,2,6,7,8] |
sorting_algorithms | sorting_algorithms:selection-sort | 0, 7, 9, 4, 2 | [0,7,9,4,2] ; [0,2,9,4,7] ; [0,2,4,9,7] ; [0,2,4,7,9] |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(2,3) ; G=(4,4) | R:(2,4) ; D:(3,4) ; D:(4,4) |
linear_equation_solving | linear_equation_solving:inverse-ops | 7x-63=-98 | 7x-63=-98 ; x=(-98--63)/7 ; x=-35/7 ; x=-5 |
list_summation | list_summation:pairwise | 1, 0, 0, 4 | 1+0=1 ; 0+4=4 ; 1+4=5 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(1,2) ; G=(2,5) | D:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5) |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(2,4) ; G=(5,5) | R:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5) |
linear_equation_solving | linear_equation_solving:inverse-ops | 8x+16=64 | 8x+16=64 ; x=(64-16)/8 ; x=48/8 ; x=6 |
sorting_algorithms | sorting_algorithms:heap-sort | 9, 0, 5, 7, 4 | [9,7,5,0,4] ; [4,7,5,0,9] ; [7,4,5,0,9] ; [0,4,5,7,9] ; [5,4,0,7,9] ; [0,4,5,7,9] ; [4,0,5,7,9] ; [0,4,5,7,9] |
list_summation | list_summation:right-to-left | 5, 9, 1, 7 | 1+7=8 ; 9+8=17 ; 5+17=22 |
list_summation | list_summation:right-to-left | 6, 6, 8, 2 | 8+2=10 ; 6+10=16 ; 6+16=22 |
base_conversion | base_conversion:via-binary | n=190,base=2 | BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:1 ; CHUNK:4:1 ; CHUNK:5:1 ; CHUNK:6:1 ; CHUNK:7:0 ; OUT:10111110 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,1) ; G=(5,5) | R:(2,2) ; D:(3,2) ; R:(3,3) ; D:(4,3) ; R:(4,4) ; D:(5,4) ; R:(5,5) |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 6x-24=18 | 6x-24=18 ; x+-4=3 ; x=3--4 ; x=7 |
sorting_algorithms | sorting_algorithms:bubble-sort | 5, 1, 0, 6, 9 | [1,5,0,6,9] ; [1,0,5,6,9] ; [0,1,5,6,9] |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(0,1) ; G=(4,3) | D:(1,1) ; D:(2,1) ; D:(3,1) ; D:(4,1) ; R:(4,2) ; R:(4,3) |
sorting_algorithms | sorting_algorithms:insertion-sort | 4, 0, 9, 3, 5 | [0,4,9,3,5] ; [0,4,9,3,5] ; [0,3,4,9,5] ; [0,3,4,5,9] |
multidigit_addition | multidigit_addition:rounding-decomposition | 179+775 | round:180+775=955 ; adjust:955-1=954 ; sum=954 |
list_summation | list_summation:pairwise | 2, 0, 4, 8 | 2+0=2 ; 4+8=12 ; 2+12=14 |
base_conversion | base_conversion:decomposition | n=192,base=16 | TERM:12*16^1=192 ; TERM:0*16^0=0 ; OUT:C0 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 8x+0=-48 | 8x+0=-48 ; x+0=-6 ; x=-6-0 ; x=-6 |
base_conversion | base_conversion:via-binary | n=118,base=2 | BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:1 ; CHUNK:3:0 ; CHUNK:4:1 ; CHUNK:5:1 ; CHUNK:6:0 ; OUT:1110110 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 3x-9=-6 | 3x-9=-6 ; 3x=3 ; x=1 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(0,2) ; G=(4,4) | D:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4) |
multidigit_addition | multidigit_addition:right-to-left-carry | 555+487 | d2:5+7+0=12→w2,c1 ; d1:5+8+1=14→w4,c1 ; d0:5+4+1=10→w0,c1 ; sum=1042 |
list_summation | list_summation:left-to-right | 2, 1, 9, 2 | 2+1=3 ; 3+9=12 ; 12+2=14 |
sorting_algorithms | sorting_algorithms:insertion-sort | 6, 9, 8, 1, 2 | [6,9,8,1,2] ; [6,8,9,1,2] ; [1,6,8,9,2] ; [1,2,6,8,9] |
list_summation | list_summation:pairwise | 8, 9, 6, 4 | 8+9=17 ; 6+4=10 ; 17+10=27 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(1,4) ; G=(4,5) | D:(2,4) ; D:(3,4) ; D:(4,4) ; R:(4,5) |
list_summation | list_summation:right-to-left | 3, 1, 0, 8 | 0+8=8 ; 1+8=9 ; 3+9=12 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(4,3) ; G=(5,4) | D:(5,3) ; R:(5,4) |
list_summation | list_summation:pairwise | 7, 7, 6, 6 | 7+7=14 ; 6+6=12 ; 14+12=26 |
multidigit_addition | multidigit_addition:right-to-left-carry | 950+135 | d2:0+5+0=5→w5,c0 ; d1:5+3+0=8→w8,c0 ; d0:9+1+0=10→w0,c1 ; sum=1085 |
multidigit_addition | multidigit_addition:right-to-left-carry | 880+992 | d2:0+2+0=2→w2,c0 ; d1:8+9+0=17→w7,c1 ; d0:8+9+1=18→w8,c1 ; sum=1872 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(3,1) ; G=(4,2) | D:(4,1) ; R:(4,2) |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(1,2) ; G=(5,4) | D:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4) |
list_summation | list_summation:pairwise | 5, 8, 4, 2 | 5+8=13 ; 4+2=6 ; 13+6=19 |
list_summation | list_summation:pairwise | 7, 9, 6, 3 | 7+9=16 ; 6+3=9 ; 16+9=25 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(3,0) ; G=(5,2) | R:(3,1) ; D:(4,1) ; R:(4,2) ; D:(5,2) |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 3x+21=-6 | 3x+21=-6 ; 3x=-27 ; x=-9 |
list_summation | list_summation:right-to-left | 7, 9, 3, 2 | 3+2=5 ; 9+5=14 ; 7+14=21 |
linear_equation_solving | linear_equation_solving:inverse-ops | 9x-18=-18 | 9x-18=-18 ; x=(-18--18)/9 ; x=0/9 ; x=0 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(1,0) ; G=(2,1) | D:(2,0) ; R:(2,1) |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(0,3) ; G=(3,4) | D:(1,3) ; D:(2,3) ; D:(3,3) ; R:(3,4) |
base_conversion | base_conversion:via-binary | n=198,base=16 | BINLEN:8 ; CHUNK:0:12 ; CHUNK:1:6 ; OUT:C6 |
linear_equation_solving | linear_equation_solving:inverse-ops | 9x-72=-18 | 9x-72=-18 ; x=(-18--72)/9 ; x=54/9 ; x=6 |
sorting_algorithms | sorting_algorithms:bubble-sort | 5, 1, 2, 3, 7 | [1,5,2,3,7] ; [1,2,5,3,7] ; [1,2,3,5,7] |
sorting_algorithms | sorting_algorithms:heap-sort | 0, 8, 3, 1, 7 | [8,0,3,1,7] ; [8,7,3,1,0] ; [0,7,3,1,8] ; [7,0,3,1,8] ; [7,1,3,0,8] ; [0,1,3,7,8] ; [3,1,0,7,8] ; [0,1,3,7,8] ; [1,0,3,7,8] ; [0,1,3,7,8] |
list_summation | list_summation:left-to-right | 5, 8, 2, 4 | 5+8=13 ; 13+2=15 ; 15+4=19 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(1,2) ; G=(2,4) | D:(2,2) ; R:(2,3) ; R:(2,4) |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(1,0) ; G=(2,4) | R:(1,1) ; R:(1,2) ; R:(1,3) ; R:(1,4) ; D:(2,4) |
base_conversion | base_conversion:via-binary | n=186,base=16 | BINLEN:8 ; CHUNK:0:11 ; CHUNK:1:10 ; OUT:BA |
list_summation | list_summation:left-to-right | 3, 5, 4, 8 | 3+5=8 ; 8+4=12 ; 12+8=20 |
list_summation | list_summation:left-to-right | 4, 8, 7, 3 | 4+8=12 ; 12+7=19 ; 19+3=22 |
sorting_algorithms | sorting_algorithms:heap-sort | 1, 3, 7, 8, 4 | [1,8,7,3,4] ; [8,1,7,3,4] ; [8,4,7,3,1] ; [1,4,7,3,8] ; [7,4,1,3,8] ; [3,4,1,7,8] ; [4,3,1,7,8] ; [1,3,4,7,8] ; [3,1,4,7,8] ; [1,3,4,7,8] |
linear_equation_solving | linear_equation_solving:inverse-ops | 8x-56=16 | 8x-56=16 ; x=(16--56)/8 ; x=72/8 ; x=9 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,4) ; G=(3,5) | R:(2,5) ; D:(3,5) |
multidigit_addition | multidigit_addition:right-to-left-carry | 311+586 | d2:1+6+0=7→w7,c0 ; d1:1+8+0=9→w9,c0 ; d0:3+5+0=8→w8,c0 ; sum=897 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(1,0) ; G=(3,4) | R:(1,1) ; D:(2,1) ; R:(2,2) ; D:(3,2) ; R:(3,3) ; R:(3,4) |
sorting_algorithms | sorting_algorithms:insertion-sort | 0, 7, 3, 5, 1 | [0,7,3,5,1] ; [0,3,7,5,1] ; [0,3,5,7,1] ; [0,1,3,5,7] |
list_summation | list_summation:left-to-right | 5, 2, 9, 9 | 5+2=7 ; 7+9=16 ; 16+9=25 |
list_summation | list_summation:right-to-left | 2, 4, 2, 7 | 2+7=9 ; 4+9=13 ; 2+13=15 |
base_conversion | base_conversion:decomposition | n=118,base=4 | TERM:1*4^3=64 ; TERM:3*4^2=48 ; TERM:1*4^1=4 ; TERM:2*4^0=2 ; OUT:1312 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(0,0) ; G=(2,4) | D:(1,0) ; D:(2,0) ; R:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4) |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 4x-8=4 | 4x-8=4 ; 4x=12 ; x=3 |
multidigit_addition | multidigit_addition:rounding-decomposition | 475+235 | round:480+235=715 ; adjust:715-5=710 ; sum=710 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.