task_name stringclasses 6
values | strategy_id stringclasses 20
values | input_text stringlengths 6 26 | reasoning_trace stringlengths 11 152 |
|---|---|---|---|
linear_equation_solving | linear_equation_solving:subtract-then-divide | 4x-32=-28 | 4x-32=-28 ; 4x=4 ; x=1 |
list_summation | list_summation:pairwise | 0, 1, 6, 5 | 0+1=1 ; 6+5=11 ; 1+11=12 |
list_summation | list_summation:left-to-right | 6, 9, 0, 0 | 6+9=15 ; 15+0=15 ; 15+0=15 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 2x-16=-14 | 2x-16=-14 ; x+-8=-7 ; x=-7--8 ; x=1 |
multidigit_addition | multidigit_addition:rounding-decomposition | 869+386 | round:870+386=1256 ; adjust:1256-1=1255 ; sum=1255 |
base_conversion | base_conversion:via-binary | n=73,base=8 | BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:1 ; OUT:111 |
base_conversion | base_conversion:decomposition | n=23,base=4 | TERM:1*4^2=16 ; TERM:1*4^1=4 ; TERM:3*4^0=3 ; OUT:113 |
list_summation | list_summation:pairwise | 0, 4, 8, 3 | 0+4=4 ; 8+3=11 ; 4+11=15 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(2,0) ; G=(3,1) | D:(3,0) ; R:(3,1) |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 4x+8=-20 | 4x+8=-20 ; 4x=-28 ; x=-7 |
multidigit_addition | multidigit_addition:right-to-left-carry | 519+916 | d2:9+6+0=15→w5,c1 ; d1:1+1+1=3→w3,c0 ; d0:5+9+0=14→w4,c1 ; sum=1435 |
base_conversion | base_conversion:via-binary | n=212,base=4 | BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:1 ; CHUNK:2:1 ; CHUNK:3:0 ; OUT:3110 |
sorting_algorithms | sorting_algorithms:heap-sort | 0, 2, 8, 4, 1 | [0,4,8,2,1] ; [8,4,0,2,1] ; [1,4,0,2,8] ; [4,1,0,2,8] ; [4,2,0,1,8] ; [1,2,0,4,8] ; [2,1,0,4,8] ; [0,1,2,4,8] ; [1,0,2,4,8] ; [0,1,2,4,8] |
base_conversion | base_conversion:repeated-division | n=13,base=16 | DIV:13/16=0,r:13 ; OUT:D |
sorting_algorithms | sorting_algorithms:selection-sort | 8, 9, 6, 4, 2 | [2,9,6,4,8] ; [2,4,6,9,8] ; [2,4,6,9,8] ; [2,4,6,8,9] |
sorting_algorithms | sorting_algorithms:selection-sort | 6, 9, 1, 5, 0 | [0,9,1,5,6] ; [0,1,9,5,6] ; [0,1,5,9,6] ; [0,1,5,6,9] |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(2,0) ; G=(3,5) | R:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5) ; D:(3,5) |
sorting_algorithms | sorting_algorithms:selection-sort | 5, 9, 1, 2, 8 | [1,9,5,2,8] ; [1,2,5,9,8] ; [1,2,5,9,8] ; [1,2,5,8,9] |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 8x+24=80 | 8x+24=80 ; x+3=10 ; x=10-3 ; x=7 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(3,1) ; G=(4,2) | D:(4,1) ; R:(4,2) |
sorting_algorithms | sorting_algorithms:selection-sort | 6, 3, 7, 4, 1 | [1,3,7,4,6] ; [1,3,7,4,6] ; [1,3,4,7,6] ; [1,3,4,6,7] |
multidigit_addition | multidigit_addition:left-to-right-partials | 268+816 | p100:200+800=1000 ; p10:60+10=70 ; p1:8+6=14 ; sum=1000+70+14=1084 |
sorting_algorithms | sorting_algorithms:selection-sort | 7, 3, 8, 1, 5 | [1,3,8,7,5] ; [1,3,8,7,5] ; [1,3,5,7,8] ; [1,3,5,7,8] |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(0,2) ; G=(1,3) | D:(1,2) ; R:(1,3) |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 8x+24=64 | 8x+24=64 ; 8x=40 ; x=5 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 7x-49=-42 | 7x-49=-42 ; 7x=7 ; x=1 |
multidigit_addition | multidigit_addition:rounding-decomposition | 432+262 | round:440+262=702 ; adjust:702-8=694 ; sum=694 |
base_conversion | base_conversion:decomposition | n=188,base=2 | TERM:1*2^7=128 ; TERM:0*2^6=0 ; 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:10111100 |
sorting_algorithms | sorting_algorithms:selection-sort | 1, 4, 7, 9, 5 | [1,4,7,9,5] ; [1,4,7,9,5] ; [1,4,5,9,7] ; [1,4,5,7,9] |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 6x+24=60 | 6x+24=60 ; x+4=10 ; x=10-4 ; x=6 |
base_conversion | base_conversion:repeated-division | n=218,base=16 | DIV:218/16=13,r:10 ; DIV:13/16=0,r:13 ; OUT:DA |
linear_equation_solving | linear_equation_solving:inverse-ops | 7x+56=-7 | 7x+56=-7 ; x=(-7-56)/7 ; x=-63/7 ; x=-9 |
base_conversion | base_conversion:via-binary | n=207,base=8 | BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:1 ; CHUNK:2:7 ; OUT:317 |
list_summation | list_summation:left-to-right | 0, 5, 7, 9 | 0+5=5 ; 5+7=12 ; 12+9=21 |
sorting_algorithms | sorting_algorithms:insertion-sort | 3, 0, 7, 1, 6 | [0,3,7,1,6] ; [0,3,7,1,6] ; [0,1,3,7,6] ; [0,1,3,6,7] |
list_summation | list_summation:pairwise | 8, 2, 1, 6 | 8+2=10 ; 1+6=7 ; 10+7=17 |
sorting_algorithms | sorting_algorithms:selection-sort | 8, 1, 0, 6, 2 | [0,1,8,6,2] ; [0,1,8,6,2] ; [0,1,2,6,8] ; [0,1,2,6,8] |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 8x-32=-24 | 8x-32=-24 ; 8x=8 ; x=1 |
base_conversion | base_conversion:via-binary | n=217,base=4 | BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:1 ; CHUNK:2:2 ; CHUNK:3:1 ; OUT:3121 |
base_conversion | base_conversion:decomposition | n=132,base=16 | TERM:8*16^1=128 ; TERM:4*16^0=4 ; OUT:84 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(2,1) ; G=(4,3) | R:(2,2) ; R:(2,3) ; D:(3,3) ; D:(4,3) |
sorting_algorithms | sorting_algorithms:heap-sort | 6, 2, 4, 8, 1 | [6,8,4,2,1] ; [8,6,4,2,1] ; [1,6,4,2,8] ; [6,1,4,2,8] ; [6,2,4,1,8] ; [1,2,4,6,8] ; [4,2,1,6,8] ; [1,2,4,6,8] ; [2,1,4,6,8] ; [1,2,4,6,8] |
base_conversion | base_conversion:repeated-division | n=91,base=8 | DIV:91/8=11,r:3 ; DIV:11/8=1,r:3 ; DIV:1/8=0,r:1 ; OUT:133 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 3x-15=-27 | 3x-15=-27 ; x+-5=-9 ; x=-9--5 ; x=-4 |
base_conversion | base_conversion:repeated-division | n=90,base=8 | DIV:90/8=11,r:2 ; DIV:11/8=1,r:3 ; DIV:1/8=0,r:1 ; OUT:132 |
sorting_algorithms | sorting_algorithms:merge-sort | 3, 5, 7, 2, 6 | [3,5,2,7,6] ; [2,3,5,7,6] ; [2,3,5,6,7] |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(4,1) ; G=(5,5) | R:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5) |
multidigit_addition | multidigit_addition:left-to-right-partials | 416+622 | p100:400+600=1000 ; p10:10+20=30 ; p1:6+2=8 ; sum=1000+30+8=1038 |
multidigit_addition | multidigit_addition:left-to-right-partials | 325+753 | p100:300+700=1000 ; p10:20+50=70 ; p1:5+3=8 ; sum=1000+70+8=1078 |
base_conversion | base_conversion:repeated-division | n=220,base=8 | DIV:220/8=27,r:4 ; DIV:27/8=3,r:3 ; DIV:3/8=0,r:3 ; OUT:334 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,0) ; G=(5,1) | R:(2,1) ; D:(3,1) ; D:(4,1) ; D:(5,1) |
sorting_algorithms | sorting_algorithms:insertion-sort | 0, 7, 4, 5, 6 | [0,7,4,5,6] ; [0,4,7,5,6] ; [0,4,5,7,6] ; [0,4,5,6,7] |
multidigit_addition | multidigit_addition:left-to-right-partials | 723+423 | p100:700+400=1100 ; p10:20+20=40 ; p1:3+3=6 ; sum=1100+40+6=1146 |
base_conversion | base_conversion:decomposition | n=195,base=16 | TERM:12*16^1=192 ; TERM:3*16^0=3 ; OUT:C3 |
list_summation | list_summation:left-to-right | 3, 8, 1, 1 | 3+8=11 ; 11+1=12 ; 12+1=13 |
sorting_algorithms | sorting_algorithms:bubble-sort | 5, 1, 0, 2, 8 | [1,5,0,2,8] ; [1,0,5,2,8] ; [1,0,2,5,8] ; [0,1,2,5,8] |
base_conversion | base_conversion:repeated-division | n=135,base=4 | DIV:135/4=33,r:3 ; DIV:33/4=8,r:1 ; DIV:8/4=2,r:0 ; DIV:2/4=0,r:2 ; OUT:2013 |
sorting_algorithms | sorting_algorithms:merge-sort | 2, 3, 7, 8, 4 | [2,3,4,7,8] |
list_summation | list_summation:left-to-right | 8, 0, 9, 8 | 8+0=8 ; 8+9=17 ; 17+8=25 |
multidigit_addition | multidigit_addition:left-to-right-partials | 988+255 | p100:900+200=1100 ; p10:80+50=130 ; p1:8+5=13 ; sum=1100+130+13=1243 |
list_summation | list_summation:pairwise | 8, 5, 7, 0 | 8+5=13 ; 7+0=7 ; 13+7=20 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(2,2) ; G=(5,4) | D:(3,2) ; D:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4) |
sorting_algorithms | sorting_algorithms:bubble-sort | 8, 9, 1, 0, 3 | [8,1,9,0,3] ; [8,1,0,9,3] ; [8,1,0,3,9] ; [1,8,0,3,9] ; [1,0,8,3,9] ; [1,0,3,8,9] ; [0,1,3,8,9] |
base_conversion | base_conversion:decomposition | n=175,base=8 | TERM:2*8^2=128 ; TERM:5*8^1=40 ; TERM:7*8^0=7 ; OUT:257 |
sorting_algorithms | sorting_algorithms:insertion-sort | 6, 4, 3, 9, 0 | [4,6,3,9,0] ; [3,4,6,9,0] ; [3,4,6,9,0] ; [0,3,4,6,9] |
base_conversion | base_conversion:decomposition | n=245,base=4 | TERM:3*4^3=192 ; TERM:3*4^2=48 ; TERM:1*4^1=4 ; TERM:1*4^0=1 ; OUT:3311 |
base_conversion | base_conversion:repeated-division | n=254,base=16 | DIV:254/16=15,r:14 ; DIV:15/16=0,r:15 ; OUT:FE |
sorting_algorithms | sorting_algorithms:selection-sort | 0, 8, 2, 3, 5 | [0,8,2,3,5] ; [0,2,8,3,5] ; [0,2,3,8,5] ; [0,2,3,5,8] |
multidigit_addition | multidigit_addition:right-to-left-carry | 594+956 | d2:4+6+0=10→w0,c1 ; d1:9+5+1=15→w5,c1 ; d0:5+9+1=15→w5,c1 ; sum=1550 |
sorting_algorithms | sorting_algorithms:bubble-sort | 0, 9, 6, 2, 4 | [0,6,9,2,4] ; [0,6,2,9,4] ; [0,6,2,4,9] ; [0,2,6,4,9] ; [0,2,4,6,9] |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(4,2) ; G=(5,4) | R:(4,3) ; D:(5,3) ; R:(5,4) |
list_summation | list_summation:left-to-right | 6, 5, 1, 2 | 6+5=11 ; 11+1=12 ; 12+2=14 |
linear_equation_solving | linear_equation_solving:inverse-ops | 9x+81=90 | 9x+81=90 ; x=(90-81)/9 ; x=9/9 ; x=1 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(4,4) ; G=(5,5) | R:(4,5) ; D:(5,5) |
sorting_algorithms | sorting_algorithms:merge-sort | 5, 2, 6, 9, 1 | [2,5,6,9,1] ; [1,2,5,6,9] |
linear_equation_solving | linear_equation_solving:inverse-ops | 3x+15=6 | 3x+15=6 ; x=(6-15)/3 ; x=-9/3 ; x=-3 |
list_summation | list_summation:left-to-right | 5, 7, 2, 4 | 5+7=12 ; 12+2=14 ; 14+4=18 |
sorting_algorithms | sorting_algorithms:bubble-sort | 7, 1, 9, 0, 8 | [1,7,9,0,8] ; [1,7,0,9,8] ; [1,7,0,8,9] ; [1,0,7,8,9] ; [0,1,7,8,9] |
sorting_algorithms | sorting_algorithms:merge-sort | 5, 6, 0, 1, 3 | [0,1,5,6,3] ; [0,1,3,5,6] |
sorting_algorithms | sorting_algorithms:bubble-sort | 3, 9, 0, 8, 7 | [3,0,9,8,7] ; [3,0,8,9,7] ; [3,0,8,7,9] ; [0,3,8,7,9] ; [0,3,7,8,9] |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(4,1) ; G=(5,5) | R:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5) ; D:(5,5) |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(0,4) ; G=(3,5) | R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 6x+0=24 | 6x+0=24 ; 6x=24 ; x=4 |
base_conversion | base_conversion:via-binary | n=85,base=8 | BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:2 ; CHUNK:2:5 ; OUT:125 |
base_conversion | base_conversion:decomposition | n=119,base=8 | TERM:1*8^2=64 ; TERM:6*8^1=48 ; TERM:7*8^0=7 ; OUT:167 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(2,1) ; G=(3,5) | R:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5) ; D:(3,5) |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(0,3) ; G=(2,4) | R:(0,4) ; D:(1,4) ; D:(2,4) |
list_summation | list_summation:right-to-left | 3, 1, 3, 0 | 3+0=3 ; 1+3=4 ; 3+4=7 |
sorting_algorithms | sorting_algorithms:merge-sort | 9, 1, 7, 8, 4 | [1,9,7,8,4] ; [1,7,8,9,4] ; [1,4,7,8,9] |
list_summation | list_summation:right-to-left | 2, 0, 1, 3 | 1+3=4 ; 0+4=4 ; 2+4=6 |
linear_equation_solving | linear_equation_solving:inverse-ops | 2x-18=0 | 2x-18=0 ; x=(0--18)/2 ; x=18/2 ; x=9 |
list_summation | list_summation:pairwise | 2, 7, 7, 4 | 2+7=9 ; 7+4=11 ; 9+11=20 |
sorting_algorithms | sorting_algorithms:insertion-sort | 2, 7, 3, 8, 0 | [2,7,3,8,0] ; [2,3,7,8,0] ; [2,3,7,8,0] ; [0,2,3,7,8] |
sorting_algorithms | sorting_algorithms:merge-sort | 8, 5, 2, 4, 1 | [5,8,2,4,1] ; [2,4,5,8,1] ; [1,2,4,5,8] |
list_summation | list_summation:pairwise | 4, 8, 2, 7 | 4+8=12 ; 2+7=9 ; 12+9=21 |
multidigit_addition | multidigit_addition:rounding-decomposition | 403+725 | round:410+725=1135 ; adjust:1135-7=1128 ; sum=1128 |
multidigit_addition | multidigit_addition:right-to-left-carry | 848+874 | d2:8+4+0=12→w2,c1 ; d1:4+7+1=12→w2,c1 ; d0:8+8+1=17→w7,c1 ; sum=1722 |
list_summation | list_summation:left-to-right | 7, 8, 9, 0 | 7+8=15 ; 15+9=24 ; 24+0=24 |
base_conversion | base_conversion:decomposition | n=109,base=8 | TERM:1*8^2=64 ; TERM:5*8^1=40 ; TERM:5*8^0=5 ; OUT:155 |
base_conversion | base_conversion:decomposition | n=255,base=8 | TERM:3*8^2=192 ; TERM:7*8^1=56 ; TERM:7*8^0=7 ; OUT:377 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.