task_name
stringclasses
6 values
strategy_id
stringclasses
20 values
input_text
stringlengths
6
26
reasoning_trace
stringlengths
11
152
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,1) ; G=(5,5)
R:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,1) ; G=(3,5)
D:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5)
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x-28=-24
4x-28=-24 ; 4x=4 ; x=1
base_conversion
base_conversion:via-binary
n=145,base=16
BINLEN:8 ; CHUNK:0:9 ; CHUNK:1:1 ; OUT:91
base_conversion
base_conversion:decomposition
n=1,base=2
TERM:1*2^0=1 ; OUT:1
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x-28=-12
4x-28=-12 ; x+-7=-3 ; x=-3--7 ; x=4
sorting_algorithms
sorting_algorithms:heap-sort
7, 8, 4, 3, 6
[8,7,4,3,6] ; [6,7,4,3,8] ; [7,6,4,3,8] ; [3,6,4,7,8] ; [6,3,4,7,8] ; [4,3,6,7,8] ; [3,4,6,7,8]
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x+56=128
8x+56=128 ; x+7=16 ; x=16-7 ; x=9
sorting_algorithms
sorting_algorithms:merge-sort
9, 3, 0, 5, 1
[3,9,0,5,1] ; [0,3,5,9,1] ; [0,1,3,5,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,2) ; G=(5,3)
R:(4,3) ; D:(5,3)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
linear_equation_solving
linear_equation_solving:inverse-ops
2x+8=-8
2x+8=-8 ; x=(-8-8)/2 ; x=-16/2 ; x=-8
multidigit_addition
multidigit_addition:right-to-left-carry
546+950
d2:6+0+0=6→w6,c0 ; d1:4+5+0=9→w9,c0 ; d0:5+9+0=14→w4,c1 ; sum=1496
multidigit_addition
multidigit_addition:rounding-decomposition
297+188
round:300+188=488 ; adjust:488-3=485 ; sum=485
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,0) ; G=(5,2)
R:(4,1) ; D:(5,1) ; R:(5,2)
base_conversion
base_conversion:via-binary
n=202,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:1 ; CHUNK:2:2 ; OUT:312
multidigit_addition
multidigit_addition:right-to-left-carry
608+643
d2:8+3+0=11→w1,c1 ; d1:0+4+1=5→w5,c0 ; d0:6+6+0=12→w2,c1 ; sum=1251
base_conversion
base_conversion:via-binary
n=141,base=16
BINLEN:8 ; CHUNK:0:8 ; CHUNK:1:13 ; OUT:8D
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,1) ; G=(3,3)
R:(0,2) ; D:(1,2) ; R:(1,3) ; D:(2,3) ; D:(3,3)
sorting_algorithms
sorting_algorithms:heap-sort
1, 6, 7, 0, 5
[7,6,1,0,5] ; [5,6,1,0,7] ; [6,5,1,0,7] ; [0,5,1,6,7] ; [5,0,1,6,7] ; [1,0,5,6,7] ; [0,1,5,6,7]
multidigit_addition
multidigit_addition:left-to-right-partials
639+879
p100:600+800=1400 ; p10:30+70=100 ; p1:9+9=18 ; sum=1400+100+18=1518
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x-14=0
7x-14=0 ; x+-2=0 ; x=0--2 ; x=2
multidigit_addition
multidigit_addition:left-to-right-partials
550+837
p100:500+800=1300 ; p10:50+30=80 ; p1:0+7=7 ; sum=1300+80+7=1387
linear_equation_solving
linear_equation_solving:inverse-ops
2x-8=-16
2x-8=-16 ; x=(-16--8)/2 ; x=-8/2 ; x=-4
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,0) ; G=(5,3)
D:(1,0) ; D:(2,0) ; D:(3,0) ; D:(4,0) ; D:(5,0) ; R:(5,1) ; R:(5,2) ; R:(5,3)
list_summation
list_summation:pairwise
3, 2, 0, 8
3+2=5 ; 0+8=8 ; 5+8=13
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+6=21
3x+6=21 ; 3x=15 ; x=5
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x-25=-35
5x-25=-35 ; x+-5=-7 ; x=-7--5 ; x=-2
multidigit_addition
multidigit_addition:rounding-decomposition
611+668
round:620+668=1288 ; adjust:1288-9=1279 ; sum=1279
base_conversion
base_conversion:repeated-division
n=150,base=4
DIV:150/4=37,r:2 ; DIV:37/4=9,r:1 ; DIV:9/4=2,r:1 ; DIV:2/4=0,r:2 ; OUT:2112
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,4) ; G=(5,5)
D:(5,4) ; R:(5,5)
sorting_algorithms
sorting_algorithms:heap-sort
8, 3, 4, 0, 5
[8,5,4,0,3] ; [3,5,4,0,8] ; [5,3,4,0,8] ; [0,3,4,5,8] ; [4,3,0,5,8] ; [0,3,4,5,8] ; [3,0,4,5,8] ; [0,3,4,5,8]
multidigit_addition
multidigit_addition:rounding-decomposition
638+360
round:640+360=1000 ; adjust:1000-2=998 ; sum=998
base_conversion
base_conversion:decomposition
n=189,base=16
TERM:11*16^1=176 ; TERM:13*16^0=13 ; OUT:BD
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x+3=30
3x+3=30 ; x+1=10 ; x=10-1 ; x=9
list_summation
list_summation:right-to-left
9, 1, 0, 6
0+6=6 ; 1+6=7 ; 9+7=16
list_summation
list_summation:right-to-left
7, 6, 9, 3
9+3=12 ; 6+12=18 ; 7+18=25
sorting_algorithms
sorting_algorithms:insertion-sort
0, 1, 3, 7, 6
[0,1,3,7,6] ; [0,1,3,7,6] ; [0,1,3,7,6] ; [0,1,3,6,7]
multidigit_addition
multidigit_addition:right-to-left-carry
871+785
d2:1+5+0=6→w6,c0 ; d1:7+8+0=15→w5,c1 ; d0:8+7+1=16→w6,c1 ; sum=1656
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+48=96
8x+48=96 ; 8x=48 ; x=6
multidigit_addition
multidigit_addition:right-to-left-carry
173+161
d2:3+1+0=4→w4,c0 ; d1:7+6+0=13→w3,c1 ; d0:1+1+1=3→w3,c0 ; sum=334
multidigit_addition
multidigit_addition:rounding-decomposition
944+925
round:950+925=1875 ; adjust:1875-6=1869 ; sum=1869
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x+24=88
8x+24=88 ; x+3=11 ; x=11-3 ; x=8
linear_equation_solving
linear_equation_solving:inverse-ops
6x+54=102
6x+54=102 ; x=(102-54)/6 ; x=48/6 ; x=8
sorting_algorithms
sorting_algorithms:merge-sort
7, 6, 3, 4, 2
[6,7,3,4,2] ; [3,4,6,7,2] ; [2,3,4,6,7]
multidigit_addition
multidigit_addition:right-to-left-carry
565+732
d2:5+2+0=7→w7,c0 ; d1:6+3+0=9→w9,c0 ; d0:5+7+0=12→w2,c1 ; sum=1297
list_summation
list_summation:pairwise
8, 8, 0, 2
8+8=16 ; 0+2=2 ; 16+2=18
base_conversion
base_conversion:via-binary
n=127,base=2
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:1 ; CHUNK:3:1 ; CHUNK:4:1 ; CHUNK:5:1 ; CHUNK:6:1 ; OUT:1111111
sorting_algorithms
sorting_algorithms:bubble-sort
4, 7, 6, 1, 0
[4,6,7,1,0] ; [4,6,1,7,0] ; [4,6,1,0,7] ; [4,1,6,0,7] ; [4,1,0,6,7] ; [1,4,0,6,7] ; [1,0,4,6,7] ; [0,1,4,6,7]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,2) ; G=(4,5)
R:(1,3) ; D:(2,3) ; R:(2,4) ; D:(3,4) ; R:(3,5) ; D:(4,5)
base_conversion
base_conversion:repeated-division
n=162,base=4
DIV:162/4=40,r:2 ; DIV:40/4=10,r:0 ; DIV:10/4=2,r:2 ; DIV:2/4=0,r:2 ; OUT:2202
sorting_algorithms
sorting_algorithms:insertion-sort
1, 4, 2, 8, 7
[1,4,2,8,7] ; [1,2,4,8,7] ; [1,2,4,8,7] ; [1,2,4,7,8]
list_summation
list_summation:right-to-left
6, 8, 2, 2
2+2=4 ; 8+4=12 ; 6+12=18
multidigit_addition
multidigit_addition:rounding-decomposition
916+145
round:920+145=1065 ; adjust:1065-4=1061 ; sum=1061
list_summation
list_summation:left-to-right
3, 2, 8, 5
3+2=5 ; 5+8=13 ; 13+5=18
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,4) ; G=(5,5)
D:(4,4) ; D:(5,4) ; R:(5,5)
base_conversion
base_conversion:decomposition
n=120,base=16
TERM:7*16^1=112 ; TERM:8*16^0=8 ; OUT:78
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,0) ; G=(2,3)
R:(0,1) ; D:(1,1) ; R:(1,2) ; D:(2,2) ; R:(2,3)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,4) ; G=(3,5)
D:(3,4) ; R:(3,5)
list_summation
list_summation:right-to-left
2, 2, 3, 5
3+5=8 ; 2+8=10 ; 2+10=12
list_summation
list_summation:left-to-right
9, 9, 7, 4
9+9=18 ; 18+7=25 ; 25+4=29
multidigit_addition
multidigit_addition:left-to-right-partials
985+458
p100:900+400=1300 ; p10:80+50=130 ; p1:5+8=13 ; sum=1300+130+13=1443
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,0) ; G=(3,1)
D:(2,0) ; D:(3,0) ; R:(3,1)
multidigit_addition
multidigit_addition:left-to-right-partials
246+680
p100:200+600=800 ; p10:40+80=120 ; p1:6+0=6 ; sum=800+120+6=926
base_conversion
base_conversion:decomposition
n=236,base=8
TERM:3*8^2=192 ; TERM:5*8^1=40 ; TERM:4*8^0=4 ; OUT:354
sorting_algorithms
sorting_algorithms:merge-sort
6, 1, 0, 8, 4
[1,6,0,8,4] ; [0,1,6,8,4] ; [0,1,4,6,8]
list_summation
list_summation:pairwise
0, 2, 5, 4
0+2=2 ; 5+4=9 ; 2+9=11
sorting_algorithms
sorting_algorithms:insertion-sort
5, 6, 1, 0, 4
[5,6,1,0,4] ; [1,5,6,0,4] ; [0,1,5,6,4] ; [0,1,4,5,6]
list_summation
list_summation:left-to-right
4, 0, 6, 1
4+0=4 ; 4+6=10 ; 10+1=11
sorting_algorithms
sorting_algorithms:heap-sort
0, 9, 3, 2, 4
[9,0,3,2,4] ; [9,4,3,2,0] ; [0,4,3,2,9] ; [4,0,3,2,9] ; [4,2,3,0,9] ; [0,2,3,4,9] ; [3,2,0,4,9] ; [0,2,3,4,9] ; [2,0,3,4,9] ; [0,2,3,4,9]
list_summation
list_summation:right-to-left
1, 5, 4, 9
4+9=13 ; 5+13=18 ; 1+18=19
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x-45=0
9x-45=0 ; 9x=45 ; x=5
multidigit_addition
multidigit_addition:rounding-decomposition
721+909
round:730+909=1639 ; adjust:1639-9=1630 ; sum=1630
multidigit_addition
multidigit_addition:rounding-decomposition
988+140
round:990+140=1130 ; adjust:1130-2=1128 ; sum=1128
list_summation
list_summation:right-to-left
3, 9, 8, 9
8+9=17 ; 9+17=26 ; 3+26=29
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,0) ; G=(5,5)
D:(5,0) ; R:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
linear_equation_solving
linear_equation_solving:inverse-ops
2x+18=0
2x+18=0 ; x=(0-18)/2 ; x=-18/2 ; x=-9
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,1) ; G=(5,3)
D:(5,1) ; R:(5,2) ; R:(5,3)
sorting_algorithms
sorting_algorithms:merge-sort
1, 3, 6, 2, 9
[1,3,2,6,9] ; [1,2,3,6,9]
base_conversion
base_conversion:decomposition
n=221,base=16
TERM:13*16^1=208 ; TERM:13*16^0=13 ; OUT:DD
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,3) ; G=(5,5)
R:(4,4) ; R:(4,5) ; D:(5,5)
sorting_algorithms
sorting_algorithms:insertion-sort
8, 1, 5, 3, 4
[1,8,5,3,4] ; [1,5,8,3,4] ; [1,3,5,8,4] ; [1,3,4,5,8]
linear_equation_solving
linear_equation_solving:inverse-ops
2x-10=4
2x-10=4 ; x=(4--10)/2 ; x=14/2 ; x=7
sorting_algorithms
sorting_algorithms:insertion-sort
9, 7, 6, 8, 2
[7,9,6,8,2] ; [6,7,9,8,2] ; [6,7,8,9,2] ; [2,6,7,8,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,2) ; G=(3,5)
R:(0,3) ; D:(1,3) ; R:(1,4) ; D:(2,4) ; R:(2,5) ; D:(3,5)
list_summation
list_summation:pairwise
1, 9, 6, 0
1+9=10 ; 6+0=6 ; 10+6=16
list_summation
list_summation:right-to-left
4, 2, 4, 7
4+7=11 ; 2+11=13 ; 4+13=17
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,0) ; G=(4,1)
R:(0,1) ; D:(1,1) ; D:(2,1) ; D:(3,1) ; D:(4,1)
list_summation
list_summation:right-to-left
7, 8, 8, 9
8+9=17 ; 8+17=25 ; 7+25=32
list_summation
list_summation:right-to-left
2, 7, 5, 9
5+9=14 ; 7+14=21 ; 2+21=23
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,2) ; G=(5,3)
R:(4,3) ; D:(5,3)
list_summation
list_summation:pairwise
9, 5, 3, 8
9+5=14 ; 3+8=11 ; 14+11=25
base_conversion
base_conversion:repeated-division
n=230,base=2
DIV:230/2=115,r:0 ; 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:11100110
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,4) ; G=(4,5)
D:(3,4) ; D:(4,4) ; R:(4,5)
sorting_algorithms
sorting_algorithms:heap-sort
2, 0, 3, 7, 5
[2,7,3,0,5] ; [7,2,3,0,5] ; [7,5,3,0,2] ; [2,5,3,0,7] ; [5,2,3,0,7] ; [0,2,3,5,7] ; [3,2,0,5,7] ; [0,2,3,5,7] ; [2,0,3,5,7] ; [0,2,3,5,7]
list_summation
list_summation:pairwise
5, 2, 6, 4
5+2=7 ; 6+4=10 ; 7+10=17
base_conversion
base_conversion:decomposition
n=82,base=4
TERM:1*4^3=64 ; TERM:1*4^2=16 ; TERM:0*4^1=0 ; TERM:2*4^0=2 ; OUT:1102
base_conversion
base_conversion:decomposition
n=5,base=2
TERM:1*2^2=4 ; TERM:0*2^1=0 ; TERM:1*2^0=1 ; OUT:101
sorting_algorithms
sorting_algorithms:heap-sort
9, 8, 5, 2, 4
[4,8,5,2,9] ; [8,4,5,2,9] ; [2,4,5,8,9] ; [5,4,2,8,9] ; [2,4,5,8,9] ; [4,2,5,8,9] ; [2,4,5,8,9]