1 (* Title: Knowledge/polyeq-1.sml
2 testexamples for PolyEq, poynomial equations and equational systems
3 Author: Richard Lang 2003
4 (c) due to copyright terms
5 WN030609: some expls dont work due to unfinished handling of 'expanded terms';
6 others marked with TODO have to be checked, too.
9 "-----------------------------------------------------------------";
10 "table of contents -----------------------------------------------";
11 "-----------------------------------------------------------------";
12 "------ polyeq-1.sml ---------------------------------------------";
13 "----------- tests on predicates in problems ---------------------";
14 "----------- test matching problems ------------------------------";
15 "----------- prep. for introduction of Matthias Goldgruber 2003 trials on rewrite orders -----";
16 "----------- Matthias Goldgruber 2003 trials on rewrite orders -------------------------------";
17 "----------- lin.eq degree_0 -------------------------------------";
18 "----------- test thm's d2_pq_formulsxx[_neg]---------------------";
19 "----------- equality (2 +(-1)*x + x^^^2 = (0::real)) ----------------------------------------";
20 "----------- equality (-2 +(-1)*x + 1*x^^^2 = 0) ---------------------------------------------";
21 "----------- equality (-2 + x + x^^^2 = 0) ---------------------------------------------------";
22 "----------- equality (2 + x + x^^^2 = 0) ----------------------------------------------------";
23 "----------- equality (-2 + x + 1*x^^^2 = 0)) ------------------------------------------------";
24 "----------- equality (1*x + x^^^2 = 0) ----------------------------------------------------";
25 "----------- equality (1*x + 1*x^^^2 = 0) ----------------------------------------------------";
26 "----------- equality (x + x^^^2 = 0) ------------------------------------------------------";
27 "----------- equality (x + 1*x^^^2 = 0) ------------------------------------------------------";
28 "----------- equality (-4 + x^^^2 = 0) -------------------------------------------------------";
29 "----------- equality (4 + 1*x^^^2 = 0) -------------------------------------------------------";
30 "----------- equality (1 +(-1)*x + 2*x^^^2 = 0) ----------------------------------------------";
31 "----------- equality (-1 + x + 2*x^^^2 = 0) -------------------------------------------------";
32 "----------- equality (1 + x + 2*x^^^2 = 0) --------------------------------------------------";
33 "----------- (-8 - 2*x + x^^^2 = 0), (*Schalk 2, S.67 Nr.31.b----";
34 "----------- (-8 - 2*x + x^^^2 = 0), by rewriting ---------------";
35 "----------- (-16 + 4*x + 2*x^^^2 = 0), --------------------------";
36 "-----------------------------------------------------------------";
37 "------ polyeq-2.sml ---------------------------------------------";
38 "----------- (a*b - (a+b)*x + x^^^2 = 0), (*Schalk 2,S.68Nr.44.a*)";
39 "----------- (-64 + x^^^2 = 0), (*Schalk 2, S.66 Nr.1.a~--------*)";
40 "----------- (-147 + 3*x^^^2 = 0), (*Schalk 2, S.66 Nr.1.b------*)";
41 "----------- (3*x - 1 - (5*x - (2 - 4*x)) = -11),(*Schalk Is86Bsp5";
42 "----------- ((x+1)*(x+2) - (3*x - 2)^^^2=.. Schalk II s.68 Bsp 37";
43 "----------- rls make_polynomial_in ------------------------------";
44 "----------- interSteps ([1],Res); on Schalk Is86Bsp5-------------";
45 "----------- rls d2_polyeq_bdv_only_simplify ---------------------";
46 "-----------------------------------------------------------------";
47 "-----------------------------------------------------------------";
49 "----------- tests on predicates in problems ---------------------";
50 "----------- tests on predicates in problems ---------------------";
51 "----------- tests on predicates in problems ---------------------";
52 (* Rewrite.trace_on:=true;
53 Rewrite.trace_on:=false;
55 val t1 = (Thm.term_of o the o (TermC.parse thy)) "lhs (-8 - 2*x + x^^^2 = 0)";
56 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t1;
57 if ((UnparseC.term t) = "-8 - 2 * x + x ^^^ 2") then ()
58 else error "polyeq.sml: diff.behav. in lhs";
60 val t2 = (Thm.term_of o the o (TermC.parse thy)) "(-8 - 2*x + x^^^2) is_expanded_in x";
61 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t2;
62 if (UnparseC.term t) = "True" then ()
63 else error "polyeq.sml: diff.behav. 1 in is_expended_in";
65 val t0 = (Thm.term_of o the o (TermC.parse thy)) "(sqrt(x)) is_poly_in x";
66 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t0;
67 if (UnparseC.term t) = "False" then ()
68 else error "polyeq.sml: diff.behav. 2 in is_poly_in";
70 val t3 = (Thm.term_of o the o (TermC.parse thy)) "(-8 + (-1)*2*x + x^^^2) is_poly_in x";
71 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t3;
72 if (UnparseC.term t) = "True" then ()
73 else error "polyeq.sml: diff.behav. 3 in is_poly_in";
75 val t4 = (Thm.term_of o the o (TermC.parse thy)) "(lhs (-8 + (-1)*2*x + x^^^2 = 0)) is_expanded_in x";
76 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t4;
77 if (UnparseC.term t) = "True" then ()
78 else error "polyeq.sml: diff.behav. 4 in is_expended_in";
81 val t6 = (Thm.term_of o the o (TermC.parse thy)) "(lhs (-8 - 2*x + x^^^2 = 0)) is_expanded_in x";
82 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t6;
83 if (UnparseC.term t) = "True" then ()
84 else error "polyeq.sml: diff.behav. 5 in is_expended_in";
86 val t3 = (Thm.term_of o the o (TermC.parse thy))"((-8 - 2*x + x^^^2) has_degree_in x) = 2";
87 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t3;
88 if (UnparseC.term t) = "True" then ()
89 else error "polyeq.sml: diff.behav. in has_degree_in_in";
91 val t3 = (Thm.term_of o the o (TermC.parse thy)) "((sqrt(x)) has_degree_in x) = 2";
92 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t3;
93 if (UnparseC.term t) = "False" then ()
94 else error "polyeq.sml: diff.behav. 6 in has_degree_in_in";
96 val t4 = (Thm.term_of o the o (TermC.parse thy))
97 "((-8 - 2*x + x^^^2) has_degree_in x) = 1";
98 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t4;
99 if (UnparseC.term t) = "False" then ()
100 else error "polyeq.sml: diff.behav. 7 in has_degree_in_in";
102 val t5 = (Thm.term_of o the o (TermC.parse thy))
103 "((-8 - 2*x + x^^^2) has_degree_in x) = 2";
104 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t5;
105 if (UnparseC.term t) = "True" then ()
106 else error "polyeq.sml: diff.behav. 8 in has_degree_in_in";
108 "----------- test matching problems --------------------------0---";
109 "----------- test matching problems --------------------------0---";
110 "----------- test matching problems --------------------------0---";
111 val fmz = ["equality (-8 - 2*x + x^^^2 = 0)", "solveFor x", "solutions L"];
112 if M_Match.match_pbl fmz (Problem.from_store ["expanded", "univariate", "equation"]) =
113 M_Match.Matches' {Find = [Correct "solutions L"],
115 Given = [Correct "equality (-8 - 2 * x + x ^^^ 2 = 0)", Correct "solveFor x"],
116 Where = [Correct "TermC.matches (?a = 0) (-8 - 2 * x + x ^^^ 2 = 0)",
117 Correct "lhs (-8 - 2 * x + x ^^^ 2 = 0) is_expanded_in x"],
119 then () else error "M_Match.match_pbl [expanded,univariate,equation]";
121 if M_Match.match_pbl fmz (Problem.from_store ["degree_2", "expanded", "univariate", "equation"]) =
122 M_Match.Matches' {Find = [Correct "solutions L"],
124 Given = [Correct "equality (-8 - 2 * x + x ^^^ 2 = 0)", Correct "solveFor x"],
125 Where = [Correct "lhs (-8 - 2 * x + x ^^^ 2 = 0) has_degree_in x = 2"],
126 Relate = []} (*before WN110906 was: has_degree_in x =!= 2"]*)
127 then () else error "M_Match.match_pbl [degree_2,expanded,univariate,equation]";
130 "----------- prep. for introduction of Matthias Goldgruber 2003 trials on rewrite orders -----";
131 "----------- prep. for introduction of Matthias Goldgruber 2003 trials on rewrite orders -----";
132 "----------- prep. for introduction of Matthias Goldgruber 2003 trials on rewrite orders -----";
133 (*##################################################################################
134 -----------28.2.03: war nicht upgedatet und ausgeklammert in ROOT.ML-->Test_Isac.thy
136 (*Aufgabe zum Einstieg in die Arbeit...*)
137 val t = (Thm.term_of o the o (TermC.parse thy)) "a*b - (a+b)*x + x^^^2 = 0";
138 (*ein 'ruleset' aus Poly.ML wird angewandt...*)
139 val SOME (t,_) = rewrite_set_ thy Poly_erls false make_polynomial t;
141 "a * b + (-1 * (a * x) + (-1 * (b * x) + x ^^^ 2)) = 0";
143 rewrite_set_inst_ thy Poly_erls false [("bdv", "a")] make_polynomial_in t;
145 "x ^^^ 2 + (-1 * (b * x) + (-1 * (x * a) + b * a)) = 0";
146 (* bei Verwendung von "size_of-term" nach MG :*)
147 (*"x ^^^ 2 + (-1 * (b * x) + (b * a + -1 * (x * a))) = 0" !!! *)
149 (*wir holen 'a' wieder aus der Klammerung heraus...*)
150 val SOME (t,_) = rewrite_set_ thy Poly_erls false discard_parentheses t;
152 "x ^^^ 2 + -1 * b * x + -1 * x * a + b * a = 0";
153 (* "x ^^^ 2 + -1 * b * x + b * a + -1 * x * a = 0" !!! *)
156 rewrite_set_inst_ thy Poly_erls false [("bdv", "a")] make_polynomial_in t;
158 "x ^^^ 2 + (-1 * (b * x) + a * (b + -1 * x)) = 0";
159 (*da sind wir fast am Ziel: make_polynomial_in 'a' sollte ergeben
160 "x ^^^ 2 + (-1 * (b * x)) + (b + -1 * x) * a = 0"*)
162 (*das rewriting l"asst sich beobachten mit
163 Rewrite.trace_on := false;
166 "------15.11.02 --------------------------";
167 val t = (Thm.term_of o the o (TermC.parse thy)) "1 + a * x + b * x";
168 val bdv = (Thm.term_of o the o (TermC.parse thy)) "bdv";
169 val a = (Thm.term_of o the o (TermC.parse thy)) "a";
171 Rewrite.trace_on := false;
172 (* Anwenden einer Regelmenge aus Termorder.ML: *)
174 rewrite_set_inst_ thy false [(bdv,a)] make_polynomial_in t;
177 rewrite_set_ thy false discard_parentheses t;
181 val t = (Thm.term_of o the o (TermC.parse thy)) "1 + a * (x + b * x) + a^^^2";
183 rewrite_set_inst_ thy false [(bdv,a)] make_polynomial_in t;
186 rewrite_set_ thy false discard_parentheses t;
188 "1 + (x + b * x) * a + a ^^^ 2";
190 val t = (Thm.term_of o the o (TermC.parse thy)) "1 + a ^^^2 * x + b * a + 7*a^^^2";
192 rewrite_set_inst_ thy false [(bdv,a)] make_polynomial_in t;
195 rewrite_set_ thy false discard_parentheses t;
197 "1 + b * a + (7 + x) * a ^^^ 2";
200 Prog_Expr.thy grundlegende Algebra
204 RootRat.thy Wurzen + Br"uche
205 Termorder.thy BITTE NUR HIERHER SCHREIBEN (...WN03)
207 get_thm Termorder.thy "bdv_n_collect";
208 get_thm (theory "Isac_Knowledge") "bdv_n_collect";
210 val t = (Thm.term_of o the o (TermC.parse thy)) "a ^^^2 * x + 7 * a^^^2";
212 rewrite_set_inst_ thy false [(bdv,a)] make_polynomial_in t;
215 rewrite_set_ thy false discard_parentheses t;
219 val t = (Thm.term_of o the o (TermC.parse Termorder.thy)) "Pi";
221 val t = (Thm.term_of o the o (parseold thy)) "7";
222 ##################################################################################*)
225 "----------- Matthias Goldgruber 2003 trials on rewrite orders -------------------------------";
226 "----------- Matthias Goldgruber 2003 trials on rewrite orders -------------------------------";
227 "----------- Matthias Goldgruber 2003 trials on rewrite orders -------------------------------";
228 val substa = [(TermC.empty, (Thm.term_of o the o (TermC.parse thy)) "a")];
229 val substb = [(TermC.empty, (Thm.term_of o the o (TermC.parse thy)) "b")];
230 val substx = [(TermC.empty, (Thm.term_of o the o (TermC.parse thy)) "x")];
232 val x1 = (Thm.term_of o the o (TermC.parse thy)) "a + b + x";
233 val x2 = (Thm.term_of o the o (TermC.parse thy)) "a + x + b";
234 val x3 = (Thm.term_of o the o (TermC.parse thy)) "a + x + b";
235 val x4 = (Thm.term_of o the o (TermC.parse thy)) "x + a + b";
237 if ord_make_polynomial_in true thy substx (x1,x2) = true(*LESS *) then ()
238 else error "termorder.sml diff.behav ord_make_polynomial_in #1";
240 if ord_make_polynomial_in true thy substa (x1,x2) = true(*LESS *) then ()
241 else error "termorder.sml diff.behav ord_make_polynomial_in #2";
243 if ord_make_polynomial_in true thy substb (x1,x2) = false(*GREATER*) then ()
244 else error "termorder.sml diff.behav ord_make_polynomial_in #3";
246 val aa = (Thm.term_of o the o (TermC.parse thy)) "-1 * a * x";
247 val bb = (Thm.term_of o the o (TermC.parse thy)) "x^^^3";
248 ord_make_polynomial_in true thy substx (aa, bb);
251 val aa = (Thm.term_of o the o (TermC.parse thy)) "-1 * a * x";
252 val bb = (Thm.term_of o the o (TermC.parse thy)) "x^^^3";
253 ord_make_polynomial_in true thy substa (aa, bb);
254 false; (* => GREATER *)
256 (* und nach dem Re-engineering der Termorders in den 'rulesets'
257 kannst Du die 'gr"osste' Variable frei w"ahlen: *)
258 val bdv= (Thm.term_of o the o (TermC.parse thy)) "''bdv''";
259 val x = (Thm.term_of o the o (TermC.parse thy)) "x";
260 val a = (Thm.term_of o the o (TermC.parse thy)) "a";
261 val b = (Thm.term_of o the o (TermC.parse thy)) "b";
262 val SOME (t',_) = rewrite_set_inst_ thy false [(bdv,a)] make_polynomial_in x2;
263 if UnparseC.term t' = "b + x + a" then ()
264 else error "termorder.sml diff.behav ord_make_polynomial_in #11";
266 val NONE = rewrite_set_inst_ thy false [(bdv,b)] make_polynomial_in x2;
268 val SOME (t',_) = rewrite_set_inst_ thy false [(bdv,x)] make_polynomial_in x2;
269 if UnparseC.term t' = "a + b + x" then ()
270 else error "termorder.sml diff.behav ord_make_polynomial_in #13";
272 val ppp' = "-6 + -5*x + x^^^3 + -1*x^^^2 + -1*x^^^3 + -14*x^^^2";
273 val ppp = (Thm.term_of o the o (TermC.parse thy)) ppp';
274 val SOME (t',_) = rewrite_set_inst_ thy false [(bdv,x)] make_polynomial_in ppp;
275 if UnparseC.term t' = "-6 + -5 * x + -15 * x ^^^ 2 + 0" then ()
276 else error "termorder.sml diff.behav ord_make_polynomial_in #14";
278 val SOME (t', _) = rewrite_set_inst_ thy false [(bdv,x)] make_polynomial_in ppp;
279 if UnparseC.term t' = "-6 + -5 * x + -15 * x ^^^ 2 + 0" then ()
280 else error "termorder.sml diff.behav ord_make_polynomial_in #15";
282 val ttt' = "(3*x + 5)/18";
283 val ttt = (Thm.term_of o the o (TermC.parse thy)) ttt';
284 val SOME (uuu,_) = rewrite_set_inst_ thy false [(bdv,x)] make_polynomial_in ttt;
285 if UnparseC.term uuu = "(5 + 3 * x) / 18" then ()
286 else error "termorder.sml diff.behav ord_make_polynomial_in #16a";
288 (*============ inhibit exn WN120316 ==============================================
289 val SOME (uuu,_) = rewrite_set_ thy false make_polynomial ttt;
290 if UnparseC.term uuu = "(5 + 3 * x) / 18" then ()
291 else error "termorder.sml diff.behav ord_make_polynomial_in #16b";
292 ============ inhibit exn WN120316 ==============================================*)
295 "----------- lin.eq degree_0 -------------------------------------";
296 "----------- lin.eq degree_0 -------------------------------------";
297 "----------- lin.eq degree_0 -------------------------------------";
298 "----- d0_false ------";
299 val fmz = ["equality (1 = (0::real))", "solveFor x", "solutions L"];
300 val (dI',pI',mI') = ("PolyEq",["degree_0", "polynomial", "univariate", "equation"],
301 ["PolyEq", "solve_d0_polyeq_equation"]);
302 (*=== inhibit exn WN110914: declare_constraints doesnt work with ThmC.numerals_to_Free ========
303 TODO: change to "equality (x + -1*x = (0::real))"
304 and search for an appropriate problem and method.
306 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
307 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
308 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
309 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
310 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
311 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
312 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
313 case f of Form' (Test_Out.FormKF (~1,EdUndef,0,Nundef,"[]")) => ()
314 | _ => error "polyeq.sml: diff.behav. in 1 = 0 -> []";
316 "----- d0_true ------";
317 val fmz = ["equality (0 = (0::real))", "solveFor x", "solutions L"];
318 val (dI',pI',mI') = ("PolyEq",["degree_0", "polynomial", "univariate", "equation"],
319 ["PolyEq", "solve_d0_polyeq_equation"]);
320 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
321 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
322 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
323 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
324 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
325 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
326 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
327 case f of Form' (Test_Out.FormKF (~1,EdUndef,0,Nundef,"UniversalList")) => ()
328 | _ => error "polyeq.sml: diff.behav. in 0 = 0 -> UniversalList";
329 ============ inhibit exn WN110914 ============================================*)
331 "----------- test thm's d2_pq_formulsxx[_neg]---------------------";
332 "----------- test thm's d2_pq_formulsxx[_neg]---------------------";
333 "----------- test thm's d2_pq_formulsxx[_neg]---------------------";
334 "----- d2_pqformula1 ------!!!!";
335 val fmz = ["equality (-1/8 + (-1/4)*z + z^^^2 = (0::real))", "solveFor z", "solutions L"];
337 ("Isac_Knowledge", ["pqFormula", "degree_2", "polynomial", "univariate", "equation"], ["no_met"]);
338 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
339 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
340 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
341 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
342 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
343 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
344 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
345 val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*Apply_Method ["PolyEq", "solve_d2_polyeq_pq_equation"]*)
346 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
347 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
348 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
349 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
351 (*[z = 1 / 8 + sqrt (9 / 16) / 2, z = 1 / 8 + -1 * sqrt (9 / 16) / 2] TODO sqrt*)
352 val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt =..,Check_elementwise "Assumptions")*)
353 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
354 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
356 if p = ([], Res) andalso
357 f2str f = "[z = 1 / 8 + sqrt (9 / 16) / 2, z = 1 / 8 + -1 * sqrt (9 / 16) / 2]" then
358 case nxt of End_Proof' => () | _ => error "(-1/8 + (-1/4)*z + z^^^2 = (0::real)) CHANGED 1"
359 else error "(-1/8 + (-1/4)*z + z^^^2 = (0::real)) CHANGED 2";
361 "----------- equality (2 +(-1)*x + x^^^2 = (0::real)) ----------------------------------------";
362 "----------- equality (2 +(-1)*x + x^^^2 = (0::real)) ----------------------------------------";
363 "----------- equality (2 +(-1)*x + x^^^2 = (0::real)) ----------------------------------------";
364 "----- d2_pqformula1_neg ------";
365 val fmz = ["equality (2 +(-1)*x + x^^^2 = (0::real))", "solveFor x", "solutions L"];
366 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"], ["PolyEq", "solve_d2_polyeq_pq_equation"]);
367 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
368 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
369 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
370 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
371 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
372 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
374 ([1],Res) False Or_to_List)*)
375 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
377 ([2],Res) [] Check_elementwise "Assumptions"*)
378 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
379 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
380 val asm = Ctree.get_assumptions pt p;
381 if f2str f = "[]" andalso
382 UnparseC.terms asm = "[\"lhs (2 + -1 * x + x ^^^ 2 = 0) is_poly_in x\", " ^
383 "\"lhs (2 + -1 * x + x ^^^ 2 = 0) has_degree_in x = 2\"]" then ()
384 else error "polyeq.sml: diff.behav. in 2 +(-1)*x + x^^^2 = 0";
386 "----------- equality (-2 +(-1)*x + 1*x^^^2 = 0) ---------------------------------------------";
387 "----------- equality (-2 +(-1)*x + 1*x^^^2 = 0) ---------------------------------------------";
388 "----------- equality (-2 +(-1)*x + 1*x^^^2 = 0) ---------------------------------------------";
389 "----- d2_pqformula2 ------";
390 val fmz = ["equality (-2 +(-1)*x + 1*x^^^2 = 0)", "solveFor x", "solutions L"];
391 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
392 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
393 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
394 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
395 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
396 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
397 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
398 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
400 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
401 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
402 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
403 case f of Test_Out.FormKF "[x = 2, x = -1]" => ()
404 | _ => error "polyeq.sml: diff.behav. in -2 + (-1)*x + x^2 = 0 -> [x = 2, x = -1]";
407 "----------- equality (-2 + x + x^^^2 = 0) ---------------------------------------------------";
408 "----------- equality (-2 + x + x^^^2 = 0) ---------------------------------------------------";
409 "----------- equality (-2 + x + x^^^2 = 0) ---------------------------------------------------";
410 "----- d2_pqformula3 ------";
412 val fmz = ["equality (-2 + x + x^^^2 = 0)", "solveFor x", "solutions L"];
413 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
414 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
415 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
416 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
417 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
418 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
419 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
420 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
422 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
423 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
424 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
425 case f of Test_Out.FormKF "[x = 1, x = -2]" => ()
426 | _ => error "polyeq.sml: diff.behav. in -2 + x + x^2 = 0-> [x = 1, x = -2]";
429 "----------- equality (2 + x + x^^^2 = 0) ----------------------------------------------------";
430 "----------- equality (2 + x + x^^^2 = 0) ----------------------------------------------------";
431 "----------- equality (2 + x + x^^^2 = 0) ----------------------------------------------------";
432 "----- d2_pqformula3_neg ------";
433 val fmz = ["equality (2 + x + x^^^2 = 0)", "solveFor x", "solutions L"];
434 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
435 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
436 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
437 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
438 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
439 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
440 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
441 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
443 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
444 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
445 "TODO 2 + x + x^^^2 = 0";
446 "TODO 2 + x + x^^^2 = 0";
447 "TODO 2 + x + x^^^2 = 0";
449 "----------- equality (-2 + x + 1*x^^^2 = 0)) ------------------------------------------------";
450 "----------- equality (-2 + x + 1*x^^^2 = 0)) ------------------------------------------------";
451 "----------- equality (-2 + x + 1*x^^^2 = 0)) ------------------------------------------------";
452 "----- d2_pqformula4 ------";
453 val fmz = ["equality (-2 + x + 1*x^^^2 = 0)", "solveFor x", "solutions L"];
454 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
455 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
456 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
457 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
458 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
459 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
460 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
461 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
462 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
463 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
464 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
465 case f of Test_Out.FormKF "[x = 1, x = -2]" => ()
466 | _ => error "polyeq.sml: diff.behav. in -2 + x + 1*x^^^2 = 0 -> [x = 1, x = -2]";
468 "----------- equality (1*x + x^^^2 = 0) ----------------------------------------------------";
469 "----------- equality (1*x + x^^^2 = 0) ----------------------------------------------------";
470 "----------- equality (1*x + x^^^2 = 0) ----------------------------------------------------";
471 "----- d2_pqformula5 ------";
472 val fmz = ["equality (1*x + x^^^2 = 0)", "solveFor x", "solutions L"];
473 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
474 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
475 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
476 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
477 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
478 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
479 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
480 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
481 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
482 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
483 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
484 case f of Test_Out.FormKF "[x = 0, x = -1]" => ()
485 | _ => error "polyeq.sml: diff.behav. in 1*x + x^2 = 0 -> [x = 0, x = -1]";
487 "----------- equality (1*x + 1*x^^^2 = 0) ----------------------------------------------------";
488 "----------- equality (1*x + 1*x^^^2 = 0) ----------------------------------------------------";
489 "----------- equality (1*x + 1*x^^^2 = 0) ----------------------------------------------------";
490 "----- d2_pqformula6 ------";
491 val fmz = ["equality (1*x + 1*x^^^2 = 0)", "solveFor x", "solutions L"];
492 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
493 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
494 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
495 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
496 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
497 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
498 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
499 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
500 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
501 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
502 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
503 case f of Test_Out.FormKF "[x = 0, x = -1]" => ()
504 | _ => error "polyeq.sml: diff.behav. in 1*x + 1*x^2 = 0 -> [x = 0, x = -1]";
506 "----------- equality (x + x^^^2 = 0) ------------------------------------------------------";
507 "----------- equality (x + x^^^2 = 0) ------------------------------------------------------";
508 "----------- equality (x + x^^^2 = 0) ------------------------------------------------------";
509 "----- d2_pqformula7 ------";
511 val fmz = ["equality ( x + x^^^2 = 0)", "solveFor x", "solutions L"];
512 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
513 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
514 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
515 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
516 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
517 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
518 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
519 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
520 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
521 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
522 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
523 case f of Test_Out.FormKF "[x = 0, x = -1]" => ()
524 | _ => error "polyeq.sml: diff.behav. in x + x^2 = 0 -> [x = 0, x = -1]";
526 "----------- equality (x + 1*x^^^2 = 0) ------------------------------------------------------";
527 "----------- equality (x + 1*x^^^2 = 0) ------------------------------------------------------";
528 "----------- equality (x + 1*x^^^2 = 0) ------------------------------------------------------";
529 "----- d2_pqformula8 ------";
530 val fmz = ["equality (x + 1*x^^^2 = 0)", "solveFor x", "solutions L"];
531 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
532 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
533 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
534 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
535 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
536 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
537 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
538 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
539 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
540 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
541 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
542 case f of Test_Out.FormKF "[x = 0, x = -1]" => ()
543 | _ => error "polyeq.sml: diff.behav. in x + 1*x^2 = 0 -> [x = 0, x = -1]";
545 "----------- equality (-4 + x^^^2 = 0) -------------------------------------------------------";
546 "----------- equality (-4 + x^^^2 = 0) -------------------------------------------------------";
547 "----------- equality (-4 + x^^^2 = 0) -------------------------------------------------------";
548 "----- d2_pqformula9 ------";
549 val fmz = ["equality (-4 + x^^^2 = 0)", "solveFor x", "solutions L"];
550 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
551 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
552 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
553 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
554 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
555 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
556 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
557 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
558 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
559 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
560 case f of Test_Out.FormKF "[x = 2, x = -2]" => ()
561 | _ => error "polyeq.sml: diff.behav. in -4 + x^2 = 0 -> [x = 2, x = -2]";
564 "----------- equality (4 + 1*x^^^2 = 0) -------------------------------------------------------";
565 "----------- equality (4 + 1*x^^^2 = 0) -------------------------------------------------------";
566 "----------- equality (4 + 1*x^^^2 = 0) -------------------------------------------------------";
567 "----- d2_pqformula9_neg ------";
568 val fmz = ["equality (4 + 1*x^^^2 = 0)", "solveFor x", "solutions L"];
569 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
570 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
571 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
572 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
573 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
574 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
575 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
576 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
577 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
578 "TODO 4 + 1*x^^^2 = 0";
579 "TODO 4 + 1*x^^^2 = 0";
580 "TODO 4 + 1*x^^^2 = 0";
582 "-------------------- test thm's d2_abc_formulsxx[_neg]-----";
583 "-------------------- test thm's d2_abc_formulsxx[_neg]-----";
584 "-------------------- test thm's d2_abc_formulsxx[_neg]-----";
585 val fmz = ["equality (-1 +(-1)*x + 2*x^^^2 = 0)", "solveFor x", "solutions L"];
586 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
587 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
588 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
589 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
590 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
591 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
592 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
593 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
594 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
595 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
596 case f of Test_Out.FormKF "[x = 1, x = -1 / 2]" => ()
597 | _ => error "polyeq.sml: diff.behav. in -1 + (-1)*x + 2*x^2 = 0 -> [x = 1, x = -1/2]";
599 "----------- equality (1 +(-1)*x + 2*x^^^2 = 0) ----------------------------------------------";
600 "----------- equality (1 +(-1)*x + 2*x^^^2 = 0) ----------------------------------------------";
601 "----------- equality (1 +(-1)*x + 2*x^^^2 = 0) ----------------------------------------------";
602 val fmz = ["equality (1 +(-1)*x + 2*x^^^2 = 0)", "solveFor x", "solutions L"];
603 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
604 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
605 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
606 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
607 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
608 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
610 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
611 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
612 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
613 "TODO 1 +(-1)*x + 2*x^^^2 = 0";
614 "TODO 1 +(-1)*x + 2*x^^^2 = 0";
615 "TODO 1 +(-1)*x + 2*x^^^2 = 0";
618 "----------- equality (-1 + x + 2*x^^^2 = 0) -------------------------------------------------";
619 "----------- equality (-1 + x + 2*x^^^2 = 0) -------------------------------------------------";
620 "----------- equality (-1 + x + 2*x^^^2 = 0) -------------------------------------------------";
622 val fmz = ["equality (-1 + x + 2*x^^^2 = 0)", "solveFor x", "solutions L"];
623 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
624 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
625 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
626 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
627 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
629 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
630 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
631 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
632 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
634 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
635 case f of Test_Out.FormKF "[x = 1 / 2, x = -1]" => ()
636 | _ => error "polyeq.sml: diff.behav. in -1 + x + 2*x^2 = 0 -> [x = 1/2, x = -1]";
639 "----------- equality (1 + x + 2*x^^^2 = 0) --------------------------------------------------";
640 "----------- equality (1 + x + 2*x^^^2 = 0) --------------------------------------------------";
641 "----------- equality (1 + x + 2*x^^^2 = 0) --------------------------------------------------";
642 val fmz = ["equality (1 + x + 2*x^^^2 = 0)", "solveFor x", "solutions L"];
643 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
644 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
645 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
646 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
647 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
649 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
650 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
651 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
652 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
653 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
654 "TODO 1 + x + 2*x^^^2 = 0";
655 "TODO 1 + x + 2*x^^^2 = 0";
656 "TODO 1 + x + 2*x^^^2 = 0";
659 val fmz = ["equality (-2 + 1*x + x^^^2 = 0)", "solveFor x", "solutions L"];
660 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
661 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
662 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
663 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
664 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
665 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
666 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
667 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
668 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
669 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
670 case f of Test_Out.FormKF "[x = 1, x = -2]" => ()
671 | _ => error "polyeq.sml: diff.behav. in -2 + 1*x + x^2 = 0 -> [x = 1, x = -2]";
673 val fmz = ["equality ( 2 + 1*x + x^^^2 = 0)", "solveFor x", "solutions L"];
674 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
675 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
676 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
677 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
678 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
679 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
680 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
681 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
682 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
683 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
684 "TODO 2 + 1*x + x^^^2 = 0";
685 "TODO 2 + 1*x + x^^^2 = 0";
686 "TODO 2 + 1*x + x^^^2 = 0";
689 val fmz = ["equality (-2 + x + x^^^2 = 0)", "solveFor x", "solutions L"];
690 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
691 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
692 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
693 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
694 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
695 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
696 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
697 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
698 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
699 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
700 case f of Test_Out.FormKF "[x = 1, x = -2]" => ()
701 | _ => error "polyeq.sml: diff.behav. in -2 + x + x^2 = 0 -> [x = 1, x = -2]";
703 val fmz = ["equality ( 2 + x + x^^^2 = 0)", "solveFor x", "solutions L"];
704 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
705 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
706 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
707 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
708 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
709 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
710 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
711 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
712 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
713 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
714 "TODO 2 + x + x^^^2 = 0";
715 "TODO 2 + x + x^^^2 = 0";
716 "TODO 2 + x + x^^^2 = 0";
719 val fmz = ["equality (-8 + 2*x^^^2 = 0)", "solveFor x", "solutions L"];
720 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
721 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
722 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
723 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
724 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
725 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
726 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
727 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
728 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
729 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
730 case f of Test_Out.FormKF "[x = 2, x = -2]" => ()
731 | _ => error "polyeq.sml: diff.behav. in -8 + 2*x^2 = 0 -> [x = 2, x = -2]";
733 val fmz = ["equality ( 8+ 2*x^^^2 = 0)", "solveFor x", "solutions L"];
734 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
735 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
736 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
737 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
738 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
739 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
740 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
741 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
742 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
743 "TODO 8+ 2*x^^^2 = 0";
744 "TODO 8+ 2*x^^^2 = 0";
745 "TODO 8+ 2*x^^^2 = 0";
748 val fmz = ["equality (-4 + x^^^2 = 0)", "solveFor x", "solutions L"];
749 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"], ["PolyEq", "solve_d2_polyeq_abc_equation"]);
750 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
751 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
752 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
753 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
754 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
755 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
756 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
757 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
758 case f of Test_Out.FormKF "[x = 2, x = -2]" => ()
759 | _ => error "polyeq.sml: diff.behav. in -4 + x^2 = 0 -> [x = 2, x = -2]";
762 val fmz = ["equality ( 4+ x^^^2 = 0)", "solveFor x", "solutions L"];
763 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"], ["PolyEq", "solve_d2_polyeq_abc_equation"]);
764 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
765 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
766 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
767 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
768 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
769 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
770 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
776 val fmz = ["equality (2*x + 2*x^^^2 = 0)", "solveFor x", "solutions L"];
777 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
778 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
779 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
780 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
781 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
782 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
783 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
784 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
785 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
786 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
787 case f of Test_Out.FormKF "[x = 0, x = -1]" => ()
788 | _ => error "polyeq.sml: diff.behav. in x + x^2 = 0 -> [x = 0, x = -1]";
790 val fmz = ["equality (1*x + x^^^2 = 0)", "solveFor x", "solutions L"];
791 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
792 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
793 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
794 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
795 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
796 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
797 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
798 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
799 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
800 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
801 case f of Test_Out.FormKF "[x = 0, x = -1]" => ()
802 | _ => error "polyeq.sml: diff.behav. in x + x^2 = 0 -> [x = 0, x = -1]";
805 val fmz = ["equality (x + 2*x^^^2 = 0)", "solveFor x", "solutions L"];
806 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
807 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
808 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
809 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
810 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
811 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
812 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
813 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
814 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
815 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
816 case f of Test_Out.FormKF "[x = 0, x = -1 / 2]" => ()
817 | _ => error "polyeq.sml: diff.behav. in x + x^2 = 0 -> [x = 0, x = -1 / 2]";
820 val fmz = ["equality (x + x^^^2 = 0)", "solveFor x", "solutions L"];
821 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
822 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
823 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
824 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
825 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
826 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
827 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
828 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
829 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
830 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
831 case f of Test_Out.FormKF "[x = 0, x = -1]" => ()
832 | _ => error "polyeq.sml: diff.behav. in x + x^2 = 0 -> [x = 0, x = -1]";
835 "----------- (-8 - 2*x + x^^^2 = 0), (*Schalk 2, S.67 Nr.31.b----";
836 "----------- (-8 - 2*x + x^^^2 = 0), (*Schalk 2, S.67 Nr.31.b----";
837 "----------- (-8 - 2*x + x^^^2 = 0), (*Schalk 2, S.67 Nr.31.b----";
838 (*stopped du to TODO.txt WN111014.TODO calculate_Poly < calculate_Rational < calculate_RootRat
839 see --- val rls = calculate_RootRat > calculate_Rational ---
840 calculate_RootRat was a TODO with 2002, requires re-design.
841 see also --- (-8 - 2*x + x^^^2 = 0), by rewriting --- below
843 val fmz = ["equality (-8 - 2*x + x^^^2 = 0)", (*Schalk 2, S.67 Nr.31.b*)
844 "solveFor x", "solutions L"];
846 ("PolyEq",["degree_2", "expanded", "univariate", "equation"],
847 ["PolyEq", "complete_square"]);
848 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
849 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
850 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
851 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
853 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
854 (*Apply_Method ("PolyEq", "complete_square")*)
855 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
856 (*"-8 - 2 * x + x ^^^ 2 = 0", nxt = Rewrite_Set_Inst ... "complete_square*)
857 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
858 (*"-8 + (2 / 2 - x) ^^^ 2 = (2 / 2) ^^^ 2", nxt = Rewrite("square_explicit1"*)
859 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
860 (*"(2 / 2 - x) ^^^ 2 = (2 / 2) ^^^ 2 - -8" nxt = Rewrite("root_plus_minus*)
861 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
862 (*"2 / 2 - x = sqrt ((2 / 2) ^^^ 2 - -8) |
863 2 / 2 - x = - sqrt ((2 / 2) ^^^ 2 - -8)" nxt = Rewr_Inst("bdv_explicit2"*)
864 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
865 (*"2 / 2 - x = sqrt ((2 / 2) ^^^ 2 - -8) |
866 -1*x = - (2 / 2) + - sqrt ((2 / 2) ^^^ 2 - -8)"nxt = R_Inst("bdv_explt2"*)
867 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
868 (*"-1 * x = - (2 / 2) + sqrt ((2 / 2) ^^^ 2 - -8) |
869 -1 * x = (- (2 / 2) + - sqrt ((2 / 2) ^^^ 2 - -8))"nxt = bdv_explicit3*)
870 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
871 (*"-1 * x = - (2 / 2) + sqrt ((2 / 2) ^^^ 2 - -8) |
872 x = -1 * (- (2 / 2) + - sqrt ((2 / 2) ^^^ 2 - -8))" nxt = bdv_explicit3*)
873 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
874 (*"x = -1 * (- (2 / 2) + sqrt ((2 / 2) ^^^ 2 - -8)) |
875 x = -1 * (- (2 / 2) + - sqrt ((2 / 2) ^^^ 2 - -8))"nxt = calculate_Rational
876 NOT IMPLEMENTED SINCE 2002 ------------------------------^^^^^^^^^^^^^^^^^^*)
877 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
878 (*"x = -2 | x = 4" nxt = Or_to_List*)
879 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
880 (*"[x = -2, x = 4]" nxt = Check_Postcond*)
881 val (p,_,f,nxt,_,pt) = me nxt p [] pt; f2str f;
883 case f of Form' (Test_Out.FormKF (~1,EdUndef,0,Nundef,"[x = -2, x = 4]")) => () TODO
884 | _ => error "polyeq.sml: diff.behav. in [x = -2, x = 4]";
887 "[x = -1 * -1 + -1 * sqrt (2 ^^^ 2 / 2 ^^^ 2 - -8),\n x = -1 * -1 + -1 * (-1 * sqrt (2 ^^^ 2 / 2 ^^^ 2 - -8))]"
888 (*"[x = -1 * -1 + -1 * sqrt (1 ^^^ 2 - -8),\n x = -1 * -1 + -1 * (-1 * sqrt (1 ^^^ 2 - -8))]"*)
889 then () else error "polyeq.sml corrected?behav. in [x = -2, x = 4]";
892 "----------- (-8 - 2*x + x^^^2 = 0), by rewriting ---------------";
893 "----------- (-8 - 2*x + x^^^2 = 0), by rewriting ---------------";
894 "----------- (-8 - 2*x + x^^^2 = 0), by rewriting ---------------";
895 (*stopped du to TODO.txt WN111014.TODO calculate_Poly < calculate_Rational < calculate_RootRat
896 see --- val rls = calculate_RootRat > calculate_Rational ---*)
897 val thy = @{theory PolyEq};
898 val ctxt = Proof_Context.init_global thy;
899 val inst = [((the o (parseNEW ctxt)) "bdv::real", (the o (parseNEW ctxt)) "x::real")];
900 val t = (the o (parseNEW ctxt)) "-8 - 2*x + x^^^2 = (0::real)";
902 val rls = complete_square;
903 val SOME (t,asm) = rewrite_set_inst_ thy true inst rls t;
904 UnparseC.term t = "-8 + (2 / 2 - x) ^^^ 2 = (2 / 2) ^^^ 2";
906 val thm = ThmC.numerals_to_Free @{thm square_explicit1};
907 val SOME (t,asm) = rewrite_ thy dummy_ord Rule_Set.Empty true thm t;
908 UnparseC.term t = "(2 / 2 - x) ^^^ 2 = (2 / 2) ^^^ 2 - -8";
910 val thm = ThmC.numerals_to_Free @{thm root_plus_minus};
911 val SOME (t,asm) = rewrite_ thy dummy_ord PolyEq_erls true thm t;
912 UnparseC.term t = "2 / 2 - x = sqrt ((2 / 2) ^^^ 2 - -8) |"^
913 "\n2 / 2 - x = -1 * sqrt ((2 / 2) ^^^ 2 - -8)";
915 (*the thm bdv_explicit2* here required to be constrained to ::real*)
916 val thm = ThmC.numerals_to_Free @{thm bdv_explicit2};
917 val SOME (t,asm) = rewrite_inst_ thy dummy_ord Rule_Set.Empty true inst thm t;
918 UnparseC.term t = "2 / 2 - x = sqrt ((2 / 2) ^^^ 2 - -8) |"^
919 "\n-1 * x = - (2 / 2) + -1 * sqrt ((2 / 2) ^^^ 2 - -8)";
921 val thm = ThmC.numerals_to_Free @{thm bdv_explicit3};
922 val SOME (t,asm) = rewrite_inst_ thy dummy_ord Rule_Set.Empty true inst thm t;
923 UnparseC.term t = "2 / 2 - x = sqrt ((2 / 2) ^^^ 2 - -8) |"^
924 "\nx = -1 * (- (2 / 2) + -1 * sqrt ((2 / 2) ^^^ 2 - -8))";
926 val thm = ThmC.numerals_to_Free @{thm bdv_explicit2};
927 val SOME (t,asm) = rewrite_inst_ thy dummy_ord Rule_Set.Empty true inst thm t;
928 UnparseC.term t = "-1 * x = - (2 / 2) + sqrt ((2 / 2) ^^^ 2 - -8) |"^
929 "\nx = -1 * (- (2 / 2) + -1 * sqrt ((2 / 2) ^^^ 2 - -8))";
931 val rls = calculate_RootRat;
932 val SOME (t,asm) = rewrite_set_ thy true rls t;
934 "-1 * x = -1 + sqrt (2 ^^^ 2 / 2 ^^^ 2 - -8) \<or>\nx = -1 * -1 + -1 * (-1 * sqrt (2 ^^^ 2 / 2 ^^^ 2 - -8))"
935 (*"-1 * x = -1 + sqrt (2 ^^^ 2 / 2 ^^^ 2 - -8) |\nx = -1 * -1 + -1 * (-1 * sqrt (2 ^^^ 2 / 2 ^^^ 2 - -8))"..isabisac15*)
936 then () else error "(-8 - 2*x + x^^^2 = 0), by rewriting -- ERROR INDICATES IMPROVEMENT";
937 (*SHOULD BE: UnparseC.term = "x = -2 | x = 4;*)
940 "-------------------- (3 - 10*x + 3*x^^^2 = 0), ----------------------";
941 "-------------------- (3 - 10*x + 3*x^^^2 = 0), ----------------------";
942 "-------------------- (3 - 10*x + 3*x^^^2 = 0), ----------------------";
943 "---- test the erls ----";
944 val t1 = (Thm.term_of o the o (TermC.parse thy)) "0 <= (10/3/2)^^^2 - 1";
945 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_erls t1;
946 val t' = UnparseC.term t;
947 (*if t'= "HOL.True" then ()
948 else error "polyeq.sml: diff.behav. in 'rewrite_set_.. PolyEq_erls";*)
950 val fmz = ["equality (3 - 10*x + 3*x^^^2 = 0)",
951 "solveFor x", "solutions L"];
953 ("PolyEq",["degree_2", "expanded", "univariate", "equation"],
954 ["PolyEq", "complete_square"]);
955 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
956 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
957 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
958 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
959 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
960 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
961 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
962 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
963 (*Apply_Method ("PolyEq", "complete_square")*)
964 val (p,_,f,nxt,_,pt) = me nxt p [] pt; f2str f;
966 "----------- (-16 + 4*x + 2*x^^^2 = 0), --------------------------";
967 "----------- (-16 + 4*x + 2*x^^^2 = 0), --------------------------";
968 "----------- (-16 + 4*x + 2*x^^^2 = 0), --------------------------";
969 val fmz = ["equality (-16 + 4*x + 2*x^^^2 = 0)",
970 "solveFor x", "solutions L"];
972 ("PolyEq",["degree_2", "expanded", "univariate", "equation"],
973 ["PolyEq", "complete_square"]);
974 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
975 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
976 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
977 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
978 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
979 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
980 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
981 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
982 (*Apply_Method ("PolyEq", "complete_square")*)
983 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
984 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
985 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
986 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
987 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
988 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
989 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
990 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
991 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
992 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
994 case f of Form' (Test_Out.FormKF (~1,EdUndef,0,Nundef,"[x = 2, x = -4]")) => () TODO
995 | _ => error "polyeq.sml: diff.behav. in [x = 2, x = -4]";