src/HOL/SMT.thy
author boehmes
Tue Dec 07 14:53:12 2010 +0100 (2010-12-07)
changeset 41059 d2b1fc1b8e19
parent 40806 59d96f777da3
child 41121 5c5d05963f93
permissions -rw-r--r--
centralized handling of built-in types and constants;
also store types and constants which are rewritten during preprocessing;
interfaces are identified by classes (supporting inheritance, at least on the level of built-in symbols);
removed term_eq in favor of type replacements: term-level occurrences of type bool are replaced by type term_bool (only for the translation)
boehmes@36898
     1
(*  Title:      HOL/SMT.thy
boehmes@36898
     2
    Author:     Sascha Boehme, TU Muenchen
boehmes@36898
     3
*)
boehmes@36898
     4
boehmes@36898
     5
header {* Bindings to Satisfiability Modulo Theories (SMT) solvers *}
boehmes@36898
     6
boehmes@36898
     7
theory SMT
boehmes@36898
     8
imports List
boehmes@36898
     9
uses
boehmes@39483
    10
  "Tools/Datatype/datatype_selectors.ML"
boehmes@40424
    11
  "Tools/SMT/smt_failure.ML"
boehmes@40424
    12
  "Tools/SMT/smt_config.ML"
boehmes@40662
    13
  "Tools/SMT/smt_utils.ML"
boehmes@40424
    14
  "Tools/SMT/smt_monomorph.ML"
boehmes@40277
    15
  ("Tools/SMT/smt_builtin.ML")
boehmes@36898
    16
  ("Tools/SMT/smt_normalize.ML")
boehmes@36898
    17
  ("Tools/SMT/smt_translate.ML")
boehmes@36898
    18
  ("Tools/SMT/smt_solver.ML")
boehmes@36898
    19
  ("Tools/SMT/smtlib_interface.ML")
boehmes@36898
    20
  ("Tools/SMT/z3_proof_parser.ML")
boehmes@36898
    21
  ("Tools/SMT/z3_proof_tools.ML")
boehmes@36898
    22
  ("Tools/SMT/z3_proof_literals.ML")
boehmes@40662
    23
  ("Tools/SMT/z3_proof_methods.ML")
boehmes@36898
    24
  ("Tools/SMT/z3_proof_reconstruction.ML")
boehmes@36898
    25
  ("Tools/SMT/z3_model.ML")
boehmes@36898
    26
  ("Tools/SMT/z3_interface.ML")
boehmes@40162
    27
  ("Tools/SMT/smt_setup_solvers.ML")
boehmes@36898
    28
begin
boehmes@36898
    29
boehmes@36898
    30
boehmes@36898
    31
huffman@36902
    32
subsection {* Triggers for quantifier instantiation *}
boehmes@36898
    33
boehmes@36898
    34
text {*
boehmes@36898
    35
Some SMT solvers support triggers for quantifier instantiation.
boehmes@36898
    36
Each trigger consists of one ore more patterns.  A pattern may either
boehmes@37124
    37
be a list of positive subterms (each being tagged by "pat"), or a
boehmes@37124
    38
list of negative subterms (each being tagged by "nopat").
boehmes@37124
    39
boehmes@37124
    40
When an SMT solver finds a term matching a positive pattern (a
boehmes@37124
    41
pattern with positive subterms only), it instantiates the
boehmes@37124
    42
corresponding quantifier accordingly.  Negative patterns inhibit
boehmes@37124
    43
quantifier instantiations.  Each pattern should mention all preceding
boehmes@37124
    44
bound variables.
boehmes@36898
    45
*}
boehmes@36898
    46
boehmes@36898
    47
datatype pattern = Pattern
boehmes@36898
    48
boehmes@37124
    49
definition pat :: "'a \<Rightarrow> pattern" where "pat _ = Pattern"
boehmes@37124
    50
definition nopat :: "'a \<Rightarrow> pattern" where "nopat _ = Pattern"
boehmes@36898
    51
boehmes@37124
    52
definition trigger :: "pattern list list \<Rightarrow> bool \<Rightarrow> bool"
boehmes@36898
    53
where "trigger _ P = P"
boehmes@36898
    54
boehmes@36898
    55
boehmes@36898
    56
boehmes@40664
    57
subsection {* Quantifier weights *}
boehmes@40664
    58
boehmes@40664
    59
text {*
boehmes@40664
    60
Weight annotations to quantifiers influence the priority of quantifier
boehmes@40664
    61
instantiations.  They should be handled with care for solvers, which support
boehmes@40664
    62
them, because incorrect choices of weights might render a problem unsolvable.
boehmes@40664
    63
*}
boehmes@40664
    64
boehmes@40664
    65
definition weight :: "int \<Rightarrow> bool \<Rightarrow> bool" where "weight _ P = P"
boehmes@40664
    66
boehmes@40664
    67
text {*
boehmes@40664
    68
Weights must be non-negative.  The value @{text 0} is equivalent to providing
boehmes@40664
    69
no weight at all.
boehmes@40664
    70
boehmes@40664
    71
Weights should only be used at quantifiers and only inside triggers (if the
boehmes@40664
    72
quantifier has triggers).  Valid usages of weights are as follows:
boehmes@40664
    73
boehmes@40664
    74
\begin{itemize}
boehmes@40664
    75
\item
boehmes@40664
    76
@{term "\<forall>x. trigger [[pat (P x)]] (weight 2 (P x))"}
boehmes@40664
    77
\item
boehmes@40664
    78
@{term "\<forall>x. weight 3 (P x)"}
boehmes@40664
    79
\end{itemize}
boehmes@40664
    80
*}
boehmes@40664
    81
boehmes@40664
    82
boehmes@40664
    83
huffman@36902
    84
subsection {* Higher-order encoding *}
boehmes@36898
    85
boehmes@36898
    86
text {*
boehmes@36898
    87
Application is made explicit for constants occurring with varying
boehmes@36898
    88
numbers of arguments.  This is achieved by the introduction of the
boehmes@36898
    89
following constant.
boehmes@36898
    90
*}
boehmes@36898
    91
boehmes@37153
    92
definition fun_app where "fun_app f x = f x"
boehmes@36898
    93
boehmes@36898
    94
text {*
boehmes@36898
    95
Some solvers support a theory of arrays which can be used to encode
boehmes@36898
    96
higher-order functions.  The following set of lemmas specifies the
boehmes@36898
    97
properties of such (extensional) arrays.
boehmes@36898
    98
*}
boehmes@36898
    99
boehmes@36898
   100
lemmas array_rules = ext fun_upd_apply fun_upd_same fun_upd_other
boehmes@37157
   101
  fun_upd_upd fun_app_def
boehmes@36898
   102
boehmes@36898
   103
boehmes@36898
   104
huffman@36902
   105
subsection {* First-order logic *}
boehmes@36898
   106
boehmes@36898
   107
text {*
boehmes@41059
   108
Some SMT solvers only accept problems in first-order logic, i.e.,
boehmes@41059
   109
where formulas and terms are syntactically separated. When
boehmes@41059
   110
translating higher-order into first-order problems, all
boehmes@41059
   111
uninterpreted constants (those not built-in in the target solver)
boehmes@36898
   112
are treated as function symbols in the first-order sense.  Their
boehmes@41059
   113
occurrences as head symbols in atoms (i.e., as predicate symbols) are
boehmes@41059
   114
turned into terms by equating such atoms with @{term True}.
boehmes@41059
   115
Whenever the boolean type occurs in first-order terms, it is replaced
boehmes@41059
   116
by the following type.
boehmes@36898
   117
*}
boehmes@36898
   118
boehmes@41059
   119
typedecl term_bool
boehmes@36898
   120
boehmes@36898
   121
boehmes@36898
   122
boehmes@37151
   123
subsection {* Integer division and modulo for Z3 *}
boehmes@37151
   124
boehmes@37151
   125
definition z3div :: "int \<Rightarrow> int \<Rightarrow> int" where
boehmes@37151
   126
  "z3div k l = (if 0 \<le> l then k div l else -(k div (-l)))"
boehmes@37151
   127
boehmes@37151
   128
definition z3mod :: "int \<Rightarrow> int \<Rightarrow> int" where
boehmes@37151
   129
  "z3mod k l = (if 0 \<le> l then k mod l else k mod (-l))"
boehmes@37151
   130
boehmes@37151
   131
lemma div_by_z3div: "k div l = (
boehmes@37151
   132
     if k = 0 \<or> l = 0 then 0
boehmes@37151
   133
     else if (0 < k \<and> 0 < l) \<or> (k < 0 \<and> 0 < l) then z3div k l
boehmes@37151
   134
     else z3div (-k) (-l))"
boehmes@37151
   135
  by (auto simp add: z3div_def)
boehmes@37151
   136
boehmes@37151
   137
lemma mod_by_z3mod: "k mod l = (
boehmes@37151
   138
     if l = 0 then k
boehmes@37151
   139
     else if k = 0 then 0
boehmes@37151
   140
     else if (0 < k \<and> 0 < l) \<or> (k < 0 \<and> 0 < l) then z3mod k l
boehmes@37151
   141
     else - z3mod (-k) (-l))"
boehmes@37151
   142
  by (auto simp add: z3mod_def)
boehmes@37151
   143
boehmes@37151
   144
boehmes@37151
   145
huffman@36902
   146
subsection {* Setup *}
boehmes@36898
   147
boehmes@40277
   148
use "Tools/SMT/smt_builtin.ML"
boehmes@36898
   149
use "Tools/SMT/smt_normalize.ML"
boehmes@36898
   150
use "Tools/SMT/smt_translate.ML"
boehmes@36898
   151
use "Tools/SMT/smt_solver.ML"
boehmes@36898
   152
use "Tools/SMT/smtlib_interface.ML"
boehmes@36898
   153
use "Tools/SMT/z3_interface.ML"
boehmes@36898
   154
use "Tools/SMT/z3_proof_parser.ML"
boehmes@36898
   155
use "Tools/SMT/z3_proof_tools.ML"
boehmes@36898
   156
use "Tools/SMT/z3_proof_literals.ML"
boehmes@40662
   157
use "Tools/SMT/z3_proof_methods.ML"
boehmes@36898
   158
use "Tools/SMT/z3_proof_reconstruction.ML"
boehmes@36898
   159
use "Tools/SMT/z3_model.ML"
boehmes@40162
   160
use "Tools/SMT/smt_setup_solvers.ML"
boehmes@36898
   161
boehmes@36898
   162
setup {*
boehmes@40424
   163
  SMT_Config.setup #>
boehmes@41059
   164
  SMT_Normalize.setup #>
boehmes@36898
   165
  SMT_Solver.setup #>
boehmes@41059
   166
  SMTLIB_Interface.setup #>
boehmes@41059
   167
  Z3_Interface.setup #>
boehmes@36898
   168
  Z3_Proof_Reconstruction.setup #>
boehmes@40162
   169
  SMT_Setup_Solvers.setup
boehmes@36898
   170
*}
boehmes@36898
   171
boehmes@36898
   172
boehmes@36898
   173
huffman@36902
   174
subsection {* Configuration *}
boehmes@36898
   175
boehmes@36898
   176
text {*
boehmes@36899
   177
The current configuration can be printed by the command
boehmes@36899
   178
@{text smt_status}, which shows the values of most options.
boehmes@36898
   179
*}
boehmes@36898
   180
boehmes@36898
   181
boehmes@36898
   182
boehmes@36898
   183
subsection {* General configuration options *}
boehmes@36898
   184
boehmes@36898
   185
text {*
boehmes@36898
   186
The option @{text smt_solver} can be used to change the target SMT
boehmes@36898
   187
solver.  The possible values are @{text cvc3}, @{text yices}, and
boehmes@36898
   188
@{text z3}.  It is advisable to locally install the selected solver,
boehmes@36898
   189
although this is not necessary for @{text cvc3} and @{text z3}, which
boehmes@36898
   190
can also be used over an Internet-based service.
boehmes@36898
   191
boehmes@36898
   192
When using local SMT solvers, the path to their binaries should be
boehmes@36898
   193
declared by setting the following environment variables:
boehmes@36898
   194
@{text CVC3_SOLVER}, @{text YICES_SOLVER}, and @{text Z3_SOLVER}.
boehmes@36898
   195
*}
boehmes@36898
   196
boehmes@36898
   197
declare [[ smt_solver = z3 ]]
boehmes@36898
   198
boehmes@36898
   199
text {*
boehmes@36898
   200
Since SMT solvers are potentially non-terminating, there is a timeout
boehmes@36898
   201
(given in seconds) to restrict their runtime.  A value greater than
boehmes@36898
   202
120 (seconds) is in most cases not advisable.
boehmes@36898
   203
*}
boehmes@36898
   204
boehmes@36898
   205
declare [[ smt_timeout = 20 ]]
boehmes@36898
   206
boehmes@40162
   207
text {*
boehmes@40162
   208
In general, the binding to SMT solvers runs as an oracle, i.e, the SMT
boehmes@40162
   209
solvers are fully trusted without additional checks.  The following
boehmes@40162
   210
option can cause the SMT solver to run in proof-producing mode, giving
boehmes@40162
   211
a checkable certificate.  This is currently only implemented for Z3.
boehmes@40162
   212
*}
boehmes@40162
   213
boehmes@40162
   214
declare [[ smt_oracle = false ]]
boehmes@40162
   215
boehmes@40162
   216
text {*
boehmes@40162
   217
Each SMT solver provides several commandline options to tweak its
boehmes@40162
   218
behaviour.  They can be passed to the solver by setting the following
boehmes@40162
   219
options.
boehmes@40162
   220
*}
boehmes@40162
   221
boehmes@40162
   222
declare [[ cvc3_options = "", yices_options = "", z3_options = "" ]]
boehmes@40162
   223
boehmes@40162
   224
text {*
boehmes@40162
   225
Enable the following option to use built-in support for datatypes and
boehmes@40162
   226
records.  Currently, this is only implemented for Z3 running in oracle
boehmes@40162
   227
mode.
boehmes@40162
   228
*}
boehmes@40162
   229
boehmes@40162
   230
declare [[ smt_datatypes = false ]]
boehmes@40162
   231
boehmes@36898
   232
boehmes@36898
   233
boehmes@36898
   234
subsection {* Certificates *}
boehmes@36898
   235
boehmes@36898
   236
text {*
boehmes@36898
   237
By setting the option @{text smt_certificates} to the name of a file,
boehmes@36898
   238
all following applications of an SMT solver a cached in that file.
boehmes@36898
   239
Any further application of the same SMT solver (using the very same
boehmes@36898
   240
configuration) re-uses the cached certificate instead of invoking the
boehmes@36898
   241
solver.  An empty string disables caching certificates.
boehmes@36898
   242
boehmes@36898
   243
The filename should be given as an explicit path.  It is good
boehmes@36898
   244
practice to use the name of the current theory (with ending
boehmes@36898
   245
@{text ".certs"} instead of @{text ".thy"}) as the certificates file.
boehmes@36898
   246
*}
boehmes@36898
   247
boehmes@36898
   248
declare [[ smt_certificates = "" ]]
boehmes@36898
   249
boehmes@36898
   250
text {*
boehmes@36898
   251
The option @{text smt_fixed} controls whether only stored
boehmes@36898
   252
certificates are should be used or invocation of an SMT solver is
boehmes@36898
   253
allowed.  When set to @{text true}, no SMT solver will ever be
boehmes@36898
   254
invoked and only the existing certificates found in the configured
boehmes@36898
   255
cache are used;  when set to @{text false} and there is no cached
boehmes@36898
   256
certificate for some proposition, then the configured SMT solver is
boehmes@36898
   257
invoked.
boehmes@36898
   258
*}
boehmes@36898
   259
boehmes@36898
   260
declare [[ smt_fixed = false ]]
boehmes@36898
   261
boehmes@36898
   262
boehmes@36898
   263
boehmes@36898
   264
subsection {* Tracing *}
boehmes@36898
   265
boehmes@36898
   266
text {*
boehmes@40424
   267
The SMT method, when applied, traces important information.  To
boehmes@40424
   268
make it entirely silent, set the following option to @{text false}.
boehmes@40424
   269
*}
boehmes@40424
   270
boehmes@40424
   271
declare [[ smt_verbose = true ]]
boehmes@40424
   272
boehmes@40424
   273
text {*
boehmes@36898
   274
For tracing the generated problem file given to the SMT solver as
boehmes@36898
   275
well as the returned result of the solver, the option
boehmes@36898
   276
@{text smt_trace} should be set to @{text true}.
boehmes@36898
   277
*}
boehmes@36898
   278
boehmes@36898
   279
declare [[ smt_trace = false ]]
boehmes@36898
   280
boehmes@36898
   281
text {*
boehmes@40162
   282
From the set of assumptions given to the SMT solver, those assumptions
boehmes@40162
   283
used in the proof are traced when the following option is set to
boehmes@40162
   284
@{term true}.  This only works for Z3 when it runs in non-oracle mode
boehmes@40162
   285
(see options @{text smt_solver} and @{text smt_oracle} above).
boehmes@36898
   286
*}
boehmes@36898
   287
boehmes@40162
   288
declare [[ smt_trace_used_facts = false ]]
boehmes@39298
   289
boehmes@36898
   290
boehmes@36898
   291
huffman@36902
   292
subsection {* Schematic rules for Z3 proof reconstruction *}
boehmes@36898
   293
boehmes@36898
   294
text {*
boehmes@36898
   295
Several prof rules of Z3 are not very well documented.  There are two
boehmes@36898
   296
lemma groups which can turn failing Z3 proof reconstruction attempts
boehmes@36898
   297
into succeeding ones: the facts in @{text z3_rule} are tried prior to
boehmes@36898
   298
any implemented reconstruction procedure for all uncertain Z3 proof
boehmes@36898
   299
rules;  the facts in @{text z3_simp} are only fed to invocations of
boehmes@36898
   300
the simplifier when reconstructing theory-specific proof steps.
boehmes@36898
   301
*}
boehmes@36898
   302
boehmes@36898
   303
lemmas [z3_rule] =
boehmes@36898
   304
  refl eq_commute conj_commute disj_commute simp_thms nnf_simps
boehmes@36898
   305
  ring_distribs field_simps times_divide_eq_right times_divide_eq_left
boehmes@36898
   306
  if_True if_False not_not
boehmes@36898
   307
boehmes@36898
   308
lemma [z3_rule]:
boehmes@36898
   309
  "(P \<longrightarrow> Q) = (Q \<or> \<not>P)"
boehmes@36898
   310
  "(\<not>P \<longrightarrow> Q) = (P \<or> Q)"
boehmes@36898
   311
  "(\<not>P \<longrightarrow> Q) = (Q \<or> P)"
boehmes@36898
   312
  by auto
boehmes@36898
   313
boehmes@36898
   314
lemma [z3_rule]:
boehmes@36898
   315
  "((P = Q) \<longrightarrow> R) = (R | (Q = (\<not>P)))"
boehmes@36898
   316
  by auto
boehmes@36898
   317
boehmes@36898
   318
lemma [z3_rule]:
boehmes@36898
   319
  "((\<not>P) = P) = False"
boehmes@36898
   320
  "(P = (\<not>P)) = False"
boehmes@36898
   321
  "(P \<noteq> Q) = (Q = (\<not>P))"
boehmes@36898
   322
  "(P = Q) = ((\<not>P \<or> Q) \<and> (P \<or> \<not>Q))"
boehmes@36898
   323
  "(P \<noteq> Q) = ((\<not>P \<or> \<not>Q) \<and> (P \<or> Q))"
boehmes@36898
   324
  by auto
boehmes@36898
   325
boehmes@36898
   326
lemma [z3_rule]:
boehmes@36898
   327
  "(if P then P else \<not>P) = True"
boehmes@36898
   328
  "(if \<not>P then \<not>P else P) = True"
boehmes@36898
   329
  "(if P then True else False) = P"
boehmes@36898
   330
  "(if P then False else True) = (\<not>P)"
boehmes@36898
   331
  "(if \<not>P then x else y) = (if P then y else x)"
boehmes@40806
   332
  "f (if P then x else y) = (if P then f x else f y)"
boehmes@36898
   333
  by auto
boehmes@36898
   334
boehmes@36898
   335
lemma [z3_rule]:
boehmes@36898
   336
  "P = Q \<or> P \<or> Q"
boehmes@36898
   337
  "P = Q \<or> \<not>P \<or> \<not>Q"
boehmes@36898
   338
  "(\<not>P) = Q \<or> \<not>P \<or> Q"
boehmes@36898
   339
  "(\<not>P) = Q \<or> P \<or> \<not>Q"
boehmes@36898
   340
  "P = (\<not>Q) \<or> \<not>P \<or> Q"
boehmes@36898
   341
  "P = (\<not>Q) \<or> P \<or> \<not>Q"
boehmes@36898
   342
  "P \<noteq> Q \<or> P \<or> \<not>Q"
boehmes@36898
   343
  "P \<noteq> Q \<or> \<not>P \<or> Q"
boehmes@36898
   344
  "P \<noteq> (\<not>Q) \<or> P \<or> Q"
boehmes@36898
   345
  "(\<not>P) \<noteq> Q \<or> P \<or> Q"
boehmes@36898
   346
  "P \<or> Q \<or> P \<noteq> (\<not>Q)"
boehmes@36898
   347
  "P \<or> Q \<or> (\<not>P) \<noteq> Q"
boehmes@36898
   348
  "P \<or> \<not>Q \<or> P \<noteq> Q"
boehmes@36898
   349
  "\<not>P \<or> Q \<or> P \<noteq> Q"
boehmes@36898
   350
  by auto
boehmes@36898
   351
boehmes@36898
   352
lemma [z3_rule]:
boehmes@36898
   353
  "0 + (x::int) = x"
boehmes@36898
   354
  "x + 0 = x"
boehmes@36898
   355
  "0 * x = 0"
boehmes@36898
   356
  "1 * x = x"
boehmes@36898
   357
  "x + y = y + x"
boehmes@36898
   358
  by auto
boehmes@36898
   359
boehmes@37124
   360
boehmes@37124
   361
boehmes@41059
   362
hide_type term_bool
boehmes@37124
   363
hide_type (open) pattern
boehmes@41059
   364
hide_const Pattern fun_app
boehmes@41059
   365
hide_const (open) trigger pat nopat weight z3div z3mod
boehmes@37124
   366
boehmes@39483
   367
boehmes@39483
   368
boehmes@39483
   369
subsection {* Selectors for datatypes *}
boehmes@39483
   370
boehmes@39483
   371
setup {* Datatype_Selectors.setup *}
boehmes@39483
   372
boehmes@39483
   373
declare [[ selector Pair 1 = fst, selector Pair 2 = snd ]]
boehmes@39483
   374
declare [[ selector Cons 1 = hd, selector Cons 2 = tl ]]
boehmes@39483
   375
boehmes@36898
   376
end