task_name stringclasses 6
values | strategy_id stringclasses 20
values | input_text stringlengths 6 26 | reasoning_trace stringlengths 11 152 |
|---|---|---|---|
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(2,3) ; G=(5,4) | D:(3,3) ; D:(4,3) ; D:(5,3) ; R:(5,4) |
base_conversion | base_conversion:via-binary | n=22,base=4 | BINLEN:5 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:2 ; OUT:112 |
list_summation | list_summation:left-to-right | 4, 6, 4, 7 | 4+6=10 ; 10+4=14 ; 14+7=21 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 7x+0=42 | 7x+0=42 ; 7x=42 ; x=6 |
linear_equation_solving | linear_equation_solving:inverse-ops | 9x+9=-45 | 9x+9=-45 ; x=(-45-9)/9 ; x=-54/9 ; x=-6 |
multidigit_addition | multidigit_addition:left-to-right-partials | 544+280 | p100:500+200=700 ; p10:40+80=120 ; p1:4+0=4 ; sum=700+120+4=824 |
sorting_algorithms | sorting_algorithms:selection-sort | 0, 8, 2, 5, 9 | [0,8,2,5,9] ; [0,2,8,5,9] ; [0,2,5,8,9] ; [0,2,5,8,9] |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 8x-40=-72 | 8x-40=-72 ; 8x=-32 ; x=-4 |
list_summation | list_summation:pairwise | 8, 8, 9, 4 | 8+8=16 ; 9+4=13 ; 16+13=29 |
sorting_algorithms | sorting_algorithms:selection-sort | 3, 4, 8, 0, 9 | [0,4,8,3,9] ; [0,3,8,4,9] ; [0,3,4,8,9] ; [0,3,4,8,9] |
list_summation | list_summation:right-to-left | 8, 3, 7, 6 | 7+6=13 ; 3+13=16 ; 8+16=24 |
multidigit_addition | multidigit_addition:right-to-left-carry | 449+238 | d2:9+8+0=17→w7,c1 ; d1:4+3+1=8→w8,c0 ; d0:4+2+0=6→w6,c0 ; sum=687 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(4,4) ; G=(5,5) | R:(4,5) ; D:(5,5) |
multidigit_addition | multidigit_addition:left-to-right-partials | 883+780 | p100:800+700=1500 ; p10:80+80=160 ; p1:3+0=3 ; sum=1500+160+3=1663 |
base_conversion | base_conversion:repeated-division | n=105,base=4 | DIV:105/4=26,r:1 ; DIV:26/4=6,r:2 ; DIV:6/4=1,r:2 ; DIV:1/4=0,r:1 ; OUT:1221 |
multidigit_addition | multidigit_addition:rounding-decomposition | 352+483 | round:360+483=843 ; adjust:843-8=835 ; sum=835 |
sorting_algorithms | sorting_algorithms:insertion-sort | 2, 0, 7, 4, 1 | [0,2,7,4,1] ; [0,2,7,4,1] ; [0,2,4,7,1] ; [0,1,2,4,7] |
list_summation | list_summation:pairwise | 3, 0, 7, 9 | 3+0=3 ; 7+9=16 ; 3+16=19 |
multidigit_addition | multidigit_addition:left-to-right-partials | 986+907 | p100:900+900=1800 ; p10:80+0=80 ; p1:6+7=13 ; sum=1800+80+13=1893 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(1,2) ; G=(5,3) | R:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3) ; D:(5,3) |
base_conversion | base_conversion:repeated-division | n=213,base=8 | DIV:213/8=26,r:5 ; DIV:26/8=3,r:2 ; DIV:3/8=0,r:3 ; OUT:325 |
list_summation | list_summation:pairwise | 9, 5, 3, 2 | 9+5=14 ; 3+2=5 ; 14+5=19 |
list_summation | list_summation:pairwise | 4, 1, 1, 4 | 4+1=5 ; 1+4=5 ; 5+5=10 |
linear_equation_solving | linear_equation_solving:inverse-ops | 4x-16=-32 | 4x-16=-32 ; x=(-32--16)/4 ; x=-16/4 ; x=-4 |
list_summation | list_summation:left-to-right | 7, 8, 2, 9 | 7+8=15 ; 15+2=17 ; 17+9=26 |
base_conversion | base_conversion:decomposition | n=208,base=8 | TERM:3*8^2=192 ; TERM:2*8^1=16 ; TERM:0*8^0=0 ; OUT:320 |
base_conversion | base_conversion:repeated-division | n=223,base=2 | DIV:223/2=111,r:1 ; DIV:111/2=55,r:1 ; DIV:55/2=27,r:1 ; DIV:27/2=13,r:1 ; DIV:13/2=6,r:1 ; DIV:6/2=3,r:0 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:11011111 |
list_summation | list_summation:left-to-right | 0, 3, 6, 9 | 0+3=3 ; 3+6=9 ; 9+9=18 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(4,1) ; G=(5,4) | D:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,2) ; G=(5,3) | R:(2,3) ; D:(3,3) ; D:(4,3) ; D:(5,3) |
list_summation | list_summation:right-to-left | 5, 9, 3, 7 | 3+7=10 ; 9+10=19 ; 5+19=24 |
sorting_algorithms | sorting_algorithms:insertion-sort | 9, 5, 1, 8, 3 | [5,9,1,8,3] ; [1,5,9,8,3] ; [1,5,8,9,3] ; [1,3,5,8,9] |
multidigit_addition | multidigit_addition:rounding-decomposition | 212+651 | round:220+651=871 ; adjust:871-8=863 ; sum=863 |
base_conversion | base_conversion:via-binary | n=229,base=16 | BINLEN:8 ; CHUNK:0:14 ; CHUNK:1:5 ; OUT:E5 |
list_summation | list_summation:right-to-left | 4, 2, 5, 1 | 5+1=6 ; 2+6=8 ; 4+8=12 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 3x-12=-36 | 3x-12=-36 ; x+-4=-12 ; x=-12--4 ; x=-8 |
list_summation | list_summation:right-to-left | 7, 7, 8, 3 | 8+3=11 ; 7+11=18 ; 7+18=25 |
sorting_algorithms | sorting_algorithms:bubble-sort | 7, 9, 5, 2, 0 | [7,5,9,2,0] ; [7,5,2,9,0] ; [7,5,2,0,9] ; [5,7,2,0,9] ; [5,2,7,0,9] ; [5,2,0,7,9] ; [2,5,0,7,9] ; [2,0,5,7,9] ; [0,2,5,7,9] |
sorting_algorithms | sorting_algorithms:bubble-sort | 2, 8, 6, 5, 4 | [2,6,8,5,4] ; [2,6,5,8,4] ; [2,6,5,4,8] ; [2,5,6,4,8] ; [2,5,4,6,8] ; [2,4,5,6,8] |
multidigit_addition | multidigit_addition:right-to-left-carry | 665+152 | d2:5+2+0=7→w7,c0 ; d1:6+5+0=11→w1,c1 ; d0:6+1+1=8→w8,c0 ; sum=817 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(1,0) ; G=(5,5) | R:(1,1) ; D:(2,1) ; R:(2,2) ; D:(3,2) ; R:(3,3) ; D:(4,3) ; R:(4,4) ; D:(5,4) ; R:(5,5) |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(0,3) ; G=(1,4) | R:(0,4) ; D:(1,4) |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(3,3) ; G=(4,5) | R:(3,4) ; R:(3,5) ; D:(4,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) |
sorting_algorithms | sorting_algorithms:insertion-sort | 6, 9, 0, 3, 5 | [6,9,0,3,5] ; [0,6,9,3,5] ; [0,3,6,9,5] ; [0,3,5,6,9] |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(3,1) ; G=(5,2) | R:(3,2) ; D:(4,2) ; D:(5,2) |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 5x+0=10 | 5x+0=10 ; 5x=10 ; x=2 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 4x-24=-20 | 4x-24=-20 ; x+-6=-5 ; x=-5--6 ; x=1 |
multidigit_addition | multidigit_addition:right-to-left-carry | 537+953 | d2:7+3+0=10→w0,c1 ; d1:3+5+1=9→w9,c0 ; d0:5+9+0=14→w4,c1 ; sum=1490 |
list_summation | list_summation:pairwise | 7, 8, 0, 3 | 7+8=15 ; 0+3=3 ; 15+3=18 |
base_conversion | base_conversion:via-binary | n=77,base=2 | BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:0 ; CHUNK:3:1 ; CHUNK:4:1 ; CHUNK:5:0 ; CHUNK:6:1 ; OUT:1001101 |
list_summation | list_summation:pairwise | 0, 7, 7, 6 | 0+7=7 ; 7+6=13 ; 7+13=20 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(3,2) ; G=(4,5) | R:(3,3) ; D:(4,3) ; R:(4,4) ; R:(4,5) |
list_summation | list_summation:right-to-left | 1, 0, 9, 6 | 9+6=15 ; 0+15=15 ; 1+15=16 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(3,1) ; G=(5,3) | R:(3,2) ; D:(4,2) ; R:(4,3) ; D:(5,3) |
list_summation | list_summation:left-to-right | 6, 4, 4, 7 | 6+4=10 ; 10+4=14 ; 14+7=21 |
sorting_algorithms | sorting_algorithms:heap-sort | 2, 9, 5, 6, 1 | [9,2,5,6,1] ; [9,6,5,2,1] ; [1,6,5,2,9] ; [6,1,5,2,9] ; [6,2,5,1,9] ; [1,2,5,6,9] ; [5,2,1,6,9] ; [1,2,5,6,9] ; [2,1,5,6,9] ; [1,2,5,6,9] |
linear_equation_solving | linear_equation_solving:inverse-ops | 3x-12=-9 | 3x-12=-9 ; x=(-9--12)/3 ; x=3/3 ; x=1 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(0,1) ; G=(2,4) | R:(0,2) ; D:(1,2) ; R:(1,3) ; D:(2,3) ; R:(2,4) |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(0,4) ; G=(5,5) | R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5) |
list_summation | list_summation:right-to-left | 5, 7, 5, 1 | 5+1=6 ; 7+6=13 ; 5+13=18 |
base_conversion | base_conversion:repeated-division | n=85,base=16 | DIV:85/16=5,r:5 ; DIV:5/16=0,r:5 ; OUT:55 |
list_summation | list_summation:right-to-left | 1, 4, 1, 4 | 1+4=5 ; 4+5=9 ; 1+9=10 |
list_summation | list_summation:right-to-left | 1, 8, 5, 0 | 5+0=5 ; 8+5=13 ; 1+13=14 |
sorting_algorithms | sorting_algorithms:merge-sort | 9, 3, 0, 4, 7 | [3,9,0,4,7] ; [0,3,4,9,7] ; [0,3,4,7,9] |
multidigit_addition | multidigit_addition:right-to-left-carry | 994+903 | d2:4+3+0=7→w7,c0 ; d1:9+0+0=9→w9,c0 ; d0:9+9+0=18→w8,c1 ; sum=1897 |
sorting_algorithms | sorting_algorithms:heap-sort | 3, 5, 4, 8, 6 | [3,8,4,5,6] ; [8,3,4,5,6] ; [8,6,4,5,3] ; [3,6,4,5,8] ; [6,3,4,5,8] ; [6,5,4,3,8] ; [3,5,4,6,8] ; [5,3,4,6,8] ; [4,3,5,6,8] ; [3,4,5,6,8] |
base_conversion | base_conversion:via-binary | n=32,base=8 | BINLEN:6 ; CHUNK:0:4 ; CHUNK:1:0 ; OUT:40 |
multidigit_addition | multidigit_addition:right-to-left-carry | 822+153 | d2:2+3+0=5→w5,c0 ; d1:2+5+0=7→w7,c0 ; d0:8+1+0=9→w9,c0 ; sum=975 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,2) ; G=(5,5) | R:(2,3) ; D:(3,3) ; R:(3,4) ; D:(4,4) ; R:(4,5) ; D:(5,5) |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 9x+9=9 | 9x+9=9 ; 9x=0 ; x=0 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 5x+35=15 | 5x+35=15 ; x+7=3 ; x=3-7 ; x=-4 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(3,0) ; G=(5,4) | D:(4,0) ; D:(5,0) ; R:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(4,4) ; G=(5,5) | R:(4,5) ; D:(5,5) |
list_summation | list_summation:right-to-left | 1, 6, 8, 0 | 8+0=8 ; 6+8=14 ; 1+14=15 |
base_conversion | base_conversion:decomposition | n=120,base=4 | TERM:1*4^3=64 ; TERM:3*4^2=48 ; TERM:2*4^1=8 ; TERM:0*4^0=0 ; OUT:1320 |
sorting_algorithms | sorting_algorithms:heap-sort | 6, 1, 3, 4, 9 | [6,9,3,4,1] ; [9,6,3,4,1] ; [1,6,3,4,9] ; [6,1,3,4,9] ; [6,4,3,1,9] ; [1,4,3,6,9] ; [4,1,3,6,9] ; [3,1,4,6,9] ; [1,3,4,6,9] |
base_conversion | base_conversion:repeated-division | n=174,base=16 | DIV:174/16=10,r:14 ; DIV:10/16=0,r:10 ; OUT:AE |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(2,2) ; G=(4,3) | R:(2,3) ; D:(3,3) ; D:(4,3) |
base_conversion | base_conversion:repeated-division | n=9,base=4 | DIV:9/4=2,r:1 ; DIV:2/4=0,r:2 ; OUT:21 |
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) |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 4x+24=56 | 4x+24=56 ; x+6=14 ; x=14-6 ; x=8 |
linear_equation_solving | linear_equation_solving:inverse-ops | 5x-20=-35 | 5x-20=-35 ; x=(-35--20)/5 ; x=-15/5 ; x=-3 |
sorting_algorithms | sorting_algorithms:bubble-sort | 7, 2, 0, 5, 9 | [2,7,0,5,9] ; [2,0,7,5,9] ; [2,0,5,7,9] ; [0,2,5,7,9] |
sorting_algorithms | sorting_algorithms:selection-sort | 4, 1, 9, 7, 3 | [1,4,9,7,3] ; [1,3,9,7,4] ; [1,3,4,7,9] ; [1,3,4,7,9] |
multidigit_addition | multidigit_addition:right-to-left-carry | 882+746 | d2:2+6+0=8→w8,c0 ; d1:8+4+0=12→w2,c1 ; d0:8+7+1=16→w6,c1 ; sum=1628 |
list_summation | list_summation:pairwise | 2, 1, 6, 9 | 2+1=3 ; 6+9=15 ; 3+15=18 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(4,4) ; G=(5,5) | R:(4,5) ; D:(5,5) |
base_conversion | base_conversion:repeated-division | n=109,base=16 | DIV:109/16=6,r:13 ; DIV:6/16=0,r:6 ; OUT:6D |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(0,1) ; G=(2,5) | R:(0,2) ; D:(1,2) ; R:(1,3) ; D:(2,3) ; R:(2,4) ; R:(2,5) |
list_summation | list_summation:left-to-right | 7, 0, 1, 9 | 7+0=7 ; 7+1=8 ; 8+9=17 |
list_summation | list_summation:right-to-left | 8, 4, 2, 0 | 2+0=2 ; 4+2=6 ; 8+6=14 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 2x+10=-4 | 2x+10=-4 ; x+5=-2 ; x=-2-5 ; x=-7 |
multidigit_addition | multidigit_addition:right-to-left-carry | 980+219 | d2:0+9+0=9→w9,c0 ; d1:8+1+0=9→w9,c0 ; d0:9+2+0=11→w1,c1 ; sum=1199 |
list_summation | list_summation:pairwise | 7, 2, 0, 7 | 7+2=9 ; 0+7=7 ; 9+7=16 |
base_conversion | base_conversion:repeated-division | n=172,base=2 | DIV:172/2=86,r:0 ; DIV:86/2=43,r:0 ; DIV:43/2=21,r:1 ; DIV:21/2=10,r:1 ; 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:10101100 |
sorting_algorithms | sorting_algorithms:selection-sort | 5, 2, 7, 1, 9 | [1,2,7,5,9] ; [1,2,7,5,9] ; [1,2,5,7,9] ; [1,2,5,7,9] |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(4,4) ; G=(5,5) | R:(4,5) ; D:(5,5) |
linear_equation_solving | linear_equation_solving:inverse-ops | 9x+9=-63 | 9x+9=-63 ; x=(-63-9)/9 ; x=-72/9 ; x=-8 |
list_summation | list_summation:pairwise | 8, 9, 7, 1 | 8+9=17 ; 7+1=8 ; 17+8=25 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.