RESULT test_lemma1 fam=general seed=605 n=3..9 k=2..5 pot=small weak=True {'assignments': 2516354, 'cycles': 5685592, 'instances': 144196, 'min_X_empty_zero_cycle': 14222, 'min_X_nonempty': 341908, 'nonmin_X_empty_negative_cycle': 887613, 'nonmin_X_empty_zero_cycle': 161225, 'nonmin_X_nonempty': 1111386, 'seconds': 100.0, 'vertices': 109662, 'vertices_skipped_more_than_3000_assignments': 69, 'vertices_with_several_minimisers': 67419}
EXAMPLE non-minimal admissible assignment with empty X: ('n=5 arcs=[(0, 2), (0, 3), (0, 3), (0, 3), (0, 4), (0, 4), (0, 4), (1, 2), (1, 2), (1, 2), (1, 3), (1, 4), (2, 4), (3, 4)] | r_0=0 U_0=[0, 2, 3, 4] | r_1=0 U_1=[0, 2, 3, 4] | r_2=0 U_2=[0, 2, 3, 4] | r_3=0 U_3=[0]', 4, (4, 12, 13), [(1, 0, '2'), (1, 2, '0'), (2, 0, '1'), (2, 1, '-1')], {0: {0: '-1', 1: '2', 2: '2', 3: '0'}, 2: {0: '1', 1: '-1', 2: '-1'}, 3: {0: '0', 1: '-2', 2: '-1'}})
