src/HOL/Tools/Sledgehammer/sledgehammer_proof_reconstruct.ML
author blanchet
Thu Apr 01 10:26:45 2010 +0200 (2010-04-01)
changeset 36065 3fc077c4780a
parent 36064 48aec67c284f
child 36140 08b2a7ecb6c3
permissions -rw-r--r--
fixed layout of Sledgehammer output
blanchet@35826
     1
(*  Title:      HOL/Tools/Sledgehammer/sledgehammer_proof_reconstruct.ML
wenzelm@33310
     2
    Author:     Lawrence C Paulson and Claire Quigley, Cambridge University Computer Laboratory
paulson@21978
     3
wenzelm@33310
     4
Transfer of proofs from external provers.
wenzelm@33310
     5
*)
wenzelm@33310
     6
blanchet@35826
     7
signature SLEDGEHAMMER_PROOF_RECONSTRUCT =
paulson@24425
     8
sig
paulson@25492
     9
  val chained_hint: string
paulson@24425
    10
  val invert_const: string -> string
paulson@24425
    11
  val invert_type_const: string -> string
wenzelm@33243
    12
  val num_typargs: theory -> string -> int
paulson@24425
    13
  val make_tvar: string -> typ
paulson@24425
    14
  val strip_prefix: string -> string -> string option
blanchet@35865
    15
  val is_proof_well_formed: string -> bool
blanchet@36063
    16
  val metis_line: int -> int -> string list -> string
blanchet@35865
    17
  val metis_lemma_list: bool -> string ->
wenzelm@33243
    18
    string * string vector * (int * int) * Proof.context * thm * int -> string * string list
blanchet@36064
    19
  val structured_isar_proof: int -> bool -> string ->
wenzelm@33243
    20
    string * string vector * (int * int) * Proof.context * thm * int -> string * string list
paulson@24425
    21
end;
paulson@21978
    22
blanchet@35826
    23
structure Sledgehammer_Proof_Reconstruct : SLEDGEHAMMER_PROOF_RECONSTRUCT =
paulson@21978
    24
struct
paulson@21978
    25
blanchet@35865
    26
open Sledgehammer_FOL_Clause
blanchet@35865
    27
open Sledgehammer_Fact_Preprocessor
paulson@21978
    28
blanchet@35865
    29
val trace_proof_path = Path.basic "atp_trace";
blanchet@35865
    30
blanchet@35865
    31
fun trace_proof_msg f =
blanchet@35865
    32
  if !trace then File.append (File.tmp_path trace_proof_path) (f ()) else ();
paulson@21978
    33
wenzelm@32091
    34
fun string_of_thm ctxt = PrintMode.setmp [] (Display.string_of_thm ctxt);
paulson@26333
    35
paulson@21978
    36
(**** PARSING OF TSTP FORMAT ****)
paulson@21978
    37
paulson@21978
    38
(*Syntax trees, either termlist or formulae*)
paulson@21978
    39
datatype stree = Int of int | Br of string * stree list;
paulson@21978
    40
paulson@21978
    41
fun atom x = Br(x,[]);
paulson@21978
    42
paulson@21978
    43
fun scons (x,y) = Br("cons", [x,y]);
wenzelm@30190
    44
val listof = List.foldl scons (atom "nil");
paulson@21978
    45
paulson@21978
    46
(*Strings enclosed in single quotes, e.g. filenames*)
paulson@21978
    47
val quoted = $$"'" |-- Scan.repeat (~$$"'") --| $$"'" >> implode;
paulson@21978
    48
paulson@21978
    49
(*Intended for $true and $false*)
paulson@21978
    50
fun tf s = "c_" ^ str (Char.toUpper (String.sub(s,0))) ^ String.extract(s,1,NONE);
paulson@21978
    51
val truefalse = $$"$" |-- Symbol.scan_id >> (atom o tf);
paulson@21978
    52
paulson@21978
    53
(*Integer constants, typically proof line numbers*)
paulson@21978
    54
fun is_digit s = Char.isDigit (String.sub(s,0));
wenzelm@33035
    55
val integer = Scan.many1 is_digit >> (the o Int.fromString o implode);
paulson@21978
    56
paulson@21978
    57
(*Generalized FO terms, which include filenames, numbers, etc.*)
wenzelm@25999
    58
fun termlist x = (term ::: Scan.repeat ($$"," |-- term)) x
paulson@21978
    59
and term x = (quoted >> atom || integer>>Int || truefalse ||
paulson@21978
    60
              Symbol.scan_id -- Scan.optional ($$"(" |-- termlist --| $$")") [] >> Br ||
paulson@21978
    61
              $$"(" |-- term --| $$")" ||
paulson@24547
    62
              $$"[" |-- Scan.optional termlist [] --| $$"]" >> listof) x;
paulson@21978
    63
paulson@21978
    64
fun negate t = Br("c_Not", [t]);
paulson@21978
    65
fun equate (t1,t2) = Br("c_equal", [t1,t2]);
paulson@21978
    66
paulson@21978
    67
(*Apply equal or not-equal to a term*)
paulson@21978
    68
fun syn_equal (t, NONE) = t
paulson@21978
    69
  | syn_equal (t1, SOME (NONE, t2)) = equate (t1,t2)
paulson@21978
    70
  | syn_equal (t1, SOME (SOME _, t2)) = negate (equate (t1,t2));
paulson@21978
    71
paulson@21978
    72
(*Literals can involve negation, = and !=.*)
paulson@24547
    73
fun literal x = ($$"~" |-- literal >> negate ||
paulson@24547
    74
                 (term -- Scan.option (Scan.option ($$"!") --| $$"=" -- term) >> syn_equal)) x;
paulson@21978
    75
wenzelm@25999
    76
val literals = literal ::: Scan.repeat ($$"|" |-- literal);
paulson@21978
    77
paulson@21978
    78
(*Clause: a list of literals separated by the disjunction sign*)
paulson@24547
    79
val clause = $$"(" |-- literals --| $$")" || Scan.single literal;
paulson@21978
    80
paulson@21978
    81
val annotations = $$"," |-- term -- Scan.option ($$"," |-- termlist);
paulson@21978
    82
wenzelm@25718
    83
(*<cnf_annotated> ::= cnf(<name>,<formula_role>,<cnf_formula><annotations>).
paulson@21978
    84
  The <name> could be an identifier, but we assume integers.*)
wenzelm@23139
    85
val tstp_line = (Scan.this_string "cnf" -- $$"(") |--
wenzelm@23139
    86
                integer --| $$"," -- Symbol.scan_id --| $$"," --
paulson@21978
    87
                clause -- Scan.option annotations --| $$ ")";
paulson@21978
    88
paulson@21978
    89
paulson@21978
    90
(**** INTERPRETATION OF TSTP SYNTAX TREES ****)
paulson@21978
    91
paulson@21978
    92
exception STREE of stree;
paulson@21978
    93
paulson@21978
    94
(*If string s has the prefix s1, return the result of deleting it.*)
wenzelm@23139
    95
fun strip_prefix s1 s =
immler@31038
    96
  if String.isPrefix s1 s
blanchet@35865
    97
  then SOME (undo_ascii_of (String.extract (s, size s1, NONE)))
paulson@21978
    98
  else NONE;
paulson@21978
    99
paulson@21978
   100
(*Invert the table of translations between Isabelle and ATPs*)
paulson@21978
   101
val type_const_trans_table_inv =
blanchet@35865
   102
      Symtab.make (map swap (Symtab.dest type_const_trans_table));
paulson@21978
   103
paulson@21978
   104
fun invert_type_const c =
paulson@21978
   105
    case Symtab.lookup type_const_trans_table_inv c of
paulson@21978
   106
        SOME c' => c'
paulson@21978
   107
      | NONE => c;
paulson@21978
   108
paulson@21978
   109
fun make_tvar b = TVar(("'" ^ b, 0), HOLogic.typeS);
paulson@21978
   110
fun make_var (b,T) = Var((b,0),T);
paulson@21978
   111
paulson@21978
   112
(*Type variables are given the basic sort, HOL.type. Some will later be constrained
paulson@21978
   113
  by information from type literals, or by type inference.*)
paulson@21978
   114
fun type_of_stree t =
paulson@21978
   115
  case t of
paulson@21978
   116
      Int _ => raise STREE t
wenzelm@23139
   117
    | Br (a,ts) =>
paulson@21978
   118
        let val Ts = map type_of_stree ts
wenzelm@23139
   119
        in
blanchet@35865
   120
          case strip_prefix tconst_prefix a of
paulson@21978
   121
              SOME b => Type(invert_type_const b, Ts)
wenzelm@23139
   122
            | NONE =>
paulson@21978
   123
                if not (null ts) then raise STREE t  (*only tconsts have type arguments*)
wenzelm@23139
   124
                else
blanchet@35865
   125
                case strip_prefix tfree_prefix a of
paulson@21978
   126
                    SOME b => TFree("'" ^ b, HOLogic.typeS)
wenzelm@23139
   127
                  | NONE =>
blanchet@35865
   128
                case strip_prefix tvar_prefix a of
paulson@21978
   129
                    SOME b => make_tvar b
paulson@21978
   130
                  | NONE => make_tvar a   (*Variable from the ATP, say X1*)
paulson@21978
   131
        end;
paulson@21978
   132
paulson@21978
   133
(*Invert the table of translations between Isabelle and ATPs*)
paulson@21978
   134
val const_trans_table_inv =
wenzelm@23139
   135
      Symtab.update ("fequal", "op =")
blanchet@35865
   136
        (Symtab.make (map swap (Symtab.dest const_trans_table)));
paulson@21978
   137
paulson@21978
   138
fun invert_const c =
paulson@21978
   139
    case Symtab.lookup const_trans_table_inv c of
paulson@21978
   140
        SOME c' => c'
paulson@21978
   141
      | NONE => c;
paulson@21978
   142
paulson@21978
   143
(*The number of type arguments of a constant, zero if it's monomorphic*)
paulson@21978
   144
fun num_typargs thy s = length (Sign.const_typargs thy (s, Sign.the_const_type thy s));
paulson@21978
   145
paulson@21978
   146
(*Generates a constant, given its type arguments*)
paulson@21978
   147
fun const_of thy (a,Ts) = Const(a, Sign.const_instance thy (a,Ts));
paulson@21978
   148
paulson@21978
   149
(*First-order translation. No types are known for variables. HOLogic.typeT should allow
paulson@21978
   150
  them to be inferred.*)
paulson@22428
   151
fun term_of_stree args thy t =
paulson@21978
   152
  case t of
paulson@21978
   153
      Int _ => raise STREE t
paulson@22428
   154
    | Br ("hBOOL",[t]) => term_of_stree [] thy t  (*ignore hBOOL*)
paulson@22428
   155
    | Br ("hAPP",[t,u]) => term_of_stree (u::args) thy t
wenzelm@23139
   156
    | Br (a,ts) =>
blanchet@35865
   157
        case strip_prefix const_prefix a of
wenzelm@23139
   158
            SOME "equal" =>
blanchet@35865
   159
              list_comb(Const (@{const_name "op ="}, HOLogic.typeT), List.map (term_of_stree [] thy) ts)
wenzelm@23139
   160
          | SOME b =>
paulson@21978
   161
              let val c = invert_const b
paulson@21978
   162
                  val nterms = length ts - num_typargs thy c
paulson@22428
   163
                  val us = List.map (term_of_stree [] thy) (List.take(ts,nterms) @ args)
paulson@22428
   164
                  (*Extra args from hAPP come AFTER any arguments given directly to the
paulson@22428
   165
                    constant.*)
paulson@21978
   166
                  val Ts = List.map type_of_stree (List.drop(ts,nterms))
paulson@21978
   167
              in  list_comb(const_of thy (c, Ts), us)  end
paulson@21978
   168
          | NONE => (*a variable, not a constant*)
paulson@21978
   169
              let val T = HOLogic.typeT
paulson@21978
   170
                  val opr = (*a Free variable is typically a Skolem function*)
blanchet@35865
   171
                    case strip_prefix fixed_var_prefix a of
paulson@21978
   172
                        SOME b => Free(b,T)
wenzelm@23139
   173
                      | NONE =>
blanchet@35865
   174
                    case strip_prefix schematic_var_prefix a of
paulson@21978
   175
                        SOME b => make_var (b,T)
paulson@21978
   176
                      | NONE => make_var (a,T)    (*Variable from the ATP, say X1*)
paulson@23519
   177
              in  list_comb (opr, List.map (term_of_stree [] thy) (ts@args))  end;
paulson@21978
   178
wenzelm@23139
   179
(*Type class literal applied to a type. Returns triple of polarity, class, type.*)
paulson@21978
   180
fun constraint_of_stree pol (Br("c_Not",[t])) = constraint_of_stree (not pol) t
paulson@21978
   181
  | constraint_of_stree pol t = case t of
paulson@21978
   182
        Int _ => raise STREE t
wenzelm@23139
   183
      | Br (a,ts) =>
blanchet@35865
   184
            (case (strip_prefix class_prefix a, map type_of_stree ts) of
paulson@21978
   185
                 (SOME b, [T]) => (pol, b, T)
paulson@21978
   186
               | _ => raise STREE t);
paulson@21978
   187
paulson@21978
   188
(** Accumulate type constraints in a clause: negative type literals **)
paulson@21978
   189
paulson@21978
   190
fun addix (key,z)  = Vartab.map_default (key,[]) (cons z);
paulson@21978
   191
paulson@21978
   192
fun add_constraint ((false, cl, TFree(a,_)), vt) = addix ((a,~1),cl) vt
paulson@21978
   193
  | add_constraint ((false, cl, TVar(ix,_)), vt) = addix (ix,cl) vt
paulson@21978
   194
  | add_constraint (_, vt) = vt;
paulson@21978
   195
paulson@21978
   196
(*False literals (which E includes in its proofs) are deleted*)
paulson@21978
   197
val nofalses = filter (not o equal HOLogic.false_const);
paulson@21978
   198
paulson@22491
   199
(*Final treatment of the list of "real" literals from a clause.*)
paulson@22491
   200
fun finish [] = HOLogic.true_const  (*No "real" literals means only type information*)
wenzelm@23139
   201
  | finish lits =
paulson@22491
   202
      case nofalses lits of
paulson@22491
   203
          [] => HOLogic.false_const  (*The empty clause, since we started with real literals*)
paulson@22491
   204
        | xs => foldr1 HOLogic.mk_disj (rev xs);
paulson@22491
   205
paulson@21978
   206
(*Accumulate sort constraints in vt, with "real" literals in lits.*)
wenzelm@32994
   207
fun lits_of_strees _ (vt, lits) [] = (vt, finish lits)
wenzelm@23139
   208
  | lits_of_strees ctxt (vt, lits) (t::ts) =
paulson@22012
   209
      lits_of_strees ctxt (add_constraint (constraint_of_stree true t, vt), lits) ts
wenzelm@23139
   210
      handle STREE _ =>
paulson@22428
   211
      lits_of_strees ctxt (vt, term_of_stree [] (ProofContext.theory_of ctxt) t :: lits) ts;
paulson@21978
   212
paulson@21978
   213
(*Update TVars/TFrees with detected sort constraints.*)
paulson@21978
   214
fun fix_sorts vt =
paulson@21978
   215
  let fun tysubst (Type (a, Ts)) = Type (a, map tysubst Ts)
wenzelm@33035
   216
        | tysubst (TVar (xi, s)) = TVar (xi, the_default s (Vartab.lookup vt xi))
wenzelm@33035
   217
        | tysubst (TFree (x, s)) = TFree (x, the_default s (Vartab.lookup vt (x, ~1)))
paulson@21978
   218
      fun tmsubst (Const (a, T)) = Const (a, tysubst T)
paulson@21978
   219
        | tmsubst (Free (a, T)) = Free (a, tysubst T)
paulson@21978
   220
        | tmsubst (Var (xi, T)) = Var (xi, tysubst T)
paulson@21978
   221
        | tmsubst (t as Bound _) = t
paulson@21978
   222
        | tmsubst (Abs (a, T, t)) = Abs (a, tysubst T, tmsubst t)
paulson@21978
   223
        | tmsubst (t $ u) = tmsubst t $ tmsubst u;
paulson@21978
   224
  in fn t => if Vartab.is_empty vt then t else tmsubst t end;
paulson@21978
   225
paulson@21978
   226
(*Interpret a list of syntax trees as a clause, given by "real" literals and sort constraints.
paulson@21978
   227
  vt0 holds the initial sort constraints, from the conjecture clauses.*)
paulson@23519
   228
fun clause_of_strees ctxt vt0 ts =
wenzelm@22728
   229
  let val (vt, dt) = lits_of_strees ctxt (vt0,[]) ts in
wenzelm@24680
   230
    singleton (Syntax.check_terms ctxt) (TypeInfer.constrain HOLogic.boolT (fix_sorts vt dt))
wenzelm@22728
   231
  end;
paulson@21978
   232
wenzelm@29268
   233
fun gen_all_vars t = fold_rev Logic.all (OldTerm.term_vars t) t;
paulson@21978
   234
paulson@21978
   235
fun ints_of_stree_aux (Int n, ns) = n::ns
wenzelm@30190
   236
  | ints_of_stree_aux (Br(_,ts), ns) = List.foldl ints_of_stree_aux ns ts;
paulson@21978
   237
paulson@21978
   238
fun ints_of_stree t = ints_of_stree_aux (t, []);
paulson@21978
   239
paulson@25086
   240
fun decode_tstp vt0 (name, role, ts, annots) ctxt =
paulson@21978
   241
  let val deps = case annots of NONE => [] | SOME (source,_) => ints_of_stree source
paulson@25086
   242
      val cl = clause_of_strees ctxt vt0 ts
wenzelm@29268
   243
  in  ((name, role, cl, deps), fold Variable.declare_term (OldTerm.term_frees cl) ctxt)  end;
paulson@21978
   244
paulson@21978
   245
fun dest_tstp ((((name, role), ts), annots), chs) =
paulson@21978
   246
  case chs of
paulson@21978
   247
          "."::_ => (name, role, ts, annots)
paulson@21978
   248
        | _ => error ("TSTP line not terminated by \".\": " ^ implode chs);
paulson@21978
   249
paulson@21978
   250
paulson@21978
   251
(** Global sort constraints on TFrees (from tfree_tcs) are positive unit clauses. **)
paulson@21978
   252
paulson@21978
   253
fun add_tfree_constraint ((true, cl, TFree(a,_)), vt) = addix ((a,~1),cl) vt
paulson@21978
   254
  | add_tfree_constraint (_, vt) = vt;
paulson@21978
   255
paulson@21978
   256
fun tfree_constraints_of_clauses vt [] = vt
wenzelm@23139
   257
  | tfree_constraints_of_clauses vt ([lit]::tss) =
paulson@21978
   258
      (tfree_constraints_of_clauses (add_tfree_constraint (constraint_of_stree true lit, vt)) tss
paulson@21978
   259
       handle STREE _ => (*not a positive type constraint: ignore*)
paulson@21978
   260
       tfree_constraints_of_clauses vt tss)
paulson@21978
   261
  | tfree_constraints_of_clauses vt (_::tss) = tfree_constraints_of_clauses vt tss;
paulson@21978
   262
paulson@21978
   263
paulson@21978
   264
(**** Translation of TSTP files to Isar Proofs ****)
paulson@21978
   265
paulson@22012
   266
fun decode_tstp_list ctxt tuples =
paulson@21978
   267
  let val vt0 = tfree_constraints_of_clauses Vartab.empty (map #3 tuples)
paulson@25086
   268
  in  #1 (fold_map (decode_tstp vt0) tuples ctxt) end;
paulson@21978
   269
paulson@23519
   270
(** Finding a matching assumption. The literals may be permuted, and variable names
immler@31038
   271
    may disagree. We have to try all combinations of literals (quadratic!) and
paulson@23519
   272
    match up the variable names consistently. **)
paulson@23519
   273
blanchet@35865
   274
fun strip_alls_aux n (Const(@{const_name all}, _)$Abs(a,T,t))  =
paulson@23519
   275
      strip_alls_aux (n+1) (subst_bound (Var ((a,n), T), t))
paulson@23519
   276
  | strip_alls_aux _ t  =  t;
paulson@23519
   277
paulson@23519
   278
val strip_alls = strip_alls_aux 0;
paulson@23519
   279
paulson@23519
   280
exception MATCH_LITERAL;
paulson@22012
   281
paulson@23519
   282
(*Ignore types: they are not to be trusted...*)
paulson@23519
   283
fun match_literal (t1$u1) (t2$u2) env =
paulson@23519
   284
      match_literal t1 t2 (match_literal u1 u2 env)
immler@31038
   285
  | match_literal (Abs (_,_,t1)) (Abs (_,_,t2)) env =
paulson@23519
   286
      match_literal t1 t2 env
immler@31038
   287
  | match_literal (Bound i1) (Bound i2) env =
paulson@23519
   288
      if i1=i2 then env else raise MATCH_LITERAL
immler@31038
   289
  | match_literal (Const(a1,_)) (Const(a2,_)) env =
paulson@23519
   290
      if a1=a2 then env else raise MATCH_LITERAL
immler@31038
   291
  | match_literal (Free(a1,_)) (Free(a2,_)) env =
paulson@23519
   292
      if a1=a2 then env else raise MATCH_LITERAL
paulson@23519
   293
  | match_literal (Var(ix1,_)) (Var(ix2,_)) env = insert (op =) (ix1,ix2) env
wenzelm@32994
   294
  | match_literal _ _ _ = raise MATCH_LITERAL;
paulson@23519
   295
paulson@23519
   296
(*Checking that all variable associations are unique. The list env contains no
paulson@23519
   297
  repetitions, but does it contain say (x,y) and (y,y)? *)
immler@31038
   298
fun good env =
paulson@23519
   299
  let val (xs,ys) = ListPair.unzip env
paulson@23519
   300
  in  not (has_duplicates (op=) xs orelse has_duplicates (op=) ys)  end;
paulson@23519
   301
paulson@23519
   302
(*Match one list of literals against another, ignoring types and the order of
paulson@23519
   303
  literals. Sorting is unreliable because we don't have types or variable names.*)
paulson@23519
   304
fun matches_aux _ [] [] = true
paulson@23519
   305
  | matches_aux env (lit::lits) ts =
paulson@23519
   306
      let fun match1 us [] = false
paulson@23519
   307
            | match1 us (t::ts) =
paulson@23519
   308
                let val env' = match_literal lit t env
immler@31038
   309
                in  (good env' andalso matches_aux env' lits (us@ts)) orelse
immler@31038
   310
                    match1 (t::us) ts
paulson@23519
   311
                end
paulson@23519
   312
                handle MATCH_LITERAL => match1 (t::us) ts
immler@31038
   313
      in  match1 [] ts  end;
paulson@23519
   314
paulson@23519
   315
(*Is this length test useful?*)
immler@31038
   316
fun matches (lits1,lits2) =
immler@31038
   317
  length lits1 = length lits2  andalso
paulson@23519
   318
  matches_aux [] (map Envir.eta_contract lits1) (map Envir.eta_contract lits2);
paulson@21999
   319
paulson@21999
   320
fun permuted_clause t =
paulson@24958
   321
  let val lits = HOLogic.disjuncts t
paulson@21999
   322
      fun perm [] = NONE
wenzelm@23139
   323
        | perm (ctm::ctms) =
paulson@24958
   324
            if matches (lits, HOLogic.disjuncts (HOLogic.dest_Trueprop (strip_alls ctm)))
paulson@23519
   325
            then SOME ctm else perm ctms
paulson@21999
   326
  in perm end;
paulson@21999
   327
paulson@21999
   328
(*ctms is a list of conjecture clauses as yielded by Isabelle. Those returned by the
paulson@21999
   329
  ATP may have their literals reordered.*)
blanchet@36064
   330
fun isar_proof_body ctxt sorts ctms =
blanchet@35869
   331
  let
blanchet@35869
   332
    val _ = trace_proof_msg (K "\n\nisar_proof_body: start\n")
blanchet@36064
   333
    val string_of_term = 
blanchet@36064
   334
      PrintMode.setmp (filter (curry (op =) Symbol.xsymbolsN)
blanchet@36064
   335
                              (print_mode_value ()))
blanchet@36064
   336
                      (Syntax.string_of_term ctxt)
blanchet@35966
   337
    fun have_or_show "show" _ = "  show \""
blanchet@35966
   338
      | have_or_show have lname = "  " ^ have ^ " " ^ lname ^ ": \""
blanchet@35869
   339
    fun do_line _ (lname, t, []) =
blanchet@35869
   340
       (* No deps: it's a conjecture clause, with no proof. *)
blanchet@35869
   341
       (case permuted_clause t ctms of
blanchet@35966
   342
          SOME u => "  assume " ^ lname ^ ": \"" ^ string_of_term u ^ "\"\n"
blanchet@35869
   343
        | NONE => raise TERM ("Sledgehammer_Proof_Reconstruct.isar_proof_body",
blanchet@35869
   344
                              [t]))
blanchet@35869
   345
      | do_line have (lname, t, deps) =
blanchet@35869
   346
        have_or_show have lname ^
blanchet@35869
   347
        string_of_term (gen_all_vars (HOLogic.mk_Trueprop t)) ^
blanchet@35966
   348
        "\"\n    by (metis " ^ space_implode " " deps ^ ")\n"
blanchet@35869
   349
    fun do_lines [(lname, t, deps)] = [do_line "show" (lname, t, deps)]
blanchet@35869
   350
      | do_lines ((lname, t, deps) :: lines) =
blanchet@35869
   351
        do_line "have" (lname, t, deps) :: do_lines lines
blanchet@36064
   352
  in setmp_CRITICAL show_sorts sorts do_lines end;
paulson@21978
   353
blanchet@35869
   354
fun unequal t (_, t', _) = not (t aconv t');
paulson@21978
   355
paulson@22491
   356
(*No "real" literals means only type information*)
paulson@23519
   357
fun eq_types t = t aconv HOLogic.true_const;
paulson@21978
   358
paulson@22731
   359
fun replace_dep (old:int, new) dep = if dep=old then new else [dep];
paulson@21978
   360
wenzelm@23139
   361
fun replace_deps (old:int, new) (lno, t, deps) =
haftmann@33042
   362
      (lno, t, List.foldl (uncurry (union (op =))) [] (map (replace_dep (old, new)) deps));
paulson@21978
   363
paulson@22491
   364
(*Discard axioms; consolidate adjacent lines that prove the same clause, since they differ
paulson@22491
   365
  only in type information.*)
paulson@21978
   366
fun add_prfline ((lno, "axiom", t, []), lines) =  (*axioms are not proof lines*)
paulson@22491
   367
      if eq_types t (*must be clsrel/clsarity: type information, so delete refs to it*)
wenzelm@23139
   368
      then map (replace_deps (lno, [])) lines
paulson@22470
   369
      else
blanchet@35869
   370
       (case take_prefix (unequal t) lines of
paulson@22470
   371
           (_,[]) => lines                  (*no repetition of proof line*)
wenzelm@32994
   372
         | (pre, (lno', _, _) :: post) =>   (*repetition: replace later line by earlier one*)
paulson@22470
   373
             pre @ map (replace_deps (lno', [lno])) post)
wenzelm@32994
   374
  | add_prfline ((lno, _, t, []), lines) =  (*no deps: conjecture clause*)
paulson@22470
   375
      (lno, t, []) :: lines
wenzelm@32994
   376
  | add_prfline ((lno, _, t, deps), lines) =
paulson@22491
   377
      if eq_types t then (lno, t, deps) :: lines
paulson@22491
   378
      (*Type information will be deleted later; skip repetition test.*)
paulson@22491
   379
      else (*FIXME: Doesn't this code risk conflating proofs involving different types??*)
blanchet@35869
   380
      case take_prefix (unequal t) lines of
paulson@22044
   381
         (_,[]) => (lno, t, deps) :: lines  (*no repetition of proof line*)
wenzelm@32994
   382
       | (pre, (lno', t', _) :: post) =>
paulson@22044
   383
           (lno, t', deps) ::               (*repetition: replace later line by earlier one*)
paulson@22044
   384
           (pre @ map (replace_deps (lno', [lno])) post);
paulson@22044
   385
paulson@22470
   386
(*Recursively delete empty lines (type information) from the proof.*)
paulson@22470
   387
fun add_nonnull_prfline ((lno, t, []), lines) = (*no dependencies, so a conjecture clause*)
paulson@22491
   388
     if eq_types t (*must be type information, tfree_tcs, clsrel, clsarity: delete refs to it*)
wenzelm@23139
   389
     then delete_dep lno lines
wenzelm@23139
   390
     else (lno, t, []) :: lines
paulson@22470
   391
  | add_nonnull_prfline ((lno, t, deps), lines) = (lno, t, deps) :: lines
wenzelm@30190
   392
and delete_dep lno lines = List.foldr add_nonnull_prfline [] (map (replace_deps (lno, [])) lines);
paulson@22470
   393
blanchet@35865
   394
fun bad_free (Free (a,_)) = String.isPrefix skolem_prefix a
paulson@22731
   395
  | bad_free _ = false;
paulson@22731
   396
wenzelm@23139
   397
(*TVars are forbidden in goals. Also, we don't want lines with <2 dependencies.
paulson@22491
   398
  To further compress proofs, setting modulus:=n deletes every nth line, and nlines
paulson@22491
   399
  counts the number of proof lines processed so far.
paulson@22491
   400
  Deleted lines are replaced by their own dependencies. Note that the "add_nonnull_prfline"
paulson@22044
   401
  phase may delete some dependencies, hence this phase comes later.*)
blanchet@36064
   402
fun add_wanted_prfline ctxt _ ((lno, t, []), (nlines, lines)) =
paulson@22491
   403
      (nlines, (lno, t, []) :: lines)   (*conjecture clauses must be kept*)
blanchet@36064
   404
  | add_wanted_prfline ctxt modulus ((lno, t, deps), (nlines, lines)) =
wenzelm@29272
   405
      if eq_types t orelse not (null (Term.add_tvars t [])) orelse
wenzelm@29268
   406
         exists_subterm bad_free t orelse
paulson@24937
   407
         (not (null lines) andalso   (*final line can't be deleted for these reasons*)
blanchet@36064
   408
          (length deps < 2 orelse nlines mod modulus <> 0))
paulson@22491
   409
      then (nlines+1, map (replace_deps (lno, deps)) lines) (*Delete line*)
paulson@22491
   410
      else (nlines+1, (lno, t, deps) :: lines);
paulson@21978
   411
paulson@21999
   412
(*Replace numeric proof lines by strings, either from thm_names or sequential line numbers*)
paulson@21978
   413
fun stringify_deps thm_names deps_map [] = []
paulson@21978
   414
  | stringify_deps thm_names deps_map ((lno, t, deps) :: lines) =
paulson@21978
   415
      if lno <= Vector.length thm_names  (*axiom*)
wenzelm@23139
   416
      then (Vector.sub(thm_names,lno-1), t, []) :: stringify_deps thm_names deps_map lines
paulson@21979
   417
      else let val lname = Int.toString (length deps_map)
wenzelm@23139
   418
               fun fix lno = if lno <= Vector.length thm_names
paulson@21978
   419
                             then SOME(Vector.sub(thm_names,lno-1))
paulson@21978
   420
                             else AList.lookup op= deps_map lno;
wenzelm@32952
   421
           in  (lname, t, map_filter fix (distinct (op=) deps)) ::
paulson@21978
   422
               stringify_deps thm_names ((lno,lname)::deps_map) lines
paulson@21978
   423
           end;
paulson@21978
   424
blanchet@36063
   425
fun isar_proof_start i =
blanchet@36063
   426
  (if i = 1 then "" else "prefer " ^ string_of_int i ^ "\n") ^
blanchet@36063
   427
  "proof (neg_clausify)\n";
blanchet@36063
   428
fun isar_fixes [] = ""
blanchet@36063
   429
  | isar_fixes ts = "  fix " ^ space_implode " " ts ^ "\n";
blanchet@36063
   430
fun isar_proof_end 1 = "qed"
blanchet@36063
   431
  | isar_proof_end _ = "next"
paulson@21979
   432
blanchet@36064
   433
fun isar_proof_from_tstp_file cnfs modulus sorts ctxt goal i thm_names =
blanchet@35868
   434
  let
blanchet@35868
   435
    val _ = trace_proof_msg (K "\nisar_proof_from_tstp_file: start\n")
blanchet@35868
   436
    val tuples = map (dest_tstp o tstp_line o explode) cnfs
blanchet@35868
   437
    val _ = trace_proof_msg (fn () =>
blanchet@35868
   438
      Int.toString (length tuples) ^ " tuples extracted\n")
blanchet@35868
   439
    val ctxt = ProofContext.set_mode ProofContext.mode_schematic ctxt
blanchet@35868
   440
    val raw_lines = List.foldr add_prfline [] (decode_tstp_list ctxt tuples)
blanchet@35868
   441
    val _ = trace_proof_msg (fn () =>
blanchet@35868
   442
      Int.toString (length raw_lines) ^ " raw_lines extracted\n")
blanchet@35868
   443
    val nonnull_lines = List.foldr add_nonnull_prfline [] raw_lines
blanchet@35868
   444
    val _ = trace_proof_msg (fn () =>
blanchet@35868
   445
      Int.toString (length nonnull_lines) ^ " nonnull_lines extracted\n")
blanchet@36064
   446
    val (_, lines) = List.foldr (add_wanted_prfline ctxt modulus) (0,[]) nonnull_lines
blanchet@35868
   447
    val _ = trace_proof_msg (fn () =>
blanchet@35868
   448
      Int.toString (length lines) ^ " lines extracted\n")
blanchet@36063
   449
    val (ccls, fixes) = neg_conjecture_clauses ctxt goal i
blanchet@35868
   450
    val _ = trace_proof_msg (fn () =>
blanchet@35868
   451
      Int.toString (length ccls) ^ " conjecture clauses\n")
blanchet@35868
   452
    val ccls = map forall_intr_vars ccls
blanchet@35868
   453
    val _ = app (fn th => trace_proof_msg
blanchet@35868
   454
                              (fn () => "\nccl: " ^ string_of_thm ctxt th)) ccls
blanchet@36064
   455
    val body = isar_proof_body ctxt sorts (map prop_of ccls)
blanchet@35869
   456
                               (stringify_deps thm_names [] lines)
blanchet@36063
   457
    val n = Logic.count_prems (prop_of goal)
blanchet@35868
   458
    val _ = trace_proof_msg (K "\nisar_proof_from_tstp_file: finishing\n")
blanchet@36063
   459
  in
blanchet@36063
   460
    isar_proof_start i ^ isar_fixes (map #1 fixes) ^ implode body ^
blanchet@36063
   461
    isar_proof_end n ^ "\n"
blanchet@36063
   462
  end
blanchet@35868
   463
  handle STREE _ => error "Could not extract proof (ATP output malformed?)";
paulson@21978
   464
paulson@21978
   465
wenzelm@33310
   466
(*=== EXTRACTING PROOF-TEXT === *)
immler@31866
   467
blanchet@35865
   468
val begin_proof_strs = ["# SZS output start CNFRefutation.",
wenzelm@33310
   469
  "=========== Refutation ==========",
immler@31866
   470
  "Here is a proof"];
wenzelm@33310
   471
blanchet@35865
   472
val end_proof_strs = ["# SZS output end CNFRefutation",
wenzelm@33310
   473
  "======= End of refutation =======",
immler@31866
   474
  "Formulae used in the proof"];
wenzelm@33310
   475
wenzelm@33310
   476
fun get_proof_extract proof =
wenzelm@33310
   477
  let
immler@31866
   478
    (*splits to_split by the first possible of a list of splitters*)
immler@31866
   479
    val (begin_string, end_string) =
blanchet@35865
   480
      (find_first (fn s => String.isSubstring s proof) begin_proof_strs,
blanchet@35865
   481
      find_first (fn s => String.isSubstring s proof) end_proof_strs)
wenzelm@33310
   482
  in
wenzelm@33310
   483
    if is_none begin_string orelse is_none end_string
wenzelm@33310
   484
    then error "Could not extract proof (no substring indicating a proof)"
wenzelm@33310
   485
    else proof |> first_field (the begin_string) |> the |> snd
wenzelm@33310
   486
               |> first_field (the end_string) |> the |> fst
wenzelm@33310
   487
  end;
immler@31866
   488
blanchet@35865
   489
(* ==== CHECK IF PROOF WAS SUCCESSFUL === *)
immler@31866
   490
blanchet@35865
   491
fun is_proof_well_formed proof =
blanchet@35865
   492
  exists (fn s => String.isSubstring s proof) begin_proof_strs andalso
blanchet@35865
   493
  exists (fn s => String.isSubstring s proof) end_proof_strs
immler@31866
   494
wenzelm@33310
   495
(* === EXTRACTING LEMMAS === *)
wenzelm@33310
   496
(* lines have the form "cnf(108, axiom, ...",
wenzelm@33310
   497
the number (108) has to be extracted)*)
blanchet@35865
   498
fun get_step_nums false extract =
blanchet@35865
   499
  let
blanchet@35865
   500
    val toks = String.tokens (not o Char.isAlphaNum)
blanchet@35865
   501
    fun inputno ("cnf" :: ntok :: "axiom" :: _) = Int.fromString ntok
blanchet@35865
   502
      | inputno ("cnf" :: ntok :: "negated" :: "conjecture" :: _) =
blanchet@35865
   503
        Int.fromString ntok
blanchet@35865
   504
      | inputno _ = NONE
blanchet@35865
   505
    val lines = split_lines extract
blanchet@35865
   506
  in map_filter (inputno o toks) lines end
wenzelm@33310
   507
(*String contains multiple lines. We want those of the form
wenzelm@33310
   508
  "253[0:Inp] et cetera..."
wenzelm@33310
   509
  A list consisting of the first number in each line is returned. *)
wenzelm@33310
   510
|  get_step_nums true proofextract =
wenzelm@33310
   511
  let val toks = String.tokens (not o Char.isAlphaNum)
wenzelm@33310
   512
  fun inputno (ntok::"0"::"Inp"::_) = Int.fromString ntok
wenzelm@33310
   513
    | inputno _ = NONE
wenzelm@33310
   514
  val lines = split_lines proofextract
wenzelm@33310
   515
  in  map_filter (inputno o toks) lines  end
wenzelm@33310
   516
  
wenzelm@33310
   517
(*extracting lemmas from tstp-output between the lines from above*)
wenzelm@33310
   518
fun extract_lemmas get_step_nums (proof, thm_names, conj_count, _, _, _) =
wenzelm@33310
   519
  let
blanchet@35865
   520
    (* get the names of axioms from their numbers*)
blanchet@35865
   521
    fun get_axiom_names thm_names step_nums =
blanchet@35865
   522
      let
blanchet@35865
   523
        val last_axiom = Vector.length thm_names
blanchet@35865
   524
        fun is_axiom n = n <= last_axiom
blanchet@35865
   525
        fun is_conj n = n >= fst conj_count andalso
blanchet@35865
   526
                        n < fst conj_count + snd conj_count
blanchet@35865
   527
        fun getname i = Vector.sub(thm_names, i-1)
blanchet@35865
   528
      in
blanchet@35865
   529
        (sort_distinct string_ord (filter (fn x => x <> "??.unknown")
blanchet@35865
   530
          (map getname (filter is_axiom step_nums))),
blanchet@35865
   531
        exists is_conj step_nums)
blanchet@35865
   532
      end
blanchet@35865
   533
  in get_axiom_names thm_names (get_step_nums (get_proof_extract proof)) end;
immler@31410
   534
wenzelm@33310
   535
(*Used to label theorems chained into the sledgehammer call*)
wenzelm@33310
   536
val chained_hint = "CHAINED";
blanchet@35865
   537
val kill_chained = filter_out (curry (op =) chained_hint)
blanchet@35865
   538
blanchet@36063
   539
fun apply_command _ 1 = "by "
blanchet@36063
   540
  | apply_command 1 _ = "apply "
blanchet@36063
   541
  | apply_command i _ = "prefer " ^ string_of_int i ^ " apply "
blanchet@36063
   542
fun metis_command i n [] =
blanchet@36063
   543
    apply_command i n ^ "metis"
blanchet@36063
   544
  | metis_command i n xs =
blanchet@36063
   545
    apply_command i n ^ "(metis " ^ space_implode " " xs ^ ")"
blanchet@36063
   546
fun metis_line i n xs =
blanchet@36063
   547
  "Try this command: " ^
blanchet@36063
   548
  Markup.markup Markup.sendback (metis_command i n xs) ^ ".\n" 
wenzelm@33310
   549
fun minimize_line _ [] = ""
blanchet@36063
   550
  | minimize_line name xs =
blanchet@36065
   551
      "To minimize the number of lemmas, try this command: " ^
blanchet@35966
   552
      Markup.markup Markup.sendback
blanchet@35966
   553
                    ("sledgehammer minimize [atps = " ^ name ^ "] (" ^
blanchet@36065
   554
                     space_implode " " xs ^ ")") ^ ".\n"
immler@31840
   555
blanchet@36064
   556
fun metis_lemma_list dfg name (result as (_, _, _, _, goal, i)) =
blanchet@36063
   557
  let
blanchet@36063
   558
    val (lemmas, used_conj) = extract_lemmas (get_step_nums dfg) result
blanchet@36063
   559
    val n = Logic.count_prems (prop_of goal)
blanchet@36063
   560
    val xs = kill_chained lemmas
blanchet@36063
   561
  in
blanchet@36064
   562
    (metis_line i n xs ^ minimize_line name xs ^
blanchet@35868
   563
     (if used_conj then
blanchet@35868
   564
        ""
blanchet@35868
   565
      else
blanchet@35868
   566
        "\nWarning: The goal is provable because the context is inconsistent."),
blanchet@35865
   567
     kill_chained lemmas)
wenzelm@33310
   568
  end;
immler@31037
   569
blanchet@36064
   570
fun structured_isar_proof modulus sorts name
blanchet@36064
   571
        (result as (proof, thm_names, conj_count, ctxt, goal, i)) =
wenzelm@33310
   572
  let
blanchet@36064
   573
    (* We could use "split_lines", but it can return blank lines. *)
blanchet@35865
   574
    val lines = String.tokens (equal #"\n");
blanchet@35868
   575
    val kill_spaces =
blanchet@35868
   576
      String.translate (fn c => if Char.isSpace c then "" else str c)
blanchet@35865
   577
    val extract = get_proof_extract proof
blanchet@35865
   578
    val cnfs = filter (String.isPrefix "cnf(") (map kill_spaces (lines extract))
blanchet@35865
   579
    val (one_line_proof, lemma_names) = metis_lemma_list false name result
blanchet@35868
   580
    val tokens = String.tokens (fn c => c = #" ") one_line_proof
blanchet@35868
   581
    val isar_proof =
blanchet@35868
   582
      if member (op =) tokens chained_hint then ""
blanchet@36064
   583
      else isar_proof_from_tstp_file cnfs modulus sorts ctxt goal i thm_names
wenzelm@33310
   584
  in
blanchet@36064
   585
    (one_line_proof ^
blanchet@36064
   586
     (if isar_proof = "" then ""
blanchet@36064
   587
      else "\nStructured proof:\n" ^ Markup.markup Markup.sendback isar_proof),
blanchet@36064
   588
     lemma_names)
blanchet@35865
   589
  end
paulson@21978
   590
immler@31038
   591
end;