wneuper/isa: test/Tools/isac/Knowledge/polyeq.sml@dcc5d2601cf7 (annotated)

neuper@37906	1	(* testexamples for PolyEq, poynomial equations and equational systems
neuper@42248	2	author: Richard Lang 2003
neuper@37906	3	(c) due to copyright terms
neuper@37906	4	WN030609: some expls dont work due to unfinished handling of 'expanded terms';
neuper@37906	5	others marked with TODO have to be checked, too.
neuper@37906	6	*)
neuper@37906	7
neuper@37906	8	"-----------------------------------------------------------------";
neuper@37906	9	"table of contents -----------------------------------------------";
neuper@37906	10	(WN060608 some ----- are not in this table)
neuper@37906	11	"-----------------------------------------------------------------";
neuper@37906	12	"----------- tests on predicates in problems ---------------------";
neuper@37906	13	"----------- test matching problems --------------------------0---";
neuper@42248	14	"----------- lin.eq degree_0 -------------------------------------";
neuper@42248	15	"----------- test thm's d2_pq_formulsxx[_neg]---------------------";
neuper@37906	16	"----------- (-8 - 2x + x^^^2 = 0), (Schalk 2, S.67 Nr.31.b----";
neuper@37906	17	"----------- (-16 + 4x + 2x^^^2 = 0), --------------------------";
neuper@37906	18	"----------- (ab - (a+b)x + x^^^2 = 0), (Schalk 2,S.68Nr.44.a)";
neuper@37906	19	"----------- (-64 + x^^^2 = 0), (Schalk 2, S.66 Nr.1.a~--------)";
neuper@37906	20	"----------- (-147 + 3x^^^2 = 0), (Schalk 2, S.66 Nr.1.b------*)";
neuper@37906	21	"----------- (3x - 1 - (5x - (2 - 4x)) = -11),(Schalk Is86Bsp5";
neuper@37906	22	"----------- ((x+1)(x+2) - (3x - 2)^^^2=.. Schalk II s.68 Bsp 37";
neuper@37906	23	"----------- interSteps ([1],Res); on Schalk Is86Bsp5-------------";
neuper@37906	24	"-----------------------------------------------------------------";
neuper@37906	25	"-----------------------------------------------------------------";
neuper@37906	26	"-----------------------------------------------------------------";
neuper@37906	27
neuper@37906	28	"----------- tests on predicates in problems ---------------------";
neuper@37906	29	"----------- tests on predicates in problems ---------------------";
neuper@37906	30	"----------- tests on predicates in problems ---------------------";
neuper@37906	31	(*
neuper@37906	32	trace_rewrite:=true;
neuper@37906	33	trace_rewrite:=false;
neuper@37906	34	*)
neuper@37906	35	val t1 = (term_of o the o (parse thy)) "lhs (-8 - 2*x + x^^^2 = 0)";
neuper@42248	36	val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t1;
neuper@37906	37	if ((term2str t) = "-8 - 2 * x + x ^^^ 2") then ()
neuper@38031	38	else error "polyeq.sml: diff.behav. in lhs";
neuper@37906	39
neuper@37906	40	val t2 = (term_of o the o (parse thy)) "(-8 - 2*x + x^^^2) is_expanded_in x";
neuper@42248	41	val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t2;
neuper@42248	42	if (term2str t) = "True" then ()
neuper@38031	43	else error "polyeq.sml: diff.behav. 1 in is_expended_in";
neuper@37906	44
neuper@37906	45	val t0 = (term_of o the o (parse thy)) "(sqrt(x)) is_poly_in x";
neuper@42248	46	val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t0;
neuper@42248	47	if (term2str t) = "False" then ()
neuper@38031	48	else error "polyeq.sml: diff.behav. 2 in is_poly_in";
neuper@37906	49
neuper@37906	50	val t3 = (term_of o the o (parse thy)) "(-8 + (-1)2x + x^^^2) is_poly_in x";
neuper@42248	51	val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t3;
neuper@42248	52	if (term2str t) = "True" then ()
neuper@38031	53	else error "polyeq.sml: diff.behav. 3 in is_poly_in";
neuper@37906	54
neuper@37906	55	val t4 = (term_of o the o (parse thy)) "(lhs (-8 + (-1)2x + x^^^2 = 0)) is_expanded_in x";
neuper@42248	56	val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t4;
neuper@42248	57	if (term2str t) = "True" then ()
neuper@38031	58	else error "polyeq.sml: diff.behav. 4 in is_expended_in";
neuper@37906	59
neuper@37906	60
neuper@37906	61	val t6 = (term_of o the o (parse thy)) "(lhs (-8 - 2*x + x^^^2 = 0)) is_expanded_in x";
neuper@42248	62	val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t6;
neuper@42248	63	if (term2str t) = "True" then ()
neuper@38031	64	else error "polyeq.sml: diff.behav. 5 in is_expended_in";
neuper@37906	65
neuper@37906	66	val t3 = (term_of o the o (parse thy))"((-8 - 2*x + x^^^2) has_degree_in x) = 2";
neuper@42248	67	val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t3;
neuper@42248	68	if (term2str t) = "True" then ()
neuper@38031	69	else error "polyeq.sml: diff.behav. in has_degree_in_in";
neuper@37906	70
neuper@37906	71	val t3 = (term_of o the o (parse thy)) "((sqrt(x)) has_degree_in x) = 2";
neuper@42248	72	val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t3;
neuper@42248	73	if (term2str t) = "False" then ()
neuper@38031	74	else error "polyeq.sml: diff.behav. 6 in has_degree_in_in";
neuper@37906	75
neuper@37906	76	val t4 = (term_of o the o (parse thy))
neuper@37906	77	"((-8 - 2*x + x^^^2) has_degree_in x) = 1";
neuper@42248	78	val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t4;
neuper@42248	79	if (term2str t) = "False" then ()
neuper@38031	80	else error "polyeq.sml: diff.behav. 7 in has_degree_in_in";
neuper@37906	81
neuper@37906	82	val t5 = (term_of o the o (parse thy))
neuper@37906	83	"((-8 - 2*x + x^^^2) has_degree_in x) = 2";
neuper@42248	84	val SOME (t,_) = rewrite_set_ @{theory PolyEq} false PolyEq_prls t5;
neuper@42248	85	if (term2str t) = "True" then ()
neuper@38031	86	else error "polyeq.sml: diff.behav. 8 in has_degree_in_in";
neuper@37906	87
neuper@42248	88	"----------- test matching problems --------------------------0---";
neuper@42248	89	"----------- test matching problems --------------------------0---";
neuper@42248	90	"----------- test matching problems --------------------------0---";
neuper@42248	91	val fmz = ["equality (-8 - 2*x + x^^^2 = 0)", "solveFor x","solutions L"];
neuper@42248	92	if match_pbl fmz (get_pbt ["expanded","univariate","equation"]) =
neuper@42248	93	Matches' {Find = [Correct "solutions L"],
neuper@42248	94	With = [],
neuper@42248	95	Given = [Correct "equality (-8 - 2 * x + x ^^^ 2 = 0)", Correct "solveFor x"],
neuper@42248	96	Where = [Correct "matches (?a = 0) (-8 - 2 * x + x ^^^ 2 = 0)",
neuper@42248	97	Correct "lhs (-8 - 2 * x + x ^^^ 2 = 0) is_expanded_in x"],
neuper@42248	98	Relate = []}
neuper@42248	99	then () else error "match_pbl [expanded,univariate,equation]";
neuper@37906	100
neuper@42248	101	if match_pbl fmz (get_pbt ["degree_2","expanded","univariate","equation"]) =
neuper@42248	102	Matches' {Find = [Correct "solutions L"],
neuper@42248	103	With = [],
neuper@42248	104	Given = [Correct "equality (-8 - 2 * x + x ^^^ 2 = 0)", Correct "solveFor x"],
neuper@42248	105	Where = [Correct "lhs (-8 - 2 * x + x ^^^ 2 = 0) has_degree_in x = 2"],
neuper@42248	106	Relate = []} (before WN110906 was: has_degree_in x =!= 2"])
neuper@42248	107	then () else error "match_pbl [degree_2,expanded,univariate,equation]";
neuper@37906	108
neuper@42248	109	"----------- lin.eq degree_0 -------------------------------------";
neuper@42248	110	"----------- lin.eq degree_0 -------------------------------------";
neuper@42248	111	"----------- lin.eq degree_0 -------------------------------------";
neuper@37906	112	"----- d0_false ------";
neuper@42272	113	(*=== inhibit exn WN110914: declare_constraints doesnt work with num_str ========
neuper@42248	114	val fmz = ["equality (1 = (0::real))", "solveFor x", "solutions L"];
neuper@37991	115	val (dI',pI',mI') = ("PolyEq",["degree_0","polynomial","univariate","equation"],
neuper@37906	116	["PolyEq","solve_d0_polyeq_equation"]);
neuper@37906	117	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	118	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	119	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	120	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	121	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	122	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	123	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	124	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[]")) => ()
neuper@38031	125	\| _ => error "polyeq.sml: diff.behav. in 1 = 0 -> []";
neuper@37906	126
neuper@37906	127	"----- d0_true ------";
neuper@42248	128	val fmz = ["equality (0 = (0::real))", "solveFor x","solutions L"];
neuper@37991	129	val (dI',pI',mI') = ("PolyEq",["degree_0","polynomial","univariate","equation"],
neuper@37906	130	["PolyEq","solve_d0_polyeq_equation"]);
neuper@37906	131	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	132	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	133	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	134	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	135	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	136	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	137	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	138	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"UniversalList")) => ()
neuper@38031	139	\| _ => error "polyeq.sml: diff.behav. in 0 = 0 -> UniversalList";
neuper@42272	140	============ inhibit exn WN110914 ============================================*)
neuper@37906	141
neuper@42248	142	"----------- test thm's d2_pq_formulsxx[_neg]---------------------";
neuper@42248	143	"----------- test thm's d2_pq_formulsxx[_neg]---------------------";
neuper@42248	144	"----------- test thm's d2_pq_formulsxx[_neg]---------------------";
neuper@37906	145	"----- d2_pqformula1 ------!!!!";
neuper@42255	146	val fmz = ["equality (-1/8 + (-1/4)*z + z^^^2 = (0::real))", "solveFor z","solutions L"];
neuper@42255	147	val (dI',pI',mI') =
neuper@42255	148	("Isac", ["pqFormula","degree_2","polynomial","univariate","equation"], ["no_met"]);
neuper@37906	149	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42255	150	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42255	151	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42255	152	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42255	153	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42255	154	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42255	155	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42255	156	val (p,_,f,nxt,_,pt) = me nxt p [] pt; (Apply_Method ["PolyEq", "solve_d2_polyeq_pq_equation"])
neuper@42255	157	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42255	158	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42255	159	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42255	160	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42255	161	([z = 1 / 8 + sqrt (9 / 16) / 2, z = 1 / 8 + -1 sqrt (9 / 16) / 2] TODO sqrt*)
neuper@42255	162	val (p,_,f,nxt,_,pt) = me nxt p [] pt; (nxt =..,Check_elementwise "Assumptions"))
neuper@42255	163	"~~~~~ fun me, args:"; val ((_,tac), (p:pos'), _, (pt:ptree)) = (nxt, p, [], pt);
neuper@42255	164	"~~~~~ fun locatetac, args:"; val (tac, (ptp as (pt, p))) = (tac, (pt, p));
neuper@42255	165	val (mI,m) = mk_tac'_ tac;
neuper@42255	166	val Appl m = applicable_in p pt m;
neuper@42255	167	val Check_elementwise' (trm1, str, (trm2, trms)) = m;
neuper@42255	168	term2str trm1 = "[z = 1 / 8 + sqrt (9 / 16) / 2, z = 1 / 8 + -1 * sqrt (9 / 16) / 2]";
neuper@42255	169	str = "Assumptions";
neuper@42255	170	term2str trm2 = "[z = 1 / 8 + sqrt (9 / 16) / 2, z = 1 / 8 + -1 * sqrt (9 / 16) / 2]";
neuper@42255	171	terms2str trms = "[\"lhs (-1 / 8 + -1 * (1 / 8 + sqrt (9 / 16) / 2) / 4 +\n "^
neuper@42255	172	" (1 / 8 + sqrt (9 / 16) / 2) ^^^ 2 =\n 0) is_poly_in 1 / 8 + sqrt (9 / 16) / 2\","^
neuper@42255	173	"\"lhs (-1 / 8 + -1 * (1 / 8 + sqrt (9 / 16) / 2) / 4 +\n (1 / 8 + sqrt (9 / 16) / 2) ^^^ 2 =\n 0) "^
neuper@42255	174	"has_degree_in 1 / 8 + sqrt (9 / 16) / 2 =\n2\","^
neuper@42255	175	"\"lhs (-1 / 8 + -1 * (1 / 8 + -1 * sqrt (9 / 16) / 2) / 4 +\n (1 / 8 + -1 * sqrt (9 / 16) / 2) ^^^ 2 =\n 0) is_poly_in 1 / 8 + -1 * sqrt (9 / 16) / 2\","^
neuper@42255	176	"\"lhs (-1 / 8 + -1 * (1 / 8 + -1 * sqrt (9 / 16) / 2) / 4 +\n (1 / 8 + -1 * sqrt (9 / 16) / 2) ^^^ 2 =\n 0) has_degree_in 1 / 8 + -1 * sqrt (9 / 16) / 2 =\n2\"]";
neuper@42255	177	(TODO simplify assumptions (sqrt!) and check ERROR in has_degree_in);
neuper@42255	178	member op = specsteps mI (false);
neuper@42255	179	(*loc_solve_ (mI,m) ptp;
neuper@42255	180	WAS: not-found-in-script: NotLocatable from NasNap (Const ("List...*)
neuper@42255	181	"~~~~~ fun loc_solve_, args:"; val (m, (pt,pos)) = ((mI,m), ptp);
neuper@42255	182	(*solve m (pt, pos);
neuper@42255	183	WAS: not-found-in-script: NotLocatable from NasNap (Const ("List...*)
neuper@42255	184	"~~~~~ fun solve, args:"; val ((mI,m), (pt, po as (p,p_))) = (m, (pt, pos));
neuper@42255	185	e_metID = get_obj g_metID pt (par_pblobj pt p) (false);
neuper@42255	186	val thy' = get_obj g_domID pt (par_pblobj pt p);
neuper@42255	187	val (srls, is, sc) = from_pblobj_or_detail' thy' (p,p_) pt;
neuper@42255	188	val d = e_rls;
neuper@42255	189	(*locate_gen (thy',srls) m (pt,(p,p_)) (sc,d) is;
neuper@42255	190	WAS: not-found-in-script: NotLocatable from NasNap (Const ("List...*)
neuper@42255	191	"~~~~~ fun locate_gen, args:"; val ((ts as (thy',srls)), (m:tac_), ((pt,p):ptree * pos'),
neuper@42255	192	(scr as Script (h $ body),d), (ScrState (E,l,a,v,S,b), ctxt)) =
neuper@42255	193	((thy',srls), m ,(pt,(p,p_)) ,(sc,d) ,is); (* locate_gen 2nd pattern *)
neuper@42255	194	val thy = assoc_thy thy';
neuper@42255	195	l = [] orelse ((last_elem o fst) p = 0 andalso snd p = Res) (false);
neuper@42255	196	(*WAS val NasApp _ =(astep_up (thy',srls,scr,d) ((E,l,a,v,S,b), [(m,EmptyMout,pt,p,[])]) )
neuper@42255	197	... Assoc ... is correct*)
neuper@42255	198	"~~~~~ and astep_up, args:"; val ((ys as (_,_,Script sc,_)), ((E,l,a,v,S,b),ss)) =
neuper@42255	199	((thy',srls,scr,d), ((E,l,a,v,S,b), [(m,EmptyMout,pt,p,[])]));
neuper@42255	200	1 < length l (true);
neuper@42255	201	val up = drop_last l;
neuper@42255	202	term2str (go up sc);
neuper@42255	203	(go up sc);
neuper@42255	204	(*WAS val NasNap _ = ass_up ys ((E,up,a,v,S,b),ss) (go up sc)
neuper@42255	205	... ???? ... is correct*)
neuper@42255	206	"~~~~~ fun ass_up, args:"; val ((ys as (y,s,Script sc,d)), (is as (E,l,a,v,S,b),ss),
neuper@42255	207	(Const ("HOL.Let",_) $ _)) = (ys, ((E,up,a,v,S,b),ss), (go up sc));
neuper@42255	208	val l = drop_last l; (comes from e, goes to Abs)
neuper@42255	209	val (Const ("HOL.Let",_) $ e $ (Abs (i,T,body))) = go l sc;
neuper@42255	210	val i = mk_Free (i, T);
neuper@42255	211	val E = upd_env E (i, v);
neuper@42255	212	(Type error ...: Can't unify _a to pos pos_ (Incompatible types)*)
neuper@42255	213	val [(tac_, mout, ptree, pos', xxx)] = ss;
neuper@42255	214	val ss = [(tac_, mout, ptree, pos', []:(pos * pos_) list)];
neuper@42255	215	(*WAS val NasApp iss = assy (((y,s),d),Aundef) ((E, l@[R,D], a,v,S,b),ss) body
neuper@42255	216	... Assoc ... is correct*)
neuper@42255	217	"~~~~~ fun assy, args:"; val ((((thy',sr),d),ap), (is as (E,l,a,v,S,b), (m,_,pt,(p,p_),c)::ss), t) =
neuper@42255	218	((((y,s),d),Aundef), ((E, l@[R,D], a,v,S,b),ss), body);
neuper@42255	219	val (a', STac stac) = handle_leaf "locate" thy' sr E a v t
neuper@42255	220	val ctxt = get_ctxt pt (p,p_)
neuper@42255	221	val p' = lev_on p : pos;
neuper@42255	222	(* WAS val NotAss = assod pt d m stac
neuper@42255	223	... Ass ... is correct*)
neuper@42255	224	"~~~~~ fun assod, args:"; val (pt, _, (m as Check_elementwise' (consts,_,(consts_chkd,_))),
neuper@42255	225	(Const ("Script.Check'_elementwise",_) $ consts' $ _)) = (pt, d, m, stac);
neuper@42255	226	term2str consts;
neuper@42255	227	term2str consts';
neuper@42255	228	if consts = consts' (WAS false) then () else error "Check_elementwise changed";
neuper@42260	229	([z = 1 / 8 + sqrt (9 / 16) / 2, z = 1 / 8 + -1 sqrt (9 / 16) / 2] TODO sqrt*)
neuper@42272	230	*}
neuper@42272	231
neuper@42272	232
neuper@42272	233	ML {*
neuper@37906	234
neuper@37906	235	"----- d2_pqformula1_neg ------";
neuper@42272	236	val fmz = ["equality (2 +(-1)*x + x^^^2 = (0::real))", "solveFor x","solutions L"];
neuper@37991	237	val (dI',pI',mI') = ("PolyEq",["pqFormula","degree_2","polynomial","univariate","equation"], ["PolyEq","solve_d2_polyeq_pq_equation"]);
neuper@37906	238	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	239	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	240	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	241	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	242	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	243	*}
neuper@42272	244	ML {*
neuper@42272	245	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	246	(*### or2list False
neuper@37906	247	([1],Res) False Or_to_List)*)
neuper@42272	248	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	249	(*### or2list False
neuper@37906	250	([2],Res) [] Check_elementwise "Assumptions"*)
neuper@42272	251	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	252	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	253	val asm = get_assumptions_ pt p;
neuper@37906	254	if f = Form' (FormKF (~1,EdUndef,0,Nundef,"[]")) andalso asm = [] then ()
neuper@38031	255	else error "polyeq.sml: diff.behav. in 2 +(-1)*x + x^^^2 = 0";
neuper@42272	256	*}
neuper@42272	257	ML {*
neuper@37906	258
neuper@37906	259	"----- d2_pqformula2 ------";
neuper@37906	260	val fmz = ["equality (-2 +(-1)x + 1x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	261	val (dI',pI',mI') = ("PolyEq",["pqFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	262	["PolyEq","solve_d2_polyeq_pq_equation"]);
neuper@42272	263	(*val p = e_pos';
neuper@37906	264	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@42272	265	val (p,_,f,nxt,_,pt) = me (mI,m) p [] EmptyPtree;*)
neuper@37906	266	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	267	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	268	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	269	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	270	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	271	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	272	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	273	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	274	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	275	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 2, x = -1]")) => ()
neuper@38031	276	\| _ => error "polyeq.sml: diff.behav. in -2 + (-1)*x + x^2 = 0 -> [x = 2, x = -1]";
neuper@37906	277
neuper@37906	278
neuper@37906	279	"----- d2_pqformula2_neg ------";
neuper@37906	280	val fmz = ["equality ( 2 +(-1)x + 1x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	281	val (dI',pI',mI') = ("PolyEq",["pqFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	282	["PolyEq","solve_d2_polyeq_pq_equation"]);
neuper@37906	283	(*val p = e_pos'; val c = [];
neuper@37906	284	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	285	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	286	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	287	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	288	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	289	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	290	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	291	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	292	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	293	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	294	"TODO 2 +(-1)x + 1x^^^2 = 0";
neuper@37906	295	"TODO 2 +(-1)x + 1x^^^2 = 0";
neuper@37906	296	"TODO 2 +(-1)x + 1x^^^2 = 0";
neuper@37906	297
neuper@37906	298
neuper@37906	299	"----- d2_pqformula3 ------";
neuper@37906	300	(EP-9)
neuper@37906	301	val fmz = ["equality (-2 + x + x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	302	val (dI',pI',mI') = ("PolyEq",["pqFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	303	["PolyEq","solve_d2_polyeq_pq_equation"]);
neuper@37906	304	(*val p = e_pos'; val c = [];
neuper@37906	305	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	306	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	307	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	308	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	309	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	310	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	311	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	312	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	313	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	314	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	315	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	316	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 1, x = -2]")) => ()
neuper@38031	317	\| _ => error "polyeq.sml: diff.behav. in -2 + x + x^2 = 0-> [x = 1, x = -2]";
neuper@37906	318
neuper@37906	319	"----- d2_pqformula3_neg ------";
neuper@37906	320	val fmz = ["equality ( 2 + x + x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	321	val (dI',pI',mI') = ("PolyEq",["pqFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	322	["PolyEq","solve_d2_polyeq_pq_equation"]);
neuper@37906	323	(*val p = e_pos'; val c = [];
neuper@37906	324	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	325	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	326	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	327	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	328	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	329	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	330	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	331	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	332	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	333	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	334	"TODO 2 + x + x^^^2 = 0";
neuper@37906	335	"TODO 2 + x + x^^^2 = 0";
neuper@37906	336	"TODO 2 + x + x^^^2 = 0";
neuper@37906	337
neuper@37906	338
neuper@37906	339	"----- d2_pqformula4 ------";
neuper@37906	340	val fmz = ["equality (-2 + x + 1*x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	341	val (dI',pI',mI') = ("PolyEq",["pqFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	342	["PolyEq","solve_d2_polyeq_pq_equation"]);
neuper@37906	343	(*val p = e_pos'; val c = [];
neuper@37906	344	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	345	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	346	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	347	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	348	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	349	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	350	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	351	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	352	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	353	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	354	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	355	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 1, x = -2]")) => ()
neuper@38031	356	\| _ => error "polyeq.sml: diff.behav. in -2 + x + 1*x^^^2 = 0 -> [x = 1, x = -2]";
neuper@37906	357
neuper@37906	358	"----- d2_pqformula4_neg ------";
neuper@37906	359	val fmz = ["equality ( 2 + x + 1*x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	360	val (dI',pI',mI') = ("PolyEq",["pqFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	361	["PolyEq","solve_d2_polyeq_pq_equation"]);
neuper@37906	362	(*val p = e_pos'; val c = [];
neuper@37906	363	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	364	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	365	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	366	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	367	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	368	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	369	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	370	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	371	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	372	"TODO 2 + x + 1*x^^^2 = 0";
neuper@37906	373	"TODO 2 + x + 1*x^^^2 = 0";
neuper@37906	374	"TODO 2 + x + 1*x^^^2 = 0";
neuper@37906	375
neuper@37906	376	"----- d2_pqformula5 ------";
neuper@37906	377	val fmz = ["equality (1*x + x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	378	val (dI',pI',mI') = ("PolyEq",["pqFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	379	["PolyEq","solve_d2_polyeq_pq_equation"]);
neuper@37906	380	(*val p = e_pos'; val c = [];
neuper@37906	381	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	382	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	383	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	384	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	385	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	386	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	387	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	388	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	389	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	390	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	391	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	392	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 0, x = -1]")) => ()
neuper@38031	393	\| _ => error "polyeq.sml: diff.behav. in 1*x + x^2 = 0 -> [x = 0, x = -1]";
neuper@37906	394
neuper@37906	395	"----- d2_pqformula6 ------";
neuper@37906	396	val fmz = ["equality (1x + 1x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	397	val (dI',pI',mI') = ("PolyEq",["pqFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	398	["PolyEq","solve_d2_polyeq_pq_equation"]);
neuper@37906	399	(*val p = e_pos'; val c = [];
neuper@37906	400	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	401	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	402	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	403	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	404	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	405	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	406	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	407	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	408	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	409	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	410	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	411	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 0, x = -1]")) => ()
neuper@38031	412	\| _ => error "polyeq.sml: diff.behav. in 1x + 1x^2 = 0 -> [x = 0, x = -1]";
neuper@37906	413
neuper@37906	414	"----- d2_pqformula7 ------";
neuper@37906	415	(EP-10)
neuper@37906	416	val fmz = ["equality ( x + x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	417	val (dI',pI',mI') = ("PolyEq",["pqFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	418	["PolyEq","solve_d2_polyeq_pq_equation"]);
neuper@37906	419	(*val p = e_pos'; val c = [];
neuper@37906	420	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	421	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	422	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	423	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	424	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	425	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	426	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	427	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	428	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	429	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	430	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	431	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 0, x = -1]")) => ()
neuper@38031	432	\| _ => error "polyeq.sml: diff.behav. in x + x^2 = 0 -> [x = 0, x = -1]";
neuper@37906	433
neuper@37906	434	"----- d2_pqformula8 ------";
neuper@37906	435	val fmz = ["equality ( x + 1*x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	436	val (dI',pI',mI') = ("PolyEq",["pqFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	437	["PolyEq","solve_d2_polyeq_pq_equation"]);
neuper@37906	438	(*val p = e_pos'; val c = [];
neuper@37906	439	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	440	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	441
neuper@37906	442	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	443	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	444	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	445	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	446	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	447	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	448	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	449	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	450	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	451	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 0, x = -1]")) => ()
neuper@38031	452	\| _ => error "polyeq.sml: diff.behav. in x + 1*x^2 = 0 -> [x = 0, x = -1]";
neuper@37906	453
neuper@37906	454	"----- d2_pqformula9 ------";
neuper@37906	455	val fmz = ["equality (-4 + x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	456	val (dI',pI',mI') = ("PolyEq",["pqFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	457	["PolyEq","solve_d2_polyeq_pq_equation"]);
neuper@37906	458	(*val p = e_pos'; val c = [];
neuper@37906	459	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	460	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	461
neuper@37906	462	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	463	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	464	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	465	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	466	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	467	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	468	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	469	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	470	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 2, x = -2]")) => ()
neuper@38031	471	\| _ => error "polyeq.sml: diff.behav. in -4 + x^2 = 0 -> [x = 2, x = -2]";
neuper@37906	472
neuper@37906	473
neuper@37906	474	"----- d2_pqformula10_neg ------";
neuper@37906	475	val fmz = ["equality (4 + x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	476	val (dI',pI',mI') = ("PolyEq",["pqFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	477	["PolyEq","solve_d2_polyeq_pq_equation"]);
neuper@37906	478	(*val p = e_pos'; val c = [];
neuper@37906	479	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	480	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	481
neuper@37906	482	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	483	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	484	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	485	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	486	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	487	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	488	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	489	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	490	"TODO 4 + x^^^2 = 0";
neuper@37906	491	"TODO 4 + x^^^2 = 0";
neuper@37906	492	"TODO 4 + x^^^2 = 0";
neuper@37906	493
neuper@37906	494	"----- d2_pqformula10 ------";
neuper@37906	495	val fmz = ["equality (-4 + 1*x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	496	val (dI',pI',mI') = ("PolyEq",["pqFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	497	["PolyEq","solve_d2_polyeq_pq_equation"]);
neuper@37906	498	(*val p = e_pos'; val c = [];
neuper@37906	499	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	500	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	501
neuper@37906	502	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	503	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	504	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	505	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	506	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	507	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	508	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	509	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	510	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 2, x = -2]")) => ()
neuper@38031	511	\| _ => error "polyeq.sml: diff.behav. in -4 + 1*x^2 = 0 -> [x = 2, x = -2]";
neuper@37906	512
neuper@37906	513	"----- d2_pqformula9_neg ------";
neuper@37906	514	val fmz = ["equality (4 + 1*x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	515	val (dI',pI',mI') = ("PolyEq",["pqFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	516	["PolyEq","solve_d2_polyeq_pq_equation"]);
neuper@37906	517	(*val p = e_pos'; val c = [];
neuper@37906	518	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	519	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	520
neuper@37906	521	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	522	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	523	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	524	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	525	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	526	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	527	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	528	"TODO 4 + 1*x^^^2 = 0";
neuper@37906	529	"TODO 4 + 1*x^^^2 = 0";
neuper@37906	530	"TODO 4 + 1*x^^^2 = 0";
neuper@37906	531
neuper@37906	532	"-------------------- test thm's d2_abc_formulsxx[_neg]-----";
neuper@37906	533	"-------------------- test thm's d2_abc_formulsxx[_neg]-----";
neuper@37906	534	"-------------------- test thm's d2_abc_formulsxx[_neg]-----";
neuper@37906	535
neuper@37906	536	val fmz = ["equality (-1 +(-1)x + 2x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	537	val (dI',pI',mI') = ("PolyEq",["abcFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	538	["PolyEq","solve_d2_polyeq_abc_equation"]);
neuper@37906	539	(*val p = e_pos'; val c = [];
neuper@37906	540	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	541	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	542
neuper@37906	543	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	544	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	545	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	546	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	547	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	548	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	549	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	550	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	551	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 1, x = -1 / 2]")) => ()
neuper@38031	552	\| _ => error "polyeq.sml: diff.behav. in -1 + (-1)x + 2x^2 = 0 -> [x = 1, x = -1/2]";
neuper@37906	553
neuper@37906	554	val fmz = ["equality ( 1 +(-1)x + 2x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	555	val (dI',pI',mI') = ("PolyEq",["abcFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	556	["PolyEq","solve_d2_polyeq_abc_equation"]);
neuper@37906	557	(*val p = e_pos'; val c = [];
neuper@37906	558	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	559	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	560
neuper@37906	561	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	562	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	563	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	564	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	565	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	566	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	567	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	568	"TODO 1 +(-1)x + 2x^^^2 = 0";
neuper@37906	569	"TODO 1 +(-1)x + 2x^^^2 = 0";
neuper@37906	570	"TODO 1 +(-1)x + 2x^^^2 = 0";
neuper@37906	571
neuper@37906	572	(EP-11)
neuper@37906	573	val fmz = ["equality (-1 + x + 2*x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	574	val (dI',pI',mI') = ("PolyEq",["abcFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	575	["PolyEq","solve_d2_polyeq_abc_equation"]);
neuper@37906	576	(*val p = e_pos'; val c = [];
neuper@37906	577	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	578	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	579
neuper@37906	580	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	581	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	582	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	583	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	584	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	585	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	586	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	587	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	588	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 1 / 2, x = -1]")) => ()
neuper@38031	589	\| _ => error "polyeq.sml: diff.behav. in -1 + x + 2*x^2 = 0 -> [x = 1/2, x = -1]";
neuper@37906	590
neuper@37906	591	val fmz = ["equality ( 1 + x + 2*x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	592	val (dI',pI',mI') = ("PolyEq",["abcFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	593	["PolyEq","solve_d2_polyeq_abc_equation"]);
neuper@37906	594	(*val p = e_pos'; val c = [];
neuper@37906	595	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	596	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	597
neuper@37906	598	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	599	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	600	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	601	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	602	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	603	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	604	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	605	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	606	"TODO 1 + x + 2*x^^^2 = 0";
neuper@37906	607	"TODO 1 + x + 2*x^^^2 = 0";
neuper@37906	608	"TODO 1 + x + 2*x^^^2 = 0";
neuper@37906	609
neuper@37906	610	val fmz = ["equality (-2 + 1*x + x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	611	val (dI',pI',mI') = ("PolyEq",["abcFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	612	["PolyEq","solve_d2_polyeq_abc_equation"]);
neuper@37906	613	(*val p = e_pos'; val c = [];
neuper@37906	614	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	615	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	616
neuper@37906	617	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	618	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	619	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	620	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	621	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	622	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	623	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	624	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	625	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 1, x = -2]")) => ()
neuper@38031	626	\| _ => error "polyeq.sml: diff.behav. in -2 + 1*x + x^2 = 0 -> [x = 1, x = -2]";
neuper@37906	627
neuper@37906	628	val fmz = ["equality ( 2 + 1*x + x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	629	val (dI',pI',mI') = ("PolyEq",["abcFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	630	["PolyEq","solve_d2_polyeq_abc_equation"]);
neuper@37906	631	(*val p = e_pos'; val c = [];
neuper@37906	632	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	633	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	634
neuper@37906	635	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	636	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	637	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	638	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	639	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	640	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	641	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	642	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	643	"TODO 2 + 1*x + x^^^2 = 0";
neuper@37906	644	"TODO 2 + 1*x + x^^^2 = 0";
neuper@37906	645	"TODO 2 + 1*x + x^^^2 = 0";
neuper@37906	646
neuper@37906	647	(EP-12)
neuper@37906	648	val fmz = ["equality (-2 + x + x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	649	val (dI',pI',mI') = ("PolyEq",["abcFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	650	["PolyEq","solve_d2_polyeq_abc_equation"]);
neuper@37906	651	(*val p = e_pos'; val c = [];
neuper@37906	652	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	653	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	654
neuper@37906	655	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	656	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	657	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	658	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	659	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	660	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	661	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	662	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	663	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 1, x = -2]")) => ()
neuper@38031	664	\| _ => error "polyeq.sml: diff.behav. in -2 + x + x^2 = 0 -> [x = 1, x = -2]";
neuper@37906	665
neuper@37906	666	val fmz = ["equality ( 2 + x + x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	667	val (dI',pI',mI') = ("PolyEq",["abcFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	668	["PolyEq","solve_d2_polyeq_abc_equation"]);
neuper@37906	669	(*val p = e_pos'; val c = [];
neuper@37906	670	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	671	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	672
neuper@37906	673	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	674	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	675	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	676	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	677	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	678	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	679	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	680	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	681	"TODO 2 + x + x^^^2 = 0";
neuper@37906	682	"TODO 2 + x + x^^^2 = 0";
neuper@37906	683	"TODO 2 + x + x^^^2 = 0";
neuper@37906	684
neuper@37906	685	(EP-13)
neuper@37906	686	val fmz = ["equality (-8 + 2*x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	687	val (dI',pI',mI') = ("PolyEq",["abcFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	688	["PolyEq","solve_d2_polyeq_abc_equation"]);
neuper@37906	689	(*val p = e_pos'; val c = [];
neuper@37906	690	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	691	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	692
neuper@37906	693	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	694	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	695	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	696	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	697	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	698	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	699	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	700	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	701	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 2, x = -2]")) => ()
neuper@38031	702	\| _ => error "polyeq.sml: diff.behav. in -8 + 2*x^2 = 0 -> [x = 2, x = -2]";
neuper@37906	703
neuper@37906	704	val fmz = ["equality ( 8+ 2*x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	705	val (dI',pI',mI') = ("PolyEq",["abcFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	706	["PolyEq","solve_d2_polyeq_abc_equation"]);
neuper@37906	707	(*val p = e_pos'; val c = [];
neuper@37906	708	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	709	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	710
neuper@37906	711	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	712	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	713	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	714	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	715	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	716	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	717	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	718	"TODO 8+ 2*x^^^2 = 0";
neuper@37906	719	"TODO 8+ 2*x^^^2 = 0";
neuper@37906	720	"TODO 8+ 2*x^^^2 = 0";
neuper@37906	721
neuper@37906	722	(EP-14)
neuper@37906	723	val fmz = ["equality (-4 + x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	724	val (dI',pI',mI') = ("PolyEq",["abcFormula","degree_2","polynomial","univariate","equation"], ["PolyEq","solve_d2_polyeq_abc_equation"]);
neuper@37906	725	(*val p = e_pos'; val c = [];
neuper@37906	726	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	727	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	728
neuper@37906	729	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	730	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	731	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	732	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	733	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	734	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	735	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	736	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	737	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 2, x = -2]")) => ()
neuper@38031	738	\| _ => error "polyeq.sml: diff.behav. in -4 + x^2 = 0 -> [x = 2, x = -2]";
neuper@37906	739
neuper@37906	740
neuper@37906	741	val fmz = ["equality ( 4+ x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	742	val (dI',pI',mI') = ("PolyEq",["abcFormula","degree_2","polynomial","univariate","equation"], ["PolyEq","solve_d2_polyeq_abc_equation"]);
neuper@37906	743	(*val p = e_pos'; val c = [];
neuper@37906	744	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	745	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	746
neuper@37906	747	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	748	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	749	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	750	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	751	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	752	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	753	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	754	"TODO 4+ x^^^2 = 0";
neuper@37906	755	"TODO 4+ x^^^2 = 0";
neuper@37906	756	"TODO 4+ x^^^2 = 0";
neuper@37906	757
neuper@37906	758	(EP-15)
neuper@37906	759	val fmz = ["equality (2x + 2x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	760	val (dI',pI',mI') = ("PolyEq",["abcFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	761	["PolyEq","solve_d2_polyeq_abc_equation"]);
neuper@37906	762	(*val p = e_pos'; val c = [];
neuper@37906	763	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	764	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	765
neuper@37906	766	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	767	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	768	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	769	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	770	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	771	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	772	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	773	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	774	case f of Form' (FormKF (~1,EdUndef,_,Nundef,"[x = 0, x = -1]")) => ()
neuper@38031	775	\| _ => error "polyeq.sml: diff.behav. in x + x^2 = 0 -> [x = 0, x = -1]";
neuper@37906	776
neuper@37906	777	val fmz = ["equality (1*x + x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	778	val (dI',pI',mI') = ("PolyEq",["abcFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	779	["PolyEq","solve_d2_polyeq_abc_equation"]);
neuper@37906	780	(*val p = e_pos'; val c = [];
neuper@37906	781	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	782	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	783
neuper@37906	784	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	785	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	786	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	787	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	788	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	789	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	790	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	791	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	792	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 0, x = -1]")) => ()
neuper@38031	793	\| _ => error "polyeq.sml: diff.behav. in x + x^2 = 0 -> [x = 0, x = -1]";
neuper@37906	794
neuper@37906	795	(EP-16)
neuper@37906	796	val fmz = ["equality (x + 2*x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	797	val (dI',pI',mI') = ("PolyEq",["abcFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	798	["PolyEq","solve_d2_polyeq_abc_equation"]);
neuper@37906	799	(*val p = e_pos'; val c = [];
neuper@37906	800	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	801	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	802
neuper@37906	803	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	804	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	805	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	806	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	807	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	808	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	809	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	810	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	811	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 0, x = -1 / 2]")) => ()
neuper@38031	812	\| _ => error "polyeq.sml: diff.behav. in x + x^2 = 0 -> [x = 0, x = -1 / 2]";
neuper@37906	813
neuper@37906	814	(EP-//)
neuper@37906	815	val fmz = ["equality (x + x^^^2 = 0)", "solveFor x","solutions L"];
neuper@37991	816	val (dI',pI',mI') = ("PolyEq",["abcFormula","degree_2","polynomial","univariate","equation"],
neuper@37906	817	["PolyEq","solve_d2_polyeq_abc_equation"]);
neuper@37906	818	(*val p = e_pos'; val c = [];
neuper@37906	819	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	820	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	821
neuper@37906	822	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	823	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	824	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	825	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	826	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	827	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	828	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	829	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	830	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 0, x = -1]")) => ()
neuper@38031	831	\| _ => error "polyeq.sml: diff.behav. in x + x^2 = 0 -> [x = 0, x = -1]";
neuper@37906	832
neuper@37906	833	"----------- (-8 - 2x + x^^^2 = 0), (Schalk 2, S.67 Nr.31.b----";
neuper@37906	834	"----------- (-8 - 2x + x^^^2 = 0), (Schalk 2, S.67 Nr.31.b----";
neuper@37906	835	"----------- (-8 - 2x + x^^^2 = 0), (Schalk 2, S.67 Nr.31.b----";
neuper@37906	836	val fmz = ["equality (-8 - 2x + x^^^2 = 0)", (Schalk 2, S.67 Nr.31.b*)
neuper@37906	837	"solveFor x","solutions L"];
neuper@37906	838	val (dI',pI',mI') =
neuper@37991	839	("PolyEq",["degree_2","expanded","univariate","equation"],
neuper@37906	840	["PolyEq","complete_square"]);
neuper@37906	841	(* val p = e_pos'; val c = [];
neuper@37906	842	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	843	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	844
neuper@37906	845	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	846	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	847	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	848	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	849	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37991	850	(Apply_Method ("PolyEq","complete_square"))
neuper@42272	851	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	852	("-8 - 2 x + x ^^^ 2 = 0", nxt = Rewrite_Set_Inst ... "complete_square*)
neuper@42272	853	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	854	("-8 + (2 / 2 - x) ^^^ 2 = (2 / 2) ^^^ 2", nxt = Rewrite("square_explicit1")
neuper@42272	855	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	856	("(2 / 2 - x) ^^^ 2 = (2 / 2) ^^^ 2 - -8" nxt = Rewrite("root_plus_minus)
neuper@42272	857	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	858	(*"2 / 2 - x = sqrt ((2 / 2) ^^^ 2 - -8) \|
neuper@37906	859	2 / 2 - x = - sqrt ((2 / 2) ^^^ 2 - -8)" nxt = Rewr_Inst("bdv_explicit2"*)
neuper@42272	860	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	861	(*"2 / 2 - x = sqrt ((2 / 2) ^^^ 2 - -8) \|
neuper@37906	862	-1x = - (2 / 2) + - sqrt ((2 / 2) ^^^ 2 - -8)"nxt = R_Inst("bdv_explt2")
neuper@42272	863	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	864	("-1 x = - (2 / 2) + sqrt ((2 / 2) ^^^ 2 - -8) \|
neuper@37906	865	-1 * x = (- (2 / 2) + - sqrt ((2 / 2) ^^^ 2 - -8))"nxt = bdv_explicit3*)
neuper@42272	866	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	867	("-1 x = - (2 / 2) + sqrt ((2 / 2) ^^^ 2 - -8) \|
neuper@37906	868	x = -1 * (- (2 / 2) + - sqrt ((2 / 2) ^^^ 2 - -8))" nxt = bdv_explicit3*)
neuper@42272	869	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	870	("x = -1 (- (2 / 2) + sqrt ((2 / 2) ^^^ 2 - -8)) \|
neuper@37906	871	x = -1 * (- (2 / 2) + - sqrt ((2 / 2) ^^^ 2 - -8))"nxt = calculate_Ration*)
neuper@42272	872	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	873	("x = -2 \| x = 4" nxt = Or_to_List)
neuper@42272	874	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	875	("[x = -2, x = 4]" nxt = Check_Postcond)
neuper@42272	876	val (p,_,f,nxt,_,pt) = me nxt p [] pt; f2str f;
neuper@37906	877	(* FIXXXME
neuper@37906	878	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = -2, x = 4]")) => () TODO
neuper@38031	879	\| _ => error "polyeq.sml: diff.behav. in [x = -2, x = 4]";
neuper@37906	880	*)
neuper@37906	881	if f2str f = "[x = -1 * -1 + -1 * sqrt (1 ^^^ 2 - -8),\n x = -1 * -1 + -1 * (-1 * sqrt (1 ^^^ 2 - -8))]" then ()
neuper@38031	882	else error "polyeq.sml corrected?behav. in [x = -2, x = 4]";
neuper@37906	883
neuper@37906	884
neuper@37906	885	"-------------------- (3 - 10x + 3x^^^2 = 0), ----------------------";
neuper@37906	886	"-------------------- (3 - 10x + 3x^^^2 = 0), ----------------------";
neuper@37906	887	"-------------------- (3 - 10x + 3x^^^2 = 0), ----------------------";
neuper@37906	888	"---- test the erls ----";
neuper@37906	889	val t1 = (term_of o the o (parse thy)) "0 <= (10/3/2)^^^2 - 1";
neuper@37926	890	val SOME (t,_) = rewrite_set_ PolyEq.thy false PolyEq_erls t1;
neuper@37906	891	val t' = term2str t;
neuper@41928	892	(*if t'= "HOL.True" then ()
neuper@38031	893	else error "polyeq.sml: diff.behav. in 'rewrite_set_.. PolyEq_erls";*)
neuper@37906	894	(* *)
neuper@37906	895	val fmz = ["equality (3 - 10x + 3x^^^2 = 0)",
neuper@37906	896	"solveFor x","solutions L"];
neuper@37906	897	val (dI',pI',mI') =
neuper@37991	898	("PolyEq",["degree_2","expanded","univariate","equation"],
neuper@37906	899	["PolyEq","complete_square"]);
neuper@37906	900	(* val p = e_pos'; val c = [];
neuper@37906	901	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	902	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	903
neuper@37906	904	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	905	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	906	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	907	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	908	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	909	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	910	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	911	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37991	912	(Apply_Method ("PolyEq","complete_square"))
neuper@42272	913	val (p,_,f,nxt,_,pt) = me nxt p [] pt; f2str f;
neuper@37906	914
neuper@37906	915	"----------- (-16 + 4x + 2x^^^2 = 0), --------------------------";
neuper@37906	916	"----------- (-16 + 4x + 2x^^^2 = 0), --------------------------";
neuper@37906	917	"----------- (-16 + 4x + 2x^^^2 = 0), --------------------------";
neuper@37906	918	val fmz = ["equality (-16 + 4x + 2x^^^2 = 0)",
neuper@37906	919	"solveFor x","solutions L"];
neuper@37906	920	val (dI',pI',mI') =
neuper@37991	921	("PolyEq",["degree_2","expanded","univariate","equation"],
neuper@37906	922	["PolyEq","complete_square"]);
neuper@37906	923	(* val p = e_pos'; val c = [];
neuper@37906	924	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	925	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	926
neuper@37906	927	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	928	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	929	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	930	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	931	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	932	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	933	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	934	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37991	935	(Apply_Method ("PolyEq","complete_square"))
neuper@42272	936	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	937	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	938	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	939	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	940	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	941	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	942	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	943	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	944	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	945	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	946	(* FIXXXXME n1.,
neuper@37906	947	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 2, x = -4]")) => () TODO
neuper@38031	948	\| _ => error "polyeq.sml: diff.behav. in [x = 2, x = -4]";
neuper@37906	949	*)
neuper@37906	950
neuper@37906	951	"----------- (ab - (a+b)x + x^^^2 = 0), (Schalk 2,S.68Nr.44.a)";
neuper@37906	952	"----------- (ab - (a+b)x + x^^^2 = 0), (Schalk 2,S.68Nr.44.a)";
neuper@37906	953	"----------- (ab - (a+b)x + x^^^2 = 0), (Schalk 2,S.68Nr.44.a)";
neuper@37906	954	val fmz = ["equality (ab - (a+b)x + x^^^2 = 0)",
neuper@37906	955	"solveFor x","solutions L"];
neuper@37906	956	val (dI',pI',mI') =
neuper@37991	957	("PolyEq",["degree_2","expanded","univariate","equation"],
neuper@37906	958	["PolyEq","complete_square"]);
neuper@37906	959	(* val p = e_pos'; val c = [];
neuper@37906	960	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	961	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	962
neuper@37906	963	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	964	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	965	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	966	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	967	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	968	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	969	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	970	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	971	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	972	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	973	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	974
neuper@42272	975	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	976	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	977	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	978	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	979	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	980	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	981	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	982	val (p,_,f,nxt,_,pt) = me nxt p [] pt; f2str f;
neuper@37906	983	(*WN.2.5.03 TODO FIXME Matthias ?
neuper@37906	984	case f of
neuper@37906	985	Form'
neuper@37906	986	(FormKF
neuper@37906	987	(~1,EdUndef,0,Nundef,
neuper@37906	988	"[x = (a + b) / 2 + -1 * sqrt ((a + b) ^^^ 2 / 2 ^^^ 2 - a * b),\n x = (a + b) / 2 + sqrt ((a + b) ^^^ 2 / 2 ^^^ 2 - a * b)]"))
neuper@37906	989	=> ()
neuper@38031	990	\| _ => error "polyeq.sml: diff.behav. in ab - (a+b)x + x^^^2 = 0";
neuper@37906	991	this will be simplified [x = a, x = b] to by Factor.ML*)
neuper@37906	992
neuper@37906	993
neuper@37906	994	"----------- (-64 + x^^^2 = 0), (Schalk 2, S.66 Nr.1.a~--------)";
neuper@37906	995	"----------- (-64 + x^^^2 = 0), (Schalk 2, S.66 Nr.1.a~--------)";
neuper@37906	996	"----------- (-64 + x^^^2 = 0), (Schalk 2, S.66 Nr.1.a~--------)";
neuper@37906	997	val fmz = ["equality (-64 + x^^^2 = 0)",(Schalk 2, S.66 Nr.1.a~)
neuper@37906	998	"solveFor x","solutions L"];
neuper@37906	999	val (dI',pI',mI') =
neuper@37991	1000	("PolyEq",["degree_2","expanded","univariate","equation"],
neuper@37906	1001	["PolyEq","complete_square"]);
neuper@37906	1002	(* val p = e_pos'; val c = [];
neuper@37906	1003	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	1004	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	1005
neuper@37906	1006	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	1007	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1008	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1009	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1010	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1011	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1012	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1013	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1014	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1015	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1016	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1017	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1018	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1019	val (p,_,f,nxt,_,pt) = me nxt p [] pt; f2str f;
neuper@37906	1020	(WN.2.5.03 TODO "[x = sqrt (0 - -64), x = -1 sqrt (0 - -64)]"
neuper@37906	1021	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 8, x = -8]")) => ()
neuper@38031	1022	\| _ => error "polyeq.sml: diff.behav. in [x = 8, x = -8]";
neuper@37906	1023	*)
neuper@37906	1024
neuper@37906	1025	"----------- (-147 + 3x^^^2 = 0), (Schalk 2, S.66 Nr.1.b------*)";
neuper@37906	1026	"----------- (-147 + 3x^^^2 = 0), (Schalk 2, S.66 Nr.1.b------*)";
neuper@37906	1027	"----------- (-147 + 3x^^^2 = 0), (Schalk 2, S.66 Nr.1.b------*)";
neuper@37906	1028	val fmz = ["equality (-147 + 3x^^^2 = 0)",(Schalk 2, S.66 Nr.1.b*)
neuper@37906	1029	"solveFor x","solutions L"];
neuper@37906	1030	val (dI',pI',mI') =
neuper@37991	1031	("PolyEq",["degree_2","expanded","univariate","equation"],
neuper@37906	1032	["PolyEq","complete_square"]);
neuper@37906	1033	(* val p = e_pos'; val c = [];
neuper@37906	1034	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	1035	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	1036
neuper@37906	1037	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@42272	1038	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1039	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1040	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1041	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1042	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1043	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1044	val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@42272	1045	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	1046	(WN.2.5.03 TODO "[x = sqrt (0 - -49), x = -1 sqrt (0 - -49)]"
neuper@37906	1047	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 7, x = -7]")) => ()
neuper@38031	1048	\| _ => error "polyeq.sml: diff.behav. in [x = 7, x = -7]";
neuper@37906	1049	*)
neuper@37906	1050	if f2str f = "[x = sqrt (0 - -49), x = -1 * sqrt (0 - -49)]" then ()
neuper@38031	1051	else error "polyeq.sml CORRECTED?behav. in [x = 7, x = -7]";
neuper@37906	1052
neuper@37906	1053
neuper@37906	1054	"----------- (3x - 1 - (5x - (2 - 4x)) = -11),(Schalk Is86Bsp5";
neuper@37906	1055	"----------- (3x - 1 - (5x - (2 - 4x)) = -11),(Schalk Is86Bsp5";
neuper@37906	1056	"----------- (3x - 1 - (5x - (2 - 4x)) = -11),(Schalk Is86Bsp5";
neuper@37906	1057	(EP-17 Schalk_I_p86_n5)
neuper@37906	1058	val fmz = ["equality (3x - 1 - (5x - (2 - 4*x)) = -11)","solveFor x","solutions L"];
neuper@37906	1059	(* refine fmz ["univariate","equation"];
neuper@37906	1060	*)
neuper@37991	1061	val (dI',pI',mI') = ("PolyEq",["univariate","equation"],["no_met"]);
neuper@37906	1062	(*val p = e_pos';
neuper@37906	1063	val c = [];
neuper@37906	1064	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	1065	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	1066
neuper@37906	1067	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@37906	1068	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1069	(* val nxt =
neuper@37906	1070	("Model_Problem",
neuper@37906	1071	Model_Problem ["normalize","polynomial","univariate","equation"])
neuper@37906	1072	: string * tac*)
neuper@37906	1073	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1074	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1075	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1076	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1077	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1078	(* val nxt =
neuper@37906	1079	("Subproblem",
neuper@37991	1080	Subproblem ("PolyEq",["polynomial","univariate","equation"]))
neuper@37906	1081	: string * tac *)
neuper@37906	1082	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1083	(*val nxt =
neuper@37906	1084	("Model_Problem",
neuper@37906	1085	Model_Problem ["degree_1","polynomial","univariate","equation"])
neuper@37906	1086	: string * tac *)
neuper@37906	1087	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1088	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1089
neuper@37906	1090	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1091	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1092	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1093	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1094	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1095	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 2]")) => ()
neuper@38031	1096	\| _ => error "polyeq.sml: diff.behav. in [x = 2]";
neuper@37906	1097
neuper@37906	1098
neuper@37906	1099	"----------- ((x+1)(x+2) - (3x - 2)^^^2=.. Schalk II s.68 Bsp 37";
neuper@37906	1100	"----------- ((x+1)(x+2) - (3x - 2)^^^2=.. Schalk II s.68 Bsp 37";
neuper@37906	1101	"----------- ((x+1)(x+2) - (3x - 2)^^^2=.. Schalk II s.68 Bsp 37";
neuper@37906	1102	(is in rlang.sml, too)
neuper@37906	1103	val fmz = ["equality ((x+1)(x+2) - (3x - 2)^^^2=(2x - 1)^^^2+(3x - 1)*(x+1))",
neuper@37906	1104	"solveFor x","solutions L"];
neuper@37991	1105	val (dI',pI',mI') = ("PolyEq",["univariate","equation"],["no_met"]);
neuper@37906	1106
neuper@37906	1107	(*val p = e_pos'; val c = [];
neuper@37906	1108	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	1109	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	1110
neuper@37906	1111	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@37906	1112	(val nxt = ("Refine_Tacitly",Refine_Tacitly ["univariate","equation"]))
neuper@37906	1113	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1114	(* val nxt =
neuper@37906	1115	("Model_Problem",
neuper@37906	1116	Model_Problem ["normalize","polynomial","univariate","equation"])
neuper@37906	1117	: string * tac *)
neuper@37906	1118	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1119	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1120	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1121	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1122	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1123	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1124	(* val nxt =
neuper@37906	1125	("Subproblem",
neuper@37991	1126	Subproblem ("PolyEq",["polynomial","univariate","equation"]))
neuper@37906	1127	: string * tac*)
neuper@37906	1128	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1129	(*val nxt =
neuper@37906	1130	("Model_Problem",
neuper@37906	1131	Model_Problem ["abcFormula","degree_2","polynomial","univariate","equation"])
neuper@37906	1132	: string * tac*)
neuper@37906	1133	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1134	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1135	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1136	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1137	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1138	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1139	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1140	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 2 / 15, x = 1]")) => ()
neuper@38031	1141	\| _ => error "polyeq.sml: diff.behav. in [x = 2 / 15, x = 1]";
neuper@37906	1142
neuper@37906	1143
neuper@37906	1144	" -4 + x^^^2 =0 ";
neuper@37906	1145	" -4 + x^^^2 =0 ";
neuper@37906	1146	" -4 + x^^^2 =0 ";
neuper@37906	1147	val fmz = ["equality ( -4 + x^^^2 =0)", "solveFor x","solutions L"];
neuper@37906	1148	(* val fmz = ["equality (1 + x^^^2 =0)", "solveFor x","solutions L"];*)
neuper@37906	1149	(val fmz = ["equality (0 =0)", "solveFor x","solutions L"];)
neuper@37991	1150	val (dI',pI',mI') = ("PolyEq",["univariate","equation"],["no_met"]);
neuper@37906	1151	(*val p = e_pos';
neuper@37906	1152	val c = [];
neuper@37906	1153	val (mI,m) = ("Init_Proof",Init_Proof (fmz, (dI',pI',mI')));
neuper@37906	1154	val (p,_,f,nxt,_,pt) = me (mI,m) p c EmptyPtree;*)
neuper@37906	1155	val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
neuper@37906	1156
neuper@37906	1157	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1158	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1159	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1160	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1161	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1162	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1163	val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
neuper@37906	1164	case f of Form' (FormKF (~1,EdUndef,0,Nundef,"[x = 2, x = -2]")) => ()
neuper@38031	1165	\| _ => error "polyeq.sml: diff.behav. in [x = 2, x = -2]";
neuper@37906	1166
neuper@37906	1167	"----------------- polyeq.sml end ------------------";
neuper@37906	1168
neuper@37906	1169	(Punkte aus dem TestBericht, die ich in rlang.sml nicht zuordnen konnte:)
neuper@37906	1170	(WN.19.3.03 ---v-)
neuper@37906	1171	(3(b))val (bdv,v) = (str2term "bdv", str2term "R1");
neuper@37906	1172	val t = str2term "-1 * (R * R2) + R2 * R1 + -1 * (R * R1) = 0";
neuper@37926	1173	val SOME (t',_) = rewrite_set_inst_ thy false [(bdv,v)] make_polynomial_in t;
neuper@37906	1174	term2str t';
neuper@37906	1175	"-1 * R * R2 + (R2 + -1 * R) * R1 = 0";
neuper@37906	1176	(WN.19.3.03 ---^-)
neuper@37906	1177
neuper@37906	1178	(3(c))val (bdv,v) = (str2term "bdv", str2term "p");
neuper@37906	1179	val t = str2term "y ^^^ 2 + -2 * (x * p) = 0";
neuper@37926	1180	val SOME (t',_) = rewrite_set_inst_ thy false [(bdv,v)] make_polynomial_in t;
neuper@37906	1181	term2str t';
neuper@37906	1182	"y ^^^ 2 + -2 * x * p = 0";
neuper@37906	1183
neuper@37906	1184	(3(d))val (bdv,v) = (str2term "bdv", str2term "x2");
neuper@37906	1185	val t = str2term
neuper@37906	1186	"A + x1 * (y3 * (1 / 2)) + x3 * (y2 * (1 / 2)) + -1 * (x1 * (y2 * (1 / 2))) + -1 * (x3 * (y1 * (1 / 2 ))) + y1 * (1 / 2 * x2) + -1 * (y3 * (1 / 2 * x2)) = 0";
neuper@37926	1187	val SOME (t',_) = rewrite_set_inst_ thy false [(bdv,v)] make_polynomial_in t;
neuper@37906	1188	term2str t';
neuper@37906	1189	"A + x1 * y3 * (1 / 2) + x3 * y2 * (1 / 2) + - x1 * y2 * (1 / 2) + - x3 * y1 * (1 / 2) + (y1 * (1 / 2) + - y3 * (1 / 2)) * x2 = 0";
neuper@37926	1190	val SOME (t',_) = rewrite_set_inst_ thy false [(bdv,v)] make_ratpoly_in t;
neuper@37906	1191	term2str t';
neuper@37906	1192	"A + x1 * y3 * (1 / 2) + x3 * y2 * (1 / 2) + -1 * x1 * y2 * (1 / 2) + -1 * x3 * y1 * (1 / 2) + (y1 * (1 / 2) + -1 * y3 * (1 / 2)) * x2 = 0";
neuper@37906	1193
neuper@37906	1194	(3(e))val (bdv,v) = (str2term "bdv", str2term "a");
neuper@37906	1195	val t = str2term
neuper@37906	1196	"A ^^^ 2 + c ^^^ 2 * (c / d) ^^^ 2 + (-4 * (c / d) ^^^ 2) * a ^^^ 2 = 0";
neuper@37926	1197	val NONE = rewrite_set_inst_ thy false [(bdv,v)] make_polynomial_in t;
neuper@37906	1198	(die _unsichtbare_ Klammern sind genau wie gew"unscht)
neuper@37906	1199
neuper@37906	1200
neuper@37906	1201	val t = str2term "(x + 1) * (x + 2) - (3 * x - 2) ^^^ 2 - ((2 * x - 1) ^^^ 2 + (3 * x - 1) * (x + 1)) = 0";
neuper@37906	1202	trace_rewrite:=true;
neuper@37906	1203	rewrite_set_ thy false expand_binoms t;
neuper@37906	1204	trace_rewrite:=false;
neuper@37906	1205
neuper@37906	1206
neuper@37906	1207	"----------- interSteps ([1],Res); on Schalk Is86Bsp5-------------";
neuper@37906	1208	"----------- interSteps ([1],Res); on Schalk Is86Bsp5-------------";
neuper@37906	1209	"----------- interSteps ([1],Res); on Schalk Is86Bsp5-------------";
neuper@37906	1210	states:=[];
neuper@37906	1211	CalcTree
neuper@37906	1212	[(["equality (3x - 1 - (5x - (2 - 4*x)) = -11)","solveFor x","solutions L"],
neuper@37991	1213	("PolyEq",["univariate","equation"],["no_met"]))];
neuper@37906	1214	Iterator 1;
neuper@37906	1215	moveActiveRoot 1;
neuper@37906	1216	autoCalculate 1 CompleteCalc;
neuper@37906	1217	val ((pt,p),_) = get_calc 1; show_pt pt;
neuper@37906	1218
neuper@37906	1219	interSteps 1 ([1],Res) (no Rewrite_Set...);
neuper@42248	1220
neuper@42248	1221	============ inhibit exn WN110906 ==============================================*)
neuper@42248	1222

author	Walther Neuper <neuper@ist.tugraz.at>
	Sun, 18 Sep 2011 15:21:46 +0200
branch	decompose-isar
changeset 42272	dcc5d2601cf7
parent 42260	537d95d1fdb2
child 42283	b95f0dde56c1
permissions	-rw-r--r--