AFTD Auto-Formalizing Theoretical Domains

condorcet_uniform_outgoing_stationary_core_obstruction

theoremverified

An explicit eight-vertex S3 relation is globally minimal under induced vertex restriction and every arrow has a private triple. Its positive integer circulation giving equal occupation to all outgoing arrows from each vertex has an acyclic subset of mass124248 out of247818, strictly more than half. Nevertheless alternative nonnegative integer weights totaling13 place every acyclic subset at mass at most4. Thus canonical uniform-outgoing transition weights can fail even after both core reductions. This is not an election counterexample and makes no orientedness assertion.

Statement

theorem condorcet_uniform_outgoing_stationary_core_obstruction :
    (∀ J : Finset (Fin 8), J.card ≤ 3 →
      ∃ a, a ∉ J ∧ ∀ b ∈ J, condorcet_uniform_outgoing_gap_relation a b) ∧
    (∀ S : Finset (Fin 8),
      (∀ J : Finset (Fin 8), J ⊆ S → J.card ≤ 3 →
        ∃ a ∈ S, a ∉ J ∧ ∀ b ∈ J, condorcet_uniform_outgoing_gap_relation a b) → S = univ) ∧
    (∀ a b, condorcet_uniform_outgoing_gap_relation a b →
      ∃ J ∈ condorcet_uniform_outgoing_gap_private a, b ∈ J ∧ J.card = 3 ∧
        (∀ c ∈ J, condorcet_uniform_outgoing_gap_relation a c) ∧
        ∀ r, (∀ c ∈ J, condorcet_uniform_outgoing_gap_relation r c) → r = a) ∧
    (∀ a, 0 < condorcet_uniform_outgoing_gap_occupation a) ∧
    (∀ b, condorcet_uniform_outgoing_gap_weight b =
      ∑ a : Fin 8, if condorcet_uniform_outgoing_gap_relation a b then condorcet_uniform_outgoing_gap_occupation a else 0) ∧
    WellFounded (fun a b : {a : Fin 8 // a ∈ condorcet_uniform_outgoing_gap_set} =>
      condorcet_uniform_outgoing_gap_relation a.val b.val) ∧
    ((∑ a : Fin 8, condorcet_uniform_outgoing_gap_weight a) <
      2 * (∑ a ∈ condorcet_uniform_outgoing_gap_set, condorcet_uniform_outgoing_gap_weight a)) ∧
    (∀ A : Finset (Fin 8), WellFounded (fun a b : {a : Fin 8 // a ∈ A} =>
      condorcet_uniform_outgoing_gap_relation a.val b.val) →
      2 * (∑ a ∈ A, condorcet_uniform_outgoing_gap_separator a) <
        ∑ a : Fin 8, condorcet_uniform_outgoing_gap_separator a)
Source
IN-380, OP-19 campaign session8, 2026-10-30. Experiments9470,9472,9474 and UniformOutgoingObstruction.lean. Supporting diagnostic for the main route; no new election bound or research novelty is claimed.
Verified
30 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 2

The proof, explained

The proof establishes the obstruction by exhibiting an explicit 8-vertex relation equipped with stationary circulation occupation numbers and separator weights. Computational verification shows that the relation satisfies the S₃ property, is globally minimal under vertex restriction, and has private triples for all arrows. Under the uniform-outgoing circulation, the 5-element subset {0, 1, 5, 6, 3} is proven acyclic via an explicit ranking into ℕ and carries 124248 out of 247818 total mass (strictly more than half). In contrast, well-foundedness prevents any acyclic subset from containing any of 15 forbidden cycle configurations, which guarantees by finite check that every acyclic subset has separator weight at most 4 out of 13 (strictly less than half).

  1. The relation on 8 vertices satisfies the S₃ property: every subset of at most 3 vertices has an external common predecessor. automation

    Verified by finite exhaustion over all subsets of Fin 8 of size at most 3 using the `decide` tactic.

    line 26

          ∃ a, a ∉ J ∧ ∀ b ∈ J, condorcet_uniform_outgoing_gap_relation a b := by decide
  2. Every proper subset of vertices fails the S₃ property internally. automation

    For each proper subset S ⊊ Fin 8, the `decide` tactic verifies that there exists a subset J ⊆ S of size at most 3 with no common dominating vertex in S.

    line 31

            ∀ a ∈ S, ∃ b ∈ J, ¬condorcet_uniform_outgoing_gap_relation a b := by decide
  3. The relation is a global S₃ core: any subset S satisfying S₃ internally must be the full vertex set.

    Assuming S ≠ univ for contradiction, `condorcet_uniform_outgoing_gap_proper_check` provides a subset J ⊆ S of size at most 3 with no dominating vertex in S. However, the internal S₃ hypothesis on S guarantees such an internal dominator a ∈ S, producing an immediate contradiction.

    lines 37–41

    uses condorcet_uniform_outgoing_gap_proper_check

      by_contra hne
      obtain ⟨J,hJS,hJ,hbad⟩ := condorcet_uniform_outgoing_gap_proper_check S hne
      obtain ⟨a,ha,_,hroot⟩ := hS J hJS hJ
      obtain ⟨b,hb,hab⟩ := hbad a ha
      exact hab (hroot b hb)
  4. Every arrow belongs to a private triple that certifies it for the S₃ property. automation

    The `decide` tactic checks that for every directed edge a → b, there is a 3-element set J containing b that is dominated by a and whose only dominator in the graph is a.

    line 49

          ∃ J ∈ condorcet_uniform_outgoing_gap_private a, b ∈ J) := by decide
  5. The vertex occupation numbers are strictly positive, define a circulation, and give total weight 247818 with 124248 on the subset {0, 1, 5, 6, 3}. automation

    All four arithmetic conditions are verified simultaneously by computational evaluation via `decide`.

    line 57

        (∑ a ∈ condorcet_uniform_outgoing_gap_set, condorcet_uniform_outgoing_gap_weight a) = 124248 := by decide
  6. The defined order values strictly increase along every directed edge in {0, 1, 5, 6, 3}. automation

    Checked by exhaustively evaluating all pairs of vertices in {0, 1, 5, 6, 3} using `decide`.

    line 63

          condorcet_uniform_outgoing_gap_order a < condorcet_uniform_outgoing_gap_order b := by decide
  7. The subrelation induced on {0, 1, 5, 6, 3} is well-founded (acyclic).

    The relation is pulled back along the integer ranking via `measure`. Since every edge strictly increases this ranking by `condorcet_uniform_outgoing_gap_order_check`, the relation embeds into the standard well-founded order on ℕ.

    lines 68–71

    uses measure, condorcet_uniform_outgoing_gap_order_check

      refine (measure (fun a : {a : Fin 8 // a ∈ condorcet_uniform_outgoing_gap_set} =>
        condorcet_uniform_outgoing_gap_order a.val)).wf.mono ?_
      intro a b hab
      exact condorcet_uniform_outgoing_gap_order_check a b a.property b.property hab
  8. Every forbidden set in the family is nonempty and contains an in-neighbor for each of its vertices. automation

    Verified by checking each of the 15 forbidden sets using `decide`.

    line 75

          B.Nonempty ∧ ∀ a ∈ B, ∃ b ∈ B, condorcet_uniform_outgoing_gap_relation b a := by decide
  9. Any vertex subset containing no forbidden set has total separator weight at most 4. automation

    Verified by exhaustive evaluation over all 256 subsets of Fin 8 using `decide`.

    line 80

            (∑ a ∈ A, condorcet_uniform_outgoing_gap_separator a) ≤ 4 := by decide
  10. The total separator weight across all 8 vertices equals 13.

    The sum of the separator vector ![1, 0, 4, 2, 3, 0, 1, 2] is computed to be 13 by `decide`, and rewritten into the goal.

    lines 87–88

      have hsum : (∑ a : Fin 8, condorcet_uniform_outgoing_gap_separator a) = 13 := by decide
      rw [hsum]
  11. Every well-founded subset A has separator weight at most 4.

    By `condorcet_uniform_outgoing_gap_separator_check`, it suffices to show that A contains no forbidden set B. If B ⊆ A, the well-foundedness of A would yield a minimal element in B, but by `condorcet_uniform_outgoing_gap_forbidden_check` every element of B has an in-neighbor in B, contradicting minimality.

    lines 89–96

    uses condorcet_uniform_outgoing_gap_separator_check, condorcet_uniform_outgoing_gap_forbidden_check

      have hbound : (∑ a ∈ A, condorcet_uniform_outgoing_gap_separator a) ≤ 4 := by
        apply condorcet_uniform_outgoing_gap_separator_check A
        intro B hB hsub
        obtain ⟨hne,hpred⟩ := condorcet_uniform_outgoing_gap_forbidden_check B hB
        obtain ⟨b,hb⟩ := hne
        obtain ⟨a,ha,hmin⟩ := hA.has_min {a : {a : Fin 8 // a ∈ A} | a.val ∈ B} ⟨⟨b,hsub hb⟩,hb⟩
        obtain ⟨c,hc,hca⟩ := hpred a.val ha
        exact hmin ⟨c,hsub hc⟩ hc hca
  12. Every well-founded subset A carries strictly less than half of the total separator weight. automation

    Since the total weight is 13 and the weight on A is at most 4, linear integer arithmetic (`omega`) closes the inequality 2 * (∑ a ∈ A, separator a) ≤ 8 < 13.

    line 97

      omega
  13. The core obstruction theorem reduces to verifying private triples and the circulation weight inequality.

    We instantiate the conjunction with the established lemmas: S₃ (`condorcet_uniform_outgoing_gap_s3`), global core minimality (`condorcet_uniform_outgoing_gap_global_core`), positive occupation (`condorcet_uniform_outgoing_gap_flow_check.1`), circulation conservation (`condorcet_uniform_outgoing_gap_flow_check.2.1`), acyclicity (`condorcet_uniform_outgoing_gap_acyclic`), and the separator weight bound on all acyclic subsets (`condorcet_uniform_outgoing_gap_separates`).

    lines 120–122

    uses condorcet_uniform_outgoing_gap_s3, condorcet_uniform_outgoing_gap_global_core, condorcet_uniform_outgoing_gap_flow_check.1, condorcet_uniform_outgoing_gap_flow_check.2.1, condorcet_uniform_outgoing_gap_acyclic, condorcet_uniform_outgoing_gap_separates

      refine ⟨condorcet_uniform_outgoing_gap_s3,condorcet_uniform_outgoing_gap_global_core,?_,
        condorcet_uniform_outgoing_gap_flow_check.1,condorcet_uniform_outgoing_gap_flow_check.2.1,
        condorcet_uniform_outgoing_gap_acyclic,?_,condorcet_uniform_outgoing_gap_separates⟩
  14. Every arrow has a private triple dominating it uniquely.

    For any edge a → b, `condorcet_uniform_outgoing_gap_private_check.2` provides a candidate triple J containing b, and `condorcet_uniform_outgoing_gap_private_check.1` confirms that J has 3 vertices, is dominated by a, and has no other common dominator.

    lines 123–126

    uses condorcet_uniform_outgoing_gap_private_check.2, condorcet_uniform_outgoing_gap_private_check.1

      · intro a b hab
        obtain ⟨J,hJ,hb⟩ := condorcet_uniform_outgoing_gap_private_check.2 a b hab
        obtain ⟨hcard,hnot,hroot,hprivate⟩ := condorcet_uniform_outgoing_gap_private_check.1 a J hJ
        exact ⟨J,hJ,hb,hcard,hroot,hprivate⟩
  15. The uniform-outgoing circulation assigns the acyclic subset strictly more than half of the total weight. automation

    Rewriting the total weight 247818 and the subset weight 124248 using `condorcet_uniform_outgoing_gap_flow_check.2.2.1` and `condorcet_uniform_outgoing_gap_flow_check.2.2.2`, the inequality 247818 < 2 * 124248 = 248496 is verified by `decide`.

    lines 127–128

    uses condorcet_uniform_outgoing_gap_flow_check.2.2.1, condorcet_uniform_outgoing_gap_flow_check.2.2.2

      · rw [condorcet_uniform_outgoing_gap_flow_check.2.2.1,condorcet_uniform_outgoing_gap_flow_check.2.2.2]
        decide
condorcet_uniform_outgoing_gap_s3
Every subset of at most 3 vertices has an external common predecessor that dominates all of it.
condorcet_uniform_outgoing_gap_proper_check
For every proper subset S of vertices, there is a subset J ⊆ S of at most 3 vertices that is not dominated by any vertex in S.
condorcet_uniform_outgoing_gap_global_core
Any subset of vertices that satisfies the S₃ property internally must be the entire vertex set.
condorcet_uniform_outgoing_gap_private_check.1
Every candidate triple J for vertex a has size 3, is dominated by a, and is dominated by no vertex other than a.
condorcet_uniform_outgoing_gap_private_check.2
For every edge a → b, there is an associated candidate triple J containing b.
condorcet_uniform_outgoing_gap_flow_check.1
Every vertex has strictly positive occupation.
condorcet_uniform_outgoing_gap_flow_check.2.1
The total incoming flow at each vertex equals its total outgoing weight, so the flow is a conservative circulation.
condorcet_uniform_outgoing_gap_flow_check.2.2.1
The sum of the circulation weights over all eight vertices equals 247818.
condorcet_uniform_outgoing_gap_flow_check.2.2.2
The sum of the circulation weights on the subset {0, 1, 5, 6, 3} equals 124248.
condorcet_uniform_outgoing_gap_order_check
The ordering values strictly increase along every directed edge between vertices in the subset {0, 1, 5, 6, 3}.
condorcet_uniform_outgoing_gap_acyclic
The subrelation induced on the subset {0, 1, 5, 6, 3} is well-founded (acyclic).
measure
Constructs a well-founded relation on a type from a measure function into the natural numbers.
condorcet_uniform_outgoing_gap_forbidden_check
Every forbidden set is nonempty and has no source: every vertex in it has an in-neighbor from within the same set.
condorcet_uniform_outgoing_gap_separator_check
Any subset of vertices containing no forbidden set has total separator weight at most 4.
condorcet_uniform_outgoing_gap_separates
Under the separator weights totaling 13, every acyclic subset has weight strictly less than half of the total weight.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

open Finsetopen scoped BigOperatorsset_option maxHeartbeats 30000000set_option maxRecDepth 20000def condorcet_uniform_outgoing_gap_pred : Fin 8 → ℕ := ![148,148,249,87,206,146,167,62]def condorcet_uniform_outgoing_gap_relation (a b : Fin 8) : Prop :=  (condorcet_uniform_outgoing_gap_pred b).testBit a.val = trueinstance : DecidableRel condorcet_uniform_outgoing_gap_relation := fun a b =>  inferInstanceAs (Decidable ((condorcet_uniform_outgoing_gap_pred b).testBit a.val = true))def condorcet_uniform_outgoing_gap_neighbors (a : Fin 8) : Finset (Fin 8) :=  univ.filter (fun b => condorcet_uniform_outgoing_gap_relation a b)def condorcet_uniform_outgoing_gap_occupation : Fin 8 → ℕ := ![6865,4119,7878,11905,6684,5612,10169,6033]def condorcet_uniform_outgoing_gap_weight (a : Fin 8) : ℕ :=  (condorcet_uniform_outgoing_gap_neighbors a).card * condorcet_uniform_outgoing_gap_occupation adef condorcet_uniform_outgoing_gap_set : Finset (Fin 8) := {0,1,5,6,3}def condorcet_uniform_outgoing_gap_order : Fin 8 → ℕ := ![0,1,0,4,0,2,3,0]def condorcet_uniform_outgoing_gap_private : Fin 8 → Finset (Finset (Fin 8)) :=  ![{{2,3,6}},{{3,4,5},{3,5,6},{4,5,7},{5,6,7}},{{0,3,4},{0,3,6},{0,4,7},{0,6,7},{1,3,4},{1,3,6},{1,4,7},{1,6,7}},{{2,4,7}},{{0,2,3},{0,2,7},{0,3,5},{0,5,7},{1,2,3},{1,2,7},{1,3,5},{1,5,7},{2,3,5},{2,3,7},{2,5,7}},{{2,6,7}},{{2,3,4}},{{0,2,4},{0,2,6},{0,4,5},{0,5,6},{1,2,4},{1,2,6},{1,4,5},{1,5,6},{2,4,5},{2,4,6},{2,5,6}}]def condorcet_uniform_outgoing_gap_separator : Fin 8 → ℕ := ![1,0,4,2,3,0,1,2]def condorcet_uniform_outgoing_gap_forbidden : Finset (Finset (Fin 8)) :=  {{0,2},{2,3},{1,4},{2,4},{3,4},{1,2,5},{2,6},{0,4,6},{4,5,6},{1,7},{2,7},{0,3,7},{4,7},{5,7},{3,6,7}}theorem condorcet_uniform_outgoing_gap_s3 :    ∀ J : Finset (Fin 8), J.card ≤ 3 →      ∃ a, a ∉ J ∧ ∀ b ∈ J, condorcet_uniform_outgoing_gap_relation a b := by decidetheorem condorcet_uniform_outgoing_gap_proper_check :    ∀ S : Finset (Fin 8), S ≠ univ →      ∃ J : Finset (Fin 8), J ⊆ S ∧ J.card ≤ 3 ∧        ∀ a ∈ S, ∃ b ∈ J, ¬condorcet_uniform_outgoing_gap_relation a b := by decidetheorem condorcet_uniform_outgoing_gap_global_core    (S : Finset (Fin 8))    (hS : ∀ J : Finset (Fin 8), J ⊆ S → J.card ≤ 3 →      ∃ a ∈ S, a ∉ J ∧ ∀ b ∈ J, condorcet_uniform_outgoing_gap_relation a b) : S = univ := by  by_contra hne  obtain ⟨J,hJS,hJ,hbad⟩ := condorcet_uniform_outgoing_gap_proper_check S hne  obtain ⟨a,ha,_,hroot⟩ := hS J hJS hJ  obtain ⟨b,hb,hab⟩ := hbad a ha  exact hab (hroot b hb)theorem condorcet_uniform_outgoing_gap_private_check :    (∀ a, ∀ J ∈ condorcet_uniform_outgoing_gap_private a,      J.card = 3 ∧ a ∉ J ∧      (∀ b ∈ J, condorcet_uniform_outgoing_gap_relation a b) ∧      ∀ r, (∀ b ∈ J, condorcet_uniform_outgoing_gap_relation r b) → r = a) ∧    (∀ a b, condorcet_uniform_outgoing_gap_relation a b →      ∃ J ∈ condorcet_uniform_outgoing_gap_private a, b ∈ J) := by decidetheorem condorcet_uniform_outgoing_gap_flow_check :    (∀ a, 0 < condorcet_uniform_outgoing_gap_occupation a) ∧    (∀ b, condorcet_uniform_outgoing_gap_weight b =      ∑ a : Fin 8, if condorcet_uniform_outgoing_gap_relation a b then        condorcet_uniform_outgoing_gap_occupation a else 0) ∧    (∑ a : Fin 8, condorcet_uniform_outgoing_gap_weight a) = 247818 ∧    (∑ a ∈ condorcet_uniform_outgoing_gap_set, condorcet_uniform_outgoing_gap_weight a) = 124248 := by decidetheorem condorcet_uniform_outgoing_gap_order_check :    ∀ a b : Fin 8,      a ∈ condorcet_uniform_outgoing_gap_set → b ∈ condorcet_uniform_outgoing_gap_set →      condorcet_uniform_outgoing_gap_relation a b →      condorcet_uniform_outgoing_gap_order a < condorcet_uniform_outgoing_gap_order b := by decidetheorem condorcet_uniform_outgoing_gap_acyclic :    WellFounded (fun a b : {a : Fin 8 // a ∈ condorcet_uniform_outgoing_gap_set} =>      condorcet_uniform_outgoing_gap_relation a.val b.val) := by  refine (measure (fun a : {a : Fin 8 // a ∈ condorcet_uniform_outgoing_gap_set} =>    condorcet_uniform_outgoing_gap_order a.val)).wf.mono ?_  intro a b hab  exact condorcet_uniform_outgoing_gap_order_check a b a.property b.property habtheorem condorcet_uniform_outgoing_gap_forbidden_check :    ∀ B ∈ condorcet_uniform_outgoing_gap_forbidden,      B.Nonempty ∧ ∀ a ∈ B, ∃ b ∈ B, condorcet_uniform_outgoing_gap_relation b a := by decidetheorem condorcet_uniform_outgoing_gap_separator_check :    ∀ A : Finset (Fin 8),      (∀ B ∈ condorcet_uniform_outgoing_gap_forbidden, ¬B ⊆ A) →        (∑ a ∈ A, condorcet_uniform_outgoing_gap_separator a) ≤ 4 := by decidetheorem condorcet_uniform_outgoing_gap_separates    (A : Finset (Fin 8))    (hA : WellFounded (fun a b : {a : Fin 8 // a ∈ A} => condorcet_uniform_outgoing_gap_relation a.val b.val)) :    2 * (∑ a ∈ A, condorcet_uniform_outgoing_gap_separator a) <      ∑ a : Fin 8, condorcet_uniform_outgoing_gap_separator a := by  have hsum : (∑ a : Fin 8, condorcet_uniform_outgoing_gap_separator a) = 13 := by decide  rw [hsum]  have hbound : (∑ a ∈ A, condorcet_uniform_outgoing_gap_separator a) ≤ 4 := by    apply condorcet_uniform_outgoing_gap_separator_check A    intro B hB hsub    obtain ⟨hne,hpred⟩ := condorcet_uniform_outgoing_gap_forbidden_check B hB    obtain ⟨b,hb⟩ := hne    obtain ⟨a,ha,hmin⟩ := hA.has_min {a : {a : Fin 8 // a ∈ A} | a.val ∈ B} ⟨⟨b,hsub hb⟩,hb⟩    obtain ⟨c,hc,hca⟩ := hpred a.val ha    exact hmin ⟨c,hsub hc⟩ hc hca  omegatheorem condorcet_uniform_outgoing_stationary_core_obstruction :    (∀ J : Finset (Fin 8), J.card ≤ 3 →      ∃ a, a ∉ J ∧ ∀ b ∈ J, condorcet_uniform_outgoing_gap_relation a b) ∧    (∀ S : Finset (Fin 8),      (∀ J : Finset (Fin 8), J ⊆ S → J.card ≤ 3 →        ∃ a ∈ S, a ∉ J ∧ ∀ b ∈ J, condorcet_uniform_outgoing_gap_relation a b) → S = univ) ∧    (∀ a b, condorcet_uniform_outgoing_gap_relation a b →      ∃ J ∈ condorcet_uniform_outgoing_gap_private a, b ∈ J ∧ J.card = 3 ∧        (∀ c ∈ J, condorcet_uniform_outgoing_gap_relation a c) ∧        ∀ r, (∀ c ∈ J, condorcet_uniform_outgoing_gap_relation r c) → r = a) ∧    (∀ a, 0 < condorcet_uniform_outgoing_gap_occupation a) ∧    (∀ b, condorcet_uniform_outgoing_gap_weight b =      ∑ a : Fin 8, if condorcet_uniform_outgoing_gap_relation a b then condorcet_uniform_outgoing_gap_occupation a else 0) ∧    WellFounded (fun a b : {a : Fin 8 // a ∈ condorcet_uniform_outgoing_gap_set} =>      condorcet_uniform_outgoing_gap_relation a.val b.val) ∧    ((∑ a : Fin 8, condorcet_uniform_outgoing_gap_weight a) <      2 * (∑ a ∈ condorcet_uniform_outgoing_gap_set, condorcet_uniform_outgoing_gap_weight a)) ∧    (∀ A : Finset (Fin 8), WellFounded (fun a b : {a : Fin 8 // a ∈ A} =>      condorcet_uniform_outgoing_gap_relation a.val b.val) →      2 * (∑ a ∈ A, condorcet_uniform_outgoing_gap_separator a) <        ∑ a : Fin 8, condorcet_uniform_outgoing_gap_separator a) := by  refine ⟨condorcet_uniform_outgoing_gap_s3,condorcet_uniform_outgoing_gap_global_core,?_,    condorcet_uniform_outgoing_gap_flow_check.1,condorcet_uniform_outgoing_gap_flow_check.2.1,    condorcet_uniform_outgoing_gap_acyclic,?_,condorcet_uniform_outgoing_gap_separates⟩  · intro a b hab    obtain ⟨J,hJ,hb⟩ := condorcet_uniform_outgoing_gap_private_check.2 a b hab    obtain ⟨hcard,hnot,hroot,hprivate⟩ := condorcet_uniform_outgoing_gap_private_check.1 a J hJ    exact ⟨J,hJ,hb,hcard,hroot,hprivate⟩  · rw [condorcet_uniform_outgoing_gap_flow_check.2.2.1,condorcet_uniform_outgoing_gap_flow_check.2.2.2]    decide
See it in the graphDiscuss this resultChallenge it