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