T1/T2  relations between sets with at most 3 elements: 689 (single valued: 144)
T3     triples of sizes up to (3,3,3): 2756 relations F, 12014204 pairs {G,H} tested (scan of an F stops at its first violation)
T4     nonempty families (|B|*|C| <= 4): 1501 relations F, 2654781 families tested
T5     empty family: 2756 cases; maps counted: 60
T6     pair of the first proof on 689 relations; tail example: 78 window checks
elapsed 21.7 s
RESULT: all checks of part A passed
