src/HOL/SMT.thy
author boehmes
Fri Sep 17 10:52:35 2010 +0200 (2010-09-17)
changeset 39483 9f0e5684f04b
parent 39298 5aefb5bc8a93
child 40162 7f58a9a843c2
permissions -rw-r--r--
add full support for datatypes to the SMT interface (only used by Z3 in oracle mode so far); added store to keep track of datatype selector functions
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@36898
    11
  ("Tools/SMT/smt_monomorph.ML")
boehmes@36898
    12
  ("Tools/SMT/smt_normalize.ML")
boehmes@36898
    13
  ("Tools/SMT/smt_translate.ML")
boehmes@36898
    14
  ("Tools/SMT/smt_solver.ML")
boehmes@36898
    15
  ("Tools/SMT/smtlib_interface.ML")
boehmes@36898
    16
  ("Tools/SMT/z3_proof_parser.ML")
boehmes@36898
    17
  ("Tools/SMT/z3_proof_tools.ML")
boehmes@36898
    18
  ("Tools/SMT/z3_proof_literals.ML")
boehmes@36898
    19
  ("Tools/SMT/z3_proof_reconstruction.ML")
boehmes@36898
    20
  ("Tools/SMT/z3_model.ML")
boehmes@36898
    21
  ("Tools/SMT/z3_interface.ML")
boehmes@36898
    22
  ("Tools/SMT/z3_solver.ML")
boehmes@36898
    23
  ("Tools/SMT/cvc3_solver.ML")
boehmes@36898
    24
  ("Tools/SMT/yices_solver.ML")
boehmes@36898
    25
begin
boehmes@36898
    26
boehmes@36898
    27
boehmes@36898
    28
huffman@36902
    29
subsection {* Triggers for quantifier instantiation *}
boehmes@36898
    30
boehmes@36898
    31
text {*
boehmes@36898
    32
Some SMT solvers support triggers for quantifier instantiation.
boehmes@36898
    33
Each trigger consists of one ore more patterns.  A pattern may either
boehmes@37124
    34
be a list of positive subterms (each being tagged by "pat"), or a
boehmes@37124
    35
list of negative subterms (each being tagged by "nopat").
boehmes@37124
    36
boehmes@37124
    37
When an SMT solver finds a term matching a positive pattern (a
boehmes@37124
    38
pattern with positive subterms only), it instantiates the
boehmes@37124
    39
corresponding quantifier accordingly.  Negative patterns inhibit
boehmes@37124
    40
quantifier instantiations.  Each pattern should mention all preceding
boehmes@37124
    41
bound variables.
boehmes@36898
    42
*}
boehmes@36898
    43
boehmes@36898
    44
datatype pattern = Pattern
boehmes@36898
    45
boehmes@37124
    46
definition pat :: "'a \<Rightarrow> pattern" where "pat _ = Pattern"
boehmes@37124
    47
definition nopat :: "'a \<Rightarrow> pattern" where "nopat _ = Pattern"
boehmes@36898
    48
boehmes@37124
    49
definition trigger :: "pattern list list \<Rightarrow> bool \<Rightarrow> bool"
boehmes@36898
    50
where "trigger _ P = P"
boehmes@36898
    51
boehmes@36898
    52
boehmes@36898
    53
huffman@36902
    54
subsection {* Higher-order encoding *}
boehmes@36898
    55
boehmes@36898
    56
text {*
boehmes@36898
    57
Application is made explicit for constants occurring with varying
boehmes@36898
    58
numbers of arguments.  This is achieved by the introduction of the
boehmes@36898
    59
following constant.
boehmes@36898
    60
*}
boehmes@36898
    61
boehmes@37153
    62
definition fun_app where "fun_app f x = f x"
boehmes@36898
    63
boehmes@36898
    64
text {*
boehmes@36898
    65
Some solvers support a theory of arrays which can be used to encode
boehmes@36898
    66
higher-order functions.  The following set of lemmas specifies the
boehmes@36898
    67
properties of such (extensional) arrays.
boehmes@36898
    68
*}
boehmes@36898
    69
boehmes@36898
    70
lemmas array_rules = ext fun_upd_apply fun_upd_same fun_upd_other
boehmes@37157
    71
  fun_upd_upd fun_app_def
boehmes@36898
    72
boehmes@36898
    73
boehmes@36898
    74
huffman@36902
    75
subsection {* First-order logic *}
boehmes@36898
    76
boehmes@36898
    77
text {*
boehmes@36898
    78
Some SMT solvers require a strict separation between formulas and
boehmes@36898
    79
terms.  When translating higher-order into first-order problems,
boehmes@36898
    80
all uninterpreted constants (those not builtin in the target solver)
boehmes@36898
    81
are treated as function symbols in the first-order sense.  Their
boehmes@36898
    82
occurrences as head symbols in atoms (i.e., as predicate symbols) is
boehmes@36898
    83
turned into terms by equating such atoms with @{term True} using the
boehmes@36898
    84
following term-level equation symbol.
boehmes@36898
    85
*}
boehmes@36898
    86
boehmes@37124
    87
definition term_eq :: "bool \<Rightarrow> bool \<Rightarrow> bool" where "term_eq x y = (x = y)"
boehmes@36898
    88
boehmes@36898
    89
boehmes@36898
    90
boehmes@37151
    91
subsection {* Integer division and modulo for Z3 *}
boehmes@37151
    92
boehmes@37151
    93
definition z3div :: "int \<Rightarrow> int \<Rightarrow> int" where
boehmes@37151
    94
  "z3div k l = (if 0 \<le> l then k div l else -(k div (-l)))"
boehmes@37151
    95
boehmes@37151
    96
definition z3mod :: "int \<Rightarrow> int \<Rightarrow> int" where
boehmes@37151
    97
  "z3mod k l = (if 0 \<le> l then k mod l else k mod (-l))"
boehmes@37151
    98
boehmes@37151
    99
lemma div_by_z3div: "k div l = (
boehmes@37151
   100
     if k = 0 \<or> l = 0 then 0
boehmes@37151
   101
     else if (0 < k \<and> 0 < l) \<or> (k < 0 \<and> 0 < l) then z3div k l
boehmes@37151
   102
     else z3div (-k) (-l))"
boehmes@37151
   103
  by (auto simp add: z3div_def)
boehmes@37151
   104
boehmes@37151
   105
lemma mod_by_z3mod: "k mod l = (
boehmes@37151
   106
     if l = 0 then k
boehmes@37151
   107
     else if k = 0 then 0
boehmes@37151
   108
     else if (0 < k \<and> 0 < l) \<or> (k < 0 \<and> 0 < l) then z3mod k l
boehmes@37151
   109
     else - z3mod (-k) (-l))"
boehmes@37151
   110
  by (auto simp add: z3mod_def)
boehmes@37151
   111
boehmes@37151
   112
boehmes@37151
   113
huffman@36902
   114
subsection {* Setup *}
boehmes@36898
   115
boehmes@36898
   116
use "Tools/SMT/smt_monomorph.ML"
boehmes@36898
   117
use "Tools/SMT/smt_normalize.ML"
boehmes@36898
   118
use "Tools/SMT/smt_translate.ML"
boehmes@36898
   119
use "Tools/SMT/smt_solver.ML"
boehmes@36898
   120
use "Tools/SMT/smtlib_interface.ML"
boehmes@36898
   121
use "Tools/SMT/z3_interface.ML"
boehmes@36898
   122
use "Tools/SMT/z3_proof_parser.ML"
boehmes@36898
   123
use "Tools/SMT/z3_proof_tools.ML"
boehmes@36898
   124
use "Tools/SMT/z3_proof_literals.ML"
boehmes@36898
   125
use "Tools/SMT/z3_proof_reconstruction.ML"
boehmes@36898
   126
use "Tools/SMT/z3_model.ML"
boehmes@36898
   127
use "Tools/SMT/z3_solver.ML"
boehmes@36898
   128
use "Tools/SMT/cvc3_solver.ML"
boehmes@36898
   129
use "Tools/SMT/yices_solver.ML"
boehmes@36898
   130
boehmes@36898
   131
setup {*
boehmes@36898
   132
  SMT_Solver.setup #>
boehmes@36898
   133
  Z3_Proof_Reconstruction.setup #>
boehmes@36898
   134
  Z3_Solver.setup #>
boehmes@36898
   135
  CVC3_Solver.setup #>
boehmes@36898
   136
  Yices_Solver.setup
boehmes@36898
   137
*}
boehmes@36898
   138
boehmes@36898
   139
boehmes@36898
   140
huffman@36902
   141
subsection {* Configuration *}
boehmes@36898
   142
boehmes@36898
   143
text {*
boehmes@36899
   144
The current configuration can be printed by the command
boehmes@36899
   145
@{text smt_status}, which shows the values of most options.
boehmes@36898
   146
*}
boehmes@36898
   147
boehmes@36898
   148
boehmes@36898
   149
boehmes@36898
   150
subsection {* General configuration options *}
boehmes@36898
   151
boehmes@36898
   152
text {*
boehmes@36898
   153
The option @{text smt_solver} can be used to change the target SMT
boehmes@36898
   154
solver.  The possible values are @{text cvc3}, @{text yices}, and
boehmes@36898
   155
@{text z3}.  It is advisable to locally install the selected solver,
boehmes@36898
   156
although this is not necessary for @{text cvc3} and @{text z3}, which
boehmes@36898
   157
can also be used over an Internet-based service.
boehmes@36898
   158
boehmes@36898
   159
When using local SMT solvers, the path to their binaries should be
boehmes@36898
   160
declared by setting the following environment variables:
boehmes@36898
   161
@{text CVC3_SOLVER}, @{text YICES_SOLVER}, and @{text Z3_SOLVER}.
boehmes@36898
   162
*}
boehmes@36898
   163
boehmes@36898
   164
declare [[ smt_solver = z3 ]]
boehmes@36898
   165
boehmes@36898
   166
text {*
boehmes@36898
   167
Since SMT solvers are potentially non-terminating, there is a timeout
boehmes@36898
   168
(given in seconds) to restrict their runtime.  A value greater than
boehmes@36898
   169
120 (seconds) is in most cases not advisable.
boehmes@36898
   170
*}
boehmes@36898
   171
boehmes@36898
   172
declare [[ smt_timeout = 20 ]]
boehmes@36898
   173
boehmes@36898
   174
boehmes@36898
   175
boehmes@36898
   176
subsection {* Certificates *}
boehmes@36898
   177
boehmes@36898
   178
text {*
boehmes@36898
   179
By setting the option @{text smt_certificates} to the name of a file,
boehmes@36898
   180
all following applications of an SMT solver a cached in that file.
boehmes@36898
   181
Any further application of the same SMT solver (using the very same
boehmes@36898
   182
configuration) re-uses the cached certificate instead of invoking the
boehmes@36898
   183
solver.  An empty string disables caching certificates.
boehmes@36898
   184
boehmes@36898
   185
The filename should be given as an explicit path.  It is good
boehmes@36898
   186
practice to use the name of the current theory (with ending
boehmes@36898
   187
@{text ".certs"} instead of @{text ".thy"}) as the certificates file.
boehmes@36898
   188
*}
boehmes@36898
   189
boehmes@36898
   190
declare [[ smt_certificates = "" ]]
boehmes@36898
   191
boehmes@36898
   192
text {*
boehmes@36898
   193
The option @{text smt_fixed} controls whether only stored
boehmes@36898
   194
certificates are should be used or invocation of an SMT solver is
boehmes@36898
   195
allowed.  When set to @{text true}, no SMT solver will ever be
boehmes@36898
   196
invoked and only the existing certificates found in the configured
boehmes@36898
   197
cache are used;  when set to @{text false} and there is no cached
boehmes@36898
   198
certificate for some proposition, then the configured SMT solver is
boehmes@36898
   199
invoked.
boehmes@36898
   200
*}
boehmes@36898
   201
boehmes@36898
   202
declare [[ smt_fixed = false ]]
boehmes@36898
   203
boehmes@36898
   204
boehmes@36898
   205
boehmes@36898
   206
subsection {* Tracing *}
boehmes@36898
   207
boehmes@36898
   208
text {*
boehmes@36898
   209
For tracing the generated problem file given to the SMT solver as
boehmes@36898
   210
well as the returned result of the solver, the option
boehmes@36898
   211
@{text smt_trace} should be set to @{text true}.
boehmes@36898
   212
*}
boehmes@36898
   213
boehmes@36898
   214
declare [[ smt_trace = false ]]
boehmes@36898
   215
boehmes@36898
   216
boehmes@36898
   217
boehmes@36898
   218
subsection {* Z3-specific options *}
boehmes@36898
   219
boehmes@36898
   220
text {*
boehmes@36898
   221
Z3 is the only SMT solver whose proofs are checked (or reconstructed)
boehmes@36898
   222
in Isabelle (all other solvers are implemented as oracles).  Enabling
boehmes@36898
   223
or disabling proof reconstruction for Z3 is controlled by the option
boehmes@36898
   224
@{text z3_proofs}. 
boehmes@36898
   225
*}
boehmes@36898
   226
boehmes@36898
   227
declare [[ z3_proofs = true ]]
boehmes@36898
   228
boehmes@36898
   229
text {*
boehmes@36898
   230
From the set of assumptions given to Z3, those assumptions used in
boehmes@36898
   231
the proof are traced when the option @{text z3_trace_assms} is set to
boehmes@36898
   232
@{term true}.
boehmes@36898
   233
*}
boehmes@36898
   234
boehmes@36898
   235
declare [[ z3_trace_assms = false ]]
boehmes@36898
   236
boehmes@36898
   237
text {*
boehmes@36898
   238
Z3 provides several commandline options to tweak its behaviour.  They
boehmes@36898
   239
can be configured by writing them literally as value for the option
boehmes@36898
   240
@{text z3_options}.
boehmes@36898
   241
*}
boehmes@36898
   242
boehmes@36898
   243
declare [[ z3_options = "" ]]
boehmes@36898
   244
boehmes@39298
   245
text {*
boehmes@39298
   246
The following configuration option may be used to enable mapping of
boehmes@39298
   247
HOL datatypes and records to native datatypes provided by Z3.
boehmes@39298
   248
*}
boehmes@39298
   249
boehmes@39298
   250
declare [[ z3_datatypes = false ]]
boehmes@39298
   251
boehmes@36898
   252
boehmes@36898
   253
huffman@36902
   254
subsection {* Schematic rules for Z3 proof reconstruction *}
boehmes@36898
   255
boehmes@36898
   256
text {*
boehmes@36898
   257
Several prof rules of Z3 are not very well documented.  There are two
boehmes@36898
   258
lemma groups which can turn failing Z3 proof reconstruction attempts
boehmes@36898
   259
into succeeding ones: the facts in @{text z3_rule} are tried prior to
boehmes@36898
   260
any implemented reconstruction procedure for all uncertain Z3 proof
boehmes@36898
   261
rules;  the facts in @{text z3_simp} are only fed to invocations of
boehmes@36898
   262
the simplifier when reconstructing theory-specific proof steps.
boehmes@36898
   263
*}
boehmes@36898
   264
boehmes@36898
   265
lemmas [z3_rule] =
boehmes@36898
   266
  refl eq_commute conj_commute disj_commute simp_thms nnf_simps
boehmes@36898
   267
  ring_distribs field_simps times_divide_eq_right times_divide_eq_left
boehmes@36898
   268
  if_True if_False not_not
boehmes@36898
   269
boehmes@36898
   270
lemma [z3_rule]:
boehmes@36898
   271
  "(P \<longrightarrow> Q) = (Q \<or> \<not>P)"
boehmes@36898
   272
  "(\<not>P \<longrightarrow> Q) = (P \<or> Q)"
boehmes@36898
   273
  "(\<not>P \<longrightarrow> Q) = (Q \<or> P)"
boehmes@36898
   274
  by auto
boehmes@36898
   275
boehmes@36898
   276
lemma [z3_rule]:
boehmes@36898
   277
  "((P = Q) \<longrightarrow> R) = (R | (Q = (\<not>P)))"
boehmes@36898
   278
  by auto
boehmes@36898
   279
boehmes@36898
   280
lemma [z3_rule]:
boehmes@36898
   281
  "((\<not>P) = P) = False"
boehmes@36898
   282
  "(P = (\<not>P)) = False"
boehmes@36898
   283
  "(P \<noteq> Q) = (Q = (\<not>P))"
boehmes@36898
   284
  "(P = Q) = ((\<not>P \<or> Q) \<and> (P \<or> \<not>Q))"
boehmes@36898
   285
  "(P \<noteq> Q) = ((\<not>P \<or> \<not>Q) \<and> (P \<or> Q))"
boehmes@36898
   286
  by auto
boehmes@36898
   287
boehmes@36898
   288
lemma [z3_rule]:
boehmes@36898
   289
  "(if P then P else \<not>P) = True"
boehmes@36898
   290
  "(if \<not>P then \<not>P else P) = True"
boehmes@36898
   291
  "(if P then True else False) = P"
boehmes@36898
   292
  "(if P then False else True) = (\<not>P)"
boehmes@36898
   293
  "(if \<not>P then x else y) = (if P then y else x)"
boehmes@36898
   294
  by auto
boehmes@36898
   295
boehmes@36898
   296
lemma [z3_rule]:
boehmes@36898
   297
  "P = Q \<or> P \<or> Q"
boehmes@36898
   298
  "P = Q \<or> \<not>P \<or> \<not>Q"
boehmes@36898
   299
  "(\<not>P) = Q \<or> \<not>P \<or> Q"
boehmes@36898
   300
  "(\<not>P) = Q \<or> P \<or> \<not>Q"
boehmes@36898
   301
  "P = (\<not>Q) \<or> \<not>P \<or> Q"
boehmes@36898
   302
  "P = (\<not>Q) \<or> P \<or> \<not>Q"
boehmes@36898
   303
  "P \<noteq> Q \<or> P \<or> \<not>Q"
boehmes@36898
   304
  "P \<noteq> Q \<or> \<not>P \<or> Q"
boehmes@36898
   305
  "P \<noteq> (\<not>Q) \<or> P \<or> Q"
boehmes@36898
   306
  "(\<not>P) \<noteq> Q \<or> P \<or> Q"
boehmes@36898
   307
  "P \<or> Q \<or> P \<noteq> (\<not>Q)"
boehmes@36898
   308
  "P \<or> Q \<or> (\<not>P) \<noteq> Q"
boehmes@36898
   309
  "P \<or> \<not>Q \<or> P \<noteq> Q"
boehmes@36898
   310
  "\<not>P \<or> Q \<or> P \<noteq> Q"
boehmes@36898
   311
  by auto
boehmes@36898
   312
boehmes@36898
   313
lemma [z3_rule]:
boehmes@36898
   314
  "0 + (x::int) = x"
boehmes@36898
   315
  "x + 0 = x"
boehmes@36898
   316
  "0 * x = 0"
boehmes@36898
   317
  "1 * x = x"
boehmes@36898
   318
  "x + y = y + x"
boehmes@36898
   319
  by auto
boehmes@36898
   320
boehmes@37124
   321
boehmes@37124
   322
boehmes@37124
   323
hide_type (open) pattern
boehmes@37153
   324
hide_const Pattern term_eq
boehmes@37153
   325
hide_const (open) trigger pat nopat fun_app z3div z3mod
boehmes@37124
   326
boehmes@39483
   327
boehmes@39483
   328
boehmes@39483
   329
subsection {* Selectors for datatypes *}
boehmes@39483
   330
boehmes@39483
   331
setup {* Datatype_Selectors.setup *}
boehmes@39483
   332
boehmes@39483
   333
declare [[ selector Pair 1 = fst, selector Pair 2 = snd ]]
boehmes@39483
   334
declare [[ selector Cons 1 = hd, selector Cons 2 = tl ]]
boehmes@39483
   335
boehmes@36898
   336
end