S002 · implies
Before
source roles = [[v0, v1, v2, v3, v4, v5], [[v0, v1], [v1, v2], [v2, v3], [v3, v4], [v4, v5], [v5, v0]], null]
After
derived = [[v0, v1, v2, v3, v4, v5], [[v0, v1], [v0, v5], [v1, v2], [v2, v3], [v3, v4], [v4, v5]], null]
Conditions: none
The carrier is nonempty with at most12 vertices;sort endpoints by UTF16 then edge families in English.Reject loops/reversed duplicates.An omitted candidate stays null,not an invented empty candidate.
Step identifiers and dependencies
Rule: Mincover_complete_simple_graph_UTF16_English_and_optional_candidate · Uses: G001, S001
S003 · implies
Before
source roles = [[v0, v1, v2, v3, v4, v5], [[v0, v1], [v0, v5], [v1, v2], [v2, v3], [v3, v4], [v4, v5]], 64]
After
derived = [[21, 23, 27, 29, 31, 42, 43, 45, 46, 47, 53, 54, 55, 58, 59, 61, 62, 63], [[0, 0], [1, 2], [2, 1], [3, 3], [4, 0], [5, 4], [6, 1], [7, 4], [8, 0], [9, 2], [10, 1], [11, 5], [12, 0], [13, 5], [14, 1], [15, 5], [16, 0], [17, 2], [18, 1], [19, 3], [20, 0], [22, 1], [24, 0], [25, 2], [26, 1], [28, 0], [30, 1], [32, 0], [33, 2], [34, 3], [35, 3], [36, 0], [37, 4], [38, 4], [39, 4], [40, 0], [41, 2], [44, 0], [48, 0], [49, 2], [50, 3], [51, 3], [52, 0], [56, 0], [57, 2], [60, 0]], [[v0, v2, v4], [v0, v1, v2, v4], [v0, v1, v3, v4], [v0, v2, v3, v4], [v0, v1, v2, v3, v4], [v1, v3, v5], [v0, v1, v3, v5], [v0, v2, v3, v5], [v1, v2, v3, v5], [v0, v1, v2, v3, v5], [v0, v2, v4, v5], [v1, v2, v4, v5], [v0, v1, v2, v4, v5], [v1, v3, v4, v5], [v0, v1, v3, v4, v5], [v0, v2, v3, v4, v5], [v1, v2, v3, v4, v5], [v0, v1, v2, v3, v4, v5]], [0, 0, 0, 2, 9, 6, 1], 3, [[v0, v2, v4], [v1, v3, v5]]]
Conditions: none
Audit every mask against every edge,retaining the first uncovered-edge refutation for each failure and every accepted set in source order.Zero smaller-size counts give a lower bound and actual minimum covers attain it.Keep all ties in numeric-mask order,not English/size order.
Step identifiers and dependencies
Rule: Mincover_ALL_masks_acceptance_refutations_ALLcovers_ALLminimizers · Uses: G001, S002