RESULT test_lemma1 fam=build seed=603 n=5..10 k=3..5 pot=small weak=False {'assignments': 3936406, 'cycles': 3296666, 'instances': 178118, 'min_X_empty_zero_cycle': 52425, 'min_X_nonempty': 2304770, 'nonmin_X_empty_negative_cycle': 602223, 'nonmin_X_empty_zero_cycle': 76456, 'nonmin_X_nonempty': 900532, 'seconds': 120.0, 'vertices': 661211, 'vertices_skipped_more_than_3000_assignments': 33, 'vertices_with_several_minimisers': 399615}
EXAMPLE non-minimal admissible assignment with empty X: ('n=6 arcs=[(0, 2), (1, 2), (2, 3), (1, 3), (0, 3), (2, 3), (2, 3), (2, 3), (3, 4), (2, 4), (1, 4), (3, 4), (3, 4), (1, 4), (3, 5), (4, 5), (1, 5)] | r_0=0 U_0=[0, 2, 3, 4, 5] | r_1=1 U_1=[1, 2, 3, 4, 5] | r_2=2 U_2=[2, 3, 4, 5]', 5, (14, 16, 15), [(0, 1, '-3'), (0, 2, '-2'), (2, 0, '1'), (2, 1, '2')], {1: {1: '2'}, 3: {0: '2', 1: '-1', 2: '0'}, 4: {0: '1', 1: '2', 2: '0'}})
