table header: N=14400 NK=120 NF=120 RNK=4 ND=12 MLAB=3 NC=188 HAVE_ELL=1 pord=[120, 48, 60, 240]
classes: 188 total, 17 loop, 17 elliptic (not loop), 154 admissible; admissible indices = 0..153 contiguous: True
admissible classes with admissible inverse: 154 of 154
sum of sizes: all 14400, admissible 12720, loop 480, elliptic 1200
jobs_B.txt: 383 jobs; jobs_B_byclass.txt: 383 jobs; same multiset of lines: True
job list: 383 jobs, 154 classes, sub-slice counts S: 107x1 5x2 8x3 11x4 6x5 5x6 3x7 2x8 1x9 1x12 2x14 2x17 1x18
log directory programA/out/B: 383 *.log files, other files: ['solutions.txt']
logs with a valid DONE line: 383 of 383 jobs
jobs with nodes=0 (root gluing refused because the inverse class is below the threshold): 14, classes [9, 21, 35, 53, 54, 56, 58, 65, 72, 76, 78, 82, 140, 141]
classes t with cinv[t] < t: [9, 21, 35, 53, 54, 56, 58, 65, 72, 76, 78, 82, 140, 141]
self-inverse admissible classes: 126 ; inverse pairs: 14 ; classes up to inversion: 140
depth-1 probe with the rebuilt binary agrees for 383 of 383 jobs
TOTAL nodes=1596433384 solutions=0 attempts=46799574720 tries=428044087522 leaves=0 maxdepth=6 cpu=131311.58 s (36.48 h) wall-sum=132340.4 s (36.76 h)
sha256 of the sorted DONE lines without cpu (recipe of fill_result.py): b11d59bf88c9fd57a8a9722abfd1f5f6f6160b362223879d91884e9b185c9cba
  variant with single newlines: 22bb406ca14479324db761d10c4e6cb78bf4a799f3f3d47fbb5d3aca97c1912c
RESULT: PASS (0 failures)
