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=134,base=16
TERM:8*16^1=128 ; TERM:6*16^0=6 ; OUT:86
sorting_algorithms
sorting_algorithms:selection-sort
8, 5, 7, 4, 3
[3,5,7,4,8] ; [3,4,7,5,8] ; [3,4,5,7,8] ; [3,4,5,7,8]
list_summation
list_summation:right-to-left
7, 4, 1, 1
1+1=2 ; 4+2=6 ; 7+6=13
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,3) ; G=(5,5)
R:(3,4) ; D:(4,4) ; R:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,3) ; G=(1,5)
R:(0,4) ; R:(0,5) ; D:(1,5)
base_conversion
base_conversion:via-binary
n=30,base=16
BINLEN:5 ; CHUNK:0:1 ; CHUNK:1:14 ; OUT:1E
list_summation
list_summation:pairwise
2, 9, 0, 5
2+9=11 ; 0+5=5 ; 11+5=16
multidigit_addition
multidigit_addition:left-to-right-partials
748+853
p100:700+800=1500 ; p10:40+50=90 ; p1:8+3=11 ; sum=1500+90+11=1601
list_summation
list_summation:left-to-right
6, 1, 5, 7
6+1=7 ; 7+5=12 ; 12+7=19
list_summation
list_summation:right-to-left
6, 2, 2, 7
2+7=9 ; 2+9=11 ; 6+11=17
list_summation
list_summation:pairwise
6, 6, 1, 2
6+6=12 ; 1+2=3 ; 12+3=15
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,0) ; G=(5,4)
R:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4)
sorting_algorithms
sorting_algorithms:heap-sort
1, 9, 4, 3, 8
[9,1,4,3,8] ; [9,8,4,3,1] ; [1,8,4,3,9] ; [8,1,4,3,9] ; [8,3,4,1,9] ; [1,3,4,8,9] ; [4,3,1,8,9] ; [1,3,4,8,9] ; [3,1,4,8,9] ; [1,3,4,8,9]
list_summation
list_summation:left-to-right
8, 1, 7, 5
8+1=9 ; 9+7=16 ; 16+5=21
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-36=18
6x-36=18 ; 6x=54 ; x=9
multidigit_addition
multidigit_addition:rounding-decomposition
739+230
round:740+230=970 ; adjust:970-1=969 ; sum=969
list_summation
list_summation:right-to-left
2, 0, 9, 1
9+1=10 ; 0+10=10 ; 2+10=12
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,1) ; G=(5,4)
R:(0,2) ; R:(0,3) ; R:(0,4) ; D:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
base_conversion
base_conversion:repeated-division
n=21,base=8
DIV:21/8=2,r:5 ; DIV:2/8=0,r:2 ; OUT:25
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,3) ; G=(2,5)
R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5)
multidigit_addition
multidigit_addition:left-to-right-partials
457+159
p100:400+100=500 ; p10:50+50=100 ; p1:7+9=16 ; sum=500+100+16=616
multidigit_addition
multidigit_addition:left-to-right-partials
525+278
p100:500+200=700 ; p10:20+70=90 ; p1:5+8=13 ; sum=700+90+13=803
list_summation
list_summation:right-to-left
9, 9, 0, 5
0+5=5 ; 9+5=14 ; 9+14=23
multidigit_addition
multidigit_addition:left-to-right-partials
406+480
p100:400+400=800 ; p10:0+80=80 ; p1:6+0=6 ; sum=800+80+6=886
multidigit_addition
multidigit_addition:right-to-left-carry
856+903
d2:6+3+0=9→w9,c0 ; d1:5+0+0=5→w5,c0 ; d0:8+9+0=17→w7,c1 ; sum=1759
sorting_algorithms
sorting_algorithms:insertion-sort
9, 0, 3, 5, 8
[0,9,3,5,8] ; [0,3,9,5,8] ; [0,3,5,9,8] ; [0,3,5,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)
multidigit_addition
multidigit_addition:rounding-decomposition
472+862
round:480+862=1342 ; adjust:1342-8=1334 ; sum=1334
list_summation
list_summation:left-to-right
1, 2, 7, 9
1+2=3 ; 3+7=10 ; 10+9=19
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:inverse-ops
2x+0=-18
2x+0=-18 ; x=(-18-0)/2 ; x=-18/2 ; x=-9
multidigit_addition
multidigit_addition:rounding-decomposition
588+940
round:590+940=1530 ; adjust:1530-2=1528 ; sum=1528
sorting_algorithms
sorting_algorithms:insertion-sort
0, 2, 6, 3, 8
[0,2,6,3,8] ; [0,2,6,3,8] ; [0,2,3,6,8] ; [0,2,3,6,8]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,1) ; G=(1,2)
D:(1,1) ; R:(1,2)
base_conversion
base_conversion:decomposition
n=13,base=4
TERM:3*4^1=12 ; TERM:1*4^0=1 ; OUT:31
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,4) ; G=(5,5)
D:(5,4) ; R:(5,5)
base_conversion
base_conversion:repeated-division
n=163,base=2
DIV:163/2=81,r:1 ; DIV:81/2=40,r:1 ; DIV:40/2=20,r:0 ; DIV:20/2=10,r:0 ; DIV:10/2=5,r:0 ; DIV:5/2=2,r:1 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:10100011
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,0) ; G=(4,4)
R:(2,1) ; D:(3,1) ; R:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4)
multidigit_addition
multidigit_addition:right-to-left-carry
943+537
d2:3+7+0=10→w0,c1 ; d1:4+3+1=8→w8,c0 ; d0:9+5+0=14→w4,c1 ; sum=1480
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:inverse-ops
9x-81=-126
9x-81=-126 ; x=(-126--81)/9 ; x=-45/9 ; x=-5
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,4) ; G=(4,5)
R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5)
linear_equation_solving
linear_equation_solving:inverse-ops
7x-21=-28
7x-21=-28 ; x=(-28--21)/7 ; x=-7/7 ; x=-1
base_conversion
base_conversion:repeated-division
n=214,base=16
DIV:214/16=13,r:6 ; DIV:13/16=0,r:13 ; OUT:D6
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,1) ; G=(5,4)
R:(1,2) ; R:(1,3) ; R:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4)
sorting_algorithms
sorting_algorithms:heap-sort
3, 1, 4, 7, 8
[3,8,4,7,1] ; [8,3,4,7,1] ; [8,7,4,3,1] ; [1,7,4,3,8] ; [7,1,4,3,8] ; [7,3,4,1,8] ; [1,3,4,7,8] ; [4,3,1,7,8] ; [1,3,4,7,8] ; [3,1,4,7,8] ; [1,3,4,7,8]
base_conversion
base_conversion:via-binary
n=5,base=16
BINLEN:3 ; CHUNK:0:5 ; OUT:5
sorting_algorithms
sorting_algorithms:selection-sort
7, 8, 6, 4, 5
[4,8,6,7,5] ; [4,5,6,7,8] ; [4,5,6,7,8] ; [4,5,6,7,8]
linear_equation_solving
linear_equation_solving:inverse-ops
3x-21=-18
3x-21=-18 ; x=(-18--21)/3 ; x=3/3 ; x=1
base_conversion
base_conversion:decomposition
n=134,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:0*2^5=0 ; TERM:0*2^4=0 ; TERM:0*2^3=0 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:10000110
list_summation
list_summation:right-to-left
3, 9, 9, 8
9+8=17 ; 9+17=26 ; 3+26=29
base_conversion
base_conversion:decomposition
n=17,base=4
TERM:1*4^2=16 ; TERM:0*4^1=0 ; TERM:1*4^0=1 ; OUT:101
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,0) ; G=(4,3)
D:(1,0) ; D:(2,0) ; D:(3,0) ; D:(4,0) ; R:(4,1) ; R:(4,2) ; R:(4,3)
base_conversion
base_conversion:repeated-division
n=216,base=2
DIV:216/2=108,r:0 ; DIV:108/2=54,r:0 ; DIV:54/2=27,r:0 ; DIV:27/2=13,r:1 ; DIV:13/2=6,r:1 ; DIV:6/2=3,r:0 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:11011000
sorting_algorithms
sorting_algorithms:bubble-sort
5, 9, 7, 3, 2
[5,7,9,3,2] ; [5,7,3,9,2] ; [5,7,3,2,9] ; [5,3,7,2,9] ; [5,3,2,7,9] ; [3,5,2,7,9] ; [3,2,5,7,9] ; [2,3,5,7,9]
list_summation
list_summation:pairwise
0, 3, 8, 3
0+3=3 ; 8+3=11 ; 3+11=14
linear_equation_solving
linear_equation_solving:inverse-ops
3x+24=18
3x+24=18 ; x=(18-24)/3 ; x=-6/3 ; x=-2
list_summation
list_summation:left-to-right
9, 2, 8, 7
9+2=11 ; 11+8=19 ; 19+7=26
list_summation
list_summation:left-to-right
9, 8, 2, 6
9+8=17 ; 17+2=19 ; 19+6=25
list_summation
list_summation:pairwise
6, 5, 3, 8
6+5=11 ; 3+8=11 ; 11+11=22
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,0) ; G=(4,4)
R:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4) ; D:(3,4) ; D:(4,4)
multidigit_addition
multidigit_addition:left-to-right-partials
374+798
p100:300+700=1000 ; p10:70+90=160 ; p1:4+8=12 ; sum=1000+160+12=1172
list_summation
list_summation:right-to-left
0, 2, 8, 3
8+3=11 ; 2+11=13 ; 0+13=13
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x-10=-10
5x-10=-10 ; 5x=0 ; x=0
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
base_conversion
base_conversion:via-binary
n=46,base=16
BINLEN:6 ; CHUNK:0:2 ; CHUNK:1:14 ; OUT:2E
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)
base_conversion
base_conversion:decomposition
n=202,base=16
TERM:12*16^1=192 ; TERM:10*16^0=10 ; OUT:CA
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,4) ; G=(4,5)
R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5)
base_conversion
base_conversion:via-binary
n=5,base=16
BINLEN:3 ; CHUNK:0:5 ; OUT:5
linear_equation_solving
linear_equation_solving:inverse-ops
3x+21=39
3x+21=39 ; x=(39-21)/3 ; x=18/3 ; x=6
multidigit_addition
multidigit_addition:right-to-left-carry
546+817
d2:6+7+0=13→w3,c1 ; d1:4+1+1=6→w6,c0 ; d0:5+8+0=13→w3,c1 ; sum=1363
multidigit_addition
multidigit_addition:rounding-decomposition
107+563
round:110+563=673 ; adjust:673-3=670 ; sum=670
sorting_algorithms
sorting_algorithms:heap-sort
5, 8, 4, 3, 1
[8,5,4,3,1] ; [1,5,4,3,8] ; [5,1,4,3,8] ; [5,3,4,1,8] ; [1,3,4,5,8] ; [4,3,1,5,8] ; [1,3,4,5,8] ; [3,1,4,5,8] ; [1,3,4,5,8]
base_conversion
base_conversion:decomposition
n=149,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:0*2^5=0 ; TERM:1*2^4=16 ; TERM:0*2^3=0 ; TERM:1*2^2=4 ; TERM:0*2^1=0 ; TERM:1*2^0=1 ; OUT:10010101
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,3) ; G=(4,4)
R:(3,4) ; D:(4,4)
multidigit_addition
multidigit_addition:left-to-right-partials
641+768
p100:600+700=1300 ; p10:40+60=100 ; p1:1+8=9 ; sum=1300+100+9=1409
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,2) ; G=(3,3)
R:(0,3) ; D:(1,3) ; D:(2,3) ; D:(3,3)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,4) ; G=(4,5)
D:(4,4) ; R:(4,5)
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:pairwise
4, 7, 4, 1
4+7=11 ; 4+1=5 ; 11+5=16
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,0) ; G=(4,1)
R:(3,1) ; D:(4,1)
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-8=-14
2x-8=-14 ; x+-4=-7 ; x=-7--4 ; x=-3
multidigit_addition
multidigit_addition:right-to-left-carry
118+749
d2:8+9+0=17→w7,c1 ; d1:1+4+1=6→w6,c0 ; d0:1+7+0=8→w8,c0 ; sum=867
multidigit_addition
multidigit_addition:rounding-decomposition
905+439
round:910+439=1349 ; adjust:1349-5=1344 ; sum=1344
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,4) ; G=(5,5)
R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,0) ; G=(4,4)
D:(4,0) ; R:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4)
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x-20=-28
4x-20=-28 ; x+-5=-7 ; x=-7--5 ; x=-2
multidigit_addition
multidigit_addition:rounding-decomposition
607+550
round:610+550=1160 ; adjust:1160-3=1157 ; sum=1157
multidigit_addition
multidigit_addition:left-to-right-partials
438+233
p100:400+200=600 ; p10:30+30=60 ; p1:8+3=11 ; sum=600+60+11=671
base_conversion
base_conversion:decomposition
n=104,base=2
TERM:1*2^6=64 ; TERM:1*2^5=32 ; 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:1101000
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,4) ; G=(4,5)
R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5)
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+0=-14
2x+0=-14 ; 2x=-14 ; x=-7
base_conversion
base_conversion:decomposition
n=215,base=2
TERM:1*2^7=128 ; TERM:1*2^6=64 ; TERM:0*2^5=0 ; TERM:1*2^4=16 ; TERM:0*2^3=0 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:11010111
base_conversion
base_conversion:via-binary
n=205,base=16
BINLEN:8 ; CHUNK:0:12 ; CHUNK:1:13 ; OUT:CD
base_conversion
base_conversion:decomposition
n=55,base=2
TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:0*2^3=0 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:110111
list_summation
list_summation:left-to-right
9, 3, 4, 7
9+3=12 ; 12+4=16 ; 16+7=23
multidigit_addition
multidigit_addition:left-to-right-partials
939+880
p100:900+800=1700 ; p10:30+80=110 ; p1:9+0=9 ; sum=1700+110+9=1819
linear_equation_solving
linear_equation_solving:inverse-ops
9x-27=9
9x-27=9 ; x=(9--27)/9 ; x=36/9 ; x=4