test/Tools/isac/Knowledge/biegelinie-1.sml
author wenzelm
Mon, 19 Apr 2021 20:12:53 +0200
changeset 60237 e534316f9e07
parent 60230 0ca0f9363ad3
child 60242 73ee61385493
permissions -rw-r--r--
session Isac_Test works again: de0ccac9f862 removes confusion that lead to partial/breaking changes in 0ca0f9363ad3;
     1 (* Title:  Knowledge/biegelinie-1.sml
     2    Author: Walther Neuper 050826
     3    (c) due to copyright terms
     4 *)
     5 "-----------------------------------------------------------------";
     6 "table of contents -----------------------------------------------";
     7 "-----------------------------------------------------------------";
     8 "------ biegelinie-1.sml -----------------------------------------";
     9 "----------- the rules -------------------------------------------";
    10 "----------- simplify_leaf for this script -----------------------";
    11 "----------- SubProblem (_,[setzeRandbedingungen,Biegelinien] ----";
    12 "----------- investigate normalforms in biegelinien --------------";
    13 "-----------------------------------------------------------------";
    14 "------ biegelinie-2.sml -----------------------------------------";
    15 "----------- auto SubProblem (_,[vonBelastungZu,Biegelinien] -----";
    16 "----------- me SubProblem (_,[vonBelastungZu,Biegelinien] -------";
    17 "-----------------------------------------------------------------";
    18 "------ biegelinie-3.sml -----------------------------------------";
    19 "----------- auto method [Biegelinien,setzeRandbedingungenEin]--------------------------------";
    20 "----------- me method [Biegelinien,setzeRandbedingungenEin]----------------------------------";
    21 "-----------------------------------------------------------------";
    22 "------ biegelinie-4.sml -----------------------------------------";
    23 "----------- IntegrierenUndKonstanteBestimmen2: Bsp.7.70. auto TODO investigate failure ------";
    24 "----------- IntegrierenUndKonstanteBestimmen2: Bsp.7.70. me -----";
    25 "-----------------------------------------------------------------";
    26 "-----------------------------------------------------------------";
    27 "-----------------------------------------------------------------";
    28 
    29 val thy = @{theory "Biegelinie"};
    30 val ctxt = ThyC.id_to_ctxt "Biegelinie";
    31 fun str2term str = (Thm.term_of o the o (TermC.parse thy)) str;
    32 fun term2s t = UnparseC.term_by_thyID "Biegelinie" t;
    33 fun rewrit thm str = fst (the (rewrite_ thy tless_true Rule_Set.empty true thm str));
    34 
    35 "----------- the rules -------------------------------------------";
    36 "----------- the rules -------------------------------------------";
    37 "----------- the rules -------------------------------------------";
    38 val t = rewrit @{thm Belastung_Querkraft} (TermC.str2term "- qq x = - q_0"); term2s t;
    39 if term2s t = "Q' x = - q_0" then ()
    40 else error  "/biegelinie.sml: Belastung_Querkraft";
    41 
    42 val t = rewrit @{thm Querkraft_Moment} (TermC.str2term "Q x = - q_0 * x + c"); term2s t;
    43 if term2s t = "?M_b' x = - q_0 * x + c" then ()
    44 (*if term2s t = "M_b' x = - q_0 * x + c" then ()  cf.fbe1652b0df8 new handling of quotes in mixfix*)
    45 else error  "/biegelinie.sml: Querkraft_Moment";
    46 
    47 val t = rewrit @{thm Moment_Neigung} (TermC.str2term "M_b x = -q_0 * x^^^2/2 + q_0/2 *L*x");
    48     term2s t;
    49 if term2s t = "- EI * y'' x = - q_0 * x ^^^ 2 / 2 + q_0 / 2 * L * x" then ()
    50 else error  "biegelinie.sml: Moment_Neigung";
    51 
    52 "----------- simplify_leaf for this script -----------------------";
    53 "----------- simplify_leaf for this script -----------------------";
    54 "----------- simplify_leaf for this script -----------------------";
    55 val srls = Rule_Set.Repeat {id="srls_IntegrierenUnd..", 
    56 		preconds = [], 
    57 		rew_ord = ("termlessI",termlessI), 
    58 		erls = Rule_Set.append_rules "erls_in_srls_IntegrierenUnd.." Rule_Set.empty
    59 				  [(*for asm in NTH_CONS ...*)
    60 				   Eval ("Orderings.ord_class.less",eval_equ "#less_"),
    61 				   (*2nd NTH_CONS pushes n+-1 into asms*)
    62 				   Eval("Groups.plus_class.plus", eval_binop "#add_")
    63 				   ], 
    64 		srls = Rule_Set.Empty, calc = [], errpatts = [],
    65 		rules = [Thm ("NTH_CONS",ThmC.numerals_to_Free @{thm NTH_CONS}),
    66 			 Eval("Groups.plus_class.plus", eval_binop "#add_"),
    67 			 Thm ("NTH_NIL",ThmC.numerals_to_Free @{thm NTH_NIL}),
    68 			 Eval("Prog_Expr.lhs", eval_lhs "eval_lhs_"),
    69 			 Eval("Prog_Expr.rhs", eval_rhs "eval_rhs_"),
    70 			 Eval("Prog_Expr.argument'_in", eval_argument_in "Prog_Expr.argument'_in")
    71 			 ],
    72 		scr = Empty_Prog};
    73 val rm_ = TermC.str2term"[M_b 0 = 0, M_b L = 0]";
    74 val M__ = TermC.str2term"M_b x = -1 * x ^^^ 2 / 2 + x * c + c_2";
    75 val SOME (e1__,_) = rewrite_set_ thy false srls 
    76   (TermC.str2term "(NTH::[real,bool list]=>bool) 1 " $ rm_);
    77 if UnparseC.term e1__ = "M_b 0 = 0" then () else error "biegelinie.sml simplify NTH 1 rm_";
    78 
    79 val SOME (x1__,_) = 
    80     rewrite_set_ thy false srls 
    81 		 (TermC.str2term"argument_in (lhs (M_b 0 = 0))");
    82 if UnparseC.term x1__ = "0" then ()
    83 else error "biegelinie.sml simplify argument_in (lhs (M_b 0 = 0)";
    84 
    85 (*Rewrite.trace_on := true; ..stopped Test_Isac.thy*)
    86 Rewrite.trace_on:=false;
    87 
    88 "----------- SubProblem (_,[setzeRandbedingungen,Biegelinien] ----";
    89 "----------- SubProblem (_,[setzeRandbedingungen,Biegelinien] ----";
    90 "----------- SubProblem (_,[setzeRandbedingungen,Biegelinien] ----";
    91 val fmz = ["functionEq (M_b x = c_2 + c * x + -1 * q_0 / 2 * x ^^^ 2)", 
    92 	   "substitution (M_b L = 0)", 
    93 	   "equality equ_equ"];
    94 val (dI',pI',mI') = ("Biegelinie", ["makeFunctionTo", "equation"],
    95 		     ["Equation", "fromFunction"]);
    96 val p = e_pos'; val c = [];
    97 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
    98 val (p,_,f,nxt,_,pt) = me nxt p c pt;val (p,_,f,nxt,_,pt) = me nxt p c pt;
    99 val (p,_,f,nxt,_,pt) = me nxt p c pt;val (p,_,f,nxt,_,pt) = me nxt p c pt;
   100 val (p,_,f,nxt,_,pt) = me nxt p c pt;val (p,_,f,nxt,_,pt) = me nxt p c pt;
   101 val (p,_,f,nxt,_,pt) = me nxt p c pt;
   102 
   103 val (p,_,f,nxt,_,pt) = me nxt p c pt; f2str f = 
   104 			"M_b x = c_2 + c * x + -1 * q_0 / 2 * x ^^^ 2";
   105 val (p,_,f,nxt,_,pt) = me nxt p c pt; f2str f = 
   106                         "M_b L = c_2 + c * L + -1 * q_0 / 2 * L ^^^ 2";
   107 val (p,_,f,nxt,_,pt) = me nxt p c pt; f2str f = 
   108 			"0 = c_2 + c * L + -1 * q_0 / 2 * L ^^^ 2";
   109 val (p,_,f,nxt,_,pt) = me nxt p c pt; f2str f;
   110 val (p,_,f,nxt,_,pt) = me nxt p c pt; f2str f;
   111 if (* f2str f = "0 = c_2 + L * c + -1 * q_0 / 2 * L ^^^ 2" CHANGE NOT considered, already on leave*)
   112    f2str f = "0 = (2 * c_2 + 2 * L * c + -1 * L ^^^ 2 * q_0) / 2"
   113 then case nxt of End_Proof' => ()
   114   | _ => error "biegelinie.sml: SubProblem (_,[setzeRandbed 1"
   115 else error "biegelinie.sml: SubProblem (_,[setzeRandbed 2";
   116 
   117 "----------- investigate normalforms in biegelinien --------------";
   118 "----------- investigate normalforms in biegelinien --------------";
   119 "----------- investigate normalforms in biegelinien --------------";
   120 "----- coming from integration, kept for later improvements:";
   121 val Q = TermC.str2term "Q x = c + -1 * q_0 * x";
   122 val M_b = TermC.str2term "M_b x = c_2 + c * x + -1 * q_0 / 2 * x ^^^ 2";
   123 val y' = TermC.str2term "y' x = c_3 + 1 / (-1 * EI) * (c_2 * x + c / 2 * x ^^^ 2 + -1 * q_0 / 6 * x ^^^ 3)";
   124 val y = TermC.str2term "y x = c_4 + c_3 * x +\n1 / (-1 * EI) * (c_2 / 2 * x ^^^ 2 + c / 6 * x ^^^ 3 + -1 * q_0 / 24 * x ^^^ 4)";
   125 (*^^^  1 / (-1 * EI) NOT distributed - ok! ^^^^^^^^^^^^^^^^^^^^^^^*)