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:divide-then-subtract | 7x-42=-63 | 7x-42=-63 ; x+-6=-9 ; x=-9--6 ; x=-3 |
sorting_algorithms | sorting_algorithms:bubble-sort | 7, 8, 9, 2, 6 | [7,8,2,9,6] ; [7,8,2,6,9] ; [7,2,8,6,9] ; [7,2,6,8,9] ; [2,7,6,8,9] ; [2,6,7,8,9] |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(3,0) ; G=(4,4) | R:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4) ; D:(4,4) |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(2,1) ; G=(3,3) | D:(3,1) ; R:(3,2) ; R:(3,3) |
linear_equation_solving | linear_equation_solving:inverse-ops | 4x+28=12 | 4x+28=12 ; x=(12-28)/4 ; x=-16/4 ; x=-4 |
multidigit_addition | multidigit_addition:rounding-decomposition | 513+415 | round:520+415=935 ; adjust:935-7=928 ; sum=928 |
sorting_algorithms | sorting_algorithms:insertion-sort | 3, 7, 8, 5, 2 | [3,7,8,5,2] ; [3,7,8,5,2] ; [3,5,7,8,2] ; [2,3,5,7,8] |
multidigit_addition | multidigit_addition:right-to-left-carry | 102+818 | d2:2+8+0=10→w0,c1 ; d1:0+1+1=2→w2,c0 ; d0:1+8+0=9→w9,c0 ; sum=920 |
multidigit_addition | multidigit_addition:right-to-left-carry | 152+920 | d2:2+0+0=2→w2,c0 ; d1:5+2+0=7→w7,c0 ; d0:1+9+0=10→w0,c1 ; sum=1072 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(0,1) ; G=(4,3) | R:(0,2) ; R:(0,3) ; D:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3) |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 3x+12=-15 | 3x+12=-15 ; x+4=-5 ; x=-5-4 ; x=-9 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(3,1) ; G=(5,4) | R:(3,2) ; D:(4,2) ; R:(4,3) ; D:(5,3) ; R:(5,4) |
multidigit_addition | multidigit_addition:left-to-right-partials | 894+115 | p100:800+100=900 ; p10:90+10=100 ; p1:4+5=9 ; sum=900+100+9=1009 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 4x+0=36 | 4x+0=36 ; x+0=9 ; x=9-0 ; x=9 |
list_summation | list_summation:right-to-left | 8, 7, 9, 7 | 9+7=16 ; 7+16=23 ; 8+23=31 |
base_conversion | base_conversion:via-binary | n=73,base=16 | BINLEN:7 ; CHUNK:0:4 ; CHUNK:1:9 ; OUT:49 |
sorting_algorithms | sorting_algorithms:insertion-sort | 0, 7, 3, 1, 6 | [0,7,3,1,6] ; [0,3,7,1,6] ; [0,1,3,7,6] ; [0,1,3,6,7] |
list_summation | list_summation:right-to-left | 9, 4, 1, 7 | 1+7=8 ; 4+8=12 ; 9+12=21 |
list_summation | list_summation:right-to-left | 2, 9, 0, 2 | 0+2=2 ; 9+2=11 ; 2+11=13 |
list_summation | list_summation:right-to-left | 2, 1, 7, 7 | 7+7=14 ; 1+14=15 ; 2+15=17 |
multidigit_addition | multidigit_addition:right-to-left-carry | 703+769 | d2:3+9+0=12→w2,c1 ; d1:0+6+1=7→w7,c0 ; d0:7+7+0=14→w4,c1 ; sum=1472 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(1,0) ; G=(5,5) | D:(2,0) ; D:(3,0) ; D:(4,0) ; D:(5,0) ; R:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5) |
list_summation | list_summation:left-to-right | 9, 9, 6, 9 | 9+9=18 ; 18+6=24 ; 24+9=33 |
sorting_algorithms | sorting_algorithms:heap-sort | 7, 9, 6, 4, 8 | [9,7,6,4,8] ; [9,8,6,4,7] ; [7,8,6,4,9] ; [8,7,6,4,9] ; [4,7,6,8,9] ; [7,4,6,8,9] ; [6,4,7,8,9] ; [4,6,7,8,9] |
list_summation | list_summation:left-to-right | 8, 9, 9, 5 | 8+9=17 ; 17+9=26 ; 26+5=31 |
linear_equation_solving | linear_equation_solving:inverse-ops | 9x-27=27 | 9x-27=27 ; x=(27--27)/9 ; x=54/9 ; x=6 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 9x+18=-63 | 9x+18=-63 ; x+2=-7 ; x=-7-2 ; x=-9 |
multidigit_addition | multidigit_addition:right-to-left-carry | 374+997 | d2:4+7+0=11→w1,c1 ; d1:7+9+1=17→w7,c1 ; d0:3+9+1=13→w3,c1 ; sum=1371 |
sorting_algorithms | sorting_algorithms:merge-sort | 7, 0, 2, 1, 6 | [0,7,2,1,6] ; [0,7,1,2,6] ; [0,1,2,7,6] ; [0,1,2,6,7] |
multidigit_addition | multidigit_addition:rounding-decomposition | 150+483 | round:150+483=633 ; adjust:633-0=633 ; sum=633 |
list_summation | list_summation:pairwise | 4, 9, 6, 7 | 4+9=13 ; 6+7=13 ; 13+13=26 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(3,2) ; G=(5,5) | R:(3,3) ; D:(4,3) ; R:(4,4) ; D:(5,4) ; R:(5,5) |
linear_equation_solving | linear_equation_solving:inverse-ops | 7x+28=-21 | 7x+28=-21 ; x=(-21-28)/7 ; x=-49/7 ; x=-7 |
list_summation | list_summation:right-to-left | 8, 8, 6, 5 | 6+5=11 ; 8+11=19 ; 8+19=27 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(3,2) ; G=(5,4) | D:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4) |
base_conversion | base_conversion:decomposition | n=176,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:0*2^1=0 ; TERM:0*2^0=0 ; OUT:10110000 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(1,1) ; G=(2,5) | D:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5) |
multidigit_addition | multidigit_addition:rounding-decomposition | 369+996 | round:370+996=1366 ; adjust:1366-1=1365 ; sum=1365 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(0,1) ; G=(2,2) | D:(1,1) ; D:(2,1) ; R:(2,2) |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 5x+45=50 | 5x+45=50 ; x+9=10 ; x=10-9 ; x=1 |
linear_equation_solving | linear_equation_solving:inverse-ops | 5x-35=-10 | 5x-35=-10 ; x=(-10--35)/5 ; x=25/5 ; x=5 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(1,1) ; G=(2,5) | D:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5) |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(2,3) ; G=(5,4) | R:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4) |
sorting_algorithms | sorting_algorithms:selection-sort | 4, 9, 0, 7, 3 | [0,9,4,7,3] ; [0,3,4,7,9] ; [0,3,4,7,9] ; [0,3,4,7,9] |
base_conversion | base_conversion:decomposition | n=224,base=4 | TERM:3*4^3=192 ; TERM:2*4^2=32 ; TERM:0*4^1=0 ; TERM:0*4^0=0 ; OUT:3200 |
list_summation | list_summation:right-to-left | 5, 9, 9, 0 | 9+0=9 ; 9+9=18 ; 5+18=23 |
linear_equation_solving | linear_equation_solving:inverse-ops | 5x+15=15 | 5x+15=15 ; x=(15-15)/5 ; x=0/5 ; x=0 |
sorting_algorithms | sorting_algorithms:insertion-sort | 3, 8, 6, 0, 4 | [3,8,6,0,4] ; [3,6,8,0,4] ; [0,3,6,8,4] ; [0,3,4,6,8] |
list_summation | list_summation:right-to-left | 9, 0, 3, 0 | 3+0=3 ; 0+3=3 ; 9+3=12 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(1,4) ; G=(3,5) | D:(2,4) ; D:(3,4) ; R:(3,5) |
sorting_algorithms | sorting_algorithms:insertion-sort | 1, 6, 2, 9, 5 | [1,6,2,9,5] ; [1,2,6,9,5] ; [1,2,6,9,5] ; [1,2,5,6,9] |
multidigit_addition | multidigit_addition:right-to-left-carry | 392+602 | d2:2+2+0=4→w4,c0 ; d1:9+0+0=9→w9,c0 ; d0:3+6+0=9→w9,c0 ; sum=994 |
list_summation | list_summation:right-to-left | 5, 0, 3, 7 | 3+7=10 ; 0+10=10 ; 5+10=15 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 3x-27=-27 | 3x-27=-27 ; x+-9=-9 ; x=-9--9 ; x=0 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(4,1) ; G=(5,2) | R:(4,2) ; D:(5,2) |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(1,0) ; G=(5,4) | R:(1,1) ; R:(1,2) ; R:(1,3) ; R:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4) |
sorting_algorithms | sorting_algorithms:bubble-sort | 4, 2, 3, 0, 6 | [2,4,3,0,6] ; [2,3,4,0,6] ; [2,3,0,4,6] ; [2,0,3,4,6] ; [0,2,3,4,6] |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(3,2) ; G=(5,4) | R:(3,3) ; R:(3,4) ; D:(4,4) ; D:(5,4) |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(4,4) ; G=(5,5) | R:(4,5) ; D:(5,5) |
multidigit_addition | multidigit_addition:rounding-decomposition | 673+230 | round:680+230=910 ; adjust:910-7=903 ; sum=903 |
list_summation | list_summation:pairwise | 7, 6, 3, 3 | 7+6=13 ; 3+3=6 ; 13+6=19 |
multidigit_addition | multidigit_addition:right-to-left-carry | 778+755 | d2:8+5+0=13→w3,c1 ; d1:7+5+1=13→w3,c1 ; d0:7+7+1=15→w5,c1 ; sum=1533 |
sorting_algorithms | sorting_algorithms:merge-sort | 8, 7, 3, 4, 6 | [7,8,3,4,6] ; [3,4,7,8,6] ; [3,4,6,7,8] |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 3x+3=0 | 3x+3=0 ; 3x=-3 ; x=-1 |
linear_equation_solving | linear_equation_solving:inverse-ops | 2x+0=18 | 2x+0=18 ; x=(18-0)/2 ; x=18/2 ; x=9 |
list_summation | list_summation:left-to-right | 2, 2, 5, 1 | 2+2=4 ; 4+5=9 ; 9+1=10 |
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 |
list_summation | list_summation:left-to-right | 4, 2, 2, 3 | 4+2=6 ; 6+2=8 ; 8+3=11 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(3,2) ; G=(5,3) | D:(4,2) ; D:(5,2) ; R:(5,3) |
sorting_algorithms | sorting_algorithms:merge-sort | 1, 0, 9, 6, 7 | [0,1,9,6,7] ; [0,1,6,9,7] ; [0,1,6,7,9] |
sorting_algorithms | sorting_algorithms:bubble-sort | 2, 1, 5, 7, 8 | [1,2,5,7,8] |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(4,0) ; G=(5,4) | R:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 9x+54=-18 | 9x+54=-18 ; x+6=-2 ; x=-2-6 ; x=-8 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 6x-42=-36 | 6x-42=-36 ; 6x=6 ; x=1 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(2,0) ; G=(5,4) | R:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4) |
sorting_algorithms | sorting_algorithms:merge-sort | 2, 8, 5, 1, 0 | [2,8,1,5,0] ; [1,2,5,8,0] ; [0,1,2,5,8] |
sorting_algorithms | sorting_algorithms:insertion-sort | 2, 6, 3, 9, 5 | [2,6,3,9,5] ; [2,3,6,9,5] ; [2,3,6,9,5] ; [2,3,5,6,9] |
base_conversion | base_conversion:decomposition | n=159,base=16 | TERM:9*16^1=144 ; TERM:15*16^0=15 ; OUT:9F |
base_conversion | base_conversion:via-binary | n=178,base=4 | BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:3 ; CHUNK:2:0 ; CHUNK:3:2 ; OUT:2302 |
sorting_algorithms | sorting_algorithms:insertion-sort | 1, 5, 0, 8, 6 | [1,5,0,8,6] ; [0,1,5,8,6] ; [0,1,5,8,6] ; [0,1,5,6,8] |
linear_equation_solving | linear_equation_solving:inverse-ops | 9x-36=-27 | 9x-36=-27 ; x=(-27--36)/9 ; x=9/9 ; x=1 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(1,2) ; G=(4,4) | R:(1,3) ; R:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4) |
multidigit_addition | multidigit_addition:right-to-left-carry | 527+828 | d2:7+8+0=15→w5,c1 ; d1:2+2+1=5→w5,c0 ; d0:5+8+0=13→w3,c1 ; sum=1355 |
multidigit_addition | multidigit_addition:right-to-left-carry | 800+901 | d2:0+1+0=1→w1,c0 ; d1:0+0+0=0→w0,c0 ; d0:8+9+0=17→w7,c1 ; sum=1701 |
base_conversion | base_conversion:decomposition | n=31,base=16 | TERM:1*16^1=16 ; TERM:15*16^0=15 ; OUT:1F |
list_summation | list_summation:right-to-left | 2, 2, 7, 9 | 7+9=16 ; 2+16=18 ; 2+18=20 |
base_conversion | base_conversion:via-binary | n=6,base=4 | BINLEN:3 ; CHUNK:0:1 ; CHUNK:1:2 ; OUT:12 |
sorting_algorithms | sorting_algorithms:merge-sort | 0, 4, 5, 7, 3 | [0,3,4,5,7] |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(4,1) ; G=(5,4) | R:(4,2) ; R:(4,3) ; R:(4,4) ; D:(5,4) |
sorting_algorithms | sorting_algorithms:heap-sort | 5, 9, 3, 2, 8 | [9,5,3,2,8] ; [9,8,3,2,5] ; [5,8,3,2,9] ; [8,5,3,2,9] ; [2,5,3,8,9] ; [5,2,3,8,9] ; [3,2,5,8,9] ; [2,3,5,8,9] |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 7x-14=-28 | 7x-14=-28 ; x+-2=-4 ; x=-4--2 ; x=-2 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(3,4) ; G=(4,5) | R:(3,5) ; D:(4,5) |
list_summation | list_summation:left-to-right | 8, 9, 1, 9 | 8+9=17 ; 17+1=18 ; 18+9=27 |
list_summation | list_summation:pairwise | 2, 1, 2, 2 | 2+1=3 ; 2+2=4 ; 3+4=7 |
linear_equation_solving | linear_equation_solving:inverse-ops | 9x+72=144 | 9x+72=144 ; x=(144-72)/9 ; x=72/9 ; x=8 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 3x+0=18 | 3x+0=18 ; 3x=18 ; x=6 |
sorting_algorithms | sorting_algorithms:bubble-sort | 6, 5, 0, 7, 8 | [5,6,0,7,8] ; [5,0,6,7,8] ; [0,5,6,7,8] |
sorting_algorithms | sorting_algorithms:heap-sort | 8, 6, 7, 1, 9 | [8,9,7,1,6] ; [9,8,7,1,6] ; [6,8,7,1,9] ; [8,6,7,1,9] ; [1,6,7,8,9] ; [7,6,1,8,9] ; [1,6,7,8,9] ; [6,1,7,8,9] ; [1,6,7,8,9] |
list_summation | list_summation:pairwise | 0, 4, 1, 0 | 0+4=4 ; 1+0=1 ; 4+1=5 |
base_conversion | base_conversion:decomposition | n=58,base=2 | TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:1*2^3=8 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:111010 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.