== L: lem:lines
  400 random (u, s, a, b, y), exact: phi == max over monotone sigma: True
== P: lem:patch
  300 random points of patch cells: lower and upper hull values bracket g(a): True
== C: cells (single-polynomial and vertex-decoupled), lemma chain on random configurations
  265 configurations {'cell10f_3': 230, 'cell10f': 35}: E|L| <= sum_v w_v E P_v(M), E P_v(M) <= sum c G + F_v < T on all: True; max E|L|/T = 0.987152
== N: near-sphere boxes on random configurations
  229 configurations: E|L| <= S3: True; max E|L|/S3 = 0.991301
== K: comparison boxes on random configurations
  200 configurations: P >= R on the grid, P(-v) = 0, P(u) = l_R(u), E|L| = E|X| + E R(M) <= E|X| + E P(M) <= E|X + b chi_4| <= T: True; max E|L|/T = 0.997510
== A: adversarial search (hill climbing on E|L| / |alpha|)
  u = 2.5400: max found E|L|/T = 0.999999999; top |alpha_i| [0.5774 0.5773 0.5773]
  u = 2.5450: max found E|L|/T = 0.999999998; top |alpha_i| [0.5 0.5 0.5 0.5]
  u = 2.5500: max found E|L|/T = 0.999999999; top |alpha_i| [0.5 0.5 0.5 0.5]
  u = 2.5550: max found E|L|/T = 0.999999999; top |alpha_i| [0.5 0.5 0.5 0.5]
  u = 2.5600: max found E|L|/T = 0.999999998; top |alpha_i| [0.5 0.5 0.5 0.5]
  no configuration above T: True
summary {'L': True, 'P': True, 'C': True, 'N': True, 'K': True, 'A': np.True_}; 10 s
ALL SEMANTIC TESTS PASS

real	0m11.582s
user	0m12.207s
sys	0m0.044s
