240 3 12
328021
221 1 161 161 121 41
86 192 168 8 148 172
91 181 181 91 181 181
9 66 198 27 162 78
# solutions_found 1
# distance_bound_overall 24
# latent_method Psi_3 kernel -> u^T H~X, v^T H~Z
# latent_note probabilistic search over Psi_3 / Psi_3^T kernels
# latent_x_upper 24
# latent_z_upper 24
# latent_min_upper 24
# latent_x_support [(0,8) (0,128) (1,28) (1,148) (2,52) (2,172) (3,86) (3,206) (4,72) (4,192) (5,48) (5,168) (6,27) (6,147) (7,42) (7,162) (8,78) (8,198) (9,9) (9,129) (10,66) (10,186) (11,78) (11,198)]
# latent_z_support [(0,63) (0,183) (1,42) (1,162) (2,54) (2,174) (3,21) (3,141) (4,42) (4,162) (5,78) (5,198) (6,32) (6,152) (7,72) (7,192) (8,48) (8,168) (9,74) (9,194) (10,28) (10,148) (11,92) (11,212)]
# nonlatent_method m-block-constant compression kernel -> lift
# nonlatent_note probabilistic search over all divisors m>=2 of P (best m_X=5, m_Z=4)
# nonlatent_x_upper 30
# nonlatent_z_upper 24
# nonlatent_min_upper 24
# nonlatent_x_m 5
# nonlatent_z_m 4
# nonlatent_x_support [(0,10) (0,58) (0,106) (0,154) (0,202) (1,1) (1,49) (1,97) (1,145) (1,193) (2,13) (2,61) (2,109) (2,157) (2,205) (3,4) (3,52) (3,100) (3,148) (3,196) (4,1) (4,49) (4,97) (4,145) ...]
# nonlatent_z_support [(0,17) (0,19) (0,77) (0,79) (0,137) (0,139) (0,197) (0,199) (2,17) (2,39) (2,77) (2,99) (2,137) (2,159) (2,197) (2,219) (3,1) (3,61) (3,121) (3,181) (5,21) (5,81) (5,141) (5,201)]
# cycle8_ets_method external enumerate_cycle8_ets
# cycle8_ets_note disabled
# cycle8_ets_x_upper n/a
# cycle8_ets_z_upper n/a
# cycle8_ets_min_upper n/a