# Question 19585: Validity, Inclusion-Maximality and Global Maximum Are Separate [Return to catalogue page 98](https://ocme.evemisslab.com/en/questions/page/98/) [← Question derivation index](https://ocme.evemisslab.com/en/questions/) · [Original question batch](https://ocme.evemisslab.com/en/practice/batch-20261014-advance-20261106-r02-clique-and-independent-set-foundations/#q-20261014-advance-20261106-r02-clique-and-independent-set-0085) This teaching derivation has second-context AI mathematical and bilingual semantic review, limited to the model and assumptions stated in this question. It has no human review or new Lean proof and does not promote the original question or MKO to Canonical truth. R0038-19585 · q-20261014-advance-20261106-r02-clique-and-independent-set-0085 ## Original question and givens Use the complete finite loop-free simple undirected graph on Fin(6)={0,…,5} with canonical edges=[[0, 1], [0, 2], [0, 3], [0, 5], [1, 2], [3, 4]]. All graph vertices and edges are supplied, and exact searches are limited to n≤9. Candidate vertices=[3, 4], with distinct vertex indices. Check every pair, not a sample; an invalid candidate's size is not a certified lower bound. Requested kind=clique. Give (kind, vertices, valid, maximal, maximum_size, is_maximum, boundary). - G001 — Use the complete finite loop-free simple undirected graph on Fin(6)={0,…,5} with canonical edges=[[0, 1], [0, 2], [0, 3], [0, 5], [1, 2], [3, 4]]. All graph vertices and edges are supplied, and exact searches are limited to n≤9. Candidate vertices=[3, 4], with distinct vertex indices. Check every pair, not a sample; an invalid candidate's size is not a certified lower bound. Requested kind=clique. Give (kind, vertices, valid, maximal, maximum_size, is_maximum, boundary). ## Definition and scope Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate. - [mko-clique-and-independent-set](https://ocme.evemisslab.com/en/mko/mko-clique-and-independent-set/) ## Step-by-step derivation S001 · impliesBefore source operation=clique-maximal-vs-maximum;original snapshot and mathematics retained After explicit ordered source output fields=[kind, vertices, valid, maximal, maximum_size, is_maximum, boundary] Conditions: none Keep the historical interface marker in the original snapshot while listing ordered source fields here,without JavaScript or external lookup.Field labels are not mathematical evidence,and No retains the operation's claim scope. Step identifiers and dependenciesRule: source_ordered_interface_explicit_without_javascript · Uses: G001 S002 · impliesBefore complete ORIGINAL finite carrier Fin(6);ALL canonical simple undirected original edges=[[0, 1], [0, 2], [0, 3], [0, 5], [1, 2], [3, 4]] After all vertices and edge indices retained;extrema slice n<=9 includes empty carrier;complement reverses ONLY distinct-vertex adjacency Conditions: none Keep empty carriers and isolates.Complementation reverses adjacency only between distinct vertices,without adding loops.This is a bounded complete-graph certificate,not an extremal inference from a sampled subgraph. Step identifiers and dependenciesRule: clique_complete_graph_carrier_not_sample_or_loop_complement · Uses: G001, S001 S003 · impliesBefore RAW original candidate vertices=[3, 4];normalized SORTED vertices=[3, 4];ALL distinct candidate pair adjacency rows=[[3, 4, Yes]] After clique=Yes iff ALL pair entries true;independent=No iff ALL false;candidate size=2;duplicates were rejected,not deduplicated Conditions: none Audit every distinct candidate pair against the complete original edge list.Empty/singleton pair conditions are vacuously true.Size is only the candidate count;it gives the corresponding extremal lower bound only when valid,and a matching size does not repair an invalid candidate. Step identifiers and dependenciesRule: clique_every_pair_full_candidate_not_size_alone · Uses: G001, S002 S004 · impliesBefore valid original clique candidate=[3, 4];next actual outside vertex=0;ALL new candidate-to-vertex pair rows=[[3, 0, Yes], [4, 0, No]] After single-vertex extension preserves clique=No Conditions: none Once the original candidate is valid,a one-vertex extension requires checking the new vertex against every old one:a clique needs all edges and an independent set none.A sample of outside vertices is insufficient for maximality. Step identifiers and dependenciesRule: clique_each_outside_vertex_maximality_not_global_maximum · Uses: G001, S003 S005 · impliesBefore valid original clique candidate=[3, 4];next actual outside vertex=1;ALL new candidate-to-vertex pair rows=[[3, 1, No], [4, 1, No]] After single-vertex extension preserves clique=No Conditions: none Once the original candidate is valid,a one-vertex extension requires checking the new vertex against every old one:a clique needs all edges and an independent set none.A sample of outside vertices is insufficient for maximality. Step identifiers and dependenciesRule: clique_each_outside_vertex_maximality_not_global_maximum · Uses: G001, S004 S006 · impliesBefore valid original clique candidate=[3, 4];next actual outside vertex=2;ALL new candidate-to-vertex pair rows=[[3, 2, No], [4, 2, No]] After single-vertex extension preserves clique=No Conditions: none Once the original candidate is valid,a one-vertex extension requires checking the new vertex against every old one:a clique needs all edges and an independent set none.A sample of outside vertices is insufficient for maximality. Step identifiers and dependenciesRule: clique_each_outside_vertex_maximality_not_global_maximum · Uses: G001, S005 S007 · impliesBefore valid original clique candidate=[3, 4];next actual outside vertex=5;ALL new candidate-to-vertex pair rows=[[3, 5, No], [4, 5, No]] After single-vertex extension preserves clique=No Conditions: none Once the original candidate is valid,a one-vertex extension requires checking the new vertex against every old one:a clique needs all edges and an independent set none.A sample of outside vertices is insufficient for maximality. Step identifiers and dependenciesRule: clique_each_outside_vertex_maximality_not_global_maximum · Uses: G001, S006 S008 · impliesBefore next ORIGINAL vertex bitmask=0;decoded increasing vertices=[];ALL pair rows=[];previous best bitmasks=[0, 0] After clique=Yes;independent=Yes;size=0;strict-larger ONLY update gives best clique=[] at mask0,best independent=[] at mask0 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S007 S009 · impliesBefore next ORIGINAL vertex bitmask=1;decoded increasing vertices=[0];ALL pair rows=[];previous best bitmasks=[0, 0] After clique=Yes;independent=Yes;size=1;strict-larger ONLY update gives best clique=[0] at mask1,best independent=[0] at mask1 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S008 S010 · impliesBefore next ORIGINAL vertex bitmask=2;decoded increasing vertices=[1];ALL pair rows=[];previous best bitmasks=[1, 1] After clique=Yes;independent=Yes;size=1;strict-larger ONLY update gives best clique=[0] at mask1,best independent=[0] at mask1 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S009 S011 · impliesBefore next ORIGINAL vertex bitmask=3;decoded increasing vertices=[0, 1];ALL pair rows=[[0, 1, Yes]];previous best bitmasks=[1, 1] After clique=Yes;independent=No;size=2;strict-larger ONLY update gives best clique=[0, 1] at mask3,best independent=[0] at mask1 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S010 S012 · impliesBefore next ORIGINAL vertex bitmask=4;decoded increasing vertices=[2];ALL pair rows=[];previous best bitmasks=[3, 1] After clique=Yes;independent=Yes;size=1;strict-larger ONLY update gives best clique=[0, 1] at mask3,best independent=[0] at mask1 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S011 S013 · impliesBefore next ORIGINAL vertex bitmask=5;decoded increasing vertices=[0, 2];ALL pair rows=[[0, 2, Yes]];previous best bitmasks=[3, 1] After clique=Yes;independent=No;size=2;strict-larger ONLY update gives best clique=[0, 1] at mask3,best independent=[0] at mask1 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S012 S014 · impliesBefore next ORIGINAL vertex bitmask=6;decoded increasing vertices=[1, 2];ALL pair rows=[[1, 2, Yes]];previous best bitmasks=[3, 1] After clique=Yes;independent=No;size=2;strict-larger ONLY update gives best clique=[0, 1] at mask3,best independent=[0] at mask1 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S013 S015 · impliesBefore next ORIGINAL vertex bitmask=7;decoded increasing vertices=[0, 1, 2];ALL pair rows=[[0, 1, Yes], [0, 2, Yes], [1, 2, Yes]];previous best bitmasks=[3, 1] After clique=Yes;independent=No;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0] at mask1 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S014 S016 · impliesBefore next ORIGINAL vertex bitmask=8;decoded increasing vertices=[3];ALL pair rows=[];previous best bitmasks=[7, 1] After clique=Yes;independent=Yes;size=1;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0] at mask1 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S015 S017 · impliesBefore next ORIGINAL vertex bitmask=9;decoded increasing vertices=[0, 3];ALL pair rows=[[0, 3, Yes]];previous best bitmasks=[7, 1] After clique=Yes;independent=No;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0] at mask1 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S016 S018 · impliesBefore next ORIGINAL vertex bitmask=10;decoded increasing vertices=[1, 3];ALL pair rows=[[1, 3, No]];previous best bitmasks=[7, 1] After clique=No;independent=Yes;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S017 S019 · impliesBefore next ORIGINAL vertex bitmask=11;decoded increasing vertices=[0, 1, 3];ALL pair rows=[[0, 1, Yes], [0, 3, Yes], [1, 3, No]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S018 S020 · impliesBefore next ORIGINAL vertex bitmask=12;decoded increasing vertices=[2, 3];ALL pair rows=[[2, 3, No]];previous best bitmasks=[7, 10] After clique=No;independent=Yes;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S019 S021 · impliesBefore next ORIGINAL vertex bitmask=13;decoded increasing vertices=[0, 2, 3];ALL pair rows=[[0, 2, Yes], [0, 3, Yes], [2, 3, No]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S020 S022 · impliesBefore next ORIGINAL vertex bitmask=14;decoded increasing vertices=[1, 2, 3];ALL pair rows=[[1, 2, Yes], [1, 3, No], [2, 3, No]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S021 S023 · impliesBefore next ORIGINAL vertex bitmask=15;decoded increasing vertices=[0, 1, 2, 3];ALL pair rows=[[0, 1, Yes], [0, 2, Yes], [0, 3, Yes], [1, 2, Yes], [1, 3, No], [2, 3, No]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S022 S024 · impliesBefore next ORIGINAL vertex bitmask=16;decoded increasing vertices=[4];ALL pair rows=[];previous best bitmasks=[7, 10] After clique=Yes;independent=Yes;size=1;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S023 S025 · impliesBefore next ORIGINAL vertex bitmask=17;decoded increasing vertices=[0, 4];ALL pair rows=[[0, 4, No]];previous best bitmasks=[7, 10] After clique=No;independent=Yes;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S024 S026 · impliesBefore next ORIGINAL vertex bitmask=18;decoded increasing vertices=[1, 4];ALL pair rows=[[1, 4, No]];previous best bitmasks=[7, 10] After clique=No;independent=Yes;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S025 S027 · impliesBefore next ORIGINAL vertex bitmask=19;decoded increasing vertices=[0, 1, 4];ALL pair rows=[[0, 1, Yes], [0, 4, No], [1, 4, No]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S026 S028 · impliesBefore next ORIGINAL vertex bitmask=20;decoded increasing vertices=[2, 4];ALL pair rows=[[2, 4, No]];previous best bitmasks=[7, 10] After clique=No;independent=Yes;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S027 S029 · impliesBefore next ORIGINAL vertex bitmask=21;decoded increasing vertices=[0, 2, 4];ALL pair rows=[[0, 2, Yes], [0, 4, No], [2, 4, No]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S028 S030 · impliesBefore next ORIGINAL vertex bitmask=22;decoded increasing vertices=[1, 2, 4];ALL pair rows=[[1, 2, Yes], [1, 4, No], [2, 4, No]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S029 S031 · impliesBefore next ORIGINAL vertex bitmask=23;decoded increasing vertices=[0, 1, 2, 4];ALL pair rows=[[0, 1, Yes], [0, 2, Yes], [0, 4, No], [1, 2, Yes], [1, 4, No], [2, 4, No]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S030 S032 · impliesBefore next ORIGINAL vertex bitmask=24;decoded increasing vertices=[3, 4];ALL pair rows=[[3, 4, Yes]];previous best bitmasks=[7, 10] After clique=Yes;independent=No;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S031 S033 · impliesBefore next ORIGINAL vertex bitmask=25;decoded increasing vertices=[0, 3, 4];ALL pair rows=[[0, 3, Yes], [0, 4, No], [3, 4, Yes]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S032 S034 · impliesBefore next ORIGINAL vertex bitmask=26;decoded increasing vertices=[1, 3, 4];ALL pair rows=[[1, 3, No], [1, 4, No], [3, 4, Yes]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S033 S035 · impliesBefore next ORIGINAL vertex bitmask=27;decoded increasing vertices=[0, 1, 3, 4];ALL pair rows=[[0, 1, Yes], [0, 3, Yes], [0, 4, No], [1, 3, No], [1, 4, No], [3, 4, Yes]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S034 S036 · impliesBefore next ORIGINAL vertex bitmask=28;decoded increasing vertices=[2, 3, 4];ALL pair rows=[[2, 3, No], [2, 4, No], [3, 4, Yes]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S035 S037 · impliesBefore next ORIGINAL vertex bitmask=29;decoded increasing vertices=[0, 2, 3, 4];ALL pair rows=[[0, 2, Yes], [0, 3, Yes], [0, 4, No], [2, 3, No], [2, 4, No], [3, 4, Yes]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S036 S038 · impliesBefore next ORIGINAL vertex bitmask=30;decoded increasing vertices=[1, 2, 3, 4];ALL pair rows=[[1, 2, Yes], [1, 3, No], [1, 4, No], [2, 3, No], [2, 4, No], [3, 4, Yes]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S037 S039 · impliesBefore next ORIGINAL vertex bitmask=31;decoded increasing vertices=[0, 1, 2, 3, 4];ALL pair rows=[[0, 1, Yes], [0, 2, Yes], [0, 3, Yes], [0, 4, No], [1, 2, Yes], [1, 3, No], [1, 4, No], [2, 3, No], [2, 4, No], [3, 4, Yes]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=5;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S038 S040 · impliesBefore next ORIGINAL vertex bitmask=32;decoded increasing vertices=[5];ALL pair rows=[];previous best bitmasks=[7, 10] After clique=Yes;independent=Yes;size=1;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S039 S041 · impliesBefore next ORIGINAL vertex bitmask=33;decoded increasing vertices=[0, 5];ALL pair rows=[[0, 5, Yes]];previous best bitmasks=[7, 10] After clique=Yes;independent=No;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S040 S042 · impliesBefore next ORIGINAL vertex bitmask=34;decoded increasing vertices=[1, 5];ALL pair rows=[[1, 5, No]];previous best bitmasks=[7, 10] After clique=No;independent=Yes;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S041 S043 · impliesBefore next ORIGINAL vertex bitmask=35;decoded increasing vertices=[0, 1, 5];ALL pair rows=[[0, 1, Yes], [0, 5, Yes], [1, 5, No]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S042 S044 · impliesBefore next ORIGINAL vertex bitmask=36;decoded increasing vertices=[2, 5];ALL pair rows=[[2, 5, No]];previous best bitmasks=[7, 10] After clique=No;independent=Yes;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S043 S045 · impliesBefore next ORIGINAL vertex bitmask=37;decoded increasing vertices=[0, 2, 5];ALL pair rows=[[0, 2, Yes], [0, 5, Yes], [2, 5, No]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S044 S046 · impliesBefore next ORIGINAL vertex bitmask=38;decoded increasing vertices=[1, 2, 5];ALL pair rows=[[1, 2, Yes], [1, 5, No], [2, 5, No]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S045 S047 · impliesBefore next ORIGINAL vertex bitmask=39;decoded increasing vertices=[0, 1, 2, 5];ALL pair rows=[[0, 1, Yes], [0, 2, Yes], [0, 5, Yes], [1, 2, Yes], [1, 5, No], [2, 5, No]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S046 S048 · impliesBefore next ORIGINAL vertex bitmask=40;decoded increasing vertices=[3, 5];ALL pair rows=[[3, 5, No]];previous best bitmasks=[7, 10] After clique=No;independent=Yes;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S047 S049 · impliesBefore next ORIGINAL vertex bitmask=41;decoded increasing vertices=[0, 3, 5];ALL pair rows=[[0, 3, Yes], [0, 5, Yes], [3, 5, No]];previous best bitmasks=[7, 10] After clique=No;independent=No;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3] at mask10 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S048 S050 · impliesBefore next ORIGINAL vertex bitmask=42;decoded increasing vertices=[1, 3, 5];ALL pair rows=[[1, 3, No], [1, 5, No], [3, 5, No]];previous best bitmasks=[7, 10] After clique=No;independent=Yes;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S049 S051 · impliesBefore next ORIGINAL vertex bitmask=43;decoded increasing vertices=[0, 1, 3, 5];ALL pair rows=[[0, 1, Yes], [0, 3, Yes], [0, 5, Yes], [1, 3, No], [1, 5, No], [3, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=No;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S050 S052 · impliesBefore next ORIGINAL vertex bitmask=44;decoded increasing vertices=[2, 3, 5];ALL pair rows=[[2, 3, No], [2, 5, No], [3, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=Yes;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S051 S053 · impliesBefore next ORIGINAL vertex bitmask=45;decoded increasing vertices=[0, 2, 3, 5];ALL pair rows=[[0, 2, Yes], [0, 3, Yes], [0, 5, Yes], [2, 3, No], [2, 5, No], [3, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=No;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S052 S054 · impliesBefore next ORIGINAL vertex bitmask=46;decoded increasing vertices=[1, 2, 3, 5];ALL pair rows=[[1, 2, Yes], [1, 3, No], [1, 5, No], [2, 3, No], [2, 5, No], [3, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=No;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S053 S055 · impliesBefore next ORIGINAL vertex bitmask=47;decoded increasing vertices=[0, 1, 2, 3, 5];ALL pair rows=[[0, 1, Yes], [0, 2, Yes], [0, 3, Yes], [0, 5, Yes], [1, 2, Yes], [1, 3, No], [1, 5, No], [2, 3, No], [2, 5, No], [3, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=No;size=5;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S054 S056 · impliesBefore next ORIGINAL vertex bitmask=48;decoded increasing vertices=[4, 5];ALL pair rows=[[4, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=Yes;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S055 S057 · impliesBefore next ORIGINAL vertex bitmask=49;decoded increasing vertices=[0, 4, 5];ALL pair rows=[[0, 4, No], [0, 5, Yes], [4, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=No;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S056 S058 · impliesBefore next ORIGINAL vertex bitmask=50;decoded increasing vertices=[1, 4, 5];ALL pair rows=[[1, 4, No], [1, 5, No], [4, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=Yes;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S057 S059 · impliesBefore next ORIGINAL vertex bitmask=51;decoded increasing vertices=[0, 1, 4, 5];ALL pair rows=[[0, 1, Yes], [0, 4, No], [0, 5, Yes], [1, 4, No], [1, 5, No], [4, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=No;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S058 S060 · impliesBefore next ORIGINAL vertex bitmask=52;decoded increasing vertices=[2, 4, 5];ALL pair rows=[[2, 4, No], [2, 5, No], [4, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=Yes;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S059 S061 · impliesBefore next ORIGINAL vertex bitmask=53;decoded increasing vertices=[0, 2, 4, 5];ALL pair rows=[[0, 2, Yes], [0, 4, No], [0, 5, Yes], [2, 4, No], [2, 5, No], [4, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=No;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S060 S062 · impliesBefore next ORIGINAL vertex bitmask=54;decoded increasing vertices=[1, 2, 4, 5];ALL pair rows=[[1, 2, Yes], [1, 4, No], [1, 5, No], [2, 4, No], [2, 5, No], [4, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=No;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S061 S063 · impliesBefore next ORIGINAL vertex bitmask=55;decoded increasing vertices=[0, 1, 2, 4, 5];ALL pair rows=[[0, 1, Yes], [0, 2, Yes], [0, 4, No], [0, 5, Yes], [1, 2, Yes], [1, 4, No], [1, 5, No], [2, 4, No], [2, 5, No], [4, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=No;size=5;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S062 S064 · impliesBefore next ORIGINAL vertex bitmask=56;decoded increasing vertices=[3, 4, 5];ALL pair rows=[[3, 4, Yes], [3, 5, No], [4, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=No;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S063 S065 · impliesBefore next ORIGINAL vertex bitmask=57;decoded increasing vertices=[0, 3, 4, 5];ALL pair rows=[[0, 3, Yes], [0, 4, No], [0, 5, Yes], [3, 4, Yes], [3, 5, No], [4, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=No;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S064 S066 · impliesBefore next ORIGINAL vertex bitmask=58;decoded increasing vertices=[1, 3, 4, 5];ALL pair rows=[[1, 3, No], [1, 4, No], [1, 5, No], [3, 4, Yes], [3, 5, No], [4, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=No;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S065 S067 · impliesBefore next ORIGINAL vertex bitmask=59;decoded increasing vertices=[0, 1, 3, 4, 5];ALL pair rows=[[0, 1, Yes], [0, 3, Yes], [0, 4, No], [0, 5, Yes], [1, 3, No], [1, 4, No], [1, 5, No], [3, 4, Yes], [3, 5, No], [4, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=No;size=5;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S066 S068 · impliesBefore next ORIGINAL vertex bitmask=60;decoded increasing vertices=[2, 3, 4, 5];ALL pair rows=[[2, 3, No], [2, 4, No], [2, 5, No], [3, 4, Yes], [3, 5, No], [4, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=No;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S067 S069 · impliesBefore next ORIGINAL vertex bitmask=61;decoded increasing vertices=[0, 2, 3, 4, 5];ALL pair rows=[[0, 2, Yes], [0, 3, Yes], [0, 4, No], [0, 5, Yes], [2, 3, No], [2, 4, No], [2, 5, No], [3, 4, Yes], [3, 5, No], [4, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=No;size=5;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S068 S070 · impliesBefore next ORIGINAL vertex bitmask=62;decoded increasing vertices=[1, 2, 3, 4, 5];ALL pair rows=[[1, 2, Yes], [1, 3, No], [1, 4, No], [1, 5, No], [2, 3, No], [2, 4, No], [2, 5, No], [3, 4, Yes], [3, 5, No], [4, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=No;size=5;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S069 S071 · impliesBefore next ORIGINAL vertex bitmask=63;decoded increasing vertices=[0, 1, 2, 3, 4, 5];ALL pair rows=[[0, 1, Yes], [0, 2, Yes], [0, 3, Yes], [0, 4, No], [0, 5, Yes], [1, 2, Yes], [1, 3, No], [1, 4, No], [1, 5, No], [2, 3, No], [2, 4, No], [2, 5, No], [3, 4, Yes], [3, 5, No], [4, 5, No]];previous best bitmasks=[7, 42] After clique=No;independent=No;size=6;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[1, 3, 5] at mask42 Conditions: none Each mask denotes exactly one subset of the original carrier.Audit all pairs and update only for a strictly larger valid size.Ties retain the first numeric bitmask rather than lexicographically sorting vertex lists;sampling cannot replace a row. Step identifiers and dependenciesRule: clique_every_bitmask_exact_extrema_strict_tie_order · Uses: G001, S070 S072 · impliesBefore ALL masks0..63 processed once;best clique=[0, 1, 2] at mask7;best independent=[1, 3, 5] at mask42 After every possible subset covered;both actual witnesses valid;no valid subset larger;omega=3,alpha=3;FIRST numeric-mask ties retained Conditions: none Complete subset coverage gives global upper bounds,and the valid witnesses attain them.Exact extrema require both bounds;inclusion-maximality alone is insufficient.On an empty carrier both extrema are0. Step identifiers and dependenciesRule: clique_global_upper_and_attained_lower_not_maximal_only · Uses: G001, S071 S073 · impliesBefore actual kind=clique;ORIGINAL candidate=[3, 4];valid=Yes;ALL outside extension flags=[[0, No], [1, No], [2, No], [5, No]];GLOBAL maximum size=3 After maximal=Yes;maximum=valid AND matching global size=No;these are separate obligations Conditions: none Both properties are hereditary,so any larger valid superset would permit at least one single-vertex extension.This proves inclusion-maximality from all such checks.Global maximum still needs the exhaustive upper bound.An invalid candidate has neither status,even when its size matches the extremum. Step identifiers and dependenciesRule: clique_valid_maximal_maximum_three_obligations · Uses: G001, S072 ## Reverse checks - S073 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S072 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S071 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S070 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S069 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S068 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S067 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S066 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S065 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S064 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S063 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S062 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S061 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S060 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S059 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S058 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S057 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S056 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S055 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S054 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S053 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S052 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S051 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S050 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S049 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S048 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S047 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S046 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S045 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S044 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S043 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S042 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S041 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S040 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S039 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S038 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S037 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S036 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S035 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S034 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S033 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S032 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S031 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S030 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S029 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S028 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S027 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S026 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S025 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S024 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S023 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S022 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S021 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S020 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S019 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S018 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S017 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S016 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S015 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S014 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S013 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S012 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S011 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S010 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S009 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S008 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S007 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S006 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S005 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S004 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S003 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S002 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. ## Result (clique, [3, 4], Yes, Yes, 3, No, maximal_not_maximum_and_clique_only_lower_bounds_chromatic_number) The full substitutions and premise checks give the original answer; source identity,format and status are unchanged. ## This question review and source binding Review date: 2026-10-26 Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof. Source hashes and review receipts - input commit: 0f7be61e2c22317a4075561dc822c87d881a50db - original question SHA-256: 89f23782d87def97c32986b2dd622884b897fb2a96ade813946e247aa87eecb3 - candidate record SHA-256: ec9e6c4200d160a2e2070cb6dbb093966c8730a8fae6fa84f28480ce02b90de6 - semantic review receipt SHA-256: d165cad30849a3aba67390a59c572c0d965269d4b405e43df36da19e28d85612 - question-first witness SHA-256: c222ca47a07939c019865a1e4d9ce633205cdee68db92bf96a96f5683a62ebc7 - Lean: NOT_RUN · human review: NOT_PERFORMED [Same-source full JSON](https://ocme.evemisslab.com/data/question-derivations/questions/q-20261014-advance-20261106-r02-clique-and-independent-set-0085.json)