src/HOL/Tools/Sledgehammer/sledgehammer_reconstruct.ML
author blanchet
Thu, 18 Oct 2012 15:41:15 +0200
changeset 49921 073d69478207
parent 49918 cf441f4a358b
child 49936 3e7522664453
permissions -rw-r--r--
tuned Isar output
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
     1
(*  Title:      HOL/Tools/Sledgehammer/sledgehammer_reconstruct.ML
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
     2
    Author:     Jasmin Blanchette, TU Muenchen
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
     3
    Author:     Steffen Juilf Smolka, TU Muenchen
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
     4
49914
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
     5
Isar proof reconstruction from ATP proofs.
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
     6
*)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
     7
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
     8
signature SLEDGEHAMMER_PROOF_RECONSTRUCT =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
     9
sig
49914
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    10
  type 'a proof = 'a ATP_Proof.proof
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    11
  type stature = ATP_Problem_Generate.stature
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    12
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    13
  datatype reconstructor =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    14
    Metis of string * string |
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    15
    SMT
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    16
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    17
  datatype play =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    18
    Played of reconstructor * Time.time |
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    19
    Trust_Playable of reconstructor * Time.time option |
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    20
    Failed_to_Play of reconstructor
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    21
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    22
  type minimize_command = string list -> string
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    23
  type one_line_params =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    24
    play * string * (string * stature) list * minimize_command * int * int
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    25
  type isar_params =
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
    26
    bool * bool * real * string Symtab.table * (string * stature) list vector
49914
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    27
    * int Symtab.table * string proof * thm
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    28
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    29
  val smtN : string
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    30
  val string_for_reconstructor : reconstructor -> string
49916
412346127bfa fixed theorem lookup code in Isar proof reconstruction
blanchet
parents: 49915
diff changeset
    31
  val thms_of_name : Proof.context -> string -> thm list
49914
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    32
  val lam_trans_from_atp_proof : string proof -> string -> string
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    33
  val is_typed_helper_used_in_atp_proof : string proof -> bool
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    34
  val used_facts_in_atp_proof :
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    35
    Proof.context -> (string * stature) list vector -> string proof ->
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    36
    (string * stature) list
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    37
  val used_facts_in_unsound_atp_proof :
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    38
    Proof.context -> (string * stature) list vector -> 'a proof ->
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    39
    string list option
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    40
  val one_line_proof_text : int -> one_line_params -> string
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
    41
  val isar_proof_text :
49913
blanchet
parents: 49883
diff changeset
    42
    Proof.context -> bool -> isar_params -> one_line_params -> string
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
    43
  val proof_text :
49913
blanchet
parents: 49883
diff changeset
    44
    Proof.context -> bool -> isar_params -> int -> one_line_params -> string
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
    45
end;
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
    46
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
    47
structure Sledgehammer_Reconstruct : SLEDGEHAMMER_PROOF_RECONSTRUCT =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
    48
struct
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
    49
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
    50
open ATP_Util
49914
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    51
open ATP_Problem
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
    52
open ATP_Proof
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
    53
open ATP_Problem_Generate
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
    54
open ATP_Proof_Reconstruct
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
    55
open Sledgehammer_Util
49914
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    56
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    57
structure String_Redirect = ATP_Proof_Redirect(
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    58
  type key = step_name
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    59
  val ord = fn ((s, _ : string list), (s', _)) => fast_string_ord (s, s')
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    60
  val string_of = fst)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    61
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
    62
open String_Redirect
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
    63
49916
412346127bfa fixed theorem lookup code in Isar proof reconstruction
blanchet
parents: 49915
diff changeset
    64
49914
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    65
(** reconstructors **)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    66
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    67
datatype reconstructor =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    68
  Metis of string * string |
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    69
  SMT
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    70
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    71
datatype play =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    72
  Played of reconstructor * Time.time |
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    73
  Trust_Playable of reconstructor * Time.time option |
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    74
  Failed_to_Play of reconstructor
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    75
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    76
val smtN = "smt"
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    77
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    78
fun string_for_reconstructor (Metis (type_enc, lam_trans)) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    79
    metis_call type_enc lam_trans
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    80
  | string_for_reconstructor SMT = smtN
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    81
49916
412346127bfa fixed theorem lookup code in Isar proof reconstruction
blanchet
parents: 49915
diff changeset
    82
fun thms_of_name ctxt name =
412346127bfa fixed theorem lookup code in Isar proof reconstruction
blanchet
parents: 49915
diff changeset
    83
  let
412346127bfa fixed theorem lookup code in Isar proof reconstruction
blanchet
parents: 49915
diff changeset
    84
    val lex = Keyword.get_lexicons
412346127bfa fixed theorem lookup code in Isar proof reconstruction
blanchet
parents: 49915
diff changeset
    85
    val get = maps (Proof_Context.get_fact ctxt o fst)
412346127bfa fixed theorem lookup code in Isar proof reconstruction
blanchet
parents: 49915
diff changeset
    86
  in
412346127bfa fixed theorem lookup code in Isar proof reconstruction
blanchet
parents: 49915
diff changeset
    87
    Source.of_string name
412346127bfa fixed theorem lookup code in Isar proof reconstruction
blanchet
parents: 49915
diff changeset
    88
    |> Symbol.source
412346127bfa fixed theorem lookup code in Isar proof reconstruction
blanchet
parents: 49915
diff changeset
    89
    |> Token.source {do_recover=SOME false} lex Position.start
412346127bfa fixed theorem lookup code in Isar proof reconstruction
blanchet
parents: 49915
diff changeset
    90
    |> Token.source_proper
412346127bfa fixed theorem lookup code in Isar proof reconstruction
blanchet
parents: 49915
diff changeset
    91
    |> Source.source Token.stopper (Parse_Spec.xthms1 >> get) NONE
412346127bfa fixed theorem lookup code in Isar proof reconstruction
blanchet
parents: 49915
diff changeset
    92
    |> Source.exhaust
412346127bfa fixed theorem lookup code in Isar proof reconstruction
blanchet
parents: 49915
diff changeset
    93
  end
412346127bfa fixed theorem lookup code in Isar proof reconstruction
blanchet
parents: 49915
diff changeset
    94
49914
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    95
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    96
(** fact extraction from ATP proofs **)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    97
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    98
fun find_first_in_list_vector vec key =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
    99
  Vector.foldl (fn (ps, NONE) => AList.lookup (op =) ps key
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   100
                 | (_, value) => value) NONE vec
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   101
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   102
val unprefix_fact_number = space_implode "_" o tl o space_explode "_"
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   103
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   104
fun resolve_one_named_fact fact_names s =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   105
  case try (unprefix fact_prefix) s of
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   106
    SOME s' =>
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   107
    let val s' = s' |> unprefix_fact_number |> unascii_of in
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   108
      s' |> find_first_in_list_vector fact_names |> Option.map (pair s')
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   109
    end
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   110
  | NONE => NONE
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   111
fun resolve_fact fact_names = map_filter (resolve_one_named_fact fact_names)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   112
fun is_fact fact_names = not o null o resolve_fact fact_names
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   113
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   114
fun resolve_one_named_conjecture s =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   115
  case try (unprefix conjecture_prefix) s of
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   116
    SOME s' => Int.fromString s'
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   117
  | NONE => NONE
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   118
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   119
val resolve_conjecture = map_filter resolve_one_named_conjecture
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   120
val is_conjecture = not o null o resolve_conjecture
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   121
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   122
val ascii_of_lam_fact_prefix = ascii_of lam_fact_prefix
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   123
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   124
(* overapproximation (good enough) *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   125
fun is_lam_lifted s =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   126
  String.isPrefix fact_prefix s andalso
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   127
  String.isSubstring ascii_of_lam_fact_prefix s
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   128
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   129
val is_combinator_def = String.isPrefix (helper_prefix ^ combinator_prefix)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   130
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   131
fun is_axiom_used_in_proof pred =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   132
  exists (fn Inference_Step ((_, ss), _, _, []) => exists pred ss | _ => false)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   133
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   134
fun lam_trans_from_atp_proof atp_proof default =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   135
  case (is_axiom_used_in_proof is_combinator_def atp_proof,
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   136
        is_axiom_used_in_proof is_lam_lifted atp_proof) of
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   137
    (false, false) => default
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   138
  | (false, true) => liftingN
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   139
(*  | (true, true) => combs_and_liftingN -- not supported by "metis" *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   140
  | (true, _) => combsN
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   141
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   142
val is_typed_helper_name =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   143
  String.isPrefix helper_prefix andf String.isSuffix typed_helper_suffix
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   144
fun is_typed_helper_used_in_atp_proof atp_proof =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   145
  is_axiom_used_in_proof is_typed_helper_name atp_proof
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   146
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   147
fun add_non_rec_defs fact_names accum =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   148
  Vector.foldl (fn (facts, facts') =>
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   149
      union (op =) (filter (fn (_, (_, status)) => status = Non_Rec_Def) facts)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   150
            facts')
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   151
    accum fact_names
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   152
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   153
val isa_ext = Thm.get_name_hint @{thm ext}
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   154
val isa_short_ext = Long_Name.base_name isa_ext
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   155
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   156
fun ext_name ctxt =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   157
  if Thm.eq_thm_prop (@{thm ext},
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   158
         singleton (Attrib.eval_thms ctxt) (Facts.named isa_short_ext, [])) then
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   159
    isa_short_ext
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   160
  else
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   161
    isa_ext
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   162
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   163
val leo2_ext = "extcnf_equal_neg"
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   164
val leo2_unfold_def = "unfold_def"
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   165
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   166
fun add_fact ctxt fact_names (Inference_Step ((_, ss), _, rule, deps)) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   167
    (if rule = leo2_ext then
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   168
       insert (op =) (ext_name ctxt, (Global, General))
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   169
     else if rule = leo2_unfold_def then
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   170
       (* LEO 1.3.3 does not record definitions properly, leading to missing
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   171
         dependencies in the TSTP proof. Remove the next line once this is
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   172
         fixed. *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   173
       add_non_rec_defs fact_names
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   174
     else if rule = satallax_coreN then
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   175
       (fn [] =>
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   176
           (* Satallax doesn't include definitions in its unsatisfiable cores,
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   177
              so we assume the worst and include them all here. *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   178
           [(ext_name ctxt, (Global, General))] |> add_non_rec_defs fact_names
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   179
         | facts => facts)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   180
     else
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   181
       I)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   182
    #> (if null deps then union (op =) (resolve_fact fact_names ss)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   183
        else I)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   184
  | add_fact _ _ _ = I
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   185
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   186
fun used_facts_in_atp_proof ctxt fact_names atp_proof =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   187
  if null atp_proof then Vector.foldl (uncurry (union (op =))) [] fact_names
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   188
  else fold (add_fact ctxt fact_names) atp_proof []
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   189
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   190
fun used_facts_in_unsound_atp_proof _ _ [] = NONE
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   191
  | used_facts_in_unsound_atp_proof ctxt fact_names atp_proof =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   192
    let val used_facts = used_facts_in_atp_proof ctxt fact_names atp_proof in
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   193
      if forall (fn (_, (sc, _)) => sc = Global) used_facts andalso
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   194
         not (is_axiom_used_in_proof (is_conjecture o single) atp_proof) then
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   195
        SOME (map fst used_facts)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   196
      else
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   197
        NONE
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   198
    end
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   199
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   200
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   201
(** one-liner reconstructor proofs **)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   202
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   203
fun string_for_label (s, num) = s ^ string_of_int num
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   204
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   205
fun show_time NONE = ""
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   206
  | show_time (SOME ext_time) = " (" ^ string_from_ext_time ext_time ^ ")"
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   207
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   208
fun unusing_chained_facts _ 0 = ""
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   209
  | unusing_chained_facts used_chaineds num_chained =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   210
    if length used_chaineds = num_chained then ""
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   211
    else if null used_chaineds then "(* using no facts *) "
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   212
    else "(* using only " ^ space_implode " " used_chaineds ^ " *) "
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   213
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   214
fun apply_on_subgoal _ 1 = "by "
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   215
  | apply_on_subgoal 1 _ = "apply "
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   216
  | apply_on_subgoal i n =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   217
    "prefer " ^ string_of_int i ^ " " ^ apply_on_subgoal 1 n
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   218
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   219
fun using_labels [] = ""
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   220
  | using_labels ls =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   221
    "using " ^ space_implode " " (map string_for_label ls) ^ " "
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   222
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   223
fun command_call name [] =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   224
    name |> not (Lexicon.is_identifier name) ? enclose "(" ")"
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   225
  | command_call name args = "(" ^ name ^ " " ^ space_implode " " args ^ ")"
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   226
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   227
fun reconstructor_command reconstr i n used_chaineds num_chained (ls, ss) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   228
  unusing_chained_facts used_chaineds num_chained ^
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   229
  using_labels ls ^ apply_on_subgoal i n ^
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   230
  command_call (string_for_reconstructor reconstr) ss
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   231
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   232
fun try_command_line banner time command =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   233
  banner ^ ": " ^ Markup.markup Isabelle_Markup.sendback command ^
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   234
  show_time time ^ "."
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   235
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   236
fun minimize_line _ [] = ""
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   237
  | minimize_line minimize_command ss =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   238
    case minimize_command ss of
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   239
      "" => ""
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   240
    | command =>
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   241
      "\nTo minimize: " ^ Markup.markup Isabelle_Markup.sendback command ^ "."
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   242
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   243
fun split_used_facts facts =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   244
  facts |> List.partition (fn (_, (sc, _)) => sc = Chained)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   245
        |> pairself (sort_distinct (string_ord o pairself fst))
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   246
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   247
type minimize_command = string list -> string
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   248
type one_line_params =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   249
  play * string * (string * stature) list * minimize_command * int * int
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   250
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   251
fun one_line_proof_text num_chained
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   252
        (preplay, banner, used_facts, minimize_command, subgoal,
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   253
         subgoal_count) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   254
  let
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   255
    val (chained, extra) = split_used_facts used_facts
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   256
    val (failed, reconstr, ext_time) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   257
      case preplay of
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   258
        Played (reconstr, time) => (false, reconstr, (SOME (false, time)))
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   259
      | Trust_Playable (reconstr, time) =>
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   260
        (false, reconstr,
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   261
         case time of
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   262
           NONE => NONE
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   263
         | SOME time =>
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   264
           if time = Time.zeroTime then NONE else SOME (true, time))
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   265
      | Failed_to_Play reconstr => (true, reconstr, NONE)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   266
    val try_line =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   267
      ([], map fst extra)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   268
      |> reconstructor_command reconstr subgoal subgoal_count (map fst chained)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   269
                               num_chained
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   270
      |> (if failed then
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   271
            enclose "One-line proof reconstruction failed: "
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   272
                     ".\n(Invoking \"sledgehammer\" with \"[strict]\" might \
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   273
                     \solve this.)"
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   274
          else
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   275
            try_command_line banner ext_time)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   276
  in try_line ^ minimize_line minimize_command (map fst (extra @ chained)) end
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   277
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   278
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   279
(** Isar proof construction and manipulation **)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   280
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   281
type label = string * int
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   282
type facts = label list * string list
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   283
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   284
datatype isar_qualifier = Show | Then | Moreover | Ultimately
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   285
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   286
datatype isar_step =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   287
  Fix of (string * typ) list |
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   288
  Let of term * term |
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   289
  Assume of label * term |
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   290
  Prove of isar_qualifier list * label * term * byline
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   291
and byline =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   292
  By_Metis of facts |
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   293
  Case_Split of isar_step list list * facts
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   294
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   295
val assum_prefix = "a"
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   296
val have_prefix = "f"
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   297
val raw_prefix = "x"
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   298
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   299
fun raw_label_for_name (num, ss) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   300
  case resolve_conjecture ss of
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   301
    [j] => (conjecture_prefix, j)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   302
  | _ => (raw_prefix ^ ascii_of num, 0)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   303
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   304
fun add_fact_from_dependency fact_names (name as (_, ss)) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   305
  if is_fact fact_names ss then
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   306
    apsnd (union (op =) (map fst (resolve_fact fact_names ss)))
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   307
  else
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   308
    apfst (insert (op =) (raw_label_for_name name))
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   309
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   310
fun repair_name "$true" = "c_True"
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   311
  | repair_name "$false" = "c_False"
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   312
  | repair_name "$$e" = tptp_equal (* seen in Vampire proofs *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   313
  | repair_name s =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   314
    if is_tptp_equal s orelse
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   315
       (* seen in Vampire proofs *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   316
       (String.isPrefix "sQ" s andalso String.isSuffix "_eqProxy" s) then
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   317
      tptp_equal
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   318
    else
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   319
      s
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   320
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   321
fun unvarify_term (Var ((s, 0), T)) = Free (s, T)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   322
  | unvarify_term t = raise TERM ("unvarify_term: non-Var", [t])
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   323
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   324
fun infer_formula_types ctxt =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   325
  Type.constraint HOLogic.boolT
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   326
  #> Syntax.check_term
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   327
         (Proof_Context.set_mode Proof_Context.mode_schematic ctxt)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   328
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   329
val combinator_table =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   330
  [(@{const_name Meson.COMBI}, @{thm Meson.COMBI_def [abs_def]}),
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   331
   (@{const_name Meson.COMBK}, @{thm Meson.COMBK_def [abs_def]}),
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   332
   (@{const_name Meson.COMBB}, @{thm Meson.COMBB_def [abs_def]}),
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   333
   (@{const_name Meson.COMBC}, @{thm Meson.COMBC_def [abs_def]}),
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   334
   (@{const_name Meson.COMBS}, @{thm Meson.COMBS_def [abs_def]})]
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   335
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   336
fun uncombine_term thy =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   337
  let
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   338
    fun aux (t1 $ t2) = betapply (pairself aux (t1, t2))
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   339
      | aux (Abs (s, T, t')) = Abs (s, T, aux t')
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   340
      | aux (t as Const (x as (s, _))) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   341
        (case AList.lookup (op =) combinator_table s of
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   342
           SOME thm => thm |> prop_of |> specialize_type thy x
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   343
                           |> Logic.dest_equals |> snd
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   344
         | NONE => t)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   345
      | aux t = t
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   346
  in aux end
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   347
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   348
fun decode_line sym_tab (Definition_Step (name, phi1, phi2)) ctxt =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   349
    let
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   350
      val thy = Proof_Context.theory_of ctxt
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   351
      val t1 = prop_from_atp ctxt true sym_tab phi1
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   352
      val vars = snd (strip_comb t1)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   353
      val frees = map unvarify_term vars
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   354
      val unvarify_args = subst_atomic (vars ~~ frees)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   355
      val t2 = prop_from_atp ctxt true sym_tab phi2
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   356
      val (t1, t2) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   357
        HOLogic.eq_const HOLogic.typeT $ t1 $ t2
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   358
        |> unvarify_args |> uncombine_term thy |> infer_formula_types ctxt
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   359
        |> HOLogic.dest_eq
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   360
    in
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   361
      (Definition_Step (name, t1, t2),
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   362
       fold Variable.declare_term (maps Misc_Legacy.term_frees [t1, t2]) ctxt)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   363
    end
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   364
  | decode_line sym_tab (Inference_Step (name, u, rule, deps)) ctxt =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   365
    let
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   366
      val thy = Proof_Context.theory_of ctxt
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   367
      val t = u |> prop_from_atp ctxt true sym_tab
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   368
                |> uncombine_term thy |> infer_formula_types ctxt
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   369
    in
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   370
      (Inference_Step (name, t, rule, deps),
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   371
       fold Variable.declare_term (Misc_Legacy.term_frees t) ctxt)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   372
    end
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   373
fun decode_lines ctxt sym_tab lines =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   374
  fst (fold_map (decode_line sym_tab) lines ctxt)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   375
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   376
fun replace_one_dependency (old, new) dep =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   377
  if is_same_atp_step dep old then new else [dep]
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   378
fun replace_dependencies_in_line _ (line as Definition_Step _) = line
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   379
  | replace_dependencies_in_line p (Inference_Step (name, t, rule, deps)) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   380
    Inference_Step (name, t, rule,
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   381
                    fold (union (op =) o replace_one_dependency p) deps [])
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   382
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   383
(* No "real" literals means only type information (tfree_tcs, clsrel, or
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   384
   clsarity). *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   385
fun is_only_type_information t = t aconv @{term True}
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   386
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   387
fun is_same_inference _ (Definition_Step _) = false
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   388
  | is_same_inference t (Inference_Step (_, t', _, _)) = t aconv t'
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   389
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   390
(* Discard facts; consolidate adjacent lines that prove the same formula, since
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   391
   they differ only in type information.*)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   392
fun add_line _ (line as Definition_Step _) lines = line :: lines
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   393
  | add_line fact_names (Inference_Step (name as (_, ss), t, rule, [])) lines =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   394
    (* No dependencies: fact, conjecture, or (for Vampire) internal facts or
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   395
       definitions. *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   396
    if is_fact fact_names ss then
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   397
      (* Facts are not proof lines. *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   398
      if is_only_type_information t then
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   399
        map (replace_dependencies_in_line (name, [])) lines
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   400
      (* Is there a repetition? If so, replace later line by earlier one. *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   401
      else case take_prefix (not o is_same_inference t) lines of
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   402
        (_, []) => lines (* no repetition of proof line *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   403
      | (pre, Inference_Step (name', _, _, _) :: post) =>
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   404
        pre @ map (replace_dependencies_in_line (name', [name])) post
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   405
      | _ => raise Fail "unexpected inference"
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   406
    else if is_conjecture ss then
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   407
      Inference_Step (name, t, rule, []) :: lines
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   408
    else
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   409
      map (replace_dependencies_in_line (name, [])) lines
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   410
  | add_line _ (Inference_Step (name, t, rule, deps)) lines =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   411
    (* Type information will be deleted later; skip repetition test. *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   412
    if is_only_type_information t then
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   413
      Inference_Step (name, t, rule, deps) :: lines
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   414
    (* Is there a repetition? If so, replace later line by earlier one. *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   415
    else case take_prefix (not o is_same_inference t) lines of
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   416
      (* FIXME: Doesn't this code risk conflating proofs involving different
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   417
         types? *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   418
       (_, []) => Inference_Step (name, t, rule, deps) :: lines
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   419
     | (pre, Inference_Step (name', t', rule, _) :: post) =>
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   420
       Inference_Step (name, t', rule, deps) ::
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   421
       pre @ map (replace_dependencies_in_line (name', [name])) post
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   422
     | _ => raise Fail "unexpected inference"
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   423
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   424
val waldmeister_conjecture_num = "1.0.0.0"
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   425
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   426
val repair_waldmeister_endgame =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   427
  let
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   428
    fun do_tail (Inference_Step (name, t, rule, deps)) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   429
        Inference_Step (name, s_not t, rule, deps)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   430
      | do_tail line = line
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   431
    fun do_body [] = []
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   432
      | do_body ((line as Inference_Step ((num, _), _, _, _)) :: lines) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   433
        if num = waldmeister_conjecture_num then map do_tail (line :: lines)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   434
        else line :: do_body lines
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   435
      | do_body (line :: lines) = line :: do_body lines
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   436
  in do_body end
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   437
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   438
(* Recursively delete empty lines (type information) from the proof. *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   439
fun add_nontrivial_line (line as Inference_Step (name, t, _, [])) lines =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   440
    if is_only_type_information t then delete_dependency name lines
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   441
    else line :: lines
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   442
  | add_nontrivial_line line lines = line :: lines
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   443
and delete_dependency name lines =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   444
  fold_rev add_nontrivial_line
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   445
           (map (replace_dependencies_in_line (name, [])) lines) []
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   446
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   447
(* ATPs sometimes reuse free variable names in the strangest ways. Removing
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   448
   offending lines often does the trick. *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   449
fun is_bad_free frees (Free x) = not (member (op =) frees x)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   450
  | is_bad_free _ _ = false
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   451
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   452
fun add_desired_line _ _ (line as Definition_Step (name, _, _)) (j, lines) =
49914
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   453
    (j, line :: map (replace_dependencies_in_line (name, [])) lines)
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   454
  | add_desired_line fact_names frees
49914
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   455
        (Inference_Step (name as (_, ss), t, rule, deps)) (j, lines) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   456
    (j + 1,
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   457
     if is_fact fact_names ss orelse
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   458
        is_conjecture ss orelse
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   459
        (* the last line must be kept *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   460
        j = 0 orelse
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   461
        (not (is_only_type_information t) andalso
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   462
         null (Term.add_tvars t []) andalso
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   463
         not (exists_subterm (is_bad_free frees) t) andalso
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   464
         length deps >= 2 andalso
49914
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   465
         (* kill next to last line, which usually results in a trivial step *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   466
         j <> 1) then
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   467
       Inference_Step (name, t, rule, deps) :: lines  (* keep line *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   468
     else
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   469
       map (replace_dependencies_in_line (name, deps)) lines)  (* drop line *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   470
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   471
(** Type annotations **)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   472
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   473
fun post_traverse_term_type' f _ (t as Const (_, T)) s = f t T s
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   474
  | post_traverse_term_type' f _ (t as Free (_, T)) s = f t T s
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   475
  | post_traverse_term_type' f _ (t as Var (_, T)) s = f t T s
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   476
  | post_traverse_term_type' f env (t as Bound i) s = f t (nth env i) s
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   477
  | post_traverse_term_type' f env (Abs (x, T1, b)) s =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   478
    let
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   479
      val ((b', s'), T2) = post_traverse_term_type' f (T1 :: env) b s
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   480
    in f (Abs (x, T1, b')) (T1 --> T2) s' end
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   481
  | post_traverse_term_type' f env (u $ v) s =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   482
    let
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   483
      val ((u', s'), Type (_, [_, T])) = post_traverse_term_type' f env u s
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   484
      val ((v', s''), _) = post_traverse_term_type' f env v s'
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   485
    in f (u' $ v') T s'' end
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   486
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   487
fun post_traverse_term_type f s t =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   488
  post_traverse_term_type' (fn t => fn T => fn s => (f t T s, T)) [] t s |> fst
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   489
fun post_fold_term_type f s t =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   490
  post_traverse_term_type (fn t => fn T => fn s => (t, f t T s)) s t |> snd
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   491
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   492
(* Data structures, orders *)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   493
val cost_ord = prod_ord int_ord (prod_ord int_ord int_ord)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   494
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   495
structure Var_Set_Tab = Table(
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   496
  type key = indexname list
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   497
  val ord = list_ord Term_Ord.fast_indexname_ord)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   498
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   499
(* (1) Generalize Types *)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   500
fun generalize_types ctxt t =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   501
  t |> map_types (fn _ => dummyT)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   502
    |> Syntax.check_term
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   503
         (Proof_Context.set_mode Proof_Context.mode_pattern ctxt)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   504
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   505
(* (2) Typing-spot Table *)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   506
local
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   507
fun key_of_atype (TVar (idxn, _)) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   508
    Ord_List.insert Term_Ord.fast_indexname_ord idxn
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   509
  | key_of_atype _ = I
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   510
fun key_of_type T = fold_atyps key_of_atype T []
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   511
fun update_tab t T (tab, pos) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   512
  (case key_of_type T of
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   513
     [] => tab
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   514
   | key =>
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   515
     let val cost = (size_of_typ T, (size_of_term t, pos)) in
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   516
       case Var_Set_Tab.lookup tab key of
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   517
         NONE => Var_Set_Tab.update_new (key, cost) tab
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   518
       | SOME old_cost =>
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   519
         (case cost_ord (cost, old_cost) of
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   520
            LESS => Var_Set_Tab.update (key, cost) tab
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   521
          | _ => tab)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   522
     end,
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   523
   pos + 1)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   524
in
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   525
val typing_spot_table =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   526
  post_fold_term_type update_tab (Var_Set_Tab.empty, 0) #> fst
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   527
end
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   528
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   529
(* (3) Reverse-Greedy *)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   530
fun reverse_greedy typing_spot_tab =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   531
  let
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   532
    fun update_count z =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   533
      fold (fn tvar => fn tab =>
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   534
        let val c = Vartab.lookup tab tvar |> the_default 0 in
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   535
          Vartab.update (tvar, c + z) tab
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   536
        end)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   537
    fun superfluous tcount =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   538
      forall (fn tvar => the (Vartab.lookup tcount tvar) > 1)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   539
    fun drop_superfluous (tvars, (_, (_, spot))) (spots, tcount) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   540
      if superfluous tcount tvars then (spots, update_count ~1 tvars tcount)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   541
      else (spot :: spots, tcount)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   542
    val (typing_spots, tvar_count_tab) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   543
      Var_Set_Tab.fold
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   544
        (fn kv as (k, _) => apfst (cons kv) #> apsnd (update_count 1 k))
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   545
        typing_spot_tab ([], Vartab.empty)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   546
      |>> sort_distinct (rev_order o cost_ord o pairself snd)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   547
  in fold drop_superfluous typing_spots ([], tvar_count_tab) |> fst end
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   548
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   549
(* (4) Introduce Annotations *)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   550
fun introduce_annotations thy spots t t' =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   551
  let
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   552
    val get_types = post_fold_term_type (K cons) []
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   553
    fun match_types tp =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   554
      fold (Sign.typ_match thy) (op ~~ (pairself get_types tp)) Vartab.empty
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   555
    fun unica' b x [] = if b then [x] else []
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   556
      | unica' b x (y :: ys) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   557
        if x = y then unica' false x ys
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   558
        else unica' true y ys |> b ? cons x
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   559
    fun unica ord xs =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   560
      case sort ord xs of x :: ys => unica' true x ys | [] => []
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   561
    val add_all_tfree_namesT = fold_atyps (fn TFree (x, _) => cons x | _ => I)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   562
    fun erase_unica_tfrees env =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   563
      let
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   564
        val unica =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   565
          Vartab.fold (add_all_tfree_namesT o snd o snd) env []
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   566
          |> unica fast_string_ord
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   567
        val erase_unica = map_atyps
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   568
          (fn T as TFree (s, _) =>
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   569
              if Ord_List.member fast_string_ord unica s then dummyT else T
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   570
            | T => T)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   571
      in Vartab.map (K (apsnd erase_unica)) env end
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   572
    val env = match_types (t', t) |> erase_unica_tfrees
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   573
    fun get_annot env (TFree _) = (false, (env, dummyT))
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   574
      | get_annot env (T as TVar (v, S)) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   575
        let val T' = Envir.subst_type env T in
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   576
          if T' = dummyT then (false, (env, dummyT))
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   577
          else (true, (Vartab.update (v, (S, dummyT)) env, T'))
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   578
        end
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   579
      | get_annot env (Type (S, Ts)) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   580
        (case fold_rev (fn T => fn (b, (env, Ts)) =>
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   581
                  let
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   582
                    val (b', (env', T)) = get_annot env T
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   583
                  in (b orelse b', (env', T :: Ts)) end)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   584
                Ts (false, (env, [])) of
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   585
           (true, (env', Ts)) => (true, (env', Type (S, Ts)))
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   586
         | (false, (env', _)) => (false, (env', dummyT)))
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   587
    fun post1 _ T (env, cp, ps as p :: ps', annots) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   588
        if p <> cp then
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   589
          (env, cp + 1, ps, annots)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   590
        else
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   591
          let val (_, (env', T')) = get_annot env T in
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   592
            (env', cp + 1, ps', (p, T') :: annots)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   593
          end
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   594
      | post1 _ _ accum = accum
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   595
    val (_, _, _, annots) = post_fold_term_type post1 (env, 0, spots, []) t'
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   596
    fun post2 t _ (cp, annots as (p, T) :: annots') =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   597
        if p <> cp then (t, (cp + 1, annots))
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   598
        else (Type.constraint T t, (cp + 1, annots'))
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   599
      | post2 t _ x = (t, x)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   600
  in post_traverse_term_type post2 (0, rev annots) t |> fst end
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   601
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   602
(* (5) Annotate *)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   603
fun annotate_types ctxt t =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   604
  let
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   605
    val thy = Proof_Context.theory_of ctxt
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   606
    val t' = generalize_types ctxt t
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   607
    val typing_spots =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   608
      t' |> typing_spot_table
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   609
         |> reverse_greedy
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   610
         |> sort int_ord
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   611
  in introduce_annotations thy typing_spots t t' end
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   612
49914
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   613
val indent_size = 2
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   614
val no_label = ("", ~1)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   615
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   616
fun string_for_proof ctxt type_enc lam_trans i n =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   617
  let
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   618
    fun fix_print_mode f x =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   619
      Print_Mode.setmp (filter (curry (op =) Symbol.xsymbolsN)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   620
                               (print_mode_value ())) f x
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   621
    fun do_indent ind = replicate_string (ind * indent_size) " "
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   622
    fun do_free (s, T) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   623
      maybe_quote s ^ " :: " ^
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   624
      maybe_quote (fix_print_mode (Syntax.string_of_typ ctxt) T)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   625
    fun do_label l = if l = no_label then "" else string_for_label l ^ ": "
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   626
    fun do_have qs =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   627
      (if member (op =) qs Moreover then "moreover " else "") ^
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   628
      (if member (op =) qs Ultimately then "ultimately " else "") ^
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   629
      (if member (op =) qs Then then
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   630
         if member (op =) qs Show then "thus" else "hence"
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   631
       else
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   632
         if member (op =) qs Show then "show" else "have")
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   633
    val do_term =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   634
      maybe_quote o fix_print_mode (Syntax.string_of_term ctxt)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   635
      o annotate_types ctxt
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   636
    val reconstr = Metis (type_enc, lam_trans)
49921
073d69478207 tuned Isar output
blanchet
parents: 49918
diff changeset
   637
    fun do_facts ind (ls, ss) =
073d69478207 tuned Isar output
blanchet
parents: 49918
diff changeset
   638
      "\n" ^ do_indent (ind + 1) ^
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   639
      reconstructor_command reconstr 1 1 [] 0
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   640
          (ls |> sort_distinct (prod_ord string_ord int_ord),
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   641
           ss |> sort_distinct string_ord)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   642
    and do_step ind (Fix xs) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   643
        do_indent ind ^ "fix " ^ space_implode " and " (map do_free xs) ^ "\n"
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   644
      | do_step ind (Let (t1, t2)) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   645
        do_indent ind ^ "let " ^ do_term t1 ^ " = " ^ do_term t2 ^ "\n"
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   646
      | do_step ind (Assume (l, t)) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   647
        do_indent ind ^ "assume " ^ do_label l ^ do_term t ^ "\n"
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   648
      | do_step ind (Prove (qs, l, t, By_Metis facts)) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   649
        do_indent ind ^ do_have qs ^ " " ^
49921
073d69478207 tuned Isar output
blanchet
parents: 49918
diff changeset
   650
        do_label l ^ do_term t ^ do_facts ind facts ^ "\n"
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   651
      | do_step ind (Prove (qs, l, t, Case_Split (proofs, facts))) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   652
        implode (map (prefix (do_indent ind ^ "moreover\n") o do_block ind)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   653
                     proofs) ^
49921
073d69478207 tuned Isar output
blanchet
parents: 49918
diff changeset
   654
        do_indent ind ^ do_have qs ^ " " ^ do_label l ^ do_term t ^
073d69478207 tuned Isar output
blanchet
parents: 49918
diff changeset
   655
        do_facts ind facts ^ "\n"
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   656
    and do_steps prefix suffix ind steps =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   657
      let val s = implode (map (do_step ind) steps) in
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   658
        replicate_string (ind * indent_size - size prefix) " " ^ prefix ^
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   659
        String.extract (s, ind * indent_size,
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   660
                        SOME (size s - ind * indent_size - 1)) ^
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   661
        suffix ^ "\n"
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   662
      end
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   663
    and do_block ind proof = do_steps "{ " " }" (ind + 1) proof
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   664
    (* One-step proofs are pointless; better use the Metis one-liner
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   665
       directly. *)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   666
    and do_proof [Prove (_, _, _, By_Metis _)] = ""
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   667
      | do_proof proof =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   668
        (if i <> 1 then "prefer " ^ string_of_int i ^ "\n" else "") ^
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   669
        do_indent 0 ^ "proof -\n" ^ do_steps "" "" 1 proof ^ do_indent 0 ^
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   670
        (if n <> 1 then "next" else "qed")
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   671
  in do_proof end
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   672
49914
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   673
(* FIXME: Still needed? Try with SPASS proofs perhaps. *)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   674
val kill_duplicate_assumptions_in_proof =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   675
  let
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   676
    fun relabel_facts subst =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   677
      apfst (map (fn l => AList.lookup (op =) subst l |> the_default l))
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   678
    fun do_step (step as Assume (l, t)) (proof, subst, assums) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   679
        (case AList.lookup (op aconv) assums t of
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   680
           SOME l' => (proof, (l, l') :: subst, assums)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   681
         | NONE => (step :: proof, subst, (t, l) :: assums))
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   682
      | do_step (Prove (qs, l, t, by)) (proof, subst, assums) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   683
        (Prove (qs, l, t,
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   684
                case by of
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   685
                  By_Metis facts => By_Metis (relabel_facts subst facts)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   686
                | Case_Split (proofs, facts) =>
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   687
                  Case_Split (map do_proof proofs,
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   688
                              relabel_facts subst facts)) ::
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   689
         proof, subst, assums)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   690
      | do_step step (proof, subst, assums) = (step :: proof, subst, assums)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   691
    and do_proof proof = fold do_step proof ([], [], []) |> #1 |> rev
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   692
  in do_proof end
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   693
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   694
fun used_labels_of_step (Prove (_, _, _, by)) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   695
    (case by of
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   696
       By_Metis (ls, _) => ls
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   697
     | Case_Split (proofs, (ls, _)) =>
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   698
       fold (union (op =) o used_labels_of) proofs ls)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   699
  | used_labels_of_step _ = []
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   700
and used_labels_of proof = fold (union (op =) o used_labels_of_step) proof []
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   701
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   702
fun kill_useless_labels_in_proof proof =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   703
  let
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   704
    val used_ls = used_labels_of proof
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   705
    fun do_label l = if member (op =) used_ls l then l else no_label
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   706
    fun do_step (Assume (l, t)) = Assume (do_label l, t)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   707
      | do_step (Prove (qs, l, t, by)) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   708
        Prove (qs, do_label l, t,
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   709
               case by of
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   710
                 Case_Split (proofs, facts) =>
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   711
                 Case_Split (map (map do_step) proofs, facts)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   712
               | _ => by)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   713
      | do_step step = step
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   714
  in map do_step proof end
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   715
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   716
fun prefix_for_depth n = replicate_string (n + 1)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   717
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   718
val relabel_proof =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   719
  let
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   720
    fun aux _ _ _ [] = []
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   721
      | aux subst depth (next_assum, next_fact) (Assume (l, t) :: proof) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   722
        if l = no_label then
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   723
          Assume (l, t) :: aux subst depth (next_assum, next_fact) proof
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   724
        else
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   725
          let val l' = (prefix_for_depth depth assum_prefix, next_assum) in
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   726
            Assume (l', t) ::
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   727
            aux ((l, l') :: subst) depth (next_assum + 1, next_fact) proof
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   728
          end
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   729
      | aux subst depth (next_assum, next_fact)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   730
            (Prove (qs, l, t, by) :: proof) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   731
        let
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   732
          val (l', subst, next_fact) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   733
            if l = no_label then
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   734
              (l, subst, next_fact)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   735
            else
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   736
              let
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   737
                val l' = (prefix_for_depth depth have_prefix, next_fact)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   738
              in (l', (l, l') :: subst, next_fact + 1) end
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   739
          val relabel_facts =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   740
            apfst (maps (the_list o AList.lookup (op =) subst))
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   741
          val by =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   742
            case by of
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   743
              By_Metis facts => By_Metis (relabel_facts facts)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   744
            | Case_Split (proofs, facts) =>
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   745
              Case_Split (map (aux subst (depth + 1) (1, 1)) proofs,
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   746
                          relabel_facts facts)
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   747
        in
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   748
          Prove (qs, l', t, by) :: aux subst depth (next_assum, next_fact) proof
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   749
        end
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   750
      | aux subst depth nextp (step :: proof) =
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   751
        step :: aux subst depth nextp proof
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   752
  in aux [] 0 (1, 1) end
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   753
49917
blanchet
parents: 49916
diff changeset
   754
val merge_timeout_slack = 1.2
blanchet
parents: 49916
diff changeset
   755
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   756
fun shrink_locally ctxt type_enc lam_trans isar_shrinkage proof =
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   757
  let
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   758
    (* Merging spots, greedy algorithm *)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   759
    fun cost (Prove (_, _ , t, _)) = Term.size_of_term t
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   760
      | cost _ = ~1
49913
blanchet
parents: 49883
diff changeset
   761
    fun can_merge (Prove (_, lbl, _, By_Metis _))
blanchet
parents: 49883
diff changeset
   762
                  (Prove (_, _, _, By_Metis _)) =
blanchet
parents: 49883
diff changeset
   763
        (lbl = no_label)
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   764
      | can_merge _ _ = false
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   765
    val merge_spots = 
49913
blanchet
parents: 49883
diff changeset
   766
      fold_index (fn (i, s2) => fn (s1, pile) =>
blanchet
parents: 49883
diff changeset
   767
          (s2, pile |> can_merge s1 s2 ? cons (i, cost s1)))
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   768
        (tl proof) (hd proof, [])
49917
blanchet
parents: 49916
diff changeset
   769
      |> snd |> sort (rev_order o int_ord o pairself snd) |> map fst
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   770
49917
blanchet
parents: 49916
diff changeset
   771
    (* Enrich context with local facts *)
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   772
    val thy = Proof_Context.theory_of ctxt
49915
blanchet
parents: 49914
diff changeset
   773
    fun sorry t = Skip_Proof.make_thm thy (HOLogic.mk_Trueprop t)
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   774
    fun enrich_ctxt' (Prove (_, lbl, t, _)) ctxt = 
49913
blanchet
parents: 49883
diff changeset
   775
        ctxt |> lbl <> no_label
blanchet
parents: 49883
diff changeset
   776
          ? Proof_Context.put_thms false (string_for_label lbl, SOME [sorry t])
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   777
      | enrich_ctxt' _ ctxt = ctxt
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   778
    val rich_ctxt = fold enrich_ctxt' proof ctxt
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   779
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   780
    (* Timing *)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   781
    fun take_time tac arg =
49917
blanchet
parents: 49916
diff changeset
   782
      let val timing = Timing.start () in
blanchet
parents: 49916
diff changeset
   783
        (tac arg; Timing.result timing |> #cpu)
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   784
      end
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   785
    fun try_metis (Prove (qs, _, t, By_Metis fact_names)) s0 =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   786
      let
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   787
        fun thmify (Prove (_, _, t, _)) = sorry t
49913
blanchet
parents: 49883
diff changeset
   788
        val facts =
blanchet
parents: 49883
diff changeset
   789
          fact_names
49915
blanchet
parents: 49914
diff changeset
   790
          |>> map string_for_label |> op @
49916
412346127bfa fixed theorem lookup code in Isar proof reconstruction
blanchet
parents: 49915
diff changeset
   791
          |> map (the_single o thms_of_name rich_ctxt)
49913
blanchet
parents: 49883
diff changeset
   792
          |> (if member (op =) qs Then then cons (the s0 |> thmify) else I)
49915
blanchet
parents: 49914
diff changeset
   793
        val goal = Goal.prove ctxt [] [] (HOLogic.mk_Trueprop t)
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   794
        fun tac {context = ctxt, prems = _} =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   795
          Metis_Tactic.metis_tac [type_enc] lam_trans ctxt facts 1
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   796
      in
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   797
        take_time (fn () => goal tac)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   798
      end
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   799
  
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   800
    (* Merging *)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   801
    fun merge (Prove (qs1, _, _, By_Metis (ls1, ss1))) 
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   802
              (Prove (qs2, lbl , t, By_Metis (ls2, ss2))) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   803
      let
49913
blanchet
parents: 49883
diff changeset
   804
        val qs =
blanchet
parents: 49883
diff changeset
   805
          inter (op =) qs1 qs2 (* FIXME: Is this correct? *)
blanchet
parents: 49883
diff changeset
   806
          |> member (op =) (union (op =) qs1 qs2) Ultimately ? cons Ultimately
blanchet
parents: 49883
diff changeset
   807
          |> member (op =) qs2 Show ? cons Show
blanchet
parents: 49883
diff changeset
   808
      in Prove (qs, lbl, t, By_Metis (ls1 @ ls2, ss1 @ ss2)) end
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   809
    fun try_merge proof i =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   810
      let
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   811
        val (front, s0, s1, s2, tail) = 
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   812
          case (proof, i) of
49913
blanchet
parents: 49883
diff changeset
   813
            ((s1 :: s2 :: proof), 0) => ([], NONE, s1, s2, proof)
blanchet
parents: 49883
diff changeset
   814
          | _ =>
blanchet
parents: 49883
diff changeset
   815
            let val (front, s0 :: s1 :: s2 :: tail) = chop (i - 1) proof in
blanchet
parents: 49883
diff changeset
   816
              (front, SOME s0, s1, s2, tail)
blanchet
parents: 49883
diff changeset
   817
            end
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   818
        val s12 = merge s1 s2
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   819
        val t1 = try_metis s1 s0 ()
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   820
        val t2 = try_metis s2 (SOME s1) ()
49917
blanchet
parents: 49916
diff changeset
   821
        val timeout =
blanchet
parents: 49916
diff changeset
   822
          t1 + t2 |> Time.toReal |> curry Real.* merge_timeout_slack
blanchet
parents: 49916
diff changeset
   823
                  |> Time.fromReal
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   824
      in
49917
blanchet
parents: 49916
diff changeset
   825
        (TimeLimit.timeLimit timeout (try_metis s12 s0) ();
49915
blanchet
parents: 49914
diff changeset
   826
         SOME (front @ (the_list s0 @ s12 :: tail)))
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   827
        handle _ => NONE
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   828
      end
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   829
    fun spill_shrinkage shrinkage = isar_shrinkage + shrinkage - 1.0
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   830
    fun merge_steps _ proof [] = proof
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   831
      | merge_steps shrinkage proof (i :: is) = 
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   832
        if shrinkage < 1.5 then
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   833
          merge_steps (spill_shrinkage shrinkage) proof is
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   834
        else case try_merge proof i of
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   835
          NONE => merge_steps (spill_shrinkage shrinkage) proof is
49913
blanchet
parents: 49883
diff changeset
   836
        | SOME proof' =>
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   837
          merge_steps (shrinkage - 1.0) proof'
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   838
            (map (fn j => if j > i then j - 1 else j) is)
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   839
  in merge_steps isar_shrinkage proof merge_spots end
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   840
49914
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   841
type isar_params =
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   842
  bool * bool * real * string Symtab.table * (string * stature) list vector
49914
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   843
  * int Symtab.table * string proof * thm
23e36a4d28f1 refactor code
blanchet
parents: 49913
diff changeset
   844
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   845
fun isar_proof_text ctxt isar_proofs
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   846
    (debug, verbose, isar_shrinkage, pool, fact_names, sym_tab, atp_proof, goal)
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   847
    (one_line_params as (_, _, _, _, subgoal, subgoal_count)) =
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   848
  let
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   849
    val (params, hyp_ts, concl_t) = strip_subgoal ctxt goal subgoal
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   850
    val frees = fold Term.add_frees (concl_t :: hyp_ts) []
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   851
    val one_line_proof = one_line_proof_text 0 one_line_params
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   852
    val type_enc =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   853
      if is_typed_helper_used_in_atp_proof atp_proof then full_typesN
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   854
      else partial_typesN
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   855
    val lam_trans = lam_trans_from_atp_proof atp_proof metis_default_lam_trans
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   856
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   857
    fun isar_proof_of () =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   858
      let
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   859
        val atp_proof =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   860
          atp_proof
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   861
          |> clean_up_atp_proof_dependencies
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   862
          |> nasty_atp_proof pool
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   863
          |> map_term_names_in_atp_proof repair_name
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   864
          |> decode_lines ctxt sym_tab
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   865
          |> rpair [] |-> fold_rev (add_line fact_names)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   866
          |> repair_waldmeister_endgame
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   867
          |> rpair [] |-> fold_rev add_nontrivial_line
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   868
          |> rpair (0, [])
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   869
          |-> fold_rev (add_desired_line fact_names frees)
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   870
          |> snd
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   871
        val conj_name = conjecture_prefix ^ string_of_int (length hyp_ts)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   872
        val conjs =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   873
          atp_proof
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   874
          |> map_filter (fn Inference_Step (name as (_, ss), _, _, []) =>
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   875
                            if member (op =) ss conj_name then SOME name else NONE
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   876
                          | _ => NONE)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   877
        fun dep_of_step (Definition_Step _) = NONE
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   878
          | dep_of_step (Inference_Step (name, _, _, from)) = SOME (from, name)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   879
        val ref_graph = atp_proof |> map_filter dep_of_step |> make_ref_graph
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   880
        val axioms = axioms_of_ref_graph ref_graph conjs
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   881
        val tainted = tainted_atoms_of_ref_graph ref_graph conjs
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   882
        val props =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   883
          Symtab.empty
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   884
          |> fold (fn Definition_Step _ => I (* FIXME *)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   885
                    | Inference_Step ((s, _), t, _, _) =>
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   886
                      Symtab.update_new (s,
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   887
                          t |> fold forall_of (map Var (Term.add_vars t []))
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   888
                            |> member (op = o apsnd fst) tainted s ? s_not))
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   889
                  atp_proof
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   890
        fun prop_of_clause c =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   891
          fold (curry s_disj) (map_filter (Symtab.lookup props o fst) c)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   892
               @{term False}
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   893
        fun label_of_clause [name] = raw_label_for_name name
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   894
          | label_of_clause c = (space_implode "___" (map fst c), 0)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   895
        fun maybe_show outer c =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   896
          (outer andalso length c = 1 andalso subset (op =) (c, conjs))
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   897
          ? cons Show
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   898
        fun do_have outer qs (gamma, c) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   899
          Prove (maybe_show outer c qs, label_of_clause c, prop_of_clause c,
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   900
                 By_Metis (fold (add_fact_from_dependency fact_names
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   901
                                 o the_single) gamma ([], [])))
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   902
        fun do_inf outer (Have z) = do_have outer [] z
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   903
          | do_inf outer (Hence z) = do_have outer [Then] z
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   904
          | do_inf outer (Cases cases) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   905
            let val c = succedent_of_cases cases in
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   906
              Prove (maybe_show outer c [Ultimately], label_of_clause c,
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   907
                     prop_of_clause c,
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   908
                     Case_Split (map (do_case false) cases, ([], [])))
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   909
            end
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   910
        and do_case outer (c, infs) =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   911
          Assume (label_of_clause c, prop_of_clause c) ::
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   912
          map (do_inf outer) infs
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   913
        val isar_proof =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   914
          (if null params then [] else [Fix params]) @
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   915
          (ref_graph
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   916
           |> redirect_graph axioms tainted
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   917
           |> chain_direct_proof
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   918
           |> map (do_inf true)
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   919
           |> kill_duplicate_assumptions_in_proof
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   920
           |> kill_useless_labels_in_proof
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   921
           |> relabel_proof
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   922
           |> shrink_locally ctxt type_enc lam_trans
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   923
                (if isar_proofs then isar_shrinkage else 1000.0))
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   924
        val num_steps = length isar_proof
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   925
        val isar_text =
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   926
          string_for_proof ctxt type_enc lam_trans subgoal subgoal_count
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   927
                           isar_proof
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   928
      in
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   929
        case isar_text of
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   930
          "" =>
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   931
          if isar_proofs then
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   932
            "\nNo structured proof available (proof too short)."
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   933
          else
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   934
            ""
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   935
        | _ =>
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   936
          "\n\n" ^
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   937
          (if isar_proofs then
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   938
             "Structured proof" ^
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   939
             (if verbose then
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   940
                " (" ^ string_of_int num_steps ^ " step" ^ plural_s num_steps ^
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   941
                ")"
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   942
              else
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   943
                "")
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   944
           else
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   945
             "Perhaps this will work") ^
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   946
          ":\n" ^ Markup.markup Isabelle_Markup.sendback isar_text
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   947
      end
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   948
    val isar_proof =
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   949
      if debug then
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   950
        isar_proof_of ()
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   951
      else case try isar_proof_of () of
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   952
        SOME s => s
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   953
      | NONE => if isar_proofs then
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   954
                  "\nWarning: The Isar proof construction failed."
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   955
                else
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   956
                  ""
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   957
  in one_line_proof ^ isar_proof end
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   958
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   959
fun proof_text ctxt isar_proofs isar_params num_chained
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   960
               (one_line_params as (preplay, _, _, _, _, _)) =
49918
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   961
  (if case preplay of Failed_to_Play _ => true | _ => isar_proofs then
cf441f4a358b renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents: 49917
diff changeset
   962
     isar_proof_text ctxt isar_proofs isar_params
49883
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   963
   else
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   964
     one_line_proof_text num_chained) one_line_params
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   965
a6ebdaf8e267 added missing file
blanchet
parents:
diff changeset
   966
end;