task_name
stringclasses
6 values
strategy_id
stringclasses
20 values
input_text
stringlengths
6
26
reasoning_trace
stringlengths
11
152
sorting_algorithms
sorting_algorithms:bubble-sort
2, 6, 4, 0, 7
[2,4,6,0,7] ; [2,4,0,6,7] ; [2,0,4,6,7] ; [0,2,4,6,7]
base_conversion
base_conversion:via-binary
n=39,base=16
BINLEN:6 ; CHUNK:0:2 ; CHUNK:1:7 ; OUT:27
multidigit_addition
multidigit_addition:right-to-left-carry
873+894
d2:3+4+0=7→w7,c0 ; d1:7+9+0=16→w6,c1 ; d0:8+8+1=17→w7,c1 ; sum=1767
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,0) ; G=(5,5)
D:(4,0) ; D:(5,0) ; R:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
sorting_algorithms
sorting_algorithms:merge-sort
5, 2, 7, 0, 8
[2,5,7,0,8] ; [2,5,0,7,8] ; [0,2,5,7,8]
base_conversion
base_conversion:decomposition
n=63,base=2
TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:1*2^3=8 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:111111
sorting_algorithms
sorting_algorithms:merge-sort
5, 9, 3, 7, 4
[3,5,7,9,4] ; [3,4,5,7,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+16=40
4x+16=40 ; 4x=24 ; x=6
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x+20=55
5x+20=55 ; x+4=11 ; x=11-4 ; x=7
list_summation
list_summation:left-to-right
0, 9, 2, 6
0+9=9 ; 9+2=11 ; 11+6=17
linear_equation_solving
linear_equation_solving:inverse-ops
4x+36=28
4x+36=28 ; x=(28-36)/4 ; x=-8/4 ; x=-2
multidigit_addition
multidigit_addition:left-to-right-partials
192+953
p100:100+900=1000 ; p10:90+50=140 ; p1:2+3=5 ; sum=1000+140+5=1145
base_conversion
base_conversion:repeated-division
n=109,base=8
DIV:109/8=13,r:5 ; DIV:13/8=1,r:5 ; DIV:1/8=0,r:1 ; OUT:155
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)
sorting_algorithms
sorting_algorithms:insertion-sort
4, 2, 7, 3, 9
[2,4,7,3,9] ; [2,4,7,3,9] ; [2,3,4,7,9] ; [2,3,4,7,9]
list_summation
list_summation:right-to-left
1, 0, 8, 7
8+7=15 ; 0+15=15 ; 1+15=16
sorting_algorithms
sorting_algorithms:insertion-sort
4, 3, 1, 7, 2
[3,4,1,7,2] ; [1,3,4,7,2] ; [1,3,4,7,2] ; [1,2,3,4,7]
linear_equation_solving
linear_equation_solving:inverse-ops
6x-24=30
6x-24=30 ; x=(30--24)/6 ; x=54/6 ; x=9
multidigit_addition
multidigit_addition:rounding-decomposition
777+578
round:780+578=1358 ; adjust:1358-3=1355 ; sum=1355
base_conversion
base_conversion:repeated-division
n=56,base=4
DIV:56/4=14,r:0 ; DIV:14/4=3,r:2 ; DIV:3/4=0,r:3 ; OUT:320
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x+15=5
5x+15=5 ; 5x=-10 ; x=-2
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,2) ; G=(4,5)
R:(2,3) ; R:(2,4) ; R:(2,5) ; D:(3,5) ; D:(4,5)
base_conversion
base_conversion:via-binary
n=223,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:1 ; CHUNK:4:1 ; CHUNK:5:1 ; CHUNK:6:1 ; CHUNK:7:1 ; OUT:11011111
multidigit_addition
multidigit_addition:rounding-decomposition
345+948
round:350+948=1298 ; adjust:1298-5=1293 ; sum=1293
multidigit_addition
multidigit_addition:left-to-right-partials
719+624
p100:700+600=1300 ; p10:10+20=30 ; p1:9+4=13 ; sum=1300+30+13=1343
multidigit_addition
multidigit_addition:left-to-right-partials
689+318
p100:600+300=900 ; p10:80+10=90 ; p1:9+8=17 ; sum=900+90+17=1007
multidigit_addition
multidigit_addition:right-to-left-carry
422+446
d2:2+6+0=8→w8,c0 ; d1:2+4+0=6→w6,c0 ; d0:4+4+0=8→w8,c0 ; sum=868
sorting_algorithms
sorting_algorithms:heap-sort
2, 6, 1, 8, 5
[2,8,1,6,5] ; [8,2,1,6,5] ; [8,6,1,2,5] ; [5,6,1,2,8] ; [6,5,1,2,8] ; [2,5,1,6,8] ; [5,2,1,6,8] ; [1,2,5,6,8] ; [2,1,5,6,8] ; [1,2,5,6,8]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,2) ; G=(4,3)
R:(0,3) ; D:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,1) ; G=(5,2)
D:(5,1) ; R:(5,2)
multidigit_addition
multidigit_addition:left-to-right-partials
785+860
p100:700+800=1500 ; p10:80+60=140 ; p1:5+0=5 ; sum=1500+140+5=1645
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x-15=6
3x-15=6 ; x+-5=2 ; x=2--5 ; x=7
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x+30=6
6x+30=6 ; 6x=-24 ; x=-4
sorting_algorithms
sorting_algorithms:heap-sort
7, 8, 5, 2, 9
[7,9,5,2,8] ; [9,7,5,2,8] ; [9,8,5,2,7] ; [7,8,5,2,9] ; [8,7,5,2,9] ; [2,7,5,8,9] ; [7,2,5,8,9] ; [5,2,7,8,9] ; [2,5,7,8,9]
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x-15=-35
5x-15=-35 ; x+-3=-7 ; x=-7--3 ; x=-4
base_conversion
base_conversion:via-binary
n=119,base=2
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:1 ; CHUNK:3:0 ; CHUNK:4:1 ; CHUNK:5:1 ; CHUNK:6:1 ; OUT:1110111
sorting_algorithms
sorting_algorithms:heap-sort
3, 5, 9, 2, 4
[9,5,3,2,4] ; [4,5,3,2,9] ; [5,4,3,2,9] ; [2,4,3,5,9] ; [4,2,3,5,9] ; [3,2,4,5,9] ; [2,3,4,5,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x-45=0
5x-45=0 ; 5x=45 ; x=9
sorting_algorithms
sorting_algorithms:merge-sort
4, 3, 0, 1, 5
[3,4,0,1,5] ; [0,1,3,4,5]
base_conversion
base_conversion:repeated-division
n=151,base=2
DIV:151/2=75,r:1 ; DIV:75/2=37,r:1 ; DIV:37/2=18,r:1 ; DIV:18/2=9,r:0 ; DIV:9/2=4,r:1 ; DIV:4/2=2,r:0 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:10010111
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,4) ; G=(2,5)
R:(1,5) ; D:(2,5)
sorting_algorithms
sorting_algorithms:bubble-sort
0, 4, 5, 8, 3
[0,4,5,3,8] ; [0,4,3,5,8] ; [0,3,4,5,8]
sorting_algorithms
sorting_algorithms:bubble-sort
9, 5, 0, 4, 8
[5,9,0,4,8] ; [5,0,9,4,8] ; [5,0,4,9,8] ; [5,0,4,8,9] ; [0,5,4,8,9] ; [0,4,5,8,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,2) ; G=(1,5)
R:(0,3) ; D:(1,3) ; R:(1,4) ; R:(1,5)
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x-2=10
2x-2=10 ; 2x=12 ; x=6
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x+10=40
5x+10=40 ; x+2=8 ; x=8-2 ; x=6
list_summation
list_summation:left-to-right
6, 3, 5, 4
6+3=9 ; 9+5=14 ; 14+4=18
linear_equation_solving
linear_equation_solving:inverse-ops
6x+30=-18
6x+30=-18 ; x=(-18-30)/6 ; x=-48/6 ; x=-8
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x-10=5
5x-10=5 ; x+-2=1 ; x=1--2 ; x=3
list_summation
list_summation:right-to-left
4, 1, 1, 4
1+4=5 ; 1+5=6 ; 4+6=10
sorting_algorithms
sorting_algorithms:merge-sort
8, 6, 0, 5, 7
[6,8,0,5,7] ; [0,5,6,8,7] ; [0,5,6,7,8]
base_conversion
base_conversion:repeated-division
n=133,base=8
DIV:133/8=16,r:5 ; DIV:16/8=2,r:0 ; DIV:2/8=0,r:2 ; OUT:205
multidigit_addition
multidigit_addition:right-to-left-carry
894+263
d2:4+3+0=7→w7,c0 ; d1:9+6+0=15→w5,c1 ; d0:8+2+1=11→w1,c1 ; sum=1157
base_conversion
base_conversion:decomposition
n=141,base=4
TERM:2*4^3=128 ; TERM:0*4^2=0 ; TERM:3*4^1=12 ; TERM:1*4^0=1 ; OUT:2031
base_conversion
base_conversion:via-binary
n=42,base=2
BINLEN:6 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:0 ; CHUNK:4:1 ; CHUNK:5:0 ; OUT:101010
list_summation
list_summation:left-to-right
2, 1, 9, 8
2+1=3 ; 3+9=12 ; 12+8=20
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,1) ; G=(3,2)
R:(1,2) ; D:(2,2) ; D:(3,2)
sorting_algorithms
sorting_algorithms:merge-sort
3, 0, 6, 2, 8
[0,3,6,2,8] ; [0,3,2,6,8] ; [0,2,3,6,8]
list_summation
list_summation:left-to-right
4, 7, 3, 1
4+7=11 ; 11+3=14 ; 14+1=15
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,4) ; G=(5,5)
D:(5,4) ; R:(5,5)
sorting_algorithms
sorting_algorithms:merge-sort
8, 4, 3, 9, 5
[4,8,3,9,5] ; [3,4,8,9,5] ; [3,4,5,8,9]
list_summation
list_summation:right-to-left
5, 2, 8, 2
8+2=10 ; 2+10=12 ; 5+12=17
multidigit_addition
multidigit_addition:rounding-decomposition
558+315
round:560+315=875 ; adjust:875-2=873 ; sum=873
list_summation
list_summation:left-to-right
6, 3, 1, 6
6+3=9 ; 9+1=10 ; 10+6=16
multidigit_addition
multidigit_addition:left-to-right-partials
370+808
p100:300+800=1100 ; p10:70+0=70 ; p1:0+8=8 ; sum=1100+70+8=1178
linear_equation_solving
linear_equation_solving:inverse-ops
7x+28=28
7x+28=28 ; x=(28-28)/7 ; x=0/7 ; x=0
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,0) ; G=(4,1)
R:(3,1) ; D:(4,1)
list_summation
list_summation:pairwise
2, 0, 0, 6
2+0=2 ; 0+6=6 ; 2+6=8
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,3) ; G=(5,4)
R:(3,4) ; D:(4,4) ; D:(5,4)
sorting_algorithms
sorting_algorithms:merge-sort
6, 5, 3, 2, 0
[5,6,3,2,0] ; [5,6,2,3,0] ; [2,3,5,6,0] ; [0,2,3,5,6]
multidigit_addition
multidigit_addition:left-to-right-partials
762+702
p100:700+700=1400 ; p10:60+0=60 ; p1:2+2=4 ; sum=1400+60+4=1464
list_summation
list_summation:pairwise
5, 1, 6, 7
5+1=6 ; 6+7=13 ; 6+13=19
sorting_algorithms
sorting_algorithms:heap-sort
3, 0, 2, 7, 6
[3,7,2,0,6] ; [7,3,2,0,6] ; [7,6,2,0,3] ; [3,6,2,0,7] ; [6,3,2,0,7] ; [0,3,2,6,7] ; [3,0,2,6,7] ; [2,0,3,6,7] ; [0,2,3,6,7]
multidigit_addition
multidigit_addition:right-to-left-carry
744+514
d2:4+4+0=8→w8,c0 ; d1:4+1+0=5→w5,c0 ; d0:7+5+0=12→w2,c1 ; sum=1258
list_summation
list_summation:right-to-left
8, 8, 1, 3
1+3=4 ; 8+4=12 ; 8+12=20
multidigit_addition
multidigit_addition:left-to-right-partials
595+391
p100:500+300=800 ; p10:90+90=180 ; p1:5+1=6 ; sum=800+180+6=986
sorting_algorithms
sorting_algorithms:bubble-sort
0, 1, 8, 5, 3
[0,1,5,8,3] ; [0,1,5,3,8] ; [0,1,3,5,8]
list_summation
list_summation:left-to-right
7, 3, 6, 7
7+3=10 ; 10+6=16 ; 16+7=23
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,2) ; G=(4,4)
D:(4,2) ; R:(4,3) ; R:(4,4)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,1) ; G=(3,5)
R:(2,2) ; D:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5)
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x-12=-12
3x-12=-12 ; 3x=0 ; x=0
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+18=18
2x+18=18 ; 2x=0 ; x=0
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,3) ; G=(5,4)
D:(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)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,0) ; G=(4,3)
R:(1,1) ; R:(1,2) ; R:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3)
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)
multidigit_addition
multidigit_addition:rounding-decomposition
652+490
round:660+490=1150 ; adjust:1150-8=1142 ; sum=1142
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x-36=-48
4x-36=-48 ; 4x=-12 ; x=-3
multidigit_addition
multidigit_addition:left-to-right-partials
996+668
p100:900+600=1500 ; p10:90+60=150 ; p1:6+8=14 ; sum=1500+150+14=1664
list_summation
list_summation:right-to-left
2, 4, 9, 4
9+4=13 ; 4+13=17 ; 2+17=19
multidigit_addition
multidigit_addition:left-to-right-partials
949+801
p100:900+800=1700 ; p10:40+0=40 ; p1:9+1=10 ; sum=1700+40+10=1750
linear_equation_solving
linear_equation_solving:inverse-ops
2x-10=-8
2x-10=-8 ; x=(-8--10)/2 ; x=2/2 ; x=1
sorting_algorithms
sorting_algorithms:heap-sort
6, 3, 2, 8, 7
[6,8,2,3,7] ; [8,6,2,3,7] ; [8,7,2,3,6] ; [6,7,2,3,8] ; [7,6,2,3,8] ; [3,6,2,7,8] ; [6,3,2,7,8] ; [2,3,6,7,8] ; [3,2,6,7,8] ; [2,3,6,7,8]
sorting_algorithms
sorting_algorithms:selection-sort
4, 5, 0, 8, 6
[0,5,4,8,6] ; [0,4,5,8,6] ; [0,4,5,8,6] ; [0,4,5,6,8]
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x-12=4
4x-12=4 ; 4x=16 ; x=4
linear_equation_solving
linear_equation_solving:inverse-ops
8x+16=40
8x+16=40 ; x=(40-16)/8 ; x=24/8 ; x=3
list_summation
list_summation:pairwise
0, 0, 6, 2
0+0=0 ; 6+2=8 ; 0+8=8
base_conversion
base_conversion:decomposition
n=139,base=8
TERM:2*8^2=128 ; TERM:1*8^1=8 ; TERM:3*8^0=3 ; OUT:213
sorting_algorithms
sorting_algorithms:merge-sort
8, 9, 6, 0, 3
[8,9,0,6,3] ; [0,6,8,9,3] ; [0,3,6,8,9]
list_summation
list_summation:pairwise
8, 3, 1, 0
8+3=11 ; 1+0=1 ; 11+1=12