wneuper@259
|
1 |
(* tests on PolyMinus
|
wneuper@259
|
2 |
author: Walther Neuper
|
wneuper@259
|
3 |
WN071207,
|
wneuper@259
|
4 |
(c) due to copyright terms
|
wneuper@259
|
5 |
|
wneuper@259
|
6 |
use"../smltest/IsacKnowledge/polyminus.sml";
|
wneuper@259
|
7 |
use"polyminus.sml";
|
wneuper@259
|
8 |
*)
|
wneuper@264
|
9 |
val thy = PolyMinus.thy;
|
wneuper@259
|
10 |
|
wneuper@259
|
11 |
"-----------------------------------------------------------------";
|
wneuper@259
|
12 |
"table of contents -----------------------------------------------";
|
wneuper@259
|
13 |
"-----------------------------------------------------------------";
|
wneuper@259
|
14 |
"----------- watch order_add_mult -------------------------------";
|
wneuper@259
|
15 |
"----------- build predicate for +- ordering ---------------------";
|
wneuper@265
|
16 |
"----------- build fasse_zusammen --------------------------------";
|
wneuper@264
|
17 |
"----------- build verschoenere ----------------------------------";
|
wneuper@265
|
18 |
"----------- met simplification for_polynomials with_minus -------";
|
wneuper@277
|
19 |
"----------- pbl polynom vereinfachen p.33 -----------------------";
|
wneuper@266
|
20 |
"----------- met probe fuer_polynom ------------------------------";
|
wneuper@266
|
21 |
"----------- pbl polynom probe -----------------------------------";
|
wneuper@267
|
22 |
"----------- pbl klammer polynom vereinfachen p.34 ---------------";
|
wneuper@272
|
23 |
"----------- try fun applyTactics --------------------------------";
|
wneuper@276
|
24 |
"----------- pbl binom polynom vereinfachen p.39 -----------------";
|
wneuper@259
|
25 |
"-----------------------------------------------------------------";
|
wneuper@259
|
26 |
"-----------------------------------------------------------------";
|
wneuper@259
|
27 |
"-----------------------------------------------------------------";
|
wneuper@259
|
28 |
|
wneuper@259
|
29 |
|
wneuper@259
|
30 |
"----------- watch order_add_mult -------------------------------";
|
wneuper@259
|
31 |
"----------- watch order_add_mult -------------------------------";
|
wneuper@259
|
32 |
"----------- watch order_add_mult -------------------------------";
|
wneuper@259
|
33 |
"----- with these simple variables it works...";
|
wneuper@259
|
34 |
trace_rewrite:=true;
|
wneuper@264
|
35 |
trace_rewrite:=false;
|
wneuper@259
|
36 |
val t = str2term "((a + d) + c) + b";
|
wneuper@259
|
37 |
val Some (t,_) = rewrite_set_ thy false order_add_mult t; term2str t;
|
wneuper@259
|
38 |
if term2str t = "a + (b + (c + d))" then ()
|
wneuper@259
|
39 |
else raise error "polyminus.sml 1 watch order_add_mult";
|
wneuper@259
|
40 |
trace_rewrite:=false;
|
wneuper@259
|
41 |
|
wneuper@259
|
42 |
"----- the same stepwise...";
|
wneuper@259
|
43 |
val od = ord_make_polynomial true Poly.thy;
|
wneuper@259
|
44 |
val t = str2term "((a + d) + c) + b";
|
wneuper@259
|
45 |
"((a + d) + c) + b";
|
wneuper@259
|
46 |
val Some (t,_) = rewrite_ thy od e_rls true real_add_commute t; term2str t;
|
wneuper@259
|
47 |
"b + ((a + d) + c)";
|
wneuper@259
|
48 |
val Some (t,_) = rewrite_ thy od e_rls true real_add_commute t; term2str t;
|
wneuper@259
|
49 |
"b + (c + (a + d))";
|
wneuper@259
|
50 |
val Some (t,_) = rewrite_ thy od e_rls true real_add_left_commute t;term2str t;
|
wneuper@259
|
51 |
"b + (a + (c + d))";
|
wneuper@259
|
52 |
val Some (t,_) = rewrite_ thy od e_rls true real_add_left_commute t;term2str t;
|
wneuper@259
|
53 |
"a + (b + (c + d))";
|
wneuper@259
|
54 |
if term2str t = "a + (b + (c + d))" then ()
|
wneuper@259
|
55 |
else raise error "polyminus.sml 2 watch order_add_mult";
|
wneuper@259
|
56 |
|
wneuper@263
|
57 |
"----- if parentheses are right, left_commute is (almost) sufficient...";
|
wneuper@259
|
58 |
val t = str2term "a + (d + (c + b))";
|
wneuper@259
|
59 |
"a + (d + (c + b))";
|
wneuper@259
|
60 |
val Some (t,_) = rewrite_ thy od e_rls true real_add_left_commute t;term2str t;
|
wneuper@259
|
61 |
"a + (c + (d + b))";
|
wneuper@259
|
62 |
val Some (t,_) = rewrite_ thy od e_rls true real_add_commute t;term2str t;
|
wneuper@259
|
63 |
"a + (c + (b + d))";
|
wneuper@259
|
64 |
val Some (t,_) = rewrite_ thy od e_rls true real_add_left_commute t;term2str t;
|
wneuper@259
|
65 |
"a + (b + (c + d))";
|
wneuper@259
|
66 |
|
wneuper@259
|
67 |
"----- but we do not want the parentheses at right; thus: cond.rew.";
|
wneuper@259
|
68 |
"WN0712707 complicated monomials do not yet work ...";
|
wneuper@259
|
69 |
val t = str2term "((5*a + 4*d) + 3*c) + 2*b";
|
wneuper@259
|
70 |
val Some (t,_) = rewrite_set_ thy false order_add_mult t; term2str t;
|
wneuper@263
|
71 |
if term2str t = "2 * b + (3 * c + (4 * d + 5 * a))" then ()
|
wneuper@263
|
72 |
else raise error "polyminus.sml: order_add_mult changed";
|
wneuper@259
|
73 |
|
wneuper@263
|
74 |
"----- here we see rew_sub going into subterm with ord.rew....";
|
wneuper@263
|
75 |
val od = ord_make_polynomial false Poly.thy;
|
wneuper@263
|
76 |
val t = str2term "b + a + c + d";
|
wneuper@263
|
77 |
val Some (t,_) = rewrite_ thy od e_rls false real_add_commute t; term2str t;
|
wneuper@263
|
78 |
val Some (t,_) = rewrite_ thy od e_rls false real_add_commute t; term2str t;
|
wneuper@263
|
79 |
(*@@@ rew_sub gosub: t = d + (b + a + c)
|
wneuper@263
|
80 |
@@@ rew_sub begin: t = b + a + c*)
|
wneuper@263
|
81 |
|
wneuper@259
|
82 |
|
wneuper@259
|
83 |
"----------- build predicate for +- ordering ---------------------";
|
wneuper@259
|
84 |
"----------- build predicate for +- ordering ---------------------";
|
wneuper@259
|
85 |
"----------- build predicate for +- ordering ---------------------";
|
wneuper@259
|
86 |
"a" < "b";
|
wneuper@259
|
87 |
"ba" < "ab";
|
wneuper@263
|
88 |
"123" < "a"; (*unused due to ---vvv*)
|
wneuper@263
|
89 |
"12" < "3"; (*true !!!*)
|
wneuper@259
|
90 |
|
wneuper@263
|
91 |
" a kleiner b ==> (b + a) = (a + b)";
|
wneuper@259
|
92 |
str2term "aaa";
|
wneuper@259
|
93 |
str2term "222 * aaa";
|
wneuper@259
|
94 |
|
wneuper@263
|
95 |
case eval_kleiner 0 0 (str2term "12 kleiner 9") 0 of
|
wneuper@263
|
96 |
Some ("12 kleiner 9 = False", _) => ()
|
wneuper@263
|
97 |
| _ => raise error "polyminus.sml: 12 kleiner 9 = False";
|
wneuper@263
|
98 |
|
wneuper@263
|
99 |
case eval_kleiner 0 0 (str2term "a kleiner b") 0 of
|
wneuper@263
|
100 |
Some ("a kleiner b = True", _) => ()
|
wneuper@263
|
101 |
| _ => raise error "polyminus.sml: a kleiner b = True";
|
wneuper@263
|
102 |
|
wneuper@276
|
103 |
case eval_kleiner 0 0 (str2term "(10*g) kleiner f") 0 of
|
wneuper@276
|
104 |
Some ("10 * g kleiner f = False", _) => ()
|
wneuper@276
|
105 |
| _ => raise error "polyminus.sml: 10 * g kleiner f = False";
|
wneuper@276
|
106 |
|
wneuper@264
|
107 |
"----- compare tausche_plus with real_num_collect";
|
wneuper@263
|
108 |
val od = dummy_ord;
|
wneuper@264
|
109 |
|
wneuper@263
|
110 |
val erls = erls_ordne_alphabetisch;
|
wneuper@263
|
111 |
val t = str2term "b + a";
|
wneuper@263
|
112 |
val Some (t,_) = rewrite_ thy od erls false tausche_plus t; term2str t;
|
wneuper@263
|
113 |
if term2str t = "a + b" then ()
|
wneuper@263
|
114 |
else raise error "polyminus.sml: ordne_alphabetisch1 b + a";
|
wneuper@263
|
115 |
|
wneuper@264
|
116 |
val erls = Atools_erls;
|
wneuper@264
|
117 |
val t = str2term "2*a + 3*a";
|
wneuper@264
|
118 |
val Some (t,_) = rewrite_ thy od erls false real_num_collect t; term2str t;
|
wneuper@264
|
119 |
|
wneuper@264
|
120 |
"----- test rewrite_, rewrite_set_";
|
wneuper@259
|
121 |
trace_rewrite:=true;
|
wneuper@264
|
122 |
val erls = erls_ordne_alphabetisch;
|
wneuper@259
|
123 |
val t = str2term "b + a";
|
wneuper@259
|
124 |
val Some (t,_) = rewrite_set_ thy false ordne_alphabetisch t; term2str t;
|
wneuper@263
|
125 |
if term2str t = "a + b" then ()
|
wneuper@263
|
126 |
else raise error "polyminus.sml: ordne_alphabetisch a + b";
|
wneuper@259
|
127 |
|
wneuper@259
|
128 |
val t = str2term "2*b + a";
|
wneuper@259
|
129 |
val Some (t,_) = rewrite_set_ thy false ordne_alphabetisch t; term2str t;
|
wneuper@263
|
130 |
if term2str t = "a + 2 * b" then ()
|
wneuper@263
|
131 |
else raise error "polyminus.sml: ordne_alphabetisch a + 2 * b";
|
wneuper@259
|
132 |
|
wneuper@259
|
133 |
val t = str2term "a + c + b";
|
wneuper@259
|
134 |
val Some (t,_) = rewrite_set_ thy false ordne_alphabetisch t; term2str t;
|
wneuper@263
|
135 |
if term2str t = "a + b + c" then ()
|
wneuper@263
|
136 |
else raise error "polyminus.sml: ordne_alphabetisch a + b + c";
|
wneuper@263
|
137 |
|
wneuper@263
|
138 |
"----- rewrite goes into subterms";
|
wneuper@263
|
139 |
val t = str2term "a + c + b + d";
|
wneuper@263
|
140 |
val Some (t,_) = rewrite_ thy od erls false tausche_plus_plus t; term2str t;
|
wneuper@263
|
141 |
if term2str t = "a + b + c + d" then ()
|
wneuper@263
|
142 |
else raise error "polyminus.sml: ordne_alphabetisch1 a + b + c + d";
|
wneuper@259
|
143 |
|
wneuper@259
|
144 |
val t = str2term "a + c + d + b";
|
wneuper@259
|
145 |
val Some (t,_) = rewrite_set_ thy false ordne_alphabetisch t; term2str t;
|
wneuper@263
|
146 |
if term2str t = "a + b + c + d" then ()
|
wneuper@263
|
147 |
else raise error "polyminus.sml: ordne_alphabetisch2 a + b + c + d";
|
wneuper@260
|
148 |
|
wneuper@260
|
149 |
"----- here we see rew_sub going into subterm with cond.rew....";
|
wneuper@260
|
150 |
val t = str2term "b + a + c + d";
|
wneuper@260
|
151 |
val Some (t,_) = rewrite_ thy od erls false tausche_plus t; term2str t;
|
wneuper@263
|
152 |
if term2str t = "a + b + c + d" then ()
|
wneuper@263
|
153 |
else raise error "polyminus.sml: ordne_alphabetisch3 a + b + c + d";
|
wneuper@260
|
154 |
|
wneuper@263
|
155 |
"----- compile rls for the most complicated terms";
|
wneuper@259
|
156 |
val t = str2term "5*e + 6*f - 8*g - 9 - 7*e - 4*f + 10*g + 12";
|
wneuper@259
|
157 |
"5 * e + 6 * f - 8 * g - 9 - 7 * e - 4 * f + 10 * g + 12";
|
wneuper@264
|
158 |
val Some (t,_) = rewrite_set_ thy false ordne_alphabetisch t;
|
wneuper@264
|
159 |
if term2str t = "- 9 + 12 + 5 * e - 7 * e + 6 * f - 4 * f - 8 * g + 10 * g"
|
wneuper@264
|
160 |
then () else raise error "polyminus.sml: ordne_alphabetisch finished";
|
wneuper@263
|
161 |
|
wneuper@263
|
162 |
|
wneuper@265
|
163 |
"----------- build fasse_zusammen --------------------------------";
|
wneuper@265
|
164 |
"----------- build fasse_zusammen --------------------------------";
|
wneuper@265
|
165 |
"----------- build fasse_zusammen --------------------------------";
|
wneuper@264
|
166 |
val t = str2term "- 9 + 12 + 5 * e - 7 * e + 6 * f - 4 * f - 8 * g + 10 * g";
|
wneuper@264
|
167 |
val Some (t,_) = rewrite_set_ thy false fasse_zusammen t;
|
wneuper@264
|
168 |
if term2str t = "3 + -2 * e + 2 * f + 2 * g" then ()
|
wneuper@264
|
169 |
else raise error "polyminus.sml: fasse_zusammen finished";
|
wneuper@264
|
170 |
|
wneuper@264
|
171 |
"----------- build verschoenere ----------------------------------";
|
wneuper@264
|
172 |
"----------- build verschoenere ----------------------------------";
|
wneuper@264
|
173 |
"----------- build verschoenere ----------------------------------";
|
wneuper@264
|
174 |
val t = str2term "3 + -2 * e + 2 * f + 2 * g";
|
wneuper@264
|
175 |
val Some (t,_) = rewrite_set_ thy false verschoenere t;
|
wneuper@264
|
176 |
if term2str t = "3 - 2 * e + 2 * f + 2 * g" then ()
|
wneuper@264
|
177 |
else raise error "polyminus.sml: verschoenere 3 + -2 * e ...";
|
wneuper@264
|
178 |
|
wneuper@264
|
179 |
trace_rewrite:=true;
|
wneuper@263
|
180 |
trace_rewrite:=false;
|
wneuper@265
|
181 |
|
wneuper@265
|
182 |
"----------- met simplification for_polynomials with_minus -------";
|
wneuper@265
|
183 |
"----------- met simplification for_polynomials with_minus -------";
|
wneuper@265
|
184 |
"----------- met simplification for_polynomials with_minus -------";
|
wneuper@265
|
185 |
val str =
|
wneuper@265
|
186 |
"Script SimplifyScript (t_::real) = \
|
wneuper@265
|
187 |
\ (((Try (Rewrite_Set ordne_alphabetisch False)) @@ \
|
wneuper@265
|
188 |
\ (Try (Rewrite_Set fasse_zusammen False)) @@ \
|
wneuper@265
|
189 |
\ (Try (Rewrite_Set verschoenere False))) t_)"
|
wneuper@265
|
190 |
val sc = ((inst_abs thy) o term_of o the o (parse thy)) str;
|
wneuper@265
|
191 |
atomty sc;
|
wneuper@265
|
192 |
|
wneuper@265
|
193 |
|
wneuper@277
|
194 |
"----------- pbl polynom vereinfachen p.33 -----------------------";
|
wneuper@277
|
195 |
"----------- pbl polynom vereinfachen p.33 -----------------------";
|
wneuper@277
|
196 |
"----------- pbl polynom vereinfachen p.33 -----------------------";
|
wneuper@277
|
197 |
"----------- 140 c ---";
|
wneuper@265
|
198 |
states:=[];
|
wneuper@265
|
199 |
CalcTree [(["term (5*e + 6*f - 8*g - 9 - 7*e - 4*f + 10*g + 12)",
|
wneuper@265
|
200 |
"normalform N"],
|
wneuper@277
|
201 |
("PolyMinus.thy",["plus_minus","polynom","vereinfachen"],
|
wneuper@265
|
202 |
["simplification","for_polynomials","with_minus"]))];
|
wneuper@265
|
203 |
moveActiveRoot 1;
|
wneuper@265
|
204 |
autoCalculate 1 CompleteCalc;
|
wneuper@277
|
205 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
wneuper@265
|
206 |
if p = ([], Res) andalso
|
wneuper@265
|
207 |
term2str (get_obj g_res pt (fst p)) = "3 - 2 * e + 2 * f + 2 * g"
|
wneuper@266
|
208 |
then () else raise error "polyminus.sml: Vereinfache (3 - 2 * e + 2 * f...";
|
wneuper@277
|
209 |
|
wneuper@277
|
210 |
"----------- 140 d ---";
|
wneuper@277
|
211 |
states:=[];
|
wneuper@277
|
212 |
CalcTree [(["term (-r - 2*s - 3*t + 5 + 4*r + 8*s - 5*t - 2)",
|
wneuper@277
|
213 |
"normalform N"],
|
wneuper@277
|
214 |
("PolyMinus.thy",["plus_minus","polynom","vereinfachen"],
|
wneuper@277
|
215 |
["simplification","for_polynomials","with_minus"]))];
|
wneuper@277
|
216 |
moveActiveRoot 1;
|
wneuper@277
|
217 |
autoCalculate 1 CompleteCalc;
|
wneuper@277
|
218 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
wneuper@277
|
219 |
if p = ([], Res) andalso
|
wneuper@277
|
220 |
term2str (get_obj g_res pt (fst p)) = "3 + 3 * r + 6 * s - 8 * t"
|
wneuper@277
|
221 |
then () else raise error "polyminus.sml: Vereinfache 140 d)";
|
wneuper@277
|
222 |
|
wneuper@277
|
223 |
|
wneuper@277
|
224 |
"----------- 139 c ---";
|
wneuper@277
|
225 |
states:=[];
|
wneuper@277
|
226 |
CalcTree [(["term (3*e - 6*f - 8*e - 4*f + 5*e + 7*f)",
|
wneuper@277
|
227 |
"normalform N"],
|
wneuper@277
|
228 |
("PolyMinus.thy",["plus_minus","polynom","vereinfachen"],
|
wneuper@277
|
229 |
["simplification","for_polynomials","with_minus"]))];
|
wneuper@277
|
230 |
moveActiveRoot 1;
|
wneuper@277
|
231 |
autoCalculate 1 CompleteCalc;
|
wneuper@277
|
232 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
wneuper@277
|
233 |
if p = ([], Res) andalso
|
wneuper@277
|
234 |
term2str (get_obj g_res pt (fst p)) = "- (3 * f)"
|
wneuper@277
|
235 |
then () else raise error "polyminus.sml: Vereinfache 139 c)";
|
wneuper@277
|
236 |
|
wneuper@277
|
237 |
"----------- 139 b ---";
|
wneuper@277
|
238 |
states:=[];
|
wneuper@277
|
239 |
CalcTree [(["term (8*u - 5*v - 5*u + 7*v - 6*u - 3*v)",
|
wneuper@277
|
240 |
"normalform N"],
|
wneuper@277
|
241 |
("PolyMinus.thy",["plus_minus","polynom","vereinfachen"],
|
wneuper@277
|
242 |
["simplification","for_polynomials","with_minus"]))];
|
wneuper@277
|
243 |
moveActiveRoot 1;
|
wneuper@277
|
244 |
autoCalculate 1 CompleteCalc;
|
wneuper@277
|
245 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
wneuper@277
|
246 |
if p = ([], Res) andalso
|
wneuper@277
|
247 |
term2str (get_obj g_res pt (fst p)) = "-3 * u - v"
|
wneuper@277
|
248 |
then () else raise error "polyminus.sml: Vereinfache 139 b)";
|
wneuper@277
|
249 |
|
wneuper@277
|
250 |
"----------- 138 a ---";
|
wneuper@277
|
251 |
states:=[];
|
wneuper@277
|
252 |
CalcTree [(["term (2*u - 3*v - 6*u + 5*v)",
|
wneuper@277
|
253 |
"normalform N"],
|
wneuper@277
|
254 |
("PolyMinus.thy",["plus_minus","polynom","vereinfachen"],
|
wneuper@277
|
255 |
["simplification","for_polynomials","with_minus"]))];
|
wneuper@277
|
256 |
moveActiveRoot 1;
|
wneuper@277
|
257 |
autoCalculate 1 CompleteCalc;
|
wneuper@277
|
258 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
wneuper@277
|
259 |
if p = ([], Res) andalso
|
wneuper@277
|
260 |
term2str (get_obj g_res pt (fst p)) = "-4 * u + 2 * v"
|
wneuper@277
|
261 |
then () else raise error "polyminus.sml: Vereinfache 138 a)";
|
wneuper@277
|
262 |
|
wneuper@265
|
263 |
|
wneuper@266
|
264 |
"----------- met probe fuer_polynom ------------------------------";
|
wneuper@266
|
265 |
"----------- met probe fuer_polynom ------------------------------";
|
wneuper@266
|
266 |
"----------- met probe fuer_polynom ------------------------------";
|
wneuper@266
|
267 |
val str =
|
wneuper@266
|
268 |
"Script ProbeScript (e_::bool) (ws_::bool list) =\
|
wneuper@266
|
269 |
\ (let e_ = Take e_; \
|
wneuper@266
|
270 |
\ e_ = Substitute ws_ e_ \
|
wneuper@266
|
271 |
\ in (Repeat((Try (Repeat (Calculate times))) @@ \
|
wneuper@266
|
272 |
\ (Try (Repeat (Calculate plus ))) @@ \
|
wneuper@266
|
273 |
\ (Try (Repeat (Calculate minus))))) e_)"
|
wneuper@266
|
274 |
val sc = ((inst_abs thy) o term_of o the o (parse thy)) str;
|
wneuper@266
|
275 |
atomty sc;
|
wneuper@265
|
276 |
|
wneuper@265
|
277 |
|
wneuper@266
|
278 |
"----------- pbl polynom probe -----------------------------------";
|
wneuper@266
|
279 |
"----------- pbl polynom probe -----------------------------------";
|
wneuper@266
|
280 |
"----------- pbl polynom probe -----------------------------------";
|
wneuper@266
|
281 |
states:=[];
|
wneuper@266
|
282 |
CalcTree [(["Pruefe (5*e + 6*f - 8*g - 9 - 7*e - 4*f + 10*g + 12 =\
|
wneuper@266
|
283 |
\3 - 2 * e + 2 * f + 2 * g)",
|
wneuper@266
|
284 |
"mitWert [e = 1, f = 2, g = 3]",
|
wneuper@266
|
285 |
"Geprueft b"],
|
wneuper@266
|
286 |
("PolyMinus.thy",["polynom","probe"],
|
wneuper@266
|
287 |
["probe","fuer_polynom"]))];
|
wneuper@266
|
288 |
moveActiveRoot 1;
|
wneuper@266
|
289 |
autoCalculate 1 CompleteCalc;
|
wneuper@266
|
290 |
val ((pt,p),_) = get_calc 1;
|
wneuper@267
|
291 |
if p = ([], Res) andalso term2str (get_obj g_res pt (fst p)) = "11 = 11"
|
wneuper@267
|
292 |
then () else raise error "polyminus.sml: Probe 11 = 11";
|
wneuper@266
|
293 |
show_pt pt;
|
wneuper@265
|
294 |
|
wneuper@265
|
295 |
|
wneuper@267
|
296 |
"----------- pbl klammer polynom vereinfachen p.34 ---------------";
|
wneuper@267
|
297 |
"----------- pbl klammer polynom vereinfachen p.34 ---------------";
|
wneuper@267
|
298 |
"----------- pbl klammer polynom vereinfachen p.34 ---------------";
|
wneuper@267
|
299 |
states:=[];
|
wneuper@267
|
300 |
CalcTree [(["term (2*u - 5 - (3 - 4*u) + (8*u + 9))",
|
wneuper@267
|
301 |
"normalform N"],
|
wneuper@267
|
302 |
("PolyMinus.thy",["klammer","polynom","vereinfachen"],
|
wneuper@267
|
303 |
["simplification","for_polynomials","with_parentheses"]))];
|
wneuper@267
|
304 |
moveActiveRoot 1;
|
wneuper@267
|
305 |
autoCalculate 1 CompleteCalc;
|
wneuper@267
|
306 |
val ((pt,p),_) = get_calc 1;
|
wneuper@267
|
307 |
if p = ([], Res) andalso
|
wneuper@268
|
308 |
term2str (get_obj g_res pt (fst p)) = "1 + 14 * u"
|
wneuper@268
|
309 |
then () else raise error "polyminus.sml: Vereinfache (2*u - 5 - (3 - ...";
|
wneuper@267
|
310 |
show_pt pt;
|
wneuper@265
|
311 |
|
wneuper@267
|
312 |
"----- probe p.34 -----";
|
wneuper@267
|
313 |
states:=[];
|
wneuper@267
|
314 |
CalcTree [(["Pruefe (2*u - 5 - (3 - 4*u) + (8*u + 9) = 1 + 14 * u)",
|
wneuper@267
|
315 |
"mitWert [u = 2]",
|
wneuper@267
|
316 |
"Geprueft b"],
|
wneuper@267
|
317 |
("PolyMinus.thy",["polynom","probe"],
|
wneuper@267
|
318 |
["probe","fuer_polynom"]))];
|
wneuper@267
|
319 |
moveActiveRoot 1;
|
wneuper@267
|
320 |
autoCalculate 1 CompleteCalc;
|
wneuper@267
|
321 |
val ((pt,p),_) = get_calc 1;
|
wneuper@267
|
322 |
if p = ([], Res) andalso term2str (get_obj g_res pt (fst p)) = "29 = 29"
|
wneuper@267
|
323 |
then () else raise error "polyminus.sml: Probe 29 = 29";
|
wneuper@267
|
324 |
show_pt pt;
|
wneuper@265
|
325 |
|
wneuper@265
|
326 |
|
wneuper@272
|
327 |
"----------- try fun applyTactics --------------------------------";
|
wneuper@272
|
328 |
"----------- try fun applyTactics --------------------------------";
|
wneuper@272
|
329 |
"----------- try fun applyTactics --------------------------------";
|
wneuper@272
|
330 |
states:=[];
|
wneuper@272
|
331 |
CalcTree [(["term (5*e + 6*f - 8*g - 9 - 7*e - 4*f + 10*g + 12)",
|
wneuper@272
|
332 |
"normalform N"],
|
wneuper@277
|
333 |
("PolyMinus.thy",["plus_minus","polynom","vereinfachen"],
|
wneuper@272
|
334 |
["simplification","for_polynomials","with_minus"]))];
|
wneuper@272
|
335 |
moveActiveRoot 1;
|
wneuper@272
|
336 |
autoCalculate 1 CompleteCalcHead;
|
wneuper@272
|
337 |
autoCalculate 1 (Step 1);
|
wneuper@272
|
338 |
autoCalculate 1 (Step 1);
|
wneuper@273
|
339 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
wneuper@274
|
340 |
"----- 1 ^^^";
|
wneuper@272
|
341 |
fetchApplicableTactics 1 0 p;
|
wneuper@272
|
342 |
val appltacs = sel_appl_atomic_tacs pt p;
|
wneuper@275
|
343 |
applyTactic 1 p (hd appltacs) (*addiere_x_plus_minus*);
|
wneuper@273
|
344 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
wneuper@274
|
345 |
"----- 2 ^^^";
|
wneuper@275
|
346 |
trace_rewrite := true;
|
wneuper@276
|
347 |
val erls = erls_ordne_alphabetisch;
|
wneuper@275
|
348 |
val t = str2term "- 9 + 12 + 5 * e - 7 * e + (6 - 4) * f - 8 * g + 10 * g";
|
wneuper@275
|
349 |
val Some (t',_) =
|
wneuper@276
|
350 |
rewrite_ Isac.thy e_rew_ord erls false tausche_minus t;
|
wneuper@275
|
351 |
term2str t'; "- 9 + 12 + 5 * e - 7 * e + (- 4 + 6) * f - 8 * g + 10 * g";
|
wneuper@276
|
352 |
|
wneuper@276
|
353 |
val t = str2term "- 9 + 12 + 5 * e - 7 * e + (6 - 4) * f - 8 * g + 10 * g";
|
wneuper@276
|
354 |
val None =
|
wneuper@276
|
355 |
rewrite_ Isac.thy e_rew_ord erls false tausche_minus_plus t;
|
wneuper@276
|
356 |
|
wneuper@276
|
357 |
val t = str2term "- 9 + 12 + 5 * e - 7 * e + (6 - 4) * f - 8 * g + 10 * g";
|
wneuper@276
|
358 |
val Some (t',_) =
|
wneuper@276
|
359 |
rewrite_set_ Isac.thy false ordne_alphabetisch t;
|
wneuper@276
|
360 |
term2str t'; "- 9 + 12 + 5 * e - 7 * e - 8 * g + 10 * g + (- 4 + 6) * f";
|
wneuper@275
|
361 |
trace_rewrite := false;
|
wneuper@275
|
362 |
|
wneuper@275
|
363 |
|
wneuper@275
|
364 |
applyTactic 1 p (hd (sel_appl_atomic_tacs pt p)) (*tausche_minus*);
|
wneuper@273
|
365 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
wneuper@274
|
366 |
"----- 3 ^^^";
|
wneuper@275
|
367 |
applyTactic 1 p (hd (sel_appl_atomic_tacs pt p)) (**);
|
wneuper@273
|
368 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
wneuper@274
|
369 |
"----- 4 ^^^";
|
wneuper@275
|
370 |
applyTactic 1 p (hd (sel_appl_atomic_tacs pt p)) (**);
|
wneuper@273
|
371 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
wneuper@274
|
372 |
"----- 5 ^^^";
|
wneuper@275
|
373 |
applyTactic 1 p (hd (sel_appl_atomic_tacs pt p)) (**);
|
wneuper@273
|
374 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
wneuper@274
|
375 |
"----- 6 ^^^";
|
wneuper@273
|
376 |
|
wneuper@274
|
377 |
(*<CALCMESSAGE> failure </CALCMESSAGE>
|
wneuper@275
|
378 |
applyTactic 1 p (hd (sel_appl_atomic_tacs pt p)) (**);
|
wneuper@273
|
379 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
wneuper@274
|
380 |
"----- 7 ^^^";
|
wneuper@274
|
381 |
*)
|
wneuper@273
|
382 |
|
wneuper@274
|
383 |
autoCalculate 1 CompleteCalc;
|
wneuper@274
|
384 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
wneuper@274
|
385 |
(*independent from failure above: met_simp_poly_minus not confluent:
|
wneuper@274
|
386 |
(([9], Res), - (8 * g) + 10 * g + (3 - 2 * e + 2 * f)),
|
wneuper@274
|
387 |
(([], Res), - (8 * g) + 10 * g + (3 - 2 * e + 2 * f))]
|
wneuper@274
|
388 |
~~~~~~~~~~~###~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~*)
|
wneuper@272
|
389 |
|
wneuper@275
|
390 |
states:=[];
|
wneuper@276
|
391 |
CalcTree [(["term (- (8 * g) + 10 * g + h)",
|
wneuper@275
|
392 |
"normalform N"],
|
wneuper@277
|
393 |
("PolyMinus.thy",["plus_minus","polynom","vereinfachen"],
|
wneuper@275
|
394 |
["simplification","for_polynomials","with_minus"]))];
|
wneuper@275
|
395 |
moveActiveRoot 1;
|
wneuper@275
|
396 |
autoCalculate 1 CompleteCalc;
|
wneuper@275
|
397 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
wneuper@276
|
398 |
if p = ([], Res) andalso term2str (get_obj g_res pt (fst p)) = "2 * g + h"
|
wneuper@276
|
399 |
then () else raise error "polyminus.sml: addiere_vor_minus";
|
wneuper@276
|
400 |
|
wneuper@276
|
401 |
|
wneuper@276
|
402 |
states:=[];
|
wneuper@276
|
403 |
CalcTree [(["term (- (8 * g) + 10 * g + f)",
|
wneuper@276
|
404 |
"normalform N"],
|
wneuper@277
|
405 |
("PolyMinus.thy",["plus_minus","polynom","vereinfachen"],
|
wneuper@276
|
406 |
["simplification","for_polynomials","with_minus"]))];
|
wneuper@276
|
407 |
moveActiveRoot 1;
|
wneuper@276
|
408 |
autoCalculate 1 CompleteCalc;
|
wneuper@276
|
409 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
wneuper@276
|
410 |
if p = ([], Res) andalso term2str (get_obj g_res pt (fst p)) = "f + 2 * g"
|
wneuper@276
|
411 |
then () else raise error "polyminus.sml: tausche_vor_plus";
|
wneuper@276
|
412 |
|
wneuper@276
|
413 |
|
wneuper@276
|
414 |
"----------- pbl binom polynom vereinfachen p.39 -----------------";
|
wneuper@276
|
415 |
"----------- pbl binom polynom vereinfachen p.39 -----------------";
|
wneuper@276
|
416 |
"----------- pbl binom polynom vereinfachen p.39 -----------------";
|
wneuper@276
|
417 |
val rls = klammern_ausmultiplizieren;
|
wneuper@276
|
418 |
val t = str2term "(3 * a + 2) * (4 * a - 1)";
|
wneuper@276
|
419 |
val Some (t,_) = rewrite_set_ thy false rls t; term2str t;
|
wneuper@276
|
420 |
"3 * a * (4 * a) - 3 * a * 1 + (2 * (4 * a) - 2 * 1)";
|
wneuper@276
|
421 |
val rls = discard_parentheses;
|
wneuper@276
|
422 |
val Some (t,_) = rewrite_set_ thy false rls t; term2str t;
|
wneuper@276
|
423 |
"3 * a * 4 * a - 3 * a * 1 + (2 * 4 * a - 2 * 1)";
|
wneuper@276
|
424 |
val rls = ordne_monome;
|
wneuper@276
|
425 |
val Some (t,_) = rewrite_set_ thy false rls t; term2str t;
|
wneuper@276
|
426 |
"3 * 4 * a * a - 1 * 3 * a + (2 * 4 * a - 1 * 2)";
|
wneuper@276
|
427 |
(*
|
wneuper@276
|
428 |
val t = str2term "3 * a * 4 * a";
|
wneuper@276
|
429 |
val rls = ordne_monome;
|
wneuper@276
|
430 |
val Some (t,_) = rewrite_set_ thy false rls t; term2str t;
|
wneuper@276
|
431 |
*)
|
wneuper@276
|
432 |
val rls = klammern_aufloesen;
|
wneuper@276
|
433 |
val Some (t,_) = rewrite_set_ thy false rls t; term2str t;
|
wneuper@276
|
434 |
"3 * 4 * a * a - 1 * 3 * a + 2 * 4 * a - 1 * 2";
|
wneuper@276
|
435 |
val rls = ordne_alphabetisch;
|
wneuper@276
|
436 |
(*TODO: make is_monom more general, a*a=a^2, ...*)
|
wneuper@276
|
437 |
val Some (t,_) = rewrite_set_ thy false rls t; term2str t;
|
wneuper@276
|
438 |
"3 * 4 * a * a - 1 * 2 - 1 * 3 * a + 2 * 4 * a";
|
wneuper@276
|
439 |
(*GOON.WN080104
|
wneuper@276
|
440 |
val rls = fasse_zusammen;
|
wneuper@276
|
441 |
val Some (t,_) = rewrite_set_ thy false rls t; term2str t;
|
wneuper@276
|
442 |
val rls = verschoenere;
|
wneuper@276
|
443 |
val Some (t,_) = rewrite_set_ thy false rls t; term2str t;
|
wneuper@276
|
444 |
*)
|
wneuper@276
|
445 |
|
wneuper@276
|
446 |
|
wneuper@276
|
447 |
trace_rewrite := true;
|
wneuper@276
|
448 |
trace_rewrite := false;
|
wneuper@276
|
449 |
|
wneuper@276
|
450 |
|
wneuper@276
|
451 |
states:=[];
|
wneuper@276
|
452 |
CalcTree [(["term ((3*a + 2) * (4*a - 1))",
|
wneuper@276
|
453 |
"normalform N"],
|
wneuper@277
|
454 |
("PolyMinus.thy",["binom_klammer","polynom","vereinfachen"],
|
wneuper@276
|
455 |
["simplification","for_polynomials","with_parentheses_mult"]))];
|
wneuper@276
|
456 |
moveActiveRoot 1;
|
wneuper@276
|
457 |
autoCalculate 1 CompleteCalc;
|
wneuper@276
|
458 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
wneuper@276
|
459 |
|
wneuper@276
|
460 |
(*
|
wneuper@276
|
461 |
if p = ([], Res) andalso
|
wneuper@276
|
462 |
term2str (get_obj g_res pt (fst p)) = "1 + 14 * u"
|
wneuper@276
|
463 |
then () else raise error "polyminus.sml: Vereinfache (2*u - 5 - (3 - ...";
|
wneuper@276
|
464 |
*)
|
wneuper@276
|
465 |
|
wneuper@276
|
466 |
|
wneuper@276
|
467 |
|
wneuper@276
|
468 |
|
wneuper@276
|
469 |
|
wneuper@276
|
470 |
|
wneuper@276
|
471 |
|
wneuper@276
|
472 |
|
wneuper@276
|
473 |
|
wneuper@276
|
474 |
|
wneuper@276
|
475 |
|
wneuper@276
|
476 |
|
wneuper@276
|
477 |
|
wneuper@276
|
478 |
|
wneuper@276
|
479 |
|
wneuper@276
|
480 |
|
wneuper@276
|
481 |
|
wneuper@276
|
482 |
|
wneuper@276
|
483 |
|
wneuper@276
|
484 |
(*
|
wneuper@276
|
485 |
use"../smltest/IsacKnowledge/polyminus.sml";
|
wneuper@276
|
486 |
use"polyminus.sml";
|
wneuper@276
|
487 |
*)
|