S001 · implies
Before
source roles = [mincover-empty-multiple-boundary]
After
derived = [[mode, edges, minimum_size, minimum_covers, mode_certificate, boundary]]
Conditions: none
List the full source field order without JavaScript.Original modes select contract6/4/6/6 and IVT8/7/8 roles,without padding or answer-shape inference.
Step identifiers and dependencies
Rule: source_ordered_fields_without_JS · Uses: G001
S002 · implies
Before
source roles = [[v0, v1, v2, v3], [[v0, v1], [v0, v2], [v0, v3], [v1, v2], [v1, v3], [v2, v3]], null]
After
derived = [[v0, v1, v2, v3], [[v0, v1], [v0, v2], [v0, v3], [v1, v2], [v1, v3], [v2, v3]], 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], [[v0, v1], [v0, v2], [v0, v3], [v1, v2], [v1, v3], [v2, v3]], 16]
After
derived = [[7, 11, 13, 14, 15], [[0, 0], [1, 3], [2, 1], [3, 5], [4, 0], [5, 4], [6, 2], [8, 0], [9, 3], [10, 1], [12, 0]], [[v0, v1, v2], [v0, v1, v3], [v0, v2, v3], [v1, v2, v3], [v0, v1, v2, v3]], [0, 0, 0, 4, 1], 3, [[v0, v1, v2], [v0, v1, v3], [v0, v2, v3], [v1, v2, v3]]]
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
S004 · implies
Before
source roles = [multiple_minima, [v0, v1, v2, v3], [[v0, v1], [v0, v2], [v0, v3], [v1, v2], [v1, v3], [v2, v3]]]
After
derived = [3, [[v0, v1, v2], [v0, v1, v3], [v0, v2, v3], [v1, v2, v3]], Yes]
Conditions: none
empty_graph means edgeless,not an empty vertex carrier;the unique minimum is empty.multiple_minima retains all of at least two solutions,not one witness as uniqueness.No Konig,weighted or directed extension.
Step identifiers and dependencies
Rule: Mincover_original_empty_OR_multiple_boundary_not_uniqueness_guess · Uses: G001, S003