task_name
stringclasses
6 values
strategy_id
stringclasses
20 values
input_text
stringlengths
6
26
reasoning_trace
stringlengths
11
152
sorting_algorithms
sorting_algorithms:insertion-sort
1, 6, 2, 0, 8
[1,6,2,0,8] ; [1,2,6,0,8] ; [0,1,2,6,8] ; [0,1,2,6,8]
list_summation
list_summation:left-to-right
7, 0, 3, 7
7+0=7 ; 7+3=10 ; 10+7=17
multidigit_addition
multidigit_addition:right-to-left-carry
611+322
d2:1+2+0=3→w3,c0 ; d1:1+2+0=3→w3,c0 ; d0:6+3+0=9→w9,c0 ; sum=933
list_summation
list_summation:left-to-right
7, 6, 6, 9
7+6=13 ; 13+6=19 ; 19+9=28
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,4) ; G=(5,5)
D:(5,4) ; R:(5,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x+56=7
7x+56=7 ; x+8=1 ; x=1-8 ; x=-7
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x-49=-84
7x-49=-84 ; 7x=-35 ; x=-5
list_summation
list_summation:pairwise
6, 5, 7, 2
6+5=11 ; 7+2=9 ; 11+9=20
multidigit_addition
multidigit_addition:right-to-left-carry
198+627
d2:8+7+0=15→w5,c1 ; d1:9+2+1=12→w2,c1 ; d0:1+6+1=8→w8,c0 ; sum=825
multidigit_addition
multidigit_addition:rounding-decomposition
831+690
round:840+690=1530 ; adjust:1530-9=1521 ; sum=1521
linear_equation_solving
linear_equation_solving:inverse-ops
2x-14=0
2x-14=0 ; x=(0--14)/2 ; x=14/2 ; x=7
list_summation
list_summation:pairwise
4, 6, 1, 7
4+6=10 ; 1+7=8 ; 10+8=18
list_summation
list_summation:pairwise
0, 7, 7, 6
0+7=7 ; 7+6=13 ; 7+13=20
list_summation
list_summation:pairwise
8, 7, 3, 0
8+7=15 ; 3+0=3 ; 15+3=18
base_conversion
base_conversion:via-binary
n=220,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:3 ; CHUNK:2:4 ; OUT:334
list_summation
list_summation:left-to-right
3, 3, 9, 7
3+3=6 ; 6+9=15 ; 15+7=22
base_conversion
base_conversion:decomposition
n=17,base=2
TERM:1*2^4=16 ; TERM:0*2^3=0 ; TERM:0*2^2=0 ; TERM:0*2^1=0 ; TERM:1*2^0=1 ; OUT:10001
multidigit_addition
multidigit_addition:left-to-right-partials
634+381
p100:600+300=900 ; p10:30+80=110 ; p1:4+1=5 ; sum=900+110+5=1015
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-18=0
2x-18=0 ; x+-9=0 ; x=0--9 ; x=9
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
base_conversion
base_conversion:via-binary
n=173,base=4
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:2 ; CHUNK:2:3 ; CHUNK:3:1 ; OUT:2231
multidigit_addition
multidigit_addition:rounding-decomposition
637+396
round:640+396=1036 ; adjust:1036-3=1033 ; sum=1033
multidigit_addition
multidigit_addition:left-to-right-partials
681+164
p100:600+100=700 ; p10:80+60=140 ; p1:1+4=5 ; sum=700+140+5=845
base_conversion
base_conversion:via-binary
n=51,base=2
BINLEN:6 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:1 ; CHUNK:5:1 ; OUT:110011
multidigit_addition
multidigit_addition:left-to-right-partials
698+331
p100:600+300=900 ; p10:90+30=120 ; p1:8+1=9 ; sum=900+120+9=1029
list_summation
list_summation:right-to-left
8, 7, 0, 7
0+7=7 ; 7+7=14 ; 8+14=22
list_summation
list_summation:right-to-left
2, 5, 0, 2
0+2=2 ; 5+2=7 ; 2+7=9
linear_equation_solving
linear_equation_solving:inverse-ops
6x-12=0
6x-12=0 ; x=(0--12)/6 ; x=12/6 ; x=2
base_conversion
base_conversion:decomposition
n=197,base=4
TERM:3*4^3=192 ; TERM:0*4^2=0 ; TERM:1*4^1=4 ; TERM:1*4^0=1 ; OUT:3011
list_summation
list_summation:pairwise
0, 5, 0, 3
0+5=5 ; 0+3=3 ; 5+3=8
base_conversion
base_conversion:repeated-division
n=115,base=16
DIV:115/16=7,r:3 ; DIV:7/16=0,r:7 ; OUT:73
multidigit_addition
multidigit_addition:left-to-right-partials
290+887
p100:200+800=1000 ; p10:90+80=170 ; p1:0+7=7 ; sum=1000+170+7=1177
list_summation
list_summation:right-to-left
1, 9, 1, 4
1+4=5 ; 9+5=14 ; 1+14=15
base_conversion
base_conversion:decomposition
n=16,base=4
TERM:1*4^2=16 ; TERM:0*4^1=0 ; TERM:0*4^0=0 ; OUT:100
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x+81=18
9x+81=18 ; 9x=-63 ; x=-7
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x+16=8
2x+16=8 ; x+8=4 ; x=4-8 ; x=-4
sorting_algorithms
sorting_algorithms:selection-sort
7, 1, 6, 5, 0
[0,1,6,5,7] ; [0,1,6,5,7] ; [0,1,5,6,7] ; [0,1,5,6,7]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,0) ; G=(3,5)
D:(2,0) ; D:(3,0) ; R:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,3) ; G=(4,5)
D:(4,3) ; R:(4,4) ; R:(4,5)
list_summation
list_summation:pairwise
3, 0, 9, 8
3+0=3 ; 9+8=17 ; 3+17=20
multidigit_addition
multidigit_addition:rounding-decomposition
713+319
round:720+319=1039 ; adjust:1039-7=1032 ; sum=1032
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,3) ; G=(4,5)
R:(3,4) ; R:(3,5) ; D:(4,5)
multidigit_addition
multidigit_addition:rounding-decomposition
508+480
round:510+480=990 ; adjust:990-2=988 ; sum=988
base_conversion
base_conversion:decomposition
n=42,base=16
TERM:2*16^1=32 ; TERM:10*16^0=10 ; OUT:2A
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,0) ; G=(5,1)
R:(4,1) ; D:(5,1)
multidigit_addition
multidigit_addition:rounding-decomposition
579+154
round:580+154=734 ; adjust:734-1=733 ; sum=733
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,2) ; G=(4,5)
R:(0,3) ; R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5)
linear_equation_solving
linear_equation_solving:inverse-ops
9x+27=18
9x+27=18 ; x=(18-27)/9 ; x=-9/9 ; x=-1
list_summation
list_summation:right-to-left
9, 1, 8, 7
8+7=15 ; 1+15=16 ; 9+16=25
sorting_algorithms
sorting_algorithms:merge-sort
5, 9, 6, 2, 3
[5,9,2,6,3] ; [2,5,6,9,3] ; [2,3,5,6,9]
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)
sorting_algorithms
sorting_algorithms:selection-sort
0, 5, 2, 7, 9
[0,5,2,7,9] ; [0,2,5,7,9] ; [0,2,5,7,9] ; [0,2,5,7,9]
sorting_algorithms
sorting_algorithms:insertion-sort
3, 7, 4, 2, 8
[3,7,4,2,8] ; [3,4,7,2,8] ; [2,3,4,7,8] ; [2,3,4,7,8]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,3) ; G=(2,4)
R:(0,4) ; D:(1,4) ; D:(2,4)
base_conversion
base_conversion:decomposition
n=102,base=2
TERM:1*2^6=64 ; 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:0*2^0=0 ; OUT:1100110
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+6=6
2x+6=6 ; 2x=0 ; x=0
list_summation
list_summation:left-to-right
0, 4, 1, 0
0+4=4 ; 4+1=5 ; 5+0=5
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-18=-72
6x-18=-72 ; 6x=-54 ; x=-9
base_conversion
base_conversion:repeated-division
n=248,base=16
DIV:248/16=15,r:8 ; DIV:15/16=0,r:15 ; OUT:F8
list_summation
list_summation:pairwise
4, 1, 1, 5
4+1=5 ; 1+5=6 ; 5+6=11
base_conversion
base_conversion:repeated-division
n=127,base=8
DIV:127/8=15,r:7 ; DIV:15/8=1,r:7 ; DIV:1/8=0,r:1 ; OUT:177
multidigit_addition
multidigit_addition:right-to-left-carry
104+627
d2:4+7+0=11→w1,c1 ; d1:0+2+1=3→w3,c0 ; d0:1+6+0=7→w7,c0 ; sum=731
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x-63=9
9x-63=9 ; x+-7=1 ; x=1--7 ; x=8
base_conversion
base_conversion:repeated-division
n=254,base=8
DIV:254/8=31,r:6 ; DIV:31/8=3,r:7 ; DIV:3/8=0,r:3 ; OUT:376
multidigit_addition
multidigit_addition:left-to-right-partials
158+698
p100:100+600=700 ; p10:50+90=140 ; p1:8+8=16 ; sum=700+140+16=856
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,4) ; G=(5,5)
R:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
linear_equation_solving
linear_equation_solving:inverse-ops
9x+54=18
9x+54=18 ; x=(18-54)/9 ; x=-36/9 ; x=-4
multidigit_addition
multidigit_addition:left-to-right-partials
993+355
p100:900+300=1200 ; p10:90+50=140 ; p1:3+5=8 ; sum=1200+140+8=1348
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,4) ; G=(4,5)
D:(2,4) ; D:(3,4) ; D:(4,4) ; R:(4,5)
linear_equation_solving
linear_equation_solving:inverse-ops
3x-9=-12
3x-9=-12 ; x=(-12--9)/3 ; x=-3/3 ; x=-1
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,2) ; G=(5,5)
D:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
list_summation
list_summation:left-to-right
2, 7, 7, 8
2+7=9 ; 9+7=16 ; 16+8=24
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x+35=0
7x+35=0 ; 7x=-35 ; x=-5
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x-45=-40
5x-45=-40 ; 5x=5 ; x=1
base_conversion
base_conversion:decomposition
n=214,base=8
TERM:3*8^2=192 ; TERM:2*8^1=16 ; TERM:6*8^0=6 ; OUT:326
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,1) ; G=(5,4)
D:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4)
list_summation
list_summation:left-to-right
5, 9, 7, 0
5+9=14 ; 14+7=21 ; 21+0=21
base_conversion
base_conversion:decomposition
n=10,base=4
TERM:2*4^1=8 ; TERM:2*4^0=2 ; OUT:22
sorting_algorithms
sorting_algorithms:merge-sort
8, 4, 9, 3, 2
[4,8,9,3,2] ; [4,8,3,9,2] ; [3,4,8,9,2] ; [2,3,4,8,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x-12=-32
4x-12=-32 ; 4x=-20 ; x=-5
sorting_algorithms
sorting_algorithms:merge-sort
4, 0, 1, 3, 5
[0,4,1,3,5] ; [0,1,3,4,5]
base_conversion
base_conversion:decomposition
n=221,base=8
TERM:3*8^2=192 ; TERM:3*8^1=24 ; TERM:5*8^0=5 ; OUT:335
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x-48=-112
8x-48=-112 ; x+-6=-14 ; x=-14--6 ; x=-8
sorting_algorithms
sorting_algorithms:bubble-sort
9, 3, 2, 7, 8
[3,9,2,7,8] ; [3,2,9,7,8] ; [3,2,7,9,8] ; [3,2,7,8,9] ; [2,3,7,8,9]
multidigit_addition
multidigit_addition:left-to-right-partials
152+830
p100:100+800=900 ; p10:50+30=80 ; p1:2+0=2 ; sum=900+80+2=982
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x-28=-84
7x-28=-84 ; x+-4=-12 ; x=-12--4 ; x=-8
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,0) ; G=(5,2)
R:(4,1) ; D:(5,1) ; R:(5,2)
linear_equation_solving
linear_equation_solving:inverse-ops
6x+48=30
6x+48=30 ; x=(30-48)/6 ; x=-18/6 ; x=-3
sorting_algorithms
sorting_algorithms:selection-sort
2, 4, 5, 7, 6
[2,4,5,7,6] ; [2,4,5,7,6] ; [2,4,5,7,6] ; [2,4,5,6,7]
list_summation
list_summation:left-to-right
6, 6, 5, 5
6+6=12 ; 12+5=17 ; 17+5=22
base_conversion
base_conversion:repeated-division
n=11,base=16
DIV:11/16=0,r:11 ; OUT:B
list_summation
list_summation:pairwise
6, 2, 4, 7
6+2=8 ; 4+7=11 ; 8+11=19
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,2) ; G=(3,5)
R:(1,3) ; D:(2,3) ; R:(2,4) ; D:(3,4) ; R:(3,5)
base_conversion
base_conversion:decomposition
n=119,base=2
TERM:1*2^6=64 ; 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:1110111
list_summation
list_summation:right-to-left
0, 7, 0, 0
0+0=0 ; 7+0=7 ; 0+7=7
base_conversion
base_conversion:via-binary
n=45,base=2
BINLEN:6 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:1 ; CHUNK:4:0 ; CHUNK:5:1 ; OUT:101101
list_summation
list_summation:right-to-left
7, 1, 4, 4
4+4=8 ; 1+8=9 ; 7+9=16
list_summation
list_summation:pairwise
2, 3, 6, 7
2+3=5 ; 6+7=13 ; 5+13=18
base_conversion
base_conversion:via-binary
n=152,base=16
BINLEN:8 ; CHUNK:0:9 ; CHUNK:1:8 ; OUT:98
list_summation
list_summation:left-to-right
6, 3, 6, 7
6+3=9 ; 9+6=15 ; 15+7=22