src/HOL/Tools/ATP/atp_proof_reconstruct.ML
author blanchet
Sun, 12 Oct 2014 21:52:44 +0200
changeset 58652 da12763acd6b
parent 58601 85fa90262807
child 58653 4b44c227c0e0
permissions -rw-r--r--
made SML/NJ happier
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
46320
0b8b73b49848 renamed two files to make room for a new file
blanchet
parents: 45887
diff changeset
     1
(*  Title:      HOL/Tools/ATP/atp_proof_reconstruct.ML
38027
505657ddb047 standardize "Author" tags
blanchet
parents: 38019
diff changeset
     2
    Author:     Lawrence C. Paulson, Cambridge University Computer Laboratory
505657ddb047 standardize "Author" tags
blanchet
parents: 38019
diff changeset
     3
    Author:     Claire Quigley, Cambridge University Computer Laboratory
36392
c00c57850eb7 cosmetics: rename internal functions
blanchet
parents: 36369
diff changeset
     4
    Author:     Jasmin Blanchette, TU Muenchen
21978
72c21698a055 Contains old Tools/ATP/AtpCommunication.ML, plus proof reconstruction
paulson
parents:
diff changeset
     5
49914
23e36a4d28f1 refactor code
blanchet
parents: 49881
diff changeset
     6
Basic proof reconstruction from ATP proofs.
33310
44f9665c2091 proper header;
wenzelm
parents: 33243
diff changeset
     7
*)
44f9665c2091 proper header;
wenzelm
parents: 33243
diff changeset
     8
46320
0b8b73b49848 renamed two files to make room for a new file
blanchet
parents: 45887
diff changeset
     9
signature ATP_PROOF_RECONSTRUCT =
24425
ca97c6f3d9cd Returning both a "one-line" proof and a structured proof
paulson
parents: 24387
diff changeset
    10
sig
54811
df56a01f5684 parse SPASS-Pirate types
blanchet
parents: 54799
diff changeset
    11
  type 'a atp_type = 'a ATP_Problem.atp_type
53586
bd5fa6425993 prefixed types and some functions with "atp_" for disambiguation
blanchet
parents: 52758
diff changeset
    12
  type ('a, 'b) atp_term = ('a, 'b) ATP_Problem.atp_term
bd5fa6425993 prefixed types and some functions with "atp_" for disambiguation
blanchet
parents: 52758
diff changeset
    13
  type ('a, 'b, 'c, 'd) atp_formula = ('a, 'b, 'c, 'd) ATP_Problem.atp_formula
54500
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
    14
  type stature = ATP_Problem_Generate.stature
54772
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
    15
  type atp_step_name = ATP_Proof.atp_step_name
54499
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
    16
  type ('a, 'b) atp_step = ('a, 'b) ATP_Proof.atp_step
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
    17
  type 'a atp_proof = 'a ATP_Proof.atp_proof
45519
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    18
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    19
  val metisN : string
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    20
  val full_typesN : string
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    21
  val partial_typesN : string
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    22
  val no_typesN : string
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    23
  val really_full_type_enc : string
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    24
  val full_type_enc : string
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    25
  val partial_type_enc : string
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    26
  val no_type_enc : string
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    27
  val full_type_encs : string list
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    28
  val partial_type_encs : string list
54500
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
    29
  val default_metis_lam_trans : string
54772
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
    30
49983
33e18e9916a8 use metaquantification when possible in Isar proofs
blanchet
parents: 49914
diff changeset
    31
  val forall_of : term -> term -> term
33e18e9916a8 use metaquantification when possible in Isar proofs
blanchet
parents: 49914
diff changeset
    32
  val exists_of : term -> term -> term
57767
5bc204ca27ce centralized boolean simplification so that e.g. LEO-II benefits from it
blanchet
parents: 57765
diff changeset
    33
  val simplify_bool : term -> term
57792
9cb24c835284 rationalize Skolem names
blanchet
parents: 57790
diff changeset
    34
  val var_name_of_typ : typ -> string
57765
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
    35
  val rename_bound_vars : term -> term
55285
e88ad20035f4 merged 'reconstructors' and 'proof methods'
blanchet
parents: 55257
diff changeset
    36
  val type_enc_aliases : (string * string list) list
45519
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    37
  val unalias_type_enc : string -> string list
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
    38
  val term_of_atp : Proof.context -> ATP_Problem.atp_format -> ATP_Problem_Generate.type_enc ->
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
    39
    bool -> int Symtab.table -> typ option -> (string, string atp_type) atp_term -> term
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
    40
  val prop_of_atp : Proof.context -> ATP_Problem.atp_format -> ATP_Problem_Generate.type_enc ->
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
    41
    bool -> int Symtab.table ->
54811
df56a01f5684 parse SPASS-Pirate types
blanchet
parents: 54799
diff changeset
    42
    (string, string, (string, string atp_type) atp_term, string) atp_formula -> term
54499
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
    43
57263
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
    44
  val used_facts_in_atp_proof : Proof.context -> (string * stature) list -> string atp_proof ->
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
    45
    (string * stature) list
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
    46
  val used_facts_in_unsound_atp_proof : Proof.context -> (string * stature) list -> 'a atp_proof ->
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
    47
    string list option
55257
abfd7b90bba2 rationalized threading of 'metis' arguments
blanchet
parents: 55195
diff changeset
    48
  val atp_proof_prefers_lifting : string atp_proof -> bool
54500
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
    49
  val is_typed_helper_used_in_atp_proof : string atp_proof -> bool
54772
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
    50
  val replace_dependencies_in_line : atp_step_name * atp_step_name list -> ('a, 'b) atp_step ->
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
    51
    ('a, 'b) atp_step
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
    52
  val termify_atp_proof : Proof.context -> string -> ATP_Problem.atp_format ->
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
    53
    ATP_Problem_Generate.type_enc -> string Symtab.table -> (string * term) list ->
54499
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
    54
    int Symtab.table -> string atp_proof -> (term, string) atp_step list
57267
8b87114357bd integrated new Waldmeister code with 'sledgehammer' command
blanchet
parents: 57263
diff changeset
    55
  val repair_waldmeister_endgame : (term, 'a) atp_step list -> (term, 'a) atp_step list
57699
a6cf197c1f1e also try 'metis' with 'full_types'
blanchet
parents: 57697
diff changeset
    56
  val infer_formulas_types : Proof.context -> term list -> term list
57787
blanchet
parents: 57785
diff changeset
    57
  val introduce_spass_skolems : (term, string) atp_step list -> (term, string) atp_step list
57263
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
    58
  val factify_atp_proof : (string * 'a) list -> term list -> term -> (term, string) atp_step list ->
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
    59
    (term, string) atp_step list
24425
ca97c6f3d9cd Returning both a "one-line" proof and a structured proof
paulson
parents: 24387
diff changeset
    60
end;
21978
72c21698a055 Contains old Tools/ATP/AtpCommunication.ML, plus proof reconstruction
paulson
parents:
diff changeset
    61
46320
0b8b73b49848 renamed two files to make room for a new file
blanchet
parents: 45887
diff changeset
    62
structure ATP_Proof_Reconstruct : ATP_PROOF_RECONSTRUCT =
21978
72c21698a055 Contains old Tools/ATP/AtpCommunication.ML, plus proof reconstruction
paulson
parents:
diff changeset
    63
struct
72c21698a055 Contains old Tools/ATP/AtpCommunication.ML, plus proof reconstruction
paulson
parents:
diff changeset
    64
43085
0a2f5b86bdd7 first step in sharing more code between ATP and Metis translation
blanchet
parents: 43062
diff changeset
    65
open ATP_Util
38028
22dcaec5fa77 minor refactoring
blanchet
parents: 38027
diff changeset
    66
open ATP_Problem
39452
70a57e40f795 factored out TSTP/SPASS/Vampire proof parsing;
blanchet
parents: 39425
diff changeset
    67
open ATP_Proof
46320
0b8b73b49848 renamed two files to make room for a new file
blanchet
parents: 45887
diff changeset
    68
open ATP_Problem_Generate
21978
72c21698a055 Contains old Tools/ATP/AtpCommunication.ML, plus proof reconstruction
paulson
parents:
diff changeset
    69
45519
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    70
val metisN = "metis"
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    71
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    72
val full_typesN = "full_types"
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    73
val partial_typesN = "partial_types"
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    74
val no_typesN = "no_types"
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    75
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    76
val really_full_type_enc = "mono_tags"
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    77
val full_type_enc = "poly_guards_query"
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    78
val partial_type_enc = "poly_args"
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    79
val no_type_enc = "erased"
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    80
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    81
val full_type_encs = [full_type_enc, really_full_type_enc]
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    82
val partial_type_encs = partial_type_enc :: full_type_encs
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    83
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    84
val type_enc_aliases =
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    85
  [(full_typesN, full_type_encs),
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    86
   (partial_typesN, partial_type_encs),
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    87
   (no_typesN, [no_type_enc])]
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    88
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    89
fun unalias_type_enc s =
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    90
  AList.lookup (op =) type_enc_aliases s |> the_default [s]
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    91
54500
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
    92
val default_metis_lam_trans = combsN
45519
cd6e78cb6ee8 make metis reconstruction handling more flexible
blanchet
parents: 45511
diff changeset
    93
50670
eaa540986291 properly take the existential closure of skolems
blanchet
parents: 49983
diff changeset
    94
fun term_name' (Var ((s, _), _)) = perhaps (try Name.dest_skolem) s
52034
11b48e7a4e7e correctly 'repair' the monomorphization context for SMT solvers from Sledgehammer
blanchet
parents: 52031
diff changeset
    95
  | term_name' _ = ""
50670
eaa540986291 properly take the existential closure of skolems
blanchet
parents: 49983
diff changeset
    96
eaa540986291 properly take the existential closure of skolems
blanchet
parents: 49983
diff changeset
    97
fun lambda' v = Term.lambda_name (term_name' v, v)
eaa540986291 properly take the existential closure of skolems
blanchet
parents: 49983
diff changeset
    98
eaa540986291 properly take the existential closure of skolems
blanchet
parents: 49983
diff changeset
    99
fun forall_of v t = HOLogic.all_const (fastype_of v) $ lambda' v t
eaa540986291 properly take the existential closure of skolems
blanchet
parents: 49983
diff changeset
   100
fun exists_of v t = HOLogic.exists_const (fastype_of v) $ lambda' v t
39425
5d97fd83ab37 fix parsing of higher-order formulas;
blanchet
parents: 39374
diff changeset
   101
43135
8c32a0160b0d more uniform handling of tfree sort inference in ATP reconstruction code, based on what Metis always has done
blanchet
parents: 43131
diff changeset
   102
fun make_tfree ctxt w =
8c32a0160b0d more uniform handling of tfree sort inference in ATP reconstruction code, based on what Metis always has done
blanchet
parents: 43131
diff changeset
   103
  let val ww = "'" ^ w in
56254
a2dd9200854d more antiquotations;
wenzelm
parents: 56104
diff changeset
   104
    TFree (ww, the_default @{sort type} (Variable.def_sort ctxt (ww, ~1)))
43135
8c32a0160b0d more uniform handling of tfree sort inference in ATP reconstruction code, based on what Metis always has done
blanchet
parents: 43131
diff changeset
   105
  end
8c32a0160b0d more uniform handling of tfree sort inference in ATP reconstruction code, based on what Metis always has done
blanchet
parents: 43131
diff changeset
   106
57767
5bc204ca27ce centralized boolean simplification so that e.g. LEO-II benefits from it
blanchet
parents: 57765
diff changeset
   107
fun simplify_bool ((all as Const (@{const_name All}, _)) $ Abs (s, T, t)) =
5bc204ca27ce centralized boolean simplification so that e.g. LEO-II benefits from it
blanchet
parents: 57765
diff changeset
   108
    let val t' = simplify_bool t in
5bc204ca27ce centralized boolean simplification so that e.g. LEO-II benefits from it
blanchet
parents: 57765
diff changeset
   109
      if loose_bvar1 (t', 0) then all $ Abs (s, T, t') else t'
5bc204ca27ce centralized boolean simplification so that e.g. LEO-II benefits from it
blanchet
parents: 57765
diff changeset
   110
    end
57768
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   111
  | simplify_bool (Const (@{const_name Not}, _) $ t) = s_not (simplify_bool t)
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   112
  | simplify_bool (Const (@{const_name conj}, _) $ t $ u) =
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   113
    s_conj (simplify_bool t, simplify_bool u)
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   114
  | simplify_bool (Const (@{const_name disj}, _) $ t $ u) =
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   115
    s_disj (simplify_bool t, simplify_bool u)
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   116
  | simplify_bool (Const (@{const_name implies}, _) $ t $ u) =
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   117
    s_imp (simplify_bool t, simplify_bool u)
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   118
  | simplify_bool ((t as Const (@{const_name HOL.eq}, _)) $ u $ v) =
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   119
    (case (u, v) of
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   120
      (Const (@{const_name True}, _), _) => v
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   121
    | (u, Const (@{const_name True}, _)) => u
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   122
    | (Const (@{const_name False}, _), v) => s_not v
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   123
    | (u, Const (@{const_name False}, _)) => s_not u
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   124
    | _ => if u aconv v then @{const True} else t $ simplify_bool u $ simplify_bool v)
57767
5bc204ca27ce centralized boolean simplification so that e.g. LEO-II benefits from it
blanchet
parents: 57765
diff changeset
   125
  | simplify_bool (t $ u) = simplify_bool t $ simplify_bool u
5bc204ca27ce centralized boolean simplification so that e.g. LEO-II benefits from it
blanchet
parents: 57765
diff changeset
   126
  | simplify_bool (Abs (s, T, t)) = Abs (s, T, simplify_bool t)
5bc204ca27ce centralized boolean simplification so that e.g. LEO-II benefits from it
blanchet
parents: 57765
diff changeset
   127
  | simplify_bool t = t
5bc204ca27ce centralized boolean simplification so that e.g. LEO-II benefits from it
blanchet
parents: 57765
diff changeset
   128
57765
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
   129
fun single_letter upper s =
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
   130
  let val s' = if String.isPrefix "o" s orelse String.isPrefix "O" s then "z" else s in
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
   131
    String.extract (Name.desymbolize (SOME upper) (Long_Name.base_name s'), 0, SOME 1)
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
   132
  end
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
   133
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
   134
fun var_name_of_typ (Type (@{type_name fun}, [_, T])) =
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
   135
    if body_type T = HOLogic.boolT then "p" else "f"
58599
733b7a3277b2 slightly nicer names
blanchet
parents: 58597
diff changeset
   136
  | var_name_of_typ (Type (@{type_name set}, [T])) =
58600
c9e8ad426ab1 get rid of 'individual' type in DFG proofs
blanchet
parents: 58599
diff changeset
   137
    let fun default () = single_letter true (var_name_of_typ T) in
58599
733b7a3277b2 slightly nicer names
blanchet
parents: 58597
diff changeset
   138
      (case T of
733b7a3277b2 slightly nicer names
blanchet
parents: 58597
diff changeset
   139
        Type (s, [T1, T2]) => if String.isSuffix "prod" s andalso T1 = T2 then "r" else default ()
733b7a3277b2 slightly nicer names
blanchet
parents: 58597
diff changeset
   140
      | _ => default ())
733b7a3277b2 slightly nicer names
blanchet
parents: 58597
diff changeset
   141
    end
57765
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
   142
  | var_name_of_typ (Type (s, Ts)) =
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
   143
    if String.isSuffix "list" s then var_name_of_typ (the_single Ts) ^ "s"
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
   144
    else single_letter false (Long_Name.base_name s)
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
   145
  | var_name_of_typ (TFree (s, _)) = single_letter false (perhaps (try (unprefix "'")) s)
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
   146
  | var_name_of_typ (TVar ((s, _), T)) = var_name_of_typ (TFree (s, T))
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
   147
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
   148
fun rename_bound_vars (t $ u) = rename_bound_vars t $ rename_bound_vars u
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
   149
  | rename_bound_vars (Abs (_, T, t)) = Abs (var_name_of_typ T, T, rename_bound_vars t)
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
   150
  | rename_bound_vars t = t
f1108245ba11 better handling of variable names
blanchet
parents: 57717
diff changeset
   151
54820
d9ab86c044fd extended ATP types with sorts
blanchet
parents: 54819
diff changeset
   152
exception ATP_CLASS of string list
54818
a80bd631e573 honor SPASS-Pirate type arguments
blanchet
parents: 54811
diff changeset
   153
exception ATP_TYPE of string atp_type list
54811
df56a01f5684 parse SPASS-Pirate types
blanchet
parents: 54799
diff changeset
   154
exception ATP_TERM of (string, string atp_type) atp_term list
53586
bd5fa6425993 prefixed types and some functions with "atp_" for disambiguation
blanchet
parents: 52758
diff changeset
   155
exception ATP_FORMULA of
54811
df56a01f5684 parse SPASS-Pirate types
blanchet
parents: 54799
diff changeset
   156
  (string, string, (string, string atp_type) atp_term, string) atp_formula list
37991
3093ab32f1e7 proof reconstruction for full FOF terms
blanchet
parents: 37962
diff changeset
   157
exception SAME of unit
21978
72c21698a055 Contains old Tools/ATP/AtpCommunication.ML, plus proof reconstruction
paulson
parents:
diff changeset
   158
54820
d9ab86c044fd extended ATP types with sorts
blanchet
parents: 54819
diff changeset
   159
fun class_of_atp_class cls =
d9ab86c044fd extended ATP types with sorts
blanchet
parents: 54819
diff changeset
   160
  (case unprefix_and_unascii class_prefix cls of
d9ab86c044fd extended ATP types with sorts
blanchet
parents: 54819
diff changeset
   161
    SOME s => s
d9ab86c044fd extended ATP types with sorts
blanchet
parents: 54819
diff changeset
   162
  | NONE => raise ATP_CLASS [cls])
d9ab86c044fd extended ATP types with sorts
blanchet
parents: 54819
diff changeset
   163
57697
44341963ade3 correctly translate THF functions from terms to types
blanchet
parents: 57635
diff changeset
   164
fun atp_type_of_atp_term (ATerm ((s, _), us)) =
44341963ade3 correctly translate THF functions from terms to types
blanchet
parents: 57635
diff changeset
   165
  let val tys = map atp_type_of_atp_term us in
44341963ade3 correctly translate THF functions from terms to types
blanchet
parents: 57635
diff changeset
   166
    if s = tptp_fun_type then
44341963ade3 correctly translate THF functions from terms to types
blanchet
parents: 57635
diff changeset
   167
      (case tys of
44341963ade3 correctly translate THF functions from terms to types
blanchet
parents: 57635
diff changeset
   168
        [ty1, ty2] => AFun (ty1, ty2)
44341963ade3 correctly translate THF functions from terms to types
blanchet
parents: 57635
diff changeset
   169
      | _ => raise ATP_TYPE tys)
44341963ade3 correctly translate THF functions from terms to types
blanchet
parents: 57635
diff changeset
   170
    else
44341963ade3 correctly translate THF functions from terms to types
blanchet
parents: 57635
diff changeset
   171
      AType ((s, []), tys)
37991
3093ab32f1e7 proof reconstruction for full FOF terms
blanchet
parents: 37962
diff changeset
   172
  end
54818
a80bd631e573 honor SPASS-Pirate type arguments
blanchet
parents: 54811
diff changeset
   173
58475
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   174
(* Type variables are given the basic sort "HOL.type". Some will later be constrained by information
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   175
   from type literals, or by type inference. *)
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   176
fun typ_of_atp_type ctxt (ty as AType ((a, clss), tys)) =
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   177
    let val Ts = map (typ_of_atp_type ctxt) tys in
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   178
      (case unprefix_and_unascii native_type_prefix a of
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   179
        SOME b => typ_of_atp_type ctxt (atp_type_of_atp_term (unmangled_type b))
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   180
      | NONE =>
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   181
        (case unprefix_and_unascii type_const_prefix a of
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   182
          SOME b => Type (invert_const b, Ts)
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   183
        | NONE =>
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   184
          if not (null tys) then
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   185
            raise ATP_TYPE [ty] (* only "tconst"s have type arguments *)
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   186
          else
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   187
            (case unprefix_and_unascii tfree_prefix a of
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   188
              SOME b => make_tfree ctxt b
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   189
            | NONE =>
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   190
              (* The term could be an Isabelle variable or a variable from the ATP, say "X1" or "_5018".
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   191
                 Sometimes variables from the ATP are indistinguishable from Isabelle variables, which
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   192
                 forces us to use a type parameter in all cases. *)
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   193
              Type_Infer.param 0 ("'" ^ perhaps (unprefix_and_unascii tvar_prefix) a,
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   194
                (if null clss then @{sort type} else map class_of_atp_class clss)))))
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   195
    end
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   196
  | typ_of_atp_type ctxt (AFun (ty1, ty2)) = typ_of_atp_type ctxt ty1 --> typ_of_atp_type ctxt ty2
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   197
54818
a80bd631e573 honor SPASS-Pirate type arguments
blanchet
parents: 54811
diff changeset
   198
fun typ_of_atp_term ctxt = typ_of_atp_type ctxt o atp_type_of_atp_term
a80bd631e573 honor SPASS-Pirate type arguments
blanchet
parents: 54811
diff changeset
   199
54789
blanchet
parents: 54788
diff changeset
   200
(* Type class literal applied to a type. Returns triple of polarity, class, type. *)
52031
9a9238342963 tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents: 51878
diff changeset
   201
fun type_constraint_of_term ctxt (u as ATerm ((a, _), us)) =
54818
a80bd631e573 honor SPASS-Pirate type arguments
blanchet
parents: 54811
diff changeset
   202
  (case (unprefix_and_unascii class_prefix a, map (typ_of_atp_term ctxt) us) of
42606
0c76cf483899 show sorts not just types in Isar proofs + tuning
blanchet
parents: 42595
diff changeset
   203
    (SOME b, [T]) => (b, T)
54789
blanchet
parents: 54788
diff changeset
   204
  | _ => raise ATP_TERM [u])
38014
81c23d286f0c extract sort constraints from FOFs properly;
blanchet
parents: 38007
diff changeset
   205
43907
073ab5379842 pass type arguments to lambda-lifted Frees, to account for polymorphism
blanchet
parents: 43863
diff changeset
   206
(* Accumulate type constraints in a formula: negative type literals. *)
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   207
fun add_var (key, z) = Vartab.map_default (key, []) (cons z)
42606
0c76cf483899 show sorts not just types in Isar proofs + tuning
blanchet
parents: 42595
diff changeset
   208
fun add_type_constraint false (cl, TFree (a ,_)) = add_var ((a, ~1), cl)
0c76cf483899 show sorts not just types in Isar proofs + tuning
blanchet
parents: 42595
diff changeset
   209
  | add_type_constraint false (cl, TVar (ix, _)) = add_var (ix, cl)
0c76cf483899 show sorts not just types in Isar proofs + tuning
blanchet
parents: 42595
diff changeset
   210
  | add_type_constraint _ _ = I
38014
81c23d286f0c extract sort constraints from FOFs properly;
blanchet
parents: 38007
diff changeset
   211
57789
a73255cffb5b don't rename variables which will be renamed later anyway
blanchet
parents: 57788
diff changeset
   212
fun repair_var_name s =
55185
a0bd8d6414e6 centralized & repaired handling of bound variables in intermediate data structure (viva de Bruijn)
blanchet
parents: 54822
diff changeset
   213
  (case unprefix_and_unascii schematic_var_prefix s of
57789
a73255cffb5b don't rename variables which will be renamed later anyway
blanchet
parents: 57788
diff changeset
   214
    SOME s' => s'
a73255cffb5b don't rename variables which will be renamed later anyway
blanchet
parents: 57788
diff changeset
   215
  | NONE => s)
55185
a0bd8d6414e6 centralized & repaired handling of bound variables in intermediate data structure (viva de Bruijn)
blanchet
parents: 54822
diff changeset
   216
54789
blanchet
parents: 54788
diff changeset
   217
(* The number of type arguments of a constant, zero if it's monomorphic. For (instances of) Skolem
blanchet
parents: 54788
diff changeset
   218
   pseudoconstants, this information is encoded in the constant name. *)
52125
ac7830871177 improved handling of free variables' types in Isar proofs
blanchet
parents: 52034
diff changeset
   219
fun robust_const_num_type_args thy s =
43907
073ab5379842 pass type arguments to lambda-lifted Frees, to account for polymorphism
blanchet
parents: 43863
diff changeset
   220
  if String.isPrefix skolem_const_prefix s then
46711
f745bcc4a1e5 more explicit Long_Name operations (NB: analyzing qualifiers is inherently fragile);
wenzelm
parents: 46435
diff changeset
   221
    s |> Long_Name.explode |> List.last |> Int.fromString |> the
45554
09ad83de849c don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents: 45553
diff changeset
   222
  else if String.isPrefix lam_lifted_prefix s then
09ad83de849c don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents: 45553
diff changeset
   223
    if String.isPrefix lam_lifted_poly_prefix s then 2 else 0
43907
073ab5379842 pass type arguments to lambda-lifted Frees, to account for polymorphism
blanchet
parents: 43863
diff changeset
   224
  else
073ab5379842 pass type arguments to lambda-lifted Frees, to account for polymorphism
blanchet
parents: 43863
diff changeset
   225
    (s, Sign.the_const_type thy s) |> Sign.const_typargs thy |> length
073ab5379842 pass type arguments to lambda-lifted Frees, to account for polymorphism
blanchet
parents: 43863
diff changeset
   226
56254
a2dd9200854d more antiquotations;
wenzelm
parents: 56104
diff changeset
   227
fun slack_fastype_of t = fastype_of t handle TERM _ => Type_Infer.anyT @{sort type}
43182
649bada59658 slacker version of "fastype_of", in case a function has dummy type
blanchet
parents: 43176
diff changeset
   228
54772
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
   229
val spass_skolem_prefix = "sk" (* "skc" or "skf" *)
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
   230
val vampire_skolem_prefix = "sK"
50703
76a2e506c125 swap Vampire's Skolem arguments to bring them in line with what E and metis's new skolemizer do (helps Isar proof reconstruction in some cases)
blanchet
parents: 50693
diff changeset
   231
57257
0d5e34ba4d28 Correcting the type parser
fleury
parents: 57256
diff changeset
   232
fun var_index_of_textual textual = if textual then 0 else 1
0d5e34ba4d28 Correcting the type parser
fleury
parents: 57256
diff changeset
   233
0d5e34ba4d28 Correcting the type parser
fleury
parents: 57256
diff changeset
   234
fun quantify_over_var textual quant_of var_s var_T t =
0d5e34ba4d28 Correcting the type parser
fleury
parents: 57256
diff changeset
   235
  let
57790
a04e8a39ca9a tuned code
blanchet
parents: 57789
diff changeset
   236
    val vars =
a04e8a39ca9a tuned code
blanchet
parents: 57789
diff changeset
   237
      ((var_s, var_index_of_textual textual), var_T) ::
a04e8a39ca9a tuned code
blanchet
parents: 57789
diff changeset
   238
      filter (fn ((s, _), _) => s = var_s) (Term.add_vars t [])
57257
0d5e34ba4d28 Correcting the type parser
fleury
parents: 57256
diff changeset
   239
    val normTs = vars |> AList.group (op =) |> map (apsnd hd)
0d5e34ba4d28 Correcting the type parser
fleury
parents: 57256
diff changeset
   240
    fun norm_var_types (Var (x, T)) =
0d5e34ba4d28 Correcting the type parser
fleury
parents: 57256
diff changeset
   241
        Var (x, the_default T (AList.lookup (op =) normTs x))
0d5e34ba4d28 Correcting the type parser
fleury
parents: 57256
diff changeset
   242
      | norm_var_types t = t
0d5e34ba4d28 Correcting the type parser
fleury
parents: 57256
diff changeset
   243
  in t |> map_aterms norm_var_types |> fold_rev quant_of (map Var normTs) end
0d5e34ba4d28 Correcting the type parser
fleury
parents: 57256
diff changeset
   244
57790
a04e8a39ca9a tuned code
blanchet
parents: 57789
diff changeset
   245
(* This assumes that distinct names are mapped to distinct names by "Variable.variant_frees". This
a04e8a39ca9a tuned code
blanchet
parents: 57789
diff changeset
   246
   does not hold in general but should hold for ATP-generated Skolem function names, since these end
a04e8a39ca9a tuned code
blanchet
parents: 57789
diff changeset
   247
   with a digit and "variant_frees" appends letters. *)
a04e8a39ca9a tuned code
blanchet
parents: 57789
diff changeset
   248
fun fresh_up ctxt s = fst (hd (Variable.variant_frees ctxt [] [(s, ())]))
a04e8a39ca9a tuned code
blanchet
parents: 57789
diff changeset
   249
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   250
(* Higher-order translation. Variables are typed (although we don't use that information). Lambdas
57768
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   251
   are typed. The code is similar to "term_of_atp_fo". *)
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   252
fun term_of_atp_ho ctxt sym_tab =
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   253
  let
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   254
    val thy = Proof_Context.theory_of ctxt
57768
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   255
    val var_index = var_index_of_textual true
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   256
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   257
    fun do_term opt_T u =
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   258
      (case u of
57788
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   259
        AAbs (((var, ty), term), []) =>
57257
0d5e34ba4d28 Correcting the type parser
fleury
parents: 57256
diff changeset
   260
        let
0d5e34ba4d28 Correcting the type parser
fleury
parents: 57256
diff changeset
   261
          val typ = typ_of_atp_type ctxt ty
57789
a73255cffb5b don't rename variables which will be renamed later anyway
blanchet
parents: 57788
diff changeset
   262
          val var_name = repair_var_name var
57257
0d5e34ba4d28 Correcting the type parser
fleury
parents: 57256
diff changeset
   263
          val tm = do_term NONE term
57768
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   264
        in quantify_over_var true lambda' var_name typ tm end
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   265
      | ATerm ((s, tys), us) =>
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   266
        if s = ""
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   267
        then error "Isar proof reconstruction failed because the ATP proof \
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   268
                     \contains unparsable material."
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   269
        else if s = tptp_equal then
57768
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   270
          list_comb (Const (@{const_name HOL.eq}, Type_Infer.anyT @{sort type}),
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   271
            map (do_term NONE) us)
57256
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   272
        else if not (null us) then
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   273
          let
57820
wenzelm
parents: 57792
diff changeset
   274
            val args = map (do_term NONE) us
57256
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   275
            val opt_T' = SOME (map slack_fastype_of args ---> the_default dummyT opt_T)
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   276
            val func = do_term opt_T' (ATerm ((s, tys), []))
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   277
          in foldl1 (op $) (func :: args) end
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   278
        else if s = tptp_or then HOLogic.disj
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   279
        else if s = tptp_and then HOLogic.conj
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   280
        else if s = tptp_implies then HOLogic.imp
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   281
        else if s = tptp_iff orelse s = tptp_equal then HOLogic.eq_const dummyT
57768
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   282
        else if s = tptp_not_iff orelse s = tptp_not_equal then @{term "%P Q. Q ~= P"}
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   283
        else if s = tptp_if then @{term "%P Q. Q --> P"}
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   284
        else if s = tptp_not_and then @{term "%P Q. ~ (P & Q)"}
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   285
        else if s = tptp_not_or then @{term "%P Q. ~ (P | Q)"}
57256
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   286
        else if s = tptp_not then HOLogic.Not
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   287
        else if s = tptp_ho_forall then HOLogic.all_const dummyT
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   288
        else if s = tptp_ho_exists then HOLogic.exists_const dummyT
57709
9cda0c64c37a imported patch hilbert_choice_support
fleury
parents: 57707
diff changeset
   289
        else if s = tptp_hilbert_choice then HOLogic.choice_const dummyT
9cda0c64c37a imported patch hilbert_choice_support
fleury
parents: 57707
diff changeset
   290
        else if s = tptp_hilbert_the then @{term "The"}
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   291
        else
57256
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   292
          (case unprefix_and_unascii const_prefix s of
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   293
            SOME s' =>
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   294
            let
57547
677b07d777c3 don't generate TPTP THF 'Definition's, because they complicate reconstruction for AgsyHOL and Satallax
blanchet
parents: 57267
diff changeset
   295
              val ((s', _), mangled_us) = s' |> unmangled_const |>> `invert_const
57256
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   296
              val num_ty_args = length us - the_default 0 (Symtab.lookup sym_tab s)
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   297
              val (type_us, term_us) = chop num_ty_args us |>> append mangled_us
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   298
              val term_ts = map (do_term NONE) term_us
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   299
              val Ts = map (typ_of_atp_type ctxt) tys @ map (typ_of_atp_term ctxt) type_us
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   300
              val T =
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   301
                (if not (null Ts) andalso robust_const_num_type_args thy s' = length Ts then
57768
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   302
                   try (Sign.const_instance thy) (s', Ts)
57256
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   303
                 else
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   304
                   NONE)
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   305
                |> (fn SOME T => T
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   306
                     | NONE =>
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   307
                       map slack_fastype_of term_ts --->
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   308
                       the_default (Type_Infer.anyT @{sort type}) opt_T)
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   309
              val t = Const (unproxify_const s', T)
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   310
            in list_comb (t, term_ts) end
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   311
          | NONE => (* a free or schematic variable *)
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   312
            let
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   313
              val ts = map (do_term NONE) us
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   314
              val T =
58500
430306aa03b1 proper types for applied variables, for typed formats (TFF0, DFG)
blanchet
parents: 58484
diff changeset
   315
                (case tys of
430306aa03b1 proper types for applied variables, for typed formats (TFF0, DFG)
blanchet
parents: 58484
diff changeset
   316
                  [ty] => typ_of_atp_type ctxt ty
430306aa03b1 proper types for applied variables, for typed formats (TFF0, DFG)
blanchet
parents: 58484
diff changeset
   317
                | _ =>
57256
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   318
                  map slack_fastype_of ts --->
58500
430306aa03b1 proper types for applied variables, for typed formats (TFF0, DFG)
blanchet
parents: 58484
diff changeset
   319
                  (case opt_T of
430306aa03b1 proper types for applied variables, for typed formats (TFF0, DFG)
blanchet
parents: 58484
diff changeset
   320
                    SOME T => T
430306aa03b1 proper types for applied variables, for typed formats (TFF0, DFG)
blanchet
parents: 58484
diff changeset
   321
                  | NONE => Type_Infer.anyT @{sort type}))
57256
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   322
              val t =
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   323
                (case unprefix_and_unascii fixed_var_prefix s of
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   324
                  SOME s => Free (s, T)
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   325
                | NONE =>
57790
a04e8a39ca9a tuned code
blanchet
parents: 57789
diff changeset
   326
                  if not (is_tptp_variable s) then Free (fresh_up ctxt s, T)
57789
a73255cffb5b don't rename variables which will be renamed later anyway
blanchet
parents: 57788
diff changeset
   327
                  else Var ((repair_var_name s, var_index), T))
57256
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   328
            in list_comb (t, ts) end))
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   329
  in do_term end
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   330
56254
a2dd9200854d more antiquotations;
wenzelm
parents: 56104
diff changeset
   331
(* First-order translation. No types are known for variables. "Type_Infer.anyT @{sort type}"
a2dd9200854d more antiquotations;
wenzelm
parents: 56104
diff changeset
   332
   should allow them to be inferred. *)
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   333
fun term_of_atp_fo ctxt textual sym_tab =
36909
7d5587f6d5f7 made Sledgehammer's full-typed proof reconstruction work for the first time;
blanchet
parents: 36607
diff changeset
   334
  let
43135
8c32a0160b0d more uniform handling of tfree sort inference in ATP reconstruction code, based on what Metis always has done
blanchet
parents: 43131
diff changeset
   335
    val thy = Proof_Context.theory_of ctxt
54789
blanchet
parents: 54788
diff changeset
   336
    (* For Metis, we use 1 rather than 0 because variable references in clauses may otherwise
blanchet
parents: 54788
diff changeset
   337
       conflict with variable constraints in the goal. At least, type inference often fails
blanchet
parents: 54788
diff changeset
   338
       otherwise. See also "axiom_inference" in "Metis_Reconstruct". *)
57257
0d5e34ba4d28 Correcting the type parser
fleury
parents: 57256
diff changeset
   339
    val var_index = var_index_of_textual textual
57199
blanchet
parents: 56854
diff changeset
   340
43131
9e9420122f91 fixed interaction between type tags and hAPP in reconstruction code
blanchet
parents: 43130
diff changeset
   341
    fun do_term extra_ts opt_T u =
54789
blanchet
parents: 54788
diff changeset
   342
      (case u of
54818
a80bd631e573 honor SPASS-Pirate type arguments
blanchet
parents: 54811
diff changeset
   343
        ATerm ((s, tys), us) =>
57199
blanchet
parents: 56854
diff changeset
   344
        if s = "" then
blanchet
parents: 56854
diff changeset
   345
          error "Isar proof reconstruction failed because the ATP proof contains unparsable \
blanchet
parents: 56854
diff changeset
   346
            \material."
51878
f11039b31bae handle dummy atp terms
smolkas
parents: 51192
diff changeset
   347
        else if String.isPrefix native_type_prefix s then
58475
8438bae06e63 parse back type of SPASS proof variables
blanchet
parents: 58091
diff changeset
   348
          @{const True} (* ignore TPTP type information (needed?) *)
44773
e701dabbfe37 perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents: 44399
diff changeset
   349
        else if s = tptp_equal then
57768
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   350
          list_comb (Const (@{const_name HOL.eq}, Type_Infer.anyT @{sort type}),
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   351
            map (do_term [] NONE) us)
54789
blanchet
parents: 54788
diff changeset
   352
        else
blanchet
parents: 54788
diff changeset
   353
          (case unprefix_and_unascii const_prefix s of
blanchet
parents: 54788
diff changeset
   354
            SOME s' =>
54818
a80bd631e573 honor SPASS-Pirate type arguments
blanchet
parents: 54811
diff changeset
   355
            let val ((s', s''), mangled_us) = s' |> unmangled_const |>> `invert_const in
54789
blanchet
parents: 54788
diff changeset
   356
              if s' = type_tag_name then
blanchet
parents: 54788
diff changeset
   357
                (case mangled_us @ us of
54818
a80bd631e573 honor SPASS-Pirate type arguments
blanchet
parents: 54811
diff changeset
   358
                  [typ_u, term_u] => do_term extra_ts (SOME (typ_of_atp_term ctxt typ_u)) term_u
54789
blanchet
parents: 54788
diff changeset
   359
                | _ => raise ATP_TERM us)
blanchet
parents: 54788
diff changeset
   360
              else if s' = predicator_name then
blanchet
parents: 54788
diff changeset
   361
                do_term [] (SOME @{typ bool}) (hd us)
blanchet
parents: 54788
diff changeset
   362
              else if s' = app_op_name then
blanchet
parents: 54788
diff changeset
   363
                let val extra_t = do_term [] NONE (List.last us) in
blanchet
parents: 54788
diff changeset
   364
                  do_term (extra_t :: extra_ts)
57199
blanchet
parents: 56854
diff changeset
   365
                    (case opt_T of SOME T => SOME (slack_fastype_of extra_t --> T) | NONE => NONE)
blanchet
parents: 56854
diff changeset
   366
                    (nth us (length us - 2))
54789
blanchet
parents: 54788
diff changeset
   367
                end
blanchet
parents: 54788
diff changeset
   368
              else if s' = type_guard_name then
blanchet
parents: 54788
diff changeset
   369
                @{const True} (* ignore type predicates *)
blanchet
parents: 54788
diff changeset
   370
              else
blanchet
parents: 54788
diff changeset
   371
                let
blanchet
parents: 54788
diff changeset
   372
                  val new_skolem = String.isPrefix new_skolem_const_prefix s''
54818
a80bd631e573 honor SPASS-Pirate type arguments
blanchet
parents: 54811
diff changeset
   373
                  val num_ty_args = length us - the_default 0 (Symtab.lookup sym_tab s)
a80bd631e573 honor SPASS-Pirate type arguments
blanchet
parents: 54811
diff changeset
   374
                  val (type_us, term_us) = chop num_ty_args us |>> append mangled_us
54789
blanchet
parents: 54788
diff changeset
   375
                  val term_ts = map (do_term [] NONE) term_us
54818
a80bd631e573 honor SPASS-Pirate type arguments
blanchet
parents: 54811
diff changeset
   376
a80bd631e573 honor SPASS-Pirate type arguments
blanchet
parents: 54811
diff changeset
   377
                  val Ts = map (typ_of_atp_type ctxt) tys @ map (typ_of_atp_term ctxt) type_us
54789
blanchet
parents: 54788
diff changeset
   378
                  val T =
54818
a80bd631e573 honor SPASS-Pirate type arguments
blanchet
parents: 54811
diff changeset
   379
                    (if not (null Ts) andalso robust_const_num_type_args thy s' = length Ts then
57199
blanchet
parents: 56854
diff changeset
   380
                       if new_skolem then SOME (Type_Infer.paramify_vars (tl Ts ---> hd Ts))
blanchet
parents: 56854
diff changeset
   381
                       else if textual then try (Sign.const_instance thy) (s', Ts)
blanchet
parents: 56854
diff changeset
   382
                       else NONE
54789
blanchet
parents: 54788
diff changeset
   383
                     else
blanchet
parents: 54788
diff changeset
   384
                       NONE)
blanchet
parents: 54788
diff changeset
   385
                    |> (fn SOME T => T
blanchet
parents: 54788
diff changeset
   386
                         | NONE =>
56254
a2dd9200854d more antiquotations;
wenzelm
parents: 56104
diff changeset
   387
                           map slack_fastype_of term_ts --->
57199
blanchet
parents: 56854
diff changeset
   388
                           the_default (Type_Infer.anyT @{sort type}) opt_T)
54789
blanchet
parents: 54788
diff changeset
   389
                  val t =
blanchet
parents: 54788
diff changeset
   390
                    if new_skolem then Var ((new_skolem_var_name_of_const s'', var_index), T)
blanchet
parents: 54788
diff changeset
   391
                    else Const (unproxify_const s', T)
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   392
                in
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   393
                  list_comb (t, term_ts @ extra_ts)
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   394
                end
54789
blanchet
parents: 54788
diff changeset
   395
            end
blanchet
parents: 54788
diff changeset
   396
          | NONE => (* a free or schematic variable *)
blanchet
parents: 54788
diff changeset
   397
            let
blanchet
parents: 54788
diff changeset
   398
              val term_ts =
blanchet
parents: 54788
diff changeset
   399
                map (do_term [] NONE) us
blanchet
parents: 54788
diff changeset
   400
                (* SPASS (3.8ds) and Vampire (2.6) pass arguments to Skolem functions in reverse
57699
a6cf197c1f1e also try 'metis' with 'full_types'
blanchet
parents: 57697
diff changeset
   401
                   order, which is incompatible with "metis"'s new skolemizer. *)
54789
blanchet
parents: 54788
diff changeset
   402
                |> exists (fn pre => String.isPrefix pre s)
blanchet
parents: 54788
diff changeset
   403
                  [spass_skolem_prefix, vampire_skolem_prefix] ? rev
blanchet
parents: 54788
diff changeset
   404
              val ts = term_ts @ extra_ts
blanchet
parents: 54788
diff changeset
   405
              val T =
58500
430306aa03b1 proper types for applied variables, for typed formats (TFF0, DFG)
blanchet
parents: 58484
diff changeset
   406
                (case tys of
430306aa03b1 proper types for applied variables, for typed formats (TFF0, DFG)
blanchet
parents: 58484
diff changeset
   407
                  [ty] => typ_of_atp_type ctxt ty
430306aa03b1 proper types for applied variables, for typed formats (TFF0, DFG)
blanchet
parents: 58484
diff changeset
   408
                | _ =>
430306aa03b1 proper types for applied variables, for typed formats (TFF0, DFG)
blanchet
parents: 58484
diff changeset
   409
                  (case opt_T of
430306aa03b1 proper types for applied variables, for typed formats (TFF0, DFG)
blanchet
parents: 58484
diff changeset
   410
                    SOME T => map slack_fastype_of term_ts ---> T
430306aa03b1 proper types for applied variables, for typed formats (TFF0, DFG)
blanchet
parents: 58484
diff changeset
   411
                  | NONE => map slack_fastype_of ts ---> Type_Infer.anyT @{sort type}))
54789
blanchet
parents: 54788
diff changeset
   412
              val t =
blanchet
parents: 54788
diff changeset
   413
                (case unprefix_and_unascii fixed_var_prefix s of
blanchet
parents: 54788
diff changeset
   414
                  SOME s => Free (s, T)
36909
7d5587f6d5f7 made Sledgehammer's full-typed proof reconstruction work for the first time;
blanchet
parents: 36607
diff changeset
   415
                | NONE =>
55185
a0bd8d6414e6 centralized & repaired handling of bound variables in intermediate data structure (viva de Bruijn)
blanchet
parents: 54822
diff changeset
   416
                  if textual andalso not (is_tptp_variable s) then
57790
a04e8a39ca9a tuned code
blanchet
parents: 57789
diff changeset
   417
                    Free (s |> textual ? fresh_up ctxt, T)
55185
a0bd8d6414e6 centralized & repaired handling of bound variables in intermediate data structure (viva de Bruijn)
blanchet
parents: 54822
diff changeset
   418
                  else
57789
a73255cffb5b don't rename variables which will be renamed later anyway
blanchet
parents: 57788
diff changeset
   419
                    Var ((repair_var_name s, var_index), T))
54789
blanchet
parents: 54788
diff changeset
   420
            in list_comb (t, ts) end))
43093
blanchet
parents: 43085
diff changeset
   421
  in do_term [] end
21978
72c21698a055 Contains old Tools/ATP/AtpCommunication.ML, plus proof reconstruction
paulson
parents:
diff changeset
   422
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   423
fun term_of_atp ctxt (ATP_Problem.THF _) type_enc =
57768
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   424
    if ATP_Problem_Generate.is_type_enc_higher_order type_enc then K (term_of_atp_ho ctxt)
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   425
    else error "Unsupported Isar reconstruction."
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   426
  | term_of_atp ctxt _ type_enc =
57768
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   427
    if not (ATP_Problem_Generate.is_type_enc_higher_order type_enc) then term_of_atp_fo ctxt
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   428
    else error "Unsupported Isar reconstruction."
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   429
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   430
fun term_of_atom ctxt format type_enc textual sym_tab pos (u as ATerm ((s, _), _)) =
38014
81c23d286f0c extract sort constraints from FOFs properly;
blanchet
parents: 38007
diff changeset
   431
  if String.isPrefix class_prefix s then
52031
9a9238342963 tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents: 51878
diff changeset
   432
    add_type_constraint pos (type_constraint_of_term ctxt u)
38014
81c23d286f0c extract sort constraints from FOFs properly;
blanchet
parents: 38007
diff changeset
   433
    #> pair @{const True}
81c23d286f0c extract sort constraints from FOFs properly;
blanchet
parents: 38007
diff changeset
   434
  else
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   435
    pair (term_of_atp ctxt format type_enc textual sym_tab (SOME @{typ bool}) u)
36402
1b20805974c7 introduced direct proof reconstruction code, eliminating the need for the "neg_clausify" method;
blanchet
parents: 36396
diff changeset
   436
37991
3093ab32f1e7 proof reconstruction for full FOF terms
blanchet
parents: 37962
diff changeset
   437
(* Update schematic type variables with detected sort constraints. It's not
42563
e70ffe3846d0 improve helper type instantiation code
blanchet
parents: 42562
diff changeset
   438
   totally clear whether this code is necessary. *)
38014
81c23d286f0c extract sort constraints from FOFs properly;
blanchet
parents: 38007
diff changeset
   439
fun repair_tvar_sorts (t, tvar_tab) =
36909
7d5587f6d5f7 made Sledgehammer's full-typed proof reconstruction work for the first time;
blanchet
parents: 36607
diff changeset
   440
  let
37991
3093ab32f1e7 proof reconstruction for full FOF terms
blanchet
parents: 37962
diff changeset
   441
    fun do_type (Type (a, Ts)) = Type (a, map do_type Ts)
3093ab32f1e7 proof reconstruction for full FOF terms
blanchet
parents: 37962
diff changeset
   442
      | do_type (TVar (xi, s)) =
3093ab32f1e7 proof reconstruction for full FOF terms
blanchet
parents: 37962
diff changeset
   443
        TVar (xi, the_default s (Vartab.lookup tvar_tab xi))
3093ab32f1e7 proof reconstruction for full FOF terms
blanchet
parents: 37962
diff changeset
   444
      | do_type (TFree z) = TFree z
3093ab32f1e7 proof reconstruction for full FOF terms
blanchet
parents: 37962
diff changeset
   445
    fun do_term (Const (a, T)) = Const (a, do_type T)
3093ab32f1e7 proof reconstruction for full FOF terms
blanchet
parents: 37962
diff changeset
   446
      | do_term (Free (a, T)) = Free (a, do_type T)
3093ab32f1e7 proof reconstruction for full FOF terms
blanchet
parents: 37962
diff changeset
   447
      | do_term (Var (xi, T)) = Var (xi, do_type T)
3093ab32f1e7 proof reconstruction for full FOF terms
blanchet
parents: 37962
diff changeset
   448
      | do_term (t as Bound _) = t
3093ab32f1e7 proof reconstruction for full FOF terms
blanchet
parents: 37962
diff changeset
   449
      | do_term (Abs (a, T, t)) = Abs (a, do_type T, do_term t)
3093ab32f1e7 proof reconstruction for full FOF terms
blanchet
parents: 37962
diff changeset
   450
      | do_term (t1 $ t2) = do_term t1 $ do_term t2
3093ab32f1e7 proof reconstruction for full FOF terms
blanchet
parents: 37962
diff changeset
   451
  in t |> not (Vartab.is_empty tvar_tab) ? do_term end
3093ab32f1e7 proof reconstruction for full FOF terms
blanchet
parents: 37962
diff changeset
   452
54811
df56a01f5684 parse SPASS-Pirate types
blanchet
parents: 54799
diff changeset
   453
(* Interpret an ATP formula as a HOL term, extracting sort constraints as they appear in the
df56a01f5684 parse SPASS-Pirate types
blanchet
parents: 54799
diff changeset
   454
   formula. *)
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   455
fun prop_of_atp ctxt format type_enc textual sym_tab phi =
38014
81c23d286f0c extract sort constraints from FOFs properly;
blanchet
parents: 38007
diff changeset
   456
  let
81c23d286f0c extract sort constraints from FOFs properly;
blanchet
parents: 38007
diff changeset
   457
    fun do_formula pos phi =
54789
blanchet
parents: 54788
diff changeset
   458
      (case phi of
38014
81c23d286f0c extract sort constraints from FOFs properly;
blanchet
parents: 38007
diff changeset
   459
        AQuant (_, [], phi) => do_formula pos phi
42526
46d485f8d144 added room for types in ATP quantifiers
blanchet
parents: 42451
diff changeset
   460
      | AQuant (q, (s, _) :: xs, phi') =>
38014
81c23d286f0c extract sort constraints from FOFs properly;
blanchet
parents: 38007
diff changeset
   461
        do_formula pos (AQuant (q, xs, phi'))
42526
46d485f8d144 added room for types in ATP quantifiers
blanchet
parents: 42451
diff changeset
   462
        (* FIXME: TFF *)
57257
0d5e34ba4d28 Correcting the type parser
fleury
parents: 57256
diff changeset
   463
        #>> quantify_over_var textual (case q of AForall => forall_of | AExists => exists_of)
57789
a73255cffb5b don't rename variables which will be renamed later anyway
blanchet
parents: 57788
diff changeset
   464
          (repair_var_name s) dummyT
38014
81c23d286f0c extract sort constraints from FOFs properly;
blanchet
parents: 38007
diff changeset
   465
      | AConn (ANot, [phi']) => do_formula (not pos) phi' #>> s_not
37991
3093ab32f1e7 proof reconstruction for full FOF terms
blanchet
parents: 37962
diff changeset
   466
      | AConn (c, [phi1, phi2]) =>
38014
81c23d286f0c extract sort constraints from FOFs properly;
blanchet
parents: 38007
diff changeset
   467
        do_formula (pos |> c = AImplies ? not) phi1
81c23d286f0c extract sort constraints from FOFs properly;
blanchet
parents: 38007
diff changeset
   468
        ##>> do_formula pos phi2
81c23d286f0c extract sort constraints from FOFs properly;
blanchet
parents: 38007
diff changeset
   469
        #>> (case c of
54811
df56a01f5684 parse SPASS-Pirate types
blanchet
parents: 54799
diff changeset
   470
              AAnd => s_conj
df56a01f5684 parse SPASS-Pirate types
blanchet
parents: 54799
diff changeset
   471
            | AOr => s_disj
df56a01f5684 parse SPASS-Pirate types
blanchet
parents: 54799
diff changeset
   472
            | AImplies => s_imp
df56a01f5684 parse SPASS-Pirate types
blanchet
parents: 54799
diff changeset
   473
            | AIff => s_iff
df56a01f5684 parse SPASS-Pirate types
blanchet
parents: 54799
diff changeset
   474
            | ANot => raise Fail "impossible connective")
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   475
      | AAtom tm => term_of_atom ctxt format type_enc textual sym_tab pos tm
54789
blanchet
parents: 54788
diff changeset
   476
      | _ => raise ATP_FORMULA [phi])
blanchet
parents: 54788
diff changeset
   477
  in
blanchet
parents: 54788
diff changeset
   478
    repair_tvar_sorts (do_formula true phi Vartab.empty)
blanchet
parents: 54788
diff changeset
   479
  end
37991
3093ab32f1e7 proof reconstruction for full FOF terms
blanchet
parents: 37962
diff changeset
   480
54500
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   481
val unprefix_fact_number = space_implode "_" o tl o space_explode "_"
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   482
57263
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
   483
fun resolve_fact facts s =
54789
blanchet
parents: 54788
diff changeset
   484
  (case try (unprefix fact_prefix) s of
54500
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   485
    SOME s' =>
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   486
    let val s' = s' |> unprefix_fact_number |> unascii_of in
57263
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
   487
      AList.lookup (op =) facts s' |> Option.map (pair s')
54500
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   488
    end
54789
blanchet
parents: 54788
diff changeset
   489
  | NONE => NONE)
54506
blanchet
parents: 54505
diff changeset
   490
57263
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
   491
fun resolve_conjecture s =
54789
blanchet
parents: 54788
diff changeset
   492
  (case try (unprefix conjecture_prefix) s of
54500
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   493
    SOME s' => Int.fromString s'
54789
blanchet
parents: 54788
diff changeset
   494
  | NONE => NONE)
54500
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   495
57263
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
   496
fun resolve_facts facts = map_filter (resolve_fact facts)
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
   497
val resolve_conjectures = map_filter resolve_conjecture
54500
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   498
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   499
fun is_axiom_used_in_proof pred =
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   500
  exists (fn ((_, ss), _, _, _, []) => exists pred ss | _ => false)
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   501
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   502
val leo2_extcnf_equal_neg_rule = "extcnf_equal_neg"
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   503
57263
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
   504
fun add_fact ctxt facts ((_, ss), _, _, rule, deps) =
57707
0242e9578828 imported patch satallax_proof_support_Sledgehammer
fleury
parents: 57703
diff changeset
   505
  (if member (op =) [agsyhol_core_rule, leo2_extcnf_equal_neg_rule] rule then
56104
fd6e132ee4fb correctly reconstruct helper facts (e.g. 'nat_int') in Isar proofs
blanchet
parents: 55285
diff changeset
   506
     insert (op =) (short_thm_name ctxt ext, (Global, General))
54500
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   507
   else
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   508
     I)
57263
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
   509
  #> (if null deps then union (op =) (resolve_facts facts ss) else I)
54500
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   510
57263
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
   511
fun used_facts_in_atp_proof ctxt facts atp_proof =
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
   512
  if null atp_proof then facts else fold (add_fact ctxt facts) atp_proof []
54500
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   513
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   514
fun used_facts_in_unsound_atp_proof _ _ [] = NONE
57263
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
   515
  | used_facts_in_unsound_atp_proof ctxt facts atp_proof =
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
   516
    let val used_facts = used_facts_in_atp_proof ctxt facts atp_proof in
54500
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   517
      if forall (fn (_, (sc, _)) => sc = Global) used_facts andalso
57263
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
   518
         not (is_axiom_used_in_proof (is_some o resolve_conjecture) atp_proof) then
54500
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   519
        SOME (map fst used_facts)
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   520
      else
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   521
        NONE
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   522
    end
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   523
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   524
val ascii_of_lam_fact_prefix = ascii_of lam_fact_prefix
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   525
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   526
(* overapproximation (good enough) *)
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   527
fun is_lam_lifted s =
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   528
  String.isPrefix fact_prefix s andalso
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   529
  String.isSubstring ascii_of_lam_fact_prefix s
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   530
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   531
val is_combinator_def = String.isPrefix (helper_prefix ^ combinator_prefix)
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   532
55257
abfd7b90bba2 rationalized threading of 'metis' arguments
blanchet
parents: 55195
diff changeset
   533
fun atp_proof_prefers_lifting atp_proof =
abfd7b90bba2 rationalized threading of 'metis' arguments
blanchet
parents: 55195
diff changeset
   534
  (is_axiom_used_in_proof is_combinator_def atp_proof,
abfd7b90bba2 rationalized threading of 'metis' arguments
blanchet
parents: 55195
diff changeset
   535
   is_axiom_used_in_proof is_lam_lifted atp_proof) = (false, true)
54500
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   536
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   537
val is_typed_helper_name =
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   538
  String.isPrefix helper_prefix andf String.isSuffix typed_helper_suffix
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   539
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   540
fun is_typed_helper_used_in_atp_proof atp_proof =
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   541
  is_axiom_used_in_proof is_typed_helper_name atp_proof
f625e0e79dd1 refactoring
blanchet
parents: 54499
diff changeset
   542
54772
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
   543
fun replace_one_dependency (old, new) dep = if is_same_atp_step dep old then new else [dep]
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
   544
fun replace_dependencies_in_line old_new (name, role, t, rule, deps) =
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
   545
  (name, role, t, rule, fold (union (op =) o replace_one_dependency old_new) deps [])
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
   546
54499
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   547
fun repair_name "$true" = "c_True"
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   548
  | repair_name "$false" = "c_False"
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   549
  | repair_name "$$e" = tptp_equal (* seen in Vampire proofs *)
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   550
  | repair_name s =
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   551
    if is_tptp_equal s orelse
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   552
       (* seen in Vampire proofs *)
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   553
       (String.isPrefix "sQ" s andalso String.isSuffix "_eqProxy" s) then
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   554
      tptp_equal
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   555
    else
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   556
      s
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   557
57699
a6cf197c1f1e also try 'metis' with 'full_types'
blanchet
parents: 57697
diff changeset
   558
fun set_var_index j = map_aterms (fn Var ((s, 0), T) => Var ((s, j), T) | t => t)
57635
97adb86619a4 more robust handling of types for skolems (modeled as Frees)
blanchet
parents: 57547
diff changeset
   559
57699
a6cf197c1f1e also try 'metis' with 'full_types'
blanchet
parents: 57697
diff changeset
   560
fun infer_formulas_types ctxt =
57635
97adb86619a4 more robust handling of types for skolems (modeled as Frees)
blanchet
parents: 57547
diff changeset
   561
  map_index (uncurry (fn j => set_var_index j #> Type.constraint HOLogic.boolT))
97adb86619a4 more robust handling of types for skolems (modeled as Frees)
blanchet
parents: 57547
diff changeset
   562
  #> Syntax.check_terms (Proof_Context.set_mode Proof_Context.mode_schematic ctxt)
97adb86619a4 more robust handling of types for skolems (modeled as Frees)
blanchet
parents: 57547
diff changeset
   563
  #> map (set_var_index 0)
54499
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   564
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   565
val combinator_table =
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   566
  [(@{const_name Meson.COMBI}, @{thm Meson.COMBI_def [abs_def]}),
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   567
   (@{const_name Meson.COMBK}, @{thm Meson.COMBK_def [abs_def]}),
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   568
   (@{const_name Meson.COMBB}, @{thm Meson.COMBB_def [abs_def]}),
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   569
   (@{const_name Meson.COMBC}, @{thm Meson.COMBC_def [abs_def]}),
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   570
   (@{const_name Meson.COMBS}, @{thm Meson.COMBS_def [abs_def]})]
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   571
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   572
fun uncombine_term thy =
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   573
  let
57717
949838aba487 unlift before uncombine, because the definition of a lambda-lifted symbol might have an SK combinator in it (in hybrid encodings)
blanchet
parents: 57713
diff changeset
   574
    fun uncomb (t1 $ t2) = betapply (uncomb t1, uncomb t2)
949838aba487 unlift before uncombine, because the definition of a lambda-lifted symbol might have an SK combinator in it (in hybrid encodings)
blanchet
parents: 57713
diff changeset
   575
      | uncomb (Abs (s, T, t)) = Abs (s, T, uncomb t)
949838aba487 unlift before uncombine, because the definition of a lambda-lifted symbol might have an SK combinator in it (in hybrid encodings)
blanchet
parents: 57713
diff changeset
   576
      | uncomb (t as Const (x as (s, _))) =
54499
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   577
        (case AList.lookup (op =) combinator_table s of
54756
blanchet
parents: 54507
diff changeset
   578
          SOME thm => thm |> prop_of |> specialize_type thy x |> Logic.dest_equals |> snd
blanchet
parents: 54507
diff changeset
   579
        | NONE => t)
57717
949838aba487 unlift before uncombine, because the definition of a lambda-lifted symbol might have an SK combinator in it (in hybrid encodings)
blanchet
parents: 57713
diff changeset
   580
      | uncomb t = t
949838aba487 unlift before uncombine, because the definition of a lambda-lifted symbol might have an SK combinator in it (in hybrid encodings)
blanchet
parents: 57713
diff changeset
   581
  in uncomb end
54499
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   582
57717
949838aba487 unlift before uncombine, because the definition of a lambda-lifted symbol might have an SK combinator in it (in hybrid encodings)
blanchet
parents: 57713
diff changeset
   583
fun unlift_aterm lifted (t as Const (s, _)) =
949838aba487 unlift before uncombine, because the definition of a lambda-lifted symbol might have an SK combinator in it (in hybrid encodings)
blanchet
parents: 57713
diff changeset
   584
    if String.isPrefix lam_lifted_prefix s then
949838aba487 unlift before uncombine, because the definition of a lambda-lifted symbol might have an SK combinator in it (in hybrid encodings)
blanchet
parents: 57713
diff changeset
   585
      (* FIXME: do something about the types *)
949838aba487 unlift before uncombine, because the definition of a lambda-lifted symbol might have an SK combinator in it (in hybrid encodings)
blanchet
parents: 57713
diff changeset
   586
      (case AList.lookup (op =) lifted s of
949838aba487 unlift before uncombine, because the definition of a lambda-lifted symbol might have an SK combinator in it (in hybrid encodings)
blanchet
parents: 57713
diff changeset
   587
        SOME t' => unlift_term lifted t'
949838aba487 unlift before uncombine, because the definition of a lambda-lifted symbol might have an SK combinator in it (in hybrid encodings)
blanchet
parents: 57713
diff changeset
   588
      | NONE => t)
949838aba487 unlift before uncombine, because the definition of a lambda-lifted symbol might have an SK combinator in it (in hybrid encodings)
blanchet
parents: 57713
diff changeset
   589
    else
949838aba487 unlift before uncombine, because the definition of a lambda-lifted symbol might have an SK combinator in it (in hybrid encodings)
blanchet
parents: 57713
diff changeset
   590
      t
949838aba487 unlift before uncombine, because the definition of a lambda-lifted symbol might have an SK combinator in it (in hybrid encodings)
blanchet
parents: 57713
diff changeset
   591
  | unlift_aterm _ t = t
949838aba487 unlift before uncombine, because the definition of a lambda-lifted symbol might have an SK combinator in it (in hybrid encodings)
blanchet
parents: 57713
diff changeset
   592
and unlift_term lifted =
949838aba487 unlift before uncombine, because the definition of a lambda-lifted symbol might have an SK combinator in it (in hybrid encodings)
blanchet
parents: 57713
diff changeset
   593
  map_aterms (unlift_aterm lifted)
54499
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   594
57256
cf43583f9bb9 imported patch leo2_skolem_simplication
fleury
parents: 57255
diff changeset
   595
fun termify_line _ _ _ _ _ (_, Type_Role, _, _, _) = NONE
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   596
  | termify_line ctxt format type_enc lifted sym_tab (name, role, u, rule, deps) =
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   597
    let
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   598
      val thy = Proof_Context.theory_of ctxt
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   599
      val t = u
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   600
        |> prop_of_atp ctxt format type_enc true sym_tab
57717
949838aba487 unlift before uncombine, because the definition of a lambda-lifted symbol might have an SK combinator in it (in hybrid encodings)
blanchet
parents: 57713
diff changeset
   601
        |> unlift_term lifted
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   602
        |> uncombine_term thy
57768
a63f14f1214c fine-tuned Isar reconstruction, esp. boolean simplifications
blanchet
parents: 57767
diff changeset
   603
        |> simplify_bool
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   604
    in
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   605
      SOME (name, role, t, rule, deps)
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   606
    end
54499
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   607
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   608
val waldmeister_conjecture_num = "1.0.0.0"
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   609
54756
blanchet
parents: 54507
diff changeset
   610
fun repair_waldmeister_endgame proof =
54499
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   611
  let
56854
ddd3af5a683d fixed Waldmeister endgame w.r.t. "Trueprop"
blanchet
parents: 56254
diff changeset
   612
    fun repair_tail (name, _, @{const Trueprop} $ t, rule, deps) =
ddd3af5a683d fixed Waldmeister endgame w.r.t. "Trueprop"
blanchet
parents: 56254
diff changeset
   613
      (name, Negated_Conjecture, @{const Trueprop} $ s_not t, rule, deps)
54756
blanchet
parents: 54507
diff changeset
   614
    fun repair_body [] = []
blanchet
parents: 54507
diff changeset
   615
      | repair_body ((line as ((num, _), _, _, _, _)) :: lines) =
blanchet
parents: 54507
diff changeset
   616
        if num = waldmeister_conjecture_num then map repair_tail (line :: lines)
blanchet
parents: 54507
diff changeset
   617
        else line :: repair_body lines
blanchet
parents: 54507
diff changeset
   618
  in
blanchet
parents: 54507
diff changeset
   619
    repair_body proof
blanchet
parents: 54507
diff changeset
   620
  end
54499
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   621
57635
97adb86619a4 more robust handling of types for skolems (modeled as Frees)
blanchet
parents: 57547
diff changeset
   622
fun map_proof_terms f (lines : ('a * 'b * 'c * 'd * 'e) list) =
97adb86619a4 more robust handling of types for skolems (modeled as Frees)
blanchet
parents: 57547
diff changeset
   623
  map2 (fn c => fn (a, b, _, d, e) => (a, b, c, d, e)) (f (map #3 lines)) lines
97adb86619a4 more robust handling of types for skolems (modeled as Frees)
blanchet
parents: 57547
diff changeset
   624
57258
67d85a8aa6cc Moving the remote prefix deleting on Sledgehammer's side
fleury
parents: 57257
diff changeset
   625
fun termify_atp_proof ctxt local_prover format type_enc pool lifted sym_tab =
57267
8b87114357bd integrated new Waldmeister code with 'sledgehammer' command
blanchet
parents: 57263
diff changeset
   626
  nasty_atp_proof pool
54499
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   627
  #> map_term_names_in_atp_proof repair_name
57255
488046fdda59 add support for Isar reconstruction for thf1 ATP provers like Leo-II.
fleury
parents: 57199
diff changeset
   628
  #> map_filter (termify_line ctxt format type_enc lifted sym_tab)
57699
a6cf197c1f1e also try 'metis' with 'full_types'
blanchet
parents: 57697
diff changeset
   629
  #> map_proof_terms (infer_formulas_types ctxt #> map HOLogic.mk_Trueprop)
57258
67d85a8aa6cc Moving the remote prefix deleting on Sledgehammer's side
fleury
parents: 57257
diff changeset
   630
  #> local_prover = waldmeisterN ? repair_waldmeister_endgame
54499
319f8659267d refactoring
blanchet
parents: 53586
diff changeset
   631
58091
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   632
fun unskolemize_term skos =
55192
b75b52c7cf94 unskolemize SPASS formula to ensure that the variables are in the right order for 'metis's skolemizer
blanchet
parents: 55185
diff changeset
   633
  let
58597
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   634
    val is_skolem_name = member (op =) skos
55192
b75b52c7cf94 unskolemize SPASS formula to ensure that the variables are in the right order for 'metis's skolemizer
blanchet
parents: 55185
diff changeset
   635
58091
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   636
    fun find_argless_skolem (Free _ $ Var _) = NONE
58597
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   637
      | find_argless_skolem (Free (x as (s, _))) = if is_skolem_name s then SOME x else NONE
58091
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   638
      | find_argless_skolem (t $ u) =
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   639
        (case find_argless_skolem t of NONE => find_argless_skolem u | sk => sk)
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   640
      | find_argless_skolem (Abs (_, _, t)) = find_argless_skolem t
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   641
      | find_argless_skolem _ = NONE
55192
b75b52c7cf94 unskolemize SPASS formula to ensure that the variables are in the right order for 'metis's skolemizer
blanchet
parents: 55185
diff changeset
   642
58597
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   643
    fun find_skolem_arg (Free (s, _) $ Var v) = if is_skolem_name s then SOME v else NONE
58091
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   644
      | find_skolem_arg (t $ u) = (case find_skolem_arg t of NONE => find_skolem_arg u | v => v)
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   645
      | find_skolem_arg (Abs (_, _, t)) = find_skolem_arg t
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   646
      | find_skolem_arg _ = NONE
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   647
58597
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   648
    fun kill_skolem_arg (t as Free (s, T) $ Var _) =
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   649
        if is_skolem_name s then Free (s, range_type T) else t
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   650
      | kill_skolem_arg (t $ u) = kill_skolem_arg t $ kill_skolem_arg u
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   651
      | kill_skolem_arg (Abs (s, T, t)) = Abs (s, T, kill_skolem_arg t)
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   652
      | kill_skolem_arg t = t
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   653
58091
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   654
    fun find_var (Var v) = SOME v
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   655
      | find_var (t $ u) = (case find_var t of NONE => find_var u | v => v)
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   656
      | find_var (Abs (_, _, t)) = find_var t
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   657
      | find_var _ = NONE
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   658
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   659
    val safe_abstract_over = abstract_over o apsnd (incr_boundvars 1)
55192
b75b52c7cf94 unskolemize SPASS formula to ensure that the variables are in the right order for 'metis's skolemizer
blanchet
parents: 55185
diff changeset
   660
58091
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   661
    fun unskolem t =
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   662
      (case find_argless_skolem t of
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   663
        SOME (x as (s, T)) =>
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   664
        HOLogic.exists_const T $ Abs (s, T, unskolem (safe_abstract_over (Free x, t)))
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   665
      | NONE =>
58597
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   666
        (case find_skolem_arg t of
58091
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   667
          SOME (v as ((s, _), T)) =>
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   668
          let
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   669
            val (haves, have_nots) =
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   670
              HOLogic.disjuncts t
58597
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   671
              |> List.partition (exists_subterm (curry (op =) (Var v)))
58091
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   672
              |> pairself (fn lits => fold (curry s_disj) lits @{term False})
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   673
          in
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   674
            s_disj (HOLogic.all_const T
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   675
                $ Abs (s, T, unskolem (safe_abstract_over (Var v, kill_skolem_arg haves))),
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   676
              unskolem have_nots)
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   677
          end
58597
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   678
        | NONE =>
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   679
          (case find_var t of
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   680
            SOME (v as ((s, _), T)) =>
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   681
            HOLogic.all_const T $ Abs (s, T, unskolem (safe_abstract_over (Var v, t)))
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   682
          | NONE => t)))
55195
067142c53c3b reverted unsound optimization
blanchet
parents: 55192
diff changeset
   683
  in
58091
ecf5826ba234 reworked unskolemization for SPASS
blanchet
parents: 57820
diff changeset
   684
    HOLogic.mk_Trueprop o unskolem o HOLogic.dest_Trueprop
55192
b75b52c7cf94 unskolemize SPASS formula to ensure that the variables are in the right order for 'metis's skolemizer
blanchet
parents: 55185
diff changeset
   685
  end
b75b52c7cf94 unskolemize SPASS formula to ensure that the variables are in the right order for 'metis's skolemizer
blanchet
parents: 55185
diff changeset
   686
57788
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   687
fun rename_skolem_args t =
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   688
  let
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   689
    fun add_skolem_args (Abs (_, _, t)) = add_skolem_args t
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   690
      | add_skolem_args t =
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   691
        (case strip_comb t of
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   692
          (Free (s, _), args as _ :: _) =>
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   693
          if String.isPrefix spass_skolem_prefix s then
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   694
            insert (op =) (s, fst (take_prefix is_Var args))
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   695
          else
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   696
            fold add_skolem_args args
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   697
        | (u, args as _ :: _) => fold add_skolem_args (u :: args)
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   698
        | _ => I)
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   699
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   700
    fun subst_of_skolem (sk, args) =
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   701
      map_index (fn (j, Var (z, T)) => (z, Var ((sk ^ "_" ^ string_of_int j, 0), T))) args
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   702
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   703
    val subst = maps subst_of_skolem (add_skolem_args t [])
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   704
  in
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   705
    subst_vars ([], subst) t
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   706
  end
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   707
57787
blanchet
parents: 57785
diff changeset
   708
fun introduce_spass_skolems proof =
blanchet
parents: 57785
diff changeset
   709
  let
57788
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   710
    fun add_skolem (Free (s, _)) = String.isPrefix spass_skolem_prefix s ? insert (op =) s
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   711
      | add_skolem _ = I
54772
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
   712
57787
blanchet
parents: 57785
diff changeset
   713
    (* union-find would be faster *)
blanchet
parents: 57785
diff changeset
   714
    fun add_cycle [] = I
blanchet
parents: 57785
diff changeset
   715
      | add_cycle ss =
blanchet
parents: 57785
diff changeset
   716
        fold (fn s => Graph.default_node (s, ())) ss
blanchet
parents: 57785
diff changeset
   717
        #> fold Graph.add_edge (ss ~~ tl ss @ [hd ss])
54772
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
   718
57787
blanchet
parents: 57785
diff changeset
   719
    val (input_steps, other_steps) = List.partition (null o #5) proof
54772
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
   720
58597
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   721
    (* The names of the formulas are added to the Skolem constants, to ensure that formulas giving
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   722
       rise to several clauses are skolemized together. *)
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   723
    val skoXss = map (fn ((_, ss), _, t, _, _) => Term.fold_aterms add_skolem t ss) input_steps
58601
85fa90262807 avoid creating needless skolemization steps for SPASS
blanchet
parents: 58600
diff changeset
   724
    val groups0 = Graph.strong_conn (fold add_cycle skoXss Graph.empty)
85fa90262807 avoid creating needless skolemization steps for SPASS
blanchet
parents: 58600
diff changeset
   725
    val groups = filter (exists (String.isPrefix spass_skolem_prefix)) groups0
85fa90262807 avoid creating needless skolemization steps for SPASS
blanchet
parents: 58600
diff changeset
   726
85fa90262807 avoid creating needless skolemization steps for SPASS
blanchet
parents: 58600
diff changeset
   727
    val skoXss_input_steps = skoXss ~~ input_steps
54772
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
   728
58597
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   729
    fun step_name_of_group skoXs = (implode skoXs, [])
57787
blanchet
parents: 57785
diff changeset
   730
    fun in_group group = member (op =) group o hd
58601
85fa90262807 avoid creating needless skolemization steps for SPASS
blanchet
parents: 58600
diff changeset
   731
    fun group_of skoX = find_first (fn group => in_group group skoX) groups
54772
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
   732
58652
da12763acd6b made SML/NJ happier
blanchet
parents: 58601
diff changeset
   733
    fun new_steps (skoXss_steps : (string list * (term, 'a) atp_step) list) group =
57787
blanchet
parents: 57785
diff changeset
   734
      let
blanchet
parents: 57785
diff changeset
   735
        val name = step_name_of_group group
blanchet
parents: 57785
diff changeset
   736
        val name0 = name |>> prefix "0"
57788
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   737
        val t =
58597
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   738
          (case map (snd #> #3) skoXss_steps of
57788
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   739
            [t] => t
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   740
          | ts => ts
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   741
            |> map (HOLogic.dest_Trueprop #> rename_skolem_args)
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   742
            |> Library.foldr1 s_conj
0a38c47ebb69 normalize skolem argument variable names so that they coincide when taking the conjunction
blanchet
parents: 57787
diff changeset
   743
            |> HOLogic.mk_Trueprop)
58597
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   744
        val skos =
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   745
          fold (union (op =) o filter (String.isPrefix spass_skolem_prefix) o fst) skoXss_steps []
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   746
        val deps = map (snd #> #1) skoXss_steps
57787
blanchet
parents: 57785
diff changeset
   747
      in
blanchet
parents: 57785
diff changeset
   748
        [(name0, Unknown, unskolemize_term skos t, spass_pre_skolemize_rule, deps),
blanchet
parents: 57785
diff changeset
   749
         (name, Unknown, t, spass_skolemize_rule, [name0])]
blanchet
parents: 57785
diff changeset
   750
      end
54772
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
   751
57787
blanchet
parents: 57785
diff changeset
   752
    val sko_steps =
58597
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   753
      maps (fn group => new_steps (filter (in_group group o fst) skoXss_input_steps) group) groups
54772
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
   754
57787
blanchet
parents: 57785
diff changeset
   755
    val old_news =
58601
85fa90262807 avoid creating needless skolemization steps for SPASS
blanchet
parents: 58600
diff changeset
   756
      map_filter (fn (skoXs, (name, _, _, _, _)) =>
85fa90262807 avoid creating needless skolemization steps for SPASS
blanchet
parents: 58600
diff changeset
   757
          Option.map (pair name o single o step_name_of_group) (group_of skoXs))
58597
21a741e96970 improved unskolemization of SPASS problems
blanchet
parents: 58500
diff changeset
   758
        skoXss_input_steps
57787
blanchet
parents: 57785
diff changeset
   759
    val repair_deps = fold replace_dependencies_in_line old_news
blanchet
parents: 57785
diff changeset
   760
  in
blanchet
parents: 57785
diff changeset
   761
    input_steps @ sko_steps @ map repair_deps other_steps
blanchet
parents: 57785
diff changeset
   762
  end
54772
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
   763
57263
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
   764
fun factify_atp_proof facts hyp_ts concl_t atp_proof =
54505
d023838eb252 more refactoring to accommodate SMT proofs
blanchet
parents: 54501
diff changeset
   765
  let
57785
0388026060d1 deal with E definitions
blanchet
parents: 57768
diff changeset
   766
    fun factify_step ((num, ss), role, t, rule, deps) =
54505
d023838eb252 more refactoring to accommodate SMT proofs
blanchet
parents: 54501
diff changeset
   767
      let
d023838eb252 more refactoring to accommodate SMT proofs
blanchet
parents: 54501
diff changeset
   768
        val (ss', role', t') =
57263
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
   769
          (case resolve_conjectures ss of
54505
d023838eb252 more refactoring to accommodate SMT proofs
blanchet
parents: 54501
diff changeset
   770
            [j] =>
58484
b4c0e2b00036 support hypotheses with schematics in Isar proofs
blanchet
parents: 58475
diff changeset
   771
            if j = length hyp_ts then ([], Conjecture, concl_t)
b4c0e2b00036 support hypotheses with schematics in Isar proofs
blanchet
parents: 58475
diff changeset
   772
            else ([], Hypothesis, close_form (nth hyp_ts j))
55185
a0bd8d6414e6 centralized & repaired handling of bound variables in intermediate data structure (viva de Bruijn)
blanchet
parents: 54822
diff changeset
   773
          | _ =>
57263
2b6a96cc64c9 simplified code
blanchet
parents: 57258
diff changeset
   774
            (case resolve_facts facts ss of
57785
0388026060d1 deal with E definitions
blanchet
parents: 57768
diff changeset
   775
              [] => (ss, if role = Lemma then Lemma else Plain, t)
55185
a0bd8d6414e6 centralized & repaired handling of bound variables in intermediate data structure (viva de Bruijn)
blanchet
parents: 54822
diff changeset
   776
            | facts => (map fst facts, Axiom, t)))
54505
d023838eb252 more refactoring to accommodate SMT proofs
blanchet
parents: 54501
diff changeset
   777
      in
d023838eb252 more refactoring to accommodate SMT proofs
blanchet
parents: 54501
diff changeset
   778
        ((num, ss'), role', t', rule, deps)
d023838eb252 more refactoring to accommodate SMT proofs
blanchet
parents: 54501
diff changeset
   779
      end
d023838eb252 more refactoring to accommodate SMT proofs
blanchet
parents: 54501
diff changeset
   780
d023838eb252 more refactoring to accommodate SMT proofs
blanchet
parents: 54501
diff changeset
   781
    val atp_proof = map factify_step atp_proof
d023838eb252 more refactoring to accommodate SMT proofs
blanchet
parents: 54501
diff changeset
   782
    val names = map #1 atp_proof
d023838eb252 more refactoring to accommodate SMT proofs
blanchet
parents: 54501
diff changeset
   783
d023838eb252 more refactoring to accommodate SMT proofs
blanchet
parents: 54501
diff changeset
   784
    fun repair_dep (num, ss) = (num, the_default ss (AList.lookup (op =) names num))
d023838eb252 more refactoring to accommodate SMT proofs
blanchet
parents: 54501
diff changeset
   785
    fun repair_deps (name, role, t, rule, deps) = (name, role, t, rule, map repair_dep deps)
54772
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
   786
  in
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
   787
    map repair_deps atp_proof
f5fd4a34b0e8 handle Skolems gracefully for SPASS as well
blanchet
parents: 54770
diff changeset
   788
  end
54505
d023838eb252 more refactoring to accommodate SMT proofs
blanchet
parents: 54501
diff changeset
   789
31038
immler@in.tum.de
parents: 31037
diff changeset
   790
end;