task_name
stringclasses
6 values
strategy_id
stringclasses
20 values
input_text
stringlengths
6
26
reasoning_trace
stringlengths
11
152
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,2) ; G=(3,4)
D:(2,2) ; D:(3,2) ; R:(3,3) ; R:(3,4)
base_conversion
base_conversion:repeated-division
n=221,base=8
DIV:221/8=27,r:5 ; DIV:27/8=3,r:3 ; DIV:3/8=0,r:3 ; OUT:335
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,2) ; G=(5,4)
D:(5,2) ; R:(5,3) ; R:(5,4)
base_conversion
base_conversion:via-binary
n=243,base=4
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:3 ; CHUNK:2:0 ; CHUNK:3:3 ; OUT:3303
list_summation
list_summation:pairwise
4, 4, 3, 9
4+4=8 ; 3+9=12 ; 8+12=20
list_summation
list_summation:right-to-left
4, 3, 6, 9
6+9=15 ; 3+15=18 ; 4+18=22
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x-49=-77
7x-49=-77 ; x+-7=-11 ; x=-11--7 ; x=-4
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,2) ; G=(4,3)
D:(4,2) ; R:(4,3)
multidigit_addition
multidigit_addition:rounding-decomposition
237+704
round:240+704=944 ; adjust:944-3=941 ; sum=941
sorting_algorithms
sorting_algorithms:selection-sort
2, 3, 8, 7, 0
[0,3,8,7,2] ; [0,2,8,7,3] ; [0,2,3,7,8] ; [0,2,3,7,8]
multidigit_addition
multidigit_addition:rounding-decomposition
938+340
round:940+340=1280 ; adjust:1280-2=1278 ; sum=1278
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x+18=60
6x+18=60 ; x+3=10 ; x=10-3 ; x=7
base_conversion
base_conversion:repeated-division
n=165,base=8
DIV:165/8=20,r:5 ; DIV:20/8=2,r:4 ; DIV:2/8=0,r:2 ; OUT:245
list_summation
list_summation:left-to-right
2, 1, 6, 2
2+1=3 ; 3+6=9 ; 9+2=11
list_summation
list_summation:right-to-left
7, 7, 1, 8
1+8=9 ; 7+9=16 ; 7+16=23
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,0) ; G=(4,1)
R:(3,1) ; D:(4,1)
sorting_algorithms
sorting_algorithms:heap-sort
9, 8, 0, 7, 3
[3,8,0,7,9] ; [8,3,0,7,9] ; [8,7,0,3,9] ; [3,7,0,8,9] ; [7,3,0,8,9] ; [0,3,7,8,9] ; [3,0,7,8,9] ; [0,3,7,8,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+0=36
4x+0=36 ; 4x=36 ; x=9
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,4) ; G=(5,5)
R:(3,5) ; D:(4,5) ; D:(5,5)
sorting_algorithms
sorting_algorithms:merge-sort
2, 7, 8, 4, 5
[2,7,4,8,5] ; [2,4,7,8,5] ; [2,4,5,7,8]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,1) ; G=(5,3)
R:(2,2) ; R:(2,3) ; D:(3,3) ; D:(4,3) ; D:(5,3)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,1) ; G=(2,5)
R:(1,2) ; D:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5)
linear_equation_solving
linear_equation_solving:inverse-ops
6x-54=-48
6x-54=-48 ; x=(-48--54)/6 ; x=6/6 ; x=1
sorting_algorithms
sorting_algorithms:selection-sort
5, 2, 4, 9, 3
[2,5,4,9,3] ; [2,3,4,9,5] ; [2,3,4,9,5] ; [2,3,4,5,9]
sorting_algorithms
sorting_algorithms:bubble-sort
0, 4, 2, 3, 9
[0,2,4,3,9] ; [0,2,3,4,9]
multidigit_addition
multidigit_addition:right-to-left-carry
621+700
d2:1+0+0=1→w1,c0 ; d1:2+0+0=2→w2,c0 ; d0:6+7+0=13→w3,c1 ; sum=1321
base_conversion
base_conversion:via-binary
n=161,base=16
BINLEN:8 ; CHUNK:0:10 ; CHUNK:1:1 ; OUT:A1
multidigit_addition
multidigit_addition:left-to-right-partials
546+763
p100:500+700=1200 ; p10:40+60=100 ; p1:6+3=9 ; sum=1200+100+9=1309
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x+49=105
7x+49=105 ; x+7=15 ; x=15-7 ; x=8
base_conversion
base_conversion:repeated-division
n=231,base=2
DIV:231/2=115,r:1 ; DIV:115/2=57,r:1 ; DIV:57/2=28,r:1 ; DIV:28/2=14,r:0 ; DIV:14/2=7,r:0 ; DIV:7/2=3,r:1 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:11100111
base_conversion
base_conversion:decomposition
n=50,base=16
TERM:3*16^1=48 ; TERM:2*16^0=2 ; OUT:32
base_conversion
base_conversion:via-binary
n=41,base=2
BINLEN:6 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:0 ; CHUNK:4:0 ; CHUNK:5:1 ; OUT:101001
sorting_algorithms
sorting_algorithms:insertion-sort
4, 2, 1, 3, 8
[2,4,1,3,8] ; [1,2,4,3,8] ; [1,2,3,4,8] ; [1,2,3,4,8]
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x-35=-30
5x-35=-30 ; 5x=5 ; x=1
sorting_algorithms
sorting_algorithms:bubble-sort
2, 1, 5, 9, 4
[1,2,5,9,4] ; [1,2,5,4,9] ; [1,2,4,5,9]
base_conversion
base_conversion:decomposition
n=27,base=2
TERM:1*2^4=16 ; TERM:1*2^3=8 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:11011
sorting_algorithms
sorting_algorithms:merge-sort
3, 7, 1, 6, 5
[1,3,6,7,5] ; [1,3,5,6,7]
list_summation
list_summation:right-to-left
2, 0, 6, 6
6+6=12 ; 0+12=12 ; 2+12=14
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,2) ; G=(3,5)
R:(2,3) ; D:(3,3) ; R:(3,4) ; R:(3,5)
base_conversion
base_conversion:via-binary
n=81,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:1 ; OUT:1101
multidigit_addition
multidigit_addition:left-to-right-partials
194+253
p100:100+200=300 ; p10:90+50=140 ; p1:4+3=7 ; sum=300+140+7=447
multidigit_addition
multidigit_addition:left-to-right-partials
757+827
p100:700+800=1500 ; p10:50+20=70 ; p1:7+7=14 ; sum=1500+70+14=1584
base_conversion
base_conversion:repeated-division
n=137,base=2
DIV:137/2=68,r:1 ; DIV:68/2=34,r:0 ; DIV:34/2=17,r:0 ; DIV:17/2=8,r:1 ; 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:10001001
linear_equation_solving
linear_equation_solving:inverse-ops
5x-30=10
5x-30=10 ; x=(10--30)/5 ; x=40/5 ; x=8
multidigit_addition
multidigit_addition:right-to-left-carry
968+999
d2:8+9+0=17→w7,c1 ; d1:6+9+1=16→w6,c1 ; d0:9+9+1=19→w9,c1 ; sum=1967
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x-48=-40
8x-48=-40 ; x+-6=-5 ; x=-5--6 ; x=1
sorting_algorithms
sorting_algorithms:heap-sort
9, 6, 2, 7, 5
[9,7,2,6,5] ; [5,7,2,6,9] ; [7,5,2,6,9] ; [7,6,2,5,9] ; [5,6,2,7,9] ; [6,5,2,7,9] ; [2,5,6,7,9] ; [5,2,6,7,9] ; [2,5,6,7,9]
base_conversion
base_conversion:via-binary
n=78,base=2
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:0 ; CHUNK:3:1 ; CHUNK:4:1 ; CHUNK:5:1 ; CHUNK:6:0 ; OUT:1001110
linear_equation_solving
linear_equation_solving:inverse-ops
3x-21=-45
3x-21=-45 ; x=(-45--21)/3 ; x=-24/3 ; x=-8
base_conversion
base_conversion:decomposition
n=183,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; 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:10110111
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,2) ; G=(4,5)
R:(1,3) ; R:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5)
sorting_algorithms
sorting_algorithms:insertion-sort
3, 0, 7, 6, 9
[0,3,7,6,9] ; [0,3,7,6,9] ; [0,3,6,7,9] ; [0,3,6,7,9]
sorting_algorithms
sorting_algorithms:selection-sort
0, 7, 2, 3, 4
[0,7,2,3,4] ; [0,2,7,3,4] ; [0,2,3,7,4] ; [0,2,3,4,7]
sorting_algorithms
sorting_algorithms:bubble-sort
3, 6, 2, 5, 8
[3,2,6,5,8] ; [3,2,5,6,8] ; [2,3,5,6,8]
multidigit_addition
multidigit_addition:right-to-left-carry
792+309
d2:2+9+0=11→w1,c1 ; d1:9+0+1=10→w0,c1 ; d0:7+3+1=11→w1,c1 ; sum=1101
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,2) ; G=(4,3)
D:(3,2) ; D:(4,2) ; R:(4,3)
sorting_algorithms
sorting_algorithms:bubble-sort
0, 7, 9, 3, 6
[0,7,3,9,6] ; [0,7,3,6,9] ; [0,3,7,6,9] ; [0,3,6,7,9]
list_summation
list_summation:right-to-left
6, 0, 5, 9
5+9=14 ; 0+14=14 ; 6+14=20
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x+18=0
2x+18=0 ; x+9=0 ; x=0-9 ; x=-9
list_summation
list_summation:pairwise
9, 6, 0, 2
9+6=15 ; 0+2=2 ; 15+2=17
list_summation
list_summation:pairwise
3, 7, 7, 1
3+7=10 ; 7+1=8 ; 10+8=18
multidigit_addition
multidigit_addition:right-to-left-carry
592+972
d2:2+2+0=4→w4,c0 ; d1:9+7+0=16→w6,c1 ; d0:5+9+1=15→w5,c1 ; sum=1564
sorting_algorithms
sorting_algorithms:insertion-sort
7, 4, 5, 8, 3
[4,7,5,8,3] ; [4,5,7,8,3] ; [4,5,7,8,3] ; [3,4,5,7,8]
multidigit_addition
multidigit_addition:left-to-right-partials
241+703
p100:200+700=900 ; p10:40+0=40 ; p1:1+3=4 ; sum=900+40+4=944
list_summation
list_summation:right-to-left
4, 6, 0, 2
0+2=2 ; 6+2=8 ; 4+8=12
list_summation
list_summation:right-to-left
9, 3, 7, 5
7+5=12 ; 3+12=15 ; 9+15=24
sorting_algorithms
sorting_algorithms:merge-sort
3, 9, 0, 6, 7
[0,3,6,9,7] ; [0,3,6,7,9]
sorting_algorithms
sorting_algorithms:merge-sort
1, 2, 5, 9, 4
[1,2,4,5,9]
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)
list_summation
list_summation:right-to-left
8, 8, 7, 6
7+6=13 ; 8+13=21 ; 8+21=29
sorting_algorithms
sorting_algorithms:merge-sort
7, 2, 5, 9, 6
[2,7,5,9,6] ; [2,5,7,9,6] ; [2,5,6,7,9]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,1) ; G=(2,5)
D:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5)
list_summation
list_summation:right-to-left
9, 0, 4, 4
4+4=8 ; 0+8=8 ; 9+8=17
multidigit_addition
multidigit_addition:rounding-decomposition
357+653
round:360+653=1013 ; adjust:1013-3=1010 ; sum=1010
base_conversion
base_conversion:repeated-division
n=106,base=16
DIV:106/16=6,r:10 ; DIV:6/16=0,r:6 ; OUT:6A
multidigit_addition
multidigit_addition:rounding-decomposition
347+915
round:350+915=1265 ; adjust:1265-3=1262 ; sum=1262
list_summation
list_summation:right-to-left
0, 1, 5, 4
5+4=9 ; 1+9=10 ; 0+10=10
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x+0=-25
5x+0=-25 ; x+0=-5 ; x=-5-0 ; x=-5
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-4=-22
2x-4=-22 ; x+-2=-11 ; x=-11--2 ; x=-9
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,3) ; G=(4,5)
R:(2,4) ; R:(2,5) ; D:(3,5) ; D:(4,5)
sorting_algorithms
sorting_algorithms:selection-sort
5, 8, 7, 4, 9
[4,8,7,5,9] ; [4,5,7,8,9] ; [4,5,7,8,9] ; [4,5,7,8,9]
base_conversion
base_conversion:repeated-division
n=93,base=4
DIV:93/4=23,r:1 ; DIV:23/4=5,r:3 ; DIV:5/4=1,r:1 ; DIV:1/4=0,r:1 ; OUT:1131
base_conversion
base_conversion:repeated-division
n=171,base=4
DIV:171/4=42,r:3 ; DIV:42/4=10,r:2 ; DIV:10/4=2,r:2 ; DIV:2/4=0,r:2 ; OUT:2223
base_conversion
base_conversion:decomposition
n=123,base=8
TERM:1*8^2=64 ; TERM:7*8^1=56 ; TERM:3*8^0=3 ; OUT:173
base_conversion
base_conversion:repeated-division
n=219,base=2
DIV:219/2=109,r:1 ; DIV:109/2=54,r:1 ; 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:11011011
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x-20=4
4x-20=4 ; 4x=24 ; x=6
multidigit_addition
multidigit_addition:left-to-right-partials
375+392
p100:300+300=600 ; p10:70+90=160 ; p1:5+2=7 ; sum=600+160+7=767
list_summation
list_summation:pairwise
3, 9, 8, 1
3+9=12 ; 8+1=9 ; 12+9=21
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
list_summation
list_summation:left-to-right
4, 6, 3, 3
4+6=10 ; 10+3=13 ; 13+3=16
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,0) ; G=(5,2)
R:(2,1) ; R:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2)
sorting_algorithms
sorting_algorithms:insertion-sort
5, 6, 8, 1, 2
[5,6,8,1,2] ; [5,6,8,1,2] ; [1,5,6,8,2] ; [1,2,5,6,8]
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x-4=-18
2x-4=-18 ; 2x=-14 ; x=-7
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x-14=-8
2x-14=-8 ; 2x=6 ; x=3
base_conversion
base_conversion:decomposition
n=98,base=2
TERM:1*2^6=64 ; TERM:1*2^5=32 ; TERM:0*2^4=0 ; TERM:0*2^3=0 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:1100010
sorting_algorithms
sorting_algorithms:merge-sort
5, 8, 1, 6, 2
[1,5,6,8,2] ; [1,2,5,6,8]
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x+16=0
2x+16=0 ; x+8=0 ; x=0-8 ; x=-8
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,0) ; G=(5,2)
D:(3,0) ; D:(4,0) ; D:(5,0) ; R:(5,1) ; R:(5,2)
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x-56=-96
8x-56=-96 ; x+-7=-12 ; x=-12--7 ; x=-5
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,1) ; G=(5,4)
D:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4)