1.1 --- a/test/Tools/isac/Knowledge/eqsystem.sml Wed Sep 08 16:45:27 2010 +0200
1.2 +++ b/test/Tools/isac/Knowledge/eqsystem.sml Wed Sep 08 16:47:22 2010 +0200
1.3 @@ -865,7 +865,7 @@
1.4 \0 = -1 * q_0 * L ^^^ 2 / 2 + L * c + c_2]",
1.5 "solveForVars [c, c_2]", "solution L"];
1.6 val (dI',pI',mI') =
1.7 - ("Biegelinie.thy",["normalize", "2x2", "linear", "system"],
1.8 + ("Biegelinie",["normalize", "2x2", "linear", "system"],
1.9 ["EqSystem","normalize","2x2"]);
1.10 val p = e_pos'; val c = [];
1.11 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
1.12 @@ -883,7 +883,7 @@
1.13 val (p,_,f,nxt,_,pt) = me nxt p c pt;f2str f;
1.14 val (p,_,f,nxt,_,pt) = me nxt p c pt;f2str f;
1.15 case nxt of
1.16 - (_, Subproblem ("Biegelinie.thy", ["triangular", "2x2", "linear",_])) => ()
1.17 + (_, Subproblem ("Biegelinie", ["triangular", "2x2", "linear",_])) => ()
1.18 | _ => raise error "eqsystem.sml me [EqSystem,normalize,2x2] SubProblem";
1.19
1.20 val (p,_,f,nxt,_,pt) = me nxt p c pt;val (p,_,f,nxt,_,pt) = me nxt p c pt;
1.21 @@ -933,7 +933,7 @@
1.22 \ -1 * q_0 / 24 * L ^^^ 4)]",
1.23 "solveForVars [c, c_2]", "solution L"];
1.24 val (dI',pI',mI') =
1.25 - ("Biegelinie.thy",["linear", "system"], ["no_met"]);
1.26 + ("Biegelinie",["linear", "system"], ["no_met"]);
1.27 val p = e_pos'; val c = [];
1.28 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
1.29 val (p,_,f,nxt,_,pt) = me nxt p c pt;val (p,_,f,nxt,_,pt) = me nxt p c pt;
1.30 @@ -952,7 +952,7 @@
1.31 "[c_2 = 0, L * c + c_2 = -1 * q_0 * L ^^^ 4 / (24 * EI)]"
1.32 then () else raise error "eqsystem.sml me simpl. before SubProblem b";
1.33 case nxt of
1.34 - (_, Subproblem ("Biegelinie.thy", ["triangular", "2x2", "linear",_])) => ()
1.35 + (_, Subproblem ("Biegelinie", ["triangular", "2x2", "linear",_])) => ()
1.36 | _ => raise error "eqsystem.sml me [linear,system] SubProblem b";
1.37
1.38 val (p,_,f,nxt,_,pt) = me nxt p c pt;val (p,_,f,nxt,_,pt) = me nxt p c pt;
1.39 @@ -1004,7 +1004,7 @@
1.40 CalcTree [(["Traegerlaenge L","Streckenlast q_0","Biegelinie y",
1.41 "Randbedingungen [y 0 = 0, y L = 0, M_b 0 = 0, M_b L = 0]",
1.42 "FunktionsVariable x"],
1.43 - ("Biegelinie.thy", ["Biegelinien"],
1.44 + ("Biegelinie", ["Biegelinien"],
1.45 ["IntegrierenUndKonstanteBestimmen2"]))];
1.46 moveActiveRoot 1;
1.47 (*
1.48 @@ -1045,7 +1045,7 @@
1.49 "Biegelinie y",
1.50 "Randbedingungen [y L = 0, y' L = 0]",
1.51 "FunktionsVariable x"],
1.52 - ("Biegelinie.thy", ["vonMomentenlinieZu","Biegelinien"],
1.53 + ("Biegelinie", ["vonMomentenlinieZu","Biegelinien"],
1.54 ["Biegelinien", "AusMomentenlinie"]))];
1.55 moveActiveRoot 1;
1.56 (*
1.57 @@ -1057,7 +1057,7 @@
1.58 CalcTree [(["Traegerlaenge L","Streckenlast q_0","Biegelinie y",
1.59 "Randbedingungen [y 0 = 0, y L = 0, y' 0 = 0, y' L = 0]",
1.60 "FunktionsVariable x"],
1.61 - ("Biegelinie.thy", ["Biegelinien"],
1.62 + ("Biegelinie", ["Biegelinien"],
1.63 ["IntegrierenUndKonstanteBestimmen2"] ))];
1.64 moveActiveRoot 1;
1.65 (*
1.66 @@ -1077,7 +1077,7 @@
1.67 CalcTree [(["Traegerlaenge L","Streckenlast q_0","Biegelinie y",
1.68 "Randbedingungen [Q 0 = q_0 * L, M_b L = 0, y 0 = 0, y' 0 = 0]",
1.69 "FunktionsVariable x"],
1.70 - ("Biegelinie.thy", ["Biegelinien"],
1.71 + ("Biegelinie", ["Biegelinien"],
1.72 ["IntegrierenUndKonstanteBestimmen2"] ))];
1.73 moveActiveRoot 1;
1.74 (*
1.75 @@ -1125,7 +1125,7 @@
1.76 \ 0 = c_3]",
1.77 "solveForVars [c, c_2, c_3, c_4]", "solution L"];
1.78 val (dI',pI',mI') =
1.79 - ("Biegelinie.thy",["linear", "system"],["no_met"]);
1.80 + ("Biegelinie",["linear", "system"],["no_met"]);
1.81 val p = e_pos'; val c = [];
1.82 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
1.83 val (p,_,f,nxt,_,pt) = me nxt p c pt;val (p,_,f,nxt,_,pt) = me nxt p c pt;
1.84 @@ -1303,7 +1303,7 @@
1.85 \[c = L * q_0, L * c + c_2 = q_0 * L ^^^ 2 / 2, c_3 = 0, c_4 = 0]",
1.86 "solveForVars [c, c_2, c_3, c_4]", "solution L"];
1.87 val (dI',pI',mI') =
1.88 - ("Biegelinie.thy",["linear", "system"],["no_met"]);
1.89 + ("Biegelinie",["linear", "system"],["no_met"]);
1.90 val p = e_pos'; val c = [];
1.91 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
1.92 val (p,_,f,nxt,_,pt) = me nxt p c pt;val (p,_,f,nxt,_,pt) = me nxt p c pt;
1.93 @@ -1328,7 +1328,7 @@
1.94 CalcTree [(["Traegerlaenge L","Streckenlast q_0","Biegelinie y",
1.95 "Randbedingungen [M_b L = 0, y 0 = 0, y L = 0, y' 0 = 0]",
1.96 "FunktionsVariable x"],
1.97 - ("Biegelinie.thy", ["Biegelinien"],
1.98 + ("Biegelinie", ["Biegelinien"],
1.99 ["IntegrierenUndKonstanteBestimmen2"] ))];
1.100 moveActiveRoot 1;
1.101 (*
1.102 @@ -1350,7 +1350,7 @@
1.103 "Biegelinie y",
1.104 "Randbedingungen [y 0 = 0, y L = 0]",
1.105 "FunktionsVariable x"],
1.106 - ("Biegelinie.thy", ["vonMomentenlinieZu","Biegelinien"],
1.107 + ("Biegelinie", ["vonMomentenlinieZu","Biegelinien"],
1.108 ["Biegelinien", "AusMomentenlinie"]))];
1.109 moveActiveRoot 1;
1.110 (*
1.111 @@ -1362,7 +1362,7 @@
1.112 CalcTree [(["Traegerlaenge L","Streckenlast (q_0 / L * x)","Biegelinie y",
1.113 "Randbedingungen [M_b 0 = 0, M_b L = 0, y 0 = 0, y L = 0]",
1.114 "FunktionsVariable x"],
1.115 - ("Biegelinie.thy", ["Biegelinien"],
1.116 + ("Biegelinie", ["Biegelinien"],
1.117 ["IntegrierenUndKonstanteBestimmen2"] ))];
1.118 moveActiveRoot 1;
1.119 (*
1.120 @@ -1383,7 +1383,7 @@
1.121 "Biegelinie y",
1.122 "Randbedingungen [y L = 0, y' L = 0]",
1.123 "FunktionsVariable x"],
1.124 - ("Biegelinie.thy", ["vonMomentenlinieZu","Biegelinien"],
1.125 + ("Biegelinie", ["vonMomentenlinieZu","Biegelinien"],
1.126 ["Biegelinien", "AusMomentenlinie"]))];
1.127 moveActiveRoot 1;
1.128 (*
1.129 @@ -1403,7 +1403,7 @@
1.130 \ 0 = (2 * c_2 + 2 * L * c + -1 * L ^^^ 2 * q_0) / 2]",
1.131 "solveForVars [c, c_2, c_3, c_4]", "solution L"];
1.132 val (dI',pI',mI') =
1.133 - ("Biegelinie.thy",["normalize", "4x4", "linear", "system"],
1.134 + ("Biegelinie",["normalize", "4x4", "linear", "system"],
1.135 ["EqSystem","normalize","4x4"]);
1.136 val p = e_pos'; val c = [];
1.137 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];