{
  "schema_version": "ocme-reviewed-question-reader-v1",
  "question_id": "q-20261014-advance-20261106-r02-clique-and-independent-set-0092",
  "pilot_number": "R0038-19592",
  "number": 19592,
  "family_id": "qf-mod37-clique-maximal-vs-maximum",
  "title": {
    "zh-Hant": "第 19592 題：Clique與獨立集",
    "en": "Question 19592: Validity, Inclusion-Maximality and Global Maximum Are Separate"
  },
  "original_question": {
    "schema_version": "ocme-question-v0.1",
    "id": "q-20261014-advance-20261106-r02-clique-and-independent-set-0092",
    "batch_id": "batch-20261014-advance-20261106-r02-clique-and-independent-set-foundations",
    "language": "zh-Hant",
    "source_mko_ids": [
      "mko-clique-and-independent-set"
    ],
    "title_zh": "Clique與獨立集",
    "stem_zh": "完整有限簡單圖與全部候選頂點對。操作=clique-maximal-vs-maximum；資料={\"n\":6,\"edges\":[[0,1],[0,2],[1,2],[1,5],[3,4]],\"vertices\":[3,4],\"kind\":\"clique\"}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。",
    "answer": {
      "kind": "expression",
      "value": "(clique, [3, 4], 是, 是, 3, 否, maximal_not_maximum_and_clique_only_lower_bounds_chromatic_number)",
      "explanation_zh": "Wave5封閉層核對=(clique, [3, 4], 是, 是, 3, 否, maximal_not_maximum_and_clique_only_lower_bounds_chromatic_number)；依完整明示資料獨立重算；clique逐對相鄰且independent set逐對不相鄰；單一候選只給extremum下界；maximal不等於maximum；maximum須全域上界或exhaustive證書且clique只給chi下界。"
    },
    "difficulty": {
      "band": "undergraduate_core",
      "level": 2,
      "skills": [
        "Clique與獨立集"
      ]
    },
    "variant": {
      "family_id": "qf-mod37-clique-maximal-vs-maximum",
      "seed": 202611062092,
      "parameters": {
        "n": 6,
        "edges": [
          [
            0,
            1
          ],
          [
            0,
            2
          ],
          [
            1,
            2
          ],
          [
            1,
            5
          ],
          [
            3,
            4
          ]
        ],
        "vertices": [
          3,
          4
        ],
        "kind": "clique",
        "domain": "Complete_finite_simple_graph_extrema",
        "operation": "clique-maximal-vs-maximum",
        "semantic_template": "qf-mod37-clique-maximal-vs-maximum/{\"edges\":[[0,1],[0,2],[1,2],[1,5],[3,4]],\"kind\":\"clique\",\"n\":6,\"vertices\":[3,4]}"
      }
    },
    "verification": {
      "status": "candidate",
      "checks": [
        "producer_exact_finite_or_symbolic_model",
        "producer_source_snapshot_check",
        "producer_substantive_template_deduplication",
        "producer_json_schema"
      ],
      "warning_zh": "候選須主端重算；不構成人工審定、greedy最優性、maximal等於maximum、單一theta無偏、variance推MSE、Fermat converse、有限搜尋完整Diophantine解、唯一quotient代表元、Lean或Evidence。"
    },
    "provenance": {
      "generator_role": "question_producer",
      "generator_model": "model_unknown",
      "generated_at": "2026-10-14",
      "contract_version": "ocme-question-factory-v0.1"
    }
  },
  "original_english_edition": {
    "schema_version": "ocme-question-localization-v0.1",
    "question_id": "q-20261014-advance-20261106-r02-clique-and-independent-set-0092",
    "batch_id": "batch-20261014-advance-20261106-r02-clique-and-independent-set-foundations",
    "locale": "en",
    "translation_state": "ai_candidate",
    "source": {
      "question_sha256": "498afc931ff4f23af2ce70fe7dfe567d26166b1782d18c69495b56927f5f03ef",
      "family_id": "qf-mod37-clique-maximal-vs-maximum",
      "seed": 202611062092,
      "semantic_template": "qf-mod37-clique-maximal-vs-maximum/{\"edges\":[[0,1],[0,2],[1,2],[1,5],[3,4]],\"kind\":\"clique\",\"n\":6,\"vertices\":[3,4]}"
    },
    "fields": {
      "title": "Validity, Inclusion-Maximality and Global Maximum Are Separate",
      "stem": "Use the complete finite loop-free simple undirected graph on Fin(6)={0,…,5} with canonical edges=[[0, 1], [0, 2], [1, 2], [1, 5], [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).",
      "answer": {
        "kind": "expression",
        "value": "(clique, [3, 4], Yes, Yes, 3, No, maximal_not_maximum_and_clique_only_lower_bounds_chromatic_number)",
        "explanation": "A valid candidate is maximal if no outside vertex can be added while preserving the property. It is maximum only if valid and its size equals the independently computed global maximum. An invalid candidate cannot become maximum by matching the maximum size. A clique gives only a chromatic lower bound in general. The exact result, retaining the requested order, is (clique, [3, 4], Yes, Yes, 3, No, maximal_not_maximum_and_clique_only_lower_bounds_chromatic_number)."
      },
      "skills": [
        "Validity, Inclusion-Maximality and Global Maximum Are Separate"
      ],
      "verification_warning": "This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."
    }
  },
  "givens": [
    {
      "id": "G001",
      "text": {
        "zh-Hant": "完整有限簡單圖與全部候選頂點對。操作=clique-maximal-vs-maximum；資料={\"n\":6,\"edges\":[[0,1],[0,2],[1,2],[1,5],[3,4]],\"vertices\":[3,4],\"kind\":\"clique\"}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。",
        "en": "Use the complete finite loop-free simple undirected graph on Fin(6)={0,…,5} with canonical edges=[[0, 1], [0, 2], [1, 2], [1, 5], [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)."
      }
    }
  ],
  "steps": [
    {
      "id": "S001",
      "uses": [
        "G001"
      ],
      "before": "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]",
      "relation": "implies",
      "rule_id": "source_ordered_interface_explicit_without_javascript",
      "conditions": [],
      "explanation": {
        "zh-Hant": "原題快照保留歷史介面標記；本頁直接列來源欄位順序，不需JavaScript或外部表。欄位標籤不自動成為數學證據，No依各題聲稱範圍解讀。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S002",
      "uses": [
        "G001",
        "S001"
      ],
      "before": "complete ORIGINAL finite carrier Fin(6);ALL canonical simple undirected original edges=[[0, 1], [0, 2], [1, 2], [1, 5], [3, 4]]",
      "after": "all vertices and edge indices retained;extrema slice n<=9 includes empty carrier;complement reverses ONLY distinct-vertex adjacency",
      "relation": "implies",
      "rule_id": "clique_complete_graph_carrier_not_sample_or_loop_complement",
      "conditions": [],
      "explanation": {
        "zh-Hant": "空圖與孤立點都保留；complement只在不同頂點間反轉有無邊，不新增自環。這是bounded完整圖證書，不從某個局部子圖推原圖極值。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S003",
      "uses": [
        "G001",
        "S002"
      ],
      "before": "RAW original candidate vertices=[3, 4];normalized SORTED vertices=[3, 4];ALL distinct candidate pair adjacency rows=[[3, 4, 是]]",
      "after": "clique=是 iff ALL pair entries true;independent=否 iff ALL false;candidate size=2;duplicates were rejected,not deduplicated",
      "relation": "implies",
      "rule_id": "clique_every_pair_full_candidate_not_size_alone",
      "conditions": [],
      "explanation": {
        "zh-Hant": "逐候選全部不同頂點對核完整原邊表；空／單點候選的pair條件依全稱空真。size是候選大小，只有對應valid才給真正extremum下界，不因大小相等就修好無效候選。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S004",
      "uses": [
        "G001",
        "S003"
      ],
      "before": "valid original clique candidate=[3, 4];next actual outside vertex=0;ALL new candidate-to-vertex pair rows=[[3, 0, 否], [4, 0, 否]]",
      "after": "single-vertex extension preserves clique=否",
      "relation": "implies",
      "rule_id": "clique_each_outside_vertex_maximality_not_global_maximum",
      "conditions": [],
      "explanation": {
        "zh-Hant": "原候選已合格，延伸只需核新頂點對每個舊頂點；clique要全相鄰，independent要全不相鄰。只查一些外點不足maximal證書。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S005",
      "uses": [
        "G001",
        "S004"
      ],
      "before": "valid original clique candidate=[3, 4];next actual outside vertex=1;ALL new candidate-to-vertex pair rows=[[3, 1, 否], [4, 1, 否]]",
      "after": "single-vertex extension preserves clique=否",
      "relation": "implies",
      "rule_id": "clique_each_outside_vertex_maximality_not_global_maximum",
      "conditions": [],
      "explanation": {
        "zh-Hant": "原候選已合格，延伸只需核新頂點對每個舊頂點；clique要全相鄰，independent要全不相鄰。只查一些外點不足maximal證書。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S006",
      "uses": [
        "G001",
        "S005"
      ],
      "before": "valid original clique candidate=[3, 4];next actual outside vertex=2;ALL new candidate-to-vertex pair rows=[[3, 2, 否], [4, 2, 否]]",
      "after": "single-vertex extension preserves clique=否",
      "relation": "implies",
      "rule_id": "clique_each_outside_vertex_maximality_not_global_maximum",
      "conditions": [],
      "explanation": {
        "zh-Hant": "原候選已合格，延伸只需核新頂點對每個舊頂點；clique要全相鄰，independent要全不相鄰。只查一些外點不足maximal證書。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S007",
      "uses": [
        "G001",
        "S006"
      ],
      "before": "valid original clique candidate=[3, 4];next actual outside vertex=5;ALL new candidate-to-vertex pair rows=[[3, 5, 否], [4, 5, 否]]",
      "after": "single-vertex extension preserves clique=否",
      "relation": "implies",
      "rule_id": "clique_each_outside_vertex_maximality_not_global_maximum",
      "conditions": [],
      "explanation": {
        "zh-Hant": "原候選已合格，延伸只需核新頂點對每個舊頂點；clique要全相鄰，independent要全不相鄰。只查一些外點不足maximal證書。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S008",
      "uses": [
        "G001",
        "S007"
      ],
      "before": "next ORIGINAL vertex bitmask=0;decoded increasing vertices=[];ALL pair rows=[];previous best bitmasks=[0, 0]",
      "after": "clique=是;independent=是;size=0;strict-larger ONLY update gives best clique=[] at mask0,best independent=[] at mask0",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S009",
      "uses": [
        "G001",
        "S008"
      ],
      "before": "next ORIGINAL vertex bitmask=1;decoded increasing vertices=[0];ALL pair rows=[];previous best bitmasks=[0, 0]",
      "after": "clique=是;independent=是;size=1;strict-larger ONLY update gives best clique=[0] at mask1,best independent=[0] at mask1",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S010",
      "uses": [
        "G001",
        "S009"
      ],
      "before": "next ORIGINAL vertex bitmask=2;decoded increasing vertices=[1];ALL pair rows=[];previous best bitmasks=[1, 1]",
      "after": "clique=是;independent=是;size=1;strict-larger ONLY update gives best clique=[0] at mask1,best independent=[0] at mask1",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S011",
      "uses": [
        "G001",
        "S010"
      ],
      "before": "next ORIGINAL vertex bitmask=3;decoded increasing vertices=[0, 1];ALL pair rows=[[0, 1, 是]];previous best bitmasks=[1, 1]",
      "after": "clique=是;independent=否;size=2;strict-larger ONLY update gives best clique=[0, 1] at mask3,best independent=[0] at mask1",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S012",
      "uses": [
        "G001",
        "S011"
      ],
      "before": "next ORIGINAL vertex bitmask=4;decoded increasing vertices=[2];ALL pair rows=[];previous best bitmasks=[3, 1]",
      "after": "clique=是;independent=是;size=1;strict-larger ONLY update gives best clique=[0, 1] at mask3,best independent=[0] at mask1",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S013",
      "uses": [
        "G001",
        "S012"
      ],
      "before": "next ORIGINAL vertex bitmask=5;decoded increasing vertices=[0, 2];ALL pair rows=[[0, 2, 是]];previous best bitmasks=[3, 1]",
      "after": "clique=是;independent=否;size=2;strict-larger ONLY update gives best clique=[0, 1] at mask3,best independent=[0] at mask1",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S014",
      "uses": [
        "G001",
        "S013"
      ],
      "before": "next ORIGINAL vertex bitmask=6;decoded increasing vertices=[1, 2];ALL pair rows=[[1, 2, 是]];previous best bitmasks=[3, 1]",
      "after": "clique=是;independent=否;size=2;strict-larger ONLY update gives best clique=[0, 1] at mask3,best independent=[0] at mask1",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S015",
      "uses": [
        "G001",
        "S014"
      ],
      "before": "next ORIGINAL vertex bitmask=7;decoded increasing vertices=[0, 1, 2];ALL pair rows=[[0, 1, 是], [0, 2, 是], [1, 2, 是]];previous best bitmasks=[3, 1]",
      "after": "clique=是;independent=否;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0] at mask1",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S016",
      "uses": [
        "G001",
        "S015"
      ],
      "before": "next ORIGINAL vertex bitmask=8;decoded increasing vertices=[3];ALL pair rows=[];previous best bitmasks=[7, 1]",
      "after": "clique=是;independent=是;size=1;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0] at mask1",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S017",
      "uses": [
        "G001",
        "S016"
      ],
      "before": "next ORIGINAL vertex bitmask=9;decoded increasing vertices=[0, 3];ALL pair rows=[[0, 3, 否]];previous best bitmasks=[7, 1]",
      "after": "clique=否;independent=是;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S018",
      "uses": [
        "G001",
        "S017"
      ],
      "before": "next ORIGINAL vertex bitmask=10;decoded increasing vertices=[1, 3];ALL pair rows=[[1, 3, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=是;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S019",
      "uses": [
        "G001",
        "S018"
      ],
      "before": "next ORIGINAL vertex bitmask=11;decoded increasing vertices=[0, 1, 3];ALL pair rows=[[0, 1, 是], [0, 3, 否], [1, 3, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S020",
      "uses": [
        "G001",
        "S019"
      ],
      "before": "next ORIGINAL vertex bitmask=12;decoded increasing vertices=[2, 3];ALL pair rows=[[2, 3, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=是;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S021",
      "uses": [
        "G001",
        "S020"
      ],
      "before": "next ORIGINAL vertex bitmask=13;decoded increasing vertices=[0, 2, 3];ALL pair rows=[[0, 2, 是], [0, 3, 否], [2, 3, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S022",
      "uses": [
        "G001",
        "S021"
      ],
      "before": "next ORIGINAL vertex bitmask=14;decoded increasing vertices=[1, 2, 3];ALL pair rows=[[1, 2, 是], [1, 3, 否], [2, 3, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S023",
      "uses": [
        "G001",
        "S022"
      ],
      "before": "next ORIGINAL vertex bitmask=15;decoded increasing vertices=[0, 1, 2, 3];ALL pair rows=[[0, 1, 是], [0, 2, 是], [0, 3, 否], [1, 2, 是], [1, 3, 否], [2, 3, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S024",
      "uses": [
        "G001",
        "S023"
      ],
      "before": "next ORIGINAL vertex bitmask=16;decoded increasing vertices=[4];ALL pair rows=[];previous best bitmasks=[7, 9]",
      "after": "clique=是;independent=是;size=1;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S025",
      "uses": [
        "G001",
        "S024"
      ],
      "before": "next ORIGINAL vertex bitmask=17;decoded increasing vertices=[0, 4];ALL pair rows=[[0, 4, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=是;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S026",
      "uses": [
        "G001",
        "S025"
      ],
      "before": "next ORIGINAL vertex bitmask=18;decoded increasing vertices=[1, 4];ALL pair rows=[[1, 4, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=是;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S027",
      "uses": [
        "G001",
        "S026"
      ],
      "before": "next ORIGINAL vertex bitmask=19;decoded increasing vertices=[0, 1, 4];ALL pair rows=[[0, 1, 是], [0, 4, 否], [1, 4, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S028",
      "uses": [
        "G001",
        "S027"
      ],
      "before": "next ORIGINAL vertex bitmask=20;decoded increasing vertices=[2, 4];ALL pair rows=[[2, 4, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=是;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S029",
      "uses": [
        "G001",
        "S028"
      ],
      "before": "next ORIGINAL vertex bitmask=21;decoded increasing vertices=[0, 2, 4];ALL pair rows=[[0, 2, 是], [0, 4, 否], [2, 4, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S030",
      "uses": [
        "G001",
        "S029"
      ],
      "before": "next ORIGINAL vertex bitmask=22;decoded increasing vertices=[1, 2, 4];ALL pair rows=[[1, 2, 是], [1, 4, 否], [2, 4, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S031",
      "uses": [
        "G001",
        "S030"
      ],
      "before": "next ORIGINAL vertex bitmask=23;decoded increasing vertices=[0, 1, 2, 4];ALL pair rows=[[0, 1, 是], [0, 2, 是], [0, 4, 否], [1, 2, 是], [1, 4, 否], [2, 4, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S032",
      "uses": [
        "G001",
        "S031"
      ],
      "before": "next ORIGINAL vertex bitmask=24;decoded increasing vertices=[3, 4];ALL pair rows=[[3, 4, 是]];previous best bitmasks=[7, 9]",
      "after": "clique=是;independent=否;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S033",
      "uses": [
        "G001",
        "S032"
      ],
      "before": "next ORIGINAL vertex bitmask=25;decoded increasing vertices=[0, 3, 4];ALL pair rows=[[0, 3, 否], [0, 4, 否], [3, 4, 是]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S034",
      "uses": [
        "G001",
        "S033"
      ],
      "before": "next ORIGINAL vertex bitmask=26;decoded increasing vertices=[1, 3, 4];ALL pair rows=[[1, 3, 否], [1, 4, 否], [3, 4, 是]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S035",
      "uses": [
        "G001",
        "S034"
      ],
      "before": "next ORIGINAL vertex bitmask=27;decoded increasing vertices=[0, 1, 3, 4];ALL pair rows=[[0, 1, 是], [0, 3, 否], [0, 4, 否], [1, 3, 否], [1, 4, 否], [3, 4, 是]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S036",
      "uses": [
        "G001",
        "S035"
      ],
      "before": "next ORIGINAL vertex bitmask=28;decoded increasing vertices=[2, 3, 4];ALL pair rows=[[2, 3, 否], [2, 4, 否], [3, 4, 是]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S037",
      "uses": [
        "G001",
        "S036"
      ],
      "before": "next ORIGINAL vertex bitmask=29;decoded increasing vertices=[0, 2, 3, 4];ALL pair rows=[[0, 2, 是], [0, 3, 否], [0, 4, 否], [2, 3, 否], [2, 4, 否], [3, 4, 是]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S038",
      "uses": [
        "G001",
        "S037"
      ],
      "before": "next ORIGINAL vertex bitmask=30;decoded increasing vertices=[1, 2, 3, 4];ALL pair rows=[[1, 2, 是], [1, 3, 否], [1, 4, 否], [2, 3, 否], [2, 4, 否], [3, 4, 是]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S039",
      "uses": [
        "G001",
        "S038"
      ],
      "before": "next ORIGINAL vertex bitmask=31;decoded increasing vertices=[0, 1, 2, 3, 4];ALL pair rows=[[0, 1, 是], [0, 2, 是], [0, 3, 否], [0, 4, 否], [1, 2, 是], [1, 3, 否], [1, 4, 否], [2, 3, 否], [2, 4, 否], [3, 4, 是]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=5;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S040",
      "uses": [
        "G001",
        "S039"
      ],
      "before": "next ORIGINAL vertex bitmask=32;decoded increasing vertices=[5];ALL pair rows=[];previous best bitmasks=[7, 9]",
      "after": "clique=是;independent=是;size=1;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S041",
      "uses": [
        "G001",
        "S040"
      ],
      "before": "next ORIGINAL vertex bitmask=33;decoded increasing vertices=[0, 5];ALL pair rows=[[0, 5, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=是;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S042",
      "uses": [
        "G001",
        "S041"
      ],
      "before": "next ORIGINAL vertex bitmask=34;decoded increasing vertices=[1, 5];ALL pair rows=[[1, 5, 是]];previous best bitmasks=[7, 9]",
      "after": "clique=是;independent=否;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S043",
      "uses": [
        "G001",
        "S042"
      ],
      "before": "next ORIGINAL vertex bitmask=35;decoded increasing vertices=[0, 1, 5];ALL pair rows=[[0, 1, 是], [0, 5, 否], [1, 5, 是]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S044",
      "uses": [
        "G001",
        "S043"
      ],
      "before": "next ORIGINAL vertex bitmask=36;decoded increasing vertices=[2, 5];ALL pair rows=[[2, 5, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=是;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S045",
      "uses": [
        "G001",
        "S044"
      ],
      "before": "next ORIGINAL vertex bitmask=37;decoded increasing vertices=[0, 2, 5];ALL pair rows=[[0, 2, 是], [0, 5, 否], [2, 5, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S046",
      "uses": [
        "G001",
        "S045"
      ],
      "before": "next ORIGINAL vertex bitmask=38;decoded increasing vertices=[1, 2, 5];ALL pair rows=[[1, 2, 是], [1, 5, 是], [2, 5, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S047",
      "uses": [
        "G001",
        "S046"
      ],
      "before": "next ORIGINAL vertex bitmask=39;decoded increasing vertices=[0, 1, 2, 5];ALL pair rows=[[0, 1, 是], [0, 2, 是], [0, 5, 否], [1, 2, 是], [1, 5, 是], [2, 5, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=否;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S048",
      "uses": [
        "G001",
        "S047"
      ],
      "before": "next ORIGINAL vertex bitmask=40;decoded increasing vertices=[3, 5];ALL pair rows=[[3, 5, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=是;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3] at mask9",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S049",
      "uses": [
        "G001",
        "S048"
      ],
      "before": "next ORIGINAL vertex bitmask=41;decoded increasing vertices=[0, 3, 5];ALL pair rows=[[0, 3, 否], [0, 5, 否], [3, 5, 否]];previous best bitmasks=[7, 9]",
      "after": "clique=否;independent=是;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S050",
      "uses": [
        "G001",
        "S049"
      ],
      "before": "next ORIGINAL vertex bitmask=42;decoded increasing vertices=[1, 3, 5];ALL pair rows=[[1, 3, 否], [1, 5, 是], [3, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S051",
      "uses": [
        "G001",
        "S050"
      ],
      "before": "next ORIGINAL vertex bitmask=43;decoded increasing vertices=[0, 1, 3, 5];ALL pair rows=[[0, 1, 是], [0, 3, 否], [0, 5, 否], [1, 3, 否], [1, 5, 是], [3, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S052",
      "uses": [
        "G001",
        "S051"
      ],
      "before": "next ORIGINAL vertex bitmask=44;decoded increasing vertices=[2, 3, 5];ALL pair rows=[[2, 3, 否], [2, 5, 否], [3, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=是;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S053",
      "uses": [
        "G001",
        "S052"
      ],
      "before": "next ORIGINAL vertex bitmask=45;decoded increasing vertices=[0, 2, 3, 5];ALL pair rows=[[0, 2, 是], [0, 3, 否], [0, 5, 否], [2, 3, 否], [2, 5, 否], [3, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S054",
      "uses": [
        "G001",
        "S053"
      ],
      "before": "next ORIGINAL vertex bitmask=46;decoded increasing vertices=[1, 2, 3, 5];ALL pair rows=[[1, 2, 是], [1, 3, 否], [1, 5, 是], [2, 3, 否], [2, 5, 否], [3, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S055",
      "uses": [
        "G001",
        "S054"
      ],
      "before": "next ORIGINAL vertex bitmask=47;decoded increasing vertices=[0, 1, 2, 3, 5];ALL pair rows=[[0, 1, 是], [0, 2, 是], [0, 3, 否], [0, 5, 否], [1, 2, 是], [1, 3, 否], [1, 5, 是], [2, 3, 否], [2, 5, 否], [3, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=5;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S056",
      "uses": [
        "G001",
        "S055"
      ],
      "before": "next ORIGINAL vertex bitmask=48;decoded increasing vertices=[4, 5];ALL pair rows=[[4, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=是;size=2;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S057",
      "uses": [
        "G001",
        "S056"
      ],
      "before": "next ORIGINAL vertex bitmask=49;decoded increasing vertices=[0, 4, 5];ALL pair rows=[[0, 4, 否], [0, 5, 否], [4, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=是;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S058",
      "uses": [
        "G001",
        "S057"
      ],
      "before": "next ORIGINAL vertex bitmask=50;decoded increasing vertices=[1, 4, 5];ALL pair rows=[[1, 4, 否], [1, 5, 是], [4, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S059",
      "uses": [
        "G001",
        "S058"
      ],
      "before": "next ORIGINAL vertex bitmask=51;decoded increasing vertices=[0, 1, 4, 5];ALL pair rows=[[0, 1, 是], [0, 4, 否], [0, 5, 否], [1, 4, 否], [1, 5, 是], [4, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S060",
      "uses": [
        "G001",
        "S059"
      ],
      "before": "next ORIGINAL vertex bitmask=52;decoded increasing vertices=[2, 4, 5];ALL pair rows=[[2, 4, 否], [2, 5, 否], [4, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=是;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S061",
      "uses": [
        "G001",
        "S060"
      ],
      "before": "next ORIGINAL vertex bitmask=53;decoded increasing vertices=[0, 2, 4, 5];ALL pair rows=[[0, 2, 是], [0, 4, 否], [0, 5, 否], [2, 4, 否], [2, 5, 否], [4, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S062",
      "uses": [
        "G001",
        "S061"
      ],
      "before": "next ORIGINAL vertex bitmask=54;decoded increasing vertices=[1, 2, 4, 5];ALL pair rows=[[1, 2, 是], [1, 4, 否], [1, 5, 是], [2, 4, 否], [2, 5, 否], [4, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S063",
      "uses": [
        "G001",
        "S062"
      ],
      "before": "next ORIGINAL vertex bitmask=55;decoded increasing vertices=[0, 1, 2, 4, 5];ALL pair rows=[[0, 1, 是], [0, 2, 是], [0, 4, 否], [0, 5, 否], [1, 2, 是], [1, 4, 否], [1, 5, 是], [2, 4, 否], [2, 5, 否], [4, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=5;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S064",
      "uses": [
        "G001",
        "S063"
      ],
      "before": "next ORIGINAL vertex bitmask=56;decoded increasing vertices=[3, 4, 5];ALL pair rows=[[3, 4, 是], [3, 5, 否], [4, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=3;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S065",
      "uses": [
        "G001",
        "S064"
      ],
      "before": "next ORIGINAL vertex bitmask=57;decoded increasing vertices=[0, 3, 4, 5];ALL pair rows=[[0, 3, 否], [0, 4, 否], [0, 5, 否], [3, 4, 是], [3, 5, 否], [4, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S066",
      "uses": [
        "G001",
        "S065"
      ],
      "before": "next ORIGINAL vertex bitmask=58;decoded increasing vertices=[1, 3, 4, 5];ALL pair rows=[[1, 3, 否], [1, 4, 否], [1, 5, 是], [3, 4, 是], [3, 5, 否], [4, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S067",
      "uses": [
        "G001",
        "S066"
      ],
      "before": "next ORIGINAL vertex bitmask=59;decoded increasing vertices=[0, 1, 3, 4, 5];ALL pair rows=[[0, 1, 是], [0, 3, 否], [0, 4, 否], [0, 5, 否], [1, 3, 否], [1, 4, 否], [1, 5, 是], [3, 4, 是], [3, 5, 否], [4, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=5;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S068",
      "uses": [
        "G001",
        "S067"
      ],
      "before": "next ORIGINAL vertex bitmask=60;decoded increasing vertices=[2, 3, 4, 5];ALL pair rows=[[2, 3, 否], [2, 4, 否], [2, 5, 否], [3, 4, 是], [3, 5, 否], [4, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=4;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S069",
      "uses": [
        "G001",
        "S068"
      ],
      "before": "next ORIGINAL vertex bitmask=61;decoded increasing vertices=[0, 2, 3, 4, 5];ALL pair rows=[[0, 2, 是], [0, 3, 否], [0, 4, 否], [0, 5, 否], [2, 3, 否], [2, 4, 否], [2, 5, 否], [3, 4, 是], [3, 5, 否], [4, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=5;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S070",
      "uses": [
        "G001",
        "S069"
      ],
      "before": "next ORIGINAL vertex bitmask=62;decoded increasing vertices=[1, 2, 3, 4, 5];ALL pair rows=[[1, 2, 是], [1, 3, 否], [1, 4, 否], [1, 5, 是], [2, 3, 否], [2, 4, 否], [2, 5, 否], [3, 4, 是], [3, 5, 否], [4, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=5;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S071",
      "uses": [
        "G001",
        "S070"
      ],
      "before": "next ORIGINAL vertex bitmask=63;decoded increasing vertices=[0, 1, 2, 3, 4, 5];ALL pair rows=[[0, 1, 是], [0, 2, 是], [0, 3, 否], [0, 4, 否], [0, 5, 否], [1, 2, 是], [1, 3, 否], [1, 4, 否], [1, 5, 是], [2, 3, 否], [2, 4, 否], [2, 5, 否], [3, 4, 是], [3, 5, 否], [4, 5, 否]];previous best bitmasks=[7, 41]",
      "after": "clique=否;independent=否;size=6;strict-larger ONLY update gives best clique=[0, 1, 2] at mask7,best independent=[0, 3, 5] at mask41",
      "relation": "implies",
      "rule_id": "clique_every_bitmask_exact_extrema_strict_tie_order",
      "conditions": [],
      "explanation": {
        "zh-Hant": "每個mask恰表示一個原carrier子集，逐所有pair判兩種資格。只在嚴格更大時更新，因此同大小保最先數字bitmask，不重新按頂點列表lex排序；本列不可用抽樣替代。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S072",
      "uses": [
        "G001",
        "S071"
      ],
      "before": "ALL masks0..63 processed once;best clique=[0, 1, 2] at mask7;best independent=[0, 3, 5] at mask41",
      "after": "every possible subset covered;both actual witnesses valid;no valid subset larger;omega=3,alpha=3;FIRST numeric-mask ties retained",
      "relation": "implies",
      "rule_id": "clique_global_upper_and_attained_lower_not_maximal_only",
      "conditions": [],
      "explanation": {
        "zh-Hant": "完整枚舉覆蓋全部候選給全域上界，實際合格witness達到此界給下界。二者相等才是maximum；不能拿無法加一個頂點的maximal代替。空carrier的兩個極值都是0。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S073",
      "uses": [
        "G001",
        "S072"
      ],
      "before": "actual kind=clique;ORIGINAL candidate=[3, 4];valid=是;ALL outside extension flags=[[0, 否], [1, 否], [2, 否], [5, 否]];GLOBAL maximum size=3",
      "after": "maximal=是;maximum=valid AND matching global size=否;these are separate obligations",
      "relation": "implies",
      "rule_id": "clique_valid_maximal_maximum_three_obligations",
      "conditions": [],
      "explanation": {
        "zh-Hant": "此兩種性質都對子集封閉，所以若有任何更大的合格superset，就有一個外頂點可先加；因此逐全部單點延伸足證inclusion-maximal。全域maximum仍須枚舉上界；無效候選兩者都False，即使大小碰巧等極值也一樣。",
        "en": "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."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    }
  ],
  "math_model": {
    "result": [
      "clique",
      [
        3,
        4
      ],
      true,
      true,
      3,
      false,
      "maximal_not_maximum_and_clique_only_lower_bounds_chromatic_number"
    ]
  },
  "conclusion": {
    "canonical_value": "(clique, [3, 4], 是, 是, 3, 否, maximal_not_maximum_and_clique_only_lower_bounds_chromatic_number)",
    "explanation": {
      "zh-Hant": "依上列完整代值及條件核對得到原題答案；原題編號、格式與狀態保持不變。",
      "en": "The full substitutions and premise checks give the original answer; source identity,format and status are unchanged."
    }
  },
  "definition_note": {
    "zh-Hant": "沿用原題明示的論域、假設與來源 MKO 定義。本題已完成第二對話數理與中英語義覆核，並由原始參數逐題獨立重算模型、答案與每個算術步驟；原題仍為 candidate。",
    "en": "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."
  },
  "source": {
    "input_commit": "0f7be61e2c22317a4075561dc822c87d881a50db",
    "question_binding": {
      "batch_id": "batch-20261014-advance-20261106-r02-clique-and-independent-set-foundations",
      "batch_path": "public/data/questions/batches/batch-20261014-advance-20261106-r02-clique-and-independent-set-foundations/questions.jsonl",
      "batch_sha256": "56b85f706a53096428b5d249690dca1095a7f84cdf47ee09960da50b16724001",
      "original_line": 92,
      "original_line_sha256": "dfa2c1daa566702d6cabf22c546922e4a7830d141fea2655bcf29918ef0e61c6",
      "question_compact_sha256": "498afc931ff4f23af2ce70fe7dfe567d26166b1782d18c69495b56927f5f03ef",
      "english_row_compact_sha256": "d8acdd6b3c0a3d647a70e2a48abf0a0b6a1577a4702efdde5d68fd7e92ed0bc3",
      "english_manifest_path": "public/data/i18n/editions/batch-20261014-advance-20261106-r02-clique-and-independent-set-foundations.en.json",
      "english_rows_path": "public/data/i18n/questions/batch-20261014-advance-20261106-r02-clique-and-independent-set-foundations.en.jsonl"
    },
    "mko_bindings": {
      "mko-clique-and-independent-set": {
        "sha256": "9477f7b7e5b3af0c1c270f6f42b508ec6142c458868b507c850d56c9a5b946fe",
        "english_sha256": "7d32b2cc13a3ecb7fe4cb5c14409d97ce2b9decc8176de4b5d780f0c601b22ef",
        "original_path": "public/data/mko/clique-and-independent-set.json",
        "english_path": "public/data/i18n/editions/mko-clique-and-independent-set.en.json"
      }
    },
    "selected_manifest_sha256": "5233edba9654a6cffd8b6b2d83c932f82ded15f9c0b7c733bd049943e672acff",
    "selected_part_sha256": "9ed24319f1e4df0dd58d2a2dfbf2846def03f020cb5ebf70613fab53c9165f11",
    "original_candidate_sha256": "20eba8c088685405a804cfaef7aabf92eafb13521e07906fbe15ee5a857fffbd",
    "original_candidate_line_sha256": "20eba8c088685405a804cfaef7aabf92eafb13521e07906fbe15ee5a857fffbd"
  },
  "historical_source_state": {
    "review_state": {
      "derivation": "candidate_authored_and_locally_checked",
      "source_question_state": "candidate",
      "independent_AI_or_human_review": "NOT_PERFORMED",
      "formalization": "not_formalized",
      "Lean": "NOT_RUN"
    },
    "scope_note": {
      "zh-Hant": "來源綁定教學推導候選；精確核對不等於獨立AI／人工審查或一般形式證明。原題、答案、MKO、公式、AST與歷史不變。",
      "en": "Source-bound pedagogical derivation candidate.Exact checking is not independent AI/human review or general formal proof.Original questions,answers,MKOs,formulas,ASTs and history remain unchanged."
    },
    "label": "Frozen producer metadata; current per-question review is separate below."
  },
  "revision": {
    "id": "review-20261026-008-p39",
    "review_date": "2026-10-26",
    "owner_authorized_reader_publication": true,
    "scope": "One hundred sixty family prototypes and their mathematical/bilingual reasoning variants, stems, boundary statements and every distinct explanation shape were reviewed in a context independent of the producer; parameter substitutions, source bindings, full math models, both answer strings and every arithmetic step were independently reconstructed per question from the original parameters only, with negative controls. This grouped method does not claim a separate literal AI reading of every repeated sentence or an extra AI voter.",
    "review_receipts": {
      "semantic_review_sha256": "d165cad30849a3aba67390a59c572c0d965269d4b405e43df36da19e28d85612",
      "question_first_witness_sha256": "c222ca47a07939c019865a1e4d9ce633205cdee68db92bf96a96f5683a62ebc7"
    },
    "status": "second_context_reviewed",
    "mathematical_semantics": true,
    "bilingual_semantics": true,
    "steps_reviewed": 73,
    "method": "family_template_semantic_review_plus_independent_per_instance_reconstruction",
    "exact_question_first_check": {
      "model_sha256": "9262c64e2714dca6f7edb906341546a070e8311ad546b13d4f6eb1556359d7f5",
      "arithmetic_steps": 0
    },
    "uses_answer_as_premise": false,
    "human_review": "NOT_PERFORMED",
    "formalization": "not_formalized",
    "Lean": "NOT_RUN",
    "Canonical_truth_promotion": false,
    "authority": "Owner-authorized reviewed reader publication; original question/candidate states remain historical and unchanged."
  }
}