task_name
stringclasses
6 values
strategy_id
stringclasses
20 values
input_text
stringlengths
6
26
reasoning_trace
stringlengths
11
152
base_conversion
base_conversion:decomposition
n=54,base=4
TERM:3*4^2=48 ; TERM:1*4^1=4 ; TERM:2*4^0=2 ; OUT:312
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,2) ; G=(4,4)
D:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4)
sorting_algorithms
sorting_algorithms:heap-sort
6, 3, 1, 2, 7
[6,7,1,2,3] ; [7,6,1,2,3] ; [3,6,1,2,7] ; [6,3,1,2,7] ; [2,3,1,6,7] ; [3,2,1,6,7] ; [1,2,3,6,7] ; [2,1,3,6,7] ; [1,2,3,6,7]
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x-16=-16
8x-16=-16 ; 8x=0 ; x=0
multidigit_addition
multidigit_addition:left-to-right-partials
549+890
p100:500+800=1300 ; p10:40+90=130 ; p1:9+0=9 ; sum=1300+130+9=1439
list_summation
list_summation:right-to-left
5, 1, 0, 8
0+8=8 ; 1+8=9 ; 5+9=14
base_conversion
base_conversion:decomposition
n=167,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:1*2^5=32 ; TERM:0*2^4=0 ; TERM:0*2^3=0 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:10100111
list_summation
list_summation:right-to-left
5, 4, 6, 3
6+3=9 ; 4+9=13 ; 5+13=18
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,2) ; G=(2,3)
R:(1,3) ; D:(2,3)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,0) ; G=(3,3)
R:(2,1) ; R:(2,2) ; R:(2,3) ; D:(3,3)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,3) ; G=(5,5)
R:(4,4) ; D:(5,4) ; R:(5,5)
linear_equation_solving
linear_equation_solving:inverse-ops
5x-35=-15
5x-35=-15 ; x=(-15--35)/5 ; x=20/5 ; x=4
sorting_algorithms
sorting_algorithms:bubble-sort
6, 2, 8, 7, 1
[2,6,8,7,1] ; [2,6,7,8,1] ; [2,6,7,1,8] ; [2,6,1,7,8] ; [2,1,6,7,8] ; [1,2,6,7,8]
sorting_algorithms
sorting_algorithms:heap-sort
5, 1, 8, 3, 2
[5,3,8,1,2] ; [8,3,5,1,2] ; [2,3,5,1,8] ; [5,3,2,1,8] ; [1,3,2,5,8] ; [3,1,2,5,8] ; [2,1,3,5,8] ; [1,2,3,5,8]
sorting_algorithms
sorting_algorithms:bubble-sort
7, 4, 2, 9, 3
[4,7,2,9,3] ; [4,2,7,9,3] ; [4,2,7,3,9] ; [2,4,7,3,9] ; [2,4,3,7,9] ; [2,3,4,7,9]
list_summation
list_summation:pairwise
5, 3, 1, 5
5+3=8 ; 1+5=6 ; 8+6=14
linear_equation_solving
linear_equation_solving:inverse-ops
8x-32=-40
8x-32=-40 ; x=(-40--32)/8 ; x=-8/8 ; x=-1
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,0) ; G=(4,4)
R:(1,1) ; D:(2,1) ; R:(2,2) ; D:(3,2) ; R:(3,3) ; D:(4,3) ; R:(4,4)
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x-9=-27
3x-9=-27 ; 3x=-18 ; x=-6
multidigit_addition
multidigit_addition:left-to-right-partials
630+195
p100:600+100=700 ; p10:30+90=120 ; p1:0+5=5 ; sum=700+120+5=825
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,1) ; G=(4,5)
R:(2,2) ; D:(3,2) ; R:(3,3) ; D:(4,3) ; R:(4,4) ; R:(4,5)
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)
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x-35=-91
7x-35=-91 ; 7x=-56 ; x=-8
multidigit_addition
multidigit_addition:right-to-left-carry
765+617
d2:5+7+0=12→w2,c1 ; d1:6+1+1=8→w8,c0 ; d0:7+6+0=13→w3,c1 ; sum=1382
list_summation
list_summation:pairwise
6, 4, 4, 3
6+4=10 ; 4+3=7 ; 10+7=17
list_summation
list_summation:right-to-left
5, 6, 9, 5
9+5=14 ; 6+14=20 ; 5+20=25
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x-24=-12
4x-24=-12 ; x+-6=-3 ; x=-3--6 ; x=3
list_summation
list_summation:right-to-left
8, 7, 1, 1
1+1=2 ; 7+2=9 ; 8+9=17
sorting_algorithms
sorting_algorithms:insertion-sort
7, 1, 5, 6, 4
[1,7,5,6,4] ; [1,5,7,6,4] ; [1,5,6,7,4] ; [1,4,5,6,7]
sorting_algorithms
sorting_algorithms:insertion-sort
6, 7, 8, 3, 5
[6,7,8,3,5] ; [6,7,8,3,5] ; [3,6,7,8,5] ; [3,5,6,7,8]
base_conversion
base_conversion:via-binary
n=120,base=2
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:1 ; CHUNK:3:1 ; CHUNK:4:0 ; CHUNK:5:0 ; CHUNK:6:0 ; OUT:1111000
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,4) ; G=(4,5)
R:(3,5) ; D:(4,5)
list_summation
list_summation:pairwise
5, 9, 8, 1
5+9=14 ; 8+1=9 ; 14+9=23
base_conversion
base_conversion:via-binary
n=148,base=8
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:2 ; CHUNK:2:4 ; OUT:224
base_conversion
base_conversion:via-binary
n=210,base=16
BINLEN:8 ; CHUNK:0:13 ; CHUNK:1:2 ; OUT:D2
base_conversion
base_conversion:decomposition
n=21,base=16
TERM:1*16^1=16 ; TERM:5*16^0=5 ; OUT:15
base_conversion
base_conversion:via-binary
n=174,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:0 ; CHUNK:4:1 ; CHUNK:5:1 ; CHUNK:6:1 ; CHUNK:7:0 ; OUT:10101110
sorting_algorithms
sorting_algorithms:bubble-sort
3, 6, 8, 5, 0
[3,6,5,8,0] ; [3,6,5,0,8] ; [3,5,6,0,8] ; [3,5,0,6,8] ; [3,0,5,6,8] ; [0,3,5,6,8]
multidigit_addition
multidigit_addition:right-to-left-carry
683+953
d2:3+3+0=6→w6,c0 ; d1:8+5+0=13→w3,c1 ; d0:6+9+1=16→w6,c1 ; sum=1636
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,3) ; G=(5,4)
D:(5,3) ; R:(5,4)
sorting_algorithms
sorting_algorithms:selection-sort
8, 1, 9, 2, 6
[1,8,9,2,6] ; [1,2,9,8,6] ; [1,2,6,8,9] ; [1,2,6,8,9]
list_summation
list_summation:right-to-left
3, 1, 2, 0
2+0=2 ; 1+2=3 ; 3+3=6
base_conversion
base_conversion:via-binary
n=202,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:1 ; CHUNK:5:0 ; CHUNK:6:1 ; CHUNK:7:0 ; OUT:11001010
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,0) ; G=(3,2)
R:(2,1) ; D:(3,1) ; R:(3,2)
linear_equation_solving
linear_equation_solving:inverse-ops
7x-14=-42
7x-14=-42 ; x=(-42--14)/7 ; x=-28/7 ; x=-4
base_conversion
base_conversion:decomposition
n=180,base=16
TERM:11*16^1=176 ; TERM:4*16^0=4 ; OUT:B4
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x+20=10
5x+20=10 ; 5x=-10 ; x=-2
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,0) ; G=(5,3)
R:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,0) ; G=(3,5)
D:(2,0) ; D:(3,0) ; R:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5)
multidigit_addition
multidigit_addition:left-to-right-partials
402+463
p100:400+400=800 ; p10:0+60=60 ; p1:2+3=5 ; sum=800+60+5=865
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,4) ; G=(4,5)
R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5)
base_conversion
base_conversion:repeated-division
n=121,base=16
DIV:121/16=7,r:9 ; DIV:7/16=0,r:7 ; OUT:79
linear_equation_solving
linear_equation_solving:inverse-ops
5x+0=0
5x+0=0 ; x=(0-0)/5 ; x=0/5 ; x=0
list_summation
list_summation:pairwise
9, 8, 0, 9
9+8=17 ; 0+9=9 ; 17+9=26
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,3) ; G=(2,5)
D:(2,3) ; R:(2,4) ; R:(2,5)
multidigit_addition
multidigit_addition:right-to-left-carry
593+201
d2:3+1+0=4→w4,c0 ; d1:9+0+0=9→w9,c0 ; d0:5+2+0=7→w7,c0 ; sum=794
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,1) ; G=(4,4)
R:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4)
sorting_algorithms
sorting_algorithms:merge-sort
2, 0, 9, 5, 1
[0,2,9,5,1] ; [0,2,5,9,1] ; [0,1,2,5,9]
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x+12=48
6x+12=48 ; x+2=8 ; x=8-2 ; x=6
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x+21=28
7x+21=28 ; x+3=4 ; x=4-3 ; x=1
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,1) ; G=(5,3)
D:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3)
sorting_algorithms
sorting_algorithms:selection-sort
3, 6, 1, 7, 8
[1,6,3,7,8] ; [1,3,6,7,8] ; [1,3,6,7,8] ; [1,3,6,7,8]
linear_equation_solving
linear_equation_solving:inverse-ops
2x+0=8
2x+0=8 ; x=(8-0)/2 ; x=8/2 ; x=4
sorting_algorithms
sorting_algorithms:heap-sort
8, 3, 4, 7, 2
[8,7,4,3,2] ; [2,7,4,3,8] ; [7,2,4,3,8] ; [7,3,4,2,8] ; [2,3,4,7,8] ; [4,3,2,7,8] ; [2,3,4,7,8] ; [3,2,4,7,8] ; [2,3,4,7,8]
multidigit_addition
multidigit_addition:right-to-left-carry
795+889
d2:5+9+0=14→w4,c1 ; d1:9+8+1=18→w8,c1 ; d0:7+8+1=16→w6,c1 ; sum=1684
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,3) ; G=(5,4)
R:(3,4) ; D:(4,4) ; D:(5,4)
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+0=8
8x+0=8 ; 8x=8 ; x=1
list_summation
list_summation:left-to-right
8, 9, 5, 8
8+9=17 ; 17+5=22 ; 22+8=30
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,2) ; G=(5,5)
R:(4,3) ; D:(5,3) ; R:(5,4) ; R:(5,5)
multidigit_addition
multidigit_addition:rounding-decomposition
515+471
round:520+471=991 ; adjust:991-5=986 ; sum=986
base_conversion
base_conversion:via-binary
n=16,base=8
BINLEN:5 ; CHUNK:0:2 ; CHUNK:1:0 ; OUT:20
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,3) ; G=(5,4)
D:(5,3) ; R:(5,4)
sorting_algorithms
sorting_algorithms:heap-sort
8, 4, 1, 7, 2
[8,7,1,4,2] ; [2,7,1,4,8] ; [7,2,1,4,8] ; [7,4,1,2,8] ; [2,4,1,7,8] ; [4,2,1,7,8] ; [1,2,4,7,8] ; [2,1,4,7,8] ; [1,2,4,7,8]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,2) ; G=(2,4)
D:(2,2) ; R:(2,3) ; R:(2,4)
multidigit_addition
multidigit_addition:left-to-right-partials
468+319
p100:400+300=700 ; p10:60+10=70 ; p1:8+9=17 ; sum=700+70+17=787
base_conversion
base_conversion:via-binary
n=208,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:1 ; CHUNK:4:0 ; CHUNK:5:0 ; CHUNK:6:0 ; CHUNK:7:0 ; OUT:11010000
list_summation
list_summation:left-to-right
1, 9, 4, 8
1+9=10 ; 10+4=14 ; 14+8=22
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
7x-63=-126
7x-63=-126 ; x+-9=-18 ; x=-18--9 ; x=-9
list_summation
list_summation:pairwise
2, 1, 0, 4
2+1=3 ; 0+4=4 ; 3+4=7
base_conversion
base_conversion:decomposition
n=136,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:0*2^5=0 ; TERM:0*2^4=0 ; TERM:1*2^3=8 ; TERM:0*2^2=0 ; TERM:0*2^1=0 ; TERM:0*2^0=0 ; OUT:10001000
multidigit_addition
multidigit_addition:left-to-right-partials
210+829
p100:200+800=1000 ; p10:10+20=30 ; p1:0+9=9 ; sum=1000+30+9=1039
base_conversion
base_conversion:decomposition
n=166,base=16
TERM:10*16^1=160 ; TERM:6*16^0=6 ; OUT:A6
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,4) ; G=(4,5)
D:(4,4) ; R:(4,5)
base_conversion
base_conversion:via-binary
n=22,base=16
BINLEN:5 ; CHUNK:0:1 ; CHUNK:1:6 ; OUT:16
multidigit_addition
multidigit_addition:left-to-right-partials
257+141
p100:200+100=300 ; p10:50+40=90 ; p1:7+1=8 ; sum=300+90+8=398
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)
sorting_algorithms
sorting_algorithms:merge-sort
4, 9, 1, 0, 8
[4,9,0,1,8] ; [0,1,4,9,8] ; [0,1,4,8,9]
sorting_algorithms
sorting_algorithms:selection-sort
7, 3, 0, 9, 6
[0,3,7,9,6] ; [0,3,7,9,6] ; [0,3,6,9,7] ; [0,3,6,7,9]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,4) ; G=(4,5)
D:(2,4) ; D:(3,4) ; D:(4,4) ; R:(4,5)
list_summation
list_summation:right-to-left
4, 4, 3, 1
3+1=4 ; 4+4=8 ; 4+8=12
base_conversion
base_conversion:decomposition
n=155,base=8
TERM:2*8^2=128 ; TERM:3*8^1=24 ; TERM:3*8^0=3 ; OUT:233
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,0) ; G=(2,3)
R:(1,1) ; R:(1,2) ; R:(1,3) ; D:(2,3)
multidigit_addition
multidigit_addition:left-to-right-partials
936+373
p100:900+300=1200 ; p10:30+70=100 ; p1:6+3=9 ; sum=1200+100+9=1309
base_conversion
base_conversion:repeated-division
n=180,base=2
DIV:180/2=90,r:0 ; DIV:90/2=45,r:0 ; DIV:45/2=22,r:1 ; 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:10110100
list_summation
list_summation:right-to-left
8, 9, 6, 3
6+3=9 ; 9+9=18 ; 8+18=26
list_summation
list_summation:right-to-left
2, 2, 1, 6
1+6=7 ; 2+7=9 ; 2+9=11
sorting_algorithms
sorting_algorithms:selection-sort
7, 0, 3, 2, 8
[0,7,3,2,8] ; [0,2,3,7,8] ; [0,2,3,7,8] ; [0,2,3,7,8]
list_summation
list_summation:right-to-left
4, 3, 8, 8
8+8=16 ; 3+16=19 ; 4+19=23
sorting_algorithms
sorting_algorithms:heap-sort
7, 4, 3, 8, 9
[7,9,3,8,4] ; [9,7,3,8,4] ; [9,8,3,7,4] ; [4,8,3,7,9] ; [8,4,3,7,9] ; [8,7,3,4,9] ; [4,7,3,8,9] ; [7,4,3,8,9] ; [3,4,7,8,9] ; [4,3,7,8,9] ; [3,4,7,8,9]