1.1 --- a/test/Tools/isac/Test_Isac_Short.thy Tue Jul 13 15:28:43 2021 +0200
1.2 +++ b/test/Tools/isac/Test_Isac_Short.thy Thu Jul 15 14:10:18 2021 +0200
1.3 @@ -231,7 +231,7 @@
1.4 ML_file "MathEngBasic/thmC.sml"
1.5 ML_file "MathEngBasic/rewrite.sml"
1.6 ML_file "MathEngBasic/tactic.sml"
1.7 - ML_file "MathEngBasic/ctree.sml"
1.8 +(*ML_file "MathEngBasic/ctree.sml" TOODOO Isa hangs ?!?*)
1.9 ML_file "MathEngBasic/calculation.sml"
1.10
1.11 ML_file "Specify/formalise.sml"
1.12 @@ -254,6 +254,695 @@
1.13 ML_file "Interpret/error-pattern.sml"
1.14 ML_file "Interpret/li-tool.sml"
1.15 ML_file "Interpret/lucas-interpreter.sml"
1.16 +ML \<open>
1.17 +\<close> ML \<open>
1.18 +(* Title: "Interpret/lucas-interpreter.sml"
1.19 + Author: Walther Neuper
1.20 + (c) due to copyright terms
1.21 +*)
1.22 +
1.23 +"-----------------------------------------------------------------------------------------------";
1.24 +"table of contents -----------------------------------------------------------------------------";
1.25 +"-----------------------------------------------------------------------------------------------";
1.26 +"----------- Take as 1st stac in program -------------------------------------------------------";
1.27 +"----------- re-build: fun locate_input_tactic -------------------------------------------------";
1.28 +"----------- fun locate_input_tactic Helpless, NOT applicable ----------------------------------";
1.29 +"----------- re-build: fun find_next_step, mini ------------------------------------------------";
1.30 +"----------- re-build: fun locate_input_term ---------------------------------------------------";
1.31 +"-----------------------------------------------------------------------------------------------";
1.32 +"-----------------------------------------------------------------------------------------------";
1.33 +"-----------------------------------------------------------------------------------------------";
1.34 +
1.35 +"----------- Take as 1st stac in program -------------------------------------------------------";
1.36 +"----------- Take as 1st stac in program -------------------------------------------------------";
1.37 +"----------- Take as 1st stac in program -------------------------------------------------------";
1.38 +"compare --- Apply_Method with initial Take by Step.do_next --- in test/../step-solve ----------";
1.39 +val p = e_pos'; val c = [];
1.40 +val (p,_,f,nxt,_,pt) =
1.41 + CalcTreeTEST
1.42 + [(["functionTerm (x \<up> 2 + 1)", "integrateBy x", "antiDerivative FF"],
1.43 + ("Integrate", ["integrate", "function"], ["diff", "integration"]))];
1.44 +val (p,_,f,nxt,_,pt) = me nxt p c pt; (*nxt = ("Tac ", ...) --> Add_Given...*)
1.45 +val (p,_,f,nxt,_,pt) = me nxt p c pt;
1.46 +val (p,_,f,nxt,_,pt) = me nxt p c pt;
1.47 +val (p,_,f,nxt,_,pt) = me nxt p c pt;
1.48 +val (p,_,f,nxt,_,pt) = me nxt p c pt;
1.49 +val (p,_,f,nxt,_,pt) = me nxt p c pt;
1.50 +val (p,_,f,nxt,_,pt) = me nxt p c pt;
1.51 +case nxt of (Apply_Method ["diff", "integration"]) => ()
1.52 + | _ => error "integrate.sml -- me method [diff,integration] -- spec";
1.53 +"----- step 8: returns nxt = Rewrite_Set_Inst ([\"(''bdv'', x)\"],\"integration\")";
1.54 +
1.55 +"~~~~~ fun me, args:"; val (tac, (p:pos'), _, (pt:ctree)) = (nxt, p, c, pt);
1.56 +"~~~~~ fun Step.by_tactic, args:"; val (tac, (ptp as (pt, p))) = (tac, (pt,p));
1.57 +val Applicable.Yes m = Step.check tac (pt, p);
1.58 + (*if*) Tactic.for_specify' m; (*false*)
1.59 +"~~~~~ fun loc_solve_ , args:"; val (m, (pt,pos)) = (m, ptp);
1.60 +
1.61 +"~~~~~ fun Step_Solve.by_tactic , args:"; val (m as Apply_Method' (mI, _, _, ctxt), (pt, (pos as (p,_))))
1.62 + = (m, (pt, pos));
1.63 + val {srls, ...} = MethodC.from_store mI;
1.64 + val itms = case get_obj I pt p of
1.65 + PblObj {meth=itms, ...} => itms
1.66 + | _ => error "solve Apply_Method: uncovered case get_obj"
1.67 + val thy' = get_obj g_domID pt p;
1.68 + val thy = ThyC.get_theory thy';
1.69 + val srls = LItool.get_simplifier (pt, pos)
1.70 + val (is, env, ctxt, sc) = case LItool.init_pstate srls ctxt itms mI of
1.71 + (is as Istate.Pstate {env, ...}, ctxt, sc) => (is, env, ctxt, sc)
1.72 + | _ => error "solve Apply_Method: uncovered case init_pstate";
1.73 +(*+*)pstate2str (the_pstate is) = "([\"\n(f_f, x \<up> 2 + 1)\",\"\n(v_v, x)\"], [], empty, NONE, \n??.empty, ORundef, false, true)";
1.74 + val ini = LItool.implicit_take sc env;
1.75 + val p = lev_dn p;
1.76 +
1.77 + val NONE = (*case*) ini (*of*);
1.78 + val Next_Step (is', ctxt', m') =
1.79 + LI.find_next_step sc (pt, (p, Res)) is ctxt;
1.80 +(*+*)pstate2str (the_pstate is') = "([\"\n(f_f, x \<up> 2 + 1)\",\"\n(v_v, x)\"], [R,L,R], empty, NONE, \nIntegral x \<up> 2 + 1 D x, ORundef, false, false)";
1.81 + val Safe_Step (_, _, Take' _) = (*case*)
1.82 + locate_input_tactic sc (pt, (p, Res)) is' ctxt' m' (*of*);
1.83 +"~~~~~ fun locate_input_tactic , args:"; val ((Prog prog), cstate, istate, ctxt, tac)
1.84 + = (sc, (pt, (p, Res)), is', ctxt', m');
1.85 +
1.86 + (*case*) scan_to_tactic1 (prog, (cstate, ctxt, tac)) istate (*of*);
1.87 +"~~~~~ fun scan_to_tactic1 , args:"; val ((prog, (cctt as ((_, p), _, _))), (Istate.Pstate (ist as {path, ...})))
1.88 + = ((prog, (cstate, ctxt, tac)), istate);
1.89 + (*if*) path = [] orelse ((last_elem o fst) p = 0 andalso snd p = Res) (*then*);
1.90 +
1.91 + val Accept_Tac1 (_, _, Take' _) =
1.92 + scan_dn1 cctt (ist |> set_path [R] |> set_or ORundef) (Program.body_of prog);
1.93 +"~~~~~ fun scan_dn1 , args:"; val (xxx, ist, (Const ("HOL.Let", _) $ e $ (Abs (id, T, b))))
1.94 + = (cctt, (ist |> set_path [R] |> set_or ORundef), (Program.body_of prog));
1.95 +
1.96 +(*+*) if UnparseC.term e = "Take (Integral f_f D v_v)" then () else error "scan_dn1 Integral changed";
1.97 +
1.98 + (*case*)
1.99 + scan_dn1 xxx (ist |> path_down [L, R]) e (*of*);
1.100 + (*======= end of scanning tacticals, a leaf =======*)
1.101 +"~~~~~ fun scan_dn1 , args:"; val (((pt, p), ctxt, tac), (ist as {eval, or, ...}), t)
1.102 + = (xxx, (ist |> path_down [L, R]), e);
1.103 +val (Program.Tac stac, a') = check_leaf "locate" ctxt eval (get_subst ist) t;
1.104 +
1.105 +
1.106 +
1.107 +"----------- re-build: fun locate_input_tactic -------------------------------------------------";
1.108 +"----------- re-build: fun locate_input_tactic -------------------------------------------------";
1.109 +"----------- re-build: fun locate_input_tactic -------------------------------------------------";
1.110 +val fmz = ["equality (x+1=(2::real))", "solveFor x", "solutions L"];
1.111 +val (dI',pI',mI') = ("Test", ["sqroot-test", "univariate", "equation", "test"],
1.112 + ["Test", "squ-equ-test-subpbl1"]);
1.113 +val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
1.114 +val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1.115 +val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1.116 +val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1.117 +val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1.118 +val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1.119 +val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1.120 +(*[], Met*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = (_, Apply_Method ["Test", "squ-equ-test-subpbl1"])*);
1.121 +(*[1], Frm*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = ("Rewrite_Set", Rewrite_Set "norm_equation")*)
1.122 +
1.123 +(*//------------------ begin step into ------------------------------------------------------\\*)
1.124 +(*[1], Res*)val (p'''''_''',_,f,nxt'''''_''',_,pt'''''_''') = me nxt p [] pt; (*nxt = Rewrite_Set "Test_simplify"*)
1.125 +
1.126 +"~~~~~ fun me , args:"; val (tac, p, _(*NEW remove*), pt) = (nxt, p, [], pt);
1.127 +
1.128 + (** )val (***)xxxx(***) ( *("ok", (_, _, (pt, p))) =( **) (*case*)
1.129 + Step.by_tactic tac (pt,p) (*of*);
1.130 +"~~~~~ fun by_tactic , args:"; val (tac, (ptp as (pt, p))) = (tac, (pt,p));
1.131 + val Applicable.Yes m = (*case*) Solve_Step.check tac (pt, p) (*of*);
1.132 + (*if*) Tactic.for_specify' m; (*false*)
1.133 +
1.134 + (** )val (***)xxxxx_x(***) ( *(msg, cs') =( **)
1.135 +Step_Solve.by_tactic m ptp;
1.136 +"~~~~~ fun by_tactic , args:"; val (m, (pt, po as (p, p_))) = (m, ptp);
1.137 +(*+*)val (pt'''''_', (p'''''_', p_'''''_')) = (pt, (p, p_));
1.138 + (*if*) MethodC.id_empty = get_obj g_metID pt (par_pblobj pt p); (*else*)
1.139 + val thy' = get_obj g_domID pt (par_pblobj pt p);
1.140 + val (is, sc) = LItool.resume_prog thy' (p,p_) pt;
1.141 +
1.142 + locate_input_tactic sc (pt, po) (fst is) (snd is) m;
1.143 +"~~~~~ fun locate_input_tactic , args:"; val (Prog prog, cstate, istate, ctxt, tac)
1.144 + = (sc, (pt, po), (fst is), (snd is), m);
1.145 + val srls = get_simplifier cstate;
1.146 +
1.147 + (** )val Accept_Tac1 ((is as (_,_,_,_,_,strong_ass), ctxt, ss as((tac', _, ctree, pos', _) :: _))) =( **)
1.148 + (*case*) scan_to_tactic1 (prog, (cstate, ctxt, tac)) istate (*of*);
1.149 +"~~~~~ fun scan_to_tactic1 , args:"; val ((prog, (cctt as ((_, p), _, _))), (Istate.Pstate (ist as {path, ...})))
1.150 + = ((prog, (cstate, ctxt, tac)), istate);
1.151 + (*if*) path = [] orelse ((last_elem o fst) p = 0 andalso snd p = Res) (*then*);
1.152 +
1.153 + (** )val xxxxx_xx = ( **)
1.154 + scan_dn1 cctt (ist |> set_path [R] |> set_or ORundef) (Program.body_of prog);
1.155 +"~~~~~ fun scan_dn1 , args:"; val (xxx, ist, (Const ("HOL.Let", _) $ e $ (Abs (id, T, b))))
1.156 + = (cctt, (ist |> set_path [R] |> set_or ORundef), (Program.body_of prog));
1.157 +
1.158 + (*case*) scan_dn1 xxx (ist |> path_down [L, R]) e (*of*);
1.159 +"~~~~~ fun scan_dn1 , args:"; val ((xxx as (cstate, _, _)), ist, (Const ("Tactical.Chain"(*1*), _) $ e1 $ e2 $ a))
1.160 + = (xxx, (ist |> path_down [L, R]), e);
1.161 +
1.162 + (*case*) scan_dn1 xxx (ist |> path_down_form ([L, L, R], a)) e1 (*of*);
1.163 +"~~~~~ fun scan_dn1 , args:"; val (xxx, ist, (Const ("Tactical.Try"(*2*), _) $ e))
1.164 + = (xxx, (ist |> path_down_form ([L, L, R], a)), e1);
1.165 +
1.166 + (*case*) scan_dn1 xxx (ist |> path_down [R]) e (*of*);
1.167 + (*======= end of scanning tacticals, a leaf =======*)
1.168 +"~~~~~ fun scan_dn1 , args:"; val (((pt, p), ctxt, tac), (ist as {env, eval, or, ...}), t)
1.169 + = (xxx, (ist |> path_down [R]), e);
1.170 + val (Program.Tac stac, a') =
1.171 + (*case*) check_leaf "locate" ctxt eval (get_subst ist) t (*of*);
1.172 + val LItool.Associated (m, v', ctxt) =
1.173 + (*case*) associate pt ctxt (m, stac) (*of*);
1.174 +
1.175 + Accept_Tac1 (ist |> set_subst_true (a', v'), ctxt, m) (*return value*);
1.176 +"~~~~~ from scan_dn1 to scan_to_tactic1 return val:"; val (xxxxx_xx)
1.177 + = (Accept_Tac1 (ist |> set_subst_true (a', v'), ctxt, m));
1.178 +
1.179 +"~~~~~ from scan_to_tactic1 to fun locate_input_tactic return val:"; val Accept_Tac1 ((ist as {assoc, ...}), ctxt, tac')
1.180 + = (Accept_Tac1 (ist |> set_subst_true (a', v'), ctxt, m));
1.181 + (*if*) LibraryC.assoc (*then*);
1.182 +
1.183 + Safe_Step (Istate.Pstate ist, ctxt, tac') (*return value*);
1.184 +"~~~~~ from locate_input_tactic to fun Step_Solve.by_tactic return:"; val Safe_Step (istate, ctxt, tac)
1.185 + = (*xxxxx_xx*)(**)Safe_Step (Istate.Pstate ist, ctxt, tac')(**);
1.186 +
1.187 +(*+*)val (pt, po as (p, p_)) = (pt'''''_', (p'''''_', p_'''''_')); (* from begin of by_tactic *)
1.188 + val (p'', _, _,pt') =
1.189 + Step.add tac (istate, ctxt) (pt, (lev_on p, Pbl));
1.190 + (*in*)
1.191 +
1.192 + ("ok", ([(Tactic.input_from_T tac, tac, (p'', (istate, ctxt)))],
1.193 + [(*ctree NOT cut*)], (pt', p''))) (*return value*);
1.194 +"~~~~~ from Step_Solve.by_tactic \<longrightarrow> Step.by_tactic return:"; val ((msg, cs' : Calc.state_post))
1.195 + = ("ok", ([(Tactic.input_from_T tac, tac, (p'', (istate, ctxt)) )],
1.196 + [(*ctree NOT cut*)], (pt', p'')));
1.197 +
1.198 +"~~~~~ from Step.by_tactic to me return:"; val (("ok", (_, _, (pt, p)))) = (*** )xxxx( ***) ("ok", cs');
1.199 + val (_, ts) =
1.200 + (case Step.do_next p ((pt, Pos.e_pos'), []) of
1.201 + ("ok", (ts as (_, _, _) :: _, _, _)) => ("", ts)
1.202 + | ("helpless", _) => ("helpless: cannot propose tac", [])
1.203 + | ("no-fmz-spec", _) => error "no-fmz-spec"
1.204 + | ("end-of-calculation", (ts, _, _)) => ("", ts)
1.205 + | _ => error "me: uncovered case")
1.206 + handle ERROR msg => raise ERROR msg
1.207 + val tac =
1.208 + case ts of
1.209 + tacis as (_::_) => let val (tac, _, _) = last_elem tacis in tac end
1.210 + | _ => if p = ([], Pos.Res) then Tactic.End_Proof' else Tactic.Empty_Tac;
1.211 +
1.212 + (p, [] : NEW, TESTg_form (pt, p), (Tactic.tac2IDstr tac, tac), Celem.Sundef, pt);
1.213 +"~~~~~ from me to TOOPLEVEL return:"; val (p,_,f,nxt,_,pt)
1.214 + = (*** )xxx( ***) (p, [] : NEW, TESTg_form (pt, p), (Tactic.tac2IDstr tac, tac), Celem.Sundef, pt);
1.215 +
1.216 +(*//--------------------- check results from modified me ----------------------------------\\*)
1.217 +if p = ([2], Res) andalso
1.218 + pr_ctree pr_short pt = ". ----- pblobj -----\n1. x + 1 = 2\n2. x + 1 = 2\n"
1.219 +then
1.220 + (case nxt of ("Rewrite_Set", Rewrite_Set "Test_simplify") => ()
1.221 + | _ => error "")
1.222 +else error "check results from modified me CHANGED";
1.223 +(*\\--------------------- check results from modified me ----------------------------------//*)
1.224 +
1.225 +"~~~~~ from me to TOPLEVEL return:"; val (p,_,f,nxt,_,pt) = (*** )xxx( ***) (**)(p, 000, f, nxt, 000, pt)(**);
1.226 +(*\\------------------ end step into --------------------------------------------------------//*)
1.227 +
1.228 +(*[3], Res*)val (p,_,f,nxt,_,pt) = me nxt'''''_''' p'''''_''' [] pt'''''_'''; (*nxt = Subproblem ("Test", ["LINEAR", "univariate", "equation", "test"])*)
1.229 +(*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Model_Problem*)
1.230 +(*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Add_Given "equality (- 1 + x = 0)"*)
1.231 +(*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Add_Given "solveFor x"*)
1.232 +(*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Add_Find "solutions x_i"*)
1.233 +(*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Specify_Theory "Test"*)
1.234 +(*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Specify_Problem ["LINEAR", "univariate", "equation", "test"]*)
1.235 +(*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Specify_Method ["Test", "solve_linear"]*)
1.236 +(*[3], Met*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Apply_Method ["Test", "solve_linear"]*)
1.237 +(*[3, 1], Frm*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Rewrite_Set_Inst (["(''bdv'', x)"], "isolate_bdv")*)
1.238 +(*[3, 1], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Rewrite_Set "Test_simplify"*)
1.239 +(*[3, 2], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Check_Postcond ["LINEAR", "univariate", "equation", "test"]*)
1.240 +(*[3], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Check_elementwise "Assumptions"*)
1.241 +(*[4], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Check_Postcond ["sqroot-test", "univariate", "equation", "test"]*)
1.242 +(*[], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = End_Proof'*)
1.243 +
1.244 +(*/--------------------- final test ----------------------------------\\*)
1.245 +if p = ([], Res) andalso f2str f = "[x = 1]" andalso pr_ctree pr_short pt =
1.246 + ". ----- pblobj -----\n" ^
1.247 + "1. x + 1 = 2\n" ^
1.248 + "2. x + 1 + - 1 * 2 = 0\n" ^
1.249 + "3. ----- pblobj -----\n" ^
1.250 + "3.1. - 1 + x = 0\n" ^
1.251 + "3.2. x = 0 + - 1 * - 1\n" ^
1.252 + "4. [x = 1]\n"
1.253 +then case nxt of End_Proof' => () | _ => error "re-build: fun locate_input_tactic changed 1"
1.254 +else error "re-build: fun locate_input_tactic changed 2";
1.255 +
1.256 +
1.257 +\<close> ML \<open>
1.258 +"----------- fun locate_input_tactic Helpless, NOT applicable ----------------------------------";
1.259 +"----------- fun locate_input_tactic Helpless, NOT applicable ----------------------------------";
1.260 +"----------- fun locate_input_tactic Helpless, NOT applicable ----------------------------------";
1.261 +(*cp from -- try fun applyTactics ------- *)
1.262 +val (p,_,f,nxt,_,pt) = CalcTreeTEST [(["Term (5*e + 6*f - 8*g - 9 - 7*e - 4*f + 10*g + 12)",
1.263 + "normalform N"],
1.264 + ("PolyMinus",["plus_minus", "polynom", "vereinfachen"],
1.265 + ["simplification", "for_polynomials", "with_minus"]))];
1.266 +val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1.267 +val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1.268 +val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1.269 +\<close> ML \<open>
1.270 +f
1.271 +\<close> ML \<open>
1.272 +(*[1], Frm*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Rewrite_Set "ordne_alphabetisch"*)
1.273 +\<close> ML \<open>
1.274 +val Test_Out.FormKF "5 * e + 6 * f - 8 * g - 9 - 7 * e - 4 * f + 10 * g + 12" = f
1.275 +\<close> ML \<open>
1.276 +(*[1], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Rewrite_Set "fasse_zusammen"*)
1.277 +
1.278 +\<close> ML \<open>
1.279 +f
1.280 +\<close> ML \<open>
1.281 +map Tactic.input_to_string (specific_from_prog pt p)
1.282 +\<close> ML \<open>
1.283 +(*+*)if map Tactic.input_to_string (specific_from_prog pt p) =
1.284 + ["Rewrite (\"subtrahiere_x_plus_minus\", \"\<lbrakk>?l is_const; ?m is_const\<rbrakk>\n\<Longrightarrow> ?x + ?m * ?v - ?l * ?v = ?x + (?m - ?l) * ?v\")",
1.285 + "Rewrite (\"subtrahiere_x_minus_plus\", \"\<lbrakk>?l is_const; ?m is_const\<rbrakk>\n\<Longrightarrow> ?x - ?m * ?v + ?l * ?v = ?x + (- ?m + ?l) * ?v\")"]
1.286 + then () else error "specific_from_prog ([1], Res) CHANGED";
1.287 +(*[2], Res*)val ("ok", (_, _, ptp as (pt, p))) = Step.by_tactic (hd (specific_from_prog pt p)) (pt, p);
1.288 +
1.289 +\<close> ML \<open>
1.290 +(*+*)if map Tactic.input_to_string (specific_from_prog pt p) =
1.291 + ["Rewrite (\"tausche_minus\", \"\<lbrakk>?b ist_monom; ?a kleiner ?b\<rbrakk>\n\<Longrightarrow> ?b - ?a = - ?a + ?b\")", "Rewrite (\"tausche_plus_minus\", \"?b kleiner ?c \<Longrightarrow> ?a + ?c - ?b = ?a - ?b + ?c\")",
1.292 + "Rewrite (\"subtrahiere_x_plus_minus\", \"\<lbrakk>?l is_const; ?m is_const\<rbrakk>\n\<Longrightarrow> ?x + ?m * ?v - ?l * ?v = ?x + (?m - ?l) * ?v\")",
1.293 + "Rewrite (\"subtrahiere_x_minus_plus\", \"\<lbrakk>?l is_const; ?m is_const\<rbrakk>\n\<Longrightarrow> ?x - ?m * ?v + ?l * ?v = ?x + (- ?m + ?l) * ?v\")", "Calculate MINUS"]
1.294 + then () else error "specific_from_prog ([1], Res) CHANGED";
1.295 +(* = ([3], Res)*)val ("ok", (_, _, ptp as (pt, p))) = Step.by_tactic (hd (specific_from_prog pt p)) (pt, p);
1.296 +
1.297 +\<close> ML \<open>
1.298 +(*//----------------- exception PTREE "get_obj f EmptyPtree" raised --------------------------\\*)
1.299 +(** )val ("ok", (_, _, ptp as (pt, p))) =( **)
1.300 + Step.by_tactic (hd (specific_from_prog pt p)) (pt, p);
1.301 +"~~~~~ fun by_tactic , args:"; val (tac, (ptp as (pt, p))) = (hd (specific_from_prog pt p), (pt, p));
1.302 + val Applicable.Yes m = (*case*) Solve_Step.check tac (pt, p) (*of*);
1.303 + (*if*) Tactic.for_specify' m; (*false*)
1.304 +
1.305 +Step_Solve.by_tactic m (pt, p);
1.306 +"~~~~~ fun by_tactic , args:"; val (m, (pt, po as (p, p_))) = (m, (pt, p));
1.307 + (*if*) MethodC.id_empty = get_obj g_metID pt (par_pblobj pt p) (*else*);
1.308 + val thy' = get_obj g_domID pt (par_pblobj pt p);
1.309 + val (is, sc) = LItool.resume_prog thy' (p,p_) pt;
1.310 +
1.311 + (*case*) locate_input_tactic sc (pt, po) (fst is) (snd is) m (*of*);
1.312 +"~~~~~ fun locate_input_tactic , args:"; val ((Rule.Prog prog), (cstate as (pt, (*?*)pos(*?*))), istate, ctxt, tac)
1.313 + = (sc, (pt, po), (fst is), (snd is), m);
1.314 + val srls = LItool.get_simplifier cstate (*TODO: shift into Istate.T*);
1.315 +
1.316 + (*case*) scan_to_tactic1 (prog, (cstate, ctxt, tac)) istate (*of*);
1.317 +"~~~~~ fun scan_to_tactic1 , args:"; val ((prog, (cctt as ((_, p), _, _))), (Istate.Pstate (ist as {path, ...})))
1.318 + = ((prog, (cstate, ctxt, tac)), istate);
1.319 + (*if*) path = [] orelse ((last_elem o fst) p = 0 andalso snd p = Res) (*else*);
1.320 +
1.321 + go_scan_up1 (prog, cctt) ist;
1.322 +"~~~~~ fun go_scan_up1 , args:"; val ((pcct as (prog, _)), (ist as {path, ...}))
1.323 + = ((prog, cctt), ist);
1.324 + (*if*) 1 < length path (*then*);
1.325 +
1.326 + scan_up1 pcct (ist |> path_up) (TermC.sub_at (path_up' path) prog);
1.327 +"~~~~~ and scan_up1 , args:"; val (pcct, ist, (Const ("Tactical.Try"(*2*), _) $ _))
1.328 + = (pcct, (ist |> path_up), (TermC.sub_at (path_up' path) prog));
1.329 +
1.330 + go_scan_up1 pcct ist;
1.331 +"~~~~~ and go_scan_up1 , args:"; val ((pcct as (prog, _)), (ist as {path, ...}))
1.332 + = (pcct, ist);
1.333 + (*if*) 1 < length path (*then*);
1.334 +
1.335 + scan_up1 pcct (ist |> path_up) (TermC.sub_at (path_up' path) prog);
1.336 +"~~~~~ and scan_up1 , args:"; val ((pcct as (prog, cct as (cstate, _, _))), ist,
1.337 + (Const ("Tactical.Chain"(*3*), _) $ _ ))
1.338 + = (pcct, (ist |> path_up), (TermC.sub_at (path_up' path) prog));
1.339 + val e2 = check_Seq_up ist prog
1.340 +;
1.341 + (*case*) scan_dn1 cct (ist |> path_up_down [R] |> set_or ORundef) e2 (*of*);
1.342 +"~~~~~ fun scan_dn1 , args:"; val (yyy, ist, (Const ("Tactical.Chain"(*2*), _) $ e1 $ e2))
1.343 + = (cct, (ist |> path_up_down [R] |> set_or ORundef), e2);
1.344 +
1.345 + (*case*) scan_dn1 cct (ist |> path_down [L, R]) e1 (*of*);
1.346 +"~~~~~ fun scan_dn1 , args:"; val (xxx, ist, (Const ("Tactical.Try"(*2*), _) $ e))
1.347 + = (cct, (ist |> path_down [L, R]), e1);
1.348 +
1.349 + (*case*) scan_dn1 cct (ist |> path_down [R]) e (*of*);
1.350 + (*======= end of scanning tacticals, a leaf =======*)
1.351 +"~~~~~ fun scan_dn1 , args:"; val ((cct as (_, ctxt, _)), (ist as {eval, ...}), t)
1.352 + = (cct, (ist |> path_down [R]), e);
1.353 + (*if*) Tactical.contained_in t (*else*);
1.354 + val (Program.Tac prog_tac, form_arg) = (*case*)
1.355 + LItool.check_leaf "locate" ctxt eval (get_subst ist) t (*of*);
1.356 +
1.357 + check_tac1 cct ist (prog_tac, form_arg);
1.358 +"~~~~~ fun check_tac1 , args:"; val (((pt, p), ctxt, tac), (ist as {act_arg, or, ...}), (prog_tac, form_arg)) =
1.359 + (cct, ist, (prog_tac, form_arg));
1.360 +val LItool.Not_Associated = (*case*)
1.361 + LItool.associate pt ctxt (tac, prog_tac) (*of*);
1.362 + val _(*ORundef*) = (*case*) or (*of*);
1.363 + val Applicable.Yes m' =
1.364 + (*case*) Solve_Step.check (LItool.tac_from_prog pt (ThyC.get_theory "Isac_Knowledge") prog_tac) (pt, p) (*of*);
1.365 +
1.366 + Reject_Tac1 (ist |> set_subst_false (form_arg, Tactic.result m'), ctxt, tac)
1.367 + (*return from check_tac1*);
1.368 +"~~~~~ from fun check_tac1 \<longrightarrow>fun scan_dn1 \<longrightarrow>fun scan_dn1 \<longrightarrow>fun locate_input_tactic , return:"; val (Reject_Tac1 _) =
1.369 + (Reject_Tac1 (ist |> set_subst_false (form_arg, Tactic.result m'), ctxt, tac));
1.370 +
1.371 +(*/----- original before child of 7e314dd233fd -------------------------------------------------\* )
1.372 + val (Program.Tac prog_tac, form_arg) = (*case*) check_leaf "locate" ctxt eval (get_subst ist) t (*of*);
1.373 + val Not_Associated = (*case*) associate pt ctxt (tac, stac) (*of*);
1.374 + val ORundef = (*case*) or (*of*);
1.375 + val Applicable.No "norm_equation not applicable" =
1.376 + (*case*) Solve_Step.check (LItool.tac_from_prog pt (ThyC.get_theory "Isac_Knowledge") stac) (pt, p) (*of*);
1.377 +
1.378 + (Term_Val1 act_arg) (* return value *);
1.379 +
1.380 +val Rewrite' ("PolyMinus", "tless_true", _, _, ("tausche_minus",_ (*"?b ist_monom \<Longrightarrow> ?a kleiner ?b \<Longrightarrow> ?b - ?a = - ?a + ?b"*)),
1.381 + t, (res, asm)) = m;
1.382 +
1.383 +if pstate2str ist =
1.384 + "([\"\n(t_t, 5 * e + 6 * f - 8 * g - 9 - 7 * e - 4 * f + 10 * g + 12)\"], [R,L,R,R,L,R,R], empty, SOME t_t, \n" ^
1.385 + "- (8 * g) + (- 9 + 12 + 5 * e - 7 * e + (6 - 4) * f) + 10 * g, ORundef, true, false)"
1.386 +andalso
1.387 + UnparseC.term t = "- (8 * g) + (- 9 + 12 + 5 * e - 7 * e + (6 - 4) * f) + 10 * g"
1.388 +andalso
1.389 + UnparseC.term res = "- (8 * g) + (- 9 + 12 + 5 * e - 7 * e + (- 4 + 6) * f) + 10 * g"
1.390 +andalso
1.391 + UnparseC.terms asm = "[\"4 kleiner 6\",\"6 ist_monom\"]"
1.392 +then () else error "locate_input_tactic Helpless, but applicable CHANGED";
1.393 +( *\----- original before child of 7e314dd233fd -------------------------------------------------/*)
1.394 +
1.395 +
1.396 +\<close> ML \<open>
1.397 +"----------- re-build: fun find_next_step, mini ------------------------------------------------";
1.398 +"----------- re-build: fun find_next_step, mini ------------------------------------------------";
1.399 +"----------- re-build: fun find_next_step, mini ------------------------------------------------";
1.400 +val fmz = ["Term (a + a ::real)", "normalform n_n"];
1.401 +val (dI',pI',mI') = ("Poly",["polynomial", "simplification"],["simplification", "for_polynomials"]);
1.402 +val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
1.403 +(*[], Pbl*)val (_, ([(tac, _, _)], _, (pt, p))) = Step.do_next p ((pt, Pos.e_pos'), []);(*Model_Problem*)
1.404 +(*[], Pbl*)val (_, ([(tac, _, _)], _, (pt, p))) = Step.do_next p ((pt, Pos.e_pos'), []);(*Specify_Theory "Poly"*)
1.405 +(*[], Pbl*)val (_, ([(tac, _, _)], _, (pt, p))) = Step.do_next p ((pt, Pos.e_pos'), []);(*Specify_Problem ["polynomial", "simplification"]*)
1.406 +(*[], Met*)val (_, ([(tac, _, _)], _, (pt, p))) = Step.do_next p ((pt, e_pos'), []);(*Specify_Method ["simplification", "for_polynomials"]*)
1.407 +(*1], Frm*)val (_, ([(tac, _, _)], _, (pt, p))) = Step.do_next p ((pt, e_pos'), []);(*Apply_Method ["simplification", "for_polynomials"]*)
1.408 +(*[1], Res*)val (_, ([(tac'''''_', _, _)], _, (pt'''''_', p'''''_'))) =
1.409 +
1.410 + Step.do_next p ((pt, e_pos'), []);(*Rewrite_Set "norm_Poly"*)
1.411 +\<close> ML \<open>
1.412 +(*//------------------ go into 1 ------------------------------------------------------------\\*)
1.413 +"~~~~~ fun do_next , args:"; val ((ip as (_, p_)), (ptp as (pt, p), tacis))
1.414 + = (p, ((pt, e_pos'), []));
1.415 + val pIopt = Ctree.get_pblID (pt, ip);
1.416 + (*if*) ip = ([], Res) (*else*);
1.417 + val _ = (*case*) tacis (*of*);
1.418 + val SOME _ = (*case*) pIopt (*of*);
1.419 + (*if*) member op = [Pos.Pbl, Pos.Met] p_ (*else*);
1.420 +
1.421 +val ("ok", ([(Rewrite_Set "norm_Poly", _, _)], _, (_, ([1], Res)))) =
1.422 +Step_Solve.do_next (pt, ip);
1.423 +"~~~~~ and do_next , args:"; val (ptp as (pt, pos as (p, p_))) = (pt, ip);
1.424 + (*if*) MethodC.id_empty = get_obj g_metID pt (par_pblobj pt p) (*else*);
1.425 + val thy' = get_obj g_domID pt (par_pblobj pt p);
1.426 + val ((ist, ctxt), sc) = LItool.resume_prog thy' (p,p_) pt;
1.427 +
1.428 +val Next_Step (_, _, Rewrite_Set' ("Poly", _, Rule_Set.Sequence {id = "norm_Poly", ...}, _, _)) =
1.429 + LI.find_next_step sc (pt, pos) ist ctxt (*of*);
1.430 +"~~~~~ fun find_next_step , args:"; val ((Rule.Prog prog), (ptp as(pt, (p, _))), (Pstate ist), ctxt)
1.431 + = (sc, (pt, pos), ist, ctxt);
1.432 +
1.433 +val Accept_Tac (Rewrite_Set' ("Poly", _, Rule_Set.Sequence {id = "norm_Poly", ...}, _, _), _, _) =
1.434 + (*case*) scan_to_tactic (prog, (ptp, ctxt)) (Pstate ist) (*of*);
1.435 +"~~~~~ fun scan_to_tactic , args:"; val ((prog, cc), (Pstate (ist as {path, ...})))
1.436 + = ((prog, (ptp, ctxt)), (Pstate ist));
1.437 + (*if*) path = [] (*then*);
1.438 +
1.439 +val Accept_Tac (Rewrite_Set' ("Poly", _, Rule_Set.Sequence {id = "norm_Poly", ...}, _, _), _, _) =
1.440 + scan_dn cc (trans_scan_dn ist) (Program.body_of prog);
1.441 +"~~~~~ fun scan_dn , args:"; val ((cc as (_, ctxt)), (ist as {eval, ...}), t)
1.442 + = (cc, (trans_scan_dn ist), (Program.body_of prog));
1.443 + (*if*) Tactical.contained_in t (*else*);
1.444 + val (Program.Tac prog_tac, form_arg) = (*case*) LItool.check_leaf "next " ctxt eval (get_subst ist) t (*of*);
1.445 +
1.446 +val Accept_Tac (Rewrite_Set' ("Poly", _, Rule_Set.Sequence {id = "norm_Poly", ...}, _, _), _, _) =
1.447 + check_tac cc ist (prog_tac, form_arg) (*return from xxx*);
1.448 +"~~~~~ from fun scan_dn\<longrightarrow>fun scan_to_tactic\<longrightarrow>fun find_next_step, return:"; val (Accept_Tac (tac, ist, ctxt))
1.449 + = (check_tac cc ist (prog_tac, form_arg));
1.450 +
1.451 + Next_Step (Pstate ist, Tactic.insert_assumptions tac ctxt, tac) (*return from find_next_step*);
1.452 +"~~~~~ from fun find_next_step\<longrightarrow>and do_next\<longrightarrow>fun zzz, return:"; val (Next_Step (ist, ctxt, tac))
1.453 + = (Next_Step (Pstate ist, Tactic.insert_assumptions tac ctxt, tac));
1.454 +
1.455 + LI.by_tactic tac (ist, Tactic.insert_assumptions tac ctxt) ptp (*return from and do_next*);
1.456 +"~~~~~ from and do_next\<longrightarrow>fun do_next\<longrightarrow>toplevel, return:"; val (_, ([(tac''''', _, _)], _, (pt''''', p''''')))
1.457 + = (LI.by_tactic tac (ist, Tactic.insert_assumptions tac ctxt) ptp);
1.458 +(*\\------------------ end of go into 1 -----------------------------------------------------//*)
1.459 +
1.460 +(*[], Res*)val (_, ([(tac''''', _, _)], _, (pt''''', p'''''))) =
1.461 +
1.462 + Step.do_next p'''''_' ((pt'''''_', Pos.e_pos'), []);(* Check_Postcond ["polynomial", "simplification"]*)
1.463 +(*//------------------ go into 2 ------------------------------------------------------------\\*)
1.464 +"~~~~~ fun do_next , args:"; val ((ip as (_, p_)), (ptp as (pt, p), tacis))
1.465 + = (p''''', ((pt''''', e_pos'), []));
1.466 + val pIopt = Ctree.get_pblID (pt, ip);
1.467 + (*if*) ip = ([], Res) (*else*);
1.468 + val _ = (*case*) tacis (*of*);
1.469 + val SOME _ = (*case*) pIopt (*of*);
1.470 + (*if*) member op = [Pos.Pbl, Pos.Met] p_ (*else*);
1.471 +
1.472 +val ("ok", ([(Check_Postcond ["polynomial", "simplification"], _, _)], _, (_, ([], Res)))) =
1.473 +Step_Solve.do_next (pt, ip);
1.474 +"~~~~~ and do_next , args:"; val (ptp as (pt, pos as (p, p_))) = (pt, ip);
1.475 + (*if*) MethodC.id_empty = get_obj g_metID pt (par_pblobj pt p) (*else*);
1.476 + val thy' = get_obj g_domID pt (par_pblobj pt p);
1.477 + val ((ist, ctxt), sc) = LItool.resume_prog thy' (p,p_) pt;
1.478 +
1.479 + (** )val End_Program (ist, tac) =
1.480 + ( *case*) LI.find_next_step sc (pt, pos) ist ctxt (*of*);
1.481 +"~~~~~ fun find_next_step , args:"; val ((Rule.Prog prog), (ptp as(pt, (p, _))), (Pstate ist), ctxt)
1.482 + = (sc, (pt, pos), ist, ctxt);
1.483 +
1.484 +(* val Term_Val (Const ("Groups.times_class.times", _) $ Free ("2", _) $ Free ("a", _))*)
1.485 + (** )val Term_Val prog_result =
1.486 + ( *case*) scan_to_tactic (prog, (ptp, ctxt)) (Pstate ist) (*of*);
1.487 +"~~~~~ fun scan_to_tactic , args:"; val ((prog, cc), (Pstate (ist as {path, ...})))
1.488 + = ((prog, (ptp, ctxt)), (Pstate ist));
1.489 + (*if*) path = [] (*else*);
1.490 +
1.491 + go_scan_up (prog, cc) (trans_scan_up ist |> set_found);
1.492 +"~~~~~ fun go_scan_up , args:"; val ((pcc as (sc, _)), (ist as {path, act_arg, found_accept, ...}))
1.493 + = ((prog, cc), (trans_scan_up ist(*|> set_found !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! *)));
1.494 + (*if*) path = [R] (*then*);
1.495 + (*if*) found_accept = true (*then*);
1.496 +
1.497 + Term_Val act_arg (*return from go_scan_up*);
1.498 +"~~~~~ from fun go_scan_up\<longrightarrow>fun scan_to_tactic, return:"; val (Term_Val prog_result) = (Term_Val act_arg);
1.499 +
1.500 + Term_Val prog_result (*return from scan_to_tactic*);
1.501 +"~~~~~ from fun scan_to_tactic\<longrightarrow>fun find_next_step, return:"; val (Term_Val prog_result) = (Term_Val prog_result);
1.502 + val (true, p', _) = (*case*) parent_node pt p (*of*);
1.503 + val (_, pblID, _) = get_obj g_spec pt p';
1.504 +
1.505 + End_Program (Pstate ist, Tactic.Check_Postcond' (pblID, prog_result))
1.506 + (*return from find_next_step*);
1.507 +"~~~~~ from fun find_next_step\<longrightarrow>and do_next\<longrightarrow>fun zzz, return:"; val (End_Program (ist, tac))
1.508 + = (End_Program (Pstate ist, Tactic.Check_Postcond' (pblID,prog_result)));
1.509 + val _ = (*case*) tac (*of*);
1.510 +
1.511 +val ("ok", ([(Check_Postcond ["polynomial", "simplification"], _, _)], _, (_, ([], Res))))
1.512 + = LI.by_tactic tac (ist, ctxt) ptp (*return from and do_next*);
1.513 +"~~~~~ from and do_next\<longrightarrow>top level, return:"; val (_, ([(tac''''', _, _)], _, (pt''''', p''''')))
1.514 + = (LI.by_tactic tac (ist, ctxt) ptp);
1.515 +(*\\------------------ end of go into 2 -----------------------------------------------------//*)
1.516 +
1.517 +(*[], Und*)val (msg, ([], _, (pt, p))) = Step.do_next p''''' ((pt''''', Pos.e_pos'), []);(**)
1.518 +
1.519 +Test_Tool.show_pt_tac pt; (*[
1.520 +([], Frm), Simplify (a + a)
1.521 +. . . . . . . . . . Apply_Method ["simplification", "for_polynomials"],
1.522 +([1], Frm), a + a
1.523 +. . . . . . . . . . Rewrite_Set "norm_Poly",
1.524 +([1], Res), 2 * a
1.525 +. . . . . . . . . . Check_Postcond ["polynomial", "simplification"],
1.526 +([], Res), 2 * a]*)
1.527 +
1.528 +(*/--- final test ---------------------------------------------------------------------------\\*)
1.529 +val (res, asm) = (get_obj g_result pt (fst p));
1.530 +if UnparseC.term res = "2 * a" andalso map UnparseC.term asm = []
1.531 +andalso p = ([], Und) andalso msg = "end-of-calculation"
1.532 +andalso pr_ctree pr_short pt = ". ----- pblobj -----\n1. a + a\n"
1.533 +then
1.534 + case tac''''' of Check_Postcond ["polynomial", "simplification"] => ()
1.535 + | _ => error "re-build: fun find_next_step, mini 1"
1.536 +else error "re-build: fun find_next_step, mini 2"
1.537 +
1.538 +
1.539 +\<close> ML \<open>
1.540 +"----------- re-build: fun locate_input_term ---------------------------------------------------";
1.541 +"----------- re-build: fun locate_input_term ---------------------------------------------------";
1.542 +"----------- re-build: fun locate_input_term ---------------------------------------------------";
1.543 +(*cp from inform.sml
1.544 + ----------- appendFormula: on Res + late deriv ------------------------------------------------*)
1.545 +val fmz = ["equality (x+1=(2::real))", "solveFor x", "solutions L"];
1.546 +val (dI',pI',mI') = ("Test", ["sqroot-test", "univariate", "equation", "test"],
1.547 + ["Test", "squ-equ-test-subpbl1"]);
1.548 +val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
1.549 +val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1.550 +val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1.551 +val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1.552 +val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1.553 +val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1.554 +val (p,_,f,nxt,_,pt) = me nxt p [] pt;
1.555 +(*[], Met*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*Apply_Method ["Test", "squ-equ-test-subpbl1"]*);
1.556 +
1.557 +(*[1], Frm*)val (p,_,f,nxt,_,pt) = me nxt p [] pt;(*Rewrite_Set "norm_equation"*)
1.558 +(*+*)if f2str f = "x + 1 = 2" then () else error "locate_input_term at ([1], Frm) CHANGED";
1.559 +
1.560 +(*[1], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt;(*Rewrite_Set "Test_simplify"*)
1.561 +(*+*)if f2str f = "x + 1 + - 1 * 2 = 0" then () else error "locate_input_term at ([1], Frm) CHANGED";
1.562 +
1.563 +Test_Tool.show_pt_tac pt; (*[
1.564 +([], Frm), solve (x + 1 = 2, x)
1.565 +. . . . . . . . . . Apply_Method ["Test", "squ-equ-test-subpbl1"],
1.566 +([1], Frm), x + 1 = 2
1.567 +. . . . . . . . . . Rewrite_Set "norm_equation",
1.568 +([1], Res), x + 1 + - 1 * 2 = 0 ///Check_Postcond..ERROR*)
1.569 +
1.570 +(*//---------- appendFormula 1 "x = 1" \<longrightarrow> Step_Solve.inform \<longrightarrow> LI.locate_input_term ----------\\*)
1.571 +"~~~~~ fun appendFormula , args:"; val ((*cI, *) ifo: TermC.as_string) = ((**) "x = 1");
1.572 + val cs = (*get_calc cI*) ((pt, p), [(*nxt, nxt_, (pos, (ist, ctxt))*)])
1.573 + val pos = (*get_pos cI 1*) p
1.574 +
1.575 +(*+*)val ptp''''' = (pt, p);
1.576 +(*+*)if snd ptp''''' = ([1], Res) then () else error "old_cs changed";
1.577 +(*+*)Test_Tool.show_pt_tac pt; (*[
1.578 +(*+*)([], Frm), solve (x + 1 = 2, x)
1.579 +(*+*). . . . . . . . . . Apply_Method ["Test", "squ-equ-test-subpbl1"],
1.580 +(*+*)([1], Frm), x + 1 = 2
1.581 +(*+*). . . . . . . . . . Rewrite_Set "norm_equation",
1.582 +(*+*)([1], Res), x + 1 + - 1 * 2 = 0 ///Check_Postcond*)
1.583 +
1.584 + val ("ok", cs' as (_, _, ptp')) =
1.585 + (*case*) Step.do_next pos cs (*of*);
1.586 +
1.587 +val ("ok", (_(*use in DG !!!*), [], ptp''''' as (pt''''', p'''''))) = (*case*)
1.588 + Step_Solve.by_term ptp' (encode ifo) (*of*);
1.589 +"~~~~~ fun Step_Solve.by_term , args:"; val ((pt, pos as (p, _)), istr)
1.590 + = (ptp', (encode ifo));
1.591 + val SOME f_in =
1.592 + (*case*) TermC.parse (ThyC.get_theory "Isac_Knowledge") istr (*of*);
1.593 + val f_in = Thm.term_of f_in
1.594 + val pos_pred = lev_back(*'*) pos
1.595 + val f_pred = Ctree.get_curr_formula (pt, pos_pred);
1.596 + val f_succ = Ctree.get_curr_formula (pt, pos);
1.597 + (*if*) f_succ = f_in (*else*);
1.598 + val NONE =
1.599 + (*case*) CAS_Cmd.input f_in (*of*);
1.600 +
1.601 +(*old* ) val (_, _, metID) = get_obj g_spec pt (par_pblobj pt p)
1.602 +(*old*) val {scr = prog, ...} = MethodC.from_store metID
1.603 +(*old*) val istate = get_istate_LI pt pos
1.604 +(*old*) val ctxt = get_ctxt pt pos
1.605 + val LI.Found_Step (cstate'''''_', _(*istate*), _(*ctxt*)) = (*case*)
1.606 + LI.locate_input_term prog (pt, pos) istate ctxt f_in (*of*);
1.607 +"~~~~~ fun locate_input_term , args:"; val ((Rule.Prog _), ((pt, pos) : Calc.T), (_ : Istate.T), (_ : Proof.context), tm)
1.608 + = (prog, (pt, pos), istate, ctxt, f_in);
1.609 +( *old*)
1.610 +
1.611 +(*NEW*) LI.locate_input_term (pt, pos) f_in (*of*);
1.612 +"~~~~~ fun locate_input_term , args:"; val ((pt, pos), tm) = ((pt, pos), f_in);
1.613 + val pos_pred = Pos.lev_back' pos (*f_pred ---"step pos cs"---> f_succ in appendFormula*)
1.614 +
1.615 + val ("ok", (_, _, cstate as (pt', pos'))) =
1.616 + (*case*) compare_step ([], [], (pt, pos_pred)) tm (*of*);
1.617 +
1.618 +(*old* )
1.619 + Found_Step (cstate, get_istate_LI pt' pos', get_ctxt pt' pos') (*return from locate_input_term*);
1.620 +( *old*)
1.621 +(*NEW*) Found_Step cstate (*return from locate_input_term*);
1.622 + (*LI.Found_Step ( *)cstate(*, _(*istate*), _(*ctxt*))( *return from locate_input_term*);
1.623 +"~~~~~ from fun locate_input_term\<longrightarrow>fun Step_Solve.by_term, return:"; val ("ok", (_(*use in DG !!!*), c, ptp as (_, p)))
1.624 + = (("ok" , ([], [], cstate (* already contains istate, ctxt *))));
1.625 +
1.626 + ("ok", ((*_ use in DG !!!,*) c, ptp(* as (_*), p))(*)*)(*return from Step_Solve.by_term*);
1.627 +"~~~~~ from fun Step_Solve.by_term\<longrightarrow>(fun appendFormula)!toplevel, return:"; val ("ok", (_(*use in DG !!!*), [], ptp''''' as (pt''''', p''''')))
1.628 + = ("ok", ([], [], ptp));
1.629 +
1.630 +(*fun me requires nxt...*)
1.631 + Step.do_next p''''' (ptp''''', []);
1.632 + val ("ok", ([(nxt'''''_' as Check_Postcond ["LINEAR", "univariate", "equation", "test"], _, _)], _,
1.633 + (pt'''''_', p'''''_'))) = Step.do_next p''''' (ptp''''', [])
1.634 +(*\\---------- appendFormula 1 "x = 1" \<longrightarrow> Step_Solve.inform \<longrightarrow> LI.locate_input_term ----------//*)
1.635 +
1.636 +(*//----- REPLACED BY appendFormula 1 "x = 1" \<longrightarrow> Step_Solve.inform \<longrightarrow> LI.locate_input_term -----\\* )
1.637 + (*[2], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Subproblem ("Test", ["LINEAR", "univariate", "equation", "test"])*)
1.638 + (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Model_Problem*)
1.639 + (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Add_Given "equality (- 1 + x = 0)"*)
1.640 + (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Add_Given "solveFor x"*)
1.641 + (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Add_Find "solutions x_i"*)
1.642 + (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Specify_Theory "Test"*)
1.643 + (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Specify_Problem ["LINEAR", "univariate", "equation", "test"]*)
1.644 + (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Specify_Method ["Test", "solve_linear"]*)
1.645 + (*[3], Met*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Apply_Method ["Test", "solve_linear"]*)
1.646 + (*[3, 1], Frm*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Rewrite_Set_Inst (["(''bdv'', x)"], "isolate_bdv")*)
1.647 + (*[3, 1], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Rewrite_Set "Test_simplify"*)
1.648 + (*[3, 2], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Check_Postcond ["LINEAR", "univariate", "equation", "test"]*)
1.649 +( *\\----- REPLACED BY appendFormula 1 "x = 1" \<longrightarrow> Step_Solve.inform \<longrightarrow> LI.locate_input_term -----//*)
1.650 +
1.651 + (*[3], Res*)val (p,_,f,nxt,_,pt) = me nxt'''''_' p'''''_' [] pt'''''_'; (*nxt = Check_elementwise "Assumptions"*)
1.652 + (*[4], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Check_Postcond ["sqroot-test", "univariate", "equation", "test"]*)
1.653 + (*[], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = End_Proof'*)
1.654 +
1.655 +(*/--- final test ---------------------------------------------------------------------------\\*)
1.656 +if p = ([], Res) andalso f2str f = "[x = 1]" andalso pr_ctree pr_short pt =
1.657 + ". ----- pblobj -----\n" ^
1.658 + "1. x + 1 = 2\n" ^
1.659 + "2. x + 1 + - 1 * 2 = 0\n" ^
1.660 + "3. ----- pblobj -----\n" ^
1.661 + "3.1. - 1 + x = 0\n" ^
1.662 + "3.2. x = 0 + - 1 * - 1\n" ^
1.663 + "3.2.1. x = 0 + - 1 * - 1\n" ^
1.664 + "3.2.2. x = 0 + 1\n" (*ATTENTION: see complete Calc below*)
1.665 +then case nxt of End_Proof' => () | _ => error "re-build: fun locate_input_term CHANGED 1"
1.666 +else error "re-build: fun locate_input_term CHANGED 2";
1.667 +
1.668 +Test_Tool.show_pt_tac pt; (*[
1.669 +([], Frm), solve (x + 1 = 2, x)
1.670 +. . . . . . . . . . Apply_Method ["Test", "squ-equ-test-subpbl1"],
1.671 +([1], Frm), x + 1 = 2
1.672 +. . . . . . . . . . Rewrite_Set "norm_equation",
1.673 +([1], Res), x + 1 + - 1 * 2 = 0
1.674 +. . . . . . . . . . Rewrite_Set "Test_simplify",
1.675 +([2], Res), - 1 + x = 0
1.676 +. . . . . . . . . . Subproblem (Test, ["LINEAR", "univariate", "equation", "test"]),
1.677 +([3], Pbl), solve (- 1 + x = 0, x)
1.678 +. . . . . . . . . . Apply_Method ["Test", "solve_linear"],
1.679 +([3,1], Frm), - 1 + x = 0
1.680 +. . . . . . . . . . Rewrite_Set_Inst ([(''bdv'', x)], "isolate_bdv"),
1.681 +([3,1], Res), x = 0 + - 1 * - 1
1.682 +. . . . . . . . . . Derive Test_simplify,
1.683 +([3,2,1], Frm), x = 0 + - 1 * - 1
1.684 +. . . . . . . . . . Rewrite ("#: - 1 * - 1 = 1", "- 1 * - 1 = 1"),
1.685 +([3,2,1], Res), x = 0 + 1
1.686 +. . . . . . . . . . Rewrite ("radd_0", "0 + ?k = ?k"),
1.687 +([3,2,2], Res), x = 1
1.688 +. . . . . . . . . . Tactic.input_to_string not impl. for ?!,
1.689 +([3,2], Res), x = 1
1.690 +. . . . . . . . . . Check_Postcond ["LINEAR", "univariate", "equation", "test"],
1.691 +([3], Res), [x = 1]
1.692 +. . . . . . . . . . Check_Postcond ["sqroot-test", "univariate", "equation", "test"],
1.693 +([], Res), [x = 1]]*)
1.694 +
1.695 +\<close> ML \<open>
1.696 +\<close> ML \<open>
1.697 +\<close> ML \<open>
1.698 +\<close> ML \<open>
1.699 +\<close> ML \<open>
1.700 +\<close> ML \<open>
1.701 +\<close> ML \<open>
1.702 +\<close> ML \<open>
1.703 +\<close> ML \<open>
1.704 +\<close>
1.705 ML_file "Interpret/step-solve.sml"
1.706
1.707 ML_file "MathEngine/me-misc.sml"