-(* OLD CODE: TO BE REMOVED
-(*Funzione position prende una lista e un elemento e mi ritorna la posizione dell'elem nella lista*)
-(*Mi serve per ritornare la posizione del teo che produce meno subgoal*)
-
-exception NotInTheList;;
-
-
-let position n =
- let rec aux k =
- function
- [] -> raise NotInTheList
- | m::_ when m=n -> k
- | _::tl -> aux (k+1) tl in
- aux 1
-;;
-
-
-
-(*function taking a status and returning a new status after having searching a theorem to apply ,theorem which *)
-(*generate the less number of subgoals*)
-
-let searchTheorem (proof,goal) =
- let mqi_flags = [MQIC.Postgres ; MQIC.Stat ; MQIC.Warn ; MQIC.Log] (* default MathQL interpreter options *)
- in
- let mqi_handle = MQIC.init mqi_flags prerr_string
-in
- let uris' =
- matchConclusion
- mqi_handle ~choose_must() (proof, goal)
- in
- let list_of_termin =
- List.map
- (function string ->
- (MQueryMisc.term_of_cic_textual_parser_uri
- (MQueryMisc.cic_textual_parser_uri_of_string string))
- )
- uris'
- in
- let list_proofgoal =
- List.map
- (function term ->
- PrimitiveTactics.apply_tac ~term (proof,goal))
- list_of_termin
- in
- let (list_of_subgoal: int list list) =
- List.map snd list_proofgoal
- in
- let list_of_num =
- List.map List.length list_of_subgoal
- in
- let list_sort =
- List.sort Pervasives.compare list_of_num
- in (*ordino la lista in modo cresc*)
- let min= List.nth list_sort 0 (*prendo il minimo*)
- in
- let uri' = (*cerco il teo di pos k*)
- List.nth list_of_termin (position min list_of_num)
- in
- (* let teo=
- String.sub uri' 4 (String.length uri' - 4)
-
- (* modifico la str in modo che sia accettata da apply*)
- in*)
- PrimitiveTactics.apply_tac ~term:uri' (proof,goal)
-;;
-*)
-
-