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=168,base=4
DIV:168/4=42,r:0 ; DIV:42/4=10,r:2 ; DIV:10/4=2,r:2 ; DIV:2/4=0,r:2 ; OUT:2220
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,1) ; G=(3,3)
R:(1,2) ; R:(1,3) ; D:(2,3) ; D:(3,3)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,3) ; G=(4,5)
R:(3,4) ; R:(3,5) ; D:(4,5)
linear_equation_solving
linear_equation_solving:inverse-ops
4x+4=24
4x+4=24 ; x=(24-4)/4 ; x=20/4 ; x=5
linear_equation_solving
linear_equation_solving:inverse-ops
6x-12=-42
6x-12=-42 ; x=(-42--12)/6 ; x=-30/6 ; x=-5
list_summation
list_summation:left-to-right
4, 5, 5, 9
4+5=9 ; 9+5=14 ; 14+9=23
multidigit_addition
multidigit_addition:left-to-right-partials
949+435
p100:900+400=1300 ; p10:40+30=70 ; p1:9+5=14 ; sum=1300+70+14=1384
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,4) ; G=(5,5)
R:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
list_summation
list_summation:left-to-right
0, 6, 2, 7
0+6=6 ; 6+2=8 ; 8+7=15
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=71,base=4
DIV:71/4=17,r:3 ; DIV:17/4=4,r:1 ; DIV:4/4=1,r:0 ; DIV:1/4=0,r:1 ; OUT:1013
sorting_algorithms
sorting_algorithms:heap-sort
7, 9, 5, 3, 4
[9,7,5,3,4] ; [4,7,5,3,9] ; [7,4,5,3,9] ; [3,4,5,7,9] ; [5,4,3,7,9] ; [3,4,5,7,9] ; [4,3,5,7,9] ; [3,4,5,7,9]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,3) ; G=(4,5)
D:(3,3) ; D:(4,3) ; R:(4,4) ; R:(4,5)
list_summation
list_summation:pairwise
1, 2, 4, 8
1+2=3 ; 4+8=12 ; 3+12=15
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x-81=-153
9x-81=-153 ; 9x=-72 ; x=-8
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,1) ; G=(4,2)
R:(3,2) ; D:(4,2)
base_conversion
base_conversion:repeated-division
n=226,base=2
DIV:226/2=113,r:0 ; DIV:113/2=56,r:1 ; DIV:56/2=28,r:0 ; DIV:28/2=14,r:0 ; DIV:14/2=7,r:0 ; DIV:7/2=3,r:1 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:11100010
sorting_algorithms
sorting_algorithms:heap-sort
2, 7, 5, 6, 3
[7,2,5,6,3] ; [7,6,5,2,3] ; [3,6,5,2,7] ; [6,3,5,2,7] ; [2,3,5,6,7] ; [5,3,2,6,7] ; [2,3,5,6,7] ; [3,2,5,6,7] ; [2,3,5,6,7]
list_summation
list_summation:pairwise
6, 5, 0, 9
6+5=11 ; 0+9=9 ; 11+9=20
sorting_algorithms
sorting_algorithms:bubble-sort
8, 4, 7, 6, 0
[4,8,7,6,0] ; [4,7,8,6,0] ; [4,7,6,8,0] ; [4,7,6,0,8] ; [4,6,7,0,8] ; [4,6,0,7,8] ; [4,0,6,7,8] ; [0,4,6,7,8]
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x-8=-24
8x-8=-24 ; 8x=-16 ; x=-2
list_summation
list_summation:left-to-right
9, 5, 2, 3
9+5=14 ; 14+2=16 ; 16+3=19
sorting_algorithms
sorting_algorithms:heap-sort
1, 5, 4, 0, 6
[1,6,4,0,5] ; [6,1,4,0,5] ; [6,5,4,0,1] ; [1,5,4,0,6] ; [5,1,4,0,6] ; [0,1,4,5,6] ; [4,1,0,5,6] ; [0,1,4,5,6] ; [1,0,4,5,6] ; [0,1,4,5,6]
linear_equation_solving
linear_equation_solving:inverse-ops
7x+63=98
7x+63=98 ; x=(98-63)/7 ; x=35/7 ; x=5
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x-4=-40
4x-4=-40 ; x+-1=-10 ; x=-10--1 ; x=-9
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,2) ; G=(1,3)
D:(1,2) ; R:(1,3)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,1) ; G=(4,3)
R:(1,2) ; R:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3)
sorting_algorithms
sorting_algorithms:heap-sort
2, 9, 0, 7, 3
[9,2,0,7,3] ; [9,7,0,2,3] ; [3,7,0,2,9] ; [7,3,0,2,9] ; [2,3,0,7,9] ; [3,2,0,7,9] ; [0,2,3,7,9] ; [2,0,3,7,9] ; [0,2,3,7,9]
multidigit_addition
multidigit_addition:right-to-left-carry
543+899
d2:3+9+0=12→w2,c1 ; d1:4+9+1=14→w4,c1 ; d0:5+8+1=14→w4,c1 ; sum=1442
base_conversion
base_conversion:via-binary
n=235,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:1 ; CHUNK:3:0 ; CHUNK:4:1 ; CHUNK:5:0 ; CHUNK:6:1 ; CHUNK:7:1 ; OUT:11101011
sorting_algorithms
sorting_algorithms:bubble-sort
8, 2, 4, 3, 1
[2,8,4,3,1] ; [2,4,8,3,1] ; [2,4,3,8,1] ; [2,4,3,1,8] ; [2,3,4,1,8] ; [2,3,1,4,8] ; [2,1,3,4,8] ; [1,2,3,4,8]
list_summation
list_summation:right-to-left
3, 0, 7, 7
7+7=14 ; 0+14=14 ; 3+14=17
base_conversion
base_conversion:decomposition
n=25,base=2
TERM:1*2^4=16 ; TERM:1*2^3=8 ; TERM:0*2^2=0 ; TERM:0*2^1=0 ; TERM:1*2^0=1 ; OUT:11001
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+48=104
8x+48=104 ; 8x=56 ; x=7
base_conversion
base_conversion:via-binary
n=254,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:7 ; CHUNK:2:6 ; OUT:376
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)
linear_equation_solving
linear_equation_solving:inverse-ops
9x+45=72
9x+45=72 ; x=(72-45)/9 ; x=27/9 ; x=3
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
base_conversion
base_conversion:repeated-division
n=24,base=2
DIV:24/2=12,r:0 ; DIV:12/2=6,r:0 ; DIV:6/2=3,r:0 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:11000
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,2) ; G=(5,5)
R:(3,3) ; D:(4,3) ; R:(4,4) ; D:(5,4) ; R:(5,5)
base_conversion
base_conversion:via-binary
n=90,base=2
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:1 ; CHUNK:4:0 ; CHUNK:5:1 ; CHUNK:6:0 ; OUT:1011010
multidigit_addition
multidigit_addition:right-to-left-carry
115+663
d2:5+3+0=8→w8,c0 ; d1:1+6+0=7→w7,c0 ; d0:1+6+0=7→w7,c0 ; sum=778
sorting_algorithms
sorting_algorithms:heap-sort
2, 7, 9, 0, 8
[2,8,9,0,7] ; [9,8,2,0,7] ; [7,8,2,0,9] ; [8,7,2,0,9] ; [0,7,2,8,9] ; [7,0,2,8,9] ; [2,0,7,8,9] ; [0,2,7,8,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,4) ; G=(2,5)
R:(0,5) ; D:(1,5) ; D:(2,5)
sorting_algorithms
sorting_algorithms:insertion-sort
2, 0, 1, 3, 6
[0,2,1,3,6] ; [0,1,2,3,6] ; [0,1,2,3,6] ; [0,1,2,3,6]
list_summation
list_summation:right-to-left
3, 0, 2, 9
2+9=11 ; 0+11=11 ; 3+11=14
base_conversion
base_conversion:decomposition
n=117,base=16
TERM:7*16^1=112 ; TERM:5*16^0=5 ; OUT:75
multidigit_addition
multidigit_addition:rounding-decomposition
746+125
round:750+125=875 ; adjust:875-4=871 ; sum=871
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,1) ; G=(4,3)
R:(3,2) ; D:(4,2) ; R:(4,3)
sorting_algorithms
sorting_algorithms:insertion-sort
6, 3, 7, 1, 9
[3,6,7,1,9] ; [3,6,7,1,9] ; [1,3,6,7,9] ; [1,3,6,7,9]
list_summation
list_summation:left-to-right
8, 0, 0, 1
8+0=8 ; 8+0=8 ; 8+1=9
base_conversion
base_conversion:via-binary
n=48,base=4
BINLEN:6 ; CHUNK:0:3 ; CHUNK:1:0 ; CHUNK:2:0 ; OUT:300
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,1) ; G=(5,5)
D:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
list_summation
list_summation:left-to-right
3, 9, 6, 2
3+9=12 ; 12+6=18 ; 18+2=20
sorting_algorithms
sorting_algorithms:selection-sort
9, 6, 5, 4, 0
[0,6,5,4,9] ; [0,4,5,6,9] ; [0,4,5,6,9] ; [0,4,5,6,9]
list_summation
list_summation:left-to-right
2, 3, 7, 3
2+3=5 ; 5+7=12 ; 12+3=15
multidigit_addition
multidigit_addition:right-to-left-carry
377+634
d2:7+4+0=11→w1,c1 ; d1:7+3+1=11→w1,c1 ; d0:3+6+1=10→w0,c1 ; sum=1011
base_conversion
base_conversion:decomposition
n=10,base=4
TERM:2*4^1=8 ; TERM:2*4^0=2 ; OUT:22
list_summation
list_summation:left-to-right
1, 5, 6, 8
1+5=6 ; 6+6=12 ; 12+8=20
multidigit_addition
multidigit_addition:left-to-right-partials
212+893
p100:200+800=1000 ; p10:10+90=100 ; p1:2+3=5 ; sum=1000+100+5=1105
multidigit_addition
multidigit_addition:left-to-right-partials
701+304
p100:700+300=1000 ; p10:0+0=0 ; p1:1+4=5 ; sum=1000+0+5=1005
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
multidigit_addition
multidigit_addition:right-to-left-carry
840+946
d2:0+6+0=6→w6,c0 ; d1:4+4+0=8→w8,c0 ; d0:8+9+0=17→w7,c1 ; sum=1786
sorting_algorithms
sorting_algorithms:heap-sort
4, 6, 9, 3, 7
[4,7,9,3,6] ; [9,7,4,3,6] ; [6,7,4,3,9] ; [7,6,4,3,9] ; [3,6,4,7,9] ; [6,3,4,7,9] ; [4,3,6,7,9] ; [3,4,6,7,9]
list_summation
list_summation:pairwise
2, 3, 6, 1
2+3=5 ; 6+1=7 ; 5+7=12
list_summation
list_summation:right-to-left
6, 3, 0, 8
0+8=8 ; 3+8=11 ; 6+11=17
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:divide-then-subtract
4x-8=20
4x-8=20 ; x+-2=5 ; x=5--2 ; x=7
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+24=60
4x+24=60 ; 4x=36 ; x=9
list_summation
list_summation:right-to-left
0, 5, 0, 2
0+2=2 ; 5+2=7 ; 0+7=7
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,2) ; G=(4,3)
R:(2,3) ; D:(3,3) ; D:(4,3)
base_conversion
base_conversion:decomposition
n=92,base=4
TERM:1*4^3=64 ; TERM:1*4^2=16 ; TERM:3*4^1=12 ; TERM:0*4^0=0 ; OUT:1130
list_summation
list_summation:pairwise
1, 6, 7, 9
1+6=7 ; 7+9=16 ; 7+16=23
base_conversion
base_conversion:via-binary
n=32,base=4
BINLEN:6 ; CHUNK:0:2 ; CHUNK:1:0 ; CHUNK:2:0 ; OUT:200
sorting_algorithms
sorting_algorithms:insertion-sort
7, 8, 2, 5, 4
[7,8,2,5,4] ; [2,7,8,5,4] ; [2,5,7,8,4] ; [2,4,5,7,8]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,0) ; G=(3,2)
R:(0,1) ; R:(0,2) ; D:(1,2) ; D:(2,2) ; D:(3,2)
multidigit_addition
multidigit_addition:right-to-left-carry
663+420
d2:3+0+0=3→w3,c0 ; d1:6+2+0=8→w8,c0 ; d0:6+4+0=10→w0,c1 ; sum=1083
list_summation
list_summation:right-to-left
4, 2, 8, 6
8+6=14 ; 2+14=16 ; 4+16=20
sorting_algorithms
sorting_algorithms:selection-sort
0, 1, 4, 2, 9
[0,1,4,2,9] ; [0,1,4,2,9] ; [0,1,2,4,9] ; [0,1,2,4,9]
list_summation
list_summation:right-to-left
5, 5, 5, 8
5+8=13 ; 5+13=18 ; 5+18=23
multidigit_addition
multidigit_addition:left-to-right-partials
686+741
p100:600+700=1300 ; p10:80+40=120 ; p1:6+1=7 ; sum=1300+120+7=1427
multidigit_addition
multidigit_addition:rounding-decomposition
839+178
round:840+178=1018 ; adjust:1018-1=1017 ; sum=1017
sorting_algorithms
sorting_algorithms:bubble-sort
1, 8, 3, 4, 5
[1,3,8,4,5] ; [1,3,4,8,5] ; [1,3,4,5,8]
list_summation
list_summation:right-to-left
1, 3, 5, 7
5+7=12 ; 3+12=15 ; 1+15=16
base_conversion
base_conversion:repeated-division
n=233,base=4
DIV:233/4=58,r:1 ; DIV:58/4=14,r:2 ; DIV:14/4=3,r:2 ; DIV:3/4=0,r:3 ; OUT:3221
multidigit_addition
multidigit_addition:right-to-left-carry
690+237
d2:0+7+0=7→w7,c0 ; d1:9+3+0=12→w2,c1 ; d0:6+2+1=9→w9,c0 ; sum=927
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,2) ; G=(5,3)
R:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3) ; D:(5,3)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,3) ; G=(5,4)
D:(5,3) ; R:(5,4)
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+40=104
8x+40=104 ; 8x=64 ; x=8
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+0=24
4x+0=24 ; 4x=24 ; x=6
base_conversion
base_conversion:via-binary
n=221,base=4
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:1 ; CHUNK:2:3 ; CHUNK:3:1 ; OUT:3131
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,1) ; G=(5,2)
R:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2)
sorting_algorithms
sorting_algorithms:insertion-sort
4, 6, 3, 5, 2
[4,6,3,5,2] ; [3,4,6,5,2] ; [3,4,5,6,2] ; [2,3,4,5,6]
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x-10=-40
5x-10=-40 ; x+-2=-8 ; x=-8--2 ; x=-6
linear_equation_solving
linear_equation_solving:inverse-ops
4x+8=0
4x+8=0 ; x=(0-8)/4 ; x=-8/4 ; x=-2
linear_equation_solving
linear_equation_solving:inverse-ops
4x+32=40
4x+32=40 ; x=(40-32)/4 ; x=8/4 ; x=2
base_conversion
base_conversion:via-binary
n=250,base=16
BINLEN:8 ; CHUNK:0:15 ; CHUNK:1:10 ; OUT:FA
multidigit_addition
multidigit_addition:left-to-right-partials
534+156
p100:500+100=600 ; p10:30+50=80 ; p1:4+6=10 ; sum=600+80+10=690
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,2) ; G=(5,3)
R:(4,3) ; D:(5,3)
sorting_algorithms
sorting_algorithms:heap-sort
2, 9, 7, 1, 4
[9,2,7,1,4] ; [9,4,7,1,2] ; [2,4,7,1,9] ; [7,4,2,1,9] ; [1,4,2,7,9] ; [4,1,2,7,9] ; [2,1,4,7,9] ; [1,2,4,7,9]