task_name
stringclasses
6 values
strategy_id
stringclasses
20 values
input_text
stringlengths
6
26
reasoning_trace
stringlengths
11
152
multidigit_addition
multidigit_addition:left-to-right-partials
232+856
p100:200+800=1000 ; p10:30+50=80 ; p1:2+6=8 ; sum=1000+80+8=1088
multidigit_addition
multidigit_addition:right-to-left-carry
929+679
d2:9+9+0=18→w8,c1 ; d1:2+7+1=10→w0,c1 ; d0:9+6+1=16→w6,c1 ; sum=1608
sorting_algorithms
sorting_algorithms:insertion-sort
0, 5, 2, 9, 6
[0,5,2,9,6] ; [0,2,5,9,6] ; [0,2,5,9,6] ; [0,2,5,6,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,2) ; G=(4,4)
R:(1,3) ; D:(2,3) ; R:(2,4) ; D:(3,4) ; D:(4,4)
sorting_algorithms
sorting_algorithms:insertion-sort
0, 3, 7, 2, 8
[0,3,7,2,8] ; [0,3,7,2,8] ; [0,2,3,7,8] ; [0,2,3,7,8]
multidigit_addition
multidigit_addition:right-to-left-carry
503+432
d2:3+2+0=5→w5,c0 ; d1:0+3+0=3→w3,c0 ; d0:5+4+0=9→w9,c0 ; sum=935
list_summation
list_summation:left-to-right
4, 6, 7, 1
4+6=10 ; 10+7=17 ; 17+1=18
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x-7=-7
7x-7=-7 ; x+-1=-1 ; x=-1--1 ; x=0
sorting_algorithms
sorting_algorithms:merge-sort
6, 3, 1, 7, 4
[3,6,1,7,4] ; [1,3,6,7,4] ; [1,3,4,6,7]
linear_equation_solving
linear_equation_solving:inverse-ops
3x-6=-3
3x-6=-3 ; x=(-3--6)/3 ; x=3/3 ; x=1
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,1) ; G=(5,3)
R:(4,2) ; R:(4,3) ; D:(5,3)
sorting_algorithms
sorting_algorithms:selection-sort
0, 7, 3, 2, 1
[0,7,3,2,1] ; [0,1,3,2,7] ; [0,1,2,3,7] ; [0,1,2,3,7]
linear_equation_solving
linear_equation_solving:inverse-ops
4x-12=12
4x-12=12 ; x=(12--12)/4 ; x=24/4 ; x=6
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
sorting_algorithms
sorting_algorithms:insertion-sort
5, 9, 8, 1, 7
[5,9,8,1,7] ; [5,8,9,1,7] ; [1,5,8,9,7] ; [1,5,7,8,9]
list_summation
list_summation:left-to-right
2, 4, 1, 4
2+4=6 ; 6+1=7 ; 7+4=11
base_conversion
base_conversion:decomposition
n=236,base=4
TERM:3*4^3=192 ; TERM:2*4^2=32 ; TERM:3*4^1=12 ; TERM:0*4^0=0 ; OUT:3230
sorting_algorithms
sorting_algorithms:insertion-sort
4, 9, 8, 0, 3
[4,9,8,0,3] ; [4,8,9,0,3] ; [0,4,8,9,3] ; [0,3,4,8,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,0) ; G=(3,5)
R:(2,1) ; D:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x+0=32
8x+0=32 ; x+0=4 ; x=4-0 ; x=4
base_conversion
base_conversion:repeated-division
n=164,base=4
DIV:164/4=41,r:0 ; DIV:41/4=10,r:1 ; DIV:10/4=2,r:2 ; DIV:2/4=0,r:2 ; OUT:2210
multidigit_addition
multidigit_addition:right-to-left-carry
973+649
d2:3+9+0=12→w2,c1 ; d1:7+4+1=12→w2,c1 ; d0:9+6+1=16→w6,c1 ; sum=1622
list_summation
list_summation:left-to-right
2, 1, 0, 1
2+1=3 ; 3+0=3 ; 3+1=4
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
multidigit_addition
multidigit_addition:rounding-decomposition
205+393
round:210+393=603 ; adjust:603-5=598 ; sum=598
sorting_algorithms
sorting_algorithms:selection-sort
7, 6, 1, 2, 8
[1,6,7,2,8] ; [1,2,7,6,8] ; [1,2,6,7,8] ; [1,2,6,7,8]
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=42,base=16
DIV:42/16=2,r:10 ; DIV:2/16=0,r:2 ; OUT:2A
list_summation
list_summation:pairwise
6, 0, 4, 9
6+0=6 ; 4+9=13 ; 6+13=19
list_summation
list_summation:left-to-right
6, 1, 6, 3
6+1=7 ; 7+6=13 ; 13+3=16
multidigit_addition
multidigit_addition:right-to-left-carry
725+759
d2:5+9+0=14→w4,c1 ; d1:2+5+1=8→w8,c0 ; d0:7+7+0=14→w4,c1 ; sum=1484
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+0=-16
8x+0=-16 ; 8x=-16 ; x=-2
list_summation
list_summation:pairwise
5, 0, 7, 6
5+0=5 ; 7+6=13 ; 5+13=18
linear_equation_solving
linear_equation_solving:inverse-ops
4x+16=-4
4x+16=-4 ; x=(-4-16)/4 ; x=-20/4 ; x=-5
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,1) ; G=(3,4)
D:(2,1) ; D:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4)
linear_equation_solving
linear_equation_solving:inverse-ops
9x+27=72
9x+27=72 ; x=(72-27)/9 ; x=45/9 ; x=5
base_conversion
base_conversion:via-binary
n=211,base=16
BINLEN:8 ; CHUNK:0:13 ; CHUNK:1:3 ; OUT:D3
multidigit_addition
multidigit_addition:right-to-left-carry
722+859
d2:2+9+0=11→w1,c1 ; d1:2+5+1=8→w8,c0 ; d0:7+8+0=15→w5,c1 ; sum=1581
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+4=-10
2x+4=-10 ; 2x=-14 ; x=-7
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,2) ; G=(1,4)
R:(0,3) ; D:(1,3) ; R:(1,4)
base_conversion
base_conversion:via-binary
n=219,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:1 ; CHUNK:4:1 ; CHUNK:5:0 ; CHUNK:6:1 ; CHUNK:7:1 ; OUT:11011011
multidigit_addition
multidigit_addition:left-to-right-partials
154+614
p100:100+600=700 ; p10:50+10=60 ; p1:4+4=8 ; sum=700+60+8=768
list_summation
list_summation:right-to-left
9, 6, 9, 6
9+6=15 ; 6+15=21 ; 9+21=30
multidigit_addition
multidigit_addition:rounding-decomposition
703+150
round:710+150=860 ; adjust:860-7=853 ; sum=853
base_conversion
base_conversion:decomposition
n=141,base=8
TERM:2*8^2=128 ; TERM:1*8^1=8 ; TERM:5*8^0=5 ; OUT:215
multidigit_addition
multidigit_addition:right-to-left-carry
267+135
d2:7+5+0=12→w2,c1 ; d1:6+3+1=10→w0,c1 ; d0:2+1+1=4→w4,c0 ; sum=402
sorting_algorithms
sorting_algorithms:bubble-sort
2, 3, 7, 6, 4
[2,3,6,7,4] ; [2,3,6,4,7] ; [2,3,4,6,7]
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x+36=60
4x+36=60 ; x+9=15 ; x=15-9 ; x=6
multidigit_addition
multidigit_addition:left-to-right-partials
605+245
p100:600+200=800 ; p10:0+40=40 ; p1:5+5=10 ; sum=800+40+10=850
base_conversion
base_conversion:via-binary
n=19,base=4
BINLEN:5 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:3 ; OUT:103
base_conversion
base_conversion:via-binary
n=220,base=4
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:1 ; CHUNK:2:3 ; CHUNK:3:0 ; OUT:3130
list_summation
list_summation:pairwise
5, 2, 4, 3
5+2=7 ; 4+3=7 ; 7+7=14
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,3) ; G=(5,5)
D:(5,3) ; R:(5,4) ; R:(5,5)
sorting_algorithms
sorting_algorithms:selection-sort
9, 1, 2, 5, 6
[1,9,2,5,6] ; [1,2,9,5,6] ; [1,2,5,9,6] ; [1,2,5,6,9]
multidigit_addition
multidigit_addition:left-to-right-partials
996+603
p100:900+600=1500 ; p10:90+0=90 ; p1:6+3=9 ; sum=1500+90+9=1599
sorting_algorithms
sorting_algorithms:insertion-sort
1, 7, 8, 3, 9
[1,7,8,3,9] ; [1,7,8,3,9] ; [1,3,7,8,9] ; [1,3,7,8,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,1) ; G=(5,3)
R:(2,2) ; D:(3,2) ; R:(3,3) ; D:(4,3) ; D:(5,3)
base_conversion
base_conversion:via-binary
n=248,base=16
BINLEN:8 ; CHUNK:0:15 ; CHUNK:1:8 ; OUT:F8
multidigit_addition
multidigit_addition:rounding-decomposition
118+252
round:120+252=372 ; adjust:372-2=370 ; sum=370
base_conversion
base_conversion:via-binary
n=232,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:1 ; CHUNK:3:0 ; CHUNK:4:1 ; CHUNK:5:0 ; CHUNK:6:0 ; CHUNK:7:0 ; OUT:11101000
list_summation
list_summation:right-to-left
9, 0, 2, 8
2+8=10 ; 0+10=10 ; 9+10=19
sorting_algorithms
sorting_algorithms:bubble-sort
0, 7, 6, 9, 3
[0,6,7,9,3] ; [0,6,7,3,9] ; [0,6,3,7,9] ; [0,3,6,7,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,4) ; G=(1,5)
R:(0,5) ; D:(1,5)
multidigit_addition
multidigit_addition:rounding-decomposition
267+944
round:270+944=1214 ; adjust:1214-3=1211 ; sum=1211
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x-9=-27
3x-9=-27 ; 3x=-18 ; x=-6
sorting_algorithms
sorting_algorithms:selection-sort
2, 9, 5, 3, 4
[2,9,5,3,4] ; [2,3,5,9,4] ; [2,3,4,9,5] ; [2,3,4,5,9]
sorting_algorithms
sorting_algorithms:heap-sort
2, 0, 5, 3, 8
[2,8,5,3,0] ; [8,2,5,3,0] ; [8,3,5,2,0] ; [0,3,5,2,8] ; [5,3,0,2,8] ; [2,3,0,5,8] ; [3,2,0,5,8] ; [0,2,3,5,8] ; [2,0,3,5,8] ; [0,2,3,5,8]
base_conversion
base_conversion:via-binary
n=46,base=16
BINLEN:6 ; CHUNK:0:2 ; CHUNK:1:14 ; OUT:2E
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,0) ; G=(5,2)
R:(4,1) ; R:(4,2) ; D:(5,2)
sorting_algorithms
sorting_algorithms:heap-sort
3, 9, 4, 5, 1
[9,3,4,5,1] ; [9,5,4,3,1] ; [1,5,4,3,9] ; [5,1,4,3,9] ; [5,3,4,1,9] ; [1,3,4,5,9] ; [4,3,1,5,9] ; [1,3,4,5,9] ; [3,1,4,5,9] ; [1,3,4,5,9]
sorting_algorithms
sorting_algorithms:selection-sort
5, 9, 4, 0, 8
[0,9,4,5,8] ; [0,4,9,5,8] ; [0,4,5,9,8] ; [0,4,5,8,9]
sorting_algorithms
sorting_algorithms:selection-sort
0, 9, 3, 7, 8
[0,9,3,7,8] ; [0,3,9,7,8] ; [0,3,7,9,8] ; [0,3,7,8,9]
base_conversion
base_conversion:decomposition
n=160,base=8
TERM:2*8^2=128 ; TERM:4*8^1=32 ; TERM:0*8^0=0 ; OUT:240
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
list_summation
list_summation:left-to-right
3, 5, 2, 4
3+5=8 ; 8+2=10 ; 10+4=14
base_conversion
base_conversion:repeated-division
n=103,base=2
DIV:103/2=51,r:1 ; DIV:51/2=25,r:1 ; DIV:25/2=12,r:1 ; 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:1100111
base_conversion
base_conversion:repeated-division
n=133,base=2
DIV:133/2=66,r:1 ; DIV:66/2=33,r:0 ; DIV:33/2=16,r:1 ; DIV:16/2=8,r:0 ; DIV:8/2=4,r:0 ; DIV:4/2=2,r:0 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:10000101
sorting_algorithms
sorting_algorithms:heap-sort
4, 5, 3, 7, 8
[4,8,3,7,5] ; [8,4,3,7,5] ; [8,7,3,4,5] ; [5,7,3,4,8] ; [7,5,3,4,8] ; [4,5,3,7,8] ; [5,4,3,7,8] ; [3,4,5,7,8] ; [4,3,5,7,8] ; [3,4,5,7,8]
linear_equation_solving
linear_equation_solving:inverse-ops
9x-18=54
9x-18=54 ; x=(54--18)/9 ; x=72/9 ; x=8
list_summation
list_summation:pairwise
5, 8, 4, 4
5+8=13 ; 4+4=8 ; 13+8=21
list_summation
list_summation:right-to-left
1, 3, 4, 9
4+9=13 ; 3+13=16 ; 1+16=17
list_summation
list_summation:left-to-right
9, 2, 7, 9
9+2=11 ; 11+7=18 ; 18+9=27
linear_equation_solving
linear_equation_solving:inverse-ops
3x+9=15
3x+9=15 ; x=(15-9)/3 ; x=6/3 ; x=2
base_conversion
base_conversion:decomposition
n=64,base=2
TERM:1*2^6=64 ; TERM:0*2^5=0 ; TERM:0*2^4=0 ; TERM:0*2^3=0 ; TERM:0*2^2=0 ; TERM:0*2^1=0 ; TERM:0*2^0=0 ; OUT:1000000
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:subtract-then-divide
6x-54=-48
6x-54=-48 ; 6x=6 ; x=1
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x+63=7
7x+63=7 ; x+9=1 ; x=1-9 ; x=-8
list_summation
list_summation:pairwise
2, 9, 5, 2
2+9=11 ; 5+2=7 ; 11+7=18
base_conversion
base_conversion:repeated-division
n=213,base=8
DIV:213/8=26,r:5 ; DIV:26/8=3,r:2 ; DIV:3/8=0,r:3 ; OUT:325
sorting_algorithms
sorting_algorithms:heap-sort
2, 7, 5, 9, 0
[2,9,5,7,0] ; [9,2,5,7,0] ; [9,7,5,2,0] ; [0,7,5,2,9] ; [7,0,5,2,9] ; [7,2,5,0,9] ; [0,2,5,7,9] ; [5,2,0,7,9] ; [0,2,5,7,9] ; [2,0,5,7,9] ; [0,2,5,7,9]
list_summation
list_summation:pairwise
4, 5, 4, 0
4+5=9 ; 4+0=4 ; 9+4=13
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,2) ; G=(1,3)
D:(1,2) ; R:(1,3)
linear_equation_solving
linear_equation_solving:inverse-ops
5x-45=-80
5x-45=-80 ; x=(-80--45)/5 ; x=-35/5 ; x=-7
base_conversion
base_conversion:decomposition
n=2,base=2
TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:10
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,3) ; G=(4,4)
R:(3,4) ; D:(4,4)
multidigit_addition
multidigit_addition:rounding-decomposition
853+782
round:860+782=1642 ; adjust:1642-7=1635 ; sum=1635
sorting_algorithms
sorting_algorithms:selection-sort
7, 2, 9, 4, 8
[2,7,9,4,8] ; [2,4,9,7,8] ; [2,4,7,9,8] ; [2,4,7,8,9]
multidigit_addition
multidigit_addition:right-to-left-carry
430+366
d2:0+6+0=6→w6,c0 ; d1:3+6+0=9→w9,c0 ; d0:4+3+0=7→w7,c0 ; sum=796
list_summation
list_summation:left-to-right
9, 6, 4, 5
9+6=15 ; 15+4=19 ; 19+5=24
list_summation
list_summation:left-to-right
8, 7, 7, 5
8+7=15 ; 15+7=22 ; 22+5=27