src/HOL/Tools/res_reconstruct.ML
author paulson
Mon Mar 19 15:57:20 2007 +0100 (2007-03-19)
changeset 22470 0d52e5157124
parent 22428 1755e6381b2c
child 22491 535fbed859da
permissions -rwxr-xr-x
No label on "show"; tries to remove dependencies more cleanly
paulson@21978
     1
(*  ID:         $Id$
paulson@21979
     2
    Author:     L C Paulson and Claire Quigley
paulson@21978
     3
    Copyright   2004  University of Cambridge
paulson@21978
     4
*)
paulson@21978
     5
paulson@21978
     6
(***************************************************************************)
paulson@21979
     7
(*  Code to deal with the transfer of proofs from a prover process         *)
paulson@21978
     8
(***************************************************************************)
paulson@21978
     9
signature RES_RECONSTRUCT =
paulson@21978
    10
  sig
paulson@21978
    11
    val checkEProofFound: 
paulson@21978
    12
          TextIO.instream * TextIO.outstream * Posix.Process.pid * 
paulson@22012
    13
          string * Proof.context * thm * int * string Vector.vector -> bool
paulson@21978
    14
    val checkVampProofFound: 
paulson@21978
    15
          TextIO.instream * TextIO.outstream * Posix.Process.pid * 
paulson@22012
    16
          string * Proof.context * thm * int * string Vector.vector -> bool
paulson@21978
    17
    val checkSpassProofFound:  
paulson@21978
    18
          TextIO.instream * TextIO.outstream * Posix.Process.pid * 
paulson@22012
    19
          string * Proof.context * thm * int * string Vector.vector -> bool
paulson@21978
    20
    val signal_parent:  
paulson@21978
    21
          TextIO.outstream * Posix.Process.pid * string * string -> unit
paulson@21978
    22
paulson@21978
    23
  end;
paulson@21978
    24
paulson@21978
    25
structure ResReconstruct =
paulson@21978
    26
struct
paulson@21978
    27
paulson@21978
    28
val trace_path = Path.basic "atp_trace";
paulson@21978
    29
wenzelm@22130
    30
fun trace s = if !Output.debugging then File.append (File.tmp_path trace_path) s 
paulson@21978
    31
              else ();
paulson@21978
    32
paulson@21978
    33
(*Full proof reconstruction wanted*)
paulson@21978
    34
val full = ref true;
paulson@21978
    35
paulson@22044
    36
val min_deps = ref 2;    (*consolidate proof lines containing fewer dependencies*)
paulson@22044
    37
paulson@21978
    38
(**** PARSING OF TSTP FORMAT ****)
paulson@21978
    39
paulson@21978
    40
(*Syntax trees, either termlist or formulae*)
paulson@21978
    41
datatype stree = Int of int | Br of string * stree list;
paulson@21978
    42
paulson@21978
    43
fun atom x = Br(x,[]);
paulson@21978
    44
paulson@21978
    45
fun scons (x,y) = Br("cons", [x,y]);
paulson@21978
    46
val listof = foldl scons (atom "nil");
paulson@21978
    47
paulson@21978
    48
(*Strings enclosed in single quotes, e.g. filenames*)
paulson@21978
    49
val quoted = $$"'" |-- Scan.repeat (~$$"'") --| $$"'" >> implode;
paulson@21978
    50
paulson@21978
    51
(*Intended for $true and $false*)
paulson@21978
    52
fun tf s = "c_" ^ str (Char.toUpper (String.sub(s,0))) ^ String.extract(s,1,NONE);
paulson@21978
    53
val truefalse = $$"$" |-- Symbol.scan_id >> (atom o tf);
paulson@21978
    54
paulson@21978
    55
(*Integer constants, typically proof line numbers*)
paulson@21978
    56
fun is_digit s = Char.isDigit (String.sub(s,0));
paulson@21978
    57
val integer = Scan.many1 is_digit >> (valOf o Int.fromString o implode);
paulson@21978
    58
paulson@21978
    59
(*Generalized FO terms, which include filenames, numbers, etc.*)
paulson@21978
    60
fun termlist x = (term -- Scan.repeat ($$"," |-- term) >> op::) x
paulson@21978
    61
and term x = (quoted >> atom || integer>>Int || truefalse ||
paulson@21978
    62
              Symbol.scan_id -- Scan.optional ($$"(" |-- termlist --| $$")") [] >> Br ||
paulson@21978
    63
              $$"(" |-- term --| $$")" ||
paulson@21978
    64
              $$"[" |-- termlist --| $$"]" >> listof) x;
paulson@21978
    65
paulson@21978
    66
fun negate t = Br("c_Not", [t]);
paulson@21978
    67
fun equate (t1,t2) = Br("c_equal", [t1,t2]);
paulson@21978
    68
paulson@21978
    69
(*Apply equal or not-equal to a term*)
paulson@21978
    70
fun syn_equal (t, NONE) = t
paulson@21978
    71
  | syn_equal (t1, SOME (NONE, t2)) = equate (t1,t2)
paulson@21978
    72
  | syn_equal (t1, SOME (SOME _, t2)) = negate (equate (t1,t2));
paulson@21978
    73
paulson@21978
    74
(*Literals can involve negation, = and !=.*)
paulson@21978
    75
val literal = $$"~" |-- term >> negate || 
paulson@21978
    76
              (term -- Scan.option (Scan.option ($$"!") --| $$"=" -- term) >> syn_equal) ;
paulson@21978
    77
paulson@21978
    78
val literals = literal -- Scan.repeat ($$"|" |-- literal) >> op:: ;
paulson@21978
    79
paulson@21978
    80
(*Clause: a list of literals separated by the disjunction sign*)
paulson@21978
    81
val clause = $$"(" |-- literals --| $$")";
paulson@21978
    82
paulson@21978
    83
val annotations = $$"," |-- term -- Scan.option ($$"," |-- termlist);
paulson@21978
    84
paulson@21978
    85
(*<cnf_annotated> ::=Ęcnf(<name>,<formula_role>,<cnf_formula><annotations>).
paulson@21978
    86
  The <name> could be an identifier, but we assume integers.*)
paulson@21978
    87
val tstp_line = (Scan.this_string "cnf" -- $$"(") |-- 
paulson@21978
    88
                integer --| $$"," -- Symbol.scan_id --| $$"," -- 
paulson@21978
    89
                clause -- Scan.option annotations --| $$ ")";
paulson@21978
    90
paulson@21978
    91
paulson@21978
    92
(**** DUPLICATE of Susanto's code to remove ASCII armouring from names in proof files ****)
paulson@21978
    93
paulson@21978
    94
(*original file: Isabelle_ext.sml*)
paulson@21978
    95
paulson@21978
    96
val A_min_spc = Char.ord #"A" - Char.ord #" ";
paulson@21978
    97
paulson@21978
    98
fun cList2int chs = getOpt (Int.fromString (String.implode (rev chs)), 0);
paulson@21978
    99
paulson@21978
   100
(*why such a tiny range?*)
paulson@21978
   101
fun check_valid_int x =
paulson@21978
   102
  let val val_x = cList2int x
paulson@21978
   103
  in (length x = 3) andalso (val_x >= 123) andalso (val_x <= 126)
paulson@21978
   104
  end;
paulson@21978
   105
paulson@21978
   106
fun normalise_s s [] st_ sti =
paulson@21978
   107
      String.implode(rev(
paulson@21978
   108
        if st_
paulson@21978
   109
        then if null sti
paulson@21978
   110
             then (#"_" :: s)
paulson@21978
   111
             else if check_valid_int sti
paulson@21978
   112
                  then (Char.chr (cList2int sti) :: s)
paulson@21978
   113
                  else (sti @ (#"_" :: s))
paulson@21978
   114
        else s))
paulson@21978
   115
  | normalise_s s (#"_"::cs) st_ sti =
paulson@21978
   116
      if st_
paulson@21978
   117
      then let val s' = if null sti
paulson@21978
   118
                        then (#"_"::s)
paulson@21978
   119
                        else if check_valid_int sti
paulson@21978
   120
                             then (Char.chr (cList2int sti) :: s)
paulson@21978
   121
                             else (sti @ (#"_" :: s))
paulson@21978
   122
           in normalise_s s' cs false [] 
paulson@21978
   123
           end
paulson@21978
   124
      else normalise_s s cs true []
paulson@21978
   125
  | normalise_s s (c::cs) true sti =
paulson@21978
   126
      if (Char.isDigit c)
paulson@21978
   127
      then normalise_s s cs true (c::sti)
paulson@21978
   128
      else let val s' = if null sti
paulson@21978
   129
                        then if ((c >= #"A") andalso (c<= #"P"))
paulson@21978
   130
                             then ((Char.chr(Char.ord c - A_min_spc))::s)
paulson@21978
   131
                             else (c :: (#"_" :: s))
paulson@21978
   132
                        else if check_valid_int sti
paulson@21978
   133
                             then (Char.chr (cList2int sti) :: s)
paulson@21978
   134
                             else (sti @ (#"_" :: s))
paulson@21978
   135
           in normalise_s s' cs false []
paulson@21978
   136
           end
paulson@21978
   137
  | normalise_s s (c::cs) _ _ = normalise_s (c::s) cs false [];
paulson@21978
   138
paulson@21978
   139
(*This version does not look for standard prefixes first.*)
paulson@21978
   140
fun normalise_string s = normalise_s [] (String.explode s) false [];
paulson@21978
   141
paulson@21978
   142
paulson@21978
   143
(**** INTERPRETATION OF TSTP SYNTAX TREES ****)
paulson@21978
   144
paulson@21978
   145
exception STREE of stree;
paulson@21978
   146
paulson@21978
   147
(*If string s has the prefix s1, return the result of deleting it.*)
paulson@21978
   148
fun strip_prefix s1 s = 
paulson@21978
   149
  if String.isPrefix s1 s then SOME (normalise_string (String.extract (s, size s1, NONE)))
paulson@21978
   150
  else NONE;
paulson@21978
   151
paulson@21978
   152
(*Invert the table of translations between Isabelle and ATPs*)
paulson@21978
   153
val type_const_trans_table_inv =
paulson@21978
   154
      Symtab.make (map swap (Symtab.dest ResClause.type_const_trans_table));
paulson@21978
   155
paulson@21978
   156
fun invert_type_const c =
paulson@21978
   157
    case Symtab.lookup type_const_trans_table_inv c of
paulson@21978
   158
        SOME c' => c'
paulson@21978
   159
      | NONE => c;
paulson@21978
   160
paulson@21978
   161
fun make_tvar b = TVar(("'" ^ b, 0), HOLogic.typeS);
paulson@21978
   162
fun make_var (b,T) = Var((b,0),T);
paulson@21978
   163
paulson@21978
   164
(*Type variables are given the basic sort, HOL.type. Some will later be constrained
paulson@21978
   165
  by information from type literals, or by type inference.*)
paulson@21978
   166
fun type_of_stree t =
paulson@21978
   167
  case t of
paulson@21978
   168
      Int _ => raise STREE t
paulson@21978
   169
    | Br (a,ts) => 
paulson@21978
   170
        let val Ts = map type_of_stree ts
paulson@21978
   171
        in 
paulson@21978
   172
          case strip_prefix ResClause.tconst_prefix a of
paulson@21978
   173
              SOME b => Type(invert_type_const b, Ts)
paulson@21978
   174
            | NONE => 
paulson@21978
   175
                if not (null ts) then raise STREE t  (*only tconsts have type arguments*)
paulson@21978
   176
                else 
paulson@21978
   177
                case strip_prefix ResClause.tfree_prefix a of
paulson@21978
   178
                    SOME b => TFree("'" ^ b, HOLogic.typeS)
paulson@21978
   179
                  | NONE => 
paulson@21978
   180
                case strip_prefix ResClause.tvar_prefix a of
paulson@21978
   181
                    SOME b => make_tvar b
paulson@21978
   182
                  | NONE => make_tvar a   (*Variable from the ATP, say X1*)
paulson@21978
   183
        end;
paulson@21978
   184
paulson@21978
   185
(*Invert the table of translations between Isabelle and ATPs*)
paulson@21978
   186
val const_trans_table_inv =
paulson@21978
   187
      Symtab.make (map swap (Symtab.dest ResClause.const_trans_table));
paulson@21978
   188
paulson@21978
   189
fun invert_const c =
paulson@21978
   190
    case Symtab.lookup const_trans_table_inv c of
paulson@21978
   191
        SOME c' => c'
paulson@21978
   192
      | NONE => c;
paulson@21978
   193
paulson@21978
   194
(*The number of type arguments of a constant, zero if it's monomorphic*)
paulson@21978
   195
fun num_typargs thy s = length (Sign.const_typargs thy (s, Sign.the_const_type thy s));
paulson@21978
   196
paulson@21978
   197
(*Generates a constant, given its type arguments*)
paulson@21978
   198
fun const_of thy (a,Ts) = Const(a, Sign.const_instance thy (a,Ts));
paulson@21978
   199
paulson@21978
   200
(*First-order translation. No types are known for variables. HOLogic.typeT should allow
paulson@21978
   201
  them to be inferred.*)
paulson@22428
   202
fun term_of_stree args thy t =
paulson@21978
   203
  case t of
paulson@21978
   204
      Int _ => raise STREE t
paulson@22428
   205
    | Br ("hBOOL",[t]) => term_of_stree [] thy t  (*ignore hBOOL*)
paulson@22428
   206
    | Br ("hAPP",[t,u]) => term_of_stree (u::args) thy t
paulson@21978
   207
    | Br (a,ts) => 
paulson@21978
   208
        case strip_prefix ResClause.const_prefix a of
paulson@21978
   209
            SOME "equal" => 
paulson@21978
   210
              if length ts = 2 then
paulson@22428
   211
                list_comb(Const ("op =", HOLogic.typeT), List.map (term_of_stree [] thy) ts)
paulson@21978
   212
              else raise STREE t  (*equality needs two arguments*)
paulson@21978
   213
          | SOME b => 
paulson@21978
   214
              let val c = invert_const b
paulson@21978
   215
                  val nterms = length ts - num_typargs thy c
paulson@22428
   216
                  val us = List.map (term_of_stree [] thy) (List.take(ts,nterms) @ args)
paulson@22428
   217
                  (*Extra args from hAPP come AFTER any arguments given directly to the
paulson@22428
   218
                    constant.*)
paulson@21978
   219
                  val Ts = List.map type_of_stree (List.drop(ts,nterms))
paulson@21978
   220
              in  list_comb(const_of thy (c, Ts), us)  end
paulson@21978
   221
          | NONE => (*a variable, not a constant*)
paulson@21978
   222
              let val T = HOLogic.typeT
paulson@21978
   223
                  val opr = (*a Free variable is typically a Skolem function*)
paulson@21978
   224
                    case strip_prefix ResClause.fixed_var_prefix a of
paulson@21978
   225
                        SOME b => Free(b,T)
paulson@21978
   226
                      | NONE => 
paulson@21978
   227
                    case strip_prefix ResClause.schematic_var_prefix a of
paulson@21978
   228
                        SOME b => make_var (b,T)
paulson@21978
   229
                      | NONE => make_var (a,T)    (*Variable from the ATP, say X1*)
paulson@22428
   230
              in  list_comb (opr, List.map (term_of_stree [] thy) (args@ts))  end;
paulson@21978
   231
paulson@21978
   232
(*Type class literal applied to a type. Returns triple of polarity, class, type.*)                  
paulson@21978
   233
fun constraint_of_stree pol (Br("c_Not",[t])) = constraint_of_stree (not pol) t
paulson@21978
   234
  | constraint_of_stree pol t = case t of
paulson@21978
   235
        Int _ => raise STREE t
paulson@21978
   236
      | Br (a,ts) => 
paulson@21978
   237
            (case (strip_prefix ResClause.class_prefix a, map type_of_stree ts) of
paulson@21978
   238
                 (SOME b, [T]) => (pol, b, T)
paulson@21978
   239
               | _ => raise STREE t);
paulson@21978
   240
paulson@21978
   241
(** Accumulate type constraints in a clause: negative type literals **)
paulson@21978
   242
paulson@21978
   243
fun addix (key,z)  = Vartab.map_default (key,[]) (cons z);
paulson@21978
   244
paulson@21978
   245
fun add_constraint ((false, cl, TFree(a,_)), vt) = addix ((a,~1),cl) vt
paulson@21978
   246
  | add_constraint ((false, cl, TVar(ix,_)), vt) = addix (ix,cl) vt
paulson@21978
   247
  | add_constraint (_, vt) = vt;
paulson@21978
   248
paulson@21978
   249
(*False literals (which E includes in its proofs) are deleted*)
paulson@21978
   250
val nofalses = filter (not o equal HOLogic.false_const);
paulson@21978
   251
paulson@21978
   252
(*Accumulate sort constraints in vt, with "real" literals in lits.*)
paulson@22012
   253
fun lits_of_strees ctxt (vt, lits) [] = (vt, rev (nofalses lits))
paulson@22012
   254
  | lits_of_strees ctxt (vt, lits) (t::ts) = 
paulson@22012
   255
      lits_of_strees ctxt (add_constraint (constraint_of_stree true t, vt), lits) ts
paulson@21978
   256
      handle STREE _ => 
paulson@22428
   257
      lits_of_strees ctxt (vt, term_of_stree [] (ProofContext.theory_of ctxt) t :: lits) ts;
paulson@21978
   258
paulson@21978
   259
(*Update TVars/TFrees with detected sort constraints.*)
paulson@21978
   260
fun fix_sorts vt =
paulson@21978
   261
  let fun tysubst (Type (a, Ts)) = Type (a, map tysubst Ts)
paulson@21978
   262
        | tysubst (TVar (xi, s)) = TVar (xi, getOpt (Vartab.lookup vt xi, s))
paulson@21978
   263
        | tysubst (TFree (x, s)) = TFree (x, getOpt (Vartab.lookup vt (x,~1), s))
paulson@21978
   264
      fun tmsubst (Const (a, T)) = Const (a, tysubst T)
paulson@21978
   265
        | tmsubst (Free (a, T)) = Free (a, tysubst T)
paulson@21978
   266
        | tmsubst (Var (xi, T)) = Var (xi, tysubst T)
paulson@21978
   267
        | tmsubst (t as Bound _) = t
paulson@21978
   268
        | tmsubst (Abs (a, T, t)) = Abs (a, tysubst T, tmsubst t)
paulson@21978
   269
        | tmsubst (t $ u) = tmsubst t $ tmsubst u;
paulson@21978
   270
  in fn t => if Vartab.is_empty vt then t else tmsubst t end;
paulson@21978
   271
paulson@21978
   272
(*Interpret a list of syntax trees as a clause, given by "real" literals and sort constraints.
paulson@21978
   273
  vt0 holds the initial sort constraints, from the conjecture clauses.*)
paulson@22012
   274
fun clause_of_strees_aux ctxt vt0 ts = 
paulson@22012
   275
  case lits_of_strees ctxt (vt0,[]) ts of
paulson@22470
   276
      (vt, []) => HOLogic.false_const
paulson@21978
   277
    | (vt, lits) => 
paulson@21978
   278
        let val dt = fix_sorts vt (foldr1 HOLogic.mk_disj lits)
paulson@22012
   279
            val infer = Sign.infer_types (ProofContext.pp ctxt) (ProofContext.theory_of ctxt)
paulson@22012
   280
                            (ProofContext.consts_of ctxt) (Variable.def_type ctxt false)
paulson@22012
   281
                            (Variable.def_sort ctxt) (Variable.names_of ctxt) true
paulson@21978
   282
        in 
paulson@22012
   283
           #1(infer ([dt], HOLogic.boolT))
paulson@21978
   284
        end; 
paulson@21978
   285
paulson@21978
   286
(*Quantification over a list of Vars. FUXNE: for term.ML??*)
paulson@21978
   287
fun list_all_var ([], t: term) = t
paulson@21978
   288
  | list_all_var ((v as Var(ix,T)) :: vars, t) =
paulson@21979
   289
      (all T) $ Abs(string_of_indexname ix, T, abstract_over (v, list_all_var (vars,t)));
paulson@21978
   290
paulson@21978
   291
fun gen_all_vars t = list_all_var (term_vars t, t);
paulson@21978
   292
paulson@21978
   293
fun clause_of_strees thy vt0 ts =
paulson@21978
   294
  gen_all_vars (HOLogic.mk_Trueprop (clause_of_strees_aux thy vt0 ts));
paulson@21978
   295
paulson@21978
   296
fun ints_of_stree_aux (Int n, ns) = n::ns
paulson@21978
   297
  | ints_of_stree_aux (Br(_,ts), ns) = foldl ints_of_stree_aux ns ts;
paulson@21978
   298
paulson@21978
   299
fun ints_of_stree t = ints_of_stree_aux (t, []);
paulson@21978
   300
paulson@22012
   301
fun decode_tstp ctxt vt0 (name, role, ts, annots) =
paulson@21978
   302
  let val deps = case annots of NONE => [] | SOME (source,_) => ints_of_stree source
paulson@22012
   303
  in  (name, role, clause_of_strees ctxt vt0 ts, deps)  end;
paulson@21978
   304
paulson@21978
   305
fun dest_tstp ((((name, role), ts), annots), chs) =
paulson@21978
   306
  case chs of
paulson@21978
   307
          "."::_ => (name, role, ts, annots)
paulson@21978
   308
        | _ => error ("TSTP line not terminated by \".\": " ^ implode chs);
paulson@21978
   309
paulson@21978
   310
paulson@21978
   311
(** Global sort constraints on TFrees (from tfree_tcs) are positive unit clauses. **)
paulson@21978
   312
paulson@21978
   313
fun add_tfree_constraint ((true, cl, TFree(a,_)), vt) = addix ((a,~1),cl) vt
paulson@21978
   314
  | add_tfree_constraint (_, vt) = vt;
paulson@21978
   315
paulson@21978
   316
fun tfree_constraints_of_clauses vt [] = vt
paulson@21978
   317
  | tfree_constraints_of_clauses vt ([lit]::tss) = 
paulson@21978
   318
      (tfree_constraints_of_clauses (add_tfree_constraint (constraint_of_stree true lit, vt)) tss
paulson@21978
   319
       handle STREE _ => (*not a positive type constraint: ignore*)
paulson@21978
   320
       tfree_constraints_of_clauses vt tss)
paulson@21978
   321
  | tfree_constraints_of_clauses vt (_::tss) = tfree_constraints_of_clauses vt tss;
paulson@21978
   322
paulson@21978
   323
paulson@21978
   324
(**** Translation of TSTP files to Isar Proofs ****)
paulson@21978
   325
paulson@22012
   326
fun decode_tstp_list ctxt tuples =
paulson@21978
   327
  let val vt0 = tfree_constraints_of_clauses Vartab.empty (map #3 tuples)
paulson@22012
   328
  in  map (decode_tstp ctxt vt0) tuples  end;
paulson@21978
   329
paulson@21999
   330
(*FIXME: simmilar function in res_atp. Move to HOLogic?*)
paulson@21999
   331
fun dest_disj_aux (Const ("op |", _) $ t $ t') disjs = dest_disj_aux t (dest_disj_aux t' disjs)
paulson@21999
   332
  | dest_disj_aux t disjs = t::disjs;
paulson@21999
   333
paulson@21999
   334
fun dest_disj t = dest_disj_aux t [];
paulson@21999
   335
paulson@22012
   336
(*Remove types from a term, to eliminate the randomness of type inference*)
paulson@22012
   337
fun smash_types (Const(a,_)) = Const(a,dummyT)
paulson@22012
   338
  | smash_types (Free(a,_)) = Free(a,dummyT)
paulson@22012
   339
  | smash_types (Var(a,_)) = Var(a,dummyT)
paulson@22012
   340
  | smash_types (f$t) = smash_types f $ smash_types t
paulson@22012
   341
  | smash_types t = t;
paulson@22012
   342
paulson@22012
   343
val sort_lits = sort Term.fast_term_ord o dest_disj o 
paulson@22012
   344
                smash_types o HOLogic.dest_Trueprop o strip_all_body;
paulson@21999
   345
paulson@21999
   346
fun permuted_clause t =
paulson@21999
   347
  let val lits = sort_lits t
paulson@21999
   348
      fun perm [] = NONE
paulson@21999
   349
        | perm (ctm::ctms) = 
paulson@21999
   350
            if forall (op aconv) (ListPair.zip (lits, sort_lits ctm)) then SOME ctm
paulson@21999
   351
            else perm ctms
paulson@21999
   352
  in perm end;
paulson@21999
   353
paulson@22470
   354
fun have_or_show "show " lname = "show \""
paulson@22470
   355
  | have_or_show have lname = have ^ lname ^ ": \""
paulson@22470
   356
paulson@21999
   357
(*ctms is a list of conjecture clauses as yielded by Isabelle. Those returned by the
paulson@21999
   358
  ATP may have their literals reordered.*)
paulson@21999
   359
fun isar_lines ctxt ctms =
paulson@21978
   360
  let val string_of = ProofContext.string_of_term ctxt
paulson@22470
   361
      fun doline have (lname, t, []) =  (*No deps: it's a conjecture clause, with no proof.*)
paulson@21999
   362
           (case permuted_clause t ctms of
paulson@21999
   363
                SOME u => "assume " ^ lname ^ ": \"" ^ string_of u ^ "\"\n"
paulson@21999
   364
              | NONE => "assume? " ^ lname ^ ": \"" ^ string_of t ^ "\"\n")  (*no match!!*)
paulson@22470
   365
        | doline have (lname, t, deps) =
paulson@22470
   366
            have_or_show have lname ^ string_of t ^ 
paulson@22372
   367
            "\"\n  by (metis " ^ space_implode " " deps ^ ")\n"
paulson@21978
   368
      fun dolines [(lname, t, deps)] = [doline "show " (lname, t, deps)]
paulson@21978
   369
        | dolines ((lname, t, deps)::lines) = doline "have " (lname, t, deps) :: dolines lines
paulson@21978
   370
  in setmp show_sorts true dolines end;
paulson@21978
   371
paulson@21978
   372
fun notequal t (_,t',_) = not (t aconv t');
paulson@21978
   373
paulson@21978
   374
fun eq_false t = t aconv (HOLogic.mk_Trueprop HOLogic.false_const);
paulson@21978
   375
paulson@21978
   376
fun replace_dep (old, new) dep = if dep=old then new else [dep];
paulson@21978
   377
paulson@21978
   378
fun replace_deps (old, new) (lno, t, deps) = 
paulson@21978
   379
      (lno, t, List.concat (map (replace_dep (old, new)) deps));
paulson@21978
   380
paulson@21978
   381
(*Discard axioms and also False conjecture clauses (which can only contain type information).
paulson@21978
   382
  Consolidate adjacent lines that prove the same clause, since they differ only in type
paulson@21978
   383
  information.*)
paulson@21978
   384
fun add_prfline ((lno, "axiom", t, []), lines) =  (*axioms are not proof lines*)
paulson@22470
   385
      if eq_false t then lines  (*clsrel/clsarity clause: type information, ignore*)
paulson@22470
   386
      else
paulson@22470
   387
       (case take_prefix (notequal t) lines of
paulson@22470
   388
           (_,[]) => lines                  (*no repetition of proof line*)
paulson@22470
   389
         | (pre, (lno',t',deps')::post) =>  (*repetition: replace later line by earlier one*)
paulson@22470
   390
             pre @ map (replace_deps (lno', [lno])) post)
paulson@21978
   391
  | add_prfline ((lno, role, t, []), lines) =  (*no deps: conjecture clause*)
paulson@22470
   392
      (lno, t, []) :: lines
paulson@21978
   393
  | add_prfline ((lno, role, t, deps), lines) =
paulson@22470
   394
      if eq_false t then (lno, t, deps) :: lines
paulson@22470
   395
      (*Type information will be deleted later; we skip repetition test to avoid
paulson@22470
   396
        mistaking it with the empty clause.*)
paulson@22470
   397
      else (*Doesn't this code risk conflating proofs involving different types??*)
paulson@22044
   398
      case take_prefix (notequal t) lines of
paulson@22044
   399
         (_,[]) => (lno, t, deps) :: lines  (*no repetition of proof line*)
paulson@22044
   400
       | (pre, (lno',t',deps')::post) => 
paulson@22044
   401
           (lno, t', deps) ::               (*repetition: replace later line by earlier one*)
paulson@22044
   402
           (pre @ map (replace_deps (lno', [lno])) post);
paulson@22044
   403
paulson@22470
   404
(*Recursively delete empty lines (type information) from the proof.*)
paulson@22470
   405
fun add_nonnull_prfline ((lno, t, []), lines) = (*no dependencies, so a conjecture clause*)
paulson@22470
   406
     if eq_false t (*must be type information, tfree_tcs, clsrel, clsarity: delete refs to it*)
paulson@22470
   407
     then delete_dep lno lines   
paulson@22470
   408
     else (lno, t, []) :: lines   
paulson@22470
   409
  | add_nonnull_prfline ((lno, t, deps), lines) = (lno, t, deps) :: lines
paulson@22470
   410
and delete_dep lno lines = foldr add_nonnull_prfline [] (map (replace_deps (lno, [])) lines);
paulson@22470
   411
paulson@22044
   412
(*TVars are forbidden in goals. Also, we don't want lines with too few dependencies. 
paulson@22044
   413
  Deleted lines are replaced by their own dependencies. Note that the previous "add_prfline"
paulson@22044
   414
  phase may delete some dependencies, hence this phase comes later.*)
paulson@22044
   415
fun add_wanted_prfline ((lno, t, []), lines) =
paulson@22044
   416
      (lno, t, []) :: lines   (*conjecture clauses must be kept*)
paulson@22044
   417
  | add_wanted_prfline ((lno, t, deps), lines) =
paulson@22044
   418
      if not (null (term_tvars t)) orelse length deps < !min_deps
paulson@22044
   419
      then map (replace_deps (lno, deps)) lines (*Delete line*)
paulson@22044
   420
      else (lno, t, deps) :: lines;
paulson@21978
   421
paulson@21999
   422
(*Replace numeric proof lines by strings, either from thm_names or sequential line numbers*)
paulson@21978
   423
fun stringify_deps thm_names deps_map [] = []
paulson@21978
   424
  | stringify_deps thm_names deps_map ((lno, t, deps) :: lines) =
paulson@21978
   425
      if lno <= Vector.length thm_names  (*axiom*)
paulson@21978
   426
      then (Vector.sub(thm_names,lno-1), t, []) :: stringify_deps thm_names deps_map lines 
paulson@21979
   427
      else let val lname = Int.toString (length deps_map)
paulson@21978
   428
               fun fix lno = if lno <= Vector.length thm_names  
paulson@21978
   429
                             then SOME(Vector.sub(thm_names,lno-1))
paulson@21978
   430
                             else AList.lookup op= deps_map lno;
paulson@21978
   431
           in  (lname, t, List.mapPartial fix deps) ::
paulson@21978
   432
               stringify_deps thm_names ((lno,lname)::deps_map) lines
paulson@21978
   433
           end;
paulson@21978
   434
paulson@21999
   435
val proofstart = "\nproof (neg_clausify)\n";
paulson@21979
   436
paulson@21979
   437
fun isar_header [] = proofstart
paulson@21999
   438
  | isar_header ts = proofstart ^ "fix " ^ space_implode " " ts ^ "\n";
paulson@21979
   439
paulson@22012
   440
fun decode_tstp_file cnfs ctxt th sgno thm_names =
paulson@21978
   441
  let val tuples = map (dest_tstp o tstp_line o explode) cnfs
paulson@22044
   442
      val lines = foldr add_wanted_prfline [] 
paulson@22470
   443
                   (foldr add_nonnull_prfline [] 
paulson@22470
   444
                    (foldr add_prfline [] (decode_tstp_list ctxt tuples)))
paulson@21999
   445
      val (ccls,fixes) = ResAxioms.neg_conjecture_clauses th sgno
paulson@21999
   446
      val ccls = map forall_intr_vars ccls
paulson@21979
   447
  in  
wenzelm@22130
   448
    app (fn th => Output.debug (fn () => string_of_thm th)) ccls;
wenzelm@22130
   449
    isar_header (map #1 fixes) ^ 
wenzelm@22130
   450
    String.concat (isar_lines ctxt (map prop_of ccls) (stringify_deps thm_names [] lines))
paulson@21979
   451
  end;
paulson@21978
   452
paulson@21978
   453
(*Could use split_lines, but it can return blank lines...*)
paulson@21978
   454
val lines = String.tokens (equal #"\n");
paulson@21978
   455
paulson@21978
   456
val nospaces = String.translate (fn c => if Char.isSpace c then "" else str c);
paulson@21978
   457
paulson@21978
   458
(*The output to the watcher must be a SINGLE line...clearly \t must not be used.*)
paulson@21978
   459
val encode_newlines = String.translate (fn c => if c = #"\n" then "\t" else str c);
paulson@21978
   460
val restore_newlines = String.translate (fn c => if c = #"\t" then "\n" else str c);
paulson@21978
   461
paulson@21978
   462
fun signal_success probfile toParent ppid msg = 
paulson@21978
   463
  (trace ("\nReporting Success for" ^ probfile ^ "\n" ^ msg);
paulson@21978
   464
   TextIO.output (toParent, "Success. " ^ encode_newlines msg ^ "\n");
paulson@21978
   465
   TextIO.output (toParent, probfile ^ "\n");
paulson@21978
   466
   TextIO.flushOut toParent;
paulson@21978
   467
   Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2));
paulson@21978
   468
paulson@22012
   469
fun tstp_extract proofextract probfile toParent ppid ctxt th sgno thm_names = 
paulson@21978
   470
  let val cnfs = filter (String.isPrefix "cnf(") (map nospaces (lines proofextract))
paulson@21978
   471
  in  
paulson@21978
   472
    signal_success probfile toParent ppid 
paulson@22012
   473
      (decode_tstp_file cnfs ctxt th sgno thm_names)
paulson@21978
   474
  end;
paulson@21978
   475
paulson@21978
   476
paulson@21978
   477
(**** retrieve the axioms that were used in the proof ****)
paulson@21978
   478
paulson@21978
   479
(*Get names of axioms used. Axioms are indexed from 1, while the vector is indexed from 0*)
paulson@21978
   480
fun get_axiom_names (thm_names: string vector) step_nums = 
paulson@21978
   481
    let fun is_axiom n = n <= Vector.length thm_names 
paulson@21978
   482
        fun index i = Vector.sub(thm_names, i-1)
paulson@21978
   483
        val axnums = List.filter is_axiom step_nums
paulson@21978
   484
        val axnames = sort_distinct string_ord (map index axnums)
paulson@21978
   485
    in
paulson@21978
   486
	if length axnums = length step_nums then "UNSOUND!!" :: axnames
paulson@21978
   487
	else axnames
paulson@21978
   488
    end
paulson@21978
   489
paulson@21978
   490
 (*String contains multiple lines. We want those of the form 
paulson@21978
   491
     "253[0:Inp] et cetera..."
paulson@21978
   492
  A list consisting of the first number in each line is returned. *)
paulson@21978
   493
fun get_spass_linenums proofstr = 
paulson@21978
   494
  let val toks = String.tokens (not o Char.isAlphaNum)
paulson@21978
   495
      fun inputno (ntok::"0"::"Inp"::_) = Int.fromString ntok
paulson@21978
   496
        | inputno _ = NONE
paulson@21978
   497
      val lines = String.tokens (fn c => c = #"\n") proofstr
paulson@21978
   498
  in  List.mapPartial (inputno o toks) lines  end
paulson@21978
   499
paulson@21978
   500
fun get_axiom_names_spass proofstr thm_names =
paulson@21978
   501
   get_axiom_names thm_names (get_spass_linenums proofstr);
paulson@21978
   502
    
paulson@21978
   503
fun not_comma c = c <>  #",";
paulson@21978
   504
paulson@21978
   505
(*A valid TSTP axiom line has the form  cnf(NNN,axiom,...) where NNN is a positive integer.*)
paulson@21978
   506
fun parse_tstp_line s =
paulson@21978
   507
  let val ss = Substring.full (unprefix "cnf(" (nospaces s))
paulson@21978
   508
      val (intf,rest) = Substring.splitl not_comma ss
paulson@21978
   509
      val (rolef,rest) = Substring.splitl not_comma (Substring.triml 1 rest)
paulson@21978
   510
      (*We only allow negated_conjecture because the line number will be removed in
paulson@21978
   511
        get_axiom_names above, while suppressing the UNSOUND warning*)
paulson@21978
   512
      val ints = if Substring.string rolef mem_string ["axiom","negated_conjecture"]
paulson@21978
   513
                 then Substring.string intf 
paulson@21978
   514
                 else "error" 
paulson@21978
   515
  in  Int.fromString ints  end
paulson@21978
   516
  handle Fail _ => NONE; 
paulson@21978
   517
paulson@21978
   518
fun get_axiom_names_tstp proofstr thm_names =
paulson@21978
   519
   get_axiom_names thm_names (List.mapPartial parse_tstp_line (split_lines proofstr));
paulson@21978
   520
    
paulson@21978
   521
 (*String contains multiple lines. We want those of the form 
paulson@21978
   522
     "*********** [448, input] ***********".
paulson@21978
   523
  A list consisting of the first number in each line is returned. *)
paulson@21978
   524
fun get_vamp_linenums proofstr = 
paulson@21978
   525
  let val toks = String.tokens (not o Char.isAlphaNum)
paulson@21978
   526
      fun inputno [ntok,"input"] = Int.fromString ntok
paulson@21978
   527
        | inputno _ = NONE
paulson@21978
   528
      val lines = String.tokens (fn c => c = #"\n") proofstr
paulson@21978
   529
  in  List.mapPartial (inputno o toks) lines  end
paulson@21978
   530
paulson@21978
   531
fun get_axiom_names_vamp proofstr thm_names =
paulson@21978
   532
   get_axiom_names thm_names (get_vamp_linenums proofstr);
paulson@21978
   533
    
paulson@22372
   534
fun rules_to_metis [] = "metis"
paulson@22470
   535
  | rules_to_metis xs = "(metis " ^ space_implode " " xs ^ ")"
paulson@21978
   536
paulson@21978
   537
paulson@21978
   538
(*The signal handler in watcher.ML must be able to read the output of this.*)
paulson@21978
   539
fun prover_lemma_list_aux getax proofstr probfile toParent ppid thm_names = 
paulson@21978
   540
 (trace ("\n\nGetting lemma names. proofstr is " ^ proofstr ^
paulson@21978
   541
         " num of clauses is " ^ string_of_int (Vector.length thm_names));
paulson@21978
   542
  signal_success probfile toParent ppid 
paulson@22372
   543
    ("Try this proof method: \n" ^ rules_to_metis (getax proofstr thm_names))
paulson@22372
   544
 )
paulson@21978
   545
 handle e => (*FIXME: exn handler is too general!*)
paulson@21978
   546
  (trace ("\nprover_lemma_list_aux: In exception handler: " ^ Toplevel.exn_message e);
paulson@21978
   547
   TextIO.output (toParent, "Translation failed for the proof: " ^ 
paulson@21978
   548
                  String.toString proofstr ^ "\n");
paulson@21978
   549
   TextIO.output (toParent, probfile);
paulson@21978
   550
   TextIO.flushOut toParent;
paulson@21978
   551
   Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2));
paulson@21978
   552
paulson@21978
   553
val e_lemma_list = prover_lemma_list_aux get_axiom_names_tstp;
paulson@21978
   554
paulson@21978
   555
val vamp_lemma_list = prover_lemma_list_aux get_axiom_names_vamp;
paulson@21978
   556
paulson@21978
   557
val spass_lemma_list = prover_lemma_list_aux get_axiom_names_spass;
paulson@21978
   558
paulson@21978
   559
paulson@21978
   560
(**** Extracting proofs from an ATP's output ****)
paulson@21978
   561
paulson@21978
   562
(*Return everything in s that comes before the string t*)
paulson@21978
   563
fun cut_before t s = 
paulson@21978
   564
  let val (s1,s2) = Substring.position t (Substring.full s)
paulson@21978
   565
  in  if Substring.size s2 = 0 then error "cut_before: string not found" 
paulson@21978
   566
      else Substring.string s2
paulson@21978
   567
  end;
paulson@21978
   568
paulson@21978
   569
val start_E = "# Proof object starts here."
paulson@21978
   570
val end_E   = "# Proof object ends here."
paulson@21978
   571
val start_V6 = "%================== Proof: ======================"
paulson@21978
   572
val end_V6   = "%==============  End of proof. =================="
paulson@21978
   573
val start_V8 = "=========== Refutation =========="
paulson@21978
   574
val end_V8 = "======= End of refutation ======="
paulson@21978
   575
val end_SPASS = "Formulae used in the proof"
paulson@21978
   576
paulson@21978
   577
(*********************************************************************************)
paulson@21978
   578
(*  Inspect the output of an ATP process to see if it has found a proof,     *)
paulson@21978
   579
(*  and if so, transfer output to the input pipe of the main Isabelle process    *)
paulson@21978
   580
(*********************************************************************************)
paulson@21978
   581
paulson@21978
   582
(*Returns "true" if it successfully returns a lemma list, otherwise "false", but this
paulson@21978
   583
  return value is currently never used!*)
paulson@22012
   584
fun startTransfer endS (fromChild, toParent, ppid, probfile, ctxt, th, sgno, thm_names) =
paulson@21978
   585
 let fun transferInput currentString =
paulson@21978
   586
      let val thisLine = TextIO.inputLine fromChild
paulson@21978
   587
      in
paulson@21978
   588
	if thisLine = "" (*end of file?*)
paulson@21978
   589
	then (trace ("\n extraction_failed.  End bracket: " ^ endS ^
paulson@21978
   590
	             "\naccumulated text: " ^ currentString);
paulson@21978
   591
	      false)                    
paulson@21978
   592
	else if String.isPrefix endS thisLine
paulson@21978
   593
	then let val proofextract = currentString ^ cut_before endS thisLine
paulson@21978
   594
	         val lemma_list = if endS = end_V8 then vamp_lemma_list
paulson@21978
   595
			  	  else if endS = end_SPASS then spass_lemma_list
paulson@21978
   596
			  	  else e_lemma_list
paulson@21978
   597
	     in
paulson@21978
   598
	       trace ("\nExtracted proof:\n" ^ proofextract); 
paulson@21978
   599
	       if !full andalso String.isPrefix "cnf(" proofextract
paulson@22012
   600
	       then tstp_extract proofextract probfile toParent ppid ctxt th sgno thm_names
paulson@21978
   601
	       else lemma_list proofextract probfile toParent ppid thm_names;
paulson@21978
   602
	       true
paulson@21978
   603
	     end
paulson@21978
   604
	else transferInput (currentString^thisLine)
paulson@21978
   605
      end
paulson@21978
   606
 in
paulson@21978
   607
     transferInput ""
paulson@21978
   608
 end 
paulson@21978
   609
paulson@21978
   610
paulson@21978
   611
(*The signal handler in watcher.ML must be able to read the output of this.*)
paulson@21978
   612
fun signal_parent (toParent, ppid, msg, probfile) =
paulson@21978
   613
 (TextIO.output (toParent, msg);
paulson@21978
   614
  TextIO.output (toParent, probfile ^ "\n");
paulson@21978
   615
  TextIO.flushOut toParent;
paulson@21978
   616
  trace ("\nSignalled parent: " ^ msg ^ probfile);
paulson@21978
   617
  Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2);
paulson@21978
   618
  (*Give the parent time to respond before possibly sending another signal*)
paulson@21978
   619
  OS.Process.sleep (Time.fromMilliseconds 600));
paulson@21978
   620
paulson@22012
   621
(*FIXME: once TSTP output is produced by all ATPs, these three functions can be combined.*)
paulson@22012
   622
paulson@21978
   623
(*Called from watcher. Returns true if the Vampire process has returned a verdict.*)
paulson@22012
   624
fun checkVampProofFound (arg as (fromChild, toParent, ppid, probfile, ctxt, th, sgno, thm_names)) =
paulson@21978
   625
 let val thisLine = TextIO.inputLine fromChild
paulson@21978
   626
 in   
paulson@21978
   627
     trace thisLine;
paulson@21978
   628
     if thisLine = "" 
paulson@21978
   629
     then (trace "\nNo proof output seen"; false)
paulson@21978
   630
     else if String.isPrefix start_V8 thisLine
paulson@22012
   631
     then startTransfer end_V8 arg
paulson@21978
   632
     else if (String.isPrefix "Satisfiability detected" thisLine) orelse
paulson@21978
   633
             (String.isPrefix "Refutation not found" thisLine)
paulson@21978
   634
     then (signal_parent (toParent, ppid, "Failure\n", probfile);
paulson@21978
   635
	   true)
paulson@22012
   636
     else checkVampProofFound arg
paulson@21978
   637
  end
paulson@21978
   638
paulson@21978
   639
(*Called from watcher. Returns true if the E process has returned a verdict.*)
paulson@22012
   640
fun checkEProofFound (arg as (fromChild, toParent, ppid, probfile, ctxt, th, sgno, thm_names)) = 
paulson@21978
   641
 let val thisLine = TextIO.inputLine fromChild  
paulson@21978
   642
 in   
paulson@21978
   643
     trace thisLine;
paulson@21978
   644
     if thisLine = "" then (trace "\nNo proof output seen"; false)
paulson@21978
   645
     else if String.isPrefix start_E thisLine
paulson@22012
   646
     then startTransfer end_E arg
paulson@21978
   647
     else if String.isPrefix "# Problem is satisfiable" thisLine
paulson@21978
   648
     then (signal_parent (toParent, ppid, "Invalid\n", probfile);
paulson@21978
   649
	   true)
paulson@21978
   650
     else if String.isPrefix "# Cannot determine problem status within resource limit" thisLine
paulson@21978
   651
     then (signal_parent (toParent, ppid, "Failure\n", probfile);
paulson@21978
   652
	   true)
paulson@22012
   653
     else checkEProofFound arg
paulson@21978
   654
 end;
paulson@21978
   655
paulson@21978
   656
(*Called from watcher. Returns true if the SPASS process has returned a verdict.*)
paulson@22012
   657
fun checkSpassProofFound (arg as (fromChild, toParent, ppid, probfile, ctxt, th, sgno, thm_names)) = 
paulson@21978
   658
 let val thisLine = TextIO.inputLine fromChild  
paulson@21978
   659
 in    
paulson@21978
   660
     trace thisLine;
paulson@21978
   661
     if thisLine = "" then (trace "\nNo proof output seen"; false)
paulson@21978
   662
     else if String.isPrefix "Here is a proof" thisLine
paulson@22012
   663
     then startTransfer end_SPASS arg
paulson@21978
   664
     else if thisLine = "SPASS beiseite: Completion found.\n"
paulson@21978
   665
     then (signal_parent (toParent, ppid, "Invalid\n", probfile);
paulson@21978
   666
	   true)
paulson@21978
   667
     else if thisLine = "SPASS beiseite: Ran out of time.\n" orelse
paulson@21978
   668
             thisLine = "SPASS beiseite: Maximal number of loops exceeded.\n"
paulson@21978
   669
     then (signal_parent (toParent, ppid, "Failure\n", probfile);
paulson@21978
   670
	   true)
paulson@22012
   671
    else checkSpassProofFound arg
paulson@21978
   672
 end
paulson@21978
   673
paulson@21978
   674
end;