src/HOL/Tools/ATP/recon_transfer_proof.ML
author quigley
Thu Mar 31 19:29:26 2005 +0200 (2005-03-31)
changeset 15642 028059faa963
child 15658 2edb384bf61f
permissions -rw-r--r--
*** empty log message ***
quigley@15642
     1
(******************)
quigley@15642
     2
(* complete later *)
quigley@15642
     3
(******************)
quigley@15642
     4
quigley@15642
     5
fun not_newline ch = not (ch = "\n");
quigley@15642
     6
quigley@15642
     7
quigley@15642
     8
quigley@15642
     9
(* Versions that include type information *)
quigley@15642
    10
 
quigley@15642
    11
fun string_of_thm thm = let val _ = set show_sorts
quigley@15642
    12
                                val str = Sign.string_of_term Mainsign (prop_of thm)
quigley@15642
    13
                                val no_returns =List.filter not_newline (explode str)
quigley@15642
    14
                                val _ = reset show_sorts
quigley@15642
    15
                            in 
quigley@15642
    16
                                implode no_returns
quigley@15642
    17
                            end
quigley@15642
    18
quigley@15642
    19
quigley@15642
    20
fun thm_of_string str = let val _ = set show_sorts
quigley@15642
    21
                                val term = read str
quigley@15642
    22
                                val propterm = mk_Trueprop term
quigley@15642
    23
                                val cterm = cterm_of Mainsign propterm
quigley@15642
    24
                                val _ = reset show_sorts
quigley@15642
    25
                            in
quigley@15642
    26
                                assume cterm
quigley@15642
    27
                            end
quigley@15642
    28
quigley@15642
    29
(* check separate args in the watcher program for separating strings with a * or ; or something *)
quigley@15642
    30
quigley@15642
    31
fun clause_strs_to_string [] str = str
quigley@15642
    32
|   clause_strs_to_string (x::xs) str = clause_strs_to_string xs (str^x^"%")
quigley@15642
    33
quigley@15642
    34
quigley@15642
    35
quigley@15642
    36
fun thmvars_to_string [] str = str
quigley@15642
    37
|   thmvars_to_string (x::xs) str = thmvars_to_string xs (str^x^"%")
quigley@15642
    38
quigley@15642
    39
quigley@15642
    40
fun proofstep_to_string Axiom = "Axiom()"
quigley@15642
    41
|   proofstep_to_string  (Binary ((a,b), (c,d)))= "Binary"^"("^"("^(string_of_int a)^","^(string_of_int b)^")"^","^"("^(string_of_int c)^","^(string_of_int d)^")"^")"
quigley@15642
    42
|   proofstep_to_string (Factor (a,b,c)) = "Factor"^"("^(string_of_int a)^","^(string_of_int b)^","^(string_of_int c)^")"
quigley@15642
    43
|   proofstep_to_string  (Para ((a,b), (c,d)))= "Para"^"("^"("^(string_of_int a)^","^(string_of_int b)^")"^","^"("^(string_of_int c)^","^(string_of_int d)^")"^")"
quigley@15642
    44
|   proofstep_to_string  (MRR ((a,b), (c,d)))= "MRR"^"("^"("^(string_of_int a)^","^(string_of_int b)^")"^","^"("^(string_of_int c)^","^(string_of_int d)^")"^")"
quigley@15642
    45
|   proofstep_to_string (Rewrite((a,b),(c,d))) = "Rewrite"^"("^"("^(string_of_int a)^","^(string_of_int b)^")"^","^"("^(string_of_int c)^","^(string_of_int d)^")"^")"
quigley@15642
    46
quigley@15642
    47
fun list_to_string [] liststr = liststr
quigley@15642
    48
|   list_to_string (x::[]) liststr = liststr^(string_of_int x)
quigley@15642
    49
|   list_to_string (x::xs) liststr = list_to_string xs (liststr^(string_of_int x)^",")
quigley@15642
    50
quigley@15642
    51
quigley@15642
    52
fun proof_to_string (num,(step,clause_strs, thmvars)) = (string_of_int num)^(proofstep_to_string step)^"["^(clause_strs_to_string clause_strs "")^"]"^"["^(thmvars_to_string thmvars "")^"]"
quigley@15642
    53
 
quigley@15642
    54
quigley@15642
    55
fun proofs_to_string [] str = str
quigley@15642
    56
|   proofs_to_string (x::xs) str = let val newstr = proof_to_string x 
quigley@15642
    57
                                   in
quigley@15642
    58
                                       proofs_to_string xs (str^newstr)
quigley@15642
    59
                                   end
quigley@15642
    60
quigley@15642
    61
quigley@15642
    62
quigley@15642
    63
fun init_proofstep_to_string (num, step, clause_strs) = (string_of_int num)^" "^(proofstep_to_string step)^" "^(clause_strs_to_string clause_strs "")^" "
quigley@15642
    64
quigley@15642
    65
fun init_proofsteps_to_string [] str = str
quigley@15642
    66
|   init_proofsteps_to_string (x::xs) str = let val newstr = init_proofstep_to_string x 
quigley@15642
    67
                                   in
quigley@15642
    68
                                       init_proofsteps_to_string xs (str^newstr)
quigley@15642
    69
                                   end
quigley@15642
    70
  
quigley@15642
    71
quigley@15642
    72
quigley@15642
    73
(*** get a string representing the Isabelle ordered axioms ***)
quigley@15642
    74
quigley@15642
    75
fun origAx_to_string (num,(meta,thmvars)) =let val clause_strs = get_meta_lits_bracket meta
quigley@15642
    76
                                         in
quigley@15642
    77
                                            (string_of_int num)^"OrigAxiom()"^"["^(clause_strs_to_string clause_strs "")^"]"^"["^(thmvars_to_string thmvars "")^"]"
quigley@15642
    78
                                         end
quigley@15642
    79
quigley@15642
    80
quigley@15642
    81
fun  origAxs_to_string [] str = str
quigley@15642
    82
|   origAxs_to_string (x::xs) str = let val newstr = origAx_to_string x 
quigley@15642
    83
                                   in
quigley@15642
    84
                                       origAxs_to_string xs (str^newstr)
quigley@15642
    85
                                   end
quigley@15642
    86
quigley@15642
    87
quigley@15642
    88
(*** get a string representing the Isabelle ordered axioms not used in the spass proof***)
quigley@15642
    89
quigley@15642
    90
fun extraAx_to_string (num, (meta,thmvars)) = let val clause_strs = get_meta_lits_bracket meta
quigley@15642
    91
                                           in
quigley@15642
    92
                                              (string_of_int num)^"ExtraAxiom()"^"["^(clause_strs_to_string clause_strs "")^"]"^"["^(thmvars_to_string thmvars "")^"]"
quigley@15642
    93
                                           end
quigley@15642
    94
quigley@15642
    95
quigley@15642
    96
quigley@15642
    97
fun  extraAxs_to_string [] str = str
quigley@15642
    98
|   extraAxs_to_string (x::xs) str = let val newstr = extraAx_to_string x 
quigley@15642
    99
                                   in
quigley@15642
   100
                                       extraAxs_to_string xs (str^newstr)
quigley@15642
   101
                                   end
quigley@15642
   102
quigley@15642
   103
quigley@15642
   104
quigley@15642
   105
quigley@15642
   106
quigley@15642
   107
quigley@15642
   108
fun is_axiom ( num:int,Axiom, str) = true
quigley@15642
   109
|   is_axiom (num, _,_) = false
quigley@15642
   110
quigley@15642
   111
fun get_init_axioms xs = List.filter (is_axiom) ( xs)
quigley@15642
   112
quigley@15642
   113
fun get_step_nums [] nums = nums
quigley@15642
   114
|   get_step_nums (( num:int,Axiom, str)::xs) nums = get_step_nums xs (nums@[num])
quigley@15642
   115
quigley@15642
   116
fun assoc_snd a [] = raise Noassoc
quigley@15642
   117
  | assoc_snd a ((x, y)::t) = if a = y then x else assoc_snd a t;
quigley@15642
   118
quigley@15642
   119
(* change to be something using check_order  instead of a = y --> returns true if ASSERTION not raised in checkorder, false otherwise *)
quigley@15642
   120
quigley@15642
   121
(*fun get_assoc_snds [] xs assocs= assocs
quigley@15642
   122
|   get_assoc_snds (x::xs) ys assocs = get_assoc_snds xs ys (assocs@[((assoc_snd x ys))])
quigley@15642
   123
*)
quigley@15642
   124
(*FIX - should this have vars in it? *)
quigley@15642
   125
fun there_out_of_order xs ys = let val foo = (checkorder xs ys [] ([],[],[])) 
quigley@15642
   126
                                   
quigley@15642
   127
                               in 
quigley@15642
   128
                                   true
quigley@15642
   129
                              end
quigley@15642
   130
                              handle EXCEP => false
quigley@15642
   131
quigley@15642
   132
fun assoc_out_of_order a [] = raise Noassoc
quigley@15642
   133
|   assoc_out_of_order a ((b,c)::t) = if there_out_of_order a c then b else assoc_out_of_order a t;
quigley@15642
   134
quigley@15642
   135
fun get_assoc_snds [] xs assocs= assocs
quigley@15642
   136
|   get_assoc_snds (x::xs) ys assocs = get_assoc_snds xs ys (assocs@[((assoc_out_of_order x ys))])
quigley@15642
   137
quigley@15642
   138
quigley@15642
   139
quigley@15642
   140
quigley@15642
   141
fun add_if_not_inlist [] xs newlist = newlist
quigley@15642
   142
|   add_if_not_inlist (y::ys) xs newlist = if (not (inlist y xs)) then 
quigley@15642
   143
                                      add_if_not_inlist ys xs (y::newlist)
quigley@15642
   144
                                        else add_if_not_inlist ys xs (newlist)
quigley@15642
   145
quigley@15642
   146
(*
quigley@15642
   147
fun is_alpha_space_neg_eq_colon ch = (ch = "~") orelse (is_alpha ch) orelse ( ch = " ")orelse  ( ch = ";") orelse( ch = "=")
quigley@15642
   148
quigley@15642
   149
(* replace | by ; here *)
quigley@15642
   150
fun change_or [] = []
quigley@15642
   151
|   change_or (x::xs) = if x = "|" 
quigley@15642
   152
                          then 
quigley@15642
   153
                             [";"]@(change_or xs)
quigley@15642
   154
                          else (x::(change_or xs))
quigley@15642
   155
quigley@15642
   156
quigley@15642
   157
fun clause_lit_string t = let val termstr = (Sign.string_of_term Mainsign ) t
quigley@15642
   158
                              val exp_term = explode termstr
quigley@15642
   159
                              val colon_term = change_or exp_term
quigley@15642
   160
                   in
quigley@15642
   161
                             implode(List.filter is_alpha_space_neg_eq_colon colon_term)
quigley@15642
   162
                   end
quigley@15642
   163
quigley@15642
   164
fun get_clause_lits thm =  clause_lit_string (prop_of thm)
quigley@15642
   165
*)
quigley@15642
   166
quigley@15642
   167
quigley@15642
   168
fun onestr [] str = str
quigley@15642
   169
|   onestr (x::xs) str = onestr xs (str^(concat x))
quigley@15642
   170
quigley@15642
   171
fun thmstrings [] str = str
quigley@15642
   172
|   thmstrings (x::xs) str = thmstrings xs (str^(string_of_thm x))
quigley@15642
   173
quigley@15642
   174
fun onelist [] newlist = newlist
quigley@15642
   175
|   onelist (x::xs) newlist = onelist xs (newlist@x)
quigley@15642
   176
quigley@15642
   177
quigley@15642
   178
(**** Code to support ordinary resolution, rather than Model Elimination ****)
quigley@15642
   179
quigley@15642
   180
(*Convert a list of clauses (disjunctions) to meta-level clauses (==>), 
quigley@15642
   181
  with no contrapositives, for ordinary resolution.*)
quigley@15642
   182
quigley@15642
   183
(*raises exception if no rules apply -- unlike RL*)
quigley@15642
   184
fun tryres (th, rl::rls) = (th RS rl handle THM _ => tryres(th,rls))
quigley@15642
   185
  | tryres (th, []) = raise THM("tryres", 0, [th]);
quigley@15642
   186
quigley@15642
   187
val prop_of = #prop o rep_thm;
quigley@15642
   188
quigley@15642
   189
quigley@15642
   190
(*For ordinary resolution. *)
quigley@15642
   191
val resolution_clause_rules = [disj_assoc, make_neg_rule', make_pos_rule'];
quigley@15642
   192
(*Use "theorem naming" to label the clauses*)
quigley@15642
   193
fun name_thms label =
quigley@15642
   194
    let fun name1 (th, (k,ths)) =
quigley@15642
   195
	  (k-1, Thm.name_thm (label ^ string_of_int k, th) :: ths)
quigley@15642
   196
quigley@15642
   197
    in  fn ths => #2 (foldr name1 (length ths, []) ths)  end;
quigley@15642
   198
quigley@15642
   199
(*Find an all-negative support clause*)
quigley@15642
   200
fun is_negative th = forall (not o #1) (literals (prop_of th));
quigley@15642
   201
quigley@15642
   202
val neg_clauses = List.filter is_negative;
quigley@15642
   203
quigley@15642
   204
quigley@15642
   205
quigley@15642
   206
(*True if the given type contains bool anywhere*)
quigley@15642
   207
fun has_bool (Type("bool",_)) = true
quigley@15642
   208
  | has_bool (Type(_, Ts)) = exists has_bool Ts
quigley@15642
   209
  | has_bool _ = false;
quigley@15642
   210
  
quigley@15642
   211
quigley@15642
   212
(*Create a meta-level Horn clause*)
quigley@15642
   213
fun make_horn crules th = make_horn crules (tryres(th,crules))
quigley@15642
   214
			  handle THM _ => th;
quigley@15642
   215
quigley@15642
   216
quigley@15642
   217
(*Raises an exception if any Vars in the theorem mention type bool. That would mean
quigley@15642
   218
  they are higher-order, and in addition, they could cause make_horn to loop!*)
quigley@15642
   219
fun check_no_bool th =
quigley@15642
   220
  if exists (has_bool o fastype_of) (term_vars (#prop (rep_thm th)))
quigley@15642
   221
  then raise THM ("check_no_bool", 0, [th]) else th;
quigley@15642
   222
quigley@15642
   223
quigley@15642
   224
(*Rules to convert the head literal into a negated assumption. If the head
quigley@15642
   225
  literal is already negated, then using notEfalse instead of notEfalse'
quigley@15642
   226
  prevents a double negation.*)
quigley@15642
   227
val notEfalse = read_instantiate [("R","False")] notE;
quigley@15642
   228
val notEfalse' = rotate_prems 1 notEfalse;
quigley@15642
   229
quigley@15642
   230
fun negated_asm_of_head th = 
quigley@15642
   231
    th RS notEfalse handle THM _ => th RS notEfalse';
quigley@15642
   232
quigley@15642
   233
(*Converting one clause*)
quigley@15642
   234
fun make_meta_clause th = 
quigley@15642
   235
	negated_asm_of_head (make_horn resolution_clause_rules (check_no_bool th));
quigley@15642
   236
quigley@15642
   237
fun make_meta_clauses ths =
quigley@15642
   238
    name_thms "MClause#"
quigley@15642
   239
      (gen_distinct Drule.eq_thm_prop (map make_meta_clause ths));
quigley@15642
   240
quigley@15642
   241
(*Permute a rule's premises to move the i-th premise to the last position.*)
quigley@15642
   242
fun make_last i th =
quigley@15642
   243
  let val n = nprems_of th 
quigley@15642
   244
  in  if 1 <= i andalso i <= n 
quigley@15642
   245
      then Thm.permute_prems (i-1) 1 th
quigley@15642
   246
      else raise THM("select_literal", i, [th])
quigley@15642
   247
  end;
quigley@15642
   248
quigley@15642
   249
(*Maps a rule that ends "... ==> P ==> False" to "... ==> ~P" while suppressing
quigley@15642
   250
  double-negations.*)
quigley@15642
   251
val negate_head = rewrite_rule [atomize_not, not_not RS eq_reflection];
quigley@15642
   252
quigley@15642
   253
(*Maps the clause  [P1,...Pn]==>False to [P1,...,P(i-1),P(i+1),...Pn] ==> ~P*)
quigley@15642
   254
fun select_literal i cl = negate_head (make_last i cl);
quigley@15642
   255
quigley@15642
   256
 fun get_axioms_used proof_steps thmstring = let 
quigley@15642
   257
                                             val  outfile = TextIO.openOut("foo_ax_thmstr");                                                                       
quigley@15642
   258
                                             val _ = TextIO.output (outfile, thmstring)
quigley@15642
   259
                                             
quigley@15642
   260
                                             val _ =  TextIO.closeOut outfile
quigley@15642
   261
                                            (* not sure why this is necessary again, but seems to be *)
quigley@15642
   262
                                            val _=  (print_mode := (Library.gen_rems (op =) (! print_mode, ["xsymbols", "symbols"])))
quigley@15642
   263
                                            val axioms = get_init_axioms proof_steps
quigley@15642
   264
                                            val step_nums = get_step_nums axioms []
quigley@15642
   265
                                            val thm = thm_of_string thmstring
quigley@15642
   266
                                            val clauses = make_clauses [thm]
quigley@15642
   267
                                            
quigley@15642
   268
                                            val vars = map thm_vars clauses
quigley@15642
   269
                                           
quigley@15642
   270
                                            val distvars = distinct (fold append vars [])
quigley@15642
   271
                                            val clause_terms = map prop_of clauses  
quigley@15642
   272
                                            val clause_frees = onelist (map term_frees clause_terms) []
quigley@15642
   273
quigley@15642
   274
                                            val frees = map lit_string_with_nums clause_frees;
quigley@15642
   275
quigley@15642
   276
                                            val distfrees = distinct frees
quigley@15642
   277
quigley@15642
   278
                                            val metas = map make_meta_clause clauses
quigley@15642
   279
                                            val ax_strs = map (three_of_three ) axioms
quigley@15642
   280
quigley@15642
   281
                                            (* literals of -all- axioms, not just those used by spass *)
quigley@15642
   282
                                            val meta_strs = map get_meta_lits metas
quigley@15642
   283
                                           
quigley@15642
   284
                                            val metas_and_strs = zip  metas meta_strs
quigley@15642
   285
                                             val  outfile = TextIO.openOut("foo_clauses");                                                                       
quigley@15642
   286
                                             val _ = TextIO.output (outfile, (onestr ax_strs ""))
quigley@15642
   287
                                             
quigley@15642
   288
                                             val _ =  TextIO.closeOut outfile
quigley@15642
   289
                                             val  outfile = TextIO.openOut("foo_metastrs");                                                                       
quigley@15642
   290
                                             val _ = TextIO.output (outfile, (onestr meta_strs ""))
quigley@15642
   291
                                             val _ =  TextIO.closeOut outfile
quigley@15642
   292
quigley@15642
   293
                                            (* get list of axioms as thms with their variables *)
quigley@15642
   294
quigley@15642
   295
                                            val ax_metas = get_assoc_snds ax_strs metas_and_strs []
quigley@15642
   296
                                            val ax_vars = map thm_vars ax_metas
quigley@15642
   297
                                            val ax_with_vars = zip ax_metas ax_vars
quigley@15642
   298
quigley@15642
   299
                                            (* get list of extra axioms as thms with their variables *)
quigley@15642
   300
                                            val extra_metas = add_if_not_inlist metas ax_metas []
quigley@15642
   301
                                            val extra_vars = map thm_vars extra_metas
quigley@15642
   302
                                            val extra_with_vars = if (not (extra_metas = []) ) 
quigley@15642
   303
                                                                  then
quigley@15642
   304
 									 zip extra_metas extra_vars
quigley@15642
   305
                                                                  else
quigley@15642
   306
                                                                         []
quigley@15642
   307
quigley@15642
   308
                                           (* val _=  (print_mode := (Library.gen_rems (op =) (! print_mode, ["xsymbols", "symbols"])))
quigley@15642
   309
                                           val  outfile = TextIO.openOut("foo_metas")
quigley@15642
   310
quigley@15642
   311
                                           val _ = TextIO.output (outfile, ((thmstrings ax_metas "")))
quigley@15642
   312
                                           val _ =  TextIO.closeOut outfile
quigley@15642
   313
                                            val execperl = Unix.execute("/usr/bin/perl", ["remchars2.pl <foo_metas >foo_metas2"])
quigley@15642
   314
                                         val infile = TextIO.openIn("foo_metas2")
quigley@15642
   315
                                        val ax_metas_str = TextIO.inputLine (infile)
quigley@15642
   316
                                        val _ = TextIO.closeIn infile
quigley@15642
   317
                                           val _= (print_mode := (["xsymbols", "symbols"] @ ! print_mode))*)
quigley@15642
   318
                                           
quigley@15642
   319
                                         in
quigley@15642
   320
                                            (distfrees,distvars, extra_with_vars,ax_with_vars, (zip step_nums ax_metas))
quigley@15642
   321
                                         end
quigley@15642
   322
                                        
quigley@15642
   323
fun thmstrings [] str = str
quigley@15642
   324
|   thmstrings (x::xs) str = thmstrings xs (str^(string_of_thm x))
quigley@15642
   325
quigley@15642
   326
fun numclstr (vars, []) str = str
quigley@15642
   327
|   numclstr ( vars, ((num, thm)::rest)) str = let val newstr = str^(string_of_int num)^" "^(string_of_thm thm)^" "
quigley@15642
   328
                               in
quigley@15642
   329
                                   numclstr  (vars,rest) newstr
quigley@15642
   330
                               end
quigley@15642
   331
quigley@15642
   332
(*
quigley@15642
   333
quigley@15642
   334
val proofstr = "Did parsing on Here is a proof with depth 4, length 9 :\
quigley@15642
   335
\1[0:Inp] || v_P(tconst_fun(typ__da_a,tconst_bool),v_x)*+ -> v_P(tconst_fun(typ__da_a,tconst_bool),U)*.\
quigley@15642
   336
\3[0:Inp] || v_P(tconst_fun(typ__da_a,tconst_bool),U)*+ -> v_P(tconst_fun(typ__da_a,tconst_bool),v_x)*.\
quigley@15642
   337
\5[0:Inp] ||  -> v_P(tconst_fun(typ__da_a,tconst_bool),U)* v_P(tconst_fun(typ__da_a,tconst_bool),v_xa)*.\
quigley@15642
   338
\7[0:Inp] || v_P(tconst_fun(typ__da_a,tconst_bool),U)*+ v_P(tconst_fun(typ__da_a,tconst_bool),v_xb)* -> .\
quigley@15642
   339
\9[0:Fac:5.0,5.1] ||  -> v_P(tconst_fun(typ__da_a,tconst_bool),v_xa)*.\
quigley@15642
   340
\10[0:Res:9.0,3.0] ||  -> v_P(tconst_fun(typ__da_a,tconst_bool),v_x)*.\
quigley@15642
   341
\11[0:Res:10.0,1.0] ||  -> v_P(tconst_fun(typ__da_a,tconst_bool),U)*.\
quigley@15642
   342
\12[0:Fac:7.0,7.1] || v_P(tconst_fun(typ__da_a,tconst_bool),v_xb)* -> .\
quigley@15642
   343
\14[0:Res:11.0,12.0] ||  -> .\
quigley@15642
   344
\Formulae used in the proof :"
quigley@15642
   345
quigley@15642
   346
*)
quigley@15642
   347
quigley@15642
   348
quigley@15642
   349
fun addvars  c (a,b)  = (a,b,c)
quigley@15642
   350
quigley@15642
   351
quigley@15642
   352
quigley@15642
   353
(*********************************************************************)
quigley@15642
   354
(* Pass in spass string of proof and string version of isabelle goal *)
quigley@15642
   355
(* Get out reconstruction steps as a string to be sent to Isabelle   *)
quigley@15642
   356
(*********************************************************************)
quigley@15642
   357
quigley@15642
   358
quigley@15642
   359
(*
quigley@15642
   360
quigley@15642
   361
quigley@15642
   362
val proofstr = "Here is a proof with depth 2, length 5 :\
quigley@15642
   363
\1[0:Inp] ||  -> v_P(tconst_fun(typ__asc39_a,tconst_bool),U)*.\
quigley@15642
   364
\3[0:Inp] || v_Q(tconst_fun(typ__asc39_a,tconst_bool),U)* -> .\
quigley@15642
   365
\5[0:Inp] || v_P(tconst_fun(typ__asc39_a,tconst_bool),v_x)* -> v_Q(tconst_fun(typ__asc39_a,tconst_bool),v_xa).\
quigley@15642
   366
\7[0:Res:1.0,5.0] ||  -> v_Q(tconst_fun(typ__asc39_a,tconst_bool),v_xa)*.\
quigley@15642
   367
\9[0:Res:7.0,3.0] ||  -> .\
quigley@15642
   368
\Formulae used in the proof :"
quigley@15642
   369
quigley@15642
   370
quigley@15642
   371
val proofstr = "Here is a proof with depth 4, length 9 :\
quigley@15642
   372
\1[0:Inp] || v_P(tconst_fun(typ__asc39_a,tconst_bool),v_x)*+ -> v_P(tconst_fun(typ__asc39_a,tconst_bool),U)*.\
quigley@15642
   373
\3[0:Inp] || v_P(tconst_fun(typ__asc39_a,tconst_bool),U)*+ -> v_P(tconst_fun(typ__asc39_a,tconst_bool),v_x)*.\
quigley@15642
   374
\5[0:Inp] ||  -> v_P(tconst_fun(typ__asc39_a,tconst_bool),U)* v_P(tconst_fun(typ__asc39_a,tconst_bool),v_xa)*.\
quigley@15642
   375
\7[0:Inp] || v_P(tconst_fun(typ__asc39_a,tconst_bool),U)*+ v_P(tconst_fun(typ__asc39_a,tconst_bool),v_xb)* -> .\
quigley@15642
   376
\9[0:Fac:5.0,5.1] ||  -> v_P(tconst_fun(typ__asc39_a,tconst_bool),v_xa)*.\
quigley@15642
   377
\10[0:Res:9.0,3.0] ||  -> v_P(tconst_fun(typ__asc39_a,tconst_bool),v_x)*.\
quigley@15642
   378
\11[0:Res:10.0,1.0] ||  -> v_P(tconst_fun(typ__asc39_a,tconst_bool),U)*.\
quigley@15642
   379
\12[0:Fac:7.0,7.1] || v_P(tconst_fun(typ__asc39_a,tconst_bool),v_xb)* -> .\
quigley@15642
   380
\14[0:Res:11.0,12.0] ||  -> .\
quigley@15642
   381
\Formulae used in the proof :";
quigley@15642
   382
quigley@15642
   383
quigley@15642
   384
val thmstring = " (~ (P::'a::type => bool) (x::'a::type) | P (U::'a::type)) & (~ (P::'a::type => bool) (U::'a::type) | P (x::'a::type)) & ((P::'a::type => bool) (xa::'a::type) | P (U::'a::type)) & (~ (P::'a::type => bool) (U::'a::type) | ~ P (xb::'a::type))";
quigley@15642
   385
quigley@15642
   386
val thmstring = "(ALL xb::'a::type.   (~ (P::'a::type => bool) ((x::'a::type => 'a::type) xb) |    (Q::'a::type => bool) ((xa::'a::type => 'a::type) xb)) &   P xb & ~ Q xb)"
quigley@15642
   387
quigley@15642
   388
quigley@15642
   389
val thmstring ="(ALL xb::'a::type.   (~ (P::'a::type => bool) ((x::'a::type => 'a::type) xb) |    (Q::'a::type => bool) ((xa::'a::type => 'a::type) xb)) &   P xb & ~ Q xb)"
quigley@15642
   390
quigley@15642
   391
val proofstr = "Did parsing on Here is a proof with depth 2, length 5 :\
quigley@15642
   392
\1[0:Inp] ||  -> v_P(tconst_fun(typ__asc39_a,tconst_bool),U)*.\
quigley@15642
   393
\3[0:Inp] || v_Q(tconst_fun(typ__asc39_a,tconst_bool),U)* -> .\
quigley@15642
   394
\5[0:Inp] || v_P(tconst_fun(typ__asc39_a,tconst_bool),v_x(tconst_fun(typ__asc39_a,typ__asc39_a),U))* -> v_Q(tconst_fun(typ__asc39_a,tconst_bool),v_xa(tconst_fun(typ__asc39_a,typ__asc39_a),U)).\
quigley@15642
   395
\7[0:Res:1.0,5.0] ||  -> v_Q(tconst_fun(typ__asc39_a,tconst_bool),v_xa(tconst_fun(typ__asc39_a,typ__asc39_a),U))*.\
quigley@15642
   396
\9[0:Res:7.0,3.0] ||  -> .\
quigley@15642
   397
\Formulae used in the proof :";
quigley@15642
   398
quigley@15642
   399
*)
quigley@15642
   400
quigley@15642
   401
quigley@15642
   402
fun spassString_to_reconString proofstr thmstring = 
quigley@15642
   403
                                              let val  outfile = TextIO.openOut("thmstringfile");                                                                                      val _= warning("proofstr is: "^proofstr);
quigley@15642
   404
                                                  val _ = warning ("thmstring is: "^thmstring);
quigley@15642
   405
                                                  val _ = TextIO.output (outfile, (thmstring))
quigley@15642
   406
                                                  val _ =  TextIO.closeOut outfile
quigley@15642
   407
                                                  val proofextract = extract_proof proofstr
quigley@15642
   408
                                                  val tokens = fst(lex proofextract)
quigley@15642
   409
                                                     
quigley@15642
   410
                                              (***********************************)
quigley@15642
   411
                                              (* parse spass proof into datatype *)
quigley@15642
   412
                                              (***********************************)
quigley@15642
   413
quigley@15642
   414
                                                  val proof_steps1 = parse tokens
quigley@15642
   415
                                                  val proof_steps = just_change_space proof_steps1
quigley@15642
   416
quigley@15642
   417
                                                  val  outfile = TextIO.openOut("foo_parse");                                                                                          val _ = TextIO.output (outfile, ("Did parsing on "^proofstr))
quigley@15642
   418
                                                  val _ =  TextIO.closeOut outfile
quigley@15642
   419
                                                
quigley@15642
   420
                                                  val  outfile = TextIO.openOut("foo_thmstring_at_parse");                                                                             val _ = TextIO.output (outfile, ("Parsing for thmstring: "^thmstring))
quigley@15642
   421
                                                  val _ =  TextIO.closeOut outfile
quigley@15642
   422
                                              (************************************)
quigley@15642
   423
                                              (* recreate original subgoal as thm *)
quigley@15642
   424
                                              (************************************)
quigley@15642
   425
                                                
quigley@15642
   426
                                                  (* get axioms as correctly numbered clauses w.r.t. the Spass proof *)
quigley@15642
   427
                                                  val (frees,vars,extra_with_vars ,ax_with_vars,numcls) = get_axioms_used proof_steps thmstring
quigley@15642
   428
                                                  
quigley@15642
   429
                                                  (*val numcls_string = numclstr ( vars, numcls) ""*)
quigley@15642
   430
                                                  val  outfile = TextIO.openOut("foo_axiom");                                                                            val _ = TextIO.output (outfile,"got axioms")
quigley@15642
   431
                                                  val _ =  TextIO.closeOut outfile
quigley@15642
   432
                                                    
quigley@15642
   433
                                              (************************************)
quigley@15642
   434
                                              (* translate proof                  *)
quigley@15642
   435
                                              (************************************)
quigley@15642
   436
                                                  val  outfile = TextIO.openOut("foo_steps");                                                          val _ = TextIO.output (outfile, ("about to translate proof, steps: "^(init_proofsteps_to_string proof_steps "")))
quigley@15642
   437
                                                  val _ =  TextIO.closeOut outfile
quigley@15642
   438
                                                  val (newthm,proof) = translate_proof numcls  proof_steps vars
quigley@15642
   439
                                                  val  outfile = TextIO.openOut("foo_steps2");                                                                         val _ = TextIO.output (outfile, ("translated proof, steps: "^(init_proofsteps_to_string proof_steps "")))
quigley@15642
   440
                                                  val _ =  TextIO.closeOut outfile
quigley@15642
   441
                                              (***************************************************)
quigley@15642
   442
                                              (* transfer necessary steps as strings to Isabelle *)
quigley@15642
   443
                                              (***************************************************)
quigley@15642
   444
                                                  (* turn the proof into a string *)
quigley@15642
   445
                                                  val reconProofStr = proofs_to_string proof ""
quigley@15642
   446
                                                  (* do the bit for the Isabelle ordered axioms at the top *)
quigley@15642
   447
                                                  val ax_nums = map fst numcls
quigley@15642
   448
                                                  val ax_strs = map get_meta_lits_bracket (map snd numcls)
quigley@15642
   449
                                                  val numcls_strs = zip ax_nums ax_strs
quigley@15642
   450
                                                  val num_cls_vars =  map (addvars vars) numcls_strs;
quigley@15642
   451
                                                  val reconIsaAxStr = origAxs_to_string (zip ax_nums ax_with_vars) ""
quigley@15642
   452
                                                  
quigley@15642
   453
                                                  val extra_nums = if (not (extra_with_vars = [])) then (1 upto (length extra_with_vars)) else []
quigley@15642
   454
                                                  val reconExtraAxStr = extraAxs_to_string ( zip extra_nums extra_with_vars) ""
quigley@15642
   455
                                                  val frees_str = "["^(thmvars_to_string frees "")^"]"
quigley@15642
   456
                                                  val  outfile = TextIO.openOut("reconstringfile");
quigley@15642
   457
quigley@15642
   458
                                                  val _ = TextIO.output (outfile, (frees_str^reconExtraAxStr^reconIsaAxStr^reconProofStr))
quigley@15642
   459
                                                  val _ =  TextIO.closeOut outfile
quigley@15642
   460
                                              in 
quigley@15642
   461
                                                   (frees_str^reconExtraAxStr^reconIsaAxStr^reconProofStr)
quigley@15642
   462
                                              end
quigley@15642
   463
                                              handle _ => (let val  outfile = TextIO.openOut("foo_handler");
quigley@15642
   464
quigley@15642
   465
                                                  val _ = TextIO.output (outfile, ("In exception handler"));
quigley@15642
   466
                                                  val _ =  TextIO.closeOut outfile
quigley@15642
   467
                                              in 
quigley@15642
   468
                                                 "Proof found but translation failed!"
quigley@15642
   469
                                              end)
quigley@15642
   470
quigley@15642
   471
quigley@15642
   472
quigley@15642
   473
quigley@15642
   474
quigley@15642
   475
quigley@15642
   476
quigley@15642
   477
quigley@15642
   478
quigley@15642
   479
(**********************************************************************************)
quigley@15642
   480
(* At other end, want to turn back into datatype so can apply reconstruct_proof.  *)
quigley@15642
   481
(* This will be done by the signal handler                                        *)
quigley@15642
   482
(**********************************************************************************)
quigley@15642
   483
quigley@15642
   484
(* Parse in the string version of the proof steps for reconstruction *)
quigley@15642
   485
(* Isar format: cl1 [BINARY 0 cl2 0];cl1 [PARAMOD 0 cl2 0]; cl1 [DEMOD 0 cl2];cl1 [FACTOR 1 2];*)
quigley@15642
   486
quigley@15642
   487
quigley@15642
   488
 val term_numstep =
quigley@15642
   489
        (number ++ (a (Other ",")) ++ number) >> (fn (a, (_, c)) => (a, c))
quigley@15642
   490
quigley@15642
   491
val extraaxiomstep = (a (Word "ExtraAxiom"))++ (a (Other "(")) ++(a (Other ")"))
quigley@15642
   492
            >> (fn (_) => ExtraAxiom)
quigley@15642
   493
quigley@15642
   494
quigley@15642
   495
quigley@15642
   496
val origaxiomstep = (a (Word "OrigAxiom"))++ (a (Other "(")) ++(a (Other ")"))
quigley@15642
   497
            >> (fn (_) => OrigAxiom)
quigley@15642
   498
quigley@15642
   499
quigley@15642
   500
 val axiomstep = (a (Word "Axiom"))++ (a (Other "(")) ++(a (Other ")"))
quigley@15642
   501
            >> (fn (_) => Axiom)
quigley@15642
   502
     
quigley@15642
   503
quigley@15642
   504
quigley@15642
   505
      
quigley@15642
   506
 val binarystep = (a (Word "Binary")) ++ (a (Other "(")) ++ (a (Other "(")) 
quigley@15642
   507
                   ++ term_numstep  ++ (a (Other ")")) ++ (a (Other ","))
quigley@15642
   508
                   ++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
quigley@15642
   509
            >> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => Binary (c,e))
quigley@15642
   510
      
quigley@15642
   511
quigley@15642
   512
 val parastep = (a (Word "Para")) ++ (a (Other "(")) ++ (a (Other "(")) 
quigley@15642
   513
                   ++ term_numstep  ++ (a (Other ")")) ++ (a (Other ","))
quigley@15642
   514
                   ++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
quigley@15642
   515
            >> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => Para(c, e))
quigley@15642
   516
      
quigley@15642
   517
 val mrrstep = (a (Word "MRR")) ++ (a (Other "(")) ++ (a (Other "(")) 
quigley@15642
   518
                   ++ term_numstep  ++ (a (Other ")")) ++ (a (Other ","))
quigley@15642
   519
                   ++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
quigley@15642
   520
            >> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => MRR(c, e))
quigley@15642
   521
      
quigley@15642
   522
quigley@15642
   523
 val factorstep = (a (Word "Factor")) ++ (a (Other "("))
quigley@15642
   524
                    ++ number ++ (a (Other ","))
quigley@15642
   525
                       ++ number ++ (a (Other ","))
quigley@15642
   526
                       ++ number ++  (a (Other ")"))
quigley@15642
   527
                   
quigley@15642
   528
            >> (fn (_, (_, (c, (_, (e,(_,(f,_))))))) =>  Factor (c,e,f))
quigley@15642
   529
quigley@15642
   530
quigley@15642
   531
val rewritestep = (a (Word "Rewrite"))  ++ (a (Other "(")) ++ (a (Other "(")) 
quigley@15642
   532
                   ++ term_numstep  ++ (a (Other ")")) ++ (a (Other ","))
quigley@15642
   533
                   ++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
quigley@15642
   534
            >> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => Rewrite (c,e))
quigley@15642
   535
quigley@15642
   536
val obviousstep = (a (Word "Obvious")) ++ (a (Other "(")) 
quigley@15642
   537
                   ++ term_numstep  ++ (a (Other ")")) 
quigley@15642
   538
            >> (fn (_, (_, (c,_))) => Obvious (c))
quigley@15642
   539
quigley@15642
   540
 val methodstep = extraaxiomstep || origaxiomstep || axiomstep ||binarystep || factorstep|| parastep || mrrstep || rewritestep || obviousstep
quigley@15642
   541
quigley@15642
   542
quigley@15642
   543
 val number_list_step =
quigley@15642
   544
        ( number ++ many ((a (Other ",") ++ number)>> snd))
quigley@15642
   545
        >> (fn (a,b) => (a::b))
quigley@15642
   546
        
quigley@15642
   547
 val numberlist_step = a (Other "[")  ++ a (Other "]")
quigley@15642
   548
                        >>(fn (_,_) => ([]:int list))
quigley@15642
   549
                       || a (Other "[") ++ number_list_step ++ a (Other "]")
quigley@15642
   550
                        >>(fn (_,(a,_)) => a)
quigley@15642
   551
                    
quigley@15642
   552
quigley@15642
   553
quigley@15642
   554
(** change this to allow P (x U) *)
quigley@15642
   555
 fun arglist_step input = ( word ++ many  word >> (fn (a, b) => (a^" "^(implode_with_space b)))
quigley@15642
   556
                           ||word >> (fn (a) => (a)))input
quigley@15642
   557
                
quigley@15642
   558
quigley@15642
   559
fun literal_step input = (word ++ a (Other "(") ++ arglist_step ++  a (Other ")")
quigley@15642
   560
                                          >>(fn (a, (b, (c,d))) => (a^" ("^(c)^")"))
quigley@15642
   561
                        || arglist_step >> (fn (a) => (a)))input
quigley@15642
   562
                           
quigley@15642
   563
quigley@15642
   564
quigley@15642
   565
(* fun term_step input = (a (Other "~") ++ arglist_step ++ a (Other "%")>> (fn (a,(b,c)) => ("~ "^b))
quigley@15642
   566
                     ||  arglist_step ++ a (Other "%")>> (fn (a,b) => a ))input
quigley@15642
   567
*)
quigley@15642
   568
quigley@15642
   569
quigley@15642
   570
 fun term_step input = (a (Other "~") ++ literal_step ++ a (Other "%")>> (fn (a,(b,c)) => ("~ "^b))
quigley@15642
   571
                     ||  literal_step ++ a (Other "%")>> (fn (a,b) => a ))input
quigley@15642
   572
quigley@15642
   573
quigley@15642
   574
         
quigley@15642
   575
quigley@15642
   576
 val term_list_step =
quigley@15642
   577
        (  term_step ++ many ( term_step))
quigley@15642
   578
        >> (fn (a,b) => (a::b))
quigley@15642
   579
        
quigley@15642
   580
 
quigley@15642
   581
val term_lists_step = a (Other "[")  ++ a (Other "]")
quigley@15642
   582
                        >>(fn (_,_) => ([]:string list))
quigley@15642
   583
                       || a (Other "[") ++ term_list_step ++ a (Other "]")
quigley@15642
   584
                        >>(fn (_,(a,_)) => a)
quigley@15642
   585
                     
quigley@15642
   586
quigley@15642
   587
quigley@15642
   588
quigley@15642
   589
fun anytoken_step input  = (word>> (fn (a) => a)  ) input
quigley@15642
   590
                       handle NOPARSE_WORD => (number>> (fn (a) => string_of_int a)  ) input
quigley@15642
   591
                      handle NOPARSE_NUMBER => (other_char >> (fn(a) => a)) input
quigley@15642
   592
quigley@15642
   593
quigley@15642
   594
quigley@15642
   595
fun goalstring_step input= (anytoken_step ++ many (anytoken_step )
quigley@15642
   596
                  >> (fn (a,b) =>  (a^" "^(implode b)))) input
quigley@15642
   597
quigley@15642
   598
quigley@15642
   599
quigley@15642
   600
 val linestep = number ++ methodstep ++ term_lists_step ++ term_lists_step
quigley@15642
   601
                >> (fn (a, (b, (c,d))) => (a,(b,c,d)))
quigley@15642
   602
    
quigley@15642
   603
 val lines_step = many linestep
quigley@15642
   604
quigley@15642
   605
 val alllines_step = (term_lists_step ++ lines_step ) ++ finished >> fst
quigley@15642
   606
    
quigley@15642
   607
 val parse_step = fst o alllines_step
quigley@15642
   608
quigley@15642
   609
quigley@15642
   610
 (*
quigley@15642
   611
val reconstr ="[P%x%xa%xb%]1OrigAxiom()[P x%~ P U%][U%]3OrigAxiom()[P U%~ P x%][U%]5OrigAxiom()[~ P xa%~ P U%][U%]7OrigAxiom()[P U%P xb%][U%]1Axiom()[P x%~ P U%][U%]3Axiom()[P U%~ P x%][U%]5Axiom()[~ P U%~ P xa%][U%]7Axiom()[P U%P xb%][U%]9Factor(5,0,1)[~ P xa%][]10Binary((9,0),(3,0))[~ P x%][]11Binary((10,0),(1,0))[~ P U%][U%]12Factor(7,0,1)[P xb%][]14Binary((11,0),(12,0))[][]%(EX x::'a::type. ALL y::'a::type. (P::'a::type => bool) x = P y) -->(EX x::'a::type. P x) = (ALL y::'a::type. P y)"
quigley@15642
   612
*)
quigley@15642
   613
quigley@15642
   614
(************************************************************)
quigley@15642
   615
(* Construct an Isar style proof from a list of proof steps *)
quigley@15642
   616
(************************************************************)
quigley@15642
   617
(* want to assume all axioms, then do haves for the other clauses*)
quigley@15642
   618
(* then show for the last step *)
quigley@15642
   619
fun one_of_three (a,b,c) = a;
quigley@15642
   620
fun two_of_three (a,b,c) = b;
quigley@15642
   621
fun three_of_three (a,b,c) = c;
quigley@15642
   622
quigley@15642
   623
(* replace ~ by not here *)
quigley@15642
   624
fun change_nots [] = []
quigley@15642
   625
|   change_nots (x::xs) = if x = "~" 
quigley@15642
   626
                          then 
quigley@15642
   627
                             ["\\", "<", "n", "o", "t", ">"]@(change_nots xs)
quigley@15642
   628
                          else (x::(change_nots xs))
quigley@15642
   629
quigley@15642
   630
(*
quigley@15642
   631
fun clstrs_to_string [] str = str
quigley@15642
   632
|   clstrs_to_string (x::[]) str = str^x
quigley@15642
   633
|   clstrs_to_string (x::xs) str = clstrs_to_string xs (str^(x^"; "))
quigley@15642
   634
*)
quigley@15642
   635
fun clstrs_to_string [] str = implode (change_nots (explode str))
quigley@15642
   636
|   clstrs_to_string (x::[]) str = implode (change_nots (explode (str^x)))
quigley@15642
   637
|   clstrs_to_string (x::xs) str = implode (change_nots (explode (clstrs_to_string xs (str^(x^"; ")))))
quigley@15642
   638
quigley@15642
   639
quigley@15642
   640
quigley@15642
   641
fun thmvars_to_quantstring [] str = str
quigley@15642
   642
|   thmvars_to_quantstring (x::[]) str =str^x^". "
quigley@15642
   643
|   thmvars_to_quantstring (x::xs) str = thmvars_to_quantstring xs (str^(x^" "))
quigley@15642
   644
quigley@15642
   645
quigley@15642
   646
fun clause_strs_to_isar clstrs [] =  "\"\\<lbrakk>"^(clstrs_to_string clstrs "")^"\\<rbrakk> "^" \\<Longrightarrow> False\""
quigley@15642
   647
|   clause_strs_to_isar clstrs thmvars = "\"\\<And>"^(thmvars_to_quantstring thmvars "")^"\\<lbrakk>"^(clstrs_to_string clstrs "")^"\\<rbrakk> "^"\\<Longrightarrow> False\""
quigley@15642
   648
quigley@15642
   649
fun frees_to_string [] str = implode (change_nots (explode str))
quigley@15642
   650
|   frees_to_string (x::[]) str = implode (change_nots (explode (str^x)))
quigley@15642
   651
|   frees_to_string  (x::xs) str = implode (change_nots (explode (frees_to_string xs (str^(x^" ")))))
quigley@15642
   652
quigley@15642
   653
fun frees_to_isar_str [] =  ""
quigley@15642
   654
|   frees_to_isar_str  clstrs = (frees_to_string clstrs "")
quigley@15642
   655
quigley@15642
   656
quigley@15642
   657
(***********************************************************************)
quigley@15642
   658
(* functions for producing assumptions for the Isabelle ordered axioms *)
quigley@15642
   659
(***********************************************************************)
quigley@15642
   660
(*val str = "[P%x%xa%xb%]1OrigAxiom()[P x%~ P U%][U%]3OrigAxiom()[P U%~ P x%][U%]5OrigAxiom()[~ P xa%~ P U%][U%]7OrigAxiom()[P U%P xb%][U%]1Axiom()[P x%~ P U%][U%]3Axiom()[P U%~ P x%][U%]5Axiom()[~ P U%~ P xa%][U%]7Axiom()[P U%P xb%][U%]9Factor(5,0,1)[~ P xa%][]10Binary((9,0),(3,0))[~ P x%][]11Binary((10,0),(1,0))[~ P U%][U%]12Factor(7,0,1)[P xb%][]14Binary((11,0),(12,0))[][]";       
quigley@15642
   661
num, rule, clausestrs, vars*)
quigley@15642
   662
quigley@15642
   663
quigley@15642
   664
(* assume the extra clauses - not used in Spass proof *)
quigley@15642
   665
quigley@15642
   666
fun is_extraaxiom_step ( num:int,(ExtraAxiom, str, tstr)) = true
quigley@15642
   667
|   is_extraaxiom_step (num, _) = false
quigley@15642
   668
quigley@15642
   669
fun get_extraaxioms xs = List.filter (is_extraaxiom_step) ( xs)
quigley@15642
   670
quigley@15642
   671
fun assume_isar_extraaxiom [] str  = str
quigley@15642
   672
|   assume_isar_extraaxiom ((numb,(step, clstr, thmvars))::xs) str  = assume_isar_extraaxiom xs (str^"and cl"^(string_of_int numb)^"': "^(clause_strs_to_isar clstr thmvars)^"\n " )
quigley@15642
   673
quigley@15642
   674
quigley@15642
   675
quigley@15642
   676
fun assume_isar_extraaxioms  [] = ""
quigley@15642
   677
|assume_isar_extraaxioms ((numb,(step, clstrs, thmstrs))::xs) = let val str = "assume cl"^(string_of_int numb)^"': "^(clause_strs_to_isar clstrs thmstrs)^"\n" 
quigley@15642
   678
                                         in
quigley@15642
   679
                                             assume_isar_extraaxiom xs str
quigley@15642
   680
                                         end
quigley@15642
   681
quigley@15642
   682
(* assume the Isabelle ordered clauses *)
quigley@15642
   683
quigley@15642
   684
fun is_origaxiom_step ( num:int,(OrigAxiom, str, tstr)) = true
quigley@15642
   685
|   is_origaxiom_step (num, _) = false
quigley@15642
   686
quigley@15642
   687
fun get_origaxioms xs = List.filter (is_origaxiom_step) ( xs)
quigley@15642
   688
quigley@15642
   689
fun assume_isar_origaxiom [] str  = str
quigley@15642
   690
|   assume_isar_origaxiom ((numb,(step, clstr, thmvars))::xs) str  = assume_isar_origaxiom xs (str^"and cl"^(string_of_int numb)^"': "^(clause_strs_to_isar clstr thmvars)^"\n " )
quigley@15642
   691
quigley@15642
   692
quigley@15642
   693
quigley@15642
   694
fun assume_isar_origaxioms ((numb,(step, clstrs, thmstrs))::xs) = let val str = "assume cl"^(string_of_int numb)^"': "^(clause_strs_to_isar clstrs thmstrs)^"\n" 
quigley@15642
   695
                                         in
quigley@15642
   696
                                             assume_isar_origaxiom xs str
quigley@15642
   697
                                         end
quigley@15642
   698
quigley@15642
   699
quigley@15642
   700
quigley@15642
   701
fun is_axiom_step ( num:int,(Axiom, str, tstr)) = true
quigley@15642
   702
|   is_axiom_step (num, _) = false
quigley@15642
   703
quigley@15642
   704
fun get_axioms xs = List.filter  (is_axiom_step) ( xs)
quigley@15642
   705
quigley@15642
   706
fun have_isar_axiomline (numb,(step, clstrs, thmstrs))="have cl"^(string_of_int numb)^": "^(clause_strs_to_isar clstrs thmstrs)^"\n"
quigley@15642
   707
quigley@15642
   708
fun  by_isar_axiomline (numb,(step, clstrs, thmstrs))="by (rule cl"^ (string_of_int numb)^"') \n"
quigley@15642
   709
quigley@15642
   710
quigley@15642
   711
fun isar_axiomline (numb, (step, clstrs, thmstrs))  = (have_isar_axiomline (numb,(step,clstrs, thmstrs )))^( by_isar_axiomline(numb,(step,clstrs, thmstrs )) )
quigley@15642
   712
quigley@15642
   713
quigley@15642
   714
fun isar_axiomlines [] str = str
quigley@15642
   715
|   isar_axiomlines (x::xs) str = isar_axiomlines xs (str^(isar_axiomline x))
quigley@15642
   716
quigley@15642
   717
quigley@15642
   718
fun have_isar_line (numb,(step, clstrs, thmstrs))="have cl"^(string_of_int numb)^": "^(clause_strs_to_isar clstrs thmstrs)^"\n"
quigley@15642
   719
quigley@15642
   720
quigley@15642
   721
fun  by_isar_line ((Binary ((a,b), (c,d))))="by(rule cl"^
quigley@15642
   722
                                                  (string_of_int a)^" [BINARY "^(string_of_int b)^" "^"cl"^
quigley@15642
   723
                                                  (string_of_int c)^" "^(string_of_int d)^"])"^"\n"
quigley@15642
   724
|   by_isar_line ( (Para ((a,b), (c,d)))) ="by (rule cl"^
quigley@15642
   725
                                                  (string_of_int a)^" [PARAMOD "^(string_of_int b)^" "^"cl"^
quigley@15642
   726
                                                  (string_of_int c)^" "^(string_of_int d)^"])"^"\n"
quigley@15642
   727
|   by_isar_line ((Factor ((a,b,c)))) =    "by (rule cl"^(string_of_int a)^" [FACTOR "^(string_of_int b)^" "^
quigley@15642
   728
                                                  (string_of_int c)^" "^"])"^"\n"
quigley@15642
   729
|   by_isar_line ( (Rewrite ((a,b),(c,d)))) =  "by (rule cl"^(string_of_int a)^" [DEMOD "^(string_of_int b)^" "^
quigley@15642
   730
                                                  (string_of_int c)^" "^(string_of_int d)^" "^"])"^"\n"
quigley@15642
   731
quigley@15642
   732
|   by_isar_line ( (Obvious ((a,b)))) =  "by (rule cl"^(string_of_int a)^" [OBVIOUS "^(string_of_int b)^" ])"^"\n"
quigley@15642
   733
quigley@15642
   734
fun isar_line (numb, (step, clstrs, thmstrs))  = (have_isar_line (numb,(step,clstrs, thmstrs )))^( by_isar_line step)
quigley@15642
   735
quigley@15642
   736
quigley@15642
   737
fun isar_lines [] str = str
quigley@15642
   738
|   isar_lines (x::xs) str = isar_lines xs (str^(isar_line x))
quigley@15642
   739
quigley@15642
   740
fun last_isar_line (numb,( step, clstrs,thmstrs)) = "show \"False\"\n"^(by_isar_line step)
quigley@15642
   741
quigley@15642
   742
quigley@15642
   743
fun to_isar_proof (frees, xs, goalstring) = let val extraaxioms = get_extraaxioms xs
quigley@15642
   744
                           val extraax_num = length extraaxioms
quigley@15642
   745
                           val origaxioms_and_steps = drop (extraax_num) xs  
quigley@15642
   746
                          
quigley@15642
   747
  
quigley@15642
   748
                           val origaxioms = get_origaxioms origaxioms_and_steps
quigley@15642
   749
                           val origax_num = length origaxioms
quigley@15642
   750
                           val axioms_and_steps = drop (origax_num + extraax_num) xs  
quigley@15642
   751
                           val axioms = get_axioms axioms_and_steps
quigley@15642
   752
                           
quigley@15642
   753
                           val steps = drop origax_num axioms_and_steps
quigley@15642
   754
                           val firststeps = butlast steps
quigley@15642
   755
                           val laststep = last steps
quigley@15642
   756
                           val goalstring = implode(butlast(explode goalstring))
quigley@15642
   757
                        
quigley@15642
   758
                           val isar_proof = 
quigley@15642
   759
                           ("show \""^goalstring^"\"\n")^
quigley@15642
   760
                           ("proof (rule ccontr,skolemize, make_clauses) \n")^
quigley@15642
   761
                           ("fix "^(frees_to_isar_str frees)^"\n")^
quigley@15642
   762
                           (assume_isar_extraaxioms extraaxioms)^
quigley@15642
   763
                           (assume_isar_origaxioms origaxioms)^
quigley@15642
   764
                           (isar_axiomlines axioms "")^
quigley@15642
   765
                           (isar_lines firststeps "")^
quigley@15642
   766
                           (last_isar_line laststep)^
quigley@15642
   767
                           ("qed")
quigley@15642
   768
                          val  outfile = TextIO.openOut("isar_proof_file");
quigley@15642
   769
quigley@15642
   770
                                                  val _ = TextIO.output (outfile, isar_proof)
quigley@15642
   771
                                                  val _ =  TextIO.closeOut outfile
quigley@15642
   772
quigley@15642
   773
quigley@15642
   774
                       in
quigley@15642
   775
                           isar_proof
quigley@15642
   776
                       end
quigley@15642
   777
quigley@15642
   778
(* get fix vars from axioms - all Frees *)
quigley@15642
   779
(* check each clause for meta-vars and /\ over them at each step*)
quigley@15642
   780
quigley@15642
   781
(*******************************************************)
quigley@15642
   782
(* This assumes the thm list  "numcls" is still there  *)
quigley@15642
   783
(* In reality, should probably label it with an        *)
quigley@15642
   784
(* ID number identifying the subgoal.  This could      *)
quigley@15642
   785
(* be passed over to the watcher, e.g.  numcls25       *)
quigley@15642
   786
(*******************************************************)
quigley@15642
   787
quigley@15642
   788
(* val str = "[S%x%P%R%Q%]1ExtraAxiom()[~ Q U%~ R U%][U%]2ExtraAxiom()[~ Q U%~ P U%][U%]3ExtraAxiom()[Q U%R U%][U%]1OrigAxiom()[S x%][]2OrigAxiom()[P U%R U%][U%]6OrigAxiom()[~ S U%~ P U%][U%]7OrigAxiom()[~ S U%~ R U%][U%]1Axiom()[S x%][]2Axiom()[R U%P U%][U%]6Axiom()[~ P U%~ S U%][U%]7Axiom()[~ R U%~ S U%][U%]8Binary((6,1),(1,0))[~ P x%][]9Binary((7,1),(1,0))[~ R x%][]19Binary((9,0),(2,0))[P x%][]25Binary((8,0),(19,0))[][]";
quigley@15642
   789
quigley@15642
   790
val str = "[P%x%xa%xb%]1OrigAxiom()[P x%~ P U%][U%]3OrigAxiom()[P U%~ P x%][U%]5OrigAxiom()[~ P xa%~ P U%][U%]7OrigAxiom()[P U%P xb%][U%]1Axiom()[P x%~ P U%][U%]3Axiom()[P U%~ P x%][U%]5Axiom()[~ P U%~ P xa%][U%]7Axiom()[P U%P xb%][U%]9Factor(5,0,1)[~ P xa%][]10Binary((9,0),(3,0))[~ P x%][]11Binary((10,0),(1,0))[~ P U%][U%]12Factor(7,0,1)[P xb%][]14Binary((11,0),(12,0))[][]";
quigley@15642
   791
quigley@15642
   792
val reconstr = "[P%Q%x%xa%]1OrigAxiom()[~ P U%][U%]3OrigAxiom()[Q U%][U%]5OrigAxiom()[P (x U)%~ Q (xa U)%][U%]9Binary((7,0),(3,0))[][]7Binary((1,0),(5,0))[~ Q (xa U)%][U%]5Axiom()[P (x U)%~ Q (xa U)%][U%]3Axiom()[Q U%][U%]1Axiom()[~ P U%][U%](ALL xb::'a::type.   (~ (P::'a::type => bool) ((x::'a::type => 'a::type) xb) |    (Q::'a::type => bool) ((xa::'a::type => 'a::type) xb)) &   P xb & ~ Q xb)";
quigley@15642
   793
quigley@15642
   794
quigley@15642
   795
val reconstr = "[P%x%xa%xb%]1OrigAxiom()[P x%~ P U%][U%]3OrigAxiom()[P U%~ P x%][U%]5OrigAxiom()[~ P xa%~ P U%][U%]7OrigAxiom()[P U%P xb%][U%]1Axiom()[P x%~ P U%][U%]3Axiom()[P U%~ P x%][U%]5Axiom()[~ P U%~ P xa%][U%]7Axiom()[P U%P xb%][U%]9Factor(5,0,1)[~ P xa%][]10Binary((9,0),(3,0))[~ P x%][]11Binary((10,0),(1,0))[~ P U%][U%]12Factor(7,0,1)[P xb%][]14Binary((11,0),(12,0))[][]";
quigley@15642
   796
quigley@15642
   797
val thmstring = " (ALL xa::'a::type.   (~ (P::'a::type => bool) (x::'a::type) | P xa) & (~ P xa | P x)) & (((P::'a::type => bool) (xa::'a::type) | (ALL x::'a::type. P x)) &((ALL x::'a::type. ~ P x) | ~ P (xb::'a::type)))";
quigley@15642
   798
*)
quigley@15642
   799
quigley@15642
   800
fun apply_res_thm str goalstring  = let val tokens = fst (lex str);
quigley@15642
   801
quigley@15642
   802
                                   val (frees,recon_steps) = parse_step tokens 
quigley@15642
   803
                                   val isar_str = to_isar_proof (frees, recon_steps, goalstring)
quigley@15642
   804
                                   val foo =   TextIO.openOut "foobar";
quigley@15642
   805
                               in 
quigley@15642
   806
                                  TextIO.output(foo,(isar_str));TextIO.closeOut foo;Pretty.writeln(Pretty.str  isar_str); () 
quigley@15642
   807
                               end 
quigley@15642
   808
quigley@15642
   809