task_name
stringclasses
6 values
strategy_id
stringclasses
20 values
input_text
stringlengths
6
26
reasoning_trace
stringlengths
11
152
sorting_algorithms
sorting_algorithms:heap-sort
9, 5, 0, 6, 2
[9,6,0,5,2] ; [2,6,0,5,9] ; [6,2,0,5,9] ; [6,5,0,2,9] ; [2,5,0,6,9] ; [5,2,0,6,9] ; [0,2,5,6,9] ; [2,0,5,6,9] ; [0,2,5,6,9]
multidigit_addition
multidigit_addition:right-to-left-carry
560+300
d2:0+0+0=0→w0,c0 ; d1:6+0+0=6→w6,c0 ; d0:5+3+0=8→w8,c0 ; sum=860
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,4) ; G=(5,5)
R:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
list_summation
list_summation:pairwise
6, 8, 1, 4
6+8=14 ; 1+4=5 ; 14+5=19
base_conversion
base_conversion:repeated-division
n=33,base=4
DIV:33/4=8,r:1 ; DIV:8/4=2,r:0 ; DIV:2/4=0,r:2 ; OUT:201
sorting_algorithms
sorting_algorithms:merge-sort
8, 0, 6, 1, 7
[0,8,6,1,7] ; [0,8,1,6,7] ; [0,1,6,8,7] ; [0,1,6,7,8]
linear_equation_solving
linear_equation_solving:inverse-ops
3x-12=-30
3x-12=-30 ; x=(-30--12)/3 ; x=-18/3 ; x=-6
multidigit_addition
multidigit_addition:left-to-right-partials
941+418
p100:900+400=1300 ; p10:40+10=50 ; p1:1+8=9 ; sum=1300+50+9=1359
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,0) ; G=(4,4)
D:(3,0) ; D:(4,0) ; R:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4)
multidigit_addition
multidigit_addition:left-to-right-partials
993+841
p100:900+800=1700 ; p10:90+40=130 ; p1:3+1=4 ; sum=1700+130+4=1834
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,0) ; G=(4,1)
R:(3,1) ; D:(4,1)
base_conversion
base_conversion:decomposition
n=196,base=16
TERM:12*16^1=192 ; TERM:4*16^0=4 ; OUT:C4
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,0) ; G=(5,3)
D:(5,0) ; R:(5,1) ; R:(5,2) ; R:(5,3)
base_conversion
base_conversion:via-binary
n=159,base=16
BINLEN:8 ; CHUNK:0:9 ; CHUNK:1:15 ; OUT:9F
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x-6=0
3x-6=0 ; x+-2=0 ; x=0--2 ; x=2
linear_equation_solving
linear_equation_solving:inverse-ops
5x+35=35
5x+35=35 ; x=(35-35)/5 ; x=0/5 ; x=0
linear_equation_solving
linear_equation_solving:inverse-ops
2x-2=8
2x-2=8 ; x=(8--2)/2 ; x=10/2 ; x=5
list_summation
list_summation:pairwise
7, 9, 6, 8
7+9=16 ; 6+8=14 ; 16+14=30
base_conversion
base_conversion:decomposition
n=29,base=4
TERM:1*4^2=16 ; TERM:3*4^1=12 ; TERM:1*4^0=1 ; OUT:131
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)
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x-28=-28
7x-28=-28 ; x+-4=-4 ; x=-4--4 ; x=0
list_summation
list_summation:right-to-left
9, 5, 4, 8
4+8=12 ; 5+12=17 ; 9+17=26
list_summation
list_summation:pairwise
5, 2, 3, 9
5+2=7 ; 3+9=12 ; 7+12=19
base_conversion
base_conversion:via-binary
n=172,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:0 ; CHUNK:4:1 ; CHUNK:5:1 ; CHUNK:6:0 ; CHUNK:7:0 ; OUT:10101100
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,3) ; G=(5,5)
R:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
list_summation
list_summation:right-to-left
9, 3, 9, 4
9+4=13 ; 3+13=16 ; 9+16=25
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x-25=-50
5x-25=-50 ; x+-5=-10 ; x=-10--5 ; x=-5
sorting_algorithms
sorting_algorithms:selection-sort
9, 3, 7, 8, 1
[1,3,7,8,9] ; [1,3,7,8,9] ; [1,3,7,8,9] ; [1,3,7,8,9]
list_summation
list_summation:pairwise
8, 3, 9, 9
8+3=11 ; 9+9=18 ; 11+18=29
base_conversion
base_conversion:decomposition
n=143,base=4
TERM:2*4^3=128 ; TERM:0*4^2=0 ; TERM:3*4^1=12 ; TERM:3*4^0=3 ; OUT:2033
base_conversion
base_conversion:repeated-division
n=156,base=2
DIV:156/2=78,r:0 ; DIV:78/2=39,r:0 ; DIV:39/2=19,r:1 ; DIV:19/2=9,r:1 ; 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:10011100
sorting_algorithms
sorting_algorithms:insertion-sort
2, 4, 0, 9, 8
[2,4,0,9,8] ; [0,2,4,9,8] ; [0,2,4,9,8] ; [0,2,4,8,9]
base_conversion
base_conversion:decomposition
n=151,base=8
TERM:2*8^2=128 ; TERM:2*8^1=16 ; TERM:7*8^0=7 ; OUT:227
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-12=-16
2x-12=-16 ; x+-6=-8 ; x=-8--6 ; x=-2
list_summation
list_summation:left-to-right
5, 1, 2, 4
5+1=6 ; 6+2=8 ; 8+4=12
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x+36=0
9x+36=0 ; x+4=0 ; x=0-4 ; x=-4
multidigit_addition
multidigit_addition:rounding-decomposition
939+297
round:940+297=1237 ; adjust:1237-1=1236 ; sum=1236
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x+30=18
6x+30=18 ; 6x=-12 ; x=-2
list_summation
list_summation:pairwise
0, 8, 5, 3
0+8=8 ; 5+3=8 ; 8+8=16
sorting_algorithms
sorting_algorithms:selection-sort
2, 3, 6, 4, 1
[1,3,6,4,2] ; [1,2,6,4,3] ; [1,2,3,4,6] ; [1,2,3,4,6]
list_summation
list_summation:right-to-left
3, 0, 2, 2
2+2=4 ; 0+4=4 ; 3+4=7
list_summation
list_summation:pairwise
3, 5, 5, 0
3+5=8 ; 5+0=5 ; 8+5=13
multidigit_addition
multidigit_addition:right-to-left-carry
526+411
d2:6+1+0=7→w7,c0 ; d1:2+1+0=3→w3,c0 ; d0:5+4+0=9→w9,c0 ; sum=937
list_summation
list_summation:left-to-right
2, 3, 7, 6
2+3=5 ; 5+7=12 ; 12+6=18
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,1) ; G=(3,2)
R:(0,2) ; D:(1,2) ; D:(2,2) ; D:(3,2)
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x+10=15
5x+10=15 ; x+2=3 ; x=3-2 ; x=1
sorting_algorithms
sorting_algorithms:insertion-sort
8, 0, 5, 2, 6
[0,8,5,2,6] ; [0,5,8,2,6] ; [0,2,5,8,6] ; [0,2,5,6,8]
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
2, 1, 1, 0
1+0=1 ; 1+1=2 ; 2+2=4
base_conversion
base_conversion:repeated-division
n=123,base=4
DIV:123/4=30,r:3 ; DIV:30/4=7,r:2 ; DIV:7/4=1,r:3 ; DIV:1/4=0,r:1 ; OUT:1323
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,2) ; G=(5,4)
R:(3,3) ; D:(4,3) ; R:(4,4) ; D:(5,4)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,1) ; G=(5,3)
R:(4,2) ; R:(4,3) ; D:(5,3)
multidigit_addition
multidigit_addition:rounding-decomposition
959+808
round:960+808=1768 ; adjust:1768-1=1767 ; sum=1767
multidigit_addition
multidigit_addition:rounding-decomposition
875+981
round:880+981=1861 ; adjust:1861-5=1856 ; sum=1856
grid_pathfinding
grid_pathfinding:alternating
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:right-first
grid=6 ; S=(0,0) ; G=(4,4)
R:(0,1) ; R:(0,2) ; R:(0,3) ; R:(0,4) ; D:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4)
sorting_algorithms
sorting_algorithms:heap-sort
9, 0, 6, 1, 4
[9,4,6,1,0] ; [0,4,6,1,9] ; [6,4,0,1,9] ; [1,4,0,6,9] ; [4,1,0,6,9] ; [0,1,4,6,9] ; [1,0,4,6,9] ; [0,1,4,6,9]
multidigit_addition
multidigit_addition:rounding-decomposition
114+616
round:120+616=736 ; adjust:736-6=730 ; sum=730
base_conversion
base_conversion:via-binary
n=75,base=8
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:3 ; OUT:113
linear_equation_solving
linear_equation_solving:inverse-ops
7x+28=7
7x+28=7 ; x=(7-28)/7 ; x=-21/7 ; x=-3
multidigit_addition
multidigit_addition:right-to-left-carry
805+537
d2:5+7+0=12→w2,c1 ; d1:0+3+1=4→w4,c0 ; d0:8+5+0=13→w3,c1 ; sum=1342
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,2) ; G=(4,5)
R:(0,3) ; D:(1,3) ; R:(1,4) ; D:(2,4) ; R:(2,5) ; D:(3,5) ; D:(4,5)
sorting_algorithms
sorting_algorithms:insertion-sort
9, 5, 1, 3, 6
[5,9,1,3,6] ; [1,5,9,3,6] ; [1,3,5,9,6] ; [1,3,5,6,9]
list_summation
list_summation:right-to-left
3, 3, 8, 2
8+2=10 ; 3+10=13 ; 3+13=16
base_conversion
base_conversion:via-binary
n=249,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:7 ; CHUNK:2:1 ; OUT:371
linear_equation_solving
linear_equation_solving:inverse-ops
4x-24=-44
4x-24=-44 ; x=(-44--24)/4 ; x=-20/4 ; x=-5
list_summation
list_summation:left-to-right
8, 6, 5, 9
8+6=14 ; 14+5=19 ; 19+9=28
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,0) ; G=(4,1)
D:(2,0) ; D:(3,0) ; D:(4,0) ; R:(4,1)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,2) ; G=(5,3)
D:(3,2) ; D:(4,2) ; D:(5,2) ; R:(5,3)
multidigit_addition
multidigit_addition:rounding-decomposition
857+299
round:860+299=1159 ; adjust:1159-3=1156 ; sum=1156
list_summation
list_summation:left-to-right
8, 6, 7, 2
8+6=14 ; 14+7=21 ; 21+2=23
list_summation
list_summation:pairwise
1, 0, 8, 5
1+0=1 ; 8+5=13 ; 1+13=14
multidigit_addition
multidigit_addition:left-to-right-partials
863+340
p100:800+300=1100 ; p10:60+40=100 ; p1:3+0=3 ; sum=1100+100+3=1203
multidigit_addition
multidigit_addition:right-to-left-carry
159+617
d2:9+7+0=16→w6,c1 ; d1:5+1+1=7→w7,c0 ; d0:1+6+0=7→w7,c0 ; sum=776
list_summation
list_summation:pairwise
6, 4, 6, 3
6+4=10 ; 6+3=9 ; 10+9=19
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x+42=49
7x+42=49 ; 7x=7 ; x=1
multidigit_addition
multidigit_addition:rounding-decomposition
713+473
round:720+473=1193 ; adjust:1193-7=1186 ; sum=1186
multidigit_addition
multidigit_addition:left-to-right-partials
737+828
p100:700+800=1500 ; p10:30+20=50 ; p1:7+8=15 ; sum=1500+50+15=1565
multidigit_addition
multidigit_addition:left-to-right-partials
191+830
p100:100+800=900 ; p10:90+30=120 ; p1:1+0=1 ; sum=900+120+1=1021
base_conversion
base_conversion:via-binary
n=62,base=8
BINLEN:6 ; CHUNK:0:7 ; CHUNK:1:6 ; OUT:76
sorting_algorithms
sorting_algorithms:heap-sort
0, 8, 3, 7, 4
[8,0,3,7,4] ; [8,7,3,0,4] ; [4,7,3,0,8] ; [7,4,3,0,8] ; [0,4,3,7,8] ; [4,0,3,7,8] ; [3,0,4,7,8] ; [0,3,4,7,8]
multidigit_addition
multidigit_addition:right-to-left-carry
555+413
d2:5+3+0=8→w8,c0 ; d1:5+1+0=6→w6,c0 ; d0:5+4+0=9→w9,c0 ; sum=968
base_conversion
base_conversion:via-binary
n=144,base=16
BINLEN:8 ; CHUNK:0:9 ; CHUNK:1:0 ; OUT:90
sorting_algorithms
sorting_algorithms:bubble-sort
0, 4, 8, 3, 7
[0,4,3,8,7] ; [0,4,3,7,8] ; [0,3,4,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)
list_summation
list_summation:left-to-right
3, 7, 1, 0
3+7=10 ; 10+1=11 ; 11+0=11
sorting_algorithms
sorting_algorithms:insertion-sort
4, 5, 8, 3, 2
[4,5,8,3,2] ; [4,5,8,3,2] ; [3,4,5,8,2] ; [2,3,4,5,8]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,3) ; G=(3,4)
R:(1,4) ; D:(2,4) ; D:(3,4)
base_conversion
base_conversion:repeated-division
n=172,base=8
DIV:172/8=21,r:4 ; DIV:21/8=2,r:5 ; DIV:2/8=0,r:2 ; OUT:254
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,2) ; G=(2,3)
D:(2,2) ; R:(2,3)
linear_equation_solving
linear_equation_solving:inverse-ops
4x+12=44
4x+12=44 ; x=(44-12)/4 ; x=32/4 ; x=8
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-24=6
6x-24=6 ; 6x=30 ; x=5
linear_equation_solving
linear_equation_solving:inverse-ops
6x+12=0
6x+12=0 ; x=(0-12)/6 ; x=-12/6 ; x=-2
base_conversion
base_conversion:repeated-division
n=12,base=4
DIV:12/4=3,r:0 ; DIV:3/4=0,r:3 ; OUT:30
sorting_algorithms
sorting_algorithms:merge-sort
5, 3, 0, 7, 8
[3,5,0,7,8] ; [0,3,5,7,8]
base_conversion
base_conversion:via-binary
n=229,base=4
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:2 ; CHUNK:2:1 ; CHUNK:3:1 ; OUT:3211
sorting_algorithms
sorting_algorithms:bubble-sort
2, 8, 3, 4, 9
[2,3,8,4,9] ; [2,3,4,8,9]
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
3, 6, 9, 0, 8
[3,8,9,0,6] ; [9,8,3,0,6] ; [6,8,3,0,9] ; [8,6,3,0,9] ; [0,6,3,8,9] ; [6,0,3,8,9] ; [3,0,6,8,9] ; [0,3,6,8,9]
list_summation
list_summation:right-to-left
2, 4, 4, 1
4+1=5 ; 4+5=9 ; 2+9=11