Another optimization, already done for geq.

diff --git a/matita/contribs/formal_topology/bin/theory_explorer.ml b/matita/contribs/formal_topology/bin/theory_explorer.ml
index e1c02cd29f3909dc2e836640decfae2ee1dc26cc..39a021c9dc19abfbe805220c1fb85824248e38a4 100644 (file)
--- a/matita/contribs/formal_topology/bin/theory_explorer.ml
+++ b/matita/contribs/formal_topology/bin/theory_explorer.ml
@@ -357,6 +357,9 @@ let locate_using_leq to_be_considered_and_now ((repr,_,leq,geq) as node)
        else if repr=repr' then aux set (node'::already_visited) (!geq'@tl)
        else if leq_reachable node' !leq then
         aux set (node'::already_visited) (!geq'@tl)
+       else if (List.exists (function n -> not (geq_reachable n [node'])) !geq)
+        then
+         aux set (node'::already_visited) tl
        else if test to_be_considered_and_now set SubsetEqual repr repr' then
         begin
          if List.exists (function n -> n===node') !geq then