                (println "<=CAtom: " @<=CAtom)
                (while (= @<=CAtom nil)
                  (swap! CAtom
-                        (fn [C] (let [I (incompatibility-graph (transitive-edge-union P <= C))]
+                        (fn [C] (let [I (tig (transitive-edge-union P <= C))]
                                   (println "(transitive-edge-union P <= C):")
                                   (uber/pprint (transitive-edge-union P <= C))
                                   (println "I:")

     (vec (map #(vec [(! %)]) xs)))))


(defn sat-reduction
  "Reduces the problem of finding a maximum bipartite subgraph to satisfiability
  and solves it.

            [conexp.fca.lattices :as lat]
            [conexp.fca.graph :refer :all]
            [conexp.util.graph :refer :all]
            [conexp.layouts.base :as lay]
            [conexp.base :exclude [transitive-closure] :refer :all]
            [rolling-stones.core :as sat :refer :all]))

