neuper@37871
|
1 |
(* questionable attempts to perserve binary minus as wanted by teachers
|
neuper@37871
|
2 |
WN071207
|
neuper@37871
|
3 |
(c) due to copyright terms
|
neuper@37871
|
4 |
remove_thy"PolyMinus";
|
neuper@37871
|
5 |
use_thy"IsacKnowledge/PolyMinus";
|
neuper@37871
|
6 |
|
neuper@37871
|
7 |
use_thy"IsacKnowledge/Isac";
|
neuper@37871
|
8 |
use"IsacKnowledge/PolyMinus.ML";
|
neuper@37871
|
9 |
*)
|
neuper@37871
|
10 |
|
neuper@37871
|
11 |
(** interface isabelle -- isac **)
|
neuper@37871
|
12 |
theory' := overwritel (!theory', [("PolyMinus.thy",PolyMinus.thy)]);
|
neuper@37871
|
13 |
|
neuper@37871
|
14 |
(** eval functions **)
|
neuper@37871
|
15 |
|
neuper@37871
|
16 |
(*. get the identifier from specific monomials; see fun ist_monom .*)
|
neuper@37871
|
17 |
(*HACK.WN080107*)
|
neuper@37871
|
18 |
fun increase str =
|
neuper@37871
|
19 |
let val s::ss = explode str
|
neuper@37871
|
20 |
in implode ((chr (ord s + 1))::ss) end;
|
neuper@37871
|
21 |
fun identifier (Free (id,_)) = id (* 2, a *)
|
neuper@37871
|
22 |
| identifier (Const ("op *", _) $ Free (num, _) $ Free (id, _)) =
|
neuper@37871
|
23 |
id (* 2*a, a*b *)
|
neuper@37871
|
24 |
| identifier (Const ("op *", _) $ (* 3*a*b *)
|
neuper@37871
|
25 |
(Const ("op *", _) $
|
neuper@37871
|
26 |
Free (num, _) $ Free _) $ Free (id, _)) =
|
neuper@37871
|
27 |
if is_numeral num then id
|
neuper@37871
|
28 |
else "|||||||||||||"
|
neuper@37871
|
29 |
| identifier (Const ("Atools.pow", _) $ Free (base, _) $ Free (exp, _)) =
|
neuper@37871
|
30 |
if is_numeral base then "|||||||||||||" (* a^2 *)
|
neuper@37871
|
31 |
else (*increase*) base
|
neuper@37871
|
32 |
| identifier (Const ("op *", _) $ Free (num, _) $ (* 3*a^2 *)
|
neuper@37871
|
33 |
(Const ("Atools.pow", _) $
|
neuper@37871
|
34 |
Free (base, _) $ Free (exp, _))) =
|
neuper@37871
|
35 |
if is_numeral num andalso not (is_numeral base) then (*increase*) base
|
neuper@37871
|
36 |
else "|||||||||||||"
|
neuper@37871
|
37 |
| identifier _ = "|||||||||||||"(*the "largest" string*);
|
neuper@37871
|
38 |
|
neuper@37871
|
39 |
(*("kleiner", ("PolyMinus.kleiner", eval_kleiner ""))*)
|
neuper@37871
|
40 |
(* order "by alphabet" w.r.t. var: num < (var | num*var) > (var*var | ..) *)
|
neuper@37871
|
41 |
fun eval_kleiner _ _ (p as (Const ("PolyMinus.kleiner",_) $ a $ b)) _ =
|
neuper@37871
|
42 |
if is_num b then
|
neuper@37871
|
43 |
if is_num a then (*123 kleiner 32 = True !!!*)
|
neuper@37871
|
44 |
if int_of_Free a < int_of_Free b then
|
neuper@37871
|
45 |
Some ((term2str p) ^ " = True",
|
neuper@37871
|
46 |
Trueprop $ (mk_equality (p, HOLogic.true_const)))
|
neuper@37871
|
47 |
else Some ((term2str p) ^ " = False",
|
neuper@37871
|
48 |
Trueprop $ (mk_equality (p, HOLogic.false_const)))
|
neuper@37871
|
49 |
else (* -1 * -2 kleiner 0 *)
|
neuper@37871
|
50 |
Some ((term2str p) ^ " = False",
|
neuper@37871
|
51 |
Trueprop $ (mk_equality (p, HOLogic.false_const)))
|
neuper@37871
|
52 |
else
|
neuper@37871
|
53 |
if identifier a < identifier b then
|
neuper@37871
|
54 |
Some ((term2str p) ^ " = True",
|
neuper@37871
|
55 |
Trueprop $ (mk_equality (p, HOLogic.true_const)))
|
neuper@37871
|
56 |
else Some ((term2str p) ^ " = False",
|
neuper@37871
|
57 |
Trueprop $ (mk_equality (p, HOLogic.false_const)))
|
neuper@37871
|
58 |
| eval_kleiner _ _ _ _ = None;
|
neuper@37871
|
59 |
|
neuper@37871
|
60 |
fun ist_monom (Free (id,_)) = true
|
neuper@37871
|
61 |
| ist_monom (Const ("op *", _) $ Free (num, _) $ Free (id, _)) =
|
neuper@37871
|
62 |
if is_numeral num then true else false
|
neuper@37871
|
63 |
| ist_monom _ = false;
|
neuper@37871
|
64 |
(*. this function only accepts the most simple monoms vvvvvvvvvv .*)
|
neuper@37871
|
65 |
fun ist_monom (Free (id,_)) = true (* 2, a *)
|
neuper@37871
|
66 |
| ist_monom (Const ("op *", _) $ Free _ $ Free (id, _)) = (* 2*a, a*b *)
|
neuper@37871
|
67 |
if is_numeral id then false else true
|
neuper@37871
|
68 |
| ist_monom (Const ("op *", _) $ (* 3*a*b *)
|
neuper@37871
|
69 |
(Const ("op *", _) $
|
neuper@37871
|
70 |
Free (num, _) $ Free _) $ Free (id, _)) =
|
neuper@37871
|
71 |
if is_numeral num andalso not (is_numeral id) then true else false
|
neuper@37871
|
72 |
| ist_monom (Const ("Atools.pow", _) $ Free (base, _) $ Free (exp, _)) =
|
neuper@37871
|
73 |
true (* a^2 *)
|
neuper@37871
|
74 |
| ist_monom (Const ("op *", _) $ Free (num, _) $ (* 3*a^2 *)
|
neuper@37871
|
75 |
(Const ("Atools.pow", _) $
|
neuper@37871
|
76 |
Free (base, _) $ Free (exp, _))) =
|
neuper@37871
|
77 |
if is_numeral num then true else false
|
neuper@37871
|
78 |
| ist_monom _ = false;
|
neuper@37871
|
79 |
|
neuper@37871
|
80 |
(* is this a univariate monomial ? *)
|
neuper@37871
|
81 |
(*("ist_monom", ("PolyMinus.ist'_monom", eval_ist_monom ""))*)
|
neuper@37871
|
82 |
fun eval_ist_monom _ _ (p as (Const ("PolyMinus.ist'_monom",_) $ a)) _ =
|
neuper@37871
|
83 |
if ist_monom a then
|
neuper@37871
|
84 |
Some ((term2str p) ^ " = True",
|
neuper@37871
|
85 |
Trueprop $ (mk_equality (p, HOLogic.true_const)))
|
neuper@37871
|
86 |
else Some ((term2str p) ^ " = False",
|
neuper@37871
|
87 |
Trueprop $ (mk_equality (p, HOLogic.false_const)))
|
neuper@37871
|
88 |
| eval_ist_monom _ _ _ _ = None;
|
neuper@37871
|
89 |
|
neuper@37871
|
90 |
|
neuper@37871
|
91 |
(** rewrite order **)
|
neuper@37871
|
92 |
|
neuper@37871
|
93 |
(** rulesets **)
|
neuper@37871
|
94 |
|
neuper@37871
|
95 |
val erls_ordne_alphabetisch =
|
neuper@37871
|
96 |
append_rls "erls_ordne_alphabetisch" e_rls
|
neuper@37871
|
97 |
[Calc ("PolyMinus.kleiner", eval_kleiner ""),
|
neuper@37871
|
98 |
Calc ("PolyMinus.ist'_monom", eval_ist_monom "")
|
neuper@37871
|
99 |
];
|
neuper@37871
|
100 |
|
neuper@37871
|
101 |
val ordne_alphabetisch =
|
neuper@37871
|
102 |
Rls{id = "ordne_alphabetisch", preconds = [],
|
neuper@37871
|
103 |
rew_ord = ("dummy_ord", dummy_ord), srls = Erls, calc = [],
|
neuper@37871
|
104 |
erls = erls_ordne_alphabetisch,
|
neuper@37871
|
105 |
rules = [Thm ("tausche_plus",num_str tausche_plus),
|
neuper@37871
|
106 |
(*"b kleiner a ==> (b + a) = (a + b)"*)
|
neuper@37871
|
107 |
Thm ("tausche_minus",num_str tausche_minus),
|
neuper@37871
|
108 |
(*"b kleiner a ==> (b - a) = (-a + b)"*)
|
neuper@37871
|
109 |
Thm ("tausche_vor_plus",num_str tausche_vor_plus),
|
neuper@37871
|
110 |
(*"[| b ist_monom; a kleiner b |] ==> (- b + a) = (a - b)"*)
|
neuper@37871
|
111 |
Thm ("tausche_vor_minus",num_str tausche_vor_minus),
|
neuper@37871
|
112 |
(*"[| b ist_monom; a kleiner b |] ==> (- b - a) = (-a - b)"*)
|
neuper@37871
|
113 |
Thm ("tausche_plus_plus",num_str tausche_plus_plus),
|
neuper@37871
|
114 |
(*"c kleiner b ==> (a + c + b) = (a + b + c)"*)
|
neuper@37871
|
115 |
Thm ("tausche_plus_minus",num_str tausche_plus_minus),
|
neuper@37871
|
116 |
(*"c kleiner b ==> (a + c - b) = (a - b + c)"*)
|
neuper@37871
|
117 |
Thm ("tausche_minus_plus",num_str tausche_minus_plus),
|
neuper@37871
|
118 |
(*"c kleiner b ==> (a - c + b) = (a + b - c)"*)
|
neuper@37871
|
119 |
Thm ("tausche_minus_minus",num_str tausche_minus_minus)
|
neuper@37871
|
120 |
(*"c kleiner b ==> (a - c - b) = (a - b - c)"*)
|
neuper@37871
|
121 |
], scr = EmptyScr}:rls;
|
neuper@37871
|
122 |
|
neuper@37871
|
123 |
val fasse_zusammen =
|
neuper@37871
|
124 |
Rls{id = "fasse_zusammen", preconds = [],
|
neuper@37871
|
125 |
rew_ord = ("dummy_ord", dummy_ord),
|
neuper@37871
|
126 |
erls = append_rls "erls_fasse_zusammen" e_rls
|
neuper@37871
|
127 |
[Calc ("Atools.is'_const",eval_const "#is_const_")],
|
neuper@37871
|
128 |
srls = Erls, calc = [],
|
neuper@37871
|
129 |
rules =
|
neuper@37871
|
130 |
[Thm ("real_num_collect",num_str real_num_collect),
|
neuper@37871
|
131 |
(*"[| l is_const; m is_const |]==>l * n + m * n = (l + m) * n"*)
|
neuper@37871
|
132 |
Thm ("real_num_collect_assoc_r",num_str real_num_collect_assoc_r),
|
neuper@37871
|
133 |
(*"[| l is_const; m..|] ==> (k + m * n) + l * n = k + (l + m)*n"*)
|
neuper@37871
|
134 |
Thm ("real_one_collect",num_str real_one_collect),
|
neuper@37871
|
135 |
(*"m is_const ==> n + m * n = (1 + m) * n"*)
|
neuper@37871
|
136 |
Thm ("real_one_collect_assoc_r",num_str real_one_collect_assoc_r),
|
neuper@37871
|
137 |
(*"m is_const ==> (k + n) + m * n = k + (m + 1) * n"*)
|
neuper@37871
|
138 |
|
neuper@37871
|
139 |
|
neuper@37871
|
140 |
Thm ("subtrahiere",num_str subtrahiere),
|
neuper@37871
|
141 |
(*"[| l is_const; m is_const |] ==> m * v - l * v = (m - l) * v"*)
|
neuper@37871
|
142 |
Thm ("subtrahiere_von_1",num_str subtrahiere_von_1),
|
neuper@37871
|
143 |
(*"[| l is_const |] ==> v - l * v = (1 - l) * v"*)
|
neuper@37871
|
144 |
Thm ("subtrahiere_1",num_str subtrahiere_1),
|
neuper@37871
|
145 |
(*"[| l is_const; m is_const |] ==> m * v - v = (m - 1) * v"*)
|
neuper@37871
|
146 |
|
neuper@37871
|
147 |
Thm ("subtrahiere_x_plus_minus",num_str subtrahiere_x_plus_minus),
|
neuper@37871
|
148 |
(*"[| l is_const; m..|] ==> (k + m * n) - l * n = k + ( m - l) * n"*)
|
neuper@37871
|
149 |
Thm ("subtrahiere_x_plus1_minus",num_str subtrahiere_x_plus1_minus),
|
neuper@37871
|
150 |
(*"[| l is_const |] ==> (x + v) - l * v = x + (1 - l) * v"*)
|
neuper@37871
|
151 |
Thm ("subtrahiere_x_plus_minus1",num_str subtrahiere_x_plus_minus1),
|
neuper@37871
|
152 |
(*"[| m is_const |] ==> (x + m * v) - v = x + (m - 1) * v"*)
|
neuper@37871
|
153 |
|
neuper@37871
|
154 |
Thm ("subtrahiere_x_minus_plus",num_str subtrahiere_x_minus_plus),
|
neuper@37871
|
155 |
(*"[| l is_const; m..|] ==> (k - m * n) + l * n = k + (-m + l) * n"*)
|
neuper@37871
|
156 |
Thm ("subtrahiere_x_minus1_plus",num_str subtrahiere_x_minus1_plus),
|
neuper@37871
|
157 |
(*"[| l is_const |] ==> (x - v) + l * v = x + (-1 + l) * v"*)
|
neuper@37871
|
158 |
Thm ("subtrahiere_x_minus_plus1",num_str subtrahiere_x_minus_plus1),
|
neuper@37871
|
159 |
(*"[| m is_const |] ==> (x - m * v) + v = x + (-m + 1) * v"*)
|
neuper@37871
|
160 |
|
neuper@37871
|
161 |
Thm ("subtrahiere_x_minus_minus",num_str subtrahiere_x_minus_minus),
|
neuper@37871
|
162 |
(*"[| l is_const; m..|] ==> (k - m * n) - l * n = k + (-m - l) * n"*)
|
neuper@37871
|
163 |
Thm ("subtrahiere_x_minus1_minus",num_str subtrahiere_x_minus1_minus),
|
neuper@37871
|
164 |
(*"[| l is_const |] ==> (x - v) - l * v = x + (-1 - l) * v"*)
|
neuper@37871
|
165 |
Thm ("subtrahiere_x_minus_minus1",num_str subtrahiere_x_minus_minus1),
|
neuper@37871
|
166 |
(*"[| m is_const |] ==> (x - m * v) - v = x + (-m - 1) * v"*)
|
neuper@37871
|
167 |
|
neuper@37871
|
168 |
Calc ("op +", eval_binop "#add_"),
|
neuper@37871
|
169 |
Calc ("op -", eval_binop "#subtr_"),
|
neuper@37871
|
170 |
|
neuper@37871
|
171 |
(*MG: Reihenfolge der folgenden 2 Thm muss so bleiben, wegen
|
neuper@37871
|
172 |
(a+a)+a --> a + 2*a --> 3*a and not (a+a)+a --> 2*a + a *)
|
neuper@37871
|
173 |
Thm ("real_mult_2_assoc_r",num_str real_mult_2_assoc_r),
|
neuper@37871
|
174 |
(*"(k + z1) + z1 = k + 2 * z1"*)
|
neuper@37871
|
175 |
Thm ("sym_real_mult_2",num_str (real_mult_2 RS sym)),
|
neuper@37871
|
176 |
(*"z1 + z1 = 2 * z1"*)
|
neuper@37871
|
177 |
|
neuper@37871
|
178 |
Thm ("addiere_vor_minus",num_str addiere_vor_minus),
|
neuper@37871
|
179 |
(*"[| l is_const; m is_const |] ==> -(l * v) + m * v = (-l + m) *v"*)
|
neuper@37871
|
180 |
Thm ("addiere_eins_vor_minus",num_str addiere_eins_vor_minus),
|
neuper@37871
|
181 |
(*"[| m is_const |] ==> - v + m * v = (-1 + m) * v"*)
|
neuper@37871
|
182 |
Thm ("subtrahiere_vor_minus",num_str subtrahiere_vor_minus),
|
neuper@37871
|
183 |
(*"[| l is_const; m is_const |] ==> -(l * v) - m * v = (-l - m) *v"*)
|
neuper@37871
|
184 |
Thm ("subtrahiere_eins_vor_minus",num_str subtrahiere_eins_vor_minus)
|
neuper@37871
|
185 |
(*"[| m is_const |] ==> - v - m * v = (-1 - m) * v"*)
|
neuper@37871
|
186 |
|
neuper@37871
|
187 |
], scr = EmptyScr}:rls;
|
neuper@37871
|
188 |
|
neuper@37871
|
189 |
val verschoenere =
|
neuper@37871
|
190 |
Rls{id = "verschoenere", preconds = [],
|
neuper@37871
|
191 |
rew_ord = ("dummy_ord", dummy_ord), srls = Erls, calc = [],
|
neuper@37871
|
192 |
erls = append_rls "erls_verschoenere" e_rls
|
neuper@37871
|
193 |
[Calc ("PolyMinus.kleiner", eval_kleiner "")],
|
neuper@37871
|
194 |
rules = [Thm ("vorzeichen_minus_weg1",num_str vorzeichen_minus_weg1),
|
neuper@37871
|
195 |
(*"l kleiner 0 ==> a + l * b = a - -l * b"*)
|
neuper@37871
|
196 |
Thm ("vorzeichen_minus_weg2",num_str vorzeichen_minus_weg2),
|
neuper@37871
|
197 |
(*"l kleiner 0 ==> a - l * b = a + -l * b"*)
|
neuper@37871
|
198 |
Thm ("vorzeichen_minus_weg3",num_str vorzeichen_minus_weg3),
|
neuper@37871
|
199 |
(*"l kleiner 0 ==> k + a - l * b = k + a + -l * b"*)
|
neuper@37871
|
200 |
Thm ("vorzeichen_minus_weg4",num_str vorzeichen_minus_weg4),
|
neuper@37871
|
201 |
(*"l kleiner 0 ==> k - a - l * b = k - a + -l * b"*)
|
neuper@37871
|
202 |
|
neuper@37871
|
203 |
Calc ("op *", eval_binop "#mult_"),
|
neuper@37871
|
204 |
|
neuper@37871
|
205 |
Thm ("real_mult_0",num_str real_mult_0),
|
neuper@37871
|
206 |
(*"0 * z = 0"*)
|
neuper@37871
|
207 |
Thm ("real_mult_1",num_str real_mult_1),
|
neuper@37871
|
208 |
(*"1 * z = z"*)
|
neuper@37871
|
209 |
Thm ("real_add_zero_left",num_str real_add_zero_left),
|
neuper@37871
|
210 |
(*"0 + z = z"*)
|
neuper@37871
|
211 |
Thm ("null_minus",num_str null_minus),
|
neuper@37871
|
212 |
(*"0 - a = -a"*)
|
neuper@37871
|
213 |
Thm ("vor_minus_mal",num_str vor_minus_mal)
|
neuper@37871
|
214 |
(*"- a * b = (-a) * b"*)
|
neuper@37871
|
215 |
|
neuper@37871
|
216 |
(*Thm ("",num_str ),*)
|
neuper@37871
|
217 |
(**)
|
neuper@37871
|
218 |
], scr = EmptyScr}:rls (*end verschoenere*);
|
neuper@37871
|
219 |
|
neuper@37871
|
220 |
val klammern_aufloesen =
|
neuper@37871
|
221 |
Rls{id = "klammern_aufloesen", preconds = [],
|
neuper@37871
|
222 |
rew_ord = ("dummy_ord", dummy_ord), srls = Erls, calc = [], erls = Erls,
|
neuper@37871
|
223 |
rules = [Thm ("sym_real_add_assoc",num_str (real_add_assoc RS sym)),
|
neuper@37871
|
224 |
(*"a + (b + c) = (a + b) + c"*)
|
neuper@37871
|
225 |
Thm ("klammer_plus_minus",num_str klammer_plus_minus),
|
neuper@37871
|
226 |
(*"a + (b - c) = (a + b) - c"*)
|
neuper@37871
|
227 |
Thm ("klammer_minus_plus",num_str klammer_minus_plus),
|
neuper@37871
|
228 |
(*"a - (b + c) = (a - b) - c"*)
|
neuper@37871
|
229 |
Thm ("klammer_minus_minus",num_str klammer_minus_minus)
|
neuper@37871
|
230 |
(*"a - (b - c) = (a - b) + c"*)
|
neuper@37871
|
231 |
], scr = EmptyScr}:rls;
|
neuper@37871
|
232 |
|
neuper@37871
|
233 |
val klammern_ausmultiplizieren =
|
neuper@37871
|
234 |
Rls{id = "klammern_ausmultiplizieren", preconds = [],
|
neuper@37871
|
235 |
rew_ord = ("dummy_ord", dummy_ord), srls = Erls, calc = [], erls = Erls,
|
neuper@37871
|
236 |
rules = [Thm ("real_add_mult_distrib" ,num_str real_add_mult_distrib),
|
neuper@37871
|
237 |
(*"(z1.0 + z2.0) * w = z1.0 * w + z2.0 * w"*)
|
neuper@37871
|
238 |
Thm ("real_add_mult_distrib2",num_str real_add_mult_distrib2),
|
neuper@37871
|
239 |
(*"w * (z1.0 + z2.0) = w * z1.0 + w * z2.0"*)
|
neuper@37871
|
240 |
|
neuper@37871
|
241 |
Thm ("klammer_mult_minus",num_str klammer_mult_minus),
|
neuper@37871
|
242 |
(*"a * (b - c) = a * b - a * c"*)
|
neuper@37871
|
243 |
Thm ("klammer_minus_mult",num_str klammer_minus_mult)
|
neuper@37871
|
244 |
(*"(b - c) * a = b * a - c * a"*)
|
neuper@37871
|
245 |
|
neuper@37871
|
246 |
(*Thm ("",num_str ),
|
neuper@37871
|
247 |
(*""*)*)
|
neuper@37871
|
248 |
], scr = EmptyScr}:rls;
|
neuper@37871
|
249 |
|
neuper@37871
|
250 |
val ordne_monome =
|
neuper@37871
|
251 |
Rls{id = "ordne_monome", preconds = [],
|
neuper@37871
|
252 |
rew_ord = ("dummy_ord", dummy_ord), srls = Erls, calc = [],
|
neuper@37871
|
253 |
erls = append_rls "erls_ordne_monome" e_rls
|
neuper@37871
|
254 |
[Calc ("PolyMinus.kleiner", eval_kleiner ""),
|
neuper@37871
|
255 |
Calc ("Atools.is'_atom", eval_is_atom "")
|
neuper@37871
|
256 |
],
|
neuper@37871
|
257 |
rules = [Thm ("tausche_mal",num_str tausche_mal),
|
neuper@37871
|
258 |
(*"[| b is_atom; a kleiner b |] ==> (b * a) = (a * b)"*)
|
neuper@37871
|
259 |
Thm ("tausche_vor_mal",num_str tausche_vor_mal),
|
neuper@37871
|
260 |
(*"[| b is_atom; a kleiner b |] ==> (-b * a) = (-a * b)"*)
|
neuper@37871
|
261 |
Thm ("tausche_mal_mal",num_str tausche_mal_mal),
|
neuper@37871
|
262 |
(*"[| c is_atom; b kleiner c |] ==> (a * c * b) = (a * b *c)"*)
|
neuper@37871
|
263 |
Thm ("x_quadrat",num_str x_quadrat)
|
neuper@37871
|
264 |
(*"(x * a) * a = x * a ^^^ 2"*)
|
neuper@37871
|
265 |
|
neuper@37871
|
266 |
(*Thm ("",num_str ),
|
neuper@37871
|
267 |
(*""*)*)
|
neuper@37871
|
268 |
], scr = EmptyScr}:rls;
|
neuper@37871
|
269 |
|
neuper@37871
|
270 |
|
neuper@37871
|
271 |
val rls_p_33 =
|
neuper@37871
|
272 |
append_rls "rls_p_33" e_rls
|
neuper@37871
|
273 |
[Rls_ ordne_alphabetisch,
|
neuper@37871
|
274 |
Rls_ fasse_zusammen,
|
neuper@37871
|
275 |
Rls_ verschoenere
|
neuper@37871
|
276 |
];
|
neuper@37871
|
277 |
val rls_p_34 =
|
neuper@37871
|
278 |
append_rls "rls_p_34" e_rls
|
neuper@37871
|
279 |
[Rls_ klammern_aufloesen,
|
neuper@37871
|
280 |
Rls_ ordne_alphabetisch,
|
neuper@37871
|
281 |
Rls_ fasse_zusammen,
|
neuper@37871
|
282 |
Rls_ verschoenere
|
neuper@37871
|
283 |
];
|
neuper@37871
|
284 |
val rechnen =
|
neuper@37871
|
285 |
append_rls "rechnen" e_rls
|
neuper@37871
|
286 |
[Calc ("op *", eval_binop "#mult_"),
|
neuper@37871
|
287 |
Calc ("op +", eval_binop "#add_"),
|
neuper@37871
|
288 |
Calc ("op -", eval_binop "#subtr_")
|
neuper@37871
|
289 |
];
|
neuper@37871
|
290 |
|
neuper@37871
|
291 |
ruleset' :=
|
neuper@37871
|
292 |
overwritelthy thy (!ruleset',
|
neuper@37871
|
293 |
[("ordne_alphabetisch", prep_rls ordne_alphabetisch),
|
neuper@37871
|
294 |
("fasse_zusammen", prep_rls fasse_zusammen),
|
neuper@37871
|
295 |
("verschoenere", prep_rls verschoenere),
|
neuper@37871
|
296 |
("ordne_monome", prep_rls ordne_monome),
|
neuper@37871
|
297 |
("klammern_aufloesen", prep_rls klammern_aufloesen),
|
neuper@37871
|
298 |
("klammern_ausmultiplizieren",
|
neuper@37871
|
299 |
prep_rls klammern_ausmultiplizieren)
|
neuper@37871
|
300 |
]);
|
neuper@37871
|
301 |
|
neuper@37871
|
302 |
(** problems **)
|
neuper@37871
|
303 |
|
neuper@37871
|
304 |
store_pbt
|
neuper@37871
|
305 |
(prep_pbt PolyMinus.thy "pbl_vereinf_poly" [] e_pblID
|
neuper@37871
|
306 |
(["polynom","vereinfachen"],
|
neuper@37871
|
307 |
[], Erls, None, []));
|
neuper@37871
|
308 |
|
neuper@37871
|
309 |
store_pbt
|
neuper@37871
|
310 |
(prep_pbt PolyMinus.thy "pbl_vereinf_poly_minus" [] e_pblID
|
neuper@37871
|
311 |
(["plus_minus","polynom","vereinfachen"],
|
neuper@37871
|
312 |
[("#Given" ,["term t_"]),
|
neuper@37871
|
313 |
("#Where" ,["t_ is_polyexp",
|
neuper@37871
|
314 |
"Not (matchsub (?a + (?b + ?c)) t_ | \
|
neuper@37871
|
315 |
\ matchsub (?a + (?b - ?c)) t_ | \
|
neuper@37871
|
316 |
\ matchsub (?a - (?b + ?c)) t_ | \
|
neuper@37871
|
317 |
\ matchsub (?a + (?b - ?c)) t_ )",
|
neuper@37871
|
318 |
"Not (matchsub (?a * (?b + ?c)) t_ | \
|
neuper@37871
|
319 |
\ matchsub (?a * (?b - ?c)) t_ | \
|
neuper@37871
|
320 |
\ matchsub ((?b + ?c) * ?a) t_ | \
|
neuper@37871
|
321 |
\ matchsub ((?b - ?c) * ?a) t_ )"]),
|
neuper@37871
|
322 |
("#Find" ,["normalform n_"])
|
neuper@37871
|
323 |
],
|
neuper@37871
|
324 |
append_rls "prls_pbl_vereinf_poly" e_rls
|
neuper@37871
|
325 |
[Calc ("Poly.is'_polyexp", eval_is_polyexp ""),
|
neuper@37871
|
326 |
Calc ("Tools.matchsub", eval_matchsub ""),
|
neuper@37871
|
327 |
Thm ("or_true",or_true),
|
neuper@37871
|
328 |
(*"(?a | True) = True"*)
|
neuper@37871
|
329 |
Thm ("or_false",or_false),
|
neuper@37871
|
330 |
(*"(?a | False) = ?a"*)
|
neuper@37871
|
331 |
Thm ("not_true",num_str not_true),
|
neuper@37871
|
332 |
(*"(~ True) = False"*)
|
neuper@37871
|
333 |
Thm ("not_false",num_str not_false)
|
neuper@37871
|
334 |
(*"(~ False) = True"*)],
|
neuper@37871
|
335 |
Some "Vereinfache t_",
|
neuper@37871
|
336 |
[["simplification","for_polynomials","with_minus"]]));
|
neuper@37871
|
337 |
|
neuper@37871
|
338 |
store_pbt
|
neuper@37871
|
339 |
(prep_pbt PolyMinus.thy "pbl_vereinf_poly_klammer" [] e_pblID
|
neuper@37871
|
340 |
(["klammer","polynom","vereinfachen"],
|
neuper@37871
|
341 |
[("#Given" ,["term t_"]),
|
neuper@37871
|
342 |
("#Where" ,["t_ is_polyexp",
|
neuper@37871
|
343 |
"Not (matchsub (?a * (?b + ?c)) t_ | \
|
neuper@37871
|
344 |
\ matchsub (?a * (?b - ?c)) t_ | \
|
neuper@37871
|
345 |
\ matchsub ((?b + ?c) * ?a) t_ | \
|
neuper@37871
|
346 |
\ matchsub ((?b - ?c) * ?a) t_ )"]),
|
neuper@37871
|
347 |
("#Find" ,["normalform n_"])
|
neuper@37871
|
348 |
],
|
neuper@37871
|
349 |
append_rls "prls_pbl_vereinf_poly_klammer" e_rls [Calc ("Poly.is'_polyexp", eval_is_polyexp ""),
|
neuper@37871
|
350 |
Calc ("Tools.matchsub", eval_matchsub ""),
|
neuper@37871
|
351 |
Thm ("or_true",or_true),
|
neuper@37871
|
352 |
(*"(?a | True) = True"*)
|
neuper@37871
|
353 |
Thm ("or_false",or_false),
|
neuper@37871
|
354 |
(*"(?a | False) = ?a"*)
|
neuper@37871
|
355 |
Thm ("not_true",num_str not_true),
|
neuper@37871
|
356 |
(*"(~ True) = False"*)
|
neuper@37871
|
357 |
Thm ("not_false",num_str not_false)
|
neuper@37871
|
358 |
(*"(~ False) = True"*)],
|
neuper@37871
|
359 |
Some "Vereinfache t_",
|
neuper@37871
|
360 |
[["simplification","for_polynomials","with_parentheses"]]));
|
neuper@37871
|
361 |
|
neuper@37871
|
362 |
store_pbt
|
neuper@37871
|
363 |
(prep_pbt PolyMinus.thy "pbl_vereinf_poly_klammer_mal" [] e_pblID
|
neuper@37871
|
364 |
(["binom_klammer","polynom","vereinfachen"],
|
neuper@37871
|
365 |
[("#Given" ,["term t_"]),
|
neuper@37871
|
366 |
("#Where" ,["t_ is_polyexp"]),
|
neuper@37871
|
367 |
("#Find" ,["normalform n_"])
|
neuper@37871
|
368 |
],
|
neuper@37871
|
369 |
append_rls "e_rls" e_rls [(*for preds in where_*)
|
neuper@37871
|
370 |
Calc ("Poly.is'_polyexp", eval_is_polyexp "")],
|
neuper@37871
|
371 |
Some "Vereinfache t_",
|
neuper@37871
|
372 |
[["simplification","for_polynomials","with_parentheses_mult"]]));
|
neuper@37871
|
373 |
|
neuper@37871
|
374 |
store_pbt
|
neuper@37871
|
375 |
(prep_pbt PolyMinus.thy "pbl_probe" [] e_pblID
|
neuper@37871
|
376 |
(["probe"],
|
neuper@37871
|
377 |
[], Erls, None, []));
|
neuper@37871
|
378 |
|
neuper@37871
|
379 |
store_pbt
|
neuper@37871
|
380 |
(prep_pbt PolyMinus.thy "pbl_probe_poly" [] e_pblID
|
neuper@37871
|
381 |
(["polynom","probe"],
|
neuper@37871
|
382 |
[("#Given" ,["Pruefe e_", "mitWert ws_"]),
|
neuper@37871
|
383 |
("#Where" ,["e_ is_polyexp"]),
|
neuper@37871
|
384 |
("#Find" ,["Geprueft p_"])
|
neuper@37871
|
385 |
],
|
neuper@37871
|
386 |
append_rls "prls_pbl_probe_poly"
|
neuper@37871
|
387 |
e_rls [(*for preds in where_*)
|
neuper@37871
|
388 |
Calc ("Poly.is'_polyexp", eval_is_polyexp "")],
|
neuper@37871
|
389 |
Some "Probe e_ ws_",
|
neuper@37871
|
390 |
[["probe","fuer_polynom"]]));
|
neuper@37871
|
391 |
|
neuper@37871
|
392 |
store_pbt
|
neuper@37871
|
393 |
(prep_pbt PolyMinus.thy "pbl_probe_bruch" [] e_pblID
|
neuper@37871
|
394 |
(["bruch","probe"],
|
neuper@37871
|
395 |
[("#Given" ,["Pruefe e_", "mitWert ws_"]),
|
neuper@37871
|
396 |
("#Where" ,["e_ is_ratpolyexp"]),
|
neuper@37871
|
397 |
("#Find" ,["Geprueft p_"])
|
neuper@37871
|
398 |
],
|
neuper@37871
|
399 |
append_rls "prls_pbl_probe_bruch"
|
neuper@37871
|
400 |
e_rls [(*for preds in where_*)
|
neuper@37871
|
401 |
Calc ("Rational.is'_ratpolyexp", eval_is_ratpolyexp "")],
|
neuper@37871
|
402 |
Some "Probe e_ ws_",
|
neuper@37871
|
403 |
[["probe","fuer_bruch"]]));
|
neuper@37871
|
404 |
|
neuper@37871
|
405 |
|
neuper@37871
|
406 |
(** methods **)
|
neuper@37871
|
407 |
|
neuper@37871
|
408 |
store_met
|
neuper@37871
|
409 |
(prep_met PolyMinus.thy "met_simp_poly_minus" [] e_metID
|
neuper@37871
|
410 |
(["simplification","for_polynomials","with_minus"],
|
neuper@37871
|
411 |
[("#Given" ,["term t_"]),
|
neuper@37871
|
412 |
("#Where" ,["t_ is_polyexp",
|
neuper@37871
|
413 |
"Not (matchsub (?a + (?b + ?c)) t_ | \
|
neuper@37871
|
414 |
\ matchsub (?a + (?b - ?c)) t_ | \
|
neuper@37871
|
415 |
\ matchsub (?a - (?b + ?c)) t_ | \
|
neuper@37871
|
416 |
\ matchsub (?a + (?b - ?c)) t_ )"]),
|
neuper@37871
|
417 |
("#Find" ,["normalform n_"])
|
neuper@37871
|
418 |
],
|
neuper@37871
|
419 |
{rew_ord'="tless_true", rls' = e_rls, calc = [], srls = e_rls,
|
neuper@37871
|
420 |
prls = append_rls "prls_met_simp_poly_minus" e_rls
|
neuper@37871
|
421 |
[Calc ("Poly.is'_polyexp", eval_is_polyexp ""),
|
neuper@37871
|
422 |
Calc ("Tools.matchsub", eval_matchsub ""),
|
neuper@37871
|
423 |
Thm ("and_true",and_true),
|
neuper@37871
|
424 |
(*"(?a & True) = ?a"*)
|
neuper@37871
|
425 |
Thm ("and_false",and_false),
|
neuper@37871
|
426 |
(*"(?a & False) = False"*)
|
neuper@37871
|
427 |
Thm ("not_true",num_str not_true),
|
neuper@37871
|
428 |
(*"(~ True) = False"*)
|
neuper@37871
|
429 |
Thm ("not_false",num_str not_false)
|
neuper@37871
|
430 |
(*"(~ False) = True"*)],
|
neuper@37871
|
431 |
crls = e_rls, nrls = rls_p_33},
|
neuper@37871
|
432 |
"Script SimplifyScript (t_::real) = \
|
neuper@37871
|
433 |
\ ((Repeat((Try (Rewrite_Set ordne_alphabetisch False)) @@ \
|
neuper@37871
|
434 |
\ (Try (Rewrite_Set fasse_zusammen False)) @@ \
|
neuper@37871
|
435 |
\ (Try (Rewrite_Set verschoenere False)))) t_)"
|
neuper@37871
|
436 |
));
|
neuper@37871
|
437 |
|
neuper@37871
|
438 |
store_met
|
neuper@37871
|
439 |
(prep_met PolyMinus.thy "met_simp_poly_parenth" [] e_metID
|
neuper@37871
|
440 |
(["simplification","for_polynomials","with_parentheses"],
|
neuper@37871
|
441 |
[("#Given" ,["term t_"]),
|
neuper@37871
|
442 |
("#Where" ,["t_ is_polyexp"]),
|
neuper@37871
|
443 |
("#Find" ,["normalform n_"])
|
neuper@37871
|
444 |
],
|
neuper@37871
|
445 |
{rew_ord'="tless_true", rls' = e_rls, calc = [], srls = e_rls,
|
neuper@37871
|
446 |
prls = append_rls "simplification_for_polynomials_prls" e_rls
|
neuper@37871
|
447 |
[(*for preds in where_*)
|
neuper@37871
|
448 |
Calc("Poly.is'_polyexp",eval_is_polyexp"")],
|
neuper@37871
|
449 |
crls = e_rls, nrls = rls_p_34},
|
neuper@37871
|
450 |
"Script SimplifyScript (t_::real) = \
|
neuper@37871
|
451 |
\ ((Repeat((Try (Rewrite_Set klammern_aufloesen False)) @@ \
|
neuper@37871
|
452 |
\ (Try (Rewrite_Set ordne_alphabetisch False)) @@ \
|
neuper@37871
|
453 |
\ (Try (Rewrite_Set fasse_zusammen False)) @@ \
|
neuper@37871
|
454 |
\ (Try (Rewrite_Set verschoenere False)))) t_)"
|
neuper@37871
|
455 |
));
|
neuper@37871
|
456 |
|
neuper@37871
|
457 |
store_met
|
neuper@37871
|
458 |
(prep_met PolyMinus.thy "met_simp_poly_parenth_mult" [] e_metID
|
neuper@37871
|
459 |
(["simplification","for_polynomials","with_parentheses_mult"],
|
neuper@37871
|
460 |
[("#Given" ,["term t_"]),
|
neuper@37871
|
461 |
("#Where" ,["t_ is_polyexp"]),
|
neuper@37871
|
462 |
("#Find" ,["normalform n_"])
|
neuper@37871
|
463 |
],
|
neuper@37871
|
464 |
{rew_ord'="tless_true", rls' = e_rls, calc = [], srls = e_rls,
|
neuper@37871
|
465 |
prls = append_rls "simplification_for_polynomials_prls" e_rls
|
neuper@37871
|
466 |
[(*for preds in where_*)
|
neuper@37871
|
467 |
Calc("Poly.is'_polyexp",eval_is_polyexp"")],
|
neuper@37871
|
468 |
crls = e_rls, nrls = rls_p_34},
|
neuper@37871
|
469 |
"Script SimplifyScript (t_::real) = \
|
neuper@37871
|
470 |
\ ((Repeat((Try (Rewrite_Set klammern_ausmultiplizieren False)) @@ \
|
neuper@37871
|
471 |
\ (Try (Rewrite_Set discard_parentheses False)) @@ \
|
neuper@37871
|
472 |
\ (Try (Rewrite_Set ordne_monome False)) @@ \
|
neuper@37871
|
473 |
\ (Try (Rewrite_Set klammern_aufloesen False)) @@ \
|
neuper@37871
|
474 |
\ (Try (Rewrite_Set ordne_alphabetisch False)) @@ \
|
neuper@37871
|
475 |
\ (Try (Rewrite_Set fasse_zusammen False)) @@ \
|
neuper@37871
|
476 |
\ (Try (Rewrite_Set verschoenere False)))) t_)"
|
neuper@37871
|
477 |
));
|
neuper@37871
|
478 |
|
neuper@37871
|
479 |
store_met
|
neuper@37871
|
480 |
(prep_met PolyMinus.thy "met_probe" [] e_metID
|
neuper@37871
|
481 |
(["probe"],
|
neuper@37871
|
482 |
[],
|
neuper@37871
|
483 |
{rew_ord'="tless_true", rls' = e_rls, calc = [], srls = e_rls,
|
neuper@37871
|
484 |
prls = Erls, crls = e_rls, nrls = Erls},
|
neuper@37871
|
485 |
"empty_script"));
|
neuper@37871
|
486 |
|
neuper@37871
|
487 |
store_met
|
neuper@37871
|
488 |
(prep_met PolyMinus.thy "met_probe_poly" [] e_metID
|
neuper@37871
|
489 |
(["probe","fuer_polynom"],
|
neuper@37871
|
490 |
[("#Given" ,["Pruefe e_", "mitWert ws_"]),
|
neuper@37871
|
491 |
("#Where" ,["e_ is_polyexp"]),
|
neuper@37871
|
492 |
("#Find" ,["Geprueft p_"])
|
neuper@37871
|
493 |
],
|
neuper@37871
|
494 |
{rew_ord'="tless_true", rls' = e_rls, calc = [], srls = e_rls,
|
neuper@37871
|
495 |
prls = append_rls "prls_met_probe_bruch"
|
neuper@37871
|
496 |
e_rls [(*for preds in where_*)
|
neuper@37871
|
497 |
Calc ("Rational.is'_ratpolyexp",
|
neuper@37871
|
498 |
eval_is_ratpolyexp "")],
|
neuper@37871
|
499 |
crls = e_rls, nrls = rechnen},
|
neuper@37871
|
500 |
"Script ProbeScript (e_::bool) (ws_::bool list) = \
|
neuper@37871
|
501 |
\ (let e_ = Take e_; \
|
neuper@37871
|
502 |
\ e_ = Substitute ws_ e_ \
|
neuper@37871
|
503 |
\ in (Repeat((Try (Repeat (Calculate times))) @@ \
|
neuper@37871
|
504 |
\ (Try (Repeat (Calculate plus ))) @@ \
|
neuper@37871
|
505 |
\ (Try (Repeat (Calculate minus))))) e_)"
|
neuper@37871
|
506 |
));
|
neuper@37871
|
507 |
|
neuper@37871
|
508 |
store_met
|
neuper@37871
|
509 |
(prep_met PolyMinus.thy "met_probe_bruch" [] e_metID
|
neuper@37871
|
510 |
(["probe","fuer_bruch"],
|
neuper@37871
|
511 |
[("#Given" ,["Pruefe e_", "mitWert ws_"]),
|
neuper@37871
|
512 |
("#Where" ,["e_ is_ratpolyexp"]),
|
neuper@37871
|
513 |
("#Find" ,["Geprueft p_"])
|
neuper@37871
|
514 |
],
|
neuper@37871
|
515 |
{rew_ord'="tless_true", rls' = e_rls, calc = [], srls = e_rls,
|
neuper@37871
|
516 |
prls = append_rls "prls_met_probe_bruch"
|
neuper@37871
|
517 |
e_rls [(*for preds in where_*)
|
neuper@37871
|
518 |
Calc ("Rational.is'_ratpolyexp",
|
neuper@37871
|
519 |
eval_is_ratpolyexp "")],
|
neuper@37871
|
520 |
crls = e_rls, nrls = Erls},
|
neuper@37871
|
521 |
"empty_script"));
|