task_name
stringclasses
6 values
strategy_id
stringclasses
20 values
input_text
stringlengths
6
26
reasoning_trace
stringlengths
11
152
multidigit_addition
multidigit_addition:rounding-decomposition
252+689
round:260+689=949 ; adjust:949-8=941 ; sum=941
list_summation
list_summation:left-to-right
7, 1, 8, 5
7+1=8 ; 8+8=16 ; 16+5=21
base_conversion
base_conversion:repeated-division
n=35,base=4
DIV:35/4=8,r:3 ; DIV:8/4=2,r:0 ; DIV:2/4=0,r:2 ; OUT:203
multidigit_addition
multidigit_addition:right-to-left-carry
356+120
d2:6+0+0=6→w6,c0 ; d1:5+2+0=7→w7,c0 ; d0:3+1+0=4→w4,c0 ; sum=476
base_conversion
base_conversion:repeated-division
n=186,base=8
DIV:186/8=23,r:2 ; DIV:23/8=2,r:7 ; DIV:2/8=0,r:2 ; OUT:272
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,3) ; G=(5,4)
R:(4,4) ; D:(5,4)
list_summation
list_summation:right-to-left
0, 2, 1, 1
1+1=2 ; 2+2=4 ; 0+4=4
multidigit_addition
multidigit_addition:left-to-right-partials
303+788
p100:300+700=1000 ; p10:0+80=80 ; p1:3+8=11 ; sum=1000+80+11=1091
base_conversion
base_conversion:repeated-division
n=14,base=4
DIV:14/4=3,r:2 ; DIV:3/4=0,r:3 ; OUT:32
base_conversion
base_conversion:decomposition
n=254,base=16
TERM:15*16^1=240 ; TERM:14*16^0=14 ; OUT:FE
list_summation
list_summation:pairwise
0, 8, 7, 6
0+8=8 ; 7+6=13 ; 8+13=21
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,2) ; G=(2,5)
R:(0,3) ; R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5)
multidigit_addition
multidigit_addition:left-to-right-partials
225+664
p100:200+600=800 ; p10:20+60=80 ; p1:5+4=9 ; sum=800+80+9=889
multidigit_addition
multidigit_addition:left-to-right-partials
309+104
p100:300+100=400 ; p10:0+0=0 ; p1:9+4=13 ; sum=400+0+13=413
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)
base_conversion
base_conversion:via-binary
n=190,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:1 ; CHUNK:4:1 ; CHUNK:5:1 ; CHUNK:6:1 ; CHUNK:7:0 ; OUT:10111110
multidigit_addition
multidigit_addition:left-to-right-partials
180+175
p100:100+100=200 ; p10:80+70=150 ; p1:0+5=5 ; sum=200+150+5=355
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,1) ; G=(3,2)
R:(2,2) ; D:(3,2)
list_summation
list_summation:pairwise
5, 3, 9, 5
5+3=8 ; 9+5=14 ; 8+14=22
base_conversion
base_conversion:via-binary
n=24,base=8
BINLEN:5 ; CHUNK:0:3 ; CHUNK:1:0 ; OUT:30
base_conversion
base_conversion:via-binary
n=76,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:3 ; CHUNK:3:0 ; OUT:1030
base_conversion
base_conversion:decomposition
n=88,base=4
TERM:1*4^3=64 ; TERM:1*4^2=16 ; TERM:2*4^1=8 ; TERM:0*4^0=0 ; OUT:1120
list_summation
list_summation:right-to-left
6, 7, 4, 9
4+9=13 ; 7+13=20 ; 6+20=26
sorting_algorithms
sorting_algorithms:heap-sort
6, 7, 3, 9, 0
[6,9,3,7,0] ; [9,6,3,7,0] ; [9,7,3,6,0] ; [0,7,3,6,9] ; [7,0,3,6,9] ; [7,6,3,0,9] ; [0,6,3,7,9] ; [6,0,3,7,9] ; [3,0,6,7,9] ; [0,3,6,7,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x-3=15
3x-3=15 ; 3x=18 ; x=6
sorting_algorithms
sorting_algorithms:merge-sort
5, 7, 8, 6, 2
[5,7,6,8,2] ; [5,6,7,8,2] ; [2,5,6,7,8]
list_summation
list_summation:pairwise
1, 6, 8, 6
1+6=7 ; 8+6=14 ; 7+14=21
sorting_algorithms
sorting_algorithms:insertion-sort
1, 5, 9, 2, 0
[1,5,9,2,0] ; [1,5,9,2,0] ; [1,2,5,9,0] ; [0,1,2,5,9]
sorting_algorithms
sorting_algorithms:heap-sort
2, 6, 7, 3, 5
[7,6,2,3,5] ; [5,6,2,3,7] ; [6,5,2,3,7] ; [3,5,2,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:right-to-left
6, 3, 5, 3
5+3=8 ; 3+8=11 ; 6+11=17
list_summation
list_summation:right-to-left
7, 9, 4, 0
4+0=4 ; 9+4=13 ; 7+13=20
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
linear_equation_solving
linear_equation_solving:inverse-ops
4x-12=-8
4x-12=-8 ; x=(-8--12)/4 ; x=4/4 ; x=1
list_summation
list_summation:pairwise
1, 7, 4, 9
1+7=8 ; 4+9=13 ; 8+13=21
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,4) ; G=(3,5)
R:(1,5) ; D:(2,5) ; D:(3,5)
sorting_algorithms
sorting_algorithms:merge-sort
9, 3, 4, 2, 0
[3,9,4,2,0] ; [3,9,2,4,0] ; [2,3,4,9,0] ; [0,2,3,4,9]
base_conversion
base_conversion:via-binary
n=34,base=4
BINLEN:6 ; CHUNK:0:2 ; CHUNK:1:0 ; CHUNK:2:2 ; OUT:202
multidigit_addition
multidigit_addition:right-to-left-carry
424+143
d2:4+3+0=7→w7,c0 ; d1:2+4+0=6→w6,c0 ; d0:4+1+0=5→w5,c0 ; sum=567
sorting_algorithms
sorting_algorithms:heap-sort
2, 8, 1, 6, 3
[8,2,1,6,3] ; [8,6,1,2,3] ; [3,6,1,2,8] ; [6,3,1,2,8] ; [2,3,1,6,8] ; [3,2,1,6,8] ; [1,2,3,6,8] ; [2,1,3,6,8] ; [1,2,3,6,8]
sorting_algorithms
sorting_algorithms:merge-sort
3, 7, 9, 1, 4
[3,7,1,9,4] ; [1,3,7,9,4] ; [1,3,4,7,9]
multidigit_addition
multidigit_addition:right-to-left-carry
395+230
d2:5+0+0=5→w5,c0 ; d1:9+3+0=12→w2,c1 ; d0:3+2+1=6→w6,c0 ; sum=625
sorting_algorithms
sorting_algorithms:merge-sort
1, 6, 0, 2, 3
[0,1,2,6,3] ; [0,1,2,3,6]
list_summation
list_summation:pairwise
6, 2, 7, 1
6+2=8 ; 7+1=8 ; 8+8=16
list_summation
list_summation:pairwise
6, 0, 6, 0
6+0=6 ; 6+0=6 ; 6+6=12
multidigit_addition
multidigit_addition:left-to-right-partials
771+924
p100:700+900=1600 ; p10:70+20=90 ; p1:1+4=5 ; sum=1600+90+5=1695
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x+25=5
5x+25=5 ; 5x=-20 ; x=-4
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
sorting_algorithms
sorting_algorithms:selection-sort
7, 4, 8, 2, 5
[2,4,8,7,5] ; [2,4,8,7,5] ; [2,4,5,7,8] ; [2,4,5,7,8]
sorting_algorithms
sorting_algorithms:merge-sort
2, 7, 3, 8, 9
[2,3,7,8,9]
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-8=-4
2x-8=-4 ; x+-4=-2 ; x=-2--4 ; x=2
list_summation
list_summation:right-to-left
9, 1, 6, 7
6+7=13 ; 1+13=14 ; 9+14=23
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x+24=56
8x+24=56 ; x+3=7 ; x=7-3 ; x=4
sorting_algorithms
sorting_algorithms:heap-sort
4, 1, 8, 0, 9
[4,9,8,0,1] ; [9,4,8,0,1] ; [1,4,8,0,9] ; [8,4,1,0,9] ; [0,4,1,8,9] ; [4,0,1,8,9] ; [1,0,4,8,9] ; [0,1,4,8,9]
base_conversion
base_conversion:decomposition
n=103,base=8
TERM:1*8^2=64 ; TERM:4*8^1=32 ; TERM:7*8^0=7 ; OUT:147
linear_equation_solving
linear_equation_solving:inverse-ops
8x-8=-72
8x-8=-72 ; x=(-72--8)/8 ; x=-64/8 ; x=-8
sorting_algorithms
sorting_algorithms:heap-sort
1, 8, 5, 0, 3
[8,1,5,0,3] ; [8,3,5,0,1] ; [1,3,5,0,8] ; [5,3,1,0,8] ; [0,3,1,5,8] ; [3,0,1,5,8] ; [1,0,3,5,8] ; [0,1,3,5,8]
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x-21=-36
3x-21=-36 ; x+-7=-12 ; x=-12--7 ; x=-5
sorting_algorithms
sorting_algorithms:heap-sort
9, 0, 6, 4, 2
[9,4,6,0,2] ; [2,4,6,0,9] ; [6,4,2,0,9] ; [0,4,2,6,9] ; [4,0,2,6,9] ; [2,0,4,6,9] ; [0,2,4,6,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,0) ; G=(5,2)
R:(1,1) ; D:(2,1) ; R:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,1) ; G=(5,3)
R:(4,2) ; D:(5,2) ; R:(5,3)
sorting_algorithms
sorting_algorithms:selection-sort
8, 9, 6, 7, 1
[1,9,6,7,8] ; [1,6,9,7,8] ; [1,6,7,9,8] ; [1,6,7,8,9]
sorting_algorithms
sorting_algorithms:merge-sort
4, 3, 1, 7, 5
[3,4,1,7,5] ; [1,3,4,7,5] ; [1,3,4,5,7]
sorting_algorithms
sorting_algorithms:selection-sort
8, 5, 7, 6, 2
[2,5,7,6,8] ; [2,5,7,6,8] ; [2,5,6,7,8] ; [2,5,6,7,8]
linear_equation_solving
linear_equation_solving:inverse-ops
6x-24=-30
6x-24=-30 ; x=(-30--24)/6 ; x=-6/6 ; x=-1
sorting_algorithms
sorting_algorithms:insertion-sort
4, 2, 7, 8, 6
[2,4,7,8,6] ; [2,4,7,8,6] ; [2,4,7,8,6] ; [2,4,6,7,8]
multidigit_addition
multidigit_addition:right-to-left-carry
210+665
d2:0+5+0=5→w5,c0 ; d1:1+6+0=7→w7,c0 ; d0:2+6+0=8→w8,c0 ; sum=875
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x+30=12
6x+30=12 ; x+5=2 ; x=2-5 ; x=-3
list_summation
list_summation:pairwise
5, 1, 5, 9
5+1=6 ; 5+9=14 ; 6+14=20
list_summation
list_summation:right-to-left
5, 6, 2, 9
2+9=11 ; 6+11=17 ; 5+17=22
list_summation
list_summation:pairwise
3, 1, 8, 0
3+1=4 ; 8+0=8 ; 4+8=12
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x+6=30
6x+6=30 ; 6x=24 ; x=4
base_conversion
base_conversion:decomposition
n=100,base=16
TERM:6*16^1=96 ; TERM:4*16^0=4 ; OUT:64
base_conversion
base_conversion:decomposition
n=226,base=8
TERM:3*8^2=192 ; TERM:4*8^1=32 ; TERM:2*8^0=2 ; OUT:342
multidigit_addition
multidigit_addition:right-to-left-carry
695+308
d2:5+8+0=13→w3,c1 ; d1:9+0+1=10→w0,c1 ; d0:6+3+1=10→w0,c1 ; sum=1003
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,2) ; G=(5,5)
R:(0,3) ; R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
sorting_algorithms
sorting_algorithms:insertion-sort
1, 6, 5, 2, 7
[1,6,5,2,7] ; [1,5,6,2,7] ; [1,2,5,6,7] ; [1,2,5,6,7]
multidigit_addition
multidigit_addition:rounding-decomposition
821+197
round:830+197=1027 ; adjust:1027-9=1018 ; sum=1018
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,2) ; G=(5,5)
R:(3,3) ; R:(3,4) ; R:(3,5) ; D:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,2) ; G=(3,5)
R:(2,3) ; R:(2,4) ; R:(2,5) ; D:(3,5)
base_conversion
base_conversion:via-binary
n=238,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:5 ; CHUNK:2:6 ; OUT:356
sorting_algorithms
sorting_algorithms:heap-sort
9, 0, 1, 6, 2
[9,6,1,0,2] ; [2,6,1,0,9] ; [6,2,1,0,9] ; [0,2,1,6,9] ; [2,0,1,6,9] ; [1,0,2,6,9] ; [0,1,2,6,9]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,4) ; G=(5,5)
D:(5,4) ; R:(5,5)
sorting_algorithms
sorting_algorithms:insertion-sort
8, 1, 2, 4, 9
[1,8,2,4,9] ; [1,2,8,4,9] ; [1,2,4,8,9] ; [1,2,4,8,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,0) ; G=(4,1)
R:(2,1) ; D:(3,1) ; D:(4,1)
base_conversion
base_conversion:decomposition
n=122,base=2
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:1*2^1=2 ; TERM:0*2^0=0 ; OUT:1111010
multidigit_addition
multidigit_addition:rounding-decomposition
996+492
round:1000+492=1492 ; adjust:1492-4=1488 ; sum=1488
base_conversion
base_conversion:via-binary
n=235,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:5 ; CHUNK:2:3 ; OUT:353
list_summation
list_summation:right-to-left
8, 6, 1, 9
1+9=10 ; 6+10=16 ; 8+16=24
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,1) ; G=(5,2)
R:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2)
multidigit_addition
multidigit_addition:rounding-decomposition
165+744
round:170+744=914 ; adjust:914-5=909 ; sum=909
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,1) ; G=(5,5)
R:(2,2) ; D:(3,2) ; R:(3,3) ; D:(4,3) ; R:(4,4) ; D:(5,4) ; R:(5,5)
multidigit_addition
multidigit_addition:right-to-left-carry
178+458
d2:8+8+0=16→w6,c1 ; d1:7+5+1=13→w3,c1 ; d0:1+4+1=6→w6,c0 ; sum=636
sorting_algorithms
sorting_algorithms:heap-sort
9, 7, 5, 2, 1
[1,7,5,2,9] ; [7,1,5,2,9] ; [7,2,5,1,9] ; [1,2,5,7,9] ; [5,2,1,7,9] ; [1,2,5,7,9] ; [2,1,5,7,9] ; [1,2,5,7,9]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,3) ; G=(3,5)
D:(3,3) ; R:(3,4) ; R:(3,5)
base_conversion
base_conversion:via-binary
n=32,base=2
BINLEN:6 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:0 ; CHUNK:5:0 ; OUT:100000
base_conversion
base_conversion:repeated-division
n=129,base=4
DIV:129/4=32,r:1 ; DIV:32/4=8,r:0 ; DIV:8/4=2,r:0 ; DIV:2/4=0,r:2 ; OUT:2001
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,4) ; G=(3,5)
D:(3,4) ; R:(3,5)
list_summation
list_summation:pairwise
5, 9, 9, 8
5+9=14 ; 9+8=17 ; 14+17=31
list_summation
list_summation:left-to-right
1, 3, 7, 9
1+3=4 ; 4+7=11 ; 11+9=20
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,0) ; G=(1,1)
R:(0,1) ; D:(1,1)