walther@60329: (* Title:  Knowledge/polyeq- 1.sml
walther@59627:            testexamples for PolyEq, poynomial equations and equational systems
walther@59627:    Author: Richard Lang 2003  
walther@59627:    (c) due to copyright terms
walther@59627: WN030609: some expls dont work due to unfinished handling of 'expanded terms';
walther@59627:           others marked with TODO have to be checked, too.
walther@59627: *)
walther@59627: 
walther@59627: "-----------------------------------------------------------------";
walther@59627: "table of contents -----------------------------------------------";
walther@59627: "-----------------------------------------------------------------";
walther@60394: "------ polyeq-2.sml ---------------------------------------------";
walther@60394: "------ polyeq-1.sml ---------------------------------------------";
walther@60242: "----------- (a*b - (a+b)*x + x \<up> 2 = 0), (*Schalk 2,S.68Nr.44.a*)";
walther@60242: "----------- (-64 + x \<up> 2 = 0), (*Schalk 2, S.66 Nr.1.a~--------*)";
walther@60329: "----------- (- 147 + 3*x \<up> 2 = 0), (*Schalk 2, S.66 Nr.1.b------*)";
walther@60329: "----------- (3*x - 1 - (5*x - (2 - 4*x)) = - 11),(*Schalk Is86Bsp5";
walther@60242: "----------- ((x+1)*(x+2) - (3*x - 2) \<up> 2=.. Schalk II s.68 Bsp 37";
walther@59627: "----------- rls make_polynomial_in ------------------------------";
walther@59627: "----------- interSteps ([1],Res); on Schalk Is86Bsp5-------------";
walther@59627: "----------- rls d2_polyeq_bdv_only_simplify ---------------------";
walther@59627: "-----------------------------------------------------------------";
walther@59627: "-----------------------------------------------------------------";
walther@59627: 
walther@59627: 
walther@60242: "----------- (a*b - (a+b)*x + x \<up> 2 = 0), (*Schalk 2,S.68Nr.44.a*)";
walther@60242: "----------- (a*b - (a+b)*x + x \<up> 2 = 0), (*Schalk 2,S.68Nr.44.a*)";
walther@60242: "----------- (a*b - (a+b)*x + x \<up> 2 = 0), (*Schalk 2,S.68Nr.44.a*)";
walther@60242:  val fmz = ["equality (a*b - (a+b)*x + x \<up> 2 = 0)",
walther@59997:  	    "solveFor x", "solutions L"];
walther@59627:  val (dI',pI',mI') =
walther@59997:      ("PolyEq",["degree_2", "expanded", "univariate", "equation"],
walther@59997:       ["PolyEq", "complete_square"]);
walther@59627: val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt; f2str f;
walther@59627: (*WN.2.5.03 TODO FIXME Matthias ?
walther@59627:  case f of 
walther@59627:      Form' 
walther@59959: 	 (Test_Out.FormKF 
walther@59627: 	      (~1,EdUndef,0,Nundef,
walther@60329: 	       "[x = (a + b) / 2 + - 1 * sqrt ((a + b) \<up> 2 / 2 \<up> 2 - a * b),\n x = (a + b) / 2 + sqrt ((a + b) \<up> 2 / 2 \<up> 2 - a * b)]")) 
walther@59627: 	 => ()
walther@60242:    | _ => error "polyeq.sml: diff.behav. in a*b - (a+b)*x + x \<up> 2 = 0";
walther@59627:  this will be simplified [x = a, x = b] to by Factor.ML*)
walther@59627: 
walther@59627: 
walther@60242: "----------- (-64 + x \<up> 2 = 0), (*Schalk 2, S.66 Nr.1.a~--------*)";
walther@60242: "----------- (-64 + x \<up> 2 = 0), (*Schalk 2, S.66 Nr.1.a~--------*)";
walther@60242: "----------- (-64 + x \<up> 2 = 0), (*Schalk 2, S.66 Nr.1.a~--------*)";
walther@60242:  val fmz = ["equality (-64 + x \<up> 2 = 0)",(*Schalk 2, S.66 Nr.1.a~*)
walther@59997:  	    "solveFor x", "solutions L"];
walther@59627:  val (dI',pI',mI') =
walther@59997:      ("PolyEq",["degree_2", "expanded", "univariate", "equation"],
walther@59997:       ["PolyEq", "complete_square"]);
walther@59627: val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt; f2str f;
walther@60329: (*WN.2.5.03 TODO "[x = sqrt (0 - -64), x = - 1 * sqrt (0 - -64)]"
walther@59959:  case f of Form' (Test_Out.FormKF (~1,EdUndef,0,Nundef,"[x = 8, x = -8]")) => ()
walther@59627: 	 | _ => error "polyeq.sml: diff.behav. in [x = 8, x = -8]";
walther@59627: *)
walther@59627: 
walther@60329: "----------- (- 147 + 3*x \<up> 2 = 0), (*Schalk 2, S.66 Nr.1.b------*)";
walther@60329: "----------- (- 147 + 3*x \<up> 2 = 0), (*Schalk 2, S.66 Nr.1.b------*)";
walther@60329: "----------- (- 147 + 3*x \<up> 2 = 0), (*Schalk 2, S.66 Nr.1.b------*)";
walther@60329: val fmz = ["equality (- 147 + 3*x \<up> 2 = 0)",(*Schalk 2, S.66 Nr.1.b*)
walther@59997:  	    "solveFor x", "solutions L"];
walther@59627: val (dI',pI',mI') =
walther@59997:      ("PolyEq",["degree_2", "expanded", "univariate", "equation"],
walther@59997:       ["PolyEq", "complete_square"]);
walther@59627: val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [] pt;
walther@60329: (*WN.2.5.03 TODO "[x = sqrt (0 - -49), x = - 1 * sqrt (0 - -49)]"
walther@59959:  case f of Form' (Test_Out.FormKF (~1,EdUndef,0,Nundef,"[x = 7, x = -7]")) => ()
walther@59627: 	 | _ => error "polyeq.sml: diff.behav. in [x = 7, x = -7]";
walther@59627: *)
walther@60393: if f2str f = "[x = sqrt (0 - - 49), x = - 1 * sqrt (0 - - 49)]" then ()
walther@59627: else error "polyeq.sml CORRECTED?behav. in [x = 7, x = -7]";
walther@59627: 
walther@59627: 
walther@60329: "----------- (3*x - 1 - (5*x - (2 - 4*x)) = - 11),(*Schalk Is86Bsp5";
walther@60329: "----------- (3*x - 1 - (5*x - (2 - 4*x)) = - 11),(*Schalk Is86Bsp5";
walther@60329: "----------- (3*x - 1 - (5*x - (2 - 4*x)) = - 11),(*Schalk Is86Bsp5";
walther@60329: (*EP- 17 Schalk_I_p86_n5*)
walther@60329: val fmz = ["equality ((3::real)*x - 1 - (5*x - (2 - 4*x)) = - 11)", "solveFor x", "solutions L"];
walther@59997: (* Refine.refine fmz ["univariate", "equation"];
walther@59627: *)
walther@59997: val (dI',pI',mI') = ("PolyEq",["univariate", "equation"],["no_met"]);
walther@59627: val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: (* val nxt =
walther@59627:   ("Model_Problem",
walther@59997:    Model_Problem ["normalise", "polynomial", "univariate", "equation"])
walther@59627:   : string * tac*)
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: (* val nxt =
walther@59627:   ("Subproblem",
walther@59997:    Subproblem ("PolyEq",["polynomial", "univariate", "equation"]))
walther@59627:   : string * tac *)
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: (*val nxt =
walther@59627:   ("Model_Problem",
walther@59997:    Model_Problem ["degree_1", "polynomial", "univariate", "equation"])
walther@59627:   : string * tac *)
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59959: case f of Test_Out.FormKF "[x = 2]" => ()
walther@59627: 	 | _ => error "polyeq.sml: diff.behav. in [x = 2]";
walther@59627: 
walther@59627: 
walther@60242: "----------- ((x+1)*(x+2) - (3*x - 2) \<up> 2=.. Schalk II s.68 Bsp 37";
walther@60242: "----------- ((x+1)*(x+2) - (3*x - 2) \<up> 2=.. Schalk II s.68 Bsp 37";
walther@60242: "----------- ((x+1)*(x+2) - (3*x - 2) \<up> 2=.. Schalk II s.68 Bsp 37";
walther@59627: (*is in rlang.sml, too*)
walther@60242: val fmz = ["equality ((x+1)*(x+2) - (3*x - 2) \<up> 2=(2*x - 1) \<up> 2+(3*x - 1)*(x+1))",
walther@59997: 	   "solveFor x", "solutions L"];
walther@59997: val (dI',pI',mI') = ("PolyEq",["univariate", "equation"],["no_met"]);
walther@59627: val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
walther@59997: (*val nxt = ("Refine_Tacitly",Refine_Tacitly ["univariate", "equation"])*)
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: (* val nxt =
walther@59627:   ("Model_Problem",
walther@59997:    Model_Problem ["normalise", "polynomial", "univariate", "equation"])
walther@59627:   : string * tac *)
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: (* val nxt =
walther@59627:   ("Subproblem",
walther@59997:    Subproblem ("PolyEq",["polynomial", "univariate", "equation"]))
walther@59627:   : string * tac*)
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: (*val nxt =
walther@59627:   ("Model_Problem",
walther@59997:    Model_Problem ["abcFormula", "degree_2", "polynomial", "univariate", "equation"])
walther@59627:   : string * tac*)
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59959: case f of Test_Out.FormKF "[x = 2 / 15, x = 1]" => ()
walther@59627: 	 | _ => error "polyeq.sml: diff.behav. in [x = 2 / 15, x = 1]";
walther@59627: 
walther@59627: 
walther@60242: "    -4 + x \<up> 2 =0     ";
walther@60242: "    -4 + x \<up> 2 =0     ";
walther@60242: "    -4 + x \<up> 2 =0     ";
walther@60242: val fmz = ["equality ( -4 + x \<up> 2 =0)", "solveFor x", "solutions L"];
walther@60242: (* val fmz = ["equality (1 + x \<up> 2 =0)", "solveFor x", "solutions L"];*)
walther@59997: (*val fmz = ["equality (0 =0)", "solveFor x", "solutions L"];*)
walther@59997: val (dI',pI',mI') = ("PolyEq",["univariate", "equation"],["no_met"]);
walther@59627: val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
walther@59627: 
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@59627: val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
walther@60329: case f of Test_Out.FormKF "[x = 2, x = - 2]" => ()
walther@60329: 	 | _ => error "polyeq.sml: diff.behav. in [x = 2, x = - 2]";
walther@59627: 
walther@59627: "----------- rls make_polynomial_in ------------------------------";
walther@59627: "----------- rls make_polynomial_in ------------------------------";
walther@59627: "----------- rls make_polynomial_in ------------------------------";
walther@60393: val thy = @{theory};
Walther@60500: val ctxt = @{context};
walther@59627: (*Punkte aus dem TestBericht, die ich in rlang.sml nicht zuordnen konnte:*)
walther@59627: (*WN.19.3.03 ---v-*)
walther@60230: (*3(b)*)val (bdv,v) = (TermC.str2term "''bdv''", TermC.str2term "R1");
walther@60329: val t = TermC.str2term "- 1 * (R * R2) + R2 * R1 + - 1 * (R * R1) = 0";
Walther@60500: val SOME (t',_) = rewrite_set_inst_ ctxt false [(bdv,v)] make_polynomial_in t;
walther@60329: if UnparseC.term t' = "- 1 * R * R2 + R2 * R1 + - 1 * R * R1 = 0" then ()
walther@60329: else error "make_polynomial_in (- 1 * (R * R2) + R2 * R1 + - 1 * (R * R1) = 0)";
walther@60329: "- 1 * R * R2 + (R2 + - 1 * R) * R1 = 0";
walther@59627: (*WN.19.3.03 ---^-*)
walther@59627: 
walther@60230: (*3(c)*)val (bdv,v) = (TermC.str2term "bdv", TermC.str2term "p");
walther@60329: val t = TermC.str2term "y \<up> 2 + - 2 * (x * p) = 0";
Walther@60500: val SOME (t',_) = rewrite_set_inst_ ctxt false [(bdv,v)] make_polynomial_in t;
walther@60329: if UnparseC.term t' = "y \<up> 2 + - 2 * x * p = 0" then ()
walther@60329: else error "make_polynomial_in (y \<up> 2 + - 2 * (x * p) = 0)";
walther@59627: 
walther@60230: (*3(d)*)val (bdv,v) = (TermC.str2term "''bdv''", TermC.str2term "x2");
walther@60230: val t = TermC.str2term 
walther@60329: "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";
Walther@60500: val SOME (t',_) = rewrite_set_inst_ ctxt false [(bdv,v)] make_polynomial_in t;
walther@59868: if UnparseC.term t' =
walther@60329: "A + x1 * y3 * (1 / 2) + x3 * y2 * (1 / 2) + - 1 * x1 * y2 * (1 / 2) +\n- 1 * x3 * y1 * (1 / 2) +\ny1 * (1 / 2) * x2 +\n- 1 * y3 * (1 / 2) * x2 =\n0"
walther@59627: then ()
walther@60329: else error "make_polynomial_in (A + x1 * (y3 * (1 / 2)) + x3 * (y2 * (1 / 2)) + - 1...";
walther@59627: "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";
walther@59627: 
Walther@60500: val SOME (t',_) = rewrite_set_inst_ ctxt false [(bdv,v)] make_ratpoly_in t;
walther@59868: if UnparseC.term t' = 
walther@60329: "A / 1 + x1 * y3 / 2 + x3 * y2 / 2 + - 1 * x1 * y2 / 2 + - 1 * x3 * y1 / 2 +\ny1 * x2 / 2 +\n- 1 * y3 * x2 / 2 =\n0"
walther@59627: then ()
walther@60329: else error "make_ratpoly_in (A + x1 * (y3 * (1 / 2)) + x3 * (y2 * (1 / 2)) + - 1...";
walther@60329: "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";
walther@59627: 
walther@60230: (*3(e)*)val (bdv,v) = (TermC.str2term "bdv", TermC.str2term "a");
walther@60230: val t = TermC.str2term 
walther@60242: "A \<up> 2 + c \<up> 2 * (c / d) \<up> 2 + (-4 * (c / d) \<up> 2) * a \<up> 2 = 0";
Walther@60500: val NONE = rewrite_set_inst_ ctxt false [(bdv,v)] make_polynomial_in t;
walther@59627: (* the invisible parentheses are as expected *)
walther@59627: 
walther@60242: val t = TermC.str2term "(x + 1) * (x + 2) - (3 * x - 2) \<up> 2 - ((2 * x - 1) \<up> 2 + (3 * x - 1) * (x + 1)) = 0";
Walther@60500: rewrite_set_ ctxt false expand_binoms t;
walther@59627: 
walther@59627: 
walther@59627: "----------- interSteps ([1],Res); on Schalk Is86Bsp5-------------";
walther@59627: "----------- interSteps ([1],Res); on Schalk Is86Bsp5-------------";
walther@59627: "----------- interSteps ([1],Res); on Schalk Is86Bsp5-------------";
walther@59627: reset_states ();
walther@59627: CalcTree
walther@60329: [(["equality ((3::real)*x - 1 - (5*x - (2 - 4*x)) = - 11)", "solveFor x", "solutions L"], 
walther@59997:   ("PolyEq",["univariate", "equation"],["no_met"]))];
walther@59627: Iterator 1;
walther@59627: moveActiveRoot 1;
walther@59627: 
walther@59627: autoCalculate 1 CompleteCalc;
walther@59983: val ((pt,p),_) = get_calc 1; Test_Tool.show_pt pt;
walther@59627: interSteps 1 ([1],Res)
walther@59627: (*BEFORE Isabelle2002 --> 2011: <ERROR> no Rewrite_Set... </ERROR> ?see fun prep_rls?*);
walther@59627: 
walther@59627: 
walther@59627: "----------- rls d2_polyeq_bdv_only_simplify ---------------------";
walther@59627: "----------- rls d2_polyeq_bdv_only_simplify ---------------------";
walther@59627: "----------- rls d2_polyeq_bdv_only_simplify ---------------------";
walther@60242: val t = TermC.str2term "-6 * x + 5 * x \<up> 2 = (0::real)";
walther@60230: val subst = [(TermC.str2term "(bdv::real)", TermC.str2term "(x::real)")];
Walther@60500: val SOME (t''''', _) = rewrite_set_inst_ ctxt true subst d2_polyeq_bdv_only_simplify t;
walther@59627: (* steps in rls d2_polyeq_bdv_only_simplify:*)
walther@59627: 
walther@59997: (*-6 * x + 5 * x ^ 2 = 0 : Rewrite_Inst (["(''bdv'',x)"],("d2_prescind1", "")) --> x * (-6 + 5 * x) = 0*)
walther@60230: t |> UnparseC.term; t |> TermC.atomty;
walther@60393: val thm = @{thm d2_prescind1};
walther@60230: thm |> Thm.prop_of |> UnparseC.term; thm |> Thm.prop_of |> TermC.atomty;
Walther@60500: val SOME (t', _) = rewrite_inst_ ctxt e_rew_ord Rule_Set.empty true subst thm t; UnparseC.term t';
walther@59627: 
walther@59997: (*x * (-6 + 5 * x) = 0   : Rewrite_Inst (["(''bdv'',x)"],("d2_reduce_equation1", "")) 
walther@59627:                                                                         --> x = 0 | -6 + 5 * x = 0*)
walther@60230: t' |> UnparseC.term; t' |> TermC.atomty;
walther@60393: val thm = @{thm d2_reduce_equation1};
walther@60230: thm |> Thm.prop_of |> UnparseC.term; thm |> Thm.prop_of |> TermC.atomty;
Walther@60500: val SOME (t'', _) = rewrite_inst_ ctxt e_rew_ord Rule_Set.empty true subst thm t'; UnparseC.term t'';
walther@59627: (* NONE with d2_reduce_equation1:   "(bdv*(a +b*bdv)=0) = ((bdv=0)|(a+b*bdv=0))"
walther@59627:    instead   d2_reduce_equation1:   "(bdv*(a +b*bdv)=0) = ((bdv=0)|(a+b*bdv=(0::real)))"
walther@59627: *)
walther@60393: if UnparseC.term t'' = "x = 0 \<or> - 6 + 5 * x = 0" then ()
walther@59627: else error "rls d2_polyeq_bdv_only_simplify broken";