| author | huffman | 
| Tue, 12 Oct 2010 06:20:05 -0700 | |
| changeset 40006 | 116e94f9543b | 
| parent 39946 | 78faa9b31202 | 
| child 40121 | e7a80c6752c9 | 
| permissions | -rw-r--r-- | 
| 14350 | 1 | (* Title: HOL/Refute.thy | 
| 2 | Author: Tjark Weber | |
| 22058 
49faa8c7a5d9
updated to mention the automatic unfolding of constants
 webertj parents: 
21332diff
changeset | 3 | Copyright 2003-2007 | 
| 14350 | 4 | |
| 5 | Basic setup and documentation for the 'refute' (and 'refute_params') command. | |
| 6 | *) | |
| 7 | ||
| 14589 | 8 | header {* Refute *}
 | 
| 9 | ||
| 15131 | 10 | theory Refute | 
| 39946 | 11 | imports Hilbert_Choice List Sledgehammer | 
| 39048 | 12 | uses "Tools/refute.ML" | 
| 15131 | 13 | begin | 
| 14589 | 14 | |
| 15 | setup Refute.setup | |
| 16 | ||
| 17 | text {*
 | |
| 18 | \small | |
| 19 | \begin{verbatim}
 | |
| 14350 | 20 | (* ------------------------------------------------------------------------- *) | 
| 21 | (* REFUTE *) | |
| 22 | (* *) | |
| 23 | (* We use a SAT solver to search for a (finite) model that refutes a given *) | |
| 24 | (* HOL formula. *) | |
| 25 | (* ------------------------------------------------------------------------- *) | |
| 26 | ||
| 27 | (* ------------------------------------------------------------------------- *) | |
| 14457 | 28 | (* NOTE *) | 
| 14350 | 29 | (* *) | 
| 14457 | 30 | (* I strongly recommend that you install a stand-alone SAT solver if you *) | 
| 14463 | 31 | (* want to use 'refute'. For details see 'HOL/Tools/sat_solver.ML'. If you *) | 
| 15293 
7797a04cc188
removed explicit mentioning of zChaffs version number
 webertj parents: 
15140diff
changeset | 32 | (* have installed (a supported version of) zChaff, simply set 'ZCHAFF_HOME' *) | 
| 
7797a04cc188
removed explicit mentioning of zChaffs version number
 webertj parents: 
15140diff
changeset | 33 | (* in 'etc/settings'. *) | 
| 14350 | 34 | (* ------------------------------------------------------------------------- *) | 
| 35 | ||
| 36 | (* ------------------------------------------------------------------------- *) | |
| 37 | (* USAGE *) | |
| 38 | (* *) | |
| 39 | (* See the file 'HOL/ex/Refute_Examples.thy' for examples. The supported *) | |
| 40 | (* parameters are explained below. *) | |
| 41 | (* ------------------------------------------------------------------------- *) | |
| 42 | ||
| 43 | (* ------------------------------------------------------------------------- *) | |
| 44 | (* CURRENT LIMITATIONS *) | |
| 45 | (* *) | |
| 46 | (* 'refute' currently accepts formulas of higher-order predicate logic (with *) | |
| 47 | (* equality), including free/bound/schematic variables, lambda abstractions, *) | |
| 16870 | 48 | (* sets and set membership, "arbitrary", "The", "Eps", records and *) | 
| 22058 
49faa8c7a5d9
updated to mention the automatic unfolding of constants
 webertj parents: 
21332diff
changeset | 49 | (* inductively defined sets. Constants are unfolded automatically, and sort *) | 
| 
49faa8c7a5d9
updated to mention the automatic unfolding of constants
 webertj parents: 
21332diff
changeset | 50 | (* axioms are added as well. Other, user-asserted axioms however are *) | 
| 
49faa8c7a5d9
updated to mention the automatic unfolding of constants
 webertj parents: 
21332diff
changeset | 51 | (* ignored. Inductive datatypes and recursive functions are supported, but *) | 
| 
49faa8c7a5d9
updated to mention the automatic unfolding of constants
 webertj parents: 
21332diff
changeset | 52 | (* may lead to spurious countermodels. *) | 
| 14463 | 53 | (* *) | 
| 14808 | 54 | (* The (space) complexity of the algorithm is non-elementary. *) | 
| 14350 | 55 | (* *) | 
| 16870 | 56 | (* Schematic type variables are not supported. *) | 
| 14350 | 57 | (* ------------------------------------------------------------------------- *) | 
| 58 | ||
| 59 | (* ------------------------------------------------------------------------- *) | |
| 60 | (* PARAMETERS *) | |
| 61 | (* *) | |
| 34120 
f9920a3ddf50
added "no_assms" option to Refute, and include structured proof assumptions by default;
 blanchet parents: 
34018diff
changeset | 62 | (* The following global parameters are currently supported (and required, *) | 
| 
f9920a3ddf50
added "no_assms" option to Refute, and include structured proof assumptions by default;
 blanchet parents: 
34018diff
changeset | 63 | (* except for "expect"): *) | 
| 14350 | 64 | (* *) | 
| 65 | (* Name Type Description *) | |
| 66 | (* *) | |
| 67 | (* "minsize" int Only search for models with size at least *) | |
| 68 | (* 'minsize'. *) | |
| 69 | (* "maxsize" int If >0, only search for models with size at most *) | |
| 70 | (* 'maxsize'. *) | |
| 71 | (* "maxvars" int If >0, use at most 'maxvars' boolean variables *) | |
| 72 | (* when transforming the term into a propositional *) | |
| 73 | (* formula. *) | |
| 14808 | 74 | (* "maxtime" int If >0, terminate after at most 'maxtime' seconds. *) | 
| 75 | (* This value is ignored under some ML compilers. *) | |
| 14457 | 76 | (* "satsolver" string Name of the SAT solver to be used. *) | 
| 34120 
f9920a3ddf50
added "no_assms" option to Refute, and include structured proof assumptions by default;
 blanchet parents: 
34018diff
changeset | 77 | (* "no_assms" bool If "true", assumptions in structured proofs are *) | 
| 
f9920a3ddf50
added "no_assms" option to Refute, and include structured proof assumptions by default;
 blanchet parents: 
34018diff
changeset | 78 | (* not considered. *) | 
| 
f9920a3ddf50
added "no_assms" option to Refute, and include structured proof assumptions by default;
 blanchet parents: 
34018diff
changeset | 79 | (* "expect"      string  Expected result ("genuine", "potential", "none", or *)
 | 
| 
f9920a3ddf50
added "no_assms" option to Refute, and include structured proof assumptions by default;
 blanchet parents: 
34018diff
changeset | 80 | (* "unknown"). *) | 
| 14457 | 81 | (* *) | 
| 17721 | 82 | (* See 'HOL/SAT.thy' for default values. *) | 
| 14808 | 83 | (* *) | 
| 84 | (* The size of particular types can be specified in the form type=size *) | |
| 85 | (* (where 'type' is a string, and 'size' is an int). Examples: *) | |
| 86 | (* "'a"=1 *) | |
| 87 | (* "List.list"=2 *) | |
| 14350 | 88 | (* ------------------------------------------------------------------------- *) | 
| 89 | ||
| 90 | (* ------------------------------------------------------------------------- *) | |
| 91 | (* FILES *) | |
| 92 | (* *) | |
| 39048 | 93 | (* HOL/Tools/prop_logic.ML Propositional logic *) | 
| 94 | (* HOL/Tools/sat_solver.ML SAT solvers *) | |
| 95 | (* HOL/Tools/refute.ML Translation HOL -> propositional logic and *) | |
| 96 | (* Boolean assignment -> HOL model *) | |
| 97 | (* HOL/Refute.thy This file: loads the ML files, basic setup, *) | |
| 98 | (* documentation *) | |
| 99 | (* HOL/SAT.thy Sets default parameters *) | |
| 100 | (* HOL/ex/Refute_Examples.thy Examples *) | |
| 14350 | 101 | (* ------------------------------------------------------------------------- *) | 
| 14589 | 102 | \end{verbatim}
 | 
| 103 | *} | |
| 14350 | 104 | |
| 105 | end |