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
738+916
p100:700+900=1600 ; p10:30+10=40 ; p1:8+6=14 ; sum=1600+40+14=1654
sorting_algorithms
sorting_algorithms:bubble-sort
1, 6, 3, 2, 5
[1,3,6,2,5] ; [1,3,2,6,5] ; [1,3,2,5,6] ; [1,2,3,5,6]
multidigit_addition
multidigit_addition:right-to-left-carry
103+195
d2:3+5+0=8→w8,c0 ; d1:0+9+0=9→w9,c0 ; d0:1+1+0=2→w2,c0 ; sum=298
sorting_algorithms
sorting_algorithms:insertion-sort
2, 4, 9, 5, 6
[2,4,9,5,6] ; [2,4,9,5,6] ; [2,4,5,9,6] ; [2,4,5,6,9]
sorting_algorithms
sorting_algorithms:insertion-sort
4, 6, 1, 0, 7
[4,6,1,0,7] ; [1,4,6,0,7] ; [0,1,4,6,7] ; [0,1,4,6,7]
sorting_algorithms
sorting_algorithms:bubble-sort
6, 0, 2, 9, 8
[0,6,2,9,8] ; [0,2,6,9,8] ; [0,2,6,8,9]
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: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)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,0) ; G=(5,5)
R:(1,1) ; D:(2,1) ; R:(2,2) ; D:(3,2) ; R:(3,3) ; D:(4,3) ; R:(4,4) ; D:(5,4) ; R:(5,5)
sorting_algorithms
sorting_algorithms:heap-sort
3, 8, 5, 0, 1
[8,3,5,0,1] ; [1,3,5,0,8] ; [5,3,1,0,8] ; [0,3,1,5,8] ; [3,0,1,5,8] ; [1,0,3,5,8] ; [0,1,3,5,8]
sorting_algorithms
sorting_algorithms:merge-sort
6, 2, 7, 8, 5
[2,6,7,8,5] ; [2,5,6,7,8]
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+9=15
3x+9=15 ; 3x=6 ; x=2
linear_equation_solving
linear_equation_solving:inverse-ops
6x+12=66
6x+12=66 ; x=(66-12)/6 ; x=54/6 ; x=9
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-48=-42
6x-48=-42 ; 6x=6 ; x=1
base_conversion
base_conversion:decomposition
n=7,base=8
TERM:7*8^0=7 ; OUT:7
multidigit_addition
multidigit_addition:right-to-left-carry
825+530
d2:5+0+0=5→w5,c0 ; d1:2+3+0=5→w5,c0 ; d0:8+5+0=13→w3,c1 ; sum=1355
base_conversion
base_conversion:via-binary
n=165,base=4
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:2 ; CHUNK:2:1 ; CHUNK:3:1 ; OUT:2211
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,0) ; G=(3,1)
R:(1,1) ; D:(2,1) ; D:(3,1)
multidigit_addition
multidigit_addition:right-to-left-carry
990+147
d2:0+7+0=7→w7,c0 ; d1:9+4+0=13→w3,c1 ; d0:9+1+1=11→w1,c1 ; sum=1137
sorting_algorithms
sorting_algorithms:heap-sort
0, 8, 6, 5, 4
[8,0,6,5,4] ; [8,5,6,0,4] ; [4,5,6,0,8] ; [6,5,4,0,8] ; [0,5,4,6,8] ; [5,0,4,6,8] ; [4,0,5,6,8] ; [0,4,5,6,8]
list_summation
list_summation:pairwise
5, 1, 0, 8
5+1=6 ; 0+8=8 ; 6+8=14
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x+27=-27
9x+27=-27 ; x+3=-3 ; x=-3-3 ; x=-6
linear_equation_solving
linear_equation_solving:inverse-ops
9x-81=0
9x-81=0 ; x=(0--81)/9 ; x=81/9 ; x=9
multidigit_addition
multidigit_addition:left-to-right-partials
313+808
p100:300+800=1100 ; p10:10+0=10 ; p1:3+8=11 ; sum=1100+10+11=1121
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x+14=28
7x+14=28 ; 7x=14 ; x=2
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,4) ; G=(2,5)
R:(0,5) ; D:(1,5) ; D:(2,5)
multidigit_addition
multidigit_addition:right-to-left-carry
555+292
d2:5+2+0=7→w7,c0 ; d1:5+9+0=14→w4,c1 ; d0:5+2+1=8→w8,c0 ; sum=847
list_summation
list_summation:right-to-left
1, 6, 3, 4
3+4=7 ; 6+7=13 ; 1+13=14
base_conversion
base_conversion:via-binary
n=158,base=16
BINLEN:8 ; CHUNK:0:9 ; CHUNK:1:14 ; OUT:9E
multidigit_addition
multidigit_addition:left-to-right-partials
897+500
p100:800+500=1300 ; p10:90+0=90 ; p1:7+0=7 ; sum=1300+90+7=1397
base_conversion
base_conversion:decomposition
n=150,base=16
TERM:9*16^1=144 ; TERM:6*16^0=6 ; OUT:96
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,1) ; G=(3,3)
R:(0,2) ; R:(0,3) ; D:(1,3) ; D:(2,3) ; D:(3,3)
multidigit_addition
multidigit_addition:right-to-left-carry
664+416
d2:4+6+0=10→w0,c1 ; d1:6+1+1=8→w8,c0 ; d0:6+4+0=10→w0,c1 ; sum=1080
sorting_algorithms
sorting_algorithms:heap-sort
1, 3, 0, 9, 6
[1,9,0,3,6] ; [9,1,0,3,6] ; [9,6,0,3,1] ; [1,6,0,3,9] ; [6,1,0,3,9] ; [6,3,0,1,9] ; [1,3,0,6,9] ; [3,1,0,6,9] ; [0,1,3,6,9] ; [1,0,3,6,9] ; [0,1,3,6,9]
sorting_algorithms
sorting_algorithms:heap-sort
0, 8, 2, 1, 7
[8,0,2,1,7] ; [8,7,2,1,0] ; [0,7,2,1,8] ; [7,0,2,1,8] ; [7,1,2,0,8] ; [0,1,2,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
2x-16=-4
2x-16=-4 ; 2x=12 ; x=6
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
2x+2=12
2x+2=12 ; 2x=10 ; x=5
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x-36=27
9x-36=27 ; x+-4=3 ; x=3--4 ; x=7
sorting_algorithms
sorting_algorithms:insertion-sort
7, 4, 9, 3, 6
[4,7,9,3,6] ; [4,7,9,3,6] ; [3,4,7,9,6] ; [3,4,6,7,9]
list_summation
list_summation:left-to-right
4, 3, 8, 2
4+3=7 ; 7+8=15 ; 15+2=17
base_conversion
base_conversion:decomposition
n=13,base=2
TERM:1*2^3=8 ; TERM:1*2^2=4 ; TERM:0*2^1=0 ; TERM:1*2^0=1 ; OUT:1101
sorting_algorithms
sorting_algorithms:bubble-sort
6, 1, 2, 7, 5
[1,6,2,7,5] ; [1,2,6,7,5] ; [1,2,6,5,7] ; [1,2,5,6,7]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,1) ; G=(4,4)
D:(2,1) ; D:(3,1) ; D:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4)
base_conversion
base_conversion:repeated-division
n=83,base=2
DIV:83/2=41,r:1 ; DIV:41/2=20,r:1 ; DIV:20/2=10,r:0 ; DIV:10/2=5,r:0 ; DIV:5/2=2,r:1 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:1010011
sorting_algorithms
sorting_algorithms:selection-sort
7, 5, 4, 8, 2
[2,5,4,8,7] ; [2,4,5,8,7] ; [2,4,5,8,7] ; [2,4,5,7,8]
linear_equation_solving
linear_equation_solving:inverse-ops
7x+7=-28
7x+7=-28 ; x=(-28-7)/7 ; x=-35/7 ; x=-5
sorting_algorithms
sorting_algorithms:bubble-sort
1, 9, 0, 8, 4
[1,0,9,8,4] ; [1,0,8,9,4] ; [1,0,8,4,9] ; [0,1,8,4,9] ; [0,1,4,8,9]
list_summation
list_summation:right-to-left
5, 8, 2, 6
2+6=8 ; 8+8=16 ; 5+16=21
linear_equation_solving
linear_equation_solving:inverse-ops
4x+12=28
4x+12=28 ; x=(28-12)/4 ; x=16/4 ; x=4
base_conversion
base_conversion:via-binary
n=205,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:1 ; CHUNK:2:5 ; OUT:315
base_conversion
base_conversion:decomposition
n=52,base=2
TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:0*2^3=0 ; TERM:1*2^2=4 ; TERM:0*2^1=0 ; TERM:0*2^0=0 ; OUT:110100
list_summation
list_summation:left-to-right
2, 7, 6, 9
2+7=9 ; 9+6=15 ; 15+9=24
base_conversion
base_conversion:via-binary
n=255,base=4
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:3 ; CHUNK:2:3 ; CHUNK:3:3 ; OUT:3333
list_summation
list_summation:pairwise
1, 8, 3, 5
1+8=9 ; 3+5=8 ; 9+8=17
sorting_algorithms
sorting_algorithms:insertion-sort
3, 5, 7, 8, 2
[3,5,7,8,2] ; [3,5,7,8,2] ; [3,5,7,8,2] ; [2,3,5,7,8]
base_conversion
base_conversion:decomposition
n=15,base=4
TERM:3*4^1=12 ; TERM:3*4^0=3 ; OUT:33
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x-56=-16
8x-56=-16 ; 8x=40 ; x=5
base_conversion
base_conversion:repeated-division
n=197,base=16
DIV:197/16=12,r:5 ; DIV:12/16=0,r:12 ; OUT:C5
list_summation
list_summation:pairwise
4, 7, 1, 8
4+7=11 ; 1+8=9 ; 11+9=20
multidigit_addition
multidigit_addition:rounding-decomposition
128+955
round:130+955=1085 ; adjust:1085-2=1083 ; sum=1083
base_conversion
base_conversion:via-binary
n=136,base=4
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:0 ; CHUNK:2:2 ; CHUNK:3:0 ; OUT:2020
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,4) ; G=(3,5)
R:(2,5) ; D:(3,5)
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x-8=-22
2x-8=-22 ; 2x=-14 ; x=-7
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,1) ; G=(4,3)
R:(3,2) ; R:(3,3) ; D:(4,3)
list_summation
list_summation:pairwise
5, 7, 6, 8
5+7=12 ; 6+8=14 ; 12+14=26
list_summation
list_summation:pairwise
2, 2, 3, 4
2+2=4 ; 3+4=7 ; 4+7=11
base_conversion
base_conversion:repeated-division
n=191,base=2
DIV:191/2=95,r:1 ; DIV:95/2=47,r:1 ; DIV:47/2=23,r:1 ; DIV:23/2=11,r:1 ; DIV:11/2=5,r:1 ; DIV:5/2=2,r:1 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:10111111
linear_equation_solving
linear_equation_solving:inverse-ops
8x-72=-24
8x-72=-24 ; x=(-24--72)/8 ; x=48/8 ; x=6
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,1) ; G=(5,3)
R:(4,2) ; D:(5,2) ; R:(5,3)
list_summation
list_summation:pairwise
8, 9, 7, 8
8+9=17 ; 7+8=15 ; 17+15=32
multidigit_addition
multidigit_addition:right-to-left-carry
612+930
d2:2+0+0=2→w2,c0 ; d1:1+3+0=4→w4,c0 ; d0:6+9+0=15→w5,c1 ; sum=1542
sorting_algorithms
sorting_algorithms:heap-sort
8, 2, 6, 0, 9
[8,9,6,0,2] ; [9,8,6,0,2] ; [2,8,6,0,9] ; [8,2,6,0,9] ; [0,2,6,8,9] ; [6,2,0,8,9] ; [0,2,6,8,9] ; [2,0,6,8,9] ; [0,2,6,8,9]
sorting_algorithms
sorting_algorithms:heap-sort
8, 4, 1, 3, 5
[8,5,1,3,4] ; [4,5,1,3,8] ; [5,4,1,3,8] ; [3,4,1,5,8] ; [4,3,1,5,8] ; [1,3,4,5,8] ; [3,1,4,5,8] ; [1,3,4,5,8]
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
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x-15=-21
3x-15=-21 ; x+-5=-7 ; x=-7--5 ; x=-2
list_summation
list_summation:pairwise
3, 7, 2, 9
3+7=10 ; 2+9=11 ; 10+11=21
list_summation
list_summation:left-to-right
4, 7, 1, 8
4+7=11 ; 11+1=12 ; 12+8=20
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,3) ; G=(2,4)
R:(1,4) ; D:(2,4)
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x+48=80
8x+48=80 ; x+6=10 ; x=10-6 ; x=4
linear_equation_solving
linear_equation_solving:inverse-ops
8x-56=-72
8x-56=-72 ; x=(-72--56)/8 ; x=-16/8 ; x=-2
base_conversion
base_conversion:decomposition
n=11,base=4
TERM:2*4^1=8 ; TERM:3*4^0=3 ; OUT:23
base_conversion
base_conversion:repeated-division
n=150,base=4
DIV:150/4=37,r:2 ; DIV:37/4=9,r:1 ; DIV:9/4=2,r:1 ; DIV:2/4=0,r:2 ; OUT:2112
base_conversion
base_conversion:via-binary
n=59,base=4
BINLEN:6 ; CHUNK:0:3 ; CHUNK:1:2 ; CHUNK:2:3 ; OUT:323
base_conversion
base_conversion:repeated-division
n=92,base=2
DIV:92/2=46,r:0 ; DIV:46/2=23,r:0 ; DIV:23/2=11,r:1 ; DIV:11/2=5,r:1 ; DIV:5/2=2,r:1 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:1011100
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,3) ; G=(5,5)
D:(5,3) ; R:(5,4) ; R:(5,5)
multidigit_addition
multidigit_addition:right-to-left-carry
870+179
d2:0+9+0=9→w9,c0 ; d1:7+7+0=14→w4,c1 ; d0:8+1+1=10→w0,c1 ; sum=1049
list_summation
list_summation:pairwise
1, 1, 4, 7
1+1=2 ; 4+7=11 ; 2+11=13
list_summation
list_summation:pairwise
5, 8, 7, 1
5+8=13 ; 7+1=8 ; 13+8=21
list_summation
list_summation:left-to-right
4, 6, 9, 1
4+6=10 ; 10+9=19 ; 19+1=20
list_summation
list_summation:right-to-left
2, 7, 0, 8
0+8=8 ; 7+8=15 ; 2+15=17
base_conversion
base_conversion:via-binary
n=242,base=4
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:3 ; CHUNK:2:0 ; CHUNK:3:2 ; OUT:3302
base_conversion
base_conversion:repeated-division
n=86,base=8
DIV:86/8=10,r:6 ; DIV:10/8=1,r:2 ; DIV:1/8=0,r:1 ; OUT:126
multidigit_addition
multidigit_addition:rounding-decomposition
833+673
round:840+673=1513 ; adjust:1513-7=1506 ; sum=1506
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x+42=70
7x+42=70 ; x+6=10 ; x=10-6 ; x=4
base_conversion
base_conversion:via-binary
n=30,base=4
BINLEN:5 ; CHUNK:0:1 ; CHUNK:1:3 ; CHUNK:2:2 ; OUT:132
list_summation
list_summation:right-to-left
3, 9, 8, 3
8+3=11 ; 9+11=20 ; 3+20=23
multidigit_addition
multidigit_addition:left-to-right-partials
892+998
p100:800+900=1700 ; p10:90+90=180 ; p1:2+8=10 ; sum=1700+180+10=1890
list_summation
list_summation:right-to-left
9, 4, 0, 0
0+0=0 ; 4+0=4 ; 9+4=13
list_summation
list_summation:right-to-left
4, 8, 5, 6
5+6=11 ; 8+11=19 ; 4+19=23