src/HOL/Nitpick.thy
author blanchet
Tue Dec 07 11:56:53 2010 +0100 (2010-12-07)
changeset 41052 3db267a01c1d
parent 41046 f2e94005d283
child 41792 ff3cb0c418b7
permissions -rw-r--r--
remove the "fin_fun" optimization in Nitpick -- it was always a hack and didn't help much
blanchet@33192
     1
(*  Title:      HOL/Nitpick.thy
blanchet@33192
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@35807
     3
    Copyright   2008, 2009, 2010
blanchet@33192
     4
blanchet@33192
     5
Nitpick: Yet another counterexample generator for Isabelle/HOL.
blanchet@33192
     6
*)
blanchet@33192
     7
blanchet@33192
     8
header {* Nitpick: Yet Another Counterexample Generator for Isabelle/HOL *}
blanchet@33192
     9
blanchet@33192
    10
theory Nitpick
haftmann@38393
    11
imports Map Quotient SAT Record
blanchet@33192
    12
uses ("Tools/Nitpick/kodkod.ML")
blanchet@33192
    13
     ("Tools/Nitpick/kodkod_sat.ML")
blanchet@33192
    14
     ("Tools/Nitpick/nitpick_util.ML")
blanchet@33192
    15
     ("Tools/Nitpick/nitpick_hol.ML")
blanchet@35070
    16
     ("Tools/Nitpick/nitpick_preproc.ML")
blanchet@33192
    17
     ("Tools/Nitpick/nitpick_mono.ML")
blanchet@33192
    18
     ("Tools/Nitpick/nitpick_scope.ML")
blanchet@33192
    19
     ("Tools/Nitpick/nitpick_peephole.ML")
blanchet@33192
    20
     ("Tools/Nitpick/nitpick_rep.ML")
blanchet@33192
    21
     ("Tools/Nitpick/nitpick_nut.ML")
blanchet@33192
    22
     ("Tools/Nitpick/nitpick_kodkod.ML")
blanchet@33192
    23
     ("Tools/Nitpick/nitpick_model.ML")
blanchet@33192
    24
     ("Tools/Nitpick/nitpick.ML")
blanchet@33192
    25
     ("Tools/Nitpick/nitpick_isar.ML")
blanchet@33192
    26
     ("Tools/Nitpick/nitpick_tests.ML")
blanchet@33192
    27
begin
blanchet@33192
    28
blanchet@33192
    29
typedecl bisim_iterator
blanchet@33192
    30
blanchet@33192
    31
axiomatization unknown :: 'a
blanchet@34938
    32
           and is_unknown :: "'a \<Rightarrow> bool"
blanchet@33192
    33
           and bisim :: "bisim_iterator \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> bool"
blanchet@33192
    34
           and bisim_iterator_max :: bisim_iterator
blanchet@34938
    35
           and Quot :: "'a \<Rightarrow> 'b"
blanchet@35671
    36
           and safe_The :: "('a \<Rightarrow> bool) \<Rightarrow> 'a"
blanchet@33192
    37
blanchet@35665
    38
datatype ('a, 'b) fun_box = FunBox "('a \<Rightarrow> 'b)"
blanchet@33192
    39
datatype ('a, 'b) pair_box = PairBox 'a 'b
blanchet@34124
    40
blanchet@34124
    41
typedecl unsigned_bit
blanchet@34124
    42
typedecl signed_bit
blanchet@34124
    43
blanchet@34124
    44
datatype 'a word = Word "('a set)"
blanchet@33192
    45
blanchet@33192
    46
text {*
blanchet@33192
    47
Alternative definitions.
blanchet@33192
    48
*}
blanchet@33192
    49
blanchet@36918
    50
lemma If_def [nitpick_def, no_atp]:
blanchet@33192
    51
"(if P then Q else R) \<equiv> (P \<longrightarrow> Q) \<and> (\<not> P \<longrightarrow> R)"
blanchet@33192
    52
by (rule eq_reflection) (rule if_bool_eq_conj)
blanchet@33192
    53
blanchet@36918
    54
lemma Ex1_def [nitpick_def, no_atp]:
blanchet@33192
    55
"Ex1 P \<equiv> \<exists>x. P = {x}"
blanchet@33192
    56
apply (rule eq_reflection)
nipkow@39302
    57
apply (simp add: Ex1_def set_eq_iff)
blanchet@33192
    58
apply (rule iffI)
blanchet@33192
    59
 apply (erule exE)
blanchet@33192
    60
 apply (erule conjE)
blanchet@33192
    61
 apply (rule_tac x = x in exI)
blanchet@33192
    62
 apply (rule allI)
blanchet@33192
    63
 apply (rename_tac y)
blanchet@33192
    64
 apply (erule_tac x = y in allE)
blanchet@33192
    65
by (auto simp: mem_def)
blanchet@33192
    66
blanchet@36918
    67
lemma rtrancl_def [nitpick_def, no_atp]: "r\<^sup>* \<equiv> (r\<^sup>+)\<^sup>="
blanchet@33192
    68
by simp
blanchet@33192
    69
blanchet@36918
    70
lemma rtranclp_def [nitpick_def, no_atp]:
blanchet@33192
    71
"rtranclp r a b \<equiv> (a = b \<or> tranclp r a b)"
blanchet@33192
    72
by (rule eq_reflection) (auto dest: rtranclpD)
blanchet@33192
    73
blanchet@36918
    74
lemma tranclp_def [nitpick_def, no_atp]:
blanchet@33192
    75
"tranclp r a b \<equiv> trancl (split r) (a, b)"
blanchet@33192
    76
by (simp add: trancl_def Collect_def mem_def)
blanchet@33192
    77
blanchet@41046
    78
definition prod :: "'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<times> 'b) set" where
blanchet@41046
    79
"prod A B = {(a, b). a \<in> A \<and> b \<in> B}"
blanchet@41046
    80
blanchet@33192
    81
definition refl' :: "('a \<times> 'a \<Rightarrow> bool) \<Rightarrow> bool" where
blanchet@33192
    82
"refl' r \<equiv> \<forall>x. (x, x) \<in> r"
blanchet@33192
    83
blanchet@33192
    84
definition wf' :: "('a \<times> 'a \<Rightarrow> bool) \<Rightarrow> bool" where
blanchet@33192
    85
"wf' r \<equiv> acyclic r \<and> (finite r \<or> unknown)"
blanchet@33192
    86
blanchet@33192
    87
axiomatization wf_wfrec :: "('a \<times> 'a \<Rightarrow> bool) \<Rightarrow> (('a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b"
blanchet@33192
    88
blanchet@33192
    89
definition wf_wfrec' :: "('a \<times> 'a \<Rightarrow> bool) \<Rightarrow> (('a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b" where
blanchet@33192
    90
[nitpick_simp]: "wf_wfrec' R F x = F (Recdef.cut (wf_wfrec R F) R x) x"
blanchet@33192
    91
blanchet@33192
    92
definition wfrec' ::  "('a \<times> 'a \<Rightarrow> bool) \<Rightarrow> (('a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b" where
blanchet@33192
    93
"wfrec' R F x \<equiv> if wf R then wf_wfrec' R F x
blanchet@33192
    94
                else THE y. wfrec_rel R (%f x. F (Recdef.cut f R x) x) x y"
blanchet@33192
    95
blanchet@33192
    96
definition card' :: "('a \<Rightarrow> bool) \<Rightarrow> nat" where
blanchet@39365
    97
"card' A \<equiv> if finite A then length (SOME xs. set xs = A \<and> distinct xs) else 0"
blanchet@33192
    98
blanchet@33192
    99
definition setsum' :: "('a \<Rightarrow> 'b\<Colon>comm_monoid_add) \<Rightarrow> ('a \<Rightarrow> bool) \<Rightarrow> 'b" where
blanchet@39365
   100
"setsum' f A \<equiv> if finite A then listsum (map f (SOME xs. set xs = A \<and> distinct xs)) else 0"
blanchet@33192
   101
blanchet@33192
   102
inductive fold_graph' :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'b \<Rightarrow> ('a \<Rightarrow> bool) \<Rightarrow> 'b \<Rightarrow> bool" where
blanchet@33192
   103
"fold_graph' f z {} z" |
blanchet@33192
   104
"\<lbrakk>x \<in> A; fold_graph' f z (A - {x}) y\<rbrakk> \<Longrightarrow> fold_graph' f z A (f x y)"
blanchet@33192
   105
blanchet@33192
   106
text {*
blanchet@33192
   107
The following lemmas are not strictly necessary but they help the
blanchet@33192
   108
\textit{special\_level} optimization.
blanchet@33192
   109
*}
blanchet@33192
   110
blanchet@36918
   111
lemma The_psimp [nitpick_psimp, no_atp]:
blanchet@33192
   112
"P = {x} \<Longrightarrow> The P = x"
blanchet@33192
   113
by (subgoal_tac "{x} = (\<lambda>y. y = x)") (auto simp: mem_def)
blanchet@33192
   114
blanchet@36918
   115
lemma Eps_psimp [nitpick_psimp, no_atp]:
blanchet@33192
   116
"\<lbrakk>P x; \<not> P y; Eps P = y\<rbrakk> \<Longrightarrow> Eps P = x"
blanchet@33192
   117
apply (case_tac "P (Eps P)")
blanchet@33192
   118
 apply auto
blanchet@33192
   119
apply (erule contrapos_np)
blanchet@33192
   120
by (rule someI)
blanchet@33192
   121
blanchet@36918
   122
lemma unit_case_def [nitpick_def, no_atp]:
blanchet@33192
   123
"unit_case x u \<equiv> x"
blanchet@33192
   124
apply (subgoal_tac "u = ()")
blanchet@33192
   125
 apply (simp only: unit.cases)
blanchet@33192
   126
by simp
blanchet@33192
   127
blanchet@33556
   128
declare unit.cases [nitpick_simp del]
blanchet@33556
   129
blanchet@36918
   130
lemma nat_case_def [nitpick_def, no_atp]:
blanchet@33192
   131
"nat_case x f n \<equiv> if n = 0 then x else f (n - 1)"
blanchet@33192
   132
apply (rule eq_reflection)
blanchet@33192
   133
by (case_tac n) auto
blanchet@33192
   134
blanchet@33556
   135
declare nat.cases [nitpick_simp del]
blanchet@33556
   136
blanchet@36918
   137
lemma list_size_simp [nitpick_simp, no_atp]:
blanchet@33192
   138
"list_size f xs = (if xs = [] then 0
blanchet@33192
   139
                   else Suc (f (hd xs) + list_size f (tl xs)))"
blanchet@33192
   140
"size xs = (if xs = [] then 0 else Suc (size (tl xs)))"
blanchet@33192
   141
by (case_tac xs) auto
blanchet@33192
   142
blanchet@33192
   143
text {*
blanchet@33192
   144
Auxiliary definitions used to provide an alternative representation for
blanchet@33192
   145
@{text rat} and @{text real}.
blanchet@33192
   146
*}
blanchet@33192
   147
blanchet@33192
   148
function nat_gcd :: "nat \<Rightarrow> nat \<Rightarrow> nat" where
blanchet@33192
   149
[simp del]: "nat_gcd x y = (if y = 0 then x else nat_gcd y (x mod y))"
blanchet@33192
   150
by auto
blanchet@33192
   151
termination
blanchet@33192
   152
apply (relation "measure (\<lambda>(x, y). x + y + (if y > x then 1 else 0))")
blanchet@33192
   153
 apply auto
blanchet@33192
   154
 apply (metis mod_less_divisor xt1(9))
blanchet@33192
   155
by (metis mod_mod_trivial mod_self nat_neq_iff xt1(10))
blanchet@33192
   156
blanchet@33192
   157
definition nat_lcm :: "nat \<Rightarrow> nat \<Rightarrow> nat" where
blanchet@33192
   158
"nat_lcm x y = x * y div (nat_gcd x y)"
blanchet@33192
   159
blanchet@33192
   160
definition int_gcd :: "int \<Rightarrow> int \<Rightarrow> int" where
blanchet@33192
   161
"int_gcd x y = int (nat_gcd (nat (abs x)) (nat (abs y)))"
blanchet@33192
   162
blanchet@33192
   163
definition int_lcm :: "int \<Rightarrow> int \<Rightarrow> int" where
blanchet@33192
   164
"int_lcm x y = int (nat_lcm (nat (abs x)) (nat (abs y)))"
blanchet@33192
   165
blanchet@33192
   166
definition Frac :: "int \<times> int \<Rightarrow> bool" where
blanchet@33192
   167
"Frac \<equiv> \<lambda>(a, b). b > 0 \<and> int_gcd a b = 1"
blanchet@33192
   168
blanchet@33192
   169
axiomatization Abs_Frac :: "int \<times> int \<Rightarrow> 'a"
blanchet@33192
   170
           and Rep_Frac :: "'a \<Rightarrow> int \<times> int"
blanchet@33192
   171
blanchet@33192
   172
definition zero_frac :: 'a where
blanchet@33192
   173
"zero_frac \<equiv> Abs_Frac (0, 1)"
blanchet@33192
   174
blanchet@33192
   175
definition one_frac :: 'a where
blanchet@33192
   176
"one_frac \<equiv> Abs_Frac (1, 1)"
blanchet@33192
   177
blanchet@33192
   178
definition num :: "'a \<Rightarrow> int" where
blanchet@33192
   179
"num \<equiv> fst o Rep_Frac"
blanchet@33192
   180
blanchet@33192
   181
definition denom :: "'a \<Rightarrow> int" where
blanchet@33192
   182
"denom \<equiv> snd o Rep_Frac"
blanchet@33192
   183
blanchet@33192
   184
function norm_frac :: "int \<Rightarrow> int \<Rightarrow> int \<times> int" where
blanchet@33192
   185
[simp del]: "norm_frac a b = (if b < 0 then norm_frac (- a) (- b)
blanchet@33192
   186
                              else if a = 0 \<or> b = 0 then (0, 1)
blanchet@33192
   187
                              else let c = int_gcd a b in (a div c, b div c))"
blanchet@33192
   188
by pat_completeness auto
blanchet@33192
   189
termination by (relation "measure (\<lambda>(_, b). if b < 0 then 1 else 0)") auto
blanchet@33192
   190
blanchet@33192
   191
definition frac :: "int \<Rightarrow> int \<Rightarrow> 'a" where
blanchet@33192
   192
"frac a b \<equiv> Abs_Frac (norm_frac a b)"
blanchet@33192
   193
blanchet@33192
   194
definition plus_frac :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" where
blanchet@33192
   195
[nitpick_simp]:
blanchet@33192
   196
"plus_frac q r = (let d = int_lcm (denom q) (denom r) in
blanchet@33192
   197
                    frac (num q * (d div denom q) + num r * (d div denom r)) d)"
blanchet@33192
   198
blanchet@33192
   199
definition times_frac :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" where
blanchet@33192
   200
[nitpick_simp]:
blanchet@33192
   201
"times_frac q r = frac (num q * num r) (denom q * denom r)"
blanchet@33192
   202
blanchet@33192
   203
definition uminus_frac :: "'a \<Rightarrow> 'a" where
blanchet@33192
   204
"uminus_frac q \<equiv> Abs_Frac (- num q, denom q)"
blanchet@33192
   205
blanchet@33192
   206
definition number_of_frac :: "int \<Rightarrow> 'a" where
blanchet@33192
   207
"number_of_frac n \<equiv> Abs_Frac (n, 1)"
blanchet@33192
   208
blanchet@33192
   209
definition inverse_frac :: "'a \<Rightarrow> 'a" where
blanchet@33192
   210
"inverse_frac q \<equiv> frac (denom q) (num q)"
blanchet@33192
   211
blanchet@37397
   212
definition less_frac :: "'a \<Rightarrow> 'a \<Rightarrow> bool" where
blanchet@37397
   213
[nitpick_simp]:
blanchet@37397
   214
"less_frac q r \<longleftrightarrow> num (plus_frac q (uminus_frac r)) < 0"
blanchet@37397
   215
blanchet@33192
   216
definition less_eq_frac :: "'a \<Rightarrow> 'a \<Rightarrow> bool" where
blanchet@33192
   217
[nitpick_simp]:
blanchet@33192
   218
"less_eq_frac q r \<longleftrightarrow> num (plus_frac q (uminus_frac r)) \<le> 0"
blanchet@33192
   219
blanchet@33192
   220
definition of_frac :: "'a \<Rightarrow> 'b\<Colon>{inverse,ring_1}" where
blanchet@33192
   221
"of_frac q \<equiv> of_int (num q) / of_int (denom q)"
blanchet@33192
   222
blanchet@33192
   223
use "Tools/Nitpick/kodkod.ML"
blanchet@33192
   224
use "Tools/Nitpick/kodkod_sat.ML"
blanchet@33192
   225
use "Tools/Nitpick/nitpick_util.ML"
blanchet@33192
   226
use "Tools/Nitpick/nitpick_hol.ML"
blanchet@35665
   227
use "Tools/Nitpick/nitpick_mono.ML"
blanchet@35070
   228
use "Tools/Nitpick/nitpick_preproc.ML"
blanchet@33192
   229
use "Tools/Nitpick/nitpick_scope.ML"
blanchet@33192
   230
use "Tools/Nitpick/nitpick_peephole.ML"
blanchet@33192
   231
use "Tools/Nitpick/nitpick_rep.ML"
blanchet@33192
   232
use "Tools/Nitpick/nitpick_nut.ML"
blanchet@33192
   233
use "Tools/Nitpick/nitpick_kodkod.ML"
blanchet@33192
   234
use "Tools/Nitpick/nitpick_model.ML"
blanchet@33192
   235
use "Tools/Nitpick/nitpick.ML"
blanchet@33192
   236
use "Tools/Nitpick/nitpick_isar.ML"
blanchet@33192
   237
use "Tools/Nitpick/nitpick_tests.ML"
blanchet@33192
   238
blanchet@33561
   239
setup {* Nitpick_Isar.setup *}
blanchet@33561
   240
blanchet@39365
   241
hide_const (open) unknown is_unknown bisim bisim_iterator_max Quot safe_The
blanchet@41052
   242
    FunBox PairBox Word prod refl' wf' wf_wfrec wf_wfrec' wfrec' card' setsum'
blanchet@41052
   243
    fold_graph' nat_gcd nat_lcm int_gcd int_lcm Frac Abs_Frac Rep_Frac zero_frac
blanchet@41052
   244
    one_frac num denom norm_frac frac plus_frac times_frac uminus_frac
blanchet@39365
   245
    number_of_frac inverse_frac less_frac less_eq_frac of_frac
blanchet@41052
   246
hide_type (open) bisim_iterator fun_box pair_box unsigned_bit signed_bit word
blanchet@41046
   247
hide_fact (open) If_def Ex1_def rtrancl_def rtranclp_def tranclp_def prod_def
blanchet@41046
   248
    refl'_def wf'_def wf_wfrec'_def wfrec'_def card'_def setsum'_def
blanchet@41046
   249
    fold_graph'_def The_psimp Eps_psimp unit_case_def nat_case_def
blanchet@41046
   250
    list_size_simp nat_gcd_def nat_lcm_def int_gcd_def int_lcm_def Frac_def
blanchet@41046
   251
    zero_frac_def one_frac_def num_def denom_def norm_frac_def frac_def
blanchet@41046
   252
    plus_frac_def times_frac_def uminus_frac_def number_of_frac_def
blanchet@41046
   253
    inverse_frac_def less_frac_def less_eq_frac_def of_frac_def
blanchet@33192
   254
blanchet@33192
   255
end