n=9 R=80.0: 3399 reachable points (46177 nodes), types: A0:1603, A1:446, A2:250, A3:202, A4:202, A5:250, A6:446
Conj 2.6: 5121 (point, l, eps) instances tested, 0 failures, 0 parallel points not found (must be 0)
Conj 2.7: 5121 pairs of parallel short trajectories tested, 0 failures
pairs (u,v) of reachable points with det(u,v) = sin(2 pi/n): 2729
  their (type u, type v) distribution: {(0, 0): 919, (0, 6): 905, (1, 0): 905}
Conj 2.3: 27 reachable n-gons inside radius R examined, 0 with wrong vertex types (2652 pairs undecided because a vertex leaves the disc)
  unitary pairs (types A0,A0): 27 span a reachable n-gon, 0 do not (must be 0); non-unitary pairs spanning a reachable n-gon: 0 (must be 0)
Conj 2.5 (corrected form: steps lambda^2, offsets 0 and lambda^2-1): 919 unitary pairs, 6406 predicted points inside the disc, 0 missing, 0 reachable points on the lines not of the predicted form/type
Conj 2.5 literal (a), m=1, point u+(lambda+1)v: 157 unitary pairs tested, 157 failures (= not a reachable point of type A0)
Conj 2.4: examined all reachable points with |w| <= R0 = 10.0: 51 points; a-priori bound for the vertices of an n-gon through w: |v_i| <= 17.3778 |w|; search exhaustive for types != A0: False
  points by type: {0: 25, 1: 7, 2: 3, 3: 3, 4: 3, 5: 3, 6: 7}
  points lying on NO reachable n-gon, by type: {0: 7, 1: 3, 2: 2, 3: 2, 4: 2, 5: 2, 6: 3}
  maximal number of reachable n-gons through a point of type != A0: {1: 1, 2: 1, 3: 1, 4: 1, 5: 1, 6: 1}
  shortest points on no reachable n-gon (ring coordinates in Z[zeta_18], type, radius):
     (1, 0, 2, 1, 2, 0) type A0 |w| = 5.329603 (x,y) = (3.379385, 4.121216)
     (0, -1, 0, 2, 2, 2) type A0 |w| = 5.329603 (x,y) = (0.060307, 5.329262)
     (2, 0, 3, 0, 1, 0) type A6 |w| = 5.336983 (x,y) = (4.471782, 2.913171)
     (0, -2, 0, 1, 2, 3) type A1 |w| = 5.336983 (x,y) = (-1.553033, 5.106024)
     (0, 0, 1, 2, 2, 1) type A0 |w| = 5.671282 (x,y) = (1.939693, 5.329262)
     (3, 1, 3, 0, 1, 0) type A5 |w| = 7.190498 (x,y) = (6.411474, 3.255191)
total time 17.8s
