task_name
stringclasses
6 values
strategy_id
stringclasses
20 values
input_text
stringlengths
6
26
reasoning_trace
stringlengths
11
152
list_summation
list_summation:pairwise
9, 4, 6, 3
9+4=13 ; 6+3=9 ; 13+9=22
multidigit_addition
multidigit_addition:rounding-decomposition
563+884
round:570+884=1454 ; adjust:1454-7=1447 ; sum=1447
list_summation
list_summation:right-to-left
3, 0, 7, 3
7+3=10 ; 0+10=10 ; 3+10=13
list_summation
list_summation:left-to-right
8, 7, 4, 6
8+7=15 ; 15+4=19 ; 19+6=25
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x+48=-24
8x+48=-24 ; x+6=-3 ; x=-3-6 ; x=-9
multidigit_addition
multidigit_addition:left-to-right-partials
112+824
p100:100+800=900 ; p10:10+20=30 ; p1:2+4=6 ; sum=900+30+6=936
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x-25=-65
5x-25=-65 ; 5x=-40 ; x=-8
linear_equation_solving
linear_equation_solving:inverse-ops
9x-27=-54
9x-27=-54 ; x=(-54--27)/9 ; x=-27/9 ; x=-3
linear_equation_solving
linear_equation_solving:inverse-ops
3x-27=-33
3x-27=-33 ; x=(-33--27)/3 ; x=-6/3 ; x=-2
base_conversion
base_conversion:decomposition
n=153,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:0*2^5=0 ; 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:10011001
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,3) ; G=(4,4)
R:(3,4) ; D:(4,4)
list_summation
list_summation:pairwise
2, 0, 8, 0
2+0=2 ; 8+0=8 ; 2+8=10
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x+25=60
5x+25=60 ; x+5=12 ; x=12-5 ; x=7
list_summation
list_summation:right-to-left
0, 1, 4, 3
4+3=7 ; 1+7=8 ; 0+8=8
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,0) ; G=(3,1)
D:(3,0) ; R:(3,1)
base_conversion
base_conversion:decomposition
n=218,base=8
TERM:3*8^2=192 ; TERM:3*8^1=24 ; TERM:2*8^0=2 ; OUT:332
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,1) ; G=(5,4)
R:(4,2) ; R:(4,3) ; R:(4,4) ; D:(5,4)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,4) ; G=(5,5)
R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,1) ; G=(4,5)
R:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x+9=27
3x+9=27 ; x+3=9 ; x=9-3 ; x=6
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,4) ; G=(3,5)
R:(2,5) ; D:(3,5)
list_summation
list_summation:left-to-right
5, 5, 1, 6
5+5=10 ; 10+1=11 ; 11+6=17
sorting_algorithms
sorting_algorithms:heap-sort
4, 5, 1, 7, 0
[4,7,1,5,0] ; [7,4,1,5,0] ; [7,5,1,4,0] ; [0,5,1,4,7] ; [5,0,1,4,7] ; [5,4,1,0,7] ; [0,4,1,5,7] ; [4,0,1,5,7] ; [1,0,4,5,7] ; [0,1,4,5,7]
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-36=-36
6x-36=-36 ; 6x=0 ; x=0
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,0) ; G=(4,5)
R:(2,1) ; D:(3,1) ; R:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x+63=14
7x+63=14 ; x+9=2 ; x=2-9 ; x=-7
multidigit_addition
multidigit_addition:left-to-right-partials
183+496
p100:100+400=500 ; p10:80+90=170 ; p1:3+6=9 ; sum=500+170+9=679
sorting_algorithms
sorting_algorithms:merge-sort
8, 6, 0, 7, 5
[6,8,0,7,5] ; [0,6,7,8,5] ; [0,5,6,7,8]
linear_equation_solving
linear_equation_solving:inverse-ops
2x+6=2
2x+6=2 ; x=(2-6)/2 ; x=-4/2 ; x=-2
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,0) ; G=(4,3)
R:(2,1) ; R:(2,2) ; R:(2,3) ; D:(3,3) ; D:(4,3)
base_conversion
base_conversion:via-binary
n=174,base=16
BINLEN:8 ; CHUNK:0:10 ; CHUNK:1:14 ; OUT:AE
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,1) ; G=(2,5)
R:(0,2) ; D:(1,2) ; R:(1,3) ; D:(2,3) ; R:(2,4) ; R:(2,5)
list_summation
list_summation:left-to-right
5, 6, 0, 2
5+6=11 ; 11+0=11 ; 11+2=13
list_summation
list_summation:pairwise
3, 4, 6, 0
3+4=7 ; 6+0=6 ; 7+6=13
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,1) ; G=(4,2)
R:(2,2) ; D:(3,2) ; D:(4,2)
list_summation
list_summation:pairwise
8, 4, 1, 6
8+4=12 ; 1+6=7 ; 12+7=19
multidigit_addition
multidigit_addition:left-to-right-partials
127+142
p100:100+100=200 ; p10:20+40=60 ; p1:7+2=9 ; sum=200+60+9=269
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x-27=-18
3x-27=-18 ; x+-9=-6 ; x=-6--9 ; x=3
multidigit_addition
multidigit_addition:right-to-left-carry
951+835
d2:1+5+0=6→w6,c0 ; d1:5+3+0=8→w8,c0 ; d0:9+8+0=17→w7,c1 ; sum=1786
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
9, 9, 3, 4
9+9=18 ; 18+3=21 ; 21+4=25
sorting_algorithms
sorting_algorithms:heap-sort
2, 9, 1, 7, 8
[9,2,1,7,8] ; [9,8,1,7,2] ; [2,8,1,7,9] ; [8,2,1,7,9] ; [8,7,1,2,9] ; [2,7,1,8,9] ; [7,2,1,8,9] ; [1,2,7,8,9] ; [2,1,7,8,9] ; [1,2,7,8,9]
sorting_algorithms
sorting_algorithms:heap-sort
4, 9, 2, 8, 0
[9,4,2,8,0] ; [9,8,2,4,0] ; [0,8,2,4,9] ; [8,0,2,4,9] ; [8,4,2,0,9] ; [0,4,2,8,9] ; [4,0,2,8,9] ; [2,0,4,8,9] ; [0,2,4,8,9]
sorting_algorithms
sorting_algorithms:bubble-sort
5, 9, 2, 6, 1
[5,2,9,6,1] ; [5,2,6,9,1] ; [5,2,6,1,9] ; [2,5,6,1,9] ; [2,5,1,6,9] ; [2,1,5,6,9] ; [1,2,5,6,9]
base_conversion
base_conversion:repeated-division
n=75,base=4
DIV:75/4=18,r:3 ; DIV:18/4=4,r:2 ; DIV:4/4=1,r:0 ; DIV:1/4=0,r:1 ; OUT:1023
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)
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x+4=8
4x+4=8 ; x+1=2 ; x=2-1 ; x=1
base_conversion
base_conversion:via-binary
n=165,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:0 ; CHUNK:4:0 ; CHUNK:5:1 ; CHUNK:6:0 ; CHUNK:7:1 ; OUT:10100101
list_summation
list_summation:left-to-right
9, 8, 4, 8
9+8=17 ; 17+4=21 ; 21+8=29
base_conversion
base_conversion:via-binary
n=153,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:0 ; CHUNK:3:1 ; CHUNK:4:1 ; CHUNK:5:0 ; CHUNK:6:0 ; CHUNK:7:1 ; OUT:10011001
list_summation
list_summation:left-to-right
9, 0, 7, 8
9+0=9 ; 9+7=16 ; 16+8=24
base_conversion
base_conversion:via-binary
n=69,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:1 ; OUT:1011
sorting_algorithms
sorting_algorithms:bubble-sort
2, 4, 8, 6, 0
[2,4,6,8,0] ; [2,4,6,0,8] ; [2,4,0,6,8] ; [2,0,4,6,8] ; [0,2,4,6,8]
base_conversion
base_conversion:via-binary
n=119,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:3 ; CHUNK:2:1 ; CHUNK:3:3 ; OUT:1313
list_summation
list_summation:left-to-right
9, 3, 3, 1
9+3=12 ; 12+3=15 ; 15+1=16
list_summation
list_summation:right-to-left
1, 4, 0, 3
0+3=3 ; 4+3=7 ; 1+7=8
multidigit_addition
multidigit_addition:left-to-right-partials
658+467
p100:600+400=1000 ; p10:50+60=110 ; p1:8+7=15 ; sum=1000+110+15=1125
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,1) ; G=(4,5)
D:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5)
multidigit_addition
multidigit_addition:left-to-right-partials
669+110
p100:600+100=700 ; p10:60+10=70 ; p1:9+0=9 ; sum=700+70+9=779
multidigit_addition
multidigit_addition:left-to-right-partials
246+302
p100:200+300=500 ; p10:40+0=40 ; p1:6+2=8 ; sum=500+40+8=548
base_conversion
base_conversion:via-binary
n=194,base=16
BINLEN:8 ; CHUNK:0:12 ; CHUNK:1:2 ; OUT:C2
list_summation
list_summation:pairwise
2, 1, 8, 5
2+1=3 ; 8+5=13 ; 3+13=16
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x+14=12
2x+14=12 ; x+7=6 ; x=6-7 ; x=-1
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,3) ; G=(4,5)
R:(3,4) ; R:(3,5) ; D:(4,5)
list_summation
list_summation:left-to-right
6, 3, 2, 1
6+3=9 ; 9+2=11 ; 11+1=12
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,2) ; G=(5,3)
R:(4,3) ; D:(5,3)
base_conversion
base_conversion:decomposition
n=192,base=4
TERM:3*4^3=192 ; TERM:0*4^2=0 ; TERM:0*4^1=0 ; TERM:0*4^0=0 ; OUT:3000
base_conversion
base_conversion:repeated-division
n=247,base=16
DIV:247/16=15,r:7 ; DIV:15/16=0,r:15 ; OUT:F7
sorting_algorithms
sorting_algorithms:merge-sort
7, 6, 9, 4, 1
[6,7,9,4,1] ; [6,7,4,9,1] ; [4,6,7,9,1] ; [1,4,6,7,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,1) ; G=(5,4)
R:(0,2) ; D:(1,2) ; R:(1,3) ; D:(2,3) ; R:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4)
base_conversion
base_conversion:via-binary
n=67,base=16
BINLEN:7 ; CHUNK:0:4 ; CHUNK:1:3 ; OUT:43
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+14=4
2x+14=4 ; 2x=-10 ; x=-5
sorting_algorithms
sorting_algorithms:selection-sort
2, 9, 8, 4, 0
[0,9,8,4,2] ; [0,2,8,4,9] ; [0,2,4,8,9] ; [0,2,4,8,9]
list_summation
list_summation:right-to-left
5, 1, 7, 0
7+0=7 ; 1+7=8 ; 5+8=13
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x+18=-18
9x+18=-18 ; x+2=-2 ; x=-2-2 ; x=-4
list_summation
list_summation:right-to-left
6, 2, 9, 6
9+6=15 ; 2+15=17 ; 6+17=23
linear_equation_solving
linear_equation_solving:inverse-ops
9x-27=-45
9x-27=-45 ; x=(-45--27)/9 ; x=-18/9 ; x=-2
multidigit_addition
multidigit_addition:left-to-right-partials
719+527
p100:700+500=1200 ; p10:10+20=30 ; p1:9+7=16 ; sum=1200+30+16=1246
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+36=56
4x+36=56 ; 4x=20 ; x=5
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,2) ; G=(4,4)
R:(1,3) ; R:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4)
list_summation
list_summation:right-to-left
5, 3, 9, 7
9+7=16 ; 3+16=19 ; 5+19=24
list_summation
list_summation:pairwise
8, 1, 8, 0
8+1=9 ; 8+0=8 ; 9+8=17
base_conversion
base_conversion:via-binary
n=230,base=16
BINLEN:8 ; CHUNK:0:14 ; CHUNK:1:6 ; OUT:E6
list_summation
list_summation:pairwise
3, 6, 3, 4
3+6=9 ; 3+4=7 ; 9+7=16
base_conversion
base_conversion:decomposition
n=110,base=2
TERM:1*2^6=64 ; TERM:1*2^5=32 ; TERM:0*2^4=0 ; TERM:1*2^3=8 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:1101110
base_conversion
base_conversion:via-binary
n=150,base=16
BINLEN:8 ; CHUNK:0:9 ; CHUNK:1:6 ; OUT:96
multidigit_addition
multidigit_addition:left-to-right-partials
663+505
p100:600+500=1100 ; p10:60+0=60 ; p1:3+5=8 ; sum=1100+60+8=1168
base_conversion
base_conversion:repeated-division
n=67,base=4
DIV:67/4=16,r:3 ; DIV:16/4=4,r:0 ; DIV:4/4=1,r:0 ; DIV:1/4=0,r:1 ; OUT:1003
base_conversion
base_conversion:via-binary
n=53,base=2
BINLEN:6 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:1 ; CHUNK:4:0 ; CHUNK:5:1 ; OUT:110101
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+18=18
3x+18=18 ; 3x=0 ; x=0
sorting_algorithms
sorting_algorithms:selection-sort
5, 9, 2, 3, 1
[1,9,2,3,5] ; [1,2,9,3,5] ; [1,2,3,9,5] ; [1,2,3,5,9]
list_summation
list_summation:pairwise
3, 8, 5, 5
3+8=11 ; 5+5=10 ; 11+10=21
multidigit_addition
multidigit_addition:right-to-left-carry
539+490
d2:9+0+0=9→w9,c0 ; d1:3+9+0=12→w2,c1 ; d0:5+4+1=10→w0,c1 ; sum=1029
list_summation
list_summation:left-to-right
6, 9, 8, 1
6+9=15 ; 15+8=23 ; 23+1=24
linear_equation_solving
linear_equation_solving:inverse-ops
2x+8=8
2x+8=8 ; x=(8-8)/2 ; x=0/2 ; x=0
sorting_algorithms
sorting_algorithms:heap-sort
6, 4, 2, 3, 0
[0,4,2,3,6] ; [4,0,2,3,6] ; [4,3,2,0,6] ; [0,3,2,4,6] ; [3,0,2,4,6] ; [2,0,3,4,6] ; [0,2,3,4,6]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,0) ; G=(1,2)
D:(1,0) ; R:(1,1) ; R:(1,2)
linear_equation_solving
linear_equation_solving:inverse-ops
7x-14=14
7x-14=14 ; x=(14--14)/7 ; x=28/7 ; x=4
base_conversion
base_conversion:decomposition
n=249,base=2
TERM:1*2^7=128 ; TERM:1*2^6=64 ; TERM:1*2^5=32 ; 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:11111001
sorting_algorithms
sorting_algorithms:selection-sort
5, 6, 8, 4, 0
[0,6,8,4,5] ; [0,4,8,6,5] ; [0,4,5,6,8] ; [0,4,5,6,8]