src/HOL/SMT.thy
 author wenzelm Tue Sep 26 20:54:40 2017 +0200 (22 months ago) changeset 66695 91500c024c7f parent 66559 beb48215cda7 child 66817 0b12755ccbb2 permissions -rw-r--r--
tuned;
```     1 (*  Title:      HOL/SMT.thy
```
```     2     Author:     Sascha Boehme, TU Muenchen
```
```     3     Author:     Jasmin Blanchette, VU Amsterdam
```
```     4 *)
```
```     5
```
```     6 section \<open>Bindings to Satisfiability Modulo Theories (SMT) solvers based on SMT-LIB 2\<close>
```
```     7
```
```     8 theory SMT
```
```     9   imports Divides
```
```    10   keywords "smt_status" :: diag
```
```    11 begin
```
```    12
```
```    13 subsection \<open>A skolemization tactic and proof method\<close>
```
```    14
```
```    15 lemma choices:
```
```    16   "\<And>Q. \<forall>x. \<exists>y ya. Q x y ya \<Longrightarrow> \<exists>f fa. \<forall>x. Q x (f x) (fa x)"
```
```    17   "\<And>Q. \<forall>x. \<exists>y ya yb. Q x y ya yb \<Longrightarrow> \<exists>f fa fb. \<forall>x. Q x (f x) (fa x) (fb x)"
```
```    18   "\<And>Q. \<forall>x. \<exists>y ya yb yc. Q x y ya yb yc \<Longrightarrow> \<exists>f fa fb fc. \<forall>x. Q x (f x) (fa x) (fb x) (fc x)"
```
```    19   "\<And>Q. \<forall>x. \<exists>y ya yb yc yd. Q x y ya yb yc yd \<Longrightarrow>
```
```    20      \<exists>f fa fb fc fd. \<forall>x. Q x (f x) (fa x) (fb x) (fc x) (fd x)"
```
```    21   "\<And>Q. \<forall>x. \<exists>y ya yb yc yd ye. Q x y ya yb yc yd ye \<Longrightarrow>
```
```    22      \<exists>f fa fb fc fd fe. \<forall>x. Q x (f x) (fa x) (fb x) (fc x) (fd x) (fe x)"
```
```    23   "\<And>Q. \<forall>x. \<exists>y ya yb yc yd ye yf. Q x y ya yb yc yd ye yf \<Longrightarrow>
```
```    24      \<exists>f fa fb fc fd fe ff. \<forall>x. Q x (f x) (fa x) (fb x) (fc x) (fd x) (fe x) (ff x)"
```
```    25   "\<And>Q. \<forall>x. \<exists>y ya yb yc yd ye yf yg. Q x y ya yb yc yd ye yf yg \<Longrightarrow>
```
```    26      \<exists>f fa fb fc fd fe ff fg. \<forall>x. Q x (f x) (fa x) (fb x) (fc x) (fd x) (fe x) (ff x) (fg x)"
```
```    27   by metis+
```
```    28
```
```    29 lemma bchoices:
```
```    30   "\<And>Q. \<forall>x \<in> S. \<exists>y ya. Q x y ya \<Longrightarrow> \<exists>f fa. \<forall>x \<in> S. Q x (f x) (fa x)"
```
```    31   "\<And>Q. \<forall>x \<in> S. \<exists>y ya yb. Q x y ya yb \<Longrightarrow> \<exists>f fa fb. \<forall>x \<in> S. Q x (f x) (fa x) (fb x)"
```
```    32   "\<And>Q. \<forall>x \<in> S. \<exists>y ya yb yc. Q x y ya yb yc \<Longrightarrow> \<exists>f fa fb fc. \<forall>x \<in> S. Q x (f x) (fa x) (fb x) (fc x)"
```
```    33   "\<And>Q. \<forall>x \<in> S. \<exists>y ya yb yc yd. Q x y ya yb yc yd \<Longrightarrow>
```
```    34     \<exists>f fa fb fc fd. \<forall>x \<in> S. Q x (f x) (fa x) (fb x) (fc x) (fd x)"
```
```    35   "\<And>Q. \<forall>x \<in> S. \<exists>y ya yb yc yd ye. Q x y ya yb yc yd ye \<Longrightarrow>
```
```    36     \<exists>f fa fb fc fd fe. \<forall>x \<in> S. Q x (f x) (fa x) (fb x) (fc x) (fd x) (fe x)"
```
```    37   "\<And>Q. \<forall>x \<in> S. \<exists>y ya yb yc yd ye yf. Q x y ya yb yc yd ye yf \<Longrightarrow>
```
```    38     \<exists>f fa fb fc fd fe ff. \<forall>x \<in> S. Q x (f x) (fa x) (fb x) (fc x) (fd x) (fe x) (ff x)"
```
```    39   "\<And>Q. \<forall>x \<in> S. \<exists>y ya yb yc yd ye yf yg. Q x y ya yb yc yd ye yf yg \<Longrightarrow>
```
```    40     \<exists>f fa fb fc fd fe ff fg. \<forall>x \<in> S. Q x (f x) (fa x) (fb x) (fc x) (fd x) (fe x) (ff x) (fg x)"
```
```    41   by metis+
```
```    42
```
```    43 ML \<open>
```
```    44 fun moura_tac ctxt =
```
```    45   Atomize_Elim.atomize_elim_tac ctxt THEN'
```
```    46   SELECT_GOAL (Clasimp.auto_tac (ctxt addSIs @{thms choice choices bchoice bchoices}) THEN
```
```    47     ALLGOALS (Metis_Tactic.metis_tac (take 1 ATP_Proof_Reconstruct.partial_type_encs)
```
```    48         ATP_Proof_Reconstruct.default_metis_lam_trans ctxt [] ORELSE'
```
```    49       blast_tac ctxt))
```
```    50 \<close>
```
```    51
```
```    52 method_setup moura = \<open>
```
```    53   Scan.succeed (SIMPLE_METHOD' o moura_tac)
```
```    54 \<close> "solve skolemization goals, especially those arising from Z3 proofs"
```
```    55
```
```    56 hide_fact (open) choices bchoices
```
```    57
```
```    58
```
```    59 subsection \<open>Triggers for quantifier instantiation\<close>
```
```    60
```
```    61 text \<open>
```
```    62 Some SMT solvers support patterns as a quantifier instantiation
```
```    63 heuristics. Patterns may either be positive terms (tagged by "pat")
```
```    64 triggering quantifier instantiations -- when the solver finds a
```
```    65 term matching a positive pattern, it instantiates the corresponding
```
```    66 quantifier accordingly -- or negative terms (tagged by "nopat")
```
```    67 inhibiting quantifier instantiations. A list of patterns
```
```    68 of the same kind is called a multipattern, and all patterns in a
```
```    69 multipattern are considered conjunctively for quantifier instantiation.
```
```    70 A list of multipatterns is called a trigger, and their multipatterns
```
```    71 act disjunctively during quantifier instantiation. Each multipattern
```
```    72 should mention at least all quantified variables of the preceding
```
```    73 quantifier block.
```
```    74 \<close>
```
```    75
```
```    76 typedecl 'a symb_list
```
```    77
```
```    78 consts
```
```    79   Symb_Nil :: "'a symb_list"
```
```    80   Symb_Cons :: "'a \<Rightarrow> 'a symb_list \<Rightarrow> 'a symb_list"
```
```    81
```
```    82 typedecl pattern
```
```    83
```
```    84 consts
```
```    85   pat :: "'a \<Rightarrow> pattern"
```
```    86   nopat :: "'a \<Rightarrow> pattern"
```
```    87
```
```    88 definition trigger :: "pattern symb_list symb_list \<Rightarrow> bool \<Rightarrow> bool" where
```
```    89   "trigger _ P = P"
```
```    90
```
```    91
```
```    92 subsection \<open>Higher-order encoding\<close>
```
```    93
```
```    94 text \<open>
```
```    95 Application is made explicit for constants occurring with varying
```
```    96 numbers of arguments. This is achieved by the introduction of the
```
```    97 following constant.
```
```    98 \<close>
```
```    99
```
```   100 definition fun_app :: "'a \<Rightarrow> 'a" where "fun_app f = f"
```
```   101
```
```   102 text \<open>
```
```   103 Some solvers support a theory of arrays which can be used to encode
```
```   104 higher-order functions. The following set of lemmas specifies the
```
```   105 properties of such (extensional) arrays.
```
```   106 \<close>
```
```   107
```
```   108 lemmas array_rules = ext fun_upd_apply fun_upd_same fun_upd_other  fun_upd_upd fun_app_def
```
```   109
```
```   110
```
```   111 subsection \<open>Normalization\<close>
```
```   112
```
```   113 lemma case_bool_if[abs_def]: "case_bool x y P = (if P then x else y)"
```
```   114   by simp
```
```   115
```
```   116 lemmas Ex1_def_raw = Ex1_def[abs_def]
```
```   117 lemmas Ball_def_raw = Ball_def[abs_def]
```
```   118 lemmas Bex_def_raw = Bex_def[abs_def]
```
```   119 lemmas abs_if_raw = abs_if[abs_def]
```
```   120 lemmas min_def_raw = min_def[abs_def]
```
```   121 lemmas max_def_raw = max_def[abs_def]
```
```   122
```
```   123 lemma nat_int': "\<forall>n. nat (int n) = n" by simp
```
```   124 lemma int_nat_nneg: "\<forall>i. i \<ge> 0 \<longrightarrow> int (nat i) = i" by simp
```
```   125 lemma int_nat_neg: "\<forall>i. i < 0 \<longrightarrow> int (nat i) = 0" by simp
```
```   126
```
```   127 lemmas nat_zero_as_int = transfer_nat_int_numerals(1)
```
```   128 lemmas nat_one_as_int = transfer_nat_int_numerals(2)
```
```   129 lemma nat_numeral_as_int: "numeral = (\<lambda>i. nat (numeral i))" by simp
```
```   130 lemma nat_less_as_int: "op < = (\<lambda>a b. int a < int b)" by simp
```
```   131 lemma nat_leq_as_int: "op \<le> = (\<lambda>a b. int a \<le> int b)" by simp
```
```   132 lemma Suc_as_int: "Suc = (\<lambda>a. nat (int a + 1))" by (rule ext) simp
```
```   133 lemma nat_plus_as_int: "op + = (\<lambda>a b. nat (int a + int b))" by (rule ext)+ simp
```
```   134 lemma nat_minus_as_int: "op - = (\<lambda>a b. nat (int a - int b))" by (rule ext)+ simp
```
```   135 lemma nat_times_as_int: "op * = (\<lambda>a b. nat (int a * int b))" by (simp add: nat_mult_distrib)
```
```   136 lemma nat_div_as_int: "op div = (\<lambda>a b. nat (int a div int b))" by (simp add: nat_div_distrib)
```
```   137 lemma nat_mod_as_int: "op mod = (\<lambda>a b. nat (int a mod int b))" by (simp add: nat_mod_distrib)
```
```   138
```
```   139 lemma int_Suc: "int (Suc n) = int n + 1" by simp
```
```   140 lemma int_plus: "int (n + m) = int n + int m" by (rule of_nat_add)
```
```   141 lemma int_minus: "int (n - m) = int (nat (int n - int m))" by auto
```
```   142
```
```   143
```
```   144 subsection \<open>Integer division and modulo for Z3\<close>
```
```   145
```
```   146 text \<open>
```
```   147 The following Z3-inspired definitions are overspecified for the case where \<open>l = 0\<close>. This
```
```   148 Schönheitsfehler is corrected in the \<open>div_as_z3div\<close> and \<open>mod_as_z3mod\<close> theorems.
```
```   149 \<close>
```
```   150
```
```   151 definition z3div :: "int \<Rightarrow> int \<Rightarrow> int" where
```
```   152   "z3div k l = (if l \<ge> 0 then k div l else - (k div - l))"
```
```   153
```
```   154 definition z3mod :: "int \<Rightarrow> int \<Rightarrow> int" where
```
```   155   "z3mod k l = k mod (if l \<ge> 0 then l else - l)"
```
```   156
```
```   157 lemma div_as_z3div:
```
```   158   "\<forall>k l. k div l = (if l = 0 then 0 else if l > 0 then z3div k l else z3div (- k) (- l))"
```
```   159   by (simp add: z3div_def)
```
```   160
```
```   161 lemma mod_as_z3mod:
```
```   162   "\<forall>k l. k mod l = (if l = 0 then k else if l > 0 then z3mod k l else - z3mod (- k) (- l))"
```
```   163   by (simp add: z3mod_def)
```
```   164
```
```   165
```
```   166 subsection \<open>Setup\<close>
```
```   167
```
```   168 ML_file "Tools/SMT/smt_util.ML"
```
```   169 ML_file "Tools/SMT/smt_failure.ML"
```
```   170 ML_file "Tools/SMT/smt_config.ML"
```
```   171 ML_file "Tools/SMT/smt_builtin.ML"
```
```   172 ML_file "Tools/SMT/smt_datatypes.ML"
```
```   173 ML_file "Tools/SMT/smt_normalize.ML"
```
```   174 ML_file "Tools/SMT/smt_translate.ML"
```
```   175 ML_file "Tools/SMT/smtlib.ML"
```
```   176 ML_file "Tools/SMT/smtlib_interface.ML"
```
```   177 ML_file "Tools/SMT/smtlib_proof.ML"
```
```   178 ML_file "Tools/SMT/smtlib_isar.ML"
```
```   179 ML_file "Tools/SMT/z3_proof.ML"
```
```   180 ML_file "Tools/SMT/z3_isar.ML"
```
```   181 ML_file "Tools/SMT/smt_solver.ML"
```
```   182 ML_file "Tools/SMT/cvc4_interface.ML"
```
```   183 ML_file "Tools/SMT/cvc4_proof_parse.ML"
```
```   184 ML_file "Tools/SMT/verit_proof.ML"
```
```   185 ML_file "Tools/SMT/verit_isar.ML"
```
```   186 ML_file "Tools/SMT/verit_proof_parse.ML"
```
```   187 ML_file "Tools/SMT/conj_disj_perm.ML"
```
```   188 ML_file "Tools/SMT/z3_interface.ML"
```
```   189 ML_file "Tools/SMT/z3_replay_util.ML"
```
```   190 ML_file "Tools/SMT/z3_replay_rules.ML"
```
```   191 ML_file "Tools/SMT/z3_replay_methods.ML"
```
```   192 ML_file "Tools/SMT/z3_replay.ML"
```
```   193 ML_file "Tools/SMT/smt_systems.ML"
```
```   194
```
```   195 method_setup smt = \<open>
```
```   196   Scan.optional Attrib.thms [] >>
```
```   197     (fn thms => fn ctxt =>
```
```   198       METHOD (fn facts => HEADGOAL (SMT_Solver.smt_tac ctxt (thms @ facts))))
```
```   199 \<close> "apply an SMT solver to the current goal"
```
```   200
```
```   201
```
```   202 subsection \<open>Configuration\<close>
```
```   203
```
```   204 text \<open>
```
```   205 The current configuration can be printed by the command
```
```   206 \<open>smt_status\<close>, which shows the values of most options.
```
```   207 \<close>
```
```   208
```
```   209
```
```   210 subsection \<open>General configuration options\<close>
```
```   211
```
```   212 text \<open>
```
```   213 The option \<open>smt_solver\<close> can be used to change the target SMT
```
```   214 solver. The possible values can be obtained from the \<open>smt_status\<close>
```
```   215 command.
```
```   216 \<close>
```
```   217
```
```   218 declare [[smt_solver = z3]]
```
```   219
```
```   220 text \<open>
```
```   221 Since SMT solvers are potentially nonterminating, there is a timeout
```
```   222 (given in seconds) to restrict their runtime.
```
```   223 \<close>
```
```   224
```
```   225 declare [[smt_timeout = 20]]
```
```   226
```
```   227 text \<open>
```
```   228 SMT solvers apply randomized heuristics. In case a problem is not
```
```   229 solvable by an SMT solver, changing the following option might help.
```
```   230 \<close>
```
```   231
```
```   232 declare [[smt_random_seed = 1]]
```
```   233
```
```   234 text \<open>
```
```   235 In general, the binding to SMT solvers runs as an oracle, i.e, the SMT
```
```   236 solvers are fully trusted without additional checks. The following
```
```   237 option can cause the SMT solver to run in proof-producing mode, giving
```
```   238 a checkable certificate. This is currently only implemented for Z3.
```
```   239 \<close>
```
```   240
```
```   241 declare [[smt_oracle = false]]
```
```   242
```
```   243 text \<open>
```
```   244 Each SMT solver provides several commandline options to tweak its
```
```   245 behaviour. They can be passed to the solver by setting the following
```
```   246 options.
```
```   247 \<close>
```
```   248
```
```   249 declare [[cvc3_options = ""]]
```
```   250 declare [[cvc4_options = "--full-saturate-quant --inst-when=full-last-call --inst-no-entail --term-db-mode=relevant --multi-trigger-linear"]]
```
```   251 declare [[verit_options = "--index-sorts --index-fresh-sorts"]]
```
```   252 declare [[z3_options = ""]]
```
```   253
```
```   254 text \<open>
```
```   255 The SMT method provides an inference mechanism to detect simple triggers
```
```   256 in quantified formulas, which might increase the number of problems
```
```   257 solvable by SMT solvers (note: triggers guide quantifier instantiations
```
```   258 in the SMT solver). To turn it on, set the following option.
```
```   259 \<close>
```
```   260
```
```   261 declare [[smt_infer_triggers = false]]
```
```   262
```
```   263 text \<open>
```
```   264 Enable the following option to use built-in support for datatypes,
```
```   265 codatatypes, and records in CVC4. Currently, this is implemented only
```
```   266 in oracle mode.
```
```   267 \<close>
```
```   268
```
```   269 declare [[cvc4_extensions = false]]
```
```   270
```
```   271 text \<open>
```
```   272 Enable the following option to use built-in support for div/mod, datatypes,
```
```   273 and records in Z3. Currently, this is implemented only in oracle mode.
```
```   274 \<close>
```
```   275
```
```   276 declare [[z3_extensions = false]]
```
```   277
```
```   278
```
```   279 subsection \<open>Certificates\<close>
```
```   280
```
```   281 text \<open>
```
```   282 By setting the option \<open>smt_certificates\<close> to the name of a file,
```
```   283 all following applications of an SMT solver a cached in that file.
```
```   284 Any further application of the same SMT solver (using the very same
```
```   285 configuration) re-uses the cached certificate instead of invoking the
```
```   286 solver. An empty string disables caching certificates.
```
```   287
```
```   288 The filename should be given as an explicit path. It is good
```
```   289 practice to use the name of the current theory (with ending
```
```   290 \<open>.certs\<close> instead of \<open>.thy\<close>) as the certificates file.
```
```   291 Certificate files should be used at most once in a certain theory context,
```
```   292 to avoid race conditions with other concurrent accesses.
```
```   293 \<close>
```
```   294
```
```   295 declare [[smt_certificates = ""]]
```
```   296
```
```   297 text \<open>
```
```   298 The option \<open>smt_read_only_certificates\<close> controls whether only
```
```   299 stored certificates are should be used or invocation of an SMT solver
```
```   300 is allowed. When set to \<open>true\<close>, no SMT solver will ever be
```
```   301 invoked and only the existing certificates found in the configured
```
```   302 cache are used;  when set to \<open>false\<close> and there is no cached
```
```   303 certificate for some proposition, then the configured SMT solver is
```
```   304 invoked.
```
```   305 \<close>
```
```   306
```
```   307 declare [[smt_read_only_certificates = false]]
```
```   308
```
```   309
```
```   310 subsection \<open>Tracing\<close>
```
```   311
```
```   312 text \<open>
```
```   313 The SMT method, when applied, traces important information. To
```
```   314 make it entirely silent, set the following option to \<open>false\<close>.
```
```   315 \<close>
```
```   316
```
```   317 declare [[smt_verbose = true]]
```
```   318
```
```   319 text \<open>
```
```   320 For tracing the generated problem file given to the SMT solver as
```
```   321 well as the returned result of the solver, the option
```
```   322 \<open>smt_trace\<close> should be set to \<open>true\<close>.
```
```   323 \<close>
```
```   324
```
```   325 declare [[smt_trace = false]]
```
```   326
```
```   327
```
```   328 subsection \<open>Schematic rules for Z3 proof reconstruction\<close>
```
```   329
```
```   330 text \<open>
```
```   331 Several prof rules of Z3 are not very well documented. There are two
```
```   332 lemma groups which can turn failing Z3 proof reconstruction attempts
```
```   333 into succeeding ones: the facts in \<open>z3_rule\<close> are tried prior to
```
```   334 any implemented reconstruction procedure for all uncertain Z3 proof
```
```   335 rules;  the facts in \<open>z3_simp\<close> are only fed to invocations of
```
```   336 the simplifier when reconstructing theory-specific proof steps.
```
```   337 \<close>
```
```   338
```
```   339 lemmas [z3_rule] =
```
```   340   refl eq_commute conj_commute disj_commute simp_thms nnf_simps
```
```   341   ring_distribs field_simps times_divide_eq_right times_divide_eq_left
```
```   342   if_True if_False not_not
```
```   343   NO_MATCH_def
```
```   344
```
```   345 lemma [z3_rule]:
```
```   346   "(P \<and> Q) = (\<not> (\<not> P \<or> \<not> Q))"
```
```   347   "(P \<and> Q) = (\<not> (\<not> Q \<or> \<not> P))"
```
```   348   "(\<not> P \<and> Q) = (\<not> (P \<or> \<not> Q))"
```
```   349   "(\<not> P \<and> Q) = (\<not> (\<not> Q \<or> P))"
```
```   350   "(P \<and> \<not> Q) = (\<not> (\<not> P \<or> Q))"
```
```   351   "(P \<and> \<not> Q) = (\<not> (Q \<or> \<not> P))"
```
```   352   "(\<not> P \<and> \<not> Q) = (\<not> (P \<or> Q))"
```
```   353   "(\<not> P \<and> \<not> Q) = (\<not> (Q \<or> P))"
```
```   354   by auto
```
```   355
```
```   356 lemma [z3_rule]:
```
```   357   "(P \<longrightarrow> Q) = (Q \<or> \<not> P)"
```
```   358   "(\<not> P \<longrightarrow> Q) = (P \<or> Q)"
```
```   359   "(\<not> P \<longrightarrow> Q) = (Q \<or> P)"
```
```   360   "(True \<longrightarrow> P) = P"
```
```   361   "(P \<longrightarrow> True) = True"
```
```   362   "(False \<longrightarrow> P) = True"
```
```   363   "(P \<longrightarrow> P) = True"
```
```   364   "(\<not> (A \<longleftrightarrow> \<not> B)) \<longleftrightarrow> (A \<longleftrightarrow> B)"
```
```   365   by auto
```
```   366
```
```   367 lemma [z3_rule]:
```
```   368   "((P = Q) \<longrightarrow> R) = (R | (Q = (\<not> P)))"
```
```   369   by auto
```
```   370
```
```   371 lemma [z3_rule]:
```
```   372   "(\<not> True) = False"
```
```   373   "(\<not> False) = True"
```
```   374   "(x = x) = True"
```
```   375   "(P = True) = P"
```
```   376   "(True = P) = P"
```
```   377   "(P = False) = (\<not> P)"
```
```   378   "(False = P) = (\<not> P)"
```
```   379   "((\<not> P) = P) = False"
```
```   380   "(P = (\<not> P)) = False"
```
```   381   "((\<not> P) = (\<not> Q)) = (P = Q)"
```
```   382   "\<not> (P = (\<not> Q)) = (P = Q)"
```
```   383   "\<not> ((\<not> P) = Q) = (P = Q)"
```
```   384   "(P \<noteq> Q) = (Q = (\<not> P))"
```
```   385   "(P = Q) = ((\<not> P \<or> Q) \<and> (P \<or> \<not> Q))"
```
```   386   "(P \<noteq> Q) = ((\<not> P \<or> \<not> Q) \<and> (P \<or> Q))"
```
```   387   by auto
```
```   388
```
```   389 lemma [z3_rule]:
```
```   390   "(if P then P else \<not> P) = True"
```
```   391   "(if \<not> P then \<not> P else P) = True"
```
```   392   "(if P then True else False) = P"
```
```   393   "(if P then False else True) = (\<not> P)"
```
```   394   "(if P then Q else True) = ((\<not> P) \<or> Q)"
```
```   395   "(if P then Q else True) = (Q \<or> (\<not> P))"
```
```   396   "(if P then Q else \<not> Q) = (P = Q)"
```
```   397   "(if P then Q else \<not> Q) = (Q = P)"
```
```   398   "(if P then \<not> Q else Q) = (P = (\<not> Q))"
```
```   399   "(if P then \<not> Q else Q) = ((\<not> Q) = P)"
```
```   400   "(if \<not> P then x else y) = (if P then y else x)"
```
```   401   "(if P then (if Q then x else y) else x) = (if P \<and> (\<not> Q) then y else x)"
```
```   402   "(if P then (if Q then x else y) else x) = (if (\<not> Q) \<and> P then y else x)"
```
```   403   "(if P then (if Q then x else y) else y) = (if P \<and> Q then x else y)"
```
```   404   "(if P then (if Q then x else y) else y) = (if Q \<and> P then x else y)"
```
```   405   "(if P then x else if P then y else z) = (if P then x else z)"
```
```   406   "(if P then x else if Q then x else y) = (if P \<or> Q then x else y)"
```
```   407   "(if P then x else if Q then x else y) = (if Q \<or> P then x else y)"
```
```   408   "(if P then x = y else x = z) = (x = (if P then y else z))"
```
```   409   "(if P then x = y else y = z) = (y = (if P then x else z))"
```
```   410   "(if P then x = y else z = y) = (y = (if P then x else z))"
```
```   411   by auto
```
```   412
```
```   413 lemma [z3_rule]:
```
```   414   "0 + (x::int) = x"
```
```   415   "x + 0 = x"
```
```   416   "x + x = 2 * x"
```
```   417   "0 * x = 0"
```
```   418   "1 * x = x"
```
```   419   "x + y = y + x"
```
```   420   by (auto simp add: mult_2)
```
```   421
```
```   422 lemma [z3_rule]:  (* for def-axiom *)
```
```   423   "P = Q \<or> P \<or> Q"
```
```   424   "P = Q \<or> \<not> P \<or> \<not> Q"
```
```   425   "(\<not> P) = Q \<or> \<not> P \<or> Q"
```
```   426   "(\<not> P) = Q \<or> P \<or> \<not> Q"
```
```   427   "P = (\<not> Q) \<or> \<not> P \<or> Q"
```
```   428   "P = (\<not> Q) \<or> P \<or> \<not> Q"
```
```   429   "P \<noteq> Q \<or> P \<or> \<not> Q"
```
```   430   "P \<noteq> Q \<or> \<not> P \<or> Q"
```
```   431   "P \<noteq> (\<not> Q) \<or> P \<or> Q"
```
```   432   "(\<not> P) \<noteq> Q \<or> P \<or> Q"
```
```   433   "P \<or> Q \<or> P \<noteq> (\<not> Q)"
```
```   434   "P \<or> Q \<or> (\<not> P) \<noteq> Q"
```
```   435   "P \<or> \<not> Q \<or> P \<noteq> Q"
```
```   436   "\<not> P \<or> Q \<or> P \<noteq> Q"
```
```   437   "P \<or> y = (if P then x else y)"
```
```   438   "P \<or> (if P then x else y) = y"
```
```   439   "\<not> P \<or> x = (if P then x else y)"
```
```   440   "\<not> P \<or> (if P then x else y) = x"
```
```   441   "P \<or> R \<or> \<not> (if P then Q else R)"
```
```   442   "\<not> P \<or> Q \<or> \<not> (if P then Q else R)"
```
```   443   "\<not> (if P then Q else R) \<or> \<not> P \<or> Q"
```
```   444   "\<not> (if P then Q else R) \<or> P \<or> R"
```
```   445   "(if P then Q else R) \<or> \<not> P \<or> \<not> Q"
```
```   446   "(if P then Q else R) \<or> P \<or> \<not> R"
```
```   447   "(if P then \<not> Q else R) \<or> \<not> P \<or> Q"
```
```   448   "(if P then Q else \<not> R) \<or> P \<or> R"
```
```   449   by auto
```
```   450
```
```   451 hide_type (open) symb_list pattern
```
```   452 hide_const (open) Symb_Nil Symb_Cons trigger pat nopat fun_app z3div z3mod
```
```   453
```
```   454 end
```