task_name
stringclasses
6 values
strategy_id
stringclasses
20 values
input_text
stringlengths
6
26
reasoning_trace
stringlengths
11
152
base_conversion
base_conversion:repeated-division
n=188,base=2
DIV:188/2=94,r:0 ; DIV:94/2=47,r:0 ; 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:10111100
list_summation
list_summation:right-to-left
7, 6, 2, 4
2+4=6 ; 6+6=12 ; 7+12=19
linear_equation_solving
linear_equation_solving:inverse-ops
8x+64=104
8x+64=104 ; x=(104-64)/8 ; x=40/8 ; x=5
list_summation
list_summation:left-to-right
7, 4, 3, 4
7+4=11 ; 11+3=14 ; 14+4=18
base_conversion
base_conversion:decomposition
n=87,base=2
TERM:1*2^6=64 ; TERM:0*2^5=0 ; TERM:1*2^4=16 ; TERM:0*2^3=0 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:1010111
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x-12=-9
3x-12=-9 ; x+-4=-3 ; x=-3--4 ; x=1
multidigit_addition
multidigit_addition:left-to-right-partials
448+750
p100:400+700=1100 ; p10:40+50=90 ; p1:8+0=8 ; sum=1100+90+8=1198
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
base_conversion
base_conversion:repeated-division
n=115,base=8
DIV:115/8=14,r:3 ; DIV:14/8=1,r:6 ; DIV:1/8=0,r:1 ; OUT:163
base_conversion
base_conversion:repeated-division
n=81,base=2
DIV:81/2=40,r:1 ; DIV:40/2=20,r:0 ; 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:1010001
sorting_algorithms
sorting_algorithms:bubble-sort
7, 3, 0, 4, 5
[3,7,0,4,5] ; [3,0,7,4,5] ; [3,0,4,7,5] ; [3,0,4,5,7] ; [0,3,4,5,7]
list_summation
list_summation:pairwise
0, 5, 8, 4
0+5=5 ; 8+4=12 ; 5+12=17
list_summation
list_summation:right-to-left
6, 1, 3, 9
3+9=12 ; 1+12=13 ; 6+13=19
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,4) ; G=(5,5)
D:(5,4) ; R:(5,5)
base_conversion
base_conversion:via-binary
n=205,base=4
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:0 ; CHUNK:2:3 ; CHUNK:3:1 ; OUT:3031
linear_equation_solving
linear_equation_solving:inverse-ops
5x-5=20
5x-5=20 ; x=(20--5)/5 ; x=25/5 ; x=5
base_conversion
base_conversion:repeated-division
n=20,base=16
DIV:20/16=1,r:4 ; DIV:1/16=0,r:1 ; OUT:14
list_summation
list_summation:right-to-left
4, 0, 6, 2
6+2=8 ; 0+8=8 ; 4+8=12
sorting_algorithms
sorting_algorithms:heap-sort
8, 6, 7, 1, 0
[0,6,7,1,8] ; [7,6,0,1,8] ; [1,6,0,7,8] ; [6,1,0,7,8] ; [0,1,6,7,8] ; [1,0,6,7,8] ; [0,1,6,7,8]
multidigit_addition
multidigit_addition:right-to-left-carry
528+117
d2:8+7+0=15→w5,c1 ; d1:2+1+1=4→w4,c0 ; d0:5+1+0=6→w6,c0 ; sum=645
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+8=-2
2x+8=-2 ; 2x=-10 ; x=-5
list_summation
list_summation:pairwise
6, 4, 9, 7
6+4=10 ; 9+7=16 ; 10+16=26
linear_equation_solving
linear_equation_solving:inverse-ops
5x-30=-55
5x-30=-55 ; x=(-55--30)/5 ; x=-25/5 ; x=-5
sorting_algorithms
sorting_algorithms:insertion-sort
0, 9, 7, 8, 2
[0,9,7,8,2] ; [0,7,9,8,2] ; [0,7,8,9,2] ; [0,2,7,8,9]
multidigit_addition
multidigit_addition:right-to-left-carry
706+324
d2:6+4+0=10→w0,c1 ; d1:0+2+1=3→w3,c0 ; d0:7+3+0=10→w0,c1 ; sum=1030
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-6=0
6x-6=0 ; 6x=6 ; x=1
sorting_algorithms
sorting_algorithms:bubble-sort
7, 5, 1, 0, 3
[5,7,1,0,3] ; [5,1,7,0,3] ; [5,1,0,7,3] ; [5,1,0,3,7] ; [1,5,0,3,7] ; [1,0,5,3,7] ; [1,0,3,5,7] ; [0,1,3,5,7]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,3) ; G=(5,5)
R:(3,4) ; D:(4,4) ; R:(4,5) ; D:(5,5)
list_summation
list_summation:pairwise
8, 6, 4, 0
8+6=14 ; 4+0=4 ; 14+4=18
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,0) ; G=(4,5)
R:(1,1) ; R:(1,2) ; R:(1,3) ; R:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5)
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x+9=90
9x+9=90 ; 9x=81 ; x=9
multidigit_addition
multidigit_addition:left-to-right-partials
323+612
p100:300+600=900 ; p10:20+10=30 ; p1:3+2=5 ; sum=900+30+5=935
sorting_algorithms
sorting_algorithms:insertion-sort
3, 2, 9, 1, 6
[2,3,9,1,6] ; [2,3,9,1,6] ; [1,2,3,9,6] ; [1,2,3,6,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,3) ; G=(4,5)
R:(2,4) ; D:(3,4) ; R:(3,5) ; D:(4,5)
list_summation
list_summation:left-to-right
7, 1, 1, 2
7+1=8 ; 8+1=9 ; 9+2=11
base_conversion
base_conversion:decomposition
n=39,base=4
TERM:2*4^2=32 ; TERM:1*4^1=4 ; TERM:3*4^0=3 ; OUT:213
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,0) ; G=(5,2)
D:(5,0) ; R:(5,1) ; R:(5,2)
sorting_algorithms
sorting_algorithms:selection-sort
2, 6, 4, 7, 5
[2,6,4,7,5] ; [2,4,6,7,5] ; [2,4,5,7,6] ; [2,4,5,6,7]
multidigit_addition
multidigit_addition:right-to-left-carry
323+407
d2:3+7+0=10→w0,c1 ; d1:2+0+1=3→w3,c0 ; d0:3+4+0=7→w7,c0 ; sum=730
sorting_algorithms
sorting_algorithms:bubble-sort
9, 0, 5, 6, 7
[0,9,5,6,7] ; [0,5,9,6,7] ; [0,5,6,9,7] ; [0,5,6,7,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x+25=30
5x+25=30 ; 5x=5 ; x=1
base_conversion
base_conversion:repeated-division
n=34,base=4
DIV:34/4=8,r:2 ; DIV:8/4=2,r:0 ; DIV:2/4=0,r:2 ; OUT:202
base_conversion
base_conversion:repeated-division
n=44,base=16
DIV:44/16=2,r:12 ; DIV:2/16=0,r:2 ; OUT:2C
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,2) ; G=(5,4)
R:(2,3) ; R:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,3) ; G=(4,5)
R:(3,4) ; R:(3,5) ; D:(4,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,1) ; G=(4,5)
R:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5) ; D:(3,5) ; D:(4,5)
multidigit_addition
multidigit_addition:left-to-right-partials
899+730
p100:800+700=1500 ; p10:90+30=120 ; p1:9+0=9 ; sum=1500+120+9=1629
sorting_algorithms
sorting_algorithms:selection-sort
9, 4, 3, 2, 8
[2,4,3,9,8] ; [2,3,4,9,8] ; [2,3,4,9,8] ; [2,3,4,8,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,0) ; G=(4,4)
R:(2,1) ; D:(3,1) ; R:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,0) ; G=(5,2)
R:(2,1) ; R:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2)
linear_equation_solving
linear_equation_solving:inverse-ops
3x+24=51
3x+24=51 ; x=(51-24)/3 ; x=27/3 ; x=9
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,3) ; G=(4,5)
R:(1,4) ; D:(2,4) ; R:(2,5) ; D:(3,5) ; D:(4,5)
multidigit_addition
multidigit_addition:left-to-right-partials
102+703
p100:100+700=800 ; p10:0+0=0 ; p1:2+3=5 ; sum=800+0+5=805
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+16=20
4x+16=20 ; 4x=4 ; x=1
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,0) ; G=(1,5)
R:(0,1) ; D:(1,1) ; R:(1,2) ; R:(1,3) ; R:(1,4) ; R:(1,5)
base_conversion
base_conversion:via-binary
n=46,base=8
BINLEN:6 ; CHUNK:0:5 ; CHUNK:1:6 ; OUT:56
base_conversion
base_conversion:repeated-division
n=230,base=16
DIV:230/16=14,r:6 ; DIV:14/16=0,r:14 ; OUT:E6
base_conversion
base_conversion:decomposition
n=146,base=4
TERM:2*4^3=128 ; TERM:1*4^2=16 ; TERM:0*4^1=0 ; TERM:2*4^0=2 ; OUT:2102
base_conversion
base_conversion:repeated-division
n=236,base=4
DIV:236/4=59,r:0 ; DIV:59/4=14,r:3 ; DIV:14/4=3,r:2 ; DIV:3/4=0,r:3 ; OUT:3230
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x-63=-126
7x-63=-126 ; 7x=-63 ; x=-9
list_summation
list_summation:left-to-right
6, 2, 9, 9
6+2=8 ; 8+9=17 ; 17+9=26
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,2) ; G=(4,4)
R:(2,3) ; R:(2,4) ; D:(3,4) ; D:(4,4)
sorting_algorithms
sorting_algorithms:heap-sort
6, 7, 4, 5, 3
[7,6,4,5,3] ; [3,6,4,5,7] ; [6,3,4,5,7] ; [6,5,4,3,7] ; [3,5,4,6,7] ; [5,3,4,6,7] ; [4,3,5,6,7] ; [3,4,5,6,7]
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x-35=-45
5x-35=-45 ; 5x=-10 ; x=-2
sorting_algorithms
sorting_algorithms:heap-sort
1, 0, 9, 2, 4
[1,4,9,2,0] ; [9,4,1,2,0] ; [0,4,1,2,9] ; [4,0,1,2,9] ; [4,2,1,0,9] ; [0,2,1,4,9] ; [2,0,1,4,9] ; [1,0,2,4,9] ; [0,1,2,4,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,2) ; G=(5,3)
R:(4,3) ; D:(5,3)
linear_equation_solving
linear_equation_solving:inverse-ops
4x+8=20
4x+8=20 ; x=(20-8)/4 ; x=12/4 ; x=3
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x-36=-48
6x-36=-48 ; x+-6=-8 ; x=-8--6 ; x=-2
linear_equation_solving
linear_equation_solving:inverse-ops
4x+24=8
4x+24=8 ; x=(8-24)/4 ; x=-16/4 ; x=-4
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+0=-8
2x+0=-8 ; 2x=-8 ; x=-4
list_summation
list_summation:left-to-right
4, 8, 6, 4
4+8=12 ; 12+6=18 ; 18+4=22
list_summation
list_summation:left-to-right
9, 1, 9, 6
9+1=10 ; 10+9=19 ; 19+6=25
base_conversion
base_conversion:via-binary
n=121,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:3 ; CHUNK:2:2 ; CHUNK:3:1 ; OUT:1321
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,3) ; G=(5,4)
D:(5,3) ; R:(5,4)
base_conversion
base_conversion:repeated-division
n=157,base=16
DIV:157/16=9,r:13 ; DIV:9/16=0,r:9 ; OUT:9D
list_summation
list_summation:right-to-left
0, 9, 1, 6
1+6=7 ; 9+7=16 ; 0+16=16
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,4) ; G=(4,5)
D:(2,4) ; D:(3,4) ; D:(4,4) ; R:(4,5)
sorting_algorithms
sorting_algorithms:heap-sort
7, 9, 8, 4, 3
[9,7,8,4,3] ; [3,7,8,4,9] ; [8,7,3,4,9] ; [4,7,3,8,9] ; [7,4,3,8,9] ; [3,4,7,8,9] ; [4,3,7,8,9] ; [3,4,7,8,9]
list_summation
list_summation:pairwise
8, 2, 9, 2
8+2=10 ; 9+2=11 ; 10+11=21
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x-15=9
3x-15=9 ; 3x=24 ; x=8
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,3) ; G=(4,5)
D:(4,3) ; R:(4,4) ; R:(4,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,0) ; G=(3,5)
R:(1,1) ; R:(1,2) ; R:(1,3) ; R:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5)
multidigit_addition
multidigit_addition:rounding-decomposition
218+123
round:220+123=343 ; adjust:343-2=341 ; sum=341
multidigit_addition
multidigit_addition:rounding-decomposition
719+372
round:720+372=1092 ; adjust:1092-1=1091 ; sum=1091
sorting_algorithms
sorting_algorithms:insertion-sort
3, 1, 4, 5, 0
[1,3,4,5,0] ; [1,3,4,5,0] ; [1,3,4,5,0] ; [0,1,3,4,5]
sorting_algorithms
sorting_algorithms:insertion-sort
2, 6, 7, 9, 0
[2,6,7,9,0] ; [2,6,7,9,0] ; [2,6,7,9,0] ; [0,2,6,7,9]
sorting_algorithms
sorting_algorithms:bubble-sort
7, 4, 8, 2, 1
[4,7,8,2,1] ; [4,7,2,8,1] ; [4,7,2,1,8] ; [4,2,7,1,8] ; [4,2,1,7,8] ; [2,4,1,7,8] ; [2,1,4,7,8] ; [1,2,4,7,8]
sorting_algorithms
sorting_algorithms:insertion-sort
7, 9, 5, 6, 3
[7,9,5,6,3] ; [5,7,9,6,3] ; [5,6,7,9,3] ; [3,5,6,7,9]
list_summation
list_summation:right-to-left
9, 4, 4, 6
4+6=10 ; 4+10=14 ; 9+14=23
list_summation
list_summation:left-to-right
3, 4, 3, 5
3+4=7 ; 7+3=10 ; 10+5=15
list_summation
list_summation:left-to-right
4, 4, 0, 4
4+4=8 ; 8+0=8 ; 8+4=12
multidigit_addition
multidigit_addition:left-to-right-partials
349+963
p100:300+900=1200 ; p10:40+60=100 ; p1:9+3=12 ; sum=1200+100+12=1312
linear_equation_solving
linear_equation_solving:inverse-ops
7x+35=42
7x+35=42 ; x=(42-35)/7 ; x=7/7 ; x=1
multidigit_addition
multidigit_addition:rounding-decomposition
177+224
round:180+224=404 ; adjust:404-3=401 ; sum=401
multidigit_addition
multidigit_addition:left-to-right-partials
598+445
p100:500+400=900 ; p10:90+40=130 ; p1:8+5=13 ; sum=900+130+13=1043
base_conversion
base_conversion:repeated-division
n=161,base=4
DIV:161/4=40,r:1 ; DIV:40/4=10,r:0 ; DIV:10/4=2,r:2 ; DIV:2/4=0,r:2 ; OUT:2201
list_summation
list_summation:left-to-right
1, 8, 3, 9
1+8=9 ; 9+3=12 ; 12+9=21
base_conversion
base_conversion:decomposition
n=142,base=8
TERM:2*8^2=128 ; TERM:1*8^1=8 ; TERM:6*8^0=6 ; OUT:216
linear_equation_solving
linear_equation_solving:inverse-ops
7x+14=0
7x+14=0 ; x=(0-14)/7 ; x=-14/7 ; x=-2
list_summation
list_summation:right-to-left
8, 3, 2, 3
2+3=5 ; 3+5=8 ; 8+8=16