test/Tools/isac/Knowledge/polyeq-2.sml
changeset 60571 19a172de0bb5
parent 60565 f92963a33fe3
child 60650 06ec8abfd3bc
equal deleted inserted replaced
60570:44f83099227d 60571:19a172de0bb5
    29  val fmz = ["equality (a*b - (a+b)*x + x \<up> 2 = 0)",
    29  val fmz = ["equality (a*b - (a+b)*x + x \<up> 2 = 0)",
    30  	    "solveFor x", "solutions L"];
    30  	    "solveFor x", "solutions L"];
    31  val (dI',pI',mI') =
    31  val (dI',pI',mI') =
    32      ("PolyEq",["degree_2", "expanded", "univariate", "equation"],
    32      ("PolyEq",["degree_2", "expanded", "univariate", "equation"],
    33       ["PolyEq", "complete_square"]);
    33       ["PolyEq", "complete_square"]);
    34 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
    34 val (p,_,f,nxt,_,pt) = Test_Code.init_calc @{context} [(fmz, (dI',pI',mI'))];
    35 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    35 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    36 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    36 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    37 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    37 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    38 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    38 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    39 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    39 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    67  val fmz = ["equality (-64 + x \<up> 2 = 0)",(*Schalk 2, S.66 Nr.1.a~*)
    67  val fmz = ["equality (-64 + x \<up> 2 = 0)",(*Schalk 2, S.66 Nr.1.a~*)
    68  	    "solveFor x", "solutions L"];
    68  	    "solveFor x", "solutions L"];
    69  val (dI',pI',mI') =
    69  val (dI',pI',mI') =
    70      ("PolyEq",["degree_2", "expanded", "univariate", "equation"],
    70      ("PolyEq",["degree_2", "expanded", "univariate", "equation"],
    71       ["PolyEq", "complete_square"]);
    71       ["PolyEq", "complete_square"]);
    72 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
    72 val (p,_,f,nxt,_,pt) = Test_Code.init_calc @{context} [(fmz, (dI',pI',mI'))];
    73 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    73 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    74 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    74 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    75 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    75 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    76 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    76 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    77 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    77 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
    94 val fmz = ["equality (- 147 + 3*x \<up> 2 = 0)",(*Schalk 2, S.66 Nr.1.b*)
    94 val fmz = ["equality (- 147 + 3*x \<up> 2 = 0)",(*Schalk 2, S.66 Nr.1.b*)
    95  	    "solveFor x", "solutions L"];
    95  	    "solveFor x", "solutions L"];
    96 val (dI',pI',mI') =
    96 val (dI',pI',mI') =
    97      ("PolyEq",["degree_2", "expanded", "univariate", "equation"],
    97      ("PolyEq",["degree_2", "expanded", "univariate", "equation"],
    98       ["PolyEq", "complete_square"]);
    98       ["PolyEq", "complete_square"]);
    99 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
    99 val (p,_,f,nxt,_,pt) = Test_Code.init_calc @{context} [(fmz, (dI',pI',mI'))];
   100 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
   100 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
   101 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
   101 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
   102 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
   102 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
   103 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
   103 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
   104 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
   104 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
   119 (*EP- 17 Schalk_I_p86_n5*)
   119 (*EP- 17 Schalk_I_p86_n5*)
   120 val fmz = ["equality ((3::real)*x - 1 - (5*x - (2 - 4*x)) = - 11)", "solveFor x", "solutions L"];
   120 val fmz = ["equality ((3::real)*x - 1 - (5*x - (2 - 4*x)) = - 11)", "solveFor x", "solutions L"];
   121 (* Refine.refine fmz ["univariate", "equation"];
   121 (* Refine.refine fmz ["univariate", "equation"];
   122 *)
   122 *)
   123 val (dI',pI',mI') = ("PolyEq",["univariate", "equation"],["no_met"]);
   123 val (dI',pI',mI') = ("PolyEq",["univariate", "equation"],["no_met"]);
   124 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
   124 val (p,_,f,nxt,_,pt) = Test_Code.init_calc @{context} [(fmz, (dI',pI',mI'))];
   125 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
   125 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
   126 (* val nxt =
   126 (* val nxt =
   127   ("Model_Problem",
   127   ("Model_Problem",
   128    Model_Problem ["normalise", "polynomial", "univariate", "equation"])
   128    Model_Problem ["normalise", "polynomial", "univariate", "equation"])
   129   : string * tac*)
   129   : string * tac*)
   157 "----------- ((x+1)*(x+2) - (3*x - 2) \<up> 2=.. Schalk II s.68 Bsp 37";
   157 "----------- ((x+1)*(x+2) - (3*x - 2) \<up> 2=.. Schalk II s.68 Bsp 37";
   158 (*is in rlang.sml, too*)
   158 (*is in rlang.sml, too*)
   159 val fmz = ["equality ((x+1)*(x+2) - (3*x - 2) \<up> 2=(2*x - 1) \<up> 2+(3*x - 1)*(x+1))",
   159 val fmz = ["equality ((x+1)*(x+2) - (3*x - 2) \<up> 2=(2*x - 1) \<up> 2+(3*x - 1)*(x+1))",
   160 	   "solveFor x", "solutions L"];
   160 	   "solveFor x", "solutions L"];
   161 val (dI',pI',mI') = ("PolyEq",["univariate", "equation"],["no_met"]);
   161 val (dI',pI',mI') = ("PolyEq",["univariate", "equation"],["no_met"]);
   162 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
   162 val (p,_,f,nxt,_,pt) = Test_Code.init_calc @{context} [(fmz, (dI',pI',mI'))];
   163 (*val nxt = ("Refine_Tacitly",Refine_Tacitly ["univariate", "equation"])*)
   163 (*val nxt = ("Refine_Tacitly",Refine_Tacitly ["univariate", "equation"])*)
   164 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
   164 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
   165 (* val nxt =
   165 (* val nxt =
   166   ("Model_Problem",
   166   ("Model_Problem",
   167    Model_Problem ["normalise", "polynomial", "univariate", "equation"])
   167    Model_Problem ["normalise", "polynomial", "univariate", "equation"])
   197 "    -4 + x \<up> 2 =0     ";
   197 "    -4 + x \<up> 2 =0     ";
   198 val fmz = ["equality ( -4 + x \<up> 2 =0)", "solveFor x", "solutions L"];
   198 val fmz = ["equality ( -4 + x \<up> 2 =0)", "solveFor x", "solutions L"];
   199 (* val fmz = ["equality (1 + x \<up> 2 =0)", "solveFor x", "solutions L"];*)
   199 (* val fmz = ["equality (1 + x \<up> 2 =0)", "solveFor x", "solutions L"];*)
   200 (*val fmz = ["equality (0 =0)", "solveFor x", "solutions L"];*)
   200 (*val fmz = ["equality (0 =0)", "solveFor x", "solutions L"];*)
   201 val (dI',pI',mI') = ("PolyEq",["univariate", "equation"],["no_met"]);
   201 val (dI',pI',mI') = ("PolyEq",["univariate", "equation"],["no_met"]);
   202 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
   202 val (p,_,f,nxt,_,pt) = Test_Code.init_calc @{context} [(fmz, (dI',pI',mI'))];
   203 
   203 
   204 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
   204 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
   205 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
   205 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
   206 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
   206 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
   207 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
   207 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
   261 
   261 
   262 "----------- interSteps ([1],Res); on Schalk Is86Bsp5-------------";
   262 "----------- interSteps ([1],Res); on Schalk Is86Bsp5-------------";
   263 "----------- interSteps ([1],Res); on Schalk Is86Bsp5-------------";
   263 "----------- interSteps ([1],Res); on Schalk Is86Bsp5-------------";
   264 "----------- interSteps ([1],Res); on Schalk Is86Bsp5-------------";
   264 "----------- interSteps ([1],Res); on Schalk Is86Bsp5-------------";
   265 States.reset ();
   265 States.reset ();
   266 CalcTree
   266 CalcTree @{context}
   267 [(["equality ((3::real)*x - 1 - (5*x - (2 - 4*x)) = - 11)", "solveFor x", "solutions L"], 
   267 [(["equality ((3::real)*x - 1 - (5*x - (2 - 4*x)) = - 11)", "solveFor x", "solutions L"], 
   268   ("PolyEq",["univariate", "equation"],["no_met"]))];
   268   ("PolyEq",["univariate", "equation"],["no_met"]))];
   269 Iterator 1;
   269 Iterator 1;
   270 moveActiveRoot 1;
   270 moveActiveRoot 1;
   271 
   271