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 "----------- open local of fun ord_make_polynomial_in ------------------------------------------";
17 "----------- Matthias Goldgruber 2003 trials on rewrite orders -------------------------------";
18 "----------- lin.eq degree_0 -------------------------------------";
19 "----------- test thm's d2_pq_formulsxx[_neg]---------------------";
20 "----------- equality (2 +(- 1)*x + x \<up> 2 = (0::real)) ----------------------------------------";
21 "----------- equality (- 2 +(- 1)*x + 1*x \<up> 2 = 0) ---------------------------------------------";
22 "----------- equality (- 2 + x + x \<up> 2 = 0) ---------------------------------------------------";
23 "----------- equality (2 + x + x \<up> 2 = 0) ----------------------------------------------------";
24 "----------- equality (- 2 + x + 1*x \<up> 2 = 0)) ------------------------------------------------";
25 "----------- equality (1*x + x \<up> 2 = 0) ----------------------------------------------------";
26 "----------- equality (1*x + 1*x \<up> 2 = 0) ----------------------------------------------------";
27 "----------- equality (x + x \<up> 2 = 0) ------------------------------------------------------";
28 "----------- equality (x + 1*x \<up> 2 = 0) ------------------------------------------------------";
29 "----------- equality (-4 + x \<up> 2 = 0) -------------------------------------------------------";
30 "----------- equality (4 + 1*x \<up> 2 = 0) -------------------------------------------------------";
31 "----------- equality (1 +(- 1)*x + 2*x \<up> 2 = 0) ----------------------------------------------";
32 "----------- equality (- 1 + x + 2*x \<up> 2 = 0) -------------------------------------------------";
33 "----------- equality (1 + x + 2*x \<up> 2 = 0) --------------------------------------------------";
34 "----------- (-8 - 2*x + x \<up> 2 = 0), (*Schalk 2, S.67 Nr.31.b----";
35 "----------- (-8 - 2*x + x \<up> 2 = 0), by rewriting ---------------";
36 "----------- (- 16 + 4*x + 2*x \<up> 2 = 0), --------------------------";
37 "-----------------------------------------------------------------";
38 "------ polyeq- 2.sml ---------------------------------------------";
39 "----------- (a*b - (a+b)*x + x \<up> 2 = 0), (*Schalk 2,S.68Nr.44.a*)";
40 "----------- (-64 + x \<up> 2 = 0), (*Schalk 2, S.66 Nr.1.a~--------*)";
41 "----------- (- 147 + 3*x \<up> 2 = 0), (*Schalk 2, S.66 Nr.1.b------*)";
42 "----------- (3*x - 1 - (5*x - (2 - 4*x)) = - 11),(*Schalk Is86Bsp5";
43 "----------- ((x+1)*(x+2) - (3*x - 2) \<up> 2=.. Schalk II s.68 Bsp 37";
44 "----------- rls make_polynomial_in ------------------------------";
45 "----------- interSteps ([1],Res); on Schalk Is86Bsp5-------------";
46 "----------- rls d2_polyeq_bdv_only_simplify ---------------------";
47 "-----------------------------------------------------------------";
48 "-----------------------------------------------------------------";
50 "----------- tests on predicates in problems ---------------------";
51 "----------- tests on predicates in problems ---------------------";
52 "----------- tests on predicates in problems ---------------------";
53 Rewrite.trace_on:=false; (*true false*)
55 val t1 = (Thm.term_of o the o (TermC.parse thy)) "lhs (-8 - 2*x + x \<up> 2 = 0)";
56 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t1;
57 if ((UnparseC.term t) = "- 8 - 2 * x + x \<up> 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 \<up> 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 \<up> 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 \<up> 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";
80 val t6 = (Thm.term_of o the o (TermC.parse thy)) "(lhs (-8 - 2*x + x \<up> 2 = 0)) is_expanded_in x";
81 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t6;
82 if (UnparseC.term t) = "True" then ()
83 else error "polyeq.sml: diff.behav. 5 in is_expended_in";
85 val t3 = (Thm.term_of o the o (TermC.parse thy))"((-8 - 2*x + x \<up> 2) has_degree_in x) = 2";
86 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t3;
87 if (UnparseC.term t) = "True" then ()
88 else error "polyeq.sml: diff.behav. in has_degree_in_in";
90 val t3 = (Thm.term_of o the o (TermC.parse thy)) "((sqrt(x)) has_degree_in x) = 2";
91 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t3;
92 if (UnparseC.term t) = "False" then ()
93 else error "polyeq.sml: diff.behav. 6 in has_degree_in_in";
95 val t4 = (Thm.term_of o the o (TermC.parse thy))
96 "((-8 - 2*x + x \<up> 2) has_degree_in x) = 1";
97 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t4;
98 if (UnparseC.term t) = "False" then ()
99 else error "polyeq.sml: diff.behav. 7 in has_degree_in_in";
101 val t5 = (Thm.term_of o the o (TermC.parse thy))
102 "((-8 - 2*x + x \<up> 2) has_degree_in x) = 2";
103 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t5;
104 if (UnparseC.term t) = "True" then ()
105 else error "polyeq.sml: diff.behav. 8 in has_degree_in_in";
107 "----------- test matching problems --------------------------0---";
108 "----------- test matching problems --------------------------0---";
109 "----------- test matching problems --------------------------0---";
110 val fmz = ["equality (-8 - 2*x + x \<up> 2 = 0)", "solveFor x", "solutions L"];
111 if M_Match.match_pbl fmz (Problem.from_store ["expanded", "univariate", "equation"]) =
112 M_Match.Matches' {Find = [Correct "solutions L"],
114 Given = [Correct "equality (- 8 - 2 * x + x \<up> 2 = 0)", Correct "solveFor x"],
115 Where = [Correct "matches (?a = 0) (- 8 - 2 * x + x \<up> 2 = 0)",
116 Correct "lhs (- 8 - 2 * x + x \<up> 2 = 0) is_expanded_in x"],
118 then () else error "M_Match.match_pbl [expanded,univariate,equation]";
120 if M_Match.match_pbl fmz (Problem.from_store ["degree_2", "expanded", "univariate", "equation"]) =
121 M_Match.Matches' {Find = [Correct "solutions L"],
123 Given = [Correct "equality (- 8 - 2 * x + x \<up> 2 = 0)", Correct "solveFor x"],
124 Where = [Correct "lhs (- 8 - 2 * x + x \<up> 2 = 0) has_degree_in x = 2"],
125 Relate = []} (*before WN110906 was: has_degree_in x =!= 2"]*)
126 then () else error "M_Match.match_pbl [degree_2,expanded,univariate,equation]";
129 "----------- prep. for introduction of Matthias Goldgruber 2003 trials on rewrite orders -----";
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 (*##################################################################################
133 ----------- 28.2.03: war nicht upgedatet und ausgeklammert in ROOT.ML-->Test_Isac.thy
135 (*Aufgabe zum Einstieg in die Arbeit...*)
136 val t = (Thm.term_of o the o (TermC.parse thy)) "a*b - (a+b)*x + x \<up> 2 = 0";
137 (*ein 'ruleset' aus Poly.ML wird angewandt...*)
138 val SOME (t,_) = rewrite_set_ thy Poly_erls false make_polynomial t;
140 "a * b + (- 1 * (a * x) + (- 1 * (b * x) + x \<up> 2)) = 0";
142 rewrite_set_inst_ thy Poly_erls false [("bdv", "a")] make_polynomial_in t;
144 "x \<up> 2 + (- 1 * (b * x) + (- 1 * (x * a) + b * a)) = 0";
145 (* bei Verwendung von "size_of-term" nach MG :*)
146 (*"x \<up> 2 + (- 1 * (b * x) + (b * a + - 1 * (x * a))) = 0" !!! *)
148 (*wir holen 'a' wieder aus der Klammerung heraus...*)
149 val SOME (t,_) = rewrite_set_ thy Poly_erls false discard_parentheses t;
151 "x \<up> 2 + - 1 * b * x + - 1 * x * a + b * a = 0";
152 (* "x \<up> 2 + - 1 * b * x + b * a + - 1 * x * a = 0" !!! *)
155 rewrite_set_inst_ thy Poly_erls false [("bdv", "a")] make_polynomial_in t;
157 "x \<up> 2 + (- 1 * (b * x) + a * (b + - 1 * x)) = 0";
158 (*da sind wir fast am Ziel: make_polynomial_in 'a' sollte ergeben
159 "x \<up> 2 + (- 1 * (b * x)) + (b + - 1 * x) * a = 0"*)
161 (*das rewriting l"asst sich beobachten mit
162 Rewrite.trace_on := false; (*true false*)
165 "------ 15.11.02 --------------------------";
166 val t = (Thm.term_of o the o (TermC.parse thy)) "1 + a * x + b * x";
167 val bdv = (Thm.term_of o the o (TermC.parse thy)) "bdv";
168 val a = (Thm.term_of o the o (TermC.parse thy)) "a";
170 Rewrite.trace_on := false; (*true false*)
171 (* Anwenden einer Regelmenge aus Termorder.ML: *)
173 rewrite_set_inst_ thy false [(bdv,a)] make_polynomial_in t;
176 rewrite_set_ thy false discard_parentheses t;
180 val t = (Thm.term_of o the o (TermC.parse thy)) "1 + a * (x + b * x) + a \<up> 2";
182 rewrite_set_inst_ thy false [(bdv,a)] make_polynomial_in t;
185 rewrite_set_ thy false discard_parentheses t;
187 "1 + (x + b * x) * a + a \<up> 2";
189 val t = (Thm.term_of o the o (TermC.parse thy)) "1 + a \<up> 2 * x + b * a + 7*a \<up> 2";
191 rewrite_set_inst_ thy false [(bdv,a)] make_polynomial_in t;
194 rewrite_set_ thy false discard_parentheses t;
196 "1 + b * a + (7 + x) * a \<up> 2";
199 Prog_Expr.thy grundlegende Algebra
203 RootRat.thy Wurzen + Br"uche
204 Termorder.thy BITTE NUR HIERHER SCHREIBEN (...WN03)
206 get_thm Termorder.thy "bdv_n_collect";
207 get_thm (theory "Isac_Knowledge") "bdv_n_collect";
209 val t = (Thm.term_of o the o (TermC.parse thy)) "a \<up> 2 * x + 7 * a \<up> 2";
211 rewrite_set_inst_ thy false [(bdv,a)] make_polynomial_in t;
214 rewrite_set_ thy false discard_parentheses t;
216 "(7 + x) * a \<up> 2";
218 val t = (Thm.term_of o the o (TermC.parse Termorder.thy)) "Pi";
220 val t = (Thm.term_of o the o (parseold thy)) "7";
221 ##################################################################################*)
224 "----------- open local of fun ord_make_polynomial_in ------------------------------------------";
225 "----------- open local of fun ord_make_polynomial_in ------------------------------------------";
226 "----------- open local of fun ord_make_polynomial_in ------------------------------------------";
227 (* termorder hacked by MG, adapted later by WN *)
228 (** )local ( *. for make_polynomial_in .*)
230 open Term; (* for type order = EQUAL | LESS | GREATER *)
232 fun pr_ord EQUAL = "EQUAL"
233 | pr_ord LESS = "LESS"
234 | pr_ord GREATER = "GREATER";
236 fun dest_hd' _ (Const (a, T)) = (((a, 0), T), 0)
237 | dest_hd' x (t as Free (a, T)) =
238 if x = t then ((("|||||||||||||", 0), T), 0) (*WN*)
239 else (((a, 0), T), 1)
240 | dest_hd' _ (Var v) = (v, 2)
241 | dest_hd' _ (Bound i) = ((("", i), dummyT), 3)
242 | dest_hd' _ (Abs (_, T, _)) = ((("", 0), T), 4)
243 | dest_hd' _ _ = raise ERROR "dest_hd': uncovered case in fun.def.";
245 fun size_of_term' i pr x (t as Const (\<^const_name>\<open>powr\<close>, _) $
246 Free (var, _) $ Free (pot, _)) =
247 (if pr then tracing (idt "#" i ^ "size_of_term' powr: " ^ UnparseC.term t) else ();
251 then (if pr then tracing (idt "#" i ^ "xstr = var --> " ^ string_of_int (1000 * (the (TermC.int_opt_of_string pot)))) else ();
252 1000 * (the (TermC.int_opt_of_string pot)))
253 else (if pr then tracing (idt "#" i ^ "x <> Free --> " ^ "3") else (); 3)
254 | _ => raise ERROR ("size_of_term' called with subst = " ^ UnparseC.term x))
255 | size_of_term' i pr x (t as Abs (_, _, body)) =
256 (if pr then tracing (idt "#" i ^ "size_of_term' Abs: " ^ UnparseC.term t) else ();
257 1 + size_of_term' (i + 1) pr x body)
258 | size_of_term' i pr x (f $ t) =
260 val _ = if pr then tracing (idt "#" i ^ "size_of_term' $$$: " ^ UnparseC.term f ^ " $$$ " ^ UnparseC.term t) else ();
261 val s1 = size_of_term' (i + 1) pr x f
262 val s2 = size_of_term' (i + 1) pr x t
263 val _ = if pr then tracing (idt "#" i ^ "size_of_term' $$$-->: " ^ string_of_int s1 ^ " + " ^ string_of_int s2 ^ " = " ^ string_of_int(s1 + s2)) else ();
265 | size_of_term' i pr x t =
266 (if pr then tracing (idt "#" i ^ "size_of_term' bot: " ^ UnparseC.term t) else ();
272 then (if pr then tracing (idt "#" i ^ "xstr = var --> " ^ "1000") else (); 1000)
273 else (if pr then tracing (idt "#" i ^ "x <> Free --> " ^ "1") else (); 1)
274 | _ => raise ERROR ("size_of_term' called with subst = " ^ UnparseC.term x))
275 | _ => (if pr then tracing (idt "#" i ^ "bot --> " ^ "1") else (); 1));
277 fun term_ord' i pr x thy (Abs (_, T, t), Abs(_, U, u)) = (* ~ term.ML *)
279 val _ = if pr then tracing (idt "#" i ^ "term_ord' Abs") else ();
281 case term_ord' (i + 1) pr x thy (t, u) of EQUAL => Term_Ord.typ_ord (T, U) | ord => ord
282 val _ = if pr then tracing (idt "#" i ^ "term_ord' Abs --> " ^ pr_ord ord) else ()
284 | term_ord' i pr x _ (t, u) =
286 val _ = if pr then tracing (idt "#" i ^ "term_ord' bot (" ^ UnparseC.term t ^ ", " ^ UnparseC.term u ^ ")") else ();
288 case int_ord (size_of_term' (i + 1) pr x t, size_of_term' (i + 1) pr x u) of
290 let val (f, ts) = strip_comb t and (g, us) = strip_comb u
292 (case hd_ord (i + 1) pr x (f, g) of
293 EQUAL => (terms_ord x (i + 1) pr) (ts, us)
297 val _ = if pr then tracing (idt "#" i ^ "term_ord' bot --> " ^ pr_ord ord) else ()
299 and hd_ord i pr x (f, g) = (* ~ term.ML *)
301 val _ = if pr then tracing (idt "#" i ^ "hd_ord (" ^ UnparseC.term f ^ ", " ^ UnparseC.term g ^ ")") else ();
303 (prod_ord Term_Ord.indexname_ord Term_Ord.typ_ord) int_ord
304 (dest_hd' x f, dest_hd' x g)
305 val _ = if pr then tracing (idt "#" i ^ "hd_ord --> " ^ pr_ord ord) else ();
307 and terms_ord x i pr (ts, us) =
309 val _ = if pr then tracing (idt "#" i ^ "terms_ord (" ^ UnparseC.terms ts ^ ", " ^ UnparseC.terms us ^ ")") else ();
310 val ord = list_ord (term_ord' (i + 1) pr x (ThyC.get_theory "Isac_Knowledge"))(ts, us);
311 val _ = if pr then tracing (idt "#" i ^ "terms_ord --> " ^ pr_ord ord) else ();
316 fun ord_make_polynomial_in (pr:bool) thy subst (ts, us) =
317 ((** )tracing ("*** subs variable is: " ^ Env.subst2str subst); ( **)
320 term_ord' 1 pr x thy (TermC.numerals_to_Free ts, TermC.numerals_to_Free us) = LESS
321 | _ => raise ERROR ("ord_make_polynomial_in called with subst = " ^ Env.subst2str subst))
326 val subs = [(TermC.str2term "bdv::real", TermC.str2term "x::real")];
327 if ord_make_polynomial_in true @{theory} subs (t1, t2) then () else error "still GREATER?";
329 val x = TermC.str2term "x ::real";
331 val t1 = TermC.numerals_to_Free (TermC.str2term "L * q_0 * x \<up> 2 / 4 ::real");
332 if 2006 = size_of_term' 1 true x t1
333 then () else error "size_of_term' (L * q_0 * x \<up> 2) CHANGED)";
335 val t2 = TermC.numerals_to_Free (TermC.str2term "- 1 * (q_0 * x \<up> 3) :: real");
336 if 3004 = size_of_term' 1 true x t2
337 then () else error "size_of_term' (- 1 * (q_0 * x \<up> 3)) CHANGED";
340 "----------- Matthias Goldgruber 2003 trials on rewrite orders -------------------------------";
341 "----------- Matthias Goldgruber 2003 trials on rewrite orders -------------------------------";
342 "----------- Matthias Goldgruber 2003 trials on rewrite orders -------------------------------";
343 val substa = [(TermC.empty, (Thm.term_of o the o (TermC.parse thy)) "a")];
344 val substb = [(TermC.empty, (Thm.term_of o the o (TermC.parse thy)) "b")];
345 val substx = [(TermC.empty, (Thm.term_of o the o (TermC.parse thy)) "x")];
347 val x1 = (Thm.term_of o the o (TermC.parse thy)) "a + b + x";
348 val x2 = (Thm.term_of o the o (TermC.parse thy)) "a + x + b";
349 val x3 = (Thm.term_of o the o (TermC.parse thy)) "a + x + b";
350 val x4 = (Thm.term_of o the o (TermC.parse thy)) "x + a + b";
352 if ord_make_polynomial_in true thy substx (x1,x2) = true(*LESS *) then ()
353 else error "termorder.sml diff.behav ord_make_polynomial_in #1";
355 if ord_make_polynomial_in true thy substa (x1,x2) = true(*LESS *) then ()
356 else error "termorder.sml diff.behav ord_make_polynomial_in #2";
358 if ord_make_polynomial_in true thy substb (x1,x2) = false(*GREATER*) then ()
359 else error "termorder.sml diff.behav ord_make_polynomial_in #3";
361 val aa = (Thm.term_of o the o (TermC.parse thy)) "- 1 * a * x";
362 val bb = (Thm.term_of o the o (TermC.parse thy)) "x \<up> 3";
363 ord_make_polynomial_in true thy substx (aa, bb);
366 val aa = (Thm.term_of o the o (TermC.parse thy)) "- 1 * a * x";
367 val bb = (Thm.term_of o the o (TermC.parse thy)) "x \<up> 3";
368 ord_make_polynomial_in true thy substa (aa, bb);
369 false; (* => GREATER *)
371 (* und nach dem Re-engineering der Termorders in den 'rulesets'
372 kannst Du die 'gr"osste' Variable frei w"ahlen: *)
373 val bdv= TermC.str2term "bdv ::real";
374 val x = TermC.str2term "x ::real";
375 val a = TermC.str2term "a ::real";
376 val b = TermC.str2term "b ::real";
377 val SOME (t',_) = rewrite_set_inst_ thy false [(bdv,a)] make_polynomial_in x2;
378 if UnparseC.term t' = "b + x + a" then ()
379 else error "termorder.sml diff.behav ord_make_polynomial_in #11";
381 val NONE = rewrite_set_inst_ thy false [(bdv,b)] make_polynomial_in x2;
383 val SOME (t',_) = rewrite_set_inst_ thy false [(bdv,x)] make_polynomial_in x2;
384 if UnparseC.term t' = "a + b + x" then ()
385 else error "termorder.sml diff.behav ord_make_polynomial_in #13";
387 val ppp' = "-6 + -5*x + x \<up> 3 + - 1*x \<up> 2 + - 1*x \<up> 3 + - 14*x \<up> 2";
388 val ppp = (Thm.term_of o the o (TermC.parse thy)) ppp';
389 val SOME (t', _) = rewrite_set_inst_ thy false [(bdv,x)] make_polynomial_in ppp;
390 if UnparseC.term t' = "- 6 + - 5 * x + - 15 * x \<up> 2" then ()
391 else error "termorder.sml diff.behav ord_make_polynomial_in #15";
393 val ttt' = "(3*x + 5)/18 ::real";
394 val ttt = (Thm.term_of o the o (TermC.parse thy)) ttt';
395 val SOME (uuu,_) = rewrite_set_inst_ thy false [(bdv,x)] make_polynomial_in ttt;
396 if UnparseC.term uuu = "(5 + 3 * x) / 18" then ()
397 else error "termorder.sml diff.behav ord_make_polynomial_in #16a";
399 val SOME (uuu,_) = rewrite_set_ thy false make_polynomial ttt;
400 if UnparseC.term uuu = "(5 + 3 * x) / 18" then ()
401 else error "termorder.sml diff.behav ord_make_polynomial_in #16b";
403 "----------- lin.eq degree_0 -------------------------------------";
404 "----------- lin.eq degree_0 -------------------------------------";
405 "----------- lin.eq degree_0 -------------------------------------";
406 "----- d0_false ------";
407 val fmz = ["equality (1 = (0::real))", "solveFor x", "solutions L"];
408 val (dI',pI',mI') = ("PolyEq",["degree_0", "polynomial", "univariate", "equation"],
409 ["PolyEq", "solve_d0_polyeq_equation"]);
410 (*=== inhibit exn WN110914: declare_constraints doesnt work with ThmC.numerals_to_Free ========
411 TODO: change to "equality (x + - 1*x = (0::real))"
412 and search for an appropriate problem and method.
414 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
415 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
416 val (p,_,f,nxt,_,pt) = me nxt p [] pt; 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;
421 case f of Form' (Test_Out.FormKF (~1,EdUndef,0,Nundef,"[]")) => ()
422 | _ => error "polyeq.sml: diff.behav. in 1 = 0 -> []";
424 "----- d0_true ------";
425 val fmz = ["equality (0 = (0::real))", "solveFor x", "solutions L"];
426 val (dI',pI',mI') = ("PolyEq",["degree_0", "polynomial", "univariate", "equation"],
427 ["PolyEq", "solve_d0_polyeq_equation"]);
428 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
429 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
430 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
431 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
432 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
433 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
434 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
435 case f of Form' (Test_Out.FormKF (~1,EdUndef,0,Nundef,"UniversalList")) => ()
436 | _ => error "polyeq.sml: diff.behav. in 0 = 0 -> UniversalList";
437 ============ inhibit exn WN110914 ============================================*)
439 "----------- test thm's d2_pq_formulsxx[_neg]---------------------";
440 "----------- test thm's d2_pq_formulsxx[_neg]---------------------";
441 "----------- test thm's d2_pq_formulsxx[_neg]---------------------";
442 "----- d2_pqformula1 ------!!!!";
443 val fmz = ["equality (- 1/8 + (- 1/4)*z + z \<up> 2 = (0::real))", "solveFor z", "solutions L"];
445 ("Isac_Knowledge", ["pqFormula", "degree_2", "polynomial", "univariate", "equation"], ["no_met"]);
446 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
447 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
448 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
449 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
450 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
451 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
452 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
453 val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*Apply_Method ["PolyEq", "solve_d2_polyeq_pq_equation"]*)
454 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
455 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
456 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
457 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
459 (*[z = 1 / 8 + sqrt (9 / 16) / 2, z = 1 / 8 + - 1 * sqrt (9 / 16) / 2] TODO sqrt*)
460 val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt =..,Check_elementwise "Assumptions")*)
461 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
462 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
464 if p = ([], Res) andalso
465 f2str f = "[z = 1 / 8 + sqrt (9 / 16) / 2, z = 1 / 8 + - 1 * sqrt (9 / 16) / 2]" then
466 case nxt of End_Proof' => () | _ => error "(- 1/8 + (- 1/4)*z + z \<up> 2 = (0::real)) CHANGED 1"
467 else error "(- 1/8 + (- 1/4)*z + z \<up> 2 = (0::real)) CHANGED 2";
469 "----------- equality (2 +(- 1)*x + x \<up> 2 = (0::real)) ----------------------------------------";
470 "----------- equality (2 +(- 1)*x + x \<up> 2 = (0::real)) ----------------------------------------";
471 "----------- equality (2 +(- 1)*x + x \<up> 2 = (0::real)) ----------------------------------------";
472 "----- d2_pqformula1_neg ------";
473 val fmz = ["equality (2 +(- 1)*x + x \<up> 2 = (0::real))", "solveFor x", "solutions L"];
474 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"], ["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;
482 ([1],Res) False Or_to_List)*)
483 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
485 ([2],Res) [] Check_elementwise "Assumptions"*)
486 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
487 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
488 val asm = Ctree.get_assumptions pt p;
489 if f2str f = "[]" andalso
490 UnparseC.terms asm = "[\"lhs (2 + - 1 * x + x \<up> 2 = 0) is_poly_in x\", " ^
491 "\"lhs (2 + - 1 * x + x \<up> 2 = 0) has_degree_in x = 2\"]" then ()
492 else error "polyeq.sml: diff.behav. in 2 +(- 1)*x + x \<up> 2 = 0";
494 "----------- equality (- 2 +(- 1)*x + 1*x \<up> 2 = 0) ---------------------------------------------";
495 "----------- equality (- 2 +(- 1)*x + 1*x \<up> 2 = 0) ---------------------------------------------";
496 "----------- equality (- 2 +(- 1)*x + 1*x \<up> 2 = 0) ---------------------------------------------";
497 "----- d2_pqformula2 ------";
498 val fmz = ["equality (- 2 +(- 1)*x + 1*x \<up> 2 = 0)", "solveFor x", "solutions L"];
499 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
500 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
501 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
502 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
503 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
504 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
505 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
506 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
508 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
509 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
510 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
511 case f of Test_Out.FormKF "[x = 2, x = - 1]" => ()
512 | _ => error "polyeq.sml: diff.behav. in - 2 + (- 1)*x + x^2 = 0 -> [x = 2, x = - 1]";
515 "----------- equality (- 2 + x + x \<up> 2 = 0) ---------------------------------------------------";
516 "----------- equality (- 2 + x + x \<up> 2 = 0) ---------------------------------------------------";
517 "----------- equality (- 2 + x + x \<up> 2 = 0) ---------------------------------------------------";
518 "----- d2_pqformula3 ------";
520 val fmz = ["equality (- 2 + x + x \<up> 2 = 0)", "solveFor x", "solutions L"];
521 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
522 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
523 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
524 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
525 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
526 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
527 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
528 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
530 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
531 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
532 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
533 case f of Test_Out.FormKF "[x = 1, x = - 2]" => ()
534 | _ => error "polyeq.sml: diff.behav. in - 2 + x + x^2 = 0-> [x = 1, x = - 2]";
537 "----------- equality (2 + x + x \<up> 2 = 0) ----------------------------------------------------";
538 "----------- equality (2 + x + x \<up> 2 = 0) ----------------------------------------------------";
539 "----------- equality (2 + x + x \<up> 2 = 0) ----------------------------------------------------";
540 "----- d2_pqformula3_neg ------";
541 val fmz = ["equality (2 + x + x \<up> 2 = 0)", "solveFor x", "solutions L"];
542 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
543 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
544 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
545 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
546 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
547 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
548 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
549 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
551 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
552 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
553 "TODO 2 + x + x \<up> 2 = 0";
554 "TODO 2 + x + x \<up> 2 = 0";
555 "TODO 2 + x + x \<up> 2 = 0";
557 "----------- equality (- 2 + x + 1*x \<up> 2 = 0)) ------------------------------------------------";
558 "----------- equality (- 2 + x + 1*x \<up> 2 = 0)) ------------------------------------------------";
559 "----------- equality (- 2 + x + 1*x \<up> 2 = 0)) ------------------------------------------------";
560 "----- d2_pqformula4 ------";
561 val fmz = ["equality (- 2 + x + 1*x \<up> 2 = 0)", "solveFor x", "solutions L"];
562 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
563 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
564 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
565 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
566 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
567 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
568 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
569 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
570 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
571 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
572 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
573 case f of Test_Out.FormKF "[x = 1, x = - 2]" => ()
574 | _ => error "polyeq.sml: diff.behav. in - 2 + x + 1*x \<up> 2 = 0 -> [x = 1, x = - 2]";
576 "----------- equality (1*x + x \<up> 2 = 0) ----------------------------------------------------";
577 "----------- equality (1*x + x \<up> 2 = 0) ----------------------------------------------------";
578 "----------- equality (1*x + x \<up> 2 = 0) ----------------------------------------------------";
579 "----- d2_pqformula5 ------";
580 val fmz = ["equality (1*x + x \<up> 2 = 0)", "solveFor x", "solutions L"];
581 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
582 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
583 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
584 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
585 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
586 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
587 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
588 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
589 val (p,_,f,nxt,_,pt) = me nxt p [] pt; 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;
592 case f of Test_Out.FormKF "[x = 0, x = - 1]" => ()
593 | _ => error "polyeq.sml: diff.behav. in 1*x + x^2 = 0 -> [x = 0, x = - 1]";
595 "----------- equality (1*x + 1*x \<up> 2 = 0) ----------------------------------------------------";
596 "----------- equality (1*x + 1*x \<up> 2 = 0) ----------------------------------------------------";
597 "----------- equality (1*x + 1*x \<up> 2 = 0) ----------------------------------------------------";
598 "----- d2_pqformula6 ------";
599 val fmz = ["equality (1*x + 1*x \<up> 2 = 0)", "solveFor x", "solutions L"];
600 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
601 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
602 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
603 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
604 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
605 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
606 val (p,_,f,nxt,_,pt) = me nxt p [] pt; 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;
609 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;
611 case f of Test_Out.FormKF "[x = 0, x = - 1]" => ()
612 | _ => error "polyeq.sml: diff.behav. in 1*x + 1*x^2 = 0 -> [x = 0, x = - 1]";
614 "----------- equality (x + x \<up> 2 = 0) ------------------------------------------------------";
615 "----------- equality (x + x \<up> 2 = 0) ------------------------------------------------------";
616 "----------- equality (x + x \<up> 2 = 0) ------------------------------------------------------";
617 "----- d2_pqformula7 ------";
619 val fmz = ["equality ( x + x \<up> 2 = 0)", "solveFor x", "solutions L"];
620 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
621 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
622 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
623 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
624 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
625 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
626 val (p,_,f,nxt,_,pt) = me nxt p [] pt; 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;
628 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;
631 case f of Test_Out.FormKF "[x = 0, x = - 1]" => ()
632 | _ => error "polyeq.sml: diff.behav. in x + x^2 = 0 -> [x = 0, x = - 1]";
634 "----------- equality (x + 1*x \<up> 2 = 0) ------------------------------------------------------";
635 "----------- equality (x + 1*x \<up> 2 = 0) ------------------------------------------------------";
636 "----------- equality (x + 1*x \<up> 2 = 0) ------------------------------------------------------";
637 "----- d2_pqformula8 ------";
638 val fmz = ["equality (x + 1*x \<up> 2 = 0)", "solveFor x", "solutions L"];
639 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
640 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
641 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
642 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
643 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
644 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
645 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
646 val (p,_,f,nxt,_,pt) = me nxt p [] pt; 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;
648 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;
650 case f of Test_Out.FormKF "[x = 0, x = - 1]" => ()
651 | _ => error "polyeq.sml: diff.behav. in x + 1*x^2 = 0 -> [x = 0, x = - 1]";
653 "----------- equality (-4 + x \<up> 2 = 0) -------------------------------------------------------";
654 "----------- equality (-4 + x \<up> 2 = 0) -------------------------------------------------------";
655 "----------- equality (-4 + x \<up> 2 = 0) -------------------------------------------------------";
656 "----- d2_pqformula9 ------";
657 val fmz = ["equality (-4 + x \<up> 2 = 0)", "solveFor x", "solutions L"];
658 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
659 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
660 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
661 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
662 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
663 val (p,_,f,nxt,_,pt) = me nxt p [] pt; 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 case f of Test_Out.FormKF "[x = 2, x = - 2]" => ()
669 | _ => error "polyeq.sml: diff.behav. in -4 + x^2 = 0 -> [x = 2, x = - 2]";
672 "----------- equality (4 + 1*x \<up> 2 = 0) -------------------------------------------------------";
673 "----------- equality (4 + 1*x \<up> 2 = 0) -------------------------------------------------------";
674 "----------- equality (4 + 1*x \<up> 2 = 0) -------------------------------------------------------";
675 "----- d2_pqformula9_neg ------";
676 val fmz = ["equality (4 + 1*x \<up> 2 = 0)", "solveFor x", "solutions L"];
677 val (dI',pI',mI') = ("PolyEq",["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
678 ["PolyEq", "solve_d2_polyeq_pq_equation"]);
679 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
680 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; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
684 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
685 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
686 "TODO 4 + 1*x \<up> 2 = 0";
687 "TODO 4 + 1*x \<up> 2 = 0";
688 "TODO 4 + 1*x \<up> 2 = 0";
690 "-------------------- test thm's d2_abc_formulsxx[_neg]-----";
691 "-------------------- test thm's d2_abc_formulsxx[_neg]-----";
692 "-------------------- test thm's d2_abc_formulsxx[_neg]-----";
693 val fmz = ["equality (- 1 +(- 1)*x + 2*x \<up> 2 = 0)", "solveFor x", "solutions L"];
694 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
695 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
696 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
697 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 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
701 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
702 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
703 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
704 case f of Test_Out.FormKF "[x = 1, x = - 1 / 2]" => ()
705 | _ => error "polyeq.sml: diff.behav. in - 1 + (- 1)*x + 2*x^2 = 0 -> [x = 1, x = - 1/2]";
707 "----------- equality (1 +(- 1)*x + 2*x \<up> 2 = 0) ----------------------------------------------";
708 "----------- equality (1 +(- 1)*x + 2*x \<up> 2 = 0) ----------------------------------------------";
709 "----------- equality (1 +(- 1)*x + 2*x \<up> 2 = 0) ----------------------------------------------";
710 val fmz = ["equality (1 +(- 1)*x + 2*x \<up> 2 = 0)", "solveFor x", "solutions L"];
711 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
712 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
713 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
714 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
715 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
716 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
718 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
719 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
720 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
721 "TODO 1 +(- 1)*x + 2*x \<up> 2 = 0";
722 "TODO 1 +(- 1)*x + 2*x \<up> 2 = 0";
723 "TODO 1 +(- 1)*x + 2*x \<up> 2 = 0";
726 "----------- equality (- 1 + x + 2*x \<up> 2 = 0) -------------------------------------------------";
727 "----------- equality (- 1 + x + 2*x \<up> 2 = 0) -------------------------------------------------";
728 "----------- equality (- 1 + x + 2*x \<up> 2 = 0) -------------------------------------------------";
730 val fmz = ["equality (- 1 + x + 2*x \<up> 2 = 0)", "solveFor x", "solutions L"];
731 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
732 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
733 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
734 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
735 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
737 val (p,_,f,nxt,_,pt) = me nxt p [] pt; 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;
742 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
743 case f of Test_Out.FormKF "[x = 1 / 2, x = - 1]" => ()
744 | _ => error "polyeq.sml: diff.behav. in - 1 + x + 2*x^2 = 0 -> [x = 1/2, x = - 1]";
747 "----------- equality (1 + x + 2*x \<up> 2 = 0) --------------------------------------------------";
748 "----------- equality (1 + x + 2*x \<up> 2 = 0) --------------------------------------------------";
749 "----------- equality (1 + x + 2*x \<up> 2 = 0) --------------------------------------------------";
750 val fmz = ["equality (1 + x + 2*x \<up> 2 = 0)", "solveFor x", "solutions L"];
751 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
752 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
753 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
754 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;
757 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
758 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
759 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
760 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
761 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
762 "TODO 1 + x + 2*x \<up> 2 = 0";
763 "TODO 1 + x + 2*x \<up> 2 = 0";
764 "TODO 1 + x + 2*x \<up> 2 = 0";
767 val fmz = ["equality (- 2 + 1*x + x \<up> 2 = 0)", "solveFor x", "solutions L"];
768 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
769 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
770 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
771 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
772 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
773 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
774 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
775 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
776 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
777 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
778 case f of Test_Out.FormKF "[x = 1, x = - 2]" => ()
779 | _ => error "polyeq.sml: diff.behav. in - 2 + 1*x + x^2 = 0 -> [x = 1, x = - 2]";
781 val fmz = ["equality ( 2 + 1*x + x \<up> 2 = 0)", "solveFor x", "solutions L"];
782 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
783 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
784 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
785 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 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
788 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
789 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
790 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
791 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
792 "TODO 2 + 1*x + x \<up> 2 = 0";
793 "TODO 2 + 1*x + x \<up> 2 = 0";
794 "TODO 2 + 1*x + x \<up> 2 = 0";
797 val fmz = ["equality (- 2 + x + x \<up> 2 = 0)", "solveFor x", "solutions L"];
798 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
799 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
800 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
801 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
802 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
803 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
804 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
805 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
806 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
807 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
808 case f of Test_Out.FormKF "[x = 1, x = - 2]" => ()
809 | _ => error "polyeq.sml: diff.behav. in - 2 + x + x^2 = 0 -> [x = 1, x = - 2]";
811 val fmz = ["equality ( 2 + x + x \<up> 2 = 0)", "solveFor x", "solutions L"];
812 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
813 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
814 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
815 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
816 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
817 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
818 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
819 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
820 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
821 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
822 "TODO 2 + x + x \<up> 2 = 0";
823 "TODO 2 + x + x \<up> 2 = 0";
824 "TODO 2 + x + x \<up> 2 = 0";
827 val fmz = ["equality (-8 + 2*x \<up> 2 = 0)", "solveFor x", "solutions L"];
828 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
829 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
830 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
831 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
832 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
833 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
834 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
835 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
836 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
837 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
838 case f of Test_Out.FormKF "[x = 2, x = - 2]" => ()
839 | _ => error "polyeq.sml: diff.behav. in -8 + 2*x^2 = 0 -> [x = 2, x = - 2]";
841 val fmz = ["equality ( 8+ 2*x \<up> 2 = 0)", "solveFor x", "solutions L"];
842 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
843 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
844 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
845 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
846 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
847 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
848 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
849 val (p,_,f,nxt,_,pt) = me nxt p [] pt; 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 "TODO 8+ 2*x \<up> 2 = 0";
852 "TODO 8+ 2*x \<up> 2 = 0";
853 "TODO 8+ 2*x \<up> 2 = 0";
856 val fmz = ["equality (-4 + x \<up> 2 = 0)", "solveFor x", "solutions L"];
857 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"], ["PolyEq", "solve_d2_polyeq_abc_equation"]);
858 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
859 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
860 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
861 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
862 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
863 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
864 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
865 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
866 case f of Test_Out.FormKF "[x = 2, x = - 2]" => ()
867 | _ => error "polyeq.sml: diff.behav. in -4 + x^2 = 0 -> [x = 2, x = - 2]";
870 val fmz = ["equality ( 4+ x \<up> 2 = 0)", "solveFor x", "solutions L"];
871 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"], ["PolyEq", "solve_d2_polyeq_abc_equation"]);
872 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
873 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
874 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
875 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
876 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
877 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
878 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
879 "TODO 4+ x \<up> 2 = 0";
880 "TODO 4+ x \<up> 2 = 0";
881 "TODO 4+ x \<up> 2 = 0";
884 val fmz = ["equality (2*x + 2*x \<up> 2 = 0)", "solveFor x", "solutions L"];
885 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
886 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
887 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
888 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
889 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
890 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
891 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
892 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
893 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
894 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
895 case f of Test_Out.FormKF "[x = 0, x = - 1]" => ()
896 | _ => error "polyeq.sml: diff.behav. in x + x^2 = 0 -> [x = 0, x = - 1]";
898 val fmz = ["equality (1*x + x \<up> 2 = 0)", "solveFor x", "solutions L"];
899 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
900 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
901 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
902 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
903 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
904 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
905 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
906 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
907 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
908 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
909 case f of Test_Out.FormKF "[x = 0, x = - 1]" => ()
910 | _ => error "polyeq.sml: diff.behav. in x + x^2 = 0 -> [x = 0, x = - 1]";
913 val fmz = ["equality (x + 2*x \<up> 2 = 0)", "solveFor x", "solutions L"];
914 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
915 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
916 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
917 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
918 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
919 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
920 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
921 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
922 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
923 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
924 case f of Test_Out.FormKF "[x = 0, x = - 1 / 2]" => ()
925 | _ => error "polyeq.sml: diff.behav. in x + x^2 = 0 -> [x = 0, x = - 1 / 2]";
928 val fmz = ["equality (x + x \<up> 2 = 0)", "solveFor x", "solutions L"];
929 val (dI',pI',mI') = ("PolyEq",["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
930 ["PolyEq", "solve_d2_polyeq_abc_equation"]);
931 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
932 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
933 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
934 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
935 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
936 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
937 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
938 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
939 case f of Test_Out.FormKF "[x = 0, x = - 1]" => ()
940 | _ => error "polyeq.sml: diff.behav. in x + x^2 = 0 -> [x = 0, x = - 1]";
943 "----------- (-8 - 2*x + x \<up> 2 = 0), (*Schalk 2, S.67 Nr.31.b----";
944 "----------- (-8 - 2*x + x \<up> 2 = 0), (*Schalk 2, S.67 Nr.31.b----";
945 "----------- (-8 - 2*x + x \<up> 2 = 0), (*Schalk 2, S.67 Nr.31.b----";
946 (*stopped du to TODO.txt WN111014.TODO calculate_Poly < calculate_Rational < calculate_RootRat
947 see --- val rls = calculate_RootRat > calculate_Rational ---
948 calculate_RootRat was a TODO with 2002, requires re-design.
949 see also --- (-8 - 2*x + x \<up> 2 = 0), by rewriting --- below
951 val fmz = ["equality (-8 - 2*x + x \<up> 2 = 0)", (*Schalk 2, S.67 Nr.31.b*)
952 "solveFor x", "solutions L"];
954 ("PolyEq",["degree_2", "expanded", "univariate", "equation"],
955 ["PolyEq", "complete_square"]);
956 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
957 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
958 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
959 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
961 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
962 (*Apply_Method ("PolyEq", "complete_square")*)
963 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
964 (*"-8 - 2 * x + x \<up> 2 = 0", nxt = Rewrite_Set_Inst ... "complete_square*)
965 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
966 (*"-8 + (2 / 2 - x) \<up> 2 = (2 / 2) \<up> 2", nxt = Rewrite("square_explicit1"*)
967 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
968 (*"(2 / 2 - x) \<up> 2 = (2 / 2) \<up> 2 - -8" nxt = Rewrite("root_plus_minus*)
969 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
970 (*"2 / 2 - x = sqrt ((2 / 2) \<up> 2 - -8) |
971 2 / 2 - x = - sqrt ((2 / 2) \<up> 2 - -8)" nxt = Rewr_Inst("bdv_explicit2"*)
972 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
973 (*"2 / 2 - x = sqrt ((2 / 2) \<up> 2 - -8) |
974 - 1*x = - (2 / 2) + - sqrt ((2 / 2) \<up> 2 - -8)"nxt = R_Inst("bdv_explt2"*)
975 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
976 (*"- 1 * x = - (2 / 2) + sqrt ((2 / 2) \<up> 2 - -8) |
977 - 1 * x = (- (2 / 2) + - sqrt ((2 / 2) \<up> 2 - -8))"nxt = bdv_explicit3*)
978 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
979 (*"- 1 * x = - (2 / 2) + sqrt ((2 / 2) \<up> 2 - -8) |
980 x = - 1 * (- (2 / 2) + - sqrt ((2 / 2) \<up> 2 - -8))" nxt = bdv_explicit3*)
981 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
982 (*"x = - 1 * (- (2 / 2) + sqrt ((2 / 2) \<up> 2 - -8)) |
983 x = - 1 * (- (2 / 2) + - sqrt ((2 / 2) \<up> 2 - -8))"nxt = calculate_Rational
984 NOT IMPLEMENTED SINCE 2002 ------------------------------ \<up> \<up> \<up> \<up> \<up> \<up> *)
985 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
986 (*"x = - 2 | x = 4" nxt = Or_to_List*)
987 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
988 (*"[x = - 2, x = 4]" nxt = Check_Postcond*)
989 val (p,_,f,nxt,_,pt) = me nxt p [] pt; f2str f;
991 case f of Form' (Test_Out.FormKF (~1,EdUndef,0,Nundef,"[x = - 2, x = 4]")) => () TODO
992 | _ => error "polyeq.sml: diff.behav. in [x = - 2, x = 4]";
995 "[x = - 1 * - 1 + - 1 * sqrt (2 \<up> 2 / 2 \<up> 2 - -8),\n x = - 1 * - 1 + - 1 * (- 1 * sqrt (2 \<up> 2 / 2 \<up> 2 - -8))]"
996 (*"[x = - 1 * - 1 + - 1 * sqrt (1 \<up> 2 - -8),\n x = - 1 * - 1 + - 1 * (- 1 * sqrt (1 \<up> 2 - -8))]"*)
997 then () else error "polyeq.sml corrected?behav. in [x = - 2, x = 4]";
1000 "----------- (-8 - 2*x + x \<up> 2 = 0), by rewriting ---------------";
1001 "----------- (-8 - 2*x + x \<up> 2 = 0), by rewriting ---------------";
1002 "----------- (-8 - 2*x + x \<up> 2 = 0), by rewriting ---------------";
1003 (*stopped du to TODO.txt WN111014.TODO calculate_Poly < calculate_Rational < calculate_RootRat
1004 see --- val rls = calculate_RootRat > calculate_Rational ---*)
1005 val thy = @{theory PolyEq};
1006 val ctxt = Proof_Context.init_global thy;
1007 val inst = [((the o (parseNEW ctxt)) "bdv::real", (the o (parseNEW ctxt)) "x::real")];
1008 val t = (the o (parseNEW ctxt)) "-8 - 2*x + x \<up> 2 = (0::real)";
1010 val rls = complete_square;
1011 val SOME (t,asm) = rewrite_set_inst_ thy true inst rls t;
1012 UnparseC.term t = "-8 + (2 / 2 - x) \<up> 2 = (2 / 2) \<up> 2";
1014 val thm = ThmC.numerals_to_Free @{thm square_explicit1};
1015 val SOME (t,asm) = rewrite_ thy dummy_ord Rule_Set.Empty true thm t;
1016 UnparseC.term t = "(2 / 2 - x) \<up> 2 = (2 / 2) \<up> 2 - -8";
1018 val thm = ThmC.numerals_to_Free @{thm root_plus_minus};
1019 val SOME (t,asm) = rewrite_ thy dummy_ord PolyEq_erls true thm t;
1020 UnparseC.term t = "2 / 2 - x = sqrt ((2 / 2) \<up> 2 - -8) |"^
1021 "\n2 / 2 - x = - 1 * sqrt ((2 / 2) \<up> 2 - -8)";
1023 (*the thm bdv_explicit2* here required to be constrained to ::real*)
1024 val thm = ThmC.numerals_to_Free @{thm bdv_explicit2};
1025 val SOME (t,asm) = rewrite_inst_ thy dummy_ord Rule_Set.Empty true inst thm t;
1026 UnparseC.term t = "2 / 2 - x = sqrt ((2 / 2) \<up> 2 - -8) |"^
1027 "\n- 1 * x = - (2 / 2) + - 1 * sqrt ((2 / 2) \<up> 2 - -8)";
1029 val thm = ThmC.numerals_to_Free @{thm bdv_explicit3};
1030 val SOME (t,asm) = rewrite_inst_ thy dummy_ord Rule_Set.Empty true inst thm t;
1031 UnparseC.term t = "2 / 2 - x = sqrt ((2 / 2) \<up> 2 - -8) |"^
1032 "\nx = - 1 * (- (2 / 2) + - 1 * sqrt ((2 / 2) \<up> 2 - -8))";
1034 val thm = ThmC.numerals_to_Free @{thm bdv_explicit2};
1035 val SOME (t,asm) = rewrite_inst_ thy dummy_ord Rule_Set.Empty true inst thm t;
1036 UnparseC.term t = "- 1 * x = - (2 / 2) + sqrt ((2 / 2) \<up> 2 - -8) |"^
1037 "\nx = - 1 * (- (2 / 2) + - 1 * sqrt ((2 / 2) \<up> 2 - -8))";
1039 val rls = calculate_RootRat;
1040 val SOME (t,asm) = rewrite_set_ thy true rls t;
1041 if UnparseC.term t =
1042 "- 1 * x = - 1 + sqrt (2 \<up> 2 / 2 \<up> 2 - -8) \<or>\nx = - 1 * - 1 + - 1 * (- 1 * sqrt (2 \<up> 2 / 2 \<up> 2 - -8))"
1043 (*"- 1 * x = - 1 + sqrt (2 \<up> 2 / 2 \<up> 2 - -8) |\nx = - 1 * - 1 + - 1 * (- 1 * sqrt (2 \<up> 2 / 2 \<up> 2 - -8))"..isabisac15*)
1044 then () else error "(-8 - 2*x + x \<up> 2 = 0), by rewriting -- ERROR INDICATES IMPROVEMENT";
1045 (*SHOULD BE: UnparseC.term = "x = - 2 | x = 4;*)
1048 "-------------------- (3 - 10*x + 3*x \<up> 2 = 0), ----------------------";
1049 "-------------------- (3 - 10*x + 3*x \<up> 2 = 0), ----------------------";
1050 "-------------------- (3 - 10*x + 3*x \<up> 2 = 0), ----------------------";
1051 "---- test the erls ----";
1052 val t1 = (Thm.term_of o the o (TermC.parse thy)) "0 <= (10/3/2) \<up> 2 - 1";
1053 val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_erls t1;
1054 val t' = UnparseC.term t;
1055 (*if t'= \<^const_name>\<open>True\<close> then ()
1056 else error "polyeq.sml: diff.behav. in 'rewrite_set_.. PolyEq_erls";*)
1058 val fmz = ["equality (3 - 10*x + 3*x \<up> 2 = 0)",
1059 "solveFor x", "solutions L"];
1061 ("PolyEq",["degree_2", "expanded", "univariate", "equation"],
1062 ["PolyEq", "complete_square"]);
1063 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
1064 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1065 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1066 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1067 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1068 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1069 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1070 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1071 (*Apply_Method ("PolyEq", "complete_square")*)
1072 val (p,_,f,nxt,_,pt) = me nxt p [] pt; f2str f;
1074 "----------- (- 16 + 4*x + 2*x \<up> 2 = 0), --------------------------";
1075 "----------- (- 16 + 4*x + 2*x \<up> 2 = 0), --------------------------";
1076 "----------- (- 16 + 4*x + 2*x \<up> 2 = 0), --------------------------";
1077 val fmz = ["equality (- 16 + 4*x + 2*x \<up> 2 = 0)",
1078 "solveFor x", "solutions L"];
1080 ("PolyEq",["degree_2", "expanded", "univariate", "equation"],
1081 ["PolyEq", "complete_square"]);
1082 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
1083 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1084 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1085 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1086 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1087 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1088 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1089 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1090 (*Apply_Method ("PolyEq", "complete_square")*)
1091 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1092 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1093 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1094 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1095 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1096 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1097 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1098 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1099 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1100 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1102 case f of Form' (Test_Out.FormKF (~1,EdUndef,0,Nundef,"[x = 2, x = -4]")) => () TODO
1103 | _ => error "polyeq.sml: diff.behav. in [x = 2, x = -4]";