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=(4,0) ; G=(5,4)
D:(5,0) ; R:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4)
list_summation
list_summation:right-to-left
5, 4, 5, 7
5+7=12 ; 4+12=16 ; 5+16=21
grid_pathfinding
grid_pathfinding:alternating
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:subtract-then-divide
6x+6=-18
6x+6=-18 ; 6x=-24 ; x=-4
base_conversion
base_conversion:decomposition
n=65,base=16
TERM:4*16^1=64 ; TERM:1*16^0=1 ; OUT:41
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,0) ; G=(5,1)
D:(4,0) ; D:(5,0) ; R:(5,1)
base_conversion
base_conversion:decomposition
n=149,base=4
TERM:2*4^3=128 ; TERM:1*4^2=16 ; TERM:1*4^1=4 ; TERM:1*4^0=1 ; OUT:2111
base_conversion
base_conversion:decomposition
n=91,base=4
TERM:1*4^3=64 ; TERM:1*4^2=16 ; TERM:2*4^1=8 ; TERM:3*4^0=3 ; OUT:1123
base_conversion
base_conversion:repeated-division
n=211,base=4
DIV:211/4=52,r:3 ; DIV:52/4=13,r:0 ; DIV:13/4=3,r:1 ; DIV:3/4=0,r:3 ; OUT:3103
list_summation
list_summation:left-to-right
6, 3, 1, 0
6+3=9 ; 9+1=10 ; 10+0=10
base_conversion
base_conversion:via-binary
n=64,base=2
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:0 ; CHUNK:5:0 ; CHUNK:6:0 ; OUT:1000000
list_summation
list_summation:right-to-left
7, 2, 9, 8
9+8=17 ; 2+17=19 ; 7+19=26
sorting_algorithms
sorting_algorithms:insertion-sort
9, 2, 5, 7, 3
[2,9,5,7,3] ; [2,5,9,7,3] ; [2,5,7,9,3] ; [2,3,5,7,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,0) ; G=(4,1)
R:(3,1) ; D:(4,1)
list_summation
list_summation:right-to-left
5, 4, 6, 4
6+4=10 ; 4+10=14 ; 5+14=19
sorting_algorithms
sorting_algorithms:heap-sort
5, 8, 7, 9, 4
[5,9,7,8,4] ; [9,5,7,8,4] ; [9,8,7,5,4] ; [4,8,7,5,9] ; [8,4,7,5,9] ; [8,5,7,4,9] ; [4,5,7,8,9] ; [7,5,4,8,9] ; [4,5,7,8,9] ; [5,4,7,8,9] ; [4,5,7,8,9]
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x-25=5
5x-25=5 ; x+-5=1 ; x=1--5 ; x=6
base_conversion
base_conversion:repeated-division
n=64,base=2
DIV:64/2=32,r:0 ; DIV:32/2=16,r:0 ; DIV:16/2=8,r:0 ; 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:1000000
sorting_algorithms
sorting_algorithms:selection-sort
6, 5, 1, 9, 2
[1,5,6,9,2] ; [1,2,6,9,5] ; [1,2,5,9,6] ; [1,2,5,6,9]
sorting_algorithms
sorting_algorithms:insertion-sort
5, 6, 3, 4, 2
[5,6,3,4,2] ; [3,5,6,4,2] ; [3,4,5,6,2] ; [2,3,4,5,6]
multidigit_addition
multidigit_addition:right-to-left-carry
287+518
d2:7+8+0=15→w5,c1 ; d1:8+1+1=10→w0,c1 ; d0:2+5+1=8→w8,c0 ; sum=805
sorting_algorithms
sorting_algorithms:selection-sort
9, 1, 4, 6, 7
[1,9,4,6,7] ; [1,4,9,6,7] ; [1,4,6,9,7] ; [1,4,6,7,9]
base_conversion
base_conversion:via-binary
n=26,base=8
BINLEN:5 ; CHUNK:0:3 ; CHUNK:1:2 ; OUT:32
multidigit_addition
multidigit_addition:right-to-left-carry
558+834
d2:8+4+0=12→w2,c1 ; d1:5+3+1=9→w9,c0 ; d0:5+8+0=13→w3,c1 ; sum=1392
sorting_algorithms
sorting_algorithms:bubble-sort
6, 9, 2, 0, 5
[6,2,9,0,5] ; [6,2,0,9,5] ; [6,2,0,5,9] ; [2,6,0,5,9] ; [2,0,6,5,9] ; [2,0,5,6,9] ; [0,2,5,6,9]
multidigit_addition
multidigit_addition:right-to-left-carry
761+717
d2:1+7+0=8→w8,c0 ; d1:6+1+0=7→w7,c0 ; d0:7+7+0=14→w4,c1 ; sum=1478
list_summation
list_summation:pairwise
6, 9, 3, 4
6+9=15 ; 3+4=7 ; 15+7=22
sorting_algorithms
sorting_algorithms:heap-sort
0, 2, 3, 9, 7
[0,9,3,2,7] ; [9,0,3,2,7] ; [9,7,3,2,0] ; [0,7,3,2,9] ; [7,0,3,2,9] ; [7,2,3,0,9] ; [0,2,3,7,9] ; [3,2,0,7,9] ; [0,2,3,7,9] ; [2,0,3,7,9] ; [0,2,3,7,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,4) ; G=(2,5)
R:(1,5) ; D:(2,5)
list_summation
list_summation:right-to-left
2, 6, 5, 9
5+9=14 ; 6+14=20 ; 2+20=22
sorting_algorithms
sorting_algorithms:bubble-sort
3, 2, 6, 5, 8
[2,3,6,5,8] ; [2,3,5,6,8]
base_conversion
base_conversion:repeated-division
n=211,base=2
DIV:211/2=105,r:1 ; DIV:105/2=52,r:1 ; DIV:52/2=26,r:0 ; DIV:26/2=13,r:0 ; 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:11010011
base_conversion
base_conversion:decomposition
n=141,base=4
TERM:2*4^3=128 ; TERM:0*4^2=0 ; TERM:3*4^1=12 ; TERM:1*4^0=1 ; OUT:2031
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-12=-30
6x-12=-30 ; 6x=-18 ; x=-3
sorting_algorithms
sorting_algorithms:insertion-sort
2, 6, 1, 3, 0
[2,6,1,3,0] ; [1,2,6,3,0] ; [1,2,3,6,0] ; [0,1,2,3,6]
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-4=-16
2x-4=-16 ; x+-2=-8 ; x=-8--2 ; x=-6
sorting_algorithms
sorting_algorithms:insertion-sort
5, 1, 4, 7, 8
[1,5,4,7,8] ; [1,4,5,7,8] ; [1,4,5,7,8] ; [1,4,5,7,8]
linear_equation_solving
linear_equation_solving:inverse-ops
5x+40=45
5x+40=45 ; x=(45-40)/5 ; x=5/5 ; x=1
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)
list_summation
list_summation:pairwise
1, 8, 9, 2
1+8=9 ; 9+2=11 ; 9+11=20
base_conversion
base_conversion:repeated-division
n=143,base=8
DIV:143/8=17,r:7 ; DIV:17/8=2,r:1 ; DIV:2/8=0,r:2 ; OUT:217
list_summation
list_summation:right-to-left
3, 8, 9, 2
9+2=11 ; 8+11=19 ; 3+19=22
sorting_algorithms
sorting_algorithms:bubble-sort
9, 6, 8, 2, 4
[6,9,8,2,4] ; [6,8,9,2,4] ; [6,8,2,9,4] ; [6,8,2,4,9] ; [6,2,8,4,9] ; [6,2,4,8,9] ; [2,6,4,8,9] ; [2,4,6,8,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+32=16
4x+32=16 ; 4x=-16 ; x=-4
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,0) ; G=(3,2)
R:(0,1) ; D:(1,1) ; R:(1,2) ; D:(2,2) ; D:(3,2)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,2) ; G=(4,4)
R:(3,3) ; D:(4,3) ; R:(4,4)
list_summation
list_summation:pairwise
4, 6, 4, 2
4+6=10 ; 4+2=6 ; 10+6=16
list_summation
list_summation:right-to-left
9, 4, 5, 7
5+7=12 ; 4+12=16 ; 9+16=25
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,3) ; G=(3,4)
D:(2,3) ; D:(3,3) ; R:(3,4)
list_summation
list_summation:pairwise
0, 3, 5, 8
0+3=3 ; 5+8=13 ; 3+13=16
sorting_algorithms
sorting_algorithms:bubble-sort
7, 6, 0, 3, 9
[6,7,0,3,9] ; [6,0,7,3,9] ; [6,0,3,7,9] ; [0,6,3,7,9] ; [0,3,6,7,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,1) ; G=(2,4)
R:(0,2) ; R:(0,3) ; R:(0,4) ; D:(1,4) ; D:(2,4)
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+72=72
8x+72=72 ; 8x=0 ; x=0
multidigit_addition
multidigit_addition:rounding-decomposition
246+927
round:250+927=1177 ; adjust:1177-4=1173 ; sum=1173
base_conversion
base_conversion:decomposition
n=193,base=2
TERM:1*2^7=128 ; TERM:1*2^6=64 ; TERM:0*2^5=0 ; TERM:0*2^4=0 ; TERM:0*2^3=0 ; TERM:0*2^2=0 ; TERM:0*2^1=0 ; TERM:1*2^0=1 ; OUT:11000001
sorting_algorithms
sorting_algorithms:bubble-sort
5, 0, 1, 7, 3
[0,5,1,7,3] ; [0,1,5,7,3] ; [0,1,5,3,7] ; [0,1,3,5,7]
sorting_algorithms
sorting_algorithms:bubble-sort
8, 5, 3, 0, 2
[5,8,3,0,2] ; [5,3,8,0,2] ; [5,3,0,8,2] ; [5,3,0,2,8] ; [3,5,0,2,8] ; [3,0,5,2,8] ; [3,0,2,5,8] ; [0,3,2,5,8] ; [0,2,3,5,8]
sorting_algorithms
sorting_algorithms:heap-sort
5, 8, 3, 9, 4
[5,9,3,8,4] ; [9,5,3,8,4] ; [9,8,3,5,4] ; [4,8,3,5,9] ; [8,4,3,5,9] ; [8,5,3,4,9] ; [4,5,3,8,9] ; [5,4,3,8,9] ; [3,4,5,8,9] ; [4,3,5,8,9] ; [3,4,5,8,9]
multidigit_addition
multidigit_addition:rounding-decomposition
191+562
round:200+562=762 ; adjust:762-9=753 ; sum=753
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x-12=-40
4x-12=-40 ; x+-3=-10 ; x=-10--3 ; x=-7
base_conversion
base_conversion:decomposition
n=175,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:1*2^5=32 ; TERM:0*2^4=0 ; TERM:1*2^3=8 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:10101111
base_conversion
base_conversion:decomposition
n=206,base=2
TERM:1*2^7=128 ; TERM:1*2^6=64 ; TERM:0*2^5=0 ; TERM:0*2^4=0 ; TERM:1*2^3=8 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:11001110
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-18=-6
2x-18=-6 ; x+-9=-3 ; x=-3--9 ; x=6
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x+12=24
4x+12=24 ; x+3=6 ; x=6-3 ; x=3
multidigit_addition
multidigit_addition:rounding-decomposition
996+762
round:1000+762=1762 ; adjust:1762-4=1758 ; sum=1758
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,0) ; G=(4,1)
R:(3,1) ; D:(4,1)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,3) ; G=(5,4)
R:(4,4) ; D:(5,4)
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x+5=-10
5x+5=-10 ; 5x=-15 ; x=-3
list_summation
list_summation:left-to-right
8, 4, 6, 1
8+4=12 ; 12+6=18 ; 18+1=19
sorting_algorithms
sorting_algorithms:bubble-sort
7, 8, 4, 2, 0
[7,4,8,2,0] ; [7,4,2,8,0] ; [7,4,2,0,8] ; [4,7,2,0,8] ; [4,2,7,0,8] ; [4,2,0,7,8] ; [2,4,0,7,8] ; [2,0,4,7,8] ; [0,2,4,7,8]
linear_equation_solving
linear_equation_solving:inverse-ops
2x+2=-12
2x+2=-12 ; x=(-12-2)/2 ; x=-14/2 ; x=-7
sorting_algorithms
sorting_algorithms:merge-sort
7, 5, 4, 1, 3
[5,7,4,1,3] ; [5,7,1,4,3] ; [1,4,5,7,3] ; [1,3,4,5,7]
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x+63=63
7x+63=63 ; x+9=9 ; x=9-9 ; x=0
linear_equation_solving
linear_equation_solving:inverse-ops
7x-49=-56
7x-49=-56 ; x=(-56--49)/7 ; x=-7/7 ; x=-1
list_summation
list_summation:pairwise
1, 4, 5, 5
1+4=5 ; 5+5=10 ; 5+10=15
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x+30=66
6x+30=66 ; x+5=11 ; x=11-5 ; x=6
sorting_algorithms
sorting_algorithms:heap-sort
8, 0, 7, 6, 1
[8,6,7,0,1] ; [1,6,7,0,8] ; [7,6,1,0,8] ; [0,6,1,7,8] ; [6,0,1,7,8] ; [1,0,6,7,8] ; [0,1,6,7,8]
base_conversion
base_conversion:repeated-division
n=104,base=8
DIV:104/8=13,r:0 ; DIV:13/8=1,r:5 ; DIV:1/8=0,r:1 ; OUT:150
sorting_algorithms
sorting_algorithms:bubble-sort
2, 0, 1, 7, 8
[0,2,1,7,8] ; [0,1,2,7,8]
sorting_algorithms
sorting_algorithms:merge-sort
4, 6, 7, 2, 0
[4,6,2,7,0] ; [2,4,6,7,0] ; [0,2,4,6,7]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,0) ; G=(4,2)
R:(3,1) ; R:(3,2) ; D:(4,2)
sorting_algorithms
sorting_algorithms:heap-sort
8, 5, 4, 7, 0
[8,7,4,5,0] ; [0,7,4,5,8] ; [7,0,4,5,8] ; [7,5,4,0,8] ; [0,5,4,7,8] ; [5,0,4,7,8] ; [4,0,5,7,8] ; [0,4,5,7,8]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,2) ; G=(5,4)
R:(4,3) ; D:(5,3) ; R:(5,4)
list_summation
list_summation:right-to-left
5, 4, 1, 9
1+9=10 ; 4+10=14 ; 5+14=19
sorting_algorithms
sorting_algorithms:bubble-sort
1, 7, 6, 3, 4
[1,6,7,3,4] ; [1,6,3,7,4] ; [1,6,3,4,7] ; [1,3,6,4,7] ; [1,3,4,6,7]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,2) ; G=(5,4)
R:(2,3) ; D:(3,3) ; R:(3,4) ; D:(4,4) ; D:(5,4)
sorting_algorithms
sorting_algorithms:merge-sort
5, 2, 7, 8, 0
[2,5,7,8,0] ; [0,2,5,7,8]
list_summation
list_summation:pairwise
6, 2, 2, 7
6+2=8 ; 2+7=9 ; 8+9=17
linear_equation_solving
linear_equation_solving:inverse-ops
3x+27=54
3x+27=54 ; x=(54-27)/3 ; x=27/3 ; x=9
sorting_algorithms
sorting_algorithms:merge-sort
3, 0, 4, 1, 8
[0,3,4,1,8] ; [0,3,1,4,8] ; [0,1,3,4,8]
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x+9=90
9x+9=90 ; x+1=10 ; x=10-1 ; x=9
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
list_summation
list_summation:left-to-right
2, 2, 2, 4
2+2=4 ; 4+2=6 ; 6+4=10
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,4) ; G=(4,5)
R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,2) ; G=(5,3)
R:(4,3) ; D:(5,3)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,2) ; G=(2,5)
R:(0,3) ; R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5)
list_summation
list_summation:right-to-left
9, 5, 1, 2
1+2=3 ; 5+3=8 ; 9+8=17
sorting_algorithms
sorting_algorithms:selection-sort
9, 4, 0, 3, 1
[0,4,9,3,1] ; [0,1,9,3,4] ; [0,1,3,9,4] ; [0,1,3,4,9]
multidigit_addition
multidigit_addition:right-to-left-carry
224+538
d2:4+8+0=12→w2,c1 ; d1:2+3+1=6→w6,c0 ; d0:2+5+0=7→w7,c0 ; sum=762
base_conversion
base_conversion:decomposition
n=124,base=8
TERM:1*8^2=64 ; TERM:7*8^1=56 ; TERM:4*8^0=4 ; OUT:174