task_name stringclasses 6
values | strategy_id stringclasses 20
values | input_text stringlengths 6 26 | reasoning_trace stringlengths 11 152 |
|---|---|---|---|
list_summation | list_summation:pairwise | 3, 2, 1, 7 | 3+2=5 ; 1+7=8 ; 5+8=13 |
linear_equation_solving | linear_equation_solving:inverse-ops | 7x+7=49 | 7x+7=49 ; x=(49-7)/7 ; x=42/7 ; x=6 |
linear_equation_solving | linear_equation_solving:inverse-ops | 7x+21=28 | 7x+21=28 ; x=(28-21)/7 ; x=7/7 ; x=1 |
list_summation | list_summation:right-to-left | 7, 9, 8, 4 | 8+4=12 ; 9+12=21 ; 7+21=28 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 3x+6=30 | 3x+6=30 ; x+2=10 ; x=10-2 ; x=8 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 7x-35=-84 | 7x-35=-84 ; 7x=-49 ; x=-7 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(1,4) ; G=(3,5) | R:(1,5) ; D:(2,5) ; D:(3,5) |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 9x+9=-54 | 9x+9=-54 ; 9x=-63 ; x=-7 |
sorting_algorithms | sorting_algorithms:heap-sort | 8, 9, 1, 5, 2 | [9,8,1,5,2] ; [2,8,1,5,9] ; [8,2,1,5,9] ; [8,5,1,2,9] ; [2,5,1,8,9] ; [5,2,1,8,9] ; [1,2,5,8,9] ; [2,1,5,8,9] ; [1,2,5,8,9] |
list_summation | list_summation:left-to-right | 5, 4, 7, 7 | 5+4=9 ; 9+7=16 ; 16+7=23 |
list_summation | list_summation:pairwise | 5, 1, 0, 1 | 5+1=6 ; 0+1=1 ; 6+1=7 |
multidigit_addition | multidigit_addition:right-to-left-carry | 848+573 | d2:8+3+0=11→w1,c1 ; d1:4+7+1=12→w2,c1 ; d0:8+5+1=14→w4,c1 ; sum=1421 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(0,3) ; G=(4,5) | R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) |
multidigit_addition | multidigit_addition:right-to-left-carry | 457+852 | d2:7+2+0=9→w9,c0 ; d1:5+5+0=10→w0,c1 ; d0:4+8+1=13→w3,c1 ; sum=1309 |
sorting_algorithms | sorting_algorithms:bubble-sort | 1, 5, 0, 8, 9 | [1,0,5,8,9] ; [0,1,5,8,9] |
base_conversion | base_conversion:via-binary | n=20,base=4 | BINLEN:5 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; OUT:110 |
sorting_algorithms | sorting_algorithms:heap-sort | 0, 4, 2, 5, 1 | [0,5,2,4,1] ; [5,0,2,4,1] ; [5,4,2,0,1] ; [1,4,2,0,5] ; [4,1,2,0,5] ; [0,1,2,4,5] ; [2,1,0,4,5] ; [0,1,2,4,5] ; [1,0,2,4,5] ; [0,1,2,4,5] |
linear_equation_solving | linear_equation_solving:inverse-ops | 8x-16=-48 | 8x-16=-48 ; x=(-48--16)/8 ; x=-32/8 ; x=-4 |
sorting_algorithms | sorting_algorithms:selection-sort | 3, 6, 9, 4, 8 | [3,6,9,4,8] ; [3,4,9,6,8] ; [3,4,6,9,8] ; [3,4,6,8,9] |
sorting_algorithms | sorting_algorithms:selection-sort | 9, 1, 8, 7, 2 | [1,9,8,7,2] ; [1,2,8,7,9] ; [1,2,7,8,9] ; [1,2,7,8,9] |
list_summation | list_summation:right-to-left | 5, 9, 4, 1 | 4+1=5 ; 9+5=14 ; 5+14=19 |
multidigit_addition | multidigit_addition:right-to-left-carry | 484+566 | d2:4+6+0=10→w0,c1 ; d1:8+6+1=15→w5,c1 ; d0:4+5+1=10→w0,c1 ; sum=1050 |
base_conversion | base_conversion:via-binary | n=84,base=4 | BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:1 ; CHUNK:3:0 ; OUT:1110 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(3,0) ; G=(4,1) | D:(4,0) ; R:(4,1) |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(0,0) ; G=(4,1) | R:(0,1) ; D:(1,1) ; D:(2,1) ; D:(3,1) ; D:(4,1) |
list_summation | list_summation:right-to-left | 0, 3, 7, 2 | 7+2=9 ; 3+9=12 ; 0+12=12 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 9x+36=54 | 9x+36=54 ; x+4=6 ; x=6-4 ; x=2 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 2x-4=-4 | 2x-4=-4 ; 2x=0 ; x=0 |
multidigit_addition | multidigit_addition:rounding-decomposition | 994+875 | round:1000+875=1875 ; adjust:1875-6=1869 ; sum=1869 |
multidigit_addition | multidigit_addition:left-to-right-partials | 244+969 | p100:200+900=1100 ; p10:40+60=100 ; p1:4+9=13 ; sum=1100+100+13=1213 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(2,1) ; G=(5,3) | R:(2,2) ; R:(2,3) ; D:(3,3) ; D:(4,3) ; D:(5,3) |
list_summation | list_summation:right-to-left | 9, 4, 6, 5 | 6+5=11 ; 4+11=15 ; 9+15=24 |
list_summation | list_summation:pairwise | 7, 0, 9, 1 | 7+0=7 ; 9+1=10 ; 7+10=17 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 8x-72=-88 | 8x-72=-88 ; 8x=-16 ; x=-2 |
list_summation | list_summation:pairwise | 9, 8, 8, 1 | 9+8=17 ; 8+1=9 ; 17+9=26 |
base_conversion | base_conversion:via-binary | n=61,base=16 | BINLEN:6 ; CHUNK:0:3 ; CHUNK:1:13 ; OUT:3D |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(2,3) ; G=(3,4) | R:(2,4) ; D:(3,4) |
multidigit_addition | multidigit_addition:rounding-decomposition | 656+305 | round:660+305=965 ; adjust:965-4=961 ; sum=961 |
base_conversion | base_conversion:repeated-division | n=61,base=2 | DIV:61/2=30,r:1 ; DIV:30/2=15,r:0 ; DIV:15/2=7,r:1 ; DIV:7/2=3,r:1 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:111101 |
base_conversion | base_conversion:repeated-division | n=253,base=2 | DIV:253/2=126,r:1 ; DIV:126/2=63,r:0 ; DIV:63/2=31,r:1 ; DIV:31/2=15,r:1 ; DIV:15/2=7,r:1 ; DIV:7/2=3,r:1 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:11111101 |
base_conversion | base_conversion:decomposition | n=251,base=8 | TERM:3*8^2=192 ; TERM:7*8^1=56 ; TERM:3*8^0=3 ; OUT:373 |
sorting_algorithms | sorting_algorithms:heap-sort | 0, 7, 1, 4, 9 | [0,9,1,4,7] ; [9,0,1,4,7] ; [9,7,1,4,0] ; [0,7,1,4,9] ; [7,0,1,4,9] ; [7,4,1,0,9] ; [0,4,1,7,9] ; [4,0,1,7,9] ; [1,0,4,7,9] ; [0,1,4,7,9] |
base_conversion | base_conversion:via-binary | n=6,base=16 | BINLEN:3 ; CHUNK:0:6 ; OUT:6 |
list_summation | list_summation:left-to-right | 0, 1, 3, 9 | 0+1=1 ; 1+3=4 ; 4+9=13 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 3x+18=-3 | 3x+18=-3 ; 3x=-21 ; x=-7 |
list_summation | list_summation:pairwise | 1, 7, 3, 3 | 1+7=8 ; 3+3=6 ; 8+6=14 |
base_conversion | base_conversion:via-binary | n=112,base=8 | BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:6 ; CHUNK:2:0 ; OUT:160 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 4x+0=-24 | 4x+0=-24 ; 4x=-24 ; x=-6 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 6x-24=-54 | 6x-24=-54 ; x+-4=-9 ; x=-9--4 ; x=-5 |
base_conversion | base_conversion:repeated-division | n=177,base=16 | DIV:177/16=11,r:1 ; DIV:11/16=0,r:11 ; OUT:B1 |
multidigit_addition | multidigit_addition:right-to-left-carry | 630+278 | d2:0+8+0=8→w8,c0 ; d1:3+7+0=10→w0,c1 ; d0:6+2+1=9→w9,c0 ; sum=908 |
list_summation | list_summation:right-to-left | 0, 9, 1, 5 | 1+5=6 ; 9+6=15 ; 0+15=15 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 5x+0=-35 | 5x+0=-35 ; 5x=-35 ; x=-7 |
base_conversion | base_conversion:decomposition | n=70,base=8 | TERM:1*8^2=64 ; TERM:0*8^1=0 ; TERM:6*8^0=6 ; OUT:106 |
sorting_algorithms | sorting_algorithms:insertion-sort | 9, 4, 1, 7, 2 | [4,9,1,7,2] ; [1,4,9,7,2] ; [1,4,7,9,2] ; [1,2,4,7,9] |
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) |
base_conversion | base_conversion:via-binary | n=134,base=8 | BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:0 ; CHUNK:2:6 ; OUT:206 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(1,2) ; G=(2,5) | R:(1,3) ; D:(2,3) ; R:(2,4) ; R:(2,5) |
linear_equation_solving | linear_equation_solving:inverse-ops | 6x+0=-54 | 6x+0=-54 ; x=(-54-0)/6 ; x=-54/6 ; x=-9 |
sorting_algorithms | sorting_algorithms:heap-sort | 8, 7, 4, 3, 1 | [1,7,4,3,8] ; [7,1,4,3,8] ; [7,3,4,1,8] ; [1,3,4,7,8] ; [4,3,1,7,8] ; [1,3,4,7,8] ; [3,1,4,7,8] ; [1,3,4,7,8] |
base_conversion | base_conversion:via-binary | n=185,base=2 | BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:1 ; CHUNK:4:1 ; CHUNK:5:0 ; CHUNK:6:0 ; CHUNK:7:1 ; OUT:10111001 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 7x+7=63 | 7x+7=63 ; 7x=56 ; x=8 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(2,1) ; G=(4,2) | D:(3,1) ; D:(4,1) ; R:(4,2) |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 9x+36=99 | 9x+36=99 ; x+4=11 ; x=11-4 ; x=7 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(3,3) ; G=(4,5) | R:(3,4) ; D:(4,4) ; R:(4,5) |
base_conversion | base_conversion:via-binary | n=137,base=8 | BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:1 ; CHUNK:2:1 ; OUT:211 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(4,1) ; G=(5,2) | R:(4,2) ; D:(5,2) |
grid_pathfinding | grid_pathfinding:alternating | 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 | 262+824 | d2:2+4+0=6→w6,c0 ; d1:6+2+0=8→w8,c0 ; d0:2+8+0=10→w0,c1 ; sum=1086 |
multidigit_addition | multidigit_addition:left-to-right-partials | 521+381 | p100:500+300=800 ; p10:20+80=100 ; p1:1+1=2 ; sum=800+100+2=902 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,3) ; G=(3,4) | R:(2,4) ; D:(3,4) |
list_summation | list_summation:pairwise | 2, 7, 0, 8 | 2+7=9 ; 0+8=8 ; 9+8=17 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(1,4) ; G=(3,5) | R:(1,5) ; D:(2,5) ; D:(3,5) |
list_summation | list_summation:right-to-left | 3, 8, 1, 5 | 1+5=6 ; 8+6=14 ; 3+14=17 |
list_summation | list_summation:left-to-right | 9, 6, 6, 9 | 9+6=15 ; 15+6=21 ; 21+9=30 |
base_conversion | base_conversion:decomposition | n=85,base=4 | TERM:1*4^3=64 ; TERM:1*4^2=16 ; TERM:1*4^1=4 ; TERM:1*4^0=1 ; OUT:1111 |
sorting_algorithms | sorting_algorithms:bubble-sort | 2, 6, 9, 5, 7 | [2,6,5,9,7] ; [2,6,5,7,9] ; [2,5,6,7,9] |
list_summation | list_summation:right-to-left | 4, 4, 8, 5 | 8+5=13 ; 4+13=17 ; 4+17=21 |
list_summation | list_summation:pairwise | 5, 3, 5, 7 | 5+3=8 ; 5+7=12 ; 8+12=20 |
multidigit_addition | multidigit_addition:left-to-right-partials | 886+560 | p100:800+500=1300 ; p10:80+60=140 ; p1:6+0=6 ; sum=1300+140+6=1446 |
list_summation | list_summation:pairwise | 3, 4, 7, 6 | 3+4=7 ; 7+6=13 ; 7+13=20 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 6x-48=-42 | 6x-48=-42 ; 6x=6 ; x=1 |
multidigit_addition | multidigit_addition:rounding-decomposition | 965+839 | round:970+839=1809 ; adjust:1809-5=1804 ; sum=1804 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(3,1) ; G=(5,5) | R:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5) ; D:(4,5) ; D:(5,5) |
sorting_algorithms | sorting_algorithms:selection-sort | 4, 5, 1, 6, 3 | [1,5,4,6,3] ; [1,3,4,6,5] ; [1,3,4,6,5] ; [1,3,4,5,6] |
multidigit_addition | multidigit_addition:right-to-left-carry | 837+638 | d2:7+8+0=15→w5,c1 ; d1:3+3+1=7→w7,c0 ; d0:8+6+0=14→w4,c1 ; sum=1475 |
sorting_algorithms | sorting_algorithms:heap-sort | 9, 8, 3, 2, 6 | [6,8,3,2,9] ; [8,6,3,2,9] ; [2,6,3,8,9] ; [6,2,3,8,9] ; [3,2,6,8,9] ; [2,3,6,8,9] |
sorting_algorithms | sorting_algorithms:merge-sort | 3, 2, 6, 7, 8 | [2,3,6,7,8] |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(2,3) ; G=(4,5) | D:(3,3) ; D:(4,3) ; R:(4,4) ; R:(4,5) |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(2,1) ; G=(5,5) | R:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5) |
multidigit_addition | multidigit_addition:left-to-right-partials | 811+120 | p100:800+100=900 ; p10:10+20=30 ; p1:1+0=1 ; sum=900+30+1=931 |
multidigit_addition | multidigit_addition:right-to-left-carry | 375+529 | d2:5+9+0=14→w4,c1 ; d1:7+2+1=10→w0,c1 ; d0:3+5+1=9→w9,c0 ; sum=904 |
sorting_algorithms | sorting_algorithms:merge-sort | 1, 9, 7, 2, 0 | [1,9,2,7,0] ; [1,2,7,9,0] ; [0,1,2,7,9] |
sorting_algorithms | sorting_algorithms:heap-sort | 3, 6, 7, 1, 0 | [7,6,3,1,0] ; [0,6,3,1,7] ; [6,0,3,1,7] ; [6,1,3,0,7] ; [0,1,3,6,7] ; [3,1,0,6,7] ; [0,1,3,6,7] ; [1,0,3,6,7] ; [0,1,3,6,7] |
multidigit_addition | multidigit_addition:left-to-right-partials | 868+706 | p100:800+700=1500 ; p10:60+0=60 ; p1:8+6=14 ; sum=1500+60+14=1574 |
list_summation | list_summation:left-to-right | 8, 8, 0, 5 | 8+8=16 ; 16+0=16 ; 16+5=21 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(0,3) ; G=(3,5) | R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(0,2) ; G=(3,5) | R:(0,3) ; D:(1,3) ; R:(1,4) ; D:(2,4) ; R:(2,5) ; D:(3,5) |
list_summation | list_summation:left-to-right | 7, 9, 1, 2 | 7+9=16 ; 16+1=17 ; 17+2=19 |
sorting_algorithms | sorting_algorithms:merge-sort | 2, 1, 3, 4, 7 | [1,2,3,4,7] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.