# a(11) >= 164 for the 3D no-three-in-line problem (A399138): best lower bound at n=11 from the stratum sweep — no witness existed before this night
# maximum within the symmetry stratum c26_ord12 (|H|=12, rot=6, inv=y) of O_h by CP-SAT, 1800 s, status FEASIBLE (bound 240 not closed) — slack/night_2026-09-02/cube_strata.py, VM saturation-alg-1, 2026-09-03 ~09:35 WITA; journal: logs/2026-09-02_ночь/ИТОГ.md
# verified here by certs/no3_3d/verify_witness_lines.py (all C(164,3) = 721764 triples, integer cross products): 0 collinear; 164 distinct points in [0,10]^3
0 1 2
0 1 6
0 2 6
0 2 8
0 3 0
0 3 1
0 4 8
0 4 9
0 5 4
0 5 5
0 6 5
0 7 0
0 7 1
0 8 9
0 9 3
0 9 7
0 10 3
0 10 7
1 0 4
1 0 8
1 1 2
1 1 8
1 2 9
1 2 10
1 3 0
1 3 5
1 4 2
1 4 3
1 5 7
1 6 10
1 7 0
1 7 6
1 8 6
1 8 9
1 9 1
1 10 3
1 10 7
2 0 2
2 0 4
2 1 0
2 1 1
2 2 3
2 2 7
2 3 8
2 4 1
2 6 2
2 6 10
2 7 8
2 8 4
2 8 10
2 9 6
2 9 9
2 10 9
3 0 9
3 0 10
3 1 5
3 1 10
3 2 2
3 4 1
3 5 9
3 8 8
3 9 0
3 9 6
3 10 0
3 10 1
4 0 1
4 0 2
4 1 7
4 1 8
4 2 9
4 3 9
4 5 0
4 8 2
4 8 10
4 9 10
4 10 5
5 0 5
5 0 6
5 1 3
5 3 1
5 4 10
5 5 0
5 5 10
5 6 0
5 7 9
5 9 7
5 10 4
5 10 5
6 0 5
6 1 0
6 2 0
6 2 8
6 5 10
6 7 1
6 8 1
6 9 2
6 9 3
6 10 8
6 10 9
7 0 9
7 0 10
7 1 4
7 1 10
7 2 2
7 5 1
7 6 9
7 8 8
7 9 0
7 9 5
7 10 0
7 10 1
8 0 1
8 1 1
8 1 4
8 2 0
8 2 6
8 3 2
8 4 0
8 4 8
8 6 9
8 7 2
8 8 3
8 8 7
8 9 9
8 9 10
8 10 6
8 10 8
9 0 3
9 0 7
9 1 9
9 2 1
9 2 4
9 3 4
9 3 10
9 4 0
9 5 3
9 6 7
9 6 8
9 7 5
9 7 10
9 8 0
9 8 1
9 9 2
9 9 8
9 10 2
9 10 6
10 0 3
10 0 7
10 1 3
10 1 7
10 2 1
10 3 9
10 3 10
10 4 5
10 5 5
10 5 6
10 6 1
10 6 2
10 7 9
10 7 10
10 8 2
10 8 4
10 9 4
10 9 8