task_name
stringclasses
6 values
strategy_id
stringclasses
20 values
input_text
stringlengths
6
26
reasoning_trace
stringlengths
11
152
sorting_algorithms
sorting_algorithms:bubble-sort
0, 3, 4, 9, 7
[0,3,4,7,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,3) ; G=(5,5)
R:(4,4) ; D:(5,4) ; R:(5,5)
sorting_algorithms
sorting_algorithms:selection-sort
3, 7, 6, 1, 8
[1,7,6,3,8] ; [1,3,6,7,8] ; [1,3,6,7,8] ; [1,3,6,7,8]
sorting_algorithms
sorting_algorithms:insertion-sort
0, 6, 2, 9, 4
[0,6,2,9,4] ; [0,2,6,9,4] ; [0,2,6,9,4] ; [0,2,4,6,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,3) ; G=(3,5)
R:(2,4) ; D:(3,4) ; R:(3,5)
list_summation
list_summation:left-to-right
0, 1, 8, 5
0+1=1 ; 1+8=9 ; 9+5=14
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,2) ; G=(3,5)
D:(2,2) ; D:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x-81=-90
9x-81=-90 ; x+-9=-10 ; x=-10--9 ; x=-1
multidigit_addition
multidigit_addition:right-to-left-carry
612+781
d2:2+1+0=3→w3,c0 ; d1:1+8+0=9→w9,c0 ; d0:6+7+0=13→w3,c1 ; sum=1393
sorting_algorithms
sorting_algorithms:heap-sort
0, 9, 6, 5, 2
[9,0,6,5,2] ; [9,5,6,0,2] ; [2,5,6,0,9] ; [6,5,2,0,9] ; [0,5,2,6,9] ; [5,0,2,6,9] ; [2,0,5,6,9] ; [0,2,5,6,9]
list_summation
list_summation:left-to-right
5, 2, 5, 9
5+2=7 ; 7+5=12 ; 12+9=21
multidigit_addition
multidigit_addition:right-to-left-carry
649+372
d2:9+2+0=11→w1,c1 ; d1:4+7+1=12→w2,c1 ; d0:6+3+1=10→w0,c1 ; sum=1021
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x-15=-10
5x-15=-10 ; x+-3=-2 ; x=-2--3 ; x=1
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,0) ; G=(5,5)
R:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5) ; D:(5,5)
multidigit_addition
multidigit_addition:right-to-left-carry
227+542
d2:7+2+0=9→w9,c0 ; d1:2+4+0=6→w6,c0 ; d0:2+5+0=7→w7,c0 ; sum=769
multidigit_addition
multidigit_addition:right-to-left-carry
549+581
d2:9+1+0=10→w0,c1 ; d1:4+8+1=13→w3,c1 ; d0:5+5+1=11→w1,c1 ; sum=1130
sorting_algorithms
sorting_algorithms:selection-sort
1, 3, 6, 0, 8
[0,3,6,1,8] ; [0,1,6,3,8] ; [0,1,3,6,8] ; [0,1,3,6,8]
multidigit_addition
multidigit_addition:left-to-right-partials
973+977
p100:900+900=1800 ; p10:70+70=140 ; p1:3+7=10 ; sum=1800+140+10=1950
linear_equation_solving
linear_equation_solving:inverse-ops
3x+27=51
3x+27=51 ; x=(51-27)/3 ; x=24/3 ; x=8
sorting_algorithms
sorting_algorithms:heap-sort
9, 0, 1, 2, 3
[9,3,1,2,0] ; [0,3,1,2,9] ; [3,0,1,2,9] ; [3,2,1,0,9] ; [0,2,1,3,9] ; [2,0,1,3,9] ; [1,0,2,3,9] ; [0,1,2,3,9]
list_summation
list_summation:left-to-right
2, 5, 9, 8
2+5=7 ; 7+9=16 ; 16+8=24
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x+6=-6
3x+6=-6 ; x+2=-2 ; x=-2-2 ; x=-4
list_summation
list_summation:right-to-left
7, 6, 8, 7
8+7=15 ; 6+15=21 ; 7+21=28
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,1) ; G=(2,3)
R:(1,2) ; R:(1,3) ; D:(2,3)
base_conversion
base_conversion:decomposition
n=238,base=2
TERM:1*2^7=128 ; 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:11101110
base_conversion
base_conversion:repeated-division
n=105,base=4
DIV:105/4=26,r:1 ; DIV:26/4=6,r:2 ; DIV:6/4=1,r:2 ; DIV:1/4=0,r:1 ; OUT:1221
base_conversion
base_conversion:via-binary
n=208,base=4
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:0 ; OUT:3100
list_summation
list_summation:right-to-left
0, 9, 0, 8
0+8=8 ; 9+8=17 ; 0+17=17
list_summation
list_summation:left-to-right
6, 8, 0, 1
6+8=14 ; 14+0=14 ; 14+1=15
sorting_algorithms
sorting_algorithms:heap-sort
0, 5, 8, 3, 4
[8,5,0,3,4] ; [4,5,0,3,8] ; [5,4,0,3,8] ; [3,4,0,5,8] ; [4,3,0,5,8] ; [0,3,4,5,8] ; [3,0,4,5,8] ; [0,3,4,5,8]
base_conversion
base_conversion:repeated-division
n=245,base=16
DIV:245/16=15,r:5 ; DIV:15/16=0,r:15 ; OUT:F5
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x+0=0
2x+0=0 ; x+0=0 ; x=0-0 ; x=0
list_summation
list_summation:pairwise
9, 9, 7, 0
9+9=18 ; 7+0=7 ; 18+7=25
multidigit_addition
multidigit_addition:right-to-left-carry
467+925
d2:7+5+0=12→w2,c1 ; d1:6+2+1=9→w9,c0 ; d0:4+9+0=13→w3,c1 ; sum=1392
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x-32=-96
8x-32=-96 ; x+-4=-12 ; x=-12--4 ; x=-8
sorting_algorithms
sorting_algorithms:merge-sort
1, 5, 8, 0, 7
[1,5,0,8,7] ; [0,1,5,8,7] ; [0,1,5,7,8]
sorting_algorithms
sorting_algorithms:bubble-sort
2, 4, 9, 5, 7
[2,4,5,9,7] ; [2,4,5,7,9]
base_conversion
base_conversion:via-binary
n=190,base=16
BINLEN:8 ; CHUNK:0:11 ; CHUNK:1:14 ; OUT:BE
base_conversion
base_conversion:via-binary
n=205,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:1 ; CHUNK:2:5 ; OUT:315
sorting_algorithms
sorting_algorithms:selection-sort
7, 1, 8, 4, 5
[1,7,8,4,5] ; [1,4,8,7,5] ; [1,4,5,7,8] ; [1,4,5,7,8]
sorting_algorithms
sorting_algorithms:merge-sort
7, 4, 1, 8, 2
[4,7,1,8,2] ; [1,4,7,8,2] ; [1,2,4,7,8]
multidigit_addition
multidigit_addition:left-to-right-partials
592+549
p100:500+500=1000 ; p10:90+40=130 ; p1:2+9=11 ; sum=1000+130+11=1141
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,0) ; G=(5,4)
R:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4) ; D:(5,4)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,1) ; G=(5,3)
R:(1,2) ; R:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3) ; D:(5,3)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,3) ; G=(5,5)
R:(4,4) ; D:(5,4) ; R:(5,5)
list_summation
list_summation:pairwise
9, 3, 5, 7
9+3=12 ; 5+7=12 ; 12+12=24
list_summation
list_summation:left-to-right
0, 6, 4, 2
0+6=6 ; 6+4=10 ; 10+2=12
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x-10=0
2x-10=0 ; 2x=10 ; x=5
multidigit_addition
multidigit_addition:rounding-decomposition
250+918
round:250+918=1168 ; adjust:1168-0=1168 ; sum=1168
list_summation
list_summation:right-to-left
0, 7, 3, 7
3+7=10 ; 7+10=17 ; 0+17=17
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,4) ; G=(4,5)
D:(3,4) ; D:(4,4) ; R:(4,5)
list_summation
list_summation:pairwise
1, 7, 8, 0
1+7=8 ; 8+0=8 ; 8+8=16
base_conversion
base_conversion:repeated-division
n=191,base=4
DIV:191/4=47,r:3 ; DIV:47/4=11,r:3 ; DIV:11/4=2,r:3 ; DIV:2/4=0,r:2 ; OUT:2333
multidigit_addition
multidigit_addition:right-to-left-carry
967+863
d2:7+3+0=10→w0,c1 ; d1:6+6+1=13→w3,c1 ; d0:9+8+1=18→w8,c1 ; sum=1830
linear_equation_solving
linear_equation_solving:inverse-ops
4x+12=36
4x+12=36 ; x=(36-12)/4 ; x=24/4 ; x=6
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x-49=14
7x-49=14 ; 7x=63 ; x=9
multidigit_addition
multidigit_addition:left-to-right-partials
981+303
p100:900+300=1200 ; p10:80+0=80 ; p1:1+3=4 ; sum=1200+80+4=1284
base_conversion
base_conversion:via-binary
n=178,base=4
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:3 ; CHUNK:2:0 ; CHUNK:3:2 ; OUT:2302
sorting_algorithms
sorting_algorithms:bubble-sort
0, 3, 5, 1, 6
[0,3,1,5,6] ; [0,1,3,5,6]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,2) ; G=(1,3)
R:(0,3) ; D:(1,3)
list_summation
list_summation:right-to-left
4, 5, 4, 8
4+8=12 ; 5+12=17 ; 4+17=21
sorting_algorithms
sorting_algorithms:merge-sort
9, 3, 0, 8, 7
[3,9,0,8,7] ; [0,3,8,9,7] ; [0,3,7,8,9]
base_conversion
base_conversion:decomposition
n=123,base=16
TERM:7*16^1=112 ; TERM:11*16^0=11 ; OUT:7B
base_conversion
base_conversion:via-binary
n=26,base=16
BINLEN:5 ; CHUNK:0:1 ; CHUNK:1:10 ; OUT:1A
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,0) ; G=(3,3)
D:(3,0) ; R:(3,1) ; R:(3,2) ; R:(3,3)
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x+24=3
3x+24=3 ; x+8=1 ; x=1-8 ; x=-7
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,4) ; G=(4,5)
D:(4,4) ; R:(4,5)
sorting_algorithms
sorting_algorithms:selection-sort
7, 9, 3, 4, 6
[3,9,7,4,6] ; [3,4,7,9,6] ; [3,4,6,9,7] ; [3,4,6,7,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-42=-66
6x-42=-66 ; 6x=-24 ; x=-4
list_summation
list_summation:pairwise
6, 1, 6, 3
6+1=7 ; 6+3=9 ; 7+9=16
list_summation
list_summation:left-to-right
8, 1, 7, 2
8+1=9 ; 9+7=16 ; 16+2=18
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
multidigit_addition
multidigit_addition:right-to-left-carry
830+842
d2:0+2+0=2→w2,c0 ; d1:3+4+0=7→w7,c0 ; d0:8+8+0=16→w6,c1 ; sum=1672
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,2) ; G=(3,3)
D:(3,2) ; R:(3,3)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,1) ; G=(2,4)
R:(0,2) ; D:(1,2) ; R:(1,3) ; D:(2,3) ; R:(2,4)
linear_equation_solving
linear_equation_solving:inverse-ops
9x-18=-18
9x-18=-18 ; x=(-18--18)/9 ; x=0/9 ; x=0
base_conversion
base_conversion:decomposition
n=15,base=8
TERM:1*8^1=8 ; TERM:7*8^0=7 ; OUT:17
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+32=64
8x+32=64 ; 8x=32 ; x=4
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,4) ; G=(5,5)
D:(3,4) ; D:(4,4) ; D:(5,4) ; R:(5,5)
multidigit_addition
multidigit_addition:rounding-decomposition
376+902
round:380+902=1282 ; adjust:1282-4=1278 ; sum=1278
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,1) ; G=(5,3)
D:(3,1) ; D:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,2) ; G=(4,4)
D:(4,2) ; R:(4,3) ; R:(4,4)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,4) ; G=(5,5)
R:(3,5) ; D:(4,5) ; D:(5,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x-35=-55
5x-35=-55 ; x+-7=-11 ; x=-11--7 ; x=-4
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,2) ; G=(4,3)
R:(2,3) ; D:(3,3) ; D:(4,3)
multidigit_addition
multidigit_addition:left-to-right-partials
145+107
p100:100+100=200 ; p10:40+0=40 ; p1:5+7=12 ; sum=200+40+12=252
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:alternating
grid=6 ; S=(1,4) ; G=(3,5)
R:(1,5) ; D:(2,5) ; D:(3,5)
multidigit_addition
multidigit_addition:left-to-right-partials
124+712
p100:100+700=800 ; p10:20+10=30 ; p1:4+2=6 ; sum=800+30+6=836
list_summation
list_summation:pairwise
1, 7, 4, 0
1+7=8 ; 4+0=4 ; 8+4=12
list_summation
list_summation:left-to-right
0, 9, 2, 8
0+9=9 ; 9+2=11 ; 11+8=19
sorting_algorithms
sorting_algorithms:heap-sort
6, 5, 9, 0, 1
[9,5,6,0,1] ; [1,5,6,0,9] ; [6,5,1,0,9] ; [0,5,1,6,9] ; [5,0,1,6,9] ; [1,0,5,6,9] ; [0,1,5,6,9]
sorting_algorithms
sorting_algorithms:heap-sort
6, 7, 3, 9, 4
[6,9,3,7,4] ; [9,6,3,7,4] ; [9,7,3,6,4] ; [4,7,3,6,9] ; [7,4,3,6,9] ; [7,6,3,4,9] ; [4,6,3,7,9] ; [6,4,3,7,9] ; [3,4,6,7,9] ; [4,3,6,7,9] ; [3,4,6,7,9]
list_summation
list_summation:pairwise
6, 0, 0, 5
6+0=6 ; 0+5=5 ; 6+5=11
sorting_algorithms
sorting_algorithms:heap-sort
5, 3, 0, 2, 6
[5,6,0,2,3] ; [6,5,0,2,3] ; [3,5,0,2,6] ; [5,3,0,2,6] ; [2,3,0,5,6] ; [3,2,0,5,6] ; [0,2,3,5,6] ; [2,0,3,5,6] ; [0,2,3,5,6]
base_conversion
base_conversion:via-binary
n=80,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:0 ; OUT:1100
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)
sorting_algorithms
sorting_algorithms:insertion-sort
7, 2, 1, 6, 5
[2,7,1,6,5] ; [1,2,7,6,5] ; [1,2,6,7,5] ; [1,2,5,6,7]
base_conversion
base_conversion:repeated-division
n=253,base=8
DIV:253/8=31,r:5 ; DIV:31/8=3,r:7 ; DIV:3/8=0,r:3 ; OUT:375
list_summation
list_summation:right-to-left
9, 2, 4, 4
4+4=8 ; 2+8=10 ; 9+10=19