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