src/HOL/Tools/meson.ML
author paulson
Thu Mar 17 15:12:03 2005 +0100 (2005-03-17)
changeset 15613 ab90e95ae02e
parent 15581 f07e865d9d40
child 15653 3549ff7158f3
permissions -rw-r--r--
meson now checks that problems are first-order
wenzelm@9869
     1
(*  Title:      HOL/Tools/meson.ML
paulson@9840
     2
    ID:         $Id$
paulson@9840
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
paulson@9840
     4
    Copyright   1992  University of Cambridge
paulson@9840
     5
wenzelm@9869
     6
The MESON resolution proof procedure for HOL.
paulson@9840
     7
paulson@9840
     8
When making clauses, avoids using the rewriter -- instead uses RS recursively
paulson@9840
     9
paulson@9840
    10
NEED TO SORT LITERALS BY # OF VARS, USING ==>I/E.  ELIMINATES NEED FOR
paulson@9840
    11
FUNCTION nodups -- if done to goal clauses too!
paulson@9840
    12
*)
paulson@9840
    13
paulson@15579
    14
signature BASIC_MESON =
paulson@15579
    15
sig
paulson@15579
    16
  val size_of_subgoals	: thm -> int
paulson@15579
    17
  val make_nnf		: thm -> thm
paulson@15579
    18
  val skolemize		: thm -> thm
paulson@15579
    19
  val make_clauses	: thm list -> thm list
paulson@15579
    20
  val make_horns	: thm list -> thm list
paulson@15579
    21
  val best_prolog_tac	: (thm -> int) -> thm list -> tactic
paulson@15579
    22
  val depth_prolog_tac	: thm list -> tactic
paulson@15579
    23
  val gocls		: thm list -> thm list
paulson@15579
    24
  val skolemize_prems_tac	: thm list -> int -> tactic
paulson@15579
    25
  val MESON		: (thm list -> tactic) -> int -> tactic
paulson@15579
    26
  val best_meson_tac	: (thm -> int) -> int -> tactic
paulson@15579
    27
  val safe_best_meson_tac	: int -> tactic
paulson@15579
    28
  val depth_meson_tac	: int -> tactic
paulson@15579
    29
  val prolog_step_tac'	: thm list -> int -> tactic
paulson@15579
    30
  val iter_deepen_prolog_tac	: thm list -> tactic
paulson@15579
    31
  val iter_deepen_meson_tac	: int -> tactic
paulson@15579
    32
  val meson_tac		: int -> tactic
paulson@15579
    33
  val negate_head	: thm -> thm
paulson@15579
    34
  val select_literal	: int -> thm -> thm
paulson@15579
    35
  val skolemize_tac	: int -> tactic
paulson@15579
    36
  val make_clauses_tac	: int -> tactic
paulson@15579
    37
  val meson_setup	: (theory -> theory) list
paulson@15579
    38
end
paulson@9840
    39
paulson@9840
    40
paulson@15579
    41
structure Meson =
paulson@15579
    42
struct
paulson@9840
    43
paulson@15579
    44
val not_conjD = thm "meson_not_conjD";
paulson@15579
    45
val not_disjD = thm "meson_not_disjD";
paulson@15579
    46
val not_notD = thm "meson_not_notD";
paulson@15579
    47
val not_allD = thm "meson_not_allD";
paulson@15579
    48
val not_exD = thm "meson_not_exD";
paulson@15579
    49
val imp_to_disjD = thm "meson_imp_to_disjD";
paulson@15579
    50
val not_impD = thm "meson_not_impD";
paulson@15579
    51
val iff_to_disjD = thm "meson_iff_to_disjD";
paulson@15579
    52
val not_iffD = thm "meson_not_iffD";
paulson@15579
    53
val conj_exD1 = thm "meson_conj_exD1";
paulson@15579
    54
val conj_exD2 = thm "meson_conj_exD2";
paulson@15579
    55
val disj_exD = thm "meson_disj_exD";
paulson@15579
    56
val disj_exD1 = thm "meson_disj_exD1";
paulson@15579
    57
val disj_exD2 = thm "meson_disj_exD2";
paulson@15579
    58
val disj_assoc = thm "meson_disj_assoc";
paulson@15579
    59
val disj_comm = thm "meson_disj_comm";
paulson@15579
    60
val disj_FalseD1 = thm "meson_disj_FalseD1";
paulson@15579
    61
val disj_FalseD2 = thm "meson_disj_FalseD2";
paulson@9840
    62
paulson@9840
    63
paulson@15579
    64
(**** Operators for forward proof ****)
paulson@15579
    65
paulson@15579
    66
(*raises exception if no rules apply -- unlike RL*)
paulson@15579
    67
fun tryres (th, rl::rls) = (th RS rl handle THM _ => tryres(th,rls))
paulson@15579
    68
  | tryres (th, []) = raise THM("tryres", 0, [th]);
paulson@15579
    69
paulson@15579
    70
val prop_of = #prop o rep_thm;
paulson@15579
    71
paulson@15579
    72
(*Permits forward proof from rules that discharge assumptions*)
paulson@15579
    73
fun forward_res nf st =
paulson@15579
    74
  case Seq.pull (ALLGOALS (METAHYPS (fn [prem] => rtac (nf prem) 1)) st)
paulson@15579
    75
  of SOME(th,_) => th
paulson@15579
    76
   | NONE => raise THM("forward_res", 0, [st]);
paulson@15579
    77
paulson@15579
    78
paulson@15579
    79
(*Are any of the constants in "bs" present in the term?*)
paulson@15579
    80
fun has_consts bs =
paulson@15579
    81
  let fun has (Const(a,_)) = a mem bs
paulson@15579
    82
	| has (Const ("Hilbert_Choice.Eps",_) $ _) = false
paulson@15579
    83
		     (*ignore constants within @-terms*)
paulson@15579
    84
	| has (f$u) = has f orelse has u
paulson@15579
    85
	| has (Abs(_,_,t)) = has t
paulson@15579
    86
	| has _ = false
paulson@15579
    87
  in  has  end;
paulson@9840
    88
paulson@9840
    89
paulson@15579
    90
(**** Clause handling ****)
paulson@9840
    91
paulson@15579
    92
fun literals (Const("Trueprop",_) $ P) = literals P
paulson@15579
    93
  | literals (Const("op |",_) $ P $ Q) = literals P @ literals Q
paulson@15579
    94
  | literals (Const("Not",_) $ P) = [(false,P)]
paulson@15579
    95
  | literals P = [(true,P)];
paulson@9840
    96
paulson@15579
    97
(*number of literals in a term*)
paulson@15579
    98
val nliterals = length o literals;
paulson@9840
    99
paulson@15579
   100
(*to detect, and remove, tautologous clauses*)
paulson@15579
   101
fun taut_lits [] = false
paulson@15579
   102
  | taut_lits ((flg,t)::ts) = (not flg,t) mem ts orelse taut_lits ts;
paulson@9840
   103
paulson@15579
   104
(*Include False as a literal: an occurrence of ~False is a tautology*)
paulson@15579
   105
fun is_taut th = taut_lits ((true, HOLogic.false_const) ::
paulson@15579
   106
			    literals (prop_of th));
paulson@9840
   107
paulson@15579
   108
(*Generation of unique names -- maxidx cannot be relied upon to increase!
paulson@15579
   109
  Cannot rely on "variant", since variables might coincide when literals
paulson@15579
   110
  are joined to make a clause...
paulson@15579
   111
  19 chooses "U" as the first variable name*)
paulson@15579
   112
val name_ref = ref 19;
paulson@9840
   113
paulson@15579
   114
(*Replaces universally quantified variables by FREE variables -- because
paulson@15579
   115
  assumptions may not contain scheme variables.  Later, call "generalize". *)
paulson@15579
   116
fun freeze_spec th =
paulson@15579
   117
  let val sth = th RS spec
paulson@15579
   118
      val newname = (name_ref := !name_ref + 1;
paulson@15579
   119
		     radixstring(26, "A", !name_ref))
paulson@15579
   120
  in  read_instantiate [("x", newname)] sth  end;
paulson@9840
   121
paulson@15579
   122
fun resop nf [prem] = resolve_tac (nf prem) 1;
paulson@9840
   123
paulson@15579
   124
(*Conjunctive normal form, detecting tautologies early.
paulson@15579
   125
  Strips universal quantifiers and breaks up conjunctions. *)
paulson@15579
   126
fun cnf_aux seen (th,ths) =
paulson@15579
   127
  if taut_lits (literals(prop_of th) @ seen)  
paulson@15579
   128
  then ths     (*tautology ignored*)
paulson@15579
   129
  else if not (has_consts ["All","op &"] (prop_of th))  
paulson@15579
   130
  then th::ths (*no work to do, terminate*)
paulson@15579
   131
  else (*conjunction?*)
paulson@15579
   132
	cnf_aux seen (th RS conjunct1,
paulson@15579
   133
		      cnf_aux seen (th RS conjunct2, ths))
paulson@15579
   134
  handle THM _ => (*universal quant?*)
paulson@15579
   135
	cnf_aux  seen (freeze_spec th,  ths)
paulson@15579
   136
  handle THM _ => (*disjunction?*)
paulson@15579
   137
    let val tac =
paulson@15579
   138
	(METAHYPS (resop (cnf_nil seen)) 1) THEN
paulson@15579
   139
	(fn st' => st' |>
paulson@15579
   140
		METAHYPS (resop (cnf_nil (literals (concl_of st') @ seen))) 1)
paulson@15579
   141
    in  Seq.list_of (tac (th RS disj_forward)) @ ths  end
paulson@15579
   142
and cnf_nil seen th = cnf_aux seen (th,[]);
paulson@9840
   143
paulson@15579
   144
(*Top-level call to cnf -- it's safe to reset name_ref*)
paulson@15579
   145
fun cnf (th,ths) =
paulson@15579
   146
   (name_ref := 19;  cnf (th RS conjunct1, cnf (th RS conjunct2, ths))
paulson@15579
   147
    handle THM _ => (*not a conjunction*) cnf_aux [] (th, ths));
paulson@9840
   148
paulson@15579
   149
(**** Removal of duplicate literals ****)
paulson@9840
   150
paulson@15579
   151
(*Forward proof, passing extra assumptions as theorems to the tactic*)
paulson@15579
   152
fun forward_res2 nf hyps st =
paulson@15579
   153
  case Seq.pull
paulson@15579
   154
	(REPEAT
paulson@15579
   155
	 (METAHYPS (fn major::minors => rtac (nf (minors@hyps) major) 1) 1)
paulson@15579
   156
	 st)
paulson@15579
   157
  of SOME(th,_) => th
paulson@15579
   158
   | NONE => raise THM("forward_res2", 0, [st]);
paulson@9840
   159
paulson@15579
   160
(*Remove duplicates in P|Q by assuming ~P in Q
paulson@15579
   161
  rls (initially []) accumulates assumptions of the form P==>False*)
paulson@15579
   162
fun nodups_aux rls th = nodups_aux rls (th RS disj_assoc)
paulson@15579
   163
    handle THM _ => tryres(th,rls)
paulson@15579
   164
    handle THM _ => tryres(forward_res2 nodups_aux rls (th RS disj_forward2),
paulson@15579
   165
			   [disj_FalseD1, disj_FalseD2, asm_rl])
paulson@15579
   166
    handle THM _ => th;
paulson@9840
   167
paulson@15579
   168
(*Remove duplicate literals, if there are any*)
paulson@15579
   169
fun nodups th =
paulson@15579
   170
    if null(findrep(literals(prop_of th))) then th
paulson@15579
   171
    else nodups_aux [] th;
paulson@9840
   172
paulson@9840
   173
paulson@15579
   174
(**** Generation of contrapositives ****)
paulson@9840
   175
paulson@15579
   176
(*Associate disjuctions to right -- make leftmost disjunct a LITERAL*)
paulson@15579
   177
fun assoc_right th = assoc_right (th RS disj_assoc)
paulson@15579
   178
	handle THM _ => th;
paulson@9840
   179
paulson@15579
   180
(*Must check for negative literal first!*)
paulson@15579
   181
val clause_rules = [disj_assoc, make_neg_rule, make_pos_rule];
paulson@9840
   182
paulson@15579
   183
(*For ordinary resolution. *)
paulson@15579
   184
val resolution_clause_rules = [disj_assoc, make_neg_rule', make_pos_rule'];
paulson@9840
   185
paulson@15579
   186
(*Create a goal or support clause, conclusing False*)
paulson@15579
   187
fun make_goal th =   (*Must check for negative literal first!*)
paulson@15579
   188
    make_goal (tryres(th, clause_rules))
paulson@15579
   189
  handle THM _ => tryres(th, [make_neg_goal, make_pos_goal]);
paulson@9840
   190
paulson@15579
   191
(*Sort clauses by number of literals*)
paulson@15579
   192
fun fewerlits(th1,th2) = nliterals(prop_of th1) < nliterals(prop_of th2);
paulson@9840
   193
paulson@15579
   194
(*TAUTOLOGY CHECK SHOULD NOT BE NECESSARY!*)
paulson@15579
   195
fun sort_clauses ths = sort (make_ord fewerlits) (List.filter (not o is_taut) ths);
paulson@9840
   196
paulson@15579
   197
(*Convert all suitable free variables to schematic variables*)
paulson@15579
   198
fun generalize th = forall_elim_vars 0 (forall_intr_frees th);
paulson@9840
   199
paulson@15581
   200
(*True if the given type contains bool anywhere*)
paulson@15581
   201
fun has_bool (Type("bool",_)) = true
paulson@15581
   202
  | has_bool (Type(_, Ts)) = exists has_bool Ts
paulson@15581
   203
  | has_bool _ = false;
paulson@15581
   204
  
paulson@15613
   205
(*Is the string the name of a connective? It doesn't matter if this list is
paulson@15613
   206
  incomplete, since when actually called, the only connectives likely to
paulson@15613
   207
  remain are & | Not.*)  
paulson@15613
   208
fun is_conn c = c mem_string
paulson@15613
   209
    ["Trueprop", "op &", "op |", "op -->", "op =", "Not", 
paulson@15613
   210
     "All", "Ex", "Ball", "Bex"];
paulson@15613
   211
paulson@15613
   212
(*True if the term contains a function where the type of any argument contains
paulson@15613
   213
  bool.*)
paulson@15613
   214
val has_bool_arg_const = 
paulson@15613
   215
    exists_Const
paulson@15613
   216
      (fn (c,T) => not(is_conn c) andalso exists (has_bool) (binder_types T));
paulson@15613
   217
  
paulson@15581
   218
(*Raises an exception if any Vars in the theorem mention type bool. That would mean
paulson@15613
   219
  they are higher-order, and in addition, they could cause make_horn to loop!
paulson@15613
   220
  Functions taking Boolean arguments are also rejected.*)
paulson@15581
   221
fun check_no_bool th =
paulson@15613
   222
  let val {prop,...} = rep_thm th
paulson@15613
   223
  in if exists (has_bool o fastype_of) (term_vars prop) orelse
paulson@15613
   224
        has_bool_arg_const prop
paulson@15613
   225
  then raise THM ("check_no_bool", 0, [th]) else th
paulson@15613
   226
  end;
paulson@15581
   227
paulson@15579
   228
(*Create a meta-level Horn clause*)
paulson@15579
   229
fun make_horn crules th = make_horn crules (tryres(th,crules))
paulson@15579
   230
			  handle THM _ => th;
paulson@9840
   231
paulson@15579
   232
(*Generate Horn clauses for all contrapositives of a clause*)
paulson@15579
   233
fun add_contras crules (th,hcs) =
paulson@15579
   234
  let fun rots (0,th) = hcs
paulson@15579
   235
	| rots (k,th) = zero_var_indexes (make_horn crules th) ::
paulson@15579
   236
			rots(k-1, assoc_right (th RS disj_comm))
paulson@15581
   237
  in case nliterals(prop_of (check_no_bool th)) of
paulson@15579
   238
	1 => th::hcs
paulson@15579
   239
      | n => rots(n, assoc_right th)
paulson@15579
   240
  end;
paulson@9840
   241
paulson@15579
   242
(*Use "theorem naming" to label the clauses*)
paulson@15579
   243
fun name_thms label =
paulson@15579
   244
    let fun name1 (th, (k,ths)) =
paulson@15579
   245
	  (k-1, Thm.name_thm (label ^ string_of_int k, th) :: ths)
paulson@9840
   246
paulson@15579
   247
    in  fn ths => #2 (foldr name1 (length ths, []) ths)  end;
paulson@9840
   248
paulson@15579
   249
(*Find an all-negative support clause*)
paulson@15579
   250
fun is_negative th = forall (not o #1) (literals (prop_of th));
paulson@9840
   251
paulson@15579
   252
val neg_clauses = List.filter is_negative;
paulson@9840
   253
paulson@9840
   254
paulson@15579
   255
(***** MESON PROOF PROCEDURE *****)
paulson@9840
   256
paulson@15579
   257
fun rhyps (Const("==>",_) $ (Const("Trueprop",_) $ A) $ phi,
paulson@15579
   258
	   As) = rhyps(phi, A::As)
paulson@15579
   259
  | rhyps (_, As) = As;
paulson@9840
   260
paulson@15579
   261
(** Detecting repeated assumptions in a subgoal **)
paulson@9840
   262
paulson@15579
   263
(*The stringtree detects repeated assumptions.*)
paulson@15579
   264
fun ins_term (net,t) = Net.insert_term((t,t), net, op aconv);
paulson@9840
   265
paulson@15579
   266
(*detects repetitions in a list of terms*)
paulson@15579
   267
fun has_reps [] = false
paulson@15579
   268
  | has_reps [_] = false
paulson@15579
   269
  | has_reps [t,u] = (t aconv u)
paulson@15579
   270
  | has_reps ts = (Library.foldl ins_term (Net.empty, ts);  false)
paulson@15579
   271
		  handle INSERT => true;
paulson@9840
   272
paulson@15579
   273
(*Like TRYALL eq_assume_tac, but avoids expensive THEN calls*)
paulson@15579
   274
fun TRYALL_eq_assume_tac 0 st = Seq.single st
paulson@15579
   275
  | TRYALL_eq_assume_tac i st =
paulson@15579
   276
       TRYALL_eq_assume_tac (i-1) (eq_assumption i st)
paulson@15579
   277
       handle THM _ => TRYALL_eq_assume_tac (i-1) st;
paulson@9840
   278
paulson@15579
   279
(*Loop checking: FAIL if trying to prove the same thing twice
paulson@15579
   280
  -- if *ANY* subgoal has repeated literals*)
paulson@15579
   281
fun check_tac st =
paulson@15579
   282
  if exists (fn prem => has_reps (rhyps(prem,[]))) (prems_of st)
paulson@15579
   283
  then  Seq.empty  else  Seq.single st;
paulson@9840
   284
paulson@9840
   285
paulson@15579
   286
(* net_resolve_tac actually made it slower... *)
paulson@15579
   287
fun prolog_step_tac horns i =
paulson@15579
   288
    (assume_tac i APPEND resolve_tac horns i) THEN check_tac THEN
paulson@15579
   289
    TRYALL eq_assume_tac;
paulson@9840
   290
paulson@9840
   291
(*Sums the sizes of the subgoals, ignoring hypotheses (ancestors)*)
paulson@15579
   292
fun addconcl(prem,sz) = size_of_term(Logic.strip_assums_concl prem) + sz
paulson@15579
   293
paulson@15579
   294
fun size_of_subgoals st = foldr addconcl 0 (prems_of st);
paulson@15579
   295
paulson@9840
   296
paulson@9840
   297
(*Negation Normal Form*)
paulson@9840
   298
val nnf_rls = [imp_to_disjD, iff_to_disjD, not_conjD, not_disjD,
wenzelm@9869
   299
               not_impD, not_iffD, not_allD, not_exD, not_notD];
paulson@15581
   300
paulson@15581
   301
fun make_nnf1 th = make_nnf1 (tryres(th, nnf_rls))
wenzelm@9869
   302
    handle THM _ =>
paulson@15581
   303
        forward_res make_nnf1
wenzelm@9869
   304
           (tryres(th, [conj_forward,disj_forward,all_forward,ex_forward]))
paulson@9840
   305
    handle THM _ => th;
paulson@9840
   306
paulson@15581
   307
fun make_nnf th = make_nnf1 (check_no_bool th);
paulson@15581
   308
paulson@9840
   309
(*Pull existential quantifiers (Skolemization)*)
wenzelm@9869
   310
fun skolemize th =
paulson@9840
   311
  if not (has_consts ["Ex"] (prop_of th)) then th
paulson@9840
   312
  else skolemize (tryres(th, [choice, conj_exD1, conj_exD2,
wenzelm@9869
   313
                              disj_exD, disj_exD1, disj_exD2]))
wenzelm@9869
   314
    handle THM _ =>
wenzelm@9869
   315
        skolemize (forward_res skolemize
wenzelm@9869
   316
                   (tryres (th, [conj_forward, disj_forward, all_forward])))
paulson@9840
   317
    handle THM _ => forward_res skolemize (th RS ex_forward);
paulson@9840
   318
paulson@9840
   319
paulson@9840
   320
(*Make clauses from a list of theorems, previously Skolemized and put into nnf.
paulson@9840
   321
  The resulting clauses are HOL disjunctions.*)
wenzelm@9869
   322
fun make_clauses ths =
skalberg@15574
   323
    sort_clauses (map (generalize o nodups) (foldr cnf [] ths));
paulson@9840
   324
paulson@9840
   325
(*Convert a list of clauses to (contrapositive) Horn clauses*)
wenzelm@9869
   326
fun make_horns ths =
paulson@9840
   327
    name_thms "Horn#"
skalberg@15574
   328
      (gen_distinct Drule.eq_thm_prop (foldr (add_contras clause_rules) [] ths));
paulson@9840
   329
paulson@9840
   330
(*Could simply use nprems_of, which would count remaining subgoals -- no
paulson@9840
   331
  discrimination as to their size!  With BEST_FIRST, fails for problem 41.*)
paulson@9840
   332
wenzelm@9869
   333
fun best_prolog_tac sizef horns =
paulson@9840
   334
    BEST_FIRST (has_fewer_prems 1, sizef) (prolog_step_tac horns 1);
paulson@9840
   335
wenzelm@9869
   336
fun depth_prolog_tac horns =
paulson@9840
   337
    DEPTH_FIRST (has_fewer_prems 1) (prolog_step_tac horns 1);
paulson@9840
   338
paulson@9840
   339
(*Return all negative clauses, as possible goal clauses*)
paulson@9840
   340
fun gocls cls = name_thms "Goal#" (map make_goal (neg_clauses cls));
paulson@9840
   341
paulson@9840
   342
paulson@15008
   343
fun skolemize_prems_tac prems =
paulson@9840
   344
    cut_facts_tac (map (skolemize o make_nnf) prems)  THEN'
paulson@9840
   345
    REPEAT o (etac exE);
paulson@9840
   346
paulson@9840
   347
(*Shell of all meson-tactics.  Supplies cltac with clauses: HOL disjunctions*)
paulson@9840
   348
fun MESON cltac = SELECT_GOAL
paulson@9840
   349
 (EVERY1 [rtac ccontr,
paulson@9840
   350
          METAHYPS (fn negs =>
paulson@15008
   351
                    EVERY1 [skolemize_prems_tac negs,
paulson@9840
   352
                            METAHYPS (cltac o make_clauses)])]);
paulson@9840
   353
paulson@9840
   354
(** Best-first search versions **)
paulson@9840
   355
wenzelm@9869
   356
fun best_meson_tac sizef =
wenzelm@9869
   357
  MESON (fn cls =>
paulson@9840
   358
         THEN_BEST_FIRST (resolve_tac (gocls cls) 1)
paulson@9840
   359
                         (has_fewer_prems 1, sizef)
paulson@9840
   360
                         (prolog_step_tac (make_horns cls) 1));
paulson@9840
   361
paulson@9840
   362
(*First, breaks the goal into independent units*)
paulson@9840
   363
val safe_best_meson_tac =
wenzelm@9869
   364
     SELECT_GOAL (TRY Safe_tac THEN
paulson@9840
   365
                  TRYALL (best_meson_tac size_of_subgoals));
paulson@9840
   366
paulson@9840
   367
(** Depth-first search version **)
paulson@9840
   368
paulson@9840
   369
val depth_meson_tac =
wenzelm@9869
   370
     MESON (fn cls => EVERY [resolve_tac (gocls cls) 1,
paulson@9840
   371
                             depth_prolog_tac (make_horns cls)]);
paulson@9840
   372
paulson@9840
   373
paulson@9840
   374
paulson@9840
   375
(** Iterative deepening version **)
paulson@9840
   376
paulson@9840
   377
(*This version does only one inference per call;
paulson@9840
   378
  having only one eq_assume_tac speeds it up!*)
wenzelm@9869
   379
fun prolog_step_tac' horns =
paulson@9840
   380
    let val (horn0s, hornps) = (*0 subgoals vs 1 or more*)
paulson@9840
   381
            take_prefix Thm.no_prems horns
paulson@9840
   382
        val nrtac = net_resolve_tac horns
paulson@9840
   383
    in  fn i => eq_assume_tac i ORELSE
paulson@9840
   384
                match_tac horn0s i ORELSE  (*no backtracking if unit MATCHES*)
paulson@9840
   385
                ((assume_tac i APPEND nrtac i) THEN check_tac)
paulson@9840
   386
    end;
paulson@9840
   387
wenzelm@9869
   388
fun iter_deepen_prolog_tac horns =
paulson@9840
   389
    ITER_DEEPEN (has_fewer_prems 1) (prolog_step_tac' horns);
paulson@9840
   390
wenzelm@9869
   391
val iter_deepen_meson_tac =
wenzelm@9869
   392
  MESON (fn cls =>
paulson@9840
   393
         (THEN_ITER_DEEPEN (resolve_tac (gocls cls) 1)
paulson@9840
   394
                           (has_fewer_prems 1)
paulson@9840
   395
                           (prolog_step_tac' (make_horns cls))));
paulson@9840
   396
wenzelm@9869
   397
fun meson_claset_tac cs =
wenzelm@9869
   398
  SELECT_GOAL (TRY (safe_tac cs) THEN TRYALL iter_deepen_meson_tac);
wenzelm@9869
   399
wenzelm@9869
   400
val meson_tac = CLASET' meson_claset_tac;
wenzelm@9869
   401
wenzelm@9869
   402
paulson@14813
   403
(**** Code to support ordinary resolution, rather than Model Elimination ****)
paulson@14744
   404
paulson@15008
   405
(*Convert a list of clauses (disjunctions) to meta-level clauses (==>), 
paulson@15008
   406
  with no contrapositives, for ordinary resolution.*)
paulson@14744
   407
paulson@14744
   408
(*Rules to convert the head literal into a negated assumption. If the head
paulson@14744
   409
  literal is already negated, then using notEfalse instead of notEfalse'
paulson@14744
   410
  prevents a double negation.*)
paulson@14744
   411
val notEfalse = read_instantiate [("R","False")] notE;
paulson@14744
   412
val notEfalse' = rotate_prems 1 notEfalse;
paulson@14744
   413
paulson@15448
   414
fun negated_asm_of_head th = 
paulson@14744
   415
    th RS notEfalse handle THM _ => th RS notEfalse';
paulson@14744
   416
paulson@14744
   417
(*Converting one clause*)
paulson@15581
   418
fun make_meta_clause th = 
paulson@15581
   419
	negated_asm_of_head (make_horn resolution_clause_rules (check_no_bool th));
paulson@14744
   420
paulson@14744
   421
fun make_meta_clauses ths =
paulson@14744
   422
    name_thms "MClause#"
paulson@14744
   423
      (gen_distinct Drule.eq_thm_prop (map make_meta_clause ths));
paulson@14744
   424
paulson@14744
   425
(*Permute a rule's premises to move the i-th premise to the last position.*)
paulson@14744
   426
fun make_last i th =
paulson@14744
   427
  let val n = nprems_of th 
paulson@14744
   428
  in  if 1 <= i andalso i <= n 
paulson@14744
   429
      then Thm.permute_prems (i-1) 1 th
paulson@15118
   430
      else raise THM("select_literal", i, [th])
paulson@14744
   431
  end;
paulson@14744
   432
paulson@14744
   433
(*Maps a rule that ends "... ==> P ==> False" to "... ==> ~P" while suppressing
paulson@14744
   434
  double-negations.*)
paulson@14744
   435
val negate_head = rewrite_rule [atomize_not, not_not RS eq_reflection];
paulson@14744
   436
paulson@14744
   437
(*Maps the clause  [P1,...Pn]==>False to [P1,...,P(i-1),P(i+1),...Pn] ==> ~P*)
paulson@14744
   438
fun select_literal i cl = negate_head (make_last i cl);
paulson@14744
   439
paulson@14813
   440
(*Top-level Skolemization. Allows part of the conversion to clauses to be
paulson@14813
   441
  expressed as a tactic (or Isar method).  Each assumption of the selected 
paulson@14813
   442
  goal is converted to NNF and then its existential quantifiers are pulled
paulson@14813
   443
  to the front. Finally, all existential quantifiers are eliminated, 
paulson@14813
   444
  leaving !!-quantified variables. Perhaps Safe_tac should follow, but it
paulson@14813
   445
  might generate many subgoals.*)
paulson@14813
   446
val skolemize_tac = 
paulson@14813
   447
  SUBGOAL
paulson@14813
   448
    (fn (prop,_) =>
paulson@14813
   449
     let val ts = Logic.strip_assums_hyp prop
paulson@14813
   450
     in EVERY1 
paulson@14813
   451
	 [METAHYPS
paulson@14813
   452
	    (fn hyps => (cut_facts_tac (map (skolemize o make_nnf) hyps) 1
paulson@14813
   453
                         THEN REPEAT (etac exE 1))),
paulson@14813
   454
	  REPEAT_DETERM_N (length ts) o (etac thin_rl)]
paulson@14813
   455
     end);
paulson@14813
   456
paulson@15118
   457
(*Top-level conversion to meta-level clauses. Each clause has  
paulson@15118
   458
  leading !!-bound universal variables, to express generality. To get 
paulson@15118
   459
  disjunctions instead of meta-clauses, remove "make_meta_clauses" below.*)
paulson@15008
   460
val make_clauses_tac = 
paulson@15008
   461
  SUBGOAL
paulson@15008
   462
    (fn (prop,_) =>
paulson@15008
   463
     let val ts = Logic.strip_assums_hyp prop
paulson@15008
   464
     in EVERY1 
paulson@15008
   465
	 [METAHYPS
paulson@15008
   466
	    (fn hyps => 
paulson@15151
   467
              (Method.insert_tac
paulson@15118
   468
                (map forall_intr_vars 
paulson@15118
   469
                  (make_meta_clauses (make_clauses hyps))) 1)),
paulson@15008
   470
	  REPEAT_DETERM_N (length ts) o (etac thin_rl)]
paulson@15008
   471
     end);
paulson@15008
   472
paulson@14744
   473
paulson@15579
   474
(*** proof method setup ***)
wenzelm@9869
   475
wenzelm@9869
   476
fun meson_meth ctxt =
wenzelm@10821
   477
  Method.SIMPLE_METHOD' HEADGOAL
wenzelm@15032
   478
    (CHANGED_PROP o meson_claset_tac (local_claset_of ctxt));
wenzelm@9869
   479
paulson@14890
   480
val skolemize_meth =
paulson@14890
   481
  Method.SIMPLE_METHOD' HEADGOAL
paulson@14890
   482
    (CHANGED_PROP o skolemize_tac);
paulson@14890
   483
paulson@15008
   484
val make_clauses_meth =
paulson@15008
   485
  Method.SIMPLE_METHOD' HEADGOAL
paulson@15008
   486
    (CHANGED_PROP o make_clauses_tac);
paulson@15008
   487
wenzelm@9869
   488
wenzelm@9869
   489
val meson_setup =
wenzelm@9869
   490
 [Method.add_methods
paulson@14813
   491
  [("meson", Method.ctxt_args meson_meth, 
paulson@14813
   492
    "The MESON resolution proof procedure"),
paulson@14890
   493
   ("skolemize", Method.no_args skolemize_meth, 
paulson@15008
   494
    "Skolemization into existential quantifiers"),
paulson@15008
   495
   ("make_clauses", Method.no_args make_clauses_meth, 
paulson@15118
   496
    "Conversion to !!-quantified meta-level clauses")]];
paulson@9840
   497
paulson@9840
   498
end;
wenzelm@9869
   499
paulson@15579
   500
structure BasicMeson: BASIC_MESON = Meson;
paulson@15579
   501
open BasicMeson;