task_name
stringclasses
6 values
strategy_id
stringclasses
20 values
input_text
stringlengths
6
26
reasoning_trace
stringlengths
11
152
list_summation
list_summation:left-to-right
9, 7, 1, 3
9+7=16 ; 16+1=17 ; 17+3=20
multidigit_addition
multidigit_addition:right-to-left-carry
918+933
d2:8+3+0=11→w1,c1 ; d1:1+3+1=5→w5,c0 ; d0:9+9+0=18→w8,c1 ; sum=1851
linear_equation_solving
linear_equation_solving:inverse-ops
2x+6=22
2x+6=22 ; x=(22-6)/2 ; x=16/2 ; x=8
multidigit_addition
multidigit_addition:left-to-right-partials
145+667
p100:100+600=700 ; p10:40+60=100 ; p1:5+7=12 ; sum=700+100+12=812
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x-18=6
6x-18=6 ; x+-3=1 ; x=1--3 ; x=4
base_conversion
base_conversion:decomposition
n=161,base=8
TERM:2*8^2=128 ; TERM:4*8^1=32 ; TERM:1*8^0=1 ; OUT:241
sorting_algorithms
sorting_algorithms:merge-sort
3, 2, 6, 4, 5
[2,3,6,4,5] ; [2,3,4,6,5] ; [2,3,4,5,6]
multidigit_addition
multidigit_addition:rounding-decomposition
655+563
round:660+563=1223 ; adjust:1223-5=1218 ; sum=1218
sorting_algorithms
sorting_algorithms:bubble-sort
3, 0, 4, 7, 6
[0,3,4,7,6] ; [0,3,4,6,7]
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x+42=72
6x+42=72 ; x+7=12 ; x=12-7 ; x=5
list_summation
list_summation:left-to-right
1, 1, 3, 7
1+1=2 ; 2+3=5 ; 5+7=12
base_conversion
base_conversion:repeated-division
n=152,base=16
DIV:152/16=9,r:8 ; DIV:9/16=0,r:9 ; OUT:98
linear_equation_solving
linear_equation_solving:inverse-ops
7x+0=-42
7x+0=-42 ; x=(-42-0)/7 ; x=-42/7 ; x=-6
base_conversion
base_conversion:via-binary
n=196,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:0 ; CHUNK:2:4 ; OUT:304
multidigit_addition
multidigit_addition:right-to-left-carry
871+601
d2:1+1+0=2→w2,c0 ; d1:7+0+0=7→w7,c0 ; d0:8+6+0=14→w4,c1 ; sum=1472
base_conversion
base_conversion:repeated-division
n=158,base=8
DIV:158/8=19,r:6 ; DIV:19/8=2,r:3 ; DIV:2/8=0,r:2 ; OUT:236
multidigit_addition
multidigit_addition:left-to-right-partials
652+576
p100:600+500=1100 ; p10:50+70=120 ; p1:2+6=8 ; sum=1100+120+8=1228
sorting_algorithms
sorting_algorithms:heap-sort
3, 1, 2, 6, 9
[3,9,2,6,1] ; [9,3,2,6,1] ; [9,6,2,3,1] ; [1,6,2,3,9] ; [6,1,2,3,9] ; [6,3,2,1,9] ; [1,3,2,6,9] ; [3,1,2,6,9] ; [2,1,3,6,9] ; [1,2,3,6,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,3) ; G=(5,4)
R:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4)
sorting_algorithms
sorting_algorithms:insertion-sort
9, 4, 8, 3, 2
[4,9,8,3,2] ; [4,8,9,3,2] ; [3,4,8,9,2] ; [2,3,4,8,9]
sorting_algorithms
sorting_algorithms:merge-sort
1, 5, 2, 9, 3
[1,2,5,9,3] ; [1,2,3,5,9]
list_summation
list_summation:left-to-right
8, 3, 6, 6
8+3=11 ; 11+6=17 ; 17+6=23
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+9=21
3x+9=21 ; 3x=12 ; x=4
list_summation
list_summation:right-to-left
8, 5, 6, 1
6+1=7 ; 5+7=12 ; 8+12=20
base_conversion
base_conversion:via-binary
n=108,base=2
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:1 ; CHUNK:4:1 ; CHUNK:5:0 ; CHUNK:6:0 ; OUT:1101100
list_summation
list_summation:right-to-left
1, 2, 7, 5
7+5=12 ; 2+12=14 ; 1+14=15
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,3) ; G=(3,4)
D:(1,3) ; D:(2,3) ; D:(3,3) ; R:(3,4)
base_conversion
base_conversion:decomposition
n=105,base=8
TERM:1*8^2=64 ; TERM:5*8^1=40 ; TERM:1*8^0=1 ; OUT:151
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x+14=21
7x+14=21 ; 7x=7 ; x=1
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-4=2
2x-4=2 ; x+-2=1 ; x=1--2 ; x=3
linear_equation_solving
linear_equation_solving:inverse-ops
4x-32=-60
4x-32=-60 ; x=(-60--32)/4 ; x=-28/4 ; x=-7
multidigit_addition
multidigit_addition:rounding-decomposition
501+161
round:510+161=671 ; adjust:671-9=662 ; sum=662
base_conversion
base_conversion:repeated-division
n=21,base=8
DIV:21/8=2,r:5 ; DIV:2/8=0,r:2 ; OUT:25
multidigit_addition
multidigit_addition:rounding-decomposition
876+218
round:880+218=1098 ; adjust:1098-4=1094 ; sum=1094
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,3) ; G=(5,4)
R:(3,4) ; D:(4,4) ; D:(5,4)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,1) ; G=(4,3)
R:(0,2) ; D:(1,2) ; R:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,3) ; G=(4,5)
R:(3,4) ; D:(4,4) ; R:(4,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,3) ; G=(2,4)
D:(1,3) ; D:(2,3) ; R:(2,4)
multidigit_addition
multidigit_addition:right-to-left-carry
931+515
d2:1+5+0=6→w6,c0 ; d1:3+1+0=4→w4,c0 ; d0:9+5+0=14→w4,c1 ; sum=1446
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,0) ; G=(2,4)
D:(2,0) ; R:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4)
multidigit_addition
multidigit_addition:rounding-decomposition
874+598
round:880+598=1478 ; adjust:1478-6=1472 ; sum=1472
sorting_algorithms
sorting_algorithms:selection-sort
1, 5, 7, 4, 0
[0,5,7,4,1] ; [0,1,7,4,5] ; [0,1,4,7,5] ; [0,1,4,5,7]
list_summation
list_summation:pairwise
8, 9, 0, 7
8+9=17 ; 0+7=7 ; 17+7=24
multidigit_addition
multidigit_addition:rounding-decomposition
587+183
round:590+183=773 ; adjust:773-3=770 ; sum=770
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:right-to-left
0, 2, 8, 3
8+3=11 ; 2+11=13 ; 0+13=13
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,3) ; G=(5,5)
R:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,3) ; G=(5,4)
R:(4,4) ; D:(5,4)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,3) ; G=(4,5)
D:(2,3) ; D:(3,3) ; D:(4,3) ; R:(4,4) ; R:(4,5)
base_conversion
base_conversion:decomposition
n=50,base=4
TERM:3*4^2=48 ; TERM:0*4^1=0 ; TERM:2*4^0=2 ; OUT:302
linear_equation_solving
linear_equation_solving:inverse-ops
2x-10=-2
2x-10=-2 ; x=(-2--10)/2 ; x=8/2 ; x=4
linear_equation_solving
linear_equation_solving:inverse-ops
7x+42=84
7x+42=84 ; x=(84-42)/7 ; x=42/7 ; x=6
base_conversion
base_conversion:via-binary
n=74,base=8
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:2 ; OUT:112
base_conversion
base_conversion:via-binary
n=22,base=4
BINLEN:5 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:2 ; OUT:112
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)
sorting_algorithms
sorting_algorithms:merge-sort
5, 4, 3, 7, 1
[4,5,3,7,1] ; [3,4,5,7,1] ; [1,3,4,5,7]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,3) ; G=(4,4)
R:(0,4) ; D:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4)
linear_equation_solving
linear_equation_solving:inverse-ops
8x+8=48
8x+8=48 ; x=(48-8)/8 ; x=40/8 ; x=5
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,3) ; G=(5,5)
D:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3) ; D:(5,3) ; R:(5,4) ; R:(5,5)
multidigit_addition
multidigit_addition:right-to-left-carry
639+313
d2:9+3+0=12→w2,c1 ; d1:3+1+1=5→w5,c0 ; d0:6+3+0=9→w9,c0 ; sum=952
sorting_algorithms
sorting_algorithms:insertion-sort
3, 8, 7, 0, 4
[3,8,7,0,4] ; [3,7,8,0,4] ; [0,3,7,8,4] ; [0,3,4,7,8]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,4) ; G=(3,5)
D:(2,4) ; D:(3,4) ; R:(3,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,2) ; G=(2,4)
D:(2,2) ; R:(2,3) ; R:(2,4)
base_conversion
base_conversion:decomposition
n=246,base=8
TERM:3*8^2=192 ; TERM:6*8^1=48 ; TERM:6*8^0=6 ; OUT:366
base_conversion
base_conversion:repeated-division
n=202,base=2
DIV:202/2=101,r:0 ; DIV:101/2=50,r:1 ; DIV:50/2=25,r:0 ; DIV:25/2=12,r:1 ; DIV:12/2=6,r:0 ; DIV:6/2=3,r:0 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:11001010
base_conversion
base_conversion:repeated-division
n=38,base=8
DIV:38/8=4,r:6 ; DIV:4/8=0,r:4 ; OUT:46
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x+16=88
8x+16=88 ; x+2=11 ; x=11-2 ; x=9
base_conversion
base_conversion:via-binary
n=15,base=8
BINLEN:4 ; CHUNK:0:1 ; CHUNK:1:7 ; OUT:17
multidigit_addition
multidigit_addition:left-to-right-partials
887+576
p100:800+500=1300 ; p10:80+70=150 ; p1:7+6=13 ; sum=1300+150+13=1463
base_conversion
base_conversion:via-binary
n=36,base=16
BINLEN:6 ; CHUNK:0:2 ; CHUNK:1:4 ; OUT:24
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=56,base=4
TERM:3*4^2=48 ; TERM:2*4^1=8 ; TERM:0*4^0=0 ; OUT:320
list_summation
list_summation:right-to-left
9, 6, 1, 9
1+9=10 ; 6+10=16 ; 9+16=25
sorting_algorithms
sorting_algorithms:selection-sort
1, 3, 6, 7, 0
[0,3,6,7,1] ; [0,1,6,7,3] ; [0,1,3,7,6] ; [0,1,3,6,7]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,1) ; G=(5,5)
R:(2,2) ; D:(3,2) ; R:(3,3) ; D:(4,3) ; R:(4,4) ; D:(5,4) ; R:(5,5)
linear_equation_solving
linear_equation_solving:inverse-ops
9x+0=-81
9x+0=-81 ; x=(-81-0)/9 ; x=-81/9 ; x=-9
base_conversion
base_conversion:decomposition
n=51,base=8
TERM:6*8^1=48 ; TERM:3*8^0=3 ; OUT:63
base_conversion
base_conversion:via-binary
n=123,base=8
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:7 ; CHUNK:2:3 ; OUT:173
multidigit_addition
multidigit_addition:right-to-left-carry
689+512
d2:9+2+0=11→w1,c1 ; d1:8+1+1=10→w0,c1 ; d0:6+5+1=12→w2,c1 ; sum=1201
sorting_algorithms
sorting_algorithms:heap-sort
6, 0, 8, 9, 5
[6,9,8,0,5] ; [9,6,8,0,5] ; [5,6,8,0,9] ; [8,6,5,0,9] ; [0,6,5,8,9] ; [6,0,5,8,9] ; [5,0,6,8,9] ; [0,5,6,8,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,2) ; G=(4,3)
R:(3,3) ; D:(4,3)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,2) ; G=(5,4)
D:(5,2) ; R:(5,3) ; R:(5,4)
multidigit_addition
multidigit_addition:left-to-right-partials
468+467
p100:400+400=800 ; p10:60+60=120 ; p1:8+7=15 ; sum=800+120+15=935
list_summation
list_summation:right-to-left
1, 5, 4, 1
4+1=5 ; 5+5=10 ; 1+10=11
list_summation
list_summation:right-to-left
7, 0, 0, 3
0+3=3 ; 0+3=3 ; 7+3=10
list_summation
list_summation:left-to-right
4, 2, 5, 7
4+2=6 ; 6+5=11 ; 11+7=18
sorting_algorithms
sorting_algorithms:selection-sort
1, 4, 2, 5, 8
[1,4,2,5,8] ; [1,2,4,5,8] ; [1,2,4,5,8] ; [1,2,4,5,8]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,1) ; G=(5,5)
R:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5) ; D:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,2) ; G=(1,5)
R:(0,3) ; D:(1,3) ; R:(1,4) ; R:(1,5)
base_conversion
base_conversion:decomposition
n=233,base=4
TERM:3*4^3=192 ; TERM:2*4^2=32 ; TERM:2*4^1=8 ; TERM:1*4^0=1 ; OUT:3221
list_summation
list_summation:pairwise
9, 9, 1, 0
9+9=18 ; 1+0=1 ; 18+1=19
list_summation
list_summation:left-to-right
0, 7, 6, 7
0+7=7 ; 7+6=13 ; 13+7=20
sorting_algorithms
sorting_algorithms:insertion-sort
8, 9, 2, 6, 4
[8,9,2,6,4] ; [2,8,9,6,4] ; [2,6,8,9,4] ; [2,4,6,8,9]
multidigit_addition
multidigit_addition:right-to-left-carry
113+724
d2:3+4+0=7→w7,c0 ; d1:1+2+0=3→w3,c0 ; d0:1+7+0=8→w8,c0 ; sum=837
sorting_algorithms
sorting_algorithms:bubble-sort
8, 0, 1, 6, 5
[0,8,1,6,5] ; [0,1,8,6,5] ; [0,1,6,8,5] ; [0,1,6,5,8] ; [0,1,5,6,8]
linear_equation_solving
linear_equation_solving:inverse-ops
8x-8=-72
8x-8=-72 ; x=(-72--8)/8 ; x=-64/8 ; x=-8
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x+15=42
3x+15=42 ; x+5=14 ; x=14-5 ; x=9
base_conversion
base_conversion:via-binary
n=21,base=8
BINLEN:5 ; CHUNK:0:2 ; CHUNK:1:5 ; OUT:25
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,0) ; G=(4,5)
R:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5) ; D:(4,5)
linear_equation_solving
linear_equation_solving:inverse-ops
3x-15=-18
3x-15=-18 ; x=(-18--15)/3 ; x=-3/3 ; x=-1