task_name
stringclasses
6 values
strategy_id
stringclasses
20 values
input_text
stringlengths
6
26
reasoning_trace
stringlengths
11
152
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,1) ; G=(4,4)
R:(3,2) ; R:(3,3) ; R:(3,4) ; D:(4,4)
sorting_algorithms
sorting_algorithms:bubble-sort
9, 0, 6, 4, 3
[0,9,6,4,3] ; [0,6,9,4,3] ; [0,6,4,9,3] ; [0,6,4,3,9] ; [0,4,6,3,9] ; [0,4,3,6,9] ; [0,3,4,6,9]
list_summation
list_summation:right-to-left
5, 2, 6, 2
6+2=8 ; 2+8=10 ; 5+10=15
base_conversion
base_conversion:via-binary
n=61,base=8
BINLEN:6 ; CHUNK:0:7 ; CHUNK:1:5 ; OUT:75
list_summation
list_summation:pairwise
0, 0, 3, 8
0+0=0 ; 3+8=11 ; 0+11=11
sorting_algorithms
sorting_algorithms:insertion-sort
3, 5, 1, 0, 7
[3,5,1,0,7] ; [1,3,5,0,7] ; [0,1,3,5,7] ; [0,1,3,5,7]
sorting_algorithms
sorting_algorithms:insertion-sort
5, 9, 0, 4, 6
[5,9,0,4,6] ; [0,5,9,4,6] ; [0,4,5,9,6] ; [0,4,5,6,9]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,2) ; G=(4,3)
D:(3,2) ; D:(4,2) ; R:(4,3)
list_summation
list_summation:pairwise
7, 7, 3, 6
7+7=14 ; 3+6=9 ; 14+9=23
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,0) ; G=(5,1)
D:(5,0) ; R:(5,1)
base_conversion
base_conversion:repeated-division
n=121,base=8
DIV:121/8=15,r:1 ; DIV:15/8=1,r:7 ; DIV:1/8=0,r:1 ; OUT:171
list_summation
list_summation:left-to-right
2, 0, 0, 7
2+0=2 ; 2+0=2 ; 2+7=9
list_summation
list_summation:right-to-left
8, 6, 6, 7
6+7=13 ; 6+13=19 ; 8+19=27
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)
sorting_algorithms
sorting_algorithms:merge-sort
7, 3, 2, 0, 5
[3,7,2,0,5] ; [3,7,0,2,5] ; [0,2,3,7,5] ; [0,2,3,5,7]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,0) ; G=(3,4)
D:(2,0) ; D:(3,0) ; R:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4)
base_conversion
base_conversion:decomposition
n=238,base=8
TERM:3*8^2=192 ; TERM:5*8^1=40 ; TERM:6*8^0=6 ; OUT:356
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,2) ; G=(3,5)
D:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,3) ; G=(4,5)
R:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5)
base_conversion
base_conversion:via-binary
n=56,base=16
BINLEN:6 ; CHUNK:0:3 ; CHUNK:1:8 ; OUT:38
linear_equation_solving
linear_equation_solving:inverse-ops
3x-9=-9
3x-9=-9 ; x=(-9--9)/3 ; x=0/3 ; x=0
base_conversion
base_conversion:repeated-division
n=176,base=2
DIV:176/2=88,r:0 ; DIV:88/2=44,r:0 ; DIV:44/2=22,r:0 ; DIV:22/2=11,r:0 ; 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:10110000
list_summation
list_summation:left-to-right
9, 0, 0, 2
9+0=9 ; 9+0=9 ; 9+2=11
multidigit_addition
multidigit_addition:rounding-decomposition
390+625
round:390+625=1015 ; adjust:1015-0=1015 ; sum=1015
list_summation
list_summation:pairwise
5, 5, 3, 5
5+5=10 ; 3+5=8 ; 10+8=18
sorting_algorithms
sorting_algorithms:merge-sort
0, 9, 3, 2, 4
[0,9,2,3,4] ; [0,2,3,9,4] ; [0,2,3,4,9]
linear_equation_solving
linear_equation_solving:inverse-ops
8x-56=-40
8x-56=-40 ; x=(-40--56)/8 ; x=16/8 ; x=2
multidigit_addition
multidigit_addition:left-to-right-partials
657+672
p100:600+600=1200 ; p10:50+70=120 ; p1:7+2=9 ; sum=1200+120+9=1329
list_summation
list_summation:left-to-right
8, 1, 5, 5
8+1=9 ; 9+5=14 ; 14+5=19
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,3) ; G=(4,4)
R:(0,4) ; D:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4)
base_conversion
base_conversion:repeated-division
n=208,base=8
DIV:208/8=26,r:0 ; DIV:26/8=3,r:2 ; DIV:3/8=0,r:3 ; OUT:320
multidigit_addition
multidigit_addition:right-to-left-carry
943+618
d2:3+8+0=11→w1,c1 ; d1:4+1+1=6→w6,c0 ; d0:9+6+0=15→w5,c1 ; sum=1561
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x-16=-40
4x-16=-40 ; 4x=-24 ; x=-6
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,2) ; G=(1,5)
R:(0,3) ; D:(1,3) ; R:(1,4) ; R:(1,5)
multidigit_addition
multidigit_addition:left-to-right-partials
124+554
p100:100+500=600 ; p10:20+50=70 ; p1:4+4=8 ; sum=600+70+8=678
multidigit_addition
multidigit_addition:rounding-decomposition
223+789
round:230+789=1019 ; adjust:1019-7=1012 ; sum=1012
base_conversion
base_conversion:decomposition
n=89,base=16
TERM:5*16^1=80 ; TERM:9*16^0=9 ; OUT:59
sorting_algorithms
sorting_algorithms:heap-sort
2, 4, 3, 1, 5
[2,5,3,1,4] ; [5,2,3,1,4] ; [5,4,3,1,2] ; [2,4,3,1,5] ; [4,2,3,1,5] ; [1,2,3,4,5] ; [3,2,1,4,5] ; [1,2,3,4,5] ; [2,1,3,4,5] ; [1,2,3,4,5]
linear_equation_solving
linear_equation_solving:inverse-ops
8x-64=-120
8x-64=-120 ; x=(-120--64)/8 ; x=-56/8 ; x=-7
base_conversion
base_conversion:via-binary
n=238,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:5 ; CHUNK:2:6 ; OUT:356
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,3) ; G=(1,4)
D:(1,3) ; R:(1,4)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,4) ; G=(4,5)
D:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4) ; R:(4,5)
linear_equation_solving
linear_equation_solving:inverse-ops
8x-48=-56
8x-48=-56 ; x=(-56--48)/8 ; x=-8/8 ; x=-1
list_summation
list_summation:right-to-left
0, 5, 3, 2
3+2=5 ; 5+5=10 ; 0+10=10
list_summation
list_summation:right-to-left
4, 6, 0, 0
0+0=0 ; 6+0=6 ; 4+6=10
base_conversion
base_conversion:decomposition
n=241,base=8
TERM:3*8^2=192 ; TERM:6*8^1=48 ; TERM:1*8^0=1 ; OUT:361
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,0) ; G=(3,4)
R:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4) ; D:(3,4)
multidigit_addition
multidigit_addition:right-to-left-carry
755+366
d2:5+6+0=11→w1,c1 ; d1:5+6+1=12→w2,c1 ; d0:7+3+1=11→w1,c1 ; sum=1121
base_conversion
base_conversion:via-binary
n=190,base=8
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:7 ; CHUNK:2:6 ; OUT:276
base_conversion
base_conversion:repeated-division
n=217,base=2
DIV:217/2=108,r:1 ; DIV:108/2=54,r:0 ; DIV:54/2=27,r:0 ; DIV:27/2=13,r:1 ; 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:11011001
list_summation
list_summation:pairwise
9, 4, 0, 1
9+4=13 ; 0+1=1 ; 13+1=14
multidigit_addition
multidigit_addition:right-to-left-carry
740+636
d2:0+6+0=6→w6,c0 ; d1:4+3+0=7→w7,c0 ; d0:7+6+0=13→w3,c1 ; sum=1376
multidigit_addition
multidigit_addition:rounding-decomposition
480+613
round:480+613=1093 ; adjust:1093-0=1093 ; sum=1093
base_conversion
base_conversion:repeated-division
n=31,base=8
DIV:31/8=3,r:7 ; DIV:3/8=0,r:3 ; OUT:37
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-18=0
2x-18=0 ; x+-9=0 ; x=0--9 ; x=9
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x+25=10
5x+25=10 ; x+5=2 ; x=2-5 ; x=-3
linear_equation_solving
linear_equation_solving:inverse-ops
8x-64=-104
8x-64=-104 ; x=(-104--64)/8 ; x=-40/8 ; x=-5
sorting_algorithms
sorting_algorithms:selection-sort
2, 1, 7, 0, 8
[0,1,7,2,8] ; [0,1,7,2,8] ; [0,1,2,7,8] ; [0,1,2,7,8]
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)
multidigit_addition
multidigit_addition:left-to-right-partials
802+386
p100:800+300=1100 ; p10:0+80=80 ; p1:2+6=8 ; sum=1100+80+8=1188
list_summation
list_summation:pairwise
7, 5, 5, 4
7+5=12 ; 5+4=9 ; 12+9=21
multidigit_addition
multidigit_addition:left-to-right-partials
870+440
p100:800+400=1200 ; p10:70+40=110 ; p1:0+0=0 ; sum=1200+110+0=1310
list_summation
list_summation:pairwise
7, 4, 6, 5
7+4=11 ; 6+5=11 ; 11+11=22
base_conversion
base_conversion:decomposition
n=11,base=2
TERM:1*2^3=8 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:1011
multidigit_addition
multidigit_addition:rounding-decomposition
654+955
round:660+955=1615 ; adjust:1615-6=1609 ; sum=1609
multidigit_addition
multidigit_addition:rounding-decomposition
307+574
round:310+574=884 ; adjust:884-3=881 ; sum=881
list_summation
list_summation:left-to-right
8, 3, 0, 8
8+3=11 ; 11+0=11 ; 11+8=19
list_summation
list_summation:pairwise
7, 5, 4, 9
7+5=12 ; 4+9=13 ; 12+13=25
multidigit_addition
multidigit_addition:rounding-decomposition
524+285
round:530+285=815 ; adjust:815-6=809 ; sum=809
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,1) ; G=(2,4)
R:(1,2) ; D:(2,2) ; R:(2,3) ; R:(2,4)
sorting_algorithms
sorting_algorithms:insertion-sort
6, 9, 8, 7, 1
[6,9,8,7,1] ; [6,8,9,7,1] ; [6,7,8,9,1] ; [1,6,7,8,9]
list_summation
list_summation:right-to-left
5, 1, 0, 4
0+4=4 ; 1+4=5 ; 5+5=10
list_summation
list_summation:pairwise
9, 3, 3, 8
9+3=12 ; 3+8=11 ; 12+11=23
multidigit_addition
multidigit_addition:right-to-left-carry
745+912
d2:5+2+0=7→w7,c0 ; d1:4+1+0=5→w5,c0 ; d0:7+9+0=16→w6,c1 ; sum=1657
multidigit_addition
multidigit_addition:right-to-left-carry
214+711
d2:4+1+0=5→w5,c0 ; d1:1+1+0=2→w2,c0 ; d0:2+7+0=9→w9,c0 ; sum=925
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,1) ; G=(3,2)
R:(2,2) ; D:(3,2)
multidigit_addition
multidigit_addition:right-to-left-carry
372+573
d2:2+3+0=5→w5,c0 ; d1:7+7+0=14→w4,c1 ; d0:3+5+1=9→w9,c0 ; sum=945
list_summation
list_summation:left-to-right
4, 7, 9, 0
4+7=11 ; 11+9=20 ; 20+0=20
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,1) ; G=(4,5)
R:(1,2) ; R:(1,3) ; R:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5)
base_conversion
base_conversion:decomposition
n=111,base=4
TERM:1*4^3=64 ; TERM:2*4^2=32 ; TERM:3*4^1=12 ; TERM:3*4^0=3 ; OUT:1233
sorting_algorithms
sorting_algorithms:insertion-sort
7, 0, 8, 1, 3
[0,7,8,1,3] ; [0,7,8,1,3] ; [0,1,7,8,3] ; [0,1,3,7,8]
multidigit_addition
multidigit_addition:left-to-right-partials
465+344
p100:400+300=700 ; p10:60+40=100 ; p1:5+4=9 ; sum=700+100+9=809
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x-45=-108
9x-45=-108 ; 9x=-63 ; x=-7
sorting_algorithms
sorting_algorithms:heap-sort
1, 2, 5, 3, 0
[1,3,5,2,0] ; [5,3,1,2,0] ; [0,3,1,2,5] ; [3,0,1,2,5] ; [3,2,1,0,5] ; [0,2,1,3,5] ; [2,0,1,3,5] ; [1,0,2,3,5] ; [0,1,2,3,5]
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)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,3) ; G=(5,5)
R:(4,4) ; R:(4,5) ; D:(5,5)
list_summation
list_summation:pairwise
7, 9, 9, 0
7+9=16 ; 9+0=9 ; 16+9=25
linear_equation_solving
linear_equation_solving:inverse-ops
4x-20=-24
4x-20=-24 ; x=(-24--20)/4 ; x=-4/4 ; x=-1
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x-72=-24
8x-72=-24 ; x+-9=-3 ; x=-3--9 ; x=6
base_conversion
base_conversion:repeated-division
n=244,base=2
DIV:244/2=122,r:0 ; DIV:122/2=61,r:0 ; DIV:61/2=30,r:1 ; DIV:30/2=15,r:0 ; DIV:15/2=7,r:1 ; DIV:7/2=3,r:1 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:11110100
sorting_algorithms
sorting_algorithms:heap-sort
1, 0, 9, 4, 2
[1,4,9,0,2] ; [9,4,1,0,2] ; [2,4,1,0,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:down-first
grid=6 ; S=(0,2) ; G=(3,4)
D:(1,2) ; D:(2,2) ; D:(3,2) ; R:(3,3) ; R:(3,4)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,3) ; G=(4,4)
R:(2,4) ; D:(3,4) ; D:(4,4)
base_conversion
base_conversion:via-binary
n=101,base=8
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:4 ; CHUNK:2:5 ; OUT:145
multidigit_addition
multidigit_addition:left-to-right-partials
850+330
p100:800+300=1100 ; p10:50+30=80 ; p1:0+0=0 ; sum=1100+80+0=1180
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x+64=64
8x+64=64 ; x+8=8 ; x=8-8 ; x=0
base_conversion
base_conversion:decomposition
n=154,base=4
TERM:2*4^3=128 ; TERM:1*4^2=16 ; TERM:2*4^1=8 ; TERM:2*4^0=2 ; OUT:2122
sorting_algorithms
sorting_algorithms:selection-sort
4, 5, 9, 1, 6
[1,5,9,4,6] ; [1,4,9,5,6] ; [1,4,5,9,6] ; [1,4,5,6,9]
base_conversion
base_conversion:repeated-division
n=124,base=8
DIV:124/8=15,r:4 ; DIV:15/8=1,r:7 ; DIV:1/8=0,r:1 ; OUT:174
multidigit_addition
multidigit_addition:left-to-right-partials
342+637
p100:300+600=900 ; p10:40+30=70 ; p1:2+7=9 ; sum=900+70+9=979