src/Provers/Arith/fast_lin_arith.ML
author wenzelm
Tue, 31 Jul 2007 00:56:29 +0200
changeset 24076 ae946f751c44
parent 24039 273698405054
child 24112 6c4e7d17f9b0
permissions -rw-r--r--
arith method setup: proper context; turned fast_arith_split/neq_limit into configuration options; tuned signatures; misc cleanup;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
     1
(*  Title:      Provers/Arith/fast_lin_arith.ML
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
     2
    ID:         $Id$
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
     3
    Author:     Tobias Nipkow and Tjark Weber
6102
b985e2184868 Split argument structure.
nipkow
parents: 6079
diff changeset
     4
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
     5
A generic linear arithmetic package.  It provides two tactics
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
     6
(cut_lin_arith_tac, lin_arith_tac) and a simplification procedure
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
     7
(lin_arith_simproc).
6102
b985e2184868 Split argument structure.
nipkow
parents: 6079
diff changeset
     8
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
     9
Only take premises and conclusions into account that are already
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    10
(negated) (in)equations. lin_arith_simproc tries to prove or disprove
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    11
the term.
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
    12
*)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
    13
9073
40d8dfac96b8 tracing flag for arith_tac
paulson
parents: 8263
diff changeset
    14
(* Debugging: set Fast_Arith.trace *)
7582
2650c9c2ab7f Restructured lin.arith.package.
nipkow
parents: 7570
diff changeset
    15
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
    16
(*** Data needed for setting up the linear arithmetic package ***)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
    17
6102
b985e2184868 Split argument structure.
nipkow
parents: 6079
diff changeset
    18
signature LIN_ARITH_LOGIC =
b985e2184868 Split argument structure.
nipkow
parents: 6079
diff changeset
    19
sig
20276
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
    20
  val conjI       : thm  (* P ==> Q ==> P & Q *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
    21
  val ccontr      : thm  (* (~ P ==> False) ==> P *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
    22
  val notI        : thm  (* (P ==> False) ==> ~ P *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
    23
  val not_lessD   : thm  (* ~(m < n) ==> n <= m *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
    24
  val not_leD     : thm  (* ~(m <= n) ==> n < m *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
    25
  val sym         : thm  (* x = y ==> y = x *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
    26
  val mk_Eq       : thm -> thm
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
    27
  val atomize     : thm -> thm list
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
    28
  val mk_Trueprop : term -> term
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
    29
  val neg_prop    : term -> term
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
    30
  val is_False    : thm -> bool
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
    31
  val is_nat      : typ list * term -> bool
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
    32
  val mk_nat_thm  : theory -> term -> thm
6102
b985e2184868 Split argument structure.
nipkow
parents: 6079
diff changeset
    33
end;
b985e2184868 Split argument structure.
nipkow
parents: 6079
diff changeset
    34
(*
b985e2184868 Split argument structure.
nipkow
parents: 6079
diff changeset
    35
mk_Eq(~in) = `in == False'
b985e2184868 Split argument structure.
nipkow
parents: 6079
diff changeset
    36
mk_Eq(in) = `in == True'
b985e2184868 Split argument structure.
nipkow
parents: 6079
diff changeset
    37
where `in' is an (in)equality.
b985e2184868 Split argument structure.
nipkow
parents: 6079
diff changeset
    38
23190
d45c4d6c5f15 fixed handling of meta-logic propositions
webertj
parents: 23063
diff changeset
    39
neg_prop(t) = neg  if t is wrapped up in Trueprop and neg is the
d45c4d6c5f15 fixed handling of meta-logic propositions
webertj
parents: 23063
diff changeset
    40
  (logically) negated version of t (again wrapped up in Trueprop),
d45c4d6c5f15 fixed handling of meta-logic propositions
webertj
parents: 23063
diff changeset
    41
  where the negation of a negative term is the term itself (no
d45c4d6c5f15 fixed handling of meta-logic propositions
webertj
parents: 23063
diff changeset
    42
  double negation!); raises TERM ("neg_prop", [t]) if t is not of
d45c4d6c5f15 fixed handling of meta-logic propositions
webertj
parents: 23063
diff changeset
    43
  the form 'Trueprop $ _'
6128
2acc5d36610c More arith refinements.
nipkow
parents: 6110
diff changeset
    44
2acc5d36610c More arith refinements.
nipkow
parents: 6110
diff changeset
    45
is_nat(parameter-types,t) =  t:nat
2acc5d36610c More arith refinements.
nipkow
parents: 6110
diff changeset
    46
mk_nat_thm(t) = "0 <= t"
6102
b985e2184868 Split argument structure.
nipkow
parents: 6079
diff changeset
    47
*)
b985e2184868 Split argument structure.
nipkow
parents: 6079
diff changeset
    48
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
    49
signature LIN_ARITH_DATA =
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
    50
sig
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    51
  (*internal representation of linear (in-)equations:*)
20268
1fe9aed8fcac code reformatted
webertj
parents: 20254
diff changeset
    52
  type decompT = (term * Rat.rat) list * Rat.rat * string * (term * Rat.rat) list * Rat.rat * bool
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    53
  val decomp: Proof.context -> term -> decompT option
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    54
  val domain_is_nat: term -> bool
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    55
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    56
  (*preprocessing, performed on a representation of subgoals as list of premises:*)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    57
  val pre_decomp: Proof.context -> typ list * term list -> (typ list * term list) list
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    58
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    59
  (*preprocessing, performed on the goal -- must do the same as 'pre_decomp':*)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    60
  val pre_tac: Proof.context -> int -> tactic
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    61
  val number_of: IntInf.int * typ -> term
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    62
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    63
  (*the limit on the number of ~= allowed; because each ~= is split
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    64
    into two cases, this can lead to an explosion*)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    65
  val fast_arith_neq_limit: int ConfigOption.T
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
    66
end;
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
    67
(*
7551
8e934d1a9ac6 Now distinguishes discrete from non-distrete types.
nipkow
parents: 6128
diff changeset
    68
decomp(`x Rel y') should yield (p,i,Rel,q,j,d)
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
    69
   where Rel is one of "<", "~<", "<=", "~<=" and "=" and
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
    70
         p (q, respectively) is the decomposition of the sum term x
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
    71
         (y, respectively) into a list of summand * multiplicity
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
    72
         pairs and a constant summand and d indicates if the domain
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
    73
         is discrete.
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
    74
20276
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
    75
domain_is_nat(`x Rel y') t should yield true iff x is of type "nat".
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
    76
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
    77
The relationship between pre_decomp and pre_tac is somewhat tricky.  The
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
    78
internal representation of a subgoal and the corresponding theorem must
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
    79
be modified by pre_decomp (pre_tac, resp.) in a corresponding way.  See
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
    80
the comment for split_items below.  (This is even necessary for eta- and
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
    81
beta-equivalent modifications, as some of the lin. arith. code is not
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
    82
insensitive to them.)
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
    83
9420
d4e9f60fe25a avoid global references;
wenzelm
parents: 9073
diff changeset
    84
ss must reduce contradictory <= to False.
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
    85
   It should also cancel common summands to keep <= reduced;
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
    86
   otherwise <= can grow to massive proportions.
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
    87
*)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
    88
6062
ede9fea461f5 Small mods.
nipkow
parents: 6056
diff changeset
    89
signature FAST_LIN_ARITH =
ede9fea461f5 Small mods.
nipkow
parents: 6056
diff changeset
    90
sig
15184
d2c19aea17bc made mult_mono_thms generic.
nipkow
parents: 15027
diff changeset
    91
  val map_data: ({add_mono_thms: thm list, mult_mono_thms: thm list, inj_thms: thm list,
15922
7ef183f3fc98 neqE applies even if the type is not one which partakes in linear arithmetic.
nipkow
parents: 15660
diff changeset
    92
                 lessD: thm list, neqE: thm list, simpset: Simplifier.simpset}
15184
d2c19aea17bc made mult_mono_thms generic.
nipkow
parents: 15027
diff changeset
    93
                 -> {add_mono_thms: thm list, mult_mono_thms: thm list, inj_thms: thm list,
15922
7ef183f3fc98 neqE applies even if the type is not one which partakes in linear arithmetic.
nipkow
parents: 15660
diff changeset
    94
                     lessD: thm list, neqE: thm list, simpset: Simplifier.simpset})
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    95
                -> Context.generic -> Context.generic
19314
cf1c19eee826 comment for conjI added
webertj
parents: 19049
diff changeset
    96
  val trace: bool ref
17613
072c21e31b42 Simplifier.inherit_bounds;
wenzelm
parents: 17524
diff changeset
    97
  val cut_lin_arith_tac: simpset -> int -> tactic
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    98
  val lin_arith_tac: Proof.context -> bool -> int -> tactic
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
    99
  val lin_arith_simproc: simpset -> term -> thm option
6062
ede9fea461f5 Small mods.
nipkow
parents: 6056
diff changeset
   100
end;
ede9fea461f5 Small mods.
nipkow
parents: 6056
diff changeset
   101
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   102
functor Fast_Lin_Arith
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   103
  (structure LA_Logic: LIN_ARITH_LOGIC and LA_Data: LIN_ARITH_DATA): FAST_LIN_ARITH =
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   104
struct
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   105
9420
d4e9f60fe25a avoid global references;
wenzelm
parents: 9073
diff changeset
   106
d4e9f60fe25a avoid global references;
wenzelm
parents: 9073
diff changeset
   107
(** theory data **)
d4e9f60fe25a avoid global references;
wenzelm
parents: 9073
diff changeset
   108
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   109
structure Data = GenericDataFun
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22596
diff changeset
   110
(
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   111
  type T =
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   112
   {add_mono_thms: thm list,
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   113
    mult_mono_thms: thm list,
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   114
    inj_thms: thm list,
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   115
    lessD: thm list,
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   116
    neqE: thm list,
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   117
    simpset: Simplifier.simpset};
9420
d4e9f60fe25a avoid global references;
wenzelm
parents: 9073
diff changeset
   118
10691
4ea37fba9c02 towards rtional arithmetic
nipkow
parents: 10575
diff changeset
   119
  val empty = {add_mono_thms = [], mult_mono_thms = [], inj_thms = [],
15922
7ef183f3fc98 neqE applies even if the type is not one which partakes in linear arithmetic.
nipkow
parents: 15660
diff changeset
   120
               lessD = [], neqE = [], simpset = Simplifier.empty_ss};
16458
4c6fd0c01d28 accomodate change of TheoryDataFun;
wenzelm
parents: 16358
diff changeset
   121
  val extend = I;
4c6fd0c01d28 accomodate change of TheoryDataFun;
wenzelm
parents: 16358
diff changeset
   122
  fun merge _
4c6fd0c01d28 accomodate change of TheoryDataFun;
wenzelm
parents: 16358
diff changeset
   123
    ({add_mono_thms= add_mono_thms1, mult_mono_thms= mult_mono_thms1, inj_thms= inj_thms1,
4c6fd0c01d28 accomodate change of TheoryDataFun;
wenzelm
parents: 16358
diff changeset
   124
      lessD = lessD1, neqE=neqE1, simpset = simpset1},
4c6fd0c01d28 accomodate change of TheoryDataFun;
wenzelm
parents: 16358
diff changeset
   125
     {add_mono_thms= add_mono_thms2, mult_mono_thms= mult_mono_thms2, inj_thms= inj_thms2,
4c6fd0c01d28 accomodate change of TheoryDataFun;
wenzelm
parents: 16358
diff changeset
   126
      lessD = lessD2, neqE=neqE2, simpset = simpset2}) =
24039
273698405054 renamed Drule.add/del/merge_rules to Thm.add/del/merge_thms;
wenzelm
parents: 23577
diff changeset
   127
    {add_mono_thms = Thm.merge_thms (add_mono_thms1, add_mono_thms2),
273698405054 renamed Drule.add/del/merge_rules to Thm.add/del/merge_thms;
wenzelm
parents: 23577
diff changeset
   128
     mult_mono_thms = Thm.merge_thms (mult_mono_thms1, mult_mono_thms2),
273698405054 renamed Drule.add/del/merge_rules to Thm.add/del/merge_thms;
wenzelm
parents: 23577
diff changeset
   129
     inj_thms = Thm.merge_thms (inj_thms1, inj_thms2),
273698405054 renamed Drule.add/del/merge_rules to Thm.add/del/merge_thms;
wenzelm
parents: 23577
diff changeset
   130
     lessD = Thm.merge_thms (lessD1, lessD2),
273698405054 renamed Drule.add/del/merge_rules to Thm.add/del/merge_thms;
wenzelm
parents: 23577
diff changeset
   131
     neqE = Thm.merge_thms (neqE1, neqE2),
10575
c78d26d5c3c1 Now adjusted to mixed terms involving coercions.
nipkow
parents: 9420
diff changeset
   132
     simpset = Simplifier.merge_ss (simpset1, simpset2)};
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22596
diff changeset
   133
);
9420
d4e9f60fe25a avoid global references;
wenzelm
parents: 9073
diff changeset
   134
d4e9f60fe25a avoid global references;
wenzelm
parents: 9073
diff changeset
   135
val map_data = Data.map;
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   136
val get_data = Data.get o Context.Proof;
9420
d4e9f60fe25a avoid global references;
wenzelm
parents: 9073
diff changeset
   137
d4e9f60fe25a avoid global references;
wenzelm
parents: 9073
diff changeset
   138
d4e9f60fe25a avoid global references;
wenzelm
parents: 9073
diff changeset
   139
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   140
(*** A fast decision procedure ***)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   141
(*** Code ported from HOL Light ***)
6056
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   142
(* possible optimizations:
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   143
   use (var,coeff) rep or vector rep  tp save space;
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   144
   treat non-negative atoms separately rather than adding 0 <= atom
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   145
*)
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   146
9073
40d8dfac96b8 tracing flag for arith_tac
paulson
parents: 8263
diff changeset
   147
val trace = ref false;
40d8dfac96b8 tracing flag for arith_tac
paulson
parents: 8263
diff changeset
   148
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   149
datatype lineq_type = Eq | Le | Lt;
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   150
6056
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   151
datatype injust = Asm of int
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   152
                | Nat of int (* index of atom *)
6128
2acc5d36610c More arith refinements.
nipkow
parents: 6110
diff changeset
   153
                | LessD of injust
2acc5d36610c More arith refinements.
nipkow
parents: 6110
diff changeset
   154
                | NotLessD of injust
2acc5d36610c More arith refinements.
nipkow
parents: 6110
diff changeset
   155
                | NotLeD of injust
7551
8e934d1a9ac6 Now distinguishes discrete from non-distrete types.
nipkow
parents: 6128
diff changeset
   156
                | NotLeDD of injust
16358
2e2a506553a3 IntInf change
nipkow
parents: 15965
diff changeset
   157
                | Multiplied of IntInf.int * injust
2e2a506553a3 IntInf change
nipkow
parents: 15965
diff changeset
   158
                | Multiplied2 of IntInf.int * injust
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   159
                | Added of injust * injust;
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   160
16358
2e2a506553a3 IntInf change
nipkow
parents: 15965
diff changeset
   161
datatype lineq = Lineq of IntInf.int * lineq_type * IntInf.int list * injust;
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   162
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   163
(* ------------------------------------------------------------------------- *)
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   164
(* Finding a (counter) example from the trace of a failed elimination        *)
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   165
(* ------------------------------------------------------------------------- *)
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   166
(* Examples are represented as rational numbers,                             *)
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   167
(* Dont blame John Harrison for this code - it is entirely mine. TN          *)
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   168
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   169
exception NoEx;
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   170
14372
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   171
(* Coding: (i,true,cs) means i <= cs and (i,false,cs) means i < cs.
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   172
   In general, true means the bound is included, false means it is excluded.
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   173
   Need to know if it is a lower or upper bound for unambiguous interpretation!
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   174
*)
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   175
22950
haftmann
parents: 22846
diff changeset
   176
fun elim_eqns (Lineq (i, Le, cs, _)) = [(i, true, cs)]
haftmann
parents: 22846
diff changeset
   177
  | elim_eqns (Lineq (i, Eq, cs, _)) = [(i, true, cs),(~i, true, map ~ cs)]
haftmann
parents: 22846
diff changeset
   178
  | elim_eqns (Lineq (i, Lt, cs, _)) = [(i, false, cs)];
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   179
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   180
(* PRE: ex[v] must be 0! *)
22950
haftmann
parents: 22846
diff changeset
   181
fun eval ex v (a:IntInf.int,le,cs:IntInf.int list) =
haftmann
parents: 22846
diff changeset
   182
  let
haftmann
parents: 22846
diff changeset
   183
    val rs = map Rat.rat_of_int cs;
haftmann
parents: 22846
diff changeset
   184
    val rsum = fold2 (Rat.add oo Rat.mult) rs ex Rat.zero;
23063
haftmann
parents: 23025
diff changeset
   185
  in (Rat.mult (Rat.add (Rat.rat_of_int a) (Rat.neg rsum)) (Rat.inv (nth rs v)), le) end;
haftmann
parents: 23025
diff changeset
   186
(* If nth rs v < 0, le should be negated.
14372
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   187
   Instead this swap is taken into account in ratrelmin2.
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   188
*)
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   189
22950
haftmann
parents: 22846
diff changeset
   190
fun ratrelmin2 (x as (r, ler), y as (s, les)) =
23520
483fe92f00c1 tuned arithmetic modules
haftmann
parents: 23297
diff changeset
   191
  case Rat.ord (r, s)
22950
haftmann
parents: 22846
diff changeset
   192
   of EQUAL => (r, (not ler) andalso (not les))
haftmann
parents: 22846
diff changeset
   193
    | LESS => x
haftmann
parents: 22846
diff changeset
   194
    | GREATER => y;
haftmann
parents: 22846
diff changeset
   195
haftmann
parents: 22846
diff changeset
   196
fun ratrelmax2 (x as (r, ler), y as (s, les)) =
23520
483fe92f00c1 tuned arithmetic modules
haftmann
parents: 23297
diff changeset
   197
  case Rat.ord (r, s)
22950
haftmann
parents: 22846
diff changeset
   198
   of EQUAL => (r, ler andalso les)
haftmann
parents: 22846
diff changeset
   199
    | LESS => y
haftmann
parents: 22846
diff changeset
   200
    | GREATER => x;
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   201
14372
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   202
val ratrelmin = foldr1 ratrelmin2;
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   203
val ratrelmax = foldr1 ratrelmax2;
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   204
22950
haftmann
parents: 22846
diff changeset
   205
fun ratexact up (r, exact) =
14372
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   206
  if exact then r else
22950
haftmann
parents: 22846
diff changeset
   207
  let
haftmann
parents: 22846
diff changeset
   208
    val (p, q) = Rat.quotient_of_rat r;
haftmann
parents: 22846
diff changeset
   209
    val nth = Rat.inv (Rat.rat_of_int q);
haftmann
parents: 22846
diff changeset
   210
  in Rat.add r (if up then nth else Rat.neg nth) end;
14372
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   211
22950
haftmann
parents: 22846
diff changeset
   212
fun ratmiddle (r, s) = Rat.mult (Rat.add r s) (Rat.inv Rat.two);
14372
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   213
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   214
fun choose2 d ((lb, exactl), (ub, exactu)) =
23520
483fe92f00c1 tuned arithmetic modules
haftmann
parents: 23297
diff changeset
   215
  let val ord = Rat.sign lb in
22950
haftmann
parents: 22846
diff changeset
   216
  if (ord = LESS orelse exactl) andalso (ord = GREATER orelse exactu)
haftmann
parents: 22846
diff changeset
   217
    then Rat.zero
haftmann
parents: 22846
diff changeset
   218
    else if not d then
haftmann
parents: 22846
diff changeset
   219
      if ord = GREATER
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   220
        then if exactl then lb else ratmiddle (lb, ub)
22950
haftmann
parents: 22846
diff changeset
   221
        else if exactu then ub else ratmiddle (lb, ub)
haftmann
parents: 22846
diff changeset
   222
      else (*discrete domain, both bounds must be exact*)
23025
7507f94adc32 dropped nonsense comment
haftmann
parents: 22950
diff changeset
   223
      if ord = GREATER
22950
haftmann
parents: 22846
diff changeset
   224
        then let val lb' = Rat.roundup lb in
haftmann
parents: 22846
diff changeset
   225
          if Rat.le lb' ub then lb' else raise NoEx end
haftmann
parents: 22846
diff changeset
   226
        else let val ub' = Rat.rounddown ub in
haftmann
parents: 22846
diff changeset
   227
          if Rat.le lb ub' then ub' else raise NoEx end
haftmann
parents: 22846
diff changeset
   228
  end;
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   229
22950
haftmann
parents: 22846
diff changeset
   230
fun findex1 discr (v, lineqs) ex =
haftmann
parents: 22846
diff changeset
   231
  let
23063
haftmann
parents: 23025
diff changeset
   232
    val nz = filter (fn (Lineq (_, _, cs, _)) => nth cs v <> 0) lineqs;
22950
haftmann
parents: 22846
diff changeset
   233
    val ineqs = maps elim_eqns nz;
23063
haftmann
parents: 23025
diff changeset
   234
    val (ge, le) = List.partition (fn (_,_,cs) => nth cs v > 0) ineqs
22950
haftmann
parents: 22846
diff changeset
   235
    val lb = ratrelmax (map (eval ex v) ge)
haftmann
parents: 22846
diff changeset
   236
    val ub = ratrelmin (map (eval ex v) le)
21109
f8f89be75e81 dropped nth_update
haftmann
parents: 20433
diff changeset
   237
  in nth_map v (K (choose2 (nth discr v) (lb, ub))) ex end;
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   238
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   239
fun elim1 v x =
23063
haftmann
parents: 23025
diff changeset
   240
  map (fn (a,le,bs) => (Rat.add a (Rat.neg (Rat.mult (nth bs v) x)), le,
21109
f8f89be75e81 dropped nth_update
haftmann
parents: 20433
diff changeset
   241
                        nth_map v (K Rat.zero) bs));
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   242
23520
483fe92f00c1 tuned arithmetic modules
haftmann
parents: 23297
diff changeset
   243
fun single_var v (_, _, cs) = case filter_out (curry (op =) EQUAL o Rat.sign) cs
23063
haftmann
parents: 23025
diff changeset
   244
 of [x] => x =/ nth cs v
haftmann
parents: 23025
diff changeset
   245
  | _ => false;
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   246
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   247
(* The base case:
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   248
   all variables occur only with positive or only with negative coefficients *)
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   249
fun pick_vars discr (ineqs,ex) =
23520
483fe92f00c1 tuned arithmetic modules
haftmann
parents: 23297
diff changeset
   250
  let val nz = filter_out (fn (_,_,cs) => forall (curry (op =) EQUAL o Rat.sign) cs) ineqs
14372
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   251
  in case nz of [] => ex
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   252
     | (_,_,cs) :: _ =>
23520
483fe92f00c1 tuned arithmetic modules
haftmann
parents: 23297
diff changeset
   253
       let val v = find_index (not o curry (op =) EQUAL o Rat.sign) cs
22950
haftmann
parents: 22846
diff changeset
   254
           val d = nth discr v;
23520
483fe92f00c1 tuned arithmetic modules
haftmann
parents: 23297
diff changeset
   255
           val pos = not (Rat.sign (nth cs v) = LESS);
22950
haftmann
parents: 22846
diff changeset
   256
           val sv = filter (single_var v) nz;
14372
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   257
           val minmax =
17951
ff954cc338c7 introduced functions from Pure/General/rat.ML
haftmann
parents: 17892
diff changeset
   258
             if pos then if d then Rat.roundup o fst o ratrelmax
14372
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   259
                         else ratexact true o ratrelmax
17951
ff954cc338c7 introduced functions from Pure/General/rat.ML
haftmann
parents: 17892
diff changeset
   260
                    else if d then Rat.rounddown o fst o ratrelmin
14372
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   261
                         else ratexact false o ratrelmin
23063
haftmann
parents: 23025
diff changeset
   262
           val bnds = map (fn (a,le,bs) => (Rat.mult a (Rat.inv (nth bs v)), le)) sv
17951
ff954cc338c7 introduced functions from Pure/General/rat.ML
haftmann
parents: 17892
diff changeset
   263
           val x = minmax((Rat.zero,if pos then true else false)::bnds)
14372
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   264
           val ineqs' = elim1 v x nz
21109
f8f89be75e81 dropped nth_update
haftmann
parents: 20433
diff changeset
   265
           val ex' = nth_map v (K x) ex
14372
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   266
       in pick_vars discr (ineqs',ex') end
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   267
  end;
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   268
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   269
fun findex0 discr n lineqs =
22950
haftmann
parents: 22846
diff changeset
   270
  let val ineqs = maps elim_eqns lineqs
haftmann
parents: 22846
diff changeset
   271
      val rineqs = map (fn (a,le,cs) => (Rat.rat_of_int a, le, map Rat.rat_of_int cs))
14372
51ddf8963c95 Finally fixed the counterexample finder. Can now deal with < on real.
nipkow
parents: 14360
diff changeset
   272
                       ineqs
17951
ff954cc338c7 introduced functions from Pure/General/rat.ML
haftmann
parents: 17892
diff changeset
   273
  in pick_vars discr (rineqs,replicate n Rat.zero) end;
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   274
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   275
(* ------------------------------------------------------------------------- *)
23197
f96d909eda37 cosmetic
webertj
parents: 23195
diff changeset
   276
(* End of counterexample finder. The actual decision procedure starts here.  *)
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   277
(* ------------------------------------------------------------------------- *)
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   278
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   279
(* ------------------------------------------------------------------------- *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   280
(* Calculate new (in)equality type after addition.                           *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   281
(* ------------------------------------------------------------------------- *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   282
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   283
fun find_add_type(Eq,x) = x
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   284
  | find_add_type(x,Eq) = x
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   285
  | find_add_type(_,Lt) = Lt
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   286
  | find_add_type(Lt,_) = Lt
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   287
  | find_add_type(Le,Le) = Le;
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   288
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   289
(* ------------------------------------------------------------------------- *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   290
(* Multiply out an (in)equation.                                             *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   291
(* ------------------------------------------------------------------------- *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   292
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   293
fun multiply_ineq n (i as Lineq(k,ty,l,just)) =
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   294
  if n = 1 then i
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   295
  else if n = 0 andalso ty = Lt then sys_error "multiply_ineq"
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   296
  else if n < 0 andalso (ty=Le orelse ty=Lt) then sys_error "multiply_ineq"
17524
42d56a6dec6e fixed syntax for sml/nj
paulson
parents: 17515
diff changeset
   297
  else Lineq (n * k, ty, map (curry op* n) l, Multiplied (n, just));
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   298
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   299
(* ------------------------------------------------------------------------- *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   300
(* Add together (in)equations.                                               *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   301
(* ------------------------------------------------------------------------- *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   302
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   303
fun add_ineq (i1 as Lineq(k1,ty1,l1,just1)) (i2 as Lineq(k2,ty2,l2,just2)) =
18330
444f16d232a2 introduced new map2, fold
haftmann
parents: 18011
diff changeset
   304
  let val l = map2 (curry (op +)) l1 l2
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   305
  in Lineq(k1+k2,find_add_type(ty1,ty2),l,Added(just1,just2)) end;
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   306
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   307
(* ------------------------------------------------------------------------- *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   308
(* Elimination of variable between a single pair of (in)equations.           *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   309
(* If they're both inequalities, 1st coefficient must be +ve, 2nd -ve.       *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   310
(* ------------------------------------------------------------------------- *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   311
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   312
fun elim_var v (i1 as Lineq(k1,ty1,l1,just1)) (i2 as Lineq(k2,ty2,l2,just2)) =
23063
haftmann
parents: 23025
diff changeset
   313
  let val c1 = nth l1 v and c2 = nth l2 v
23261
85f27f79232f tuned integers
haftmann
parents: 23197
diff changeset
   314
      val m = Integer.lcm (abs c1) (abs c2)
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   315
      val m1 = m div (abs c1) and m2 = m div (abs c2)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   316
      val (n1,n2) =
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   317
        if (c1 >= 0) = (c2 >= 0)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   318
        then if ty1 = Eq then (~m1,m2)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   319
             else if ty2 = Eq then (m1,~m2)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   320
                  else sys_error "elim_var"
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   321
        else (m1,m2)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   322
      val (p1,p2) = if ty1=Eq andalso ty2=Eq andalso (n1 = ~1 orelse n2 = ~1)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   323
                    then (~n1,~n2) else (n1,n2)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   324
  in add_ineq (multiply_ineq n1 i1) (multiply_ineq n2 i2) end;
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   325
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   326
(* ------------------------------------------------------------------------- *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   327
(* The main refutation-finding code.                                         *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   328
(* ------------------------------------------------------------------------- *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   329
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   330
fun is_trivial (Lineq(_,_,l,_)) = forall (fn i => i=0) l;
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   331
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   332
fun is_answer (ans as Lineq(k,ty,l,_)) =
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   333
  case ty  of Eq => k <> 0 | Le => k > 0 | Lt => k >= 0;
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   334
16358
2e2a506553a3 IntInf change
nipkow
parents: 15965
diff changeset
   335
fun calc_blowup (l:IntInf.int list) =
17496
26535df536ae slight adaptions to library changes
haftmann
parents: 17325
diff changeset
   336
  let val (p,n) = List.partition (curry (op <) 0) (List.filter (curry (op <>) 0) l)
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   337
  in (length p) * (length n) end;
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   338
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   339
(* ------------------------------------------------------------------------- *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   340
(* Main elimination code:                                                    *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   341
(*                                                                           *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   342
(* (1) Looks for immediate solutions (false assertions with no variables).   *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   343
(*                                                                           *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   344
(* (2) If there are any equations, picks a variable with the lowest absolute *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   345
(* coefficient in any of them, and uses it to eliminate.                     *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   346
(*                                                                           *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   347
(* (3) Otherwise, chooses a variable in the inequality to minimize the       *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   348
(* blowup (number of consequences generated) and eliminates it.              *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   349
(* ------------------------------------------------------------------------- *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   350
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   351
fun allpairs f xs ys =
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   352
  List.concat (map (fn x => map (fn y => f x y) ys) xs);
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   353
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   354
fun extract_first p =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15184
diff changeset
   355
  let fun extract xs (y::ys) = if p y then (SOME y,xs@ys)
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   356
                               else extract (y::xs) ys
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15184
diff changeset
   357
        | extract xs []      = (NONE,xs)
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   358
  in extract [] end;
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   359
6056
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   360
fun print_ineqs ineqs =
9073
40d8dfac96b8 tracing flag for arith_tac
paulson
parents: 8263
diff changeset
   361
  if !trace then
12262
11ff5f47df6e use tracing function for trace output;
wenzelm
parents: 12109
diff changeset
   362
     tracing(cat_lines(""::map (fn Lineq(c,t,l,_) =>
16358
2e2a506553a3 IntInf change
nipkow
parents: 15965
diff changeset
   363
       IntInf.toString c ^
9073
40d8dfac96b8 tracing flag for arith_tac
paulson
parents: 8263
diff changeset
   364
       (case t of Eq => " =  " | Lt=> " <  " | Le => " <= ") ^
16358
2e2a506553a3 IntInf change
nipkow
parents: 15965
diff changeset
   365
       commas(map IntInf.toString l)) ineqs))
9073
40d8dfac96b8 tracing flag for arith_tac
paulson
parents: 8263
diff changeset
   366
  else ();
6056
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   367
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   368
type history = (int * lineq list) list;
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   369
datatype result = Success of injust | Failure of history;
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   370
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   371
fun elim (ineqs, hist) =
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   372
  let val dummy = print_ineqs ineqs
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   373
      val (triv, nontriv) = List.partition is_trivial ineqs in
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   374
  if not (null triv)
13186
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   375
  then case Library.find_first is_answer triv of
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   376
         NONE => elim (nontriv, hist)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15184
diff changeset
   377
       | SOME(Lineq(_,_,_,j)) => Success j
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   378
  else
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   379
  if null nontriv then Failure hist
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   380
  else
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   381
  let val (eqs, noneqs) = List.partition (fn (Lineq(_,ty,_,_)) => ty=Eq) nontriv in
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   382
  if not (null eqs) then
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   383
     let val clist = Library.foldl (fn (cs,Lineq(_,_,l,_)) => l union cs) ([],eqs)
16358
2e2a506553a3 IntInf change
nipkow
parents: 15965
diff changeset
   384
         val sclist = sort (fn (x,y) => IntInf.compare(abs(x),abs(y)))
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   385
                           (List.filter (fn i => i<>0) clist)
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   386
         val c = hd sclist
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15184
diff changeset
   387
         val (SOME(eq as Lineq(_,_,ceq,_)),othereqs) =
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   388
               extract_first (fn Lineq(_,_,l,_) => c mem l) eqs
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   389
         val v = find_index_eq c ceq
23063
haftmann
parents: 23025
diff changeset
   390
         val (ioth,roth) = List.partition (fn (Lineq(_,_,l,_)) => nth l v = 0)
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   391
                                     (othereqs @ noneqs)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   392
         val others = map (elim_var v eq) roth @ ioth
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   393
     in elim(others,(v,nontriv)::hist) end
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   394
  else
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   395
  let val lists = map (fn (Lineq(_,_,l,_)) => l) noneqs
23063
haftmann
parents: 23025
diff changeset
   396
      val numlist = 0 upto (length (hd lists) - 1)
haftmann
parents: 23025
diff changeset
   397
      val coeffs = map (fn i => map (fn xs => nth xs i) lists) numlist
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   398
      val blows = map calc_blowup coeffs
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   399
      val iblows = blows ~~ numlist
23063
haftmann
parents: 23025
diff changeset
   400
      val nziblows = filter_out (fn (i, _) => i = 0) iblows
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   401
  in if null nziblows then Failure((~1,nontriv)::hist)
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   402
     else
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   403
     let val (c,v) = hd(sort (fn (x,y) => int_ord(fst(x),fst(y))) nziblows)
23063
haftmann
parents: 23025
diff changeset
   404
         val (no,yes) = List.partition (fn (Lineq(_,_,l,_)) => nth l v = 0) ineqs
haftmann
parents: 23025
diff changeset
   405
         val (pos,neg) = List.partition(fn (Lineq(_,_,l,_)) => nth l v > 0) yes
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   406
     in elim(no @ allpairs (elim_var v) pos neg, (v,nontriv)::hist) end
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   407
  end
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   408
  end
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   409
  end;
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   410
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   411
(* ------------------------------------------------------------------------- *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   412
(* Translate back a proof.                                                   *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   413
(* ------------------------------------------------------------------------- *)
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   414
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   415
fun trace_thm msg th =
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   416
  (if !trace then (tracing msg; tracing (Display.string_of_thm th)) else (); th);
9073
40d8dfac96b8 tracing flag for arith_tac
paulson
parents: 8263
diff changeset
   417
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   418
fun trace_term ctxt msg t =
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   419
  (if !trace then tracing (cat_lines [msg, ProofContext.string_of_term ctxt t]) else (); t)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   420
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   421
fun trace_msg msg =
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   422
  if !trace then tracing msg else ();
9073
40d8dfac96b8 tracing flag for arith_tac
paulson
parents: 8263
diff changeset
   423
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   424
(* FIXME OPTIMIZE!!!! (partly done already)
6056
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   425
   Addition/Multiplication need i*t representation rather than t+t+...
10691
4ea37fba9c02 towards rtional arithmetic
nipkow
parents: 10575
diff changeset
   426
   Get rid of Mulitplied(2). For Nat LA_Data.number_of should return Suc^n
4ea37fba9c02 towards rtional arithmetic
nipkow
parents: 10575
diff changeset
   427
   because Numerals are not known early enough.
6056
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   428
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   429
Simplification may detect a contradiction 'prematurely' due to type
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   430
information: n+1 <= 0 is simplified to False and does not need to be crossed
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   431
with 0 <= n.
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   432
*)
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   433
local
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   434
  exception FalseE of thm
6056
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   435
in
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   436
fun mkthm ss asms (just: injust) =
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   437
  let
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   438
    val ctxt = Simplifier.the_context ss;
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   439
    val thy = ProofContext.theory_of ctxt;
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   440
    val {add_mono_thms, mult_mono_thms, inj_thms, lessD, simpset, ...} = get_data ctxt;
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   441
    val simpset' = Simplifier.inherit_context ss simpset;
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   442
    val atoms = Library.foldl (fn (ats, (lhs,_,_,rhs,_,_)) =>
6056
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   443
                            map fst lhs  union  (map fst rhs  union  ats))
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   444
                        ([], List.mapPartial (fn thm => if Thm.no_prems thm
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   445
                                              then LA_Data.decomp ctxt (Thm.concl_of thm)
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   446
                                              else NONE) asms)
6056
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   447
10575
c78d26d5c3c1 Now adjusted to mixed terms involving coercions.
nipkow
parents: 9420
diff changeset
   448
      fun add2 thm1 thm2 =
6102
b985e2184868 Split argument structure.
nipkow
parents: 6079
diff changeset
   449
        let val conj = thm1 RS (thm2 RS LA_Logic.conjI)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15184
diff changeset
   450
        in get_first (fn th => SOME(conj RS th) handle THM _ => NONE) add_mono_thms
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   451
        end;
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15184
diff changeset
   452
      fun try_add [] _ = NONE
10575
c78d26d5c3c1 Now adjusted to mixed terms involving coercions.
nipkow
parents: 9420
diff changeset
   453
        | try_add (thm1::thm1s) thm2 = case add2 thm1 thm2 of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15184
diff changeset
   454
             NONE => try_add thm1s thm2 | some => some;
10575
c78d26d5c3c1 Now adjusted to mixed terms involving coercions.
nipkow
parents: 9420
diff changeset
   455
c78d26d5c3c1 Now adjusted to mixed terms involving coercions.
nipkow
parents: 9420
diff changeset
   456
      fun addthms thm1 thm2 =
c78d26d5c3c1 Now adjusted to mixed terms involving coercions.
nipkow
parents: 9420
diff changeset
   457
        case add2 thm1 thm2 of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15184
diff changeset
   458
          NONE => (case try_add ([thm1] RL inj_thms) thm2 of
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   459
                     NONE => ( the (try_add ([thm2] RL inj_thms) thm1)
15660
255055554c67 handle Option instead of OPTION;
wenzelm
parents: 15570
diff changeset
   460
                               handle Option =>
14360
e654599b114e Added an exception handler and error msg.
nipkow
parents: 13561
diff changeset
   461
                               (trace_thm "" thm1; trace_thm "" thm2;
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   462
                                sys_error "Lin.arith. failed to add thms")
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   463
                             )
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15184
diff changeset
   464
                   | SOME thm => thm)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15184
diff changeset
   465
        | SOME thm => thm;
10575
c78d26d5c3c1 Now adjusted to mixed terms involving coercions.
nipkow
parents: 9420
diff changeset
   466
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   467
      fun multn(n,thm) =
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   468
        let fun mul(i,th) = if i=1 then th else mul(i-1, addthms thm th)
6102
b985e2184868 Split argument structure.
nipkow
parents: 6079
diff changeset
   469
        in if n < 0 then mul(~n,thm) RS LA_Logic.sym else mul(n,thm) end;
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   470
15184
d2c19aea17bc made mult_mono_thms generic.
nipkow
parents: 15027
diff changeset
   471
      fun multn2(n,thm) =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15184
diff changeset
   472
        let val SOME(mth) =
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15184
diff changeset
   473
              get_first (fn th => SOME(thm RS th) handle THM _ => NONE) mult_mono_thms
22596
d0d2af4db18f rep_thm/cterm/ctyp: removed obsolete sign field;
wenzelm
parents: 22578
diff changeset
   474
            fun cvar(th,_ $ (_ $ _ $ var)) = cterm_of (Thm.theory_of_thm th) var;
15184
d2c19aea17bc made mult_mono_thms generic.
nipkow
parents: 15027
diff changeset
   475
            val cv = cvar(mth, hd(prems_of mth));
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   476
            val ct = cterm_of thy (LA_Data.number_of(n,#T(rep_cterm cv)))
15184
d2c19aea17bc made mult_mono_thms generic.
nipkow
parents: 15027
diff changeset
   477
        in instantiate ([],[(cv,ct)]) mth end
10691
4ea37fba9c02 towards rtional arithmetic
nipkow
parents: 10575
diff changeset
   478
6056
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   479
      fun simp thm =
17515
830bc15e692c Simplifier.inherit_bounds;
wenzelm
parents: 17496
diff changeset
   480
        let val thm' = trace_thm "Simplified:" (full_simplify simpset' thm)
6102
b985e2184868 Split argument structure.
nipkow
parents: 6079
diff changeset
   481
        in if LA_Logic.is_False thm' then raise FalseE thm' else thm' end
6056
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   482
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   483
      fun mk (Asm i) = trace_thm ("Asm " ^ string_of_int i) (nth asms i)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   484
        | mk (Nat i) = trace_thm ("Nat " ^ string_of_int i) (LA_Logic.mk_nat_thm thy (nth atoms i))
20254
58b71535ed00 lin_arith_prover splits certain operators (e.g. min, max, abs)
webertj
parents: 20217
diff changeset
   485
        | mk (LessD j)            = trace_thm "L" (hd ([mk j] RL lessD))
58b71535ed00 lin_arith_prover splits certain operators (e.g. min, max, abs)
webertj
parents: 20217
diff changeset
   486
        | mk (NotLeD j)           = trace_thm "NLe" (mk j RS LA_Logic.not_leD)
58b71535ed00 lin_arith_prover splits certain operators (e.g. min, max, abs)
webertj
parents: 20217
diff changeset
   487
        | mk (NotLeDD j)          = trace_thm "NLeD" (hd ([mk j RS LA_Logic.not_leD] RL lessD))
58b71535ed00 lin_arith_prover splits certain operators (e.g. min, max, abs)
webertj
parents: 20217
diff changeset
   488
        | mk (NotLessD j)         = trace_thm "NL" (mk j RS LA_Logic.not_lessD)
58b71535ed00 lin_arith_prover splits certain operators (e.g. min, max, abs)
webertj
parents: 20217
diff changeset
   489
        | mk (Added (j1, j2))     = simp (trace_thm "+" (addthms (mk j1) (mk j2)))
58b71535ed00 lin_arith_prover splits certain operators (e.g. min, max, abs)
webertj
parents: 20217
diff changeset
   490
        | mk (Multiplied (n, j))  = (trace_msg ("*" ^ IntInf.toString n); trace_thm "*" (multn (n, mk j)))
58b71535ed00 lin_arith_prover splits certain operators (e.g. min, max, abs)
webertj
parents: 20217
diff changeset
   491
        | mk (Multiplied2 (n, j)) = simp (trace_msg ("**" ^ IntInf.toString n); trace_thm "**" (multn2 (n, mk j)))
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   492
9073
40d8dfac96b8 tracing flag for arith_tac
paulson
parents: 8263
diff changeset
   493
  in trace_msg "mkthm";
12932
3bda5306d262 updated debugging output
nipkow
parents: 12311
diff changeset
   494
     let val thm = trace_thm "Final thm:" (mk just)
17515
830bc15e692c Simplifier.inherit_bounds;
wenzelm
parents: 17496
diff changeset
   495
     in let val fls = simplify simpset' thm
13186
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   496
        in trace_thm "After simplification:" fls;
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   497
           if LA_Logic.is_False fls then fls
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   498
           else
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   499
            (tracing "Assumptions:"; List.app (tracing o Display.string_of_thm) asms;
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   500
             tracing "Proved:"; tracing (Display.string_of_thm fls);
13186
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   501
             warning "Linear arithmetic should have refuted the assumptions.\n\
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   502
                     \Please inform Tobias Nipkow (nipkow@in.tum.de).";
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   503
             fls)
12932
3bda5306d262 updated debugging output
nipkow
parents: 12311
diff changeset
   504
        end
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   505
     end handle FalseE thm => trace_thm "False reached early:" thm
12932
3bda5306d262 updated debugging output
nipkow
parents: 12311
diff changeset
   506
  end
6056
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   507
end;
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   508
23261
85f27f79232f tuned integers
haftmann
parents: 23197
diff changeset
   509
fun coeff poly atom =
23577
c5b93c69afd3 avoid polymorphic equality;
wenzelm
parents: 23520
diff changeset
   510
  AList.lookup (op aconv) poly atom |> the_default (0: integer);
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   511
23297
06f108974fa1 simplified type integer;
wenzelm
parents: 23261
diff changeset
   512
fun lcms ks = fold Integer.lcm ks 1;
10691
4ea37fba9c02 towards rtional arithmetic
nipkow
parents: 10575
diff changeset
   513
4ea37fba9c02 towards rtional arithmetic
nipkow
parents: 10575
diff changeset
   514
fun integ(rlhs,r,rel,rrhs,s,d) =
17951
ff954cc338c7 introduced functions from Pure/General/rat.ML
haftmann
parents: 17892
diff changeset
   515
let val (rn,rd) = Rat.quotient_of_rat r and (sn,sd) = Rat.quotient_of_rat s
ff954cc338c7 introduced functions from Pure/General/rat.ML
haftmann
parents: 17892
diff changeset
   516
    val m = lcms(map (abs o snd o Rat.quotient_of_rat) (r :: s :: map snd rlhs @ map snd rrhs))
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22596
diff changeset
   517
    fun mult(t,r) =
17951
ff954cc338c7 introduced functions from Pure/General/rat.ML
haftmann
parents: 17892
diff changeset
   518
        let val (i,j) = Rat.quotient_of_rat r
15965
f422f8283491 Use of IntInf.int instead of int in most numeric simprocs; avoids
paulson
parents: 15922
diff changeset
   519
        in (t,i * (m div j)) end
12932
3bda5306d262 updated debugging output
nipkow
parents: 12311
diff changeset
   520
in (m,(map mult rlhs, rn*(m div rd), rel, map mult rrhs, sn*(m div sd), d)) end
10691
4ea37fba9c02 towards rtional arithmetic
nipkow
parents: 10575
diff changeset
   521
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   522
fun mklineq n atoms =
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   523
  fn (item, k) =>
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   524
  let val (m, (lhs,i,rel,rhs,j,discrete)) = integ item
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   525
      val lhsa = map (coeff lhs) atoms
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   526
      and rhsa = map (coeff rhs) atoms
18330
444f16d232a2 introduced new map2, fold
haftmann
parents: 18011
diff changeset
   527
      val diff = map2 (curry (op -)) rhsa lhsa
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   528
      val c = i-j
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   529
      val just = Asm k
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   530
      fun lineq(c,le,cs,j) = Lineq(c,le,cs, if m=1 then j else Multiplied2(m,j))
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   531
  in case rel of
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   532
      "<="   => lineq(c,Le,diff,just)
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   533
     | "~<=" => if discrete
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   534
                then lineq(1-c,Le,map (op ~) diff,NotLeDD(just))
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   535
                else lineq(~c,Lt,map (op ~) diff,NotLeD(just))
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   536
     | "<"   => if discrete
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   537
                then lineq(c+1,Le,diff,LessD(just))
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   538
                else lineq(c,Lt,diff,just)
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   539
     | "~<"  => lineq(~c,Le,map (op~) diff,NotLessD(just))
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   540
     | "="   => lineq(c,Eq,diff,just)
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22596
diff changeset
   541
     | _     => sys_error("mklineq" ^ rel)
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   542
  end;
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   543
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   544
(* ------------------------------------------------------------------------- *)
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   545
(* Print (counter) example                                                   *)
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   546
(* ------------------------------------------------------------------------- *)
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   547
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   548
fun print_atom((a,d),r) =
17951
ff954cc338c7 introduced functions from Pure/General/rat.ML
haftmann
parents: 17892
diff changeset
   549
  let val (p,q) = Rat.quotient_of_rat r
15965
f422f8283491 Use of IntInf.int instead of int in most numeric simprocs; avoids
paulson
parents: 15922
diff changeset
   550
      val s = if d then IntInf.toString p else
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   551
              if p = 0 then "0"
15965
f422f8283491 Use of IntInf.int instead of int in most numeric simprocs; avoids
paulson
parents: 15922
diff changeset
   552
              else IntInf.toString p ^ "/" ^ IntInf.toString q
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   553
  in a ^ " = " ^ s end;
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   554
19049
2103a8e14eaa counter example: avoid vacuous trace;
wenzelm
parents: 18708
diff changeset
   555
fun produce_ex sds =
17496
26535df536ae slight adaptions to library changes
haftmann
parents: 17325
diff changeset
   556
  curry (op ~~) sds
26535df536ae slight adaptions to library changes
haftmann
parents: 17325
diff changeset
   557
  #> map print_atom
26535df536ae slight adaptions to library changes
haftmann
parents: 17325
diff changeset
   558
  #> commas
23197
f96d909eda37 cosmetic
webertj
parents: 23195
diff changeset
   559
  #> curry (op ^) "Counterexample (possibly spurious):\n";
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   560
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   561
fun trace_ex ctxt params atoms discr n (hist: history) =
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   562
  case hist of
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   563
    [] => ()
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   564
  | (v, lineqs) :: hist' =>
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   565
      let
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   566
        val frees = map Free params
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   567
        fun show_term t = ProofContext.string_of_term ctxt (subst_bounds (frees, t))
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   568
        val start =
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   569
          if v = ~1 then (hist', findex0 discr n lineqs)
22950
haftmann
parents: 22846
diff changeset
   570
          else (hist, replicate n Rat.zero)
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   571
        val ex = SOME (produce_ex (map show_term atoms ~~ discr)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   572
            (uncurry (fold (findex1 discr)) start))
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   573
          handle NoEx => NONE
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   574
      in
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   575
        case ex of
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   576
          SOME s => (warning "arith failed - see trace for a counterexample"; tracing s)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   577
        | NONE => warning "arith failed"
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   578
      end;
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   579
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   580
(* ------------------------------------------------------------------------- *)
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   581
20268
1fe9aed8fcac code reformatted
webertj
parents: 20254
diff changeset
   582
fun mknat (pTs : typ list) (ixs : int list) (atom : term, i : int) : lineq option =
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   583
  if LA_Logic.is_nat (pTs, atom)
6056
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   584
  then let val l = map (fn j => if j=i then 1 else 0) ixs
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   585
       in SOME (Lineq (0, Le, l, Nat i)) end
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   586
  else NONE;
6056
b21813d1b701 Version 1 of linear arithmetic for nat.
nipkow
parents: 5982
diff changeset
   587
13186
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   588
(* This code is tricky. It takes a list of premises in the order they occur
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15184
diff changeset
   589
in the subgoal. Numerical premises are coded as SOME(tuple), non-numerical
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15184
diff changeset
   590
ones as NONE. Going through the premises, each numeric one is converted into
13186
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   591
a Lineq. The tricky bit is to convert ~= which is split into two cases < and
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   592
>. Thus split_items returns a list of equation systems. This may blow up if
13186
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   593
there are many ~=, but in practice it does not seem to happen. The really
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   594
tricky bit is to arrange the order of the cases such that they coincide with
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   595
the order in which the cases are in the end generated by the tactic that
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   596
applies the generated refutation thms (see function 'refute_tac').
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   597
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   598
For variables n of type nat, a constraint 0 <= n is added.
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   599
*)
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   600
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   601
(* FIXME: To optimize, the splitting of cases and the search for refutations *)
20276
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   602
(*        could be intertwined: separate the first (fully split) case,       *)
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   603
(*        refute it, continue with splitting and refuting.  Terminate with   *)
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   604
(*        failure as soon as a case could not be refuted; i.e. delay further *)
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   605
(*        splitting until after a refutation for other cases has been found. *)
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   606
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   607
fun split_items ctxt do_pre (Ts, terms) : (typ list * (LA_Data.decompT * int) list) list =
20276
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   608
let
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   609
  (* splits inequalities '~=' into '<' and '>'; this corresponds to *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   610
  (* 'REPEAT_DETERM (eresolve_tac neqE i)' at the theorem/tactic    *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   611
  (* level                                                          *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   612
  (* FIXME: this is currently sensitive to the order of theorems in *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   613
  (*        neqE:  The theorem for type "nat" must come first.  A   *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   614
  (*        better (i.e. less likely to break when neqE changes)    *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   615
  (*        implementation should *test* which theorem from neqE    *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   616
  (*        can be applied, and split the premise accordingly.      *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   617
  fun elim_neq (ineqs : (LA_Data.decompT option * bool) list) :
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   618
               (LA_Data.decompT option * bool) list list =
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   619
  let
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   620
    fun elim_neq' nat_only ([] : (LA_Data.decompT option * bool) list) :
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   621
                  (LA_Data.decompT option * bool) list list =
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   622
          [[]]
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   623
      | elim_neq' nat_only ((NONE, is_nat) :: ineqs) =
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   624
          map (cons (NONE, is_nat)) (elim_neq' nat_only ineqs)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   625
      | elim_neq' nat_only ((ineq as (SOME (l, i, rel, r, j, d), is_nat)) :: ineqs) =
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   626
          if rel = "~=" andalso (not nat_only orelse is_nat) then
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   627
            (* [| ?l ~= ?r; ?l < ?r ==> ?R; ?r < ?l ==> ?R |] ==> ?R *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   628
            elim_neq' nat_only (ineqs @ [(SOME (l, i, "<", r, j, d), is_nat)]) @
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   629
            elim_neq' nat_only (ineqs @ [(SOME (r, j, "<", l, i, d), is_nat)])
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   630
          else
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   631
            map (cons ineq) (elim_neq' nat_only ineqs)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   632
  in
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   633
    ineqs |> elim_neq' true
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   634
          |> map (elim_neq' false)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   635
          |> List.concat
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   636
  end
13464
c98321b8d638 Fixed two bugs
nipkow
parents: 13186
diff changeset
   637
20276
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   638
  fun number_hyps _ []             = []
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   639
    | number_hyps n (NONE::xs)     = number_hyps (n+1) xs
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   640
    | number_hyps n ((SOME x)::xs) = (x, n) :: number_hyps (n+1) xs
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   641
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   642
  val result = (Ts, terms)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   643
    |> (* user-defined preprocessing of the subgoal *)
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   644
       (if do_pre then LA_Data.pre_decomp ctxt else Library.single)
23195
f065f7c846fe additional tracing information
webertj
parents: 23190
diff changeset
   645
    |> tap (fn subgoals => trace_msg ("Preprocessing yields " ^
f065f7c846fe additional tracing information
webertj
parents: 23190
diff changeset
   646
         string_of_int (length subgoals) ^ " subgoal(s) total."))
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22596
diff changeset
   647
    |> (* produce the internal encoding of (in-)equalities *)
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   648
       map (apsnd (map (fn t => (LA_Data.decomp ctxt t, LA_Data.domain_is_nat t))))
20276
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   649
    |> (* splitting of inequalities *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   650
       map (apsnd elim_neq)
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22596
diff changeset
   651
    |> maps (fn (Ts, subgoals) => map (pair Ts o map fst) subgoals)
20276
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   652
    |> (* numbering of hypotheses, ignoring irrelevant ones *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   653
       map (apsnd (number_hyps 0))
23195
f065f7c846fe additional tracing information
webertj
parents: 23190
diff changeset
   654
in
f065f7c846fe additional tracing information
webertj
parents: 23190
diff changeset
   655
  trace_msg ("Splitting of inequalities yields " ^
f065f7c846fe additional tracing information
webertj
parents: 23190
diff changeset
   656
    string_of_int (length result) ^ " subgoal(s) total.");
f065f7c846fe additional tracing information
webertj
parents: 23190
diff changeset
   657
  result
f065f7c846fe additional tracing information
webertj
parents: 23190
diff changeset
   658
end;
13464
c98321b8d638 Fixed two bugs
nipkow
parents: 13186
diff changeset
   659
20268
1fe9aed8fcac code reformatted
webertj
parents: 20254
diff changeset
   660
fun add_atoms (ats : term list, ((lhs,_,_,rhs,_,_) : LA_Data.decompT, _)) : term list =
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   661
    (map fst lhs) union ((map fst rhs) union ats);
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   662
20268
1fe9aed8fcac code reformatted
webertj
parents: 20254
diff changeset
   663
fun add_datoms (dats : (bool * term) list, ((lhs,_,_,rhs,_,d) : LA_Data.decompT, _)) :
1fe9aed8fcac code reformatted
webertj
parents: 20254
diff changeset
   664
  (bool * term) list =
1fe9aed8fcac code reformatted
webertj
parents: 20254
diff changeset
   665
  (map (pair d o fst) lhs) union ((map (pair d o fst) rhs) union dats);
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   666
20268
1fe9aed8fcac code reformatted
webertj
parents: 20254
diff changeset
   667
fun discr (initems : (LA_Data.decompT * int) list) : bool list =
1fe9aed8fcac code reformatted
webertj
parents: 20254
diff changeset
   668
  map fst (Library.foldl add_datoms ([],initems));
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   669
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   670
fun refutes ctxt params show_ex :
20268
1fe9aed8fcac code reformatted
webertj
parents: 20254
diff changeset
   671
  (typ list * (LA_Data.decompT * int) list) list -> injust list -> injust list option =
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   672
let
20268
1fe9aed8fcac code reformatted
webertj
parents: 20254
diff changeset
   673
  fun refute ((Ts : typ list, initems : (LA_Data.decompT * int) list)::initemss)
1fe9aed8fcac code reformatted
webertj
parents: 20254
diff changeset
   674
             (js : injust list) : injust list option =
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   675
    let
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   676
      val atoms = Library.foldl add_atoms ([], initems)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   677
      val n = length atoms
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   678
      val mkleq = mklineq n atoms
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   679
      val ixs = 0 upto (n - 1)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   680
      val iatoms = atoms ~~ ixs
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   681
      val natlineqs = List.mapPartial (mknat Ts ixs) iatoms
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   682
      val ineqs = map mkleq initems @ natlineqs
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   683
    in case elim (ineqs, []) of
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   684
         Success j =>
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   685
           (trace_msg ("Contradiction! (" ^ string_of_int (length js + 1) ^ ")");
20268
1fe9aed8fcac code reformatted
webertj
parents: 20254
diff changeset
   686
            refute initemss (js@[j]))
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   687
       | Failure hist =>
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   688
           (if not show_ex then
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   689
              ()
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   690
            else let
20276
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   691
              (* invent names for bound variables that are new, i.e. in Ts,  *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   692
              (* but not in params; we assume that Ts still contains (map    *)
d94dc40673b1 possible disagreement between proof search and proof reconstruction when eliminating inequalities over different types fixed
webertj
parents: 20268
diff changeset
   693
              (* snd params) as a suffix                                     *)
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   694
              val new_count = length Ts - length params - 1
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   695
              val new_names = map Name.bound (0 upto new_count)
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   696
              val params'   = (new_names @ map fst params) ~~ Ts
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   697
            in
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   698
              trace_ex ctxt params' atoms (discr initems) n hist
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   699
            end; NONE)
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   700
    end
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15184
diff changeset
   701
    | refute [] js = SOME js
13498
5330f1744817 Added counter example generation.
nipkow
parents: 13464
diff changeset
   702
in refute end;
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   703
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   704
fun refute ctxt params show_ex do_pre terms : injust list option =
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   705
  refutes ctxt params show_ex (split_items ctxt do_pre (map snd params, terms)) [];
20254
58b71535ed00 lin_arith_prover splits certain operators (e.g. min, max, abs)
webertj
parents: 20217
diff changeset
   706
22950
haftmann
parents: 22846
diff changeset
   707
fun count P xs = length (filter P xs);
20254
58b71535ed00 lin_arith_prover splits certain operators (e.g. min, max, abs)
webertj
parents: 20217
diff changeset
   708
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   709
fun prove ctxt (params : (string * Term.typ) list) show_ex do_pre Hs concl : injust list option =
20254
58b71535ed00 lin_arith_prover splits certain operators (e.g. min, max, abs)
webertj
parents: 20217
diff changeset
   710
  let
23190
d45c4d6c5f15 fixed handling of meta-logic propositions
webertj
parents: 23063
diff changeset
   711
    val _ = trace_msg "prove:"
20254
58b71535ed00 lin_arith_prover splits certain operators (e.g. min, max, abs)
webertj
parents: 20217
diff changeset
   712
    (* append the negated conclusion to 'Hs' -- this corresponds to     *)
58b71535ed00 lin_arith_prover splits certain operators (e.g. min, max, abs)
webertj
parents: 20217
diff changeset
   713
    (* 'DETERM (resolve_tac [LA_Logic.notI, LA_Logic.ccontr] i)' at the *)
58b71535ed00 lin_arith_prover splits certain operators (e.g. min, max, abs)
webertj
parents: 20217
diff changeset
   714
    (* theorem/tactic level                                             *)
58b71535ed00 lin_arith_prover splits certain operators (e.g. min, max, abs)
webertj
parents: 20217
diff changeset
   715
    val Hs' = Hs @ [LA_Logic.neg_prop concl]
58b71535ed00 lin_arith_prover splits certain operators (e.g. min, max, abs)
webertj
parents: 20217
diff changeset
   716
    fun is_neq NONE                 = false
58b71535ed00 lin_arith_prover splits certain operators (e.g. min, max, abs)
webertj
parents: 20217
diff changeset
   717
      | is_neq (SOME (_,_,r,_,_,_)) = (r = "~=")
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   718
    val neq_limit = ConfigOption.get ctxt LA_Data.fast_arith_neq_limit;
20254
58b71535ed00 lin_arith_prover splits certain operators (e.g. min, max, abs)
webertj
parents: 20217
diff changeset
   719
  in
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   720
    if count is_neq (map (LA_Data.decomp ctxt) Hs') > neq_limit then
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   721
     (trace_msg ("fast_arith_neq_limit exceeded (current value is " ^
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   722
        string_of_int neq_limit ^ ")"); NONE)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   723
    else
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   724
      refute ctxt params show_ex do_pre Hs'
23190
d45c4d6c5f15 fixed handling of meta-logic propositions
webertj
parents: 23063
diff changeset
   725
  end handle TERM ("neg_prop", _) =>
d45c4d6c5f15 fixed handling of meta-logic propositions
webertj
parents: 23063
diff changeset
   726
    (* since no meta-logic negation is available, we can only fail if   *)
d45c4d6c5f15 fixed handling of meta-logic propositions
webertj
parents: 23063
diff changeset
   727
    (* the conclusion is not of the form 'Trueprop $ _' (simply         *)
d45c4d6c5f15 fixed handling of meta-logic propositions
webertj
parents: 23063
diff changeset
   728
    (* dropping the conclusion doesn't work either, because even        *)
d45c4d6c5f15 fixed handling of meta-logic propositions
webertj
parents: 23063
diff changeset
   729
    (* 'False' does not imply arbitrary 'concl::prop')                  *)
d45c4d6c5f15 fixed handling of meta-logic propositions
webertj
parents: 23063
diff changeset
   730
    (trace_msg "prove failed (cannot negate conclusion)."; NONE);
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   731
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22596
diff changeset
   732
fun refute_tac ss (i, justs) =
6074
34242451bc91 Added simproc.
nipkow
parents: 6062
diff changeset
   733
  fn state =>
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   734
    let
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   735
      val ctxt = Simplifier.the_context ss;
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   736
      val _ = trace_thm ("refute_tac (on subgoal " ^ string_of_int i ^ ", with " ^
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   737
                             string_of_int (length justs) ^ " justification(s)):") state
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   738
      val {neqE, ...} = get_data ctxt;
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   739
      fun just1 j =
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   740
        (* eliminate inequalities *)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   741
        REPEAT_DETERM (eresolve_tac neqE i) THEN
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   742
          PRIMITIVE (trace_thm "State after neqE:") THEN
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   743
          (* use theorems generated from the actual justifications *)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   744
          METAHYPS (fn asms => rtac (mkthm ss asms j) 1) i
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   745
    in
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   746
      (* rewrite "[| A1; ...; An |] ==> B" to "[| A1; ...; An; ~B |] ==> False" *)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   747
      DETERM (resolve_tac [LA_Logic.notI, LA_Logic.ccontr] i) THEN
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   748
      (* user-defined preprocessing of the subgoal *)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   749
      DETERM (LA_Data.pre_tac ctxt i) THEN
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   750
      PRIMITIVE (trace_thm "State after pre_tac:") THEN
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   751
      (* prove every resulting subgoal, using its justification *)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   752
      EVERY (map just1 justs)
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 19618
diff changeset
   753
    end  state;
6074
34242451bc91 Added simproc.
nipkow
parents: 6062
diff changeset
   754
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   755
(*
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   756
Fast but very incomplete decider. Only premises and conclusions
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   757
that are already (negated) (in)equations are taken into account.
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   758
*)
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   759
fun simpset_lin_arith_tac ss show_ex = SUBGOAL (fn (A, i) =>
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   760
  let
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   761
    val ctxt = Simplifier.the_context ss
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   762
    val params = rev (Logic.strip_params A)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   763
    val Hs = Logic.strip_assums_hyp A
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   764
    val concl = Logic.strip_assums_concl A
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   765
    val _ = trace_term ctxt ("Trying to refute subgoal " ^ string_of_int i) A
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   766
  in
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   767
    case prove ctxt params show_ex true Hs concl of
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   768
      NONE => (trace_msg "Refutation failed."; no_tac)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   769
    | SOME js => (trace_msg "Refutation succeeded."; refute_tac ss (i, js))
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   770
  end);
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   771
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   772
fun cut_lin_arith_tac ss =
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   773
  cut_facts_tac (Simplifier.prems_of_ss ss) THEN'
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   774
  simpset_lin_arith_tac ss false;
17613
072c21e31b42 Simplifier.inherit_bounds;
wenzelm
parents: 17524
diff changeset
   775
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   776
fun lin_arith_tac ctxt =
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   777
  simpset_lin_arith_tac (Simplifier.context ctxt Simplifier.empty_ss);
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   778
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   779
5982
aeb97860d352 Replaced the puny nat_transitive.ML by the general fast_lin_arith.ML.
nipkow
parents:
diff changeset
   780
13186
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   781
(** Forward proof from theorems **)
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   782
20433
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   783
(* More tricky code. Needs to arrange the proofs of the multiple cases (due
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   784
to splits of ~= premises) such that it coincides with the order of the cases
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   785
generated by function split_items. *)
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   786
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   787
datatype splittree = Tip of thm list
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   788
                   | Spl of thm * cterm * splittree * cterm * splittree;
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   789
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   790
(* "(ct1 ==> ?R) ==> (ct2 ==> ?R) ==> ?R" is taken to (ct1, ct2) *)
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   791
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   792
fun extract (imp : cterm) : cterm * cterm =
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   793
let val (Il, r)    = Thm.dest_comb imp
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   794
    val (_, imp1)  = Thm.dest_comb Il
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   795
    val (Ict1, _)  = Thm.dest_comb imp1
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   796
    val (_, ct1)   = Thm.dest_comb Ict1
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   797
    val (Ir, _)    = Thm.dest_comb r
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   798
    val (_, Ict2r) = Thm.dest_comb Ir
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   799
    val (Ict2, _)  = Thm.dest_comb Ict2r
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   800
    val (_, ct2)   = Thm.dest_comb Ict2
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   801
in (ct1, ct2) end;
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   802
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   803
fun splitasms ctxt (asms : thm list) : splittree =
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   804
let val {neqE, ...} = get_data ctxt
20433
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   805
    fun elim_neq (asms', []) = Tip (rev asms')
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   806
      | elim_neq (asms', asm::asms) =
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   807
      (case get_first (fn th => SOME (asm COMP th) handle THM _ => NONE) neqE of
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   808
        SOME spl =>
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   809
          let val (ct1, ct2) = extract (cprop_of spl)
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   810
              val thm1 = assume ct1
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   811
              val thm2 = assume ct2
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   812
          in Spl (spl, ct1, elim_neq (asms', asms@[thm1]), ct2, elim_neq (asms', asms@[thm2]))
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   813
          end
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   814
      | NONE => elim_neq (asm::asms', asms))
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   815
in elim_neq ([], asms) end;
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   816
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   817
fun fwdproof ss (Tip asms : splittree) (j::js : injust list) = (mkthm ss asms j, js)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   818
  | fwdproof ss (Spl (thm, ct1, tree1, ct2, tree2)) js =
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   819
      let
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   820
        val (thm1, js1) = fwdproof ss tree1 js
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   821
        val (thm2, js2) = fwdproof ss tree2 js1
20433
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   822
        val thm1' = implies_intr ct1 thm1
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   823
        val thm2' = implies_intr ct2 thm2
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   824
      in (thm2' COMP (thm1' COMP thm), js2) end;
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   825
      (* FIXME needs handle THM _ => NONE ? *)
20433
55471f940e5c lin_arith_prover: splitting reverted because of performance loss
webertj
parents: 20280
diff changeset
   826
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   827
fun prover ss thms Tconcl (js : injust list) pos : thm option =
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   828
  let
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   829
    val ctxt = Simplifier.the_context ss
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   830
    val thy = ProofContext.theory_of ctxt
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   831
    val nTconcl = LA_Logic.neg_prop Tconcl
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   832
    val cnTconcl = cterm_of thy nTconcl
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   833
    val nTconclthm = assume cnTconcl
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   834
    val tree = splitasms ctxt (thms @ [nTconclthm])
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   835
    val (Falsethm, _) = fwdproof ss tree js
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   836
    val contr = if pos then LA_Logic.ccontr else LA_Logic.notI
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   837
    val concl = implies_intr cnTconcl Falsethm COMP contr
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   838
  in SOME (trace_thm "Proved by lin. arith. prover:" (LA_Logic.mk_Eq concl)) end
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   839
  (*in case concl contains ?-var, which makes assume fail:*)   (* FIXME Variable.import_terms *)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   840
  handle THM _ => NONE;
13186
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   841
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   842
(* PRE: concl is not negated!
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   843
   This assumption is OK because
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   844
   1. lin_arith_simproc tries both to prove and disprove concl and
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   845
   2. lin_arith_simproc is applied by the Simplifier which
13186
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   846
      dives into terms and will thus try the non-negated concl anyway.
ef8ed6adcb38 Big update. Allows case splitting on ~= now (trying both < and >).
nipkow
parents: 13105
diff changeset
   847
*)
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   848
fun lin_arith_simproc ss concl =
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   849
  let
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   850
    val ctxt = Simplifier.the_context ss
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   851
    val thms = List.concat (map LA_Logic.atomize (Simplifier.prems_of_ss ss))
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   852
    val Hs = map Thm.prop_of thms
6102
b985e2184868 Split argument structure.
nipkow
parents: 6079
diff changeset
   853
    val Tconcl = LA_Logic.mk_Trueprop concl
24076
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   854
  in
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   855
    case prove ctxt [] false false Hs Tconcl of (* concl provable? *)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   856
      SOME js => prover ss thms Tconcl js true
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   857
    | NONE =>
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   858
        let val nTconcl = LA_Logic.neg_prop Tconcl in
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   859
          case prove ctxt [] false false Hs nTconcl of (* ~concl provable? *)
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   860
            SOME js => prover ss thms nTconcl js false
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   861
          | NONE => NONE
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   862
        end
ae946f751c44 arith method setup: proper context;
wenzelm
parents: 24039
diff changeset
   863
  end;
6074
34242451bc91 Added simproc.
nipkow
parents: 6062
diff changeset
   864
34242451bc91 Added simproc.
nipkow
parents: 6062
diff changeset
   865
end;