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