task_name
stringclasses
6 values
strategy_id
stringclasses
20 values
input_text
stringlengths
6
26
reasoning_trace
stringlengths
11
152
multidigit_addition
multidigit_addition:left-to-right-partials
877+980
p100:800+900=1700 ; p10:70+80=150 ; p1:7+0=7 ; sum=1700+150+7=1857
base_conversion
base_conversion:via-binary
n=242,base=16
BINLEN:8 ; CHUNK:0:15 ; CHUNK:1:2 ; OUT:F2
list_summation
list_summation:left-to-right
3, 9, 4, 9
3+9=12 ; 12+4=16 ; 16+9=25
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,4) ; G=(3,5)
R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5)
sorting_algorithms
sorting_algorithms:heap-sort
3, 9, 5, 8, 4
[9,3,5,8,4] ; [9,8,5,3,4] ; [4,8,5,3,9] ; [8,4,5,3,9] ; [3,4,5,8,9] ; [5,4,3,8,9] ; [3,4,5,8,9] ; [4,3,5,8,9] ; [3,4,5,8,9]
multidigit_addition
multidigit_addition:rounding-decomposition
251+534
round:260+534=794 ; adjust:794-9=785 ; sum=785
list_summation
list_summation:right-to-left
4, 6, 7, 6
7+6=13 ; 6+13=19 ; 4+19=23
base_conversion
base_conversion:repeated-division
n=239,base=4
DIV:239/4=59,r:3 ; DIV:59/4=14,r:3 ; DIV:14/4=3,r:2 ; DIV:3/4=0,r:3 ; OUT:3233
sorting_algorithms
sorting_algorithms:insertion-sort
1, 3, 2, 0, 4
[1,3,2,0,4] ; [1,2,3,0,4] ; [0,1,2,3,4] ; [0,1,2,3,4]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,2) ; G=(5,5)
D:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
base_conversion
base_conversion:repeated-division
n=34,base=8
DIV:34/8=4,r:2 ; DIV:4/8=0,r:4 ; OUT:42
multidigit_addition
multidigit_addition:left-to-right-partials
470+535
p100:400+500=900 ; p10:70+30=100 ; p1:0+5=5 ; sum=900+100+5=1005
sorting_algorithms
sorting_algorithms:heap-sort
7, 8, 6, 3, 4
[8,7,6,3,4] ; [4,7,6,3,8] ; [7,4,6,3,8] ; [3,4,6,7,8] ; [6,4,3,7,8] ; [3,4,6,7,8] ; [4,3,6,7,8] ; [3,4,6,7,8]
linear_equation_solving
linear_equation_solving:inverse-ops
7x+21=-28
7x+21=-28 ; x=(-28-21)/7 ; x=-49/7 ; x=-7
multidigit_addition
multidigit_addition:right-to-left-carry
854+285
d2:4+5+0=9→w9,c0 ; d1:5+8+0=13→w3,c1 ; d0:8+2+1=11→w1,c1 ; sum=1139
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x+0=28
4x+0=28 ; x+0=7 ; x=7-0 ; x=7
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,3) ; G=(5,5)
R:(2,4) ; R:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
list_summation
list_summation:pairwise
9, 8, 4, 7
9+8=17 ; 4+7=11 ; 17+11=28
base_conversion
base_conversion:decomposition
n=18,base=2
TERM:1*2^4=16 ; TERM:0*2^3=0 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:10010
list_summation
list_summation:right-to-left
4, 4, 3, 8
3+8=11 ; 4+11=15 ; 4+15=19
linear_equation_solving
linear_equation_solving:inverse-ops
8x-48=-64
8x-48=-64 ; x=(-64--48)/8 ; x=-16/8 ; x=-2
sorting_algorithms
sorting_algorithms:heap-sort
0, 7, 5, 8, 6
[0,8,5,7,6] ; [8,0,5,7,6] ; [8,7,5,0,6] ; [6,7,5,0,8] ; [7,6,5,0,8] ; [0,6,5,7,8] ; [6,0,5,7,8] ; [5,0,6,7,8] ; [0,5,6,7,8]
base_conversion
base_conversion:decomposition
n=192,base=4
TERM:3*4^3=192 ; TERM:0*4^2=0 ; TERM:0*4^1=0 ; TERM:0*4^0=0 ; OUT:3000
base_conversion
base_conversion:decomposition
n=230,base=4
TERM:3*4^3=192 ; TERM:2*4^2=32 ; TERM:1*4^1=4 ; TERM:2*4^0=2 ; OUT:3212
multidigit_addition
multidigit_addition:rounding-decomposition
892+258
round:900+258=1158 ; adjust:1158-8=1150 ; sum=1150
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x-6=-30
6x-6=-30 ; x+-1=-5 ; x=-5--1 ; x=-4
base_conversion
base_conversion:via-binary
n=41,base=8
BINLEN:6 ; CHUNK:0:5 ; CHUNK:1:1 ; OUT:51
multidigit_addition
multidigit_addition:right-to-left-carry
531+908
d2:1+8+0=9→w9,c0 ; d1:3+0+0=3→w3,c0 ; d0:5+9+0=14→w4,c1 ; sum=1439
multidigit_addition
multidigit_addition:right-to-left-carry
458+715
d2:8+5+0=13→w3,c1 ; d1:5+1+1=7→w7,c0 ; d0:4+7+0=11→w1,c1 ; sum=1173
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x-32=-48
4x-32=-48 ; x+-8=-12 ; x=-12--8 ; x=-4
base_conversion
base_conversion:repeated-division
n=56,base=8
DIV:56/8=7,r:0 ; DIV:7/8=0,r:7 ; OUT:70
sorting_algorithms
sorting_algorithms:selection-sort
3, 6, 7, 9, 5
[3,6,7,9,5] ; [3,5,7,9,6] ; [3,5,6,9,7] ; [3,5,6,7,9]
base_conversion
base_conversion:decomposition
n=220,base=8
TERM:3*8^2=192 ; TERM:3*8^1=24 ; TERM:4*8^0=4 ; OUT:334
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,1) ; G=(5,2)
D:(5,1) ; R:(5,2)
sorting_algorithms
sorting_algorithms:selection-sort
9, 5, 2, 0, 3
[0,5,2,9,3] ; [0,2,5,9,3] ; [0,2,3,9,5] ; [0,2,3,5,9]
sorting_algorithms
sorting_algorithms:heap-sort
7, 1, 0, 2, 8
[7,8,0,2,1] ; [8,7,0,2,1] ; [1,7,0,2,8] ; [7,1,0,2,8] ; [7,2,0,1,8] ; [1,2,0,7,8] ; [2,1,0,7,8] ; [0,1,2,7,8] ; [1,0,2,7,8] ; [0,1,2,7,8]
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x+5=-15
5x+5=-15 ; 5x=-20 ; x=-4
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x+6=60
6x+6=60 ; 6x=54 ; x=9
list_summation
list_summation:right-to-left
8, 6, 5, 2
5+2=7 ; 6+7=13 ; 8+13=21
multidigit_addition
multidigit_addition:left-to-right-partials
990+788
p100:900+700=1600 ; p10:90+80=170 ; p1:0+8=8 ; sum=1600+170+8=1778
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,1) ; G=(5,2)
R:(4,2) ; D:(5,2)
base_conversion
base_conversion:decomposition
n=142,base=4
TERM:2*4^3=128 ; TERM:0*4^2=0 ; TERM:3*4^1=12 ; TERM:2*4^0=2 ; OUT:2032
sorting_algorithms
sorting_algorithms:bubble-sort
4, 2, 7, 9, 8
[2,4,7,9,8] ; [2,4,7,8,9]
base_conversion
base_conversion:decomposition
n=48,base=8
TERM:6*8^1=48 ; TERM:0*8^0=0 ; OUT:60
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,2) ; G=(1,5)
R:(0,3) ; R:(0,4) ; R:(0,5) ; D:(1,5)
sorting_algorithms
sorting_algorithms:bubble-sort
0, 9, 2, 5, 1
[0,2,9,5,1] ; [0,2,5,9,1] ; [0,2,5,1,9] ; [0,2,1,5,9] ; [0,1,2,5,9]
base_conversion
base_conversion:via-binary
n=158,base=4
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:1 ; CHUNK:2:3 ; CHUNK:3:2 ; OUT:2132
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,4) ; G=(4,5)
D:(3,4) ; D:(4,4) ; R:(4,5)
base_conversion
base_conversion:repeated-division
n=39,base=16
DIV:39/16=2,r:7 ; DIV:2/16=0,r:2 ; OUT:27
linear_equation_solving
linear_equation_solving:inverse-ops
2x+16=24
2x+16=24 ; x=(24-16)/2 ; x=8/2 ; x=4
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x-35=-63
7x-35=-63 ; x+-5=-9 ; x=-9--5 ; x=-4
sorting_algorithms
sorting_algorithms:bubble-sort
9, 1, 6, 8, 5
[1,9,6,8,5] ; [1,6,9,8,5] ; [1,6,8,9,5] ; [1,6,8,5,9] ; [1,6,5,8,9] ; [1,5,6,8,9]
base_conversion
base_conversion:repeated-division
n=77,base=2
DIV:77/2=38,r:1 ; DIV:38/2=19,r:0 ; 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:1001101
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,4) ; G=(4,5)
R:(2,5) ; D:(3,5) ; D:(4,5)
list_summation
list_summation:left-to-right
3, 2, 4, 2
3+2=5 ; 5+4=9 ; 9+2=11
base_conversion
base_conversion:via-binary
n=41,base=16
BINLEN:6 ; CHUNK:0:2 ; CHUNK:1:9 ; OUT:29
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x-8=-16
2x-8=-16 ; 2x=-8 ; x=-4
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,4) ; G=(5,5)
D:(5,4) ; R:(5,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,3) ; G=(5,5)
R:(4,4) ; R:(4,5) ; D:(5,5)
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)
multidigit_addition
multidigit_addition:rounding-decomposition
152+567
round:160+567=727 ; adjust:727-8=719 ; sum=719
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,2) ; G=(4,3)
R:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3)
sorting_algorithms
sorting_algorithms:insertion-sort
0, 5, 7, 3, 4
[0,5,7,3,4] ; [0,5,7,3,4] ; [0,3,5,7,4] ; [0,3,4,5,7]
linear_equation_solving
linear_equation_solving:inverse-ops
6x-18=-66
6x-18=-66 ; x=(-66--18)/6 ; x=-48/6 ; x=-8
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,1) ; G=(2,4)
R:(1,2) ; R:(1,3) ; R:(1,4) ; D:(2,4)
sorting_algorithms
sorting_algorithms:merge-sort
7, 4, 6, 2, 0
[4,7,6,2,0] ; [4,7,2,6,0] ; [2,4,6,7,0] ; [0,2,4,6,7]
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x-63=-84
7x-63=-84 ; x+-9=-12 ; x=-12--9 ; x=-3
list_summation
list_summation:right-to-left
8, 7, 5, 2
5+2=7 ; 7+7=14 ; 8+14=22
list_summation
list_summation:left-to-right
3, 6, 6, 8
3+6=9 ; 9+6=15 ; 15+8=23
multidigit_addition
multidigit_addition:left-to-right-partials
690+157
p100:600+100=700 ; p10:90+50=140 ; p1:0+7=7 ; sum=700+140+7=847
base_conversion
base_conversion:repeated-division
n=100,base=8
DIV:100/8=12,r:4 ; DIV:12/8=1,r:4 ; DIV:1/8=0,r:1 ; OUT:144
multidigit_addition
multidigit_addition:left-to-right-partials
416+735
p100:400+700=1100 ; p10:10+30=40 ; p1:6+5=11 ; sum=1100+40+11=1151
multidigit_addition
multidigit_addition:rounding-decomposition
584+925
round:590+925=1515 ; adjust:1515-6=1509 ; sum=1509
linear_equation_solving
linear_equation_solving:inverse-ops
4x+4=-24
4x+4=-24 ; x=(-24-4)/4 ; x=-28/4 ; x=-7
list_summation
list_summation:left-to-right
3, 3, 3, 1
3+3=6 ; 6+3=9 ; 9+1=10
multidigit_addition
multidigit_addition:right-to-left-carry
580+461
d2:0+1+0=1→w1,c0 ; d1:8+6+0=14→w4,c1 ; d0:5+4+1=10→w0,c1 ; sum=1041
multidigit_addition
multidigit_addition:right-to-left-carry
346+500
d2:6+0+0=6→w6,c0 ; d1:4+0+0=4→w4,c0 ; d0:3+5+0=8→w8,c0 ; sum=846
linear_equation_solving
linear_equation_solving:inverse-ops
8x+24=16
8x+24=16 ; x=(16-24)/8 ; x=-8/8 ; x=-1
linear_equation_solving
linear_equation_solving:inverse-ops
3x+15=33
3x+15=33 ; x=(33-15)/3 ; x=18/3 ; x=6
list_summation
list_summation:right-to-left
0, 8, 9, 5
9+5=14 ; 8+14=22 ; 0+22=22
list_summation
list_summation:pairwise
1, 8, 0, 3
1+8=9 ; 0+3=3 ; 9+3=12
list_summation
list_summation:right-to-left
4, 8, 3, 9
3+9=12 ; 8+12=20 ; 4+20=24
multidigit_addition
multidigit_addition:left-to-right-partials
695+831
p100:600+800=1400 ; p10:90+30=120 ; p1:5+1=6 ; sum=1400+120+6=1526
multidigit_addition
multidigit_addition:right-to-left-carry
244+511
d2:4+1+0=5→w5,c0 ; d1:4+1+0=5→w5,c0 ; d0:2+5+0=7→w7,c0 ; sum=755
sorting_algorithms
sorting_algorithms:bubble-sort
5, 0, 9, 6, 1
[0,5,9,6,1] ; [0,5,6,9,1] ; [0,5,6,1,9] ; [0,5,1,6,9] ; [0,1,5,6,9]
base_conversion
base_conversion:repeated-division
n=152,base=16
DIV:152/16=9,r:8 ; DIV:9/16=0,r:9 ; OUT:98
list_summation
list_summation:pairwise
6, 3, 5, 1
6+3=9 ; 5+1=6 ; 9+6=15
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x-21=-56
7x-21=-56 ; 7x=-35 ; x=-5
sorting_algorithms
sorting_algorithms:insertion-sort
7, 6, 2, 4, 0
[6,7,2,4,0] ; [2,6,7,4,0] ; [2,4,6,7,0] ; [0,2,4,6,7]
base_conversion
base_conversion:repeated-division
n=39,base=16
DIV:39/16=2,r:7 ; DIV:2/16=0,r:2 ; OUT:27
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x-35=-30
5x-35=-30 ; x+-7=-6 ; x=-6--7 ; x=1
base_conversion
base_conversion:repeated-division
n=128,base=2
DIV:128/2=64,r:0 ; DIV:64/2=32,r:0 ; DIV:32/2=16,r:0 ; DIV:16/2=8,r:0 ; DIV:8/2=4,r:0 ; DIV:4/2=2,r:0 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:10000000
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-14=-14
2x-14=-14 ; x+-7=-7 ; x=-7--7 ; x=0
list_summation
list_summation:pairwise
1, 5, 0, 0
1+5=6 ; 0+0=0 ; 6+0=6
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,1) ; G=(5,2)
R:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2)
sorting_algorithms
sorting_algorithms:heap-sort
7, 2, 1, 8, 6
[7,8,1,2,6] ; [8,7,1,2,6] ; [6,7,1,2,8] ; [7,6,1,2,8] ; [2,6,1,7,8] ; [6,2,1,7,8] ; [1,2,6,7,8] ; [2,1,6,7,8] ; [1,2,6,7,8]
base_conversion
base_conversion:decomposition
n=132,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:0*2^5=0 ; TERM:0*2^4=0 ; TERM:0*2^3=0 ; TERM:1*2^2=4 ; TERM:0*2^1=0 ; TERM:0*2^0=0 ; OUT:10000100
base_conversion
base_conversion:repeated-division
n=181,base=4
DIV:181/4=45,r:1 ; DIV:45/4=11,r:1 ; DIV:11/4=2,r:3 ; DIV:2/4=0,r:2 ; OUT:2311
base_conversion
base_conversion:via-binary
n=69,base=8
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:5 ; OUT:105
multidigit_addition
multidigit_addition:left-to-right-partials
454+464
p100:400+400=800 ; p10:50+60=110 ; p1:4+4=8 ; sum=800+110+8=918