src/HOL/Tools/lin_arith.ML
author haftmann
Thu Aug 19 16:08:59 2010 +0200 (2010-08-19)
changeset 38558 32ad17fe2b9c
parent 38549 d0385f2764d8
child 38715 6513ea67d95d
permissions -rw-r--r--
tuned quotes
wenzelm@24092
     1
(*  Title:      HOL/Tools/lin_arith.ML
wenzelm@29288
     2
    Author:     Tjark Weber and Tobias Nipkow, TU Muenchen
wenzelm@24092
     3
wenzelm@24092
     4
HOL setup for linear arithmetic (see Provers/Arith/fast_lin_arith.ML).
wenzelm@24092
     5
*)
wenzelm@24092
     6
wenzelm@24092
     7
signature LIN_ARITH =
wenzelm@24092
     8
sig
wenzelm@35230
     9
  val pre_tac: simpset -> int -> tactic
haftmann@31101
    10
  val simple_tac: Proof.context -> int -> tactic
haftmann@31101
    11
  val tac: Proof.context -> int -> tactic
haftmann@31101
    12
  val simproc: simpset -> term -> thm option
haftmann@31100
    13
  val add_inj_thms: thm list -> Context.generic -> Context.generic
haftmann@31100
    14
  val add_lessD: thm -> Context.generic -> Context.generic
haftmann@31100
    15
  val add_simps: thm list -> Context.generic -> Context.generic
haftmann@31100
    16
  val add_simprocs: simproc list -> Context.generic -> Context.generic
haftmann@31082
    17
  val add_inj_const: string * typ -> Context.generic -> Context.generic
haftmann@31100
    18
  val add_discrete_type: string -> Context.generic -> Context.generic
boehmes@31510
    19
  val set_number_of: (theory -> typ -> int -> cterm) -> Context.generic ->
boehmes@31510
    20
    Context.generic
haftmann@31082
    21
  val setup: Context.generic -> Context.generic
haftmann@31100
    22
  val global_setup: theory -> theory
haftmann@31082
    23
  val split_limit: int Config.T
haftmann@31082
    24
  val neq_limit: int Config.T
wenzelm@32740
    25
  val trace: bool Unsynchronized.ref
wenzelm@24092
    26
end;
wenzelm@24092
    27
haftmann@30686
    28
structure Lin_Arith: LIN_ARITH =
wenzelm@24092
    29
struct
wenzelm@24092
    30
wenzelm@24092
    31
(* Parameters data for general linear arithmetic functor *)
wenzelm@24092
    32
wenzelm@24092
    33
structure LA_Logic: LIN_ARITH_LOGIC =
wenzelm@24092
    34
struct
wenzelm@24092
    35
wenzelm@24092
    36
val ccontr = ccontr;
wenzelm@24092
    37
val conjI = conjI;
wenzelm@24092
    38
val notI = notI;
wenzelm@24092
    39
val sym = sym;
boehmes@31510
    40
val trueI = TrueI;
wenzelm@24092
    41
val not_lessD = @{thm linorder_not_less} RS iffD1;
wenzelm@24092
    42
val not_leD = @{thm linorder_not_le} RS iffD1;
wenzelm@24092
    43
wenzelm@35410
    44
fun mk_Eq thm = thm RS @{thm Eq_FalseI} handle THM _ => thm RS @{thm Eq_TrueI};
wenzelm@24092
    45
wenzelm@24092
    46
val mk_Trueprop = HOLogic.mk_Trueprop;
wenzelm@24092
    47
wenzelm@24092
    48
fun atomize thm = case Thm.prop_of thm of
haftmann@38558
    49
    Const (@{const_name Trueprop}, _) $ (Const (@{const_name "op &"}, _) $ _ $ _) =>
haftmann@31100
    50
    atomize (thm RS conjunct1) @ atomize (thm RS conjunct2)
wenzelm@24092
    51
  | _ => [thm];
wenzelm@24092
    52
haftmann@38558
    53
fun neg_prop ((TP as Const(@{const_name Trueprop}, _)) $ (Const (@{const_name Not}, _) $ t)) = TP $ t
haftmann@38558
    54
  | neg_prop ((TP as Const(@{const_name Trueprop}, _)) $ t) = TP $ (HOLogic.Not $t)
wenzelm@24092
    55
  | neg_prop t = raise TERM ("neg_prop", [t]);
wenzelm@24092
    56
wenzelm@24092
    57
fun is_False thm =
wenzelm@24092
    58
  let val _ $ t = Thm.prop_of thm
haftmann@31100
    59
  in t = HOLogic.false_const end;
wenzelm@24092
    60
haftmann@30686
    61
fun is_nat t = (fastype_of1 t = HOLogic.natT);
wenzelm@24092
    62
haftmann@31100
    63
fun mk_nat_thm thy t =
haftmann@31100
    64
  let
haftmann@31100
    65
    val cn = cterm_of thy (Var (("n", 0), HOLogic.natT))
haftmann@31100
    66
    and ct = cterm_of thy t
haftmann@31100
    67
  in instantiate ([], [(cn, ct)]) @{thm le0} end;
wenzelm@24092
    68
webertj@32369
    69
end;  (* LA_Logic *)
wenzelm@24092
    70
wenzelm@24092
    71
wenzelm@24092
    72
(* arith context data *)
wenzelm@24092
    73
wenzelm@33519
    74
structure Lin_Arith_Data = Generic_Data
wenzelm@24092
    75
(
wenzelm@24092
    76
  type T = {splits: thm list,
wenzelm@24092
    77
            inj_consts: (string * typ) list,
haftmann@30686
    78
            discrete: string list};
haftmann@30686
    79
  val empty = {splits = [], inj_consts = [], discrete = []};
wenzelm@24092
    80
  val extend = I;
wenzelm@33519
    81
  fun merge
haftmann@30686
    82
   ({splits= splits1, inj_consts= inj_consts1, discrete= discrete1},
haftmann@30686
    83
    {splits= splits2, inj_consts= inj_consts2, discrete= discrete2}) : T =
wenzelm@33520
    84
   {splits = Thm.merge_thms (splits1, splits2),
wenzelm@24092
    85
    inj_consts = Library.merge (op =) (inj_consts1, inj_consts2),
haftmann@30686
    86
    discrete = Library.merge (op =) (discrete1, discrete2)};
wenzelm@24092
    87
);
wenzelm@24092
    88
haftmann@31100
    89
val get_arith_data = Lin_Arith_Data.get o Context.Proof;
wenzelm@24092
    90
haftmann@31100
    91
fun add_split thm = Lin_Arith_Data.map (fn {splits, inj_consts, discrete} =>
haftmann@31100
    92
  {splits = update Thm.eq_thm_prop thm splits,
haftmann@31100
    93
   inj_consts = inj_consts, discrete = discrete});
wenzelm@24092
    94
haftmann@31100
    95
fun add_discrete_type d = Lin_Arith_Data.map (fn {splits, inj_consts, discrete} =>
haftmann@30686
    96
  {splits = splits, inj_consts = inj_consts,
haftmann@30686
    97
   discrete = update (op =) d discrete});
wenzelm@24092
    98
haftmann@31100
    99
fun add_inj_const c = Lin_Arith_Data.map (fn {splits, inj_consts, discrete} =>
haftmann@30686
   100
  {splits = splits, inj_consts = update (op =) c inj_consts,
haftmann@30686
   101
   discrete = discrete});
wenzelm@24092
   102
wenzelm@36001
   103
val (split_limit, setup_split_limit) = Attrib.config_int "linarith_split_limit" (K 9);
wenzelm@36001
   104
val (neq_limit, setup_neq_limit) = Attrib.config_int "linarith_neq_limit" (K 9);
wenzelm@24092
   105
wenzelm@24092
   106
haftmann@31100
   107
structure LA_Data =
wenzelm@24092
   108
struct
wenzelm@24092
   109
haftmann@31082
   110
val fast_arith_neq_limit = neq_limit;
wenzelm@24092
   111
wenzelm@24092
   112
wenzelm@24092
   113
(* Decomposition of terms *)
wenzelm@24092
   114
wenzelm@24092
   115
(*internal representation of linear (in-)equations*)
wenzelm@26942
   116
type decomp =
webertj@24328
   117
  ((term * Rat.rat) list * Rat.rat * string * (term * Rat.rat) list * Rat.rat * bool);
wenzelm@24092
   118
wenzelm@24092
   119
fun nT (Type ("fun", [N, _])) = (N = HOLogic.natT)
wenzelm@24092
   120
  | nT _                      = false;
wenzelm@24092
   121
wenzelm@24092
   122
fun add_atom (t : term) (m : Rat.rat) (p : (term * Rat.rat) list, i : Rat.rat) :
wenzelm@24092
   123
             (term * Rat.rat) list * Rat.rat =
nipkow@29548
   124
  case AList.lookup Pattern.aeconv p t of
webertj@24328
   125
      NONE   => ((t, m) :: p, i)
nipkow@29548
   126
    | SOME n => (AList.update Pattern.aeconv (t, Rat.add n m) p, i);
wenzelm@24092
   127
webertj@24328
   128
(* decompose nested multiplications, bracketing them to the right and combining
webertj@24328
   129
   all their coefficients
wenzelm@24092
   130
webertj@24328
   131
   inj_consts: list of constants to be ignored when encountered
webertj@24328
   132
               (e.g. arithmetic type conversions that preserve value)
wenzelm@24092
   133
webertj@24328
   134
   m: multiplicity associated with the entire product
wenzelm@24092
   135
webertj@24328
   136
   returns either (SOME term, associated multiplicity) or (NONE, constant)
webertj@24328
   137
*)
wenzelm@24092
   138
fun demult (inj_consts : (string * typ) list) : term * Rat.rat -> term option * Rat.rat =
wenzelm@24092
   139
let
haftmann@35267
   140
  fun demult ((mC as Const (@{const_name Groups.times}, _)) $ s $ t, m) =
haftmann@35267
   141
      (case s of Const (@{const_name Groups.times}, _) $ s1 $ s2 =>
webertj@24328
   142
        (* bracketing to the right: '(s1 * s2) * t' becomes 's1 * (s2 * t)' *)
wenzelm@24092
   143
        demult (mC $ s1 $ (mC $ s2 $ t), m)
webertj@24328
   144
      | _ =>
webertj@24328
   145
        (* product 's * t', where either factor can be 'NONE' *)
webertj@24328
   146
        (case demult (s, m) of
webertj@24328
   147
          (SOME s', m') =>
webertj@24328
   148
            (case demult (t, m') of
webertj@24328
   149
              (SOME t', m'') => (SOME (mC $ s' $ t'), m'')
webertj@24328
   150
            | (NONE,    m'') => (SOME s', m''))
webertj@24328
   151
        | (NONE,    m') => demult (t, m')))
haftmann@35084
   152
    | demult ((mC as Const (@{const_name Rings.divide}, _)) $ s $ t, m) =
webertj@24328
   153
      (* FIXME: Shouldn't we simplify nested quotients, e.g. '(s/t)/u' could
webertj@24328
   154
         become 's/(t*u)', and '(s*t)/u' could become 's*(t/u)' ?   Note that
webertj@24328
   155
         if we choose to do so here, the simpset used by arith must be able to
webertj@24328
   156
         perform the same simplifications. *)
webertj@24328
   157
      (* FIXME: Currently we treat the numerator as atomic unless the
webertj@24328
   158
         denominator can be reduced to a numeric constant.  It might be better
webertj@24328
   159
         to demult the numerator in any case, and invent a new term of the form
webertj@24328
   160
         '1 / t' if the numerator can be reduced, but the denominator cannot. *)
webertj@24328
   161
      (* FIXME: Currently we even treat the whole fraction as atomic unless the
webertj@24328
   162
         denominator can be reduced to a numeric constant.  It might be better
webertj@25015
   163
         to use the partially reduced denominator (i.e. 's / (2*t)' could be
webertj@24328
   164
         demult'ed to 's / t' with multiplicity .5).   This would require a
webertj@24328
   165
         very simple change only below, but it breaks existing proofs. *)
webertj@24328
   166
      (* quotient 's / t', where the denominator t can be NONE *)
webertj@24328
   167
      (* Note: will raise Rat.DIVZERO iff m' is Rat.zero *)
webertj@24328
   168
      (case demult (t, Rat.one) of
webertj@24328
   169
        (SOME _, _) => (SOME (mC $ s $ t), m)
webertj@24328
   170
      | (NONE,  m') => apsnd (Rat.mult (Rat.inv m')) (demult (s, m)))
webertj@24328
   171
    (* terms that evaluate to numeric constants *)
haftmann@35267
   172
    | demult (Const (@{const_name Groups.uminus}, _) $ t, m) = demult (t, Rat.neg m)
haftmann@35267
   173
    | demult (Const (@{const_name Groups.zero}, _), m) = (NONE, Rat.zero)
haftmann@35267
   174
    | demult (Const (@{const_name Groups.one}, _), m) = (NONE, m)
webertj@24328
   175
    (*Warning: in rare cases number_of encloses a non-numeral,
webertj@24328
   176
      in which case dest_numeral raises TERM; hence all the handles below.
webertj@24328
   177
      Same for Suc-terms that turn out not to be numerals -
webertj@24328
   178
      although the simplifier should eliminate those anyway ...*)
haftmann@25919
   179
    | demult (t as Const ("Int.number_class.number_of", _) $ n, m) =
webertj@24328
   180
      ((NONE, Rat.mult m (Rat.rat_of_int (HOLogic.dest_numeral n)))
webertj@24328
   181
        handle TERM _ => (SOME t, m))
webertj@24328
   182
    | demult (t as Const (@{const_name Suc}, _) $ _, m) =
webertj@24328
   183
      ((NONE, Rat.mult m (Rat.rat_of_int (HOLogic.dest_nat t)))
webertj@24328
   184
        handle TERM _ => (SOME t, m))
webertj@24328
   185
    (* injection constants are ignored *)
wenzelm@24092
   186
    | demult (t as Const f $ x, m) =
webertj@24328
   187
      if member (op =) inj_consts f then demult (x, m) else (SOME t, m)
webertj@24328
   188
    (* everything else is considered atomic *)
wenzelm@24092
   189
    | demult (atom, m) = (SOME atom, m)
wenzelm@24092
   190
in demult end;
wenzelm@24092
   191
wenzelm@24092
   192
fun decomp0 (inj_consts : (string * typ) list) (rel : string, lhs : term, rhs : term) :
wenzelm@24092
   193
            ((term * Rat.rat) list * Rat.rat * string * (term * Rat.rat) list * Rat.rat) option =
wenzelm@24092
   194
let
webertj@24328
   195
  (* Turns a term 'all' and associated multiplicity 'm' into a list 'p' of
webertj@24328
   196
     summands and associated multiplicities, plus a constant 'i' (with implicit
webertj@24328
   197
     multiplicity 1) *)
haftmann@35267
   198
  fun poly (Const (@{const_name Groups.plus}, _) $ s $ t,
wenzelm@24092
   199
        m : Rat.rat, pi : (term * Rat.rat) list * Rat.rat) = poly (s, m, poly (t, m, pi))
haftmann@35267
   200
    | poly (all as Const (@{const_name Groups.minus}, T) $ s $ t, m, pi) =
wenzelm@24092
   201
        if nT T then add_atom all m pi else poly (s, m, poly (t, Rat.neg m, pi))
haftmann@35267
   202
    | poly (all as Const (@{const_name Groups.uminus}, T) $ t, m, pi) =
wenzelm@24092
   203
        if nT T then add_atom all m pi else poly (t, Rat.neg m, pi)
haftmann@35267
   204
    | poly (Const (@{const_name Groups.zero}, _), _, pi) =
wenzelm@24092
   205
        pi
haftmann@35267
   206
    | poly (Const (@{const_name Groups.one}, _), m, (p, i)) =
wenzelm@24092
   207
        (p, Rat.add i m)
wenzelm@24092
   208
    | poly (Const (@{const_name Suc}, _) $ t, m, (p, i)) =
wenzelm@24092
   209
        poly (t, m, (p, Rat.add i m))
haftmann@35267
   210
    | poly (all as Const (@{const_name Groups.times}, _) $ _ $ _, m, pi as (p, i)) =
wenzelm@24092
   211
        (case demult inj_consts (all, m) of
wenzelm@24092
   212
           (NONE,   m') => (p, Rat.add i m')
wenzelm@24092
   213
         | (SOME u, m') => add_atom u m' pi)
haftmann@35084
   214
    | poly (all as Const (@{const_name Rings.divide}, _) $ _ $ _, m, pi as (p, i)) =
wenzelm@24092
   215
        (case demult inj_consts (all, m) of
wenzelm@24092
   216
           (NONE,   m') => (p, Rat.add i m')
wenzelm@24092
   217
         | (SOME u, m') => add_atom u m' pi)
haftmann@25919
   218
    | poly (all as Const ("Int.number_class.number_of", Type(_,[_,T])) $ t, m, pi as (p, i)) =
wenzelm@24092
   219
        (let val k = HOLogic.dest_numeral t
wenzelm@24092
   220
            val k2 = if k < 0 andalso T = HOLogic.natT then 0 else k
wenzelm@24092
   221
        in (p, Rat.add i (Rat.mult m (Rat.rat_of_int k2))) end
wenzelm@24092
   222
        handle TERM _ => add_atom all m pi)
wenzelm@24092
   223
    | poly (all as Const f $ x, m, pi) =
haftmann@36692
   224
        if member (op =) inj_consts f then poly (x, m, pi) else add_atom all m pi
wenzelm@24092
   225
    | poly (all, m, pi) =
wenzelm@24092
   226
        add_atom all m pi
wenzelm@24092
   227
  val (p, i) = poly (lhs, Rat.one, ([], Rat.zero))
wenzelm@24092
   228
  val (q, j) = poly (rhs, Rat.one, ([], Rat.zero))
wenzelm@24092
   229
in
wenzelm@24092
   230
  case rel of
haftmann@35092
   231
    @{const_name Orderings.less}    => SOME (p, i, "<", q, j)
haftmann@35092
   232
  | @{const_name Orderings.less_eq} => SOME (p, i, "<=", q, j)
wenzelm@24092
   233
  | "op ="              => SOME (p, i, "=", q, j)
wenzelm@24092
   234
  | _                   => NONE
webertj@24328
   235
end handle Rat.DIVZERO => NONE;
wenzelm@24092
   236
wenzelm@24271
   237
fun of_lin_arith_sort thy U =
haftmann@35050
   238
  Sign.of_sort thy (U, @{sort Rings.linordered_idom});
wenzelm@24092
   239
haftmann@31101
   240
fun allows_lin_arith thy (discrete : string list) (U as Type (D, [])) : bool * bool =
haftmann@31101
   241
      if of_lin_arith_sort thy U then (true, member (op =) discrete D)
haftmann@31101
   242
      else if member (op =) discrete D then (true, true) else (false, false)
haftmann@31101
   243
  | allows_lin_arith sg discrete U = (of_lin_arith_sort sg U, false);
wenzelm@24092
   244
wenzelm@26942
   245
fun decomp_typecheck (thy, discrete, inj_consts) (T : typ, xxx) : decomp option =
wenzelm@24092
   246
  case T of
wenzelm@24092
   247
    Type ("fun", [U, _]) =>
wenzelm@24092
   248
      (case allows_lin_arith thy discrete U of
wenzelm@24092
   249
        (true, d) =>
wenzelm@24092
   250
          (case decomp0 inj_consts xxx of
wenzelm@24092
   251
            NONE                   => NONE
wenzelm@24092
   252
          | SOME (p, i, rel, q, j) => SOME (p, i, rel, q, j, d))
wenzelm@24092
   253
      | (false, _) =>
wenzelm@24092
   254
          NONE)
wenzelm@24092
   255
  | _ => NONE;
wenzelm@24092
   256
wenzelm@24092
   257
fun negate (SOME (x, i, rel, y, j, d)) = SOME (x, i, "~" ^ rel, y, j, d)
wenzelm@24092
   258
  | negate NONE                        = NONE;
wenzelm@24092
   259
wenzelm@24092
   260
fun decomp_negation data
haftmann@38558
   261
  ((Const (@{const_name Trueprop}, _)) $ (Const (rel, T) $ lhs $ rhs)) : decomp option =
wenzelm@24092
   262
      decomp_typecheck data (T, (rel, lhs, rhs))
haftmann@38558
   263
  | decomp_negation data ((Const (@{const_name Trueprop}, _)) $
haftmann@38558
   264
  (Const (@{const_name Not}, _) $ (Const (rel, T) $ lhs $ rhs))) =
wenzelm@24092
   265
      negate (decomp_typecheck data (T, (rel, lhs, rhs)))
wenzelm@24092
   266
  | decomp_negation data _ =
wenzelm@24092
   267
      NONE;
wenzelm@24092
   268
wenzelm@26942
   269
fun decomp ctxt : term -> decomp option =
wenzelm@24092
   270
  let
wenzelm@24092
   271
    val thy = ProofContext.theory_of ctxt
wenzelm@24092
   272
    val {discrete, inj_consts, ...} = get_arith_data ctxt
wenzelm@24092
   273
  in decomp_negation (thy, discrete, inj_consts) end;
wenzelm@24092
   274
wenzelm@24092
   275
fun domain_is_nat (_ $ (Const (_, T) $ _ $ _))                      = nT T
haftmann@38558
   276
  | domain_is_nat (_ $ (Const (@{const_name Not}, _) $ (Const (_, T) $ _ $ _))) = nT T
wenzelm@24092
   277
  | domain_is_nat _                                                 = false;
wenzelm@24092
   278
wenzelm@24092
   279
wenzelm@24092
   280
(*---------------------------------------------------------------------------*)
webertj@32369
   281
(* the following code performs splitting of certain constants (e.g., min,    *)
wenzelm@24092
   282
(* max) in a linear arithmetic problem; similar to what split_tac later does *)
wenzelm@24092
   283
(* to the proof state                                                        *)
wenzelm@24092
   284
(*---------------------------------------------------------------------------*)
wenzelm@24092
   285
wenzelm@24092
   286
(* checks if splitting with 'thm' is implemented                             *)
wenzelm@24092
   287
wenzelm@32091
   288
fun is_split_thm thm =
wenzelm@24092
   289
  case concl_of thm of _ $ (_ $ (_ $ lhs) $ _) => (
wenzelm@24092
   290
    (* Trueprop $ ((op =) $ (?P $ lhs) $ rhs) *)
wenzelm@24092
   291
    case head_of lhs of
wenzelm@24092
   292
      Const (a, _) => member (op =) [@{const_name Orderings.max},
wenzelm@24092
   293
                                    @{const_name Orderings.min},
haftmann@35092
   294
                                    @{const_name Groups.abs},
haftmann@35267
   295
                                    @{const_name Groups.minus},
haftmann@34974
   296
                                    "Int.nat" (*DYNAMIC BINDING!*),
haftmann@34974
   297
                                    "Divides.div_class.mod" (*DYNAMIC BINDING!*),
haftmann@34974
   298
                                    "Divides.div_class.div" (*DYNAMIC BINDING!*)] a
wenzelm@24092
   299
    | _            => (warning ("Lin. Arith.: wrong format for split rule " ^
wenzelm@32091
   300
                                 Display.string_of_thm_without_context thm);
wenzelm@24092
   301
                       false))
wenzelm@24092
   302
  | _ => (warning ("Lin. Arith.: wrong format for split rule " ^
wenzelm@32091
   303
                   Display.string_of_thm_without_context thm);
wenzelm@24092
   304
          false);
wenzelm@24092
   305
wenzelm@24092
   306
(* substitute new for occurrences of old in a term, incrementing bound       *)
wenzelm@24092
   307
(* variables as needed when substituting inside an abstraction               *)
wenzelm@24092
   308
wenzelm@24092
   309
fun subst_term ([] : (term * term) list) (t : term) = t
wenzelm@24092
   310
  | subst_term pairs                     t          =
nipkow@29528
   311
      (case AList.lookup Pattern.aeconv pairs t of
wenzelm@24092
   312
        SOME new =>
wenzelm@24092
   313
          new
wenzelm@24092
   314
      | NONE     =>
wenzelm@24092
   315
          (case t of Abs (a, T, body) =>
wenzelm@24092
   316
            let val pairs' = map (pairself (incr_boundvars 1)) pairs
wenzelm@24092
   317
            in  Abs (a, T, subst_term pairs' body)  end
wenzelm@24092
   318
          | t1 $ t2                   =>
wenzelm@24092
   319
            subst_term pairs t1 $ subst_term pairs t2
wenzelm@24092
   320
          | _ => t));
wenzelm@24092
   321
wenzelm@24092
   322
(* approximates the effect of one application of split_tac (followed by NNF  *)
wenzelm@24092
   323
(* normalization) on the subgoal represented by '(Ts, terms)'; returns a     *)
wenzelm@24092
   324
(* list of new subgoals (each again represented by a typ list for bound      *)
wenzelm@24092
   325
(* variables and a term list for premises), or NONE if split_tac would fail  *)
wenzelm@24092
   326
(* on the subgoal                                                            *)
wenzelm@24092
   327
wenzelm@24092
   328
(* FIXME: currently only the effect of certain split theorems is reproduced  *)
wenzelm@24092
   329
(*        (which is why we need 'is_split_thm').  A more canonical           *)
wenzelm@24092
   330
(*        implementation should analyze the right-hand side of the split     *)
wenzelm@24092
   331
(*        theorem that can be applied, and modify the subgoal accordingly.   *)
wenzelm@24092
   332
(*        Or even better, the splitter should be extended to provide         *)
wenzelm@24092
   333
(*        splitting on terms as well as splitting on theorems (where the     *)
wenzelm@24092
   334
(*        former can have a faster implementation as it does not need to be  *)
wenzelm@24092
   335
(*        proof-producing).                                                  *)
wenzelm@24092
   336
wenzelm@24092
   337
fun split_once_items ctxt (Ts : typ list, terms : term list) :
wenzelm@24092
   338
                     (typ list * term list) list option =
wenzelm@24092
   339
let
wenzelm@24092
   340
  val thy = ProofContext.theory_of ctxt
wenzelm@24092
   341
  (* takes a list  [t1, ..., tn]  to the term                                *)
wenzelm@24092
   342
  (*   tn' --> ... --> t1' --> False  ,                                      *)
wenzelm@24092
   343
  (* where ti' = HOLogic.dest_Trueprop ti                                    *)
webertj@32369
   344
  fun REPEAT_DETERM_etac_rev_mp tms =
webertj@32369
   345
    fold (curry HOLogic.mk_imp) (map HOLogic.dest_Trueprop tms)
webertj@32369
   346
      HOLogic.false_const
webertj@32369
   347
  val split_thms  = filter is_split_thm (#splits (get_arith_data ctxt))
webertj@32369
   348
  val cmap        = Splitter.cmap_of_split_thms split_thms
webertj@32369
   349
  val goal_tm     = REPEAT_DETERM_etac_rev_mp terms
webertj@32369
   350
  val splits      = Splitter.split_posns cmap thy Ts goal_tm
haftmann@31082
   351
  val split_limit = Config.get ctxt split_limit
wenzelm@24092
   352
in
webertj@32369
   353
  if length splits > split_limit then (
webertj@32369
   354
    tracing ("linarith_split_limit exceeded (current value is " ^
webertj@32369
   355
      string_of_int split_limit ^ ")");
webertj@32369
   356
    NONE
webertj@32369
   357
  ) else case splits of
webertj@32369
   358
    [] =>
wenzelm@24092
   359
    (* split_tac would fail: no possible split *)
wenzelm@24092
   360
    NONE
webertj@32369
   361
  | (_, _::_, _, _, _) :: _ =>
webertj@32369
   362
    (* disallow a split that involves non-locally bound variables (except    *)
webertj@32369
   363
    (* when bound by outermost meta-quantifiers)                             *)
webertj@32369
   364
    NONE
webertj@32369
   365
  | (_, [], _, split_type, split_term) :: _ =>
webertj@32369
   366
    (* ignore all but the first possible split                               *)
webertj@32369
   367
    (case strip_comb split_term of
wenzelm@24092
   368
    (* ?P (max ?i ?j) = ((?i <= ?j --> ?P ?j) & (~ ?i <= ?j --> ?P ?i)) *)
wenzelm@24092
   369
      (Const (@{const_name Orderings.max}, _), [t1, t2]) =>
wenzelm@24092
   370
      let
wenzelm@24092
   371
        val rev_terms     = rev terms
wenzelm@24092
   372
        val terms1        = map (subst_term [(split_term, t1)]) rev_terms
wenzelm@24092
   373
        val terms2        = map (subst_term [(split_term, t2)]) rev_terms
haftmann@35092
   374
        val t1_leq_t2     = Const (@{const_name Orderings.less_eq},
wenzelm@24092
   375
                                    split_type --> split_type --> HOLogic.boolT) $ t1 $ t2
wenzelm@24092
   376
        val not_t1_leq_t2 = HOLogic.Not $ t1_leq_t2
wenzelm@24092
   377
        val not_false     = HOLogic.mk_Trueprop (HOLogic.Not $ HOLogic.false_const)
wenzelm@24092
   378
        val subgoal1      = (HOLogic.mk_Trueprop t1_leq_t2) :: terms2 @ [not_false]
wenzelm@24092
   379
        val subgoal2      = (HOLogic.mk_Trueprop not_t1_leq_t2) :: terms1 @ [not_false]
wenzelm@24092
   380
      in
wenzelm@24092
   381
        SOME [(Ts, subgoal1), (Ts, subgoal2)]
wenzelm@24092
   382
      end
wenzelm@24092
   383
    (* ?P (min ?i ?j) = ((?i <= ?j --> ?P ?i) & (~ ?i <= ?j --> ?P ?j)) *)
wenzelm@24092
   384
    | (Const (@{const_name Orderings.min}, _), [t1, t2]) =>
wenzelm@24092
   385
      let
wenzelm@24092
   386
        val rev_terms     = rev terms
wenzelm@24092
   387
        val terms1        = map (subst_term [(split_term, t1)]) rev_terms
wenzelm@24092
   388
        val terms2        = map (subst_term [(split_term, t2)]) rev_terms
haftmann@35092
   389
        val t1_leq_t2     = Const (@{const_name Orderings.less_eq},
wenzelm@24092
   390
                                    split_type --> split_type --> HOLogic.boolT) $ t1 $ t2
wenzelm@24092
   391
        val not_t1_leq_t2 = HOLogic.Not $ t1_leq_t2
wenzelm@24092
   392
        val not_false     = HOLogic.mk_Trueprop (HOLogic.Not $ HOLogic.false_const)
wenzelm@24092
   393
        val subgoal1      = (HOLogic.mk_Trueprop t1_leq_t2) :: terms1 @ [not_false]
wenzelm@24092
   394
        val subgoal2      = (HOLogic.mk_Trueprop not_t1_leq_t2) :: terms2 @ [not_false]
wenzelm@24092
   395
      in
wenzelm@24092
   396
        SOME [(Ts, subgoal1), (Ts, subgoal2)]
wenzelm@24092
   397
      end
wenzelm@24092
   398
    (* ?P (abs ?a) = ((0 <= ?a --> ?P ?a) & (?a < 0 --> ?P (- ?a))) *)
haftmann@35092
   399
    | (Const (@{const_name Groups.abs}, _), [t1]) =>
wenzelm@24092
   400
      let
wenzelm@24092
   401
        val rev_terms   = rev terms
wenzelm@24092
   402
        val terms1      = map (subst_term [(split_term, t1)]) rev_terms
haftmann@35267
   403
        val terms2      = map (subst_term [(split_term, Const (@{const_name Groups.uminus},
wenzelm@24092
   404
                            split_type --> split_type) $ t1)]) rev_terms
haftmann@35267
   405
        val zero        = Const (@{const_name Groups.zero}, split_type)
haftmann@35092
   406
        val zero_leq_t1 = Const (@{const_name Orderings.less_eq},
wenzelm@24092
   407
                            split_type --> split_type --> HOLogic.boolT) $ zero $ t1
haftmann@35092
   408
        val t1_lt_zero  = Const (@{const_name Orderings.less},
wenzelm@24092
   409
                            split_type --> split_type --> HOLogic.boolT) $ t1 $ zero
wenzelm@24092
   410
        val not_false   = HOLogic.mk_Trueprop (HOLogic.Not $ HOLogic.false_const)
wenzelm@24092
   411
        val subgoal1    = (HOLogic.mk_Trueprop zero_leq_t1) :: terms1 @ [not_false]
wenzelm@24092
   412
        val subgoal2    = (HOLogic.mk_Trueprop t1_lt_zero) :: terms2 @ [not_false]
wenzelm@24092
   413
      in
wenzelm@24092
   414
        SOME [(Ts, subgoal1), (Ts, subgoal2)]
wenzelm@24092
   415
      end
wenzelm@24092
   416
    (* ?P (?a - ?b) = ((?a < ?b --> ?P 0) & (ALL d. ?a = ?b + d --> ?P d)) *)
haftmann@35267
   417
    | (Const (@{const_name Groups.minus}, _), [t1, t2]) =>
wenzelm@24092
   418
      let
wenzelm@24092
   419
        (* "d" in the above theorem becomes a new bound variable after NNF   *)
wenzelm@24092
   420
        (* transformation, therefore some adjustment of indices is necessary *)
wenzelm@24092
   421
        val rev_terms       = rev terms
haftmann@35267
   422
        val zero            = Const (@{const_name Groups.zero}, split_type)
wenzelm@24092
   423
        val d               = Bound 0
wenzelm@24092
   424
        val terms1          = map (subst_term [(split_term, zero)]) rev_terms
wenzelm@24092
   425
        val terms2          = map (subst_term [(incr_boundvars 1 split_term, d)])
wenzelm@24092
   426
                                (map (incr_boundvars 1) rev_terms)
wenzelm@24092
   427
        val t1'             = incr_boundvars 1 t1
wenzelm@24092
   428
        val t2'             = incr_boundvars 1 t2
haftmann@35092
   429
        val t1_lt_t2        = Const (@{const_name Orderings.less},
wenzelm@24092
   430
                                split_type --> split_type --> HOLogic.boolT) $ t1 $ t2
haftmann@38549
   431
        val t1_eq_t2_plus_d = Const (@{const_name "op ="}, split_type --> split_type --> HOLogic.boolT) $ t1' $
haftmann@35267
   432
                                (Const (@{const_name Groups.plus},
wenzelm@24092
   433
                                  split_type --> split_type --> split_type) $ t2' $ d)
wenzelm@24092
   434
        val not_false       = HOLogic.mk_Trueprop (HOLogic.Not $ HOLogic.false_const)
wenzelm@24092
   435
        val subgoal1        = (HOLogic.mk_Trueprop t1_lt_t2) :: terms1 @ [not_false]
wenzelm@24092
   436
        val subgoal2        = (HOLogic.mk_Trueprop t1_eq_t2_plus_d) :: terms2 @ [not_false]
wenzelm@24092
   437
      in
wenzelm@24092
   438
        SOME [(Ts, subgoal1), (split_type :: Ts, subgoal2)]
wenzelm@24092
   439
      end
webertj@33728
   440
    (* ?P (nat ?i) = ((ALL n. ?i = of_nat n --> ?P n) & (?i < 0 --> ?P 0)) *)
haftmann@25919
   441
    | (Const ("Int.nat", _), [t1]) =>
wenzelm@24092
   442
      let
wenzelm@24092
   443
        val rev_terms   = rev terms
haftmann@35267
   444
        val zero_int    = Const (@{const_name Groups.zero}, HOLogic.intT)
haftmann@35267
   445
        val zero_nat    = Const (@{const_name Groups.zero}, HOLogic.natT)
wenzelm@24092
   446
        val n           = Bound 0
wenzelm@24092
   447
        val terms1      = map (subst_term [(incr_boundvars 1 split_term, n)])
wenzelm@24092
   448
                            (map (incr_boundvars 1) rev_terms)
wenzelm@24092
   449
        val terms2      = map (subst_term [(split_term, zero_nat)]) rev_terms
wenzelm@24092
   450
        val t1'         = incr_boundvars 1 t1
haftmann@38549
   451
        val t1_eq_nat_n = Const (@{const_name "op ="}, HOLogic.intT --> HOLogic.intT --> HOLogic.boolT) $ t1' $
haftmann@24196
   452
                            (Const (@{const_name of_nat}, HOLogic.natT --> HOLogic.intT) $ n)
haftmann@35092
   453
        val t1_lt_zero  = Const (@{const_name Orderings.less},
wenzelm@24092
   454
                            HOLogic.intT --> HOLogic.intT --> HOLogic.boolT) $ t1 $ zero_int
wenzelm@24092
   455
        val not_false   = HOLogic.mk_Trueprop (HOLogic.Not $ HOLogic.false_const)
webertj@33728
   456
        val subgoal1    = (HOLogic.mk_Trueprop t1_eq_nat_n) :: terms1 @ [not_false]
wenzelm@24092
   457
        val subgoal2    = (HOLogic.mk_Trueprop t1_lt_zero) :: terms2 @ [not_false]
wenzelm@24092
   458
      in
wenzelm@24092
   459
        SOME [(HOLogic.natT :: Ts, subgoal1), (Ts, subgoal2)]
wenzelm@24092
   460
      end
webertj@33719
   461
    (* ?P ((?n::nat) mod (number_of ?k)) =
wenzelm@24092
   462
         ((number_of ?k = 0 --> ?P ?n) & (~ (number_of ?k = 0) -->
wenzelm@24092
   463
           (ALL i j. j < number_of ?k --> ?n = number_of ?k * i + j --> ?P j))) *)
haftmann@37388
   464
    | (Const ("Divides.div_class.mod", Type ("fun", [@{typ nat}, _])), [t1, t2]) =>
wenzelm@24092
   465
      let
wenzelm@24092
   466
        val rev_terms               = rev terms
haftmann@35267
   467
        val zero                    = Const (@{const_name Groups.zero}, split_type)
wenzelm@24092
   468
        val i                       = Bound 1
wenzelm@24092
   469
        val j                       = Bound 0
wenzelm@24092
   470
        val terms1                  = map (subst_term [(split_term, t1)]) rev_terms
wenzelm@24092
   471
        val terms2                  = map (subst_term [(incr_boundvars 2 split_term, j)])
wenzelm@24092
   472
                                        (map (incr_boundvars 2) rev_terms)
wenzelm@24092
   473
        val t1'                     = incr_boundvars 2 t1
wenzelm@24092
   474
        val t2'                     = incr_boundvars 2 t2
haftmann@38549
   475
        val t2_eq_zero              = Const (@{const_name "op ="},
wenzelm@24092
   476
                                        split_type --> split_type --> HOLogic.boolT) $ t2 $ zero
haftmann@38549
   477
        val t2_neq_zero             = HOLogic.mk_not (Const (@{const_name "op ="},
wenzelm@24092
   478
                                        split_type --> split_type --> HOLogic.boolT) $ t2' $ zero)
haftmann@35092
   479
        val j_lt_t2                 = Const (@{const_name Orderings.less},
wenzelm@24092
   480
                                        split_type --> split_type--> HOLogic.boolT) $ j $ t2'
haftmann@38549
   481
        val t1_eq_t2_times_i_plus_j = Const (@{const_name "op ="}, split_type --> split_type --> HOLogic.boolT) $ t1' $
haftmann@35267
   482
                                       (Const (@{const_name Groups.plus}, split_type --> split_type --> split_type) $
haftmann@35267
   483
                                         (Const (@{const_name Groups.times},
wenzelm@24092
   484
                                           split_type --> split_type --> split_type) $ t2' $ i) $ j)
wenzelm@24092
   485
        val not_false               = HOLogic.mk_Trueprop (HOLogic.Not $ HOLogic.false_const)
wenzelm@24092
   486
        val subgoal1                = (HOLogic.mk_Trueprop t2_eq_zero) :: terms1 @ [not_false]
wenzelm@24092
   487
        val subgoal2                = (map HOLogic.mk_Trueprop
wenzelm@24092
   488
                                        [t2_neq_zero, j_lt_t2, t1_eq_t2_times_i_plus_j])
wenzelm@24092
   489
                                          @ terms2 @ [not_false]
wenzelm@24092
   490
      in
wenzelm@24092
   491
        SOME [(Ts, subgoal1), (split_type :: split_type :: Ts, subgoal2)]
wenzelm@24092
   492
      end
webertj@33719
   493
    (* ?P ((?n::nat) div (number_of ?k)) =
wenzelm@24092
   494
         ((number_of ?k = 0 --> ?P 0) & (~ (number_of ?k = 0) -->
wenzelm@24092
   495
           (ALL i j. j < number_of ?k --> ?n = number_of ?k * i + j --> ?P i))) *)
haftmann@37388
   496
    | (Const ("Divides.div_class.div", Type ("fun", [@{typ nat}, _])), [t1, t2]) =>
wenzelm@24092
   497
      let
wenzelm@24092
   498
        val rev_terms               = rev terms
haftmann@35267
   499
        val zero                    = Const (@{const_name Groups.zero}, split_type)
wenzelm@24092
   500
        val i                       = Bound 1
wenzelm@24092
   501
        val j                       = Bound 0
wenzelm@24092
   502
        val terms1                  = map (subst_term [(split_term, zero)]) rev_terms
wenzelm@24092
   503
        val terms2                  = map (subst_term [(incr_boundvars 2 split_term, i)])
wenzelm@24092
   504
                                        (map (incr_boundvars 2) rev_terms)
wenzelm@24092
   505
        val t1'                     = incr_boundvars 2 t1
wenzelm@24092
   506
        val t2'                     = incr_boundvars 2 t2
haftmann@38549
   507
        val t2_eq_zero              = Const (@{const_name "op ="},
wenzelm@24092
   508
                                        split_type --> split_type --> HOLogic.boolT) $ t2 $ zero
haftmann@38549
   509
        val t2_neq_zero             = HOLogic.mk_not (Const (@{const_name "op ="},
wenzelm@24092
   510
                                        split_type --> split_type --> HOLogic.boolT) $ t2' $ zero)
haftmann@35092
   511
        val j_lt_t2                 = Const (@{const_name Orderings.less},
wenzelm@24092
   512
                                        split_type --> split_type--> HOLogic.boolT) $ j $ t2'
haftmann@38549
   513
        val t1_eq_t2_times_i_plus_j = Const (@{const_name "op ="}, split_type --> split_type --> HOLogic.boolT) $ t1' $
haftmann@35267
   514
                                       (Const (@{const_name Groups.plus}, split_type --> split_type --> split_type) $
haftmann@35267
   515
                                         (Const (@{const_name Groups.times},
wenzelm@24092
   516
                                           split_type --> split_type --> split_type) $ t2' $ i) $ j)
wenzelm@24092
   517
        val not_false               = HOLogic.mk_Trueprop (HOLogic.Not $ HOLogic.false_const)
wenzelm@24092
   518
        val subgoal1                = (HOLogic.mk_Trueprop t2_eq_zero) :: terms1 @ [not_false]
wenzelm@24092
   519
        val subgoal2                = (map HOLogic.mk_Trueprop
wenzelm@24092
   520
                                        [t2_neq_zero, j_lt_t2, t1_eq_t2_times_i_plus_j])
wenzelm@24092
   521
                                          @ terms2 @ [not_false]
wenzelm@24092
   522
      in
wenzelm@24092
   523
        SOME [(Ts, subgoal1), (split_type :: split_type :: Ts, subgoal2)]
wenzelm@24092
   524
      end
webertj@33719
   525
    (* ?P ((?n::int) mod (number_of ?k)) =
webertj@33728
   526
         ((number_of ?k = 0 --> ?P ?n) &
webertj@33728
   527
          (0 < number_of ?k -->
webertj@33728
   528
            (ALL i j.
webertj@33728
   529
              0 <= j & j < number_of ?k & ?n = number_of ?k * i + j --> ?P j)) &
webertj@33728
   530
          (number_of ?k < 0 -->
webertj@33728
   531
            (ALL i j.
webertj@33728
   532
              number_of ?k < j & j <= 0 & ?n = number_of ?k * i + j --> ?P j))) *)
wenzelm@24092
   533
    | (Const ("Divides.div_class.mod",
webertj@33728
   534
        Type ("fun", [Type ("Int.int", []), _])), [t1, t2]) =>
wenzelm@24092
   535
      let
wenzelm@24092
   536
        val rev_terms               = rev terms
haftmann@35267
   537
        val zero                    = Const (@{const_name Groups.zero}, split_type)
wenzelm@24092
   538
        val i                       = Bound 1
wenzelm@24092
   539
        val j                       = Bound 0
wenzelm@24092
   540
        val terms1                  = map (subst_term [(split_term, t1)]) rev_terms
wenzelm@24092
   541
        val terms2_3                = map (subst_term [(incr_boundvars 2 split_term, j)])
wenzelm@24092
   542
                                        (map (incr_boundvars 2) rev_terms)
wenzelm@24092
   543
        val t1'                     = incr_boundvars 2 t1
webertj@33728
   544
        val t2'                     = incr_boundvars 2 t2
haftmann@38549
   545
        val t2_eq_zero              = Const (@{const_name "op ="},
webertj@33728
   546
                                        split_type --> split_type --> HOLogic.boolT) $ t2 $ zero
haftmann@35092
   547
        val zero_lt_t2              = Const (@{const_name Orderings.less},
webertj@33728
   548
                                        split_type --> split_type --> HOLogic.boolT) $ zero $ t2'
haftmann@35092
   549
        val t2_lt_zero              = Const (@{const_name Orderings.less},
webertj@33728
   550
                                        split_type --> split_type --> HOLogic.boolT) $ t2' $ zero
haftmann@35092
   551
        val zero_leq_j              = Const (@{const_name Orderings.less_eq},
wenzelm@24092
   552
                                        split_type --> split_type --> HOLogic.boolT) $ zero $ j
haftmann@35092
   553
        val j_leq_zero              = Const (@{const_name Orderings.less_eq},
webertj@33728
   554
                                        split_type --> split_type --> HOLogic.boolT) $ j $ zero
haftmann@35092
   555
        val j_lt_t2                 = Const (@{const_name Orderings.less},
wenzelm@24092
   556
                                        split_type --> split_type--> HOLogic.boolT) $ j $ t2'
haftmann@35092
   557
        val t2_lt_j                 = Const (@{const_name Orderings.less},
webertj@33728
   558
                                        split_type --> split_type--> HOLogic.boolT) $ t2' $ j
haftmann@38549
   559
        val t1_eq_t2_times_i_plus_j = Const (@{const_name "op ="}, split_type --> split_type --> HOLogic.boolT) $ t1' $
haftmann@35267
   560
                                       (Const (@{const_name Groups.plus}, split_type --> split_type --> split_type) $
haftmann@35267
   561
                                         (Const (@{const_name Groups.times},
wenzelm@24092
   562
                                           split_type --> split_type --> split_type) $ t2' $ i) $ j)
wenzelm@24092
   563
        val not_false               = HOLogic.mk_Trueprop (HOLogic.Not $ HOLogic.false_const)
webertj@33728
   564
        val subgoal1                = (HOLogic.mk_Trueprop t2_eq_zero) :: terms1 @ [not_false]
webertj@33728
   565
        val subgoal2                = (map HOLogic.mk_Trueprop [zero_lt_t2, zero_leq_j])
wenzelm@24092
   566
                                        @ hd terms2_3
wenzelm@24092
   567
                                        :: (if tl terms2_3 = [] then [not_false] else [])
wenzelm@24092
   568
                                        @ (map HOLogic.mk_Trueprop [j_lt_t2, t1_eq_t2_times_i_plus_j])
wenzelm@24092
   569
                                        @ (if tl terms2_3 = [] then [] else tl terms2_3 @ [not_false])
webertj@33728
   570
        val subgoal3                = (map HOLogic.mk_Trueprop [t2_lt_zero, t2_lt_j])
wenzelm@24092
   571
                                        @ hd terms2_3
wenzelm@24092
   572
                                        :: (if tl terms2_3 = [] then [not_false] else [])
wenzelm@24092
   573
                                        @ (map HOLogic.mk_Trueprop [j_leq_zero, t1_eq_t2_times_i_plus_j])
wenzelm@24092
   574
                                        @ (if tl terms2_3 = [] then [] else tl terms2_3 @ [not_false])
wenzelm@24092
   575
        val Ts'                     = split_type :: split_type :: Ts
wenzelm@24092
   576
      in
wenzelm@24092
   577
        SOME [(Ts, subgoal1), (Ts', subgoal2), (Ts', subgoal3)]
wenzelm@24092
   578
      end
webertj@33719
   579
    (* ?P ((?n::int) div (number_of ?k)) =
webertj@33728
   580
         ((number_of ?k = 0 --> ?P 0) &
webertj@33728
   581
          (0 < number_of ?k -->
webertj@33728
   582
            (ALL i j.
webertj@33728
   583
              0 <= j & j < number_of ?k & ?n = number_of ?k * i + j --> ?P i)) &
webertj@33728
   584
          (number_of ?k < 0 -->
webertj@33728
   585
            (ALL i j.
webertj@33728
   586
              number_of ?k < j & j <= 0 & ?n = number_of ?k * i + j --> ?P i))) *)
wenzelm@24092
   587
    | (Const ("Divides.div_class.div",
webertj@33728
   588
        Type ("fun", [Type ("Int.int", []), _])), [t1, t2]) =>
wenzelm@24092
   589
      let
wenzelm@24092
   590
        val rev_terms               = rev terms
haftmann@35267
   591
        val zero                    = Const (@{const_name Groups.zero}, split_type)
wenzelm@24092
   592
        val i                       = Bound 1
wenzelm@24092
   593
        val j                       = Bound 0
wenzelm@24092
   594
        val terms1                  = map (subst_term [(split_term, zero)]) rev_terms
wenzelm@24092
   595
        val terms2_3                = map (subst_term [(incr_boundvars 2 split_term, i)])
wenzelm@24092
   596
                                        (map (incr_boundvars 2) rev_terms)
wenzelm@24092
   597
        val t1'                     = incr_boundvars 2 t1
webertj@33728
   598
        val t2'                     = incr_boundvars 2 t2
haftmann@38549
   599
        val t2_eq_zero              = Const (@{const_name "op ="},
webertj@33728
   600
                                        split_type --> split_type --> HOLogic.boolT) $ t2 $ zero
haftmann@35092
   601
        val zero_lt_t2              = Const (@{const_name Orderings.less},
webertj@33728
   602
                                        split_type --> split_type --> HOLogic.boolT) $ zero $ t2'
haftmann@35092
   603
        val t2_lt_zero              = Const (@{const_name Orderings.less},
webertj@33728
   604
                                        split_type --> split_type --> HOLogic.boolT) $ t2' $ zero
haftmann@35092
   605
        val zero_leq_j              = Const (@{const_name Orderings.less_eq},
wenzelm@24092
   606
                                        split_type --> split_type --> HOLogic.boolT) $ zero $ j
haftmann@35092
   607
        val j_leq_zero              = Const (@{const_name Orderings.less_eq},
webertj@33728
   608
                                        split_type --> split_type --> HOLogic.boolT) $ j $ zero
haftmann@35092
   609
        val j_lt_t2                 = Const (@{const_name Orderings.less},
wenzelm@24092
   610
                                        split_type --> split_type--> HOLogic.boolT) $ j $ t2'
haftmann@35092
   611
        val t2_lt_j                 = Const (@{const_name Orderings.less},
webertj@33728
   612
                                        split_type --> split_type--> HOLogic.boolT) $ t2' $ j
haftmann@38549
   613
        val t1_eq_t2_times_i_plus_j = Const (@{const_name "op ="}, split_type --> split_type --> HOLogic.boolT) $ t1' $
haftmann@35267
   614
                                       (Const (@{const_name Groups.plus}, split_type --> split_type --> split_type) $
haftmann@35267
   615
                                         (Const (@{const_name Groups.times},
wenzelm@24092
   616
                                           split_type --> split_type --> split_type) $ t2' $ i) $ j)
wenzelm@24092
   617
        val not_false               = HOLogic.mk_Trueprop (HOLogic.Not $ HOLogic.false_const)
webertj@33728
   618
        val subgoal1                = (HOLogic.mk_Trueprop t2_eq_zero) :: terms1 @ [not_false]
webertj@33728
   619
        val subgoal2                = (map HOLogic.mk_Trueprop [zero_lt_t2, zero_leq_j])
webertj@33728
   620
                                        @ hd terms2_3
webertj@33728
   621
                                        :: (if tl terms2_3 = [] then [not_false] else [])
webertj@33728
   622
                                        @ (map HOLogic.mk_Trueprop [j_lt_t2, t1_eq_t2_times_i_plus_j])
webertj@33728
   623
                                        @ (if tl terms2_3 = [] then [] else tl terms2_3 @ [not_false])
webertj@33728
   624
        val subgoal3                = (map HOLogic.mk_Trueprop [t2_lt_zero, t2_lt_j])
webertj@33728
   625
                                        @ hd terms2_3
webertj@33728
   626
                                        :: (if tl terms2_3 = [] then [not_false] else [])
webertj@33728
   627
                                        @ (map HOLogic.mk_Trueprop [j_leq_zero, t1_eq_t2_times_i_plus_j])
webertj@33728
   628
                                        @ (if tl terms2_3 = [] then [] else tl terms2_3 @ [not_false])
wenzelm@24092
   629
        val Ts'                     = split_type :: split_type :: Ts
wenzelm@24092
   630
      in
wenzelm@24092
   631
        SOME [(Ts, subgoal1), (Ts', subgoal2), (Ts', subgoal3)]
wenzelm@24092
   632
      end
wenzelm@24092
   633
    (* this will only happen if a split theorem can be applied for which no  *)
wenzelm@24092
   634
    (* code exists above -- in which case either the split theorem should be *)
wenzelm@24092
   635
    (* implemented above, or 'is_split_thm' should be modified to filter it  *)
wenzelm@24092
   636
    (* out                                                                   *)
wenzelm@24092
   637
    | (t, ts) => (
wenzelm@24920
   638
      warning ("Lin. Arith.: split rule for " ^ Syntax.string_of_term ctxt t ^
webertj@32369
   639
        " (with " ^ string_of_int (length ts) ^
webertj@32369
   640
        " argument(s)) not implemented; proof reconstruction is likely to fail");
wenzelm@24092
   641
      NONE
wenzelm@24092
   642
    ))
webertj@32369
   643
end;  (* split_once_items *)
wenzelm@24092
   644
wenzelm@24092
   645
(* remove terms that do not satisfy 'p'; change the order of the remaining   *)
wenzelm@24092
   646
(* terms in the same way as filter_prems_tac does                            *)
wenzelm@24092
   647
wenzelm@24092
   648
fun filter_prems_tac_items (p : term -> bool) (terms : term list) : term list =
wenzelm@24092
   649
let
wenzelm@33339
   650
  fun filter_prems t (left, right) =
wenzelm@33339
   651
    if p t then (left, right @ [t]) else (left @ right, [])
wenzelm@33339
   652
  val (left, right) = fold filter_prems terms ([], [])
wenzelm@24092
   653
in
wenzelm@24092
   654
  right @ left
wenzelm@24092
   655
end;
wenzelm@24092
   656
wenzelm@24092
   657
(* return true iff TRY (etac notE) THEN eq_assume_tac would succeed on a     *)
wenzelm@24092
   658
(* subgoal that has 'terms' as premises                                      *)
wenzelm@24092
   659
wenzelm@24092
   660
fun negated_term_occurs_positively (terms : term list) : bool =
wenzelm@24092
   661
  List.exists
haftmann@38558
   662
    (fn (Trueprop $ (Const (@{const_name Not}, _) $ t)) =>
webertj@32369
   663
      member Pattern.aeconv terms (Trueprop $ t)
webertj@32369
   664
      | _ => false)
wenzelm@24092
   665
    terms;
wenzelm@24092
   666
wenzelm@24092
   667
fun pre_decomp ctxt (Ts : typ list, terms : term list) : (typ list * term list) list =
wenzelm@24092
   668
let
wenzelm@24092
   669
  (* repeatedly split (including newly emerging subgoals) until no further   *)
wenzelm@24092
   670
  (* splitting is possible                                                   *)
webertj@32369
   671
  fun split_loop ([] : (typ list * term list) list) =
webertj@32369
   672
      ([] : (typ list * term list) list)
webertj@32369
   673
    | split_loop (subgoal::subgoals) =
webertj@32369
   674
      (case split_once_items ctxt subgoal of
webertj@32369
   675
        SOME new_subgoals => split_loop (new_subgoals @ subgoals)
webertj@32369
   676
      | NONE              => subgoal :: split_loop subgoals)
wenzelm@33035
   677
  fun is_relevant t  = is_some (decomp ctxt t)
wenzelm@24092
   678
  (* filter_prems_tac is_relevant: *)
wenzelm@24092
   679
  val relevant_terms = filter_prems_tac_items is_relevant terms
wenzelm@24092
   680
  (* split_tac, NNF normalization: *)
wenzelm@24092
   681
  val split_goals    = split_loop [(Ts, relevant_terms)]
wenzelm@24092
   682
  (* necessary because split_once_tac may normalize terms: *)
webertj@32369
   683
  val beta_eta_norm  = map (apsnd (map (Envir.eta_contract o Envir.beta_norm)))
webertj@32369
   684
    split_goals
wenzelm@24092
   685
  (* TRY (etac notE) THEN eq_assume_tac: *)
wenzelm@33317
   686
  val result         = filter_out (negated_term_occurs_positively o snd)
webertj@32369
   687
    beta_eta_norm
wenzelm@24092
   688
in
wenzelm@24092
   689
  result
wenzelm@24092
   690
end;
wenzelm@24092
   691
wenzelm@24092
   692
(* takes the i-th subgoal  [| A1; ...; An |] ==> B  to                       *)
wenzelm@24092
   693
(* An --> ... --> A1 --> B,  performs splitting with the given 'split_thms'  *)
wenzelm@24092
   694
(* (resulting in a different subgoal P), takes  P  to  ~P ==> False,         *)
wenzelm@24092
   695
(* performs NNF-normalization of ~P, and eliminates conjunctions,            *)
wenzelm@24092
   696
(* disjunctions and existential quantifiers from the premises, possibly (in  *)
wenzelm@24092
   697
(* the case of disjunctions) resulting in several new subgoals, each of the  *)
wenzelm@24092
   698
(* general form  [| Q1; ...; Qm |] ==> False.  Fails if more than            *)
haftmann@31082
   699
(* !split_limit splits are possible.                              *)
wenzelm@24092
   700
wenzelm@24092
   701
local
wenzelm@24092
   702
  val nnf_simpset =
wenzelm@24092
   703
    empty_ss setmkeqTrue mk_eq_True
wenzelm@24092
   704
    setmksimps (mksimps mksimps_pairs)
wenzelm@35410
   705
    addsimps [@{thm imp_conv_disj}, @{thm iff_conv_conj_imp}, @{thm de_Morgan_disj},
wenzelm@35410
   706
      @{thm de_Morgan_conj}, not_all, not_ex, not_not]
wenzelm@35230
   707
  fun prem_nnf_tac ss = full_simp_tac (Simplifier.inherit_context ss nnf_simpset)
wenzelm@24092
   708
in
wenzelm@24092
   709
wenzelm@35230
   710
fun split_once_tac ss split_thms =
wenzelm@24092
   711
  let
wenzelm@35230
   712
    val ctxt = Simplifier.the_context ss
wenzelm@24092
   713
    val thy = ProofContext.theory_of ctxt
wenzelm@24092
   714
    val cond_split_tac = SUBGOAL (fn (subgoal, i) =>
wenzelm@24092
   715
      let
wenzelm@24092
   716
        val Ts = rev (map snd (Logic.strip_params subgoal))
wenzelm@24092
   717
        val concl = HOLogic.dest_Trueprop (Logic.strip_assums_concl subgoal)
wenzelm@24092
   718
        val cmap = Splitter.cmap_of_split_thms split_thms
wenzelm@24092
   719
        val splits = Splitter.split_posns cmap thy Ts concl
wenzelm@24092
   720
      in
webertj@32369
   721
        if null splits orelse length splits > Config.get ctxt split_limit then
webertj@32369
   722
          no_tac
webertj@32369
   723
        else if null (#2 (hd splits)) then
webertj@32369
   724
          split_tac split_thms i
webertj@32369
   725
        else
webertj@32369
   726
          (* disallow a split that involves non-locally bound variables      *)
webertj@32369
   727
          (* (except when bound by outermost meta-quantifiers)               *)
webertj@32369
   728
          no_tac
wenzelm@24092
   729
      end)
wenzelm@24092
   730
  in
wenzelm@24092
   731
    EVERY' [
wenzelm@24092
   732
      REPEAT_DETERM o etac rev_mp,
wenzelm@24092
   733
      cond_split_tac,
wenzelm@24092
   734
      rtac ccontr,
wenzelm@35230
   735
      prem_nnf_tac ss,
wenzelm@24092
   736
      TRY o REPEAT_ALL_NEW (DETERM o (eresolve_tac [conjE, exE] ORELSE' etac disjE))
wenzelm@24092
   737
    ]
wenzelm@24092
   738
  end;
wenzelm@24092
   739
wenzelm@24092
   740
end;  (* local *)
wenzelm@24092
   741
wenzelm@24092
   742
(* remove irrelevant premises, then split the i-th subgoal (and all new      *)
wenzelm@24092
   743
(* subgoals) by using 'split_once_tac' repeatedly.  Beta-eta-normalize new   *)
wenzelm@24092
   744
(* subgoals and finally attempt to solve them by finding an immediate        *)
webertj@32369
   745
(* contradiction (i.e., a term and its negation) in their premises.          *)
wenzelm@24092
   746
wenzelm@35230
   747
fun pre_tac ss i =
wenzelm@24092
   748
let
wenzelm@35230
   749
  val ctxt = Simplifier.the_context ss;
wenzelm@24092
   750
  val split_thms = filter is_split_thm (#splits (get_arith_data ctxt))
wenzelm@33035
   751
  fun is_relevant t = is_some (decomp ctxt t)
wenzelm@24092
   752
in
wenzelm@24092
   753
  DETERM (
wenzelm@24092
   754
    TRY (filter_prems_tac is_relevant i)
wenzelm@24092
   755
      THEN (
wenzelm@35230
   756
        (TRY o REPEAT_ALL_NEW (split_once_tac ss split_thms))
wenzelm@24092
   757
          THEN_ALL_NEW
wenzelm@24092
   758
            (CONVERSION Drule.beta_eta_conversion
wenzelm@24092
   759
              THEN'
wenzelm@24092
   760
            (TRY o (etac notE THEN' eq_assume_tac)))
wenzelm@24092
   761
      ) i
wenzelm@24092
   762
  )
wenzelm@24092
   763
end;
wenzelm@24092
   764
haftmann@31100
   765
end;  (* LA_Data *)
wenzelm@24092
   766
wenzelm@24092
   767
haftmann@31100
   768
val pre_tac = LA_Data.pre_tac;
wenzelm@24092
   769
haftmann@31100
   770
structure Fast_Arith = Fast_Lin_Arith(structure LA_Logic = LA_Logic and LA_Data = LA_Data);
wenzelm@24092
   771
boehmes@31510
   772
fun map_inj_thms f {add_mono_thms, mult_mono_thms, inj_thms, lessD, neqE, simpset, number_of} =
haftmann@31100
   773
  {add_mono_thms = add_mono_thms, mult_mono_thms = mult_mono_thms, inj_thms = f inj_thms,
boehmes@31510
   774
    lessD = lessD, neqE = neqE, simpset = simpset, number_of = number_of};
haftmann@31100
   775
boehmes@31510
   776
fun map_lessD f {add_mono_thms, mult_mono_thms, inj_thms, lessD, neqE, simpset, number_of} =
haftmann@31100
   777
  {add_mono_thms = add_mono_thms, mult_mono_thms = mult_mono_thms, inj_thms = inj_thms,
boehmes@31510
   778
    lessD = f lessD, neqE = neqE, simpset = simpset, number_of = number_of};
haftmann@31100
   779
boehmes@31510
   780
fun map_simpset f {add_mono_thms, mult_mono_thms, inj_thms, lessD, neqE, simpset, number_of} =
haftmann@31100
   781
  {add_mono_thms = add_mono_thms, mult_mono_thms = mult_mono_thms, inj_thms = inj_thms,
boehmes@31510
   782
    lessD = lessD, neqE = neqE, simpset = f simpset, number_of = number_of};
boehmes@31510
   783
boehmes@31510
   784
fun map_number_of f {add_mono_thms, mult_mono_thms, inj_thms, lessD, neqE, simpset, number_of} =
boehmes@31510
   785
  {add_mono_thms = add_mono_thms, mult_mono_thms = mult_mono_thms, inj_thms = inj_thms,
boehmes@31510
   786
    lessD = lessD, neqE = neqE, simpset = simpset, number_of = f number_of};
haftmann@31100
   787
haftmann@31100
   788
fun add_inj_thms thms = Fast_Arith.map_data (map_inj_thms (append thms));
haftmann@31100
   789
fun add_lessD thm = Fast_Arith.map_data (map_lessD (fn thms => thms @ [thm]));
haftmann@31100
   790
fun add_simps thms = Fast_Arith.map_data (map_simpset (fn simpset => simpset addsimps thms));
haftmann@31100
   791
fun add_simprocs procs = Fast_Arith.map_data (map_simpset (fn simpset => simpset addsimprocs procs));
haftmann@31100
   792
boehmes@31510
   793
fun set_number_of f = Fast_Arith.map_data (map_number_of (K (serial (), f)))
boehmes@31510
   794
boehmes@31510
   795
haftmann@31101
   796
fun simple_tac ctxt = Fast_Arith.lin_arith_tac ctxt false;
haftmann@31101
   797
val lin_arith_tac = Fast_Arith.lin_arith_tac;
haftmann@31082
   798
val trace = Fast_Arith.trace;
wenzelm@24092
   799
wenzelm@24092
   800
(* reduce contradictory <= to False.
wenzelm@24092
   801
   Most of the work is done by the cancel tactics. *)
wenzelm@24092
   802
wenzelm@24092
   803
val init_arith_data =
boehmes@31510
   804
  Fast_Arith.map_data (fn {add_mono_thms, mult_mono_thms, inj_thms, lessD, number_of, ...} =>
haftmann@35028
   805
   {add_mono_thms = @{thms add_mono_thms_linordered_semiring} @ @{thms add_mono_thms_linordered_field} @ add_mono_thms,
boehmes@31510
   806
    mult_mono_thms = @{thm mult_strict_left_mono} :: @{thm mult_left_mono} ::
boehmes@31510
   807
      @{lemma "a = b ==> c*a = c*b" by (rule arg_cong)} :: mult_mono_thms,
wenzelm@24092
   808
    inj_thms = inj_thms,
haftmann@31082
   809
    lessD = lessD @ [@{thm "Suc_leI"}],
haftmann@35028
   810
    neqE = [@{thm linorder_neqE_nat}, @{thm linorder_neqE_linordered_idom}],
wenzelm@24092
   811
    simpset = HOL_basic_ss
boehmes@31510
   812
      addsimps @{thms ring_distribs}
boehmes@31510
   813
      addsimps [@{thm if_True}, @{thm if_False}]
wenzelm@24092
   814
      addsimps
haftmann@35050
   815
       [@{thm add_0_left},
haftmann@35050
   816
        @{thm add_0_right},
wenzelm@24092
   817
        @{thm "Zero_not_Suc"}, @{thm "Suc_not_Zero"}, @{thm "le_0_eq"}, @{thm "One_nat_def"},
wenzelm@24092
   818
        @{thm "order_less_irrefl"}, @{thm "zero_neq_one"}, @{thm "zero_less_one"},
wenzelm@24092
   819
        @{thm "zero_le_one"}, @{thm "zero_neq_one"} RS not_sym, @{thm "not_one_le_zero"},
wenzelm@24092
   820
        @{thm "not_one_less_zero"}]
haftmann@37890
   821
      addsimprocs [@{simproc abel_cancel_sum}, @{simproc abel_cancel_relation}]
wenzelm@24092
   822
       (*abel_cancel helps it work in abstract algebraic domains*)
haftmann@31082
   823
      addsimprocs Nat_Arith.nat_cancel_sums_add
wenzelm@35410
   824
      addcongs [@{thm if_weak_cong}],
boehmes@31510
   825
    number_of = number_of}) #>
haftmann@31082
   826
  add_discrete_type @{type_name nat};
wenzelm@24092
   827
nipkow@29849
   828
fun add_arith_facts ss =
haftmann@30686
   829
  add_prems (Arith_Data.get_arith_facts (MetaSimplifier.the_context ss)) ss;
nipkow@29849
   830
haftmann@31101
   831
val simproc = add_arith_facts #> Fast_Arith.lin_arith_simproc;
wenzelm@24092
   832
wenzelm@24092
   833
haftmann@26110
   834
(* generic refutation procedure *)
haftmann@26110
   835
haftmann@26110
   836
(* parameters:
haftmann@26110
   837
haftmann@26110
   838
   test: term -> bool
haftmann@26110
   839
   tests if a term is at all relevant to the refutation proof;
haftmann@26110
   840
   if not, then it can be discarded. Can improve performance,
haftmann@26110
   841
   esp. if disjunctions can be discarded (no case distinction needed!).
haftmann@26110
   842
haftmann@26110
   843
   prep_tac: int -> tactic
haftmann@26110
   844
   A preparation tactic to be applied to the goal once all relevant premises
haftmann@26110
   845
   have been moved to the conclusion.
haftmann@26110
   846
haftmann@26110
   847
   ref_tac: int -> tactic
haftmann@26110
   848
   the actual refutation tactic. Should be able to deal with goals
haftmann@26110
   849
   [| A1; ...; An |] ==> False
haftmann@26110
   850
   where the Ai are atomic, i.e. no top-level &, | or EX
haftmann@26110
   851
*)
haftmann@26110
   852
haftmann@26110
   853
local
haftmann@26110
   854
  val nnf_simpset =
haftmann@26110
   855
    empty_ss setmkeqTrue mk_eq_True
haftmann@26110
   856
    setmksimps (mksimps mksimps_pairs)
haftmann@26110
   857
    addsimps [@{thm imp_conv_disj}, @{thm iff_conv_conj_imp}, @{thm de_Morgan_disj},
haftmann@26110
   858
      @{thm de_Morgan_conj}, @{thm not_all}, @{thm not_ex}, @{thm not_not}];
haftmann@26110
   859
  fun prem_nnf_tac i st =
wenzelm@35232
   860
    full_simp_tac (Simplifier.global_context (Thm.theory_of_thm st) nnf_simpset) i st;
haftmann@26110
   861
in
haftmann@26110
   862
fun refute_tac test prep_tac ref_tac =
haftmann@26110
   863
  let val refute_prems_tac =
haftmann@26110
   864
        REPEAT_DETERM
haftmann@26110
   865
              (eresolve_tac [@{thm conjE}, @{thm exE}] 1 ORELSE
haftmann@26110
   866
               filter_prems_tac test 1 ORELSE
haftmann@26110
   867
               etac @{thm disjE} 1) THEN
haftmann@26110
   868
        (DETERM (etac @{thm notE} 1 THEN eq_assume_tac 1) ORELSE
haftmann@26110
   869
         ref_tac 1);
haftmann@26110
   870
  in EVERY'[TRY o filter_prems_tac test,
haftmann@26110
   871
            REPEAT_DETERM o etac @{thm rev_mp}, prep_tac, rtac @{thm ccontr}, prem_nnf_tac,
haftmann@26110
   872
            SELECT_GOAL (DEPTH_SOLVE refute_prems_tac)]
haftmann@26110
   873
  end;
haftmann@26110
   874
end;
haftmann@26110
   875
haftmann@26110
   876
wenzelm@24092
   877
(* arith proof method *)
wenzelm@24092
   878
wenzelm@24092
   879
local
wenzelm@24092
   880
haftmann@31101
   881
fun raw_tac ctxt ex =
wenzelm@33035
   882
  (* FIXME: K true should be replaced by a sensible test (perhaps "is_some o
wenzelm@24092
   883
     decomp sg"? -- but note that the test is applied to terms already before
wenzelm@24092
   884
     they are split/normalized) to speed things up in case there are lots of
wenzelm@24092
   885
     irrelevant terms involved; elimination of min/max can be optimized:
wenzelm@24092
   886
     (max m n + k <= r) = (m+k <= r & n+k <= r)
wenzelm@24092
   887
     (l <= min m n + k) = (l <= m+k & l <= n+k)
wenzelm@24092
   888
  *)
wenzelm@24092
   889
  refute_tac (K true)
webertj@33728
   890
    (* Splitting is also done inside simple_tac, but not completely --    *)
webertj@33728
   891
    (* split_tac may use split theorems that have not been implemented in *)
webertj@33728
   892
    (* simple_tac (cf. pre_decomp and split_once_items above), and        *)
webertj@33728
   893
    (* split_limit may trigger.                                           *)
webertj@33728
   894
    (* Therefore splitting outside of simple_tac may allow us to prove    *)
webertj@33728
   895
    (* some goals that simple_tac alone would fail on.                    *)
wenzelm@24092
   896
    (REPEAT_DETERM o split_tac (#splits (get_arith_data ctxt)))
haftmann@31101
   897
    (lin_arith_tac ctxt ex);
wenzelm@24092
   898
wenzelm@24092
   899
in
wenzelm@24092
   900
haftmann@31101
   901
fun gen_tac ex ctxt = FIRST' [simple_tac ctxt,
wenzelm@35625
   902
  Object_Logic.full_atomize_tac THEN' (REPEAT_DETERM o rtac impI) THEN' raw_tac ctxt ex];
wenzelm@24092
   903
haftmann@31101
   904
val tac = gen_tac true;
wenzelm@24092
   905
wenzelm@24092
   906
end;
wenzelm@24092
   907
wenzelm@24092
   908
wenzelm@24092
   909
(* context setup *)
wenzelm@24092
   910
wenzelm@24092
   911
val setup =
wenzelm@24092
   912
  init_arith_data #>
haftmann@31101
   913
  Simplifier.map_ss (fn ss => ss addsimprocs [Simplifier.simproc (@{theory}) "fast_nat_arith"
haftmann@31101
   914
    ["(m::nat) < n","(m::nat) <= n", "(m::nat) = n"] (K simproc)]
haftmann@31101
   915
    (* Because of fast_nat_arith_simproc, the arithmetic solver is really only
haftmann@31101
   916
    useful to detect inconsistencies among the premises for subgoals which are
haftmann@31101
   917
    *not* themselves (in)equalities, because the latter activate
haftmann@31101
   918
    fast_nat_arith_simproc anyway. However, it seems cheaper to activate the
haftmann@31101
   919
    solver all the time rather than add the additional check. *)
nipkow@29850
   920
    addSolver (mk_solver' "lin_arith"
haftmann@31100
   921
      (add_arith_facts #> Fast_Arith.cut_lin_arith_tac)))
haftmann@31100
   922
haftmann@31100
   923
val global_setup =
haftmann@31100
   924
  setup_split_limit #> setup_neq_limit #>
haftmann@31100
   925
  Attrib.setup @{binding arith_split} (Scan.succeed (Thm.declaration_attribute add_split))
haftmann@31100
   926
    "declaration of split rules for arithmetic procedure" #>
haftmann@31100
   927
  Method.setup @{binding linarith}
wenzelm@33554
   928
    (Scan.succeed (fn ctxt =>
haftmann@31100
   929
      METHOD (fn facts =>
wenzelm@33554
   930
        HEADGOAL (Method.insert_tac (Arith_Data.get_arith_facts ctxt @ facts)
haftmann@31101
   931
          THEN' tac ctxt)))) "linear arithmetic" #>
haftmann@31101
   932
  Arith_Data.add_tactic "linear arithmetic" gen_tac;
wenzelm@24092
   933
wenzelm@24092
   934
end;