From d862088577226862f3b7f9a4eab94c85d5bb8211 Mon Sep 17 00:00:00 2001 From: Claudio Sacerdoti Coen Date: Thu, 31 May 2007 18:04:22 +0000 Subject: [PATCH] Final (???) bug fixed. The fixpoint for n=1 is now reached in 22s. --- matita/contribs/formal_topology/bin/theory_explorer.ml | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/matita/contribs/formal_topology/bin/theory_explorer.ml b/matita/contribs/formal_topology/bin/theory_explorer.ml index 2a7e59987..69911cfb3 100644 --- a/matita/contribs/formal_topology/bin/theory_explorer.ml +++ b/matita/contribs/formal_topology/bin/theory_explorer.ml @@ -354,7 +354,7 @@ let locate_using_leq to_be_considered_and_now ((repr,_,leq,geq) as node) aux set already_visited tl else if repr=repr' then aux set (node'::already_visited) (!geq'@tl) else if leq_reachable node' !leq then - aux set (node'::already_visited) tl + aux set (node'::already_visited) (!geq'@tl) else if test to_be_considered_and_now set SubsetEqual repr repr' then begin let sup = remove node sup in @@ -390,7 +390,7 @@ let locate_using_geq to_be_considered_and_now ((repr,_,leq,geq) as node) aux set already_visited tl else if repr=repr' then aux set (node'::already_visited) (!leq'@tl) else if geq_reachable node' !geq then - aux set (node'::already_visited) tl + aux set (node'::already_visited) (!leq'@tl) else if test to_be_considered_and_now set SupersetEqual repr repr' then begin if List.exists (function n -> n===node') !leq then -- 2.39.2