(* Title: HOL/SMT.thy Author: Sascha Boehme, TU Muenchen Author: Jasmin Blanchette, VU Amsterdam *) section ‹Bindings to Satisfiability Modulo Theories (SMT) solvers based on SMT-LIB 2› theory SMT imports Divides keywords "smt_status" :: diag begin subsection ‹A skolemization tactic and proof method› lemma choices: "⋀Q. ∀x. ∃y ya. Q x y ya ⟹ ∃f fa. ∀x. Q x (f x) (fa x)" "⋀Q. ∀x. ∃y ya yb. Q x y ya yb ⟹ ∃f fa fb. ∀x. Q x (f x) (fa x) (fb x)" "⋀Q. ∀x. ∃y ya yb yc. Q x y ya yb yc ⟹ ∃f fa fb fc. ∀x. Q x (f x) (fa x) (fb x) (fc x)" "⋀Q. ∀x. ∃y ya yb yc yd. Q x y ya yb yc yd ⟹ ∃f fa fb fc fd. ∀x. Q x (f x) (fa x) (fb x) (fc x) (fd x)" "⋀Q. ∀x. ∃y ya yb yc yd ye. Q x y ya yb yc yd ye ⟹ ∃f fa fb fc fd fe. ∀x. Q x (f x) (fa x) (fb x) (fc x) (fd x) (fe x)" "⋀Q. ∀x. ∃y ya yb yc yd ye yf. Q x y ya yb yc yd ye yf ⟹ ∃f fa fb fc fd fe ff. ∀x. Q x (f x) (fa x) (fb x) (fc x) (fd x) (fe x) (ff x)" "⋀Q. ∀x. ∃y ya yb yc yd ye yf yg. Q x y ya yb yc yd ye yf yg ⟹ ∃f fa fb fc fd fe ff fg. ∀x. Q x (f x) (fa x) (fb x) (fc x) (fd x) (fe x) (ff x) (fg x)" by metis+ lemma bchoices: "⋀Q. ∀x ∈ S. ∃y ya. Q x y ya ⟹ ∃f fa. ∀x ∈ S. Q x (f x) (fa x)" "⋀Q. ∀x ∈ S. ∃y ya yb. Q x y ya yb ⟹ ∃f fa fb. ∀x ∈ S. Q x (f x) (fa x) (fb x)" "⋀Q. ∀x ∈ S. ∃y ya yb yc. Q x y ya yb yc ⟹ ∃f fa fb fc. ∀x ∈ S. Q x (f x) (fa x) (fb x) (fc x)" "⋀Q. ∀x ∈ S. ∃y ya yb yc yd. Q x y ya yb yc yd ⟹ ∃f fa fb fc fd. ∀x ∈ S. Q x (f x) (fa x) (fb x) (fc x) (fd x)" "⋀Q. ∀x ∈ S. ∃y ya yb yc yd ye. Q x y ya yb yc yd ye ⟹ ∃f fa fb fc fd fe. ∀x ∈ S. Q x (f x) (fa x) (fb x) (fc x) (fd x) (fe x)" "⋀Q. ∀x ∈ S. ∃y ya yb yc yd ye yf. Q x y ya yb yc yd ye yf ⟹ ∃f fa fb fc fd fe ff. ∀x ∈ S. Q x (f x) (fa x) (fb x) (fc x) (fd x) (fe x) (ff x)" "⋀Q. ∀x ∈ S. ∃y ya yb yc yd ye yf yg. Q x y ya yb yc yd ye yf yg ⟹ ∃f fa fb fc fd fe ff fg. ∀x ∈ S. Q x (f x) (fa x) (fb x) (fc x) (fd x) (fe x) (ff x) (fg x)" by metis+ ML ‹ fun moura_tac ctxt = Atomize_Elim.atomize_elim_tac ctxt THEN' SELECT_GOAL (Clasimp.auto_tac (ctxt addSIs @{thms choice choices bchoice bchoices}) THEN ALLGOALS (Metis_Tactic.metis_tac (take 1 ATP_Proof_Reconstruct.partial_type_encs) ATP_Proof_Reconstruct.default_metis_lam_trans ctxt [] ORELSE' blast_tac ctxt)) › method_setup moura = ‹ Scan.succeed (SIMPLE_METHOD' o moura_tac) › "solve skolemization goals, especially those arising from Z3 proofs" hide_fact (open) choices bchoices subsection ‹Triggers for quantifier instantiation› text ‹ Some SMT solvers support patterns as a quantifier instantiation heuristics. Patterns may either be positive terms (tagged by "pat") triggering quantifier instantiations -- when the solver finds a term matching a positive pattern, it instantiates the corresponding quantifier accordingly -- or negative terms (tagged by "nopat") inhibiting quantifier instantiations. A list of patterns of the same kind is called a multipattern, and all patterns in a multipattern are considered conjunctively for quantifier instantiation. A list of multipatterns is called a trigger, and their multipatterns act disjunctively during quantifier instantiation. Each multipattern should mention at least all quantified variables of the preceding quantifier block. › typedecl 'a symb_list consts Symb_Nil :: "'a symb_list" Symb_Cons :: "'a ⇒ 'a symb_list ⇒ 'a symb_list" typedecl pattern consts pat :: "'a ⇒ pattern" nopat :: "'a ⇒ pattern" definition trigger :: "pattern symb_list symb_list ⇒ bool ⇒ bool" where "trigger _ P = P" subsection ‹Higher-order encoding› text ‹ Application is made explicit for constants occurring with varying numbers of arguments. This is achieved by the introduction of the following constant. › definition fun_app :: "'a ⇒ 'a" where "fun_app f = f" text ‹ Some solvers support a theory of arrays which can be used to encode higher-order functions. The following set of lemmas specifies the properties of such (extensional) arrays. › lemmas array_rules = ext fun_upd_apply fun_upd_same fun_upd_other fun_upd_upd fun_app_def subsection ‹Normalization› lemma case_bool_if[abs_def]: "case_bool x y P = (if P then x else y)" by simp lemmas Ex1_def_raw = Ex1_def[abs_def] lemmas Ball_def_raw = Ball_def[abs_def] lemmas Bex_def_raw = Bex_def[abs_def] lemmas abs_if_raw = abs_if[abs_def] lemmas min_def_raw = min_def[abs_def] lemmas max_def_raw = max_def[abs_def] lemma nat_zero_as_int: "0 = nat 0" by simp lemma nat_one_as_int: "1 = nat 1" by simp lemma nat_numeral_as_int: "numeral = (λi. nat (numeral i))" by simp lemma nat_less_as_int: "(<) = (λa b. int a < int b)" by simp lemma nat_leq_as_int: "(≤) = (λa b. int a ≤ int b)" by simp lemma Suc_as_int: "Suc = (λa. nat (int a + 1))" by (rule ext) simp lemma nat_plus_as_int: "(+) = (λa b. nat (int a + int b))" by (rule ext)+ simp lemma nat_minus_as_int: "(-) = (λa b. nat (int a - int b))" by (rule ext)+ simp lemma nat_times_as_int: "( * ) = (λa b. nat (int a * int b))" by (simp add: nat_mult_distrib) lemma nat_div_as_int: "(div) = (λa b. nat (int a div int b))" by (simp add: nat_div_distrib) lemma nat_mod_as_int: "(mod) = (λa b. nat (int a mod int b))" by (simp add: nat_mod_distrib) lemma int_Suc: "int (Suc n) = int n + 1" by simp lemma int_plus: "int (n + m) = int n + int m" by (rule of_nat_add) lemma int_minus: "int (n - m) = int (nat (int n - int m))" by auto lemma nat_int_comparison: fixes a b :: nat shows "(a = b) = (int a = int b)" and "(a < b) = (int a < int b)" and "(a ≤ b) = (int a ≤ int b)" by simp_all lemma int_ops: fixes a b :: nat shows "int 0 = 0" and "int 1 = 1" and "int (numeral n) = numeral n" and "int (Suc a) = int a + 1" and "int (a + b) = int a + int b" and "int (a - b) = (if int a < int b then 0 else int a - int b)" and "int (a * b) = int a * int b" and "int (a div b) = int a div int b" and "int (a mod b) = int a mod int b" by (auto intro: zdiv_int zmod_int) lemma int_if: fixes a b :: nat shows "int (if P then a else b) = (if P then int a else int b)" by simp subsection ‹Integer division and modulo for Z3› text ‹ The following Z3-inspired definitions are overspecified for the case where ‹l = 0›. This SchĂ¶nheitsfehler is corrected in the ‹div_as_z3div› and ‹mod_as_z3mod› theorems. › definition z3div :: "int ⇒ int ⇒ int" where "z3div k l = (if l ≥ 0 then k div l else - (k div - l))" definition z3mod :: "int ⇒ int ⇒ int" where "z3mod k l = k mod (if l ≥ 0 then l else - l)" lemma div_as_z3div: "∀k l. k div l = (if l = 0 then 0 else if l > 0 then z3div k l else z3div (- k) (- l))" by (simp add: z3div_def) lemma mod_as_z3mod: "∀k l. k mod l = (if l = 0 then k else if l > 0 then z3mod k l else - z3mod (- k) (- l))" by (simp add: z3mod_def) subsection ‹Setup› ML_file "Tools/SMT/smt_util.ML" ML_file "Tools/SMT/smt_failure.ML" ML_file "Tools/SMT/smt_config.ML" ML_file "Tools/SMT/smt_builtin.ML" ML_file "Tools/SMT/smt_datatypes.ML" ML_file "Tools/SMT/smt_normalize.ML" ML_file "Tools/SMT/smt_translate.ML" ML_file "Tools/SMT/smtlib.ML" ML_file "Tools/SMT/smtlib_interface.ML" ML_file "Tools/SMT/smtlib_proof.ML" ML_file "Tools/SMT/smtlib_isar.ML" ML_file "Tools/SMT/z3_proof.ML" ML_file "Tools/SMT/z3_isar.ML" ML_file "Tools/SMT/smt_solver.ML" ML_file "Tools/SMT/cvc4_interface.ML" ML_file "Tools/SMT/cvc4_proof_parse.ML" ML_file "Tools/SMT/verit_proof.ML" ML_file "Tools/SMT/verit_isar.ML" ML_file "Tools/SMT/verit_proof_parse.ML" ML_file "Tools/SMT/conj_disj_perm.ML" ML_file "Tools/SMT/z3_interface.ML" ML_file "Tools/SMT/z3_replay_util.ML" ML_file "Tools/SMT/z3_replay_rules.ML" ML_file "Tools/SMT/z3_replay_methods.ML" ML_file "Tools/SMT/z3_replay.ML" ML_file "Tools/SMT/smt_systems.ML" method_setup smt = ‹ Scan.optional Attrib.thms [] >> (fn thms => fn ctxt => METHOD (fn facts => HEADGOAL (SMT_Solver.smt_tac ctxt (thms @ facts)))) › "apply an SMT solver to the current goal" subsection ‹Configuration› text ‹ The current configuration can be printed by the command ‹smt_status›, which shows the values of most options. › subsection ‹General configuration options› text ‹ The option ‹smt_solver› can be used to change the target SMT solver. The possible values can be obtained from the ‹smt_status› command. › declare [[smt_solver = z3]] text ‹ Since SMT solvers are potentially nonterminating, there is a timeout (given in seconds) to restrict their runtime. › declare [[smt_timeout = 20]] text ‹ SMT solvers apply randomized heuristics. In case a problem is not solvable by an SMT solver, changing the following option might help. › declare [[smt_random_seed = 1]] text ‹ In general, the binding to SMT solvers runs as an oracle, i.e, the SMT solvers are fully trusted without additional checks. The following option can cause the SMT solver to run in proof-producing mode, giving a checkable certificate. This is currently only implemented for Z3. › declare [[smt_oracle = false]] text ‹ Each SMT solver provides several commandline options to tweak its behaviour. They can be passed to the solver by setting the following options. › declare [[cvc3_options = ""]] declare [[cvc4_options = "--full-saturate-quant --inst-when=full-last-call --inst-no-entail --term-db-mode=relevant --multi-trigger-linear"]] declare [[verit_options = "--index-sorts --index-fresh-sorts"]] declare [[z3_options = ""]] text ‹ The SMT method provides an inference mechanism to detect simple triggers in quantified formulas, which might increase the number of problems solvable by SMT solvers (note: triggers guide quantifier instantiations in the SMT solver). To turn it on, set the following option. › declare [[smt_infer_triggers = false]] text ‹ Enable the following option to use built-in support for datatypes, codatatypes, and records in CVC4. Currently, this is implemented only in oracle mode. › declare [[cvc4_extensions = false]] text ‹ Enable the following option to use built-in support for div/mod, datatypes, and records in Z3. Currently, this is implemented only in oracle mode. › declare [[z3_extensions = false]] subsection ‹Certificates› text ‹ By setting the option ‹smt_certificates› to the name of a file, all following applications of an SMT solver a cached in that file. Any further application of the same SMT solver (using the very same configuration) re-uses the cached certificate instead of invoking the solver. An empty string disables caching certificates. The filename should be given as an explicit path. It is good practice to use the name of the current theory (with ending ‹.certs› instead of ‹.thy›) as the certificates file. Certificate files should be used at most once in a certain theory context, to avoid race conditions with other concurrent accesses. › declare [[smt_certificates = ""]] text ‹ The option ‹smt_read_only_certificates› controls whether only stored certificates are should be used or invocation of an SMT solver is allowed. When set to ‹true›, no SMT solver will ever be invoked and only the existing certificates found in the configured cache are used; when set to ‹false› and there is no cached certificate for some proposition, then the configured SMT solver is invoked. › declare [[smt_read_only_certificates = false]] subsection ‹Tracing› text ‹ The SMT method, when applied, traces important information. To make it entirely silent, set the following option to ‹false›. › declare [[smt_verbose = true]] text ‹ For tracing the generated problem file given to the SMT solver as well as the returned result of the solver, the option ‹smt_trace› should be set to ‹true›. › declare [[smt_trace = false]] subsection ‹Schematic rules for Z3 proof reconstruction› text ‹ Several prof rules of Z3 are not very well documented. There are two lemma groups which can turn failing Z3 proof reconstruction attempts into succeeding ones: the facts in ‹z3_rule› are tried prior to any implemented reconstruction procedure for all uncertain Z3 proof rules; the facts in ‹z3_simp› are only fed to invocations of the simplifier when reconstructing theory-specific proof steps. › lemmas [z3_rule] = refl eq_commute conj_commute disj_commute simp_thms nnf_simps ring_distribs field_simps times_divide_eq_right times_divide_eq_left if_True if_False not_not NO_MATCH_def lemma [z3_rule]: "(P ∧ Q) = (¬ (¬ P ∨ ¬ Q))" "(P ∧ Q) = (¬ (¬ Q ∨ ¬ P))" "(¬ P ∧ Q) = (¬ (P ∨ ¬ Q))" "(¬ P ∧ Q) = (¬ (¬ Q ∨ P))" "(P ∧ ¬ Q) = (¬ (¬ P ∨ Q))" "(P ∧ ¬ Q) = (¬ (Q ∨ ¬ P))" "(¬ P ∧ ¬ Q) = (¬ (P ∨ Q))" "(¬ P ∧ ¬ Q) = (¬ (Q ∨ P))" by auto lemma [z3_rule]: "(P ⟶ Q) = (Q ∨ ¬ P)" "(¬ P ⟶ Q) = (P ∨ Q)" "(¬ P ⟶ Q) = (Q ∨ P)" "(True ⟶ P) = P" "(P ⟶ True) = True" "(False ⟶ P) = True" "(P ⟶ P) = True" "(¬ (A ⟷ ¬ B)) ⟷ (A ⟷ B)" by auto lemma [z3_rule]: "((P = Q) ⟶ R) = (R ∨ (Q = (¬ P)))" by auto lemma [z3_rule]: "(¬ True) = False" "(¬ False) = True" "(x = x) = True" "(P = True) = P" "(True = P) = P" "(P = False) = (¬ P)" "(False = P) = (¬ P)" "((¬ P) = P) = False" "(P = (¬ P)) = False" "((¬ P) = (¬ Q)) = (P = Q)" "¬ (P = (¬ Q)) = (P = Q)" "¬ ((¬ P) = Q) = (P = Q)" "(P ≠ Q) = (Q = (¬ P))" "(P = Q) = ((¬ P ∨ Q) ∧ (P ∨ ¬ Q))" "(P ≠ Q) = ((¬ P ∨ ¬ Q) ∧ (P ∨ Q))" by auto lemma [z3_rule]: "(if P then P else ¬ P) = True" "(if ¬ P then ¬ P else P) = True" "(if P then True else False) = P" "(if P then False else True) = (¬ P)" "(if P then Q else True) = ((¬ P) ∨ Q)" "(if P then Q else True) = (Q ∨ (¬ P))" "(if P then Q else ¬ Q) = (P = Q)" "(if P then Q else ¬ Q) = (Q = P)" "(if P then ¬ Q else Q) = (P = (¬ Q))" "(if P then ¬ Q else Q) = ((¬ Q) = P)" "(if ¬ P then x else y) = (if P then y else x)" "(if P then (if Q then x else y) else x) = (if P ∧ (¬ Q) then y else x)" "(if P then (if Q then x else y) else x) = (if (¬ Q) ∧ P then y else x)" "(if P then (if Q then x else y) else y) = (if P ∧ Q then x else y)" "(if P then (if Q then x else y) else y) = (if Q ∧ P then x else y)" "(if P then x else if P then y else z) = (if P then x else z)" "(if P then x else if Q then x else y) = (if P ∨ Q then x else y)" "(if P then x else if Q then x else y) = (if Q ∨ P then x else y)" "(if P then x = y else x = z) = (x = (if P then y else z))" "(if P then x = y else y = z) = (y = (if P then x else z))" "(if P then x = y else z = y) = (y = (if P then x else z))" by auto lemma [z3_rule]: "0 + (x::int) = x" "x + 0 = x" "x + x = 2 * x" "0 * x = 0" "1 * x = x" "x + y = y + x" by (auto simp add: mult_2) lemma [z3_rule]: (* for def-axiom *) "P = Q ∨ P ∨ Q" "P = Q ∨ ¬ P ∨ ¬ Q" "(¬ P) = Q ∨ ¬ P ∨ Q" "(¬ P) = Q ∨ P ∨ ¬ Q" "P = (¬ Q) ∨ ¬ P ∨ Q" "P = (¬ Q) ∨ P ∨ ¬ Q" "P ≠ Q ∨ P ∨ ¬ Q" "P ≠ Q ∨ ¬ P ∨ Q" "P ≠ (¬ Q) ∨ P ∨ Q" "(¬ P) ≠ Q ∨ P ∨ Q" "P ∨ Q ∨ P ≠ (¬ Q)" "P ∨ Q ∨ (¬ P) ≠ Q" "P ∨ ¬ Q ∨ P ≠ Q" "¬ P ∨ Q ∨ P ≠ Q" "P ∨ y = (if P then x else y)" "P ∨ (if P then x else y) = y" "¬ P ∨ x = (if P then x else y)" "¬ P ∨ (if P then x else y) = x" "P ∨ R ∨ ¬ (if P then Q else R)" "¬ P ∨ Q ∨ ¬ (if P then Q else R)" "¬ (if P then Q else R) ∨ ¬ P ∨ Q" "¬ (if P then Q else R) ∨ P ∨ R" "(if P then Q else R) ∨ ¬ P ∨ ¬ Q" "(if P then Q else R) ∨ P ∨ ¬ R" "(if P then ¬ Q else R) ∨ ¬ P ∨ Q" "(if P then Q else ¬ R) ∨ P ∨ R" by auto hide_type (open) symb_list pattern hide_const (open) Symb_Nil Symb_Cons trigger pat nopat fun_app z3div z3mod end