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, 3, 6, 4, 7
[9,7,6,4,3] ; [3,7,6,4,9] ; [7,3,6,4,9] ; [7,4,6,3,9] ; [3,4,6,7,9] ; [6,4,3,7,9] ; [3,4,6,7,9] ; [4,3,6,7,9] ; [3,4,6,7,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x+35=15
5x+35=15 ; 5x=-20 ; x=-4
sorting_algorithms
sorting_algorithms:selection-sort
0, 2, 4, 9, 8
[0,2,4,9,8] ; [0,2,4,9,8] ; [0,2,4,9,8] ; [0,2,4,8,9]
list_summation
list_summation:left-to-right
6, 6, 1, 0
6+6=12 ; 12+1=13 ; 13+0=13
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-12=-54
6x-12=-54 ; 6x=-42 ; x=-7
list_summation
list_summation:left-to-right
0, 3, 0, 1
0+3=3 ; 3+0=3 ; 3+1=4
base_conversion
base_conversion:decomposition
n=152,base=16
TERM:9*16^1=144 ; TERM:8*16^0=8 ; OUT:98
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,1) ; G=(2,5)
R:(0,2) ; R:(0,3) ; R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5)
list_summation
list_summation:right-to-left
4, 5, 3, 0
3+0=3 ; 5+3=8 ; 4+8=12
list_summation
list_summation:right-to-left
5, 0, 9, 3
9+3=12 ; 0+12=12 ; 5+12=17
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,1) ; G=(1,4)
R:(0,2) ; D:(1,2) ; R:(1,3) ; R:(1,4)
multidigit_addition
multidigit_addition:left-to-right-partials
831+107
p100:800+100=900 ; p10:30+0=30 ; p1:1+7=8 ; sum=900+30+8=938
sorting_algorithms
sorting_algorithms:selection-sort
0, 3, 4, 5, 2
[0,3,4,5,2] ; [0,2,4,5,3] ; [0,2,3,5,4] ; [0,2,3,4,5]
base_conversion
base_conversion:via-binary
n=249,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:7 ; CHUNK:2:1 ; OUT:371
multidigit_addition
multidigit_addition:right-to-left-carry
572+411
d2:2+1+0=3→w3,c0 ; d1:7+1+0=8→w8,c0 ; d0:5+4+0=9→w9,c0 ; sum=983
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,3) ; G=(3,5)
R:(2,4) ; D:(3,4) ; R:(3,5)
sorting_algorithms
sorting_algorithms:insertion-sort
4, 2, 3, 0, 6
[2,4,3,0,6] ; [2,3,4,0,6] ; [0,2,3,4,6] ; [0,2,3,4,6]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,4) ; G=(3,5)
R:(2,5) ; D:(3,5)
base_conversion
base_conversion:via-binary
n=77,base=16
BINLEN:7 ; CHUNK:0:4 ; CHUNK:1:13 ; OUT:4D
linear_equation_solving
linear_equation_solving:inverse-ops
7x+0=14
7x+0=14 ; x=(14-0)/7 ; x=14/7 ; x=2
sorting_algorithms
sorting_algorithms:selection-sort
9, 8, 3, 5, 6
[3,8,9,5,6] ; [3,5,9,8,6] ; [3,5,6,8,9] ; [3,5,6,8,9]
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
list_summation
list_summation:right-to-left
5, 9, 9, 8
9+8=17 ; 9+17=26 ; 5+26=31
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,3) ; G=(4,4)
D:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3) ; R:(4,4)
list_summation
list_summation:left-to-right
9, 3, 7, 5
9+3=12 ; 12+7=19 ; 19+5=24
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,2) ; G=(4,3)
R:(3,3) ; D:(4,3)
base_conversion
base_conversion:via-binary
n=79,base=16
BINLEN:7 ; CHUNK:0:4 ; CHUNK:1:15 ; OUT:4F
base_conversion
base_conversion:repeated-division
n=5,base=4
DIV:5/4=1,r:1 ; DIV:1/4=0,r:1 ; OUT:11
sorting_algorithms
sorting_algorithms:selection-sort
4, 5, 9, 7, 0
[0,5,9,7,4] ; [0,4,9,7,5] ; [0,4,5,7,9] ; [0,4,5,7,9]
base_conversion
base_conversion:repeated-division
n=26,base=2
DIV:26/2=13,r:0 ; DIV:13/2=6,r:1 ; DIV:6/2=3,r:0 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:11010
list_summation
list_summation:right-to-left
0, 0, 3, 5
3+5=8 ; 0+8=8 ; 0+8=8
linear_equation_solving
linear_equation_solving:inverse-ops
9x+54=0
9x+54=0 ; x=(0-54)/9 ; x=-54/9 ; x=-6
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,4) ; G=(5,5)
R:(3,5) ; D:(4,5) ; D:(5,5)
sorting_algorithms
sorting_algorithms:selection-sort
8, 3, 6, 2, 9
[2,3,6,8,9] ; [2,3,6,8,9] ; [2,3,6,8,9] ; [2,3,6,8,9]
base_conversion
base_conversion:decomposition
n=51,base=4
TERM:3*4^2=48 ; TERM:0*4^1=0 ; TERM:3*4^0=3 ; OUT:303
list_summation
list_summation:pairwise
4, 9, 0, 8
4+9=13 ; 0+8=8 ; 13+8=21
sorting_algorithms
sorting_algorithms:selection-sort
3, 9, 5, 0, 6
[0,9,5,3,6] ; [0,3,5,9,6] ; [0,3,5,9,6] ; [0,3,5,6,9]
sorting_algorithms
sorting_algorithms:merge-sort
2, 0, 9, 4, 8
[0,2,9,4,8] ; [0,2,4,9,8] ; [0,2,4,8,9]
base_conversion
base_conversion:repeated-division
n=108,base=16
DIV:108/16=6,r:12 ; DIV:6/16=0,r:6 ; OUT:6C
sorting_algorithms
sorting_algorithms:heap-sort
3, 7, 5, 8, 9
[3,9,5,8,7] ; [9,3,5,8,7] ; [9,8,5,3,7] ; [7,8,5,3,9] ; [8,7,5,3,9] ; [3,7,5,8,9] ; [7,3,5,8,9] ; [5,3,7,8,9] ; [3,5,7,8,9]
list_summation
list_summation:pairwise
0, 7, 6, 0
0+7=7 ; 6+0=6 ; 7+6=13
base_conversion
base_conversion:decomposition
n=222,base=2
TERM:1*2^7=128 ; TERM:1*2^6=64 ; TERM:0*2^5=0 ; TERM:1*2^4=16 ; TERM:1*2^3=8 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:11011110
list_summation
list_summation:pairwise
6, 2, 2, 3
6+2=8 ; 2+3=5 ; 8+5=13
linear_equation_solving
linear_equation_solving:inverse-ops
6x+24=66
6x+24=66 ; x=(66-24)/6 ; x=42/6 ; x=7
multidigit_addition
multidigit_addition:left-to-right-partials
566+564
p100:500+500=1000 ; p10:60+60=120 ; p1:6+4=10 ; sum=1000+120+10=1130
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x-14=-42
7x-14=-42 ; 7x=-28 ; x=-4
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,3) ; G=(5,4)
R:(0,4) ; D:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4)
sorting_algorithms
sorting_algorithms:selection-sort
3, 7, 1, 4, 8
[1,7,3,4,8] ; [1,3,7,4,8] ; [1,3,4,7,8] ; [1,3,4,7,8]
list_summation
list_summation:right-to-left
7, 6, 7, 8
7+8=15 ; 6+15=21 ; 7+21=28
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x-27=-12
3x-27=-12 ; 3x=15 ; x=5
sorting_algorithms
sorting_algorithms:selection-sort
5, 4, 6, 3, 1
[1,4,6,3,5] ; [1,3,6,4,5] ; [1,3,4,6,5] ; [1,3,4,5,6]
sorting_algorithms
sorting_algorithms:selection-sort
7, 3, 9, 1, 8
[1,3,9,7,8] ; [1,3,9,7,8] ; [1,3,7,9,8] ; [1,3,7,8,9]
list_summation
list_summation:pairwise
6, 3, 9, 4
6+3=9 ; 9+4=13 ; 9+13=22
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+48=-8
8x+48=-8 ; 8x=-56 ; x=-7
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x+9=-63
9x+9=-63 ; x+1=-7 ; x=-7-1 ; x=-8
base_conversion
base_conversion:repeated-division
n=195,base=8
DIV:195/8=24,r:3 ; DIV:24/8=3,r:0 ; DIV:3/8=0,r:3 ; OUT:303
list_summation
list_summation:left-to-right
6, 8, 7, 2
6+8=14 ; 14+7=21 ; 21+2=23
base_conversion
base_conversion:via-binary
n=105,base=8
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:5 ; CHUNK:2:1 ; OUT:151
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,4) ; G=(3,5)
R:(2,5) ; D:(3,5)
base_conversion
base_conversion:via-binary
n=135,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:0 ; CHUNK:5:1 ; CHUNK:6:1 ; CHUNK:7:1 ; OUT:10000111
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,3) ; G=(5,5)
R:(4,4) ; D:(5,4) ; R:(5,5)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,3) ; G=(3,5)
R:(0,4) ; D:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5)
base_conversion
base_conversion:via-binary
n=95,base=16
BINLEN:7 ; CHUNK:0:5 ; CHUNK:1:15 ; OUT:5F
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,3) ; G=(3,5)
D:(2,3) ; D:(3,3) ; R:(3,4) ; R:(3,5)
multidigit_addition
multidigit_addition:left-to-right-partials
706+998
p100:700+900=1600 ; p10:0+90=90 ; p1:6+8=14 ; sum=1600+90+14=1704
base_conversion
base_conversion:decomposition
n=207,base=16
TERM:12*16^1=192 ; TERM:15*16^0=15 ; OUT:CF
list_summation
list_summation:left-to-right
2, 4, 7, 0
2+4=6 ; 6+7=13 ; 13+0=13
list_summation
list_summation:left-to-right
3, 3, 2, 8
3+3=6 ; 6+2=8 ; 8+8=16
sorting_algorithms
sorting_algorithms:selection-sort
6, 3, 0, 1, 9
[0,3,6,1,9] ; [0,1,6,3,9] ; [0,1,3,6,9] ; [0,1,3,6,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x-20=-20
5x-20=-20 ; 5x=0 ; x=0
list_summation
list_summation:right-to-left
8, 1, 9, 7
9+7=16 ; 1+16=17 ; 8+17=25
list_summation
list_summation:left-to-right
2, 6, 8, 9
2+6=8 ; 8+8=16 ; 16+9=25
multidigit_addition
multidigit_addition:rounding-decomposition
571+152
round:580+152=732 ; adjust:732-9=723 ; sum=723
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,1) ; G=(5,3)
R:(4,2) ; R:(4,3) ; D:(5,3)
list_summation
list_summation:pairwise
2, 3, 5, 4
2+3=5 ; 5+4=9 ; 5+9=14
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,2) ; G=(2,5)
D:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,1) ; G=(5,3)
R:(4,2) ; D:(5,2) ; R:(5,3)
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-18=-16
2x-18=-16 ; x+-9=-8 ; x=-8--9 ; x=1
sorting_algorithms
sorting_algorithms:heap-sort
2, 7, 9, 6, 4
[9,7,2,6,4] ; [4,7,2,6,9] ; [7,4,2,6,9] ; [7,6,2,4,9] ; [4,6,2,7,9] ; [6,4,2,7,9] ; [2,4,6,7,9] ; [4,2,6,7,9] ; [2,4,6,7,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,2) ; G=(2,4)
R:(0,3) ; R:(0,4) ; D:(1,4) ; D:(2,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:alternating
grid=6 ; S=(2,1) ; G=(5,2)
R:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2)
linear_equation_solving
linear_equation_solving:inverse-ops
5x+35=0
5x+35=0 ; x=(0-35)/5 ; x=-35/5 ; x=-7
base_conversion
base_conversion:decomposition
n=58,base=2
TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:1*2^3=8 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:111010
sorting_algorithms
sorting_algorithms:selection-sort
1, 9, 0, 2, 8
[0,9,1,2,8] ; [0,1,9,2,8] ; [0,1,2,9,8] ; [0,1,2,8,9]
multidigit_addition
multidigit_addition:rounding-decomposition
818+129
round:820+129=949 ; adjust:949-2=947 ; sum=947
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,4) ; G=(2,5)
R:(0,5) ; D:(1,5) ; D:(2,5)
linear_equation_solving
linear_equation_solving:inverse-ops
8x+64=48
8x+64=48 ; x=(48-64)/8 ; x=-16/8 ; x=-2
multidigit_addition
multidigit_addition:right-to-left-carry
120+183
d2:0+3+0=3→w3,c0 ; d1:2+8+0=10→w0,c1 ; d0:1+1+1=3→w3,c0 ; sum=303
multidigit_addition
multidigit_addition:right-to-left-carry
620+854
d2:0+4+0=4→w4,c0 ; d1:2+5+0=7→w7,c0 ; d0:6+8+0=14→w4,c1 ; sum=1474
base_conversion
base_conversion:via-binary
n=46,base=4
BINLEN:6 ; CHUNK:0:2 ; CHUNK:1:3 ; CHUNK:2:2 ; OUT:232
base_conversion
base_conversion:via-binary
n=188,base=8
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:7 ; CHUNK:2:4 ; OUT:274
list_summation
list_summation:left-to-right
8, 8, 3, 7
8+8=16 ; 16+3=19 ; 19+7=26
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,0) ; G=(5,3)
R:(3,1) ; D:(4,1) ; R:(4,2) ; D:(5,2) ; R:(5,3)
base_conversion
base_conversion:repeated-division
n=243,base=16
DIV:243/16=15,r:3 ; DIV:15/16=0,r:15 ; OUT:F3
multidigit_addition
multidigit_addition:left-to-right-partials
941+459
p100:900+400=1300 ; p10:40+50=90 ; p1:1+9=10 ; sum=1300+90+10=1400
multidigit_addition
multidigit_addition:left-to-right-partials
683+202
p100:600+200=800 ; p10:80+0=80 ; p1:3+2=5 ; sum=800+80+5=885
base_conversion
base_conversion:decomposition
n=199,base=4
TERM:3*4^3=192 ; TERM:0*4^2=0 ; TERM:1*4^1=4 ; TERM:3*4^0=3 ; OUT:3013
multidigit_addition
multidigit_addition:rounding-decomposition
549+338
round:550+338=888 ; adjust:888-1=887 ; sum=887
list_summation
list_summation:right-to-left
0, 1, 4, 9
4+9=13 ; 1+13=14 ; 0+14=14