10 (* compound operator *)
11 type compound_operator = op list
13 let string_of_cop op =
14 if op = [] then "id" else String.concat "" (List.map string_of_op op)
16 let dot_of_cop op = "\"" ^ string_of_cop op ^ "\""
18 let rec matita_of_cop v =
21 | I::tl -> "i (" ^ matita_of_cop v tl ^ ")"
22 | C::tl -> "c (" ^ matita_of_cop v tl ^ ")"
23 | M::tl -> "m (" ^ matita_of_cop v tl ^ ")"
25 (* representative, other elements in the equivalence class,
26 leq classes, geq classes *)
27 type equivalence_class =
28 compound_operator * compound_operator list *
29 equivalence_class list ref * equivalence_class list ref
31 let string_of_equivalence_class (repr,others,leq,_) =
32 String.concat " = " (List.map string_of_cop (repr::others)) ^
37 (function (repr',_,_,_) ->
38 string_of_cop repr ^ " <= " ^ string_of_cop repr') !leq)
42 let dot_of_equivalence_class (repr,others,leq,_) =
44 let eq = String.concat " = " (List.map string_of_cop (repr::others)) in
45 dot_of_cop repr ^ "[label=\"" ^ eq ^ "\"];" ^
46 if !leq = [] then "" else "\n"
47 else if !leq = [] then
53 (function (repr',_,_,_) ->
54 dot_of_cop repr' ^ " -> " ^ dot_of_cop repr ^ ";") !leq)
56 (* set of equivalence classes *)
57 type set = equivalence_class list
60 String.concat "\n" (List.map string_of_equivalence_class s)
62 let ps_of_set ?processing s =
63 let ch = open_out "xxx.dot" in
64 output_string ch "digraph G {\n";
65 output_string ch (String.concat "\n" (List.map dot_of_equivalence_class s));
66 output_string ch "\n";
67 (match processing with
69 | Some (repr,rel,repr') ->
71 (dot_of_cop repr' ^ " -> " ^ dot_of_cop repr ^
73 (if rel="=" then "arrowhead=none " else "") ^
75 output_string ch "}\n";
77 ignore (Unix.system "dot -Tps xxx.dot > xxx.ps")
79 let test set rel candidate repr =
80 ps_of_set ~processing:(candidate,rel,repr) set;
82 (string_of_cop candidate ^ " " ^ rel ^ " " ^ string_of_cop repr ^ "? ");
84 assert (Unix.system "cp formal_topology.ma xxx.ma" = Unix.WEXITED 0);
85 let ch = open_out_gen [Open_append] 0 "xxx.ma" in
88 (function (repr,others,leq,_) ->
93 ("axiom ax" ^ string_of_int !i ^
95 matita_of_cop "A" repr ^ " = " ^ matita_of_cop "A" repr' ^ ".\n");
98 (function (repr',_,_,_) ->
101 ("axiom ax" ^ string_of_int !i ^
103 matita_of_cop "A" repr ^ " ⊆ " ^ matita_of_cop "A" repr' ^ ".\n");
107 ("theorem foo: \\forall A." ^ matita_of_cop "A" candidate ^ " " ^ rel ^ " " ^
108 matita_of_cop "A" repr ^ ". intros; auto size=6 depth=4. qed.\n");
111 Unix.system "../../../matitac.opt xxx.ma >> log 2>&1" = Unix.WEXITED 0
113 print_endline (if res then "y" else "n");
116 let normalize candidate set =
119 [] -> raise Not_found
120 | (repr,others,leq,geq) as eqclass :: tl ->
121 if test set "=" candidate repr then
122 (repr,others@[candidate],leq,geq)::tl
129 let locate ((repr,_,leq,geq) as node) set =
133 | (repr',_,leq',geq') as node' :: tl ->
134 if repr = repr' then ()
135 else if test set "⊆" repr repr' then
137 leq := node' :: !leq;
138 geq' := node :: !geq'
140 else if test set "⊆" repr' repr then
142 geq := node' :: !geq;
143 leq' := node :: !leq'
150 let analyze_one repr hecandidate (news,set) =
151 let candidate = hecandidate::repr in
152 if List.length (List.filter ((=) M) candidate) > 1 then
156 let set = normalize candidate set in
162 let node = candidate,[],leq,geq in
163 let set = node::set in
168 let rec explore i set news =
169 let rec aux news set =
174 List.fold_right (analyze_one repr) [I;C;M] (news,set)
178 let news,set = aux [] set news in
181 print_endline ("PUNTO FISSO RAGGIUNTO! i=" ^ string_of_int i);
182 print_endline (string_of_set set ^ "\n----------------");
187 print_endline ("NUOVA ITERAZIONE, i=" ^ string_of_int i);
188 print_endline (string_of_set set ^ "\n----------------");
189 explore (i+1) set news
193 let set = [id,[],ref [], ref []] in
194 print_endline ("PRIMA ITERAZIONE, i=0, j=0");
195 print_endline (string_of_set set ^ "\n----------------");
196 ignore (Unix.system "rm -f log");